Cod sursa(job #1180082)
Utilizator | Data | 29 aprilie 2014 21:54:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
#include<iostream>
using namespace std;
int i,j,m,n,k,a[2000001];
int main()
{
ifstream f("ciur.in"); ofstream g("ciur.out");
f>>n;
for(i=2;i*i<=n;i++)
if(!a[i])
for(j=2;j*i<=n;j++)
a[i*j] = 1;
for(i=2;i<=n;i++)
if(!a[i]) k++;
g<<k;
f.close(); g.close();
return 0;
}