花落丶子不语 @ 2019-07-09 22:22:36
#include<iostream>
using namespace std;
const int p[2262]{2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59(……内容太长,截肢)};
int main()
{
int n;
cin>>n;
for(int i=1;i<=2262;i++)
for(int j=1;j<=2262;j++)
for(int k=1;k<=2262;k++)
if(p[i]+p[j]+p[k]==n){cout<<p[i]<<" "<<p[j]<<" "<<p[k];return 0;}
return 0;
}
#4 #5 #8
by 嘟嘟cqy @ 2019-07-09 22:33:25
您是TLE了吗???
by 1saunoya @ 2019-07-09 22:36:10
哇你要证明哥德巴赫猜想了
by HeartBlock_Love @ 2019-07-09 22:43:34
@花落丶Refuser 你错误的内容是什么
by aminoas @ 2019-07-09 23:10:02
(数组越界.jpg)
by 花落丶子不语 @ 2019-07-10 21:08:47
@嘟嘟cqy WA
by 花落丶子不语 @ 2019-07-10 21:09:09
@QwQ自动机 ?
by 花落丶子不语 @ 2019-07-10 21:09:55
@无可牵挂 #4 #5 #8WA
by 花落丶子不语 @ 2019-07-10 21:21:25
by 花落丶子不语 @ 2019-07-10 21:22:23
额。。。看不了。。。
by 花落丶子不语 @ 2019-07-10 21:38:05