东方博宜oj答案1000-1050

最新推荐文章于 2025-05-24 18:19:44 发布

原创

最新推荐文章于 2025-05-24 18:19:44 发布 · 1.5k 阅读

3 ·

CC 4.0 BY-SA版权

文章标签：

#算法

博主分享了在东方博宜在线评测系统上完成的1000到1050题目的答案，涵盖了一系列算法问题。尽管代码写得简单甚至有些笨拙，但都成功通过了测试。

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

1000

#include <bits/stdc++.h>
using namespace std;
int main(){
    int a,b,c;
    cin>>a>>b;
    c=a+b;
    cout<<c;
    return 0;
}

1002

#include <iostream>
using namespace std;
int main(){
    int a;
    cin>>a;
    int sum=0;
    for(int i=1; i<=a;i++){
        sum+=i;
    }
    cout<<sum;
}

1003

#include <iostream>
using namespace std;
int main()
{
	int a;
	cin >> a;
	int sum = 0;
	for (int i = 1; i <= a; )
	{
		sum += i;
		i += 2;
	}
	cout << sum;
	return 0;
}

1004

#include <bits/stdc++.h>
using namespace std;
int main(){
    int a;
    cin>>a;
    int sum =1;
    for(int i =1;i<=a;i++){
        sum *= i;
    }
    cout<<sum;
    return 0;
}

1005

#include <bits/stdc++.h>
using namespace std;
int main(){
    const double PI=3.1415926;
    int a;
    cin>>a;
    cout<<fixed<<setprecision(2)<<PI*a*a<<endl;
    cout<<fixed<<setprecision(2)<<PI*a*2;
    return 0;
}

1006

#include <iostream>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int a[101];
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	for (int i = n-1; i >= 0; i--)
	{
		cout << a[i] << " ";
	}
	return 0;
}

1007

#include <bits/stdc++.h>
using namespace std;
int main(){
    char a[105];
    int num=0;
    int num2=0;
    for(int i=0;i<80;i++){
        cin>>a[i];
        num++;
        if(a[i] == '.'){
            break;
        }
    }
    for(int i=0;i<num;i++){
        if((int)a[i]>=65 && (int)a[i]<=90){
            num2++;
        }
    }
    cout<<num2;
    return 0;
}

1008

#include <iostream>
using namespace std;
int main()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= 2 * n + 1; j++)
		{
			if (j>n-i&&j<n+i)
			{
				cout << i;
			}
			else
			{
				cout << " ";
			}
		}
		cout << endl;
	}
	return 0;
}

1009

#include <iostream>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int a[101];
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	for (int i = n-1; i >= 0; i--)
	{
		cout << a[i] << " ";
	}
	return 0;
}

1010

#include <iostream>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int* p = new int[n];
	for (int i = 0; i < n; i++)
	{
		cin >> p[i];
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n - i - 1; j++)
		{
			if (p[j] > p[j + 1])
			{
				int temp = p[j + 1];
				p[j + 1] = p[j];
				p[j] = temp;
			}
		}
	}
	for (int i = 0; i < n; i++)
	{
		cout << p[i] << " ";
	}
	delete[]p;
	return 0;
}

1011

#include <iostream>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int i, j;
	for (i = 1; i <= n; i++)
	{
		for (j = 1; j <= n - i; j++)
		{
			cout << " ";
		}
		if (i == 1)
		{
			for (j = 1; j <= n; j++)
			{
				cout << "*";
			}
		}
		else
		{
			cout << "*";
			for (j = 1; j <= n + 2 * (i - 2); j++)
			{
				cout << " ";
			}
			cout << "*";
		}
		cout << endl;
	}
	for (i = n - 1; i >= 1; i--)
	{
		for (j