k1=[]
for t in range(int(input())):
k=[]
n=int(input())
a=list(map(int,input().split()))
for i in range(len(a)+1):
for j in range(i):
k.append(a[j:i])
y=0
for j in k:
y=y+(len(j)+j.count(0))
k1.append(y)
for t1 in k1:
print(t1)#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n; cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++) cin>>v[i];
int ans=0;
for(int i=0;i<n;i++) {
int prev=0;
for(int j=i;j<n;j++) {
prev++;
if(v[j]==0) prev++;
ans+=prev;
}
}
cout<<ans;
}
int32_t main() {
int t; cin>>t;
while(t--) {
solve();
cout<<endl;
}
return 0;
}MSNSADM1 Football | MATCHES Playing with Matches |
HRDSEQ Hard Sequence | DRCHEF Doctor Chef |
559. Maximum Depth of N-ary Tree | 821. Shortest Distance to a Character |
1441. Build an Array With Stack Operations | 1356. Sort Integers by The Number of 1 Bits |
922. Sort Array By Parity II | 344. Reverse String |
1047. Remove All Adjacent Duplicates In String | 977. Squares of a Sorted Array |
852. Peak Index in a Mountain Array | 461. Hamming Distance |
1748. Sum of Unique Elements | 897. Increasing Order Search Tree |
905. Sort Array By Parity | 1351. Count Negative Numbers in a Sorted Matrix |
617. Merge Two Binary Trees | 1450. Number of Students Doing Homework at a Given Time |
700. Search in a Binary Search Tree | 590. N-ary Tree Postorder Traversal |
589. N-ary Tree Preorder Traversal | 1299. Replace Elements with Greatest Element on Right Side |
1768. Merge Strings Alternately | 561. Array Partition I |
1374. Generate a String With Characters That Have Odd Counts | 1822. Sign of the Product of an Array |
1464. Maximum Product of Two Elements in an Array | 1323. Maximum 69 Number |