Cod sursa(job #622114)
Utilizator | Data | 17 octombrie 2011 14:16:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
#include<fstream>
using namespace std;
bool c[2000001];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,j,n,nr=0;
f>>n;
c[1] = true;
for(i=2;i*i<=n;i++)
{
if(!c[i])
for(j=i*i;j<=n;j+=i)
c[j]=true;
}
for(i=1;i<=n;i++)
if(!c[i])
nr++;
g<<nr;
return 0;
}