If We Were a Child Again



If We Were a Child Again

大意：

计算给出数据的商或余

要点：

借鉴了前辈思想， 采用了LONG LONG来存储数据

由于限制除数的最大范围为INT型的最大值，所以余数可以用LONG LONG 型来存储

由高位依次往地位取商，使得除法运算始终不会溢出LONG LONG型的最大值

代码：

#include <iostream>#include <string>using namespace std;string x, sign;long long y, mod;int divi[10000];int main(){long long i, j;while (cin >> x >> sign >> y){mod = 0;long long leng = x.length();for (i = 0; i < leng; i++){mod = mod * 10 + x[i] - '0';divi[i] = mod / y;mod = mod % y;}if (sign == "%")cout << mod;else{bool flag = false;for (j = 0; j < i; j++){if (divi[j] > 0)flag = true;if (flag)cout << divi[j];}if (!flag)cout << "0";}cout << endl;}return 0;}