蓝桥杯2017年真题
package 真题;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;
public class Test2017 {
static int len(int x){
if(x<10) return 1;
return len(x/10)+1;
}
// 取x的第k位数字
static int f(int x, int k){
if(len(x)-k==0) return x%10;
return (int) ((x/Math.pow(10,len(x)-k))%10); //填空
}
public static void main(String[] args)
{
int x = 123456;
System.out.println(len(x));
System.out.println(f(x,4));
}
static int f(String s1, String s2)
{
char[] c1 = s1.toCharArray();
char[] c2 = s2.toCharArray();
int[][] a = new int[c1.length+1][c2.length+1];
int max = 0;
for(int i=1; i<a.length; i++){
for(int j=1; j<a[i].length; j++){
if(c1[i-1]==c2[j-1]) {
a[i][j] = 1+a[i-1][j-1]; //填空
System.out.println(a[i][j]);
if(a[i][j] > max) max = a[i][j];
}
}
}
return max;
}
public static void main(String[] args){
int n = f("abcdkkk", "baabcdadabc");
System.out.println(n);
}
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int k=sc.nextInt();
int arr1[]=new int[2];
int arr2[]=new int[2];
for(int i=0;i<2;i++) {
arr1[i]=sc.nextInt();
}
for(int i=0;i<2;i++) {
arr2[i]=sc.nextInt();
}
Arrays.sort(arr1);
Arrays.sort(arr2);
List<Integer> list=new ArrayList<>();
int min=arr1[0]<arr2[0]?arr1[0]:arr2[0];
for(int i=1;i<=min;i++) {
int n1=(arr1[0]/i)*(arr1[1]/i);
int n2=(arr2[0]/i)*(arr2[1]/i);
if(n1+n2>=k) {
list.add(i);
}
}
// for(Integer x:set) {
// System.out.println(x);
// }
System.out.println(list.get(list.size()-1));
}
public static void main(String args[]) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int k=sc.nextInt();
int arr[]=new int[n];
for(int i=0;i<n;i++) {
arr[i]=sc.nextInt();
}
int count=0;;
for(int i=0;i<arr.length;i++) {
int sum=0;
for(int j=i;j<arr.length;j++) {
sum=sum+arr[j];
System.out.println(sum);
if(sum%k==0) {
count++;
}
}
}
System.out.println(count);
}
}