Codeforces Round #205 (Div. 2) : A
2013-10-12 18:45
260 查看
题意:
要求找到最少次数的交换次数使得两组数都是偶数;
很明显答案要么是0,要么是1,或者不管怎么交换都不行(-1);
所以:
View Code
要求找到最少次数的交换次数使得两组数都是偶数;
很明显答案要么是0,要么是1,或者不管怎么交换都不行(-1);
所以:
#include<cstdio> #define maxn 105 using namespace std; int n,x,y; int main() { scanf("%d",&n); int a=0,b=0,c=0; while(n--) { scanf("%d%d",&x,&y); a+=x,b+=y; c+=(y%2)!=(x%2); } if(a%2==0&&b%2==0)puts("0"); else if(c%2==0&&c>0)puts("1"); else puts("-1"); return 0; }
View Code
相关文章推荐
- Codeforces Round #205 (Div. 2) B. Two Heaps
- Codeforces Round #205 (Div. 2)
- Codeforces Round #205 (Div. 2) : B
- Codeforces Round #205 (Div. 2) A. Domino
- Codeforces Round #142 (Div. 2) C
- Codeforces Round #189 (Div. 2) A. Magic Numbers
- Codeforces Round #FF (Div. 2) A. DZY Loves Hash
- Codeforces Round #400 (Div. 1 + Div. 2, combined)C. Molly's Chemicals【思维】
- Codeforces Round #443 (Div. 1) A. Short Program
- Codeforces Round #469 (Div. 2) C. Zebras
- Codeforces Round #FF (Div. 2) E.DZY Loves Fibonacci Numbers
- Codeforces Round #144 (Div. 2) (模拟问题)
- Codeforces Round #190 (Div. 2)
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)A. A Serial Killer(水题)
- Codeforces Round #466 (Div. 2)-F-Machine Learning(待修改的莫队+离散化)
- Codeforces Round #256 (Div. 2) B
- Codeforces Round #278 (Div. 1) 解题报告 A.B.
- Codeforces Round #320 (Div. 2) C - A Problem about Polyline
- Codeforces Round #108 (Div. 2)
- Codeforces Round #191 (Div. 2)