程序员囧辉-CSDN博客

原创 PKU 3624 Charm Bracelet

Charm Bracelet Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other) Total Submission(s) : 26 Accepted Submission(s) : 16 Problem Description Bessie has gone to

2012-09-12 16:00:45 1887

原创 HDU 2084 数塔

数塔 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11435 Accepted Submission(s): 6863 Problem Description 在讲述DP算法的时候，一个经典的例子就是数塔问题

2012-09-12 15:49:18 1844

原创 2012 ACM/ICPC Asia Regional Tianjin Online-Faulty Odometer

Faulty Odometer Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1027 Accepted Submission(s): 681 Problem Description 　　You are giv

2012-09-12 15:38:07 2873

原创 2012 ACM/ICPC Asia Regional Changchun Online-LianLianKan

LianLianKan Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2389 Accepted Submission(s): 382 Problem Description I like playing ga

2012-09-12 15:29:34 2200

原创简单查找

问题 I: 简单查找时间限制: 3 Sec 内存限制: 22 MB 提交: 688 解决: 123 [提交][状态][讨论版] 题目描述给定一个集合，查找元素是否在集合中出现。输入每个测试用例由多行组成，第一行是两个整数n和m，这2个数的取值在1到3 000 000之间。自第二行起一共有n+m个整数，其中前面n个整数代表集合的元素，随后的m个整数是待查询的

2012-09-12 11:21:21 1993

原创 ZOJ 3635 Cinema in Akiba

Cinema in Akiba Time Limit: 3 Seconds Memory Limit: 65536 KB Cinema in Akiba (CIA) is a small but very popular cinema in Akihabara. Every night the cinema is full of people. The layout o

2012-09-12 11:12:57 2123

原创 ZJUT 2012校赛决赛-涂颜色

涂颜色 Time Limit:2000MS Memory Limit:32768K Description: 有n个未涂色的球，编号1到n。现在要给它们涂色。已知有m种颜料，每种颜料剩余量不一，因此每种颜料能够涂的球的个数是不同的，令它们是c1，c2，。。。，cm。问有多少种给所有球上颜色的方案。 Input: 多组数据。每组数据第一行两个整数n,m(1<=n

2012-08-28 14:34:41 2889

原创 HDU 2669 Romantic

题意：找出最小的非负整数X，使之满足式子X*a + Y*b = 1。思路：简单的扩展欧几里德。 #include int exgcd(int a,int b,int &x,int &y) { int i,j; if(b==0) { x=1; y=0; return a; } i=exgcd(b,a%b,x,y); j=x; x=y; y

2012-08-28 00:57:11 2367

程序员囧辉