提出 #73512565

---

ソースコード 拡げる

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

int main(){
    ll m, a, b; 
    cin >> m >> a >> b;
    
    ll res = 0;
    
    for(ll x = 1; x < m; x++){
        for(ll y = 1; y < m; y++){
            set<pair<ll,ll>> seen;  // Track PAIRS!
            
            ll s1 = x, s2 = y;
            bool valid = true;
            
            for(int iter = 0; iter < m*m; iter++){  // Max m^2 states
                if(seen.count({s1, s2})){
                    // Cycle without hitting 0
                    break;
                }
                seen.insert({s1, s2});
                
                ll next = (a * s2 + b * s1) % m;
                
                if(next == 0){
                    valid = false;
                    break;
                }
                
                s1 = s2;
                s2 = next;
            }
            
            if(valid) res++;
        }
    }
    
    cout << res << '\n';
}

提出情報

ジャッジ結果