Cod sursa(job #2023965)
Utilizator | Data | 19 septembrie 2017 18:42:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int main()
{
int n, i, k, prime=0;
in>>n;
v[1]=1;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
prime++;
for(k=i+i;k<=n;k+=i)
v[k]=1;
}
}
out<<prime;
return 0;
}