随笔分类 -  杂题

上一页 1 2
Codeforces Round #429 (Div. 2)
摘要：A. Generous Kefa time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A. Generous Kefa time l 阅读全文
posted @ 2017-08-19 00:30 ISGuXing 阅读(279) 评论(0) 推荐(0)
Educational Codeforces Round 26 Problem C
摘要：C. Two Seals time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output One very important person ha 阅读全文
posted @ 2017-08-04 14:48 ISGuXing 阅读(188) 评论(0) 推荐(0)
Educational Codeforces Round 26 Problem B
摘要：B. Flag of Berland time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output The flag of Berland is 阅读全文
posted @ 2017-08-04 14:44 ISGuXing 阅读(205) 评论(0) 推荐(0)
Codeforces Round #427 (Div. 2)
摘要：Problem A A. Key races time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Two boys decided t 阅读全文
posted @ 2017-08-01 20:58 ISGuXing 阅读(181) 评论(0) 推荐(0)
POJ-3320 Jessica's Reading Problem
摘要：Jessica's a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam is coming, yet she has spent little time on it. If she 阅读全文
posted @ 2017-08-01 19:26 ISGuXing 阅读(171) 评论(0) 推荐(0)
Codeforces Round #426 (Div. 2) problem B
摘要：B. The Festive Evening time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output B. The Festive Eve 阅读全文
posted @ 2017-07-31 12:09 ISGuXing 阅读(186) 评论(0) 推荐(0)
Codeforces Round #426 (Div. 2) A. The Useless Toy
摘要：A. The Useless Toy time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Walking through the st 阅读全文
posted @ 2017-07-31 12:05 ISGuXing 阅读(168) 评论(0) 推荐(0)
JXNU acm选拔赛 不安全字符串
摘要：不安全字符串 Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description 集训十分无聊，于是boss发明了一个“益智”游戏——假设有一段仅由U和L构成的字符串，我们定义当连续的U的个数大于等于三的时候，这个 阅读全文
posted @ 2017-07-30 16:23 ISGuXing 阅读(203) 评论(0) 推荐(0)
JXNU acm选拔赛 最小的数
摘要：最小的数 Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description 定义一种正整数集合K，集合中有N个数，集合中元素Ki（1<=i<=N）是包含i个不同质因子的最小的数。因为Ki可能会很大，所以将集合中所 阅读全文
posted @ 2017-07-30 13:17 ISGuXing 阅读(234) 评论(0) 推荐(0)
dada的GCD （ jxnu acm新生选拔赛）
摘要：1007 dada的GCD，输入格式描述有误，已修正 dada的GCD Time Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other) Total Submission(s) : 36 Accepted S 阅读全文
posted @ 2017-07-29 20:31 ISGuXing 阅读(270) 评论(0) 推荐(0)

上一页 1 2