(正确题意)Codeforces Round #639 (Div. 2) C Hilbert's Hotel

这题不少人是猜了一个找(i+ai)％n=(j+aj)％n水过去的，这个做法是正确的，但实际题意不是这样的，因为这样样例都没法解释

正确的题意是这样的：给你一个数组ai，找两个不相等的整数k1，k2，是否存在k1+a[k1%n]=k2+a[k2%n]

然后推一下就可以发现它和找
(i+ai)％n=(j+aj)％n是等价的
 

 推的过程如下：

假设是两个数ai和aj在变换后相等，现在找k1+a[k1%n]=k2+a[k2%n]

i=k1%n,所以k1=x*n+i

J=k2%n,所以k2=x*n+j

然后把上面的式子替换一下
x1*n+i+a[(x1*n+i)%n]=x2*n+j+a[(x2*n+j)%n]

在两边都％n的情况下

就是i+ai=j+aj了

 

Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero and negative integers. Even stranger, the hotel is currently at full capacity, meaning there is exactly one guest in every room. The hotel's manager, David Hilbert himself, decides he wants to shuffle the guests around because he thinks this will create a vacancy (a room without a guest).

For any integer k

and positive integer n, let kmodn denote the remainder when k is divided by n. More formally, r=kmodn is the smallest non-negative integer such that k−r is divisible by n. It always holds that 0≤kmodn≤n−1. For example, 100mod12=4 and (−1337)mod3=1

.

Then the shuffling works as follows. There is an array of n

integers a0,a1,…,an−1. Then for each integer k, the guest in room k is moved to room number k+akmodn

.

After this shuffling process, determine if there is still exactly one guest assigned to each room. That is, there are no vacancies or rooms with multiple guests.

Input

Each test consists of multiple test cases. The first line contains a single integer t

(1≤t≤104) — the number of test cases. Next 2t

lines contain descriptions of test cases.

The first line of each test case contains a single integer n

(1≤n≤2⋅105

) — the length of the array.

The second line of each test case contains n

integers a0,a1,…,an−1 (−109≤ai≤109

).

It is guaranteed that the sum of n

over all test cases does not exceed 2⋅105

.

Output

For each test case, output a single line containing "YES" if there is exactly one guest assigned to each room after the shuffling process, or "NO" otherwise. You can print each letter in any case (upper or lower).

Example

Input

Copy

6
1
14
2
1 -1
4
5 5 5 1
3
3 2 1
2
0 1
5
-239 -2 -100 -3 -11

Output

Copy

YES
YES
YES
NO
NO
YES

Note

In the first test case, every guest is shifted by 14

rooms, so the assignment is still unique.

In the second test case, even guests move to the right by 1

room, and odd guests move to the left by 1

room. We can show that the assignment is still unique.

In the third test case, every fourth guest moves to the right by 1

room, and the other guests move to the right by 5

rooms. We can show that the assignment is still unique.

In the fourth test case, guests 0

and 1 are both assigned to room 3

.

In the fifth test case, guests 1

and 2 are both assigned to room 2

.

代码：

#include<cstdio>
#include<cstring>
#define ll long long
#include<algorithm>
#define maxn 205000
#include<math.h>
#include<map>
#include<string>
#include<unordered_map>
#define ll long long
using namespace std;
#include<stdio.h>
map<ll,ll>mp;
int main()
{
    ll t;
    scanf("%lld",&t);
    while(t--)
    {
        ll n;
        scanf("%lld",&n);
        mp.clear();
        ll f=0;
        for(ll i=1;i<=n;i++)
        {
            ll x;
            scanf("%lld",&x);
            ll y=((i+x)%n+n)%n;
            if(mp[y]==1)
            {
                f=1;
            }
            mp[y]=1;
        }
        if(f==0) printf("YES\n");
        else printf("NO\n");
    }
}