ZZULIOJ JAVA T1040-T1049

关注

原创最新推荐文章于 2026-03-24 17:39:03 发布 697 阅读 AI 写同款· GEO 优化 ›

【ZZULIOJ】1049: 平方和与立方和 ZZULIOJ题解 1049: 平方和与立方和题目描述给定两个整数m和n，求出m~n这段连续的整数中所有偶数的平方和以及所有奇数的立方和。输入由两个整数m和n组成，你可以假定m<=n. 输出应包括两个整数x和y，分别表示该段连续的整数中所有偶数的平方和以及所有奇数的立方和。32位整数足以保存结果。样例输入 2 5 样例输出 20 152 本题是对循环语句的考察，依旧是结合条件语句进行考察问题，通过判断来实现对于奇数和偶数的处理就可了。代码 #include< 阅读详情

ZZULIOJ JAVA T1040-T1049

T1040

import java.util.Scanner;

public class T1040 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int x = in.nextInt();
		in.close();
		double sum =0.0;
		int t =1;
		for(int i=1; i<=x;i++) {
			
			sum += 1.0/t;
			t  +=2;
		}
		System.out.printf("%.2f", sum);

	}

}

T1041

import java.util.Scanner;

public class T1041 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int x = in.nextInt();
		in.close();
		double sum =0.0;
		int t =1;
		int f =1;
		for(int i=1; i<=x;i++) {
			
			sum += 1.0*f/t;
			f = -f;
			t  +=2;
		}
		System.out.printf("%.2f", sum);

	}

}

T1042

import java.util.Scanner;

public class T1042 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int x = in.nextInt();
		in.close();
		double sum =0.0;
		double d = 1;
		double t =1;
		double f =1;
		for(int i=1; i<=x;i++) {
			
			sum += d*f/t;
			d++;
			f = -f;
			t  +=2;
		}
		System.out.printf("%.3f", sum);


	}

}

T1043

import java.util.Scanner;

public class T1043 {


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

	}

}

T1044

import java.util.Scanner;

public class T1044 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int x = in.nextInt();
		int a[] = new int[x];
		for(int i =0;i<x;i++)
			a[i] = in.nextInt();
		in.close();
		int t=0;
		for(int i=0;i<a.length;i++) {
			if(a[i]<60)
				t++;
		}
		System.out.printf("%.2f", t*1.0/x);
			

	}

}

T1045

import java.util.Scanner;

public class T1045 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int x = in.nextInt();
		int n[]  =new int[x];
		int a=0 , b=0 ,c=0;
		for(int i=0; i<n.length;i++) {
			n[i] = in.nextInt();
			
			if(n[i]<0)
				a++;
			else if(n[i]==0)
				b++;
			else 
				c++;
				
		}
		in.close();
		System.out.println(a+" "+b+" "+c);

	}

}

T1046

import java.util.Scanner;

public class T1046 {

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

	}

}

T1047

import java.util.Scanner;

public class T1047 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int x = in.nextInt();
		int y = in.nextInt();
		in.close();
		for(int i = x;i<=y;i++) {
			System.out.printf("%4d%8.4f\n",i,Math.log(i) );
		}

	}

}

T1048

import java.util.Scanner;

public class T1048 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int x = in.nextInt();
		long  t =1;
	
		in.close();
		for(int i = 1;i<=x;i++) {
			t = t*i;
			System.out.printf("%-4d%-20d\n",i,t );
		}

	}

}

T1049

import java.util.Scanner;

public class T1049 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int x = in.nextInt();
		int y = in.nextInt();	
		int b=0,c=0;
		for(int i = x;i<=y;i++) {
			
			if(i%2==0)
				b+=Math.pow(i, 2);
			else
				c+=Math.pow(i, 3);
		}
		in.close();
		System.out.println(b+" "+c);

	}

}