一.P57191.创建输入对象读取数据Scanner scannew Scanner(System.in)int nscan.nextInt()int kscan.nextInt()2.创建个数与总和的初始值int s10;int s20;double c10;double c20;使用double可以保留小数3.遍历数组n寻找可以整除k的A类for(int i1;in;i){if(i%k0){s1;c1i;}else{s2;c2i;4.格式化输出printf 与%.1f在这里插入代码片importjava.util.Scanner;publicclassopp{publicstaticvoidmain(String[]args){ScannerscannewScanner(System.in);intnscan.nextInt();intkscan.nextInt();ints10;ints20;doublec10;doublec20;for(inti1;in;i){if(i%k0){s1;c1i;}else{s2;c2i;}}System.out.printf(%.1f %.1f,c1/s1,c2/s2);}}二.P10471.创建输入对象读取数据2.创建数组数组下标对应马路坐标int[]anew int[l1]3.循环m次处理每一个区间将区间【uv】所有位置标记为1代表移走的树木for(int i0;im;i){int uscan.nextInt();//起点int vscan.nextInt();//终点for(int ju;jv;j){a[j]1;}}4.遍历全部位置并统计在这里插入代码片importjava.util.Scanner;publicclassapple{publicstaticvoidmain(String[]args){ScannerscannewScanner(System.in);intlscan.nextInt();intmscan.nextInt();//创建数组数组下标对应马路坐标int[]anewint[l1];//循环m次处理每一个区间for(inti0;im;i){intuscan.nextInt();//起点intvscan.nextInt();//终点//将区间[u,v]所有位置标记为1代表树木被移走for(intju;jv;j){a[j]1;}}inttotall1;intsum0;//遍历全部位置统计被移的树木for(inti0;i1;i){if(a[i]1){sum;}}System.out.println(total-sum);}}
