随笔分类 - 规律
摘要:Given a positive integer x, let S(x) denotes the sum of all x's digits. Two integers x and y are friend numbers if S(x)=S(y). Here com...
阅读全文
摘要:The Lucky WeekEdward, the headmaster of the Marjar University, is very busy every day and always forgets the date.There was one day Ed...
阅读全文
摘要:2266: number时间限制: 1 Sec 内存限制: 128 MB提交: 76 解决: 31[提交][状态][讨论版][命题人:admin]题目描述某人刚学习了数位DP,他在某天忽然思考如下问题:给定n,问有多少数对满足: x, y∈[1, n], x ...
阅读全文
摘要:2263: neighbor时间限制: 1 Sec 内存限制: 256 MB提交: 235 解决: 68[提交][状态][讨论版][命题人:admin]题目描述隔壁学校地形图可以通过一个高度矩阵表示,矩阵中每一个位置都有一个数hi , j表示这个坐标的海拔,我们姑...
阅读全文
摘要:2269: minval时间限制: 3 Sec 内存限制: 256 MB提交: 621 解决: 62[提交][状态][讨论版][命题人:外部导入]题目描述有两个长度为N的序列A和B,在A和B中各任取一个数相加可以得到N2个和,求这N2个和中最小的N个。 输入第一行...
阅读全文
摘要:A polyomino is a plane geometric figure formed by joining one or more equal squares edgeto edge.– WikipediaGiven a large polyomino and...
阅读全文
摘要:Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find...
阅读全文
摘要:C. Zebrastime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputOleg writes down the his...
阅读全文
摘要:2415 : 吃糖果题目描述南阳理工附属幼儿园有m个小胖友。每天,这些小胖友都要吃很多很多糖果,Miss.miao是负责分发糖果的老师,由于工作量巨大,Miss.miao经常不能保证每个小胖友分到的糖果数量是一样的。如果存在两个小胖友的糖果数量的差值超过k,那么这些小...
阅读全文
摘要:GukiZ hates BoxesProfessor GukiZ is concerned about making his way to school, because massive piles of boxes are blocking his way.In t...
阅读全文
摘要:B. Ralph And His Magic Fieldtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRalph...
阅读全文
摘要:C. K-Dominant Charactertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are g...
阅读全文
摘要:给出正整数 n 和 m,统计满足以下条件的正整数对 (a,b) 的数量:1. 1≤a≤n,1≤b≤m;2. a×b 是 2016 的倍数。Input输入包含不超过 30 组数据。每组数据包含两个整数 n,m (1≤n,m≤10 9).Output对于每组数据,输出一个...
阅读全文
摘要:未名湖是圆形而且如果中间有中断就算是从新开始。。 Weiming Lake, also named “Un-named Lake”, is the most famous scenic spot in Peking University. It is located ...
阅读全文

浙公网安备 33010602011771号