搜索资源列表
1316-How-Many-Fibs
- HDU ACM 1316 Problem Descr iption Recall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n >= 3) Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a, b].
TestCase
- 测试控制台应用程序的代码TestCase,运行成功会在命令行窗口显示提示内容-Test console application code TestCase, running successfully on the command line window displays prompts content
duizhanexercise
- 堆栈练习，行编辑程序，迷宫求解，括号匹配检验，表达式求值-Stack practice, the line editor, maze solving, brace matching test, expression evaluation
test
- This program in c++ program that is used to simply print out a line of information.
jiandanjisuanqi
- c利用堆栈方法编写计算器可，实现小数的加、减、乘、除运算功能，并可进行行编辑功能（#表示退格，@表示退行）和括号匹配检验。-c using the method of preparation of the calculator stack can achieve decimal add, subtract, multiply, divide arithmetic functions, and can be line editing (# represents backspace, @ indic
work
- 数独游戏 a) 设计一个命令行界面的游戏，登入游戏界面后，应该有游戏规则说明，按键说明。 b) 进入游戏前应该有难度选择：1表示简单、2表示中等、3表示困难。 c) 在游戏主界面中有可以循环输入数独值、可以连续玩好几局直到退出、检查结果、查看答案、新开一局的功能。 d) 信息提示功能：输入错误时应有提示、游戏失败或获取胜利时应有庆祝界面等。 -Sudoku a) the design of a command-line interface of the game, log int