一:石头剪刀布
#include <stdio.h>
int panduan(int a, int b) {
if (a == b) return 0;
if ((a == 2 && b == 5) || (a == 0 && b == 2) || (a == 5 && b == 0)) return 1;
return -1;
}int main() {
int n, na, nb;
scanf("%d %d %d", &n, &na, &nb);
int A[na], B[nb];
for (int i = 0; i < na; i++) scanf("%d", &A[i]);
for (int i = 0; i < nb; i++) scanf("%d", &B[i]);
int countA = 0, countB = 0;
for (int i = 0; i < n; i++) {
int a = A[i % na]; // 根据周期取A的出拳
int b = B[i % nb]; // 根据周期取B的出拳
int result = panduan(a, b);
if (result == 1) countA++;
else if (result == -1) countB++;
}
if (countA > countB) printf("A");
else if (countA < countB) printf("B");
else printf("draw");
return 0;
}
二:救援
#include<stdio.h>
#include<math.h>int main() {
int n = 0;
scanf("%d", &n);
double a[n][3];
for (int i = 0; i < n; i++) {
scanf("%lf %lf %lf", &a[i][0], &a[i][1], &a[i][2]);
}
double b[n] = { 0 };
for (int i = 0; i < n; i++) {
double t = ( sqrt(pow(a[i][0], 2.0) + pow(a[i][1],2.0))/50 )* 2 + a[i][2] * 1.5;
b[i] = t;
}
double f = 0.0;
for( int i=0;i<n;i++){
f+=b[i];
}
if (f / 1.0 == 0)
printf("%d", (int)f);
else printf("%d", (int)(f + 1));
}