int find_one(int str, int len)
{
if(len <= str)
return str-len+1;
else
return 0;
}
int main()
{
char ch[1001] = {'\0'};
char* p = "0";
gets(ch);
char* arr[1001] = {0};//创建指针数组,把字串的地址放进去
int i = -1;
char* ret = NULL;
for(ret = strtok(ch, p); ret != NULL; ret = strtok(NULL, p))
{
i++;
arr[i] = ret;
}
int t = i;//分离出了这些字符串,一共有t串
int max = 0;
for(i=0; i<=t; i++)
{
if(strlen(arr[i]) > max)
max = strlen(arr[i]);//找到最长的连续1长度为max
}
int arr2[1001] = {0};
int j;
for(i=0; i<=t; i++)//对每一个字符串进行检索
{
for(j=1; j<=max; j++)
{
arr2[j] += find_one(strlen(arr[i]),j);
}
}
for(i=1; i<=max; i++)
printf("%d %d\n", i, arr2[i]);
return 0;
}