东方博宜oj1060——1069

1060

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int sum = 0;
	if (n % 2 != 0)
	{
		for (int i = 2; i < n; i++)
		{
			if (i % 2 == 0)
			{
				sum += i;
			}
		}
	}
	if (n % 2 == 0)//偶
	{
		for (int i = 1; i <= n; i++)
		{
			if (n % i == 0)
			{
				sum += i;
			}
		}
	}
	cout << sum;
}

1061

#include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int judge = 1;
	int i;
	for (i = 2; i <= sqrt(n); i++)
	{
		if (n % i == 0)
		{
			judge = 0;
			break;
		}
	}
	if (judge == 1)
	{
		cout << "Yes";
	}
	if (judge == 0)
	{
		cout << i;
	}
}

1062

#include <bits/stdc++.h>
using namespace std;
int main()
{
	double i = 100;
	int num = 0;
	while (i >= 0.5)
	{
		i /= 2;
		num++;
	}
	cout << num;
}

1063 

#include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main()
{
	int m, n;
	cin >> m >> n;
	int sum = 0;
	for (int i = m; i <= n; i++)
	{
		int judge = 1;
		if (i == 1)
		{
			continue;
		}
		for (int j = 2; j <= sqrt(i); j++)
		{
			if (judge == 0)
			{
				continue;
			}
			if (i % j == 0)
			{
				judge = 0;
			}
		}
		if (judge == 1)
		{
			sum++;
		}
	}
	cout << sum;
}

1064

#include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int num = 0;
	for (int i = 1; i <= n; i++)
	{
		int judge = 1;
		if (i == 1)
		{
			continue;
		}
		for (int j = 2; j <= sqrt(i); j++)
		{
			if (judge == 0)
			{
				continue;
			}
			if (i % j == 0)
			{
				judge = 0;
			}
		}
		if (judge == 1)
		{
			cout << i << " ";
			num++;
			if (num == 5)
			{
				cout << endl;
				num = 0;
			}
		}
	}
}

1065

#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; j++)
		{
			cout << "*";
		}
		cout << endl;
	}
}

1066

#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; j++)
		{
			cout << "*";
		}
		cout << endl;
	}
}

1067

#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 <= n; j++)
		{
			cout << "*";
		}
		cout << endl;
	}
}

1068

#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 << "*";
		}
		cout << endl;
	}
}

1069

#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 << "*";
		}
		cout << endl;
	}
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

打赏作者

夏梓乔

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

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

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

打赏作者

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

抵扣说明:

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

余额充值