Cod sursa(job #675634)
Utilizator | Data | 7 februarie 2012 21:08:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream>
#define dim 2000001
using namespace std;
int n,i,j,nr;
char a[dim];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
{
if(!a[i])
{
nr++;
for(j=i+i;j<=n;j+=i)
a[j]=1;
}
}
g<<nr;
}