Cod sursa(job #1978794)
| Utilizator | Data | 8 mai 2017 20:25:22 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("treicc.in");
ofstream g("treicc.out");
int x,n,k,ok=1;
int pr(int x)
{int nr=0;
while(x>10)
{if((x%10)%2==(x/10%10)%2) nr++;
else nr=0;
if(nr==2) return 0;
x/=10;
}
return 1;
}
int main()
{f>>n>>k;
int d=1,c,i,j,q=0;
while(n>1) {d*=10;
n--;}
for(i=1;i<=k;i++)
{f>>c;
ok=1;
for(j=d;j<=d*10 && ok;j++)
{if(pr(j))
q++;
if(q==c) {g<<j<<'\n';
ok=0;}
}
d=j;}
return 0;}
