第十四届蓝桥杯冲刺31天打卡day18

最新推荐文章于 2024-09-15 19:46:31 发布

Devoted～

最新推荐文章于 2024-09-15 19:46:31 发布

阅读量114

点赞数 1

文章标签：蓝桥杯 java 算法

本文链接：https://blog.csdn.net/m0_62434747/article/details/129689032

版权

1、排列字母

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        String str ="WHERETHEREISAWILLTHEREISAWAY";
        char[]s = str.toCharArray();
        Arrays.sort(s);
        for(char c:s){
          System.out.print(c);
        }
    }
}

2、GCD

import java.util.*;
import java.io.*;
public class gcd {
  static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
  static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    public static void main(String[] args)throws IOException {
        String[]s = in.readLine().split(" ");
        long a = Long.parseLong(s[0]);
        long b = Long.parseLong(s[1]);
        long maxgcd = Math.abs(a-b);
        if(a%b==0){
          out.println(0);
          in.close();
          out.flush();
          return;
        }
        else{
          System.out.println(maxgcd-(a%maxgcd));
          in.close();
          out.flush();
        }
    }
}

3、选数异或

只会暴力了目前40%

import java.util.*;
import java.io.*;
public class 选数异或 {
  static boolean flag = false;
  static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
  static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    public static void main(String[] args)throws IOException {
        String[]s = in.readLine().split(" ");
        int n = Integer.parseInt(s[0]);
        int m = Integer.parseInt(s[1]);
        long x = Long.parseLong(s[2]);
        long []a = new long[n+1];
        s = in.readLine().split(" ");
        for(int i=1;i<=n;i++){
          a[i]=Long.parseLong(s[i-1]);
        }

        for(int i=0;i<m;i++){
          s = in.readLine().split(" ");
          int l = Integer.parseInt(s[0]);
          int r = Integer.parseInt(s[1]);
          flag = false;
          for(int p=l;p<r;p++){
            for(int j = p+1;j<=r;j++){
              if((a[p]^a[j])==x){
                System.out.println("yes");
                flag = true;
                break;

              }
              }
            if(flag){
                break;
            }

          }
          if(flag==false){
            System.out.println("no");
          }

        }
        in.close();
        out.flush();
    }
}

4、背包与魔法