#include <bits/stdc++.h>   using namespace std;   int n;   double dp[(1 << 20)];   double a[20][20];   int main() {     cin >> n;     for (int i = 0; i < n; i++) {       for (int j = 0; j < n; j++) {         cin >> a[i][j];       }     }     dp[(1 << n) - 1] = 1.0;     for (int st = (1 << n) - 1; st >= 0; st--) {       for (int i = 0; i < n; i++) {         if (st & (1 << i)) {           for (int j = 0; j < n; j++) {             if ((st & (1 << j)) && (i != j)) {               int q = __builtin_popcount(st);               dp[st ^ (1 << j)] += dp[st] * a[i][j] * (1.0 / (q * (q - 1) / 2));             }           }         }       }     }     for (int i = 1; i < (1 << n); i = (i << 1)) {       printf( %.6f  , dp[i]);     }   }   