▍1. lianliankan
一款简单的连连看源码,有暂停 有限时,选中方块颜色会有变化(code of an easy game)
一款简单的连连看源码,有暂停 有限时,选中方块颜色会有变化(code of an easy game)
用python语言写的俄罗斯方块,经典,大家可以看看玩玩(Python language used to write Tetris, the classic, we can look at play)
Ubuntu系统下编译运行的俄罗斯方块源代码(ubuntu system complie source code)
Ubuntu系统下编译运行的俄罗斯方块源代码(ubuntu system complie source code)
火柴人的跳跃和滚动 按s滚动躲避障碍 按w跳跃躲避障碍(Stickman jumping and rolling)
火柴人的跳跃和滚动 按s滚动躲避障碍 按w跳跃躲避障碍(Stickman jumping and rolling)
说明: Background Given a set of rectangles {R1, R2, …, Rn}, compute the area of their common intersection. i.e., Area(R1∩R2∩…∩Rn) The edges of the rectangles R1, R2, …, Rn, are either vertical or horizontal lines. For example, the intersection of 4 rectangles, R1, R2, R3, and R4, in the following figure is the shaded rectangle. Input The input contains (N + 1) lines. The first line specifies the number of rectangles N, where 1 < N < 1000. Since the sides of the rectangles are parallel to the x-axis and y-axis, each rectangle is bounded by the lines x = x1, x = x2, y = y1 and y = y2 and each subsequent line of the input file thus specifies one rectangle in the following format: x1 x2 y1 y2 such that 0 <= x1 < x2 <= 10000 and 0 <= y1 < y2 <= 10000, and x1, x2, y1 and y2 are integers. Output The output file contains the area of the intersection of all the rectangles.
Background Given a set of rectangles {R1, R2, …, Rn}, compute the area of their common intersection. i.e., Area(R1∩R2∩…∩Rn) The edges of the rectangles R1, R2, …, Rn, are either vertical or horizontal lines. For example, the intersection of 4 rectangles, R1, R2, R3, and R4, in the following figure is the shaded rectangle. Input The input contains (N + 1) lines. The first line specifies the number of rectangles N, where 1 < N < 1000. Since the sides of the rectangles are parallel to the x-axis and y-axis, each rectangle is bounded by the lines x = x1, x = x2, y = y1 and y = y2 and each subsequent line of the input file thus specifies one rectangle in the following format: x1 x2 y1 y2 such that 0 <= x1 < x2 <= 10000 and 0 <= y1 < y2 <= 10000, and x1, x2, y1 and y2 are integers. Output The output file contains the area of the intersection of all the rectangles.
在数独高手的规则是要将9个数字填入一个9个小九宫格组成的9×9格子里。使得每一行,每一列和每个小九宫格里都有1-9的数字,并且每个数字在它所在的行、列以及每个小九宫格里面都只出现唯一一次。(Sudoku expert in the rules is to fill a 9 digit composed of nine small squares 9 × 9 grid yard. So that each row, each column and each have 1-9 small squares in the figures, and each figure in its row, column, and each small squares appear only inside the only time.)
在数独高手的规则是要将9个数字填入一个9个小九宫格组成的9×9格子里。使得每一行,每一列和每个小九宫格里都有1-9的数字,并且每个数字在它所在的行、列以及每个小九宫格里面都只出现唯一一次。(Sudoku expert in the rules is to fill a 9 digit composed of nine small squares 9 × 9 grid yard. So that each row, each column and each have 1-9 small squares in the figures, and each figure in its row, column, and each small squares appear only inside the only time.)
随机设置了雷的位置,当用户输入的位置与雷的位置相同,则游戏结束。否则该位置处打印出笑脸。(Ray random set position when the user enters the same position and the position of mine, the game is over. Otherwise, the position of print faces.)
随机设置了雷的位置,当用户输入的位置与雷的位置相同,则游戏结束。否则该位置处打印出笑脸。(Ray random set position when the user enters the same position and the position of mine, the game is over. Otherwise, the position of print faces.)
一个基于C++的打虫子游戏,难度递增,虫子的轨迹随机。(A C++ to play insect games, difficulty increase.)
一个基于C++的打虫子游戏,难度递增,虫子的轨迹随机。(A C++ to play insect games, difficulty increase.)
用TC写的撞球游戏,有保存功能,排行榜功能和单双人模式,dos下运行(TC wrote billiard games, save function, ranking function and single and double player mode, dos run)
用TC写的撞球游戏,有保存功能,排行榜功能和单双人模式,dos下运行(TC wrote billiard games, save function, ranking function and single and double player mode, dos run)
完美世界游戏客户端pck解包打包工具,同时支持cup更新包解包。(Perfect world game client PCK unpack packaging tools, at the same time support CPU update package. )
完美世界游戏客户端pck解包打包工具,同时支持cup更新包解包。(Perfect world game client PCK unpack packaging tools, at the same time support CPU update package. )
找出只出现一次的数字,其他数字均出现了2次,时间空间尽量少(Identify only appears once, while other figures have appeared two times to minimize time and space)
找出只出现一次的数字,其他数字均出现了2次,时间空间尽量少(Identify only appears once, while other figures have appeared two times to minimize time and space)