Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- vector <pair<int,int>>ans;
- void rezolva(int st,int dr,int a,int b)
- {
- if(a<=st&&dr<=b)
- {
- ans.push_back({st,dr});
- return;
- }
- int mij=(st+dr)>>1;
- if(a<=mij)
- rezolva(st,mij,a,b);
- if(mij<b)
- rezolva(mij+1,dr,a,b);
- }
- int main()
- {
- ifstream f("di.in");
- ofstream g("di.out");
- int n,m;
- f>>n>>m;
- while(m--)
- {
- ans.clear();
- int x,y;
- f>>x>>y;
- rezolva(1,n,x,y);
- g<<ans.size()<<' ';
- sort(ans.begin(),ans.end());
- g<<ans[0].first<<' ';
- for(auto x:ans)
- g<<x.second<<' ';
- g<<'\n';
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement