Uva 107 The Cat in the Hat
2016-04-05 18:59
330 查看
1 #include <iostream> 2 #include <cmath> 3 using namespace std; 4 int Height,WorkNum; 5 int TotalNum; 6 int AllCatsHeight,mid; 7 int Left = 1,Right=10000; 8 int main() 9 { 10 while(cin>>Height>>WorkNum,Height+WorkNum){ 11 TotalNum = 1; 12 AllCatsHeight = Height; 13 Left = 1,Right=10000000; 14 while(Left){ 15 mid = (Left + Right)/2; 16 if(fabs(log(Height) * log(mid) - log(WorkNum)* log(mid + 1))<=0.00001)break; 17 if(log(Height) * log(mid) - log(WorkNum)* log(mid + 1)>0)Right = mid; 18 else Left = mid; 19 } 20 int Every = 1; 21 while(Height > 1){ 22 Height /= (mid + 1); 23 Every *= mid; 24 AllCatsHeight += (Height * Every); 25 TotalNum += Every; 26 } 27 cout<<TotalNum - WorkNum<<" "<<AllCatsHeight<<endl; 28 } 29 return 0; 30 }
题意就不多说了,就是猫变猫。
做这个题需要的是数学好,,,,思路很简单。
做了好几个小时,老是超时,改动好多次才好,最后也不知道怎么好的,晕。
以后卡壳了还是做点别的换换思路,不能像今天一样熬这么长时间了,有点得不偿失,切记。
相关文章推荐
- C++中的delete和delete[]的区别
- 二叉树的层次遍历
- 树状数组(Binary Indexed Trees,二分索引树)
- Poj 2352 Star
- POJ 3468 A Simple Problem with Integers
- Uva 459 Graph Connectivity
- Uva 10583 Ubiquitous Religions
- Uva 10608 Friends
- Uva 793 Network Connections
- Uva 10305 Ordering Tasks
- 最小生成树-Prim算法和Kruskal算法
- ACM中出现RuntimeError的原因及可能的解决办法
- UVa 10034 - Freckles
- Uva 705 - Slash Maze
- 简单词法分析器的实现
- VS2013的安装与测试
- adbl连接不上 daemon not running. starting it now on port 5037 ADB server didn't ACK
- 容器和算法
- 2016腾讯实习生在线笔试题
- Uva 439 Knight Moves