Cod sursa(job #1001578)
Utilizator | Data | 25 septembrie 2013 16:34:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int c[2000001];
int n;
int ciur(int n)
{
int i,nr=0;
for(i=2;i<=n;i++)
{
if(c[i]==0)
{
nr++;
for(int j=i*2;j<=n;j+=i)
{
c[j]=1;
}
}
}
return nr;
}
int main()
{
f>>n;
g<<ciur(n);
return 0;
}