【題解】codeforces1047A[Codeforces Round #511 (Div. 2)]A.Little C Loves 3 I 數學知識
阿新 • • 發佈:2018-12-12
Description
Little C loves number «3» very much. He loves all things about it.
Now he has a positive integer n. He wants to split n into 3 positive integers a,b,c, such that a+b+c=n and none of the 3 integers is a multiple of 3. Help him to find a solution.
Input
A single line containing one integer n (3≤n≤109) — the integer Little C has.
Output
Print 3 positive integers a,b,c in a single line, such that a+b+c=n and none of them is a multiple of 3.
It can be proved that there is at least one solution. If there are multiple solutions, print any of them.
Examples
Input
3
Output
1 1 1
Input
233
Output
77 77 79
可以考慮特殊解的情況。固定一個解為 ,如果 不是 的倍數,則答案 ,否則答案 。
#include<cstdio>
int n;
int main()
{
scanf("%d",&n);
if((n-2)%3)printf("1 1 %d\n",n-2);
else printf("1 2 %d\n",n-3);
return 0;
}
總結
從特殊情況下手比較簡單。