URAL 1493. One Step from Happiness
来源:互联网 发布:java中的Node 编辑:程序博客网 时间:2024/04/29 14:03
1493. One Step from Happiness
Time limit: 1.0 second
Memory limit: 64 MB
Memory limit: 64 MB
Vova bought a ticket in a tram of the 13th route and counted the sums of the first three and the last three digits of the ticket's number (the number has six digits). It turned out that the sums differed by one exactly. "I'm one step from happiness," Vova thought, "either the previous or the next ticket is lucky." Is he right?
Input
The input contains the number of the ticket. The number consists of six digits, some of which can be zeros. It is guaranteed that Vova counted correctly, i.e., that the sum of the first three digits differs from the sum of the last three digits by one exactly.
Output
Output "Yes" if Vova is right and "No" otherwise.
Samples
715068
Yes
445219
No
012200
Yes
Notes
All tram tickets have exactly six digits. A ticket is considered lucky if the sum of its first three digits equals the sum of its last three digits.
题意:判断六位数字的的前,后三位数字之和是否相等。
解析:直接暴力判断即可。
AC代码:
#include <cstdio>int sum(int n){ int ans = 0; while(n){ ans += n % 10; n /= 10; } return ans;}bool check(int n){ int a = n % 1000, b = n / 1000; return sum(a) == sum(b);}int main(){ #ifdef sxk freopen("in.txt", "r", stdin); #endif //sxk int n; while(scanf("%d", &n)==1){ puts(check(n) || check(n-1) || check(n+1) ? "Yes" : "No"); //前一个和后一个也可以 } return 0;}
0 0
- URAL 1493. One Step from Happiness
- One-Step Change from Baseline Calculations
- one step one step...
- Ural 1463. Happiness to People!
- Ural 1463. Happiness to People!
- Step One: Strings
- Python One Step Further
- PLAN: step one
- Step one : 熟悉HTML
- 创业step one
- Happiness
- Happiness
- Happiness
- Happiness
- Happiness
- Happiness
- 目标检测one step与two step
- URAL 1495. One-two, One-two 2
- 版本升级实现代码 点击下载安装 并在通知栏显示
- The last packet successfully received fro m the server was 63,020,509 milliseconds ago
- js单一继承和多重继承
- 菜单模块重开发
- River Hopscotch (poj 3258 二分搜索)
- URAL 1493. One Step from Happiness
- Eclipse error : Failed to create the part's controls
- Leetcode: Binary Tree Level Order Traversal
- Ubuntu Linux下使用SVN Checkout本地库
- 安装fabric模块小计
- 路由器上网行为管理功能浅谈 -- 路由端
- KNN
- 如何整合S1SH(一)
- android中invalidate函数的原理