{"id":1862,"date":"2018-05-06T22:55:06","date_gmt":"2018-05-06T14:55:06","guid":{"rendered":"http:\/\/47.101.202.111\/?p=1862"},"modified":"2023-04-07T11:46:07","modified_gmt":"2023-04-07T03:46:07","slug":"pat-advanced-20points","status":"publish","type":"post","link":"http:\/\/139.196.114.170\/?p=1862","title":{"rendered":"PAT – ADVANCED – 20POINTS (UPDATING)"},"content":{"rendered":"

\u8fdb\u5236\u8f6c\u6362\u7c7b<\/h2>\n

\u5e38\u7528 \u9664\u4f59\u6cd5<\/strong><\/p>\n

A1001 \u53d6\u8fdb\u5236\u5404\u4f4d<\/h3>\n

\u601d\u8def1<\/strong> %10\u5f97\u672b\u4f4d\u6570\uff0c\/10\u524d\u79fb\u4e00\u4f4d\uff0c\u7531\u6b64\u5f97\u5230\u9006\u5e8f\u5404\u4f4d\u6570
\n\u601d\u8def2<\/strong> \u5206\u6bb5\u8f93\u51fa\u5de6\u5bf9\u9f50\u88650\uff0c$\\scriptsize [10^6]=n\/1000000,[10^3,10^6]=n\/1000 \\mod 1000,[0,10^3]=n \\mod 1000$<\/p>\n

int main()\n{\n    vector<char> v;\n    int a, b;\n    scanf(\"%d %d\", &a, &b);\n\n    a += b;\n    if(a < 0) { putchar('-'); a = -a; }\n    if(a == 0) v.push_back('0');\n\n    for(int i = 1; a; i++) {\n        v.push_back('0' + a % 10);\n        a \/= 10;\n        if(a && i % 3 == 0) v.push_back(',');\n    }\n\n    for(int i = v.size() - 1; i >= 0; i--)\n        putchar(v[i]);\n    putchar('n');\n    return 0;\n}\n<\/code><\/pre>\n
A1005 \u53d6\u8fdb\u5236\u5404\u4f4d\u3001\u5927\u6574\u6570\u5b57\u7b26\u4e32\u5b58\u50a8<\/h3>\n
\u6ce8\u610f0\u7279\u6b8a\u60c5\u51b5\u8f93\u51fa\u7684\u662f”zero”<\/p>\n
#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n    string chn[] = {\"zero\", \"one\", \"two\", \"three\", \"four\", \"five\", \"six\", \"seven\", \"eight\", \"nine\"};\n    vector<int> v;\n    int sum = 0, i;\n    char s[101];\n\n    scanf(\"%s\", s);\n    for (int i = 0; s[i]; i++)\n        sum += s[i] - '0';\n\n    while (sum) {\n        v.push_back(sum % 10);\n        sum \/= 10;\n    }\n\n    for (i = v.size() - 1; i > 0; i--)\n        printf(\"%s \", chn[v[i]].c_str());\n\n    if(i == -1) printf(\"zeron\");\n    else printf(\"%sn\", chn[v[0]].c_str());\n\n    return 0;\n}\n<\/code><\/pre>\n
A1008 \u8bb0\u5f55\u5faa\u73af\u65e7\u503c<\/h3>\n
\u6bcf\u6b21\u5faa\u73af\u8bb0\u5f55\u65e7\u503cpre\uff0c\u53ef\u8fed\u4ee3\u5165\u65b0\u4e00\u8f6e\u8ba1\u7b97cur<\/p>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    int N, pre = 0, cur;\n    long long sum = 0;\n    scanf(\"%d\", &N);\n\n    while (N--) {\n        scanf(\"%d\", &cur);\n        if (cur >= pre) sum += 6 * (cur - pre) + 5;\n        else sum += 4 * (pre - cur) + 5;\n        pre = cur;\n    }\n\n    printf(\"%lldn\", sum);\n\n    return 0;\n}\n<\/code><\/pre>\n
A1011 \u6c42\u53d6\u6700\u5927\u503c<\/h3>\n
\u65e0\u9700\u5f00O(n)\u6570\u7ec4\u8bb0\u5f55\uff0c\u4ec5\u9700\u4e00\u4e2a\u53d8\u91cf\u8fed\u4e58<\/p>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    double m, num, r = 1.0;\n    char n[] = {'W', 'T', 'L'};\n    int id;\n\n    for(int i = 0; i < 3; i++) {\n        m = __DBL_MIN__;\n        for(int j = 0; j < 3; j++) {\n            scanf(\"%lf\", &num);\n            if(m < num) {\n                id = j;\n                m = num;\n            }\n        }\n        r *= m;\n        printf(\"%c \", n[id]);\n    }\n\n    printf(\"%.2fn\", (0.65 * r - 1) * 2);\n\n    return 0;\n}\n<\/code><\/pre>\n
A1015 \u7d20\u6570\u5224\u65ad\u3001\u8fdb\u5236\u8f6c\u6362<\/h3>\n
\u5927\u7aefk\u8fdb\u5236\u6570\u53d6\u5f97\uff1a\u5148\u4f59k\u540e\u9664k\u5373\u53ef\u5f97\u5230
\n\u5224\u65ad\u8d28\u6570\uff1a\u95ee\u9898\u89c4\u6a21 $\\scriptsize \\lt 10^5$\uff0c\u9010\u9879\u9664\u4f59\u5373\u53ef
\n\u8f93\u5165\u683c\u5f0f\uff1a\u5148\u6ee1\u8db3\u7b2c\u4e00\u4e2a\u6570\u5408\u6cd5\uff0c\u518d\u8bfb\u5165\u53e6\u4e00\u4e2a\u6570\u8ba1\u7b97<\/p>\n
#include <iostream>\nusing namespace std;\n\nint toReverseDecimal(int n, int r) {\n    int num = 0;\n    while (n) {\n        num = num * r + n % r;\n        n \/= r;\n    }\n    return num;\n}\n\nbool isPrime(int N) {\n    if(N < 2) return false;\n    for (int i = 2; i * i <= N; i++)\n        if (N % i == 0) return false;\n    return true;\n}\n\nint main() {\n    int N, D;\n    while (~scanf(\"%d\", &N)) {\n        if (N < 0) break;\n        scanf(\"%d\", &D);\n        if (isPrime(N)) {\n            N = toReverseDecimal(N, D);\n            if (isPrime(N)) printf(\"Yesn\");\n            else printf(\"Non\");\n        }\n        else printf(\"Non\");\n    }\n    return 0;\n}\n<\/code><\/pre>\n
A1019 \u8fdb\u5236\u8f6c\u6362\u3001\u53cc\u6307\u9488<\/h3>\n
\u6ce8\u610f\u7ec6\u8282\uff1a\u6307\u9488\u7d2f\u52a0\u8bb0\u5f55\u81f3\u672b\u5c3e\u65f6\u591a\u4e00\uff0c\u8bbf\u95ee\u672b\u5c3e\u7d22\u5f15\u9700\u51cf\u4e00<\/p>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    int num[31];\n    bool isP = true;\n    int t = 0, h = 0, t1;\n    long long N, b;\n    scanf(\"%lld%lld\", &N, &b);\n\n    while (N) {\n        num[t++] = N % b;\n        N \/= b;\n    }\n\n    t -= 1;\n    t1 = t;\n    while (h < t)\n        if (num[h++] != num[t--])\n            isP = false;\n\n    if (isP)        printf(\"Yesn\");\n    else            printf(\"Non\");\n    while (t1 > 0)  printf(\"%d \", num[t1--]);\n    printf(\"%dn\", num[0]);\n\n    return 0;\n}\n<\/code><\/pre>\n
A1027 \u8fdb\u5236\u8f6c\u6362<\/h3>\n
\u672c\u9898\u4ec5\u6709\u4e24\u4f4d\uff0c\u5148\u9664\u540e\u4f59\uff0c\u65e0\u9700\u5012\u5e8f\u5904\u7406<\/p>\n
#include <iostream>\nusing namespace std;\n\nchar R[] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C'};\n\nint main() {\n    int a, b, c;\n    scanf(\"%d%d%d\", &a, &b, &c);\n    putchar('#');\n    printf(\"%c%c\", R[a \/ 13], R[a % 13]);\n    printf(\"%c%c\", R[b \/ 13], R[b % 13]);\n    printf(\"%c%c\", R[c \/ 13], R[c % 13]);\n    return 0;\n}\n<\/code><\/pre>\n
A1058 \u53d8\u8fdb\u5236\u6570<\/h3>\n
\u6b64\u9898\u6ce8\u610f\u81ea\u8eab\u53e0\u52a0\u8fd0\u7b97\u5bfc\u81f4\u67d0\u6570\u6539\u53d8\uff0c\u540e\u7eed\u91cd\u7528\u8be5\u6570\u65f6\u5df2\u4e0d\u662f\u539f\u503c\uff0c\u5e94\u4f7f\u7528\u4e2d\u95f4\u53d8\u91cf\u4fdd\u5b58\u7ed3\u679c<\/p>\n
#include<iostream>\nusing namespace std;\n\nint main() {\n    int ga, sa, ka;\n    int gb, sb, kb;\n    int of;\n    scanf(\"%d.%d.%d %d.%d.%d\", &ga, &sa, &ka, &gb, &sb, &kb);\n    of = (ka + kb) \/ 29;\n    ka = (ka + kb) % 29;\n\n    kb = sa + sb + of;\n    sa = kb % 17;\n    of = kb \/ 17;\n\n    ga = ga + gb + of;\n\n    printf(\"%d.%d.%d\", ga, sa, ka);\n    return 0;\n}\n<\/code><\/pre>\n
\u5927\u6574\u6570\u8fd0\u7b97<\/h2>\n
\u91c7\u7528 \u5b57\u7b26\u4e32\u8bfb\u5165<\/strong>\uff0c\u9010\u4f4d\u8fd0\u7b97
\n\u5e38\u89c1 \u7ad6\u5f0f\u8ba1\u7b97\u6a21\u62df<\/strong>\uff0c\u8bb0\u5f55\u501f\u4f4d\u8fdb\u4f4d\u5373\u53ef<\/p>\n
A1023 \u4e58\u6cd5\u6a21\u62df<\/h3>\n
\u4e58\u6cd5\u6a21\u62df\uff1a\u4ece\u4f4e\u4f4d\u5230\u9ad8\u4f4d\u9010\u4f4d\u4e58\u5e76\u7d2f\u52a0\u8fdb\u4f4d
\n\u8fdb\u4f4d\u5904\u7406\uff1a\u6ce8\u610f\u6700\u9ad8\u4f4d\u8fdb\u4f4d\u4f1a\u5bfc\u81f4\u957f\u5ea6\u589e\u52a0
\n\u6b63\u786e\u6027\u9a8c\u8bc1\uff1a\u539f\u59cb\u5404\u4f4d\u6570\u5b57\u8ba1\u6570num\u4e0e\u7ed3\u679c\u5404\u4f4d\u6570\u5b57num[r[i]]\u8ba1\u6570\u6bd4\u5bf9<\/p>\n
#include <iostream>\n#include <cstring>\nusing namespace std;\n\nint main() {\n    char s[21];\n    scanf(\"%s\", s);\n    int num[10] = {0}, r[21] = {0};\n    int i, j = 0, len = strlen(s);\n\n    for(i = len - 1; i >= 0; i--) {\n        int id = s[i] - '0';\n        int db = id << 1;\n\n        r[j] += db;\n        if(r[j] >= 10) r[j] -= 10;\n        r[j + 1] = (db >= 10);\n\n        num[id]++;\n        num[r[j]]--;\n        j++;\n    }\n\n    if(r[j])  num[r[j]]--;\n    else      j--;\n    i = j;\n\n    for(; j >= 0; j--)\n        if(num[r[j]]) {\n            printf(\"Non\");\n            break;\n        }\n    if(j == -1)     printf(\"Yesn\");\n    while(i >= 0)   printf(\"%d\", r[i--]);\n}\n<\/code><\/pre>\n
\u56fe\u5f62\u8f93\u51fa<\/h2>\n
\u56fe\u5f62\u8f93\u51fa\u9898\u4e3b\u8981\u662f\u5bfb\u627e\u5e8f\u53f7\u4e0e\u8f93\u51fa\u4e4b\u95f4\u7684\u89c4\u5f8b<\/p>\n
A1031 \u627e\u89c4\u5f8b\u3001\u53cc\u6307\u9488<\/h3>\n
\u679a\u4e3e\u53d1\u73b0\u89c4\u5f8b\uff1a\u56fe\u5f62\u9ad8\u5ea6h = (l + 2) \/ 3\uff0c\u4e2d\u592e\u7a7a\u683c\u6570m = l – 2 * h;
\n\u5bf9\u79f0\u8f93\u51fa\uff1a\u8f93\u51fa{s[i]\uff0cs[n-i-1]}\uff0c\u6216\u7528\u53cc\u6307\u9488\u6cd5{s[i++],s[j–]}<\/p>\n
#include <iostream>\n#include <cstring>\nusing namespace std;\n\nint main()\n{\n    int h, m, l, i, j;\n    char s[81];\n    scanf(\"%s\", s);\n\n    l = strlen(s);\n    h = (l + 2) \/ 3;\n    m = l - 2 * h;\n\n    for (i = 0, j = l - 1; i <= j; i++, j--) {\n        if (h > 1) {\n            putchar(s[i]);\n            for (int k = 0; k < m; k++)\n                putchar(' ');\n            h--;\n            putchar(s[j]);\n            putchar('n');\n        }\n        else while(i <= j) putchar(s[i++]);\n    }\n    return 0;\n}\n<\/code><\/pre>\n
\u54c8\u5e0c\u6563\u5217<\/h2>\n
\u4e3b\u8981\u662fstl::unordered_map\u7684\u4f7f\u7528<\/p>\n
A1035 \u54c8\u5e0c\u8868\u5b58\u53d6<\/h3>\n
\u5224\u65ad\u5e76\u4fee\u6539\uff1a\u904d\u5386\u5b57\u7b26\u4e32\u4f7f\u7528\u54c8\u5e0c\u8868\u67e5\u627e\u66ff\u6362
\n\u4fee\u6539\u4e2a\u6570\u8ba1\u6570\uff1a\u521d\u59cbnum=0\uff0c\u6bcf\u4e00\u5b57\u7b26\u4e32\u5224\u65ad\u53d1\u751f\u4fee\u6539++num\u5373\u4e3a\u4fee\u6539\u4e2a\u6570
\n\u8f93\u51fa\u7ed3\u679c\u96c6\uff1a\u82e5\u4fee\u6539\u4e0b\u6b21\u8bfb\u5165pswd[++num]\uff0c\u82e5\u672a\u4fee\u6539\u4e0b\u6b21\u8986\u76d6\u8bfb\u5165pswd[num]\uff0c\u7ed3\u679c\u96c6\u8303\u56f4[0,num-1]<\/p>\n
#include <iostream>\n#include <unordered_map>\nusing namespace std;\n\nint main() {\n    char user[1000][11], pswd[1000][11], cur;\n    unordered_map<char, char> map;\n    int total, i, add, num = 0;\n    map['0'] = '%';\n    map['O'] = 'o';\n    map['1'] = '@';\n    map['l'] = 'L';\n\n    scanf(\"%d\", &total);\n\n    while (~scanf(\"%s %s\", user[num], pswd[num])) {\n        i = 0; add = 0;\n        while (pswd[num][i]) {\n            cur = pswd[num][i];\n            if (map.find(cur) != map.end()) {\n                pswd[num][i] = map[cur];\n                add = 1;\n            }\n            i++;\n        }\n        num += add;\n    }\n\n    if (num > 0) {\n        printf(\"%dn\", num);\n        for (int j = 0; j < num; j++)   printf(\"%s %sn\", user[j], pswd[j]);\n    }\n    else if (total == 1)    printf(\"There is 1 account and no account is modifiedn\");\n    else                    printf(\"There are %d accounts and no account is modifiedn\", total);\n\n    return 0;\n}\n<\/code><\/pre>\n
A1041 \u6563\u5217\u8ba1\u6570<\/h3>\n
\u9898\u610f\u7406\u89e3\uff1a\u7b5b\u51fa\u7684\u662f\u53ea\u51fa\u73b0\u4e00\u6b21\uff0c\u4e14\u6309\u8f93\u5165\u5e8f\u9996\u6b21\u51fa\u73b0\u7684\u6570\u5b57
\n\u4fdd\u5b58\u8f93\u5165\u5e8f\uff1a\u6309\u8f93\u5165\u5e8f\u68c0\u7d22\u9700\u6309\u5e8f\u4fdd\u5b58\u6570\u5b57\u4e2a\u6570N\uff0c\u6700\u59271e5+1
\n\u54c8\u5e0c\u8868\u5927\u5c0f\uff1a\u6570\u5b57\u8303\u56f4[1,1e4]\uff0c\u9700\u5f001e4+1<\/p>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    int map[10001] = {0}, num[100001] = {0};\n    int N, i;\n    scanf(\"%d\", &N);\n\n    for (i = 0; i < N; i++) {\n        scanf(\"%d\", &num[i]);\n        map[num[i]]++;\n    }\n\n    for (i = 0; i < N; i++) {\n        if (map[num[i]] == 1) {\n            printf(\"%dn\", num[i]);\n            return 0;\n        }\n    }\n    printf(\"Nonen\");\n\n    return 0;\n}\n<\/code><\/pre>\n
A1050 \u6563\u5217\u53bb\u91cd<\/h3>\n
#include <iostream>\nusing namespace std;\nint main() {\n    int i = -1, s2[128] = {0};\n    char s1[10001], c;\n\n    while ((c = getchar()) != 'n') s1[++i] = c;\n    s1[++i] = '';\n\n    while ((c = getchar()) != 'n') s2[c]++;\n    i = -1;\n\n    while (s1[++i]) if (!s2[s1[i]]) putchar(s1[i]);\n    putchar('n');\n    return 0;\n}\n<\/code><\/pre>\n
\u5b57\u7b26\u4e32\u5904\u7406<\/h2>\n
scanf\u8bfb\u5165\u6574\u884c\u65f6\u53ef\u80fd\u4ee5\u7a7a\u683c\u4e3a\u5206\u9694\u7b26\uff0c\u6539\u4e3acstio::gets()\u6216\u9010\u5b57\u7b26\u8bfb\u53d6
\n\u9010\u5b57\u7b26\u8bfb\u53d6\u65f6\u8981\u5728\u8bfb\u53d6\u672b\u5c3e\u624b\u52a8\u6dfb\u52a0”\u6807\u660e\u5b57\u7b26\u4e32\u7ed3\u675f\uff0c\u4ee5\u9632\u672a\u521d\u59cb\u5316\u6570\u7ec4\u968f\u673a\u503c\u5f71\u54cd<\/p>\n
\u5faa\u73af\u7ed3\u6784<\/h2>\n
A1061 \u5faa\u73af\u7ec6\u8282<\/h3>\n
\u2460\u4e0d\u6ee1\u8db3\u6761\u4ef6\u800c\u7ee7\u7eed\u5faa\u73af\uff0c\u6761\u4ef6\u5e94\u7f6e\u4e8e\u5faa\u73af\u5185\u90e8\uff0c\u5426\u5219\u5c06\u76f4\u63a5\u9000\u51fa\u5faa\u73af
\n\u2461\u533a\u5206break\u5728\u6761\u4ef6\u5206\u652f\u5185\u548c\u5206\u652f\u540e
\n\u2462\u6b64\u9898\u8f83\u5751\u7684\u90e8\u5206\u662f\u9690\u542b\u8303\u56f4”MON-SUN”\u5bf9\u5e94\u7684\u8303\u56f4\u4e3a”A-G”<\/p>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    char s1[61], s2[61], s3[61], s4[61];\n    char *day[7] = {\"MON\", \"TUE\", \"WED\", \"THU\", \"FRI\", \"SAT\", \"SUN\"};\n    int i;\n    scanf(\"%s%s%s%s\", s1, s2, s3, s4);\n\n    for (i = 0; s1[i] && s2[i]; i++)\n        if (s1[i] == s2[i] && s1[i] >= 'A' && s1[i] <= 'G')\n            break;\n    printf(\"%s \", day[s1[i] - 'A']);\n\n    for (++i; s1[i] && s2[i]; i++)\n        if (s1[i] == s2[i]) {\n            if (s1[i] >= 'A' && s1[i] <= 'N')      printf(\"%02d:\", s1[i] - 'A' + 10);\n            else if (s1[i] >= '0' && s1[i] <= '9') printf(\"%02d:\", s1[i] - '0');\n            else continue;\n            break;\n        }\n\n    for (i = 0; s3[i] && s4[i]; i++)\n        if (s3[i] == s4[i] && ((s3[i] >= 'a' && s3[i] <= 'z') || (s3[i] >= 'A' && s3[i] <= 'Z')))\n            break;#include <iostream>\nusing namespace std;\n\n    int main() {\n        int t = 1;\n        bool isAbove = false;\n        long long a, b, c, r;\n        while (getchar() != 'n') ;\n        while (~scanf(\"%lld%lld%lld\", &a, &b, &c)) {\n            r = a + b;\n            if (a > 0 && b > 0 && r < 0) isAbove = true;\n            else if (a < 0 && b < 0 && r >= 0) isAbove = false;\n            else if (r > c) isAbove = true;\n            else isAbove = false;\n\n            if (isAbove) printf(\"Case #%d: truen\", t);\n            else printf(\"Case #%d: falsen\", t);\n            t++;\n        }\n\n        return 0;\n    }\n    printf(\"%02dn\", i);\n\n    return 0;\n}\n<\/code><\/pre>\n
\u7c7b\u578b\u8fb9\u754c<\/h2>\n
A1065 \u8d85\u9650\u5904\u7406<\/h4>\n
\u2460\u7279\u6b8a\u5904\u7406\u8d85\u8303\u56f4\u60c5\u51b5\uff0c\u5176\u4f59\u6b63\u5e38\u5224\u65ad
\nlong long \u7c7b\u578b\u8868\u793a\u8303\u56f4 $\\scriptsize [-2^{63},2^{63}-1]$
\n\u4e0a\u9650\u6ea2\u51fa\u65f6 $\\scriptsize a+b \\in [2^{63},2^{64}-2]$\uff0c\u8ba1\u7b97\u7ed3\u679c $\\scriptsize \\% 64 = [-2^{63},-2]$
\n\u4e0b\u9650\u6ea2\u51fa\u65f6 $\\scriptsize a+b \\in [-2^{64},-2^{63}-1]$\uff0c\u8ba1\u7b97\u7ed3\u679c $\\scriptsize \\% 64 = [-2^{63}-1,0]$
\n\u2461\u7528\u5b57\u7b26\u4e32\u6a21\u62df\u7ad6\u5f0f\u52a0\u51cf\u6cd5\uff0c\u5e76\u6bd4\u8f83\u7ed3\u679c<\/p>\n
#include <iostream>\nusing namespace std;\n\nint main() {\n    int t = 1;\n    bool isAbove = false;\n    long long a, b, c, r;\n    while (getchar() != 'n') ;\n    while (~scanf(\"%lld%lld%lld\", &a, &b, &c)) {\n        r = a + b;\n        if (a > 0 && b > 0 && r < 0) isAbove = true;\n        else if (a < 0 && b < 0 && r >= 0) isAbove = false;\n        else if (r > c) isAbove = true;\n        else isAbove = false;\n\n        if (isAbove) printf(\"Case #%d: truen\", t);\n        else printf(\"Case #%d: falsen\", t);\n        t++;\n    }\n\n    return 0;\n}\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
\u8fdb\u5236\u8f6c\u6362\u7c7b \u5e38\u7528 \u9664\u4f59\u6cd5 A1001 \u53d6\u8fdb\u5236\u5404\u4f4d \u601d\u8def1 %10\u5f97\u672b\u4f4d\u6570\uff0c\/10\u524d\u79fb\u4e00\u4f4d\uff0c\u7531\u6b64\u5f97\u5230\u9006\u5e8f\u5404\u4f4d\u6570  … <\/p>\n
\u7ee7\u7eed\u9605\u8bfb\u201cPAT – ADVANCED – 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,1],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/1862"}],"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=1862"}],"version-history":[{"count":27,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/1862\/revisions"}],"predecessor-version":[{"id":2092,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/1862\/revisions\/2092"}],"wp:attachment":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1862"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1862"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1862"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}