21.12.23

目录

有趣的跳跃

石头剪刀布

做游戏

---

有趣的跳跃

OpenJudge - 17:有趣的跳跃http://sdau.openjudge.cn/2021array/17/

#include <iostream>
#include<cmath>
using namespace std;
int ans[3010];
int main() {
	int n, i, a, b,temp;
	cin >> n>>a;
	for (i = 1; i < n;i++) {
		cin >> b;
		if(i==1)
			ans[i] = fabs(a - b);
		else
			ans[i]= fabs(temp - b);
		temp = b;
	}
	int flags = 1;
	for (i = 1; i <= n - 1; i++) {
		for (a = 1; a <= n - i; a++)
			if (ans[a] > ans[a + 1]) {
				temp = ans[a]; ans[a] = ans[a + 1]; ans[a + 1] = temp;
				flags = 0;
			}
		if (flags)
			break;
	}
	for(i=1;i<n;i++)
		if (ans[i + 1] - ans[i] != 1){
			cout << "Not jolly" << endl;
			return 0;
		}
	cout << "Jolly" << endl;
	return 0;
}

石头剪刀布

OpenJudge - 19:石头剪刀布http://sdau.openjudge.cn/2021array/19/

#include <iostream>
using namespace std;
int a[110];
int b[110];
int main() {
	int t,n,m,i,as=0,bs=0;
	cin >>t>> n>>m;
	for (i = 1; i <= t; i++) {
		if (i <= n)
			cin >> a[i];
		else
			a[i] = a[i - n];
	}
	for (i = 1; i <= t; i++) {
		if (i <= m)
			cin >> b[i];
		else
			b[i] = b[i - m];
	}
	for (i = 1; i <= t; i++) {
		if (a[i] == b[i])
			continue;
		if (a[i] == 0 && b[i] == 5)
			bs++;
		else  if (b[i] == 0 && a[i] == 5)
			as++;
		else if (a[i] < b[i]) as++;
		else bs++;
	}
	if (as == bs) cout << "draw" << endl;
	else if (as > bs) cout << 'A' << endl;
	else cout << 'B' << endl;
	return 0;
}

做游戏

OpenJudge - 20:做游戏http://sdau.openjudge.cn/2021array/20/

#include <iostream>
using namespace std;
int ans[110];
double arr[10010];
int main() {
	int n, m, i, t,g,j=1;
	cin >> n ;
	while (n--) {
		cin >> m>>t;
		for (i = 1; i <= m; i++)
			cin >> ans[i];
		while (t--) {
			g = ans[1];
			for (i = 1; i <= m; i++) {
				if (i == m)
					ans[i] = (ans[i] + g) % 100;
				else
					ans[i] = (ans[i] + ans[i + 1]) % 100;
			}
		}
		for (i = 1; i <= m + 1; j++, i++)
			if (i == m + 1)
				arr[j] = 0.1;
			else
				arr[j]=ans[i];
	}
	for (i = 1; i < j; i++)
		if (arr[i] == 0.1)
			cout << endl;
		else
			cout << arr[i] << ' ';
	return 0;
}