ACM模式常见输入输出专题（Java版）

题号E: A+B(5)

import java.util.Scanner;public class Main{    public static void main(String[] args){        Scanner sc = new Scanner(System.in);        int num = sc.nextInt();        while(num-->0){            int a = sc.nextInt();            int sum = 0;            for(int i = 0; i < a; i++){                sum += sc.nextInt();            }            System.out.println(sum);        }    }}

题号F: A+B(6)

import java.util.Scanner;public class Main{    public static void main(String[] args){        Scanner sc = new Scanner(System.in);        while(sc.hasNextInt()){ //或者使用hasNext()            int num = sc.nextInt();            int sum = 0;            while(num-->0){                sum += sc.nextInt();            }            System.out.println(sum);        }    }}

题号G: A+B(7)

import java.util.Scanner;public class Main{    public static void main(String[] args){        Scanner sc = new Scanner(System.in);        while(sc.hasNextLine()){            int sum = 0;            String[] arr = sc.nextLine().split(" ");            for(String str:arr){                sum += Integer.parseInt(str);            }            System.out.println(sum);        }    }}

题号H: 字符串排序（1）

import java.util.*;public class Main{    public static void main(String[] args){        Scanner sc = new Scanner(System.in);        int num = sc.nextInt();        while(sc.hasNextLine()){           String[] str = sc.nextLine().split(" ");            Arrays.sort(str);            for(int i = 0;i < str.length-1; i++){                System.out.print(str[i] + ' ');            }             System.out.print(str[str.length-1]);        }    }}

题号I 字符串排序（2）

//方法1import java.util.*;public class Main{    public static void main(String[] args){        Scanner sc = new Scanner(System.in);        while(sc.hasNextLine()){            String[] str = sc.nextLine().split(" ");            Arrays.sort(str);            print(str);            System.out.println();        }    }    public static void print(String[] str){        for(int i = 0;i < str.length;i++){            String output = (i == (str.length-1)) ? str[i] : str[i]+' ';            System.out.print(output);        }    }}//方法2import java.util.*;public class Main{    public static void main(String[] args){        Scanner sc = new Scanner(System.in);        while(sc.hasNextLine()){            String[] str = sc.nextLine().split(" ");            Arrays.sort(str);            StringBuffer sb = new StringBuffer();            for(String s:str){                sb.append(s).append(" ");            }            System.out.println(sb.substring(0,sb.length()-1)); //去掉最后一个空格}    }}

题号G: 字符串排序（3）

//方法1import java.util.*;public class Main{    public static void main(String[] args){        Scanner sc = new Scanner(System.in);        while(sc.hasNextLine()){            String[] str = sc.nextLine().split(",");            Arrays.sort(str);            print(str);            System.out.println();        }    }    public static void print(String[] str){        for(int i = 0;i < str.length;i++){            String output = (i == (str.length-1)) ? str[i] : str[i]+',';            System.out.print(output);        }    }}//方法2import java.util.*;public class Main{    public static void main(String[] args){        Scanner sc = new Scanner(System.in);        while(sc.hasNext()){            String[] str = sc.nextLine().split(",");            Arrays.sort(str);            StringBuilder sb = new StringBuilder();                        for(String s:str){                sb.append(s).append(",");            }            System.out.println(sb.deleteCharAt(sb.length()-1).toString());//去掉最后一个分号        }    }}

题目K: 自测本地通过提交为0

 注意：取值范围是（0,2X10^10），最大值会超过Integer的范围。

import java.util.*;public class Main{    public static void main(String[] args){        Scanner sc = new Scanner(System.in);        //注意取值范围，用什么样的容器接数据        while(sc.hasNextLong()){            Long a = sc.nextLong();            Long b = sc.nextLong();            System.out.println(a+b);        }    }}

练习链接：牛客竞赛_ACM/NOI/CSP/CCPC/ICPC算法编程高难度练习赛_牛客竞赛OJ (nowcoder.com)

来源地址：https://blog.csdn.net/qq_41855453/article/details/131542412