[{"data":1,"prerenderedAt":971},["ShallowReactive",2],{"content:\u002F2026\u002Fwust-oj-c1-5":3,"surround:\u002F2026\u002Fwust-oj-c1-5":960},{"id":4,"title":5,"body":6,"categories":933,"date":935,"description":936,"draft":937,"extension":938,"image":939,"meta":940,"navigation":942,"path":943,"permalink":943,"published":944,"readingTime":945,"recommend":944,"references":944,"seo":950,"sitemap":951,"stem":952,"tags":953,"type":957,"updated":958,"__hash__":959},"content\u002Fposts\u002F2026\u002FWUST_OJ C1-5.md","WUST OJ C1-5",{"type":7,"value":8,"toc":830},"minimark",[9,18,23,27,38,41,47,50,56,60,66,69,75,78,84,88,94,98,101,107,110,118,121,127,130,136,139,145,148,154,157,163,166,172,175,181,185,191,194,200,203,209,212,218,221,227,231,235,241,244,250,253,259,262,268,271,277,280,286,289,295,298,304,307,312,315,321,324,330,333,339,342,348,352,355,361,364,370,373,379,382,388,391,397,400,406,410,416,419,425,428,434,437,443,446,452,455,461,465,468,474,478,484,487,493,496,502,505,511,514,520,523,529,533,536,542,545,551,554,560,563,569,572,578,581,587,591,597,600,606,610,616,619,625,628,634,637,643,646,649,655,658,664,667,675,678,684,687,693,696,702,705,711,714,720,723,729,732,738,741,747,750,756,760,766,769,775,778,784,787,793,796,802,805,811,815,821,824],[10,11,14],"alert",{"title":12,"type":13},"题解说明","info",[15,16,17],"p",{},"这篇主要保存 C1-C5 的 AC 代码，代码块已经按语言高亮；如题面更新，请以 WUST OJ 当前题面为准。",[19,20,22],"h2",{"id":21},"c1","C1",[24,25,26],"h3",{"id":26},"求圆的面积和周长",[28,29,35],"pre",{"className":30,"code":32,"language":33,"meta":34},[31],"language-c++","#include \u003Cstdio.h>\n\n\nint main() {\n\tdouble r;\n\tdouble c, s;\n\tscanf(\"%lf\", &r);\n\tc = r * 2 * 3.14;\n\ts = r * r * 3.14;\n\tprintf(\"%f\\n%f\", s, c);\n\n\treturn 0;\n}\n","c++","",[36,37,32],"code",{"__ignoreMap":34},[24,39,40],{"id":40},"求2个整数的和",[28,42,45],{"className":43,"code":44,"language":33,"meta":34},[31],"#include \u003Cstdio.h>\n\nint main() {\n    int a, b;\n    scanf(\"%d %d\", &a, &b);\n    printf(\"%d\", a + b);\n    return 0;\n}\n",[36,46,44],{"__ignoreMap":34},[24,48,49],{"id":49},"输出2行信息",[28,51,54],{"className":52,"code":53,"language":33,"meta":34},[31],"#include\u003Ciostream>\nusing namespace std;\n \nint main(void) {\n\n  cout\u003C\u003C\"Programing is fun.\\nPrograming in language C is even more fun!\"\u003C\u003Cendl;\n  \n  return 0;\n\n}\n",[36,55,53],{"__ignoreMap":34},[24,57,59],{"id":58},"hello-world","Hello World!",[28,61,64],{"className":62,"code":63,"language":33,"meta":34},[31],"#include \u003Ciostream>\nusing namespace std;\n\n\tint main()\n{\n\tcout \u003C\u003C \"Hello World!\" \u003C\u003C endl;\n\n\treturn 0;\n}\n",[36,65,63],{"__ignoreMap":34},[24,67,68],{"id":68},"设计函数求2个整数的最大值",[28,70,73],{"className":71,"code":72,"language":33,"meta":34},[31],"int max(int x,int y) {\n\n\tif (x > y) {\n\t\treturn x;\n\t}\n\telse{\n\t\treturn y;\n\t}\n}\n",[36,74,72],{"__ignoreMap":34},[24,76,77],{"id":77},"求2个整数的最大值",[28,79,82],{"className":80,"code":81,"language":33,"meta":34},[31],"#include \u003Cstdio.h>\n\nint main() {\n    int a, b;\n    scanf(\"%d %d\", &a, &b);\n    if (a > b) {\n        printf(\"max=%d\\n\", a);\n    } else {\n        printf(\"max=%d\\n\", b);\n    }\n  \n    return 0;\n}\n",[36,83,81],{"__ignoreMap":34},[24,85,87],{"id":86},"this-is-a-c-program","This is a C program",[28,89,92],{"className":90,"code":91,"language":33,"meta":34},[31],"#include \u003Ciostream>\nusing namespace std;\n\nint main()\n{\n\tcout \u003C\u003C \"This is a C program\" \u003C\u003C endl;\n\n\treturn 0;\n}\n",[36,93,91],{"__ignoreMap":34},[19,95,97],{"id":96},"c2","C2",[24,99,100],{"id":100},"猫是液体",[28,102,105],{"className":103,"code":104,"language":33,"meta":34},[31],"#include \u003Ciostream>\nusing namespace std;\n\nint main ()\n{\n    int a, b, c;\n    cin >> a >> b >> c;\n    cout \u003C\u003C a * b * c \u003C\u003Cendl;\n    return 0; \n}\n",[36,106,104],{"__ignoreMap":34},[24,108,109],{"id":109},"中英长度单位换算",[28,111,116],{"className":112,"code":114,"language":115,"meta":34},[113],"language-c","#include \u003Cstdio.h>\n\nint main() {\n    int cm,foot,inch;\n    double tfoot,tinch, m;\n    \n    scanf(\"%d\", &cm);     \n    m = cm \u002F 100.0; \n   \n    tfoot = m \u002F 0.3048;\n    foot = (int)tfoot;\n   \n    tinch = (tfoot - foot)*12;\n    inch = (int)tinch;\n    \n    printf(\"%d %d\", foot,inch); \n        return 0;\n}\n","c",[36,117,114],{"__ignoreMap":34},[24,119,120],{"id":120},"打妖怪",[28,122,125],{"className":123,"code":124,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n\tint a, b;\n\tscanf(\"%d %d\", &a, &b);\n\tif (a%b == 0) {\n\t\tprintf(\"%d\", a \u002F b);\n\t}\n\telse {\n\t\tprintf(\"%d\", a \u002F b + 1);\n\t}\n\t\n\treturn 0;\n}\n",[36,126,124],{"__ignoreMap":34},[24,128,129],{"id":129},"求整数均值",[28,131,134],{"className":132,"code":133,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n\tint a,b,c,d;\n\tfloat e;\n\tscanf(\"%d %d %d %d\", &a, &b,&c,&d);\n\te = a + b + c + d;\n\tprintf(\"Sum = %d\\nAverage = %.2f\", a+b+c+d ,e\u002F4);\n\treturn 0;\n}\n",[36,135,133],{"__ignoreMap":34},[24,137,138],{"id":138},"整数四则运算",[28,140,143],{"className":141,"code":142,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n\tint a,b;\n\tscanf(\"%d %d\", &a, &b);\n\tprintf(\"%d + %d = %d\\n\", a, b, a + b);\n\tprintf(\"%d - %d = %d\\n\", a, b, a - b);\n\tprintf(\"%d * %d = %d\\n\", a, b, a * b);\n\tprintf(\"%d \u002F %d = %d\", a, b, a \u002F b);\n\treturn 0;\n}\n",[36,144,142],{"__ignoreMap":34},[24,146,147],{"id":147},"分糖果",[28,149,152],{"className":150,"code":151,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int x, y, z;\n    scanf(\"%d %d %d\", &x, &y, &z);\n    \u002F\u002F a--b\u002Fc\n    y = y + (x \u002F 3);\n    z = z + (x \u002F 3);\n    x = x \u002F 3;\n    \u002F\u002Fb--a\u002Fc\n    x = x + (y \u002F 3);\n    z = z + (y \u002F 3);\n    y = y \u002F 3;\n    \u002F\u002Fc--b\u002Fa\n    x = x + (z \u002F 3);\n    y = y + (z \u002F 3);\n    z = z \u002F 3;\n    printf(\"%d %d %d\", x, y, z);\n        return 0;\n}\n",[36,153,151],{"__ignoreMap":34},[24,155,156],{"id":156},"自由落体",[28,158,161],{"className":159,"code":160,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int t;\n    scanf(\"%d\", &t);\n    printf(\"%d\", 10*t*t\u002F2);\n    return 0;\n}\n",[36,162,160],{"__ignoreMap":34},[24,164,165],{"id":165},"计算终止时间",[28,167,170],{"className":168,"code":169,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int time, plus;\n    int h, min, hp, minp;\n    \n    scanf(\"%d %d\", &time, &plus);\n    \n    min = time % 100;\n    h=time\u002F100;\n    minp = plus % 60;\n    hp = plus \u002F 60;\n    \n    min = min + minp;\n    h = h + hp;\n\n    if (min > 60) {\n        min = min - 60;\n        h = h + 1;\n    }\n    else {\n    }\n    printf(\"%d%02d\", h, min);\n    return 0;\n}\n",[36,171,169],{"__ignoreMap":34},[24,173,174],{"id":174},"输出四位整数的各位数字",[28,176,179],{"className":177,"code":178,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\n\nint main() {\n\tchar a, b, c, d;\n\tint x;\n\tscanf(\"%c%c%c%c\", &d, &c, &b, &a);\n\tprintf(\"%c%c%c%c=%c+%c*10+%c*100+%c*1000\", d,c,b,a,a,b,c,d);\n\n\treturn 0;\n}\n",[36,180,178],{"__ignoreMap":34},[24,182,184],{"id":183},"两小时学完c语言","两小时学完C语言",[28,186,189],{"className":187,"code":188,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int x,y,s,d;\n    scanf(\"%d %d %d\", &x, &y,& s);\n    d = x - (y * s);\n    printf(\"%d\", d);\n    return 0;\n}\n",[36,190,188],{"__ignoreMap":34},[24,192,193],{"id":193},"计算图形面积",[28,195,198],{"className":196,"code":197,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int x,y,s;\n    scanf(\"%d %d\", &x,&y);\n    s = 5000 - (100 * y * 0.5) - (100 * (100 - x) * 0.5);\n    printf(\"%d\", s);\n    return 0;\n}\n",[36,199,197],{"__ignoreMap":34},[24,201,202],{"id":202},"折扣",[28,204,207],{"className":205,"code":206,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int a,b;\n    double c ;\n    scanf(\"%d %d\", &a,&b);\n    c = a * b \u002F 10.0;\n    printf(\"%.2lf\", c);\n    return 0;\n}\n",[36,208,206],{"__ignoreMap":34},[24,210,211],{"id":211},"标准体重和身高的对应关系",[28,213,216],{"className":214,"code":215,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int a = 0;\n    double b ;\n    scanf(\"%d\", &a);\n    b = (a - 100) * 0.9 * 2;\n    printf(\"%.1lf\", b);\n    return 0;\n}\n",[36,217,215],{"__ignoreMap":34},[24,219,220],{"id":220},"后天",[28,222,225],{"className":223,"code":224,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int a=0;\n    scanf(\"%d\", &a);\n    a = a + 2;\n    if (a > 7) {\n        printf(\"%d\", a - 7);\n    }\n    else {\n        printf(\"%d\", a );\n    }\n        return 0;\n}\n",[36,226,224],{"__ignoreMap":34},[19,228,230],{"id":229},"c3","C3",[24,232,234],{"id":233},"字母对应的ascii-码","字母对应的ASCII 码",[28,236,239],{"className":237,"code":238,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    char c;\n    scanf(\"%c\",&c);\n    printf(\"%d\",c);\n    return 0;\n}\n",[36,240,238],{"__ignoreMap":34},[24,242,243],{"id":243},"温度转换",[28,245,248],{"className":246,"code":247,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    double F;\n    scanf(\"%lf\", &F);\n    printf(\"%lf\", (F - 32) * 5 \u002F 9);\n    return 0;\n}\n",[36,249,247],{"__ignoreMap":34},[24,251,252],{"id":252},"计算圆的周长",[28,254,257],{"className":255,"code":256,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n#include \u003Cmath.h> \n\nint main() {\n    double r;\n    scanf(\"%lf\", &r);\n    printf(\"%lf\", 2 * r * 3.14);\n    return 0;\n}\n",[36,258,256],{"__ignoreMap":34},[24,260,261],{"id":261},"求三位整数的逆序数",[28,263,266],{"className":264,"code":265,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    char x,y,z;\n    scanf(\"%c%c%c\", &x, &y, &z);\n    printf(\"%c%c%c\", z,y,x);\n    return 0;\n}\n",[36,267,265],{"__ignoreMap":34},[24,269,270],{"id":270},"求三角形面积",[28,272,275],{"className":273,"code":274,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n#include \u003Cmath.h> \n\nint main() {\n    float s,ss,x,y,z,p;\n    scanf(\"%f %f %f\", &x, &y, &z);\n    p = (x + y + z) \u002F 2;\n    ss = p * (p-x) * (p-y) * (p-z);\n    s = sqrt(ss);\n    printf(\"%.2f\", s);\n    return 0;\n}\n",[36,276,274],{"__ignoreMap":34},[24,278,279],{"id":279},"计算浮点数相除的余数",[28,281,284],{"className":282,"code":283,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n#include \u003Cmath.h>\n\nint main() {\n    double a, b;\n    scanf(\"%lf %lf\", &a, &b);\n    \n    double r = fmod(a, b);\n    if (r \u003C 0) {\n        r += b; \n    }\n    printf(\"%g\\n\", r);\n    return 0;\n}\n",[36,285,283],{"__ignoreMap":34},[24,287,288],{"id":288},"年增长率",[28,290,293],{"className":291,"code":292,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n#include \u003Cmath.h>\n\nint main() {\n    int years;\n    double rate;\n    scanf(\"%d\", &years);\n    \n    rate = (pow(2.0, 1.0\u002Fyears)-1);\n\n    printf(\"%.2lf%%\", rate*100);\n    \n    return 0;\n}\n",[36,294,292],{"__ignoreMap":34},[24,296,297],{"id":297},"快速求和",[28,299,302],{"className":300,"code":301,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int n;\n    scanf(\"%d\", &n);\n    \n    double s = 0.0;\n    for (int i = 1; i \u003C= n; i++) {\n        s += 1.0 \u002F (i * (i + 1));\n    }\n    \n    printf(\"%.5f\\n\", s);\n    return 0;\n}\n",[36,303,301],{"__ignoreMap":34},[24,305,306],{"id":306},"混合类型数据格式化输入",[28,308,310],{"className":309,"code":292,"language":115,"meta":34},[113],[36,311,292],{"__ignoreMap":34},[24,313,314],{"id":314},"定期存款",[28,316,319],{"className":317,"code":318,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    double base,up,upc;\n    scanf(\"%lf %lf\", &base, &up);\n    upc = up \u002F 100.0;\n    printf(\"%11.2lf\\n%11.2lf\\n%11.2lf\",base,base*upc,base*(1+upc));\n    return 0;\n}\n",[36,320,318],{"__ignoreMap":34},[24,322,323],{"id":323},"日期格式变化",[28,325,328],{"className":326,"code":327,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int day, month, year;\n    scanf(\"%d-%d-%d\", &month, &day, &year);\n    printf(\"%d-%02d-%02d\", year, month, day);\n    return 0;\n}\n",[36,329,327],{"__ignoreMap":34},[24,331,332],{"id":332},"水果店收款",[28,334,337],{"className":335,"code":336,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    double a,b,c,d;\n    scanf(\"%lf%lf%lf%lf\", &a,&b,&c,&d);\n    printf(\"%.2lf\", (a * 2.5) + (b * 1.7) + (c * 2) + (d * 1.2));\n    return 0;\n}\n",[36,338,336],{"__ignoreMap":34},[24,340,341],{"id":341},"计算房间面积",[28,343,346],{"className":344,"code":345,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    double a,b;\n    scanf(\"%lf\\n%lf\", &a,&b);\n    printf(\"the area of the room:%lf\",a*b);\n    return 0;\n}\n",[36,347,345],{"__ignoreMap":34},[19,349,351],{"id":350},"c4","C4",[24,353,354],{"id":354},"三天打鱼两天晒网",[28,356,359],{"className":357,"code":358,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n#include\u003Cmath.h>\n\nint main() {\n    int a,b;\n    scanf(\"%d\", &a);\n    b = a % 5;\n    b \u003C= 3&&b!=0 ? printf(\"Fishing in day %d\", a): printf(\"Drying in day %d\", a);\n    return 0;\n}\n",[36,360,358],{"__ignoreMap":34},[24,362,363],{"id":363},"闰年",[28,365,368],{"className":366,"code":367,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n\tint year;\n\tscanf(\"%d\", &year);\n\t((year % 4 == 0 && year % 100 != 0) || year % 400 == 0) ? (printf(\"%d is a leap year!\", year)) :(printf(\"%d isn't a leap year!\", year));\n\treturn 0;\n}\n",[36,369,367],{"__ignoreMap":34},[24,371,372],{"id":372},"三个整数排序",[28,374,377],{"className":375,"code":376,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int a, b, c, max, med, min;\n    scanf(\"%d %d %d\", &a, &b, &c);\n\n    max = a;\n    if (b > max) max = b;\n    if (c > max) max = c;\n\n    min = a;\n    if (b \u003C min) min = b;\n    if (c \u003C min) min = c;\n\n    med = a + b + c - max - min;\n\n    printf(\"a=%d,b=%d,c=%d\\n\", min, med, max);\n    return 0;\n}\n",[36,378,376],{"__ignoreMap":34},[24,380,381],{"id":381},"判断水仙花数",[28,383,386],{"className":384,"code":385,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n#include \u003Cmath.h>\n\nint main() {\n    int a,b,c,x;\n    scanf(\"%d\", &x);\n    a = x % 10;\n    b = x \u002F 10 % 10;\n    c = x \u002F 10 \u002F 10;\n    pow(a, 3) + pow(b, 3) + pow(c, 3) == x ? (printf(\"YES\")) : (printf(\"NO\"));\n    \n    return 0;\n}\n",[36,387,385],{"__ignoreMap":34},[24,389,390],{"id":390},"计算奖金",[28,392,395],{"className":393,"code":394,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n#include\u003Cmath.h>\n\nint main() {\n    double X, M;\n    scanf(\"%lf\", &X);\n    X \u002F= 10000.0;\n\n    (X \u003C= 10) ?  (M = 0.1 * X) : \n     X \u003C= 20  ?  (M = 10 * 0.1 + (X - 10) * 0.075) : \n     X \u003C= 40  ?  (M = 10 * 0.1 + 10 * 0.075 + (X - 20) * 0.05) : \n     X \u003C= 60  ?  (M = 10 * 0.1 + 10 * 0.075 + 20 * 0.05 + (X - 40) * 0.03) : \n     X \u003C= 100 ?  (M = 10 * 0.1 + 10 * 0.075 + 20 * 0.05 + 20 * 0.03 + (X - 60) * 0.015) : \n                 (M = 10 * 0.1 + 10 * 0.075 + 20 * 0.05 + 20 * 0.03 + 40 * 0.015 + (X - 100) * 0.01);\n    printf(\"%.2lf\", M*10000);\n    return 0;\n}\n",[36,396,394],{"__ignoreMap":34},[24,398,399],{"id":399},"按公式计算y和z的值",[28,401,404],{"className":402,"code":403,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n#include\u003Cmath.h>\n\nint main() {\n    double x,y,z;\n\n    scanf(\"%lf\", &x);\n\n    if (x \u003C= 2.5) y = x * x + 1;\n    else y = x * x - 1;\n\n\n    if (1 \u003C= x && x \u003C 2) {\n        z = 3 * x + 5;\n    }\n    else if (2 \u003C= x && x \u003C 3) {\n        z = 2 * sin(x) - 1;\n    }\n    else if (3 \u003C= x && x \u003C 5) {\n        z = pow(x*x+1,0.5);\n    }\n    else if (5 \u003C= x && x \u003C 8) {\n        z = x * x - 2 * x + 5;\n    }\n    else z = 0;\n    printf(\"%lf\\n%lf\", y, z);\n\n    return 0;\n}\n",[36,405,403],{"__ignoreMap":34},[24,407,409],{"id":408},"_24小时时间记法转12小时时间记法","24小时时间记法转12小时时间记法",[28,411,414],{"className":412,"code":413,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int h, m, s;\n    scanf(\"%d %d %d\", &h, &m, &s);\n    \n        (h >= 12)? printf(\"%d %d %d PM\", h-12, m, s): printf(\"%d %d %d AM\", h, m, s); \n\n    return 0;\n}\n",[36,415,413],{"__ignoreMap":34},[24,417,418],{"id":418},"能否构成三角形",[28,420,423],{"className":421,"code":422,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int a, b, c;\n    scanf(\"%d %d %d\", &a, &b, &c);\n    (a + b > c && a + c > b && b + c > a && a - c \u003C b && c - a \u003C b && a - b \u003C c && b - a \u003C c && b - c \u003C a && c - b \u003C a) ? (printf(\"YES\")) : (printf(\"NO\"));\n\n    return 0;\n}\n",[36,424,422],{"__ignoreMap":34},[24,426,427],{"id":427},"找出3个整数居中的整数",[28,429,432],{"className":430,"code":431,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int a, b, c, max, med, min;\n    scanf(\"%d %d %d\", &a, &b, &c);\n\n    max = a;\n    if (b > max) max = b;\n    if (c > max) max = c;\n\n    min = a;\n    if (b \u003C min) min = b;\n    if (c \u003C min) min = c;\n\n    med = a + b + c - max - min;\n\n    printf(\"%d\",med);\n    return 0;\n}\n",[36,433,431],{"__ignoreMap":34},[24,435,436],{"id":436},"学生成绩评定",[28,438,441],{"className":439,"code":440,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n\tint score;\n\tscanf(\"%d\", &score);\n\tif (score > 85)printf(\"very good\");\n\telse if (score >= 60)printf(\"good\");\n\telse printf(\"no good\");\n\n\treturn 0;\n}\n",[36,442,440],{"__ignoreMap":34},[24,444,445],{"id":445},"求月份对应的英文名称及天数",[28,447,450],{"className":448,"code":449,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n\tint month;\n\tscanf(\"%d\", &month);\n\tif (month == 1)printf(\"January,31\");\n\tif (month == 2)printf(\"February,28\u002F29\");\n\tif (month == 3)printf(\"March,31\");\n\tif (month == 4)printf(\"April,30\");\n\tif (month == 5)printf(\"May,31\");\n\tif (month == 6)printf(\"June,30\");\n\tif (month == 7)printf(\"July,31\");\n\tif (month == 8)printf(\"August,31\");\n\tif (month == 9)printf(\"September,30\");\n\tif (month == 10)printf(\"October,31\");\n\tif (month == 11)printf(\"November,30\");\n\tif (month == 12)printf(\"December,31\");\n\n\n\treturn 0;\n}\n",[36,451,449],{"__ignoreMap":34},[24,453,454],{"id":454},"百分制分数转换为等级",[28,456,459],{"className":457,"code":458,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n\tint score;\n\tchar a;\n\tscanf(\"%d\", &score);\n\tif (score >= 90) { a = 'A'; }\n\telse {\n\t\tif (score >= 80) { a = 'B'; }\n\t\telse {\n\t\t\tif (score >= 70) { a = 'C'; }\n\t\t\telse {\n\t\t\t\tif (score >= 60) { a = 'D'; }\n\t\t\t\telse { a = 'E'; }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\n\n\tprintf(\"score=%d,grade:%c\", score, a);\n\n\treturn 0;\n}\n",[36,460,458],{"__ignoreMap":34},[19,462,464],{"id":463},"c5-p2","C5 P2",[24,466,467],{"id":467},"求若干整数的最大值",[28,469,472],{"className":470,"code":471,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int n;\n    scanf(\"%d\", &n);\n\n    int max=0, a;\n    int i = 1;\n\n    while ( i\u003C= n) {\n        scanf(\"%d\", &a);\n        i++;\n        if (max \u003C a) max = a;\n    }\n    printf(\"%d\", max);\n\n    return 0;\n}\n",[36,473,471],{"__ignoreMap":34},[24,475,477],{"id":476},"n","n！",[28,479,482],{"className":480,"code":481,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int n,m=1;\n    \n    scanf(\"%d\", &n);\n\n    if(n==0){\n        printf(\"%d!=1\", n);\n\n    }\n    else {\n        for (int i=1; i\u003C=n; i++) {\n            m = m * i;\n        }\n        printf(\"%d!=%d\\n\", n, m);\n    }\n    \n    \n\n    return 0;\n}\n",[36,483,481],{"__ignoreMap":34},[24,485,486],{"id":486},"最大公约数",[28,488,491],{"className":489,"code":490,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int a=0, b=0,max=0,x=0;\n    scanf(\"%d %d\", &a, &b);\n    a > b ? (max = a) : (max = b);\n    int i = 1;\n    while (i \u003C max) {\n        if (a % i == 0 && b % i == 0)\n        {\n            x = i;\n        }\n        i++;\n    }\n    printf(\"%d\", x);\n    return 0;\n}\n",[36,492,490],{"__ignoreMap":34},[24,494,495],{"id":495},"最小值和最大值",[28,497,500],{"className":498,"code":499,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n#include\u003Cmath.h>\n\nint main(void) {\n\n\tint n;\n\tint a=0;\n\tint max=0, min=1000;\n\tint cmax=0,cmin=0;\n\tscanf(\"%d\", &n);\n\n\tfor (int i = 1;i \u003C= n;i++) {\n\t\tscanf(\"%d\", &a);\n\t\tif (a > max)\n\t\t{\n\t\t\tmax = a;\n\t\t\tcmax = 0;\n\t\t}\n\t\t if (a \u003C min)\n\t\t{\n\t\t\tmin = a;\n\t\t\tcmin = 0;\n\t\t}\n\t\t if (a == max)cmax++;\n\t\t if (a == min)cmin++;\n\n\t}\n\tprintf(\"%d %d\\n\", min, cmin);\n\tprintf(\"%d %d\\n\", max, cmax);\n\n\treturn 0;\n}\n",[36,501,499],{"__ignoreMap":34},[24,503,504],{"id":504},"连续因子",[28,506,509],{"className":507,"code":508,"language":115,"meta":34},[113],"#include \u003Ciostream>\n#include \u003Ccmath>\nusing namespace std;\n\nint main() {\n    long long n;\n    cin >> n;\n    \n    long long max_len = 0;\n    long long start = 0;\n    long long sqrt_n = sqrt(n);\n    \n    for (long long i = 2; i \u003C= sqrt_n; i++) {\n        long long temp = n;\n        long long count = 0;\n        long long j = i;\n        \n        while (temp % j == 0) {\n            temp \u002F= j;\n            count++;\n            j++;\n        }\n        \n        if (count > max_len) {\n            max_len = count;\n            start = i;\n        }\n    }\n    \n    if (max_len == 0) {\n        max_len = 1;\n        start = n;\n    }\n    \n    cout \u003C\u003C max_len \u003C\u003C endl;\n    for (long long i = start; i \u003C start + max_len; i++) {\n        if (i != start) cout \u003C\u003C \"*\";\n        cout \u003C\u003C i;\n    }\n    \n    return 0;\n}\n",[36,510,508],{"__ignoreMap":34},[24,512,513],{"id":513},"打印沙漏",[28,515,518],{"className":516,"code":517,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int a=1,a_a=5;\n    int n;\n    int cs=0;\n    scanf(\"%d\", &n);\n\n    while (n >= a) {\n        n -= a;\n        cs++;\n        \n        a = a + a_a;\n        a_a = 4;\n\n    }\n\n\n\n    for (int i = 0;i \u003C= cs -1;i++) {\n        for (int k = 1;k \u003C= i;k++)printf(\"\\040\");\n        for (int x = 1;x \u003C= 2 * (cs - i) - 1;x++)printf(\"*\");\n        printf(\"\\n\");\n    }\n\n    for (int i = 2;i \u003C= cs;i++) {\n        for (int k = 1;k \u003C= cs - i;k++)printf(\"\\040\");\n        for (int x = 1;x \u003C= 2 * i - 1;x++)printf(\"*\");\n        printf(\"\\n\");\n    }\n\n\n    printf(\"%d\",n);\n\n    return 0;\n}\n",[36,519,517],{"__ignoreMap":34},[24,521,522],{"id":522},"念数字",[28,524,527],{"className":525,"code":526,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n#include\u003Cmath.h>\n\nint main(void) {\n\tint n;\n\tscanf(\"%d\", &n);\n\n\tint temp = n;\n\t(temp > 0) ? (temp = temp) : (temp = -temp);\n\tint ws=0;\n\n\twhile (temp > 0) {\n\t\tws++;\n\t\ttemp \u002F= 10;\n\t}\n\tif(n!=0)\n\t{\n\t\t(n > 0) ? (ws = ws) : (printf(\"fu \"));\n\n\t\tint onebyone;\n\t\t(n > 0) ? (temp = n) : (temp = -n);\n\n\n\t\tfor (int i = 1;i \u003C= ws;i++) {\n\t\t\tint shi = pow(10, ws - i);\n\t\t\tonebyone = temp \u002F shi;\n\t\t\ttemp %= shi;\n\n\t\t\tif (ws - i == 0)\n\t\t\t{\n\t\t\t\tswitch (onebyone) {\n\t\t\t\tcase 0: printf(\"ling\"); break;\n\t\t\t\tcase 1: printf(\"yi\"); break;\n\t\t\t\tcase 2: printf(\"er\"); break;\n\t\t\t\tcase 3: printf(\"san\"); break;\n\t\t\t\tcase 4: printf(\"si\"); break;\n\t\t\t\tcase 5: printf(\"wu\"); break;\n\t\t\t\tcase 6: printf(\"liu\"); break;\n\t\t\t\tcase 7: printf(\"qi\"); break;\n\t\t\t\tcase 8: printf(\"ba\"); break;\n\t\t\t\tcase 9: printf(\"jiu\"); break;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tswitch (onebyone) {\n\t\t\t\tcase 0: printf(\"ling \"); break;\n\t\t\t\tcase 1: printf(\"yi \"); break;\n\t\t\t\tcase 2: printf(\"er \"); break;\n\t\t\t\tcase 3: printf(\"san \"); break;\n\t\t\t\tcase 4: printf(\"si \"); break;\n\t\t\t\tcase 5: printf(\"wu \"); break;\n\t\t\t\tcase 6: printf(\"liu \"); break;\n\t\t\t\tcase 7: printf(\"qi \"); break;\n\t\t\t\tcase 8: printf(\"ba \"); break;\n\t\t\t\tcase 9: printf(\"jiu \"); break;\n\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t}\n\telse {\n\t\tprintf(\"ling\");\n\t}\n\n\n\treturn 0;\n}\n",[36,528,526],{"__ignoreMap":34},[24,530,532],{"id":531},"n个有理数求和","N个有理数求和",[24,534,535],{"id":535},"画方块",[28,537,540],{"className":538,"code":539,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n#include\u003Cmath.h>\n\nint main() {\n    \n    int round=0,list;\n    char a='a';\n    scanf(\"%d %c\",&round, &a);\n\n    if (round % 2 == 0) { list = round \u002F 2; }\n    else list = (round + 1) \u002F 2;\n\n    for(int o=1;o\u003C=list-1;o++)\n    {\n        for (int i = 1;i \u003C= round;i++) {\n            printf(\"%c\", a);\n        }\n        printf(\"\\n\");\n    }\n\n    for (int i = 1;i \u003C= round;i++) {\n        printf(\"%c\", a);\n    }\n\n\n    return 0;\n}\n",[36,541,539],{"__ignoreMap":34},[24,543,544],{"id":544},"守形数",[28,546,549],{"className":547,"code":548,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n#include\u003Cmath.h>\n\nint main() {\n    int m=0, n=0;\n    scanf(\"%d %d\", &m, &n);\n\n    int round=0,temp,last;\n\n    int first = 0;\n\n\n    for (m;m \u003C= n;m++) {\n        temp = m;\n\n            while (temp != 0) {\n                round++;\n                temp \u002F= 10;\n        }\n\n            int www = pow(10, round);\n            last = (m * m) % (www);\n\n            if (last == m) {\n                if(first==0)\n                {\n                    printf(\"%d\", m);\n                    first = 1;\n                }\n                else printf(\"\\040%d\", m);\n                \n            }\n            round = 0;\n    }\n\n    if(first==0)printf(\"No exist\");\n    return 0;\n}\n",[36,550,548],{"__ignoreMap":34},[24,552,553],{"id":553},"含数字5且是3的倍数",[28,555,558],{"className":556,"code":557,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\nint main()\n{\n\tint m, n, total = 0;\n\tscanf(\"%d %d\", &m, &n);\n\n\tfor (int i = m; i \u003C= n; i++)\n\t{\n\t\tif (i % 3 == 0)\n\t\t{\n\t\t\tif (i % 10 == 5 || (i \u002F 10) % 10 == 5 || (i \u002F 100) % 10 == 5 || i \u002F 1000 == 5) \n\t\t\t{\n\t\t\t\tif (total == 0)\n\t\t\t\t\tprintf(\"%d\", i);\n\t\t\t\telse\n\t\t\t\t\tprintf(\" %d\", i);\n\t\t\t\ttotal++;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (total == 0)\n\t\tprintf(\"No exist\");\n\treturn 0;\n}\n",[36,559,557],{"__ignoreMap":34},[24,561,562],{"id":562},"小球自由落体",[28,564,567],{"className":565,"code":566,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    double n=0,m=100;\n    double dt = 100;\n\n    scanf(\"%lf\", &n);\n\n\n\n    for (int i = 1;i \u003C= n;i++) {\n        if(i==1) dt = 100;\n        else  dt = dt + m*2;\n        m \u002F= 2.0;\n    }\n\n\n    printf(\"%lf %lf\", dt,m);\n\n    return 0;\n}\n",[36,568,566],{"__ignoreMap":34},[24,570,571],{"id":571},"鸡兔同笼",[28,573,576],{"className":574,"code":575,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int tou=0, n=0,set=0;\n    scanf(\"%d %d\", &tou, &n);\n\n    int ji=0, tu=tou-ji;\n\n    for (ji;ji \u003C= tou;ji++) {\n        \n        tu = tou - ji;\n\n        if (ji * 2 + tu * 4 == n) {\n            set = 1;\n\n            printf(\"%d %d\", ji, tu);\n            break;\n        }\n\n    }\n    if (set == 0)printf(\"Error\");\n\n    return 0;\n}\n",[36,577,575],{"__ignoreMap":34},[24,579,580],{"id":580},"计算π的近似值",[28,582,585],{"className":583,"code":584,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int n=0;\n    double p=0;\n    scanf(\"%d\", &n);\n    for (int i = 1;i \u003C= 4 * n - 1;i = i + 2) {\n\n        if (i % 4 == 1)p = p + (1.0 \u002F i);\n        else p = p - (1.0 \u002F i);\n\n\n    }\n  \n    printf(\"%lf\", p*4);\n\n    return 0;\n}\n",[36,586,584],{"__ignoreMap":34},[24,588,590],{"id":589},"韩信点兵数","“韩信点兵”数",[28,592,595],{"className":593,"code":594,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int x, y,n=0,i=0;\n    scanf(\"%d %d\", &x, &y);\n    while (x\u003C=y) {\n        if (x % 3 == 2 && x % 5 == 3 && x % 7 == 4)\n        {\n            i++;\n            if(i>1)printf(\"\\040%d\", x);\n            else printf(\"%d\", x);\n         \n        }\n        x++;   \n        \n    }\n    if (i >= 1)printf(\"\\ntotal=%d\", i);\n    else printf(\"total=%d\", i);\n    return 0;\n}\n",[36,596,594],{"__ignoreMap":34},[24,598,599],{"id":599},"祖孙年龄",[28,601,604],{"className":602,"code":603,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int x, y1, y2, y3, n=0;\n    scanf(\"%d %d %d %d\", &x, &y1, &y2, &y3);\n    while (x > y1 + y2 + y3) {\n        x++;\n        y1++;\n        y2++;\n        y3++;\n        n++;   \n      \n    }\n    printf(\"%d\", n);\n    return 0;\n}\n",[36,605,603],{"__ignoreMap":34},[24,607,609],{"id":608},"输出fibonacci数列的前n项","输出Fibonacci数列的前n项",[28,611,614],{"className":612,"code":613,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int a = 1, b = 1, x, n,d=0;\n    scanf(\"%d\",&n);\n\n\n\n    for (int i = 1;i \u003C= n \u002F 5;i++) {\n        for (int h = 1;h \u003C= 5;h++) {\n            d++;\n            if (d \u003C= 2)x = 1;\n            else\n            {\n                x = a + b;\n                a = b;\n                b = x;\n\n            }\n            printf(\"%10d\", x);\n\n        }\n        printf(\"\\n\");\n    }  \n    \n    \n    for (int i = 1;i \u003C= n % 5;i++) {\n        d++;\n        if (d \u003C= 2)x = 1;\n        else\n        {\n            x = a + b;\n            a = b;\n            b = x;\n\n        }\n        printf(\"%10d\", x);\n   \n    }\n\n\n\n\n    return 0;\n}\n",[36,615,613],{"__ignoreMap":34},[24,617,618],{"id":618},"菱形图案",[28,620,623],{"className":621,"code":622,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int n;\n    scanf(\"%d\", &n);\n    for (int i = 1;i \u003C= n;i++) {\n        for (int k = 1;k \u003C= n - i;k++)printf(\"\\040\");\n        for (int x = 1;x \u003C= 2 * i - 1;x++)printf(\"*\");\n        printf(\"\\n\");\n    } \n    \n    for (int i = 1;i \u003C= n-1;i++) {\n        for (int k = 1;k \u003C= i;k++)printf(\"\\040\");\n        for (int x = 1;x \u003C= 2 * (n - i) - 1;x++)printf(\"*\");\n        printf(\"\\n\");\n    }\n\n    return 0;\n}\n",[36,624,622],{"__ignoreMap":34},[24,626,627],{"id":627},"计算某分数序列的前n项之和",[28,629,632],{"className":630,"code":631,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    double a, a1 = 2, a2 = 3;\n    double b, b1 = 1, b2 = 2;\n    int n;\n    double m = 2\u002F1.0+3\u002F2.0;\n    scanf(\"%d\", &n);\n\n\n    double x, y;\n    int i = 3;\n\n    if (n == 1)printf(\"%lf\", 2 \u002F 1.0);\n    else if (n == 2) printf(\"%lf\", 2 \u002F 1.0+3\u002F2.0);\n    else if (n >= 3) {\n\n        while (i \u003C= n) {\n            x = a1 + a2;\n            a1 = a2;\n            a2 = x;\n\n            y = b1 + b2;\n            b1 = b2;\n            b2 = y;\n\n            m = m + x\u002Fy;\n            i++;\n\n        }    printf(\"%f\\n\", m);\n    }\n\n    return 0;\n}\n",[36,633,631],{"__ignoreMap":34},[24,635,636],{"id":636},"素数",[28,638,641],{"className":639,"code":640,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n\nint main() {\n    int n,m=0;\n    \n    scanf(\"%d\", &n);\n    if (n \u003C= 1) {\n        m = 1;\n    }\n    else\n    {\n        for (int i = 2;i \u003C n;i++) {\n            if (n % i == 0) {\n                m = 1;\n            }\n        }\n    }\n\n    switch(m){\n    case 1:printf(\"NO\");\n        break;\n    case 0:printf(\"YES\");\n        break;\n    }\n\n    return 0;\n}\n",[36,642,640],{"__ignoreMap":34},[19,644,464],{"id":645},"c5-p2-1",[24,647,648],{"id":648},"寻找250",[28,650,653],{"className":651,"code":652,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n#include\u003Cmath.h>\n\nint main(void) {\n\tint a;\n\tint count=0;\n\n\twhile (scanf(\"%d\", &a) == 1) {\n\t\tcount++;\n\t\tif (a == 250) {\n\t\t\tprintf(\"%d\", count);\n\t\t\tbreak;\n\t\t}\n\n\t}\n\treturn 0;\n}\n",[36,654,652],{"__ignoreMap":34},[24,656,657],{"id":657},"计算阶乘和",[28,659,662],{"className":660,"code":661,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n\nint main() {\n\tint n=0;\n\tint count=0;\n\n\n\tscanf(\"%d\", &n);\n\n\tfor (int i = 1;i \u003C= n;i++) {\n\n\t\tint x = 1;\n\n\t\tfor (int j = 1;j \u003C= i;j++) {\n\n\t\t\tx = x * j;\n\n\t\t}\n\n\t\tcount = count + x;\n\n\t}\n\n\tprintf(\"%d\",count);\n\n\treturn 0;\n}\n",[36,663,661],{"__ignoreMap":34},[24,665,666],{"id":666},"整除光棍",[28,668,673],{"className":669,"code":671,"language":672},[670],"language-text","#include\u003Cstdio.h>\n\nint main() {\n\tint x;\n\tscanf(\"%d\", &x);\n\n\tint yushu = 0;\n\tint count = 0;\n\n\tint zero = 0;\n\n\twhile (1) {\n\n\t\tcount++;\n\t\tyushu = yushu * 10 + 1;\n\t\tif (yushu >= x) {\n\t\t\t\n\t\t\tprintf(\"%d\", yushu \u002F x);\n\t\t\tyushu = yushu % x;\n\t\t\tzero = 1;\n\n\t\t\tif (yushu == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(zero==1)\n\t\t{\n\t\tif  (yushu * 10 + 1 \u003C x){\n\t\t\tprintf(\"0\");\n\t\t}\n\t\t}\n\n\t}\n\tprintf(\" %d\",count);\n\n\treturn 0;\n}\n","text",[36,674,671],{"__ignoreMap":34},[24,676,677],{"id":677},"求幂级数展开的部分和",[28,679,682],{"className":680,"code":681,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n#include\u003Cmath.h>\n\nint main() {\n\t\n\tdouble x;\n\tscanf(\"%lf\", &x);\n\n\tdouble sum = 1;\n\tdouble fm = 1.0;\n\n\tdouble m=1;\n\tint i = 1;\n\n\twhile((m\u002Ffm)>=0.000001) {\n\n\t\tm = pow(x, i);\n\n\t\tfm = fm * i;\n\n\t\tsum = sum + m \u002F fm;\n\n\t\ti++;\n\t}\n\t\n\tprintf(\"%.5lf\", sum);\n\n\treturn 0;\n\t}\n",[36,683,681],{"__ignoreMap":34},[24,685,686],{"id":686},"求奇数和",[28,688,691],{"className":689,"code":690,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n#include\u003Cmath.h>\n\nint main() {\n\t\n\tint n=0;\n\n\tint sum = 0;\n\n\twhile (1) {\n\n\t\tscanf(\"%d\", &n);\n\n\t\tif (n > 0) {\n\n\t\t\tif (n % 2 == 1) {\n\n\t\t\t\tsum += n;\n\n\t\t\t}\n\n\n\t\t}\n\t\telse {\n\n\t\t\tbreak;\n\n\t\t}\n\n\t}\n\n\tprintf(\"%d\", sum);\n\n\treturn 0;\n\t}\n",[36,692,690],{"__ignoreMap":34},[24,694,695],{"id":695},"猴子吃桃问题",[28,697,700],{"className":698,"code":699,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n#include\u003Cmath.h>\n\nint main() {\n\t\n\tint day = 0;\n\tint sum = 1;\n\n\tscanf(\"%d\", &day);\n\n\tfor (int i = 1;i \u003C day;i++) {\n\n\t\tsum = (sum + 1) * 2;\n\n\t}\n\n\tprintf(\"%d\", sum);\n\n\treturn 0;\n\t}\n",[36,701,699],{"__ignoreMap":34},[24,703,704],{"id":704},"水仙花数",[28,706,709],{"className":707,"code":708,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n#include\u003Cmath.h>\n\nint lf(int x,int n) {\n\n\tint re = 1;\n\n\tfor (int o = 1;o \u003C= n;o++) {\n\n\t\tre = re * x;\n\t}\n\n\treturn re;\n}\n\n\nint main() {\n\t\n\tint n=0,x,sum=0;\n\n\tscanf(\"%d\", &n);\n\n\tint start = lf(10, n - 1);\n\tint end = lf(10, n) - 1;\n\n\n\n\n\tfor (int i = start;i \u003C= end;i++) {\n\n\t\tsum = 0;\n\n\t\tx = i;\n\n\t\tfor (int j = 1; j \u003C= n; j++) {\n\n\t\t\tint temp = x % 10;\n\t\t\t\n\t\t\tsum = sum + lf(temp, n);\n\n\t\t\tx = x \u002F 10;\n\t\t}\n\n\t\tif (sum == i)printf(\"%d\\n\", i);\n\n\n\t}\n\n\treturn 0;\n\t}\n",[36,710,708],{"__ignoreMap":34},[24,712,713],{"id":713},"兔子繁衍问题",[28,715,718],{"className":716,"code":717,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n#include\u003Cmath.h>\n\n\nint main() {\n\tint a, b, d, n,sum;\n\n\n\tscanf(\"%d\", &n);\n\n\ta = 1;\n\tb = 0;\n\td = 0;\n\n\tsum = a + b + d;\n\n\tint time = 1;\n\n\tif (n == 1) {\n\t\tprintf(\"1\");\n\t\treturn 0;\n\t}\n\n\twhile (sum \u003C n) {\n\t\tint b2 = a;\n\t\tint a2 = d+b;\n\t\tint d2 = d + b;\n\n\t\ta = a2;\n\t\tb = b2;\n\t\td = d2;\n\t\t\t\t\n\t\tsum = a + b + d;\n\n\t\ttime++;\n\t}\n\n\tprintf(\"%d\", time);\n\n\treturn 0;\n\t}\n",[36,719,717],{"__ignoreMap":34},[24,721,722],{"id":722},"黑洞数",[28,724,727],{"className":725,"code":726,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n\n\nint main() {\n\tint x;\n\tint a, b, c;\n\n\tint num = 0;\n\n\tscanf(\"%d\", &x);\n\n\tif (x == 495) {\n\t\tint a = 5, b = 9, c = 4; \n\t\tint max = 954, min = 459;\n\t\tx = max - min; \n\t\tprintf(\"1: %d - %d = %d\\n\", max, min, x);\n\t\treturn 0;\n\t}\n\t\n\t\t\n\twhile (x != 495){\n\n\t\ta = x % 10;\n\n\t\tb = x\u002F10 % 10;\n\n\t\tc = x\u002F100;\n\n\t\tint re_x_max;\n\t\tif (a >= b && a >= c)re_x_max = a;\n\t\telse if (b >= a && b >= c)re_x_max = b;\n\t\telse re_x_max = c;\n\n\t\tint re_x_min;\n\t\tif (a \u003C= b && a \u003C= c)re_x_min = a;\n\t\telse if (b \u003C= a && b \u003C= c)re_x_min = b;\n\t\telse re_x_min = c;\n\n\t\tint re_x_mid = a + b + c - re_x_max - re_x_min;\n\n\t\tint max = re_x_max * 100 + re_x_mid * 10 + re_x_min;\n\t\tint min = re_x_min * 100 + re_x_mid * 10 + re_x_max;\n\n\t\tx = max - min;\n\n\t\tnum++;\n\n\t\tprintf(\"%d: %d - %d = %d\\n\", num, max, min, x);\n\n\t\tif (x == 0)break;\n\t}\n\n\treturn 0;\n\t}\n",[36,728,726],{"__ignoreMap":34},[24,730,731],{"id":731},"输出三角形字符阵列",[28,733,736],{"className":734,"code":735,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n\n\nint main() {\n\tint x=0;\n\tscanf(\"%d\", &x);\n\n\tint c = 65;\n\n\tint n = x;\n\n\tfor (int i = 1;i \u003C= x;i++) {\n\n\t\tint spa = 0;\n\t\tfor (int j = 1;j \u003C= n;j++) \n\t\t{\n\t\t\tif (spa == 0) {\n\t\t\t\tprintf(\"%c\", c);\n\t\t\t\tc++;\n\t\t\t\tspa = 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tprintf(\" %c\", c);\n\t\t\t\tc++;\n\t\t\t}\n\t\t}\n\n\t\tn--;\n\n\t\tprintf(\"\\n\");\n\n\t\tif (x == 0)break;\n\t}\n\n\treturn 0;\n\t}\n",[36,737,735],{"__ignoreMap":34},[24,739,740],{"id":740},"求整数的位数及各位数字之和",[28,742,745],{"className":743,"code":744,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n\n\nint main() {\n\tlong long n=0;\n\tscanf(\"%d\", &n);\n\n\tint count = 0;\n\tint sum = 0;\n\n\tif (n == 0) {\n\t\tprintf(\"1 0\\n\");\n\t\treturn 0;\n\t}\n\n\twhile (n>0) {\n\n\t\tint last = n%10;\n\t\tsum += last;\n\t\tcount++;\n\t\tn \u002F= 10;\n\n\t}\n\n\tprintf(\"%d %d\", count, sum);\n\n\n\treturn 0;\n\t}\n",[36,746,744],{"__ignoreMap":34},[24,748,749],{"id":749},"特殊a串数列求和",[28,751,754],{"className":752,"code":753,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n\nint main() {\n\t\n\tint a, n;\n\tint sum=0;\n\n\t\tscanf(\"%d %d\", &a, &n);\n\n\tint ls = a;\n\n\tfor (int i = 1;i \u003C= n;i++) {\n\n\t\tsum = sum + a;\n\t\ta = a * 10 + ls;\n\n\t}\n\n\n\tprintf(\"%d\", sum);\n\n\treturn 0;\n\t}\n",[36,755,753],{"__ignoreMap":34},[24,757,759],{"id":758},"验证哥德巴赫猜想","验证“哥德巴赫猜想”",[28,761,764],{"className":762,"code":763,"language":115,"meta":34},[113],"#include \u003Cstdio.h>\n#include \u003Cmath.h> \n\nint isPrime(long num) {\n    if (num \u003C= 1) return 0;\n    if (num == 2) return 1;\n    if (num % 2 == 0) return 0;\n\n    for (long i = 3; i \u003C= sqrt(num); i += 2) {\n        if (num % i == 0) {\n            return 0;\n        }\n    }\n    return 1;\n}\n\nint main() {\n    long n;\n    scanf(\"%ld\", &n);\n\n\n    for (long p = 2; p \u003C= n \u002F 2; p++) {\n        long q = n - p;\n        if (isPrime(p) && isPrime(q)) {\n            printf(\"%ld = %ld + %ld\", n, p, q);\n            return 0; \n        }\n    }\n\n    return 0;\n}\n",[36,765,763],{"__ignoreMap":34},[24,767,768],{"id":768},"换硬币",[28,770,773],{"className":771,"code":772,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n\nint main() {\n\tint n=03;\n\tint fen5 = 0, fen2 = 0, fen1 = 0;\n\tint count = 0;\n\n\tscanf(\"%d\", &n);\n\n\tfor (fen5 = (n - 3) \u002F 5;fen5 >=1;fen5--){\n\n\t\tfor (fen2 = (n - (5 * fen5) - 1);fen2 >= 1;fen2--) {\n\n\t\t\tfen1 = n - fen5 * 5 - fen2 * 2;\n\n\t\t\tif (fen1 >= 1) {\n\n\t\t\t\tint total = fen5 + fen2 + fen1;\n\t\t\t\tprintf(\"fen5:%d, fen2:%d, fen1:%d, total:%d\\n\", fen5, fen2, fen1, total);\n\t\t\t\tcount++;\n\n\t\t\t}\n\t\t}\n\n\t}\n\n\tprintf(\"count = %d\\n\", count);\n\treturn 0;\n\n}\n",[36,774,772],{"__ignoreMap":34},[24,776,777],{"id":777},"统计素数并求和",[28,779,782],{"className":780,"code":781,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n\nint main() {\n\tint m,n;\n\tscanf(\"%d %d\",&n,&m);\n\n\tint sum = 0;\n\tint num = 0;\n\n\tint su = 1;\n\n\n\tfor (n;n \u003C= m;n++) {\n\n\t\tif (n == 1)su = 0;\n\t\telse\n\t\t{\n\t\t\tfor (int i = 2;i \u003C n;i++) {\n\n\t\t\t\tif (n % i == 0) {\n\t\t\t\t\tsu = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\n\t\tif (su == 1) {\n\t\t\tnum++;\n\t\t\tsum += n;\n\t\t}\n\n\t\tsu = 1;\n\n\t}\n\t\n\n\n\tprintf(\"%d %d\",num,sum);\n\n}\n",[36,783,781],{"__ignoreMap":34},[24,785,786],{"id":786},"求e的近似值",[28,788,791],{"className":789,"code":790,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n\nint main() {\n\tint n;\n\tscanf(\"%d\",&n);\n\n\n\tdouble sum=0;\n\n\tdouble fm=1;\n\n\tfor (int i=1; i \u003C= n+1;i++) {\n\t\n\t\tsum = sum + 1.0\u002Ffm ;\n\n\t\tfm=fm*i;\n\n\t}\n\n\n\tprintf(\"%.8lf\",sum);\n\n}\n",[36,792,790],{"__ignoreMap":34},[24,794,795],{"id":795},"求平方与倒数序列的部分和",[28,797,800],{"className":798,"code":799,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n\nint main() {\n\tint m, n;\n\tscanf(\"%d %d\", &m, &n);\n\n\tdouble sum=0;\n\n\tfor (m; m \u003C= n;m++) {\n\n\t\tsum = sum + (m * m) + (1.0 \u002F m);\n\n\t}\n\n\tprintf(\"%lf\",sum);\n\n}\n",[36,801,799],{"__ignoreMap":34},[24,803,804],{"id":804},"求组合数",[28,806,809],{"className":807,"code":808,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n\nint main() {\n\tdouble c;\n\tdouble m, n;\n\tdouble up=1, down=1;\n\n\tscanf(\"%lf %lf\", &m, &n);\n\n\tdouble ls = m;\n\twhile (ls != 0) {\n\n\t\tup = up * n;\n\t\tn --;\n\t\tls--;\n\n\t}\n\n\tls = m;\n\twhile (ls != 0) {\n\n\t\tdown = down * m;\n\t\tls--;\n\t\tm--;\n\n\t}\n\n\tprintf(\"%.0lf\",up\u002Fdown);\n\n}\n",[36,810,808],{"__ignoreMap":34},[24,812,814],{"id":813},"求简单交错序列前n项和","求简单交错序列前N项和",[28,816,819],{"className":817,"code":818,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n\nint main() {\n\n\tint fm = 1;\n\tint num = 1;\n\tint n = 0;\n\tdouble sum = 0;\n\n\tscanf(\"%d\", &n);\n\n\tfor (int i = 0; i \u003C n; i++) {\n\n\t\tif (num % 2 == 0) {\n\t\t\tsum = sum - (1.0 \u002F fm);\n\t\t}\n\t\telse {\n\t\t\tsum = sum + (1.0 \u002F fm);\n\t\t}\n\n\t\tfm += 3;\n\t\tnum++;\n\n\t}\n\n\tprintf(\"%.4lf\", sum);\n\n}\n",[36,820,818],{"__ignoreMap":34},[24,822,823],{"id":823},"最佳情侣身高差",[28,825,828],{"className":826,"code":827,"language":115,"meta":34},[113],"#include\u003Cstdio.h>\n\nint main() {\n\tint x = 0;\n\n\tscanf(\"%d\", &x);\n\n\tfor (int i = 1;i \u003C= x;i++) {\n\n\t\tdouble n;\n\t\tchar sex;\n\n\n\t\tscanf(\" %c %lf\", &sex, &n);\n\n\t\tif (sex == 'M') {\n\t\t\tprintf(\"%.2lf\\n\", n \u002F 1.09);\n\t\t}\n\t\telse {\n\t\t\tprintf(\"%.2lf\\n\", n * 1.09);\n\t\t}\n\n\t}\n\n\n\n\treturn 0;\n}\n",[36,829,827],{"__ignoreMap":34},{"title":34,"searchDepth":831,"depth":831,"links":832},4,[833,844,860,875,889,911],{"id":21,"depth":834,"text":22,"children":835},2,[836,838,839,840,841,842,843],{"id":26,"depth":837,"text":26},3,{"id":40,"depth":837,"text":40},{"id":49,"depth":837,"text":49},{"id":58,"depth":837,"text":59},{"id":68,"depth":837,"text":68},{"id":77,"depth":837,"text":77},{"id":86,"depth":837,"text":87},{"id":96,"depth":834,"text":97,"children":845},[846,847,848,849,850,851,852,853,854,855,856,857,858,859],{"id":100,"depth":837,"text":100},{"id":109,"depth":837,"text":109},{"id":120,"depth":837,"text":120},{"id":129,"depth":837,"text":129},{"id":138,"depth":837,"text":138},{"id":147,"depth":837,"text":147},{"id":156,"depth":837,"text":156},{"id":165,"depth":837,"text":165},{"id":174,"depth":837,"text":174},{"id":183,"depth":837,"text":184},{"id":193,"depth":837,"text":193},{"id":202,"depth":837,"text":202},{"id":211,"depth":837,"text":211},{"id":220,"depth":837,"text":220},{"id":229,"depth":834,"text":230,"children":861},[862,863,864,865,866,867,868,869,870,871,872,873,874],{"id":233,"depth":837,"text":234},{"id":243,"depth":837,"text":243},{"id":252,"depth":837,"text":252},{"id":261,"depth":837,"text":261},{"id":270,"depth":837,"text":270},{"id":279,"depth":837,"text":279},{"id":288,"depth":837,"text":288},{"id":297,"depth":837,"text":297},{"id":306,"depth":837,"text":306},{"id":314,"depth":837,"text":314},{"id":323,"depth":837,"text":323},{"id":332,"depth":837,"text":332},{"id":341,"depth":837,"text":341},{"id":350,"depth":834,"text":351,"children":876},[877,878,879,880,881,882,883,884,885,886,887,888],{"id":354,"depth":837,"text":354},{"id":363,"depth":837,"text":363},{"id":372,"depth":837,"text":372},{"id":381,"depth":837,"text":381},{"id":390,"depth":837,"text":390},{"id":399,"depth":837,"text":399},{"id":408,"depth":837,"text":409},{"id":418,"depth":837,"text":418},{"id":427,"depth":837,"text":427},{"id":436,"depth":837,"text":436},{"id":445,"depth":837,"text":445},{"id":454,"depth":837,"text":454},{"id":463,"depth":834,"text":464,"children":890},[891,892,893,894,895,896,897,898,899,900,901,902,903,904,905,906,907,908,909,910],{"id":467,"depth":837,"text":467},{"id":476,"depth":837,"text":477},{"id":486,"depth":837,"text":486},{"id":495,"depth":837,"text":495},{"id":504,"depth":837,"text":504},{"id":513,"depth":837,"text":513},{"id":522,"depth":837,"text":522},{"id":531,"depth":837,"text":532},{"id":535,"depth":837,"text":535},{"id":544,"depth":837,"text":544},{"id":553,"depth":837,"text":553},{"id":562,"depth":837,"text":562},{"id":571,"depth":837,"text":571},{"id":580,"depth":837,"text":580},{"id":589,"depth":837,"text":590},{"id":599,"depth":837,"text":599},{"id":608,"depth":837,"text":609},{"id":618,"depth":837,"text":618},{"id":627,"depth":837,"text":627},{"id":636,"depth":837,"text":636},{"id":645,"depth":834,"text":464,"children":912},[913,914,915,916,917,918,919,920,921,922,923,924,925,926,927,928,929,930,931,932],{"id":648,"depth":837,"text":648},{"id":657,"depth":837,"text":657},{"id":666,"depth":837,"text":666},{"id":677,"depth":837,"text":677},{"id":686,"depth":837,"text":686},{"id":695,"depth":837,"text":695},{"id":704,"depth":837,"text":704},{"id":713,"depth":837,"text":713},{"id":722,"depth":837,"text":722},{"id":731,"depth":837,"text":731},{"id":740,"depth":837,"text":740},{"id":749,"depth":837,"text":749},{"id":758,"depth":837,"text":759},{"id":768,"depth":837,"text":768},{"id":777,"depth":837,"text":777},{"id":786,"depth":837,"text":786},{"id":795,"depth":837,"text":795},{"id":804,"depth":837,"text":804},{"id":813,"depth":837,"text":814},{"id":823,"depth":837,"text":823},[934],"WUST-OJ","2026-01-08 23:04:49","WUST-OJ的C1-C5题集答案的分享",false,"md","https:\u002F\u002Fjianges.com\u002Fwp-content\u002Fuploads\u002F2026\u002F01\u002F1767861378-wust-oj-lower.png",{"slots":941},{},true,"\u002F2026\u002Fwust-oj-c1-5",null,{"text":946,"minutes":947,"time":948,"words":949},"26 min read",25.19,1511400,5038,{"title":5,"description":936},{"loc":943},"posts\u002F2026\u002FWUST_OJ C1-5",[954,955,956],"代码","前端","问题","tech","2026-01-12 20:51:50","TciHytEDpNZ6ZpAfASDrSKCnix0VIKFKeR23yOLSnNY",[961,966],{"title":962,"path":963,"stem":964,"date":965,"type":957,"children":-1},"2025 | 中国近现代史重点","\u002F2026\u002Fmodern-history-review","posts\u002F2026\u002F2025 近代史纲要重点","2026-01-08 10:35:50",{"title":967,"path":968,"stem":969,"date":970,"type":957,"children":-1},"2025 | 形势与政策重点","\u002F2026\u002Fcurrent-affairs-policy-review","posts\u002F2026\u002F2025 形势与政策重点","2026-01-12 20:17:25",1786256779739]