Cod sursa(job #2133776)
Utilizator | Data | 17 februarie 2018 11:56:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, i, j, v[2000002], sol;
int main(){
fin>>n;
for(i=2; i<=n; i++{
if(v[i]==0){
sol++;
for(j=i+i; j<=n; j=j+i){
v[j]=1;
}
}
}
fout<<sol;
}