ACM岁月
文章平均质量分 76
程序员囧辉
微信搜索【程序员囧辉】,领取本人原创大厂高频面试题 PDF、简历模板、进学习交流群。对技术有极致的追求,致力于写出小白也能看得懂的文章。
展开
-
2012 ACM/ICPC Asia Regional Changchun Online-LianLianKan
LianLianKanTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2389 Accepted Submission(s): 382Problem DescriptionI like playing ga原创 2012-09-12 15:29:34 · 2200 阅读 · 0 评论 -
上海交大-“Code人心弦”9月网络赛-OddGraph
1098. OddGraphDescriptionPangzi looks somehow odd recently. He started to love odd things, like odd numbers and odd graphs. He says, an odd graph is a non-empty graph (that is the set of vertices原创 2012-09-27 02:06:45 · 3392 阅读 · 0 评论 -
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) : 16Problem DescriptionBessie has gone to原创 2012-09-12 16:00:45 · 1887 阅读 · 0 评论 -
选拔赛-染色
染色 Time Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 16 Accepted Submission(s) : 4Font: Times New Roman | Verdana | GeorgiaFont Size: ← →原创 2012-09-26 01:17:44 · 2465 阅读 · 0 评论 -
hdu 1712 ACboy needs your help
ACboy needs your help Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 158 Accepted Submission(s) : 74Problem DescriptionACboy has N cour原创 2012-09-13 10:37:42 · 1940 阅读 · 0 评论 -
HDU 2669 Romantic
题意:找出最小的非负整数X,使之满足式子X*a + Y*b = 1。思路:简单的扩展欧几里德。#includeint 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 阅读 · 0 评论 -
ZOJ 3635 Cinema in Akiba
Cinema in AkibaTime 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 阅读 · 0 评论 -
hdu 1312 Red and Black
Red and BlackTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 258 Accepted Submission(s) : 139Problem DescriptionThere is a rectangular r原创 2012-09-26 02:01:32 · 1977 阅读 · 0 评论 -
选拔赛-杀伤力
杀伤力 Time Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 46 Accepted Submission(s) : 13Font: Times New Roman | Verdana | GeorgiaFont Size: ←原创 2012-09-26 01:13:05 · 2329 阅读 · 0 评论 -
UVA 12482 Short Story Competition
Maratona de Programação da SBC – ACM ICPC – 2012 Problem A原创 2012-09-19 01:14:48 · 3174 阅读 · 0 评论 -
赫夫曼编码
问题 J: 赫夫曼编码题目描述赫夫曼编码能够产生最短的报文。以报文“ABCDABCDABCABDABAA”为例,A编为0,B对应10,C对应110,D对应111,整体的报文长度为35位二进制。相比于定长的ASCII码,压缩比达到了18*8/35=4.1。输入输入有一系列的字符串组成,每个字符串占据一行。字符串仅包含大写字母和下划线。字符串“END” 表示处理结束,不原创 2012-09-13 15:47:08 · 2579 阅读 · 0 评论 -
HDU 2084 数塔
数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11435 Accepted Submission(s): 6863Problem Description在讲述DP算法的时候,一个经典的例子就是数塔问题原创 2012-09-12 15:49:18 · 1844 阅读 · 0 评论 -
简单查找
问题 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 阅读 · 0 评论 -
ZJUT 2012校赛决赛-涂颜色
涂颜色 Time Limit:2000MS Memory Limit:32768KDescription:有n个未涂色的球,编号1到n。现在要给它们涂色。已知有m种颜料,每种颜料剩余量不一,因此每种颜料能够涂的球的个数是不同的,令它们是c1,c2,。。。,cm。问有多少种给所有球上颜色的方案。Input:多组数据。每组数据第一行两个整数n,m(1<=n原创 2012-08-28 14:34:41 · 2889 阅读 · 0 评论 -
2012 ACM/ICPC Asia Regional Tianjin Online-Faulty Odometer
Faulty OdometerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1027 Accepted Submission(s): 681Problem Description You are giv原创 2012-09-12 15:38:07 · 2873 阅读 · 0 评论 -
UVA 12493 Stars
Maratona de Programação da SBC – ACM ICPC – 2012 Problem L原创 2012-09-19 01:33:05 · 2652 阅读 · 0 评论 -
中南大学2012暑期集训中期检测训练赛-求逆元
Problem A: 求逆元Time Limit: 1 Sec Memory Limit: 2 MBSUBMIT: 232 Solved: 77[SUBMIT][STATUS]Description给定正整数x,y,求最小的正整数z使得x*z mod y = 1。Input多组数据,每行两个整数x,y 空格隔开。2 Output原创 2012-09-14 09:38:56 · 3319 阅读 · 0 评论 -
中国象棋中的跳马问题(学习搜索中)
中国象棋中的跳马问题时间限制: 2 Sec 内存限制:128 MB题目描述现在棋盘的大小不一定,由p,q给出,并且在棋盘中将出现障碍物(限制马的行动,与象棋走法相同)输入第一行输入n表示有n组测试数据。每组测试数据第一行输入2个整数p,q,表示棋盘的大小(1每组测试数据第二行输入4个整数,表示马的起点位置与终点位置。(位置的取值范围同p,q)原创 2012-09-13 10:25:48 · 3064 阅读 · 0 评论 -
German collegiate programming contest 2012 - Ski Jumping
G. Ski JumpingTime Limit: 8000msCase Time Limit: 8000msMemory Limit: 65536KB Ski jumping is one of the most popular winter sport competitions. In the chase of records, ski jumping hills beco原创 2012-10-04 22:43:34 · 2789 阅读 · 0 评论