Google Code Jam - Qualification Round 2014 - Problem B. Cookie Clicker Alpha (for small and large)

The following program is my ACcepted code for
GCJ-Qualification 2014 - B. Cookie Clicker Alpha .

This program is correct for the small and large input.
It's a for everybody to learn and discuss.
If there is any mistake or comment, please let me know.  :D

此乃 GCJ-Qualification 2014 - B. Cookie Clicker Alpha 的AC code!
這份程式在小跟大的測試資料都是正確的!

歡迎一同討論學習，如有錯誤與任何建議請留言 : )

前往 Google Code Jam!

	//Google Code Jam Qualification Round 2014 - Problem B. Cookie Clicker Alpha
	//https://code.google.com/codejam
	#include<stdio.h>
	#include<stdlib.h>
	#include<string.h>
	using namespace std;
	bool ifEnd(double C, double F, double X, double rate)
	{
	if( ((X-C) / rate ) < ( X / (rate+F) ) )
	return true;
	else
	return false;
	}
	double findAns(double C, double F, double X)
	{
	double rate = 2.0, ans = 0.0, tmp;
	while(!ifEnd(C, F, X, rate))
	{
	tmp = C/rate;//time to buy a farm
	ans += tmp;
	//printf("%.7lf ", ans);
	rate += F;//rate add F
	}
	ans += (X/rate);
	return ans;
	}
	int main()
	{
	freopen ("b_output.txt","w",stdout);
	int T;
	double C, F, X;
	scanf("%d", &T);
	for(int testCase = 1; testCase <= T; testCase++)
	{
	scanf("%lf %lf %lf", &C, &F, &X);
	printf("Case #%d: ", testCase);
	if( X <= C)
	{
	printf("%.7lf\n", X/2.0);
	continue;
	}
	printf("%.7lf\n", findAns(C, F, X));
	}
	return 0;
	}

view raw Google Code Jam Qualification Round 2014 - Problem B. Cookie Clicker Alpha.cpp hosted with ❤ by GitHub

Please feel free to use it after adding this blog as an reference. (http://autekroy.blogspot.tw) If there is any mistake or comment, please let me know. :D 

歡迎使用與分享任何內容，但請記得標示此部落格為出處。(http://autekroy.blogspot.tw/) 如果有發現任何的錯誤與建議請留言或跟我連絡。 : )