FZU1171 Hard to Believe, but True!
来源:互联网 发布:超级基因优化液第二部 编辑:程序博客网 时间:2024/05/21 06:54
Description
The fight goes on, whether to store numbers starting with their most significant digit or their least significant digit. Sometimes this is also called the "Endian War". The battleground dates far back into the early days of computer science. Joe Stoy, in his (by the way excellent) book "Denotational Semantics", tells following story:
"The decision which way round the digits run is, of course, mathematically trivial. Indeed, one early British computer had numbers running from right to left (because the spot on an oscilloscope tube runs from left to right, but in serial logic the least significant digits are dealt with first). Turing used to mystify audiences at public lectures when, quite by accident, he would slip into this mode even for decimal arithmetic, and write things like 73+42=16. The next version of the machine was made more conventional simply by crossing the x-deflection wires: this, however, worried the engineers, whose waveforms were all backwards. That problem was in turn solved by providing a little window so that the engineers (who tended to be behind the computer anyway) could view the oscilloscope screen from the back.You will play the role of the audience and judge on the truth value of Turing's equations.
[C. Strachey - private communication.]"
Input
The input contains several test cases. Each specifies on a single line a Turing equation. A Turing equation has the form "a+b=c", wherea, b, c are numbers made up of the digits 0,...,9. Each number will consist of at most 7 digits. This includes possible leading or trailing zeros. The equation "0+0=0" will finish the input and has to be processed, too. The equations will not contain any spaces.
Output
For each test case generate a line containing the word "True" or the word "False", if the equation is true or false, respectively, in Turing's interpretation, i.e. the numbers being read backwards.
Sample Input
73+42=16
5+8=13
10+20=30
0001000+000200=00030
1234+5=1239
1+0=0
7000+8000=51
0+0=0
Sample Output
True
False
True
True
False
False
True
True
把数字翻转看等式是否成立
#include<stack>#include<queue>#include<cmath>#include<cstdio>#include<vector>#include<string>#include<cstdlib>#include<cstring>#include<algorithm>using namespace std;typedef long long LL;const int maxn=1005;char s[maxn];int main(){while (~scanf("%s",s)){int a=0,b=0,c=0,i,j;for (i=0,j=1;s[i]!='+';i++,j*=10) a+=j*(s[i]-'0');for (i++,j=1;s[i]!='=';i++,j*=10) b+=j*(s[i]-'0');for (i++,j=1;s[i];i++,j*=10) c+=j*(s[i]-'0');if (a+b==c) printf("True\n"); else printf("False\n");if (!strcmp(s,"0+0=0")) break;}return 0;}
0 0
- FZU1171 Hard to Believe, but True!
- Hard to Believe, but True!
- Hard to Believe, but True!
- FZU 1171 Hard to Believe, but True!
- poj2572 Hard to Believe, but True!
- 【FOJ 1171】 Hard to Believe, but True!
- fzu 1171 Hard to Believe, but True!
- poj 2572 Hard to Believe, but True!(字符串)
- ACM篇:POJ 2572 -- Hard to Believe, But True!
- POJ 2572 Hard to Believe, but True! G++
- Hard to Believe, but True!(大数加法的模板和atoi()的应用)
- EOJ 1424/FOJ 1171/POJ 2572/ZOJ 1969/Ulm Local 2001 Hard to Believe, but True!
- How naive it's to believe node.js good for IO but bad for Computation?
- Spring is infinitely good, but hard to find clear Huan
- TO SEE IS TO BELIEVE
- 235. It is easy to open a shop but hard to keep it always open. 创业容易守业难
- roman doesn't be built in one day; but several years ` but you have to build it hard for every day
- Exceeded memory limit for $group, but didn't allow external sort. Pass allowDiskUse:true to opt in.
- POJ 2528 Mayor's posters 线段树+离散化
- POJ 2492 A Bug's Life(并查集+逻辑关系)
- FZU1150 Farmer Bill's Problem
- 黑马程序员——正则表达式2:功能演示
- 基于AbstractRoutingDataSource的动态切换数据库
- FZU1171 Hard to Believe, but True!
- scala柯里化函数
- Jenkins API curl创建job、执行构建
- Find The Multiple
- jquery代码阅读jQuery.makeArray()
- Sparql语言模型(一)
- STL 之 优先队列(priority_queue)
- Java聊天模拟
- POJ 3349 Snowflake Snow Snowflakes (链式解决冲突)