Cod sursa(job #1021287)
| Utilizator | Data | 3 noiembrie 2013 16:46:56 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.26 kb |
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,a[2000000],nr,j;
int main()
{
in>>n;
for(int i=2;i<=n;i++)
if(a[i]==0)
{
nr++;
for(j=i*i;j<=n;j+=i)
a[j]=1;
}
out<<nr;
out.close();
return 0;
}