Cod sursa(job #447106)
| Utilizator | Data | 27 aprilie 2010 18:38:27 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<iostream>
#include<fstream>
using namespace std;
int n, i, j, k;
char a[2000002];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2; i<=n; i++)
a[i]=1;
for(i=2; i<=n; i++)
{
if(a[i]==1)
{
k++;
for(j=2*i; j<=n; j=j+i)
a[j]=0;
}
}
fout<<k;
fin.close();
fout.close();
return 0;
}
