Cod sursa(job #1309365)
Utilizator | Data | 5 ianuarie 2015 18:19:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int i,n,sol,neprime;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
i=1;
while (2*i<=n)
{
i++;
if (2*i<=n)neprime++;
}
i=1;
while (3*i<=n)
{
i=i+2;
if (3*i<=n) neprime++;
}
g<<n-1-neprime;
return 0;
}