星火第九周算法

一、骑车与走路

import java.util.*;
public class Main{
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        int l=sc.nextInt();
        double b=50.0,f=0;
        b+=l/3.0;
        f+=l/1.2;
        if(b>f){
            System.out.println("Walk");
        }else if(b<f){
            System.out.println("Bike");
        }else{
            System.out.println("All");
        }
    }
}

二、计算矩阵边缘元素之和

import java.util.*;
public class Main{
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        int m=sc.nextInt();
        int n=sc.nextInt();
        int num=0;
        int[][] arr=new int[m][n];
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                arr[i][j]=sc.nextInt();
                if(i==0||i==m-1||j==0||j==n-1){
                    num+=arr[i][j];
                }
            }
        }
        System.out.print(num);
    }
}

三、[NOIP2001 普及组] 最大公约数和最小公倍数问题

import java.util.Scanner;
public class Main{
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        int x0=sc.nextInt();
        int y0=sc.nextInt();
        int num=0;
        for(int i=x0;i<=y0;i+=x0){
            if((x0*y0)%i==0&&gcd(i,(x0*y0)/i)==x0){
                num++;
                
            }
        }
        System.out.println(num);
    }
    public static int gcd(int a,int b){
        int min=a<b?a:b;
        for(int i=min;i>0;i--){
            if(a%i==0&&b%i==0){
                return i;
            }
        }
        return 0;
    }
}

四、USACO05MAR]Yogurt factory 机器工厂

import java.util.Scanner;

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

五、进击的奶牛

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    static int[] arr;
    static int a,n,c;
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int num=0;
        n=sc.nextInt();
        c=sc.nextInt();
        arr=new int[n];
        for (int i=0;i<n;i++){
            arr[i]=sc.nextInt();
        }
        Arrays.sort(arr);
        a=n-c;
        int l=0,r=arr[n-1]-arr[0];
        while (l+1<r){
            int mid=l+r>>1;
            if(mess(mid)) l=mid;
            else r=mid;
        }
        if (mess(r)) System.out.println(r);
        else System.out.println(l);
    }
    public static boolean mess(int x){
        int num=0;
        int l=arr[0];
        for (int i=1;i<n;i++){
            if(arr[i]-l<x) num++;
            else l=arr[i];
            if (num>a) return false;
        }
        return true;
    }
}