Cod sursa(job #1415309)
| Utilizator | Data | 4 aprilie 2015 11:03:27 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
int n, i, j, v[2000010], cnt;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main(){
fin>>n;
for(i=2;i<=n;i++){
if(v[i] == 0){
cnt++;
for(j=i+i;j<=n;j+=i){
v[j] = 1;
}
}
}
fout<<cnt;
}
