Cod sursa(job #2419548)
Utilizator | Data | 8 mai 2019 19:54:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int v[2000000];
int main()
{
int n, j, i, c=0;
cin>>n;
for(i=2; i<=n; i++)
{
if(v[i]==0)
{for(j=2*i; j<=n; j+=i)
v[j]=-1;
c++;
}
}
cout<<c;
}