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