ZZULIOJ JAVA T1080-T1089

T1080

import java.util.Scanner;

public class T1080 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in =new Scanner(System.in);
		
		while(in.hasNext()) {
			int a=in.nextInt();
			int b=in.nextInt();
			if(a==0||b==0)
				break;
			System.out.println(a+b);
		}
		in.close();

	}

}

T1081

import java.util.Scanner;
 
public class T1081 {
    public static void main(String args[]) {
 
 
        Scanner in = new Scanner(System.in);
 
        int n=in.nextInt();
 
        int sum=0;
        int[] arr=new int[n];
        for(int i=0;i<n;i++){
 
            int m=in.nextInt();
            for (int j=0;j<m;j++){
                int x=in.nextInt();
                sum+=x;
 
            }
            arr[i]=sum;
            sum=0;  
        }
 
       for (int z=0;z<arr.length;z++){
           System.out.println(arr[z]);
       }
       in.close();
 
    }
 
}

T1082

import java.util.Scanner;

public class T1082 {
	public static int[] ints(int ints[]) {
		
		for(int i=0;i<ints.length-1;i++) {
			ints[i+1]+=ints[i]/10;
			ints[i]%=10;
		}
		return ints;
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in =new Scanner(System.in);
		int n=in.nextInt();
		for(int i=0;i<n;i++) {
			int a=in.nextInt();
			for(int j=1;j<=a;j++) {
				if(j%7==0)
					System.out.print(j+" ");
				else {
					int x[]= new int [5];
					x[0]=j;
					x=ints(x);
					for(int z=0;z<x.length;z++)
						if(x[z]==7)
							System.out.print(j+" ");
				}
					
				
			}
			System.out.println();
		}
		in.close();

	}

}

T1083

import java.util.Scanner;

public class T1083 {

	public static void main(String[] args) {
		// TODO 自动生成的方法存根
		Scanner in =new Scanner(System.in);
		while(!in.hasNext("0")) {
			int n=in.nextInt();
			double[] arr=new double [n];
			for(int i=0;i<n;i++) {
				arr[i]=in.nextDouble();
			}
			int a=0,b=0,c=0;
			for(double d:arr)
				if(d<0)
					a++;
				else if(d==0)
					b++;
				else
					c++;
			System.out.println(a+" "+b+" "+c);
		}
		in.close();

	}

}

T1084

import java.util.Scanner;

public class T1084 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		double x1, x2, y1, y2;
		Scanner in = new Scanner(System.in);
		while(in.hasNext()) {
			x1 = in.nextDouble();
			y1 = in.nextDouble();
			x2 = in.nextDouble();
			y2 = in.nextDouble();
		
			double x;
			x = Math.pow(x1-x2, 2) + Math.pow(y1-y2, 2);
			double j = Math.sqrt(x);
			System.out.printf("%.2f\n",j);

		}
		in.close();
		
	}

}

T1085

import java.util.Scanner;

public class T1085 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		while(in.hasNext()) {
			int a =1;
			int x = in.nextInt();
			
			for(int i=0; i<x;i++) {
			int	b = in.nextInt();
				if(b%2!=0)
					a*=b;
			}
		
			System.out.println(a);
		}
		in.close();

	}

}

T1086

import java.util.*;
public class T1086 {
 
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc=new Scanner(System.in);
		String str;
		char[] ch=new char[3];
		char t;
		while(sc.hasNext())
		{
			str=sc.next();
			for(int k=0;k<3;k++)
				ch[k]=str.charAt(k);
			for(int i=0;i<3;i++)
			{
				for(int j=i+1;j<3;j++)
				{
					if(ch[i]>ch[j])
					{
						t=ch[i];
						ch[i]=ch[j];
						ch[j]=t;
					}
				}
			}
			System.out.println(ch[0]+" "+ch[1]+" "+ch[2]);
		}
		sc.close();
	}
 
}

T1087

import java.util.Scanner;

public class T1087 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in =new Scanner(System.in);
		int n=in.nextInt();
		for(int i=0;i<n;i++) {
			String s=in.next();
			String s1=s.substring(6, 10);
			String s2=s.substring(10, 12);
			String s3=s.substring(12,14);
			System.out.println(s1+"-"+s2+"-"+s3);
		}
		in.close();
	}

}

T1088

import java.util.Scanner;

public class T1088 {

	public static void main(String[] args) {
		// TODO 自动生成的方法存根
		Scanner in =new Scanner(System.in);
		int n=in.nextInt();
		for(int i=0;i<n;i++) {
			String s=in.next();
			String s1="6"+s.substring(6);
			System.out.println(s1);
		}
		in.close();

	}

}

T1089

import java.util.Scanner;

public class T1089 {
	public static int[] ints(int[] ints,int n) {
		for(int i=0;i<ints.length;i++)
			ints[i]*=n;
		for(int i=ints.length-1;i>0;i--) {
			ints[i-1]+=ints[i]/10;
			ints[i]%=10;
		}
		return ints;
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in =new Scanner(System.in);
		int n=in.nextInt();
		in.close();
		int a[]=new int[10000];
		a[a.length-1]=1;	
		for(int i=1;i<=n;i++) {
			a=ints(a, i);
		}
		for(int i=0;i<a.length;i++)
			if(a[i]!=0) {
				System.out.print(a[i]);
				break;
			}
	}

}
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值