Cod sursa(job #1550930)
Utilizator | Data | 14 decembrie 2015 22:21:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, i,c, m;
bool v[2000001];
int main()
{
f>>n;
m=0;
v[1]=1;
for (i=2;i<=n;i++)
{
if(v[i]==0)
for(c=i*2;c<=n;c=c+i)
v[c]=1;
}
for(i=2;i<=n;i++)
if (v[i]==0)
m++;
g<<m;
return 0;
}