其它 OJ
Alex_McAvoy
想要成为渔夫的猎手
展开
-
Welcome Party(ZOJ-4109)
Problem DescriptionThe 44th World Finals of the International Collegiate Programming Contest (ICPC 2020) will be held in Moscow, Russia. To celebrate this annual event for the best competitive prog...原创 2019-04-28 18:59:34 · 965 阅读 · 2 评论 -
The Maximum Unreachable Node Set(UVALive-8456)
Problem DescriptionIn this problem, we would like to talk about unreachable sets of a directed acyclic graph G = (V, E).In mathematics a directed acyclic graph (DAG) is a directed graph with no d...原创 2019-10-20 16:47:56 · 452 阅读 · 0 评论 -
Matryoshka Dolls (Gym-102267C)
Problem DescriptionMatryoshka Dolls are Russia's most popular souvenirs. They are sets of wooden figurines of decreasing size placed one inside another, though they have the same exact shape.Our ...原创 2019-08-21 10:19:41 · 1156 阅读 · 0 评论 -
Robots Easy (Gym-102267D)
Problem DescriptionAlice was playing her favorite game, "Tales of the Abyss", while playing she encountered the following puzzle that can be described as a12×12grid:A robot is standing somewh...原创 2019-08-21 10:46:57 · 672 阅读 · 0 评论 -
最小生成树计数(HYSBZ-1016)(加强版实现)
Problem Description现在给出了一个简单无向加权图。你不满足于求出这个图的最小生成树,而希望知道这个图中有多少个不同的最小生成树。(如果两颗最小生成树中至少有一条边不同,则这两个最小生成树就是不同的)。由于不同的最小生成树可能很多,所以你只需要输出方案数对31011的模就可以了。Input第一行包含两个数,n和m,其中1<=n<=100; 1<=...原创 2019-08-16 17:18:39 · 171 阅读 · 0 评论 -
Robots Hard(Gym-102267E)
Problem DescriptionNotice that you need to read the statement of"D. Robots Easy"in order to understand this problem.Also notice theunusual 5 megabytes memory limit.Alice now is trying to b...原创 2019-08-22 10:26:34 · 484 阅读 · 0 评论 -
Honeycomb (Gym-102028F)
Problem DescriptionA honeycomb is a mass wax cells built by honey bees, which can be described as a regular tiling of the Euclidean plane, in which three hexagons meet at each internal vertex. The ...原创 2019-08-23 19:45:32 · 1019 阅读 · 0 评论 -
Circle of Polygon(Gym-102267H)
Problem DescriptionA circumscribed circlecircumscribed circle of a polygon is the circle that passes through all the vertices of that polygon.Let's assume we have a regularregular polygon, we wan...原创 2019-08-22 19:03:44 · 529 阅读 · 0 评论 -
Birthday Puzzle(Gym-102267K)
Problem DescriptionToday is the Birthday of a beautiful girl, she's happy and she's telling her friends loudly to bring her birthday gifts. One of her best friends who is fond of puzzles decided to...原创 2019-08-22 19:11:21 · 713 阅读 · 0 评论 -
Ultimate Army(Gym-102267I)
Problem Description3 days, that's how much time the king gave Daffy to find him the ultimate army organization plan before he cuts his head off.2 days already passed with no progress, but luckily...原创 2019-08-22 19:21:53 · 610 阅读 · 0 评论 -
Arena Olympics(Gym-102267F)
Problem DescriptionKassandra is participating in the Arena Olympics of Sparta. In order to win the arena fight, she has to knockout all the other Nfighters.Being a computer scientist, she wanted...原创 2019-08-23 10:14:23 · 361 阅读 · 0 评论 -
Primes (Gym-102267B)
Problem DescriptionA prime number is a natural number greater than 1 and has exactly 2 divisors which are 1 and the number itself.You are given a prime number nn, find any 2 prime numbers aa and ...原创 2019-08-21 10:12:23 · 583 阅读 · 0 评论 -
Picky Eater (Gym-102267A)
Problem DescriptionOnce upon a time, Hamza was hungry, only leftover food could be found in the fridge, so he wanted to order online.Hamza currently has xJDs, and the sandwich he wants to buy co...原创 2019-08-21 09:52:06 · 570 阅读 · 0 评论 -
Distance (Gym-102028I)
Problem DescriptionThere are nn points on a horizontal line, labelled with 1 through nn from left to right.The distance between the i-th point and the (i+1)-th point is aiai.For each integer k ...原创 2019-08-23 22:12:13 · 376 阅读 · 0 评论 -
最小生成树计数(HYSBZ-1016)(简化版实现)
Problem Description现在给出了一个简单无向加权图。你不满足于求出这个图的最小生成树,而希望知道这个图中有多少个不同的最小生成树。(如果两颗最小生成树中至少有一条边不同,则这两个最小生成树就是不同的)。由于不同的最小生成树可能很多,所以你只需要输出方案数对31011的模就可以了。Input第一行包含两个数,n和m,其中1<=n<=100; 1<=...原创 2019-08-16 16:34:32 · 412 阅读 · 0 评论 -
Fishing Net(ZOJ-1015)(LexBFS实现)
Problem DescriptionIn a highly modernized fishing village, inhabitants there make a living on fishery. Their major tools, fishing nets, are produced and fixed by computer. After catching fishes eac...原创 2019-08-11 15:29:02 · 546 阅读 · 0 评论 -
Resistors in Parallel (Gym-102028E)
Problem DescriptionIn this physics problem, what we are concerned about are only resistors. If you are poor at physics, do not worry, since solving this problem does not require you to have advance...原创 2019-08-24 12:43:35 · 741 阅读 · 0 评论 -
Fishing Net(ZOJ-1015)(MCS实现)
Problem DescriptionIn a highly modernized fishing village, inhabitants there make a living on fishery. Their major tools, fishing nets, are produced and fixed by computer. After catching fishes eac...原创 2019-08-11 17:03:38 · 482 阅读 · 0 评论 -
神奇的国度(HYSBZ-1006)
Problem DescriptionK国是一个热衷三角形的国度,连人的交往也只喜欢三角原则.他们认为三角关系:即AB相互认识,BC相互认识,CA相互认识,是简洁高效的.为了巩固三角关系,K国禁止四边关系,五边关系等等的存在.所谓N边关系,是指N个人 A1A2...An之间仅存在N对认识关系:(A1A2)(A2A3)...(AnA1),而没有其它认识关系.比如四边关系指ABCD四个人 A...原创 2019-08-11 19:17:33 · 328 阅读 · 0 评论 -
Pyramid (Gym -01981G)
Problem DescriptionThe use of the triangle in the New Age practices seems to be very important as it represents the unholytrinity (Satan, the Antichrist and the False Prophet bringing mankind to t...原创 2019-08-20 18:21:04 · 322 阅读 · 0 评论 -
Eva and Euro coins(Gym-101981E)
Problem DescriptionEva is fond of collecting coins. Whenever she visits a different country, she always picks up as many localcoins as she can. As you know, Eva also likes to go trips to Europe; t...原创 2019-08-20 18:40:19 · 794 阅读 · 0 评论 -
元素(HYSBZ-2460)
Problem Description相传,在远古时期,位于西方大陆的 Magic Land 上,人们已经掌握了用魔法矿石炼制法杖的技术。那时人们就认识到,一个法杖的法力取决于使用的矿石。一般地,矿石越多则法力越强,但物极必反:有时,人们为了获取更强的法力而使用了很多矿石,却在炼制过程中发现魔法矿石全部消失了,从而无法炼制出法杖,这个现象被称为“魔法抵消” 。特别地,如果在炼制过程中使用...原创 2019-08-15 16:59:22 · 171 阅读 · 0 评论 -
Banana(2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 A)
Problem DescriptionBananas are the favoured food of monkeys.In the forest, there is a Banana Company that provides bananas from different places.The company has two lists.The first list recor...原创 2019-08-27 09:10:52 · 21644 阅读 · 0 评论 -
Islands(2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 F)
Problem DescriptionOn the mysterious continent of Tamriel, there is a great empire founded by human.To develope the trade, the East Empire Company is set up to transport goods from place to place...原创 2019-08-27 09:34:33 · 290 阅读 · 0 评论 -
Train Seats Reservation(2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 B)
Problem DescriptionYou are given a list of train stations, say from the station 1to the station 100.The passengers can order several tickets from one station to another before the train leaves t...原创 2019-08-29 10:05:54 · 140 阅读 · 0 评论 -
Crash的数字表格(HYSBZ-2154)
Problem Description今天的数学课上,Crash小朋友学习了最小公倍数(Least Common Multiple)。对于两个正整数a和b,LCM(a, b)表示能同时被a和b整除的最小正整数。例如,LCM(6, 8) = 24。回到家后,Crash还在想着课上学的东西,为了研究最小公倍数,他画了一张N*M的表格。每个格子里写了一个数字,其中第i行第j列的那个格子里写着数为L...原创 2019-09-04 17:28:25 · 260 阅读 · 0 评论 -
算术(HDU-6715)
Problem Description定义一个函数μ(x):如果x等于k个不同的质数的乘积,则μ(x)=(−1)^k,否则(即x有大于 1 的平方因子)μ(x)=0定义lcm(a,b)为a,b的最小公倍数,给定n,m,你需要求:Input第一行一个正整数 T(T≤10)表示数据组数接下来T行,每行两个正整数 n,m(1≤n,m≤106...原创 2019-09-06 10:54:13 · 398 阅读 · 1 评论 -
Who is better?(2019 ACM-ICPC 徐州赛区网络赛 A)
Problem DescriptionAfter Asgard was destroyed, tanker brought his soldiers to earth, and at the same time took on the important task of protecting the peace of the earth. The best two solders were ...原创 2019-09-10 20:01:01 · 191 阅读 · 0 评论 -
Buy Watermelon(2019 ACM-ICPC 徐州赛区网络赛 C)
Problem DescriptionThe hot summer came so quickly that Xiaoming and Xiaohong decided to buy a big and sweet watermelon. But they are two very strange people. They are even-numbered enthusiasts. The...原创 2019-09-10 20:05:28 · 353 阅读 · 0 评论 -
Carneginon(2019 ACM-ICPC 徐州赛区网络赛 D)
Problem DescriptionCarneginon was a chic bard. But when he was young, he was frivolous and had joined many gangs. Recently, Caneginon was to be crowned, because the king was shocked by his poems an...原创 2019-09-10 20:14:36 · 199 阅读 · 0 评论 -
So Easy(2019 ACM-ICPC 徐州赛区网络赛 B)
Problem DescriptionThere are nn points in an array with index from 1 to n, and there are two operations to those points.1: 1 x marking the point xis not available2:2 x query for the index of t...原创 2019-09-10 20:32:53 · 394 阅读 · 0 评论 -
Fire-Fighting Hero(2019 ACM-ICPC 南昌赛区网络赛 B)
Problem DescriptionThis is an era of team success, but also an era of heroes. Throughout the ages, there have been numerous examples of using the few to defeat the many. There areV(Numbers1toV...原创 2019-09-12 15:56:09 · 422 阅读 · 1 评论 -
Magic Potion(Gym-101981I)
Problem DescriptionThere are n heroes and m monsters living in an island. The monsters became very vicious these days,so the heroes decided to diminish the monsters in the island. However, the i-t...原创 2019-10-05 13:55:00 · 348 阅读 · 0 评论 -
完全平方数(HYSBZ-2440)
Problem Description小 X 自幼就很喜欢数。但奇怪的是,他十分讨厌完全平方数。他觉得这些数看起来很令人难受。由此,他也讨厌所有是完全平方数的正整数倍的数。然而这丝毫不影响他对其他数的热爱。这天是小X的生日,小 W 想送一个数给他作为生日礼物。当然他不能送一个小X讨厌的数。他列出了所有小X不讨厌的数,然后选取了第 K个数送给了小X。小X很开心地收下了。然而现在小 W...原创 2019-09-04 15:10:43 · 511 阅读 · 0 评论 -
能量采集(HYSBZ-2005)
Problem Description栋栋有一块长方形的地,他在地上种了一种能量植物,这种植物可以采集太阳光的能量。在这些植物采集能量后,栋栋再使用一个能量汇集机器把这些植物采集到的能量汇集到一起。 栋栋的植物种得非常整齐,一共有n列,每列有m棵,植物的横竖间距都一样,因此对于每一棵植物,栋栋可以用一个坐标(x, y)来表示,其中x的范围是1至n,表示是在第x列,y的范围是1至m,表示是在第...原创 2019-09-03 17:34:14 · 326 阅读 · 0 评论 -
Robots(2019 ACM-ICPC 南京赛区网络赛 D)
Problem DescriptionGiven a directed graph with no loops which starts at node1and ends at noden.There is a robot who starts at1, and will go to one of adjacent nodes or stand still withequal ...转载 2019-09-02 20:49:07 · 507 阅读 · 0 评论 -
Our Journey of Dalian Ends(2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 J)
Problem DescriptionLife is a journey, and the road we travel has twists and turns, which sometimes lead us to unexpected places and unexpected people.Now our journey of Dalian ends. To be careful...原创 2019-08-27 10:57:03 · 207 阅读 · 0 评论 -
Coin(2017 ACM-ICPC 亚洲区(西安赛区)网络赛 B)
Problem DescriptionBob has a not even coin, every time he tosses the coin, the probability that the coin's front face up is).The question is, when Bob tosses the coinkktimes, what's the probab...原创 2019-08-28 09:36:10 · 197 阅读 · 0 评论 -
Maximum Flow(2017 ACM-ICPC 亚洲区(西安赛区)网络赛 E)
Problem DescriptionGiven a directed graph withnnnodes, labeled 0,1,⋯,n−1.For each<i, j>satisfies 0≤i<j<n, there exists an edge from the i-th node to the j-th node, the capacity of...原创 2019-08-28 10:30:11 · 228 阅读 · 0 评论 -
Weather Patterns(2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 A)
Problem DescriptionConsider a system which is described at any time as being in one of a set ofNdistinct states,1,2,3,...,N. We denote the time instants associated with state changes ast = 1,2,...原创 2019-08-29 09:57:32 · 811 阅读 · 0 评论