hello world

DescriptionFermat'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 is a. Some (but

DescriptionPeople are different. Some secretly read magazines full of interesting girls' pictures, others create an A-bomb in their cellar, others like using Windows, and some like difficult mat

Problem Description求A^B的最后三位数表示的整数。说明：A^B的含义是“A的B次方” Input输入数据包含多个测试实例，每个实例占一行，由两个正整数A和B组成（1 Output对于每个测试实例，请输出A^B的最后三位表示的整数，每个输出占一行。 Sample Input2

Problem Descriptionsoda has a set S with n integers {1,2,…,n}. A set is called key set if the sum of integers in the set is an even number. He wants to know how many nonempty subsets of S are