Folders and files Name Name Last commit message
Last commit date
parent directory
View all files
泡泡龙(Puzzle & Dragons, ACM/ICPC Asia-Xian 2014, LA7036,难度 6)
另一个 n 皇后问题(Another n-Queen Problem, UVa11195,难度 7)
生日蛋糕(Birthday Cake, UVa11196,难度 8)
星际争霸中的挖矿(Mining in Starcraft, UVa12742,难度 10)
相交的日期区间(Intersecting Dates, World Finals 2004 – Prague, LA2997, 难度 2)
大调问题 (A Major Problem, World Finals 2001 - Vancouver, LA2237,难度 3)
欧元的扩散(Eurodiffusion, World Finals 2003 - Beverly Hills, LA2724,难度 3)
优化调号(Optimizing Key Signature, UVa12568,难度 4)
图像组合(Combining Images, World Finals 2003 - Beverly Hills, LA2726,难度 4)
发现有竞争力的产品(Finding Competitive Products, ACM/ICPC Asia – Taichung 2014, LA7007,难度 5)
排版 (Typesetting, World Finals 1994 Phoenix, LA5174,难度 5)
位图字体排版(Typesetting, ACM/ICPC North America - Mid Central - 2007/2008 , LA3846, 难度 5)
城市道路(City Directions, UVa163,难度 6)
忒修斯和米诺斯(Theseus and the Minotaur (II), World Finals1995 Nashville, LA5182难度6)
窗口框架(Window Frames, World Finals - San Jose 1997, UVa513, 难度 6)
绿鸡蛋和火腿(UVa10155 - Green Eggs and Ham,难度 7)
货运(Trucking, World Finals 1996 – Philadelphia, UVa252,难度 7)
窗口管理器 (Window Manager, World Finals 2015 – Marrakech, LA7162, 难度 7)
ASCII 表达式(ASCII Expression, ACM/ICPC Asia - Fukuoka 2011, LA5858,难度 8)
拖拉机游戏模拟(Game Simulator, Asia - Shanghai 2009, LA4749) 难度 9
SQL 解析(Interpreting SQL, UVa10757,难度 10)
安全部门(Department, ACM/ICPC Europe - Central 1995, LA5519,难度 10)
我们一起看电影(Let's Go to the Movies, ACM/ICPC Africa and the Middle East - Africa and Arab - 2007/2008, LA4090,难度 3)
过山车(Roller Coaster, ACM/ICPC North America - Southeast - 2010/2011, LA4870,难度 4)
外太空侵略者(Outer space invaders, ACM/ICPC Europe - Central 2014, LA6938,难度 8)
我讲鲸鱼的语言(I Speak Whales, ACM/ICPC Africa and the Middle East - Africa and Arab 2008/2009, LA4369,难度 3)
疯狂的考试(Deranged Exams, ACM/ICPC North America - Greater NY 2013, LA6469,难度4)
三角剖分的三角数目序列(Triangle Count Sequences of Polygon Triangulations, Regionals 2013 North America - Greater NY, LA6471,难度 4)
岳飞的战斗(Yue Fei’s Battle, ACM/ICPC Asia – Guangzhou 2014, LA7078,难度 8)
塔防游戏(Tower Defense, ACM/ICPC Asia – Hangzhou 2013, LA6463,难度 8)
游戏激活(Activation, ACM/ICPC Asia - Beijing 2011, LA5721,难度 8)
哲学家的竞争问题(The Dueling Philosophers Problem, ACM/ICPC - North America Mid-Atlantic USA, LA6195,难度 5)
数字模式(Digit Patterns, UVa12415,难度 10)
You can’t perform that action at this time.