Pagini recente » Cod sursa (job #257090) | Cod sursa (job #1578764) | Cod sursa (job #2736150) | Cod sursa (job #790883) | Cod sursa (job #1130707)
#include <fstream>
using namespace std;
int v[2000001];
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n , i , contor = 1, b = -1 , j;
f >> n ;
for(i = 1; i <= n ; ++i)
f >> v[i];
for(i = 1; i < n/2 ; ++i)
{
if(v[i] != -1)
{
for(j = i + 1 ; j <= n ; ++j)
{
if(v[i] == v[j])
{
contor++;
v[j] = -1 ;
}
if(j == n / 2 && contor + n / 2 <(n / 2 + 1) )
j = n + 1;
}
if(contor >= (n / 2 + 1))
{
g << v[i] << " " << contor ;
b = 0 ;
contor = 1;
i = n + 1 ;
}
else
contor = 1;
}
}
if(b == -1)
g << b ;
}