Cod sursa(job #1590284)
Utilizator | Data | 4 februarie 2016 20:52:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
long long n;
int v[2000000];
int i;
int main(){
in>>n;
v[1]=1;
for(i=2; i<=n; i++){
v[i]=0;
}
int j, nr;
nr=0;
for(i=2; i<=n; i++){
if(v[i]==0){
for(j=i+1; j<=n; j++){
if(j%i==0){
v[j]=1;
}
}
nr+=1;
}
}
out<<nr;
return 0;
}