Meek

摘要： C. Median SmoothingA schoolboy named Vasya loves reading books on programming and mathematics. He has recently read an encyclopedia article that descr... 阅读全文

摘要： Stealing Harry Potter's PreciousProblem Description Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwa... 阅读全文

摘要： Dice (I)You haveNdices; each of them hasKfaces numbered from1toK. Now you have arranged theNdices in a line. You can rotate/flip any dice if you want.... 阅读全文

摘要： Difference of ClusteringProblem DescriptionGiven two clustering algorithms, the old and the new, you want to find the difference between their results... 阅读全文

摘要： B. Fi Binary NumberA Fi-binary number is a number that contains only 0 and 1. It does not contain any leading 0. And also it does not contain 2 consec... 阅读全文

摘要： C. Josephus Problem题目链接：http://www.bnuoj.com/v3/contest_show.php?cid=7095#problem/C题目描述The historian Flavius Josephus relates how, in the Romano-Jewis... 阅读全文

摘要： GT and setAccepts: 35Submissions: 194Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)问题描述有NN个集合，每个集合中有A_iA​i​​个数。你要将这NN... 阅读全文

摘要： GT and numbers问题描述给出两个数NN和MM。NN每次可以乘上一个自己的因数变成新的NN。求最初的NN到MM至少需要几步。如果永远也到不了输出-1−1。输入描述第一行读入一个数TT表示数据组数。接下来TT行，每行两个数NN和MM。T\leq1000T≤1000, 1\leq N \leq... 阅读全文

摘要： B. Laurenty and ShopA little boy Laurenty has been playing his favourite gameNotafor quite a while and is now ve... 阅读全文

摘要： D. Phillip and TrainsThe mobile application store has a new game called "Subway Roller".The protagonist of the game Philip is lo... 阅读全文