UVa 10813 - Traditional BINGO

题目：bingo游戏，在5x5的矩阵里填上数字（1-75，中间为空），然后有一个已知的数字串，

按照数字串的顺序在矩阵里做标记，如果出现某行、或某列、或对角线全被标记则结束；

问在取第几个数字时结束。

分析：模拟。读懂题目，直接模拟即可。

说明：(⊙o⊙)…

#include <stdio.h>int bingo[5][5], number[80], in_bingo[80];int main()
{int n;while (~scanf("%d", &n))while (n --) {for (int i = 1; i <= 75; ++ i) {in_bingo[i] = -1;}for (int i = 0; i < 5; ++ i) {for (int j = 0; j < 5; ++ j) {if (i == 2 && j == 2) {bingo[i][j] = 0;}else {scanf("%d", &bingo[i][j]);in_bingo[bingo[i][j]] = i * 5 + j;}}}for (int k = 0; k < 75; ++ k) {scanf("%d", &number[k]);}int flag = 0;for (int k = 0; k < 75; ++ k) {int position = in_bingo[number[k]];if (position != -1) {bingo[position/5][position%5] = 0;}for (int i = 0; i < 5; ++ i) {int count = 0;for (int j = 0; j < 5; ++ j) {if (bingo[i][j] == 0) {count ++;}}if (count == 5) {flag = 1;break;}}for (int i = 0; i < 5; ++ i) {int count = 0;for (int j = 0; j < 5; ++ j) {if (bingo[j][i] == 0) {count ++;}}if (count == 5) {flag = 1;break;}}if (!bingo[0][0] && !bingo[1][1] && !bingo[3][3] && !bingo[4][4]) {flag = 1;}if (!bingo[0][4] && !bingo[1][3] && !bingo[3][1] && !bingo[4][0]) {flag = 1;}if (flag) {printf("BINGO after %d numbers announced\n", k+1);break;}}}return 0;
}

UVa 10813 - Traditional BINGO相关推荐

π-Algorithmist分类题目（1）
原题网站:Algorithmist,http://www.algorithmist.com/index.php/Main_Page π-Algorithmist分类题目(1) Sorting UVAL ...
POJ前面的题目算法思路【转】
1000 A+B Problem 送分题 49% 2005-5-7 1001 Exponentiation 高精度 85% 2005-5-7 1002 487-3279 n/a 90% 2005-5- ...
HOJ题目分类//放这儿没事刷刷学算法！嘻嘻！
各种杂题,水题,模拟,包括简单数论. 1001 A+B 1002 A+B+C 1009 Fat Cat 1010 The Angle 1011 Unix ls 1012 Decoding Task 1 ...
POJ 超详细分类
POJ 各题算法 1000 A+B Problem 送分题 49% 2005-5-7 1001 Exponentiation 高精度 ...
[搜索]UVa 129 困难的串
题意:将一个包含两个相邻的重复子串的子串,称为"容易的串",其他为"困难的串". 输入正整数n和l,输出由前l个字符组成的,字典序第n小的困难的串. 输入样例: ...
uva 401.Palindromes
题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem ...
Uva 3767 Dynamic len(set(a[L:R])) 树套树
Dynamic len(set(a[L:R])) Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 https://uva.onlinejudge.org/in ...
UVA 11752 超级幂
UVA 11752 超级幂 Z - The Super Powers Time Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & ...
UVa 11174 - Stand in a Line
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&p ...

UVa 10813 - Traditional BINGO

UVa 10813 - Traditional BINGO相关推荐

最新文章

热门文章