Cod sursa(job #2356327)
Utilizator | Data | 26 februarie 2019 16:57:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool p[10000000000];
long long n,i,j,k;
int main()
{
f>>n;
for(i=2;i<=n;i++)
{
if(p[i]==0 && i%2!=0)
{
for(j=i+i;j<=n ;j=j+i)
p[j]=1;
k++;
}
}
g<<k+1;
return 0;
}