Cod sursa(job #1054030)
Utilizator | Data | 13 decembrie 2013 11:26:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include<fstream>
using namespace std;
int v[2000002];
int ciur(int n)
{
int i,j,k=0;
for(i=2;i*i<=n;i++)
if(v[i]!=1)
for(j=i*i;j<=n;j=j+i)
v[j]=1;
for(i=2;i<=n;i++)
if(v[i]==0)
k++;
return k;
}
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>>n;
g<<ciur(n);
return 0;
}