零蛋求条

#include<bits/stdc++.h>
using namespace std;
int T;
void spin(string &s,int n){
	string s1=s;
//	n++;
    for(int i=0;i<n;i++){
        s[i]=s1[(i+n+1)%n];
//        cout<<s<<endl;
    }
}
int main(){
    cin>>T;
    while(T--){
        int n,ans=0,ans1=0;
        string s,s1;
        cin>>n>>s;
        s1=s;
        for(int i=0;i<n;){
			if(s[i]=='0'){
				s[i]='1';
				spin(s,i);
				ans+=i+1;
			}
			else{
				int j=n-1;
				while(j>=0&&s[j]!='0'){
					j--;
				}
				if(j<0){
					j=n-1;
					i++;
					continue;
				}
				s[j]='1';
//				cout<<j<<endl;
				spin(s,j);
				ans+=j+1;
				j=n-1;
			}
			i++;
//			cout<<s<<endl;
		}
//		cout<<endl;
		s=s1;
		for(int i=0;i<n;){
					if(s[i]=='1'){
						s[i]='0';
						spin(s,i);
						ans1+=i+1;
					}
					else{
						int j=n-1;
						while(j>=0&&s[j]!='1'){
							j--;
						}
						s[j]='0';
						if(j<0){
											j=n-1;
											i++;
											continue;
										}
//						cout<<j<<endl;
						spin(s,j);
						ans1+=j+1;
						j=n-1;
					}
					i++;
//					cout<<s<<endl;
				}
		cout<<min(ans,ans1)<<endl;
		
    }
}