Cod sursa(job #547639)
Utilizator | Data | 6 martie 2011 16:11:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<iostream>
#include<fstream>
using namespace std;
char x[2000009];
long long n,i,j;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=1;i<=n;i++)
x[i]=1;
int cont=0;
for( i=2;i<=n;i++)
if(x[i]==1)
{
for(j=i;j<=n;j=j+i)
x[j]=0;
cont++;
}
g<<cont;
}