Holy Knight

KnightOS 是一个为 TI Z80 计算器专门编写的第三方操作系统。在 Stock OS 基础上提供很多特性,包括多任务(可同时运行32个程序)和基于树型结构的文件系统;采用类 Unix 的环境。KnightOS 完全采用 Z80 的汇编语言。其核心是独立,你也可以用它来编写自己的操作系统。 KnightOS 上的应用程序可使用 31K 的内存。

相关文章

加载中

[博客] Knight Moves

https://my.oschina.net/u/4373914/blog/3466675

2019/07/12 00:00

[博客] Knight Tour Problem

https://my.oschina.net/u/4317554/blog/4234994

##哈密顿图 它是一个无向图,由天文学家哈密顿提出,由指定的起点前往指定的终点,途中经过所有其他节点且只经过一次。在图论中是指含有哈密顿回路的图,闭合的哈密顿路径称作为哈密顿回路,...

2018/02/11 00:00

[博客] sicily 1781 Knight

https://my.oschina.net/u/235391/blog/102536

Description Your task is to write a program to calculate the minimum number of moves needed for a knight to reach one point from another. The possible knight moves are shown in ...

2013/01/16 00:00

[软件] knight - HTTP 服务器

https://www.oschina.net/p/knight

knight 是一个 Go 语言写的 HTTP 服务器,支持自动重载功能,就是可以自动检测文件的改变并根据需要重启服务器。 用法: package main import ( "fmt" "net/http" "github.com/fengsp/knight...

[博客] 【广搜】Knight Moves

https://my.oschina.net/u/4324682/blog/3457419

题目描述 Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him? Your task is to wri...

2019/07/19 00:00

[博客] 1148 H. Holy Diver

https://my.oschina.net/u/4318809/blog/4468150

1148 H. Holy Diver 题意: 强制在线,初始数组为空.每次询问给出四个整数(a,l,r,k),表示在数组末尾添加(a),求满足(lleq xleq yleq r)以及(text{mex}(a{x},a{x+1},cdots,a_y)=k)的整数对(x,y)...

08/04 00:00

[博客] 1257:Knight Moves

https://my.oschina.net/u/4412009/blog/3475385

传送门:http://ybt.ssoier.cn:8088/problem_show.php?pid=1257 【题目描述】 输入n 代表有个n×n 的棋盘,输入开始位置的坐标和结束位置的坐标,问一个骑士朝棋盘的八个方向走马字步,从开始...

2019/07/05 00:00

[博客] 1148 H. Holy Diver

https://my.oschina.net/u/4309098/blog/3414443

##1148 H. Holy Diver 题意: 强制在线,初始数组为空.每次询问给出四个整数$a,l,r,k$,表示在数组末尾添加$a$,求满足$lleq xleq yleq r$以及$text{mex}(a{x},a{x+1},cdots,a_y)=k$的整数对$x,...

2019/08/26 00:00

[博客] poj 1915 Knight Moves

https://my.oschina.net/u/1053833/blog/350280

Knight Moves Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 22220 Accepted: 10384 Description Background Mr Somurolov, fabulous chess-gamer indeed, asserts that no o...

2014/11/29 00:00

[博客] poj 2488 A Knight's Journey

https://my.oschina.net/u/1053833/blog/186107

dfs 注意字典序输出 1 12 34 3 Sample Output Scenario #1:A1 Scenario #2:impossible Scenario #3:A1B3C1A2B4C2A3B1C3A4B2C4 Source [Submit] [Go Back] [Status] [Discuss] /*============...

2013/12/19 00:00

[博客] uva 439 - Knight Moves

https://my.oschina.net/u/1584603/blog/283606

先研究下国际象棋中马是怎么走的,然后bfs就哦了。 #include include include int map[10][10]; typedef struct Point {int x;int y;int dis;} Point; typedef Point* Ptr; Point queue[500...

2014/06/24 00:00

[博客] [LeetCode 1197] Minimum Knight Moves

https://my.oschina.net/u/4270627/blog/3389486

In an infinite chess board with coordinates from to , you have a knight at square . A knight has 8 possible moves it can make, as illustrated below. Each move is two squares in ...

2019/09/22 00:00

[博客] RL 解决 Knight walking

https://my.oschina.net/u/3642849/blog/1788615

该博客属于私人博客,由于作者设置了权限,您没法阅读此文,请与作者联系。

2018/04/02 00:00

[博客] Knight Moves(广搜BFS)

https://my.oschina.net/u/4333569/blog/3860041

Description A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a g...

2018/08/19 00:00

[博客] POJ2488 A Knight's Journey【DFS】

https://my.oschina.net/u/4395251/blog/3236396

A Knight’s Journey Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 58714 Accepted: 19998 Description Background The knight is getting bored of seeing the same black ...

04/16 00:00

[软件] Holy Lance - Linux 图形化性能监视器

https://www.oschina.net/p/holy-lance

Holy Lance 一个简单易用的 Linux 图形化性能监视器。 项目 GitHub https://github.com/lincanbin/Holy-Lance 演示地址 http://ipv4.94cb.com/Holy-Lance/build/holylance.php 下载地址 http...

[博客] 攻防世界 reverse reverse-for-the-holy-grail-350

https://my.oschina.net/u/4408758/blog/3388097

reverse-for-the-holy-grail-350 tu-ctf-2016 程序流程很简单,就一个检验函数: 1 int64 fastcall stringMod(int64 *a1) 2 { 3 int64 length; // r9 4 char *c_str; // r10 5 int64 i; // ...

2019/09/23 00:00

[博客] [LeetCode] 935. Knight Dialer 骑士拨号器

https://my.oschina.net/u/4409146/blog/3306895

A chess knight can move as indicated in the chess diagram below: . This time, we place our chess knight on any numbered key of a phone pad (indicated above), and the knight make...

03/02 00:00

[博客] HDU 1372 Knight Moves(最简单也是最经典的bfs)

https://my.oschina.net/u/4350015/blog/3895810

传送门: http://acm.hdu.edu.cn/showproblem.php?pid=1372 Knight Moves Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13384 ...

2018/07/22 00:00

[博客] LeetCode——688. Knight Probability in Chessboard

https://my.oschina.net/u/4386697/blog/3882121

一.题目链接:https://leetcode.com/problems/knight-probability-in-chessboard/ 二.题目大意:   给定一个N*N的棋盘和一个初始坐标值(r,c),开始时骑士在初始坐标处,骑士会进行移动,并...

2018/08/02 00:00
返回顶部
顶部