hdu 1005 Number Sequence(数学题目,好好看)
来源:互联网 发布:电梯运行优化sas 编辑:程序博客网 时间:2024/05/29 07:01
1、http://acm.hdu.edu.cn/showproblem.php?pid=1005
2、题目大意:
Number Sequence
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluDescription
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).
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 3
1 2 10
0 0 0
Sample Output
2
5
3、ac代码:
#include<stdio.h>int f[1000]={0,1,1};int main(){ int a,b,n; while(scanf("%d%d%d",&a,&b,&n)!=EOF) { if(a==0 && b==0 && n==0) break;// f[0]=0;// f[1]=1;// f[2]=1; int flag; for(int i=3;i<=1000;i++) { f[i]= (a * f[i - 1] + b * f[i - 2])%7; if(f[i]==f[i-1]) { flag=i-2; //break; } } printf("%d\n",f[n%flag]); } return 0;}
- hdu 1005 Number Sequence(数学题目,好好看)
- 【HDU】-1005-Number Sequence(数学,规律)
- Number Sequence hdu 1005 一个有技巧的题目
- hdu 1005Number Sequence 看高手如何找规律
- HDU 1005 Number Sequence
- hdu 1005 Number Sequence
- HDU 1005 Number Sequence
- hdu 1005 Number Sequence
- HDU 1005 Number Sequence
- HDU 1005 Number Sequence
- HDU 1005 Number Sequence
- HDU--1005--Number Sequence
- hdu 1005 Number Sequence
- HDU 1005 Number Sequence
- HDU 1005 Number Sequence
- HDU 1005 Number Sequence
- hdu - 1005 Number Sequence
- HDU 1005 Number Sequence
- 7zip中文版
- zoj 2109 FatMouse' Trade简单的贪心 (注意double数组的排序问题)
- 类的成员函数参数定义为类的对象(匿名对象)
- iis7 文件上传后大小为0的终极解决方法
- windows错误码
- hdu 1005 Number Sequence(数学题目,好好看)
- vs2008使用hashmap
- Cocos2D-x 用CCControlSlider设置调节音量的大小
- hdu-2502-月之数
- memorydump()输出内存单元地址的数据
- 开篇---Linux TCP/IP协议源码分析
- 这样做真不知道对不对
- 在VS2010上使用C#调用非托管C++生成的DLL文件(图文讲解)
- Android代码片段---获取手机通讯录联系人列表