HDU 2101 A + B Problem Too
来源:互联网 发布:阿里云身份证识别api 编辑:程序博客网 时间:2024/05/20 20:43
Problem Description
This problem is also a A + B problem,but it has a little difference,you should determine does (a+b) could be divided with 86.For example ,if (A+B)=98,you should output no for result.
Input
Each line will contain two integers A and B. Process to end of file.
Output
For each case, if(A+B)%86=0,output yes in one line,else output no in one line.
Sample Input
1 18600 8600
Sample Output
noyes
水题,上代码:
#include <stdio.h>int main(){int a,b;while (scanf("%d%d",&a,&b)!=EOF){if ((a+b)%86==0)printf("yes\n");elseprintf("no\n");}return 0;}
1 0
- hdu 2101 A + B Problem Too
- hdu 2101 A + B Problem Too(数论)
- Hdu 2101 A + B Problem Too
- hdu-2101-A + B Problem Too
- HDU 2101 A + B Problem Too
- hdu 2101 A + B Problem Too
- HDU 2101 A + B Problem Too
- hdu-A+B Problem Too
- A + B Problem Too 2101
- [2101]:A + B Problem Too
- 2101 A + B Problem Too
- HDU——2101 A + B Problem Too
- HDU 2101 A + B Problem Too(水~)
- HDU 2101 A + B TOO
- A + B Problem Too hdoj 2101
- HDOJ 2101 A + B Problem Too
- HDOJ 2101 A + B Problem Too水题
- HDU_2101 A + B Problem Too
- Android 中对称加密算法DES,DESede,AES的加密和解密 的工具类的使用
- 第4周项目5用递归方法求解(1)
- 【转】Eclipse关闭XML文件验证的方法
- POJ - 2676 Sudoku 题解
- python 实现javascript加密思路[转载]
- HDU 2101 A + B Problem Too
- POJ - 3335 旋转计分板nlog n
- HDOJ 2025 查找最大元素
- 编译工具sbt安装与使用
- 解耦合
- [随笔]DBG、DMB、DSB 和 ISB -几条不常用的ARM指令
- 第四周项目5:递归求解
- Android蓝牙自动配对和Pin码设置
- hdu4081(最小生成树变形,prim)