{"trustable":false,"sections":[{"title":"题意","value":{"format":"HTML","content":"\u003cp style\u003d\"font-size: 2px;\"\u003e 输入一个正整数s,求一个最大的正整数n,使得n的所有正因子之和为s。\u003c/p\u003e"}},{"title":"输入格式","value":{"format":"HTML","content":"\u003cstrong\u003e为多组数据,分为多行,每行一个整数s。\u003c/strong\u003e"}},{"title":"输出格式","value":{"format":"HTML","content":"\u003cstrong\u003e打印 \"Case kase: x[Enter]\"。其中kase为测试数据的行数(第几个数据),x为你的答案。\u003c/strong\u003e"}},{"title":"标准输入输出","value":{"format":"HTML","content":"\u003cstrong\u003e输入:\u003c/strong\u003e\n\u003cpre\u003e\n1\n10\n100\n1000\n257\n348\n\u003c/pre\u003e\n\n\u003cstrong\u003e输出:\u003c/strong\u003e\n\u003cpre\u003e\nCase 1: 1\nCase 2: -1\nCase 3: -1\nCase 4: -1\nCase 5: -1\nCase 6: 347\n\u003c/pre\u003e\n\n\u003cfont color\u003d\"red\"\u003e\u003cstrong\u003e小提示\u003c/strong\u003e\u0026nbsp;\u0026nbsp;由于该题为多组测试数据,需要用EOF(End of File)判断输入是否结束。在Windows系统中,可以按Ctrl+Z 和 Enter 实现EOF;在Linux直接按Ctrl+D就可以了。"}},{"title":"提示","value":{"format":"HTML","content":"\u003cscript src\u003d\"https://cn.vjudge.net/static/bundle/vendor.7eaee7b5a6f4ab59f598.css\"\u003e\u003c/script\u003e\n\u003ci class\u003d\"fa fa-2x\"\u003e\n\u003ca class\u003d\"fa fa-upload\" href\u003d\"javascript: void(0);\"\u003e\u003c/a\u003e\n\u003ca href\u003d\"https://baike.baidu.com/item/算术基本定理/10920095?fr\u003daladdin\" class\u003d\"fa fa-spin\" title\u003d\"百度搜一下\"\u003e要用到\u003cstrong\u003e唯一分解定理\u003c/strong\u003e哦!\u003c/a\u003e\n\u003c/i\u003e"}},{"title":"标程(请勿抄袭)","value":{"format":"HTML","content":"\u003cpre\u003e\nvoid init(){\n\tmemset sum 0\n\tfor(i \u003d 1 to maxn-1)\n\t\tfor(j \u003d 1 to i) if(i mod j\u003d\u003d0) sum[i]+\u003dj\n}\n\u003c/pre\u003e\n\n\u003cstrong\u003e上方为代码的核心部分,可以借鉴,不可抄袭!谢谢!\u003c/strong\u003e"}}]}