Easy ModularQuadrant
题意：一个无限大的矩形，(r,c)位置的元素=max(r,c) mod3" role="presentation">(r,c)位置的元素=max(r,c) mod3(r,c)位置的元素=max(r,c) mod3(r,c)位置的元素=max(r,c)\ mod 3，查询一个子矩形内所有元素的和。
题解：格子内的值相当于到原点的切比雪夫距离模3" role="presentation">333
Easy ChangeDistances
题意：给定一个n" role="presentation" style="position: relative;">nnn个点的无向图G" role="presentation" style="position: relative;">GGG，要构造一个n" role="presentation" style="position: relative;">nnn个点的新无向图H" role="presentation" style="position: relative;">HHH满足对于任意点对u,v" role="prese
Easy MostFrequentLastDigit
题意：构造一个长为n" role="presentation" style="position: relative;">nnn的数列，满足两两的和mod 10" role="presentation" style="position: relative;">mod 10mod 10mod\ 10为d" role="presentation" style="position: relative;">ddd的整数对唯一最多，不能有一样多的。要求每个数都不一样，不超过109" role="
Easy Hyperbox
题意：二维立方体的边界是一维的，可以计算长度。三维立方体的边界时两维的，可以计算表面积。四维立方体时三维的，可以计算表体积。给定四维立方体的表体积V" role="presentation" style="position: relative;">VVV，问有多少个边长都是正整数的，表体积为V" role="presentation" style="position: relative;">VVV的四维立方体。
题解：为什么Div1" role="presentation" style="position: relative;">Div1Di
Easy EraseToGCD
题意：n" role="presentation" style="position: relative;">nnn个数ai" role="presentation" style="position: relative;">aiaia_i，删除一些数使得gcd" role="presentation" style="position: relative;">gcdgcdgcd为给定值t" role="presentation" style="position: relative;">ttt，问有多少种删除方法。n≤5
A Colorful Slimes 2
题意：n" role="presentation" style="position: relative;">nnn只史莱姆排成一行，每种史莱姆有个颜色c(1≤c≤n)" role="presentation" style="position: relative;">c(1≤c≤n)c(1≤c≤n)c(1\le c\le n)。两个相邻的同色史莱姆会合体，你可以把一只史莱姆的颜色修改成[1,10000]" role="presentation" style="position: relative;"
Easy FightMonsterDiv1
题意：你要打个怪，有HP" role="presentation" style="position: relative;">HPHPHP点血。你一开始的攻击力是ATK(/s)" role="presentation" style="position: relative;">ATK(/s)ATK(/s)ATK(/s)，攻击力每1s" role="presentation" style="position: relative;">1s1s1s会增加原始攻击力ATK" role="presentation" style="positio
Easy IdenticalBags
题意：你有N" role="presentation" style="position: relative;">NNN种糖果，第i" role="presentation" style="position: relative;">iii种糖果有Ai" role="presentation" style="position: relative;">AiAiA_i个。你想给一些小朋友发糖果包，每个糖果包里面每种糖果的个数要一样且要装恰好bagSize" role="presentation" style="position: relativ
A Candy Distribution Again
签到贪心，就不翻译了。
B Garbage Collector
题意：有n" role="presentation" style="position: relative;">nnn个垃圾排在线上，0" role="presentation" style="position: relative;">000处是垃圾桶，你要把n" role="presentation" style="position: relative;">nnn个垃圾捡到垃圾桶里面。拿着k" role="presentation" style
A Two Abbreviations
签到题，就不翻译了
找两个串一段长度的gcd" role="presentation" style="position: relative;">gcdgcdgcd，判一判对应位置一不一样就可以了。
B Removing Blocks
题意：给你一个长度为N" role="presentation" style="position: relative;">NNN的序列，将N" role="presentation" style="position: relative;">NNN个数依次删掉。每一次删掉一个数的代价是这个数
Rockdu's Blog