Cod sursa(job #1902470)
Utilizator | Data | 4 martie 2017 16:59:16 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | cadeti | Marime | 0.58 kb |
#include <iostream>
#include <bitset>
#include <fstream>
using namespace std;
int main()
{ int i,j,c=0,prim[100],m=200,n;
bitset<2000000>ciur;
ifstream fin("prime.in");
ofstream fout("prime.out");
for(i=1;i<=m;i++)
ciur[i]=1;
for(i=2;i<=m;i++)
{ if(ciur[i]==1)
{for(j=i+i;j<=m;j=j+i)
ciur[j]=0;
}
}
for(i=2;i<=m;i++)
if(ciur[i]==1) {c++; prim[c]=i;}
fin>>n;
int v[n];
for(i=1;i<=n;i++)
{fin>>v[i];
v[i]=prim[v[i]];}
for(i=1;i<=n;i++)
fout<<v[i]<<endl;
return 0;
}