南华大学暑假个人练习 1015: Little Sheep and a paper

6个石头

于 2013-07-19 10:39:08 发布

阅读量1k

点赞数

本文链接：https://blog.csdn.net/lcl_graceboy/article/details/9377301

版权

1015: Little Sheep and a paper

Time Limit: 2 Sec Memory Limit: 128 MB
Submit: 67 Solved: 24
[ Submit][ Status][ Web Board]

Description

One day, Little Sheep gets an AK(all kill) in a contest, so he is very boring, then he just plays with a

paper. The paper has two faces called A and B. Sheep finds the paper can be folded for infinity times,

and now Sheep thinks the paper is interesting, so he tries to fold the paper in half for many times. He

finds out he has four way to make the paper folded in half, there are listed below:

At first, Little Sheep keeps the face A of the paper faced to him,and he fold the paper for many times.

In the end, Sheep opens up the paper, and keeps the face A faced to him again. Now the question is :

How many creases on the face A of the paper are protruding? God sheep solves the question without 2

seconds. Can you? You should make your answer mod 100000009.

Input

The first line of input contains a single positive integer N , which means the number of test cases.

The following N lines gives N non-empty strings containing only characters in ”UDLR”, which is the

sequences of the actions of the Sheep to fold paper. The length of the each string is a positive number

less than 10^6.

Output

For each case output the answer mod 100000009 in a line.

Sample Input

DLUR

ULULL

Sample Output

按照题目的意思是要我们求这张纸折叠后凸起的折痕。

在这里我们可以分步来做，先只折叠一个方向向左或者向右（另一种方向：向上或向下），定义a表示向左或者向右折叠是的凸痕，b表示向上或向下折叠时的凸痕，则有规律，如果保持b=0，则a=0 ，1，3，7....如果向上或者向下折叠了，则a当前的值要乘2。

下面是我的代码：

#include<iostream>
#include<cstring>
using namespace std;

const int MOD=100000009;
char str[1000005];
int main(void)
{
    int N;
    cin>>N;
    while(N--)
    {

        int len;
        int i,j;
        int a=0,b=0,temp=1;
        memset(str, 0, sizeof(str));
        cin>>str;
        len=strlen(str);
        for(i=0; i<len; i++)
        {
            if(str[i]=='L'||str[i]=='R')
            {
                a=(a+temp/2)%MOD;
                b=(b*2)%MOD;
            }
            else if(str[i]=='D'||str[i]=='U')
            {
                b=(b+temp/2)%MOD;
                a=(a*2)%MOD;
            }
            temp*=2;
            temp%=(2*MOD);
        }
        cout<<(a+b)%MOD<<endl;
    }
    return 0;
}