code strike round 1 A

来源：互联网发布：矩阵的几种分解介绍编辑：程序博客网时间：2024/06/04 00:57

A. Poster

此题很水，直接上代码

#include<stdio.h>#include<math.h>#include<string.h>char po[105];int main(){    int len,i,loc,n;    while(scanf("%d%d%s",&n,&loc,po)!=EOF)    {        len=strlen(po);        if(len%2==0)        {            if(loc>len/2+0.5)            {                for(i=loc;i<len;i++)                    printf("RIGHT\n");                for(i=len-1;i>0;i--)                {printf("PRINT %c\nLEFT\n",po[i]);}                printf("PRINT %c\n",po[i]);            }            else            {                for(i=loc-1;i>0;i--)                    printf("LEFT\n");                for(i=0;i<len-1;i++)                {printf("PRINT %c\nRIGHT\n",po[i]);}                printf("PRINT %c\n",po[i]);            }        }        else        {            if(loc>=len/2+1)            {                for(i=loc;i<len;i++)                    printf("RIGHT\n");                for(i=len-1;i>0;i--)                {printf("PRINT %c\nLEFT\n",po[i]);}                printf("PRINT %c\n",po[i]);            }            else            {                 for(i=loc-1;i>0;i--)                    printf("LEFT\n");                for(i=0;i<len-1;i++)                {printf("PRINT %c\nRIGHT\n",po[i]);}                printf("PRINT %c\n",po[i]);            }        }    }    return 0;}

0 0