1 solutions
-
0
C++ :
#include<cstdio> #include<cmath> bool pd(int x) { if(x<2) return false; for(int i=2;i<=sqrt(x);i++) if(x%i==0) return false; return true; } int main() { int n; scanf("%d",&n); for(int i=2;i<=n/3;i++) for(int j=i;j<=n-i;j++) if(pd(i)&&pd(j)&&pd(n-i-j)) { printf("%d %d %d",i,j,n-i-j); return 0; } }
- 1
Information
- ID
- 17291
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By