Search - Berlin

[EditBox] 迷题

Description: 世界上只有2%的人能出答案的迷题的推导过程和答案（有七种答案）　　前面有人给出了这道出自1981年柏林的德国逻辑思考学院据说就连大名鼎鼎的爱因斯坦也成为此题大伤脑筋的迷题的七种答案和java实现过程。　　我这里用C++实现过程,我觉得代码写得还可以，如果有兴趣可与我交流。 -the world, only 2% of the people could answer out of the crowds that the derivation process and answers (some answers to seven) was given earlier this Road from the 1981 Berlin Germany logical thinking Institute said even the famous Einstein has become such a headache that large crowds that the seven answers and java implementation process. I use a C implementation process, I think the code can be written, if any interest in sharing with me.
Platform: | Size: 14491 | Author: 志明 | Hits:

[Other resource] sparspak

Description: http://www.math.tu-berlin.de/~bolle/SPARSPAK/index-e.html-http : / / www.math.tu-berlin.de/ ~ Bolle / SPARSPAK / index-bookings
Platform: | Size: 13311 | Author: 张宇 | Hits:

[Windows Develop] knight

Description: “八皇后”问题归朔法求解。八皇后问题是一个古老而著名的问题，该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。-"8 Queen" The problem Schomburg method. 8 Queen's problem is an ancient and famous, the problem is the famous 19th century mathematician Gauss 1850 : in the 8x8 grid placed on the international chess 8 Queen's, making it unable to attack each other. that is arbitrary two Queens are not at the same trip, the same series or in the same slash and asked how many pendulum. Gaussian that 76 species program. In 1854 in Berlin on different chess magazine published by the author of 40 different solutions, Later, someone using graph theory methods to come up with 92 kinds of results.
Platform: | Size: 162704 | Author: yefeng | Hits:

[Voice Compress] gsm-dos

Description: 柏林科技大学开发的gsm编码程序，可以对语音文件按照gsm格式进行编码压缩。-Berlin University of Science and Technology Development gsm coding procedures, Audio files can be right under gsm format coding.
Platform: | Size: 83148 | Author: HePeigang | Hits:

[Internet-Network] evalvid-2.0.1

Description: 一个视频传输质量评估系统Evalvid.具体使用的方法见http://www.tkn.tu-berlin.de/research/evalvid/fw.html-a video transmission quality assessment system Evalvid. Specific use of the method see http : / / www.tkn.tu-berlin.de/research/evalvid/ fw.html
Platform: | Size: 59844 | Author: 江雍 | Hits:

[Other resource] 8huanghou

Description: 八皇后问题是一个古老而著名的问题。这个问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。例如: 0 0 0 0 0 0 0 0 面对这个问题，要放在以往可能就要耗费大量的时间在纸上画来画去，这样做的耗费了大量的精力，但是效果却不佳。借助计算机就可以很高效的完成这些工作。那么，采用什么样的数据结构和算法，才能在时间和空间复杂度上完成这个问题呢？ -eight Queen's problem is an cient and well-known problems. The question is the famous 19th century mathematician Gauss 1850 : 8 X8 in the lattice placed on the international chess 8 Queen's, making it unable to attack each other. arbitrary or two at Queen's are not the same line, the same series or in the same slash and asked how many pendulum method. Gauss that 76 species program. 1854 in Berlin on different chess magazine published by the author of 40 different types of solutions Later, someone using graph theory methods to come up with 92 kinds of results. For example : 0 0 0 0 0 0 0 0 Faced with this problem, to be placed on the past, we might have spent a lot of time on paper painting to painting, so to spend a lot of energy, However, the result is poor. Using computer c
Platform: | Size: 83654 | Author: nicmaters | Hits:

[JSP/Java] TimerTest

Description: 能够实现Bombay、Cairo、New York、Berlin、Taipei、San Jose地方时之间的转换。
Platform: | Size: 1358 | Author: magichao | Hits:

[Other resource] “八皇后”问题递归法求解

Description: “八皇后”问题递归法求解 * 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。-"8 Queen's" recursive method * 8 Queen's problem is one of the oldest and famous, is backtracking algorithms typical example.18508X8 Gaussian that 76 species program. In 1854 in Berlin on different chess magazine published by the author of 40 different solutions, and later was used graph theory methods to come up with 92 kinds of results.
Platform: | Size: 2625 | Author: 美美 | Hits:

[Data structs] “八皇后”问题递归法求解

Description: “八皇后”问题递归法求解 * 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。-"8 Queen's" recursive method* 8 Queen's problem is one of the oldest and famous, is backtracking algorithms typical example.18508X8 Gaussian that 76 species program. In 1854 in Berlin on different chess magazine published by the author of 40 different solutions, and later was used graph theory methods to come up with 92 kinds of results.
Platform: | Size: 2048 | Author: 美美 | Hits:

[EditBox] 迷题

Description: 世界上只有2%的人能出答案的迷题的推导过程和答案（有七种答案）　　前面有人给出了这道出自1981年柏林的德国逻辑思考学院据说就连大名鼎鼎的爱因斯坦也成为此题大伤脑筋的迷题的七种答案和java实现过程。　　我这里用C++实现过程,我觉得代码写得还可以，如果有兴趣可与我交流。 -the world, only 2% of the people could answer out of the crowds that the derivation process and answers (some answers to seven) was given earlier this Road from the 1981 Berlin Germany logical thinking Institute said even the famous Einstein has become such a headache that large crowds that the seven answers and java implementation process. I use a C implementation process, I think the code can be written, if any interest in sharing with me.
Platform: | Size: 14336 | Author: 志明 | Hits:

[Algorithm] sparspak

Description: http://www.math.tu-berlin.de/~bolle/SPARSPAK/index-e.html-http :// www.math.tu-berlin.de/ ~ Bolle/SPARSPAK/index-bookings
Platform: | Size: 13312 | Author: 张宇 | Hits:

[Windows Develop] knight

Description: “八皇后”问题归朔法求解。八皇后问题是一个古老而著名的问题，该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。-"8 Queen" The problem Schomburg method. 8 Queen's problem is an ancient and famous, the problem is the famous 19th century mathematician Gauss 1850 : in the 8x8 grid placed on the international chess 8 Queen's, making it unable to attack each other. that is arbitrary two Queens are not at the same trip, the same series or in the same slash and asked how many pendulum. Gaussian that 76 species program. In 1854 in Berlin on different chess magazine published by the author of 40 different solutions, Later, someone using graph theory methods to come up with 92 kinds of results.
Platform: | Size: 162816 | Author: yefeng | Hits:

[Linux-Unix] marvell-berlin

Description: Marvell Berlin SoC Family Device Tree Bindings.
Platform: | Size: 2048 | Author: diufvvt | Hits:

[Linux-Unix] berlin-bg2

Description: Marvell Berlin BG2 pinctrl driver.
Platform: | Size: 2048 | Author: finseihie | Hits:

[Linux-Unix] phy-berlin-sata

Description: Marvell Berlin SATA PHY driver.
Platform: | Size: 2048 | Author: lounhxe | Hits:

[Linux-Unix] berlin

Description: Marvell Berlin SoC pinctrl core driver.
Platform: | Size: 2048 | Author: qukansang | Hits:

Category

Source Code

Web/Internet

Develop Tools

Document

Other

Search in results

OS

Platform

Language

File Type

Search list

[EditBox] 迷题

[Other resource] sparspak

[Windows Develop] knight

[Voice Compress] gsm-dos

[Internet-Network] evalvid-2.0.1

[Other resource] 8huanghou

[JSP/Java] TimerTest

[Other resource] “八皇后”问题递归法求解

[Data structs] “八皇后”问题递归法求解

[EditBox] 迷题

[Algorithm] sparspak

[Windows Develop] knight

[Linux-Unix] marvell-berlin

[Linux-Unix] berlin-bg2

[Linux-Unix] phy-berlin-sata

[Linux-Unix] berlin

[Delphi VCL] mydac76Berlin

[android] RAD Studio 10.1 Berlin 移动设备开发手册

[SourceCode] Tu Berlin machine learning 2 python

[WinSock-NDIS] Tu Berlin clound computing

CodeBus www.codebus.net