CodeForces #200(Div.2) A. Magnets
2013-09-17 20:45
239 查看
字符处理
电池种类有“+-” 和 “-+” 两种,输入之后判断有几种。
AC代码:
电池种类有“+-” 和 “-+” 两种,输入之后判断有几种。
AC代码:
#include <stdio.h> int main() { char a[5]; int n, cnt = 0, flag = -1; scanf("%d", &n); for(int i = 0; i < n; i++) { scanf("%s", a); int type; if(a[0] == '0') type = 0; else type = 1; if(flag != type) ++cnt; flag = type; } printf("%d\n", cnt); return 0; }
相关文章推荐
- Codeforces #200(div.2) 模拟练习赛
- Codeforces #200 (Div.2) E. Read Time 解题报告
- Cf 98 Div.2
- CodeForces #176(Div.2)-A
- Codeforces #191(Div.2)解题报告
- cf Round #202 (div.2) C ------------ Mafia
- Codeforces Round #228(Div.2) A,B,C,E
- Codeforces Rcc 2014 warmup (div.2)
- CODEFORCE 246 Div.2 B题
- Codeforces#258 (Div.2) E - Devu and Flowers 容斥
- Codeforces round 244(div.2) D match&catch【字符串hash】
- CodeForces Round #279 (Div.2)
- Codeforces Beta Round #9 (Div.2 Only) C.Hexadecimal's Numbers 二进制思想、技巧题
- CodeForces#285 div.2 题解
- Topcoder SRM 648 Div.2 - A(水), B(枚举),C(DP/构造)
- #292 (div.2) D.Drazil and Tiles
- #297 (div.2) A. Vitaliy and Pie
- #299 (div.2) A. Tavas and Nafas
- Codeforces Round #305 (Div.2) D
- codeforces 306 div.2 B. Preparing Olympiad