Pagini recente » Istoria paginii runda/wat/clasament | Sandbox (cutiuţa cu năsip) | Istoria paginii runda/temahashuri_9_17_10 | Istoria paginii runda/bun_simulareoji_2007_11-12 | Cod sursa (job #650231)
Cod sursa(job #650231)
#include <stdio.h>
int v[1000000],n,i,x,k;
int main()
{
FILE *f,*g;
f=fopen("elmaj.in","r");
g=fopen("elmaj.out","w");
fscanf(f,"%d",&n);
for(i=0;i<n;i++)
fscanf(f,"%d",&v[i]);
x=v[0]; k=1;
for(i=1;i<n;i++)
{
if(x==v[i]) k++;
else k--;
if(k==0)
{
x=v[i];
k=1;}
}
k=0;
for(i=0;i<n;i++) {
if(x==v[i])
k++;
}
if(k>n/2)
fprintf(g,"%d",x);
else
fprintf(g,"Nu exista maj");
fclose(f);
fclose(g);
return 0;}