Cod sursa(job #3204385)
| Utilizator | Data | 16 februarie 2024 14:55:11 | |
|---|---|---|---|
| Problema | Dtcsu | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream F("dtcsu.in");
ofstream G("dtcsu.out");
long long a[276997];
int main()
{
int n=276997,k,i,t,r;
for(;n--;) {
long long m;
if(F>>m,m&1)
a[k++]=m;
}
int s;
for(sort(a,a+k),s=1;s<k;s<<=1);
for(F>>n;n--;) {
long long 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;
if(a[i]==m)
++r;
}
}
return G<<r,0;
}
