CF1047A.Little C Loves 3 I

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Little C loves number «3» very much. He loves all things about it.

Now he has a positive integer nn . He wants to split nn into 33 positive integers a,b,ca,b,c , such that a+b+c=na+b+c=n and none of the 33 integers is a multiple of 33 . Help him to find a solution.

输入格式

A single line containing one integer nn ( 3n1093 \leq n \leq 10^9 ) — the integer Little C has.

输出格式

Print 33 positive integers a,b,ca,b,c in a single line, such that a+b+c=na+b+c=n and none of them is a multiple of 33 .

It can be proved that there is at least one solution. If there are multiple solutions, print any of them.

输入输出样例

  • 输入#1

    3
    

    输出#1

    1 1 1
  • 输入#2

    233

    输出#2

    77 77 79
    
首页