zoukankan      html  css  js  c++  java
  • Codeforces Round #257 (Div. 2) B Jzzhu and Sequences

    Jzzhu has invented a kind of sequences, they meet the following property:

    You are given x and y, please calculate fn modulo 1000000007 (109 + 7).

    Input

    The first line contains two integers x and y (|x|, |y| ≤ 109). The second line contains a single integer n (1 ≤ n ≤ 2·109).

    Output

    Output a single integer representing fn modulo 1000000007 (109 + 7).

    Sample test(s)
    Input
    2 3
    3
    
    Output
    1
    
    Input
    0 -1
    2
    
    Output
    1000000006
    
    Note

    In the first sample, f2 = f1 + f3, 3 = 2 + f3, f3 = 1.

    In the second sample, f2 =  - 1;  - 1 modulo (109 + 7) equals (109 + 6).

    详见代码。

    。。

    #include<iostream>
    using namespace std;
    #define  modulo 1000000007
    int main()
    {
      __int64 q[6];
      int m,n;
    	  int k;
      while(~scanf("%d%d",&m,&n))
      {
         q[1]=m;
    	 q[2]=n;
    	 q[3]=n-m;
    	 q[4]=-m;
    	 q[5]=-n;
    	 q[0]=m-n;
    	 cin>>k;
    	 k=k%6;
    	 while(q[k]<0)
    		 q[k]=q[k]+modulo;
    	 
    		 printf("%I64d
    ",q[k]%modulo);
      }
    return 0;
    }
    


    版权声明:本文博客原创文章。博客,未经同意,不得转载。

  • 相关阅读:
    James 3.1服务器的安装与搭建
    Mybaits整合Spring
    动态sql
    Mybatis核心配置文件SqlMapConfig.xml
    Mapper动态代理方式
    WPF DatePicker
    UITableView(修改单元格)
    UITableView
    UIImageView
    UILabel
  • 原文地址:https://www.cnblogs.com/hrhguanli/p/4708139.html
Copyright © 2011-2022 走看看