LA3700 Interesting Yang Hui Triangle(Lucas定理)
来源:互联网 发布:分布式锁 java 编辑:程序博客网 时间:2024/05/19 01:07
Harry is a Junior middle student. He is very interested in the story told by his mathematics teacher about the Yang Hui triangle in the class yesterday. After class he wrote the following numbers to show the triangle our ancestor studied.
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 11 7 21 35 35 21 7 1 ......
He found many interesting things in the above triangle. It is symmetrical, and the first and the last numbers on each line is 1; there are exactly i numbers on the line i.
Then Harry studied the elements on every line deeply. Of course, his study is comprehensive.
Now he wanted to count the number of elements which are the multiple of 3 on each line. He found that the numbers of elements which are the multiple of 3 on line 2, 3, 4, 5, 6, 7, ... are 0, 0, 2, 1, 0, 4, ... So the numbers of elements which are not divided by 3 are 2, 3, 2, 4, 6, 3, ... , respectively. But he also found that it was not an easy job to do so with the number of lines increasing. Furthermore, he is not satisfied with the research on the numbers divided only by 3. So he asked you, an erudite expert, to offer him help. Your kind help would be highly appreciated by him.
Since the result may be very large and rather difficult to compute, you only need to tell Harry the last four digits of the result.
Input
There are multiple test cases in the input file. Each test case contains two numbers P and N , (P < 1000, N109) , where P is a prime number and N is a positive decimal integer.
P = 0, N = 0 indicates the end of input file and should not be processed by your program.
Output
For each test case, output the last four digits of the number of elements on the N + 1 line on Yang Hui Triangle which can not be divided by P in the format as indicated in the sample output.
Sample Input
3 4 3 48 0 0
Sample Output
Case 1: 0004Case 2: 0012
#include <iostream>#include <cstdio>#include <cstring>#include <vector>#include <string>#include <algorithm>#include <queue>using namespace std;int p,n;int ans;vector<int> digit;int main(){ int T = 1; while(~scanf("%d%d",&p,&n) && p+n){ digit.clear(); ans = 1; while(n){ digit.push_back(n%p); n /= p; } for(int i = 0; i < digit.size(); i++){ ans = (ans*(digit[i]+1))%10000; } printf("Case %d: %04d\n",T++,ans); } return 0;}
- LA3700 Interesting Yang Hui Triangle(Lucas定理)
- HDU3304 POJ3146 Interesting Yang Hui Triangle Lucas定理
- poj 3146 Interesting Yang Hui Triangle (Lucas定理)
- poj 3146/hdu 3304/uva 1384 Interesting Yang Hui Triangle Lucas定理
- poj 3146 Interesting Yang Hui Triangle(lucas定理的应用)
- HDU 3304 Interesting Yang Yui Triangle lucas定理
- POJ 3146 Interesting Yang Hui Triangle
- POJ 3146 Interesting Yang Hui Triangle 笔记
- hdu3306Interesting Yang Yui Triangle+LUCAS定理
- hdu 3304 Interesting Yang Yui Triangle
- POJ 3146 & HDU 3304 Interesting Yang Yui Triangle(杨辉三角)
- Lucas 定理
- Lucas 定理
- lucas定理
- Lucas定理
- Lucas 定理
- Lucas 定理
- Lucas 定理
- flashcache在SLES 11 SP3上的编译错误
- URI和URL的区别
- Xilinx FPFA中LUT4_L 元件的使用
- 类加载器作用
- pthread_cond 第三方库的线程同步机制
- LA3700 Interesting Yang Hui Triangle(Lucas定理)
- 华为机试---找出随机数字中最大的三位数
- 修改LINUX目录或文件的权限和所有权
- 网页布局基础
- Windows 2012 管理 Deduplication 的磁盘注意事项2则
- java编程思想(第四版)第三章练习题-10
- sicily 1018之模拟题
- 给Android系统安装busybox
- 华为机试---找出10000内的完数