A. Mental Rotation

https://codeforc.es/gym/102219/problem/A

思路：模拟；

#include<algorithm>
#include<set>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x;
        x=x*x;
        n>>=1;
    }
    return ans;
}

string s[1009];
char ch(char s,int k)
{
    if(k==1)
    {
        if(s=='>') return 'v';
        else if(s=='<') return '^';
        else if(s=='^') return '>';
        else if(s=='v') return '<';
        else return s;
    }
    else if(k==2)
    {
        if(s=='>') return '<';
        else if(s=='<') return '>';
        else if(s=='^') return 'v';
        else if(s=='v') return '^';
        else return s;
    }
    else if(k==3)
    {
        if(s=='>') return '^';
        else if(s=='<') return 'v';
        else if(s=='^') return '<';
        else if(s=='v') return '>';
        else return s;
    }
}

int main()
{
    //FAST_IO;

    int n;
    string op;
    cin>>n>>op;
    int k=0;
    for(int i=0;i<n;i++) cin>>s[i];

    int len=op.length();
    for(int i=0;i<len;i++)
    {
        if(op[i]=='R') k++;
        else k--;
    }

    k=(k%4+4)%4;

    if(k==0)
    {
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                cout<<s[i][j];
            }
            cout<<endl;
        }
    }
    else if(k==1)
    {
        for(int i=0;i<n;i++)
        {
            for(int j=n-1;j>=0;j--)
            {
                cout<<ch(s[j][i],k);
            }
            cout<<endl;
        }
    }
    else if(k==2)
    {
        for(int i=n-1;i>=0;i--)
        {
            for(int j=n-1;j>=0;j--)
            {
                cout<<ch(s[i][j],k);
            }
            cout<<endl;
        }
    }
    else
    {
        for(int i=n-1;i>=0;i--)
        {
            for(int j=0;j<n;j++)
            {
                cout<<ch(s[j][i],k);
            }
            cout<<endl;
        }
    }
    return 0;
}