CF 405C Unusual Product
来源:互联网 发布:js window.open 编辑:程序博客网 时间:2024/06/07 01:45
分析一遍样例可以发现 a[k][k]*a[k][k]的只有1次,其他的都会有2次,相互抵消。
#include<stdio.h>const int N=1002;int a[N][N],n;int main(){ scanf("%d",&n); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) scanf("%d",&a[i][j]); int ans=0; for(int i=1;i<=n;i++) ans+=a[i][i]; int Q,op,k; scanf("%d",&Q); while(Q--){ scanf("%d",&op); if(op==1||op==2){ scanf("%d",&k); if(a[k][k]==0) ans++; else ans--; a[k][k]=1-a[k][k]; } else if(op==3) printf("%d",ans%2); } return 0;}
0 0
- CF 405C Unusual Product
- CF---C. Unusual Product
- CodeForces 405C Unusual Product
- CodeForces 405C Unusual Product
- Codeforces 405C Unusual Product
- Codeforces 405C Unusual Product
- codeforces 405C Unusual Product
- code forces 405C Unusual Product
- CodeForces 405C Unusual Product【思维】
- cf——A. Unusual Product
- codeforces:405C - Unusual Product 规律异或
- codeforces:405C - Unusual Product 规律异或
- Unusual Product
- cf 238div1 A. Unusual Product 异或运算
- codeforces 405 C. Unusual Product and E. Graph Cutting (异或规律 & 搜索)
- Codeforces Round #238 (Div. 2)C:Unusual Product
- Unusual Product--CF238C
- Unusual Product(codeforces)
- CF 405A Gravity Flip
- ceshi
- CF 405B Domino Effect
- CALL AND CALLVIRT IN CIL
- Codeforces Round #238 (Div. 2)
- CF 405C Unusual Product
- Codeforces Round #238 (Div. 2)前3题解题报告
- ARC相对MRC的优点
- Cocos2d-x3.0 学习笔记1
- [leetcode]Partition List
- 广告资源收集
- Reduce opacity of div's background without affecting contained element
- 汇编中的各种跳转指令
- matlab 绘图1