11002
题目
实现分数结构体,并实现其加减乘除运算。要求输出的结果为最简分数。
解析
- 定义结构体
- 约分:
gcd
函数 - 运算:加减乘除
答案
c
typedef struct {
int numerator; // 分子
int denominator; // 分母
} fraction;
unsigned gcd(unsigned a, unsigned b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
void simplify(fraction *frac) {
int common = gcd(abs(frac->numerator), abs(frac->denominator));
frac->numerator /= common;
frac->denominator /= common;
// 确保分母为正数,负号放在分子上
if (frac->denominator < 0) {
frac->numerator = -frac->numerator;
frac->denominator = -frac->denominator;
}
}
fraction add(fraction a, fraction b) {
fraction result;
result.numerator = a.numerator * b.denominator + b.numerator * a.denominator;
result.denominator = a.denominator * b.denominator;
simplify(&result);
return result;
}
fraction subtract(fraction a, fraction b) {
fraction result;
result.numerator = a.numerator * b.denominator - b.numerator * a.denominator;
result.denominator = a.denominator * b.denominator;
simplify(&result);
return result;
}
fraction multiply(fraction a, fraction b) {
fraction result;
result.numerator = a.numerator * b.numerator;
result.denominator = a.denominator * b.denominator;
simplify(&result);
return result;
}
fraction divide(fraction a, fraction b) {
assert(b.denominator != 0);
fraction result;
result.numerator = a.numerator * b.denominator;
result.denominator = a.denominator * b.numerator;
simplify(&result);
return result;
}
fraction create_fraction(int numerator, int denominator = 1) {
assert(denominator != 0);
fraction result;
result.numerator = numerator;
result.denominator = denominator;
simplify(&result);
return result;
}
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
59
60
61
62
63
64
65
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
59
60
61
62
63
64
65