Cod sursa(job #2356367)
Utilizator | Data | 26 februarie 2019 17:17:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool p[2000001];
int n,j,i,np=0;
int main()
{
f>>n;
for(i=2;i<=n;i++)
if(p[i]==0)
{
np++;
for(j=i+i;j<=n;j=j+i)
p[j]=1;
}
g<<np;
return 0;
}