0分求条（WA）

#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
string s, a[5]{"abcdefghijklmnopqrstuvwxyz", "ABCDEFGHIJKLMNOPQRETUVWXYZ", "0123456789", "!@#$"};
bool f[5];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    while (getline(cin, s, ','))
    {
        if (6 > s.size() || s.size() > 12)
        {
            continue;
        }
        for (int i = 0; i < s.size(); i++)
        {
            for (int j = 0; j < 4; j++)
            {
                for (int k = 0; k < a[j].size(); k++)
                {
                    if (s[i] == a[j][k])
                    {
                        f[j] = 1;
                        goto iiii;
                    }
                }
            }
            goto jjjj;
            iiii:;
        }
        if (f[0] + f[1] + f[2] < 2 || !f[3])
        {
            goto jjjj;
        }
        cout << s << endl;
        jjjj:;
    }
    return 0;
}