A1035.Cow Hopscotch Bronze--Bronze

普及-

USACO

通过率:0%

时间限制:1.00s

内存限制:128MB

题目描述

Just like humans enjoy playing the game of Hopscotch, Farmer John's cows have
invented a variant of the game for themselves to play. Being played by clumsy
animals weighing nearly a ton, Cow Hopscotch almost always ends in disaster,
but this has surprisingly not deterred the cows from attempting to play nearly
every afternoon.
The game is played on an R by C grid (2 <= R <= 15, 2 <= C <= 15), where each
square is colored either red or blue. Cows start in the top-left square and
move to the bottom-right square by a sequence of jumps, where a jump is valid
if and only if

  1. You are jumping to a square of a different color,
  2. The square that you are jumping to is at least one row below the current
    square that you are on, and
  3. The square that you are jumping to is at least one column to the right of
    the current square that you are on.
    Please help the cows compute the number of different possible sequences of
    valid jumps that will take them from the top-left square to the bottom-right
    square.

输入格式

The first line contains the two integers R and C. The next R lines will each
contain C characters. Each character is either 'R' or a 'B', indicating a red
square or a blue square.

输出格式

Output the number of different ways one can jump from the top-left square to
the bottom-right square.

输入输出样例

  • 输入#1

    4 4
    RRRR
    RRBR
    RBBR
    RRRR
    

    输出#1

    3
    
首页