HDU 1165 Eddy's research II

题意：已知，求A(m, n).

分析：根据样例模拟一下过程就可以找出递推关系。

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<iostream>
#include<sstream>
#include<iterator>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<deque>
#include<queue>
#include<list>
#define Min(a, b) a < b ? a : b
#define Max(a, b) a < b ? b : a
typedef long long ll;
typedef unsigned long long llu;
const int INT_INF = 0x3f3f3f3f;
const int INT_M_INF = 0x7f7f7f7f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll LL_M_INF = 0x7f7f7f7f7f7f7f7f;
const int dr[] = {, , -, };
const int dc[] = {-, , , };
const double pi = acos(-1.0);
const double eps = 1e-;
const int MAXN =  + ;
const int MAXT =  + ;
using namespace std;
ll a[][MAXN];
int main(){
    for(int i = ; i <= ; ++i){
        a[][i] = ll() + ll(i);
    }
    for(int j = ; j <= ; ++j){
        a[][j] = a[][ * j + ];
    }
    a[][] = ll();
    for(int i = ; i <= ; ++i){
        a[][i] = a[][i - ] *  + ll();
    }
    int m, n;
    while(scanf("%d%d", &m, &n) != EOF){
        printf("%lld\n", a[m][n]);
    }
    return ;
}