A, B, n = map(int, input().split())
if B != 0 and A / B > 0:
X = (B / A) ** (1 / n)
if abs(X - round(X)) < 0.0000001:
print(round(X))
else:
print('No solution')
elif B != 0 and A == 0:
print('No solution')
elif B != 0 and A / B < 0:
if n % 2 == 0:
print('No solution')
elif n % 2 == 1:
X = (B / A) ** (1 / n)
if abs(round(abs(X)) - abs(X)) <0.0000001:
print(-round(abs(X)))
else:
print('No solution')
elif B == 0:
if A == 0:
print(1)
else:
print(0)#include <bits/stdc++.h>
using namespace std;
int main() {
long long a,b,n;
cin>>a>>b>>n;
for(int i=0;i<1000006;i++)
{
long long x=i;
for(int j=1;j<n;j++)
{
x*=i;
}
if(a*x==b)
{
cout<<i;
exit(0);
}
x=0-i;
for(int j=1;j<n;j++)
{
x*=0-i;
}
if(a*x==b)
{
cout<<0-i;
exit(0);
}
}
cout<<"No solution";
return 0;
}/*1691457485.5678303*/ 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |