hdu1005 Number Sequence
来源:互联网 发布:战地1枪械数据 编辑:程序博客网 时间:2024/06/07 20:50
Problem Description
A number sequence is defined as follows:
f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.
Given A, B, and n, you are to calculate the value of f(n).
f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.
Given A, B, and n, you are to calculate the value of f(n).
Input
The input consists of multiple test cases. Each test case contains 3 integers A, B and n on a single line (1 <= A, B <= 1000, 1 <= n <= 100,000,000). Three zeros signal the end of input and this test case is not to be processed.
Output
For each test case, print the value of f(n) on a single line.
Sample Input
1 1 31 2 100 0 0
Sample Output
25
Author
CHEN, Shunbao
Source
ZJCPC2004
#include<stdio.h>int main(){ int a,b,n; while(scanf("%d%d%d",&a,&b,&n)!=EOF) { if(a==0&&a==b&&b==n) break; int i,ans[50]; ans[1]=ans[2]=1; n=n%49; for(i=3; i<=n; i++) { ans[i]=((a*ans[i-1])+(b*ans[i-2]))%7; } printf("%d\n",ans[n]); } return 0;}7*7=49
阅读全文
0 0
- Number Sequence hdu1005
- (hdu1005)Number Sequence
- hdu1005 Number Sequence
- hdu1005 number sequence
- hdu1005 Number Sequence
- hdu1005 ( Number Sequence )
- Number Sequence(HDU1005)
- hdu1005 Number Sequence(数论)
- hdu1005 Number Sequence
- HDU1005 Number Sequence
- Hdu1005 Number Sequence
- hdu1005 Number Sequence
- hdu1005 Number sequence(数学)
- HDU1005 Number Sequence
- hdu1005 Number Sequence
- Number Sequence(HDU1005)
- HDU1005 Number Sequence
- hdu1005 Number Sequence
- 柱状图
- github的常用操作,ssh的配置,github免费域名
- Picasso和Glide对比(不深入)
- Failed to execute /init. Attempting defaults...
- HTML页面与基本标记
- hdu1005 Number Sequence
- Java JSON时间格式化
- Spring 中 Bean的作用域
- PHP手动注入实验
- 网购秒杀系统架构设计
- JAVA学习笔记_AMAP_拖拽选址及地理信息显示
- busybox动态编译
- Q_OBJECT类
- linux git服务器搭建,多用户协作