woj
code_bao
热衷写代码的cbb
展开
-
JAVA使用数组实现约瑟夫环的问题
使用数组实现约瑟夫环的问题package woj;import java.util.Scanner;public class woj_71 { public static void main(String[] args) { Scanner cin = new Scanner(System.in); while(cin.hasNext()) { int N = cin.nextInt(); int m = cin.nextInt(); int[] nums = ne.原创 2020-12-22 14:10:31 · 227 阅读 · 0 评论 -
WOJ-74 ABC
Given an array consists of n positive integers,your task is to find the largest C which makes C=A+B. A,B,C are all in the given array.输入格式Standard input will contain multiple test cases. The first line of the input is an integer T (1 <= T <= 20) wh原创 2020-12-15 21:53:13 · 132 阅读 · 0 评论