Cod sursa(job #1490937)
Utilizator | Data | 24 septembrie 2015 15:02:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <iostream>
using namespace std;
int n,i,j,c=0;
char v[2000001];
int main() {
ifstream f ("ciur.in");
ofstream g ("ciur.out");
f>>n;
for (i=2;i<=n;i++) {
if (v[i]==0) {
c++;
for (j=i;j<=n;j+=i) {
v[j]=1;
}
}
}
g<<c;
return 0;
}