Cod sursa(job #1398526)
Utilizator | Data | 24 martie 2015 11:46:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool v[2000001];
int ciur(int n)
{
int i,sol=1,j;
for(i=3;i<=n;i+=2)
if(!v[i])
{
sol++;
for(j=i;j<=n;j+=i)
v[j]=true;
}
return sol;
}
int main()
{
int n;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
g<<ciur(n);
}