本文主要是介绍UVA10494 If We Were a Child Again，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
yiyi :
看了题目，以为整数只要用int 来存就够了，谁知道交了好几遍都不可以ac,后来把数据改成long类型的才可以，还是不是很懂什么时候会溢出，好坑，不开心！！！
| “Oooooooooooooooh! If I could do the easy mathematics like my school days!! I can guarantee, that I’d not make any mistake this time!!” Says a smart university student!! But his teacher even smarter – “Ok! I’d assign you such projects in your software lab. Don’t be so sad.” “Really!!” - the students feels happy. And he feels so happy that he cannot see the smile in his teacher’s face.
|  | |
| The Problem
The first project for the poor student was to make a calculator that can just perform the basic arithmetic operations.
But like many other university students he doesn’t like to do any project by himself. He just wants to collect programs from here and there. As you are a friend of him, he asks you to write the program. But, you are also intelligent enough to tackle this kind of people. You agreed to write only the (integer) division and mod (% in C/C++) operations for him. | ||
|
Input Input is a sequence of lines. Each line will contain an input number. One or more spaces. A sign (division or mod). Again spaces. And another input number. Both the input numbers are non-negative integer. The first one may be arbitrarily long. The second number n will be in the range (0 < n < 231). | ||
|
OutputA line for each input, each containing an integer. See the sample input and output. Output should not contain any extra space. | ||
|
Sample Input110 / 100 99 % 10 2147483647 / 2147483647 2147483646 % 2147483647 |
| |
Sample Output1 9 1 2147483646 |
| |
#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;int main (){char a[100000], ch;long a1[100000], c1[100000], b, x;int lena;while (scanf("%s %c %ld", a, &ch, &b) != EOF) {lena = strlen(a);memset(a1, 0, sizeof(a1));memset(c1, 0, sizeof(c1));for (int i = 1; i <= lena; i++) {a1[i] = a[i - 1] - 48;}x = 0;for (int i = 1; i <= lena; i++) {c1[i] = (x * 10 + a1[i]) / b;x = (x * 10 + a1[i]) % b;}int lenc = 1;if (ch == '/') {while (c1[lenc] == 0 && lenc < lena)lenc++;for (int i = lenc; i <= lena; i++) printf("%ld",c1[i]);printf("\n");}if (ch == '%') {printf("%ld\n", x);}memset(a, 0, sizeof(a));}return 0;
}这篇关于UVA10494 If We Were a Child Again的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
