平时训练题
灵与尘
这个作者很懒,什么都没留下…
展开
-
ZOJ Problem Set - 3960―What Kind of Friends Are You?
Time Limit: 1 Second Memory Limit: 65536 KB Japari Park is a large zoo home to extant species, endangered species, extinct species, cryptids and some legendary creatures. Due to a mysterious sub原创 2017-04-23 23:24:27 · 323 阅读 · 0 评论 -
ZOJ Problem Set - 3958―Cooking Competition
Time Limit: 1 Second Memory Limit: 65536 KB "Miss Kobayashi's Dragon Maid" is a Japanese manga series written and illustrated by Coolkyoushinja. An anime television series produced by Kyoto Anim原创 2017-04-23 23:06:49 · 235 阅读 · 0 评论 -
How many prime numbers
Problem Description Give you a lot of positive integers, just to find out how many prime numbers there are. Input There are a lot of cases. In each case, there is an integer N representing原创 2017-06-20 09:06:07 · 288 阅读 · 0 评论 -
Cake
Problem Description 一次生日Party可能有p人或者q人参加,现准备有一个大蛋糕.问最少要将蛋糕切成多少块(每块大小不一定相等),才能使p人或者q人出席的任何一种情况,都能平均将蛋糕分食. Input 每行有两个数p和q. Output 输出最少要将蛋糕切成多少块. Sample原创 2017-06-20 09:11:39 · 225 阅读 · 0 评论 -
Leftmost Digit
Problem Description Given a positive integer N, you should output the leftmost digit of N^N. Input The input contains several test cases. The first line of the input is a single integer原创 2017-06-20 09:33:32 · 179 阅读 · 0 评论 -
七夕节
Problem Description 七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:"你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!" 人们纷纷来到告示前,都想知道谁才是自己的另一半.告示如下: 数字N的因子就是所有比N小又能被N整除的所有正整数,如12的因子有1,2,3,4,6. 你想知道你的另一半吗?原创 2017-06-20 09:22:50 · 239 阅读 · 0 评论 -
又见GCD
Problem Description 有三个正整数a,b,c(0 Input 第一行输入一个n,表示有n组测试数据,接下来的n行,每行输入两个正整数a,b。 Output 输出对应的c,每组测试数据占一行。 Sample Input 2 6 2 12 4 Sample Output原创 2017-06-20 09:16:35 · 220 阅读 · 0 评论 -
Fibonacci
Problem Description 2007年到来了。经过2006年一年的修炼,数学神童zouyu终于把0到100000000的Fibonacci数列 (f[0]=0,f[1]=1;f[i] = f[i-1]+f[i-2](i>=2))的值全部给背了下来。 接下来,CodeStar决定要考考他,于是每问他一个数字,他就要把答案说出来,不过有的数字太长了。所以规定超过4位的只要说出前4位就转载 2017-06-20 09:43:36 · 230 阅读 · 0 评论