文件名称:turtlePaiting
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:693byte
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
C/C++实现著名的“海龟作图”源程序~
海龟作图模型:假设有只海龟,用一个50*50的二维数组模拟一块由方格组成的
画板,记录海龟爬行路线。海龟的行踪命令从一个数组中读取
,如读到1代表右转弯,读到2代表左转弯,读到36则代表前进6
格,经过的格子则置1,假设每次海龟都从[0][0]开始。请问如
何从左转和右转中找到控制二维数组行列增减的方法?-C/C++ to achieve the famous " Turtle mapping" source ~ Turtle mapping model: Suppose there are turtles, with a two-dimensional array of 50* 50 grid formed by the simulation of a drawing board, records of sea turtles crawl route. Turtle' s whereabouts command to read from an array, such as the representative to read a right turn, left turn to read two representatives, the representative read 36 6 cells move through the lattice is set to 1, assuming that each turtle are from [0 ] [0]. How do I find from the left and right control method of two-dimensional array of changes in the ranks?
海龟作图模型:假设有只海龟,用一个50*50的二维数组模拟一块由方格组成的
画板,记录海龟爬行路线。海龟的行踪命令从一个数组中读取
,如读到1代表右转弯,读到2代表左转弯,读到36则代表前进6
格,经过的格子则置1,假设每次海龟都从[0][0]开始。请问如
何从左转和右转中找到控制二维数组行列增减的方法?-C/C++ to achieve the famous " Turtle mapping" source ~ Turtle mapping model: Suppose there are turtles, with a two-dimensional array of 50* 50 grid formed by the simulation of a drawing board, records of sea turtles crawl route. Turtle' s whereabouts command to read from an array, such as the representative to read a right turn, left turn to read two representatives, the representative read 36 6 cells move through the lattice is set to 1, assuming that each turtle are from [0 ] [0]. How do I find from the left and right control method of two-dimensional array of changes in the ranks?
(系统自动生成,下载前可以参看下载内容)
下载文件列表
海龟做图.cpp
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.