Java实现 洛谷 P1328 生活大爆炸版石头剪刀布

Java实现 洛谷 P1328 生活大爆炸版石头剪刀布

Java实现 洛谷 P1328 生活大爆炸版石头剪刀布

import java.util.Scanner;

public class Main{
private static int[] duel(int playerA, int playerB){
int[] result = new int[2];
if (playerA == 0){
if (playerB == 1) result[1] = 1;
if (playerB == 2) result[0] = 1;
if (playerB == 3) result[0] = 1;
if (playerB == 4) result[1] = 1;
} else if (playerA == 1){
if (playerB == 0) result[0] = 1;
if (playerB == 2) result[1] = 1;
if (playerB == 3) result[0] = 1;
if (playerB == 4) result[1] = 1;
} else if (playerA == 2){
if (playerB == 0) result[1] = 1;
if (playerB == 1) result[0] = 1;
if (playerB == 3) result[1] = 1;
if (playerB == 4) result[0] = 1;
} else if (playerA == 3){
if (playerB == 0) result[1] = 1;
if (playerB == 1) result[1] = 1;
if (playerB == 2) result[0] = 1;
if (playerB == 4) result[0] = 1;
} else if (playerA == 4){
if (playerB == 0) result[0] = 1;
if (playerB == 1) result[0] = 1;
if (playerB == 2) result[1] = 1;
if (playerB == 3) result[1] = 1;
}
return result;
} public static void main(String[] args){
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int nA = input.nextInt();
int nB = input.nextInt();
int[] a = new int[nA];
int[] b = new int[nB];
for (int i = 0; i < nA; i++){
a[i] = input.nextInt();
}
for (int i = 0; i < nB; i++){
b[i] = input.nextInt();
}
int countA = 0;
int countB = 0;
for (int i = 0; i < n; i++){
countA = countA + duel(a[i % nA], b[i % nB])[0];
countB = countB + duel(a[i % nA], b[i % nB])[1];
}
System.out.println(countA + " " + countB);
}
}
上一篇:Web前端新人笔记之CSS结构和层叠


下一篇:设计模式:适配器模式(Adapter)