思路

  • 如果是括号序列必然满足是开头为'('结尾是')'
  • 把括号序列回文后开头为')'结尾是'('，显然必不满足括号序列
  • 所以当n>0不存在回文括号序列

代码

// Problem: 回文括号序列计数
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/9986/A
// Memory Limit: 1048576 MB
// Time Limit: 4000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp(aa,bb) make_pair(aa,bb)
#define _for(i,b) for(int i=(0);i<(b);i++)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,b,a) for(int i=(b);i>=(a);i--)
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define X first
#define Y second
#define lowbit(a) (a&(-a))
#define debug(a) cout<<#a<<":"<<a<<"\n"
typedef long long ll;
typedef pair<int,int> pii;
typedef unsigned long long ull;
typedef long double ld;
const int N=100010;
const int INF=0x3f3f3f3f;
const int mod=998244353;
const double eps=1e-6;
const double PI=acos(-1.0);


void solve(){
    ll n;cin>>n;
    if(!n) {
        cout<<"1\n";
        return;
    }
    cout<<"0\n";
}


int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int t;cin>>t;while(t--)
    solve();
    return 0;
}