Cod sursa(job #2372736)
Utilizator | Data | 7 martie 2019 10:49:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,ok;
int v[2000100];
int main()
{
in>>n;
v[0]=v[1]=1;
for(int i=2;i<=n;i++)
if(v[i]==0)
{
ok++;
for(int j=2;i*j<=n;j++)
v[i*j]=1;
}
out<<ok;
return 0;
}