{"id":1660,"date":"2018-03-16T21:23:31","date_gmt":"2018-03-16T13:23:31","guid":{"rendered":"http:\/\/47.101.202.111\/?p=1660"},"modified":"2023-04-07T12:55:40","modified_gmt":"2023-04-07T04:55:40","slug":"pat-basic-20points","status":"publish","type":"post","link":"http:\/\/139.196.114.170\/?p=1660","title":{"rendered":"PAT – BASIC – 20POINTS[updating]"},"content":{"rendered":"

\u6301\u7eed\u66f4\u65b0\u4e2d<\/p>\n

1002 \u5927\u6574\u6570\u7684\u5b57\u7b26\u4e32\u5b58\u50a8<\/h4>\n
#include <iostream>\n#include <string.h>\n#include <vector>\nusing namespace std;\n\nint main()\n{\n    char n[100];\n    vector<string> v;\n    string num[10] = {"ling", "yi", "er", "san", "si", "wu", "liu", "qi", "ba", "jiu"};\n    while (~scanf("%s", &n)) {\n\n        int sum = 0;\n        for (int i = 0; i < strlen(n); i++)\n            sum += n[i] - '0';\n\n        while (sum != 0) {\n            v.push_back(num[sum % 10].c_str());\n            sum \/= 10;\n        }\n\n        for (int i = v.size() - 1; i >= 0 ; i--) {\n            printf("%s", v[i].c_str());\n            if(i == 0) printf("\\n");\n            else printf(" ");\n        }\n    }\n\n    return 0;\n}<\/code><\/pre>\n
1004 \u5b57\u7b26\u6570\u7ec4\u9884\u7559\u3001\u7ed3\u6784\u4f53\u8d4b\u503c<\/h4>\n
#include <iostream>\nusing namespace std;\n\nstruct Stu\n{\n    char name[11];\n    char snum[11];\n    int grade;\n} maxStu, minStu, tmpStu;\n\nint main()\n{\n    maxStu.grade = -1;\n    minStu.grade = 101;\n    int n;\n    scanf("%d", &n);\n    for (int i = 0; i < n; i++)\n    {\n        scanf("%s%s%d", tmpStu.name, tmpStu.snum, &tmpStu.grade);\n        if (tmpStu.grade > maxStu.grade) maxStu = tmpStu;\n        if (tmpStu.grade < minStu.grade) minStu = tmpStu;\n    }\n    printf("%s %s\\n", maxStu.name, maxStu.snum);\n    printf("%s %s\\n", minStu.name, minStu.snum);\n    return 0;\n}<\/code><\/pre>\n
1007 \u7ebf\u6027\u7d20\u6570\u7b5b\u6ce8\u610f\u662f\u5426\u53d6\u4e0a\u754c<\/h4>\n
#include <iostream>\n#include <bits\/stdc++.h>\nusing namespace std;\n\nconst int maxn = 100000;\nbool isPrime[maxn];\nint a[maxn];\n\nint main() {\n    int n, j = 1, compsite;\n    memset(isPrime, true, sizeof(isPrime));\n    scanf("%d", &n);\n\n    for(int N = 2; N <= n; N++) {\n        if(isPrime[N]) a[j++] = N;\n        for(int i = 1; i < j; i++) {\n            if((compsite = a[i] * N) > n) break;\n            isPrime[compsite] = false;\n            if(N % a[i] == 0) break;\n        }\n    }\n\n    int cnt = 0;\n    for(int i = 2; i < j; i++)\n        if(a[i] - a[i - 1] == 2)\n            cnt++;\n    printf("%d", cnt);\n\n    return 0;\n}<\/code><\/pre>\n
1008 \u5faa\u73af\u79fb\u52a8\u6570\u7ec4\u7684\u4e09\u79cd\u65b9\u6cd5\u3001\u6700\u5c0f\u516c\u500d\u6570<\/h4>\n
\u76f4\u63a5\u4ece $\\scriptsize a[N – M ]$ \u5f00\u59cb\u5faa\u73af\u8f93\u51fa\uff0c\u6216\u4f7f\u7528\u8f85\u52a9\u6570\u7ec4<\/p>\n
# include <iostream>\nusing namespace std;\n\nint main() {\n    int N, M, T, j;\n    scanf("%d%d", &N, &M);\n    int a[N];\n    M = M % N;\n    for(int i = 0; i < N; i++)         scanf("%d", &a[i]);\n    for(int i = N - M; i < N; i++)     printf("%d ", a[i]);\n    for(int i = 0; i < N - M - 1; i++) printf("%d ", a[i]);\n    printf("%d", a[N - M - 1]);\n    return 0;\n}<\/code><\/pre>\n
\u4e09\u6b21\u7ffb\u8f6c\u6cd5<\/p>\n
<\/code><\/pre>\n
\u73af\u5f62\u66ff\u6362\u6cd5<\/p>\n
1009 \u5faa\u73af\u8bfb\u5165\u3001\u9006\u5e8f\u8f93\u51fa<\/h4>\n
\u6ce8\u610f\u81ea\u589e\u5728\u5faa\u73af\u6761\u4ef6\u4e2d\u65f6\u4f1a\u591a\u8ba1\u7b97\u4e00\u6b21<\/p>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    char s[80][80];\n    int i = 0;\n    while(~scanf("%s", s[i])) i++;\n\n    for(int j = i - 1; j > 0; j--)\n        printf("%s ", s[j]);\n    printf("%s\\n", s[0]);\n\n    return 0;\n}<\/code><\/pre>\n
1012 \u6ce8\u610f\u4ea4\u9519\u4e3a0\uff0c\u4e0d\u540c\u7c7b\u578b\u8fd0\u7b97\u8f6c\u6362<\/h4>\n
#include <iostream>\n#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n    int A[6];\n    memset(A, 0, sizeof(A));\n    int n, a, b = 0;\n    float num = 0;\n    scanf("%d", &n);\n    for(int i = 0; i < n; i++) {\n        scanf("%d", &a);\n        switch(a % 5) {\n            case 0: A[1] += a % 2 ? 0: a;            break;\n            case 1: b = (b==1 ? -1: 1); A[2] += a*b; break;\n            case 2: A[3] ++;                         break;\n            case 3: A[4] += a; num++;                break;\n            case 4: A[5] = A[5] > a ? A[5] : a;      break;\n        }\n    }\n    if(A[1]) printf("%d ", A[1]);               else printf("N ");\n    if(b)    printf("%d ", A[2]);               else printf("N ");\n    if(A[3]) printf("%d ", A[3]);               else printf("N ");\n    if(A[4]) printf("%.1f ", A[4] \/ num);       else printf("N ");\n    if(A[5]) printf("%d",  A[5]);               else printf("N");\n    return 0;\n}<\/code><\/pre>\n
1013 \u7ebf\u6027\u7d20\u6570\u7b5b\u3001\u6ce8\u610f\u6570\u7ec4\u662f\u5426\u591f\u5bb9\u7eb3\u4e0a\u754c<\/h4>\n
#include <iostream>\n#include <bits\/stdc++.h>\nusing namespace std;\n\nconst int maxn = 110000;\nbool isPrime[maxn];\nint a[10001];\n\nint main()\n{\n    int m, n, composite, count = 1, cnt = 1;\n    scanf("%d%d", &m, &n);\n    memset(isPrime, true, sizeof(isPrime));\n\n    for (int i = 2; cnt <= n; i++) {\n        if (isPrime[i]) a[cnt++] = i;\n        for (int j = 1; j < cnt; j++) {\n            if ((composite = a[j] * i) >= maxn) break;\n            isPrime[composite] = false;\n            if (i % a[j] == 0) break;\n        }\n    }\n\n    for (int i = m; i <= n; i++) {\n        if (count++ % 10 == 0 || i == n) printf("%d\\n", a[i]);\n        else printf("%d ", a[i]);\n    }\n\n    return 0;\n}<\/code><\/pre>\n
1014 \u6307\u9488\u904d\u5386\u6cd5\u3001\u5206\u6bb5\u6a21\u62df\u3001\u9690\u542b\u8f93\u5165\u9650\u5b9a<\/h4>\n
\u907f\u514d\u8fc7\u591a\u6570\u7ec4\u4e0b\u6807\u64cd\u4f5c\u8ba1\u7b97\uff0c\u9632\u6b62\u8ba1\u7b97\u7e41\u590d\u548c\u9891\u7e41\u8bfb\u5199<\/p>\n
\u590d\u6742\u6a21\u62df\u5c3d\u91cf\u5206\u6bb5\u5b9e\u73b0\uff0c\u907f\u514d\u8026\u5408\u548c\u4ee3\u7801\u96be\u7406\u89e3<\/p>\n
\u6ce8\u610f\u9690\u542b\u8f93\u5165\u9650\u5236\uff0c\u661f\u671f\u8303\u56f4\u3001\u6570\u5b57\u548c\u5b57\u6bcd\u3001\u4ee5\u53ca\u5b57\u6bcd\u5927\u5c0f\u5199<\/p>\n
#include <iostream>\n#include <string.h>\nusing namespace std;\n\nint main()\n{\n    char day[7][4] = {"MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN"};\n    char s0[61], s1[61], s2[61], s3[61];\n    int d = 0, h, m = 0;\n    scanf("%s%s%s%s", s0, s1, s2, s3);\n\n    while (s0[d] && s1[d]) {\n        if (s0[d] == s1[d] && s0[d] >= 'A' && s0[d] <= 'G')\n            break;\n        d++;\n    }\n\n    h = d + 1;\n    while (s0[h] && s1[h]) {\n        if (s0[h] == s1[h]) {\n            if (s0[h] >= 'A' && s0[h] <= 'N') {\n                h = s0[h] - 'A' + 10;\n                break;\n            }\n            else if (s0[h] >= '0' && s0[h] <= '9') {\n                h = s0[h] - '0';\n                break;\n            }\n        }\n        h++;\n    }\n\n    while (s2[m] && s3[m]) {\n        if (s2[m] == s3[m])\n            if (s2[m] >= 'a' && s2[m] <= 'z' || s2[m] >= 'A' && s2[m] <= 'Z')\n                break;\n        m++;\n    }\n\n    printf("%s %02d:%02d", day[s0[d] - 'A'], h, m);\n\n    return 0;\n}<\/code><\/pre>\n
1017 \u7ad6\u5f0f\u9664\u6cd5\u6a21\u62df\u3001\u6ce8\u610f0\u5904\u7406<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main()\n{\n    char s[1001], *p = s;\n    int n, d = 0;\n    scanf("%s%d", s, &n);\n    for (int i = 0; s[i]; i++)\n    {\n        d = d * 10 + s[i] - '0';\n        s[i] = d \/ n + '0';\n        d %= n;\n    }\n    if(p[0] == '0' && p[1]) p++;\n    printf("%s %d", p, d);\n    return 0;\n}<\/code><\/pre>\n
1019 sort\u7528\u6cd5<\/h4>\n
#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint main() {\n    int s[4], t[4];\n    int sNum, tNum;\n    scanf("%d", &tNum);\n    sNum = tNum;\n\n    while(true)\n    {\n        s[0] = sNum \/ 1000;\n        s[1] = sNum % 1000 \/ 100;\n        s[2] = sNum % 100 \/ 10;\n        s[3] = sNum % 10;\n\n        sort(s, s + 4);\n        for(int i = 0; i < 4; i++)\n            t[i] = s[3 - i];\n\n        tNum = t[3] + 10 * t[2] + 100 * t[1] + 1000 * t[0];\n        sNum = s[3] + 10 * s[2] + 100 * s[1] + 1000 * s[0];\n        printf("%04d - %04d = ", tNum, sNum);\n        if(tNum == sNum) { printf("%04d\\n", 0); break; }\n        printf("%04d\\n", tNum -= sNum);\n        if(tNum == 6174) break;\n        sNum = tNum;\n    }\n    return 0;\n}<\/code><\/pre>\n
1022 \u8fdb\u5236\u8f6c\u6362\u9664k\u53d6\u4f59\u6cd5<\/h4>\n
#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n    int a, b, d;\n    vector<int> v;\n    scanf("%d%d%d", &a, &b, &d);\n    a = a + b;\n\n    while(a != 0) {\n        v.push_back(a % d);\n        a \/= d;\n    }\n\n    if(v.size())\n        for(int i = v.size() - 1; i >= 0; i--)\n            printf("%d", v[i]);\n    else printf("0");\n\n    return 0;\n}<\/code><\/pre>\n
1023 \u8fb9\u904d\u5386\u8fb9\u5904\u7406<\/h4>\n
\u66f4\u7b80\u6d01\u7684\u89e3\u6cd5\u6765\u81ea\u4e8e @OliverLew<\/a> \uff0c\u9884\u5148\u53d60\uff0c\u5e76\u5728\u4e4b\u540e\u7684\u8f93\u5165\u4e2d\u68c0\u6d4b\u4e00\u6b21\u6027\u8f93\u51fa0\uff0c\u4e00\u8fb9\u8bfb\u5165\u4e00\u8fb9\u8f93\u51fa\uff0cO(1)\u5185\u5b58\u6709\u88ab\u60ca\u8273\u5230<\/p>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    int num[10], start = 10;\n    for (int i = 0; i < 10; i++) {\n        scanf("%d", &num[i]);\n        if(i < start && i && num[i])\n            start = i;\n    }\n\n    if(start == 10) printf("%d", 0);\n    else {\n        printf("%d", start);\n        num[start]--;\n\n        for(int i = 0; i < 10; i++)\n            while(num[i]--)\n                printf("%d", i);\n    }\n\n    return 0;\n}<\/code><\/pre>\n
1027 \u8f93\u5165\u683c\u5f0f\u3001\u7edf\u4e00\u89c4\u5f8b<\/h4>\n
\u4e0b\u89e3\u7ed9\u51fa\u5012\u4e09\u89d2\u548c\u6b63\u4e09\u89d2\u5206\u522b\u8f93\u51fa\u60c5\u51b5<\/p>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    int n, i = 3, j = 1;\n    char c;\n    scanf("%d %c", &n, &c);\n\n    while(j + 2 * i <= n) {\n        j += 2 * i;\n        i += 2;\n    }\n    i -= 2;\n\n    int b = 0;\n    for(int k = i; k >= 1; k -= 2) {\n        int l = k, t = b++;\n        while(t--) putchar(' ');\n        while(l--) putchar(c);\n        putchar('\\n');\n    }\n\n    b = i \/ 2 - 1;\n    for(int k = 3; k <= i; k += 2) {\n        int l = k, t = b--;\n        while(t--) putchar(' ');\n        while(l--) putchar(c);\n        putchar('\\n');\n    }\n\n    printf("%d", n - j);\n    return 0;\n}<\/code><\/pre>\n
\u66f4\u7b80\u4fbf\u7684\u529e\u6cd5\u662f\u7edf\u4e00\u8f93\u51fa\u89c4\u5f8b<\/p>\n
#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main() {\n    int n; char c;\n    scanf("%d %c", &n, &c);\n    int medium = (int) sqrt((n + 1) \/ 2);\n\n    for(int row = 1; row <= 2 * medium - 1; row++) {\n        for(int i = 1; i <= medium - abs(row - medium) - 1; i++) putchar(' ');\n        for(int i = 1; i <= 2 * abs(row - medium) + 1; i++) putchar(c);\n        putchar('\\n');\n    }\n\n    printf("%d", n - 2 * medium * medium + 1);\n    return 0;\n}<\/code><\/pre>\n
1028 \u53cc\u91cd\u6392\u5e8f\u89c4\u5219\u3001\u8bfb\u5165\u7279\u6b8a\u683c\u5f0f\u3001\u7b80\u5316\u601d\u7ef4<\/h4>\n
#include <iostream>\nusing namespace std;\n\nstruct Person {\n    char name[6];\n    int yy, mm, dd;\n} maxP, minP, tmp, down, up;\n\n\/\/ \u8f6c\u4e3a\u65f6\u95f4\u6233\u6bd4\u8f83\u6216\u8bfb\u5165\u5b57\u7b26\u4e32strcmp\u66f4\u6613\nbool isAbove(Person &high, Person &low) {\n    if(high.yy != low.yy) return high.yy < low.yy;\n    if(high.mm != low.mm) return high.mm < low.mm;\n    return high.dd <= low.dd;\n}\n\nint main() {\n    int cnt, num = 0;\n    down.yy = 1814; down.mm = 9; down.dd = 6;\n    up.yy = 2014; up.mm = 9; up.dd = 6;\n    minP = down; maxP = up;\n\n    scanf("%d", &cnt);\n\n    for(int i = 0; i < cnt; i++) {\n\n        scanf("%s%d\/%d\/%d", tmp.name, &tmp.yy, &tmp.mm, &tmp.dd);\n\n        if(isAbove(down, tmp) && isAbove(tmp, up)) {\n\n            if(isAbove(tmp, maxP)) maxP = tmp;\n\n            if(isAbove(minP, tmp)) minP = tmp;\n\n            num++;\n        }\n    }\n\n    if(num) printf("%d %s %s", num, maxP.name, minP.name);\n    else printf("0");\n\n    return 0;\n}<\/code><\/pre>\n
1029 \u6563\u5217\u601d\u60f3\u3001\u7edf\u4e00\u5f62\u5f0f\u3001\u5927\u5c0f\u5199\u8f6c\u6362<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main()\n{\n    char s0[10000], s1[10000], *p = s1, c;\n    bool map[256] = {0};\n    scanf("%s%s", s0, s1);\n\n    while (c = *p) {\n        if(*p >= 'a' && *p <= 'z')\n            c = *p - 32;\n        map[c] = true;\n        p++;\n    }\n\n    p = s0;\n    while (c = *p) {\n        if(*p >= 'a' && *p <= 'z')\n            c = *p - 32;\n        if (!map[c]) {\n            putchar(c);\n            map[c] = true;\n        }\n        p++;\n    }\n\n    return 0;\n}<\/code><\/pre>\n
1032 \u7ed3\u679c\u4fdd\u5b58\u548c\u6700\u503c<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    int n, t, maxN, maxP = -1;\n    scanf("%d\\n", &n);\n    int p[n + 1] = {0};\n\n    while(~scanf("%d %d", &n, &t)) {\n        p[n] += t;\n        if(p[n] > maxP) {\n            maxP = p[n];\n            maxN = n;\n        }\n    }\n\n    printf("%d %d", maxN, maxP);\n\n    return 0;\n}<\/code><\/pre>\n
1033 \u6563\u5217\u601d\u60f3\u3001\u7edf\u4e00\u5f62\u5f0f<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main(){\n    int map[256] = {0};\n    char c, t;\n    while((c = getchar()) != '\\n') {\n        if(c >= 'a' && c <= 'z')\n            c -= 32;\n        map[c]++;\n    }\n\n    while((c = getchar()) != '\\n') {\n        if(map['+'] && c >= 'A' && c <= 'Z')\n            continue;\n        t = c;\n        if(c >= 'a' && c <= 'z')\n            t = c - 32;\n        if(!map[t]) putchar(c);\n    }\n    return 0;\n}<\/code><\/pre>\n
1037 \u7c7b\u8fdb\u5236\u8ba1\u7b97\u3001\u8d1f\u6570\u6a21\u8fd0\u7b97\u4e3a\u8d1f\u7ed3\u679c\u3001\u6ce8\u610f0<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main()\n{\n    int g0, s0, k0;\n    int g1, s1, k1;\n    scanf("%d.%d.%d", &g0, &s0, &k0);\n    scanf("%d.%d.%d", &g1, &s1, &k1);\n    long t0 = k0 + s0 * 29 + g0 * 493;\n    long t1 = k1 + s1 * 29 + g1 * 493;\n    if(t1 >= t0) printf("%d.%d.%d", (t1 - t0) \/ 493, (t1 - t0) % 493 \/ 29, (t1 - t0) % 29);\n    else printf("-%d.%d.%d", (t0 - t1) \/ 493, (t0 - t1) % 493 \/ 29, (t0 - t1) % 29);\n    return 0;\n}<\/code><\/pre>\n
1038 \u6ce8\u610f\u6570\u7ec4\u521d\u59cb\u5316<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main()\n{\n    int N, K, p;\n    scanf("%d", &N);\n    int a[101] = {0};\n\n    for (int i = 0; i < N; i++) {\n        scanf("%d", &p);\n        a[p]++;\n    }\n\n    scanf("%d", &K);\n    while (--K) {\n        scanf("%d", &p);\n        printf("%d ", a[p]);\n    }\n    scanf("%d", &p);\n    printf("%d", a[p]);\n    return 0;\n}<\/code><\/pre>\n
1039 \u7c7b\u6876\u6392\u601d\u60f3\u3001\u8f93\u51fa\u5e26\u7b26\u53f7\u683c\u5f0f<\/h4>\n
#include <iostream>\n#include <bits\/stdc++.h>\nusing namespace std;\n\nint main()\n{\n    int pearl[256], less = 0, more = 0;\n    char c;\n    memset(pearl, 0, sizeof(pearl));\n    while ((c = getchar()) != '\\n')\n        pearl[c]++;\n    while ((c = getchar()) != '\\n')\n        pearl[c]--;\n    for (int i = 0; i < 256; i++) {\n        if (pearl[i] < 0)        less -= pearl[i];\n        else if (pearl[i] > 0)   more += pearl[i];\n    }\n    if (less) printf("No %d", less);\n    else printf("Yes %d", more);\n    return 0;\n}<\/code><\/pre>\n
1042 \u6700\u503c\u3001\u53cc\u91cd\u6392\u5e8f\u89c4\u5219<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main()\n{\n    char c;\n    int max = 25;\n    int num[26] = {0};\n    while ((c = getchar()) != '\\n')\n    {\n        if (c >= 'a' && c <= 'z')\n            num[c - 'a']++;\n        else if (c >= 'A' && c <= 'Z')\n            num[c - 'A']++;\n    }\n\n    for (int i = 24; i >= 0; i--)\n        if (num[i] >= num[max])\n            max = i;\n\n    printf("%c %d", max + 'a', num[max]);\n    return 0;\n}<\/code><\/pre>\n
1048 \u53cc\u6307\u9488\u3001char\u8fd0\u7b97\u8f6cint\u3001\u7edf\u4e000<\/h4>\n
#include <iostream>\n#include <string.h>\nusing namespace std;\n\nint main()\n{\n    char a[101], b[101];\n    scanf("%s%s", a, b);\n    int i, j, cnt = 1;\n    i = strlen(a) - 1;\n    j = strlen(b) - 1;\n    cnt = max(i, j);\n    a[cnt + 1] = '\\0';\n    int A, B, tmp, flag = 1;\n\n    while (cnt >= 0) {\n        \/\/ \u6216\u7528\u5e73\u79fb\u65b9\u6cd5\uff0c\u901a\u8fc7\u4e0b\u6807\u6620\u5c04\u6765\u5bf9\u9f50\u8fd0\u7b97\n        A = i < 0 ? 0 : a[i] - '0';\n        B = j < 0 ? 0 : b[j] - '0';\n\n        if (flag) {\n            tmp = (A + B) % 13;\n            if (tmp == 10) a[cnt] = 'J';\n            else if (tmp == 11) a[cnt] = 'Q';\n            else if (tmp == 12) a[cnt] = 'K';\n            else a[cnt] = tmp + '0';\n        }\n        else {\n            tmp = B - A;\n            if (tmp < 0) a[cnt] = tmp + 10 + '0';\n            else a[cnt] = tmp + '0';\n        }\n\n        cnt--;\n        flag = !flag;\n        if (i != -1) i--;\n        if (j != -1) j--;\n    }\n    printf("%s\\n", a);\n    return 0;\n}<\/code><\/pre>\n
1049 int\u6ea2\u51fa\u3001double\u4e0d\u7cbe\u786e\u3001\u6570\u5b57\u89c4\u5f8b<\/h4>\n
\u679a\u4e3e\u4f1a\u8d85\u65f6\uff0c\u6545\u5bfb\u627e\u6570\u5b57\u89c4\u5f8b<\/p>\n
\u5faa\u73af\u4f53\u6838\u5fc3\u8bed\u53e5num\u5fc5\u987b\u7f6e\u524d\u4e14\u4e3a\u8f83\u5927\u7684\u7c7b\u578b\uff0c\u5426\u5219\u5148\u7b97i * (N – i + 1)\u53ef\u80fd\u4f1a\u5bfc\u81f4int\u6ea2\u51fa<\/p>\n
IEEE754\u7684double\u53ea\u662f\u8fd1\u4f3c\u503c\uff0c\u4e3a\u8fbe\u5230\u53ef\u7528\u7cbe\u5ea6\uff0c\u5148\u632a\u52a8\u5c0f\u6570\u70b9\u8ba1\u7b97\u540e\u518d\u6062\u590d\u5c0f\u6570\u70b9<\/p>\n
\u6ce8\u610f\u5f3a\u5236\u8f6c\u578b\u662f\u5c31\u8fd1\u7ed3\u5408\u7684\uff0cdouble\u8f6clong long\u65f6\u6574\u4f53\u8fd0\u7b97\u8f6c\u578b\u9700\u8981\u52a0\u62ec\u53f7\u4ee5\u9632\u6b62\u7cbe\u5ea6\u4e22\u5931<\/p>\n
\u53c2\u8003 @zhengrh<\/a><\/p>\n
#include <iostream>\nusing namespace std;\n\nint main()\n{\n    int N;\n    double num;\n    long long sum = 0;\n\n    scanf("%d", &N);\n    for (int i = 1; i <= N; i++) {\n        scanf("%lf", &num);\n        sum += (long long) (num * 1000) * i * (N - i + 1);\n    }\n    printf("%.2f", sum \/ 1000.0);\n\n    return 0;\n}<\/code><\/pre>\n
1052 \u7279\u6b8a\u5b57\u7b26\u8bfb\u53d6\u3001\u8f6c\u4e49\u3001\u6b63\u5219\u8bfb\u53d6<\/h4>\n
\u8fd9\u9053\u9898\u6709\u591f\u5751\u7684\uff0cif\u6761\u4ef6\u4e4b\u591a\u4e5f\u662f\u76ee\u524d\u4e4b\u6700\u4e86\uff0c\u6b64\u5904\u53c2\u8003 @OliverLew<\/a> \u6e90\u7801<\/p>\n
#include <iostream>\n#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n    char c, symbol[3][10][5];\n    memset(symbol, '\\0', sizeof(symbol));\n\n    for(int i = 0; i < 3; i++)\n        for(int j = 0; (c = getchar()) != '\\n'; j)\n            if(c == '[') scanf("%[^]]", symbol[i][j++]);\n\n    int n, index[5];\n    scanf("%d", &n);\n    while(n--)\n    {\n        for(int i = 0; i < 5; i++)\n            scanf("%d", &index[i]);\n\n        if (index[0] > 0 && index[0] <= 10 && *symbol[0][--index[0]]\n            && index[1] > 0 && index[1] <= 10 && *symbol[1][--index[1]]\n            && index[2] > 0 && index[2] <= 10 && *symbol[2][--index[2]]\n            && index[3] > 0 && index[3] <= 10 && *symbol[1][--index[3]]\n            && index[4] > 0 && index[4] <= 10 && *symbol[0][--index[4]])\n            printf("%s(%s%s%s)%s\\n",symbol[0][index[0]],symbol[1][index[1]],symbol[2][index[2]],symbol[1][index[3]],symbol[0][index[4]]);\n        else printf("Are you kidding me? @\\\\\/@\\n");\n    }\n\n    return 0;\n}<\/code><\/pre>\n
1082 \u601d\u7ef4\u8f6c\u6362\u53d6\u503c\u5927\u7684\u53cd\u800c\u5c0f<\/h4>\n
#include <iostream>\nusing namespace std;\nint main() {\n    while(getchar() != '\\n');\n    int mx = -1, mn = 10001, mxN, mnN, x, y, pos, t;\n    while(~scanf("%d%d%d", &t, &x, &y)) {\n        pos =  x * x + y * y;\n        if(pos > mx) { mxN = t; mx = pos; }\n        if(pos < mn) { mnN = t; mn = pos; }\n    }\n\n    printf("%04d %04d", mnN, mxN);\n\n    return 0;\n}<\/code><\/pre>\n
1088 \u6ce8\u610f\u53d8\u91cf\u53ef\u80fd\u4e3adouble\u578b<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    int M, X, Y, a, b;\n    double c;\n    scanf("%d%d%d", &M, &X, &Y);\n    for(int a = 99; a >= 10; a--) {\n        b = a % 10 * 10 + a \/ 10;\n        if(a > b)       c = (a - b) * 1.0 \/ X;\n        else            c = (b - a) * 1.0 \/ X;\n\n        if(b == Y * c) {\n            printf("%d", a);\n            printf(M > a ? " Gai": (M < a ? " Cong": " Ping"));\n            printf(M > b ? " Gai": (M < b ? " Cong": " Ping"));\n            printf(M > c ? " Gai": (M < c ? " Cong": " Ping"));\n            return 0;\n        } \n    }\n    printf("No Solution");\n    return 0;\n}<\/code><\/pre>\n
1089 \u66b4\u529b\u679a\u4e3e<\/h4>\n
\u77e5\u9053\u662f\u66b4\u529b\u679a\u4e3e\u6709\u4ec0\u4e48\u7528\uff0c\u8fd8\u4e0d\u662f\u88ab\u6253\u8d25\u4e86\u6ca1\u6a21\u62df\u51fa\u6765\u2026\u4e0b\u6b21\u518d\u6765<\/p>\n
1092 \u7ed3\u6784\u4f53\u6570\u7ec4\u521d\u59cb\u5316\u548c\u6392\u5e8f\u3001\u5faa\u73af\u8fb9\u754c<\/h4>\n
\u53ef\u4ee5\u4e0d\u6392\u5e8f\uff0c\u4e00\u6b21\u904d\u5386\u8bb0\u5f55\u6700\u5927\u503c\u5e8f\u53f7\uff0c\u4e00\u6b21\u904d\u5386\u8f93\u51fa\u6240\u6709\u6700\u5927\u503c\u5e8f\u53f7<\/p>\n
#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nstruct B{\n    int type;\n    int sell;\n};\n\nbool cmp (B b1, B b2) {\n    if(b1.sell != b2.sell) return b1.sell > b2.sell;\n    return b1.type < b2.type;\n}\n\nint main() {\n    int N, M, T;\n    scanf("%d%d", &N, &M);\n    B Ins[N] = {0};\n\n    while(M--) {\n        for(int i = 0; i < N; i++) {\n            scanf("%d", &T);\n            Ins[i].type = i + 1;\n            Ins[i].sell += T;\n        }\n    }\n\n    sort(Ins, Ins + N, cmp);\n    T = Ins[0].sell;\n    printf("%d\\n", T);\n    printf("%d", Ins[0].type);\n    for(int i = 0; i < N - 1 && Ins[i + 1].sell == T; i++)\n        printf(" %d", Ins[i + 1].type);\n    return 0;\n}<\/code><\/pre>\n
1093 getchar != EOF\u8bfb\u5165\u6362\u884c\u4e5f\u4f1a\u505c\u6b62<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    bool isExist[128] = {0};\n    char c;\n    int i = 2;\n    while(i) {\n        while((c = getchar()) != '\\n') {\n            if(!isExist[c]) {\n                isExist[c] = true;\n                putchar(c);\n            }\n        }\n        i--;\n    }\n\n    return 0;\n}<\/code><\/pre>\n
1094 \u6ce8\u610f\u5df2\u7ed9\u5b9a\u957f\u5ea6\uff0c\u5b57\u7b26\u4e32\u8f6c\u6574\u6570<\/h4>\n
\u5b57\u7b26\u4e32\u8f6c\u6574\u6570\u5e93\u51fd\u6570<\/p>\n
\n#include \n#include \nint atoi(const char *nptr);\n<\/pre>\n
\u590d\u5236\u6307\u5b9a\u5730\u5740\u5f00\u59cb\u6307\u5b9a\u4e2a\u6570\u5b57\u7b26\u5230\u5b57\u7b26\u6570\u7ec4\u5e93\u51fd\u6570<\/p>\n
\n#include \nchar *strncpy(char *dest, const char *src, int n)\n<\/pre>\n
#include <iostream>\nusing namespace std;\n\nbool isPrime(long long n) {\n    if(n <= 1) return false;\n    for(long long i = 2; i * i <= n; i++)\n        if(n % i == 0) return false;\n    return true;\n}\n\nlong long toNum(char *p, int i) {\n    long long e = 1;\n    long long sum = 0;\n    for(; i >= 0; i--) {\n        sum += (*(p + i) - '0') * e;\n        e *= 10;\n    }\n    return sum;\n}\n\nint main() {\n    int n, k;\n    char s[1000], *p = s;\n    scanf("%d %d", &n, &k);\n    scanf("%s", s);\n    k--;\n    while(*p) {\n        long long num = toNum(p, k);\n        if(isPrime(num)) {\n            for(int i = 0; i <= k; i++)\n                printf("%c", *(p + i));\n            return 0;\n        }\n        p++;\n    }\n    printf("404");\n    return 0;\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u6301\u7eed\u66f4\u65b0\u4e2d 1002 \u5927\u6574\u6570\u7684\u5b57\u7b26\u4e32\u5b58\u50a8 #include <iostream> #include … <\/p>\n
\u7ee7\u7eed\u9605\u8bfb\u201cPAT – BASIC – 20POINTS[updating]\u201d<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[12],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/1660"}],"collection":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1660"}],"version-history":[{"count":55,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/1660\/revisions"}],"predecessor-version":[{"id":2736,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/1660\/revisions\/2736"}],"wp:attachment":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1660"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1660"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1660"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}