euzmin

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： D. Inversion Counting time limit per test 2 seconds time limit per test memory limit per test 256 megabytes memory limit per test input standard input 阅读全文