java 简单练习

本文解析了多个Java编程竞赛题目,包括水仙花数判断、数列求和、数值统计等,通过具体代码示例展示了如何使用Java解决这些问题。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

第一题,水仙花数

https://vjudge.net/problem/HDU-2010

import java.util.*;
import java.io.*;
import java.lang.*;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		Scanner cin = new Scanner(System.in);
		int[] num = {153,370,371,407};
		while(cin.hasNext())
		{
			int m = cin.nextInt();
			int n = cin.nextInt();
			int flag = 0;
			for(int i = 0;i < 4;i++)
			{
				
				if(num[i] >= m && num[i] <= n)
				{
					if(flag == 0)
						System.out.print(num[i]);
					else
						System.out.print(" "+num[i]);
					flag = 1;
				}
			}
			if(flag == 0)
				System.out.print("no");
			System.out.println("");
		}
		System.gc();

	}

}

hdu 求数列的和

https://vjudge.net/problem/HDU-2009

import java.text.DecimalFormat;
import java.util.*;
import java.math.*;
public class Main {
    public int a;
    public int b;
    public int c;
    Main(){}
    Main(int a,int b,int c)
    {
    	this.a = a;
    	this.c = c;
    	this.b = b;
    }
    public void Print()
    {
    	System.out.println(this.a+" "+this.b+" "+this.c);
    }
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner input = new Scanner(System.in);
		while(input.hasNext())
		{
			int n = input.nextInt();
			int m = input.nextInt();
			double sum = 0;
			double w = n*n;
			for(int i = 0;i < m;i++)
			{
				w = Math.sqrt(w);
				sum += w;

			}
			//p.Print();
			DecimalFormat bf = new DecimalFormat("0.00");
			System.out.println(bf.format(sum));//("%.2lf",sum);
		}
     
	}

}

hdu 数值统计

https://vjudge.net/problem/HDU-2008

import java.util.*;

public class Main {
    public int a;
    public int b;
    public int c;
    Main(){}
    Main(int a,int b,int c)
    {
    	this.a = a;
    	this.c = c;
    	this.b = b;
    }
    public void Print()
    {
    	System.out.println(this.a+" "+this.b+" "+this.c);
    }
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner input = new Scanner(System.in);
		while(input.hasNext())
		{
			int n = input.nextInt();
			if(n == 0)
				break;
			Main p = new Main(0,0,0);
			for(int i = 0;i < n;i++)
			{
				double num = input.nextDouble();
				if(num == 0)
					p.b++;
				else if(num < 0)
					p.a++;
				else
					p.c++;		
			}
			p.Print();
			//System.out.println(ans1+" "+ans);
		}
     
	}

}
hdu   平方和和立方和

https://vjudge.net/problem/HDU-2007

import java.util.*;

public class Main {
    public int Year;
    public int Month;
    public int Day;
    Main(){}
    Main(int a,int b,int c)
    {
    	this.Year = a;
    	this.Day = c;
    	this.Month = b;
    }
   
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner input = new Scanner(System.in);
		while(input.hasNext())
		{
			int m = input.nextInt();
			int n = input.nextInt();
			int ans = 0;
			int ans1 = 0;
			if(m > n)
			{
				int tmp = m;
				m = n;
				n = tmp;
			}
			for(int i = m;i <= n;i++)
			{
				if(i % 2 == 1)
					ans += i*i*i;
				else
					ans1 += i*i;
			}
			System.out.println(ans1+" "+ans);
		}
     
	}

}

hdu 求奇数的乘积

https://vjudge.net/problem/HDU-2006

import java.util.*;

public class Main {
    public int Year;
    public int Month;
    public int Day;
    Main(){}
    Main(int a,int b,int c)
    {
    	this.Year = a;
    	this.Day = c;
    	this.Month = b;
    }
   
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner input = new Scanner(System.in);
		while(input.hasNext())
		{
			int n = input.nextInt();
			int ans = 1;
			for(int i = 0;i < n;i++)
			{
				int num = input.nextInt();
				if(num % 2 == 1)
					ans*=num;
			}
			System.out.println(ans);
		}
     
	}

}

hdu 第几天 

https://vjudge.net/problem/HDU-2005

import java.util.*;

public class Main {
    public int Year;
    public int Month;
    public int Day;
    Main(){}
    Main(int a,int b,int c)
    {
    	this.Year = a;
    	this.Day = c;
    	this.Month = b;
    }
    public void getnum()
    {
    	int day[] = {31,28,31,30,31,30,31,31,30,31,30,31};
    	int ans = 0;
    	for(int i = 0;i < this.Month - 1;i++)
    		ans+=day[i];
    	ans += this.Day;
    	int flag = 0;
    	if(this.Year % 4 == 0 && (this.Year % 100 != 0))
    		flag = 1;
    	if(this.Year % 400 == 0)
    		flag = 1;
    	if(this.Month > 2)
    		ans += flag;
    	System.out.println(ans);
    }
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner input = new Scanner(System.in);
		while(input.hasNext())
		{
			String str1 = input.next();
			
			String[] str = new String[6];
			str = str1.split("/");
			int year = Integer.parseInt(str[0]);
			int month = Integer.parseInt(str[1]);
			int day = Integer.parseInt(str[2]);
			Main p = new Main(year,month,day);
			p.getnum();
			
		}
     
	}

}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值