#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n,k=0,count=0,l=0;
cin>>n;
int a[n];
for(int x=0;x<n;x++){
cin>>a[x];
}
for (int m = 0; m <n; m++){
if(a[m]==1){
k++;
}
}
for (int p = (n-1); p>=0; p--){
if(a[p]==1){
l=p;
break;
}
continue;
}
if(k>1){
for (int i = 0; i < n; i++){
if(a[i]==1){
for (int j = (i+1); j < l; j++){
if(a[j]!=a[i]){
swap(a[j],a[i]);
count++;
break;
}
continue;
}
}
continue;
}
}
else{
count=0;
}
cout<<count<<endl;
}
return 0;
}
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |
1328A - Divisibility Problem | 339A - Helpful Maths |
4A - Watermelon | 476A - Dreamoon and Stairs |
1409A - Yet Another Two Integers Problem | 977A - Wrong Subtraction |
263A - Beautiful Matrix | 180C - Letter |
151A - Soft Drinking | 1352A - Sum of Round Numbers |
281A - Word Capitalization | 1646A - Square Counting |
266A - Stones on the Table | 61A - Ultra-Fast Mathematician |
148A - Insomnia cure | 1650A - Deletions of Two Adjacent Letters |
1512A - Spy Detected | 282A - Bit++ |
69A - Young Physicist | 1651A - Playoff |