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