01 2018 档案

摘要:Not long ago Billy came across such a problem, where there were given three natural numbers A, B and C from the range [1, N], and it was asked to chec 阅读全文
posted @ 2018-01-31 22:00 euzmin 阅读(272) 评论(0) 推荐(0)
摘要:D. How many trees? time limit per test 1 second memory limit per test 64 megabytes input standard input output standard output D. How many trees? time 阅读全文
posted @ 2018-01-31 09:16 euzmin 阅读(196) 评论(0) 推荐(0)
摘要:C. Looking for Order time limit per test 4 seconds memory limit per test 512 megabytes input standard input output standard output Girl Lena likes it 阅读全文
posted @ 2018-01-30 17:08 euzmin 阅读(251) 评论(0) 推荐(0)
摘要:B. Obsession with Robots time limit per test 2 seconds memory limit per test 64 megabytes input standard input output standard output The whole world 阅读全文
posted @ 2018-01-29 12:55 euzmin 阅读(196) 评论(0) 推荐(0)
摘要:LazyChild is a lazy child who likes candy very much. Despite being very young, he has two large candy boxes, each contains n candies initially. Everyd 阅读全文
posted @ 2018-01-28 11:59 euzmin 阅读(199) 评论(0) 推荐(0)
摘要:Prof. Tigris is the head of an archaeological team who is currently in charge of an excavation in a site of ancient relics. This site contains relics 阅读全文
posted @ 2018-01-28 10:01 euzmin 阅读(263) 评论(0) 推荐(0)
摘要:Dire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, Dire Wolves appear to originate from Draenor. 阅读全文
posted @ 2018-01-27 16:51 euzmin 阅读(149) 评论(0) 推荐(0)
摘要:Matt has N friends. They are playing a game together. Each of Matt’s friends has a magic number. In the game, Matt selects some (could be zero) of his 阅读全文
posted @ 2018-01-27 15:03 euzmin 阅读(136) 评论(0) 推荐(0)
摘要:Jenny likes balls. He has some balls and he wants to arrange them in a row on the table. Each of those balls can be one of three possible colors: red, 阅读全文
posted @ 2018-01-26 12:58 euzmin 阅读(172) 评论(0) 推荐(0)
摘要:Matt is a big fan of logo design. Recently he falls in love with logo made up by rings. The following figures are some famous examples you may know. A 阅读全文
posted @ 2018-01-26 12:19 euzmin 阅读(153) 评论(0) 推荐(0)
摘要:GCD and LCM Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2977 Accepted Submission(s): 1302 Pro 阅读全文
posted @ 2018-01-26 12:08 euzmin 阅读(220) 评论(0) 推荐(0)
摘要:Matt’s friend K.Bro is an ACMer. Yesterday, K.Bro learnt an algorithm: Bubble sort. Bubble sort will compare each pair of adjacent items and swap them 阅读全文
posted @ 2018-01-25 17:28 euzmin 阅读(155) 评论(0) 推荐(0)
摘要:XXX has an array of length n. XXX wants to know that, for a given w, what is the sum of the distinct elements’ number in all substrings of length w. F 阅读全文
posted @ 2018-01-25 11:16 euzmin 阅读(261) 评论(0) 推荐(0)
摘要:Ms.Fang loves painting very much. She paints GFW(Great Funny Wall) every day. Every day before painting, she produces a wonderful color of pigments by 阅读全文
posted @ 2018-01-24 15:20 euzmin 阅读(199) 评论(0) 推荐(0)
摘要:There is a big round cake on the ground. A small ant plans to steal a small piece of cake. He starts from a certain point, reaches the cake, and then 阅读全文
posted @ 2018-01-23 17:15 euzmin 阅读(167) 评论(0) 推荐(0)
摘要:It’s harvest season now! Farmer John plants a lot of corn. There are many birds living around his corn field. These birds keep stealing his corn all t 阅读全文
posted @ 2018-01-23 13:38 euzmin 阅读(206) 评论(0) 推荐(0)
摘要:For a group of people, there is an idea that everyone is equals to or less than 6 steps away from any other person in the group, by way of introductio 阅读全文
posted @ 2018-01-22 22:56 euzmin 阅读(370) 评论(0) 推荐(0)
摘要:1 /* 2 求多边形与圆相交的面积 3 */ 4 5 #include <iostream> 6 #include <cstdio> 7 #include <cmath> 8 #define max(x,y) ((x)>(y)?(x):(y)) 9 #define min(x,y) ((x)<(y 阅读全文
posted @ 2018-01-22 15:12 euzmin 阅读(396) 评论(0) 推荐(0)