/
흐엥.c
96 lines (84 loc) · 1.77 KB
/
흐엥.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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include <stdio.h>
#include <string.h>
#define stod(X) (X==0? 0: X-'0')
char input[10000] = {0,};
char fir[100][100] = {0,}, sec[100] = {0,};
char minus(char fir[100][100]){
int i = 0, count;
char y = 'o', n = 'p';
while(fir[0][i] != '.'){
i++;
}
count = i;
if(i > 50){
return n;
}
while(fir[0][i] != '\0'){
i++;
}
if((i-count)>10){
return n;
}
return y;
}
void reverse(char *arr, int len); // 계산하기 전 배열에 있는 수 뒤집는 함수
void reverse(char *arr, int len){
char temp;
int i;
for(i=0; i<len/2; i++){
temp=arr[i];
arr[i]=arr[len-1-i];
arr[len-1-i]=temp;
}
}
void plus(int n);
void plus(int n)
{
int len;
char a[100][100] = {0,};
a[n][100] = fir[n][100];
a[n+1][100] = fir[n+1][100];
if( strlen(a[n]) > strlen(a[n+1]) )
len = strlen(a[n]);
else len = strlen(a[n+1]);
reverse(a[n], strlen(a[n]));
reverse(a[n+1], strlen(a[n+1]));
char an[100][100];
int i, up = 0;
for(i=0; i<len; i++){
an[n][i] = (stod(a[n][i]) + stod(a[n+1][i])+up)%10+'0';
if((stod(a[n][i]) + stod(a[n+1][i]) + up) > 9)
up=1;
else up=0;
}
}
int main()
{
char input[10000] = {0,};
char fir[100][100] = {0,}, sec[100] = {0,};
int i, j, k, m;
printf("수를 입력하세요 : ");
gets(input);
printf("input:%s\n", input);
for(i=0, j=0, k=0, m=0; input[i] != '\0'; i++){
if((input[i] >= '0')&&(input[i] <= '9')||(input[i] == '.')){
fir[j][k] = input[i];
k++;
if((input[i+1] < '0')||(input[i+1] > '9')){
fir[j][k] = '\0';
j++;
k = 0;
}
}
else if(input[i] != ' '){
sec[m] = input[i];
m++;
}
}
sec[m] = '\0';
int s = 0;
if (sec[s] == '+')
plus(s);
printf("%d", minus(fir));
return 0;
}