Cod sursa(job #541560)
Utilizator | Diana Iacob ddxd | Data | 25 februarie 2011 12:06:57 |
---|---|---|---|
Problema | Light2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Romanian Master in Mathematics and Sciences 2011, Ziua 1 | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int K,ap[10],i,d[22],a,j;
double N;
ifstream f;
ofstream g;
f.open("light2.in");
g.open("light2.out");
a=0;
f>>N>>K;
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;
}