HDU 1267

 

http://acm.hdu.edu.cn/showproblem.php?pid=1267

规律题

#include<iostream>

#include<string>

#include<cstring>

#include<cstdio>

#include<cmath>

#include<sstream>

#include<algorithm>

using namespace std;

const int N = 21;

long long dp[N][N];

int m,n;

int main()

{

   memset(dp,0,sizeof(dp));

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

   {

      dp[i][0] = 1;

   }

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

   {

      for(int j = 1; j <= 20; j++)

      {

         if(i >= j)dp[i][j] = dp[i-1][j] + dp[i][j-1];

      }

   }

   while(cin>>m>>n)

   {

      cout<<dp[m][n]<<endl;

   }

   return 0;

}