Cod sursa(job #2370877)
Utilizator | Data | 6 martie 2019 14:13:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[2000001],i,j,nr,n;
int main()
{
f>>n;
for(i=2;i<=n;i++)
if(v[i]==0)
for(j=2;j*i<=n;j++)
v[i*j]=1;
for(i=2;i<=n;i++)
if(v[i]==0)
nr++;
g<<nr;
return 0;
}