模拟 Coder-Strike 2014 - Round 1 A. Poster

 /*
模拟：题目没看懂，但操作很简单，从最近的一头(如果不在一端要先移动到一端)往另一头移动，顺便打印内容
*/
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <map>
using namespace std;

const int MAXN = 100 + 10;
const int INF = 0x3f3f3f3f;
char s[MAXN];

int main(void)        //Coder-Strike 2014 - Round 1 A. Poster
{
//freopen ("E.in", "r", stdin);

int n, k;
while (~scanf ("%d%d", &n, &k))
{
scanf ("%s", &s);
int pos;    int flag;

if (k <= (n) / 2)
{
pos = k - 1;    flag = 0;
}
else
{
pos = n - k;    flag = 1;
}

while (pos--)    (flag) ? puts ("RIGHT") : puts ("LEFT");

if (flag == 1)
{
for (int i=n-1; i>=0; --i)
{
printf ("PRINT ");
printf ("%c\n", s[i]);
if (i > 0)    puts ("LEFT");
}
}
else
{
for (int i=0; i<n; ++i)
{
printf ("PRINT ");
printf ("%c\n", s[i]);
if (i < n - 1)    puts ("RIGHT");
}
}
}

return 0;
}