Cod sursa(job #1983142)
Utilizator | Data | 21 mai 2017 12:57:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<iostream>
#include<fstream>
using namespace std;
int prim[1000001];
int main(){
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,r=0;
f>>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;
}
}
}
g<<r;
return 0;
}