cf B Three matrices

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int g[200][200];
int n;

int main()
{
     while(scanf("%d",&n)!=EOF)
     {
         for(int i=1; i<=n; i++)
         {
             for(int j=1; j<=n; j++)
             {
                 scanf("%d",&g[i][j]);
             }
         }
         for(int i=1; i<=n; i++)
         {
             for(int j=1; j<=n; j++)
             {
                 if(i==j)
                 {
                     printf("%.8lf ",(double)g[i][j]);
                 }
                 else
                 {
                     printf("%.8lf ",(double)((g[i][j]+g[j][i])*1.0/2));
                 }
             }
             printf("
");
         }
         for(int i=1; i<=n; i++)
         {
             for(int j=1; j<=n; j++)
             {
                 if(i==j) printf("%.8lf ",(double)0);
                 else
                 {
                     printf("%.8lf ",(double)((double)g[i][j]-(g[i][j]+g[j][i])*1.0/2));
                 }
             }
             printf("
");
         }
     }
     return 0;
}