HUD 2000~2022

最新推荐文章于 2025-08-13 18:01:09 发布

原创最新推荐文章于 2025-08-13 18:01:09 发布 · 817 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#算法

HDU水题专栏收录该内容

1 篇文章

订阅专栏

一系列编程题目，涵盖了字符排序、距离计算、体积计算、绝对值输出、成绩评级、日期计算、奇偶数求和、素数判断、数组操作、数字转换、货币找零、最大值定位、时间累加、数组去重、时间格式转换、分数求和等算法问题。

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

2000

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

#define ll long long;

const int MANX = 1e5;

int main(void)
{
	char a,b,c;
	while(scanf("%c%c%c",&a,&b,&c) != EOF)
	{
		getchar();//吞掉回车 
		char t;
		if(a>b)
		{
			t=a;
			a=b;
			b=t;
		}
		if(a>c)
		{
			t=a;
			a=c;
			c=t;
		}
		if(b>c)
		{
			t=b;
			b=c;
			c=t;
		}
		printf("%c %c %c\n",a,b,c);	
	}
	return 0;	
}

2001

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

#define ll long long;

const int MANX = 1e5;

int main(void)
{
    double x1,y1,x2,y2;
    while(scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2)!=EOF)
    {
        printf("%.2lf\n",sqrt(pow((x1-x2),2)+pow((y1-y2),2)));    
    } 
    return 0;
}

2002

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

#define ll long long;

const int MANX = 1e5;

#define PI 3.1415927
int main(void)
{
    double r;
    while(scanf("%lf",&r)!=EOF)
    {
        printf("%.3lf\n",PI*r*r*r*4/3);
    }
    return 0;
}

2003

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

#define ll long long;

const int MANX = 1e5;
int main(void)
{
    double x;
    while(scanf("%lf",&x)!=EOF)
    {
        printf("%.2lf\n",fabs(x));
    }
    return 0;
}

2004

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

#define ll long long;

const int MANX = 1e5;
int main(void)
{
    int g;
    while(scanf("%d",&g)!=EOF)
    {
        
        if(g>90 && g<100) printf("A\n");
        else if(g>80 && g<90) printf("B\n");
        else if(g>70 && g<80) printf("C\n");
        else if(g>60 && g<70) printf("D\n");
        else if(g<60 && g>=0) printf("E\n");    
        else printf("Score is error!\n");
    } 
    return 0;
}

2005

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

#define ll long long;

const int MANX = 1e5;
int main(void)
{
	int y,m,d;
	int day[2][13]={
		{0,31,28,31,30,31,30,31,31,30,31,30,31},
		{0,31,29,31,30,31,30,31,31,30,31,30,31}
	};
	while(scanf("%d/%d/%d",&y,&m,&d)!=EOF)
	{
		int t;
		t=(y%400==0||y%100!=0&&y%4==0);
		int k;
		for(k=1;k<m;k++)
		{
			d+=day[t][k];
		}
		cout<<d<<endl;
	}
	return 0;
}

2006

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

#define ll long long;

const int MAXN = 1e5;
int a[MAXN];
int main(void)
{
	int n,sum;
	while(scanf("%d",&n)!=EOF)
	{
		sum=1;
		memset(a,0,sizeof(a));
		for(int i=0;i<n;++i)
		{
			cin>>a[i];
			if(a[i]%2!=0)
			{
				sum*=a[i];
			}
		}
		cout<<sum<<endl;
	} 
	return 0;
}

2007

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

#define ll long long;

const int MAXN = 1e5;
int a[MAXN];
int main(void)
{
	int n,m,sum1,sum2;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		sum1=0;
		sum2=0;
		// 注意判断n,n大小
		;
		if(n>m)
		{
			int t=m;
			m=n;
			n=t;	
		} 
		for(int i=n;i<=m;++i)
		{
			if(i%2==0)
			sum1+=pow(i,2);
			else sum2+=pow(i,3);
		}
		printf("%d %d\n",sum1,sum2);
	}
	return 0;
}

2008

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

#define ll long long;

const int MAXN = 1e5;
int a[MAXN];
int main(void)
{
	int n,a,b,c;
	while(scanf("%d",&n)!=EOF)
	{
		if(n==0) break;
		a=0;
		b=0;
		c=0;
		float t; //输入的是实数并非整数
		for(int i=0;i<n;++i) 
		{
			cin>>t;
			if(t>0) a++;
			else if (t==0) b++;
			else c++;
		}
		printf("%d %d %d\n",c,b,a);		
	}
	return 0;
}

2009

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

#define ll long long;

const int MAXN = 1e5;
int a[MAXN];
int main(void)
{
	double n,m;
	while(scanf("%lf%lf",&n,&m)!=EOF)
	{
		double sum=0;
		for(int i=0;i<m;++i)
		{
			sum+=n;
			n=sqrt(n);	
		}
		printf("%.2lf\n",sum); 
	}
	return 0;
}

2010

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

#define ll long long;

const int MAXN = 1e5;
int a[MAXN];
int main(void)
{
	int n,m;
	int flag;
	while(scanf("%d%d",&m,&n)!=EOF)
	{
		flag=0;
		bool first = true;
		for(int i=m;i<=n;++i)
		{
			int a,b,c;
			a=i/100;
			b=i/10%10;
			c=i%10;

			if(i==pow(a,3)+pow(b,3)+pow(c,3))
			{
				flag=1;
				//注意输出格式
				if(!first)
				printf(" %d",i);
				else
				{
					printf("%d",i);
					first = false;
				}

			}
		}
		
		if(flag == 0)
		printf("no");
		printf("\n");
	}
	return 0;
}

2011

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

#define ll long long;

const int MAXN = 1e5;
int a[MAXN];
int main(void)
{
	int m;
	cin>>m;
	while(m--)
	{
		int n;
		cin>>n;
		double sum=0;
		for(int i=1;i<=n;i++)
		{
			if(i%2!=0) 
			sum+=1.0/i;
			else sum-=1.0/i;	
		}
		printf("%.2lf\n",sum); 
	}
}

2012

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

#define ll long long;

const int MAXN = 1e5;
int a[MAXN];
int sushu(int x)//素数判断
{
	if (x%2==0)
		return 1;
	else{
		int flag =1;
		for(int i=3;i<sqrt(x);i+=2)
		{
			if(x%i==0)
			{
				flag=0;
				break;
			 } 
		}
		return flag;
	}
}
int main(void)
{
	int x,y;
	int temp;
	while(scanf("%d%d",&x,&y)!=EOF)
	{
		temp=1;
		if(x==0&&y==0)
		break;
		else
		{
			for(int i=x;i<=y;i++)
			{
				if(!sushu(i*i+i+41))
				{
					temp = 0;
				}
			}
		}
		if(temp==0)
		cout<<"Sorry"<<endl;
		else cout<<"OK"<<endl;
	}
}

2013

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;
#define ll long long;
const int MAXN = 1e5;
int a[MAXN];
int main(void)
{
	int n;
	int sum;
	while(scanf("%d",&n)!=EOF)
	{
		sum=1;
		for(int i=0;i<n-1;++i)
		{
			sum=(sum+1)*2;
		}
		cout<<sum<<endl;
	}
	return 0;
}

2014

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;
#define ll long long;
const int MAXN = 1e5;
int a[MAXN];
int main(void)
{
	int n;
	double sum;
	int min,max;
	while(scanf("%d",&n)!=EOF)
	{
		sum=0.0;
		min = 101;
		max = -1;
		for(int i=0;i<n;++i)
		{
			cin>>a[i];
			sum+=a[i];
			if(a[i]<min) min = a[i];
			if(a[i]>max) max = a[i];
		}
		printf("%.2lf\n",(sum-min-max)/(n-2));
	}
	return 0;
}

2015

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;

#define ll long long

const int MAXN = 1e5;

int a[MAXN];

int main(void)
{
	for(int i=1;i<102;++i)
	{
		a[i]=a[i-1]+i*2;	
	}
	int m,n;
	while(scanf("%d %d",&m,&n)!=EOF)	
	{
		for(int i = 1; i <= m / n; i ++)
        {
            if(i == 1)
                cout << (a[n * i] - a[n * i - n]) / n;
            else
                cout << " " << (a[n * i] - a[n * i - n]) / n;
        }
        if(m%n!=0)
        {
        	cout<<" "<<(a[m] - a[m / n * n]) / (m - m / n * n);
		}
		cout<<endl;
	}
}

2016

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
using namespace std;

#define ll long long

const int MAXN = 1e5;

int a[MAXN];

int main(void)
{
    int n;
    while(true)
    {
        cin>>n;
        int flag=0,min=32767;
        if(n==0) break;
        memset(a,0,sizeof(a));
        for(int i=0;i<n;++i)
        {
            cin>>a[i];
            if(a[i]<min){
                flag=i;
                min=a[i];
            }
        }
        int t = a[0];
        a[0]=a[flag];
        a[flag]=t;
        for(int i=0;i<n-1;++i)
            cout<<a[i]<<" ";
        cout<<a[n-1]<<endl;
    }
    return 0;
}

2017

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<string>
using namespace std;

#define ll long long

const int MAXN = 1e5;

char a[MAXN];

int main(void)
{
    int n;
    cin>>n;
    while(n--)
    {
        int count = 0;
        string s;
        cin>>s;
        for(int i=0;i<s.size();++i)
        {
            if(s[i]<='9'&&s[i]>='0') count++;
        }
        cout<<count<<endl;
    }
    return 0;
}

2018

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<string>
using namespace std;

#define ll long long

const int MAXN = 1e5;

char a[MAXN];
int cow(int n)
{
    if(n<=4) return n;
    else return cow(n-1)+cow(n-3);
}

int main(void)
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0)
            break;
        cout<<cow(n)<<endl;
    }
    return 0;
}

2019

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
#define ll long long

const int MAXN = 1e5;

int a[MAXN];
int main(void)
{
    int n,m;
    while(scanf("%d %d",&n,&m)!=EOF)
    {
        int flag=0;
        int temp;
        memset(a,0,sizeof(a));
        if(n==0&&m==0) break;
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
            if(m<a[i]&&flag==0){
                a[i+1]=a[i];
                a[i]=m;
                flag=1;
                temp = i;
                break;
            }
        }
        if(flag==1)
        {
            for(int i=temp+2;i<=n;++i)
                cin>>a[i];
        }
        if(a[n]<m) a[n+1]=m;
        for(int i=0;i<n;i++)
            cout<<a[i]<<" ";
        cout<<a[n]<<endl;
    }
}

2020

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
#define ll long long

const int MAXN = 1e5;

int a[MAXN];
int main(void)
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0) break;
        memset(a,0,sizeof(a));
        for(int i=0;i<n;++i){
            scanf("%d",&a[i]);
        }
        for (int i = 0; i < n-1; i++)
        {
            for (int j = i+1; j < n; j++)
            {
                if (abs(a[i]) < abs(a[j]))
                {
                    int temp = a[i];
                    a[i] = a[j];
                    a[j] = temp;
                }
            }
        }
        for(int i=0;i<n-1;++i)
            cout<<a[i]<<" ";
        cout<<a[n-1]<<endl;
    }
    return 0;
}

2021

#include <iostream>
#include <cstdio>
 
using namespace std;
 
int a[105];
 
int fun(int n)
{
    int sum = 0;
    while (n > 0)
    {
        if (n >= 100)
            n -= 100;
        else if (n >= 50)
            n -= 50;
        else if (n >= 10)
            n -= 10;
        else if (n >= 5)
            n -= 5;
        else if (n >= 2)
            n -= 2;
        else if (n >= 1)
            n -= 1;
            sum++;
    }
    return sum;
}
 
int main()
{
    int n, m;
    int sum;
 
    while (scanf("%d", &n) != EOF && n != 0)
    {
        sum = 0;
        for (int i = 0; i < n; i++)
        {
            scanf("%d", &m);
            sum += fun(m);
        }
        printf("%d\n", sum);
    }
    return 0;
}

2022

#include <stdio.h>
#include <stdlib.h>

int main(void)
{
    int m, n, val, max, maxi, maxj, i, j;

    while(scanf("%d%d", &m, &n) != EOF) {
        // 设置最大值初值
        max = 0;
        maxi = 1;
        maxj = 1;

        // 读入数据并且更新最大值
        for(i=1; i<=m; i++)
            for(j=1; j<=n; j++) {
                scanf("%d", &val);
                if(abs(val) > abs(max)) {
                    max = val;
                    maxi = i;
                    maxj = j;
                }
            }

        // 输出结果
        printf("%d %d %d\n", maxi, maxj, max);
    }

    return 0;
}

2033

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>

using namespace std;

#define ll long long

const int MAXN = 1e4;

int a[3];
int b[3];

int main(void)
{
    int n;
    cin>>n;
    while(n--)
    {
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        for(int i=0;i<3;++i)
            cin>>a[i];
        for(int i=0;i<3;++i)
        {
            cin>>b[i];
            b[i]+=a[i];
        }
        for(int i=2;i>0;--i)
        {
            if(b[i]>=60)
            {
                b[i-1]+=1;
                b[i]%=60;
            }
        }
        printf("%d %d %d\n",b[0],b[1],b[2]);
    }
    return 0;
}

2034

#include <fstream>
#include<iostream>
#include<cmath>
#include <cstdlib>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
    int  n,m;
    while(cin>>n>>m)
    {   int a[101],b[101];
        if(n==0&&m==0)
            break;
         for(int i=0;i<n;i++)
                cin>>a[i];
         for(int i=0;i<m;i++)
            cin>>b[i];
       for(int i=0;i<n;i++)//判断a数组内是否有与b数组相同的元素
        for(int j=0;j<m;j++)
       {
           if(a[i]==b[j])
            a[i]=-99999;
       }
       sort(a,a+n);//排序
       int flag=0;
       for(int i=0;i<n;i++)//筛选
       {
           if(a[i]==-99999)
            continue;
           else
           {
               cout<<a[i]<<" ";
               flag=1;
           }
       }
       if(flag==0)//输出
        cout<<"NULL\n";
        else
       cout<<endl;
    }
return 0;
}