Too many or too few lines

#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
const int MAXN = 3000000;
char s[MAXN];
int cnt[30],mark[500],mx;
//cnt记录每种字母出现了多少次 
//mark记录柱状图的每一行最右边的*的位置
//mx记录柱状图的最大高度 
int main()
{
//    freopen("result.txt","w",stdout);
    for(int i = 1;i <= 4;++ i)
    {
        gets(s);
        for(int j = 0;j < strlen(s);++ j)
            if(s[j] >= 'A' && s[j] <= 'Z')
                cnt[s[j]-'A'+1] ++;
    }
    for(int i = 1;i <= 26;++ i)
        if(cnt[i] > mx) mx = cnt[i];
    for(int i = mx;i >= 0;-- i)
        for(int j = 1;j <= 26;++ j)
            if(cnt[j] >= i) mark[i] = j;
    for(int i = mx;i >= 0;-- i)

        if(i)
        {
            for(int j = 1;j <= 26;++ j)
            {
                if(j == mark[i])
                {
                    if(cnt[j] >= i)
                        printf("*");
                    else
                        printf(" ");
                    break;
                }
                if(cnt[j] >= i)
                    printf("* ");
                else
                    printf("  ");
            }
            puts("\n");    
        }
        else
            for(int j = 1;j <= 26;++ j)
            {
                if(j == 26) printf("%c",'A'+j-1);
                else printf("%c ",'A'+j-1);
            }
    }
    return 0;
}