Cod sursa(job #2380801)
Utilizator | Data | 15 martie 2019 15:22:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int v[2000001];
int main()
{
long long n,i,j,k,m=0;
in>>n;
for(i=2; i<=n; i++)
{
if(v[i]==0)
{
for(j=2*i; j<=n; j+=i)
{
v[j]++;
}
m++;
}
}
out<<m;
return 0;
}