Cod sursa(job #2456333)
Utilizator | Data | 14 septembrie 2019 10:51:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
char c[2000000];
long long n;
long long ciur(long long n){
long long solutii=0;
for(long long i=2;i<=n;i++){
if(c[i]==0){
solutii++;
for(long long j=i+i;j<=n;j+=i)
c[j]=1;
}
}
return solutii;
}
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
out<<ciur(n);
return 0;
}