循环列表的一个数据运用的问题，怎么使用C语言的程序的设计的办法去做这个问题的解答

Question

Problem Description
After the 32nd ACM/ICPC regional contest, Wiskey is beginning to prepare for CET-6. He has an English words table and read it every morning.
One day, Wiskey's chum wants to play a joke on him. He rolling the table, and tell Wiskey how many time he rotated. Rotate 90 degrees clockwise or count-clockwise each time.
The table has n*n grids. Your task is tell Wiskey the final status of the table.

Input
Each line will contain two number.
The first is postive integer n (0 < n <= 10).
The seconed is signed 32-bit integer m.
if m is postive, it represent rotate clockwise m times, else it represent rotate count-clockwise -m times.
Following n lines. Every line contain n characters.

Output
Output the n*n grids of the final status.

Sample Input
3 2
123
456
789
3 -1
123
456
789

Sample Output
987
654
321
369
258
147

Answer 1

以下回答参考 皆我百晓生、券券喵儿 等免费微信小程序相关内容作答，并由本人整理回复。

#include<stdio.h>
int main()
{
    int i,j,n,m;
    scanf("%d %d",&n,&m);
    char c[10][10];
    for(i=0;i<n;++i)
        scanf("%s",c[i]);
    for(j=n-1;j>=0;--j){
        for(i=0;i<n;++i){
            printf("%c",c[j][i]);
        }
        printf("\n");
    }
    return 0;
}