Pagini recente » Cod sursa (job #563228) | Cod sursa (job #2723873) | Cod sursa (job #2469423) | Cod sursa (job #597308) | Cod sursa (job #1577132)
#include<iostream>
#include<fstream>
//#include<cstdio>
#include<algorithm>
using namespace std;
//*
ifstream si("patrate6.in");
ofstream so("patrate6.out");
//*/
/*
FILE*si=fopen("editor.in","r");
FILE*so=fopen("editor.out","w");
//*/
int ap[100005];
int main()
{
int n;
si>>n;
int i;
for(i=0;i<n;++i)
{
si>>ap[i];
}
sort(ap,ap+n);
int cont=0,fel=0,q,lg=ap[0];
for(i=0;i<n;++i)
{
if(lg==ap[i])
{
cont++;
}
else
{
q=(ap[i]-lg)<<1;
if(((cont>>q)<<q)!=cont)
{
fel=1;
}
cont>>=q;
cont++;
lg=ap[i];
}
}
while(cont>3)
{
cont>>=2;
lg++;
}
if(fel||cont>1)
so<<lg+1;
else
so<<lg;
//fclose(so);
so.close();
return 0;
}