Cod sursa(job #2257131)
Utilizator | Data | 9 octombrie 2018 17:57:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream c("ciur.in");
ofstream a("ciur.out");
int main()
{
long long N,cnt=0;
c>>N;
long long p[N];
for(int i=2;i<=N;i++)
p[i]=1;
for(int i=2;i<=N;i++)
if(p[i])
{
cnt++;
for(int j=i+i;j<=N;j=j+i)
p[j]=0;
}
a<<cnt;
return 0;
}