03 2020 档案

CodeForces 673C - Bear and Colors（思维+暴力）
摘要：Bear Limak has n colored balls, arranged in one long row. Balls ar... 阅读全文
posted @ 2020-03-28 11:18 Hayasaka 阅读(65) 评论(0) 推荐(0)
CodeForces 438D - The Child and Sequence（线段树）
摘要：At the children’s day, the child came to Picks’s house, and messed... 阅读全文
posted @ 2020-03-28 11:06 Hayasaka 阅读(98) 评论(0) 推荐(0)
POJ 1703 - Find them, Catch them（种类并查集）
摘要：Find them, Catch them Time Limit: 1000MS Memory Limit: 10000K Tota... 阅读全文
posted @ 2020-03-25 23:25 Hayasaka 阅读(78) 评论(0) 推荐(0)
HDU 1124 - Factorial（简单数论）
摘要：Factorial Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 655... 阅读全文
posted @ 2020-03-25 22:10 Hayasaka 阅读(66) 评论(0) 推荐(0)
CodeForces - 1324B - Yet Another Palindrome Problem（思维）
摘要：You are given an array a consisting of n integers. Your task is to... 阅读全文
posted @ 2020-03-25 21:58 Hayasaka 阅读(86) 评论(0) 推荐(0)
CodeForces 1327C - Game with Chips（思维）
摘要：C. Game with Chips time limit per test 1 second memory limit per t... 阅读全文
posted @ 2020-03-25 21:37 Hayasaka 阅读(82) 评论(0) 推荐(0)
CodeForces 1327B - Princesses and Princes（思维+读题）
摘要：B. Princesses and Princes time limit per test 2 seconds memory lim... 阅读全文
posted @ 2020-03-25 21:18 Hayasaka 阅读(93) 评论(0) 推荐(0)
CodeForces 1327A - Sum of Odd Integers（思维）
摘要：You are given two integers n and k. Your task is to find if n can ... 阅读全文
posted @ 2020-03-25 20:57 Hayasaka 阅读(100) 评论(0) 推荐(0)
CodeForces 1017B - The Bits（思维）
摘要：Rudolf is on his way to the castle. Before getting into the castle... 阅读全文
posted @ 2020-03-21 11:30 Hayasaka 阅读(79) 评论(0) 推荐(0)
POJ 1323-Game Prediction（贪心）
摘要：看到大家学习算法这么努力，wqd决定给大家发红包。 没错，王老板是个很有钱的人。 王老板给n个人发牌，每个人有m张牌，于是就有n x... 阅读全文
posted @ 2020-03-20 23:56 Hayasaka 阅读(73) 评论(0) 推荐(0)
CodeForces 104B-Testing Pants for Sadness（思维题）
摘要：The average miner Vaganych took refresher courses. As soon as a mi... 阅读全文
posted @ 2020-03-20 23:47 Hayasaka 阅读(75) 评论(0) 推荐(0)
CodeForces 1324D - Pair of Topics（二分查找）
摘要：The next lecture in a high school requires two topics to be discus... 阅读全文
posted @ 2020-03-20 21:08 Hayasaka 阅读(114) 评论(0) 推荐(0)
UVA 1152-4 Values whose Sum is 0（二分查找）
摘要：The SUM problem can be formulated as follows: given four lists A, ... 阅读全文
posted @ 2020-03-20 20:43 Hayasaka 阅读(98) 评论(0) 推荐(0)
POJ 1700-Crossing River（贪心）
摘要：Crossing River Time Limit: 1000MS Memory Limit: 10000K Total Submi... 阅读全文
posted @ 2020-03-20 20:22 Hayasaka 阅读(87) 评论(0) 推荐(0)
HDU 1789-Doing Homework again（并查集+贪心）
摘要：Doing Homework again Time Limit: 1000/1000 MS (Java/Others) Memory... 阅读全文
posted @ 2020-03-20 19:46 Hayasaka 阅读(167) 评论(0) 推荐(0)
SDUT 1298-活动选择（贪心）
摘要：Description 学校的大学生艺术中心周日将面向全校各个学院的学生社团开放，但活动中心同时只能供一个社团活动使用，并且每一个社... 阅读全文
posted @ 2020-03-16 23:01 Hayasaka 阅读(104) 评论(0) 推荐(0)
HDU 1272-小希的迷宫（带环并查集）
摘要：小希的迷宫 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/3... 阅读全文
posted @ 2020-03-15 23:23 Hayasaka 阅读(70) 评论(0) 推荐(0)
CodeForces - 268C（思维题）
摘要：Manao has invented a new mathematical term — a beautiful set of po... 阅读全文
posted @ 2020-03-15 22:49 Hayasaka 阅读(66) 评论(0) 推荐(0)
CodeForces - 1033B（思维题）
摘要：Alice has a lovely piece of cloth. It has the shape of a square wi... 阅读全文
posted @ 2020-03-15 22:39 Hayasaka 阅读(96) 评论(0) 推荐(0)
HDU 1856-More is better（并查集）
摘要：More is better Time Limit: 5000/1000 MS (Java/Others) Memory Limit... 阅读全文
posted @ 2020-03-15 22:06 Hayasaka 阅读(68) 评论(0) 推荐(0)
HDU 4496-D-City（并查集）
摘要：D-City Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/... 阅读全文
posted @ 2020-03-15 21:59 Hayasaka 阅读(48) 评论(0) 推荐(0)
CodeForces 1305C-Kuroni and Impossible Calculation（抽屉原理）
摘要：To become the king of Codeforces, Kuroni has to solve the followin... 阅读全文
posted @ 2020-03-11 17:35 Hayasaka 阅读(101) 评论(0) 推荐(0)
POJ 2356-Find a multiple（抽屉原理）
摘要：Find a multiple Time Limit: 1000MS Memory Limit: 65536K Total Subm... 阅读全文
posted @ 2020-03-11 17:24 Hayasaka 阅读(91) 评论(0) 推荐(0)
POJ 1456-Supermarket（贪心+并查集）
摘要：Supermarket Time Limit: 2000MS Memory Limit: 65536K Total Submissi... 阅读全文
posted @ 2020-03-11 16:54 Hayasaka 阅读(67) 评论(0) 推荐(0)
CodeForces 556C - Case of Matryoshkas（模拟）
摘要：Andrewid the Android is a galaxy-famous detective. He is now inves... 阅读全文
posted @ 2020-03-08 11:09 Hayasaka 阅读(93) 评论(0) 推荐(0)
CodeForces - 556B - Case of Fake Numbers（模拟）
摘要：Andrewid the Android is a galaxy-famous detective. He is now inves... 阅读全文
posted @ 2020-03-08 10:54 Hayasaka 阅读(90) 评论(0) 推荐(0)
POJ 2253-Frogger（Floyd变形）
摘要：Frogger Time Limit: 1000MS Memory Limit: 65536K Total Submissions:... 阅读全文
posted @ 2020-03-08 10:30 Hayasaka 阅读(61) 评论(0) 推荐(0)
POJ 1251-Jungle Roads（最小生成树）
摘要：Jungle Roads Time Limit: 1000MS Memory Limit: 10000K Total Submiss... 阅读全文
posted @ 2020-03-08 10:21 Hayasaka 阅读(53) 评论(0) 推荐(0)
HDU 1846-Brave Game（巴什博弈）
摘要：Brave Game Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32... 阅读全文
posted @ 2020-03-08 10:14 Hayasaka 阅读(98) 评论(0) 推荐(0)
HDU 1233-还是畅通工程（经典最小生成树）
摘要：还是畅通工程 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/... 阅读全文
posted @ 2020-03-05 19:49 Hayasaka 阅读(68) 评论(0) 推荐(0)
51Nod 1649-齐头并进（最短路dijkstra）
摘要：在一个叫奥斯汀的城市，有n个小镇（从1到n编号），这些小镇通过m条双向火车铁轨相连。当然某些小镇之间也有公路相连。为了保证每两个小镇... 阅读全文
posted @ 2020-03-05 18:05 Hayasaka 阅读(79) 评论(0) 推荐(0)
CodeForces 1203C-Common Divisors（欧几里得）
摘要：You are given an array a consisting of n integers. Your task is to... 阅读全文
posted @ 2020-03-05 17:52 Hayasaka 阅读(70) 评论(0) 推荐(0)
HDU 1495-非常可乐（BFS+模拟）
摘要：非常可乐 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32... 阅读全文
posted @ 2020-03-03 20:50 Hayasaka 阅读(109) 评论(0) 推荐(0)
HDU 1690-Bus System（Floyd+读题）
摘要：Bus System Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32... 阅读全文
posted @ 2020-03-03 18:31 Hayasaka 阅读(56) 评论(0) 推荐(0)
POJ 3660-Cow Contest（Floyd+传递闭包）
摘要：Cow Contest Time Limit: 1000MS Memory Limit: 65536K Total Submissi... 阅读全文
posted @ 2020-03-02 20:59 Hayasaka 阅读(60) 评论(0) 推荐(0)
POJ 3126-Prime Path（BFS+筛素数）
摘要：Prime Path Time Limit: 1000MS Memory Limit: 65536K Total Submissio... 阅读全文
posted @ 2020-03-02 19:18 Hayasaka 阅读(87) 评论(0) 推荐(0)
HDU 2035-人见人爱A^B（浅谈快速幂）
摘要：人见人爱A^B Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536... 阅读全文
posted @ 2020-03-01 13:55 Hayasaka 阅读(117) 评论(0) 推荐(0)