From 35658f092a3a6ba7f1e3b01d2f7e069b0abd84e0 Mon Sep 17 00:00:00 2001
From: xingyou wu <3050128610@qq.com>
Date: Thu, 10 Apr 2025 17:13:44 +0800
Subject: [PATCH] =?UTF-8?q?lanqiao=202108=20=20X=20=E8=BF=9B=E5=88=B6?=
 =?UTF-8?q?=E5=87=8F=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 13lanqiao/test5.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/13lanqiao/test5.cpp b/13lanqiao/test5.cpp
index aa0ff96..34efb36 100644
--- a/13lanqiao/test5.cpp
+++ b/13lanqiao/test5.cpp
@@ -18,7 +18,7 @@ signed main(){
     int w = 1; // W存储每一位的权重
     int t; // 存储每一位的进制
     for(int i = 1; i <= max(m,n); i++){
-        t = max(max(a[i], b[i]) + (int)1, (int)2); // 计算每一位的进制
+        t = max(max(a[i], b[i]) + (int)1, (int)2); // 计算每一位的进制(取两数中最低进制), 正常情况下不会高于mx, 所以这里不对mx取小
         ans = (ans + (a[i] - b[i]) * w) % MOD; // 计算当前位置减法后转化为十进制的结果
         w = (w*t) % MOD; // 计算每一位的权重
     }