New Online Judge 1021~1030

1021*：

import java.util.Scanner;
public class Main
{
    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);
        while(scanner.hasNextInt())
        {
           int x=scanner.nextInt();
           int a1=3+x;
           int a2=6+x;
           int a3=20;
           int a4=3;
           int a5=18;
           System.out.println("When x="+x+":");
           System.out.println(a1);
            System.out.println(a2);
            System.out.println(a3);
            System.out.println(a4);
            System.out.println(a5);
            System.out.println();
        }
    }
}

1022*：

import java.util.Arrays;
import java.util.Scanner;
public class Main
{
    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);
        while(scanner.hasNextInt())
        {
          int[] arr =new int [3];
          for(int i=0;i<arr.length;i++)
          {
              arr[i]=scanner.nextInt();
          }
          Arrays.sort(arr);
            for(int i=0;i<arr.length;i++)
            {
                System.out.print(arr[i]+" ");
                System.out.println();
            }
        }
    }
}

1023：

import java.util.Scanner;
public class Main
{
    public static void main(String[] args)
    {
        Scanner in=new Scanner(System.in);
        while(in.hasNextInt())
        {
            int a=in.nextInt();
            if(a<1)
            {
                System.out.println("y = "+a);
            }
            if(a<10&&a>=1)
            {
                int b=a*2-1;
                System.out.println("y = "+b);
            }
            if(a>=10)
            {
                System.out.println("y = "+10);
            }
        }
    }
}

1024：

import java.util.Scanner;
public class Main
{
    public static void main(String[] args)
    {
        Scanner in=new Scanner(System.in);
        while(in.hasNextInt())
        {
            int a=in.nextInt();
            if(a%6==0)
            {
                System.out.print(a+" ");
            }
        }
    }
}

1025：

import java.util.Scanner;
public class Main
{
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);
        while (in.hasNextInt())
        {
            int a = in.nextInt();
            char[] result = {'0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0'};

            int j = result.length - 1;
            if (a < 0)
            {
                int a1 = Math.abs(a);
                String b = Integer.toBinaryString(a1);
                char[] c = b.toCharArray();
                for (int i = c.length - 1; i >= 0; i--)
                {
                    result[j] = c[i];
                    j--;
                }
                result[0] = '1';
                for (int i = 0; i < result.length; i++)
                {
                    System.out.print(result[i]);
                }
                System.out.println();
            }
            else
            {
                String b1 = Integer.toBinaryString(a);
                char[] c = b1.toCharArray();
                for (int i = c.length - 1; i >= 0; i--)
                {
                    result[j] = c[i];
                    j--;
                }
                for (int i = 0; i < result.length; i++)
                {
                    System.out.print(result[i]);
                }
                System.out.println();
            }
        }
    }
}

字符数组默认的0跟数字0不是一回事，手动赋0，进制转换，倒序填充数组

 1026：

import java.util.Arrays;
import java.util.Scanner;
public class Main
{
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);
        int a=in.nextInt();
        int []arr=new int[a];
        while (in.hasNextInt())
        {
            for (int i=0; i<arr.length; i++)
            {
                arr[i]=in.nextInt();
            }
            Arrays.sort(arr);
            for (int i=0; i<arr.length; i++)
            {
                System.out.print(arr[i]+" ");
            }
        }
 
    }
}

1027：

import java.util.Scanner;
public class Main
{
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);
        while (in.hasNextInt())
        {
            int a=in.nextInt();
            int b=in.nextInt();
            int c=in.nextInt();
            if(a+b>c && b+c>a && a+c>b)
            {
                double p=(double)(a+b+c)/2;
                double S=Math.sqrt(p*(p-a)*(p-b)*(p-c));
                System.out.println(String.format("%.2f",S));
            }
            else if(a==0&b==0&c==0)
            {
                System.out.print("");
            }
            else
            {
                System.out.println("No");
            }
        }
    }
}

 else if如果换成if会与下面的else组合成对一起输出

1028*:

import java.util.Scanner;
public class Main
{
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);
        int n=in.nextInt();
        int x1=in.nextInt();
        int y1=in.nextInt();
        int x2=in.nextInt();
        int y2=in.nextInt();
        int []arr=new int[100];
        for (int j : arr)
        {
            arr[j]=1001;
        }
        while (in.hasNextInt())
        {
            for(int i=0; i<arr.length; i++)
            {
                arr[i]=in.nextInt();
                if(arr[0]==1001||arr[1]==1001||arr[2]!=1001)
                {
                    System.out.println();
                }
            }
           
            if(arr[0]>=x1&&arr[0]<=x2&&arr[1]>=y1&&arr[1]<=y2)
            {
                System.out.println("YES");
            }
            else
            {
                System.out.println("NO");
            }
            
        }
    }
}

答案不对，被输入输出难住了

1029*：

import java.util.Scanner;
public class Main
{
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);
        while (in.hasNextInt())
        {
            int x1 = in.nextInt();
            int y1 = in.nextInt();
            int x2 = in.nextInt();
            int y2 = in.nextInt();
            int x3 = in.nextInt();
            int y3 = in.nextInt();
            double a1= (double) x1/y1;
            double a2= (double) x2/y2;
            double a3= (double) x3/y3;
            if (x1 == x2 && x2 == x3 || y1 == y2 && y2 == y3||a1 == a2 && a2 == a3)
            {
                System.out.println("Collineation");
            }
            if (x2 > x3)
            {
                System.out.println("Anticlockwise");
            }
            if (x2 < x3)
            {
                System.out.println("Clockwise");
            }
        }
    }
}

代码不完全对，还要判断第一个点是否在第2,3点所连直线的上面

1030*：

跟上面一样的直线判断位置，靠了代码真不会

思路：在第一个线段的x1和x2范围内，判断第二个线段的两个点有没有在第一条线段上面的点（只有一个点在上面就是相交），两个都在上面就是不相交