{"id":24596,"date":"2025-04-19T10:28:43","date_gmt":"2025-04-19T02:28:43","guid":{"rendered":"https:\/\/www.wsisp.com\/helps\/24596.html"},"modified":"2025-04-19T10:28:43","modified_gmt":"2025-04-19T02:28:43","slug":"%e3%80%90%e8%93%9d%e6%a1%a5%e6%9d%af%e6%af%8f%e6%97%a5%e4%b8%80%e9%a2%98%e3%80%913-16","status":"publish","type":"post","link":"https:\/\/www.wsisp.com\/helps\/24596.html","title":{"rendered":"\u3010\u84dd\u6865\u676f\u6bcf\u65e5\u4e00\u9898\u30113.16"},"content":{"rendered":"

\"Alt\"\u2003<\/p>\n

🏝\ufe0f\u4e13\u680f：\u00a0\u3010\u84dd\u6865\u676f\u5907\u7bc7\u3011 🌅\u4e3b\u9875：\u00a0f\u72d0o\u72f8x<\/p>\n

\n

\u76ee\u5f55<\/p>\n

3.9 \u9ad8\u7cbe\u5ea6\u7b97\u6cd5<\/p>\n

\u4e00\u3001\u9ad8\u7cbe\u5ea6\u52a0\u6cd5<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u94fe\u63a5：<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u63cf\u8ff0：<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u89e3\u9898\u601d\u8def：<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u89e3\u9898\u4ee3\u7801：<\/p>\n

\u4e8c\u3001\u9ad8\u7cbe\u5ea6\u51cf\u6cd5<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u94fe\u63a5：<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u63cf\u8ff0：<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u89e3\u9898\u601d\u8def：<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u89e3\u9898\u4ee3\u7801：<\/p>\n

\u4e09\u3001\u9ad8\u7cbe\u5ea6\u4e58\u6cd5<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u94fe\u63a5：<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u63cf\u8ff0：<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u89e3\u9898\u601d\u8def：<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u89e3\u9898\u4ee3\u7801：<\/p>\n

\u56db\u3001\u9ad8\u7cbe\u5ea6\u9664\u6cd5<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u94fe\u63a5：<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u63cf\u8ff0：<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u89e3\u9898\u601d\u8def：<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u89e3\u9898\u4ee3\u7801：<\/p>\n

3.10 \u679a\u4e3e<\/p>\n

\u4e00\u3001\u94fa\u5730\u6bef<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u94fe\u63a5：<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u63cf\u8ff0：<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u89e3\u9898\u601d\u8def：<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u89e3\u9898\u4ee3\u7801：<\/p>\n

\u4e8c\u3001\u56de\u6587\u65e5\u671f<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u94fe\u63a5：<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u63cf\u8ff0：<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u89e3\u9898\u601d\u8def：<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u89e3\u9898\u4ee3\u7801：<\/p>\n

\u4e09\u3001\u626b\u96f7<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u94fe\u63a5：<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u63cf\u8ff0：<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u89e3\u9898\u601d\u8def：<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u89e3\u9898\u4ee3\u7801：<\/p>\n

\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u5237\u9898\u5c31\u50cf\u6253\u6e38\u620f，\u84dd\u6865\u676f\u662f\u7ec8\u6781\u5927BOSS，\u6bcf\u5929\u7684\u771f\u9898\u90fd\u662f\u5c0f\u602a\u2014\u2014\u867d\u7136\u7206\u7387\u4f4e，\u4f46\u88c5\u5907（\u77e5\u8bc6）\u6389\u4e0d\u505c！<\/p>\n

3.9 \u9ad8\u7cbe\u5ea6\u7b97\u6cd5<\/h2>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u4eca\u5929\u6765\u70b9\u6709\u610f\u601d\u7684，\u6a21\u62df\u5c0f\u5b66\u7684\u52a0\u51cf\u4e58\u9664<\/p>\n

\u4e00\u3001\u9ad8\u7cbe\u5ea6\u52a0\u6cd5<\/h3>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u94fe\u63a5：<\/h4>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0P1601 A+B Problem（\u9ad8\u7cbe）<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u63cf\u8ff0：<\/h4>\n

\"\"<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u89e3\u9898\u601d\u8def：<\/h4>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u8fd9\u9898\u6211\u4eec\u53ef\u4ee5\u770b\u5230a，b\u8fd9\u4e24\u4e2a\u6570\u7684\u503c\u662f\u975e\u5e38\u5927\u7684（\u5df2\u7ecf\u8d85\u8fc7\u4e86long long）\u56e0\u6b64\u6211\u4eec\u9700\u8981\u81ea\u5df1\u5199\u4e00\u4e2a\u52a0\u6cd5\u7684\u4ee3\u7801，\u6211\u4eec\u53ef\u4ee5\u7528\u4e00\u4e2a\u6570\u7ec4\u628a\u6570\u5b57\u7684\u6bcf\u4e00\u4f4d\u5b58\u8d77\u6765，\u5728\u60f3\u5c0f\u5b66\u6570\u5b66\u90a3\u6837\u4e00\u4f4d\u4e00\u4f4d\u7684\u8ba1\u7b97\u5c31\u53ef\u4ee5\u4e86<\/p>\n

\"\"<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u89e3\u9898\u4ee3\u7801：<\/h4>\n

#include <iostream><\/p>\n

using namespace std;<\/p>\n

const int N = 1010;<\/p>\n

int a[N], b[N], c[N];
\nint la, lb, lc;<\/p>\n

void add(int c[], int a[], int b[])
\n{
\nfor (int i = 0; i < lc; i++)
\n{
\nc[i] += a[i] + b[i];
\nc[i + 1] = c[i] \/ 10;
\nc[i] %= 10;
\n}
\nif (c[lc]) lc++;
\n}<\/p>\n

int main()
\n{
\nstring x, y; cin >> x >> y;
\n\/\/ \u5c06\u6570\u636e\u5b58\u5165\u6570\u7ec4
\nla = x.size();
\nlb = y.size();
\nlc = max(la, lb);
\nfor (int i = la – 1; i >= 0; i–) a[la – 1 – i] = x[i] – '0';
\nfor (int i = lb – 1; i >= 0; i–) b[lb – 1 – i] = y[i] – '0';
\nadd(c, a, b);\/\/ c = a + b<\/p>\n

for (int i = lc – 1; i >= 0; i–) cout << c[i];<\/p>\n

return 0;
\n} <\/p>\n

\u4e8c\u3001\u9ad8\u7cbe\u5ea6\u51cf\u6cd5<\/h3>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u94fe\u63a5：<\/h4>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0P2142 \u9ad8\u7cbe\u5ea6\u51cf\u6cd5<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u63cf\u8ff0：<\/h4>\n

\"\"<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u89e3\u9898\u601d\u8def：<\/h4>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u8fd9\u9898\u548c\u4e0a\u9762\u7684\u9ad8\u7cbe\u5ea6\u52a0\u6cd5\u7c7b\u4f3c，\u90fd\u662f\u4e0d\u80fd\u7b80\u5355\u7684\u7528\u4e00\u4e2along long \u7684\u53d8\u91cf\u5c31\u80fd\u641e\u5b9a\u7684，\u56e0\u6b64\u8fd8\u662f\u9700\u8981\u6211\u4eec\u6a21\u62df\u4e00\u4e0b\u5c0f\u5b66\u65f6\u5019\u5b66\u7684\u51cf\u6cd5，\u5217\u7ad6\u5f0f\u6765\u4e00\u4e2a\u4e00\u4e2a\u7b97<\/p>\n

\"\"<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u89e3\u9898\u4ee3\u7801：<\/h4>\n

#include <iostream><\/p>\n

using namespace std;<\/p>\n

const int N = 1e5 + 10;<\/p>\n

int a[N], b[N], c[N];
\nint la, lb, lc;<\/p>\n

bool bigger(string x, string y)
\n{
\nif (x.size() != y.size())
\n{
\nreturn y.size() > x.size();
\n}
\nreturn y > x;
\n}<\/p>\n

void sub(int c[], int a[], int b[])
\n{
\nfor (int i = 0; i < lc; i++)
\n{
\nc[i] += a[i] – b[i];
\nif (c[i] < 0)
\n{
\nc[i + 1]–;
\nc[i] += 10;
\n}
\n}
\nwhile (1 != lc && c[lc – 1] == 0) lc–;
\n}<\/p>\n

int main()
\n{
\nstring x, y; cin >> x >> y;
\nif (bigger(x, y))
\n{
\nswap(x, y);
\ncout << '-';
\n}
\nla = x.size(); lb = y.size(); lc = max(la, lb);
\nfor (int i = la – 1; i >= 0; i–) a[la – 1 – i] = x[i] – '0';
\nfor (int i = lb – 1; i >= 0; i–) b[lb – 1 – i] = y[i] – '0';<\/p>\n

sub(c, a, b); \/\/ c = a – b;
\nfor (int i = lc – 1; i >= 0; i–) cout << c[i];
\nreturn 0;
\n} <\/p>\n

\u4e09\u3001\u9ad8\u7cbe\u5ea6\u4e58\u6cd5<\/h3>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u94fe\u63a5：<\/h4>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0P1303 A*B Problem<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u63cf\u8ff0：<\/h4>\n

\"\"<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u89e3\u9898\u601d\u8def：<\/h4>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u540c\u4e0a，\u6a21\u62df\u5c0f\u5b66\u5217\u7ad6\u5f0f\u4e58\u6cd5\u5373\u53ef<\/p>\n

\"\"<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u624d\u602a，\u6211\u9a97\u4f60\u7684，\u8fd9\u91cc\u4e3a\u4e86\u4ee3\u7801\u66f4\u52a0\u7b80\u6d01，\u6211\u4eec\u53ef\u4ee5\u5148\u5904\u7406\u8fdb\u4f4d，\u6700\u540e\u5728\u5904\u7406，\u5982\u4e0b\u56fe：<\/p>\n

\"\"<\/p>\n<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u89e3\u9898\u4ee3\u7801：<\/h4>\n

#include <iostream><\/p>\n

using namespace std;<\/p>\n

const int N = 2010;<\/p>\n

int a[N], b[N], c[N];
\nint la, lb, lc;<\/p>\n

void mul(int c[], int a[], int b[])
\n{
\nfor (int i = 0; i < la; i++)
\n{
\nfor (int j = 0; j < lb; j++)
\n{
\nc[i + j] += a[i] * b[j]; \/\/ \u65e0\u8fdb\u4f4d\u4e58\u6cd5
\n}
\n}
\n\/\/ \u5904\u7406\u8fdb\u4f4d
\nfor (int i = 0; i < lc; i++)
\n{
\nc[i + 1] += c[i] \/ 10;
\nc[i] %= 10;
\n}
\nwhile (lc != 1 && c[lc – 1] == 0) lc–;
\n}<\/p>\n

int main()
\n{
\nstring x, y; cin >> x >> y;
\nla = x.size(); lb = y.size(); lc = la + lb;<\/p>\n

for (int i = la – 1; i >= 0; i–) a[la – 1 – i] = x[i] – '0';
\nfor (int i = lb – 1; i >= 0; i–) b[lb – 1 – i] = y[i] – '0';<\/p>\n

mul(c, a, b);\/\/ c = a * b;<\/p>\n

for (int i = lc – 1; i >= 0; i–) cout << c[i];<\/p>\n

return 0;
\n} <\/p>\n

\u56db\u3001\u9ad8\u7cbe\u5ea6\u9664\u6cd5<\/h3>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u94fe\u63a5：<\/h4>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0P1480 A\/B Problem<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u63cf\u8ff0：<\/h4>\n

\"\"<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u89e3\u9898\u601d\u8def：<\/h4>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u6a21\u62df\u5c0f\u5b66\u9664\u6cd5\u5373\u53ef<\/p>\n

\"\"<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u89e3\u9898\u4ee3\u7801：<\/h4>\n

#include <iostream><\/p>\n

using namespace std;<\/p>\n

typedef long long LL;<\/p>\n

const int N = 5010;<\/p>\n

int a[N], c[N];
\nLL b;
\nint la, lc;<\/p>\n

void div(int c[], int a[], LL b)
\n{
\nLL t = 0;
\nfor (int i = lc – 1; i >= 0; i–)
\n{
\nt = t * 10 + a[i];
\nc[i] = t \/ b;
\nt = t % b;
\n}
\nwhile (lc != 1 && c[lc – 1] == 0) lc–;
\n}<\/p>\n

int main()
\n{
\nstring x; cin >> x >> b;
\nla = x.size(); lc = la;
\nfor (int i = la – 1; i >= 0; i–) a[la – 1 – i] = x[i] – '0';<\/p>\n

div(c, a, b); \/\/ c = a \/ b<\/p>\n

for (int i = lc – 1; i >= 0; i–) cout << c[i];<\/p>\n

return 0;
\n} <\/p>\n

3.10 \u679a\u4e3e<\/h2>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u679a\u4e3e，\u987e\u540d\u601d\u4e49\u5c31\u662f\u610f\u4e49\u5217\u4e3e，\u6765\u5427\u6765\u5427\u76f4\u63a5\u4e0a\u9898\u76ee<\/p>\n

\u4e00\u3001\u94fa\u5730\u6bef<\/h3>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u94fe\u63a5：<\/h4>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0P1003 [NOIP 2011 \u63d0\u9ad8\u7ec4] \u94fa\u5730\u6bef<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u63cf\u8ff0：<\/h4>\n

\"\"<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u89e3\u9898\u601d\u8def：<\/h4>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u56e0\u4e3a\u9898\u76ee\u7ed9\u7684\u6570\u91cf\u4e0d\u5927，\u56e0\u6b64\u6211\u4eec\u53ef\u4ee5\u66b4\u529b\u679a\u4e3e，\u628a\u6240\u6709\u60c5\u51b5\u5168\u90e8\u610f\u4e49\u7f57\u5217\u51fa\u6765，\u5728\u5224\u65ad\u662f\u5426\u7b26\u5408\u9898\u76ee\u8981\u6c42，\u7b26\u5408\u76f4\u63a5\u8fd4\u56de\u5373\u53ef（\u56e0\u4e3a\u8fd9\u4e2a\u9898\u662f\u6211\u4eec\u9700\u8981\u6211\u4eec\u627e\u5230\u6700\u540e\u4e00\u4e2a\u7b26\u5408\u8981\u6c42\u7684\u5730\u6bef，\u56e0\u6b64\u6211\u4eec\u53ef\u4ee5\u4e4b\u540e\u4ece\u540e\u5f80\u524d\u904d\u5386\u6765\u4f18\u5316\u4ee3\u7801）<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u89e3\u9898\u4ee3\u7801：<\/h4>\n

#include <iostream><\/p>\n

using namespace std;<\/p>\n

const int N = 1e4 + 10;<\/p>\n

int a[N], b[N], g[N], k[N];<\/p>\n

int main()
\n{
\nint n; cin >> n;
\nfor (int i = 1; i <= n; i++)
\n{
\ncin >> a[i] >> b[i] >> g[i] >> k[i];
\n}
\nint x, y; cin >> x >> y;
\nint flag = 0;
\nfor (int i = n; i >= 0; i–)
\n{
\nif (a[i] <= x && b[i] <= y &&
\na[i] + g[i] >= x && b[i] + k[i] >= y)
\n{
\ncout << i << endl;
\nflag++;
\nbreak;
\n}
\n}
\nif (!flag) cout << -1 << endl;<\/p>\n

return 0;
\n} <\/p>\n

\u4e8c\u3001\u56de\u6587\u65e5\u671f<\/h3>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u94fe\u63a5：<\/h4>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0P2010 [NOIP 2016 \u666e\u53ca\u7ec4] \u56de\u6587\u65e5\u671f<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u63cf\u8ff0：<\/h4>\n

\"\"<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u89e3\u9898\u601d\u8def：<\/h4>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u8fd9\u91cc\u53ef\u4ee5\u6211\u4eec\u53ef\u4ee5\u76f4\u63a5\u66b4\u529b\u679a\u4e3e\u4ecedate1 \u4e00\u76f4\u679a\u4e3e\u5230 date2，\u7136\u540e\u518d\u4e00\u4e00\u5224\u65ad\u8be5\u65e5\u671f\u662f\u5426\u662f\u56de\u6587\u65e5\u671f，\u518d\u7528\u4e00\u4e2acnt\u53d8\u91cf\u8ba1\u6570\u5c31\u884c\u4e86\u3002<\/p>\n

\"\"<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u4f46\u662f\u8fd9\u6837\u7684\u7b97\u6cd5\u4f1a\u4e0d\u4f1a\u592a\u8fc7\u4e8e\u6d6a\u8d39\u5462？\u8fd9\u91cc\u6709\u53e6\u5916\u4e00\u4e2a\u65b9\u6cd5：\u5c06data1\u91cc\u7684year1 \u679a\u4e3e\u5230year2，\u518d\u5224\u65ad\u65e5\u671f\u662f\u5426\u5408\u6cd5\u5373\u53ef\u3002<\/p>\n

\"\"<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u4f46\u662f\u8fd9\u6837\u4f9d\u7136\u4e0d\u662f\u6700\u4f18\u89e3，\u65b9\u6cd5\u4e8c\u8fd8\u9700\u8981\u679a\u4e3e9999\u6b21，\u8fd9\u91cc\u6211\u4eec\u8fd8\u6709\u6cd5\u4e09：\u5c06\u6240\u6709\u65e5\u671f\u679a\u4e3e\u51fa\u6765，\u5728\u5224\u65ad\u56de\u6587\u7684\u5e74\u4efd\u662f\u5426\u5728\u9898\u76ee\u8981\u6c42\u7684\u5e74\u4efd\u91cc\u9762<\/p>\n

\"\"<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u89e3\u9898\u4ee3\u7801：<\/h4>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u8fd9\u91cc\u716e\u6ce2\u5077\u4e2a\u61d2，\u53ea\u5199\u7b2c\u7b2c\u4e09\u79cd\u65b9\u6cd5，\u524d\u4e24\u79cd\u65b9\u6cd5\u5927\u5bb6\u53ef\u4ee5\u81ea\u5df1\u53bb\u8bd5\u8bd5<\/p>\n

#include <iostream><\/p>\n

using namespace std;<\/p>\n

typedef long long LL;<\/p>\n

int days[13] = { 0,31,29,31,30,31,30,31,31,30,31,30,31 };<\/p>\n

int main()
\n{
\nint date1, date2; cin >> date1 >> date2;
\nint cnt = 0;
\nfor (int m = 1; m < 13; m++)
\n{
\nfor (int d = 1; d <= days[m]; d++)
\n{
\nif (date1 <= (((d % 10) * 1000 + (d \/ 10) * 100 + (m % 10)*10 + m \/ 10) * 10000 + m * 100 + d) &&
\ndate2 >= (((d % 10) * 1000 + (d \/ 10) * 100 + (m % 10) * 10 + m \/ 10) * 10000 + m * 100 + d))
\n{
\ncnt++;
\n}
\n}
\n}
\ncout << cnt << endl;<\/p>\n

return 0;
\n} <\/p>\n

\u4e09\u3001\u626b\u96f7<\/h3>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u94fe\u63a5：<\/h4>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0P2327 [SCOI2005] \u626b\u96f7<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u9898\u76ee\u63cf\u8ff0：<\/h4>\n

\"\"<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u89e3\u9898\u601d\u8def：<\/h4>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u8fd9\u4e2a\u9898\u4e5f\u662f\u53ef\u4ee5\u679a\u4e3e\u7684，\u6211\u4eec\u53ef\u4ee5\u6839\u636e\u7b2c\u4e00\u6392\u662f\u54261\u6709\u96f7\u63a8\u51fa\u4e0b\u4e00\u6392\u6709\u6ca1\u6709\u96f7（\u662f\u5426\u6709\u96f7\u75280 1\u8868\u793a）\u90a3\u4e48\u4e0b\u4e00\u6392\u6709\u6ca1\u6709\u96f7\u5c31 = \u5f53\u524d\u6392\u7684\u6570\u5b57\u00a0–\u00a0\u4e0a\u4e00\u6392\u7684\u5730\u96f7 + \u5f53\u524d\u6392\u7684\u5730\u96f7<\/p>\n

\"\"<\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u89e3\u9898\u4ee3\u7801：<\/h4>\n

#include <iostream><\/p>\n

using namespace std;<\/p>\n

const int N = 1e4 + 10;<\/p>\n

int n;<\/p>\n

int a[N], b[N];<\/p>\n

int cheak1()
\n{
\na[1] = 0;
\nfor (int i = 2; i <= n + 1; i++)
\n{
\na[i] = b[i – 1] – a[i – 1] – a[i – 2];
\nif (a[i] > 1 || a[i] < 0)
\nreturn 0;
\n}
\nif (a[n + 1])return 0;
\nreturn 1;
\n}<\/p>\n

int cheak2()
\n{
\na[1] = 1;
\nfor (int i = 2; i <= n + 1; i++)
\n{
\na[i] = b[i – 1] – a[i – 1] – a[i – 2];
\nif (a[i] > 1 || a[i] < 0)
\nreturn 0;
\n}
\nif (a[n + 1])return 0;
\nreturn 1;
\n}<\/p>\n

int main()
\n{
\ncin >> n;
\nfor (int i = 1; i <= n; i++)
\n{
\ncin >> b[i];
\n}
\nint ret = 0;
\nret += cheak1();
\nret += cheak2();
\ncout << ret << endl;<\/p>\n

return 0;
\n} <\/p>\n

ok，\u672c\u671f\u5c31\u5230\u8fd9\u91cc\u5427，\u8fc7\u4e24\u5929\u5728\u66f4\u65b0\u4e0b\u4e00\u671f \u62dc\u62dc~<\/p>\n

\u6bcf\u65e5\u4e09\u7701\u543e\u8eab：<\/p>\n