ACM模式常见输入输出专题(Java版)

目录

题号A: A+B(1)

题号B: A+B(2)

题号C: A+B(3)

题号D: A+B4)

题号E: A+B(5)

题号F: A+B(6)

题号G: A+B(7)

题号H: 字符串排序(1)

题号I 字符串排序(2)

题号G: 字符串排序(3)

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


题号A: A+B(1)

import java.util.Scanner;
 
public class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            System.out.println(a + b);
        }
    }
}

题号B: A+B(2)

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 b = sc.nextInt();
            System.out.println(a+b);
            num--;
        }
    }
}


题号C: A+B(3)

// 方法1
import java.util.Scanner;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        while(a!=0 && b!=0){
            System.out.println(a+b);
            a = sc.nextInt();
            b = sc.nextInt();
        }
    }
}

//方法2
import java.util.Scanner;
public class Main{
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        while(in.hasNextLine()){
            int a = in.nextInt();
            int b = in.nextInt();
            if(a==0&&b==0){
                break;
            }
            System.out.println(a+b);
        }
    }
}

题号D: A+B4)

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

题号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)

//方法1
import 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);
        }
    }
}

//方法2

import 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)

//方法1
import 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);
        }
    }
}


//方法2
import 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)

  • 4
    点赞
  • 23
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值