改了还是60…dalao求解答

#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
int a,b,c,book[10],yi,er,san,la,lb,lc,mark[10],flag;
void babc()
{
    yi=book[1]*100 + book[2]*10 + book[3];
    er=book[4]*100 + book[5]*10 + book[6];
    san=book[7]*100 + book[8]*10 + book[9];
    la=yi/a;    lb=er/b;    lc=san/c;
    if ( la==lb && lb==lc )
    {
        flag=1;
         for (int j=1;j<=9;j++)
         {
             printf("%d",book[j]);
             flag++;
             if (flag==4 || flag==7)
             {
                printf(" ");
             }
         }
         printf("\n");
         return;
    }
    else
        return;
}
void dfs(int depth)
{
     if (depth > 9)
     {
        babc();
        return;
     }
     for (int i=1;i<=9;i++)
     {
         if (mark[i]==0)
         {
             book[depth]=i;
             mark[i]=1;
             dfs(depth+1);
             mark[i]=0;
         }
       }
    return;
}
int main()
{
    scanf("%d%d%d",&a,&b,&c);
    dfs(1);
    if (!flag) printf("No!!!");
    return 0;
}