1647

来源:互联网 发布:淘宝app产品定位 编辑:程序博客网 时间:2024/05/22 17:16

题目链接:点击打开链接

#include <iostream>#include <cstdio>using namespace std;int A[1005][150], B[1005][150];int main(){    A[0][0] = A[1][0] = 1;    for(int i = 2; i <= 1000; i++)        for(int j = 0; j < 135; j++)        {            A[i][j] += A[i-1][j] + A[i-1][j];            B[i][j] += B[i-2][j] + A[i-2][j];            A[i][j+1] += A[i][j] / 10000; A[i][j] %= 10000;            B[i][j+1] += B[i][j] / 10000; B[i][j] %= 10000;        }    int n;    while(scanf("%d", &n) == 1)    {        int i;        for(i = 135; i > 0 && B[n][i] == 0; i--);        printf("%d", B[n][i]);        for(i--; i >= 0; i--) printf("%04d", B[n][i]);        printf("\n");    }    return 0;}


0 0
原创粉丝点击