题解 CF1104A 【Splitting into digits】
概述
题号 | 难度 | \(AC\)时间及记录 |
---|---|---|
\(\texttt{CF1104A}\) | \(\texttt{CF难度:800}\) | \(\texttt{On 2020/12/26}\) |
解析
题目大意是:
给定一个数字\(N\),请将它拆分成\(X+X+\cdots + X\),\(X\in [1,9]\),使得\(\sum_{i=1}^KX=N\),并且使\(X\)都相等
(已经简化题目大意)
我们很容易想到:
- \(X=1\)
因此,输出就是:
\(N\)
\(1,1,\cdots,1,1\)
代码
/*
Author:Xsmyy
Problem:CF1104A
Date:2020/12/26
*/
#include<bits/stdc++.h>
#define BetterIO ios::sync_with_stdio(false)
#define Fr(i,A,B,X) for(i=A;i<=B;i+=X)
#define Reg register
#define Ll long long
#define Iln inline
#define Str string
#define Chr char
#define Vod void
#define In int
using namespace std;
In main(Vod)
{
BetterIO;
Reg In N;
cin>>N;
Reg In i;
cout<<N<<endl;
Fr(i,1,N,1)
{
putchar('1'),putchar(' ');
}
putchar('\n');
return 0;
}
不要妄图追上西坠的太阳,而是要在黎明前就等着它!