\u6b64\u6587\u7ae0\u4e3a\u4f5c\u8005\u6574\u7406\u7684\u4e00\u4e9b\u5e38\u89c1\u7684\u57fa\u7840\u7b97\u6cd5\u6a21\u677f\u3002\u5e38\u7528\u4e8e\u5404\u79cd\u9898\u76ee\u7684\u65f6\u95f4\u590d\u6742\u7684\u4f18\u5316\u4e0a\u3002<\/p>\n
\u76f8\u5173\u9898\u76ee\uff1a<\/span><\/p>\n \u539f\u9898\u94fe\u63a5\uff1ahttps:\/\/www.luogu.com.cn\/problem\/P1226<\/a><\/p>\n <\/p>\n \u76f8\u5173\u9898\u76ee\uff1a<\/span><\/p>\n \u539f\u9898\u94fe\u63a5\uff1ahttps:\/\/www.luogu.com.cn\/problem\/P1601<\/a><\/p>\n <\/p>\n\u3010\u6a21\u677f\u3011\u5feb\u901f\u5e42 \u666e\u53ca-<\/span><\/h2>\n
\u9898\u76ee\u63cf\u8ff0\uff1a<\/h3>\n
\n
\u793a\u4f8b<\/h3>\n
\n
\u4ee3\u7801<\/h3>\n
int qmi(int a , int b , int p)\r\n{\r\n int res = 1;\r\n while (b)\r\n {\r\n if (b & 1) res = res * a % p;\r\n a = a * a % p;\r\n b >>= 1;\r\n }\r\n return res;\r\n}\r\n\r\nvoid solve()\r\n{\r\n int a , b , p;\r\n cin >> a >> b >> p;\r\n cout << a << \"^\" << b << \" mod \" << p << \"=\" << qmi(a , b , p) << endl; \r\n}<\/pre>\n2.\u9ad8\u7cbe\u5ea6\u8fd0\u7b97<\/h1>\n
A + B Problem (\u9ad8\u7cbe) \u666e\u53ca-<\/span><\/h2>\n
\u9898\u76ee\u63cf\u8ff0<\/h3>\n
\n
\u793a\u4f8b<\/h3>\n
\n
\u4ee3\u7801<\/h3>\n
inline vector<int> add(vector<int> &a , vector<int> &b)\r\n{\r\n if (a.size() < b.size()) return add(b , a);\r\n \r\n vector<int> res;\t\r\n int t = 0;\r\n for (int i = 0 ; i < a.size() ; i ++ )\r\n {\r\n t += a[i];\r\n if (i < b.size()) t += b[i];\r\n res.push_back(t % 10);\r\n t \/= 10;\t\r\n }\t\r\n \r\n if (t) res.push_back(t);\r\n \r\n reverse(ALL(res));\r\n return res;\r\n}\r\n\r\nvoid solve()\r\n{\r\n string s1 , s2;\r\n cin >> s1 >> s2;\r\n vector<int> a , b;\r\n for (auto i : s1) a.push_back(i - '0');\r\n for (auto i : s2) b.push_back(i - '0');\r\n \r\n reverse(ALL(a)) , reverse(ALL(b));\r\n auto ans = add(a , b);\r\n \r\n for (auto i : ans) cout << i;\r\n cout << endl; \r\n}<\/pre>\n\u9ad8\u7cbe\u5ea6\u51cf\u6cd5 \u666e\u53ca-<\/span><\/h2>\n