Cod sursa(job #660654)
| Utilizator | Data | 13 ianuarie 2012 12:07:12 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
int main()
{
int i,nr=0,n,j;
char ciur[2000001];
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for(i=2; i<=n; i++)
{
if (ciur[i]==0)
{
nr ++;
for (j=i+i;j<=n;j=j+i)
ciur[j]=1;
}
}
out<<nr;
in.close();
out.close();
return 0;
}
