杭电OJ题目分类

合集下载

杭州电子科技大学OJ题目分类

杭州电子科技大学OJ题目分类1001 整数求和水题1002 C语言实验题——两个数比较水题1003 1、2、3、4、5... 简单题1004 渊子赛马排序+贪心的方法归并1005 Hero In Maze 广度搜索1006 Redraiment猜想数论：容斥定理1007 童年生活二三事递推题1008 University 简单hash1009 目标柏林简单模拟题1010 Rails 模拟题（堆栈）1011 Box of Bricks 简单题1012 u Calculate e 简单数学计算1013 STAMPS 搜索or动态规划1014 Border 模拟题1015 Simple Arithmetics 高精度计算1016 Shoot-out 博弈+状态压缩DP1017 Tour Guide1018 Card Trick 简单题1019 Necklace Decomposition 贪心1020 Crashing Robots 模拟题1021 Electrical Outlets 简单题1022 Watchdog 简单题1023 Taxi Cab Scheme 图论：最小路径覆盖--->最大二分匹配1024 Pseudo-random Numbers 数论1025 Card Game Cheater 简单题1026 Investment 动态规划1027 Pipes1028 SETI 数学:高斯消元法1029 Minimax Triangulation 计算几何1030 Unequalled Consumption 母函数1031 Declaration of Content1032 Laserbox 搜索：DFS1033 Bowlstack1034 Pesky Heroes1035 Reduced ID Numbers 暴力1036 Tantrix1037 Guardian of Decency 图论：匈牙利算法求二分图的最大匹配1038 Up the Stairs 简单数学题1039 Sudoku 搜索：DFS1040 The SetStack Computer1041 Pie 二分法1042 Ticket to Ride 动态规划1043 The Bookcase 动态规划1044 Printer Queue 模拟题1045 Prime Path 搜索：BFS1046 Lineland's Airport1047 Leonardo's Notebook 数学题：群置换1048 简易版最长序列简单题1049 Jesse's problem 搜索：DFS1050 Error Correction 模拟题1051 A ×B problem 高精度计算1052 Redraiment的走法动态规划1053 Word Encoding 动态规划1054 Jesse's Code 组合数学：排列1055 简单密码破解水题1056 英文金曲大赛水题1057 有假币水题1058 寄居蟹与海葵水题1059 天仙配水题1060 鹊桥相会水题1061 杨辉三角水题1062 蟠桃记水题1063 养兔子水题1064 字符统计水题1065 完美数水题1066 亲和数水题1067 成绩评估水题1068 找零钱水题1069 漂亮菱形水题1070 Least Common Multiple 水题1071 第几天水题1072 编辑距离水题1073 支配值数目水题1074 等值数目水题1075 两数组最短距离水题1076 输入入门(1) 水题1077 输入入门(2) 水题1078 输入入门(3) 水题1079 输出入门水题1080 Counterfeit Dollar 组合数学1081 Dividing 动态规划1082 Sorting It All Out 图论：拓扑排序1083 False coin 暴力法1084 File Mapping1085 Color Me Less 简单题1086 Round and Round We Go 简单题1087 Microprocessor Simulation 简单题1088 求奇数的乘积水题1089 平方和与立方和水题1090 绝对值排序水题1091 JudgeOnline 水题1092 More Beautiful 水题1093 猴子分桃水题1094 C语言实验题——一元二次方程水题1095 C语言实验题——保留字母水题1096 C语言实验题——排列水题1097 C语言实验题——矩阵转置水题1098 C语言实验题——素数水题1099 Ambiguous permutations 简单题1100 Home Work 贪心法1101 Redraiment的遭遇数学题：找规律1102 Decorate the wall 搜索or动态规划1103 Economic phone calls 动态规划or贪心1104 Any fool can do it 记忆化搜索1105 Wine trading in Gergovia 贪心法1106 Homogeneous squares 随机算法1107 Automatic Correction of Misspellings 字符串处理：字典序1108 Black and white painting 简单数学题1109 Cylinder 计算几何：公式推导1110 Deli Deli 水题1111 Expressions 数据结构：树的遍历1112 Flavius Josephus Reloaded 数论：Pollard's Rho算法1113 Annoying painting tool 贪心法1114 Frequent values RMQ区间最值问题OR 线段树1115 Anagram Groups 字符串匹配1116 Let it Bead 组合数学->Polya定理1117 Simple Computers 简单题1118 Mondriaan's Dream 动态规划1119 Equidistance 计算几何1120 How many Fibs? 高精度计算1121 Hike on a Graph 搜索：BFS1122 ASCII Art1123 Billing Tables1124 Cellular Automaton 矩阵计算1125 Exchange1126 Fool's Game1127 Java vs C++ 字符串处理1128 Kickdown 字符串处理1129 Copying Books 贪心+二分法1130 Adding Reversed Numbers 简单题1131 Glass Beads 字符串的最小表示1132 The Circumference of the Circle 计算几何题1133 Knight Moves 搜索：BFS1134 Eeny Meeny Moo 变形的约瑟夫问题1135 Lotto 组合数学1136 Humble Numbers 动态规划1137 Average is not Fast Enough! 简单题1138 Etaoin Shrdlu 简单题1139 Hard to Believe, but True! 简单题1140 Code the Tree 简单题1141 Fiber Network 图论：全源最短路径，Floyd-Warshall算法1142 Global Roaming 3D几何题1143 All in All 字符串处理1144 The Sierpinski Fractal 递归1145 Assistance Required 简单题：预处理1146 Drink, on Ice 模拟题1147 All Discs Considered 搜索：BFS1148 In Danger 模拟题1149 Run Length Encoding 字符串处理1150 Bee Maja 模拟题1151 Friends 表达式求值1152 John 博弈论1153 Double Queue 最大堆与最小堆1154 ‘JBC’1155 Loan Scheduling 贪心+堆1156 Showstopper1157 Highway 贪心法1158 Computers 动态规划1159 The Stable Marriage Problem 组合数学1160 Arne Saknussemm 模拟题1161 Sum Problem 水题1162 Fire Net 搜索题1163 统计1到N之间数字1的个数推理题1164 最大公因子水题1165 C语言实验题——三个整数水题1166 C语言实验题——大小写转换水题1167 C语言实验题——分数序列水题1168 C语言实验题——最值水题1169 C语言实验题——保留整数水题1170 C语言实验题——矩阵下三角元素之和水题1171 C语言实验题——字符逆序水题1172 C语言实验题——打印菱形水题1173 C语言实验题——分割整数水题1174 C语言实验题——删除指定字符水题1175 C语言实验题——时间间隔水题1176 C语言实验题——数组逆序水题1177 C语言实验题——打印数字图形水题1178 C语言实验题——单词统计水题1179 C语言实验题——最小公倍数和最大公约数水题1180 Crashing Balloon 搜索题1181 念数字模拟题1182 A+B for Input-Output Practice(1) 水题1183 Anagrams by Stack 搜索：回溯1184 Elevator 数学：找规律1185 Substrings 字符串处理1186 Calling Extraterrestrial Intelligence Again 搜索：枚举法1187 Do the Untwist 简单数学题1188 数字对水题1189 A+B for Input-Output Practice (2) 水题1190 火星A+B 简单题1191 三齿轮问题：三个齿轮啮合简单数学题1192 A + B Problem II 高精度计算1193 The ones to remain 数学题1194 Chinese Chess 博弈论1195 Page Replacement 数据结构：队列or hash1196 RSA Signing 数论：Pollard's Rho算法1197 Number Guessing 搜索：穷举1198 求n的阶乘高精度计算1199 Area 计算几何1200 求两直线的夹角水题1201 三角形面积水题1202 Max Sum 动态规划1203 Number Sequence 大数问题1204 u Calculate e 水题1205 斐波那契数列高精度计算1206 Fibonacci Again 大数问题1207 Let the Balloon Rise 字符串处理1208 还是A+B 水题1209 A + B 水题1210 The area 简单计算几何1211 Ignatius's puzzle 简单数学问题1212 Computer Transformation 高精度计算1213 N! 高精度计算1217 Text Reverse 水题1220 填数字游戏搜索：DFS1221 Tempter of the Bone 搜索：DFS or BFS+剪枝1226 Last non-zero Digit in N! 数论1227 三角形递推求解1228 回文数猜想简单题1229 Factorial 简单题1230 Specialized Four-Digit Numbers 简单数学题1231 Lowest Bit 简单题1232 To and Fro 简单题1233 AC Me 简单题1234 Wolf and Rabbit 数论1235 最大连续子序列动态规划1236 开门人和关门人字符串处理1237 排名排序1238 统计难题字符串处理：字典树1239 Tick and Tick 数学题1240 Quoit Design 分治法1241 钱币兑换问题递推求解1242 求出前m大的数简单题1243 角谷猜想简单题1244 Reverse Number 简单题1245 寻找素数对简单题1246 ZJUTACM 简单题1247 Hat's Fibonacci 高精度计算1248 Encoding 简单题1249 四数相加高精度计算1250 两数相减高精度计算1251 Square Coins 母函数1252 Counting Triangles 递推求解1253 2^x mod n = 1 数论：费尔马小定理1254 Minimum Inversion Number 简单题1255 Surround the Trees 计算几何：凸包1256 Number Steps 简单题1257 Binary Numbers 简单题1258 Knight Moves 搜索：BFS1259 Lotto 组合数学1260 A Simple Task 简单题1261 The Drunk Jailer 数论1262 Hanoi Tower Troubles Again! 递推求解1263 IBM Minus One 水题1264 Definite Values 简单题1265 Box of Bricks 水题1266 Perfection 简单题1267 Reverse Text 水题1268 Inversion 模拟题1269 Prime Cuts 简单题1270 How Many Fibs? 高精度计算1271 Round and Round We Go 简单题1272 Red and Black 搜索：DFS1273 What Day Is It? 简单题1274 String Matching 字符串匹配1275 A Contesting Decision 简单题1276 Doubles 简单题1277 The Snail 简单题1278 Jungle Roads 图论：最小生成树1279 Prime Ring Problem 搜索：DFS1280 Big Number 大数问题1281 Least Common Multiple 简单题1283 简单排序水题1284 Gridland 简单题1285 An Easy Task 简单题1286 Calendar Game 模拟题1287 Human Gene Functions 动态规划1288 计算几何练习题——线段相交计算几何1289 计算几何练习题——线段相交II 计算几何1290 计算几何练习题——直线交点计算几何1291 Trees Made to Order 递归求解1292 排序简单题1293 18岁生日简单题1294 吃糖果递推求解1295 变种汉诺塔递推求解1296 洗牌递推求解1297 大数求余数论1298 圆桌会议递推求解1299 畅通工程并查集1300 还是畅通工程最小生成树1301 统计同成绩学生人数水题1302 简单计算器表达式求值：栈的应用1303 改进版计算器表达式求值：栈的应用1304 FatMouse' Trade 贪心法1305 Digital Roots 大数问题1306 Uniform Generator 数论1307 A Mathematical Curiosity 穷举法1308 Safecracker 穷举法1309 The 3n + 1 problem 简单题1310 分享糖果模拟题1311 宝物收集搜索：BFS1312 Climbing Worm 简单题1313 搬桌子贪心法1314 Humble Numbers 动态规划1315 Dividing 动态规划1316 Rightmost Digit 数学问题1317 Leftmost Digit 数学问题1318 Hangover 简单数学问题1319 Exponentiation 高精度计算1320 I Think I Need a Houseboat 简单题1321 Girls and Boys DFS+二分图1322 Monkey and Banana 动态规划1323 买牛奶简单题1324 Matrix Chain Multiplication 数据结构：栈的应用1325 计算成绩简单题1326 Holding Bin-Laden Captive! 母函数1327 You can Solve a Geometry Problem too 计算几何1328 Super Jumping! Jumping! Jumping! 动态规划1329 a^b 数论1330 计算GPA 水题1331 Give me an offer! 动态规划：0-1背包1332 田忌赛马贪心法1333 Asteroids! 搜索：BFS1334 Oil Deposits 搜索：DFS1335 营救天使搜索：BFS1336 小数化分数高精度计算1337 I Hate It 线段树1338 Strange Billboard 位运算+枚举1339 Frobenius 递推求解1340 奇怪的公式数学题1341 Fibonacci again and again 博弈论1342 A New Tetris Game 博弈论1343 Sum It Up 搜索：DFS1344 速算24点搜索1345 推箱子搜索：BFS1346 Pushing Boxes 搜索：BFS1347 The Worm Turns 搜索1348 Alfredo's Pizza Restaurant 简单题1349 Broken Keyboard 字符串处理1350 Convert Kilometers to Miles 简单题1351 单词数水题1352 仙人球的残影简单题1353 Family planning 简单题1354 Rout 66 简单题1355 LC-Display 模拟题1356 A == B ? 高精度计算1357 不容易系列之一递推求解1358 折线分割平面递推求解1359 find the nth digit 二分查找1360 奇数阶魔方(II) 简单题1361 Keep on Truckin' 简单题1362 Factstone Benchmark 简单题1363 Destroy the Well of Life 模拟题1365 Brave Game 博弈论1366 ASCII码排序水题1367 计算两点间的距离水题1368 计算球体积水题1369 求绝对值水题1370 数值统计水题1371 求数列的和水题1372 水仙花数水题1373 多项式求和水题1374 素数判定水题1375 偶数求和水题1376 母牛的故事水题1377 数列有序! 水题1378 发工资咯：）水题1379 C语言合法标识符水题1380 海选女主角水题1381 查找最大元素水题1382 首字母变大写水题1383 统计元音水题1384 Palindromes _easy version 水题1385 汉字统计水题1386 进制转换水题1387 人见人爱A+B 水题1388 人见人爱A-B 水题1389 人见人爱A^B 水题1390 改革春风吹满地计算几何1391 今年暑假不AC 动态规划1392 三角形水题1393 求平均成绩水题1394 不容易系列之二递推求解1395 密码水题1396 一只小蜜蜂... 递推求解1397 不容易系列之(3)——LELE的RPG难题递推求解1398 骨牌铺方格递推求解1399 阿牛的EOF牛肉串递推求解1400 神、上帝以及老天爷递推求解1401 不容易系列之(4)——考新郎递推求解1402 Bitset 简单题1403 Picture 简单模拟题1404 Switch Game 找规律1405 An easy problem 简单模拟题1406 A + B Again 简单题1407 The sum problem 简单数学题1408 龟兔赛跑动态规划1409 Snooker 简单数学题1410 Subset sequence 简单题1411 汉诺塔III 递推求解1412 "红色病毒"问题递推求解1413 小兔的棋盘递推求解1414 RPG的错排错排+排列组合1415 无限的路简单题1416 夹角有多大数学题1417 汉诺塔IV 递推求解1418 复习时间简单题1419 选课时间暴力求解1420 手机短号字符串处理1421 找单词母函数1422 简易版之最短距离数学题1423 数塔动态规划1424 核反应堆简单题1425 A1 = ? 公式推导1426 剪花布条字符串处理1427 不要62 数学题1428 空心三角形字符串处理1429 小明A+B 简单题1430 Sky数进制转换1431 整除的尾数简单题1432 分拆素数和数论1433 正整数解数学题1434 挂盐水模拟题1435 {A} + {B} 简单题1436 小数A+B 高精度计算1437 Zigzag 简单题1438 螺旋形简单题1439 行李寄存简单题1440 判断多边形凹凸计算几何1441 The centre of polygon 计算几何1442 最小正整数简单题1443 Elevator Stopping Plan 二分+贪心法1444 TOYS 计算几何1445 The Doors 计算几何1446 Polygon And Segment 计算几何1447 Fence 计算几何1448 两圆相交面积计算几何1449 Area of Circles 计算几何1450 Pipe 计算几何1451 zero sum 搜索：DFS1452 C语言实验题——Hello World 水题1453 C语言实验题——数日子水题1454 C语言实验题——三个数排序水题1455 C语言实验题——数字串求和水题1456 C语言实验题——拍皮球水题1457 C语言实验题——求一个3*3矩阵对角线元素之和水题1458 C语言实验题——数组逆序水题1459 C实验题——求最大值水题1460 C实验题——求绝对值最大值水题1461 C语言实验题——求平均值水题1462 C语言实验题——打印直角三角形水题1463 C语言实验题——相加和最大值水题1464 C语言实验题——简单编码水题1465 C语言实验题——某年某月的天数水题1466 C语言实验题——各位数字之和排序水题1467 C语言实验题——两个数最大水题1468 C语言实验题——求级数值水题1469 Pipe II 计算几何1470 Transmitters 计算几何1471 Wall 计算几何1472 C语言实验题——逆置正整数水题1473 C语言实验题——找中间数水题1474 C语言实验题——整数位水题1475 C语言实验题——一元二次方程II 水题1476 C语言实验题——圆周率水题1477 C语言实验题——余弦水题1478 C语言实验题——打印金字塔水题1479 C语言实验题——排序水题1480 C语言实验题——约瑟夫问题水题1481 C语言实验题——鞍点水题1482 C语言实验题——计算表达式水题1483 C语言实验题——汉诺塔水题1484 C语言实验题——字符串排序水题1485 C语言实验题——整除水题1486 Solitaire 搜索：（双向）BFS1487 Abbreviation 水题1488 C语言实验题——买糖果水题1489 C语言实验题——字符编码水题1490 C语言实验题——合法的C标识符水题1491 C语言实验题——三角形面积水题1492 C语言实验题——大小写转换水题1493 C语言实验题——圆柱体计算水题1494 C语言实验题——温度转换水题1495 C语言实验题——统计字串水题1496 C语言实验题——字符过滤水题1497 Coin Change 暴力求解1498 Beautiful Meadow 搜索题1499 C语言实验题——鸡兔同笼水题1500 Coins of Luck 数学题：数学期望1501 Friends 搜索：DFS1502 Find All M^N Please 数学题1503 Incredible Cows 搜索：二分+DFS1504 计算直线的交点数递推求解1505 Number Game 动态规划1506 Sort ZOJ7 字符串处理1507 Find 7 Faster Than John Von Neumann 高精度计算1508 免费馅饼动态规划1509 Worm 动态规划1510 Common Subsequence 动态规划1511 搬寝室动态规划1512 Daydream 字符串处理1513 Ballroom Lights1514 Drop the Triples1515 Finding Seats1516 He is offside!1517 Justice League1518 星星点点搜索1519 逆波兰表达式表达式求解：栈的应用1520 十六进制高精度计算1521 Palindromic sequence1522 Hotel 模拟题1523 Intersecting Lines 计算几何1524 Heap Construction 最短路径1525 Pizza Anyone?1526 Adam's Genes1527 Risk1528 Just the Facts 数论1529 Horse Shoe Scoring 计算几何1530 哥德巴赫猜想数论1531 爱的伟大意义简单题1532 校门外的树模拟题1533 最多约数问题数论1534 Quicksum 数学题1535 找规律填数字数学题1536 Accepted Necklace 搜索：DFS1537 除法表达式数论1538 A Walk Through the Forest 图论：最短路径1539 Accurately Say "CocaCola"! 简单题1540 Build The Electric System 图论：最小生成树1541 Colorful Rainbows 计算几何1542 Easy Task 数学题1543 Faster, Higher, Stronger 简单题1544 Give Me the Number 模拟题1545 Hurdles of 110m 动态规划1546 Just Pour the Water 矩阵计算1547 Kinds of Fuwas 穷举法1548 复数运算简单题1549 元素个数排序简单题1550 Fiber Communications1551 Power Hungry Cows 搜索：BFS1552 Cow Cycling 动态规划1553 Rebuilding Roads 树型DP1554 Triangular Pastures 动态规划1555 Chores 动态规划1556 Extra Krunch1557 BUY LOW, BUY LOWER 动态规划1558 Hypnotic Milk Improvement1559 Happy Cows1560 Unary Cow Counting1561 Dairy Route1562 Calf Numbers1563 Hide and Seek1564 Mountain Majesties1565 Secret Milk Pipes1566 Circus Tickets1567 Life Cycle1568 Wiggle Numbers1569 Superwords1570 Cow Brainiacs1571 Pasture Fences1572 New Years Party1573 Strolling Cows1574 Grazing Sets1575 Factorial Power1576 Friday the Thirteenth1577 Beef McNuggets1578 Calf Flac1579 Light Bulbs1580 Cow Math 图论1581 Cow Imposters 动态规划1582 Traffic Lights 递推求解1583 Farm Tour 图论：最短路径1584 Vertical Histogram 简单题1585 Cowties 动态规划1586 Travel Games 搜索：DFS1587 Best Cow Fences 二分法1588 Cornfields RMQ问题1589 Six Degrees of Cowvin Bacon 简单题1590 Herd Sums 简单题1591 Message Decoding 简单题1592 Mountain Walking 二分+flood fill1593 Millenium Leapcow 动态规划1594 Optimal Milking 最大流+二分法1595 Bale Figures 模拟+二分法1596 Jumping Cows 动态规划1597 Lost Cows SBT树1598 Bovine Math Geniuses 简单题1599 Dividing the Path 动态规划1600 Fence Obstacle Course 动态规划1601 Cow Ski Area 图论：flood fill1602 Cleaning Shifts 贪心法1603 Bad Cowtractors 最大生成树1604 Tree Cutting 树状动态规划1605 Navigation Nightmare 并查集1606 Cow Marathon 树状动态规划1607 Distance Queries LCA，tarjan算法1608 Distance Statistics 楼天成大牛“男人八题”中的一道1609 Moo University - Team Tryouts 排序+穷举法1610 Moo University - Emergency Pizza Order1611 Moo University - Financial Aid 最大堆、最小堆1612 Cube Stacking 并查集1613 The Cow Lineup 穷举法1614 MooFest 线段树1615 Turning in Homework 动态规划1616 Alignment of the Planets1617 Finding Bovine Roots1618 Cow Bowling1619 Cow Patterns 字符串匹配的扩展1620 Barn Expansion 二分查找1621 Layout 差分约束系统1622 Knights of Ni 搜索：BFS1623 Cleaning Shifts DP＋Heap1624 Scales 搜索+剪枝1625 Secret Milking Machine 二分+网络流1626 Aggressive cows 二分法1627 Rigging the Bovine Election 穷举法1628 Feed Accounting 简单模拟题1629 Muddy Fields 穷举法1630 The Wedding Juicer 堆+flood fill1631 Naptime 动态规划1632 Sumsets 动态规划1633 Moo Volume 简单题1634 Ombrophobic Bovines Floyd-Warshall 1635 Space Elevator 动态规划1636 Yogurt factory 动态规划1637 Checking an Alibi 最短路径1638 Out of Hay1639 Satellite Photographs 搜索：BFS or DFS 1640 Asteroids 最大网络流1641 Grazing on the Run 动态规划1642 Walk the Talk 动态规划1643 City Skyline 栈的应用1644 Cow Acrobats 贪心法1645 Ant Counting 动态规划1646 Hopscotch 搜索：DFS1647 Securing the Barn 穷举法1648 Bovine Birthday 递推求解1649 Max Factor 简单题1650 Flying Right1651 Close Encounter1652 Allowance1653 Lazy Cows1654 Expedition1655 Around the world1656 Landscaping1657 Waves1658 Navigating the City1659 Disease Management1660 Muddy roads1661 Wormholes 最短路径1662 The Fewest Coins 动态规划1663 Milk Patterns 二分法or后缀树1664 Cow Picnic 搜索：BFS or DFS1665 Cow Roller Coaster 动态规划1666 River Hopscotch 二分法+贪心1667 The Moronic Cowmpouter 进制转换1668 DNA Assembly 穷举法1669 Cow Phrasebook 二分法1670 Cellphones 穷举法1671 Steady Cow Assignment 网络流1672 Treats for the Cows 动态规划1673 Backward Digit Sums 穷举法1674 Stump Removal 简单题1675 Finicky Grazers 动态规划1676 The Water Bowls 枚举二进制位1677 Redundant Paths 图论1678 Roping the Field 动态规划1679 Corral the Cows 二分法1680 The Cow Prom 图论1681 Dollar Dayz 动态规划1682 The Grove 最短路径1683 Fence Repair Huffman编码1684 Corn Fields 状态压缩DP1685 Roadblocks 图论：最短路径1686 Bad Hair Day 搜索1687 Big Square 穷举法1688 Round Numbers 枚举二进制位1689 Building A New Barn1690 Cow Sorting 置换群1691 Lilypad Pond 最短路径1692 The Cow Lexicon 动态规划1693 Silver Cow Party 最短路径1694 Problem Solving 动态规划1695 Cow School1696 Protecting the Flowers 贪心法1697 Tallest Cow 区间统计1698 Balanced Lineup RMQ问题1699 Gold Balanced Lineup RMQ问题1700 Ranking the Cows 搜索：DFS1701 Face The Right Way 穷举法1702 Cow Traffic 动态规划1703 Monthly Expense 贪心法1704 Cheapest Palindrome 动态规划1705 Dining 贪心+网络流1706 City Horizon 离散化+ 扫描1707 Catch That Cow 最短路径1708 Fliptile 枚举+位压缩1709 2-Dimensional Rubik's Cube 搜索：BFS 1710 Ball 计算几何1711 3D Camera 三维计算几何1712 Cipher 模拟题1713 Five in a Row 简单题1714 Pinhole Imaging 简单计算几何1715 URL 模拟题1716 Battle of Submarines 集合DP1717 WOJ 动态规划1718 钥匙计数之二递推求解1719 BrokenLED 模拟题1722 A+B again and again! 模拟题1723 Just calculate it! 数论1724 Guess how much I love you? 简单题1725 NBA Finals1726 Find Out an “E”1727 Judging ACM/ICPC1728 Cryptography of Alex1729 Rings of square grid1730 Fermat's Theorem1731 Cup 二分法1732 Find the Path DP+二分法1733 Five in a Row, Again 动态规划1734 Minimum Heap 递推求解1735 Name PK 模拟题1736 Pendant 动态规划1737 Radar 计算几何+搜索1738 Ring 多串模式匹配1739 Run 计算几何1740 Toxophily 简单题1741 通讯录编排简单题1742 超缘分ACM队伍简单题1743 集合运算简单题1744 矩阵计算简单题1745 Arbitrage 动态规划1746 The Tower of Babylon 动态规划1747 Binomial Showdown 组合数学1748 Dungeon Master 搜索：BFS1749 Equation Solver 表达式求值应用1750 Frogger 最短路径1751 Globetrotter 计算几何1752 Tree Recovery 数据结构：二叉树1753 Artificial Intelligence?1754 The Settlers of Catan 搜索1755 France '98 概率问题1756 Goldbach's Conjecture 数论1757 Heavy Cargo 最小生成树1758 Quadtree1759 From Dusk till Dawn or: Vladimir the Vampire 最短路径1760 Euro Cup 20001761 Quadtree II or: Florida Jones strikes back1762 HTML 简单题1763 Paths on a Grid 组合数学：T路问题1764 Balanced Food 动态规划1765 California Jones and the Gate to Freedom 组合数学1766 Diplomatic License 简单计算几何题1767 Polygon Programming with Ease 数学题1768 Hall of Fountains 搜索：BFS or DP1769 The Bottom of a Graph 图论：强连通分量1770 Edge1771 Fold1772 Largest Rectangle in a Histogram 动态规划1773 Boolean Logic1774 Code1775 In Danger 模拟题1776 Fractran1777 Huffman's Greed1778 Bullshit Bingo 字符串处理1779 A Song contest1780 Message1781 The skatepark's new ramps1782 Road1783 Warfare1784 Blackjack1785 Robintron1786 Diamond Dealer 计算几何：凸包1787 Best Compression Ever1788 Code Theft1789 Dinner1790 Event Planning1791 Getting Gold1792 Introspective Caching1793 Just A Few More Triangles!1794 Knights of the Round Table 图论：无向图的块判断奇圈1795 The Cow Doctor 穷举法1796 Wild West 线段树1797 Find the Clones1798 The Warehouse1799 Widget Factory 数论：同余方程组1800 Martian Mining 动态规划3301 字符串；AC自动机，动态规划；状态压缩3302 计算几何3303 数学；代数运算；高斯消元3304 图论；强连通分量；2-SAT3305 动态规划；凸单调性优化3306 枚举3307 贪心3308 数学；代数运算3309 最短路；佛洛伊德3310 动态规划3311 贪心3312 计数问题；递推，数状数组，二分查找3313 数论；欧拉定理，快速幂取模3314 计数问题，数状数组3315 博弈；Surreal数；Farey数列；3316 计数问题；递推，高精度3317 计数问题；容斥原理3318 递推；矩阵乘法3319 数学；概率3320 背包3321 动态规划3322 字符串；AC自动机3323 动态规划3324 博弈3325 搜索3326 贪心3327 最短路3328 数据结构（实现一种数据结构，支持要求的操作），数状数组3329 图论；二分图最大权匹配3330 数学；数论3331 递推；矩阵乘法3332 数学；数论，二分查找3333 计算几何3334 动态规划3335 字符串，后缀数组或拉宾卡普；动态规划3336 数据结构；并查集3337 计数问题，递推3338 二分查找，贪心3339 数学3340 计算几何；凸包，图论；佛洛伊德；最小环3341 动态规划3342 广搜3343 动态规划3344 计算几何3345 二分图最大匹配3346 树型DP3347 动态规划3348 数学；数论；进制3349 计数问题3350 贪心3351 数学；数论；进制3352 动态规划，数论，组合数学3353 数学；数论3354 计数；递推3355 图论；佛洛伊德3356 博弈3357 动态规划3358 数据结构；线段树，数状数组3359 计算几何，动态规划3360 博弈；SG函数3361 图论；最近公共祖先3362 图论；强连通分量；2－SAT 3363 计算几何3364 字符串；AC自动机，动态规划3365 搜索，舞蹈链3366 数学；数论3367 数学；代数运算；高斯消元3368 动态规划3369 计数问题；递推3370 网络流（错题）3371 树型DP3372 数学；高精度3373 数学；3374 RMQ3376 数学；进制3377 字符串；后缀数组3378 动态规划3379 计算几何3380 线段树3381 图论；欧拉路3382 简单题3383 字符串；AC自动机3384 广搜3385 计算几何，矩阵3386 语言处理3387 动态规划；状态压缩3388 图论；全局最小割3389 简单题3390 广搜3391 数学；Pell方程3392 背包3393 计算几何3394 广搜3395 搜索；迭代加深3396 数学；计数问题3397 数学；解方程3398 分析3399 模拟3400 数学；计数问题，数论6 热度。

杭电ACM题目

A +B Problem<1000>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 151346 Accepted Submission(s): 47937Problem DescriptionCalculate A + B.InputEach line will contain two integers A and B. Process to end of file.OutputFor each case, output A + B in one line.Sample Input1 1Sample Output2Sum Problem<1001>Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 114332 Accepted Submission(s): 26200Problem DescriptionHey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n.InputThe input will consist of a series of integers n, one integer per line.OutputFor each case, output SUM(n) in one line, followed by a blank line. Y ou may assume the result will be in the range of 32-bit signed integer.Sample Input1 100Sample Output1 5050A +B Problem II<1002>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 79807 Accepted Submission(s): 14884Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.InputThe first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consists of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. Y ou may assume the length of each integer will not exceed 1000.OutputFor each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line is the an equation "A + B = Sum", Sum means the result of A + B. Note there are some spaces int the equation. Output a blank line between two test cases.Sample Input2 1 2 112233445566778899 998877665544332211Sample OutputCase 1: 1 + 2 = 3 Case 2: 112233445566778899 + 998877665544332211 = 1111111111111111110Max Sum<1003>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 55141 Accepted Submission(s): 12401Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.InputThe first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integersfollowed(all the integers are between -1000 and 1000).OutputFor each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.Sample Input2 5 6 -1 5 4 -7 7 0 6 -1 1 -6 7 -5Sample OutputCase 1: 14 1 4 Case 2: 7 1 6Let the Balloon Rise<1004>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30799 Accepted Submission(s): 10110Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and find the result.This year, they decide to leave this lovely job to you.InputInput contains multiple test cases. Each test case starts with a number N (0 < N <= 1000) -- the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lower-case letters.A test case with N = 0 terminates the input and this test case is not to be processed.OutputFor each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case.Sample Input5 green red blue red red 3 pink orange pink 0Sample Outputred pinkNumber Sequence<1005>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41359 Accepted Submission(s): 8887Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n).InputThe input consists of multiple test cases. Each test case contains 3 integers A, B and n on a single line (1 <= A, B <= 1000, 1 <= n <= 100,000,000). Three zeros signal the end of input and this test case is not to be processed.OutputFor each test case, print the value of f(n) on a single line.Sample Input1 1 3 12 10 0 0 0Sample Output2 5Tick and Tick<1006>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3278 Accepted Submission(s): 847Problem DescriptionThe three hands of the clock are rotating every second and meeting each other many times everyday. Finally, they get bored of this and each of them would like to stay away from the other two. A hand is happy if it is at least D degrees from any of the rest. Y ou are to calculate how much time in a day that all the hands are happy.InputThe input contains many test cases. Each of them has a single line with a real number D between 0 and 120, inclusively. The input is terminated with a D of -1.OutputFor each D, print in a single line the percentage of time in a day that all of the hands are happy, accurate up to 3 decimal places.Sample Input0 120 90 -1Sample Output100.000 0.000 6.251Quoit Design<1007>Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9148 Accepted Submission(s): 2204Problem DescriptionHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.In the field of Cyberground, the position of each toy is fixed, and the ring is carefully designed so it can only encircle one toy at a time. On the other hand, to make the game look more attractive, the ring is designed to have the largest radius. Given a configuration of the field, you are supposed to find the radius of such a ring.Assume that all the toys are points on a plane. A point is encircled by the ring if the distanc e between the point and the center of the ring is strictly less than the radius of the ring. If two toys are placed at the same point, the radius of the ring is considered to be 0.InputThe input consists of several test cases. For each case, the first line contains an integer N (2 <= N <= 100,000), the total number of toys in the field. Then N lines follow, each contains a pair of (x, y) which are the coordinates of a toy. The input is terminated by N = 0.OutputFor each test case, print in one line the radius of the ring required by the Cyberground manager, accurate up to 2 decimal places.Sample Input2 0 0 1 1 2 1 1 1 13 -1.5 0 0 0 0 1.5 0Sample Output0.71 0.00 0.75Elevator<1008>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16637 Accepted Submission(s): 8841Problem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one floor, and 4 seconds to move down one floor. The elevator will stay for 5 seconds at each stop.For a given request list, you are to compute the total time spent to fulfill the requests on the list. The elevator is on the 0th floor at the beginning and does not have to return to the ground floor when the requests are fulfilled.InputThere are multiple test cases. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100. A test case with N = 0 denotes the end of input. This test case is not to be processed.OutputPrint the total time on a single line for each test case.Sample Input1 2 3 2 3 1 0Sample Output17 41FatMouse' Trade<1009>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16853 Accepted Submission(s): 5150Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room contains J[i] pounds of JavaBeans and requires F[i] pounds of cat food. FatMouse does not have to trade for all the JavaBeans in the room, instead, he may get J[i]* a% pounds of JavaBeans if he pays F[i]* a% pounds of cat food. Here a is a real number. Now he is assigning this homework to you: tell him the maximum amount of JavaBeans he can obtain.InputThe input consists of multiple test cases. Each test case begins with a line containing twonon-negative integers M and N. Then N lines follow, each contains two non-negative integers J[i] and F[i] respectively. The last test case is followed by two -1's. All integers are not greater than 1000.OutputFor each test case, print in a single line a real number accurate up to 3 decimal places, which is the maximum amount of JavaBeans that FatMouse can obtain.Sample Input5 3 7 2 4 3 5 2 20 3 25 18 24 15 15 10 -1 -1Sample Output13.333 31.500Tempter of the Bone<1010>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24095 Accepted Submission(s): 6634Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and he tried desperately to get out of this maze.The maze was a rectangle with sizes N by M. There was a door in the maze. At the beginning, the door was closed and it would open at the T-th second for a short period of time (less than 1 second). Therefore the doggie had to arrive at the door on exactly the T-th second. In every second, he could move one block to one of the upper, lower, left and right neighboring blocks. Once he entered a block, the ground of this block would start to sink and disappear in the next second. He could not stay at one block for more than one second, nor could he move into a visited block. Can the poor doggie survive? Please help him.InputThe input consists of multiple test cases. The first line of each test case contains three integers N, M, and T (1 < N, M < 7; 0 < T < 50), which denote the sizes of the maze and the time at which the door will open, respectively. The next N lines give the maze layout, with each line containing M characters. A character is one of the following:'X': a block of wall, which the doggie cannot enter;'S': the start point of the doggie;'D': the Door; or'.': an empty block.The input is terminated with three 0's. This test case is not to be processed.OutputFor each test case, print in one line "YES" if the doggie can survive, or "NO" otherwise.Sample Input4 45 S.X. ..X. ..XD .... 3 4 5 S.X. ..X. ...D 0 0 0Sample OutputNO YESStarship Troopers<1011>Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2842 Accepted Submission(s): 704Problem DescriptionY ou, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is actually a huge cavern, which consists of many rooms connected with tunnels. Each room is occupied by some bugs, and their brains hide in some of the rooms. Scientists have just developed a new weapon and want to experiment it on some brains. Y our task is to destroy the whole base, and capture as many brains as possible.To kill all the bugs is always easier than to capture their brains. A map is drawn for you, with all the rooms marked by the amount of bugs inside, and the possibility of containing a brain. The cavern's structure is like a tree in such a way that there is one unique path leading to each roomfrom the entrance. To finish the battle as soon as possible, you do not want to wait for the troopers to clear a room before advancing to the next one, instead you have to leave some troopers at each room passed to fight all the bugs inside. The troopers never re-enter a room where they have visited before.A starship trooper can fight against 20 bugs. Since you do not have enough troopers, you can only take some of the rooms and let the nerve gas do the rest of the job. At the mean time, you should maximize the possibility of capturing a brain. To simplify the problem, just maximize the sum of all the possibilities of containing brains for the taken rooms. Making such a plan is a difficult job. Y ou need the help of a computer.InputThe input contains several test cases. The first line of each test case contains tw o integers N (0 < N <= 100) and M (0 <= M <= 100), which are the number of rooms in the cavern and the number of starship troopers you have, respectively. The following N lines give the description of the rooms. Each line contains two non-negative integers -- the amount of bugs inside and the possibility of containing a brain, respectively. The next N - 1 lines give the description of tunnels. Each tunnel is described by two integers, which are the indices of the two rooms it connects. Rooms are numbered from 1 and room 1 is the entrance to the cavern.The last test case is followed by two -1's.OutputFor each test case, print on a single line the maximum sum of all the possibilities of containing brains for the taken rooms.Sample Input5 10 50 10 40 10 40 20 65 30 70 30 1 2 1 3 2 4 2 5 1 1 20 7 -1 -1 Sample Output50 7u Calculate e<1012>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12815 Accepted Submission(s): 5510Problem DescriptionA simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n.OutputOutput the approximations of e generated by the above formula for the values of n from 0 to 9. The beginning of your output should appear similar to that shown below.Sample Outputn e - ----------- 0 1 1 2 2 2.5 3 2.666666667 4 2.708333333 SourceGreater New Y ork 2000Digital Roots<1013>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20892 Accepted Submission(s): 6201Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those digits are summed and the process is repeated. This is continued as long as necessary to obtain a single digit.For example, consider the positive integer 24. Adding the 2 and the 4 yields a value of 6. Since 6 is a single digit, 6 is the digital root of 24. Now consider the positive integer 39. Adding the 3 and the 9 yields 12. Since 12 is not a single digit, the process must be repeated. Adding the 1 and the 2 yeilds 3, a single digit and also the digital root of 39.InputThe input file will contain a list of positive integers, one per line. The end of the input will be indicated by an integer value of zero.OutputFor each integer in the input, output its digital root on a separate line of the output.Sample Input24 39 0Sample Output6 3Uniform Generator<1014>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6236 Accepted Submission(s): 2485Problem DescriptionComputer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the formseed(x+1) = [seed(x) + STEP] % MODwhere '%' is the modulus operator.Such a function will generate pseudo-random numbers (seed) between 0 and MOD-1. One problem with functions of this form is that they will always generate the same pattern over and over. In order to minimize this effect, selecting the STEP and MOD values carefully can result in a uniform distribution of all values between (and including) 0 and MOD-1.For example, if STEP = 3 and MOD = 5, the function will generate the series of pseudo-random numbers 0, 3, 1, 4, 2 in a repeating cycle. In this example, all of the numbers between and including 0 and MOD-1 will be generated every MOD iterations of the function. Note that by the nature of the function to generate the same seed(x+1) every time seed(x) occurs means that if a function will generate all the numbers between 0 and MOD-1, it will generate pseudo-random numbers uniformly with every MOD iterations.If STEP = 15 and MOD = 20, the function generates the series 0, 15, 10, 5 (or any other repeating series if the initial seed is other than 0). This is a poor selection of STEP and MOD because no initial seed will generate all of the numbers from 0 and MOD-1.Y our program will determine if choices of STEP and MOD will generate a uniform distribution of pseudo-random numbers.InputEach line of input will contain a pair of integers for STEP and MOD in that order (1 <= STEP, MOD <= 100000).OutputFor each line of input, your program should print the STEP value right- justified in columns 1 through 10, the MOD value right-justified in columns 11 through 20 and either "Good Choice" or "Bad Choice" left-justified starting in column 25. The "Good Choice" message should be printed when the selection of STEP and MOD will generate all the numbers between and including 0 and MOD-1 when MOD numbers are generated. Otherwise, your program should print the message "Bad Choice". After each output test set, your program should print exactly one blank line. Sample Input3 5 15 20 63923 99999Sample Output3 5 Good Choice 15 20 Bad Choice 63923 99999 Good ChoiceSafecracker<1015>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2803 Accepted Submission(s): 1445Problem Description=== Op tech briefing, 2002/11/02 06:42 CST ==="The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, along with Klein and his factory, were destroyed in World War II. Fortunately old Brumbaugh from research knew Klein's secrets and wrote them down before he died. A Klein safe has two distinguishing features: a combination lock that uses letters instead of numbers, and an engraved quotation on the door. A Klein quotation always contains between five and twelve distinct uppercase letters, usually at the beginning of sentences, and mentions one or more numbers. Five of the uppercase letters form the combination that opens the safe. By combining the digits from all the numbers in the appropriate way you get a numeric target. (The details of constructing the target number are classified.) To find the combination you must select five letters v, w, x, y, and z that satisfy the following equation, where each letter is replaced by its ordinal position in the alphabet (A=1, B=2, ..., Z=26). The combination is then vwxyz. If there is more than one solution then the combination is the one that is lexicographically greatest, i.e., the one that would appear last in a dictionary."v - w^2 + x^3 - y^4 + z^5 = target"For example, given target 1 and letter set ABCDEFGHIJKL, one possible solution is FIECB, since 6 - 9^2 + 5^3 - 3^4 + 2^5 = 1. There are actually several solutions in this case, and the combination turns out to be LKEBA. Klein thought it was safe to encode the combination within the engraving, because it could take months of effort to try all the possibilities even if you knew the secret. But of course computers didn't exist then."=== Op tech directive, computer division, 2002/11/02 12:30 CST ==="Develop a program to find Klein combinations in preparation for field deployment. Use standard test methodology as per departmental regulations. Input consists of one or more lines c ontaining apositive integer target less than twelve million, a space, then at least five and at most twelve distinct uppercase letters. The last line will contain a target of zero and the letters END; this signals the end of the input. For each line output the Klein combination, break ties with lexicographic order, or 'no solution' if there is no correct combination. Use the exact format shown below."Sample Input1 ABCDEFGHIJKL 11700519 ZAYEXIWOVU 3072997 SOUGHT 1234567 THEQUICKFROG 0 ENDSample OutputLKEBA YOXUZ GHOST no solutionPrime Ring Problem<1016>Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8727 Accepted Submission(s): 3909Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.Note: the number of first circle should always be 1.Inputn (0 < n < 20).OutputThe output format is shown as sample below. Each row represents a series of circle numbers in the ring beginning from 1 clockwisely and anticlockwisely. The order of numbers must satisfy the above requirements. Print solutions in lexicographical order.Y ou are to write a program that completes above process.Print a blank line after each case.Sample Input6 8Sample OutputCase 1: 1 4 3 2 5 6 1 6 5 2 3 4 Case 2: 1 2 3 8 5 6 7 4 1 2 5 8 3 4 7 6 1 4 7 6 5 8 3 2 1 6 7 4 3 8 5 2A Mathematical Curiosity<1017>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10991 Accepted Submission(s): 3390Problem DescriptionGiven two integers n and m, count the number of pairs of integers (a,b) such that 0 < a < b < n and (a^2+b^2 +m)/(ab) is an integer.This problem contains multiple test cases!The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.The output format consists of N output blocks. There is a blank line between output blocks. InputY ou will be given a number of cases in the input. Each case is specified by a line containing the integers n and m. The end of input is indicated by a case in which n = m = 0. Y ou may assume that 0 < n <= 100.OutputFor each case, print the case number as well as the number of pairs (a,b) satisfying the given property. Print the output for each case on one line in the format as shown below.Sample Input1 10 1 20 3 30 4 0 0Sample OutputCase 1: 2 Case 2: 4 Case 3: 5Big Number<1018>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10803 Accepted Submission(s): 4860Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given a number, you have to determine the number of digits in the factorial of the number.InputInput consists of several lines of integer numbers. The first line contains an integer n, which is the number of cases to be tested, followed by n lines, one integer 1 ≤ n ≤ 107 on each line.OutputThe output contains the number of digits in the factorial of the integers appearing in the input.Sample Input2 10 20Sample Output7 19Least Common Multiple<1019>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11763 Accepted Submission(s): 4296Problem DescriptionThe least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15 is 105.InputInput will consist of multiple problem instances. The first line of the input will contain a single integer indicating the number of problem instances. Each instance will consist of a single line of the form m n1 n2 n3 ... nm where m is the number of integers in the set and n1 ... nm are the integers. All integers will be positive and lie within the range of a 32-bit integer.OutputFor each problem instance, output a single line containing the corresponding LCM. All results will lie in the range of a 32-bit integer.Sample Input2 3 5 7 15 6 4 10296 936 1287 792 1Sample Output105 10296Encoding<1020>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11194 Accepted Submission(s): 4688Problem DescriptionGiven a string containing only 'A' - 'Z', we could encode it using the following method:1. Each sub-string containing k same characters should be encoded to "kX" where "X" is the only character in this sub-string.2. If the length of the sub-string is 1, '1' should be ignored.InputThe first line contains an integer N (1 <= N <= 100) which indicates the number of test cases. The next N lines contain N strings. Each string consists of only 'A' - 'Z' and the length is less than 10000.OutputFor each test case, output the encoded string in a line.Sample Input2 ABC ABBCCCSample OutputABC A2B3CFibonacci Again<1021>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15018 Accepted Submission(s): 7023Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). InputInput consists of a sequence of lines, each containing an integer n. (n < 1,000,000).OutputPrint the word "yes" if 3 divide evenly into F(n).Print the word "no" if not.Sample Input0 1 2 3 4 5Sample Outputno no yes no no noTrain Problem I<1022>Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6557 Accepted Submission(s): 2391Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over the world ^v^). But here comes a problem, there is only one railway where all the trains stop. So all the trains come in from one side and get out from the other side. For this problem, if train A gets into the railway first, and then train B gets into the railway before train A leaves, train A can't leave until train B leaves. The pictures below figure out the problem. Now the problem for you is, there are at most 9 trains in the station, all the trains has an ID(numbered from 1 to n), the trains get into the railway in an order O1, your task is to determine whether the trains can get out in an order O2.InputThe input contains several test cases. Each test case consists of an integer, the number of trains, and two strings, the order of the trains come in:O1, and the order of the trains leave:O2. The input is terminated by the end of file. More details in the Sample Input.OutputThe output contains a string "No." if you can't exchange O2 to O1, or you should output a line contains "Y es.", and then output your way in exchanging the order(you should output "in" for a train getting into the railway, and "out" for a train getting out of the railway). Print a line contains "FINISH" after each test case. More details in the Sample Output.Sample Input3 123 321 3 123 312Sample OutputYes. in in in out out out FINISH No. FINISHHintHint For the first Sample Input, we let train 1 get in, then train 2 and train 3. So now train 3 is at the top of the railway, so train 3 can leave first, then train 2 and train 1. In the second Sample input, we should let train 3 leave first, so we have to let train 1 get in, then train 2 and train 3. Now we can let train 3 leave. But after that we can't let train 1 leave before train 2, because train 2 is at the top of the railway at the moment. So we output "No.".。

杭电ACM试题详细分类,杭电oj详细分类,hdu详细分类,详细,ACM

数论
1164 1211 1215 1222 1286 1299
计算几何
1086 1115 1147
贪心
1009 1052 1055 1232 1272
线段树,离散化
1199 1255
图论最短路相关的问题
1142 1162 1217 1301
二分图问题
1054 1068 1150 1151 1281
杭电ACM试题分类枚举
1002 1004 1013 1015 1017 1020 1022 1029 1031 1033 1034 1035 1036 1037 1039 1042 1047 1048 1049 1050 1057 1062 1063 1064 1070 1073 1075 1082 1083 1084 1088 1106 1107 1113 1117 1119 1128 1129 1144 1148 1157 1161 1170 1172 1177 1197 1200 1201 1202 1205 1209 1212(大数取模) 1216（链表）1218 1219 1225 1228 1229 1230 1234 1235 1236 1237 1239 1250 1256 1259 1262 1263 1265 1266 1276 1279 1282 1283 1287 1296 1302 1303 1304 1305 1306 1309 1311 1314
2549、2550、2551、2552、2555、2560、2561、2562、2566、2567、 2568、2700、2710、
DP：1003、10240、1029、1069、1074、1087、1114、1159、1160、
1171、1176、1203、1231、1257、1260、1284、1421、1789、1978、 2059、2084、2159、2191、2544、2571、2602、2709、

杭电acm部分题目及答案答案

自己刷的题这是我在杭电做题的记录，希望我的分享对你有帮助！！！1001 Sum Problem***********************************************************1 1089 A+B for Input-Output Practice (I)********************************21090 A+B for Input-Output Practice (II)********************************51091A+B for Input-Output Practice (III)****************************************7 1092A+B for Input-Output Practice (IV)********************************81093 A+B for Input-Output Practice (V)********************************101094 A+B for Input-Output Practice (VI)***************************************12 1095A+B for Input-Output Practice (VII)*******************************131096 A+B for Input-Output Practice (VIII)******************************15How to Type***************************************************************161001 Sum ProblemProblem DescriptionHey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n.InputThe input will consist of a series of integers n, one integer per line.OutputFor each case, output SUM(n) in one line, followed by a blank line. You may assume the result will be in the range of 32-bit signed integer.Sample Input1100Sample Output15050AuthorDOOM III解答：#include<stdio.h>main(){int n,i,sum;sum=0;while((scanf("%d",&n)!=-1)){sum=0;for(i=0;i<=n;i++)sum+=i;printf("%d\n\n",sum);}}1089 A+B for Input-Output Practice(I)Problem DescriptionYour task is to Calculate a + b.Too easy?! Of course! I specially designed the problem for acm beginners.You must have found that some problems have the same titles with this one, yes, all these problems were designed for the same aim.InputThe input will consist of a series of pairs of integers a and b, separated by a space, one pair of integers per line.OutputFor each pair of input integers a and b you should output the sum of a and b in one line, and with one line of output for each line in input.Sample Input1 510 20Sample Output630AuthorlcyRecommendJGShining解答：#include<stdio.h>main(){int a,b;while(scanf("%d%d",&a,&b)!=EOF)printf("%d\n",a+b);}1090 A+B for Input-Output Practice(II)Problem DescriptionYour task is to Calculate a + b.InputInput contains an integer N in the first line, and then N lines follow. Each line consists of a pair of integers a and b, separated by a space, one pair of integers per line.OutputFor each pair of input integers a and b you should output the sum of a and b in one line, and with one line of output for each line in input.Sample Input21 510 20Sample Output630AuthorlcyRecommendJGShining解答：#include<stdio.h>#define M 1000void main(){int a ,b,n,j[M],i;//printf("please input n:\n"); scanf("%d",&n);for(i=0;i<n;i++){scanf("%d%d",&a,&b);//printf("%d %d",a,b);j[i]=a+b;}i=0;while(i<n){printf("%d",j[i]);i++;printf("\n");}}1091A+B for Input-Output Practice(III)Problem DescriptionYour task is to Calculate a + b.InputInput contains multiple test cases. Each test case contains a pair of integers a and b, one pair of integers per line. A test case containing 0 0 terminates the input and this test case is not to be processed.OutputFor each pair of input integers a and b you should output the sum of a and b in one line, and with one line of output for each line in input.Sample Input1 510 200 0Sample Output630AuthorlcyRecommendJGShining解答：#include<stdio.h>main(){int a,b;scanf("%d %d",&a,&b);while(!(a==0&&b==0)){printf("%d\n",a+b);scanf("%d %d",&a,&b);}}1092A+B for Input-Output Practice(IV)Problem DescriptionYour task is to Calculate the sum of some integers.InputInput contains multiple test cases. Each test case contains a integer N, and then N integers followin the same line. A test case starting with 0 terminates the input and this test case is not to be processed.OutputFor each group of input integers you should output their sum in one line, and with one line of output for each line in input.Sample Input4 1 2 3 45 1 2 3 4 5Sample Output1015AuthorlcyRecommendJGShining解答：#include <stdio.h>int main(){int n,sum,i,t;while(scanf("%d",&n)!=EOF&&n!=0) {sum=0;for(i=0;i<n;i++){scanf("%d",&t);sum=sum+t;}printf("%d\n",sum);}}1093 A+B for Input-Output Practice(V)Problem DescriptionYour task is to calculate the sum of some integers.InputInput contains an integer N in the first line, and then N lines follow. Each line starts with a integer M, and then M integers follow in the same line.OutputFor each group of input integers you should output their sum in one line, and with one line of output for each line in input.Sample Input24 1 2 3 45 1 2 3 4 5Sample Output1015Authorlcy解答：#include<stdio.h>main(){int n,a,b,i,j,sum;sum=0;while(scanf("%d\n",&n)!=-1) {for(i=0;i<n;i++){scanf("%d",&b);for(j=0;j<b;j++){scanf("%d",&a);sum+=a;}printf("%d\n",sum); sum=0;}}}1094 A+B for Input-Output Practice (VI) Problem DescriptionYour task is to calculate the sum of some integers.InputInput contains multiple test cases, and one case one line. Each case starts with an integer N, and then N integers follow in the same line.OutputFor each test case you should output the sum of N integers in one line, and with one line of output for each line in input.Sample Input4 1 2 3 45 1 2 3 4 5Sample Output1015AuthorlcyRecommendJGShining解答：#include<stdio.h>main(){int n,a,b,i,j,sum;sum=0;while(scanf("%d\n",&n)!=-1){for(j=0;j<n;j++){scanf("%d",&a);sum+=a;}printf("%d\n",sum);sum=0;}}[ Copy to Clipboard ][ Save to File]1095A+B for Input-Output Practice (VII) Problem DescriptionYour task is to Calculate a + b.InputThe input will consist of a series of pairs of integers a and b, separated by a space, one pair of integers per line. OutputFor each pair of input integers a and b you should output the sum of a and b, and followed by a blank line.Sample Input1 510 20Sample Output630AuthorlcyRecommendJGShining解答：#include<stdio.h>main(){int a,b;while(scanf("%d%d",&a,&b)!=EOF)printf("%d\n\n",a+b);}1096 A+B for Input-Output Practice (VIII) Problem DescriptionYour task is to calculate the sum of some integers.InputInput contains an integer N in the first line, and then N lines follow. Each line starts with a integer M, and then M integers follow in the same line.OutputFor each group of input integers you should output their sum in one line, and you must note that there is a blank line between outputs.Sample Input34 1 2 3 45 1 2 3 4 53 1 2 3Sample Output10156AuthorlcyRecommendJGShining解答：int main(){int a,b,i,j,l[1000],k;scanf("%d",&i);getchar();for(j=1;j<=i;j++)l[j]=0;for(j=1;j<=i;j++){scanf("%d",&a);getchar();for(k=1;k<=a;k++){scanf("%d",&b);getchar();l[j]+=b;}}for(j=1;j<=i-1;j++)printf("%d\n\n",l[j]);printf("%d\n",l[i]);}How to TypeProblem DescriptionPirates have finished developing the typing software. He called Cathy to test his typing software. She is good at thinking. After testing for several days, she finds that if she types a string by some ways, she will type the key at least. But she has a bad habit that if the caps lock is on, she must turn off it, after she finishes typing. Now she wants to know the smallest times of typing the key to finish typing a string.InputThe first line is an integer t (t<=100), which is the number of test case in the input file. For each test case, there is only one string which consists of lowercase letter and upper case letter. The length of the string is at most 100.OutputFor each test case, you must output the smallest times of typing the key to finish typing this string.Sample Input 3Pirates HDUacm HDUACM Sample Output 888#include <stdio.h>#include <string.h>#define MAX 200int arr[MAX][4];char str[MAX];int letter(char ch){if(ch>='A'&&ch<='Z') return 1;return 0;}void proc(){int i;int tmp,min;int len=strlen(str);for(i=0;i<len;i++){if(i==0){if(letter(str[i])) { arr[i][1]=2; arr[i][2]=2; }else { arr[i][0]=1; arr[i][3]=3; }}else{if(letter(str[i])==letter(str[i-1])){if(arr[i-1][0]){ arr[i][0]=arr[i-1][0]+1;arr[i][3]=arr[i-1][0]+3;}if(arr[i-1][1]) { arr[i][1]=arr[i-1][1]+2; arr[i][2]=arr[i-1][1]+2;}if(arr[i-1][2]){if(arr[i][0]>arr[i-1][2]+1||!arr[i][0]) arr[i][0]=arr[i-1][2]+1;if(arr[i][3]>arr[i-1][2]+3||!arr[i][3]) arr[i][3]=arr[i-1][2]+3;}if(arr[i-1][3]){if(arr[i][1]>arr[i-1][3]+2||!arr[i][1]) arr[i][1]=arr[i-1][3]+2;if(arr[i][2]>arr[i-1][3]+2||!arr[i][2]) arr[i][2]=arr[i-1][3]+2;}}else{if(arr[i-1][0]){ arr[i][1]=arr[i-1][0]+2; arr[i][2]=arr[i-1][0]+2;}if(arr[i-1][1]){ arr[i][0]=arr[i-1][1]+1; arr[i][3]=arr[i-1][1]+3;}if(arr[i-1][2]){if(arr[i][1]>arr[i-1][2]+2||!arr[i][1]) arr[i][1]=arr[i-1][2]+2;if(arr[i][2]>arr[i-1][2]+2||!arr[i][2]) arr[i][2]=arr[i-1][2]+2;}if(arr[i-1][3]){if(arr[i][0]>arr[i-1][3]+1||!arr[i][0]) arr[i][0]=arr[i-1][3]+1;if(arr[i][3]>arr[i-1][3]+3||!arr[i][3]) arr[i][3]=arr[i-1][3]+3;}}}}min=3*MAX;if(letter(str[len-1])){if(arr[len-1][0]){ tmp=arr[len-1][0]+1; if(tmp<min) min=tmp;}if(arr[len-1][1]){ tmp=arr[len-1][1]; if(tmp<min) min=tmp; }if(arr[len-1][2]){ tmp=arr[len-1][2]+1; if(tmp<min) min=tmp;}if(arr[len-1][3]){ tmp=arr[len-1][3]; if(tmp<min) min=tmp; } }else{if(arr[len-1][0]) { tmp=arr[len-1][0]; if(tmp<min) min=tmp; }if(arr[len-1][1]) { tmp=arr[len-1][1]+1; if(tmp<min) min=tmp;}if(arr[len-1][2]) { tmp=arr[len-1][2]; if(tmp<min) min=tmp; }if(arr[len-1][3]) { tmp=arr[len-1][3]+1; if(tmp<min) min=tmp;} }printf("%d\n",min);}//Caps Shift:0-00;1-01;2-10;3-11int main(){int num;scanf("%d",&num);while(num--){scanf("%s",str);memset(arr,0,strlen(str)*4*sizeof(int));proc();}return 0;}。

oj传统题

oj传统题全文共四篇示例，供读者参考第一篇示例：随着计算机技术的飞速发展，越来越多的人开始关注到算法竞赛，而OJ 传统题作为算法竞赛的重要一环，也吸引着越来越多的人参与其中。

OJ，全称Online Judge，即在线评测系统，是一个用于测试和评测程序员编写代码的在线平台。

在OJ 上，开设有各种不同类型的题目，包括传统题、专题题、模拟题等等。

传统题是算法竞赛中最基础、最常见的类型之一，通常涉及各种经典的算法和数据结构。

传统题是算法竞赛中最基础、最常见的类型之一，通常包含一些常用的算法和数据结构的应用，如搜索、排序、动态规划、贪心等。

这些题目涵盖了算法竞赛中的基础知识，对于提高算法编程能力和解决实际问题具有重要的意义。

在传统题中，常见的题目包括最短路径算法、最小生成树算法、字符串处理、图论、数学等等。

这些题目具有一定的难度，需要程序员熟练掌握各种算法和数据结构才能解决。

在解决这些题目的过程中，程序员需要考虑到算法的时空复杂度以及代码的简洁性和鲁棒性。

传统题对于算法竞赛的参与者有着重要的意义。

传统题可以帮助程序员巩固基础知识，提高算法编程能力。

传统题涵盖了算法竞赛中常见的问题类型，可以帮助参与者更好地熟悉比赛题型。

传统题还可以锻炼程序员的解决问题的能力和思维模式，培养其对于问题的分析和解决能力。

在OJ 平台上，有许多知名的传统题目，如著名的ACM-ICPC比赛、Codeforces比赛等。

这些传统题目既有经典的题目，也有一些新颖的题目，吸引了众多程序员的参与和研究。

参与者可以通过解决这些传统题目来提升自己的算法竞赛水平，学习到更多的算法和数据结构知识。

传统题在算法竞赛中具有重要的地位和作用。

它不仅可以帮助程序员提高算法编程能力，还可以促进程序员之间的交流和学习。

通过解决传统题，程序员可以更好地应对算法竞赛中的挑战，取得更好的成绩。

我们鼓励更多的人参与到传统题的学习和解决中，共同提高算法竞赛水平，推动计算机科学的发展。

赛马网ACM试题（原杭电ojACM）java版答案（1000,10001,1002）

赛马⽹ACM试题（原杭电ojACM）java版答案（1000,10001,1002）赛马⽹ACM试题（原杭电OJ ACM试题）答案（java版）突然⼿痒，来做⼀下acm试题练练⼿，由于最近在学java，顺便练⼀下java编程。

但是对于ACM训练，c会更好，因为c的时间效率更⾼⼀些，这⽅⾯⽐java有优势。

其实调调⼩程序就像品茶⼀样也挺有意思的（怎么闻到⼀股屌丝⽓息）。

最近也在找⼯作阶段，对于新兴的在线⽐赛，在线程序测试略有感触，这是⼀个⼤趋势，也是互联⽹公司招聘的⼀个优势吧，不过诸多问题还有待改善，这⾥不详述。

对于计算机专业出⾝，编程是基础，想要进阶，就先积累点滴吧。

注意：提交的java代码的类名都必须为Main第1000题：A+B ProblemProblem DescriptionCalculateA + B.InputEach line will contain two integersA andB. Process to end of file.OutputFor each case, outputA +B in one line.Sample Input1 1Sample Output2题⽬解析：要求每⾏输⼊两个数，计算两数的和并输出，这⾥是要循环的输⼊，程序⾃动输出！代码：import java.util.Scanner;public class Main{public static void main(String[] args){Scanner in = new Scanner(System.in);while(in.hasNextInt()){int a = in.nextInt();int b = in.nextInt();System.out.println(a+b);}}}第1001题：Sum ProblemProblem DescriptionHey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n.InputThe input will consist of a series of integers n, one integer per line.OutputFor each case, output SUM(n) in one line, followed by a blank line. You may assume the result will be in the range of 32-bit signed integer. Sample Input1100Sample Output15050题⽬解析：输⼊⼀个数n，计算1+2+3+...+n的值。

牛人的ACM-POJ的题型分类总结!

⽜⼈的ACM-POJ的题型分类总结!主流算法：1.搜索//回溯2.DP（动态规划）3.贪⼼4.图论//Dijkstra、最⼩⽣成树、⽹络流5.数论//解模线性⽅程6.计算⼏何//凸壳、同等安置矩形的并的⾯积与周长7.组合数学//Polya定理8.模拟9.数据结构//并查集、堆10.博弈论1、排序1423,1694, 1723, 1727, 1763, 1788, 1828, 1838, 1840, 2201, 2376, 2377, 2380,1318, 1877, 1928, 1971, 1974, 1990, 2001, 2002, 2092, 2379,1002（需要字符处理，排序⽤快排即可） 1007（稳定的排序） 2159（题意较难懂） 2231 2371（简单排序） 2388（顺序统计算法） 2418（⼆叉排序树）2、搜索、回溯、遍历1022 1111 1118 1129 1190 1562 1564 1573 1655 2184 2225 2243 2312 2362 2378 23861010,1011,1018,1020,1054,1062,1256,1321,1363,1501，1650,1659,1664,1753,2078,2083,2303,2310,2329简单：1128,1166, 1176, 1231, 1256, 1270, 1321, 1543, 1606, 1664, 1731, 1742, 1745,1847, 1915, 1950, 2038, 2157, 2182, 2183, 2381, 2386, 2426,不易：1024, 1054, 1117, 1167, 1708, 1746, 1775, 1878, 1903, 1966, 2046, 2197, 2349, 推荐：1011,1190, 1191, 1416, 1579, 1632, 1639, 1659, 1680, 1683, 1691, 1709,1714,1753, 1771, 1826, 1855, 1856, 1890, 1924, 1935, 1948, 1979, 1980, 2170,2288, 2331, 2339, 2340,1979（和迷宫类似）1980（对剪枝要求较⾼）3、历法1008 2080 （这种题要⼩⼼）4、枚举1012，1046， 1387， 1411， 2245， 2326， 2363， 2381，1054（剪枝要求较⾼），1650 （⼩数的精度问题）5、数据结构的典型算法容易：1182, 1656, 2021, 2023, 2051, 2153, 2227, 2236, 2247, 2352, 2395, 不易：1145, 1177, 1195, 1227, 1661, 1834,推荐：1330, 1338, 1451, 1470, 1634, 1689, 1693, 1703, 1724, 1988, 2004, 2010, 2119, 2274, 1125(弗洛伊德算法)，2421（图的最⼩⽣成树）6、动态规划1037 A decorative fence、1050 To the Max、1088 滑雪、1125 Stockbroker Grapevine、1141 Brackets Sequence、1159 Palindrome、1160 Post Office、1163 The Triangle、1458 Common Subsequence、1579 Function Run Fun、1887 Testing the CATCHER、1953 World Cup Noise、2386 Lake Counting7、贪⼼1042, 1065, 1230, 1323, 1477, 1716, 1784,1328 1755（或⽤单纯形⽅法），2054，1017， 1328，1862，1922 ，2054，2209， 2313， 2325， 2370。

杭电计算机笔试题

杭电计算机笔试题
1.写出一个函数，求一个整数的二进制表示中1的个数。

2.实现一个函数，判断一个字符串是否是回文串。

3.实现一个函数，判断一个整数是否是质数。

4.实现一个函数，输入一个字符串，然后反转字符串。

5.实现一个函数，输入一个有序数组和一个目标值，在数组中查找该
目标值，返回其索引。

如果不存在，返回-1
6.实现一个函数，输入一个字符串，判断是否是有效的括号序列。

7.实现一个函数，输入一个整数n，输出斐波那契数列的第n项的值。

8.实现一个函数，输入两个正整数n和m，求它们的最大公约数。

9.实现一个函数，输入两个正整数n和m，求它们的最小公倍数。

10.实现一个函数，输入一个字符串，判断是否是合法的IP地址。

以上是十道可能出现在杭州电子科技大学计算机笔试中的题目，涵盖
了基本的编程知识和算法题目。

杭电OJ：1089----1096（c++）（ACM入门第一步：所有的输入输出格式）

杭电OJ：1089----1096（c++）（ACM⼊门第⼀步：所有的输⼊输出格式）1089:输⼊输出练习的A + B（I）问题描述您的任务是计算a + b。

太容易了？！当然！我专门为ACM初学者设计了这个问题。

您⼀定已经发现某些问题与此标题具有相同的名称，是的，所有这些问题都是出于相同的⽬的⽽设计的。

输⼊项输⼊将由⼀系列由空格隔开的整数对a和b组成，每⾏⼀对整数。

输出量对于每对输⼊整数a和b，应该在⼀⾏中输出a和b的总和，并且在输⼊中每⾏输出⼀⾏。

样本输⼊1 5 10 20样本输出6 30题解：#include<cstdio>#include<iostream>using namespace std;int main(){int a, b,sum;while(cin >> a >> b){sum = a+b;cout << sum << endl;}return 0;}1090：投⼊产出练习的A + B（II）问题描述您的任务是计算a + b。

输⼊项输⼊的第⼀⾏包含⼀个整数N，然后是N⾏。

每⾏由⼀对整数a和b组成，每对之间⽤空格隔开，每⾏⼀对整数。

输出量对于每对输⼊整数a和b，应该在⼀⾏中输出a和b的总和，并且在输⼊中每⾏输出⼀⾏。

样本输⼊2 1 5 10 20样本输出6 30题解：#include<cstdio>#include<iostream>using namespace std;int a,b,n,sum;cin >> n;while (n){cin >> a >> b;sum = a + b;cout << sum << endl;n--;}return 0;}1091：投⼊产出练习的A + B（III）问题描述您的任务是计算a + b。

杭电OJ水题答案2

Hdu 2000#include<stdio.h>void main(){char a,b,c,t;while(scanf("%c%c%c",&a,&b,&c)>0){if(a>b) t=a,a=b,b=t;if(a>c) t=c,c=a,a=t;if(c>a && c<b) t=b,b=c,c=t;scanf("%*c",&a);printf("%c %c %c\n",a,b,c);}}Hdu 2001#include <stdio.h>#include <math.h>int main(){double x1;double x2;double y1;double y2;while(scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2)!=EOF){double num=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));printf("%.2lf\n",num);}return 0;}Hdu 2002#include<stdio.h>int main(){double pi=3.1415927;double r;while (scanf("%lf",&r)==1)printf("%.3lf\n",((pi*r*r*r)*4)/3);}Hdu 2003#include <stdio.h>#include <math.h>int main(){double x;while (scanf("%lf",&x)==1)printf("%.2lf\n",fabs(x));return 0;}Hdu 2004#include<stdio.h>void main(){double x;while(scanf("%lf",&x)==1)if(x>100||x<0)printf("Score is error!\n");else if(0<x&&x<60) printf("E\n");else if(60<=x&&x<70) printf("D\n");else if(70<=x&&x<80)printf("C\n");else if(80<=x&&x<90)printf("B\n");elseprintf("A\n");}Hdu 2005#include<stdio.h>void main(){int y,m,d,sum=0;while(scanf("%d/%d/%d",&y,&m,&d)!=EOF){if((y%100==0&&y%400==0)||(y%100!=0&&y%4==0)){switch(m=13-m){case 1: sum=sum+30;case 2: sum=sum+31;case 3: sum=sum+30;case 4: sum=sum+31;case 5: sum=sum+31;case 6: sum=sum+30;case 7: sum=sum+31;case 8: sum=sum+30;case 9: sum=sum+31;case 10: sum=sum+29;case 11: sum=sum+31;}}else{switch(m=13-m){case 1: sum=sum+30;case 2: sum=sum+31;case 3: sum=sum+30;case 4: sum=sum+31;case 5: sum=sum+31;case 6: sum=sum+30;case 7: sum=sum+31;case 8: sum=sum+30;case 9: sum=sum+31;case 10: sum=sum+28;case 11: sum=sum+31;}}printf("%d\n",sum+d);sum=0;}}#include<stdio.h>void main(){int n,i,a,sum=1;while(scanf("%d",&n)!=EOF){for(i=1;i<=n;i++){scanf("%d",&a);if(a%2==1)sum*=a;}printf("%d\n",sum);sum=1;}}Hdu 2007#include<stdio.h>void main(){int a,b,x=0,y=0,t;while(scanf("%d%d",&a,&b)!=EOF){if(b<a) { t=a; a=b; b=t;goto m;}else{m:{ while(a<=b){if(a%2==0) { x=a*a+x;a++;}else { y=a*a*a+y; a++;}}}printf("%d %d\n",x,y);x=0; y=0;}}}#include<stdio.h>void main(){double a; int i,x=0,y=0,z=0,n;while(scanf("%d",&n)==1){if(n==0)break;else{while(n--){scanf("%lf",&a);if(a<0) {x++;}else if(a==0) {y++;}else {z++;}}}printf("%d %d %d\n",x,y,z);x=0;y=0;z=0;}}Hdu 2009#include<stdio.h>#include<math.h>void main(){double n,m;double sum=0;while (scanf("%lf%lf",&n,&m)==2){for(int i=0;i<m;i++){sum=sum+n;n=sqrt(n);}printf("%.2lf\n",sum);sum=0;}}Hdu 2010#include<stdio.h>void main(){int a,b,i,t,x,y,z,count=0;while(scanf("%d%d",&a,&b)!=EOF){if(a>b) {t=a;a=b,b=t;}if(a<100||b>999) goto m;for(i=a;i<=b;i++){x=(i%100)%10;y=(int(i/10))%10;z=int(i/100);if(x*x*x+y*y*y+z*z*z==i){count+=1;if(count==1)printf("%d",i);else printf(" %d",i);}}m: {if(count>=1) printf("\n");else { printf("no\n");x=0;y=0;z=0; }}count=0;}}Hdu 2011#include<stdio.h>#include<math.h>int main(){int n;double a,i=1.0;double sum=0,b=0;while(scanf("%d",&n)!=EOF){while(n--){scanf("%lf",&a);for(i=1;i<=a;i++){sum=sum+(1/i)*pow(-1.0,i+1);}printf("%.2lf\n",sum);sum=0;}}}Hdu 2012#include<stdio.h>#include<math.h>int fun1(int x){return x*x+x+41;}int fun2(int x){for(int i=2;i<x;i++){if(x%i==0) { return 1;}}return 0;}void main(){int a,b,m,n,t,sum=0;while(scanf("%d %d",&a,&b)!=EOF){if(a==0&&b==0)continue;else if(a>b){t=a;a=b;b=t;}{/*if(a>b) { c=a;a=b;b=c;}*/for(int i=a;i<=b;i++){m=fun1(i);n=fun2(m);sum+=n;}if(sum!=0){printf("Sorry\n");}else{printf("OK\n");}sum=0;}}}Hdu 2013#include<stdio.h>#include<math.h>int main(){int x,n;while(scanf("%d",&n)!=EOF){if(n==0) break;n=pow(2,n-1);printf("%d\n",3*n-2);}}Hdu 2014#include<stdio.h>int main(){int n,i;float a[100],sum,max,min;while(scanf("%d",&n)!=EOF){sum=0;for(i=0;i<n;i++)scanf("%f",&a[i]);max=min=a[0];for(i=0;i<n;i++){if(a[i]>max)max=a[i];if(a[i]<min)min=a[i];sum+=a[i];}printf("%.2f\n",(sum-min-max)/(n-2));}}Hdu 2016#include<stdio.h>void main(){int a[99],n,i,min,t=0;while(scanf("%d",&n)!=EOF){if(n==0) break;else{for(i=0;i<n;i++) scanf("%d",&a[i]);min=a[0];for(i=0;i<n;i++){if(a[i]<=min) {min=a[i]; t=i;}}a[t]=a[0]; a[0]=min;}printf("%d",a[0]);for(i=1;i<n;i++)printf(" %d",a[i]);t=0;printf("\n");}}Hdu 2017#include <stdio.h>void main(){int count=0,i,n;char a[1000];scanf("%d",&n);while(n--){ scanf("%s",a);getchar();for(i=0;a[i];i++) //为什么？？？？？？{if(a[i]>='0'&&a[i]<='9')count++;}printf("%d\n",count);count=0;}}Hdu 2018#include<stdio.h>int main(){int a[55]={1,2,3};int n,i;while(scanf("%d",&n)==1&&n!=0){for(i=3;i<55;i++)a[i]=a[i-1]+a[i-3];printf("%d\n",a[n-1]);}}Hdu 2019#include<stdio.h>int main(){int a[100];int n,i,k=0,m;while(scanf("%d%d",&n,&m)==2&&(n!=0&&m!=0)) {for(i=0;i<n;i++){scanf("%d",&a[i]);}if(m>=a[n-1]){for(i=0;i<n;i++){printf("%d ",a[i]);}printf("%d\n",m);}else if(m<=a[0]){printf("%d",m);for(i=0;i<n;i++){printf(" %d",a[i]);}printf("\n");}else{for(i=0;i<n;i++){if(a[i]>=m){k=i;break;}}for(i=0;i<k;i++){printf("%d ",a[i]);}printf("%d",m);for(i=k;i<n;i++){printf(" %d",a[i]);}printf("\n");}}}Hdu 2020#include<stdio.h>#include<math.h>int main (){int i,j,t,n,a[100];while(scanf("%d",&n)!=EOF&&n!=0){for(i=0;i<n;i++)scanf("%d",&a[i]);for(i=0;i<n;i++){for(j=0;j<n-i-1;j++){if(abs(a[j])<abs(a[j+1])){t=a[j];a[j]=a[j+1];a[j+1]=t;}}}printf("%d",a[0]);for(i=1;i<n;i++)printf(" %d",a[i]);printf("\n");}}Hdu 2021#include<stdio.h>int fun(int x){int a=0,b=0,c=0,d=0,e=0,f=0;a=(int)(x/100);b=(int)((x-100*a)/50);c=(int) ((x-100*a-50*b)/10);d=(int)((x-100*a-50*b-10*c)/5);e=(int) ((x-100*a-50*b-10*c-5*d)/2);f=x-100*a-50*b-10*c-5*d-2*e;return a+b+c+d+e+f;}void main(){int n,a[100],sum;while(scanf("%d",&n)!=EOF){if(n==0) break;sum=0;for(int i=0;i<n;i++){scanf("%d",&a[i]);sum+=fun(a[i]);}printf("%d\n",sum);}}Hdu 2025#include<stdio.h>#include<string.h>int main(){char a[100],max;int i,l;while(scanf("%s",a)!=EOF){getchar();l=strlen(a);max=a[0];for(i=1;i<l;i++){if(a[i]>=max){max=a[i];}}for(i=0;i<l;i++){if(a[i]<max)printf("%c",a[i]);if(a[i]==max)printf("%c(max)",a[i]);}printf("\n");}}Hdu 2027#include <stdio.h>void main(){int n,i,a,b,c,d,e,k=0;char f[100];scanf("%d",&n);while(n--){a=b=c=d=e=k=0;scanf("%s",f);getchar();for(i=0;f[i];i++){if(f[i]=='a'||f[i]=='A')a++;if(f[i]=='e'||f[i]=='E')b++;if(f[i]=='i'||f[i]=='I')c++;if(f[i]=='o'||f[i]=='O')d++;if(f[i]=='u'||f[i]=='U')e++;}printf("a:%d\ne:%d\ni:%d\no:%d\nu:%d\n",a,b,c,d,e);if(n) printf("\n"); //重要！！！！！！！！！！！！！！！！！！}}Hdu 2028#include<stdio.h>void main(){int a[100];int i,j,min,max,n,count=0;while(scanf("%d",&n)!=EOF){for(i=0;i<n;i++){min=a[0];max=a[0];scanf("%d",&a[i]);if(a[i]>=max)max=a[i];if(a[i]<=min)min=a[i];}for(j=max;;j++){count=0;for(i=0;i<n;i++)if(j%a[i]==0) count++;if(count==n) break;}printf("%d\n",j);}}Hdu 2029#include <stdio.h>#include <stdlib.h>#include <string.h>int main(){int n,i,m=0,b,j;char a[1000];while(scanf("%d",&n)!=EOF){getchar();for(i=0;i<n;i++){gets(a);b=strlen(a);for(j=0;j<b/2;j++){if(a[j]!=a[b-j-1])m++;}if(m==0)printf("yes\n");elseprintf("no\n");m=0;}}return 0;}Hdu 2030#include<stdio.h>#include<string.h>int main(){int i,j,n,m,count,b;char a[5000];scanf("%d",&b);getchar();while(b--){gets(a); //用gets！！！！！！！count=0;j=strlen(a);for(i=0;i<j;i++){if(a[i]<0)count++;}printf("%d\n",count/2);}}Hdu 2033#include<stdio.h>void main(){int a1,b1,c1,n,i,a2,b2,c2,x,y,z,a3,b3,c3;scanf("%d",&n);for(i=0;i<n;i++){scanf("%d%d%d%d%d%d",&a1,&b1,&c1,&a2,&b2,&c2);c3=(c1+c2)%60; x=(c1+c2-c3)/60;b3=(b1+b2+x)%60; y=(b1+b2+x-b3)/60;a3=a1+a2+y;printf("%d %d %d\n",a3,b3,c3);a1=a2=c1=b1=b2=c2=x=y=z=0;}}Hdu 2035#include <stdio.h>void main(){int n,m,t,i;while(scanf("%d%d",&n,&m)!=EOF){if(n==0&&m==0)break;t=1;for(i=0;i<m;i++){t=t*n;t=t%1000;}printf("%d\n",t);}}Hdu 2039#include<stdio.h>int main(){double a,b,c;int N;scanf("%d",&N);while (scanf("%lf %lf %lf",&a,&b,&c)==3){if(a+b>c&&a+c>b&&b+c>a&&a-b<c&&a-c<b&&b-c<a) printf("YES\n");elseprintf("NO\n");}return 0;}Hdu 2040#include<stdio.h>int fun(int x){int i,sum=0;for(i=1;i<x;i++){if(x%i==0){sum+=i;}}return sum;}int main(){int n,a,b;while(scanf("%d",&n)>0){while(n--){scanf("%d%d",&a,&b);if(fun(a)==b&&fun(b)==a)printf("YES\n");else printf("NO\n");}}}Hdu 2041#include<stdio.h>int main(){double f[40]={1,1};int n,m;for(int i=2;i<40;i++)f[i]=f[i-1]+f[i-2];while(scanf("%d",&n)!=EOF){for(int j=0;j<n;j++){scanf("%d",&m);printf("%.0lf\n",f[m-1]);}}}Hdu 2042#include<stdio.h>int main(){double f[31]={3};int n,m;for(int i=1;i<31;i++)f[i]=2*f[i-1]-2;while(scanf("%d",&n)!=EOF){for(int j=0;j<n;j++){scanf("%d",&m);printf("%.0lf\n",f[m]);}}}Hdu 2043#include<string.h>#include <stdio.h>void main(){int x=0,y=0,z=0,m=0,b,i,n;char a[50];scanf("%d",&n);while(n--){scanf("%s",a);getchar();b=strlen(a);if(strlen(a)>=8&&strlen(a)<=16){for(i=0;i<b;i++){if(a[i]>='A'&&a[i]<='Z')x=1;if(a[i]>='a'&&a[i]<='z')y=1;if(a[i]>='0'&&a[i]<='9')z=1;if(a[i]=='~'||a[i]=='!'||a[i]=='@'||a[i]=='#'||a[i]=='$'||a[i]=='%'||a[i]=='^')m=1;}if(x+y+z+m>=3)printf("YES\n");elseprintf("NO\n");x=y=z=m=0;}elseprintf("NO\n");}}Hdu 2044#include<stdio.h>int main (){__int64 a[50]={0,1,2};int i,n,c,b;while(scanf("%d",&n)!=EOF){while(n--){for(i=3;i<50;i++)a[i]=a[i-1]+a[i-2];scanf("%d%d",&c,&b);printf("%I64d\n",a[b-c]);}}}Hdu 2045#include<stdio.h>int main(){__int64 a[51]={3,6,6};int i,n;while(scanf("%d",&n)!=EOF){for(i=3;i<51;i++){ a[i]=a[i-1]+2*a[i-2]; }printf("%I64d\n",a[n-1]);}}Hdu 2046#include<stdio.h>int main(){double f[51]={1,2,3};int n;for(int i=3;i<51;i++)f[i]=f[i-1]+f[i-2];while(scanf("%d",&n)!=EOF){printf("%.0lf\n",f[n-1]);}return 0;}Hdu 2047#include<stdio.h>int main(){__int64 a[40]={3,8};int i,n;while(scanf("%d",&n)!=EOF){for(i=2;i<40;i++)a[i]=2*(a[i-2]+a[i-1]);printf("%I64d\n",a[n-1]);}}。

计算机机试指南九度OJ机试题目解析复试机试参考

计算机机试指南九度OJ机试题目解析复试机试参考1概述九度OJ是专门面向计算机考研机试的一款在线Online Judge系统，但很遗憾目前已经下线，本文档基于本人考研刷题经验结合网络搜索的原题和题解，汇总形成。

题目不全，希望以此为引入，方便计算机考研的同学参考使用，形成自己的汇总文档。

部分原题描述和代码收集于网络，如遇到代码有误或侵权可及时与我们联系。

题型分类：（1）模拟类型这种题目不难，看懂题目的意思，用代码模拟实现，需要练习和积累技巧。

（2）字符串处理很常见的提醒，所有OJ都有此种类型的题目，往往会结合其他提醒一起考，可简单可复杂。

查找、替换、排序、转换、存储等，有些库函数可以直接实现字符处理，比如整数判断，小写字母判断，查找等，也需要积累。

（3）栈和队列用这种数据结构的题目特征比较明显，比如栈先进后出，队列先进先出，队列常用于辅助bfs，dfs底层用到栈。

（4）各种排序如何记住各类排序，可从上层按方式分。

基于交换的，基于选择的，然后每个下面再分多个。

排序这里OJ题目一半不区分稳定性，只要能实现即可，归并排序是重点，归并的思想会穿插在做其他类型的题目中，另外各个语言下的库函数排序函数要记住，当排序不是作为主要考察对象时，可以直接用。

（5）数学问题高精度计算，大整数加减乘除，进制转换，公约数公倍数相关，质数相关，矩阵，日历等问题。

（6）数据结构相关链表指针操作，数组，各种数据结构的存储；树相关，比如建树，排序，遍历，哈夫曼树。

图相关：求最短路，求最小生成树，并查集，dfs，bfs。

dfs，bfs经常用于求迷宫问题。

（7）算法相关递归，地推，斐波那契数列，跳台阶，动态规划：序列，最小子序列，最长回文子串，背包问题等。

2模拟类型题目2.1输出梯形题目描述：输入一个高度h，输出一个高为h，上底边为h的梯形。

输入：一个整数h(1<=h<=1000)。

输出：h所对应的梯形。

样例输入：4样例输出：****************************提示：梯形每行都是右对齐的，sample中是界面显示问题来源：2001年清华大学计算机研究生机试真题(第II套)3字符串处理3.1字符串连接题目描述：不用strcat 函数，自己编写一个字符串链接函数MyStrcat(char dstStr[],charsrcStr[])输入：两个字符串，字符串由小写字母组成。

杭电多校题解

杭电多校题解1. 简介杭电多校题解是指对杭州电子科技大学（Hangzhou Dianzi University，简称杭电）多校联合训练赛（简称多校赛）中的题目进行解答和分析的过程。

多校赛是中国大学生计算机竞赛中的一项重要赛事，吸引了全国各高校的优秀选手参与。

本文将从以下几个方面对杭电多校赛的题目进行解答和分析：1.多校赛的背景和意义2.题目类型和难度分析3.解题思路和算法分析4.代码实现和优化策略5.比赛经验和技巧总结2. 多校赛的背景和意义多校赛是中国大学生计算机竞赛中的一项重要赛事，由杭州电子科技大学、浙江大学、浙江工业大学、浙江理工大学和浙江农林大学等五所高校联合举办。

多校赛旨在提高大学生的算法设计和编程能力，促进各高校之间的学术交流和合作。

参加多校赛可以帮助选手提高解决问题的能力，培养团队协作精神，提升算法和数据结构的应用能力。

同时，多校赛也是选拔优秀人才的重要途径，各大高校和企业会通过多校赛的成绩来选拔和录取优秀的计算机专业学生。

3. 题目类型和难度分析多校赛的题目类型多样，涵盖了各个领域的算法和数据结构。

常见的题目类型包括动态规划、图论、字符串处理、贪心算法、搜索算法等。

题目的难度也不一，有些题目较为简单，适合初学者入门，而有些题目则较为困难，需要较高的算法和编程能力才能解答。

在解题过程中，需要仔细阅读题目描述，理解题目要求和限制条件。

对于较难的题目，可以先尝试分析问题的性质和特点，然后设计相应的算法。

对于已有的经典算法和数据结构，可以尝试将其应用到题目中，提高解题效率。

4. 解题思路和算法分析解题思路和算法分析是解决多校赛题目的关键步骤。

在解题过程中，需要根据题目的要求和限制条件，设计合适的算法来解决问题。

以下是一些常见的解题思路和算法分析方法：•动态规划：对于一些具有最优子结构性质的问题，可以使用动态规划算法来解决。

动态规划将问题分解为子问题，并通过保存子问题的解来避免重复计算，从而提高算法效率。

zoj浙江大学oj题目分类

搜索1002 Fire Net1004 Anagrams by Stack1005 Jugs1008 Gnome Tetravex1091 Knight Moves1101 Gamblers1204 Additive equations1221 Risk1230 Legendary Pokemon1249 Pushing Boxes1364 Machine Schedule1368 BOAT1406 Jungle Roads1411 Anniversary1453 Surround the Trees 凸包1516 Uncle Tom's Inherited Land1525 Air Raid1586 QS Network1602 Multiplication Puzzle dp1649 Rescue1671 Walking Ant1711 Sum It Up dfs1901 A Star not a Tree? 说他搜索可能有点争议（不管了）1940 Dungeon Master2100 Seeding2110 Tempter of the Bone2140 Bal难题&经典1003 Crashing Balloon1015 Fishing Net 完美图1144 Robbery1149 Dividing up1161 Gone Fishing1197 Sorting Slides1217 Eight1228 Farewell, My Friend1237 Fans and Gems1455 Schedule Problem1456 Minimum Transport Cost 图论最短路径要保存路径1492 Maximum Clique 图论经典算法--最大团1600 Market Place1605 One-way Traffic1568 WishingBone's Room Plan1742 Gap 至今一点想法都没有，难！！！1743 Concert Hall Scheduling1827 The Game of 31 博弈1855 Maze1903 Jogging Trails 中国邮路问题1909 Square 经典的dfs.2064 Bomberman - Just Search! 经典！2094 Max Angle 计算几何+博弈2125 Rocket Mania2126 Rocket Mania Plus2127 Zuma2128 Seven Seas2129 Mummy Maze2142 Light The Square （24道）dp1499 Increasing Sequences 经典题1107 FatMouse and Cheese 很好的一题1039 Number Game 没有完美解决的题，感觉可以直接以所有剩下的数作为状态DP 1227 Free Candies SRbGa的经典题1234 Chopsticks SRbGa的经典题……1554 Folding 推荐2059 The Twin Towers 推荐2097 Walking on a Chessboard 推荐1011 NTA 可用dp，也可以不用1013 Great Equipment1024 Calendar Game1027 Human Gene Functions1037 Gridland1052 Algernon's Noxious Emissions1058 Currency Exchange1076 Gene Assembly1092 Arbitrage1093 Monkey and Banana1094 Matrix Chain Multiplication1100 Mondriaan's Dream DP可以过，不过有组合公式1103 Hike on a Graph1134 Strategic Game1147 Formatting Text1148 The Game1161 Gone Fishing1180 Self Numbers1192 It's not a Bug, It's a Feature!1196 Fast Food1136 Multiple ，BFS1276 Optimal Array Multiplication Sequence1255 The Path1250 Always On the Run1213 Lumber Cutting1206 Win the Bonus1301 The New Villa1303 Jury Compromise 其实不是很难，但是很容易错1345 Best Deal1360 Radar Installation1396 The Umbrella Problem: 20541425 Crossed Matchings1438 Asteroids!1459 String Distance and Transform Process1462 Team Them Up!1556 Heroes Of Might And Magic1520 Duty Free Shop1524 Supermarket1536 Labyrinth1479 Dweep1245 Triangles 可用dp也可搜索1011 NTA 简单题1013 Great Equipment 简单题1024 Calendar Game 简单题1027 Human Gene Functions 简单题1037 Gridland简单题1052 Algernon\'\'s Noxious Emissions 简单题1409 Communication System 简单题，但是很容易看错~~~ 1425 Crossed Matchings简单题1438 Asteroids! 简单题1459 String Distance and Transform Process 简单题1462 Team Them Up! 简单题1556 Heroes Of Might And Magic 简单题，不过背景蛮有意思的……1520 Duty Free Shop 简单题1524 Supermarket 简单题1301 The New Villa 简单题1303 Jury Compromise 其实不是很难，但是很容易错，555……1345 Best Deal 简单题，但是也很容易错……555……1360 Radar Installation 简单题1396 The Umbrella Problem: 2054 简单题1058 Currency Exchange 简单题1076 Gene Assembly 简单题1092 Arbitrage 简单题1093 Monkey and Banana 简单题1094 Matrix Chain Multiplication 简单题1536 Labyrinth 简单题1100 Mondriaan\'\'s Dream 简单题，DP可以过，不过据说有复杂的组合公式1103 Hike on a Graph 简单题1134 Strategic Game 简单题1147 Formatting Text 简单题1148 The Game 简单题1161 Gone Fishing 简单题1180 Self Numbers 简单题1192 It\'\'s not a Bug, It\'\'s a Feature! 简单题1196 Fast Food 简单题1107 FatMouse and Cheese 简单题，不过题目描述有些混乱1136 Multiple 简单题，BFS1276 Optimal Array Multiplication Sequence 简单题1255 The Path 简单题1250 Always On the Run 简单题1213 Lumber Cutting 简单题1206 Win the Bonus 简单题1479 Dweep无聊题1587 UP 100 无聊题，DP应该可以……但是太烦了……没做……1066 Square Ice 无聊题，目前已知的O(nlogn)算法要用AVL……您有没有简单点的O(nlogn)的算法？1245 Triangles 无聊题1022 Parallel Expectations 经典题，想了n久，最后发现可以DP，相当好的一道题1499 Increasing Sequences 经典题{}1039 Number Game 没有完美解决的题，感觉可以直接以所有剩下的数作为状态DP，但是缺乏证明……1227 Free Candies SRbGa的经典题，我看了oibh上的解题报告才做出来的……1234 Chopsticks SRbGa的经典题……图论:1525 Air Raid 最小路径覆盖1500 Pre-Post-erous! 简单题1501 Knockout Tournament 简单题1508 Intervals 对您来说应该是简单题，但我想了n久……，差分限制系统1333 Galactic Import 简单题1304 Tin Cutter 简单题，但是似乎有空间复杂度为O(n)的算法1310 Robot 简单题1311 Network 简单题1344 A Mazing Problem 简单题1395 Door Man 简单题，欧拉回路1372 Networking 简单题1406 Jungle Roads 简单题1053 FDNY to the Rescue! 简单题1055 Oh, Those Achin\'\' Feet 不错的简单题1059 What\'\'s In a Name 二分图完美匹配1064 Roads Scholar 简单题1082 Stockbroker Grapevine 简单题1085 Alien Security 简单题，我觉得我当时的算法好巧妙1097 Code the Tree 简单题1060 Sorting It All Out 简单题，但是规模要是大些的话……1105 FatMouse\'\'s Tour 简单题1119 SPF 简单题1127 Roman Forts 简单题1140 Courses 简单题1157 A Plug for UNIX 蛮不错的简单题1203 Swordfish 简单题1221 Risk 简单题1197 Sorting Slides 简单题，匹配1268 Is It A Tree? 不错的题，图论1273 It\'\'s Ir-Resist-Able! 简单题，图论1298 Domino Effect 简单题，最长路1260 King 简单题，差分限制系统……1291 MPI Maelstrom 不错的题，最长路1266 Gossiping 简单题1285 Shipping Routes 无聊题，最短路1313 Gears on a Board 无聊题1502 Plugged In 无聊题，匹配应该可以，但是太烦了，没做……1568 WishingBone\'\'s Room Plan 无聊题，最大最小匹配，不过容易看错题~~~~~~~~1077 Genetic Combinations 无聊题，匹配1364 Machine Schedule 匹配1137 Girls and Boys 背诵题，匹配……1023 University Entrace Examination 经典题，但是和1576重复1576 Marriage is Stable 经典题，感人的背景，经典的算法……1249 Pushing Boxes 经典题，某人的论文写过，求割点和块+BFS可以在O(面积)的时间内做出来，没时间看论文，我用双重BFS过的1141 Closest Common Ancestors 没有完美解决，最简单的算法就能过，但要是规模大了……1084 Channel Allocation 尚未完美解决，我用搜索过的，不过是不是有更好的算法呢……？1231 Mysterious Mountain SRbGa的经典题……1232 Adventure of Super Mario SRbGa的经典题……数学:1007 Numerical Summation of a Series 简单题，还是蛮有意思的1045 HangOver简单题1049 I Think I Need a Houseboat 简单题1028 Flip and Shift 简单题，可以DP/BFS/……，但是实际上有数学方法可以直接判断出来1026 Modular multiplication of polynomials 简单题，感觉有比较简单的好算法，但想不出来1307 Packets 简单题，不过也蛮经典的……1312 Prime Cuts 简单题1334 Basically Speaking 简单题1337 Pi 简单题1342 Word Index 简单题1349 Four Quarters 简单题1350 The Drunk Jailer 简单题1352 Number Base Conversion 简单题1353 Unimodal Palindromic Decompositions 规模不大，所以是简单题……1354 Extended Lights Out 简单题1362 Game Prediction 简单题1365 Mileage Bank 简单题1382 A Simple Task 简单题1383 Binary Numbers 简单题1403 Safecracker 简单题1408 The Fun Number System 简单题1486 Color the Tree 简单题1487 Playing Cards 简单题1489 2^x mod n = 1 简单题，应该有好算法，枚举过的……1503 One Person "The Price is Right" 简单题，POI Eggs的翻版1512 Water Treatment Plants 简单题，组合计数1526 Big Number 简单题，不过O(1)和O(n)还是有区别的1529 Enigmatic Travel 简单题，不过个人感觉题目描述很令人费解1530 Find The Multiple 简单题1537 Playing with a Calculator 简单题1577 GCD & LCM 简单题，分区联赛的题……1005 Jugs 简单题1543 Stripies简单题1569 Partial Sums 简单题1062 Trees Made to Order 简单题1070 Bode Plot 简单题1073 Round and Round We Go 简单题1078 Palindrom Numbers 简单题1086 Octal Fractions 简单题1199 Point of Intersection 简单题1104 Leaps Tall Buildings 简单题1110 Dick and Jane 简单题1115 Digital Roots 简单题1113 u Calculate e 简单题1152 A Mathematical Curiosity 简单题1154 Niven Numbers 简单题1160 Biorhythms 简单题1163 The Staircases 简单题1177 K-Magic Number 简单题1184 Counterfeit Dollar 简单题1182 Keeps Going and Going and ... 简单题1284 Perfection 简单题1272 Numerically Speaking 简单题1269 Coconuts, Revisited 简单题1247 There\'\'s Treasure Everywhere! 简单题1241 Geometry Made Simple 简单题1202 Divide and Count 简单题1216 Deck 简单题1218 Ratio 简单题1261 Prime Land 简单题1212 Mountain Landscape 无聊题1410 Number Sequence 无聊题1401 Hilbert Curve Intersections 无聊题1331 Perfect Cubes 无聊题1322 Random Number 无聊题1535 Lucky Ticket 无聊题1539 Lot 无聊题1363 Chocolate 经典题……1366 Cash Machine 经典题！强烈推荐！1149 Dividing up 经典题，应该可以用1366的方法做，但似乎可以利用问题的特殊性用贪心+DP在O(1)的时间内做出来1222 Just the Facts 经典题，没有完美解决,据说可能有O(logn)的做法1475 Ranklist1572 Bracelet ~~~题义不明，感觉可能是判定欧拉回路的存在性1133 Smith Numbers 没有完美解决，数学1080 Direct Subtraction1229 Gift?! SRbGa的经典题……1238 Guess the Number SRbGa的经典题……1239 Hanoi Tower Troubles Again! SRbGa的经典题……字符串处理:1050 Start Up the Startup 简单题1315 Excuses, Excuses! 简单题1151 Word Reversal 简单题1170 String Matching 简单题1174 Skip Letter Code 不错的简单题1175 Word Process Machine 简单题1181 Word Amalgamation 简单题1038 T9 无聊题，单词树1330 DNA Translation 无聊题1335 Letter Sequence Analysis 无聊题1099 HTML 无聊题1243 URLs 无聊题1540 Censored! 经典题！强烈推荐！1511 Word Puzzles 后缀树模拟:1051 A New Growth Industry 简单题1300 Border 简单题1326 M*A*S*H 简单题1494 Climbing Worm 简单题1072 Microprocessor Simulation 简单题1098 Simple Computers 简单题1056 The Worm Turns 简单题1195 Blowing Fuses 简单题1189 Numbers That Count 简单题1144 Robbery 简单题1153 Tournament Seeding 简单题，但是直接计算好像不行，得模拟……1167 Trees on the Level 简单题1200 Mining 简单题1278 Pseudo-Random Numbers 简单题1257 Parking Lot 简单题1270 Nonstop Travel 简单题1207 The Knight, the Princess, and the Dragons 无聊题1169 Square Cipher 无聊题1176 Die and Chessboard 无聊题1178 Booklet Printing 无聊题1009 Enigma 无聊题，但是很容易错……1012 Mainframe 无聊题，但是很容易错……1324 Unix ls无聊题，输出格式没说清楚~~~~~~~1336 Mark-up 无聊题1277 Transferable Voting 无聊题1279 Cowculations无聊题1281 Hi-Q 无聊题1282 Call Forwarding 无聊题1065 Robots 变态题，太复杂啦~~~~~~~~~~~1208 Roll the Die! 变态题1388 Exchanges 经典题！强烈推荐！1236 Eat or Not to Eat? SRbGa的经典题……模拟几何:1575 Koch Curve 简单题1010 Area 简单题1565 Input 简单题1081 Points Within 简单题1165 Laser Lines 简单题1248 Video Surveillance 简单题，李彭煦的论文中写到过，好像是某年CTSC的……1299 Pendulum 简单题1090 The Circumference of the Circle 无聊题1271 Doing Windows 无聊题1280 Intersecting Lines 无聊题1296 Stars 经典变态题……1030 Farmland 变态题1041 Transmitters 变态题1158 Treasure Hunt 经典题1139 Rectangles 没有完美解决其它:1006 Do the Untwist 简单题1014 Operand 简单题1016 Parencodings 简单题1042 W\'\'s Cipher 简单题1047 Image Perimeters 简单题1514 Fake Tickets 简单题1029 Moving Tables 简单题，好像是线段树的经典题目之一，但是这题规模比较小，所以不必用。

杭电OJ的输入输出格式题

杭电OJ的输入/输出格式题输入一、1000 A + B Problem题目名称：A + B Problem链接地址：/showproblem.php?pid=1000Time Limit: 1 Seconds Memory Limit:32768KTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionCalculate A + B.InputEach line will contain two integers A and B. Process to end of file.OutputFor each case, output A + B in one line.Sample Input1 1Sample Output2参考答案#include <stdio.h>int main(void){int a,b;while(scanf("%d%d",&a,&b)!=EOF)printf("%d\n",a+b);return 0;}二、1002 A + B Problem II题目名称：A + B Problem II链接地址：/showproblem.php?pid=1002Time Limit: 1 Seconds Memory Limit:32768KTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22627 Accepted Submission(s): 4035Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.InputThe first line of the input contains an integer T(1<=T<=20) which me ans the number of test cases. Then T lines follow, each line consis ts of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. You may assume the length of each integer will not exceed 1000.OutputFor each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line is the an equation "A + B = Sum", Sum means the result of A + B . Note there are some spaces int the equation. Output a blank line between two test cases.Sample Input21 2112233445566778899 998877665544332211Sample OutputCase 1:1 +2 = 3Case 2:112233445566778899 + 998877665544332211 = 1111111111111111110思路：本题是手工模拟两个大数相加的问题。

杭电OJ水题答案

Hdu1000,1090#include<stdio.h>int main(){int a,b;while (scanf("%d %d",&a,&b)==2)printf("%d\n",a+b);return 0;}Hdu1008#include<stdio.h>int main(){int n,i,j;int t;while(scanf("%d",&n)!=EOF){t=5*n;j=0;if(n==0)break;while(n--){scanf("%d",&i);if(i>j)t+=(i-j)*6;if(i<j)t+=(j-i)*4;j=i;}printf("%d\n",t);}}Hdu1021#include <stdio.h>int main(){int n;while(scanf("%d",&n)!=EOF){n=n%8;if(n==2||n==6)printf("yes\n");elseprintf("no\n");}return 0;}Hdu1040#include<stdio.h>int main(){int i,j,n,m,a[2000],t;scanf("%d",&n);while(n--){scanf("%d",&m);for(i=0;i<m;i++)scanf("%d",&a[i]);for(i=0;i<m;i++)for(j=0;j<m-1-i;j++)if(a[j]>a[j+1]){t=a[j];a[j]=a[j+1];a[j+1]=t;}printf("%d",a[0]);for(i=1;i<m;i++)printf(" %d",a[i]);printf("\n");}}Hdu1076#include<stdio.h>int main(){int count=0,i,n,j,a,b;while(scanf("%d",&n)!=EOF){for(i=0;i<n;i++){scanf("%d %d",&a,&b);for(j=a;;j++){if((j%100==0&&j%400==0)||(j%100!=0&&j%4==0)){ count++; }if(count==b) break;}printf("%d\n",j);count=0;}}}Hdu1091#include<stdio.h>int main(){double a;double b;while(scanf("%lf %lf",&a,&b))if(a==0 && b==0)break;elseprintf("%.0lf\n",a+b);return 0;}Hdu1092#include<stdio.h>void main(){int n,i,a,sum=0;while(scanf("%d",&n)!=EOF){if(n==0)continue;elsefor(i=1;i<=n;i++){scanf("%d",&a);sum+=a;}printf("%d\n",sum);sum=0;}}}Hdu1093#include<stdio.h>int main(){int n,i,j,a,sum=0;scanf("%d",&j);for(int b=0;b<j;b++){while(scanf("%d",&n)!=EOF){for(i=1;i<=n;i++){scanf("%d",&a);sum+=a;}printf("%d\n",sum);sum=0;}}}Hdu1094#include<stdio.h>int main(){int n,i,a,sum=0;while(scanf("%d",&n)!=EOF) {for(i=1;i<=n;i++)scanf("%d",&a);sum+=a;}printf("%d\n",sum);sum=0;}}Hdu1095#include<stdio.h>int main(){int a,b;while (scanf("%d %d",&a,&b)==2)printf("%d\n\n",a+b);return 0;}Hdu1096#include<stdio.h>int main(){int N;scanf("%d",&N);while(N--){int M,i,a,sum=0;scanf("%d",&M);for(i=0;i<M;i++){scanf("%d",&a);sum+=a;}if(N!=0)printf("%d\n\n",sum);elseprintf("%d\n",sum);}}Hdu1108#include<stdio.h>void main (){unsigned int b, a, i=1;while(scanf("%d %d",&a,&b)!=EOF){for(i=1;;i++){if(i%a==0&&i%b==0){printf("%d\n",i);break;}}}}Hdu1201#include<stdio.h>void main(){int a,b,c,i,n,count1,count2,sum;while(scanf("%d",&n)!=EOF){while(n--){scanf("%d-%d-%d",&a,&b,&c);if(b==2&&c==29){ printf("-1\n"); }else{count1=0;sum=0;for(i=a;i<a+18;i++){if((((i%100!=0&&i%4==0)||(i%400==0))&&b<=2)||((((i+1)%100!=0&&(i+1)%4==0)||((i+1) %400==0))&&b>2))sum+=366;elsesum+=365;}printf("%d\n",sum);}}}}Hdu1235#include<stdio.h>void main(){int a,b,c,i,n,f[1000],count=0;while(scanf("%d",&n)>0){if(n==0) break;for(i=0;i<n;i++)scanf("%d",&f[i]);scanf("%d",&c);for(i=0;i<n;i++){if(f[i]==c)count++;}printf("%d\n",count);count=0;}}Hdu1046#include<stdio.h>int f(int x){int j,sum=0;for(j=1;j<x;j++){if(x%j==0)sum+=j;}if(x==sum)return 1;else return 0;sum=0;}void main(){unsigned int i,n,a,b,t,x,count=0;while(scanf("%d",&n)>0){while(n--){scanf("%d%d",&a,&b);if(a>b) {t=a;a=b;b=t; }for(i=a;i<=b;i++){x=f(i);if(x==1) //1是完数count++;}printf("%d\n",count);count=0;}}}。

杭电oj部分水题 c语言源代码

{
if(n==0)
break;
a=b=c=0;
for (i = 1 ; i <= n ; i++){
scanf("%d",&m);
if(m>0)
{c=c+1;}
else if(m==0)
{ b=b+1;}
}
return 0;
}
1091 A+B for Input-Output Practice (III)
#include<stdio.h>
int main()
{
int a,b;
while(scanf("%d%d",&a,&b)){
if(a==0&&b==0)
break;
for(s = 0.0,i=0; i<n;i++ ){
s=s+x; x = sqrt(x);
}
printf("%.2lf\n", s);
}
return 0;
}
2010 水仙花数
#include<stdio.h>
for (i = m ; i <= n ; i++){
if(i%2==0)
{ a=pow(i,2);
x=x+a;}
else
{ b=pow(i,3);
y=y+b;}
}
printf("%.0lf %.0lf\n", x, y);
1000和1089 A+B for Input-Output Practice (I)

From [cout]Bing 杭电题目分类排序列表仅供参考 (1)

163 167 167 174 175 190 195 204 216 222 224
235
294 303 309 311 340 358 360 363 367 413 414 443 480 494 576 660 740 856 941 1001 1004
1157 AC AC AC 2059 1421 2602 1864 1024 1466 AC AC AC AC 1058 1087 2037 1003 1402 3177 1055 3348 AC 4070 1789 1051 1052 AC 1050 1512 1538 1006 1007 1381 AC 4148 1572 1242 3699 1105 1111 1112 1511
48.41% 36.03% 30.60% 35.02% 24.16% 32.56% 43.92% 41.61% 39.40% 50.28% 21.66% 13.21% 34.55% 33.50% 25.51% 57.24% 58.71% 39.03% 26.27% 33.66% 47.49% 45.45% 23.50% 23.00% 49.39% 71.83% 26.34% 37.21% 100.00% 30.00% 4.76% 52.00% 35.48%
跑跑卡丁车 Free DIY Tour Advanced Fruits Frog 武林 Mondriaan's Dream Greatest Common Increasing Subsequence Pascal's Travels White Rectangles Max Sum Plus Plus Plus WHUgirls Tree Construction Fast Food Beans How many ways Coins Palindrome Chopsticks 命运 City Game Human Gene Functions Function Run Fun Eddy's research II Doing Homework Employment Planning FatMouse and Cheese Largest Rectangle in a Histogram Zipper Piggy-Bank Monkey and Banana 悼念512汶川大地震遇难同胞——珍惜现在，感恩生活 Constructing Roads In JGShining's Kingdom FatMouse's Speed

1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。

杭州电子科技大学OJ题目分类The Soul with Bone .:1001 整数求和水题1002 C语言实验题——两个数比较水题1003 1、2、3、4、5... 简单题1004 渊子赛马排序+贪心的方法归并1005 Hero In Maze 广度搜索1006 Redraiment猜想数论：容斥定理1007 童年生活二三事递推题1008 University 简单hash1009 目标柏林简单模拟题1010 Rails 模拟题（堆栈）1011 Box of Bricks 简单题1012 IMMEDIATE DECODABILITY Huffman编码1013 STAMPS 搜索or动态规划1014 Border 模拟题1015 Simple Arithmetics 高精度计算1016 Shoot-out 博弈+状态压缩DP1017 Tour Guide1018 Card Trick 简单题1019 Necklace Decomposition 贪心1020 Crashing Robots 模拟题1021 Electrical Outlets 简单题1022 Watchdog 简单题1023 Taxi Cab Scheme 图论：最小路径覆盖--->最大二分匹配1024 Pseudo-random Numbers 数论1025 Card Game Cheater 简单题1026 Investment 动态规划1027 Pipes1028 SETI 数学:高斯消元法1029 Minimax Triangulation 计算几何1030 Unequalled Consumption 母函数1031 Declaration of Content1032 Laserbox 搜索：DFS1033 Bowlstack1034 Pesky Heroes1035 Reduced ID Numbers 暴力1036 Tantrix1037 Guardian of Decency 图论：匈牙利算法求二分图的最大匹配1038 Up the Stairs 简单数学题1039 Sudoku 搜索：DFS1040 The SetStack Computer1041 Pie 二分法1042 Ticket to Ride 动态规划1043 The Bookcase 动态规划1044 Printer Queue 模拟题1045 Prime Path 搜索：BFS1046 Lineland's Airport1047 Leonardo's Notebook 数学题：群置换1048 简易版最长序列简单题1049 Jesse's problem 搜索：DFS1050 Error Correction 模拟题1051 A ×B problem 高精度计算1052 Redraiment的走法动态规划1053 Word Encoding 动态规划1054 Jesse's Code 组合数学：排列1055 简单密码破解水题1056 英文金曲大赛水题1057 有假币水题1058 寄居蟹与海葵水题1059 天仙配水题1060 鹊桥相会水题1061 杨辉三角水题1062 蟠桃记水题1063 养兔子水题1064 字符统计水题1065 完美数水题1066 亲和数水题1067 成绩评估水题1068 找零钱水题1069 漂亮菱形水题1070 Least Common Multiple 水题1071 第几天水题1072 编辑距离水题1073 支配值数目水题1074 等值数目水题1075 两数组最短距离水题1076 输入入门(1) 水题1077 输入入门(2) 水题1078 输入入门(3) 水题1079 输出入门水题1080 Counterfeit Dollar 组合数学1081 Dividing 动态规划1082 Sorting It All Out 图论：拓扑排序1083 False coin 暴力法1084 File Mapping1085 Color Me Less 简单题1086 Round and Round We Go 简单题1087 Microprocessor Simulation 简单题1088 求奇数的乘积水题1089 平方和与立方和水题1090 绝对值排序水题1091 JudgeOnline 水题1092 More Beautiful 水题1093 猴子分桃水题1094 C语言实验题——一元二次方程水题1095 C语言实验题——保留字母水题1096 C语言实验题——排列水题1097 C语言实验题——矩阵转置水题1098 C语言实验题——素数水题1099 Ambiguous permutations 简单题1100 Home Work 贪心法1101 Redraiment的遭遇数学题：找规律1102 Decorate the wall 搜索or动态规划1103 Economic phone calls 动态规划or贪心1104 Any fool can do it 记忆化搜索1105 Wine trading in Gergovia 贪心法1106 Homogeneous squares 随机算法1107 Automatic Correction of Misspellings 字符串处理：字典序1108 Black and white painting 简单数学题1109 Cylinder 计算几何：公式推导1110 Deli Deli 水题1111 Expressions 数据结构：树的遍历1112 Flavius Josephus Reloaded 数论：Pollard's Rho算法1113 Annoying painting tool 贪心法1114 Frequent values RMQ区间最值问题OR 线段树1115 Anagram Groups 字符串匹配1116 Let it Bead 组合数学->Polya定理1117 Simple Computers 简单题1118 Mondriaan's Dream 动态规划1119 Equidistance 计算几何1120 How many Fibs? 高精度计算1121 Hike on a Graph 搜索：BFS1122 ASCII Art1123 Billing Tables1124 Cellular Automaton 矩阵计算1125 Exchange1126 Fool's Game1127 Java vs C++ 字符串处理1128 Kickdown 字符串处理1129 Copying Books 贪心+二分法1130 Adding Reversed Numbers 简单题1131 Glass Beads 字符串的最小表示1132 The Circumference of the Circle 计算几何题1133 Knight Moves 搜索：BFS1134 Eeny Meeny Moo 变形的约瑟夫问题1135 Lotto 组合数学1136 Humble Numbers 动态规划1137 Average is not Fast Enough! 简单题1138 Etaoin Shrdlu 简单题1139 Hard to Believe, but True! 简单题1140 Code the Tree 简单题1141 Fiber Network 图论：全源最短路径，Floyd-Warshall算法1142 Global Roaming 3D几何题1143 All in All 字符串处理1144 The Sierpinski Fractal 递归1145 Assistance Required 简单题：预处理1146 Drink, on Ice 模拟题1147 All Discs Considered 搜索：BFS1148 In Danger 模拟题1149 Run Length Encoding 字符串处理1150 Bee Maja 模拟题1151 Friends 表达式求值1152 John 博弈论1153 Double Queue 最大堆与最小堆1154 ‘JBC’1155 Loan Scheduling 贪心+堆1156 Showstopper1157 Highway 贪心法1158 Computers 动态规划1159 The Stable Marriage Problem 组合数学1160 Arne Saknussemm 模拟题1161 Sum Problem 水题1162 Fire Net 搜索题1163 统计1到N之间数字1的个数推理题1164 最大公因子水题1165 C语言实验题——三个整数水题1166 C语言实验题——大小写转换水题1167 C语言实验题——分数序列水题1168 C语言实验题——最值水题1169 C语言实验题——保留整数水题1170 C语言实验题——矩阵下三角元素之和水题1171 C语言实验题——字符逆序水题1172 C语言实验题——打印菱形水题1173 C语言实验题——分割整数水题1174 C语言实验题——删除指定字符水题1175 C语言实验题——时间间隔水题1176 C语言实验题——数组逆序水题1177 C语言实验题——打印数字图形水题1178 C语言实验题——单词统计水题1179 C语言实验题——最小公倍数和最大公约数水题1180 Crashing Balloon 搜索题1181 念数字模拟题1182 A+B for Input-Output Practice(1) 水题1183 Anagrams by Stack 搜索：回溯1184 Elevator 数学：找规律1185 Substrings 字符串处理1186 Calling Extraterrestrial Intelligence Again 搜索：枚举法1187 Do the Untwist 简单数学题1188 数字对水题1189 A+B for Input-Output Practice (2) 水题1190 火星A+B 简单题1191 三齿轮问题：三个齿轮啮合简单数学题1192 A + B Problem II 高精度计算1193 The ones to remain 数学题1194 Chinese Chess 博弈论1195 Page Replacement 数据结构：队列or hash1196 RSA Signing 数论：Pollard's Rho算法1197 Number Guessing 搜索：穷举1198 求n的阶乘高精度计算1199 Area 计算几何1200 求两直线的夹角水题1201 三角形面积水题1202 Max Sum 动态规划1203 Number Sequence 大数问题1204 u Calculate e 水题1205 斐波那契数列高精度计算1206 Fibonacci Again 大数问题1207 Let the Balloon Rise 字符串处理1208 还是A+B 水题1209 A + B 水题1210 The area 简单计算几何1211 Ignatius's puzzle 简单数学问题1212 Computer Transformation 高精度计算1213 N! 高精度计算1217 Text Reverse 水题1220 填数字游戏搜索：DFS1221 Tempter of the Bone 搜索：DFS or BFS+剪枝1226 Last non-zero Digit in N! 数论1227 三角形递推求解1228 回文数猜想简单题1229 Factorial 简单题1230 Specialized Four-Digit Numbers 简单数学题1231 Lowest Bit 简单题1232 To and Fro 简单题1233 AC Me 简单题1234 Wolf and Rabbit 数论1235 最大连续子序列动态规划1236 开门人和关门人字符串处理1237 排名排序1238 统计难题字符串处理：字典树1239 Tick and Tick 数学题1240 Quoit Design 分治法1241 钱币兑换问题递推求解1242 求出前m大的数简单题1243 角谷猜想简单题1244 Reverse Number 简单题1245 寻找素数对简单题1246 ZJUTACM 简单题1247 Hat's Fibonacci 高精度计算1248 Encoding 简单题1249 四数相加高精度计算1250 两数相减高精度计算1251 Square Coins 母函数1252 Counting Triangles 递推求解1253 2^x mod n = 1 数论：费尔马小定理1254 Minimum Inversion Number 简单题1255 Surround the Trees 计算几何：凸包1256 Number Steps 简单题1257 Binary Numbers 简单题1258 Knight Moves 搜索：BFS1259 Lotto 组合数学1260 A Simple Task 简单题1261 The Drunk Jailer 数论1262 Hanoi Tower Troubles Again! 递推求解1263 IBM Minus One 水题1264 Definite Values 简单题1265 Box of Bricks 水题1266 Perfection 简单题1267 Reverse Text 水题1268 Inversion 模拟题1269 Prime Cuts 简单题1270 How Many Fibs? 高精度计算1271 Round and Round We Go 简单题1272 Red and Black 搜索：DFS1273 What Day Is It? 简单题1274 String Matching 字符串匹配1275 A Contesting Decision 简单题1276 Doubles 简单题1277 The Snail 简单题1278 Jungle Roads 图论：最小生成树1279 Prime Ring Problem 搜索：DFS1280 Big Number 大数问题1281 Least Common Multiple 简单题1283 简单排序水题1284 Gridland 简单题1285 An Easy Task 简单题1286 Calendar Game 模拟题1287 Human Gene Functions 动态规划1288 计算几何练习题——线段相交计算几何1289 计算几何练习题——线段相交II 计算几何1290 计算几何练习题——直线交点计算几何1291 Trees Made to Order 递归求解1292 排序简单题1293 18岁生日简单题1294 吃糖果递推求解1295 变种汉诺塔递推求解1296 洗牌递推求解1297 大数求余数论1298 圆桌会议递推求解1299 畅通工程并查集1300 还是畅通工程最小生成树1301 统计同成绩学生人数水题1302 简单计算器表达式求值：栈的应用1303 改进版计算器表达式求值：栈的应用1304 FatMouse' Trade 贪心法1305 Digital Roots 大数问题1306 Uniform Generator 数论1307 A Mathematical Curiosity 穷举法1308 Safecracker 穷举法1309 The 3n + 1 problem 简单题1310 分享糖果模拟题1311 宝物收集搜索：BFS1312 Climbing Worm 简单题1313 搬桌子贪心法1314 Humble Numbers 动态规划1315 Dividing 动态规划1316 Rightmost Digit 数学问题1317 Leftmost Digit 数学问题1318 Hangover 简单数学问题1319 Exponentiation 高精度计算1320 I Think I Need a Houseboat 简单题1321 Girls and Boys DFS+二分图1322 Monkey and Banana 动态规划1323 买牛奶简单题1324 Matrix Chain Multiplication 数据结构：栈的应用1325 计算成绩简单题1326 Holding Bin-Laden Captive! 母函数1327 You can Solve a Geometry Problem too 计算几何1328 Super Jumping! Jumping! Jumping! 动态规划1329 a^b 数论1330 计算GPA 水题1331 Give me an offer! 动态规划：0-1背包1332 田忌赛马贪心法1333 Asteroids! 搜索：BFS1334 Oil Deposits 搜索：DFS1335 营救天使搜索：BFS1336 小数化分数高精度计算1337 I Hate It 线段树1338 Strange Billboard 位运算+枚举1339 Frobenius 递推求解1340 奇怪的公式数学题1341 Fibonacci again and again 博弈论1342 A New Tetris Game 博弈论1343 Sum It Up 搜索：DFS1344 速算24点搜索1345 推箱子搜索：BFS1346 Pushing Boxes 搜索：BFS1347 The Worm Turns 搜索1348 Alfredo's Pizza Restaurant 简单题1349 Broken Keyboard 字符串处理1350 Convert Kilometers to Miles 简单题1351 单词数水题1352 仙人球的残影简单题1353 Family planning 简单题1354 Rout 66 简单题1355 LC-Display 模拟题1356 A == B ? 高精度计算1357 不容易系列之一递推求解1358 折线分割平面递推求解1359 find the nth digit 二分查找1360 奇数阶魔方(II) 简单题1361 Keep on Truckin' 简单题1362 Factstone Benchmark 简单题1363 Destroy the Well of Life 模拟题1365 Brave Game 博弈论1366 ASCII码排序水题1367 计算两点间的距离水题1368 计算球体积水题1369 求绝对值水题1370 数值统计水题1371 求数列的和水题1372 水仙花数水题1373 多项式求和水题1374 素数判定水题1375 偶数求和水题1376 母牛的故事水题1377 数列有序! 水题1378 发工资咯：）水题1379 C语言合法标识符水题1380 海选女主角水题1381 查找最大元素水题1382 首字母变大写水题1383 统计元音水题1384 Palindromes _easy version 水题1385 汉字统计水题1386 进制转换水题1387 人见人爱A+B 水题1388 人见人爱A-B 水题1389 人见人爱A^B 水题1390 改革春风吹满地计算几何1391 今年暑假不AC 动态规划1392 三角形水题1393 求平均成绩水题1394 不容易系列之二递推求解1395 密码水题1396 一只小蜜蜂... 递推求解1397 不容易系列之(3)——LELE的RPG难题递推求解1398 骨牌铺方格递推求解1399 阿牛的EOF牛肉串递推求解1400 神、上帝以及老天爷递推求解1401 不容易系列之(4)——考新郎递推求解1402 Bitset 简单题1403 Picture 简单模拟题1404 Switch Game 找规律1405 An easy problem 简单模拟题1406 A + B Again 简单题1407 The sum problem 简单数学题1408 龟兔赛跑动态规划1409 Snooker 简单数学题1410 Subset sequence 简单题1411 汉诺塔III 递推求解1412 "红色病毒"问题递推求解1413 小兔的棋盘递推求解1414 RPG的错排错排+排列组合1415 无限的路简单题1416 夹角有多大数学题1417 汉诺塔IV 递推求解1418 复习时间简单题1419 选课时间暴力求解1420 手机短号字符串处理1421 找单词母函数1422 简易版之最短距离数学题1423 数塔动态规划1424 核反应堆简单题1425 A1 = ? 公式推导1426 剪花布条字符串处理1427 不要62 数学题1428 空心三角形字符串处理1429 小明A+B 简单题1430 Sky数进制转换1431 整除的尾数简单题1432 分拆素数和数论1433 正整数解数学题1434 挂盐水模拟题1435 {A} + {B} 简单题1436 小数A+B 高精度计算1437 Zigzag 简单题1438 螺旋形简单题1439 行李寄存简单题1440 判断多边形凹凸计算几何1441 The centre of polygon 计算几何1442 最小正整数简单题1443 Elevator Stopping Plan 二分+贪心法1444 TOYS 计算几何1445 The Doors 计算几何1446 Polygon And Segment 计算几何1447 Fence 计算几何1448 两圆相交面积计算几何1449 Area of Circles 计算几何1450 Pipe 计算几何1451 zero sum 搜索：DFS1452 C语言实验题——Hello World 水题1453 C语言实验题——数日子水题1454 C语言实验题——三个数排序水题1455 C语言实验题——数字串求和水题1456 C语言实验题——拍皮球水题1457 C语言实验题——求一个3*3矩阵对角线元素之和水题1458 C语言实验题——数组逆序水题1459 C实验题——求最大值水题1460 C实验题——求绝对值最大值水题1461 C语言实验题——求平均值水题1462 C语言实验题——打印直角三角形水题1463 C语言实验题——相加和最大值水题1464 C语言实验题——简单编码水题1465 C语言实验题——某年某月的天数水题1466 C语言实验题——各位数字之和排序水题1467 C语言实验题——两个数最大水题1468 C语言实验题——求级数值水题1469 Pipe II 计算几何1470 Transmitters 计算几何1471 Wall 计算几何1472 C语言实验题——逆置正整数水题1473 C语言实验题——找中间数水题1474 C语言实验题——整数位水题1475 C语言实验题——一元二次方程II 水题1476 C语言实验题——圆周率水题1477 C语言实验题——余弦水题1478 C语言实验题——打印金字塔水题1479 C语言实验题——排序水题1480 C语言实验题——约瑟夫问题水题1481 C语言实验题——鞍点水题1482 C语言实验题——计算表达式水题1483 C语言实验题——汉诺塔水题1484 C语言实验题——字符串排序水题1485 C语言实验题——整除水题1486 Solitaire 搜索：（双向）BFS1487 Abbreviation 水题1488 C语言实验题——买糖果水题1489 C语言实验题——字符编码水题1490 C语言实验题——合法的C标识符水题1491 C语言实验题——三角形面积水题1492 C语言实验题——大小写转换水题1493 C语言实验题——圆柱体计算水题1494 C语言实验题——温度转换水题1495 C语言实验题——统计字串水题1496 C语言实验题——字符过滤水题1497 Coin Change 暴力求解1498 Beautiful Meadow 搜索题1499 C语言实验题——鸡兔同笼水题1500 Coins of Luck 数学题：数学期望1501 Friends 搜索：DFS1502 Find All M^N Please 数学题1503 Incredible Cows 搜索：二分+DFS1504 计算直线的交点数递推求解1505 Number Game 动态规划1506 Sort ZOJ7 字符串处理1507 Find 7 Faster Than John Von Neumann 高精度计算1508 免费馅饼动态规划1509 Worm 动态规划1510 Common Subsequence 动态规划1511 搬寝室动态规划1512 Daydream 字符串处理1513 Ballroom Lights1514 Drop the Triples1515 Finding Seats1516 He is offside!1517 Justice League1518 星星点点搜索1519 逆波兰表达式表达式求解：栈的应用1520 十六进制高精度计算1521 Palindromic sequence1522 Hotel 模拟题1523 Intersecting Lines 计算几何1524 Heap Construction 最短路径1525 Pizza Anyone?1526 Adam's Genes1527 Risk1528 Just the Facts 数论1529 Horse Shoe Scoring 计算几何1530 哥德巴赫猜想数论1531 爱的伟大意义简单题1532 校门外的树模拟题1533 最多约数问题数论1534 Quicksum 数学题1535 找规律填数字数学题1536 Accepted Necklace 搜索：DFS1537 除法表达式数论1538 A Walk Through the Forest 图论：最短路径1539 Accurately Say "CocaCola"! 简单题1540 Build The Electric System 图论：最小生成树1541 Colorful Rainbows 计算几何1542 Easy Task 数学题1543 Faster, Higher, Stronger 简单题1544 Give Me the Number 模拟题1545 Hurdles of 110m 动态规划1546 Just Pour the Water 矩阵计算1547 Kinds of Fuwas 穷举法1548 复数运算简单题1549 元素个数排序简单题1550 Fiber Communications1551 Power Hungry Cows 搜索：BFS1552 Cow Cycling 动态规划1553 Rebuilding Roads 树型DP1554 Triangular Pastures 动态规划1555 Chores 动态规划1556 Extra Krunch1557 BUY LOW, BUY LOWER 动态规划1558 Hypnotic Milk Improvement1559 Happy Cows1560 Unary Cow Counting 1561 Dairy Route1562 Calf Numbers1563 Hide and Seek 1564 Mountain Majesties 1565 Secret Milk Pipes 1566 Circus Tickets1567 Life Cycle1568 Wiggle Numbers 1569 Superwords1570 Cow Brainiacs 1571 Pasture Fences 1572 New Years Party 1573 Strolling Cows 1574 Grazing Sets1575 Factorial Power 1576 Friday the Thirteenth 1577 Beef McNuggets 1578 Calf Flac1579 Light Bulbs1580 Cow Math 图论1581 Cow Imposters 动态规划1582 Traffic Lights 递推求解1583 Farm Tour 图论：最短路径1584 Vertical Histogram 简单题1585 Cowties 动态规划1586 Travel Games 搜索：DFS1587 Best Cow Fences 二分法1588 Cornfields RMQ问题1589 Six Degrees of Cowvin Bacon 简单题1590 Herd Sums 简单题1591 Message Decoding 简单题1592 Mountain Walking 二分+flood fill 1593 Millenium Leapcow 动态规划1594 Optimal Milking 最大流+二分法1595 Bale Figures 模拟+二分法1596 Jumping Cows 动态规划1597 Lost Cows SBT树1598 Bovine Math Geniuses 简单题1599 Dividing the Path 动态规划1600 Fence Obstacle Course 动态规划1601 Cow Ski Area 图论：flood fill 1602 Cleaning Shifts 贪心法1603 Bad Cowtractors 最大生成树1604 Tree Cutting 树状动态规划1605 Navigation Nightmare 并查集1606 Cow Marathon 树状动态规划1607 Distance Queries LCA，tarjan算法1608 Distance Statistics 楼天成大牛“男人八题”中的一道1609 Moo University - Team Tryouts 排序+穷举法1610 Moo University - Emergency Pizza Order1611 Moo University - Financial Aid 最大堆、最小堆1612 Cube Stacking 并查集1613 The Cow Lineup 穷举法1614 MooFest 线段树1615 Turning in Homework 动态规划1616 Alignment of the Planets1617 Finding Bovine Roots1618 Cow Bowling1619 Cow Patterns 字符串匹配的扩展1620 Barn Expansion 二分查找1621 Layout 差分约束系统1622 Knights of Ni 搜索：BFS1623 Cleaning Shifts DP＋Heap1624 Scales 搜索+剪枝1625 Secret Milking Machine 二分+网络流1626 Aggressive cows 二分法1627 Rigging the Bovine Election 穷举法1628 Feed Accounting 简单模拟题1629 Muddy Fields 穷举法1630 The Wedding Juicer 堆+flood fill 1631 Naptime 动态规划1632 Sumsets 动态规划1633 Moo Volume 简单题1634 Ombrophobic Bovines Floyd-Warshall 1635 Space Elevator 动态规划1636 Yogurt factory 动态规划1637 Checking an Alibi 最短路径1638 Out of Hay1639 Satellite Photographs 搜索：BFS or DFS 1640 Asteroids 最大网络流1641 Grazing on the Run 动态规划1642 Walk the Talk 动态规划1643 City Skyline 栈的应用1644 Cow Acrobats 贪心法1645 Ant Counting 动态规划1646 Hopscotch 搜索：DFS1647 Securing the Barn 穷举法1648 Bovine Birthday 递推求解1649 Max Factor 简单题1650 Flying Right1651 Close Encounter1652 Allowance1653 Lazy Cows1654 Expedition1655 Around the world1656 Landscaping1657 Waves1658 Navigating the City1659 Disease Management1660 Muddy roads1661 Wormholes 最短路径1662 The Fewest Coins 动态规划1663 Milk Patterns 二分法or后缀树1664 Cow Picnic 搜索：BFS or DFS 1665 Cow Roller Coaster 动态规划1666 River Hopscotch 二分法+贪心1667 The Moronic Cowmpouter 进制转换1668 DNA Assembly 穷举法1669 Cow Phrasebook 二分法1670 Cellphones 穷举法1671 Steady Cow Assignment 网络流1672 Treats for the Cows 动态规划1673 Backward Digit Sums 穷举法1674 Stump Removal 简单题1675 Finicky Grazers 动态规划1676 The Water Bowls 枚举二进制位1677 Redundant Paths 图论1678 Roping the Field 动态规划1679 Corral the Cows 二分法1680 The Cow Prom 图论1681 Dollar Dayz 动态规划1682 The Grove 最短路径1683 Fence Repair Huffman编码1684 Corn Fields 状态压缩DP 1685 Roadblocks 图论：最短路径1686 Bad Hair Day 搜索1687 Big Square 穷举法1688 Round Numbers 枚举二进制位1689 Building A New Barn1690 Cow Sorting 置换群1691 Lilypad Pond 最短路径1692 The Cow Lexicon 动态规划1693 Silver Cow Party 最短路径1694 Problem Solving 动态规划1695 Cow School1696 Protecting the Flowers 贪心法1697 Tallest Cow 区间统计1698 Balanced Lineup RMQ问题1699 Gold Balanced Lineup RMQ问题1700 Ranking the Cows 搜索：DFS1701 Face The Right Way 穷举法1702 Cow Traffic 动态规划1703 Monthly Expense 贪心法1704 Cheapest Palindrome 动态规划1705 Dining 贪心+网络流1706 City Horizon 离散化+ 扫描1707 Catch That Cow 最短路径1708 Fliptile 枚举+位压缩1709 2-Dimensional Rubik's Cube 搜索：BFS 1710 Ball 计算几何1711 3D Camera 三维计算几何1712 Cipher 模拟题1713 Five in a Row 简单题1714 Pinhole Imaging 简单计算几何1715 URL 模拟题1716 Battle of Submarines 集合DP 1717 WOJ 动态规划1718 钥匙计数之二递推求解1719 BrokenLED 模拟题1722 A+B again and again! 模拟题1723 Just calculate it! 数论1724 Guess how much I love you? 简单题1725 NBA Finals1726 Find Out an “E”1727 Judging ACM/ICPC1728 Cryptography of Alex1729 Rings of square grid1730 Fermat's Theorem1731 Cup 二分法1732 Find the Path DP+二分法1733 Five in a Row, Again 动态规划1734 Minimum Heap 递推求解1735 Name PK 模拟题1736 Pendant 动态规划1737 Radar 计算几何+搜索1738 Ring 多串模式匹配1739 Run 计算几何1740 Toxophily 简单题1741 通讯录编排简单题1742 超缘分ACM队伍简单题1743 集合运算简单题1744 矩阵计算简单题1745 Arbitrage 动态规划1746 The Tower of Babylon 动态规划1747 Binomial Showdown 组合数学1748 Dungeon Master 搜索：BFS 1749 Equation Solver 表达式求值应用1750 Frogger 最短路径1751 Globetrotter 计算几何1752 Tree Recovery 数据结构：二叉树1753 Artificial Intelligence?1754 The Settlers of Catan 搜索1755 France '98 概率问题1756 Goldbach's Conjecture 数论1757 Heavy Cargo 最小生成树1758 Quadtree1759 From Dusk till Dawn or: Vladimir the Vampire 最短路径1760 Euro Cup 20001761 Quadtree II or: Florida Jones strikes back1762 HTML 简单题1763 Paths on a Grid 组合数学：T路问题1764 Balanced Food 动态规划1765 California Jones and the Gate to Freedom 组合数学1766 Diplomatic License 简单计算几何题1767 Polygon Programming with Ease 数学题1768 Hall of Fountains 搜索：BFS or DP1769 The Bottom of a Graph 图论：强连通分量1770 Edge1771 Fold1772 Largest Rectangle in a Histogram 动态规划1773 Boolean Logic1774 Code1775 In Danger 模拟题1776 Fractran1777 Huffman's Greed1778 Bullshit Bingo 字符串处理1779 A Song contest1780 Message1781 The skatepark's new ramps1782 Road1783 Warfare1784 Blackjack1785 Robintron1786 Diamond Dealer 计算几何：凸包1787 Best Compression Ever1788 Code Theft1789 Dinner1790 Event Planning1791 Getting Gold1792 Introspective Caching1793 Just A Few More Triangles!1794 Knights of the Round Table 图论：无向图的块判断奇圈1795 The Cow Doctor 穷举法1796 Wild West 线段树1797 Find the Clones1798 The Warehouse1799 Widget Factory 数论：同余方程组1800 Martian Mining 动态规划3301 字符串；AC自动机，动态规划；状态压缩3302 计算几何3303 数学；代数运算；高斯消元3304 图论；强连通分量；2-SAT3305 动态规划；凸单调性优化3306 枚举3307 贪心3308 数学；代数运算3309 最短路；佛洛伊德3310 动态规划3311 贪心3312 计数问题；递推，数状数组，二分查找3313 数论；欧拉定理，快速幂取模3314 计数问题，数状数组3315 博弈；Surreal数；Farey数列；3316 计数问题；递推，高精度3317 计数问题；容斥原理3318 递推；矩阵乘法3319 数学；概率3320 背包3321 动态规划3322 字符串；AC自动机3323 动态规划3324 博弈3325 搜索3326 贪心3327 最短路3328 数据结构（实现一种数据结构，支持要求的操作），数状数组3329 图论；二分图最大权匹配3330 数学；数论3331 递推；矩阵乘法3332 数学；数论，二分查找3333 计算几何3334 动态规划3335 字符串，后缀数组或拉宾卡普；动态规划3336 数据结构；并查集3337 计数问题，递推3338 二分查找，贪心3339 数学3340 计算几何；凸包，图论；佛洛伊德；最小环3341 动态规划3342 广搜3343 动态规划3344 计算几何3345 二分图最大匹配3346 树型DP3347 动态规划3348 数学；数论；进制3349 计数问题3350 贪心3351 数学；数论；进制3352 动态规划，数论，组合数学3353 数学；数论3354 计数；递推3355 图论；佛洛伊德3356 博弈3357 动态规划3358 数据结构；线段树，数状数组3359 计算几何，动态规划3360 博弈；SG函数3361 图论；最近公共祖先3362 图论；强连通分量；2－SAT 3363 计算几何3364 字符串；AC自动机，动态规划3365 搜索，舞蹈链3366 数学；数论3367 数学；代数运算；高斯消元3368 动态规划3369 计数问题；递推3370 网络流（错题）3371 树型DP3372 数学；高精度3373 数学；3374 RMQ3376 数学；进制3377 字符串；后缀数组3378 动态规划3379 计算几何3380 线段树3381 图论；欧拉路3382 简单题3383 字符串；AC自动机3384 广搜3385 计算几何，矩阵3386 语言处理3387 动态规划；状态压缩3388 图论；全局最小割3389 简单题3390 广搜3391 数学；Pell方程3392 背包3393 计算几何3394 广搜3395 搜索；迭代加深3396 数学；计数问题3397 数学；解方程3398 分析3399 模拟3400 数学；计数问题，数论。