注意方阵中第一个数字如果是1的话要先出0(因为第一个数字表示连续有几个0)
#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define inf 0x3f3f3f3f
#define eps 1e-6
using namespace std;
#define clr(x) memset(x,0,sizeof((x)))
const int maxn = 5e4+1;
#define MAX(a,b,c) ((a)>(b)?((a)>(c)?(a):(c)):((b)>(c)?(b):(c)))
#define _max(a,b) ((a) > (b) ? (a) : (b))
#define _min(a,b) ((a) < (b) ? (a) : (b))
#define _for(a,b,c) for(int a = b;a<c;a++)
int main() {
#ifdef LOCAL
freopen("data.in","r",stdin);
freopen("data.out","w",stdout);
#endif
char x,tmp = '0';
int cnt = 0,i = 0;
int buf[maxn];
clr(buf);
while(cin>>x) {
cnt++;
if(x==tmp)
buf[i]++;
else {
buf[++i]++;
tmp = x;
}
}
cout<<sqrt(cnt);
for(int j = 0;j<=i;j++) {
cout<<" "<<buf[j];
}
return 0;
}