东方博宜oj1070——1079

1070

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= i - 1; j++)
		{
			cout << " ";
		}
		for (int j = 1; j <= 2*n-2*i+1; j++)
		{
			cout << "*";
		}
		cout << endl;
	}
}

1071

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin >> n;
	for (int i = 1; i <= 2 * n + 1; i++)
	{
		if (i > n + 1 )
		{
			for (int j = 1;j <= i - n - 1;j++)
			{
				cout << " ";
			}
			for (int j = 1;j <= 4 * n - 2 * i + 3;j++)
			{
				cout << "*";
			}
		}
		if (i <= n + 1)
		{
			for (int j = 1; j <= n - i + 1; j++)
			{
				cout << " ";
			}
			for (int j = 1; j <= 2 * i - 1; j++)
			{
				cout << "*";
			}
		}
		cout << endl;
	}
}

1072

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n - i; j++)
		{
			cout << " ";
		}
		for (int j = 1; j <= 2 * i - 1; j++)
		{
			cout << j;
		}
		cout << endl;
	}
}

1073

#include <bits/stdc++.h>
using namespace std;
int main(){
	int n;
	cin>>n;
	for(int i = (n+1)/2-1;i>=0;i--){
		for(int j=1;j<=(n+1)/2-i-1;j++){
			cout<<" ";
		}
		for(int j=1;j<=2*i+1;j++){
			cout<<"*";
		}	
		cout<<endl;
	}
	for(int i = 1;i<=n/2;i++){
		for(int j=1;j<=n/2-i;j++){
			cout<<" ";
		}
		for(int j=1;j<=2*i+1;j++){
			cout<<"*";
		}	
		cout<<endl;
	}
}

1074

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int m, n, h;
	cin >> m >> n >> h;
	int num = 0;
	int sum = 0;
	while (1)
	{
		if (m + sum < h)
		{
			sum += m - n;
			num++;
		}
		if (m + sum >= h)
		{
			num++;
			break;
		}
	}
	cout << num;
}

1075

#include <bits/stdc++.h>
using namespace std;
int main()
{
	long long n, x;
	cin >> n;
	x = 2;
	while (x <= n)
	{
		x = x * 2;
	}
	if (x - n < n - x / 2)
	{
		cout << x;
	}
	else
	{
		cout << x / 2;
	}
}

1076

#include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main()
{
	int num = 0;
	for (int i = 0; i <= 11; i++)
	{
		for (int j = 0; j <= 50; j++)
		{
			for (int k = 0; k <= 25; k++)
			{
				if (9 * i + j + k == 100 && 2 * i + 2 * j + 4 * k == 100)
				{
					cout << i << " " << j << " " << k << endl;
					num++;
				}
			}
		}
	}
	cout << num;
}

1077 

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n, m;
	cin >> n >> m;
	for (int i = 0; i <= n / 5 + 1; i++)
	{
		for (int j = 0; j <= n / 3 + 1; j++)
		{
			if (14 * i + 8 * j == 3 * n - m)
			{
				cout << i << " " << j << " " << m - i - j << endl;
			}
		}
	}
}

1078

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin >> n;
	double s = 0;
	int i;
	for (i = 1;; i++)
	{
		s += 1.0 / i;
		if (s > n)
		{
			break;
		}
	}
	cout << i;
}

1079

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int L;
	cin >> L;
	int num = 0;
	int num1 = 0;
	int num2 = 0;
	for (int i = 1; 2*i < L; i++)
	{
		for (int j = 1; 2*j < L; j++)
		{
			if (i+j<L&&2*i+2*j>L&&L-i-j>0)
			{
				if (!(3*i==L&&3*j==L&&3*(L-i-j)==L))
				{
					if (i != j && j != (L - i - j) && i != (L - i - j))
					{
						num2++;
					}
					else
					{
						num1++;
					}
				}
			}
		}
	}
	num = num1 / 3 + num2 / 6;
	cout << num;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

夏梓乔

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值