{"id":1615,"date":"2018-03-11T21:47:58","date_gmt":"2018-03-11T13:47:58","guid":{"rendered":"http:\/\/47.101.202.111\/?p=1615"},"modified":"2023-04-07T12:52:33","modified_gmt":"2023-04-07T04:52:33","slug":"pat%e4%b9%99%e7%ba%a7%e9%a2%98%e8%a7%a3%e6%8c%81%e7%bb%ad%e6%9b%b4%e6%96%b0","status":"publish","type":"post","link":"http:\/\/139.196.114.170\/?p=1615","title":{"rendered":"PAT- BASIC – 15POINTS"},"content":{"rendered":"

\u6807\u9898\u6807\u660e\u6ce8\u610f\u70b9\u53ca\u76f8\u5173\u542f\u53d1<\/p>\n

1001 \u7b80\u5355\u8ba1\u6570\u5668<\/h4>\n
#include<iostream>\nusing namespace std;\n\nint cnt = 0;\n\nint main(){\n    int n;\n    while(~scanf("%d", &n)) {\n        while(n != 1) {\n            if(n % 2 == 0) n \/= 2;\n            else n = (3 * n + 1) \/ 2;\n            cnt++;\n        }\n        printf("%d", cnt);\n    }\n\n    return 0;\n}<\/code><\/pre>\n
1006 \u53d6\u6a21\u4e0e\u57fa\u672c\u8f93\u5165\u8f93\u51fa<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main()\n{\n    int n;\n    int m[3];\n    while (~scanf("%d", &n)) {\n\n        for (int i = 0; i < 3; i++) {\n            m[i] = n % 10;\n            n \/= 10;\n        }\n\n        for (int i = 2; i >= 0; i--) {\n            int j = 1;\n            while (m[i]--) {\n                if (i == 2) printf("B");\n                else if (i == 1) printf("S");\n                else printf("%d", j++);\n            }\n        }\n\n        printf("\\n");\n    }\n\n}<\/code><\/pre>\n
1011 \u53d8\u91cf\u8303\u56f4<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main(){\n    long long a, b, c;\n    int n;\n    while(~scanf("%d", &n)){\n        int i = 1;\n        while(n--){\n            scanf("%lld%lld%lld", &a, &b, &c);\n            if(a + b > c) printf("Case #%d: true", i++);\n            else printf("Case #%d: false", i++);\n            printf("\\n");\n        }\n    }\n    return 0;\n}<\/code><\/pre>\n
1016 \u5927\u6574\u6570\u4e0e\u5341\u8fdb\u5236\u8ba1\u7b97<\/h4>\n
#include<iostream>\nusing namespace std;\n\nlong long P(char x[], int y)\n{\n    long long sum = 0;\n    for(int i = 0; x[i]; i++)\n        if(x[i] - '0' == y)\n            sum = 10 * sum + y;\n    return sum;\n}\n\nint main() {\n    char a[10], c[10];\n    int b, d;\n    while(~scanf("%s%d%s%d", &a, &b, &c, &d))\n        printf("%lld\\n", P(a, b) + P(c, d));\n    return 0;\n}<\/code><\/pre>\n
1021 \u7b80\u5355\u57fa\u6570\u6392\u5e8f\u601d\u60f3<\/h4>\n
#include <iostream>\n#include <bits\/stdc++.h>\nusing namespace std;\n\nint main() {\n    int n[10];\n    char s[1000];\n    memset(n, 0, sizeof(n));\n    while(~scanf("%s", &s)) {\n        for(int i = 0; s[i]; i++)\n            n[s[i] - '0']++;\n        for(int i = 0; i < 10; i++)\n            if(n[i]) printf("%d:%d\\n", i, n[i]);\n    }\n    return 0;\n}<\/code><\/pre>\n
1026 \u56db\u820d\u4e94\u5165\u53ca\u8f93\u51fa\u8865\u9f50<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    int c1, c2;\n    while(~scanf("%d%d", &c1, &c2)) {\n        int s = (c2 - c1 + 50) \/ 100;\n        int hh = s \/ 3600;\n        int mm = s % 3600 \/ 60;\n        int ss = s % 60;\n        printf("%02d:%02d:%02d\\n", hh, mm, ss);\n    }\n    return 0;\n}<\/code><\/pre>\n
1031 \u6ce8\u610f\u53d8\u91cf\u53d1\u751f\u53d8\u5316<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    int w[] = {7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2};\n    char z[] = {'1', '0', 'X', '9', '8', '7', '6', '5', '4', '3', '2'};\n    char s[18];\n    int n;\n    while(~scanf("%d", &n)) {\n        int cnt = n;\n        while(n--) {\n            int sum = 0;\n            bool f = true;\n            scanf("%s", &s);\n\n            for(int i = 0; i < 17; i++) {\n                if(s[i] >= '0' && s[i] <= '9')\n                    sum += w[i] * (s[i] - '0');\n                else { f = false; break;};\n            }\n\n            if(f && z[sum % 11] == s[17]) cnt--;\n            else printf("%s\\n", s);\n        }\n        if(cnt == 0) printf("All passed\\n");\n    }\n    return 0;\n}<\/code><\/pre>\n
1036 \u7a7a\u683c\u8f93\u51651\u578b\u5faa\u73af\u56db\u820d\u4e94\u5165<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main()\n{\n    int n;\n    char c;\n    scanf("%d %c", &n, &c);\n    int end = (n + 1) \/ 2;\n    for (int i = 1; i <= end; i++) {\n        for (int j = 0; j < n; j++) {\n            if (i == 1 || i == end) printf("%c", c);\n            else if (j == 0 || j == n - 1) printf("%c", c);\n            else printf(" ");\n        }\n        printf("\\n");\n    }\n\n    return 0;\n}<\/code><\/pre>\n
1041 \u5faa\u73af\u4f53\u5185\u5b58\u5206\u914d\u53ca\u6307\u9488\u6570\u7ec4<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main()\n{\n    int n, m;\n    scanf("%d", &n);\n    int exam[n + 1];\n    string atmt[n + 1];\n    while (n--)\n    {\n        int e, a;\n        char s[16];\n        scanf("%s%d%d", &s, &a, &e);\n        exam[a] = e;\n        atmt[a] = s;\n    }\n\n    scanf("%d", &m);\n    while (m--)\n    {\n        int t;\n        scanf("%d", &t);\n        printf("%s %d\\n", atmt[t].c_str(), exam[t]);\n    }\n    return 0;\n}<\/code><\/pre>\n
1046 \u53d8\u91cf\u5fc5\u8d4b\u521d\u503c\u53ca\u8003\u8651\u5f02\u6216\u5e94\u7528<\/h4>\n
#include <iostream>\nusing namespace std;\nint main() {\n    int n, a1, b1, a2, b2, c1 = 0, c2 = 0;\n    scanf("%d", &n);\n    while(n--) {\n        scanf("%d%d%d%d", &a1, &b1, &a2, &b2);\n        int r = a1 + a2;\n        int d1 = r == b1;\n        int d2 = r == b2;\n        if(d1 > d2) { c2++; continue; }\n        if(d1 < d2) c1++;\n    }\n    printf("%d %d\\n", c1, c2);\n    return 0;\n}<\/code><\/pre>\n
1051 \u6570\u5b66\u51fd\u6570\u3001\u8f93\u51fa\u5c0f\u6570\u820d\u5165\u3001\u7b80\u5316<\/h4>\n
#include <iostream>\n#include <math.h>\nusing namespace std;\n\nint main()\n{\n    double r1, p1, r2, p2, a, b;\n    scanf("%lf%lf%lf%lf", &r1, &p1, &r2, &p2);\n    a = r1 * r2 * cos(p1 + p2);\n    b = r1 * r2 * sin(p1 + p2);\n\n    if (a < 0 && a > -0.005) a = 0.0;\n    if (b < 0 && b > -0.005) b = 0.0;\n    printf("%.2f%+.2fi", a, b);\n\n    return 0;\n}<\/code><\/pre>\n
1056 \u679a\u4e3e\u4e0b\u6807\u3001\u95ee\u9898\u8f6c\u5316<\/h4>\n
int main() {\n    int n, a, sum = 0;\n    scanf("%d", &n);\n    for (int i = 0; i < n; i++) {\n        scanf("%d", &a);\n        sum += a;\n    }\n    printf("%d\\n", sum * 11 * (n - 1));\n    return 0;\n}<\/code><\/pre>\n
1061 \u8f93\u5165\u65f6&\u7b26\u3001\u4e8c\u7ef4\u6570\u7ec4\u6307\u9488<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    int n, m, x, sum = 0;\n    scanf("%d%d", &n, &m);\n    int s[m], a[m], r[m];\n    for (int i = 0; i < m; i++)\n        scanf("%d", s + i);\n\n    for (int i = 0; i < m; i++)\n        scanf("%d", a + i);\n\n    for (int i = 0; i < n; i++) {\n        for (int j = 0; j < m; j++) {\n            scanf("%d", &x);\n            if (x == a[j]) sum += s[j];\n        }\n        printf("%d\\n", sum);\n        sum = 0;\n    }\n    return 0;\n}<\/code><\/pre>\n
1071 \u8fd0\u7b97\u7b26\u4f18\u5148\u7ea7<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main()\n{\n    int t0, k, n1, b, t, n2;\n    scanf("%d%d", &t0, &k);\n    while (k--)\n    {\n        scanf("%d%d%d%d", &n1, &b, &t, &n2);\n        if (t0 <= 0) { printf("Game Over.\\n"); break; }\n        else if (t0 < t) printf("Not enough tokens.  Total = %d.\\n", t0);\n        else if ((b == 0 && n1 > n2) || (b == 1 && n1 < n2)) { t0 += t; printf("Win %d!  Total = %d.\\n", t, t0); }\n        else { t0 -= t; printf("Lose %d.  Total = %d.\\n", t, t0); }\n    }\n    return 0;\n}<\/code><\/pre>\n
1076 \u7a7a\u683c\u6362\u884c\u5904\u7406\u3001\u6ce8\u610f\u7d22\u5f15\u3001\u7b80\u5316\u63a7\u5236<\/h4>\n
#include <iostream>\nusing namespace std;\nint main() {\n    char s[4];\n    while (~scanf("%s", &s))\n        if (s[2] == 'T')\n            printf("%d", s[0] - 'A' + 1);\n    return 0;\n}<\/code><\/pre>\n
1081 \u63a7\u5236\u7ed3\u6784\u3001getline<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    bool nF, aF, qF;\n    string s;\n    getline(cin, s);\n    while(getline(cin, s)) {\n        nF = aF = qF =false;\n        if(s.length() < 6) {\n            puts("Your password is tai duan le.");\n            continue;\n        }\n        for(int i = 0; s[i]; i++) {\n            if((s[i] >= 'a' && s[i] <= 'z') || (s[i] >= 'A' && s[i] <= 'Z'))\n                aF = true;\n            else if(s[i] >= '0' && s[i] <= '9')\n                nF = true;\n            else if(s[i] != '.') {\n                qF = true;\n                break;\n            }\n        }\n        if (qF)            puts("Your password is tai luan le.");\n        else if(aF && nF)  puts("Your password is wan mei.");\n        else if(aF)        puts("Your password needs shu zi.");\n        else               puts("Your password needs zi mu.");\n    }\n    return 0;\n}<\/code><\/pre>\n
1086 \u6ce8\u610f0\u7684\u5904\u7406<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main () {\n    int a, b;\n    scanf("%d%d", &a, &b);\n    a = a * b;\n    if(!a) { printf("0\\n"); return 0; }\n    while(!(a % 10)) a \/= 10;\n    while(a) { printf("%d", a % 10); a \/= 10; }\n    printf("\\n");\n    return 0;\n}<\/code><\/pre>\n
1091 \u4e0d\u540c\u7c7b\u578b\u4e4b\u95f4\u8fd0\u7b97\u8f6c\u6362<\/h4>\n
#include <iostream>\nusing namespace std;\n\nint main()\n{\n    int m, n;\n    long long k, l, s, t;\n    scanf("%d", &m);\n    while (m--) {\n        scanf("%lld", &k);\n        t = k;\n\n        for (s = 1; t; s *= 10)\n            t \/= 10;\n\n        for (n = 1; n < 10; n++) {\n            l = n * k * k;\n            if (l % s == k) {\n                printf("%d %lld\\n", n, l);\n                break;\n            }\n        }\n        if (n == 10) printf("No\\n");\n    }\n    return 0;\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u6807\u9898\u6807\u660e\u6ce8\u610f\u70b9\u53ca\u76f8\u5173\u542f\u53d1 1001 \u7b80\u5355\u8ba1\u6570\u5668 #include<iostream> using  … <\/p>\n
\u7ee7\u7eed\u9605\u8bfb\u201cPAT- BASIC – 15POINTS\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\/1615"}],"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=1615"}],"version-history":[{"count":34,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/1615\/revisions"}],"predecessor-version":[{"id":2734,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/1615\/revisions\/2734"}],"wp:attachment":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1615"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1615"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1615"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}