Cod sursa(job #1415930)
Utilizator | Data | 6 aprilie 2015 21:25:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int v[2000001];
int ciur(int n)
{
int i,j,nr=0;
for(i = 2; i <= n; i++)
{
if(v[i] == 0)
{
nr++;
for(j=i+i; j<= n; j=j+i)
{
v[i*j] = 1;
}
}
}
return nr;
}
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i;
fin>>n; fout<<ciur(n);
}