Pagini recente » Cod sursa (job #1272166) | Cod sursa (job #1723502) | Cod sursa (job #1583599) | Cod sursa (job #1586967) | Cod sursa (job #801780)
Cod sursa(job #801780)
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#define pmax 100000005
using namespace std;
int main() {
ifstream f("fact.in");
ofstream g("fact.out");
int i = 5, j, p, zerouri = 1;
vector <int> puteridecinci;
puteridecinci.push_back(5);
puteridecinci.push_back(5*5);
puteridecinci.push_back(5*5*5);
puteridecinci.push_back(5*5*5*5);
puteridecinci.push_back(5*5*5*5*5);
puteridecinci.push_back(5*5*5*5*5*5);
puteridecinci.push_back(5*5*5*5*5*5*5);
puteridecinci.push_back(5*5*5*5*5*5*5*5);
puteridecinci.push_back(5*5*5*5*5*5*5*5*5);
f>>p;
while(zerouri < p) {
i += 5;
zerouri++;
for(j=0; j<puteridecinci.size() && puteridecinci[j] <= i; j++)
if(i == puteridecinci[j]) zerouri+=j;
}
if(zerouri!=p) i = -1;
if(p==0) i = 1;
if(p==1) i = 5;
cout<<i<<"\n";
g<<i<<"\n";
return 0;
}