首页 > ACM题库 > HDU-杭电 > hdu 4695 Jumping Frog待解决[解题报告]C++
2015
09-17

hdu 4695 Jumping Frog待解决[解题报告]C++

Jumping Frog

问题描述 :


Teacher! Are we gonna have Cirno as a snack?
Even though Cirno, the circle-nine, looks really tasty,
I have to control myself and now eat Kanako's rice gruel instead.
I'll eat her after she gets fatter!
I'm aiming for the top of the food chain,
So today I'm training again,
Frog-leaping up the shrine stairs~!
-- Moriya Suwako Kero ⑨ Destiny

Moriya Suwako is training by frog-leaping up and down the shrine stairs. The staircase consists of N steps. On the way up, Suwako can take any of some specified steps at a time. On the way down, she can take any of some other specified steps at a time, and she can only walk on the steps she used on the way up. How many different paths are available for her training?

Important Sisters

输入:

There are multiple test cases. Process to the End of File.
Each test case contains three lines of integers as follows:
N
U A1 A2 … AU
D B1 B2 … BD
N is the total number of steps. Ai is the number of steps that can be taken on the way up, all Ais are different. Bi is the number of steps that can be taken on the way down, all Bis are different.

1 ≤ N ≤ 1018
1 ≤ U, D ≤ 50
1 ≤ Ai, Bi ≤ 200

输出:

There are multiple test cases. Process to the End of File.
Each test case contains three lines of integers as follows:
N
U A1 A2 … AU
D B1 B2 … BD
N is the total number of steps. Ai is the number of steps that can be taken on the way up, all Ais are different. Bi is the number of steps that can be taken on the way down, all Bis are different.

1 ≤ N ≤ 1018
1 ≤ U, D ≤ 50
1 ≤ Ai, Bi ≤ 200

样例输入:

3
2 1 2
4 1 2 3 4
5
2 1 2
4 1 2 3 4

样例输出:

8
52