Cod sursa(job #642714)
Utilizator | Data | 1 decembrie 2011 22:44:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main() {
int n,cnt=0,i,j;
char prim[20000];
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n; f.close();
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
if(prim[i]) {
cnt++;
for(j=2*i;j<=n;j+=i)
prim[j]=0;
}
g<<cnt; g.close();
return 0;
}