zoukankan      html  css  js  c++  java
  • Number Sequence(杭电1005)

    /*Number Sequence
    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).

    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

    */
    //周期是48。不太明确。记住即可- -
    #include<stdio.h>
    int str[100000010]={0,1,2,0};
    int main()
    {
        int a,b,n,i;
        while(~scanf("%d%d%d",&a,&b,&n)&&(a||b||n))
        {
            for(i=3;i<=n;i++)
            str[i]=(a*str[i-1]+b*str[i-2])%7;
            printf("%d ",str[n]);
        }
        return 0;
    }
           

  • 相关阅读:
    fstest
    iozone
    fio
    vdbench
    饼状图点击凸出,适合颜色选择
    个人常用的win7快捷键
    form表单提交数据
    jquery允许跨越获取cookie
    设置滚动条样式与监听滚动到底部
    设置滚动条样式与监听滚动到底部
  • 原文地址:https://www.cnblogs.com/wgwyanfs/p/7065712.html
Copyright © 2011-2022 走看看