2013年9月5日
HDUOJ-----X问题
摘要： X问题Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2587 Accepted Submission(s): 817 Problem Description求在小于等于N的正整数中有多少个X满足：X mod a[0] = b[0], X mod a[1] = b[1], X mod a[2] = b[2], …, X mod a[i] = b[i], … (0 2 #define LL long long 3 #include 4 us. 阅读全文
posted @ 2013-09-05 21:27 龚细军 阅读(257) 评论(0) 推荐(0)
POJ-----C Looooops
摘要： C LooooopsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 15282Accepted: 3893DescriptionA Compiler Mystery: We are given a C-language style for loop of typefor (variable = A; variable != B; variable += C) statement;I.e., a loop which starts by setting variable to value A and while variabl.. 阅读全文
posted @ 2013-09-05 20:01 龚细军 阅读(405) 评论(0) 推荐(0)
POJ--Strange Way to Express Integers
摘要： Strange Way to Express IntegersTime Limit: 1000MSMemory Limit: 131072KTotal Submissions: 8370Accepted: 2508DescriptionElina is reading a book written by Rujia Liu, which introduces a strange way to express non-negative integers. The way is described as following:Choose k different positive integers 阅读全文
posted @ 2013-09-05 13:48 龚细军 阅读(415) 评论(0) 推荐(0)