博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
Hopscotch POJ - 3050
阅读量:5052 次
发布时间:2019-06-12

本文共 2062 字,大约阅读时间需要 6 分钟。

Hopscotch

 

The cows play the child's game of hopscotch in a non-traditional way. Instead of a linear set of numbered boxes into which to hop, the cows create a 5x5 rectilinear grid of digits parallel to the x and y axes. 
They then adroitly hop onto any digit in the grid and hop forward, backward, right, or left (never diagonally) to another digit in the grid. They hop again (same rules) to a digit (potentially a digit already visited). 
With a total of five intra-grid hops, their hops create a six-digit integer (which might have leading zeroes like 000201). 
Determine the count of the number of distinct integers that can be created in this manner.
Input
* Lines 1..5: The grid, five integers per line
Output
* Line 1: The number of distinct integers that can be constructed
Sample Input
1 1 1 1 11 1 1 1 11 1 1 1 11 1 1 2 11 1 1 1 1
Sample Output
15
Hint
OUTPUT DETAILS: 
111111, 111112, 111121, 111211, 111212, 112111, 112121, 121111, 121112, 121211, 121212, 211111, 211121, 212111, and 212121 can be constructed. No other values are possible.

题解:

#include 
#include
#include
#include
#include
#include
#define INF 0x7f7f7f7ftypedef long long ll;using namespace std;char map[10][10];int move[4][2]={1,0,0,1,-1,0,0,-1};char ans[50000][10];int cou = 0;char temp[100];void dfs(int x, int y, int c){ temp[c] = map[x][y]; if (c == 5) { for (int i = 0; i < cou; i++) { if (!strcmp(temp, ans[i])) { return; } } strcpy(ans[cou++], temp); return; } for (int i = 0; i < 4; i++) { int nx = x + move[i][0], ny = y + move[i][1]; if (0<=nx&&nx<5&&0<=ny&&ny<5) { dfs(nx,ny,c+1); temp[c+1] = 0; } }}int main(){ int n = 0; for (int i = 0; i < 5; i++) { for (int j = 0; j < 500; j++) { char temp = getchar(); if ('0'<=temp&&temp<='9') { map[i][n++] = temp; } if (temp == '\n') { break; } } n=0; } for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { dfs(i, j, 0); temp[0] = 0; } } printf("%d\n", cou); return 0;}

转载于:https://www.cnblogs.com/focus5679/p/9286170.html

你可能感兴趣的文章
JS截取字符串常用方法
查看>>
Google非官方的Text To Speech和Speech Recognition的API
查看>>
stdext - A C++ STL Extensions Libary
查看>>
Django 内建 中间件组件
查看>>
bootstrap-Table服务端分页,获取到的数据怎么再页面的表格里显示
查看>>
进程间通信系列 之 socket套接字及其实例
查看>>
天气预报插件
查看>>
Unity 游戏框架搭建 (十三) 无需继承的单例的模板
查看>>
模块与包
查看>>
mysql忘记root密码
查看>>
apache服务器中设置目录不可访问
查看>>
嵌入式Linux驱动学习之路(十)字符设备驱动-my_led
查看>>
【NOIP模拟】密码
查看>>
java容器---------手工实现Linkedlist 链表
查看>>
three.js 性能优化的几种方法
查看>>
《梦断代码》读书笔记(三)
查看>>
FreeMarker解析json数据
查看>>
Java8 Lambda表达应用 -- 单线程游戏server+异步数据库操作
查看>>
次序+“选择不重复的记录”(3)——最大记录
查看>>
Codeforces 450 C. Jzzhu and Chocolate
查看>>