洛谷题目记录

Beauty.568

已于 2024-07-30 20:33:16 修改

阅读量252

点赞数 5

文章标签：算法 c++ 数据结构

于 2024-07-26 18:49:29 首次发布

本文链接：https://blog.csdn.net/2303_79812533/article/details/140722691

版权

1.P1217回文质数题

判断质数和回文数函数的书写

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
bool ifzhi(ll a) {
	
	 
		for(ll j=2;j*j<=a;j++)
		{
			if (a % j == 0)
				return false;
	}
	return true;
}
bool huiwen(ll a) {
	ll ori = a;
	ll rev = 0;
	while (a > 0) {
		rev = rev * 10 + a % 10;
		a /= 10;
	}
	return ori == rev;
}
int main() {
	ll a, b;
	cin >> a >> b;
	for (ll i = a; i <= b; i++) {
		if(huiwen(i)&&ifzhi(i))
			cout << i << endl;
	}
	return 0;
}

2.P2241统计方形

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n, m, a, b, c, d;
int main() {
	cin >> n >> m;
	a = n; b = m; c = a * b;
	while (a != 0 && b != 0) {
		a--; b--; c += a * b;
	}
	d = n * m * (n +1) * (m + 1) / 4;
	cout << c << ' ' << d - c;
	return 0;
}

3.P1075 质因数分解

直接用除法求j避免二次循环

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

ll n;
bool ifzhi(ll x) {
	if (x < 2) return false;
	for (int j = 2; j * j <= x; j++) {
		if (x % j == 0) return false;

	}
	return true;
}
int main() {
	cin >> n;
	for(ll i=2;i*i<=n;i++){
//直接用除法求另一个数j避免二次循环
		if (n % i == 0&&ifzhi(n/i) && ifzhi(i)) {
			cout << n / i;
			break;
		}

		}

	return 0;
}

4.P5725 打印三角形（为完成）

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

int main() {
	int n;
	cin >> n;
	int sum = 0;
	int flag = 1;
	for (int i = 1; i <= n*n; i++) {
		printf("%02d", i);
		if (i % n == 0) cout << endl;
	}
	for (int i = 1; i <= n; i++) {
		sum += i;
	}
	cout <<  endl;
	
	return 0;
}

5.P4956

注意循环的开始，一个从大到小，一个从小到大，

用数学简化题目的要求在写代码

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

int main() {
	int n; cin >> n;
	int x, k = 1;
	while (1) {
		for (x = 100; x > 0; x--) {
			if ((7 * x + 21 * k) * 52 == n) {
				cout << x << endl << k;
				return 0;
			}
		}
		k++;
	}
		return 0;
}

6.P1089 津津的储蓄计划

根据实际的情况去模拟手中的钱，和存入钱，不能盲目模拟

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int a[12];
int main() {
	
	int sum = 0,sub=0;
	for (int i = 0; i < 12; i++) 
		cin >> a[i];
	for (int i = 0; i < 12; i++) {
		sub += 300;
		if (sub < a[i]) {
			cout << '-' << i + 1;
			return 0;
		}
		sub -= a[i];
		while (sub > 100) {
			sum += 100;
			sub -= 100;
		}
	}
	cout << 1.2 * sum + sub;
		return 0;
}