Cod sursa(job #1005554)
Utilizator | Data | 5 octombrie 2013 11:40:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, i, q, j;
bool v[2000001];
int main() {
fin>>n;
q=0;
v[1]=1;
for(i=1; i<=n; i++){
if(v[i]==0)
for(j=2*i;j<=n;j+=i){
v[j]=1;
}
}
for(i=1; i<=n; i++)
if(v[i]==0)
q++;
fout<<q<<" ";
return 0;
}