Cod sursa(job #1502448)
Utilizator | Data | 14 octombrie 2015 17:38:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[2000005];
int main()
{
int i,n,k=1,j;
f>>n;
v[2]=true;
for(i=3;i<=n;i=i+2){
if(v[i]==false){
k++;
for(j=i+i+i;j<=n;j+=i+i){
v[j]=true;
}
}
}
g<<k;
return 0;
}