Ural 1036 Lucky Tickets

Lucky Tickets

Time Limit: 2000ms

Memory Limit: 16384KB

This problem will be judged on Ural. Original ID: 1036
64-bit integer IO format: %lld Java class name: (Any)

You are given a number 1 ≤ N ≤ 50. Every ticket has its 2N-digit number. We call a ticket lucky, if the sum of its first N digits is equal to the sum of its last N digits. You are also given the sum of ALL digits in the number. Your task is to count an amount of lucky numbers, having the specified sum of ALL digits.

Input

Two space-separated numbers: N and S. Here S is the sum of all digits. Assume that 0 ≤ S ≤ 1000.

Output

The amount of lucky tickets.

Sample Input

2 2

Sample Output

Hint

The tickets are 0101, 0110, 1001, 1010 in the example above

解题：动态规划$dp[i][j]表示处理到了第i位，且前i位的和为j的方案数$

 #include <bits/stdc++.h>

 using namespace std;

 typedef long long LL;

 #define MAXN 100

 struct HP {

     int len,s[MAXN];

     HP() {

         memset(s,,sizeof(s));

         len = ;

     }

     HP operator=(const char *num) { //字符串赋值

         len = strlen(num);

         for(int i = ; i < len; i++) s[i] = num[len-i-]-'';

     }

     HP operator=(int num) { //int 赋值

         char s[MAXN];

         sprintf(s,"%d",num);

         *this = s;

         return *this;

     }

     HP(int num) {

         *this = num;

     }

     HP(const char*num) {

         *this = num;

     }

     string str()const { //转化成string

         string res = "";

         for(int i = ; i < len; i++) res = (char)(s[i]+'') + res;

         if(res == "") res = "";

         return res;

     }

     HP operator +(const HP& b) const {

         HP c;

         c.len = ;

         for(int i = ,g = ; g||i < max(len,b.len); i++) {

             int x = g;

             if(i < len) x += s[i];

             if(i < b.len) x += b.s[i];

             c.s[c.len++] = x%;

             g = x/;

         }

         return c;

     }

     void clean() {

         while(len >  && !s[len-]) len--;

     }

     HP operator *(const HP& b) {

         HP c;

         c.len = len + b.len;

         for(int i = ; i < len; i++)

             for(int j = ; j < b.len; j++)

                 c.s[i+j] += s[i]*b.s[j];

         for(int i = ; i < c.len-; i++) {

             c.s[i+] += c.s[i]/;

             c.s[i] %= ;

         }

         c.clean();

         return c;

     }

     HP operator - (const HP& b) {

         HP c;

         c.len = ;

         for(int i = ,g = ; i < len; i++) {

             int x = s[i]-g;

             if(i < b.len) x -= b.s[i];

             if(x >= ) g = ;

             else {

                 g = ;

                 x += ;

             }

             c.s[c.len++]=x;

         }

         c.clean();

         return c;

     }

     HP operator /(const HP &b) {

         HP c, f = ;

         for(int i = len-; i >= ; i--) {

             f = f*;

             f.s[] = s[i];

             while(f >= b) {

                 f = f - b;

                 c.s[i]++;

             }

         }

         c.len = len;

         c.clean();

         return c;

     }

     HP operator % (const HP &b) {

         HP r = *this / b;

         r = *this - r*b;

         return r;

     }

     HP operator /= (const HP &b) {

         *this  = *this / b;

         return *this;

     }

     HP operator %= (const HP &b) {

         *this = *this % b;

         return *this;

     }

     bool operator < (const HP& b) const {

         if(len != b.len) return len < b.len;

         for(int i = len-; i >= ; i--)

             if(s[i] != b.s[i]) return s[i] < b.s[i];

         return false;

     }

     bool operator > (const HP& b) const {

         return b < *this;

     }

     bool operator <= (const HP& b) {

         return !(b < *this);

     }

     bool operator == (const HP& b) {

         return !(b < *this) && !(*this < b);

     }

     bool operator != (const HP &b) {

         return !(*this == b);

     }

     HP operator += (const HP& b) {

         *this = *this + b;

         return *this;

     }

     bool operator >= (const HP &b) {

         return *this > b || *this == b;

     }

 };

 istream& operator >>(istream &in, HP& x) {

     string s;

     in >> s;

     x = s.c_str();

     return in;

 }

 ostream& operator <<(ostream &out, const HP& x) {

     out << x.str();

     return out;

 }

 HP dp[][];

 int main(){

     dp[][] = ;

     for(int i = ; i < ; ++i)

         for(int j = ; j <= i*; ++j)

             for(int k = ; k < ; ++k)

                 dp[i][j + k] = dp[i][j + k] + dp[i-][j];

     int n,s;

     while(~scanf("%d%d",&n,&s)){

         if(s&) puts("");

         else cout<<dp[n][s>>]*dp[n][s>>]<<endl;

     }

     return ;

 }

巴特西