ACM,再见！

http://acm.hdu.edu.cn/showproblem.php?pid=3652B-numberTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2815    Accepted Submission(s):

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=98182#problem/DDescriptionRoman is a young mathematician, very famous in Uzhland. Unfortunately, Sereja doesn't think so. To make Sereja

http://acm.hdu.edu.cn/showproblem.php?pid=2089Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音：laoer）。杭州交通管理局经常会扩充一些的士车牌照，新近出来一个好消息，以后上牌照，不再含有不吉利的数字了，这样一来，就可以消除个别的士司机和乘客的心理障碍，更安全地服务大众。不吉利的数字为所有含有4

http://acm.hdu.edu.cn/showproblem.php?pid=3709Problem DescriptionA balanced number is a non-negative integer that can be balanced if a pivot is placed at some digit. More specifically, imagi

http://acm.hdu.edu.cn/showproblem.php?pid=4507Problem Description　　单身!　　依然单身！　　吉哥依然单身！　　DS级码农吉哥依然单身！　　所以，他生平最恨情人节，不管是214还是77，他都讨厌！　　　　吉哥观察了214和77这两个数，发现：　　2+1+4=7　　7+7=7*2　

http://acm.uestc.edu.cn/#/problem/show/250windy定义了一种windy数。不含前导零且相邻两个数字之差至少为2的正整数被称为windy数。windy想知道，在A和B之间，包括A和B，总共有多少个windy数？Input包含两个整数，A B。满足 1≤A≤B≤2000000000 .Output

http://acm.timus.ru/problem.aspx?space=1&num=10571057. Amount of DegreesTime limit: 1.0 secondMemory limit: 64 MBCreate a code to determine the amount of integers, lying in the set

/** 数位dp求所有比n（1~10^6）小的书中二进制表示法“1”的个数是m的数的个数，dp[i][j]表示以i位数1的个数为j*/#include #include #include #include using namespace std;const int maxn=50;int dp[maxn][maxn],bit[maxn];int n,m;int dfs(in

http://acm.hdu.edu.cn/showproblem.php?pid=3555Problem DescriptionThe counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number seque

http://www.spoj.com/problems/BALNUM/SPOJ Problem Set (classical)10606. Balanced NumbersProblem code: BALNUMBalanced numbers have been used by mathematicians for centu

http://acm.hdu.edu.cn/showproblem.php?pid=3709Problem DescriptionA balanced number is a non-negative integer that can be balanced if a pivot is placed at some digit. More specifically, imagi

http://acm.hdu.edu.cn/showproblem.php?pid=4352Problem Description#define xhxj (Xin Hang senior sister(学姐)) If you do not know xhxj, then carefully reading the entire description is very im

http://acm.hdu.edu.cn/showproblem.php?pid=4734Problem DescriptionFor a decimal number x with n digits (AnAn-1An-2 ... A2A1), we define its weight as F(x) = An * 2n-1 + An-1 * 2n-2 + ... + A2

http://codeforces.com/problemset/problem/55/DD. Beautiful numberstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutput

http://poj.org/problem?id=3252DescriptionThe cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone' (also known as 'Rock, Paper, Scissors', 'Ro, Sham,

http://acm.hdu.edu.cn/showproblem.php?pid=5435Problem DescriptionXiao Jun likes math and he has a serious math question for you to finish.Define F[x] to the xor sum of all digits of x