hdu 5319 Painter
2015-07-28 20:29
393 查看
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5319
题意:给你一个正方形,一把刷子,两种刷色法。
‘ \‘ 表示沿对角刷成红色,“/” 表示沿对角刷成蓝色。蓝色红色交叉形成绿色;
问最少刷几次形成如图图案。
解法:从上到下未被刷过就直接刷。
代码:
题意:给你一个正方形,一把刷子,两种刷色法。
‘ \‘ 表示沿对角刷成红色,“/” 表示沿对角刷成蓝色。蓝色红色交叉形成绿色;
问最少刷几次形成如图图案。
解法:从上到下未被刷过就直接刷。
代码:
[code]#include <stdio.h> #include <ctime> #include <math.h> #include <limits.h> #include <complex> #include <string> #include <functional> #include <iterator> #include <algorithm> #include <vector> #include <stack> #include <queue> #include <set> #include <map> #include <list> #include <bitset> #include <sstream> #include <iomanip> #include <fstream> #include <iostream> #include <ctime> #include <cmath> #include <cstring> #include <cstdio> #include <time.h> #include <ctype.h> #include <string.h> #include <assert.h> using namespace std; #define maxn 156 char maps[maxn][maxn]; int main() { int T, n, i, j; scanf("%d", &T); while(T--) { scanf("%d", &n); int ans = 0; memset(maps, 0, sizeof(maps)); for(i=1; i<=n; i++) { scanf("%s", maps[i]+1); for(j=1; maps[i][j]; j++) { if( (maps[i][j] == 'B'||maps[i][j] == 'G') && maps[i-1][j+1] != 'B' && maps[i-1][j+1] != 'G') ans ++; if( (maps[i][j] == 'R'||maps[i][j] == 'G') && maps[i-1][j-1] != 'R' && maps[i-1][j-1] != 'G') ans ++; } } printf("%d\n", ans); } return 0; }
相关文章推荐
- 7.28多校1004——模拟——Painter
- HDU 5319 Painter(2015多校联合)
- 2015 Multi-University Training Contest 3
- atcoder它A Mountaineer
- HDU 5319 Painter
- hdu 5316 Magician(2015 Multi-University Training Contest 3)
- ZOJ 3802 Easy 2048 Again 像缩进DP
- HDU 5319 Painter (模拟)
- hdu5326_(优美的并查集解法)2015 Multi-University Training Contest 3(1011)
- XSSFDataValidationHelper.createDateConstraint有Bug
- Sinatra:一个可以作为Rails有益补充的框架. 简洁而不简单
- 15/7/27/正则表达式/进程线程/wait/notify
- 语言中如何在main函数开始前执行函数
- HDU 5319 Painter (模拟 脑洞题)
- 2015 Multi-University Training Contest 3
- Acboy needs your help again!
- Failed to install *.apk on device 'emulator-5554': timeout
- 2015 Multi-University Training Contest 3(hdu 5316、5317、5319、5323、5325、5326)线段树+数学+yy+矩阵快速幂
- 2015 Multi-University Training Contest 3
- Aizu 0009 Prime Number