求Debug,全 RE

P3373 【模板】线段树 2

```cpp if(l==r){ tree[p]=a[l]%m; } ``` 改成 ```cpp if(l==r)return tree[p]=a[l]%m,void(); ```
by Humour_Fz @ 2024-01-06 14:18:12


@[Limitless_lmw](/user/809765)
by Humour_Fz @ 2024-01-06 14:18:35


@[Limitless_lmw](/user/809765) 还有 `while (m--)` 改成`while(q--)`
by Humour_Fz @ 2024-01-06 14:19:59


@[Limitless_lmw](/user/809765) 还有 ```cpp case 2: scanf("%lld %lle %lld",&x,&y,&k); update_add(x,y,1,n,k,1); ``` 改成 ```cpp case 2: scanf("%lld %lld %lld",&x,&y,&k); update_add(x,y,1,n,k,1); ```
by Shirley_ninefish @ 2024-01-06 14:25:43


@[Limitless_lmw](/user/809765) ```cpp build(ls(p),1,(l+r)>>1); ``` 改成 ```cpp build(ls(p),l,(l+r)>>1); ```
by Shirley_ninefish @ 2024-01-06 14:27:45


@[Limitless_lmw](/user/809765) ```cpp case 3: scanf("%lld",&x,&y); ``` 改 ```cpp case 3: scanf("%lld %lld",&x,&y); ```
by Shirley_ninefish @ 2024-01-06 14:36:11


@[Limitless_lmw](/user/809765) 还有每一个 **case** 最后都要加 **break** 啊。。。。
by Shirley_ninefish @ 2024-01-06 14:49:15


|