Cod sursa(job #869366)
Utilizator | Data | 1 februarie 2013 15:33:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
int x[2000005],n,cont;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(int i=2;i<n;i++)
{
if(x[i]!=1)
{
cont++;
for(int k=i+i;k<=n;k+=i)
{
x[k]=1;
}
}
}
g<<cont;
}