练习11
来源:互联网 发布:证件照软件 编辑:程序博客网 时间:2024/05/17 02:42
#include <iostream>
using namespace std;
typedef unsigned short int USHORT;
short int divide(USHORT a, USHORT b)
{
if (b == 0)
return -1;
else
return a/b;
}
int main()
{
USHORT one, two;
short int answer;
cout << "Enter two numbers.\n Number one: ";
cin >> one;
cout << "Number two: ";
cin >> two;
answer = divide(one, two);
if (answer > -1)
cout << "Answer: " << answer;
else
cout << "Error, can't divide by zero!";
return 0;
}
using namespace std;
typedef unsigned short int USHORT;
short int divide(USHORT a, USHORT b)
{
if (b == 0)
return -1;
else
return a/b;
}
int main()
{
USHORT one, two;
short int answer;
cout << "Enter two numbers.\n Number one: ";
cin >> one;
cout << "Number two: ";
cin >> two;
answer = divide(one, two);
if (answer > -1)
cout << "Answer: " << answer;
else
cout << "Error, can't divide by zero!";
return 0;
}
阅读全文
0 0
- 练习11
- 练习11
- 练习11
- 【SICP练习】11 练习1.17
- c练习11
- c语言练习11
- linux0.11练习提升
- 练习笔记11
- OpenGL 练习11 Lighting
- java练习11-20
- ?Python 练习实例11
- 11、“小练习”学习
- leetCode练习(11)
- 算法练习11
- 2016.11.11小练习
- C-C++练习11
- 11上机练习1
- 11上机练习2
- USACO-Section1.3 Mixing Milk【贪心算法】
- 51nod1536 不一样的猜数游戏
- c语言入门:文件读写操作
- ubuntu安装openssh-server 报依赖错误的解决过程
- 算法导论思考题13-1:持久动态集合中的持久二叉搜索树
- 练习11
- 练习12
- 面向对象程序设计第三次实验课——Wuxing
- 正则表达式NFA.java
- 练习13
- 海外SDK之----------谷歌登录
- Android 点击事件常用写法
- swing 表格模型增加删除行和列
- poj2406 power strings