Cod sursa(job #2115685)
Utilizator | Data | 27 ianuarie 2018 00:07:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,v[2000002];
int main()
{
fin>>n;
int i,j,c=0;
for(i = 2; i <= n; i++){
v[i] = 1;
}
for(i = 2; i <= n; i++){
if(v[i]){
c++;
for(j = i+i; j <=n; j++){
v[j] = 0;
}
}
}
fout<<c;
}