from math import *
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
div = []
d = 1
while d * d <= n:
if n % d == 0:
if d * d == n: div.append(d)
else: div.append(d); div.append(n // d)
d += 1
cnt = 0
for i in div:
if i == n: cnt += 1; continue
b = n // i
flag = 0
f = abs(a[0] - a[i])
if f == 1: continue
for j in range(i):
st = j
en = j + i
while en < n:
if (abs(a[st] - a[en])) == 0: st += i; en += i; continue
f = gcd(f, abs(a[st] - a[en]))
st = en
en += i
if f != 1: cnt += 1
print(cnt)
#include <bits/stdc++.h>
typedef long long ll;
#define int long long
#define PI acos(-1.0)
#define l1 cout << -1 << endl
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define endl "\n"
using namespace std;
using PII = pair<int,int>;
const int MAXN=2e5 + 9;
int t,a[MAXN];
int n;
queue<int> q;
void additional()
{
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> t;
}
int check(int x)
{
int temp = 0;
for(int i = 1;i + x <= n;i ++)
{
temp = gcd(temp,a[i + x] - a[i]);
}
return temp != 1;
}
void solve()
{
cin >> n;
for(int i = 1;i <= n;i ++)
{
cin >> a[i];
}
int ans = 0;
for(int i = 1;i * i <= n;i ++)
{
if(n % i == 0)
{
ans += check(i);
if(i * i != n)
{
ans += check(n / i);
}
}
}
cout << ans << '\n';
}
signed main()
{
t = 1;
additional();
while(t --)
{
solve();
}
}
1665C - Tree Infection | 1665D - GCD Guess |
29A - Spit Problem | 1097B - Petr and a Combination Lock |
92A - Chips | 1665B - Array Cloning Technique |
1665A - GCD vs LCM | 118D - Caesar's Legions |
1598A - Computer Game | 1605A - AM Deviation |
1461A - String Generation | 1585B - Array Eversion |
1661C - Water the Trees | 1459A - Red-Blue Shuffle |
1661B - Getting Zero | 1661A - Array Balancing |
1649B - Game of Ball Passing | 572A - Arrays |
1455A - Strange Functions | 1566B - MIN-MEX Cut |
678C - Joty and Chocolate | 1352E - Special Elements |
1520E - Arranging The Sheep | 1157E - Minimum Array |
1661D - Progressions Covering | 262A - Roma and Lucky Numbers |
1634B - Fortune Telling | 1358A - Park Lighting |
253C - Text Editor | 365B - The Fibonacci Segment |