aboutsummaryrefslogtreecommitdiff
path: root/1-17_over-80.c
blob: dcf7058bb5a8ab6dd7ddcc8d5b934204861aed0b (plain)
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
#include <stdio.h>

#define MINLENGTH 80

/* Read as much as possible of a string and return its length. */
int get_line(char s[]) {
	int c, i;

	for (i = 0; i < MINLENGTH - 1 && (c = getchar()) != EOF; ++i) {
		s[i] = c;
	}
	if (c == '\n') {
		s[i] = c;
		++i;
	}
	s[i] = '\0';
	return i;
}

int main() {
	// longline is used as a boolean that tells us if it's a line worth printing
	int longline = 0;

	// len is simply a character counter, while c is the character itself.
	int len, c;
	char buffer[MINLENGTH];

	while ((c = getchar()) != EOF) {
		buffer[len] = c;

		/* When we meet the end of the line, we need to print the rest of the line,
		   but only if we're already in a long line. Otherwise, reset our state.
		 */
		if (c == '\n') {

			if (longline == 1 && len < MINLENGTH - 1) {
				buffer[len + 1] = '\0';
				printf("%-s", buffer);
			}

			len = 0;
			longline = 0;
			continue;
		}

		/* When the buffer has filled up, output its contents! */
		if (len == MINLENGTH) {
			buffer[len + 1] = '\0';
			printf("%-s", buffer);
			len = 0;
			longline = 1;
			continue;
		}

		/* If neither of the above cases are caught, increment our counter and fetch
		   more data.
		 */
		++len;
	}

	return 0;
}