@[lixiangtianyi](/user/1051436) 不是要约分吗（
by Ether_W @ 2023-08-17 18:05:33
@[lixiangtianyi](/user/1051436) 加一个约分
```cpp
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int getMax(ll a,ll b,ll c)
{
return (a>b?(a>c?a:c):(b>c?b:c));
}
int getMin(ll a,ll b,ll c)
{
return (a>b?(b>c?c:b):(a>c?c:a));
}
int gcd(ll n,ll m)
{
if(n%m==0)return m;
return gcd(m,n%m);
}
int main()
{
ll m,n,o;
ll max,min;
cin>>m>>n>>o;
max=getMax(m,n,o);
min=getMin(m,n,o);
ll y=gcd(min,max);
min/=y;max/=y;
cout<<min<<"/"<<max;
}
```
by sketchi @ 2023-08-17 18:09:00
@[lixiangtianyi](/user/1051436) 实测AC
[提交记录](https://www.luogu.com.cn/record/121443658)
by sketchi @ 2023-08-17 18:10:16
前排
by Hanzelic @ 2023-08-17 18:19:10
@[lixiangtianyi](/user/1051436) cancanword
```cpp
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll max(ll x,ll y,ll z){
if(x>y && x>z) return x;
else if(y>x && y>z) return y;
else if(z>x && z>y) return z;
}
ll min(ll x,ll y,ll z){
if(x<y && x<z) return x;
else if(y<x && y<z) return y;
else if(z<x && z<y) return z;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
ll a,b,c;
cin>>a>>b>>c;
ll ma=max(a,b,c);
ll mi=min(a,b,c);
cout<<mi/__gcd(a,b)<<"/"<<ma/__gcd(a,b);
return 0;
}
```
by FurippuWRY @ 2023-08-17 18:20:30
~~写的很烂 但能ac~~
by FurippuWRY @ 2023-08-17 18:21:15
@[lixiangtianyi](/user/1051436) 也可以用自带gcd
```cpp
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int getMax(ll a,ll b,ll c)
{
return (a>b?(a>c?a:c):(b>c?b:c));
}
int getMin(ll a,ll b,ll c)
{
return (a>b?(b>c?c:b):(a>c?c:a));
}
int main()
{
ll m,n,o;
ll max,min;
cin>>m>>n>>o;
max=getMax(m,n,o);
min=getMin(m,n,o);
ll y=__gcd(min,max);
min/=y;max/=y;
cout<<min<<"/"<<max;
}
```
by sketchi @ 2023-08-18 14:51:14
全绿，无红
```cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,e,f;
cin>>a>>b>>c;
for(int i=100;i>=1;i--){
if(a%i==0&&b%i==0&&c%i==0){
d=a/i;
e=b/i;
f=c/i;
cout<<min(d,min(e,f))<<"/"<<max(d,max(e,f));
return 0;
}
}
cout<<min(a,min(b,c))<<"/"<<max(a,max(b,c));
return 0;
}
```
by heheya @ 2023-10-17 12:34:53