带分数

#include <bits/stdc++.h>
using namespace std;
int arr[]={1,2,3,4,5,6,7,8,9};
int getNum(int i,int j)
{
    int num=0;
    for (int m = i; m <=j ; ++m) {
        num+=arr[m]*pow(10,(j-m));
    }
    return num;
}
int main()
{
   int N,ans=0;
   scanf("%d",&N);
    do{
        int num1,num2,num3;
        for (int i = 0; i <7 ; ++i) {
            for (int j = i+1; j <=7 ; ++j) {
                num1=getNum(0,i);
                num2=getNum(i+1,j);
                num3=getNum(j+1,8);
                if(num1*num3+num2==N*num3)
                {
                    ans++;
                    //cout<<num1<<"+"<<num2<<"/"<<num3<<"="<<N<<endl;
                }
            }
        }
    }while(next_permutation(arr,arr+9));
    printf("%d",ans);
}