剑不飞

摘要： Problem C: The Dragon of LoowaterOnce upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.The shores of Rellau Creek in central Loowater had always been a prime breeding ground for geese. Due to the lack of predators, the geese population was out of control. The peo 阅读全文

摘要： 2013 ＡＣＭ训练计划主体计划是：刷算法竞赛入门经典（训练指南这本书）５月份：第一章：算法设计基础6月份：第三章：实用数据结构7月份：第五章：图论算法与模型8月份：第六章：更多算法专题9月份：第二章：数学基础9月份：第四章：几何问题。我的ACM生涯上半年邀请赛:南京赛区 南京理工大学邀请赛（现场赛）4月底广东省赛 华南农业大学（现场赛）5月12日长沙赛区 湖南大学邀请赛（现场赛）5月19日长春赛区 通化师范大学（现场赛） 5.18-5.19杭州赛区 浙江工业大学邀请赛（现场赛）5月25日成都赛区 电子科技大学邀请赛（现场赛）6月初UVA第一章：算法设计基础... 阅读全文

摘要： Similar WordTime Limit 1000msMemory Limit 65536Kdescription It was a crummy day for Lur. He failed to pass to the CET-6 (College English Test Band-6). Looking back on how it was in last year gone by, he gradually noticed he had fled too many English Lessons. But he determines to memorize words on h. 阅读全文

摘要： Dart gameTime Limit 1000msMemory Limit 65536Kdescription Darts originated in Australia. Australia's aborigines initially for hunting and hit the enemy's weapon. A game of darts in which the players attempt to score points by throwing the darts at a target. Figure：DART BOARD Darts movement r. 阅读全文

摘要： #include #include #define N 50 HANDLE hConsole; void gotoxy(int x, int y) { COORD coord; coord.X = x; coord.Y = y; SetConsoleCursorPosition(hConsole, coord); } int main() { int i,j,k; hConsole = GetStdHandle(STD_OUTPUT_HANDLE); SetConsoleTextAttribute(hConsole, FOREGROUND_RED|FOREGROUND_BLU... 阅读全文

摘要： The minimum square sumTime Limit 1000msMemory Limit 65536Kdescription Given a prime p (p #include #include #include #include using namespace std; int main() { long long p; while (cin>>p) { if (p==2) cout << "2" << endl; else if((p-3)%4==0) cout << 2*p*p << end 阅读全文

摘要： Car race gameTime Limit 1000msMemory Limit 65536Kdescription Bob is a game programming specialist. In his new car race game, there are some racers(n means the amount of racers (1 output For each data set in the input print on a separate line, on the standard output, the integer that represe... 阅读全文

摘要： Unidirectional TSPBackgroundProblems that require minimum paths through some domain appear in many different areas of computer science. For example, one of the constraints in VLSI routing problems is minimizing wire length. The Traveling Salesperson Problem (TSP) -- finding whether all the cities in 阅读全文

摘要： 10003 - Cutting SticksTime limit: 3.000 seconds思路：水啊，dp[a][b]a到b之间全切完的最小值。 dp[a][b]=min(dp[a][k]+dp[k][b])+ab段长度。k为ab段中的切点。#include #include #include using namespace std; const int mm=55; const int oo=1e9; int f[mm]; int dp[mm][mm];///a到b之间的最优值 int ans; int DP(int a,int b) { if(dp[a][b])return... 阅读全文

摘要： Stacking BoxesBackgroundSome concepts in Mathematics and Computer Science are simple in one or two dimensions but become more complex when extended to arbitrary dimensions. Consider solving differential equations in several dimensions and analyzing the topology of ann-dimensional hypercube. The form 阅读全文