qq_33817680的博客

Description One integer number x is called "Mountain Number" if: (1) x>0 and x is an integer; (2) Assume x=a[0]a[1]...a[len-2]a[len-1](0≤a[i]≤9, a[0] is positive). Any a[2i+1] is larger or equa

Problem Description The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. If the curr

题目链接 附上详细解释的代码 //发现自己还是这么弱，网上代码大多也都只有代码没有解释，这里附上解释防止以后忘记 #include #include #include #include #include #include using namespace std; long long dp[25][6]; long long pow(long long i){//求10的i次方