Cod sursa(job #1526284)
Utilizator | Data | 16 noiembrie 2015 08:34:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | 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 n,v[2000000],p=2,k;
int main()
{
in>>n;
for(int i=2;i<=n;i++)
v[i]=1;
for(int i=2;i<=n;i++)
{
if(v[i])
{
k++;
for(int j=i+i;j<=n;j+=i)
v[j]=0;
}
}
out<<k;
return 0;
}