zoukankan      html  css  js  c++  java
  • HDU2817

    Xinlv wrote some sequences on the paper a long time ago, they might be arithmetic or geometric sequences. The numbers are not very clear now, and only the first three numbers of each sequence are recognizable. Xinlv wants to know some numbers in these sequences, and he needs your help.

    Input

    The first line contains an integer N, indicting that there are N sequences. Each of the following N lines contain four integers. The first three indicating the first three numbers of the sequence, and the last one is K, indicating that we want to know the K-th numbers of the sequence. 

    You can assume 0 < K <= 10^9, and the other three numbers are in the range [0, 2^63). All the numbers of the sequences are integers. And the sequences are non-decreasing. 

    Output

    Output one line for each test case, that is, the K-th number module (%) 200907.

    Sample Input

    2
    1 2 3 5
    1 2 4 5
    #include <stdio.h>
     
    long long PowerMod(long long a,long long b,int c,long long q)
    {
    	long long ans=q;
    	a=a%c;
    	while(b>0)
    	{
    		if(b%2)
    			ans=(ans*a)%c;
    		b/=2;
    		a=(a*a)%c;
    	}
    	return ans;
    }
     
    int main()
    {
    	long long a,b,c;
    	int k;
    	int T;
    	scanf("%d",&T);
    	while(T--)
    	{
    		scanf("%I64d %I64d %I64d %d",&a,&b,&c,&k);
    		if(b-a==c-b)
    			printf("%d
    ",(a+(k-1)*(b-a))%200907);
    		else
    			printf("%I64d
    ",PowerMod(c/b,k-1,200907,a));
    	}
    	
    	return 0;
    }
  • 相关阅读:
    Python 中的一些小技巧
    Java/Python/Elixir 正则库使用上的注意事项
    Scrapy 学习笔记(一)数据提取
    记第一次面试
    Spring Web MVC 笔记
    Java 单元测试
    Spring 笔记(四)AOP
    C 语言 进阶
    编程的智慧
    Spring 笔记(三)Bean 装配
  • 原文地址:https://www.cnblogs.com/aerer/p/9931034.html
Copyright © 2011-2022 走看看