diff options
| author | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-03 15:34:25 +0200 |
|---|---|---|
| committer | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-03 15:34:25 +0200 |
| commit | 96773333434e338d39eeea88bcc6174a139324f0 (patch) | |
| tree | 15533383345998fb4aa6cfdd7c469c750f312092 /NumberTransformation.cpp | |
| parent | fd318b672ef0e61a1753306cb7ec40b69080a2a7 (diff) | |
| download | competitive-programming-96773333434e338d39eeea88bcc6174a139324f0.tar.xz competitive-programming-96773333434e338d39eeea88bcc6174a139324f0.zip | |
Solved Number Transformation on codeforces
Diffstat (limited to 'NumberTransformation.cpp')
| -rw-r--r-- | NumberTransformation.cpp | 31 |
1 files changed, 31 insertions, 0 deletions
diff --git a/NumberTransformation.cpp b/NumberTransformation.cpp new file mode 100644 index 0000000..a16cc9d --- /dev/null +++ b/NumberTransformation.cpp @@ -0,0 +1,31 @@ +#include<bits/stdc++.h> + +using namespace std; + +int main() { + int tt; + cin >> tt; + while(tt--) { + vector<int> v(2); + for(int &x: v){ + cin >> x; + } + int i = 0; + while(true) { + int z = v[1] / v[0]; + i++; + if(v[1] < v[0] || v[1] % v[0] != 0) { + cout << 0 << " " << 0 << '\n'; + break; + } + bool l = int(pow(z, 1.0/i)) == pow(z, 1.0/i); + if(l) { + cout << i << " " << pow(z, 1.0 / i) << '\n'; + break; + } + } + } + + + return 0; +} |
