u013268685的专栏(有一种幸福叫AC，有一种期待叫AK)

E. Substitutes in Number time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Andrew and Eugene are playing a gam

Time Limit:3000MS Memory Limit:65536KB Description You are given a sequence a[0]a[1] ... a[N-1] of digits and a prime number Q. For each i<=j with a[i] != 0, the subsequence a[i]a[i+1]...a[j] can be

UVA - 11105 Semi-prime H-numbers Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Submit Status Description Problem A: Semi-prime H-number

UVA - 1210 Sum of Consecutive Prime Numbers Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Submit Status Description Some positive integ

1022: A simple math problem 2 时间限制: 1 Sec  内存限制: 128 MB 提交: 73  解决: 13 [提交][状态][讨论版] 题目描述 高斯函数： [x]表示，小于等于x的最大整数，即向下取整。 如 [2.5]=2，[1.2]=1等。 定义函数f(n)=[n/1]+[n/2]+[n/3]+...+[n/n] . sum(a,b)=f(a

UVA - 10622 Perfect P-th Powers Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Submit Status Description Problem E: Perfect Pth Powers