我场上不怕时间不够,慢慢来
以下,第一行是总量,第二行是分配方式,第三行是方法数及其二进制表示
1
1
1 1
2
2 11
2 10
3
3 12 21 111
4 100
4
4 31 13 22 211 112 121 1111
8 1000
5
5 41 14 32 23 212 122 221 311 113 131 2111 1121 1211 1112 11111
16 10000
可见规律,输出1,后面填0
#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<sstream>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
int dx[]= {0,1,1,1,0,-1,-1,-1};
int dy[]= {1,1,0,-1,-1,-1,0,1};
int gcd (const LL &a, const LL &b) {return b==0?a:gcd (b,a%b);}
using namespace std;
int main() {
int T; scanf ("%d",&T);
while (T--) {
int n;
scanf ("%d",&n);
printf ("1");
for (int i=0; i<n-1; i++) {
printf ("0");
}
printf ("\n");
}
return 0;
}