关于#矩阵#的问题，如何解决？

测试的原始数据想要进行整理，由原来的矩阵转换成三列

T1   T2 

F1 R11 R21
F2 R12 R22
F3 R13 R23

转化成
F T R
F1 T1 R11
F2 T1 R12
F3 T1 R13
F1 T2 R21
F2 T2 R22
F3 T2 R23

原始数据的一部分如下：

Strip LA-01-SD-1

Freq.[Hz]|60.0|57.5|55.0|52.5|50.1|47.6|45.1|42.5|40.0|37.6|35.0|32.4|30.0|27.5|25.1|22.5|20.0|17.5|15.0|12.5|10.0|7.5|5.0|2.5|0.1|-2.5|-5.0|-7.5|-10.0|-12.5|-15.0|-17.5|-20.0|-22.5|-25.0|-27.5|-30.0|
0.305|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|-851.269|
0.610|-1.039|4.399|-4.456|-0.432|7.550|-2.142|4.230|-10.225|0.601|1.489|6.004|1.924|-5.140|-15.024|-7.034|-7.416|-0.281|-0.825|3.995|11.211|-15.545|0.358|9.823|-4.172|7.086|-5.798|13.833|14.654|10.107|-0.463|-4.968|13.222|8.679|2.461|10.850|19.794|6.270|
0.916|-22.561|7.662|6.421|-13.359|14.054|-9.652|6.441|7.203|-20.005|-0.378|-5.472|-6.536|-0.318|-13.857|3.851|4.451|0.115|5.803|0.446|13.787|-3.669|11.315|5.026|8.534|-22.721|-3.642|18.056|14.084|11.784|8.936|10.293|6.169|11.458|10.236|12.826|10.999|20.883|

因为数据比较多，一个一个转换效率太低，谢谢了！

 
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
void main(void)
{
    int i,j,m,n;
    int a[100][100],b[100][100];
    srand((unsigned)time(0));
    printf("请输入m和n：\n");
    scanf("%d%d",&m,&n);
    for(i=0;i<m;i++)
    {    
          for(j=0;j<n;j++)
          {
              a[i][j]=rand();
              printf("%6d",a[i][j]);
          }
          printf("\n");
    }
    printf("\n");
    for(i=0;i<m;i++)
        for(j=0;j<n;j++)
            b[j][i]=a[i][j];
    for(i=0;i<n;i++)
    {
        for(j=0;j<m;j++)
            printf("%6d",b[i][j]);
        printf("\n");
    }
    system("pause");
}