Cod sursa(job #618158)
Utilizator | Data | 15 octombrie 2011 14:51:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[2000001],i,j,k,n;
int main(){
f>>n;
for(i=2;i<=n;i++){
if(v[i]==0){
k++;
for(j=i+i;j<=n;j+=i){
v[j]=1;
}
}
}
g<<k;
/*
i = 3;
j = i++;
j = ++i;
v = v op x;
v op= x;
*/
f.close();
g.close();
return 0;
}