zoukankan      html  css  js  c++  java
  • 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);
        }
    }
    
  • 相关阅读:
    比特币全节点(bitcoind) eth 全节点
    Knowledge Tracing -- 基于贝叶斯的学生知识点追踪(BKT)
    trate
    spark
    linux 切换c++版本
    查找两个数组的相同字符(两个超大文件的相同字符)
    作业调度框架FluentScheduler
    .net与js数据交换中文乱码问题解决
    数据库死锁问题
    Service Fabric service 根据环境变量读取配置文件
  • 原文地址:https://www.cnblogs.com/a1439775520/p/13076685.html
Copyright © 2011-2022 走看看