Cod sursa(job #828008)
Utilizator | Data | 2 decembrie 2012 21:19:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <math.h>
using namespace std;
int i,g,n,s;
int prime[2000005];
int main()
{
ifstream ka("ciur.in");
ofstream ki("ciur.out");
ka>>n;
for(i=2;i<=sqrt(n);i++)
{
if(prime[i]==0)
{
s++;
for(g=i*i;g<=n;g=g+i)
{
prime[g]=1;
}
}
}
for(i=i;i<=n;i++)
{
if(prime[i]==0)
s++;
}
ki<<s;
}