Cross

链接：戳这里  历届试题 兰顿蚂蚁  时间限制：1.0s   内存限制：256.0MB    问题描述　　兰顿蚂蚁，是于1986年，由克里斯·兰顿提出来的，属于细胞自动机的一种。　　平面上的正方形格子被填上黑色或白色。在其中一格正方形内有一只“蚂蚁”。　　蚂蚁的头部朝向为：上下左右其中一方。　　蚂蚁的移动规则十分简单：

链接：戳这里D. Lakes in Berlandtime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputThe map of Berland

链接：戳这里C. Journeytime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently Irina arrived to one of the most famous cities of Ber

链接：戳这里E. Breaking Goodtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBreaking Good is a new video game which a lot of gamers wa

链接：戳这里B. Two Buttonstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has found a strange device. On the front panel of a de

链接：戳这里B. Mike and Shortcutstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Mike was very busy with studying for exam

链接：戳这里D. Destroying Roadstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn some country there are exactly n cities and m bidi

链接：戳这里D. Phillip and Trainstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe mobile application store has a new game called "

链接：戳这里Prime PathTime Limit: 1000MS Memory Limit: 65536KDescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would

链接：戳这里Catch That CowTime Limit: 2000MS Memory Limit: 65536KDescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He sta

链接：戳这里棋盘问题Time Limit: 1000MS Memory Limit: 10000KDescription在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数

链接：戳这里Find a wayTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionPass a year learning in Hangzhou, yifenfei arrival hometown

链接：戳这里迷宫问题Time Limit: 1000MS Memory Limit: 65536KDescription定义一个二维数组： int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1

链接：戳这里Problem A: Krito的讨伐DescriptionKrito终于干掉了99层的boss，来到了第100层。第100层可以表示成一颗树，这棵树有n个节点（编号从0到n-1），树上每一个节点可能有很多只怪物。 Krito现在在0号节点，现在它想要区清除这一层所有的怪物。他现在有atk大小的攻击力。只有当你的攻击力大于这只怪物的防御力时，你才可以打败他，同时

链接：戳这里D. Robot Rapping Results Reporttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhile Farmer John rebuilds his farm in an

链接：戳这里F. Polycarp and Haytime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputThe farmer Polycarp has a warehouse with hay, which c

链接：戳这里D. Fairtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputSome company is going to hold a fair in Byteland. There are nn towns in Byteland and ...