qq_29667767的博客

题目： 贪吃蛇，给你一个50X50的表格，贪吃蛇初始化在某个位置，自身长度L格，头往四个方向移动，每次移动一格，判断是成功、出界还是撞到自己。输入第一行为移动的步数，第二行为这些步数的方向，输出判断。 代码： #include<cstdio> #include<iostream> using namespace std; struct node { int ...

题目： Farmer John has decided to bring water to his N (1 <= N <= 300) pastures which are conveniently numbered 1..N. He may bring water to a pasture either by building a well in that pasture or c...