ACM
渴鱼
菜鸟进行曲
展开
-
化装晚会
化妆晚会 枚举原创 2017-08-18 19:18:25 · 768 阅读 · 0 评论 -
SCOI-2007 蜥蜴
蜥蜴时间限制: 1 Sec 内存限制: 128 MB题目描述在一个r行c列的网格地图中有一些高度不同的石柱,一些石柱上站着一些蜥蜴,你的任务是让尽量多的蜥蜴逃到边界外。 每行每列中相邻石柱的距离为1,蜥蜴的跳跃距离是d,即蜥蜴可以跳到平面距离不超过d的任何一个石柱上。石柱都不稳定,每次当蜥蜴跳跃时,所离开的石柱高度减1(如果仍然落在地图内部,则到达的石柱高度不变),如果该石柱原来高度...原创 2018-03-15 23:42:08 · 173 阅读 · 0 评论 -
湖南省第十一届大学生计算机程序设计竞赛 阶乘除法
时间限制: 5 Sec 内存限制: 128 MB题目描述输入两个正整数 n, m,输出 n!/m!,其中阶乘定义为 n!= 1*2*3*…*n (n>=1)。 比如,若 n=6, m=3,则 n!/m!=6!/3!=720/6=120。 是不是很简单?现在让我们把问题反过来:输入 k=n!/m!,找到这样的整数二元组(n,m) (n>m>=1)。 如果答案不唯一,n应该尽量小。比如,若原创 2017-09-01 21:38:46 · 253 阅读 · 0 评论 -
广西 2017 邀请赛 CS Course
题目描述Little A has come to college and majored in Computer and Science. Today he has learned bit-operations in Algorithm Lessons, and he got a problem as homework. Here is the problem: You are giving原创 2017-08-31 02:06:29 · 303 阅读 · 0 评论 -
2017 ICPCECIC Birthday present
题目描述Bob’s father’s birthday is coming,.Because Bob’s father is a math teacher so that Bob wanted to give him an array of positive intergers a of length n as a gift.His father thinks that an array’s bea原创 2017-08-30 21:57:21 · 285 阅读 · 0 评论 -
2017 ICPCECIC Make cubes
题目描述When he was a little boy, Jieba had always been interested in geometry. One time, he got many pieces of colored square cards. For each color, he had as many pieces as he wanted. At that time, he d原创 2017-08-30 21:49:54 · 274 阅读 · 0 评论 -
Bovine Genomics
题目描述Farmer John owns N cows with spots and N cows without spots. Having just completed a course in bovine genetics, he is convinced that the spots on his cows are caused by mutations in the bovine geno原创 2017-08-22 10:10:52 · 497 阅读 · 0 评论 -
奶牛的编号
题目描述有N(1≤N≤1000)头奶牛,它们都被标上一个优先等级编号:1,2或3。用来表示它们喝水时的优先次序,编号为l的最优先,编号为2的其次,编号为3的最后。每天奶牛开始时排成一行,但总是很乱,需要你把它们重新排成编号为1的奶牛在最前面,编号为2的其次,编号为3的奶牛在最后。你能计算出最少需要多少的交换次序来完成这次重排吗?输入第1行:1个整数N; 第2至N+I行:第i+l行有一个整数表示开始原创 2017-08-21 14:18:09 · 1096 阅读 · 0 评论 -
Paired Up
题目描述Farmer John finds that his cows are each easier to milk when they have another cow nearby for moral support. He therefore wants to take his M cows (M≤1,000,000,000, M even) and partition them into原创 2017-08-21 13:54:33 · 2174 阅读 · 0 评论 -
SCOI-2007 排列Ⅰ (next_permutation() 大法好~~~~ `)
排列I时间限制: 1 Sec 内存限制: 128 MB题目描述给一个数字串s和正整数d, 统计s有多少种不同的排列能被d整除(可以有前导0)。例如123434有90种排列能被2整除,其中末位为2的有30种,末位为4的有60种。输入输入第一行是一个整数T,表示测试数据的个数,以下每行一组s和d,中间用空格隔开。s保证只包含数字0, 1, 2, 3, 4, 5, 6, 7...原创 2018-03-15 23:56:41 · 180 阅读 · 0 评论