Cod sursa(job #541520)
| Utilizator | Data | 25 februarie 2011 11:55:04 | |
|---|---|---|---|
| Problema | Light2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Romanian Master in Mathematics and Sciences 2011, Ziua 1 | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
int K,ap[10],i,d[10],a,j;
double N;
int main( )
{
ifstream f;
ifstream g;
f.open("Light2.in");
g.open("Light2.out");
a=0;
f>>N>>K;
int minim=0;
if(N<1000000)minim=N;
else minim=1000000;
for(i=1;i<=N;i++)ap[i]=0;
for(i=1;i<=K;i++)
{f>>d[i];
for(j=1;j<=N;j++)
if(j%d[i]==0)ap[j]=!ap[j];
}
for(i=1;i<=N;i++)
if(ap[i]==1)a++;
g<<a;
f.close();
g.close();
return 0;
}
