Submission

Score: 100

User: august

Problemset: forex

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-16 19:06:21

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

#define pi pair<int,int>

const int mx = 31;

double dp[mx][mx][mx];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin>> n;

    for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) cin>> dp[1][i][j];

    for (int len=2; len<=n; len++) {
        for (int k=1; k<=n; k++) {
            for (int i=1; i<=n; i++) {
                for (int j=1; j<=n; j++) {
                    double val = dp[len-1][i][k]*dp[1][k][j];
                    if (dp[len][i][j] < val) {
                        dp[len][i][j] = val;
                    }
                }
            }
        }
        
        for (int i=1; i<=n; i++) {
            if (dp[len][i][i] > 1.01) {
                cout<< i<< ' '<< len;   
                return 0;
            }
        }
    }
    cout<< -1;

}