Cod sursa(job #973670)
Utilizator | Data | 15 iulie 2013 00:15:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include<cmath>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int s,i,j,v[2000001];
double n;
int main()
{
f>>n;
for(i=2;i<=sqrt(n);i++)
{
if(!v[i])
for(j=i;j<=n/i;j++)
{
if(!v[i*j])
s++,v[i*j]++;
}
}
g<<n-(s+1);
return 0;
}