Accepted
Code
#include<iostream>
#include<set>
#include<climits>
#include<algorithm>
#include<vector>
#include <map>
using namespace std;
#define speedBoost ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long int
void solve(){
int l,r,x;
cin>>l>>r>>x;
int front=max(l,l-x);
int end=min(r,r-x);
for(int i=front;i<=end;i++){
int p=i+x;
if(p>=l && r>=p){
cout<<p<<" "<<i<<endl;
return;
}
}cout<<"-1 -1"<<endl;
}
int main() {
speedBoost;
int tc;
cin>>tc;
while(tc--){
solve();
}
}
Information
- Submit By
- Type
- Submission
- Problem
- P1186 Equal to X
- Contest
- Brain Booster #9
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2025-04-06 16:25:41
- Judged At
- 2025-04-06 16:25:41
- Judged By
- Score
- 100
- Total Time
- 199ms
- Peak Memory
- 2.27 MiB