A. Accounting
来源:互联网 发布:mac 梦幻西游手游网页 编辑:程序博客网 时间:2024/05/16 11:34
A long time ago in some far country lived king Copa. After the recent king's reform, he got so large powers that started to keep the books by himself.
The total income A of his kingdom during 0-th year is known, as well as the total income B during n-th year (these numbers can be negative — it means that there was a loss in the correspondent year).
King wants to show financial stability. To do this, he needs to find common coefficient X — the coefficient of income growth during one year. This coefficient should satisfy the equation:
Surely, the king is not going to do this job by himself, and demands you to find such number X.
It is necessary to point out that the fractional numbers are not used in kingdom's economy. That's why all input numbers as well as coefficient X must be integers. The number X may be zero or negative.
The input contains three integers A, B, n (|A|,?|B|?≤?1000, 1?≤?n?≤?10).
Output the required integer coefficient X, or ?No solution?, if such a coefficient does not exist or it is fractional. If there are several possible solutions, output any of them.
2 18 2
3
-1 8 3
-2
0 0 10
5
1 16 5
No solution
/* ***********************************************
Author :
Created Time :2015/6/14 9:23:25
File Name :7.cpp
************************************************ */
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <iomanip>
#include <list>
#include <deque>
#include <stack>
#define ull unsigned long long
#define ll long long
#define mod 90001
#define INF 1<<30
#define maxn 10000+10
#define cle(a) memset(a,0,sizeof(a))
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
int poww(int a,int b){
int t=1;
for(int i=1;i<=b;i++){
t*=a;
}
return t;
}
int main()
{
#ifndef ONLINE_JUDGE
//freopen("in.txt","r",stdin);
#endif
//freopen("out.txt","w",stdout);
int n,a,b;
while(cin>>a>>b>>n){
if(a==0&&b==0){
cout<<1<<endl;
continue;
}
if(a==0){
puts("No solution");continue;
}
if((b%a)!=0){
puts("No solution");continue;
}
int c=b/a;
int mark=0;
int ans;
if(c>=0)
for(int i=0;i<=c;i++){
if(c==poww(i,n)){
mark=1;
ans=i;
break;
}
}
else for(int i=c;i<=0;i++){
if(c==poww(i,n)){
ans=i;
mark=1;break;
}
}
if(mark)cout<<ans<<endl;
else puts("No solution");
}
return 0;
}
- A. Accounting
- accounting
- 【水整数幂】#30 A. Accounting
- NEUQ 1420: Problem A - Y2K Accounting Bug
- PeachTree Accounting
- Accounting Document
- RADIUS Accounting
- FacePalm Accounting
- accounting assistant
- Documentation\accounting\delay—accounting
- Documentation/accounting/delay-accounting.txt
- Love = Accounting
- Interim-Accounting机制
- Some terms of Accounting
- 微软软件 - Office Accounting
- Payable Accounting process
- Y2K Accounting Bug POJ2586
- Financial Accounting 学习步骤
- A. IQ test
- A. Almost Prime
- A. Next Test
- Oracle内置表二
- A. Spit Problem
- A. Accounting
- A. Worms Evolution
- A. Reconnaissance
- 重新认识——CSS Position定位
- A. What is for dinner?
- 设计模式:建造者模式(Builder)
- A. Reconnaissance 2
- A. Shell Game
- A. Extra-terrestrial Intelligence