Cod sursa(job #1561509)
| Utilizator | Data | 4 ianuarie 2016 10:45:19 | |
|---|---|---|---|
| Problema | Dtcsu | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <stdio.h>
#include <map>
#define maxx 276997
using namespace std;
typedef long long int ll;
int n,nr;
ll x;
map <ll,bool> mp;
int main()
{
freopen("dtcsu.in","r",stdin);
freopen("dtcsu.out","w",stdout);
for (int i=1;i<=3;i++) {
scanf("%lld",&x);
if (x%2==1 && (x&(x-1))>0) mp[x]=true;
}
scanf("%d",&n);
for (int i=1;i<=n;i++) {
scanf("%lld",&x);
if (x%2==0 || (x&(x-1))==0 || mp.find(x)!=mp.end()) nr++;
}
printf("%d",nr);
return 0;
}
