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