Cod sursa(job #1448293)
Utilizator | Data | 6 iunie 2015 16:27:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
int n, i, j, sol;
char x[2000003];
ifstream in("ciur.in");
ofstream out("ciur.out");
int main(){
in>>n;
for(i=2; i<n; i++){
if(x[i]==0){
sol++;
for(j=i+i; j<=n; j+=i)
x[j]=1;
}
}
out<<sol;
return 0;
}