Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <conio.h>
- #include <string>
- #include <math.h>
- #include <algorithm>
- #include <vector>
- #include <set>
- #include <map>
- #include <sstream>
- #include <queue>
- #include <stdint.h>
- using namespace std;
- long long getQforN(long long N)
- {
- if (N == 0)
- return 10;
- else if (N == 1)
- return 1;
- long long Q = 0;
- long long p = 1;
- for (long long div = 9; div > 1; div--)
- {
- while ((N%div) == 0)
- {
- Q += p * div;
- p = p * 10;
- N /= div;
- }
- }
- if (N == 1)
- return Q;
- else
- return -1;
- }
- int main()
- {
- long long N;
- cin >> N;
- cout << getQforN(N) << std::endl;
- _getch();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment