xmd,倒数第二个点过不去!!!!
查看原帖
xmd,倒数第二个点过不去!!!!
768633
W_X_D楼主2022/8/18 09:22
#include<iostream>
using namespace std;

const int N = 17;
int d[N], h[N], sum[N];
int p;
int main()
{
	for(int i = 1; i <= 7; i++)
	scanf("%d %d", &d[i], &h[i]);
	for(int i = 1; i <= 7; i++)
	{
		sum[i] = d[i] + h[i];
		if(sum[i] > 8)
		{
			printf("%d\n", i);
			break;
		}
		else
		p++;
	}
	if(p == 7)
	printf("0\n");
	return 0;
}
2022/8/18 09:22
加载中...