登录
首页 » Compress-Decompress algrithms » 小游戏,一款可以自行使用的象棋游戏,你可以轻松的上交作为作业。...

小游戏,一款可以自行使用的象棋游戏,你可以轻松的上交作为作业。...

于 2022-02-28 发布 文件大小:106.42 kB
0 221
下载积分: 2 下载次数: 1

代码说明:

小游戏,一款可以自行使用的象棋游戏,你可以轻松的上交作为作业。-small game, one is free to use the chess game, you can easily surrendered as operations.

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

发表评论

0 个回复

  • TML的参考源代码
    TML的参考源代码-TML reference source code
    2022-06-13 17:51:13下载
    积分:1
  • 比zip压缩比率高的rar压缩方法的解压程序
    比zip压缩比率高的rar压缩方法的解压程序 -decompression for the rar compression whichs rate is higher than zip
    2022-10-15 11:30:02下载
    积分:1
  • JPEG compression coding system source code
    JPEG压缩编码系统源代码-JPEG compression coding system source code
    2022-03-03 17:04:10下载
    积分:1
  • Compressive Sensing The Big Picture
    Compressive Sensing The Big Picture 可以连接到Rice大学等很多网页-Compressive Sensing The Big Picture
    2023-02-03 07:55:03下载
    积分:1
  • Ah ah ah ah ah ah ah ah ah ah ah ah ah ah
    啊啊 啊啊啊 啊啊啊 啊啊啊啊 -Ah ah ah ah ah ah ah ah ah ah ah ah ah ah
    2023-06-01 06:40:03下载
    积分:1
  • 方便处理JPEG格式图片的基于VC的源代码
    方便处理JPEG格式图片的基于VC的源代码-facilitate the processing of JPEG images based on the source code VC
    2022-02-12 11:22:53下载
    积分:1
  • strassen算法 visual studio 2008
    strassen算法 visual studio 2008-strassen
    2022-01-26 08:36:15下载
    积分:1
  • 每一步的LZSS算法发送一个字符或<;位置,冷…
    In each step the LZSS algorithm sends either a character or a pair. Among these, perhaps character "e" appears more frequently than "x", and a pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.-In each step the LZSS algorithm sends either a character or a lt;position, lengthgt; pair. Among these, perhaps character "e" appears more frequently than "x", and a lt;position, lengthgt; pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adap
    2022-07-08 14:12:34下载
    积分:1
  • 2023-02-13 08:25:03下载
    积分:1
  • asfk ldgtrgjhytkj侣的m,n,
    asfk ldgtrgjhytkj lyu m,n,-asfk ldgtrgjhytkj lyu m, n,
    2022-12-24 07:35:03下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载