Cod sursa(job #1511294)
Utilizator | Data | 26 octombrie 2015 12:32:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<iostream.h>
#include<fstream.h>
int x[200000];
int main()
{
int n,nr,i,k=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(nr=2;nr<=n;nr++)
for(i=2*nr;i<=n;i=i+nr)
x[i]=1;
for(i=2;i<=n;i++)
if(x[i]==0) k++;
g<<k;
f.close();
g.close();
}