Cod sursa(job #1028664)
Utilizator | Data | 14 noiembrie 2013 15:33:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[2000000];
int main()
{
int i,nr,n;
f >>n;
nr=0;
for(i=2;i<=n;++i){
if(v[i]==0){
for(int j=i+i;j<=n;j+=i){
v[j]=1;
}
}
}
for(i=2;i<=n;++i){
if(v[i]==0)
nr++;
}
g <<nr;
return 0;
}