Cod sursa(job #279911)
| Utilizator |  Mocanu Valentin wally |
Data | 13 martie 2009 08:53:38 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream.h>
int main ()
{
int i;
long n,k=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
if(2<=n) k++;
if(3<=n) k++;
if(5<=n) k++;
if(7<=n) k++;
for(i=2;i<=n;i++)
if(i%2!=0&&i%3!=0&&i%5!=0&&i%7!=0)
k++;
g<<k;
f.close();
g.close();
return 0;
}