Codeforces 424C Magic Formulas
来源:互联网 发布:java int除法向上取整 编辑:程序博客网 时间:2024/06/05 20:01
题目链接:[这里写链接内容] (http://codeforces.com/contest/424/problem/C)
题面:
C. Magic Formulas(神奇的矩阵)
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
People in the Tomskaya region like magic formulas very much. You can see some of them below.
Imagine you are given a sequence of positive integer numbers p1, p2, …, pn. Lets write down some magic formulas:
Here, “mod” means the operation of taking the residue after dividing.
The expression means applying the bitwise xor (excluding “OR”) operation to integers x and y. The given operation exists in all modern programming languages. For example, in languages C++ and Java it is represented by “^”, in Pascal — by “xor”.
People in the Tomskaya region like magic formulas very much, but they don’t like to calculate them! Therefore you are given the sequence p, calculate the value of Q.
Input
The first line of the input contains the only integer n (1 ≤ n ≤ 106). The next line contains n integers: p1, p2, …, pn (0 ≤ pi ≤ 2·109).
Output
The only line of output should contain a single integer — the value of Q.
Sample test(s)
input
3
1 2 3
output
3
言简意赅:按照上述公式求解最后的数值Q,由于时间受限所以暴力并不能AC,根据题目提示Magic Formulas,可以知道要写出一个矩阵,找到规律并实现。
注意:异或运算是满足交换律的,0异或X的值即为X,可以把原来的值在输入时即完成异或,之后的求余运算可以写到矩阵里面,找到规律对总个数中i的个数进行判断奇偶。
#include <iostream>#include <cstdio>using namespace std;int p[1000005];int main(){ int n; int Q; int i,j; while(scanf("%d",&n)!=EOF) { Q=0; for(i=1;i<=n;i++) { scanf("%d",&p[i]); Q^=p[i]; } //cout<<Q<<endl; p[0]=0; p[1]=0; for(int i=2;i<=n;i++) { p[i]=p[i-1]^(i-1); } for(int i=1;i<=n;i++) { int count=n/i; int yu=n%i; if(count&1) Q^=p[i]; Q^=p[yu]; // Q^=0; Q^=yu; } printf("%d\n",Q); } return 0;}
- Codeforces 424 C. Magic Formulas
- Codeforces 424 C Magic Formulas
- CodeForces 424C Magic Formulas
- codeforces 424C Magic Formulas
- Codeforces 424C Magic Formulas
- Codeforces 424C Magic Formulas(异或应用)
- codeforces 424C. Magic Formulas (异或规律)
- CF 424C Magic Formulas
- CF 424C Magic Formulas
- CodeForce 424C Magic Formulas
- Codeforce 424C Magic Formulas 找规律
- CodeForce 424C Magic Formulas(数学题)
- Codeforces Round #242 (Div. 2) C. Magic Formulas
- Codeforecs 424C Magic Formulas 规律+前缀和
- Codeforces Round242 div1A&div2C Magic Formulas
- Codeforces Round #242 (Div. 2) C: Magic Formulas 神奇的异或算式
- Magic Formulas
- CF 243 C. Magic Formulas(位运算)
- iOS开发--Block容易造成循环引用
- dom4j之xpath
- 苹果官方电池保护壳 让iPhone 6怀孕一只4S
- RFID扫描APP--source4
- Linux 下的Makefile(二)
- Codeforces 424C Magic Formulas
- 【android】Android Studio项目打包,发布APK
- 2015年广东工业大学编译原理课设
- 常用的正则表达式
- [转]adb shell dumpsys 命令
- 58.UIView动画第二章(简单)
- 由后缀数组构造字典序最小的原串
- 进程和程序的区别----生动讲解
- ftp备份工具推荐,双向备份软件,文件同步软件,u盘备份软件推荐