\u7f16\u5199\u51fd\u6570\uff0c\u5224\u65ad\u4e00\u4e2a\u6b63\u6574\u6570\u662f\u4e0d\u662f\u5b8c\u6570\u3002\u6240\u8c13\u5b8c\u6570\u5c31\u662f\u5176\u56e0\u6570\uff08\u4e0d\u5305\u62ec\u81ea\u8eab\uff09\u4e4b\u548c\u7b49\u4e8e\u5176\u81ea\u8eab\u7684\u6574\u6570\uff0c\u59826\u3002<\/p>\n\n\n\n
#include<bits\/stdc++.h>\r\nusing namespace std;\r\n\r\nbool judge_profect_num(int a)\r\n{\r\n int s = 0;\r\n int i = 1;\r\n while(i<(a\/2+1))\r\n {\r\n if(a%i==0)\r\n {\r\n s+=i;\r\n }\r\n i++;\r\n }\r\n if(s==a) return true;\r\n else return false;\r\n }\r\nint main()\r\n{\r\n int a;\r\n cin >> a;\r\n if(judge_profect_num(a))\r\n {\r\n cout << \"Yes\uff0c\u662f\u5b8c\u6570\";\r\n return 0;\r\n }\r\n cout << \"No\uff0c\u4e0d\u662f\u5b8c\u6570\";\r\n}\r\n<\/code><\/pre>\n\n\n\n\u6c34\u9898\uff0c\u4e0d\u89e3\u91ca<\/p>\n\n\n\n
\u5199\u51fd\u6570\uff0c\u9a8c\u8bc1\u8d39\u9a6c\u5c0f\u5b9a\u7406\uff1a\u5982\u679cp\u662f\u7d20\u6570\uff0c\u800ca\u4e0d\u662fp\u7684\u500d\u6570\uff0c\u5219a\u7684p-1\u6b21\u65b9\u9664\u4ee5p\u7684\u4f59\u6570\u6052\u4e3a1.<\/p>\n\n\n\n
#include <bits\/stdc++.h>\r\nusing namespace std;\r\n\r\nbool judge_prime(int a)\r\n{\r\n for(int i = 2;i * i <=a;i++)\r\n {\r\n if(a%i ==0)\r\n {\r\n return false;\r\n }\r\n }\r\n return true;\r\n}\r\n\r\nint main()\r\n{\r\n cout << \"\u8bf7\u5206\u522b\u8f93\u5165a\uff0cp\" <<endl;\r\n int a,p;\r\n\r\n cin >> a >> p;\r\n if(!judge_prime(a)||a%p==0)\r\n {\r\n cout << \"a\u975e\u7d20\u6570\u6216a\u662fp\u500d\u6570\uff0c\u7a0b\u5e8f\u7ed3\u675f\";\r\n return 0;\r\n }\r\n\r\n cout << \"a\u7684p-1\u6b21\u65b9 \" << pow(a,p-1) << endl;\r\n int b = pow(a,p-1);\r\n cout << \"a\u7684p-1\u6b21\u65b9\u9664\u4ee5p\u7684\u4f59\u6570\u662f \" << b%p <<endl;\r\n if(b%p==1) cout << \"\u8bc1\u660e\u6210\u7acb\";\r\n}\r\n<\/code><\/pre>\n\n\n\n\u6c34\u9898\uff0c\u4e0d\u89e3\u91ca+2<\/p>\n\n\n\n
\u7f16\u5199\u51fd\u6570\uff0c\u9a8c\u8bc1\u6b27\u62c9\u5b9a\u7406\uff1a\u5bf9\u4e8e\u4efb\u610f\u4e92\u7d20\u7684a\u548cn\uff0ca\u7684f(n)\u6b21\u65b9\u9664\u4ee5n\u7684\u4f59\u6570\u6052\u4e3a1\u3002\u5176\u4e2df(n)\u662f\u5c0f\u4e8e\u7b49\u4e8en\u7684\u6b63\u6574\u6570\u4e2d\u4e0en\u4e92\u8d28\u7684\u4e2a\u6570\u3002<\/p>\n\n\n\n
#include<bits\/stdc++.h>\r\n#define ULL unsigned long long\r\nusing namespace std;\r\n\/*\u4f7f\u7528\u4e86C++17\u8bed\u6cd5\uff0c\u6545\u7f16\u8bd1\u65f6gcc -g -Wall -std=c++17 !!!\r\n--------\r\n- C++ \u7f16\u8bd1\u5668: C:\\MinGW\\bin\\g++.exe\r\n- \u547d\u4ee4: g++.exe \"~\\7_1_3_212210711220.cpp\" -o \" ~\\7_1_3_212210711220.exe\" -g -Wall -std=c++17 -I\"C:\\MinGW\\include\" -I\"C:\\MinGW\\lib\\gcc\\mingw32\\9.2.0\\include\" -I\"C:\\MinGW\\lib\\gcc\\mingw32\\9.2.0\\include\\c++\" -L\"C:\\MinGW\\lib\" -L\"C:\\MinGW\\mingw32\\lib\" -static-libstdc++ -static-libgcc\r\n*\/\r\n\r\n\r\nbool co_prime(int a, int b)\r\n{\r\n if(gcd(a,b)==1)\r\n return true;\r\n return false;\r\n}\r\n\r\nint fn(int n)\r\n{\r\n int ans = 1;\/\/\u628a1\u9ed8\u8ba4\u7b97\u8fdb\u53bb\r\n for(int i = 2;i<=n;i++)\r\n {\r\n if(co_prime(n,i)) ans++;\r\n }\r\n return ans;\r\n}\r\n\r\nint main()\r\n{\r\n ULL int a,n;\r\n cin >> a >> n;\r\n ULL int aa = ceil(pow(a,fn(n)));\r\n cout << aa << endl;\r\n cout << \"a\u7684f(n)\u6b21\u65b9\u9664\u4ee5n\u7684\u4f59\u6570\u662f \" << aa%n;\r\n\r\n}\r\n<\/code><\/pre>\n\n\n\n\u8fd9\u4e2a\u9898\u6709\u70b9\u610f\u601d\uff0c\u7f16\u5199\u8fc7\u7a0b\u4e2d\u7528\u5230\u4e86 C++17 \u7684\u8bed\u6cd5\uff08\u4e3b\u8981\u662fgcd\uff08\uff09\u51fd\u6570\u4e86\uff09\uff0c\u7136\u540e\uff0c\u6ca1\u4e86\uff0c\u6c34\u5c31\u5b8c\u4e8b\u4e86\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"
\u7f16\u5199\u51fd\u6570\uff0c\u5224\u65ad\u4e00\u4e2a\u6b63\u6574\u6570\u662f\u4e0d\u662f\u5b8c\u6570\u3002\u6240\u8c13\u5b8c\u6570\u5c31\u662f\u5176\u56e0\u6570\uff08\u4e0d\u5305\u62ec\u81ea\u8eab\uff09\u4e4b\u548c\u7b49\u4e8e\u5176\u81ea\u8eab\u7684\u6574\u6570\uff0c\u59826\u3002 \u6c34\u9898\uff0c\u4e0d\u89e3\u91ca […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[12],"tags":[],"class_list":["post-212","post","type-post","status-publish","format-standard","hentry","category-c_plus"],"_links":{"self":[{"href":"https:\/\/mzdyl.xyz\/index.php\/wp-json\/wp\/v2\/posts\/212","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mzdyl.xyz\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/mzdyl.xyz\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/mzdyl.xyz\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mzdyl.xyz\/index.php\/wp-json\/wp\/v2\/comments?post=212"}],"version-history":[{"count":3,"href":"https:\/\/mzdyl.xyz\/index.php\/wp-json\/wp\/v2\/posts\/212\/revisions"}],"predecessor-version":[{"id":516,"href":"https:\/\/mzdyl.xyz\/index.php\/wp-json\/wp\/v2\/posts\/212\/revisions\/516"}],"wp:attachment":[{"href":"https:\/\/mzdyl.xyz\/index.php\/wp-json\/wp\/v2\/media?parent=212"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/mzdyl.xyz\/index.php\/wp-json\/wp\/v2\/categories?post=212"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/mzdyl.xyz\/index.php\/wp-json\/wp\/v2\/tags?post=212"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}