摘要: DescriptionN soldiers from the famous "*FFF* army" is standing in a line, from left to right. o o o o o o o o o o o o o o o o o o /F\ /F\ /F\ /F\ /F\ /F\ /F\ /F\ /F\ /F\ /F\ /F\ /F\ /F\ /F\ /F\ /F\ /F\ / \ / \ / \ / \ / \ / \ / \ / \ / \ / \ / \ / \ / \ / \ / \ / \ ... 阅读全文
posted @ 2013-09-11 23:46 Oyking 阅读(454) 评论(0) 推荐(0) 编辑
摘要: DescriptionIf we sum up every digit of a number and the result can be exactly divided by 10, we say this number is a good number. You are required to count the number of good numbers in the range from A to B, inclusive.InputThe first line has a number T (T 2 #include 3 #include 4 #include 5 usin... 阅读全文
posted @ 2013-09-11 22:17 Oyking 阅读(404) 评论(0) 推荐(0) 编辑
摘要: DescriptionThis is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algori... 阅读全文
posted @ 2013-09-11 19:18 Oyking 阅读(283) 评论(0) 推荐(0) 编辑