-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPOUR1.c
58 lines (58 loc) · 784 Bytes
/
POUR1.c
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
55
56
57
58
#include<bits/stdc++.h>
using namespace std;
int algo2(int a, int b, int c)
{
int aa = min(a,b);
int bb = max(a,b);
a=aa;
b=bb;
int k = 0;
int cnt = 0;
while(k != c)
{
k+=a;
cnt++;
while(k>b && k!=c)
{
k-=b;
cnt++;
}
}
return cnt;
}
int algo1(int a, int b, int c)
{
int aa = min(a,b);
int bb = max(a,b);
a=aa;
b=bb;
int k = 0;
int cnt = 0;
while(k != c)
{
k+=b;
cnt++;
while(k>c && k!=c)
{
k-=a;
cnt++;
}
}
return cnt;
}
int main()
{
int t;
cin>>t;
while(t--)
{
int a,b,c;
cin>>a>>b>>c;
if(c%__gcd(a,b) == 0 && (c <= a || c <= b))
{
printf("%d\n",min(algo1(a,b,c),algo2(a,b,c)));
//printf("%d\n",algo1(a,b,c));
}
else puts("-1");
}
}