HDU 1023 Train Problem II
来源:互联网 发布:js和javascript的区别 编辑:程序博客网 时间:2024/04/29 17:34
As we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing order, how many orders that all the trains can get out of the railway.
12310
Sample Output
12516796
The result will be very large, so you may not process it by 32-bit integers.
#include<iostream>#include<string.h>#include<stdio.h>using namespace std;#define MAX 100#define BASE 10000void multiply(int a[],int Max,int b) //大数乘法,注意参数的传递{ int i,array=0; for (i = Max-1; i >= 0; i--) { array += b * a[i]; a[i] = array % BASE; // 数组每一位存放大数的四位数字 array /= BASE; }}void divide(int a[], int Max, int b) //模拟大数除法{ int i, div = 0; for (i = 0; i < Max; i++) { div = div * BASE + a[i]; a[i] = div / b; div %= b; }}int main(){ int a[101][MAX],i, n; memset(a[1],0,MAX*sizeof(int)); for (i=2, a[1][MAX-1] = 1; i < 101; i++) // 高坐标存放大数低位 { memcpy(a[i], a[i-1], MAX * sizeof(int)); //h[i] = h[i-1]; multiply(a[i], MAX, 4 * i - 2); //h[i] *= (4*i-2); divide(a[i], MAX, i + 1); //h[i] /= (i+1); } while (cin >> n) { for (i = 0; i < MAX && a[n][i] == 0; i++); //去掉数组前为0的数字。 cout << a[n][i++]; //输出第一个非0数 for (; i < MAX; i++) { printf("%04d",a[n][i]); //输出后面的数,并每位都保持4位长度!(32767) } cout << endl; } return 0;}
阅读全文
0 0
- hdu 1023 Train Problem II
- HDU-1023 Train Problem II
- HDU 1023 Train Problem II
- hdu 1023 Train Problem II
- hdu 1023 Train Problem II
- hdu 1023 - Train Problem II
- HDU 1023 Train Problem II
- hdu 1023 Train Problem II
- hdu 1023 Train Problem II
- hdu-1023-Train Problem II
- hdu 1023 Train Problem II
- HDU 1023 Train Problem II
- HDU 1023 Train Problem II
- hdu 1023 Train Problem II
- hdu 1023 Train Problem II
- 【HDU】 1023 Train Problem II
- HDU 1023 Train Problem II
- Train Problem II hdu 1023
- kubernetes资源对象--PetSets/StatefulSet
- 电子罗盘,LSM303DLHC
- RxJava中map的位置对其线程的影响,以及Toast不显示
- CCF CSP 201512-1 数位之和(Java-100分)
- css3 弹性盒子
- HDU 1023 Train Problem II
- Spring整合MyBatis(含监听器)
- oracle的case when函数
- MySQL5.6修改数据库存储路径
- 高数Umaru系列(9)——哈士奇(01背包,经典练习)
- malloc函数
- 【转】WebStorm设置React Native智能提示
- CVPR 2017 全部及部分论文解读集锦
- 服务器异常java.io.IOException: Too many open files(系统最大文件打开数限制)