1037 在霍格沃茨找零钱

#include <stdio.h>
#include <string.h>
#include<math.h>
int main(void){
	int i, s, k, j, m ,n ,t;
	long g, suma = 0,sump = 0,r;
	char p[20], a[20];
	g = 0;
	s = k = 0;
	scanf("%s %s", p, a);
	m = 0;
	n = 2;
	for (i = 0; i < strlen(p); i++) {
		if (p[i] == '.'&&n==2) {
			t = i;
			for (j = i - 1; j >= 0; j--) {
				sump += (p[j] - '0') * (int)pow(10, m)*493;
				m++;
			}
			m = 0;
			n--;
			continue;
		}
		if (p[i] == '.'&&n==1) {
			for (j = i - 1; j >= t+1; j--) {
				sump += (p[j] - '0') * (int)pow(10, m) * 29;
				m++;
			}
			m = 0;
			for (j = strlen(p) - 1; j >= i + 1; j--) {
				sump += (p[j] - '0') * (int)pow(10, m);
				m++;
			}
			break;
		}
	}
	m = 0;
	n = 2;
	for (i = 0; i < strlen(a); i++) {
		if (a[i] == '.' && n == 2) {
			t = i;
			for (j = i - 1; j >= 0; j--) {
				suma += (a[j] - '0') * (int)pow(10, m)*493;
				m++;
			}
			m = 0;
			n--;
			continue;
		}
		if (a[i] == '.' && n == 1) {
			for (j = i - 1; j >= t + 1; j--) {
				suma += (a[j] - '0') * (int)pow(10, m) * 29;
				m++;
			}
			m = 0;
			for (j = strlen(a) - 1; j >= i + 1; j--) {
				suma += (a[j] - '0') * (int)pow(10, m);
				m++;
			}
			break;
		}
	} 
	if (suma > sump) {
		r = suma - sump;
		while (r >= 493) {
			g = r / 493;
			r = r % 493;
		}
		while (r >= 29) {
			s = r / 29;
			r = r % 29;
		}
		k = r;
		printf("%ld.%d.%d", g, s, k);
	}
	if (suma == sump) {
		printf("0.0.0");
	}
	if (suma < sump) {
		r = sump - suma;
		while (r >= 493) {
			g = r / 493;
			r = r % 493;
		}
		while (r >= 29) {
			s = r / 29;
			r = r % 29;
		}
		k = r;
		printf("-%ld.%d.%d", g, s, k);
	}
    return 0;
 }