Cod sursa(job #1358033)
| Utilizator | Data | 24 februarie 2015 12:20:42 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
#include<algorithm>
#include<cmath>
#define N 2000100
#define FOR(a,b,c) for(register int a=b;a<=c;++a)
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
const double eul=2.718281828459045235;
int n;
int sol(int x)
{
return (int)log(x)/log(eul);
}
int main ()
{
f>>n;
g<<n/sol(n);
return 0;
}
//Look at me!Look at me!The monster inside me has grown this big!
