@root

Kinghero King of the summit 2023-08-24 10:01:21 26

这哪错了~~~~~~~~~~~~~~~~~~(只有90分)

#include <bits/stdc++.h>
using namespace std;
long int f[51], mod = 2147483648, m;
int n, i, flag = 0;
int main() {
	f[1] = 1;
	f[2] = 1;
	cin >> n;
	for (i = 3; i <= n; i++) f[i] = f[i - 1] + f[i - 2];
	m = f[n] % mod;
	cout << m << "=";
	i = 2;
	while (m > 1) {
		if (m % i == 0) {
			if (flag == 0) {
				flag = 1;
				cout << i;
				m = m / i;
			} else cout << "*" << i, m = m / i;
		} else i++;
	}
	return 0;
}

wc097

2024-09-26 21:16:44

先判断一下f[n]是不是质数，是的话会加到超时，所以是质数直接输出自己然后结束

wc097

2024-09-26 21:13:44

korme

2024-09-26 21:02:52

有一个in是43，直接打表

wyh15 Minecraft

2024-06-15 18:43:19

#include <bits/stdc++.h>
using namespace std;
long long int f[51], mod = 2147483648, m;
int n, i, flag = 0;
int main() {
	f[1] = 1;
	f[2] = 1;
	cin >> n;
	for (i = 3; i <= 4; i++){f[i] = (f[i - 1] + f[i - 2]) % mod;}
	m = f[n] % mod;
	cout << m << "=";
	i = 2;
	while (m > 1) {
		if (m % i == 0) {
			if (flag == 0) {
				flag = 1;
				cout << i;
				m = m / i;
			} else cout << "*" << i, m = m / i;
		} else i++;
	}
	return 0;
}

yehongchen

2023-12-09 13:51:58

#include <bits/stdc++.h>
using namespace std;
long int f[51], mod = 2147483648, m;
int n, i, flag = 0;
int main() {
    f[1] = 1;
    f[2] = 1;
    cin >> n;
    for (i = 3; i <= n; i++) f[i] = f[i - 1] + f[i - 2] % mod;
    m = f[n] % mod;
    cout << m << "=";
    i = 2;
    while (m > 1) {
        if (m % i == 0) {
            if (flag == 0) {
                flag = 1;
                cout << i;
                m = m / i;
            } else
                cout << "*" << i, m = m / i;
        } else
            i++;
    }
    return 0;
}

???还是有错

root 站长

2023-09-02 18:50:15

long long int,然后就是每计算一个 f[i] 就求余一次 f[i] = (f[i - 1] + f[i - 2]) % mod;

@root

共 6 条回复