2015南阳理工CCPC Sudoku
来源:互联网 发布:帝国cms整合ck 编辑:程序博客网 时间:2024/04/30 15:29
Sudoku
Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)
Yi Sima was one of the best counselors of Cao Cao. He likes to play a funny game himself. It looks like the modern Sudoku, but smaller.
Actually, Yi Sima was playing it different. First of all, he tried to generate a
Then, he removed several numbers from the board and gave it to another guy to recover it. As other counselors are not as smart as Yi Sima, Yi Sima always made sure that the board only has one way to recover.
Actually, you are seeing this because you've passed through to the Three-Kingdom Age. You can recover the board to make Yi Sima happy and be promoted. Go and do it!!!
Input
The first line of the input gives the number of test cases, 1
, 2
, 3
, 4
). *
represents that number was removed by Yi Sima.
It's guaranteed that there will be exactly one way to recover the board.
Output
For each test case, output one line containing Case #x:
, where
Sample input and output
3****234141233214*243*312*421*134*41***3*2*414*2*
Case #1:1432234141233214Case #2:1243431234212134Case #3:3412123423414123
Source
#include <cstdio>#include <cstring>const int N = 6;char mp[N][N];bool vis1[N][N], vis2[N][N], vis3[N][N];bool found;void search(int cur) {if (cur == 16) {found = true;return ;}int r = cur / 4, c = cur % 4;int idx = mp[r][c] - '0';if (mp[r][c] == '*') {for (int i = 1; i <= 4; ++i) {if (!vis1[r][i] && !vis2[c][i] && !vis3[r / 2 * 2 + c / 2][i]) {vis1[r][i] = vis2[c][i] = vis3[r / 2 * 2 + c / 2][i] = true;mp[r][c] = '0' + i;search(cur + 1);if (found) break;mp[r][c] = '*';vis1[r][i] = vis2[c][i] = vis3[r / 2 * 2 + c / 2][i] = false;}}}else search(cur + 1);}void init() {memset(vis1, false, sizeof(vis1));memset(vis2, false, sizeof(vis2));memset(vis3, false, sizeof(vis3));found = false;}int main() {int T;scanf("%d", &T);while (T--) {init();for (int i = 0; i < 4; ++i) {scanf("%s", mp[i]);for (int j = 0; j < 4; ++j)if (mp[i][j] != '*') {int idx = mp[i][j] - '0';vis1[i][idx] = vis2[j][idx] = vis3[i / 2 * 2 + j / 2][idx] = true;}}search(0);static int cnt = 0;printf("Case #%d:\n", ++cnt);for (int i = 0; i < 4; ++i)printf("%s\n", mp[i]);}return 0;}
- 2015南阳理工CCPC Sudoku
- 2015 南阳理工CCPC Ancient Go
- 2015 南阳 CCPC hdu5547 Sudoku(DFS)
- 2015CCPC南阳场 H - Sudoku
- 2015南阳理工CCPC The Battle of Chibi
- 2015南阳CCPC Hdu5547
- 2015南阳CCPC D
- 【HDU5547 2015 CCPC 南阳国赛H】【DFS】Sudoku 4x4棋盘的填充
- 2015南阳ccpc L题
- 2015南阳ccpc L题
- HDU5547 Sudoku(深搜DFS)(2015CCPC)
- 2015 南阳 CCPC G.Ancient Go
- 2015南阳CCPC部分题目代码
- 2015南阳CCPC A - Secrete Master Plan
- CCPC-CDOJ-1222-Sudoku
- H - Sudoku【ccpc dfs】
- ccpc Sudoku(搜索)
- CCPC-南阳比赛总结
- 使用PHP搭建自己的MVC框架
- ASP显示对话框后页面跳转
- 第九周项目二对称矩阵的压缩存储及基本运算
- Uicc之ICCFileHandler(转)
- Activity启动模式(lauchMode)
- 2015南阳理工CCPC Sudoku
- 32位/64兼容 VC inline 汇编极限优化范例之颜色混合: AlphaBlendPixel
- 奇妙的NullPointerException
- Spring/Hibernate 应用性能优化的7种方法
- 斯坦福大学公开课 iOS应用开发教程学习笔记(第七课)UIToolbar、iPad 和iPhone的通用程序
- localtime 和 localtime_r
- 流程
- DataGrid使用
- 通过javacv对视频每隔1秒钟截取1张图片