Pagini recente » Cod sursa (job #860370) | Cod sursa (job #1172339) | Cod sursa (job #2398994) | Cod sursa (job #936240) | Cod sursa (job #2187020)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
int n;
int s[100];
f>>n;
int i,j,nr_aparitii=0,nr_aparitii_max=0,i_i;
for(i=1;i<=n;i++){
f>>s[i];
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(s[i]==s[j]){
nr_aparitii++;
}
}
if(nr_aparitii>=nr_aparitii_max){
i_i=i;
nr_aparitii_max=nr_aparitii;
}
nr_aparitii=0;
}
if(nr_aparitii_max>=n/2+1){
g<<s[i_i]<<" "<<nr_aparitii_max;
}
}