P5735 【深基7.例1】距离函数

  1. import java.util.Scanner;
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc = new Scanner(System.in);
  6.         double x1,y1,x2,y2,x3,y3;
  7.         x1 = sc.nextDouble();
  8.         y1 = sc.nextDouble();
  9.         x2 = sc.nextDouble();
  10.         y2 = sc.nextDouble();
  11.         x3 = sc.nextDouble();
  12.         y3 = sc.nextDouble();
  13.         double sum = 0;
  14.         sum += distance(x1,y1,x2,y2);
  15.         sum += distance(x1,y1,x3,y3);
  16.         sum += distance(x2,y2,x3,y3);
  17.         System.out.printf("%.2f",sum);
  18.     }
  20.     public static double distance(double x1,double y1,double x2,double y2){
  21.         return Math.sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2));
  22.     }
  23. }

P5736 【深基7.例2】质数筛

  1. import java.util.Scanner;
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc = new Scanner(System.in);
  6.         int n = sc.nextInt();
  7.         int[] a = new int[n];
  8.         for (int i = 0; i < n; i++) {
  9.             a[i] = sc.nextInt();
  10.         }
  11.         for (int i : a) {
  12.             if(isPrime(i)){
  13.                 System.out.print(i+" ");
  14.             }
  15.         }
  16.     }
  18.     public static boolean isPrime(int n){
  19.         if(n < 2){
  20.             return false;
  21.         }
  22.         for (int i = 2; i <= Math.sqrt(n); i++) {
  23.             if(n%i==0){
  24.                 return false;
  25.             }
  26.         }
  27.         return true;
  28.     }
  29. }

P5737 【深基7.例3】闰年展示

  1. import java.util.ArrayList;
  2. import java.util.List;
  3. import java.util.Scanner;
  5. public class Main {
  6.     public static void main(String[] args) {
  7.         Scanner sc = new Scanner(System.in);
  8.         int begin = sc.nextInt();
  9.         int end = sc.nextInt();
  10.         List<Integer> list = new ArrayList<>();
  11.         for (int i = begin; i <= end; i++) {
  12.             if(isRun(i)){
  13.                 list.add(i);
  14.             }
  15.         }
  16.         System.out.println(list.size());
  17.         for (Integer i : list) {
  18.             System.out.print(i+" ");
  19.         }
  20.     }
  22.     public static boolean isRun(int year){
  23.         if((year%4==0 && year%100!=0) || year%400 == 0){
  24.             return true;
  25.         }
  26.         return false;
  27.     }
  28. }

P5738 【深基7.例4】歌唱比赛

  1. import java.util.ArrayList;
  2. import java.util.Comparator;
  3. import java.util.List;
  4. import java.util.Scanner;
  6. public class Main {
  7.     public static void main(String[] args) {
  8.         Scanner sc = new Scanner(System.in);
  9.         List<Double> list = new ArrayList<>();
  10.         int n = sc.nextInt();
  11.         int m = sc.nextInt();
  12.         for (int i = 0; i < n; i++) {
  13.             double sum = 0;
  14.             List<Double> score = new ArrayList<>();
  15.             for (int j = 0; j < m; j++) {
  16.                 score.add(sc.nextDouble());
  17.             }
  18.             score.sort(Comparator.naturalOrder());
  19.             for (int j = 1; j < score.size()-1; j++) {
  20.                 sum += score.get(j);
  21.             }
  22.             list.add(sum/(score.size()-2));
  23.         }
  24.         list.sort(Comparator.naturalOrder());
  25.         System.out.printf("%.2f",list.get(list.size()-1));
  26.     }
  27. }

P5739 【深基7.例7】计算阶乘

  1. import java.util.Scanner;
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc = new Scanner(System.in);
  6.         int n = sc.nextInt();
  7.         System.out.println(cal(n));
  8.     }
  10.     public static int cal(int n){
  11.         if(n==1){
  12.             return 1;
  13.         }
  14.         n *= cal(n-1);
  15.         return n;
  16.     }
  17. }

P5461 赦免战俘

  1. import java.io.BufferedWriter;
  2. import java.io.OutputStreamWriter;
  3. import java.io.PrintWriter;
  4. import java.util.Scanner;
  6. public class Main {
  7.     public static void main(String[] args) {
  8.         Scanner sc = new Scanner(System.in);
  9.         PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
  10.         int n = sc.nextInt();
  11.         int[][] t = new int [(int) Math.pow(2, n)][(int) Math.pow(2, n)];
  12.         t[0][0] = 1;
  13.         t[0][1] = 1;
  14.         t[1][0] = 1;
  15.         t[1][1] = 0;
  16.         for(int i=1; i<n; i++) {
  17.             //右上角
  18.             for(int j=0; j<(int)Math.pow(2, i); j++) {
  19.                 for(int k=(int)Math.pow(2, i); k<(int)Math.pow(2, i+1); k++) {
  20.                     t[j][k] = t[j][k-(int)Math.pow(2, i)];
  21.                 }
  22.             }
  23.             //左下角
  24.             for(int j=(int)Math.pow(2, i); j<(int)Math.pow(2, i+1); j++) {
  25.                 for(int k=0; k<(int)Math.pow(2, i); k++) {
  26.                     t[j][k] = t[j-(int)Math.pow(2, i)][k];
  27.                 }
  28.             }
  29.             //右下角
  30.             for(int j=(int)Math.pow(2, i); j<(int)Math.pow(2, i+1); j++) {
  31.                 for(int k=(int)Math.pow(2, i); k<(int)Math.pow(2, i+1); k++) {
  32.                     t[j][k] = 0;
  33.                 }
  34.             }
  35.         }
  36.         //输出
  37.         for(int i=(int) Math.pow(2, n)-1; i>=0; i--) {
  38.             for(int j=(int) Math.pow(2, n)-1; j>=0; j--) {
  39.                 pw.print(t[i][j]+" ");
  40.             }
  41.             pw.println();
  42.         }
  43.         pw.flush();
  44.     }
  45. }

P5740 【深基7.例9】最厉害的学生

  1. import java.util.LinkedHashMap;
  2. import java.util.Scanner;
  4. public class Main {
  5.     public static void main(String[] args) {
  6.         Scanner sc = new Scanner(System.in);
  7.         int n = sc.nextInt();
  8.         //用LinkedHashMap是因为按照插入顺序和迭代顺序一致
  9.         LinkedHashMap<String,Score> map = new LinkedHashMap<>();
  10.         for (int i = 0; i < n; i++) {
  11.             String name = sc.next();
  12.             Score score = new Score();
  13.             score.yw = sc.nextInt();
  14.             score.sx = sc.nextInt();
  15.             score.yy = sc.nextInt();
  16.             map.put(name,score);
  17.         }
  18.         int max = 0;
  19.         String result = null;
  20.         Score finalScore = null;
  21.         for(String s : map.keySet()){
  22.             if(map.get(s).calSum()>max){
  23.                 finalScore = map.get(s);
  24.                 result = s;
  25.                 max = finalScore.calSum();
  26.             }
  27.         }
  28.         if(finalScore!=null){
  29.             System.out.println(result + " " + finalScore.yw + " " + finalScore.sx + " " + finalScore.yy);
  30.         }else{
  31.             //第一个检查点(全是0分的数据),打印第一个同学就行
  32.             System.out.println(map.keySet().iterator().next() + " 0 0 0");
  33.         }
  34.     }
  36.     static class Score{
  37.         int yw;
  38.         int sx;
  39.         int yy;
  40.         public int calSum(){
  41.             return yw+sx+yy;
  42.         }
  43.     }
  44. }

P5741 【深基7.例10】旗鼓相当的对手 - 加强版

  1. import java.util.ArrayList;
  2. import java.util.List;
  3. import java.util.Scanner;
  5. public class Main {
  6.     public static void main(String[] args) {
  7.         Scanner sc= new Scanner(System.in);
  8.         int n = sc.nextInt();
  9.         List<Student> list = new ArrayList<>();
  10.         for (int i = 0; i < n; i++) {
  11.             list.add(new Student(sc.next(),sc.nextInt(),sc.nextInt(),sc.nextInt()));
  12.         }
  13.         for (int i = 0; i < list.size()-1; i++) {
  14.             for (int j = i+1; j < list.size(); j++) {
  15.                 if(isRival(list.get(i),list.get(j))){
  16.                     System.out.println(list.get(i).name + " " + list.get(j).name);
  17.                 }
  18.             }
  19.         }
  20.     }
  22.     public static boolean isRival(Student s1, Student s2){
  23.         return Math.abs(s1.sum() - s2.sum()) <= 10 && Math.abs(s1.chinese - s2.chinese) <= 5
  24.                 && Math.abs(s1.math - s2.math) <= 5 && Math.abs(s1.english - s2.english) <= 5;
  25.     }
  27.     static class Student{
  28.         String name;
  29.         int chinese;
  30.         int math;
  31.         int english;
  32.         public Student(String name, int chinese, int math, int english) {
  33.             this.name = name;
  34.             this.chinese = chinese;
  35.             this.math = math;
  36.             this.english = english;
  37.         }
  38.         public int sum(){
  39.             return chinese+math+english;
  40.         }
  41.     }
  42. }

P5742 【深基7.例11】评等级

  1. import java.util.Scanner;
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc= new Scanner(System.in);
  6.         int n = sc.nextInt();
  7.         for (int i = 0; i < n; i++) {
  8.             Student s = new Student(sc.nextInt(),sc.nextDouble(),sc.nextDouble());
  9.             s.sum = s.exam*0.7 + s.fitness*0.3;
  10.             check(s);
  11.         }
  12.     }
  14.     public static void check(Student s){
  15.         if(s.plusExamFitness()>140 && s.sum>=80){
  16.             System.out.println("Excellent");
  17.         }else {
  18.             System.out.println("Not excellent");
  19.         }
  20.     }
  22.     static class Student{
  23.         int num;
  24.         double exam;
  25.         double fitness;
  26.         double sum;
  28.         public Student(int num, double exam, double fitness) {
  29.             this.num = num;
  30.             this.exam = exam;
  31.             this.fitness = fitness;
  32.         }
  34.         public double plusExamFitness(){
  35.             return exam+fitness;
  36.         }
  37.     }
  38. }

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

  1. import java.util.Scanner;
  3. public class Main {
  5.     public static void main(String[] args) {
  6.         Scanner sc = new Scanner(System.in);
  7.         int n = sc.nextInt();
  8.         int max = 2;
  9.         for (int i = 2; i <= n/2; i++) {
  10.             if(n%i == 0){
  11.                 System.out.println(n/i);
  12.                 return;
  13.             }
  14.         }
  15.     }
  16. }

P1304 哥德巴赫猜想

  1. import java.util.Scanner;
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc= new Scanner(System.in);
  6.         int n = sc.nextInt();
  7.         for (int i = 4; i <= n ; i+=2) {
  8.             check(i);
  9.         }
  10.     }
  12.     public static void check(int n){
  13.         for (int i = 2; i <= n-2; i++) {
  14.             if(isPrime(i) && isPrime(n-i)){
  15.                 System.out.println(n+"="+i+"+"+(n-i));
  16.                 break;
  17.             }
  18.         }
  19.     }
  20.     public static boolean isPrime(int n){
  21.         if(n<2){
  22.             return false;
  23.         }
  24.         for (int i = 2; i <= n-1 ; i++) {
  25.             if(n%i==0){
  26.                 return false;
  27.             }
  28.         }
  29.         return true;
  30.     }
  31. }

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

  1. import java.util.Scanner;
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc = new Scanner(System.in);
  6.         int a = sc.nextInt();
  7.         int b = sc.nextInt();
  8.         int[] arr={5,7,11,101,131,151,181,191,313,353,373,383,727,757,787,797,919,929,10301,10501,10601,11311,11411,12421,12721,12821,13331,13831,13931,14341,14741,15451,15551,16061,16361,16561,16661,17471,17971,18181,18481,19391,19891,19991,30103,30203,30403,30703,30803,31013,31513,32323,32423,33533,34543,34843,35053,35153,35353,35753,36263,36563,37273,37573,38083,38183,38783,39293,70207,70507,70607,71317,71917,72227,72727,73037,73237,73637,74047,74747,75557,76367,76667,77377,77477,77977,78487,78787,78887,79397,79697,79997,90709,91019,93139,93239,93739,94049,94349,94649,94849,94949,95959,96269,96469,96769,97379,97579,97879,98389,98689,1003001,1008001,1022201,1028201,1035301,1043401,1055501,1062601,1065601,1074701,1082801,1085801,1092901,1093901,1114111,1117111,1120211,1123211,1126211,1129211,1134311,1145411,1150511,1153511,1160611,1163611,1175711,1177711,1178711,1180811,1183811,1186811,1190911,1193911,1196911,1201021,1208021,1212121,1215121,1218121,1221221,1235321,1242421,1243421,1245421,1250521,1253521,1257521,1262621,1268621,1273721,1276721,1278721,1280821,1281821,1286821,1287821,1300031,1303031,1311131,1317131,1327231,1328231,1333331,1335331,1338331,1343431,1360631,1362631,1363631,1371731,1374731,1390931,1407041,1409041,1411141,1412141,1422241,1437341,1444441,1447441,1452541,1456541,1461641,1463641,1464641,1469641,1486841,1489841,1490941,1496941,1508051,1513151,1520251,1532351,1535351,1542451,1548451,1550551,1551551,1556551,1557551,1565651,1572751,1579751,1580851,1583851,1589851,1594951,1597951,1598951,1600061,1609061,1611161,1616161,1628261,1630361,1633361,1640461,1643461,1646461,1654561,1657561,1658561,1660661,1670761,1684861,1685861,1688861,1695961,1703071,1707071,1712171,1714171,1730371,1734371,1737371,1748471,1755571,1761671,1764671,1777771,1793971,1802081,1805081,1820281,1823281,1824281,1826281,1829281,1831381,1832381,1842481,1851581,1853581,1856581,1865681,1876781,1878781,1879781,1880881,1881881,1883881,1884881,1895981,1903091,1908091,1909091,1917191,1924291,1930391,1936391,1941491,1951591,1952591,1957591,1958591,1963691,1968691,1969691,1970791,1976791,1981891,1982891,1984891,1987891,1988891,1993991,1995991,1998991,3001003,3002003,3007003,3016103,3026203,3064603,3065603,3072703,3073703,3075703,3083803,3089803,3091903,3095903,3103013,3106013,3127213,3135313,3140413,3155513,3158513,3160613,3166613,3181813,3187813,3193913,3196913,3198913,3211123,3212123,3218123,3222223,3223223,3228223,3233323,3236323,3241423,3245423,3252523,3256523,3258523,3260623,3267623,3272723,3283823,3285823,3286823,3288823,3291923,3293923,3304033,3305033,3307033,3310133,3315133,3319133,3321233,3329233,3331333,3337333,3343433,3353533,3362633,3364633,3365633,3368633,3380833,3391933,3392933,3400043,3411143,3417143,3424243,3425243,3427243,3439343,3441443,3443443,3444443,3447443,3449443,3452543,3460643,3466643,3470743,3479743,3485843,3487843,3503053,3515153,3517153,3528253,3541453,3553553,3558553,3563653,3569653,3586853,3589853,3590953,3591953,3594953,3601063,3607063,3618163,3621263,3627263,3635363,3643463,3646463,3670763,3673763,3680863,3689863,3698963,3708073,3709073,3716173,3717173,3721273,3722273,3728273,3732373,3743473,3746473,3762673,3763673,3765673,3768673,3769673,3773773,3774773,3781873,3784873,3792973,3793973,3799973,3804083,3806083,3812183,3814183,3826283,3829283,3836383,3842483,3853583,3858583,3863683,3864683,3867683,3869683,3871783,3878783,3893983,3899983,3913193,3916193,3918193,3924293,3927293,3931393,3938393,3942493,3946493,3948493,3964693,3970793,3983893,3991993,3994993,3997993,3998993,7014107,7035307,7036307,7041407,7046407,7057507,7065607,7069607,7073707,7079707,7082807,7084807,7087807,7093907,7096907,7100017,7114117,7115117,7118117,7129217,7134317,7136317,7141417,7145417,7155517,7156517,7158517,7159517,7177717,7190917,7194917,7215127,7226227,7246427,7249427,7250527,7256527,7257527,7261627,7267627,7276727,7278727,7291927,7300037,7302037,7310137,7314137,7324237,7327237,7347437,7352537,7354537,7362637,7365637,7381837,7388837,7392937,7401047,7403047,7409047,7415147,7434347,7436347,7439347,7452547,7461647,7466647,7472747,7475747,7485847,7486847,7489847,7493947,7507057,7508057,7518157,7519157,7521257,7527257,7540457,7562657,7564657,7576757,7586857,7592957,7594957,7600067,7611167,7619167,7622267,7630367,7632367,7644467,7654567,7662667,7665667,7666667,7668667,7669667,7674767,7681867,7690967,7693967,7696967,7715177,7718177,7722277,7729277,7733377,7742477,7747477,7750577,7758577,7764677,7772777,7774777,7778777,7782877,7783877,7791977,7794977,7807087,7819187,7820287,7821287,7831387,7832387,7838387,7843487,7850587,7856587,7865687,7867687,7868687,7873787,7884887,7891987,7897987,7913197,7916197,7930397,7933397,7935397,7938397,7941497,7943497,7949497,7957597,7958597,7960697,7977797,7984897,7985897,7987897,7996997,9002009,9015109,9024209,9037309,9042409,9043409,9045409,9046409,9049409,9067609,9073709,9076709,9078709,9091909,9095909,9103019,9109019,9110119,9127219,9128219,9136319,9149419,9169619,9173719,9174719,9179719,9185819,9196919,9199919,9200029,9209029,9212129,9217129,9222229,9223229,9230329,9231329,9255529,9269629,9271729,9277729,9280829,9286829,9289829,9318139,9320239,9324239,9329239,9332339,9338339,9351539,9357539,9375739,9384839,9397939,9400049,9414149,9419149,9433349,9439349,9440449,9446449,9451549,9470749,9477749,9492949,9493949,9495949,9504059,9514159,9526259,9529259,9547459,9556559,9558559,9561659,9577759,9583859,9585859,9586859,9601069,9602069,9604069,9610169,9620269,9624269,9626269,9632369,9634369,9645469,9650569,9657569,9670769,9686869,9700079,9709079,9711179,9714179,9724279,9727279,9732379,9733379,9743479,9749479,9752579,9754579,9758579,9762679,9770779,9776779,9779779,9781879,9782879,9787879,9788879,9795979,9801089,9807089,9809089,9817189,9818189,9820289,9822289,9836389,9837389,9845489,9852589,9871789,9888889,9889889,9896989,9902099,9907099,9908099,9916199,9918199,9919199,9921299,9923299,9926299,9927299,9931399,9932399,9935399,9938399,9957599,9965699,9978799,9980899,9981899,9989899};
  9.         int i = 0;
  10.         while(i<779){
  11.             if(arr[i]>=a && arr[i]<=b){
  12.                 System.out.println(arr[i]);
  13.             }
  14.             i++;
  15.         }
  16.     }
  17. }

P2415 集合求和

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] ss = sc.nextLine().split(" ");
        double sum = 0;
        for (String s : ss) {
            sum += Double.parseDouble(s);
        }
        //n个子集的和 = 元素和 * 2的n-1次方
        double result = sum*Math.pow(2,ss.length-1);
        System.out.printf("%.0f",result);
    }
}

P5743 【深基7.习8】猴子吃桃

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int sum = 1;
        for (int i = 0; i < n-1; i++) {
            sum = (sum+1)*2;
        }
        System.out.println(sum);
    }
}

P5744 【深基7.习9】培训

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        for (int i = 0; i < n; i++) {
            Student s = new Student(sc.next(), sc.nextInt(), sc.nextInt());
            s.train();
            System.out.print(s.name + " " + s.age);
            System.out.printf(" %.0f",s.score);
            System.out.println();
        }
    }

    static class Student{
        String name;
        int age;
        double score;

        public Student(String name, int age, int score) {
            this.name = name;
            this.age = age;
            this.score = score;
        }

        public void train(){
            age++;
            double up = score*0.2;
            if((score+up)>=600){
                score = 600;
            }else {
                score = score+up;
            }
        }
    }
}