-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB.cpp
More file actions
54 lines (54 loc) · 1.12 KB
/
B.cpp
File metadata and controls
54 lines (54 loc) · 1.12 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include<bits/stdc++.h>
#define vi vector<int>
#define mp map<int,int>
#define ump unordered_map <int,int>
#define ll long long int
#define pb push_back
#define mod 1000000007
#define int long long
#define loop(i,x,n) for(int i=x;i<n;i++)
#define rloop(i,n) for(int i=n-1;i>=0;i--)
#define test int t; cin>>t; while(t--)
using namespace std;
/*************************************************************************************************/
void solve()
{
int l,r,m,a,b,c,x,y,r1,r2;
cin>>l>>r>>m;
for(int i=l;i<=r;i++)
{
a=i;
if(m%a==0)
{
cout<<a<<' '<<r<<' '<<r<<'\n';
return ;
}
x=(m/a)*a;
r1=m-x;
b=r;
c=r-r1;
if(c>=l && c<=r && r1!=m)
{
cout<<a<<' '<<b<<' '<<c<<'\n';
return ;
}
y=(m/a+1)*a;
r2=y-m;
c=r;
b=r-r2;
if(b>=l && b<=r)
{
cout<<a<<' '<<b<<' '<<c<<'\n';
return ;
}
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
test
solve();
return 0;
}