Problem:
Score : 100 points

Problem Statement

Dolphin loves programming contests. Today, he will take part in a contest in AtCoder.

In this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as "21 o'clock".

The current time is A o'clock, and a contest will begin in exactly B hours.
When will the contest begin? Answer in 24-hour time.

Constraints

0 \leq A,B \leq 23

A and B are integers.

Input

The input is given from Standard Input in the following format:

A B

Output

Print the hour of the starting time of the contest in 24-hour time.

Sample Input 1

9 12

Sample Output 1

21

In this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.

Sample Input 2

19 0

Sample Output 2

19

The contest has just started.

Sample Input 3

23 2

Sample Output 3

1

The contest will begin at 1 o'clock the next day.

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <stdlib.h>

int dist(int x1, int y1, int x2, int y2){
return abs(x1-y1)+abs(x2-y2);
}

int main(){
int n, m;
if(scanf("%d %d", &n, &m)==2){
	int ab[n][2], cd[m][2], abA[n];
	memset(ab, 0, n*2*sizeof(int));
	memset(cd, 0, m*2*sizeof(int));
	memset(abA, INT_MAX, n*sizeof(int));
	for(int i = 0; i < n; i++)scanf("%d %d", &ab[i][0], &ab[i][1]);
	for(int i = 0; i < m; i++)scanf("%d %d", &cd[i][0], &cd[i][1]);
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++)abA[i] = dist(ab[i][0], cd[j][0], ab[i][1], cd[j][1])<dist(ab[i][0], cd[abA[i]][0], ab[i][1], cd[abA[i]][1])?j:abA[i];
	}
for(int i = 0; i < n; i++)printf("%d\n", abA[i]+1);
}
return 0;
}