9数算式（模拟）

9数算式 - 蓝桥云课 (lanqiao.cn)

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#define x first
#define y second
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
 
typedef long long LL;
typedef pair<int,int> PII;
typedef pair<double,double> PDD;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<LL,LL> PLL;
//typedef __int128 i128;
typedef unsigned long long ULL;
const int N = 3000+  10,M = N *6 ;
const int INF = 0x3f3f3f3f ,mod = 1e9 + 7 ,P = 131;
const double eps = 1e-7;
 
 
int cnt[10];
 
 
int check(LL a)
{
    ms(cnt,0);
    
    while(a)
    {
        int t = a % 10;cnt[t] ++ ;
        a/=10;
    }
    for(int i=1;i<=9; i++ )
    if(cnt[i]!= 1) return 0;
    return 1;
}
 
void solve()
{
    string s = "123456789";
    int ans =0 ;
    do{
        for(int i=1;i<=4;i ++ )        
        {
            int x =stoi(s.substr(0,i));
            int y =stoi(s.substr(i));
            ans += check(x * y );
        }
        
    }while(next_permutation(s.begin(),s.end()));
    
    
    cout << ans <<endl;
    
        
        
    
}
 
signed main()
{
//  freopen("1.txt","r",stdin);
    ios
 
    int T=1;
//    cin>>T;
    int now = 1;
    while(T -- )
    {
//      cout<<"Case "; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
        solve();
    }
 
 
    return 0;
}