CF 1714E - Add Modulo 10

Add Modulo 10

You are given an array of $n$ integers $a_1,a_2,\dots ,a_n$
You can apply the following operation an arbitrary number of times:

• select an index $i(1\le i\le n)$ and replace the value of the element $a_i$ with the value $a_i+(a_{i}mod10)$, where $a_{i}mod10$ is the remainder of the integer dividing $a_i$ by $10$.

For a single index (value $i$), this operation can be applied multiple times. If the operation is applied repeatedly to the same index, then the current value of $a_i$ is taken into account each time. For example, if $a_i=47$ then after the first operation we get $a_i=47+7=54$, and after the second operation we get $a_i=54+4=58$.
Check if it is possible to make all array elements equal by applying multiple (possibly zero) operations.
 
For example, you have an array $[6,11]$.

• Let’s apply this operation to the first element of the array. Let’s replace $a_1=6$ with $a_1+(a_{1}mod10)=6+(6mod10)=6+6=12$. We get the array $[12,11]$.
• Then apply this operation to the second element of the array. Let’s replace $a_2=11$ with $a_2+(a_{2}mod10)=11+(11mod10)=11+1=12$. We get the array $[12,12]$.

Thus, by applying $2$ operations, you can make all elements of an array equal.
 
Input
The first line contains one integer $t(1\le t\le 10^4)$ — the number of test cases. What follows is a description of each test case.
The first line of each test case contains one integer $n(1\le n\le 2\cdot 10^5)$ — the size of the array.
The second line of each test case contains $n$ integers $a_i(0\le a_i\le 10^9)$ — array elements.
It is guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot 10^5$.
 
Output
For each test case print:

• YES if it is possible to make all array elements equal;
• NO otherwise.
  You can print YES and NO in any case (for example, the strings yEs, yes, Yes and YES will be recognized as a positive answer) .

Example
input

10
2
6 11
3
2 18 22
5
5 10 5 10 5
4
1 2 4 8
2
4 5
3
93 96 102
2
40 6
2
50 30
2
22 44
2
1 5

output

Yes
No
Yes
Yes
No
Yes
No
No
Yes
No

Note
The first test case is clarified above.
In the second test case, it is impossible to make all array elements equal.
In the third test case, you need to apply this operation once to all elements equal to $5$.
In the fourth test case, you need to apply this operation to all elements until they become equal to $8$.
In the fifth test case, it is impossible to make all array elements equal.
In the sixth test case, you need to apply this operation to all elements until they become equal to $102$.

题目大意
给你 $n$ 个数，每一个数都可以进行不断加个位上的数操作，最终能否使得数组中 $n$ 个数都相同。
解题思路
我们从 $1$ 开始加找规律，$1+1=2，2+2=4，4+4=8，8+8=16，16+6=22，22+2=24\dots \dots$，可以看到，个位数的变化是有规律的( $2,4,6,8$ 一个循环)，然后我们可以把每个数都统一成一个相同的个位数，然后 $mod20$ (循环一次加 $20$ )，得到每个数开始加的起点(一个偶数)，判断起点相不相同就行了。
还有个位数是奇数的情况了，特殊的其实是 $0$ 和 $5$ ，因为其它奇数一加就变成偶数了。如果个位数为 $0$ ，那么这个数不会变，起点就是它本身，如果个位数是 $5$ ，那么把它加 $5$ ，就变成个位数为 $0$ 的情况。

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int t; cin>>t;
    while(t--)
    {
        int n; cin>>n;
        vector<int> a(n);
        for(int i=0; i<n; i++)
        {
            cin>>a[i];
            if(a[i]%5 != 0)
            {
                while(a[i]%10 != 2) //统一个位数，最后起点要么是这个个位数，要么是这个个位数+10
                    a[i] += a[i]%10;
                a[i] %= 20; //统一起点 (2, 12 其中一个
            }
            else a[i] += a[i]%10; // 0 或 5 统一终点
        }
        bool flag = true;
        for(int i=1; i<n; i++)
            if(a[i] != a[i-1]) flag = false;
        cout<<(flag? "YES\n": "NO\n");
    }
    return 0;
}