Pagini recente » Cod sursa (job #316627) | Cod sursa (job #1256924) | Rating Jemes Mills (jemesmills_661) | Solutii Summer Challenge 2007, Runda 3 | Cod sursa (job #1041134)
#include<fstream>
#include<algorithm>
#include<cstring>
#define DIM 100000
#define C 276997
using namespace std;
ofstream g("dtcsu.out");
char s[DIM],ch;
long long nr,v[DIM];
int sol,st,dr,mij,t,nb,i,n;
bool cb(long long x)
{
while(!(x&1))
x>>=1;
st=1; dr=t;
if(x>v[dr])
return 0;
while(st<=dr)
{
mij=(st+dr)>>1;
if(x==v[mij])
return 1;
if(x>v[mij])
st=mij+1;
else
dr=mij-1;
}
return 0;
}
int main ()
{
freopen("dtcsu.in","r",stdin);
fread(s,1,DIM,stdin);
while(s[0])
{
n=strlen(s);
for(i=0;i<n;++i)
{
if(s[i]<='9'&&s[i]>='0')
nr=nr*10+s[i]-'0';
else
{
if(nb>C)
sol+=cb(nr);
else
if(nb==C)
{
sort(v+1,v+t+1);
nb++;
}
else
{
nb++;
if(nr&1)
v[++t]=nr;
}
nr=0;
}
}
ch=0;
scanf("%c",&ch);
if(!ch)
break;
s[0]=ch;
fread(s+1,1,DIM,stdin);
}
g<<sol;
return 0;
}