Pagini recente » Cod sursa (job #2532298) | Cod sursa (job #2096643) | Cod sursa (job #1118853) | Cod sursa (job #2967448) | Cod sursa (job #650160)
Cod sursa(job #650160)
#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[]){
int i,contor,max,x;contor=max=0;
for(i=0;i<=n-2;i++){
if(v[i]==v[i+1])
contor++;
if(contor>max) {max=contor;x=v[i];}
else
contor=0;
if (max-1>n/2)
return x;}
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);
}