Submission
Status:
[PPPPPPPPPPPPPPP]
Subtask/Task Score:
{100/100}
Score: 100
User: Hexopia
Problemset: forex
Language: cpp
Time: 0.003 second
Submitted On: 2026-03-18 12:34:25
#include <bits/stdc++.h>
using namespace std;
double dp[100][35][35];
int main() {
ios_base::sync_with_stdio(0),cin.tie(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 x = 2 ; x<100 ; ++x) {
for(int i = 1 ; i<=n ; ++i) {
for(int j= 1 ; j<=n ; ++j) {
for(int k = 1 ; k<=n ; ++k) {
dp[x][i][j] = max(dp[x][i][j], dp[x-1][i][k]*dp[1][k][j]);
}
}
}
for(int i = 1 ; i<=n ; ++i) {
if(dp[x][i][i] > 1.01) {
cout << i << " " << x;
return 0;
}
}
}
cout << -1;
}