Cod sursa(job #947959)
| Utilizator | Data | 8 mai 2013 21:49:53 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#define IN "ciur.in"
#define OUT "ciur.out"
using namespace std;
ifstream fin(IN);
ofstream fout(OUT);
long long n, sol;
void ciur();
int main()
{
ciur();
return 0;
}
void ciur()
{
fin>>n;
for(int i=2; i<=n; i++)
if(i==2||i==3||i==5||i==7)
sol++;
else if(i%2==0||i%3==0||i%5==0||i%7==0)
;
else sol++;
fout<<sol<<'\n';
}
