PAT Advanced
文章平均质量分 83
小5555
码畜一枚
展开
-
PAT 1031. Hello World for U (20)
http://pat.zju.edu.cn/contests/pat-a-practise/1031Given any string of N (>=5) characters, you are asked to form the characters into the shape of U. For example, "helloworld" can be printed as:原创 2014-09-06 01:43:55 · 553 阅读 · 0 评论 -
PAT(A) 101-116-2-2014-09-06
1084. Broken Keyboard (20)时间限制200 ms内存限制32000 kB代码长度限制16000 B判题程序Standard作者CHEN, YueOn a broken keyboard, some of the keys are原创 2014-09-11 23:44:29 · 717 阅读 · 0 评论 -
PAT1082. Read Number in Chinese (25)
http://pat.zju.edu.cn/contests/pat-a-practise/1082原创 2014-11-02 00:25:19 · 1484 阅读 · 0 评论 -
PAT 1013. Battle Over Cities (25)
http://pat.zju.edu.cn/contests/pat-a-practise/1013原创 2014-09-04 02:57:38 · 2808 阅读 · 4 评论 -
1055. The World's Richest (25)
http://pat.zju.edu.cn/contests/pat-a-practise/1055原创 2014-09-03 03:39:47 · 1511 阅读 · 0 评论 -
PAT 1007. Maximum Subsequence Sum (25)
http://pat.zju.edu.cn/contests/pat-a-practise/1007Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1 Maximum Subsequenc原创 2014-09-02 19:53:55 · 4360 阅读 · 0 评论 -
PAT 1069. The Black Hole of Numbers (20)
http://pat.zju.edu.cn/contests/pat-a-practise/1069For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in n原创 2014-09-01 17:58:58 · 552 阅读 · 0 评论 -
PAT 1054. The Dominant Color (20)
http://pat.zju.edu.cn/contests/pat-a-practise/1054Behind the scenes in the computer's memory, color is always talked about as a series of 24 bits of information for each pixel. In an image, th原创 2014-09-01 00:22:35 · 1642 阅读 · 0 评论 -
PAT 1010. Radix (25)
http://pat.zju.edu.cn/contests/pat-a-practise/1010Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is "yes", if 6 is a decimal number and原创 2014-09-05 18:33:15 · 815 阅读 · 0 评论 -
PAT 1003. Emergency (25)
http://pat.zju.edu.cn/contests/pat-a-practise/1003原创 2014-09-02 14:42:37 · 2599 阅读 · 0 评论 -
PAT1038. Recover the Smallest Number (30)
Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given {32, 321, 3214, 0229, 87}, we can recover many numbers such like 32-321-3214-0229-8原创 2014-11-03 00:05:20 · 543 阅读 · 0 评论