HDU_2101 A + B Problem Too
来源:互联网 发布:域名的重要性 编辑:程序博客网 时间:2024/06/05 02:35
A + B Problem Too
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9531 Accepted Submission(s): 7185
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
Source
HDU 2007-6 Programming Contest
Recommend
xhd
#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;}
- HDU_2101 A + B Problem Too
- hdu-A+B Problem Too
- A + B Problem Too 2101
- hdu2101 A + B Problem Too
- HDU2101 A + B Problem Too
- hdu2101 A + B Problem Too
- [2101]:A + B Problem Too
- 2101 A + B Problem Too
- HDOJ2101 A + B Problem Too
- hdu 2101 A + B Problem Too
- hdu 2101 A + B Problem Too(数论)
- Hdu 2101 A + B Problem Too
- A + B Problem Too hdoj 2101
- hdu-2101-A + B Problem Too
- HDU2101 A + B Problem Too【水题】
- HDU 2101 A + B Problem Too
- hdu 2101 A + B Problem Too
- HDOJ 2101 A + B Problem Too
- 80端口被system占用,PID=4
- 11,标准C
- @庞果网 倒水问题
- [设计模式笔记]二. 结构型模式--7.Adapter模式(适配器模式)(二)
- 不用客户端,轻松下视频
- HDU_2101 A + B Problem Too
- 解决Tomcat下中文乱码问题
- java Arrays.sort(T[] a, Comparator<? super T> c)调用一个已经封装好的排序规则进行排序
- 各种排序
- 习题 E2
- 安装matlab以及oracle等大型软件出现“archive is not a ZIP archive”错误的解决方案
- VTK概述
- 删除子串,只要是原串中有相同的子串就删掉,不管有多少个,返回子串个数。
- linux分段机制