Cod sursa(job #1500709)
| Utilizator | Data | 12 octombrie 2015 16:45:11 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
const int NMax = 2e6+5;
bool viz[NMax];
int k;
int ciur(int n)
{
for(int i=2;i<=n;i++){
if(viz[i]==0)
{
k++;
for(int j=2*i;j<=n;j=j+i)
viz[j]=1;
}
}
}
int main()
{
int n;
f>>n;
ciur(n);
g<<k;
return 0;
}
