2015 Multi-University Training Contest-5 MZL's xor
来源:互联网 发布:饥荒 知乎 编辑:程序博客网 时间:2024/06/01 08:46
2015 Multi-University Training
Contest-5
MZL's xor
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 688 Accepted Submission(s): 440
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
23 5 5 76 8 8 9
Sample Output
1416
分析:
问题的关键在i和j的取值上, (Ai+Aj)(1≤i,j≤n) 仔细阅读只要发现i和j的取值范围,只要在1~n之间都符合,并没有强调i和j需要满足某种关系,那么,凡是i!=j的情况,都会导致( Ai+Aj )与( Aj+Ai )想与产生零的情况,而其他任何数和零相与都不变,所以可以无视i!=j的所有情况,只需要计算所有的i==j的情况,并且全部相与即可得出答案。
#include<iostream>using namespace std;__int64 a[500005];int main(){ int t; cin >> t; while (t--) { int n, m, z, l, s = 0; cin >> n >> m >> z >> l; a[1] = 0; for (int i = 2; i <= n; i++) { a[i] =( (a[i - 1] * m) % l + z%l)%l; <span style="font-family: Arial, Helvetica, sans-serif;">s ^= a[i] + a[i];</span>
} cout << s << endl; } return 0;}
- 2015 Multi-University Training Contest 5 - 1002 MZL's xor
- 2015 Multi-University Training Contest-5 MZL's xor
- HDU--5344--2015 Multi-University Training Contest 5--MZL's xor
- 2015 Multi-University Training Contest 5 - MZL's simple problem
- 2015 Multi-University Training Contest-5 MZL's chemistry
- HDU 5349 MZL's simple problem (2015 Multi-University Training Contest 5 2015多校联合)
- HDU 5347 MZL's chemistry (2015 Multi-University Training Contest 5 2015多校联合)
- hdu--5347--2015 Multi-University Training Contest 5--MZL's chemistry
- HDU--5349--2015 Multi-University Training Contest 5--MZL's simple problem
- HDU 5352 MZL's City(最小费用最大流)经典 2015 Multi-University Training Contest 5
- hdu 5348 MZL's endless loop 2015 Multi-University Training Contest 5
- hdu 5349 MZL's simple problem 2015 Multi-University Training Contest 5
- 2015 Multi-University Training Contest 5 1009 MZL's Border
- HDU 5351 MZL's Border(大数 + 找规律)——2015 Multi-University Training Contest 5
- 2015 Multi-University Training Contest 5
- 2015 Multi-University Training Contest 5
- 2015 Multi-University Training Contest 5
- 2015 Multi-University Training Contest 5
- 10进制数转16位2进制补码
- iOS应用内部切换语言,不跟随系统
- iOS 宏(define)与常量(const)的正确使用
- TCP三次握手及其背后的缺陷
- linux系统启动
- 2015 Multi-University Training Contest-5 MZL's xor
- akka 之 Dispatcher学习笔记
- linux系统忘root密码怎么办
- jQuery效果之滑动
- 2015-08-09
- 动态链接库的应用
- 2015 Multi-University Training Contest-5 MZL's chemistry
- OCUI界面设计:弹出框
- AC自动机