提交时间:2025-11-10 19:35:40

运行 ID: 38871

#include <bits/stdc++.h> // #define int long long using namespace std; int n; // int a[10000005]; vector<int> a; signed main(){ cin>>n; for (int i=0;i<n;i++){ // cin>>a[i]; int x; cin>>x; a.push_back(x); } vector<int> b; for (int start=0;start<n;start++){ bool bk=0; b=a; for (int i=0;i<n;i++){ int pos=(start+i)%n; int npos=(pos+1)%n; if (b[pos]==0 and b[npos]==0){ continue; } int minn=min(b[pos],b[npos]); b[pos]-=minn; b[npos]-=minn; } for (int i=0;i<n;i++){ if (b[i]!=0){ bk=1; break; } } if (bk==0){ cout<<"1"; } else{ cout<<"0"; } } return 0; }