-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2_Lab08_2.c
60 lines (43 loc) · 1.13 KB
/
2_Lab08_2.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
59
#include <stdio.h>
#include <stdlib.h>
#define MAX_LENGTH 255
int gcd(int a, int b) {
while (b) {
int temp = b;
b = a % b;
a = temp;
}
return a;
}
// 10진수를 7진법으로 변환하는 함수
void toBase7(int N, int D, int B, int E, char* result) {
int commonFactor = gcd(N, D);
N /= commonFactor;
D /= commonFactor;
int integerPart = N / D;
int fractionalPart = N % D;
// 소수점 이하 값 계산
for (int i = 0; i <= E; ++i) {
fractionalPart *= 7;
if (i >= B) {
result[i - B] = (fractionalPart / D) + '0';
}
fractionalPart %= D;
}
result[E - B + 1] = '\0';
}
void solveTestCase(int caseNumber, int N, int D, int B, int E) {
char result[MAX_LENGTH];
toBase7(N, D, B, E, result);
printf("Problem set %d: %d / %d, base 7 digits %d through %d: %s\n", caseNumber, N, D, B, E, result);
}
int main() {
int T;
scanf("%d", &T);
for (int caseNumber = 1; caseNumber <= T; ++caseNumber) {
int N, D, B, E;
scanf("%d %d %d %d", &N, &D, &B, &E);
solveTestCase(caseNumber, N, D, B, E);
}
return 0;
}