Cod sursa(job #1922575)
Utilizator | Data | 10 martie 2017 17:56:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
char n,v[2000005];
int ciur(int n){
int ct=1;
for(int i=3;i<=n;i+=2){
if(v[i]==0){
ct++;
for(int j=i+i+i;j<=n;j+=i)
v[j]=1;
}
}
return ct;
}
int main()
{
in>>n;
out<<ciur(n);
return 0;
}