https://blog.youkuaiyun.com/lovericyzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/lovericy/article/details/50420804https://blog.youkuaiyun.com/lovericy/article/details/50420804lovericyMon, 28 Dec 2015 19:22:42 +0800https://blog.youkuaiyun.com/lovericy/article/details/50420512https://blog.youkuaiyun.com/lovericy/article/details/50420512lovericyMon, 28 Dec 2015 18:09:29 +0800https://blog.youkuaiyun.com/lovericy/article/details/46492543https://blog.youkuaiyun.com/lovericy/article/details/46492543lovericySun, 14 Jun 2015 17:46:28 +08000x0f,0xf0,0x00 使用命令行方式调用程序，该程序的实现代码如下： #include #include int main(int argc, char *argv[]) { char]]>https://blog.youkuaiyun.com/lovericy/article/details/8223730https://blog.youkuaiyun.com/lovericy/article/details/8223730lovericySun, 25 Nov 2012 22:45:33 +0800https://blog.youkuaiyun.com/lovericy/article/details/8223404https://blog.youkuaiyun.com/lovericy/article/details/8223404lovericySun, 25 Nov 2012 21:07:17 +0800=y,使得1/k=1/x+1/y. 输入 第一行输入一个整数n,代表有n组测试数据。 接下来n行每行输入一个正整数k 输出 按顺序输出对应每行的k找到所有满足条件1/k=1/x+1/y的组合 样例输入 2 2 12 样例输出]]>https://blog.youkuaiyun.com/lovericy/article/details/8214304https://blog.youkuaiyun.com/lovericy/article/details/8214304lovericyThu, 22 Nov 2012 22:03:00 +0800https://blog.youkuaiyun.com/lovericy/article/details/8214190https://blog.youkuaiyun.com/lovericy/article/details/8214190lovericyThu, 22 Nov 2012 21:34:08 +0800https://blog.youkuaiyun.com/lovericy/article/details/8211232https://blog.youkuaiyun.com/lovericy/article/details/8211232lovericyThu, 22 Nov 2012 10:54:44 +0800https://blog.youkuaiyun.com/lovericy/article/details/8209470https://blog.youkuaiyun.com/lovericy/article/details/8209470lovericyWed, 21 Nov 2012 19:55:47 +0800https://blog.youkuaiyun.com/lovericy/article/details/8207392https://blog.youkuaiyun.com/lovericy/article/details/8207392lovericyWed, 21 Nov 2012 12:26:54 +0800https://blog.youkuaiyun.com/lovericy/article/details/8207364https://blog.youkuaiyun.com/lovericy/article/details/8207364lovericyWed, 21 Nov 2012 12:18:59 +08002) 现要你来求第n个斐波纳奇数。（第1个、第二个都为1)]]>https://blog.youkuaiyun.com/lovericy/article/details/8201522https://blog.youkuaiyun.com/lovericy/article/details/8201522lovericyMon, 19 Nov 2012 22:11:51 +0800https://blog.youkuaiyun.com/lovericy/article/details/8200996https://blog.youkuaiyun.com/lovericy/article/details/8200996lovericyMon, 19 Nov 2012 19:52:15 +0800https://blog.youkuaiyun.com/lovericy/article/details/8199851https://blog.youkuaiyun.com/lovericy/article/details/8199851lovericyMon, 19 Nov 2012 15:47:12 +0800https://blog.youkuaiyun.com/lovericy/article/details/8198022https://blog.youkuaiyun.com/lovericy/article/details/8198022lovericyMon, 19 Nov 2012 09:34:38 +0800https://blog.youkuaiyun.com/lovericy/article/details/8195379https://blog.youkuaiyun.com/lovericy/article/details/8195379lovericySun, 18 Nov 2012 02:07:20 +0800https://blog.youkuaiyun.com/lovericy/article/details/8195265https://blog.youkuaiyun.com/lovericy/article/details/8195265lovericySun, 18 Nov 2012 01:02:57 +0800https://blog.youkuaiyun.com/lovericy/article/details/8195131https://blog.youkuaiyun.com/lovericy/article/details/8195131lovericySun, 18 Nov 2012 00:06:10 +0800https://blog.youkuaiyun.com/lovericy/article/details/8194880https://blog.youkuaiyun.com/lovericy/article/details/8194880lovericySat, 17 Nov 2012 22:21:11 +0800https://blog.youkuaiyun.com/lovericy/article/details/8192540https://blog.youkuaiyun.com/lovericy/article/details/8192540lovericyFri, 16 Nov 2012 22:21:25 +0800