diff options
| author | Richard Qin <richard.qin.001@gmail.com> | 2026-09-15 08:16:43 +0800 |
|---|---|---|
| committer | Richard Qin <richard.qin.001@gmail.com> | 2026-09-15 08:16:43 +0800 |
| commit | 4022e5c95210631e4aceb08eaf9d9071aa5aefc4 (patch) | |
| tree | a5922559836e45fb3459a3d070367912e1035b1a /tests/sysy_lvX/bigintsub.sy | |
| download | rcc-master.tar.gz rcc-master.tar.xz | |
Diffstat (limited to 'tests/sysy_lvX/bigintsub.sy')
| -rw-r--r-- | tests/sysy_lvX/bigintsub.sy | 127 |
1 files changed, 127 insertions, 0 deletions
diff --git a/tests/sysy_lvX/bigintsub.sy b/tests/sysy_lvX/bigintsub.sy new file mode 100644 index 0000000..0c5e915 --- /dev/null +++ b/tests/sysy_lvX/bigintsub.sy @@ -0,0 +1,127 @@ +int BigIntarr[2][100];
+int BigIntLength[2];
+int Result[200];
+
+int min(int a, int b) {
+ if (a > b) {
+ return b;
+ }
+ else {
+ return a;
+ }
+}
+
+int max(int a, int b) {
+ if (a > b) {
+ return a;
+ }
+ else {
+ return b;
+ }
+}
+
+int compare() {
+ int i = 0;
+ if (BigIntLength[0] > BigIntLength[1]) {
+ return 1;
+ }
+ if (BigIntLength[0] < BigIntLength[1]) {
+ return -1;
+ }
+ while (i < BigIntLength[0]) {
+ if (BigIntarr[0][i] > BigIntarr[1][i]) {
+ return 1;
+ }
+ if (BigIntarr[0][i] < BigIntarr[1][i]){
+ return -1;
+ }
+ i = i + 1;
+ }
+ return 0;
+}
+
+int subtract() {
+ int a[100];//把较大的数放于减数
+ int b[100];//把较小的数放于被减数
+ int c[100] = { 0 };//差
+ int i, j, k;//i用来循环 ,两加数中较大加数的长度放到j里，两加数中较小加数的长度放到k里
+ int flag;//标志结果为正还是负。
+ int l1, l2;
+ int pp[100];
+ l1 = BigIntLength[0];
+ l2 = BigIntLength[1];
+ k = min(l1, l2);
+ j = max(l1, l2);
+ if (compare() >= 0) {//减数必须大于被减数。方便计算。如果小于，就调换位置。
+ flag = 0;
+ i = 0;
+ while (i < l1) { //字符串逆序导入数组中
+ a[i] = BigIntarr[0][l1 - 1 - i];
+ i = i + 1;
+ }
+ i = 0;
+ while (i < l2) {
+ b[i] = BigIntarr[1][l2 - 1 - i];
+ i = i + 1;
+ }
+ }
+ else {
+ flag = 1;
+ i = 0;
+ while (i < l2) {
+ a[i] = BigIntarr[1][l2 - 1 - i];
+ i = i + 1;
+ }
+ i = 0;
+ while (i < l1) {
+ b[i] = BigIntarr[0][l1 - 1 - i];
+ i = i + 1;
+ }
+ }
+ i = 0;
+ while (i < k) {
+ if (a[i] >= b[i]) {
+ c[i] = a[i] - b[i];
+ }
+ else {
+ c[i] = a[i] + 10 - b[i];
+ a[i + 1] = a[i + 1] - 1;
+ }
+ i = i + 1;
+ }
+ while (i < j) {
+ if (a[i] >= 0) { c[i] = a[i]; }
+ else {
+ c[i] = a[i] + 10;
+ a[i + 1] = a[i + 1] - 1;
+ }
+ i = i + 1;
+ }
+ while (c[i - 1] == 0) i = i - 1;
+ j = 0;
+ if (flag == 1)
+ //pp[j++] = '-';
+ putch(45);
+ k = i - 1;
+ while (k > -1) {
+ Result[j] = c[k];
+ k = k - 1;
+ j = j + 1;
+ }
+ return j;
+}
+
+int main()
+{
+ int n;
+ int i = 0;
+ BigIntLength[0] = getarray(BigIntarr[0]);
+ BigIntLength[1] = getarray(BigIntarr[1]);
+ i = 0;
+ n = subtract();
+ while (i < n) {
+ putint(Result[i]);
+ i = i + 1;
+ }
+ return 0;
+}
\ No newline at end of file |