Cod sursa(job #2133043)
Utilizator | Data | 16 februarie 2018 14:55:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<fstream>
using namespace std;
int prim[2000001];
int main(){
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,r=0;
cin>>n;
prim[1]=1;
for(int i=1;i<=n;++i){
if(prim[i]==0){
r=r+1;
for(int j=i+i;j<=n;j+=i){
prim[j]=1;
}
}
}
cout<<r;
return 0;
}