devbox
酷酷是懒虫
这个屌丝很懒，什么也没留下！
关注作者
热门标签
热门文章
当前位置:   article > 正文

洛谷题单全套题解（java版）_洛谷java入门题

作者：酷酷是懒虫 | 2024-07-25 01:54:57

赞

踩

洛谷java入门题

目录

【入门1】顺序结构

B2002 Hello,World!

B2025 输出字符菱形

P1000 超级玛丽游戏

P1001 A+B Problem

B2005 字符三角形

P5703 【深基2.例5】苹果采购

P5704 【深基2.例6】字母转换

P5705 【深基2.例7】数字反转

P5706 【深基2.例8】再分肥宅水

P5708 【深基2.习2】三角形面积

P5707 【深基2.例12】上学迟到

B2029 大象喝水

P1425 小鱼的游泳时间

P1421 小玉买文具

P3954 [NOIP2017 普及组] 成绩

【入门2】分支结构

P2433 【深基1-2】小学数学 N 合一

P5709 【深基2.习6】Apples Prologue / 苹果和虫子

P5710 【深基3.例2】数的性质

P5711 【深基3.例3】闰年判断

P5712 【深基3.例4】Apples

P5713 【深基3.例5】洛谷团队系统

P5714 【深基3.例7】肥胖问题

P5715 【深基3.例8】三位数排序

P5716 【深基3.例9】月份天数

P1085 [NOIP2004 普及组] 不高兴的津津

P1909 [NOIP2016 普及组] 买铅笔

P5717 【深基3.习8】三角形分类

P1422 小玉家的电费

P1424 小鱼的航程（改进版）

P1888 三角函数

P1046 [NOIP2005 普及组] 陶陶摘苹果

P4414 [COCI2006-2007#2] ABC

P1055 [NOIP2008 普及组] ISBN 号码

【入门3】循环结构

P5718 【深基4.例2】找最小值

P5719 【深基4.例3】分类平均

P5720 【深基4.例4】一尺之棰

P5721 【深基4.例6】数字直角三角形

P1009 [NOIP1998 普及组] 阶乘之和

P1980 [NOIP2013 普及组] 计数问题

P1035 [NOIP2002 普及组] 级数求和

P2669 [NOIP2015 普及组] 金币

P5722 【深基4.例11】数列求和

P5723 【深基4.例13】质数口袋

P1217 [USACO1.5] 回文质数 Prime Palindromes

P1423 小玉在游泳

P1307 [NOIP2011 普及组] 数字反转

P1720 月落乌啼算钱（斐波那契数列）

P5724 【深基4.习5】求极差 / 最大跨度值

P1420 最长连号

P1075 [NOIP2012 普及组] 质因数分解

P5725 【深基4.习8】求三角形

P5726 【深基4.习9】打分

P4956 [COCI2017-2018#6] Davor

P1089 [NOIP2004 提高组] 津津的储蓄计划

【入门4】数组

P1428 小鱼比可爱

P1427 小鱼的数字游戏

P5727 【深基5.例3】冰雹猜想

P1047 [NOIP2005 普及组] 校门外的树

P5728 【深基5.例5】旗鼓相当的对手

P5729 【深基5.例7】工艺品制作

P2550 [AHOI2001] 彩票摇奖

P2615 [NOIP2015 提高组] 神奇的幻方

P5730 【深基5.例10】显示屏

P1554 梦中的统计

P2141 [NOIP2014 普及组] 珠心算测验

 

持续更新中……

 

【入门1】顺序结构

B2002 Hello,World!

  1. public class Main {
  2.     public static void main(String[] args) {
  3.         System.out.println("Hello,World!");
  4.     }
  5. }

B2025 输出字符菱形

  1. public class Main {
  2.     public static void main(String[] args) {
  3.         for (int i = 1; i <= 3; i++) {
  4.             for (int j = 1; j <= 3 - i; j++) {
  5.                 System.out.print(" ");
  6.             }
  7.  
  8.             for (int j = 1; j <= 2 * i - 1; j++) {
  9.                 System.out.print("*");
  10.             }
  11.             System.out.println();
  12.         }
  13.  
  14.         for (int i = 3; i >= 0; i--) {
  15.             for (int j = 0; j <= 3 - i; j++) {
  16.                 System.out.print(" ");
  17.             }
  18.             for (int j = 2; j <= 2 * i - 2 ; j++) {
  19.                 System.out.print("*");
  20.             }
  21.             System.out.println();
  22.         }
  23.     }
  24. }

P1000 超级玛丽游戏

  1. public class Main {
  2.     public static void main(String[] args) {
  3.         System.out.println("                ********\n" +
  4.                 "               ************\n" +
  5.                 "               ####....#.\n" +
  6.                 "             #..###.....##....\n" +
  7.                 "             ###.......######              ###            ###\n" +
  8.                 "                ...........               #...#          #...#\n" +
  9.                 "               ##*#######                 #.#.#          #.#.#\n" +
  10.                 "            ####*******######             #.#.#          #.#.#\n" +
  11.                 "           ...#***.****.*###....          #...#          #...#\n" +
  12.                 "           ....**********##.....           ###            ###\n" +
  13.                 "           ....****    *****....\n" +
  14.                 "             ####        ####\n" +
  15.                 "           ######        ######\n" +
  16.                 "##############################################################\n" +
  17.                 "#...#......#.##...#......#.##...#......#.##------------------#\n" +
  18.                 "###########################################------------------#\n" +
  19.                 "#..#....#....##..#....#....##..#....#....#####################\n" +
  20.                 "##########################################    #----------#\n" +
  21.                 "#.....#......##.....#......##.....#......#    #----------#\n" +
  22.                 "##########################################    #----------#\n" +
  23.                 "#.#..#....#..##.#..#....#..##.#..#....#..#    #----------#\n" +
  24.                 "##########################################    ############");
  25.     }
  26. }

P1001 A+B Problem

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         long a = scanner.nextInt();
  7.         long b = scanner.nextInt();
  8.         System.out.println(a + b);
  9.     }
  10. }

B2005 字符三角形

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         double a = scanner.nextDouble();
  7.         double b = scanner.nextDouble();
  8.         double c = scanner.nextDouble();
  9.  
  10.         double p = (a + b + c) / 2;
  11.  
  12.         double s = Math.sqrt(p * ((p - a) * (p - b) * (p - c)));
  13.  
  14.         System.out.printf("%.1f", s);
  15.     }
  16. }

 

P5703 【深基2.例5】苹果采购

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         long a = scanner.nextInt();
  7.         long b = scanner.nextInt();
  8.         System.out.println(a * b);
  9.     }
  10.     
  11. }

 

P5704 【深基2.例6】字母转换

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         String s = scanner.next();
  7.         System.out.println(s.toUpperCase());
  8.     }
  9. }

 

 

P5705 【深基2.例7】数字反转

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         String s = scanner.next();
  7.         StringBuffer sb = new StringBuffer(s);
  8.         System.out.println(sb.reverse());
  9.     }
  10. }

 

P5706 【深基2.例8】再分肥宅水

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         double t = scanner.nextDouble();
  7.         int n = scanner.nextInt();
  8.  
  9.         double ml = t / n;
  10.         int cup = n * 2;
  11.  
  12.         System.out.printf("%.3f", ml);
  13.         System.out.println();
  14.         System.out.println(cup);
  15.     }
  16. }

P5708 【深基2.习2】三角形面积

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         double a = scanner.nextDouble();
  7.         double b = scanner.nextDouble();
  8.         double c = scanner.nextDouble();
  9.  
  10.         double p = (a + b + c) / 2;
  11.  
  12.         double s = Math.sqrt(p * ((p - a) * (p - b) * (p - c)));
  13.  
  14.         System.out.printf("%.1f", s);
  15.     }
  16. }

P5707 【深基2.例12】上学迟到

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int s = scanner.nextInt();
  7.         int v = scanner.nextInt();
  8.         int H ,M;
  9.  
  10.         //路途所需时间
  11.         int i;
  12.         if (s % v == 0){
  13.             //踩点
  14.             i = 10 + s / v;
  15.         }else {
  16.             //早到一分钟
  17.             i = 11 + s/v;
  18.         }
  19.  
  20.         int j;
  21.         if (480 - i < 0){
  22.             //提前一天
  23.             j = 1440 + (480 - i);
  24.         }else {
  25.             //不提前
  26.             j = 480 - i;
  27.         }
  28.         H = j / 60;
  29.         M = j % 60;
  30.  
  31.         System.out.printf("%02d:%02d" , H, M);
  32.     }
  33. }

B2029 大象喝水

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int h = scanner.nextInt();
  7.         int r = scanner.nextInt();
  8.         double a = 3.14 * r * r * h;
  9.         int b = 20 * 1000;//单位换算
  10.         int result = (int)Math.ceil(b / a);
  11.         System.out.println(result);
  12.     }
  13. }

P1425 小鱼的游泳时间

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int starth = scanner.nextInt();
  7.         int startm = scanner.nextInt();
  8.         int endh = scanner.nextInt();
  9.         int endm = scanner.nextInt();
  10.         int resulth;
  11.         int resultm;
  12.         if (endm - startm >= 0){
  13.             resulth = endh - starth;
  14.             resultm = endm - startm;
  15.         }else {
  16.             resulth = endh - starth - 1;
  17.             resultm = 60 - Math.abs(endm - startm);
  18.         }
  19.         System.out.println(resulth + " " + resultm);
  20.     }
  21. }

P1421 小玉买文具

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int a  = scanner.nextInt();
  7.         int b  = scanner.nextInt();
  8.  
  9.         int total = a * 10 + b;
  10.  
  11.         int count = total / 19;
  12.         System.out.println(count);
  13.     }
  14. }

P3954 [NOIP2017 普及组] 成绩

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int a = scanner.nextInt();
  7.         int b = scanner.nextInt();
  8.         int c = scanner.nextInt();
  9.         int ans = (int)(a * 0.2 + b * 0.3 + c * 0.5);
  10.         System.out.println(ans);
  11.     }
  12. }

【入门2】分支结构

P2433 【深基1-2】小学数学 N 合一

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int T = scanner.nextInt();
  7.         if (T == 1) {
  8.             System.out.println("I love Luogu!");
  9.         } else if (T == 2) {
  10.             System.out.println(6 + " " + 4);
  11.         } else if (T == 3) {
  12.             System.out.println("3\n12\n2");
  13.         } else if (T == 4) {
  14.             System.out.println("166.667");
  15.         } else if (T == 5) {
  16.             System.out.println(15);
  17.         } else if (T == 6) {
  18.             System.out.println("10.8167");
  19.         } else if (T == 7) {
  20.             System.out.println("110\n90\n0");
  21.         } else if (T == 8) {
  22.             System.out.println("31.4159\n78.5398\n523.599");
  23.         } else if (T == 9) {
  24.             System.out.println(22);
  25.         } else if (T == 10) {
  26.             System.out.println(9);
  27.         } else if (T == 11) {
  28.             System.out.println("33.3333");
  29.         } else if (T == 12) {
  30.             System.out.println("13\nR");
  31.         } else if (T == 13) {
  32.             double pi = 3.141593;
  33.             System.out.println((int)(Math.pow(4.0/3*pi*(4*4*4+10*10*10),1.0*1/3)));
  34.         } else if (T == 14) {
  35.             System.out.println(50);
  36.         }
  37.     }
  38. }

P5709 【深基2.习6】Apples Prologue / 苹果和虫子

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int m = scanner.nextInt();
  7.         int t = scanner.nextInt();
  8.         int s = scanner.nextInt();
  9.         // 排0
  10.         if (t == 0) {
  11.             System.out.println(0);
  12.         } else if (s / t <= m) {
  13.             //  吃的苹果 不能比 有的苹果 多
  14.             int i = s / t;
  15.             // 正在吃的苹果没吃完
  16.             if (s % t > 0) {
  17.                 i += 1;
  18.             }
  19.             System.out.println(m - i);
  20.         } else {
  21.             System.out.println(0);
  22.         }
  23.     }
  24. }

P5710 【深基3.例2】数的性质

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int a = scanner.nextInt();
  7.         //小A
  8.         if ((a % 2 == 0) && (4 < a & a <= 12)) {
  9.             System.out.print(1 + " ");
  10.         } else {
  11.             System.out.print(0 + " ");
  12.         }
  13.         //Uim
  14.         if (a % 2 == 0 || 4 < a && a <= 12) {
  15.             System.out.print(1 + " ");
  16.         } else {
  17.             System.out.print(0 + " ");
  18.         }
  19.         //八尾勇
  20.         //" ^ " 与boolean类型是一样的，当两个boolean类型的变量同真或同假时，结果为假；两个变量一真一假时，结果为真。
  21.         if (a % 2 == 0 ^ 4 < a && a <= 12) {
  22.             System.out.print(1 + " ");
  23.         } else {
  24.             System.out.print(0 + " ");
  25.         }
  26.         //正妹
  27.         if ((a % 2 != 0) && (a <= 4 || a > 12)) {
  28.             System.out.print(1 + " ");
  29.         } else {
  30.             System.out.print(0 + " ");
  31.         }
  32.     }
  33. }

P5711 【深基3.例3】闰年判断

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int year = scanner.nextInt();
  7.         if ((year % 400 == 0) || (year % 4 == 0 && year % 100 != 0)) {
  8.             System.out.println(1);
  9.         } else {
  10.             System.out.println(0);
  11.         }
  12.     }
  13. }

P5712 【深基3.例4】Apples

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int x = scanner.nextInt();
  7.  
  8.         if (x == 0 || x == 1) {
  9.             System.out.println("Today, I ate " + x + " apple.");
  10.         } else {
  11.             System.out.println("Today, I ate " + x + " apples.");
  12.         }
  13.     }
  14. }

P5713 【深基3.例5】洛谷团队系统

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.  
  7.         int n = scanner.nextInt();
  8.  
  9.         int local = n * 5;
  10.         int luogu = n * 3 + 11;
  11.  
  12.         System.out.println(local > luogu ? "Luogu" : "Local");
  13.     }
  14. }

P5714 【深基3.例7】肥胖问题

  1. import java.math.BigDecimal;
  2. import java.math.MathContext;
  3. import java.util.Scanner;
  4.  
  5. public class Main {
  6.     public static void main(String[] args) {
  7.         Scanner scanner = new Scanner(System.in);
  8.         double m = scanner.nextDouble();
  9.         double h = scanner.nextDouble();
  10.         
  11.         double BMI = m / (h * h);
  12.         
  13.         if (BMI < 18.5) {
  14.             System.out.println("Underweight");
  15.         } else if (BMI < 24) {
  16.             System.out.println("Normal");
  17.         } else if (BMI >= 24) {
  18.             BigDecimal a = new BigDecimal(String.valueOf(BMI));
  19.             //相当于 BigDecimal b = new BigDecimal("1")
  20.             BigDecimal b = BigDecimal.ONE;
  21.             //传入所占位数
  22.             MathContext mc = new MathContext(6);
  23.             System.out.println(a.divide(b, mc) + "\n" + "Overweight");
  24.         }
  25.     }
  26. }

P5715 【深基3.例8】三位数排序

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.  
  7.         int a = scanner.nextInt();
  8.         int b = scanner.nextInt();
  9.         int c = scanner.nextInt();
  10.  
  11.         if (a > b) {
  12.             int temp = a;
  13.             a = b;
  14.             b = temp;
  15.         }
  16.         if (b > c) {
  17.             int temp = b;
  18.             b = c;
  19.             c = temp;
  20.         }
  21.         if (a > b) {
  22.             int temp = a;
  23.             a = b;
  24.             b = temp;
  25.         }
  26.         System.out.println(a + " " + b + " " + c);
  27.     }
  28. }

P5716 【深基3.例9】月份天数

  1. import java.time.YearMonth;
  2. import java.util.Scanner;
  3.  
  4. public class Main {
  5.     public static void main(String[] args) {
  6.         Scanner scanner = new Scanner(System.in);
  7.         int year = scanner.nextInt();
  8.         int month = scanner.nextInt();
  9.  
  10.         // 使用YearMonth获取天数
  11.         YearMonth ym = YearMonth.of(year, month);
  12.         
  13.         System.out.println(ym.lengthOfMonth());
  14.     }
  15. }

P1085 [NOIP2004 普及组] 不高兴的津津

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.  
  7.         int max = 0;
  8.         int index = 0;
  9.         int count = 0;
  10.  
  11.         for (int i = 0; i < 7; i++) {
  12.             int a = scanner.nextInt();
  13.             int b = scanner.nextInt();
  14.             if (a + b > 8) {
  15.                 if (a + b > max) {
  16.                     count++;
  17.                     max = a + b;
  18.                     index = i;
  19.                 }
  20.  
  21.             }
  22.         }
  23.         if (count == 0) {
  24.             System.out.println(0);
  25.         } else {
  26.             System.out.println(index + 1);
  27.         }
  28.     }
  29. }

P1909 [NOIP2016 普及组] 买铅笔

  1. import java.util.*;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.  
  8.         int price = 0;
  9.         List<Integer> list = new ArrayList<>();
  10.  
  11.         for (int i = 0; i < 3; i++) {
  12.             int a = scanner.nextInt();
  13.             int b = scanner.nextInt();
  14.             int mod = n % a;
  15.             int count = n / a;
  16.             if (mod == 0) {
  17.                 price = count * b;
  18.             } else {
  19.                 price = ++count * b;
  20.             }
  21.             list.add(price);
  22.         }
  23.  
  24.         Integer min = Collections.min(list);
  25.  
  26.         System.out.println(min);
  27.     }
  28. }

P5717 【深基3.习8】三角形分类

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.  
  7.         int a = scanner.nextInt();
  8.         int b = scanner.nextInt();
  9.         int c = scanner.nextInt();
  10.  
  11.         // 判定三角形类型
  12.         judgeTriangleType(a, b, c);
  13.     }
  14.  
  15.     private static void judgeTriangleType(int a, int b, int c) {
  16.         //判断是否三角形
  17.         if (a + b > c && a + c > b && b + c > a) {
  18.             //直角
  19.             if (a * a + b * b == c * c || b * b + c * c == a * a || a * a + c * c == b * b) {
  20.                 System.out.println("Right triangle");
  21.             } else {
  22.                 //锐角和钝角
  23.                 if (a * a + b * b > c * c && b * b + c * c > a * a && a * a + c * c > b * b) {
  24.                     System.out.println("Acute triangle");
  25.                 } else {
  26.                     System.out.println("Obtuse triangle");
  27.                 }
  28.                 //等腰
  29.                 if (a == b || b == c || a == c) {
  30.                     System.out.println("Isosceles triangle");
  31.                     //等边
  32.                     if (a == b && b == c && a == c) {
  33.                         System.out.println("Equilateral triangle");
  34.                     }
  35.                 }
  36.             }
  37.         } else {
  38.             System.out.println("Not triangle");
  39.         }
  40.     }
  41.  
  42. }

P1422 小玉家的电费

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         double prise;
  8.         if (n <= 150) {
  9.             prise = n * 0.4463;
  10.         } else if (n <= 400) {
  11.             prise = 150 *   0.4463 + 0.4663 * (n - 150);
  12.         } else {
  13.             prise = 150 * 0.4463 + 250 * 0.4663 + 0.5663 * (n - 400);
  14.         }
  15.         System.out.println(String.format("%.1f", prise));
  16.     }
  17. }

P1424 小鱼的航程（改进版）

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int x = scanner.nextInt();
  7.         int n = scanner.nextInt();
  8.         long ans = 0;
  9.         // 循环n天
  10.         for (int i = 0; i < n; i++) {
  11.             // 如果当前位置不是周六或周日
  12.             if (x != 6 && x != 7) {
  13.                 // 增加250到答案中
  14.                 ans += 250; 
  15.             }
  16.             // 如果当前位置是周日
  17.             if (x == 7) {
  18.                 // 将位置设置为周一
  19.                 x = 1; 
  20.             } else {
  21.                 // 否则将位置加1
  22.                 x++; 
  23.             }
  24.         }
  25.         System.out.println(ans);
  26.     }
  27. }

P1888 三角函数

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int a  = scanner.nextInt();
  7.         int b  = scanner.nextInt();
  8.         int c  = scanner.nextInt();
  9.  
  10.         int min = Math.min(a, Math.min(b, c));
  11.         int max = Math.max(a, Math.max(b, c));
  12.         //求最大公约数
  13.         int gcd = getGcd(min, max);
  14.  
  15.         System.out.println(min / gcd + "/" + max / gcd);
  16.     }
  17.     
  18.     private static int getGcd(int a, int b) {
  19.         if (b == 0) {
  20.             return a;
  21.         }
  22.         return getGcd(b, a % b);
  23.     }
  24. }

P1046 [NOIP2005 普及组] 陶陶摘苹果

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         String[] temp = scanner.nextLine().split(" ");
  7.         int h = scanner.nextInt() + 30;
  8.  
  9.         int count = 0;
  10.  
  11.         for (int i = 0; i < temp.length; i++) {
  12.             int n = Integer.parseInt(temp[i]);
  13.             if (h >= n) {
  14.                 count++;
  15.             }
  16.         }
  17.  
  18.         System.out.println(count);
  19.     }
  20. }

P4414 [COCI2006-2007#2] ABC

  1. import java.util.Arrays;
  2. import java.util.Scanner;
  3. import java.util.TreeMap;
  4.  
  5. public class Main {
  6.     public static void main(String[] args) {
  7.         Scanner scanner = new Scanner(System.in);
  8.  
  9.         int[] arr = new int[3];
  10.         for (int i = 0; i < arr.length; i++) {
  11.             arr[i] = scanner.nextInt();
  12.         }
  13.  
  14.         Arrays.sort(arr);
  15.  
  16.         TreeMap<Character, Integer> map = new TreeMap<>();
  17.         for (int i = 0; i < arr.length; i++) {
  18.             map.put((char) ('A' + i), arr[i]);
  19.         }
  20.  
  21.         char[] ch = scanner.next().toCharArray();
  22.         for (int i = 0; i < ch.length; i++) {
  23.             System.out.print(map.get(ch[i]) + " ");
  24.         }
  25.  
  26.     }
  27. }

P1055 [NOIP2008 普及组] ISBN 号码

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         String s = scanner.next().replace("-", "");
  7.         //号码
  8.         int n = Integer.parseInt(s.substring(0, 9));
  9.         //校验码
  10.         String c = s.substring(9);
  11.         int m;
  12.         if ("X".equals(c)) {
  13.             m = 10;
  14.         } else {
  15.             m = Integer.parseInt(c);
  16.         }
  17.  
  18.         //求和
  19.         int sum = 0;
  20.         int i = 9;
  21.         while (n > 0) {
  22.             int num = n % 10;
  23.             sum += num * i;
  24.             n /= 10;
  25.             i--;
  26.         }
  27.  
  28.         int mod = sum % 11;
  29.  
  30.         if (mod == m) {
  31.             System.out.println("Right");
  32.         } else {
  33.             if (mod ==10) {
  34.                 System.out.println(s.substring(0, 1) + "-" + s.substring(1, 4) + "-" + s.substring(4, 9) + "-X");
  35.             } else {
  36.                 System.out.println(s.substring(0, 1) + "-" + s.substring(1, 4) + "-" + s.substring(4, 9) + "-" + mod);
  37.             }
  38.         }
  39.     }
  40. }

【入门3】循环结构

P5718 【深基4.例2】找最小值

  1. import java.util.*;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         int[] arr = new int[n];
  8.         for (int i = 0; i < n; i++) {
  9.             arr[i] = scanner.nextInt();
  10.         }
  11.         Arrays.sort(arr);
  12.         System.out.println(arr[0]);
  13.     }
  14. }

P5719 【深基4.例3】分类平均

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         int k = scanner.nextInt();
  8.         double sum1 = 0, sum2 = 0;
  9.         int m = 0, j = 0;
  10.         //方法一:
  11.         for (int i = 1; i <= n; i++) {
  12.             if (i % k == 0) {
  13.                 sum1 += i;
  14.                 m++;
  15.             } else {
  16.                 sum2 += i;
  17.                 j++;
  18.             }
  19.         }
  20.         System.out.printf("%.1f %.1f", sum1 / m, sum2 / j);
  21.  
  22.         //方法二:
  23.         /*for (int i = k; i <= n; i+=k) {
  24.             sum1 += i;
  25.         }
  26.         //通过等差数列求和公式 Sn=[n(A1+An)]/2
  27.         sum2 = n * (1 + n) / 2 - sum1;
  28.         System.out.printf("%.1f %.1f", sum1/(n/k),sum2/(n-n/k));*/
  29.     }
  30. }

P5720 【深基4.例4】一尺之棰

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         // 从第一天开始
  8.         int count = 1;
  9.         while (n != 1) {
  10.             n = (int) Math.ceil(n / 2);
  11.             count++;
  12.         }
  13.         System.out.println(count);
  14.     }
  15. }

P5721 【深基4.例6】数字直角三角形

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.  
  8.         int count = 1;
  9.  
  10.         // 打印数字直角三角形
  11.         for (int i = 0; i < n; i++) {
  12.             for (int j = 0; j < n - i; j++) {
  13.                 System.out.printf("%02d", count++);
  14.             }
  15.             System.out.println();
  16.         }
  17.     }
  18. }

P1009 [NOIP1998 普及组] 阶乘之和

  1. import java.math.BigInteger;
  2. import java.util.Scanner;
  3.  
  4. public class Main {
  5.     public static void main(String[] args) {
  6.         Scanner scanner = new Scanner(System.in);
  7.         int n = scanner.nextInt();
  8.         BigInteger sum = new BigInteger("0");
  9.         for (int i = 1; i <= n; i++) {
  10.             BigInteger a = new BigInteger("1");
  11.             for (int j = 1; j <= i; j++) {
  12.                 BigInteger b = new BigInteger(String.valueOf(j));
  13.                 a = a.multiply(b);
  14.             }
  15.             sum = sum.add(a);
  16.         }
  17.         System.out.println(sum);
  18.     }
  19. }

P1980 [NOIP2013 普及组] 计数问题

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         //方法一:
  8.         /*char x = scanner.next().charAt(0);
  9.         int count = 0;
  10.         for (int i = 1; i <= n; i++) {
  11.             String str = "" + i;
  12.             for (int j = 0; j <= str.length() - 1; j++) {
  13.                 if (str.charAt(j) == x) {
  14.                     count++;
  15.                 }
  16.             }
  17.         }
  18.         System.out.println(count);*/
  19.         
  20.         //方法二:
  21.         int x = scanner.nextInt();
  22.         int count = 0;
  23.         for (int i = 1; i <= n; i++) {
  24.             int t = i;
  25.             while (t > 0) {
  26.                 if (t % 10 == x) {
  27.                     count++;
  28.                 }
  29.                 t /= 10;
  30.             }
  31.         }
  32.         System.out.println(count);
  33.     }
  34. }

P1035 [NOIP2002 普及组] 级数求和

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int k = scanner.nextInt();
  7.         double sum = 0;
  8.         int i = 0;
  9.         while (true) {
  10.             sum += 1.0 / ++i;
  11.             if (sum > k) {
  12.                 System.out.println(i);
  13.                 return;
  14.             }
  15.         }
  16.  
  17.     }
  18. }

P2669 [NOIP2015 普及组] 金币

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         int sum = 0;
  8.         //记录天数
  9.         int day = 0;
  10.         for (int i = 1; i <= n; i++) {
  11.             for (int j = 1; j <= i; j++) {
  12.                 day++;
  13.                 sum += i;
  14.                 if (day == n) {
  15.                     System.out.println(sum);
  16.                     return;
  17.                 }
  18.             }
  19.         }
  20.     }
  21. }

P5722 【深基4.例11】数列求和

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         int sum = 0;
  8.         for (int i = 1; i <= n; i++) {
  9.             sum += i;
  10.         }
  11.         System.out.println(sum);
  12.     }
  13. }

P5723 【深基4.例13】质数口袋

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         int sum = 0;
  8.         for (int i = 1; i <= n; i++) {
  9.             sum += i;
  10.         }
  11.         System.out.println(sum);
  12.     }
  13. }

P1217 [USACO1.5] 回文质数 Prime Palindromes

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int a = scanner.nextInt();
  7.         int b = scanner.nextInt();
  8.         //只有奇数才有可能是质数
  9.         if (a % 2 == 0) {
  10.             a++;
  11.         }
  12.         for (int i = a; i <= b; i += 2) {
  13.             //最大的回文质数是 7 位数
  14.             if (i >= 10000000) {
  15.                 break;
  16.             }
  17.             if (isPalindrome(i)) {
  18.                 if (isPrime(i)) {
  19.                     System.out.println(i);
  20.                 }
  21.             }
  22.         }
  23.     }
  24.  
  25.     private static boolean isPalindrome(long i) {
  26.         StringBuffer sb = new StringBuffer(Long.toString(i));
  27.         if (String.valueOf(i).equals(sb.reverse().toString())) {
  28.             return true;
  29.         }
  30.         return false;
  31.     }
  32.  
  33.     private static boolean isPrime(long n) {
  34.         for (int j = 3; j <= Math.sqrt(n); j += 2) {
  35.             if (n % j == 0) {
  36.                 return false;
  37.             }
  38.         }
  39.         return true;
  40.     }
  41. }

P1423 小玉在游泳

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         double s = scanner.nextDouble();
  7.         double sum = 0;
  8.         for (int i = 0;i < 9999 ; i++) {
  9.             sum += 2 * Math.pow(0.98, i);
  10.             if (sum >= s) {
  11.                 System.out.println(i + 1);
  12.                 break;
  13.             }
  14.         }
  15.     }
  16. }

P1307 [NOIP2011 普及组] 数字反转

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         String s = scanner.next();
  7.         if (s.charAt(0) == '-') {
  8.             System.out.println("-" + Integer.parseInt(new StringBuilder(s.substring(1)).reverse().toString()));
  9.         } else {
  10.             System.out.println(Integer.parseInt(new StringBuilder(s).reverse().toString()));
  11.         }
  12.     }
  13. }

P1720 月落乌啼算钱（斐波那契数列）

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         
  8.         //方法一:
  9.         //斐波那契数列公式
  10.         double temp = Math.sqrt(5.0);
  11.         double result = (Math.pow((1 + temp) / 2, n) - Math.pow((1 - temp) / 2, n)) / temp;
  12.         System.out.printf("%.2f", result);
  13.         
  14.         //方法二:
  15.         //System.out.printf("%.2f", f(n));
  16.  
  17.     }
  18.  
  19.     private static double f(int n) {
  20.         if (n == 0 || n == 1) {
  21.             return n;
  22.         }
  23.         return f(n - 1) + f(n - 2);
  24.     }
  25. }

P5724 【深基4.习5】求极差 / 最大跨度值

  1. import java.util.ArrayList;
  2. import java.util.Collections;
  3. import java.util.List;
  4. import java.util.Scanner;
  5.  
  6. public class Main {
  7.     public static void main(String[] args) {
  8.         Scanner scanner = new Scanner(System.in);
  9.         int n = scanner.nextInt();
  10.         List<Integer> list = new ArrayList<>();
  11.         for (int i = 0; i < n; i++) {
  12.             list.add(scanner.nextInt());
  13.         }
  14.         int max = Collections.max(list);
  15.         int min = Collections.min(list);
  16.         System.out.println(max - min);
  17.     }
  18. }

P1420 最长连号

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         int[] arr = new int[n];
  8.         for (int i = 0; i < n; i++) {
  9.             arr[i] = scanner.nextInt();
  10.         }
  11.         //记录长度
  12.         int len = 1;
  13.         //最大长度
  14.         int maxLen = 1;
  15.         for (int i = 0; i < arr.length - 1; i++) {
  16.             if (arr[i] == arr[i + 1] - 1) {
  17.                 len++;
  18.             } else {
  19.                 len = 1;
  20.             }
  21.             maxLen = Math.max(len, maxLen);
  22.         }
  23.         System.out.println(maxLen);
  24.     }
  25. }

P1075 [NOIP2012 普及组] 质因数分解

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         // 计算 sqrt(n) 的值
  8.         int limit = (int) Math.sqrt(n);
  9.         // 标记是否找到了最大质因数
  10.         boolean flag = false;
  11.         // 去掉所有的 2 的因子
  12.         while (n % 2 == 0) { 
  13.             n /= 2;
  14.         }
  15.         // 从 3 开始遍历奇数
  16.         for (int i = 3; i <= limit; i += 2) {
  17.             // 判断 i 是否是质数
  18.             if (isPrime(i)) {
  19.                 // 如果 i 是 n 的因子，就输出 i
  20.                 while (n % i == 0) {
  21.                     n /= i;
  22.                 }
  23.                 // 如果 n 已经被分解完了，就找到了最大质因数
  24.                 if (n == 1) {
  25.                     flag = true;
  26.                     break;
  27.                 }
  28.             }
  29.         }
  30.         // 如果没有找到最大质因数，说明 n 本身就是质数
  31.         if (!flag) {
  32.             System.out.print(n);
  33.         }
  34.     }
  35.  
  36.     private static boolean isPrime(long n) {
  37.         for (int j = 3; j <= Math.sqrt(n); j += 2) {
  38.             if (n % j == 0) {
  39.                 return false;
  40.             }
  41.         }
  42.         return true;
  43.     }
  44. }

P5725 【深基4.习8】求三角形

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         int count = 1;
  8.  
  9.         //正方形
  10.         for (int i = 1; i <= n; i++) {
  11.             for (int j = 1; j <= n; j++) {
  12.                 System.out.printf("%02d", count++);
  13.             }
  14.             System.out.println();
  15.         }
  16.  
  17.         System.out.println();
  18.         count = 1;
  19.  
  20.         //右三角形
  21.         for (int i = 1; i <= n; i++) {
  22.             //每行的空格
  23.             for (int j = 1; j <= n - i; j++) {
  24.                 System.out.print("  ");
  25.             }
  26.             //每行输出的数字
  27.             for (int j = 1; j <= i; j++) {
  28.                 System.out.printf("%02d", count++);
  29.             }
  30.             System.out.println();
  31.         }
  32.     }
  33. }

P5726 【深基4.习9】打分

  1. import java.util.ArrayList;
  2. import java.util.Collections;
  3. import java.util.List;
  4. import java.util.Scanner;
  5.  
  6. public class Main {
  7.     public static void main(String[] args) {
  8.         Scanner scanner = new Scanner(System.in);
  9.         int n = scanner.nextInt();
  10.         
  11.         List<Integer> list = new ArrayList<>();
  12.         for (int i = 0; i < n; i++) {
  13.             list.add(scanner.nextInt());
  14.         }
  15.         Integer max = Collections.max(list);
  16.         Integer min = Collections.min(list);
  17.         list.remove(max);
  18.         list.remove(min);
  19.  
  20.         // 使用 reduce() 方法，传入初始值 0 和累加函数 Integer::sum，得到总和
  21.         double sum = list.stream().reduce(0, Integer::sum);
  22.  
  23.         System.out.printf("%.2f", sum / list.size());
  24.     }
  25. }

P4956 [COCI2017-2018#6] Davor

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         //52周在一开始就可以除掉了，反正这52周是完全一样的。再来看每一周。把每天的数加起来，
  7.         //得到7x + 21k，化简得 7(x + 3k)，于是7也可以开始除掉。
  8.         //所以，只要在开始把 52 × 7 = 364除掉，那么方程就变为：x + 3k = n.
  9.         //解这个不定方程时，也需要关注一些题目的条件。这道题的条件有：1≤ ≤100， 和k 为正整数，且使得 最大，最小。
  10.         int n = scanner.nextInt() / 364;
  11.         for (int i = 1; ; i++) {
  12.             for (int j = 1; j <= 100; j++) {
  13.                 if (j + 3 * i == n) {
  14.                     System.out.println(j);
  15.                     System.out.println(i);
  16.                     return;
  17.                 }
  18.             }
  19.         }
  20.     }
  21. }

P1089 [NOIP2004 提高组] 津津的储蓄计划

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int money = 0;
  7.         int bank = 0;
  8.         for (int i = 1; i <= 12; i++) {
  9.             money += 300;
  10.             int expense = scanner.nextInt();
  11.             if (money < expense) {
  12.                 System.out.println(-i);
  13.                 return;
  14.             }
  15.             money -= expense;
  16.             if (money / 100 > 0) {
  17.                 int temp = money % 100;
  18.                 //存入妈妈那
  19.                 bank += money - temp;
  20.                 //存入后剩余的钱
  21.                 money -= money - temp;
  22.             }
  23.         }
  24.         System.out.println((int) (bank * 1.2 + money));
  25.     }
  26. }

【入门4】数组

P1428 小鱼比可爱

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         int[] fish = new int[n];
  8.         for (int i = 0; i < n; i++) {
  9.             fish[i] = scanner.nextInt();
  10.         }
  11.         int count = 0;
  12.         for (int i = 0; i < n; i++) {
  13.             for (int j = 0; j < i; j++) {
  14.                 if (fish[j] < fish[i]) {
  15.                     count++;
  16.                 }
  17.             }
  18.             System.out.print(count + " ");
  19.             count = 0;
  20.         }
  21.     }
  22. }

P1427 小鱼的数字游戏

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         String[] arr = scanner.nextLine().split(" ");
  7.         for (int i = arr.length - 2; i >= 0; i--) {
  8.             System.out.print(arr[i] + " ");
  9.         }
  10.     }
  11. }

P5727 【深基5.例3】冰雹猜想

  1. import java.util.ArrayList;
  2. import java.util.List;
  3. import java.util.Scanner;
  4.  
  5. public class Main {
  6.     public static void main(String[] args) {
  7.         Scanner scanner = new Scanner(System.in);
  8.         int n = scanner.nextInt();
  9.         List<Integer> list = new ArrayList<>();
  10.         list.add(n);
  11.         while (n != 1) {
  12.             if (n % 2 == 0) {
  13.                 n /= 2;
  14.             } else {
  15.                 n = 3 * n + 1;
  16.             }
  17.             list.add(n);
  18.         }
  19.         for (int i = list.size() - 1; i >= 0; i--) {
  20.             System.out.print(list.get(i) + " ");
  21.         }
  22.     }
  23. }

P1047 [NOIP2005 普及组] 校门外的树

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         //实际上有501棵树
  7.         boolean[] trees = new boolean[scanner.nextInt()+ 1];
  8.         int n = scanner.nextInt();
  9.         for (int i = 0; i < n; i++) {
  10.             int start = scanner.nextInt(), end = scanner.nextInt();
  11.             for (int j = start; j <= end; j++) {
  12.                 trees[j] = true;
  13.             }
  14.         }
  15.         int count = 0;
  16.         for (boolean tree : trees) {
  17.             if (!tree) {
  18.                 count++;
  19.             }
  20.         }
  21.         System.out.println(count);
  22.     }
  23. }

P5728 【深基5.例5】旗鼓相当的对手

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         int[][] arr = new int[n][4];
  8.         for (int i = 0; i < arr.length; i++) {
  9.             int sum = 0;
  10.             for (int j = 0; j < 3; j++) {
  11.                 arr[i][j] = scanner.nextInt();
  12.                 sum += arr[i][j];
  13.             }
  14.             //把个人总成绩放入最后
  15.             arr[i][3] = sum;
  16.         }
  17.  
  18.         //记录旗鼓相当的对手
  19.         int ans = 0;
  20.         //从后往前遍历
  21.         for (int i = arr.length - 1; i >= 0; i--) {
  22.             //从倒数第二个开始遍历
  23.             for (int j = i - 1; j >= 0; j--) {
  24.                 //记录单个学生的单科成绩
  25.                 int count = 0;
  26.                 //三门成绩
  27.                 for (int k = 0; k < 3; k++) {
  28.                     if (Math.abs(arr[i][k] - arr[j][k]) <= 5) {
  29.                         count++;
  30.                     }
  31.                 }
  32.                 if (count == 3 && Math.abs(arr[i][3] - arr[j][3]) <= 10) {
  33.                     ans++;
  34.                 }
  35.             }
  36.         }
  37.         System.out.println(ans);
  38.     }
  39. }

P5729 【深基5.例7】工艺品制作

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int x = scanner.nextInt();
  7.         int y = scanner.nextInt();
  8.         int z = scanner.nextInt();
  9.         int n = scanner.nextInt();
  10.         boolean[][][] arr = new boolean[x + 1][y + 1][z + 1];
  11.         for (int i = 0; i < n; i++) {
  12.             int x1 = scanner.nextInt();
  13.             int y1 = scanner.nextInt();
  14.             int z1 = scanner.nextInt();
  15.             int x2 = scanner.nextInt();
  16.             int y2 = scanner.nextInt();
  17.             int z2 = scanner.nextInt();
  18.             for (int j = x1; j <= x2; j++) {
  19.                 for (int k = y1; k <= y2; k++) {
  20.                     for (int l = z1; l <= z2; l++) {
  21.                         arr[j][k][l] = true;
  22.                     }
  23.                 }
  24.             }
  25.         }
  26.         int count = 0;
  27.         for (int i = 1; i <= x; i++) {
  28.             for (int j = 1; j <= y; j++) {
  29.                 for (int k = 1; k <= z; k++) {
  30.                     if (!arr[i][j][k]) {
  31.                         count++;
  32.                     }
  33.                 }
  34.             }
  35.         }
  36.         System.out.println(count);
  37.     }
  38. }

P2550 [AHOI2001] 彩票摇奖

  1. import java.util.ArrayList;
  2. import java.util.List;
  3. import java.util.Scanner;
  4.  
  5. public class Main {
  6.     public static void main(String[] args) {
  7.         Scanner scanner = new Scanner(System.in);
  8.         int n = scanner.nextInt();
  9.  
  10.         scanner.nextLine(); // 读取换行符
  11.  
  12.         //存取中奖号码
  13.         List<Integer> list = new ArrayList<>();
  14.         String[] strs = scanner.nextLine().split(" ");
  15.         for (int i = 0; i < strs.length; i++) {
  16.             list.add(Integer.parseInt(strs[i]));
  17.         }
  18.  
  19.         //存放中奖个数
  20.         int[] ans = new int[7];
  21.  
  22.         //计算中奖号码个数
  23.         for (int i = 0; i < n; i++) {
  24.             int count = 0;
  25.             for (int j = 0; j < 7; j++) {
  26.                 int temp = scanner.nextInt();
  27.                 if (list.contains(temp)) {
  28.                     count++;
  29.                 }
  30.             }
  31.             ans[7 - count]++;
  32.         }
  33.  
  34.         //遍历输出
  35.         for (int i = 0; i < ans.length; i++) {
  36.             System.out.print(ans[i] + " ");
  37.         }
  38.     }
  39. }

P2615 [NOIP2015 提高组] 神奇的幻方

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         //奇数
  7.         int n = scanner.nextInt();
  8.         int[][] arr = new int[n][n];
  9.         int row = 0, col = n / 2;
  10.         //第一行中间的为1
  11.         arr[row][col] = 1;
  12.         for (int i = 2; i <= n * n; i++) {
  13.             if (row == 0 && col != n - 1) {
  14.                 row = n - 1;
  15.                 col++;
  16.             } else if (col == n - 1 && row != 0) {
  17.                 col = 0;
  18.                 row--;
  19.             } else if (row == 0 && col == n - 1) {
  20.                 row++;
  21.             } else if (arr[row - 1][col + 1] == 0) {
  22.                 row--;
  23.                 col++;
  24.             } else {
  25.                 row++;
  26.             }
  27.             arr[row][col] = i;
  28.         }
  29.  
  30.         for (int i = 0; i < n; i++) {
  31.             for (int j = 0; j < n; j++) {
  32.                 System.out.print(arr[i][j] + " ");
  33.             }
  34.             System.out.println();
  35.         }
  36.     }
  37. }

P5730 【深基5.例10】显示屏

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         // 输入数字的位数
  7.         int n = scanner.nextInt();
  8.         // 输入数字
  9.         String num = scanner.next();
  10.  
  11.         char[][][] digits = {
  12.                 // 0
  13.                 {{'X', 'X', 'X'}, {'X', '.', 'X'}, {'X', '.', 'X'}, {'X', '.', 'X'}, {'X', 'X', 'X'}},
  14.                 // 1
  15.                 {{'.', '.', 'X'}, {'.', '.', 'X'}, {'.', '.', 'X'}, {'.', '.', 'X'}, {'.', '.', 'X'}},
  16.                 // 2
  17.                 {{'X', 'X', 'X'}, {'.', '.', 'X'}, {'X', 'X', 'X'}, {'X', '.', '.'}, {'X', 'X', 'X'}},
  18.                 // 3
  19.                 {{'X', 'X', 'X'}, {'.', '.', 'X'}, {'X', 'X', 'X'}, {'.', '.', 'X'}, {'X', 'X', 'X'}},
  20.                 // 4
  21.                 {{'X', '.', 'X'}, {'X', '.', 'X'}, {'X', 'X', 'X'}, {'.', '.', 'X'}, {'.', '.', 'X'}},
  22.                 // 5
  23.                 {{'X', 'X', 'X'}, {'X', '.', '.'}, {'X', 'X', 'X'}, {'.', '.', 'X'}, {'X', 'X', 'X'}},
  24.                 // 6
  25.                 {{'X', 'X', 'X'}, {'X', '.', '.'}, {'X', 'X', 'X'}, {'X', '.', 'X'}, {'X', 'X', 'X'}},
  26.                 // 7
  27.                 {{'X', 'X', 'X'}, {'.', '.', 'X'}, {'.', '.', 'X'}, {'.', '.', 'X'}, {'.', '.', 'X'}},
  28.                 // 8
  29.                 {{'X', 'X', 'X'}, {'X', '.', 'X'}, {'X', 'X', 'X'}, {'X', '.', 'X'}, {'X', 'X', 'X'}},
  30.                 // 9
  31.                 {{'X', 'X', 'X'}, {'X', '.', 'X'}, {'X', 'X', 'X'}, {'.', '.', 'X'}, {'X', 'X', 'X'}}
  32.         };
  33.  
  34.         // 对于每一行
  35.         for (int i = 0; i < 5; i++) {
  36.             // 对于每一位数字
  37.             for (int j = 0; j < n; j++) {
  38.                 // 获取数字的值
  39.                 int digit = num.charAt(j) - '0';
  40.                 // 对于每一列
  41.                 for (int k = 0; k < 3; k++) {
  42.                     // 输出对应的点阵
  43.                     System.out.print(digits[digit][i][k]);
  44.                 }
  45.                 // 输出间隔, 最后一位数字不需要加 .
  46.                 if (j != n - 1) {
  47.                     System.out.print('.');
  48.                 }
  49.             }
  50.             // 换行
  51.             System.out.println();
  52.         }
  53.     }
  54. }

P1554 梦中的统计

  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scannerc = new Scanner(System.in);
  6.         int m = scannerc.nextInt();
  7.         int n = scannerc.nextInt();
  8.         int[] ans = new int[10];
  9.         for (int i = m; i <= n; i++) {
  10.             int num = i;
  11.             while (num != 0) {
  12.                 ans[num % 10]++;
  13.                 num /= 10;
  14.             }
  15.         }
  16.         for (int i = 0; i < ans.length; i++) {
  17.             System.out.print(ans[i] + " ");
  18.         }
  19.     }
  20. }

P2141 [NOIP2014 普及组] 珠心算测验

  1. import java.util.*;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int n = scanner.nextInt();
  7.         int[] arr = new int[n];
  8.         for (int i = 0; i < n; i++) {
  9.             arr[i] = scanner.nextInt();
  10.         }
  11.         Arrays.sort(arr);
  12.         int res = 0;
  13.         int target = 0;
  14.         for (int i = arr.length - 1; i > 1; i--) {
  15.             target = arr[i];
  16.             for (int left = 0, right = i; left < right;) {
  17.                 int sum =  arr[left] + arr[right];
  18.                 if (sum < target) {
  19.                     left++;
  20.                 } else if (sum > target) {
  21.                     right--;
  22.                 } else {
  23.                     res++;
  24.                     break;
  25.                 }
  26.             }
  27.         }
  28.         System.out.println(res);
  29.     }
  30. }

 

持续更新中……

 

 

 

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/酷酷是懒虫/article/detail/877735?site
推荐阅读
相关标签

Copyright © 2003-2013 www.wpsshop.cn 版权所有，并保留所有权利。

  

闽ICP备14008679号