| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 116980 | 陈家宝 | FBI树 | C++ | Accepted | 100 | 0 MS | 260 KB | 406 | 2023-12-21 13:33:22 |
#include<bits/stdc++.h> using namespace std; int n; string s; void dfs(int l,int r){ int mid=(l+r)/2; if(l!=r){ dfs(l,mid); dfs(mid+1,r); } int sum=0; for(int i=l;i<=r;i++) if(s[i]=='1')sum++; if(sum==r-l+1)cout<<"I"; else if(sum==0)cout<<"B"; else cout<<"F"; } int main() { cin>>n>>s; dfs(0,s.size()-1); return 0; }