Tag: problem: (E) Prairie Partition Solve In C/C++

#include<bits/stdc++.h> using namespace std; int n; long long a; int check(int x){ int i,j,res,ress,t,sum; long long A,AA; i=0;ress=0; for(j=0;j<60;j++){ A=(1LL<<j); res=0; for(;i<n;i++){ if(a==A){ res++; } else if(a<A){ ress++; } else break; } if(ress>x) return 0; if(x>res){ ress-=(x-res); if(ress<0) ress=0; x=res; } if(res>x) ress+=(res-x); } return...