摘要：COCI 2009/2010 Task MALI1. round, 24. october 2009.Author: Marko Ivankovi., Filip BarlMirko and Slavko are playing a new game. Again. Slavko starts each round bygiving Mirko two numbers A and B, both smaller than 100. Mirko then has toslove the following task for Slavko: how to pair all given A numb 阅读全文

摘要：A. yuna学数论Time Limit : 3000/1000ms (Java/Other)Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 24Accepted Submission(s) : 13Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem Description在学习完各类算法之后，yuna决定开始学习数论了。yuna神当然从最简单的最小公倍数学起喽~~~~~定义 为1，2，…，n的最小公倍数，例如，B1= 1，B2= 2，B3= 6，B4= 12 阅读全文

摘要：B. Merlininice’s HometaskFont: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionMerlininice dosen’t love math lessons, so he always ditches math class. But as the final exam is coming, now Merlininice is really regret his actions and wants to get a good mark for math. For that Ms. 阅读全文

摘要：A Famous CityProblem DescriptionAfter Mr. B arrived in Warsaw, he was shocked by the skyscrapers and took several photos. But now when he looks at these photos, he finds in surprise that he isn't able to point out even the number of buildings in it. So he decides to work it out as follows:- divi 阅读全文