Cod sursa(job #847041)
Utilizator | Data | 3 ianuarie 2013 10:55:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,s;
char c[2000006];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(int i=2;i<=n;i++)
if(c[i]==0)
{
s++;
for(int j=2;i*j<=n;j++)
c[j*i]=1;
}
fout<<s;
return 0;
}