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