1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include<bits/stdc++.h>
using namespace std;
int count_distinct_strings(string s){
    int n=s.size();
    vector<bitset<60>> flips;
    int balance=0;
    for(int i=0;i<n;++i){
        if(s[i]=='1') balance++;
        else balance--;
        if(balance==0){
            bitset<60> flip;
            for(int j=0;j<=i;++j) flip[j]=1;
            flips.push_back(flip);
        }
    }
    int rank=0;
    bitset<60> basis[60];
    for(auto&v:flips){
        bitset<60> x=v;
        for(int i=0;i<60;++i){
            if(!x[i]) continue;
            if(basis[i].none()){
                basis[i]=x;
                rank++;
                break;
            }
            x^=basis[i];
        }
    }
    return 1<<rank;
}
int main(){
    int t;
    cin>>t;
    while(t--){
        int n;
        string s;
        cin>>n>>s;
        cout<<count_distinct_strings(s)<<'\n';
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Subtask Info

Correct Answer

Submission ID: 1150951411

Score:100

Memory:3.6M

Sub-Task	Task #	Result (time)
1	0	Correct (0.00)
1	1	Correct (0.00)
1	2	Correct (0.00)
1	3	Correct (0.00)
1	4	Correct (0.00)
1	5	Correct (0.00)
Subtask Score: 100%		Result - Correct
		Total Score = 100%