Pagini recente » Rezultatele filtrării | Borderou de evaluare (job #2476212) | Borderou de evaluare (job #2648746) | Borderou de evaluare (job #1390552) | Cod sursa (job #3204377)
#include<bits/stdc++.h>
using namespace std;
ifstream F("dtcsu.in");
ofstream G("dtcsu.out");
long long n=276997,s,r,t,i,k,a[276997],m;
int main()
{
for(;n--;)
if(F>>i,i&1)
a[k++]=i;
for(sort(a,a+k),s=1;s<k;s<<=1);
for(F>>n;n--;r+=a[i]==m)
if(F>>m,m)
for(m=m/(m&-m),i=0,t=s;t;t>>=1)
if(i+t<k&&a[i+t]<=m)
i+=t;
return G<<r,0;
}