som_nico的博客

POJ - 3641 Fermat's theorem states that for any prime number p and for any integer a > 1, ap =a (mod p). That is, if we raise a to the pth power and divide by p, the remainder isa. Some (but

CF 467AA. George and Accommodationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGeorge has recently ent

A. Soldier and Bananastime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA soldier wants to buy w bananas in t

F -产生冠军 有一群人，打乒乓球比赛，两两捉对撕杀，每两个人之间最多打一场比赛。 球赛的规则如下： 如果A打败了B，B又打败了C，而A与C之间没有进行过比赛，那么就认定，A一定能打败C。 如果A打败了B，B又打败了C，而且，C又打败了A，那么A、B、C三者都不可能成为冠军。 根据这个规则，无需循环较量，或许就能确定冠军。你的任务就是面对一群比赛选手，在经过了若干场撕杀之后

B. Maximize Sum of Digitstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton has the integer x. He is int

Problem M: Turn on and Turn off the lightsTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 102  Solved: 32[Submit][Status][Web Board]Description有N盏灯,编号为 1 ～ n .第一个人把所有灯打开,第二个人按下所有编号为2的倍数

C. Maximal GCDtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given positive integer number n. You shouldcreate such stri