zoukankan      html  css  js  c++  java
  • 2015 多校联赛 ——HDU5344(水)

    Problem Description
    MZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (Ai+Aj)(1i,jn)
    The xor of an array B is defined as B1 xor B2...xor Bn
     
    Input
    Multiple test cases, the first line contains an integer T(no more than 20), indicating the number of cases.
    Each test case contains four integers:n,m,z,l
    A1=0,Ai=(Ai1m+z) mod l
    1m,z,l5105,n=5105
     
    Output
    For every test.print the answer.
     
    Sample Input
    2 3 5 5 7 6 8 8 9
     
    Sample Output
    14 16



    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<vector>
    #include<cmath>
    typedef long long ll;
    const int maxn = 0x3f3f3f3f;
    using namespace std;
    ll a[500010];
    
    int main()
    {
        int T;
        scanf("%d",&T);
        while(T--)
        {
            int n,m,k,l;
            memset(a,0,sizeof(a));
            scanf("%d%d%d%d",&n,&m,&k,&l);
            a[1] = 0;
            for(int i = 2;i <= n;i++)
               a[i] = (a[i-1]*m+k)%l;
            for(int i = 2;i <= n;i++)
               a[i]^=a[i-1];
            printf("%I64d
    ",a[n]*2);
        }
        return 0;
    }
    

      

  • 相关阅读:
    JDBC连接MySQL并且查询操作。
    struts
    KMP 剪花布条hdoj2087
    线段树---敌兵布阵hdoj 1166
    设计模式----观察者模式
    线段树--hdoj1754
    ZOJ 2283 Challenge of Wisdom
    SGU 134 Centroid
    UVA 1637 Double Patience
    HDU 4389 X mod f(x)
  • 原文地址:https://www.cnblogs.com/Przz/p/5409802.html
Copyright © 2011-2022 走看看