Cod sursa(job #2385093)
Utilizator | Data | 21 martie 2019 17:03:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
#define ull unsigned long long
#define mod 1999999973
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, v[2000001], nr;
void ciur(int x)
{
for(int i=3; i<=x; i+=2)
{
if(v[i]==0)
{
for(int j=2*i; j<=x; j+=i)
v[j]=1;
nr++;
}
}
}
int main()
{
f>>n;
ciur(n);
g<<nr+1;
return 0;
}