5 这个好玩吗

尚未进行身份认证

我要认证

Offer已在路上请耐心等待,准备入职的新人

等级
TA的排名 1w+

【分享】SDLPAL 仙剑奇侠传开源项目编译

项目URL:https://github.com/sdlpal/sdlpal仙剑游戏不用过多介绍了,国内很出名的RPG经典作品,结局往往凄美感人~~~今天偶尔看到这个开源项目,作者是个外国人,复刻了上世纪仙剑游戏很古老的版本,但是很值得研究,能学到不少游戏编程的知识。该项目基于SDL,支持跨平台,Win、Linux、Android、Mac都可以。我在Windows环境下编译体验了一下~...

2018-09-08 22:12:27

Learning Node-RED 4.安装dashboard模块

Node-RED已经为我们提供了很多节点,随着Node-RED版本不断更新,越来越多的开发者为其做出了贡献,我们可以安装一些其他模块来满足开发的需要。安装dashboard模块在右上方的部署按钮右侧有个菜单,点击菜单,选择节点管理。搜索“dashboard”关键字,按照下图点击安装即可。稍等片刻会提示安装成功。接下来会发现左侧节点列表中会多出来dashboard模块。关于dashboardNode...

2018-07-08 22:34:16

Learning Node-RED 3.Node-RED的编程模型

本节主要介绍Node-RED平台的关键概念和一些关键组件,并通过具体实例说明Node-RED的编程模型。数据流程(flow),flow是Node-RED中最重要的概念,一个flow流程就是一个Node-RED程序,它是由多个节点相互连接在一起形成数据通信的集合。在Node-RED的底层实现,一个flow流程通常是由一系列的JavaScript对象和若干个节点的配置信息组成,通过底层的Node.js...

2018-07-08 22:07:18

Learning Node-RED 2.安装Node-RED

安装Node.js进入Node.js官网,http://nodejs.cn/download/  选择本地操作系统下载安装包,下载.msi文件,运行安装node环境即可。运行cmd,输入node --version && npm --version,会显示相应的版本号。安装Node-RED打开cmd窗口,输入命令:npm install -g --unsafe-perm node-...

2018-06-20 00:44:36

Learning Node-RED 1.Node-RED简介

Node-RED是IBM在2013年末开发的一个开源项目,目的用于快速构建物联网应用。之后越来越多的人开始使用Node-RED,直到现在,Node-RED依然在不断更新和维护。Node-RED的特点Node-RED最大的特点在于其反应的是可视化编程思想,类似于Scratch基于Node.js,也就是说Node-RED采用的是事件驱动和非阻塞I/O机制开源性,可以对其进行二次开发,这也...

2018-06-20 00:21:13

2018-计蒜之道-初赛-第五场

A. 贝壳找房搬家贝壳找房换了一个全新的办公室,每位员工的物品都已经通过搬家公司打包成了箱子,搬进了新的办公室了,所有的箱子堆放在一间屋子里(这里所有的箱子都是相同的正方体),我们可以把这堆箱子看成一个 x \times y \times zx×y×z 的长方体。贝壳找房的leader觉得所有的箱子放在一间房子里有点太挤了,不方便每个员工搬运自己的物品,于是又让搬家公司把这堆箱子的前面、后面、左边...

2018-05-26 23:20:13

POJ-3164 Command Network

After a long lasting war on words, a war on arms finally breaks out between littleken’s and KnuthOcean’s kingdoms. A sudden and violent assault by KnuthOcean’s force has rendered a total failure of li...

2018-05-04 23:55:55

POJ-3255 Roadblocks

Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because she likes the scenery along the way. She...

2018-05-04 23:54:20

POJ-2449 Remmarguts' Date

"Good man never makes girls wait or breaks an appointment!" said the mandarin duck father. Softly touching his little ducks' head, he told them a story. "Prince Remmarguts lives in his kingdom UDF – U...

2018-05-04 23:52:59

HDU-4738 Caocao's Bridges

Caocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn't give up. Caocao's army still was not good at water battles, so he came up with another idea. He built many island...

2018-05-04 23:51:31

POJ-1144 Network

A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N . No two places have the same number. The lines are bi...

2018-05-04 23:49:29

POJ-3683 Priest John's Busiest Day

John is the only priest in his town. September 1st is the John's busiest day in a year because there is an old legend in the town that the couple who get married on that day will be forever blessed by...

2018-05-04 23:47:37

POJ-3368 Frequent values

You are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries consisting of indices i and j (1 ≤ i ≤ j ≤ n). For each query, det...

2018-05-04 23:44:01

POJ-3264 Balanced Lineup

For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the cows. To keep things ...

2018-05-04 23:42:34

NYOJ-119 士兵杀敌(三)

士兵杀敌(三)时间限制:2000 ms  |  内存限制:65535 KB难度:5描述南将军统率着N个士兵,士兵分别编号为1~N,南将军经常爱拿某一段编号内杀敌数最高的人与杀敌数最低的人进行比较,计算出两个人的杀敌数差值,用这种方法一方面能鼓舞杀敌数高的人,另一方面也算是批评杀敌数低的人,起到了很好的效果。所以,南将军经常问军师小工第i号士兵到第j号士兵中,杀敌数最高的人与杀敌数最低的人之间军功差...

2018-05-04 23:41:18

POJ-2823 Sliding Window

An array of size n ≤ 10 6 is given to you. There is a sliding window of size kwhich is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time...

2018-05-04 23:38:25

HDU-1533 Going Home

On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little man, you need t...

2018-05-03 23:10:22

HDU-1532 Drainage Ditches

Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Fa...

2018-05-03 23:08:19

POJ-2796 Feel Good

Bill is developing a new mathematical theory for human emotions. His recent investigations are dedicated to studying how good or bad days influent people's memories about some period of life. A new id...

2018-05-03 23:06:30

POJ-2559 Largest Rectangle in a Histogram

A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure on the left shows ...

2018-05-03 23:04:39

查看更多

勋章 我的勋章
    暂无奖章