Submission #28551916

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)//iをaからn
#define per(i,n,a) for (int i=a-1;i>=n;i--)//iをnからa
#define db(x) cout << #x << " = " << x << endl//デバッグ用
#define db2(x, y) cout << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"; //デバッグ用
#define all(x) (x).begin(), (x).end()
#define INF32 2147483647 //2.147483647×10^{9}:32bit整数のinf
#define INF64 9223372036854775807 //9.223372036854775807×10^{18}:64bit整数のinf
#define MOD 998244353 //10^9+7:合同式の法
#define pb push_back
#define mp make_pair
#define F first
#define S second
typedef long long ll;
//sort(all(a)); ソート
//sort(all(a),greater<int>()); 逆順ソート
//a.erase(unique(all(a)), a.end()); ソート後に重複を削除
//cout<< std::fixed << std::setprecision(15)<<0.000001<<endl; 小数点以下を表示させる
//vector<vector<int>> data(3, vector<int>(4)); int型の2次元配列(3×4要素の)の宣言
int rota(int n){
    int keta=1;
    int nnn=n;
    while(nnn/10){
        nnn/=10;
        keta*=10;
    }
    return n/10+(n%10)*keta;
}

int main (){
    ll a,n;
    set<int> nums;
    vector<int> nownums;
    
    cin>>a>>n;

    int ans=MOD;
    nownums.pb(1);
    rep(i,0,1000000){
       set<int> nextnums;
       rep(j,0,nownums.size()){
           ll nown=nownums.at(j);
           if(nown*a<n*11){
                if(nums.count(nown*a)==0){
                    nextnums.insert(nown*a);
                }
           }
           if(nown%10!=0){
                ll nextn=rota(nown);
                if(nums.count(nextn)==0){
                    nextnums.insert(nextn);
                }
           }
       }
       if(nextnums.count(n)!=0){
           ans=i+1;
           break;
       }
       if(nextnums.empty()){
           break;
       }
       vector<int> vec(nextnums.begin(), nextnums.end());
       nownums=vec;
       nums.merge(nextnums);
    }
    if(ans==MOD){
    cout<<-1;    
    }else{
    cout<<ans;
    }

    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:3:34: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
    3 | #define rep(i,a,n) for (int i=a;i<n;i++)//iをaからn
......
   42 |        rep(j,0,nownums.size()){
      |            ~~~~~~~~~~~~~~~~~~     
./Main.cpp:42:8: note: in expansion of macro ‘rep’
   42 |        rep(j,0,nownums.size()){
      |        ^~~

Judge Result