咸鱼の小窝

Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N. InputThe input contains several test cases. The first line of the input is a single integer T

Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem easier than begin.

Description给定一个有N个顶点的凸多边形，内有K个点，这N+K个点不会有三点共线，可以选择两个点连一条线段，但是线段只能在内部的点相交，问最多能连出多少个三角形。Input第一行T（T≤100）为测试用例个数。然后下面的T行，每行两个数N（3≤N≤10000）和K(1≤K≤10000)Output每个测试用例输出

Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resultin

Problem DescriptionIgnatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that:f(x)=5*x^13+13*x^5+k*a*x,input a nonegative intege

Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n). I

QuadratTime Limit: 1000MS Memory Limit: 65536KBSubmit Statistic DiscussProblem DescriptionIt is well-known that for any n there are exactly four n-digit numbers (including ones with leading

KazaQ's SocksTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 462    Accepted Submission(s): 300Problem DescriptionKazaQ wears sock