程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> hdu 5344 MZL's xor

hdu 5344 MZL's xor

編輯:C++入門知識

hdu 5344 MZL's xor


 

MZL's xor

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 310 Accepted Submission(s): 225



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)(1≤i,j≤n)
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=(Ai−1∗m+z) mod l
1≤m,z,l≤5∗105,n=5∗105

Output For every test.print the answer.
Sample Input
2
3 5 5 7
6 8 8 9

Sample Output
14
16

題意:求所有a[i]+a[j] 異或值,因為a[i]+a[j] 和a[j]+a[i] 會異或掉 所以只需考慮a[i]+a[i]

 

 

代碼:

 

#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include  
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   

using namespace std;

long long n, m, z, l;


int main()
{
    int t;
    scanf(%d, &t);
    while (t--)
    {
        scanf(%lld%lld%lld%lld, &n, &m, &z, &l);
        long long ans = 0;
        long long tmp = 0;
        for (int i = 2; i <= n;i++)
        {
            tmp = (tmp *m + z) % l;
            ans ^= (2 * tmp);
        }
        printf(%lld
,ans);
    }
    return 0;
}


 

 

 

 

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved