- 博客(8)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 查验身份证 pat-1031
一个合法的身份证号码由17位地区、日期编号和顺序编号加1位校验码组成。校验码的计算规则如下：首先对前17位数字加权求和，权重分配为：{7，9，10，5，8，4，2，1，6，3，7，9，10，5，8，4，2}；然后将计算的和对11取模得到值Z；最后按照以下关系对应Z值与校验码M的值：Z：0 1 2 3 4 5 6 7 8 9 10M：1 0 X 9 8 7 6 5 4 3 2
2017-07-28 19:11:02
495
原创 个位数统计pat-1021
给定一个k位整数N = dk-1*10k-1 + ... + d1*101 + d0 (0i<=9, i=0,...,k-1, dk-1>0)，请编写程序统计每种不同的个位数字出现的次数。例如：给定N = 100311，则有2个0，3个1，和1个3。输入格式：每个输入包含1个测试用例，即一个不超过1000位的正整数N。输出格式：对N中每一种不同的个位数字，以D:
2017-07-28 08:03:58
222
原创 codeforces-727A
Vasily has a number a, which he wants to turn into a number b. For this purpose, he can do two types of operations:multiply the current number by 2 (that is, replace the number x by 2·x);append th
2017-07-22 23:04:11
408
原创 codeforces- 82B
Erelong Leha was bored by calculating of the greatest common divisor of two factorials. Therefore he decided to solve some crosswords. It's well known that it is a very interesting occupation though i
2017-07-22 22:49:34
328
原创 Chat room （codeforces-58A）
Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to
2017-07-22 22:42:25
718
原创 数字排列 （HUST-1586）
现有n个k位的数字，你的任务是重新安排数字每一位的位置，使得重新安排后这n个数字中最大的数字和最小的数字之差的绝对值最小，对于每一位的调整是相对于所有的数字的，例如有3个数字1234、4321和7890，重新安排的方案是交换第二位和第三位，则3个数字变为1324、4231和7980。 Input输入包括多组样例，每组样例包括多行。每组样例的第一行包括2个整数n和k，分别代表数字的个数和位数
2017-07-22 22:21:57
342
原创 Blocks（POJ-2363）
Donald wishes to send a gift to his new nephew, Fooey. Donald is a bit of a traditionalist, so he has chosen to send a set of N classic baby blocks. Each block is a cube, 1 inch by 1 inch by 1 inch. D
2017-07-20 18:46:51
388
原创 when can we meet POJ-2028
The ICPC committee would like to have its meeting as soon as possible to address every little issue of the next contest. However, members of the committee are so busy maniacally developing (possibly u
2017-07-20 18:17:35
263
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人