#include <iostream> using namespace std; \u200b int execute1(int a, int &sum1) { sum1 = 1; for (int i = 2; i < a; i++) { if (a % i == 0) { sum1 += i; } } return 0; } \u200b int execute1_r(int a, int &sum1) { sum1 = 1; cout << a << \":1\"; for (int i = 2; i < a; i++) { if (a % i == 0) { cout << \"+\" << i; sum1 += i; } } cout << \"=\" << sum1 << endl; return 0; } \u200b int main() { int M, N; cin >> M >> N; \u200b int count = 0; for (int i = M; i <= N; i++) { int sum1 = 0; execute1(i, sum1); if (sum1 <= i || sum1 > N) continue; \u200b int sum2 = 0; execute1(sum1, sum2); if (sum2 == i) { count++; if (count > 1) cout << endl; cout << count << endl; execute1_r(i, sum1); execute1_r(sum1, sum2); } } \u200b return 0; }<\/pre>\n\n\n\n
\u7b2c\u4e8c\u9898<\/h2>\n\n\n\n
\u3010\u95ee\u9898\u63cf\u8ff0\u3011<\/p>\n\n\n\n
\u7f16\u5199\u51fd\u6570int prime_m( int n,int x[], long y[])\uff0c\u57282~n\u8303\u56f4\u5185\u67e5\u627e\u540c\u65f6\u7b26\u5408\u4ee5\u4e0b\u6761\u4ef6\u7684\u6574\u6570m\uff1a2m -1\u662f\u7d20\u6570\u30012m -1\u7684\u53cd\u5e8f\u6570\u662f\u5947\u6570\u30012m -1\u7684\u5341\u8fdb\u5236\u8868\u793a\u4e2d\u5305\u542b\u6570\u5b571\u3002\u5c062~n\u8303\u56f4\u5185\u7b26\u5408\u4e0a\u8ff0\u6761\u4ef6\u7684\u6240\u6709\u6574\u6570m\u4f9d\u6b21\u4fdd\u5b58\u5230x\u6307\u5411\u7684\u6570\u7ec4\u4e2d\uff0c\u5c06\u4e0em\u5bf9\u5e94\u7684\u6574\u65702m -1\u4f9d\u6b21\u4fdd\u5b58\u5230y\u6307\u5411\u7684\u6570\u7ec4\u4e2d\u3002\u51fd\u6570\u8fd4\u56dex\u6570\u7ec4\u4e2d\u4fdd\u5b58\u7684\u6574\u6570\u4e2a\u6570\u3002<\/p>\n\n\n\n
\u3010\u8f93\u5165\u5f62\u5f0f\u3011<\/p>\n\n\n\n
\u6d4b\u8bd5\u6570\u636e:n=20<\/p>\n\n\n\n
\u3010\u8f93\u51fa\u5f62\u5f0f\u3011<\/p>\n\n\n\n
\u8f93\u51fa\u7ed3\u679c:<\/p>\n\n\n\n
5 31<\/p>\n\n\n\n
7 127<\/p>\n\n\n\n
17 131071<\/p>\n\n\n\n
#include <iostream> #include <cmath> using namespace std; \u200b bool isP(long n) { if (n <= 1) return false; if (n == 2) return true; if (n % 2 == 0) return false; for (long i = 3; i <= sqrt(n); i += 2) if (n % i == 0) return false; return true; } \u200b long rev(long n) { long r = 0; while (n > 0) { r = r * 10 + n % 10; n \/= 10; } return r; } \u200b bool has1(long n) { while (n > 0) { if (n % 10 == 1) return true; n \/= 10; } return false; } \u200b int prime_m(int n, int x[], long y[]) { int c = 0; for (int m = 2; m <= n; m++) { long num = static_cast<long>(pow(2, m)) - 1; if (!isP(num)) continue; if (rev(num) % 2 == 0) continue; if (!has1(num)) continue; x[c] = m; y[c] = num; c++; } return c; } \u200b int main() { int x[100]; long y[100]; int n = 20; int cnt = prime_m(n, x, y);
for (int i = 0; i < cnt; i++) cout << x[i] << \"\\t\" << y[i] << endl;
#include <iostream> #include <iomanip> using namespace std; \u200b bool isPrime(int num) { if (num <= 1) return false; if (num == 2) return true; if (num % 2 == 0) return false; for (int i = 3; i * i <= num; i += 2) { if (num % i == 0) return false; } return true; } \u200b void goldbach() { int count = 0; for (int even = 6; even <= 100; even += 2) { for (int p1 = 2; p1 <= even \/ 2; p1++) { int p2 = even - p1; if (isPrime(p1) && isPrime(p2)) { cout << setw(4) << even << \"=\" << setw(2) << p1 << \"+\" << setw(2) << p2 << \" \"; count++; if (count % 5 == 0) cout << endl; break; } } } } \u200b int main() { goldbach(); return 0; }<\/pre>\n\n\n\n
\u7b2c\u4e94\u9898<\/h2>\n\n\n\n
\u3010\u95ee\u9898\u63cf\u8ff0\u3011<\/p>\n\n\n\n
\u8f93\u5165\u7cbe\u5ea6e \u548c\u5b9e\u6570x,\u7528\u4e0b\u5217\u516c\u5f0f\u6c42cos x \u7684\u8fd1\u4f3c\u503c,\u7cbe\u786e\u5230\u6700\u540e\u4e00\u9879\u7684\u7edd\u5bf9\u503c\u5c0f\u4e8ee\uff61\u8981\u6c42\u5b9a\u4e49\u548c\u8c03\u7528\u51fd\u6570funcos(e,x)\u6c42\u4f59\u5f26\u51fd\u6570\u7684\u8fd1\u4f3c\u503c\uff61<\/p>\n\n\n\n<\/figure>\n\n\n\n
#include <iostream> using namespace std; \u200b bool isAutomorphic(int num) { long square = num * num; while (num > 0) { if (num % 10 != square % 10) { return false; } num \/= 10; square \/= 10; } return true; } \u200b int main() { int num; cin >> num;
if (isAutomorphic(num)) { cout << num << \" yes,\" << num << \"*\" << num << \"=\" << num * num << endl; } else { cout << num << \" no,\" << num << \"*\" << num << \"=\" << num * num << endl; }
#include <iostream> using namespace std; \u200b int Finddata(int arr[], int size, int target) { for (int i = 0; i < size; i++) { if (arr[i] == target) { return i; } } return -1; } \u200b int Finddata(char str[], char target) { for (int i = 0; str[i] != '\\0'; i++) { if (str[i] == target) { return i; } } return -1; } \u200b int main() { int fid, arr[] = {-11,3,5,13,27,8,23,45,2,3,-14,0,43,20,2,30,5,45,0,42,38,67}; char ch, str[] = \"The university seeks to integrate social service into its schooling.\"; int N = sizeof(arr) \/ sizeof(int); \u200b cin >> fid; int i = Finddata(arr, N, fid); if (i != -1) { cout << \"Found:\" << i << endl; } else { cout << \"Not Found!\" << endl; } \u200b cin >> ch; i = Finddata(str, ch); if (i != -1) { cout << \"Found:\" << i << endl; } else { cout << \"Not Found!\" << endl; } \u200b return 0; }<\/pre>\n","protected":false},"excerpt":{"rendered":"
<\/figure>\n\n\n\n