Submission #1415319

---

Source Code Expand

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

typedef struct {
	int s;
	int e;
} rain_t;

/* 昇順 */
int cmp(const void *a, const void *b) {
	rain_t tmp1 = *(rain_t *)a;
	rain_t tmp2 = *(rain_t *)b;

	if (tmp1.s < tmp2.s) {
		return -1;
	} else if (tmp1.s == tmp2.s) {
		if (tmp1.e > tmp2.e) {
			return 1;
		} else {
			return 0;
		}
	} else {
		return 1;
	}
}

int main() {
	int n, i, j;
	rain_t *rain, tmp;

	scanf("%d", &n);
	rain = (rain_t *)malloc(sizeof(rain_t) * n);
	for (i = 0; i < n; i++) {
		scanf("%d-%d", &rain[i].s, &rain[i].e);
	}
	
	/* 丸める*/
	for (i = 0; i < n; i++) {
		rain[i].s = rain[i].s - (rain[i].s % 5);
		if (rain[i].s % 100 == 60) {
			rain[i].s = rain[i].s + 40;
		}
		if (rain[i].e % 5 != 0) {
			rain[i].e = rain[i].e - (rain[i].e % 5) + 5;
		}
		if (rain[i].e % 100 == 60) {
			rain[i].e = rain[i].e + 40;
		}
	}
	/* ソート*/
	qsort(rain, n, sizeof(rain_t), cmp);

	/* つなげる */
	tmp.s = rain[0].s;
	tmp.e = rain[0].e;
	for (i = 1; i < n; i++) {
		if (rain[i].s <= tmp.e) {
			if (tmp.e < rain[i].e) {
				tmp.e = rain[i].e;
			}
		} else { 
			printf("%04d-%04d\n", tmp.s, tmp.e);
			tmp.s = rain[i].s;
			tmp.e = rain[i].e;
		}
	}
	printf("%04d-%04d\n", tmp.s, tmp.e);

	free(rain);
	return 0;
}

Submission Info

Compile Error

./Main.c: In function ‘main’:
./Main.c:32:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ^
./Main.c:35:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d-%d", &rain[i].s, &rain[i].e);
   ^

Judge Result