Brush questions - Luogu -p1085 unhappy Jinjin

P1085 Unhappy Jinjin -C Language

1、 subject

2、 The problem solving process

(1) for the first time week[i] > week[i-1] Logic error
result ：20
Code ：

// Luogu  P1085  Unhappy Jinjin 
#include <stdio.h>
#define DAYS 7
int main() {
    
	int week[DAYS];// Weekly duration 
	int u, v;// In class and out of class hours 
	int i;
	int max;// The longest class time 
	int max_day;// The date of the longest class 
	for (i = 0; i < DAYS; i++) {
    
		scanf_s("%d %d", &u, &v);
		week[i] = u + v;// Total time per day 
		if (i == 0) {
    
			max = week[i];
			max_day = i;
		}
		else if (week[i] > week[i-1]) {
    
			max = week[i];
			max_day = i;
		}
	}
	if (max > 8) {
    
		printf("%d", max_day +1 );// The degree of unhappiness is the highest 
	}
	else {
    
		printf("0");
	}
	return 0;
}

(2) The second time week[i] > max
result ：

Code ：

// Luogu  P1085  Unhappy Jinjin 
#include <stdio.h>
#define DAYS 7
int main() {
    
	int week[DAYS];// Weekly duration 
	int u, v;// In class and out of class hours 
	int i;
	int max;// The longest class time 
	int max_day;// The date of the longest class 
	for (i = 0; i < DAYS; i++) {
    
		scanf("%d %d", &u, &v);
		week[i] = u + v;// Total time per day 
		if (i == 0) {
    
			max = week[i];
			max_day = i;
		}
		else if (week[i] > max) {
    
			max = week[i];
			max_day = i;
		}
		//printf(" The first %d Days of study ：%d. The maximum duration is %d, The highest degree of unhappiness is %d", i + 1, week[i],max,max_day+1);
	}
	if (max > 8) {
    
		printf("%d", max_day +1 );// The degree of unhappiness is the highest 
	}
	else {
    
		//printf("\n 0");
		printf("0");
	}
	return 0;
}