2014年8月28日
快速切题 poj1068
摘要： ParencodingsTime Limit:1000MSMemory Limit:10000KTotal Submissions:19716Accepted:11910DescriptionLet S = s1 s2...s2n be a well-formed string of parenth... 阅读全文
posted @ 2014-08-28 21:15 雪溯 阅读(150) 评论(0) 推荐(0)
POJ 3295 Tautology 构造 难度:1
摘要： TautologyTime Limit:1000MSMemory Limit:65536KTotal Submissions:9580Accepted:3640DescriptionWFF 'N PROOF is a logic game played with dice. Each die has... 阅读全文
posted @ 2014-08-28 16:41 雪溯 阅读(201) 评论(0) 推荐(0)
POJ 2586 Y2K Accounting Bug 贪心 难度:2
摘要： Y2K Accounting BugTime Limit:1000MSMemory Limit:65536KTotal Submissions:10537Accepted:5264DescriptionAccounting for Computer Machinists (ACM) has suff... 阅读全文
posted @ 2014-08-28 11:49 雪溯 阅读(198) 评论(0) 推荐(0)
POJ 2109 Power of Cryptography 大数,二分,泰勒定理 难度:2
摘要： import java.math.BigInteger;import java.util.Scanner;public class Main { static BigInteger p,l,r,div; static int n; public static int cmp(Big... 阅读全文
posted @ 2014-08-28 10:24 雪溯 阅读(218) 评论(0) 推荐(0)
CF 463A && 463B 贪心 && 463C 霍夫曼树 && 463D 树形dp && 463E 线段树
摘要： http://codeforces.com/contest/462A:Appleman and Easy Task要求是否全部的字符都挨着偶数个'o'#include using namespace std;char maz[101][101];int n;int cnt[101][101];con... 阅读全文
posted @ 2014-08-28 08:45 雪溯 阅读(348) 评论(0) 推荐(0)