Codeforces Round #676 (Div. 2) C. Palindromifier（思维）

题目链接：https://codeforc.es/contest/1421/problem/C

Ringo found a string s of length n in his yellow submarine. The string contains only lowercase letters from the English alphabet. As Ringo and his friends love palindromes, he would like to turn the string s into a palindrome by applying two types of operations to the string.

The first operation allows him to choose i (2≤i≤n−1) and to append the substring s2s3…si (i−1 characters) reversed to the front of s.

The second operation allows him to choose i (2≤i≤n−1) and to append the substring sisi+1…sn−1 (n−i characters) reversed to the end of s.

Note that characters in the string in this problem are indexed from 1.

For example suppose s=abcdef. If he performs the first operation with i=3 then he appends cb to the front of s and the result will be cbabcdef. Performing the second operation on the resulted string with i=5 will yield cbabcdefedc.

Your task is to help Ringo make the entire string a palindrome by applying any of the two operations (in total) at most 30 times. The length of the resulting palindrome must not exceed 106

It is guaranteed that under these constraints there always is a solution. Also note you do not have to minimize neither the number of operations applied, nor the length of the resulting string, but they have to fit into the constraints.

Input
The only line contains the string S (3≤|s|≤105) of lowercase letters from the English alphabet.

Output
The first line should contain k (0≤k≤30) — the number of operations performed.

Each of the following k lines should describe an operation in form L i or R i. L represents the first operation, R represents the second operation, i represents the index chosen.

The length of the resulting palindrome must not exceed 106.

Examples

input

abac

output

2
R 2
R 5

input

acccc

output

2
L 4
L 2

input

hannah

output

0

Note
For the first example the following operations are performed:

abac → abacab → abacaba

The second sample performs the following operations: acccc → cccacccc → ccccacccc

The third example is already a palindrome so no operations are required.

题意

给出一个字符串 s ，你要通过以下操作将 s 变为一个回文串：
1、选择一个 x（1 < x < n），将 s2 ~ sx 的倒叙字符串放到 s 的最左边；
2、选择一个 x（1 < x < n），将 sx ~ sn-1 的倒叙字符串放到 s 的最右边；

分析

一开始发现如果 s1 和 s3 相同的话，必定可以构造出回文串：先 R 2，再 R (n * 2 - 3) 。同理，如果 sn 和 sn-2 相同的话也可以构造出。

后来发现如果先 L 2 ，就必定可以得到一个 s1 == s3 的字符串，这样就肯定能构造出回文串了。

代码

#include<bits/stdc++.h>
using namespace std;
 
int t;
char s[100007];
 
int main()
{
	scanf("%s",s+1);
	int len = strlen(s + 1);
	int a = 1, b = len;
	while(a < b)
	{
		if(s[a] != s[b]) break;
		a++;
		b--;
	}
	if(a >= b)
	{
		printf("0\n");
		return 0;
	}
	
	printf("3\n");
	printf("L 2\n");
	printf("R 2\n");
	printf("R %d\n", len * 2 - 1);
	return 0;
}