Cod sursa(job #1337751)
| Utilizator | Data | 9 februarie 2015 14:23:44 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int x[2000005];
int main()
{
int n, i, j;
int ct=0;
fin>> n;
for(i=2; i<=n; i++)
{
x[i]=i;
}
for(j=2; j<=n; j++)
{
if(x[j]!=0)
{
ct++;
for(i=j; i<=n; i+=j)
{
x[i]=0;
}
}
}
fout << ct;
return 0;
}
