PAT-BASIC1071——小赌怡情

我的PAT-BASIC代码仓：https://github.com/617076674/PAT-BASIC

原题链接：https://pintia.cn/problem-sets/994805260223102976/problems/994805264312549376

题目描述：

知识点：循环

思路：按题述编程即可

时间复杂度是O(K)。空间复杂度是O(1)。

C++代码：

#include<iostream>

using namespace std;

int main() {
	int K, n1, b, n2;
	long T, t;
	cin >> T >> K;

	long total = T;
	for(int i = 0; i < K; i++) {
		if(total == 0) {
			printf("Game Over.\n");
			break;
		}

		cin >> n1 >> b >> t >> n2;
		if(t > total) {
			printf("Not enough tokens.  Total = %ld.\n", total);
		} else if((b == 0 && n2 < n1) || (b == 1 && n2 > n1)) {
			total += t;
			printf("Win %ld!  Total = %ld.\n", t, total);
		} else if((b == 0 && n2 > n1) || (b == 1 && n2 < n1)) {
			total -= t;
			printf("Lose %ld.  Total = %ld.\n", t, total);
		}
	}

	return 0;
}

C++解题报告：