RT，但是为什么用桶排序排重不加判断是WA，这种方法就是RE呢，不理解

#include<bits/stdc++.h>
using namespace std;

int d[10], a, b, c, x, y, z, f, r;

void chk(int n)
{
    d[n/100] = d[n/10%10] = d[n%10] = 1;
}
int main()
{
    cin >> a >> b >> c;
    for(int i = 1; i < 765; i++)
    {
        x = i * a;
        y = i * b;
        z = i * c;
        if(y > 999 || z > 999) break;//这里
        chk(x);
        chk(y);
        chk(z);
        for(int i = 1; i <= 9; i++)
            if(d[i] == 0)
                f = 1;
        if(!f)
        {
            cout << x << " " << y << " " << z << '\n';
            r = 1;
        }
        else f = 0;
        
        memset(d, 0, sizeof(d));
    }
    if(!r)
        cout << "No!!!" << '\n';
    
    return 0;
}