Cod sursa(job #1552116)
Utilizator | Data | 17 decembrie 2015 11:39:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool q[2000000];
int i,j,n,nr;
int main()
{
fin>>n;
for(i=2;i<=n;++i)
{
for(j=i+1;j<=n;++j)
{
if(j%i==0)
q[j]=1;
}
}
for(i=2;i<=n;++i)
{
if(q[i]==0)
nr++;
}
fout<<nr;
return 0;
}