Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- long a[101][101], sum = 0, res[4] = {0, 1, 2}, k = -1;
- long minimal;
- int main() {
- // your code goes here
- long l, i, j, n;
- cin >>n;
- for(i = 0; i < n; i++){
- for(j = 0; j < n; j++){
- cin >>a[i][j];
- }
- }
- minimal = a[0][1]+a[1][2]+a[2][0];
- for(i = 0; i < n; i++){
- for(j = 0; j < n; j++){
- for(l = 0; l < n; l++){
- sum = a[i][j] + a[i][l] + a[j][l];
- if(i != j && j != l && l != i && sum < minimal){
- minimal = sum;
- res[0] = i;
- res[1] = j;
- res[2] = l;
- }
- }
- }
- }
- // <<endl;
- cout <<res[0] + 1 <<' ' <<res[1] + 1 <<' ' <<res[2] + 1;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement