Cod sursa(job #999583)
Utilizator | Data | 20 septembrie 2013 21:15:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
bool v[2000001];
int main(){
int n,i,j,s=0;
ifstream f("ciur.in");
f>>n;
f.close();
for(i=2;i<=n/2;i++){
if(!v[i])
for(j=i+i;j<=n;j+=i){
v[j]=1;
}
}
for(i=2;i<=n;i++)
if(!v[i])
s++;
ofstream g("ciur.out");
g<<s;
return 0;
}