登录
首页 » java » 猜数字小游戏

猜数字小游戏

于 2022-07-01 发布 文件大小:9.48 kB
0 89
下载积分: 2 下载次数: 1

代码说明:

猜中数字就算你赢,9宫格形式猜数字,数字每次会变化,如果你点到是数字,你将会得到积分,如何使陷阱,你将会失败,不能再进行游戏。

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • java实现打飞机主要功能
    简单的打飞机的功能,基本的功能一应俱全,用鼠标控制飞机,后期自己可以更多的完善功能
    2022-11-30 19:45:03下载
    积分:1
  • caleeisixvmootools
    js漂亮日历特效插件,基于calendar-eightysix-v1.1.js,与mootools插件配合来完成,可浮动弹出窗口选择日历,这也是日历选择器惯用的一种方式,一共有13种不同调用方式和显示效果的日历代码,需要日期选择器的这下有富气了。(js beautiful calendar effect plug-ins, based on calendar-eightysix-v1.1.js, and come complete with mootools plug-in, you can choose a floating pop-up calendar, and this is one way the calendar picker usual, a total of 13 kinds of different ways and call display a calendar code, you need to the date that the case has rich gas.)
    2014-10-12 18:42:03下载
    积分:1
  • Enterprise-Software
    企业软件架构与设计,内含大量实例和实践技巧(Enterprise software architecture and design, including a large number of examples and practical skills)
    2013-11-08 03:57:31下载
    积分:1
  • Freemarker-2.3.16 API
    Freemarker-2.3.16 API.chm英文版,非常详细(Freemarker-2.3.16 API.chm)
    2020-06-16 06:40:02下载
    积分:1
  • inheritancw
    继承项目..我自己..在eclipse中使用froms和jsp进行编码..它是用java编程语言进行的..如果您想下载,请单击此链接。。
    2022-12-10 22:45:03下载
    积分:1
  • android 拍照或从相册中选择并保存到sd卡
    拍照或从相册中选择并保存到sd卡
    2015-05-07下载
    积分:1
  • Struts 例子
    Struts 例子
    2022-03-10 12:38:09下载
    积分:1
  • KendoUiDemo
    前台UI设置框架kuendoUi的简单操作demo。按照官网的例子 实现前台的设置。基于html5 界面华丽(Front desk UI Settings framework kuendoUi simple operation demo. According to the example of website to realize the set. Based on the meta interface gorgeous )
    2013-01-29 09:59:08下载
    积分:1
  • chapter2
    说明:  代码实现了JSP的欢迎及用户登录界面,适合初学者(The code implements the welcome of JSP and user login interface.)
    2020-06-25 20:40:01下载
    积分:1
  • 1
    说明:  The famous Collatz sequence is generated by a method decribed as follows. Given a positive integer N, if it is odd, then replace it with 3*N+1. For even number N, use N/2 instead. You can get a sequence of number by this method. It is conjectured that the algorithm above will terminate at 1 for any integral input value. Despite the simplicity of the algorithm, it is unknown whether this conjecture is true. It has been verified, however, for all integers n such that 0 < n < 1,000,000 (and, in fact, for many more numbers than this.) (Input The first line contains a single integer T tells that there are T cases in the problem. Then for each case, there is an integers N. Output For each number N, output the sequence generated in a line, using coma as its separator. )
    2012-12-08 20:33:43下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载