Submission #1415468

---

Source Code Expand

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

struct time {
	int start;
	int end;
};

int cmp(const void *p, const void *q);

int main() {
	int n, i;
	int j = 0;
	struct time *buf;
	struct time *rain;

	/* 入力＋領域確保 */
	scanf ("%d", &n);
	buf = (struct time *)calloc(n, sizeof(struct time));
	rain = (struct time *)calloc(n, sizeof(struct time));
	for (i = 0; i < n; i++) {
		scanf("%d-%d", &buf[i].start, &buf[i].end);
	}

	for (i = 0; i < n; i++) {
		buf[i].start = buf[i].start - (buf[i].start % 5);
		if ((buf[i].end % 5) != 0) {
			buf[i].end = buf[i].end + (5 - (buf[i].end % 5));
		}
		if ((buf[i].end % 100) == 60) {
			buf[i].end = buf[i].end + 40;
		}
	}

	/* sort */
	qsort(buf, n, sizeof(struct time), cmp);

	/* 連結 */
	rain[0].start = buf[0].start;
	rain[0].end = buf[0].end;
	for (i = 1; i < n; i++) {
		if (rain[j].end >= buf[i].start) {
			if (buf[i].end > rain[j].end) {
				rain[j].end = buf[i].end;
			}
		} else {
			j++;
			rain[j].start = buf[i].start;
			rain[j].end = buf[i].end;
		}
	}

	for (i = 0; i < j + 1; i++) {
		printf("%04d-%04d\n", rain[i].start, rain[i].end);
	}

	free(buf);
	free(rain);
	return 0;
}

int cmp(const void *p, const void *q)
{
	int ret = ((struct time *)p)->start - ((struct time *)q)->start;

	if (ret == 0) {
		ret = ((struct time *)p)->end - ((struct time *)q)->end;
	}

	return ret;
}

Submission Info

Compile Error

./Main.c: In function ‘main’:
./Main.c:18:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d", &n);
  ^
./Main.c:22:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d-%d", &buf[i].start, &buf[i].end);
   ^

Judge Result