Mai intai trebuie sa te autentifici.
Cod sursa(job #650168)
Utilizator | Data | 17 decembrie 2011 14:53:18 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.84 kb |
#include <stdio.h>
#define NMAX 100
int sortare(int n,int v[]){
int i,aux;
for (i=0;i<=n-2;i++){
if (v[i]>=v[i+1])
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;}
for(i=0;i<=n-1;i++)
return v[i];
}
int majoritar(int n,int v[]){
sortare(n,v);
int i=0;
while(i<n)
j=i;
while(j<n&&v[j]==v[j+1])
j++;
if(j-i+1>n/2)
return v[i];
i=j+1;
}
return 1;
}
int main(){
FILE *f,*g;
int v[NMAX],n,i;
f=fopen("elmaj.in","r");g=fopen("elmaj.out","w");
fscanf(f,"%d",&n);printf("\n");
for(i=0;i<=n-1;i++)
fscanf(f,"%d",&v[i]);
fprintf(g,"%d",majoritar(n,v));fclose(f);fclose(g);
}