uva-1594 - Ducci Sequence c++, stl练习，map

最新推荐文章于 2020-10-12 21:47:37 发布

qq_27295525

最新推荐文章于 2020-10-12 21:47:37 发布

阅读量534

点赞数

本文链接：https://blog.csdn.net/qq_27295525/article/details/45176545

版权

题目点我

1594 - Ducci Sequence

Time limit: 3.000 seconds

A Ducci sequence is a sequence of n-tuples of integers. Given an n-tuple of integers (a₁, a₂,^..., a_n), the next n-tuple in the sequence is formed by taking the absolute differences of neighboring integers:

( a ₁, a ₂, ^..., a _n) $\displaystyle \rightarrow$ (| a ₁ - a ₂|,| a ₂ - a ₃|, ^...,| a _n - a ₁|)

Ducci sequences either reach a tuple of zeros or fall into a periodic loop. For example, the 4-tuple sequence starting with 8,11,2,7 takes 5 steps to reach the zeros tuple:

(8, 11, 2, 7) $\displaystyle \rightarrow$ (3, 9, 5, 1) $\displaystyle \rightarrow$ (6, 4, 4, 2) $\displaystyle \rightarrow$ (2, 0, 2, 4) $\displaystyle \rightarrow$ (2, 2, 2, 2) $\displaystyle \rightarrow$ (0, 0, 0, 0).

The 5-tuple sequence starting with 4,2,0,2,0 enters a loop after 2 steps:

(4, 2, 0, 2, 0) $\displaystyle \rightarrow$ (2, 2, 2, 2, 4) $\displaystyle \rightarrow$ ( 0, 0, 0, 2, 2) $\displaystyle \rightarrow$ (0, 0, 2, 0, 2) $\displaystyle \rightarrow$ (0, 2, 2, 2, 2) $\displaystyle \rightarrow$ (2, 0, 0, 0, 2) $\displaystyle \rightarrow$

(2, 0, 0, 2, 0) $\displaystyle \rightarrow$ (2, 0, 2, 2, 2) $\displaystyle \rightarrow$ (2, 2, 0, 0, 0) $\displaystyle \rightarrow$ (0, 2, 0, 0, 2) $\displaystyle \rightarrow$ (2, 2, 0, 2, 2) $\displaystyle \rightarrow$ (0, 2, 2, 0, 0) $\displaystyle \rightarrow$

(2, 0, 2, 0, 0) $\displaystyle \rightarrow$ (2, 2, 2, 0, 2) $\displaystyle \rightarrow$ (0, 0, 2, 2, 0) $\displaystyle \rightarrow$ (0, 2, 0, 2, 0) $\displaystyle \rightarrow$ (2, 2, 2, 2, 0) $\displaystyle \rightarrow$ ( 0, 0, 0, 2, 2) $\displaystyle \rightarrow$ ^...

Given an n-tuple of integers, write a program to decide if the sequence is reaching to a zeros tuple or a periodic loop.

Input

Your program is to read the input from standard input. The input consists of T test cases. The number of test cases T is given in the first line of the input. Each test case starts with a line containing an integer n (3 $\le$ n $\le$ 15), which represents the size of a tuple in the Ducci sequences. In the following line, n integers are given which represents the n-tuple of integers. The range of integers are from 0 to 1,000. You may assume that the maximum number of steps of a Ducci sequence reaching zeros tuple or making a loop does not exceed 1,000.

Output

Your program is to write to standard output. Print exactly one line for each test case. Print `LOOP' if the Ducci sequence falls into a periodic loop, print `ZERO' if the Ducci sequence reaches to a zeros tuple.

The following shows sample input and output for four test cases.

Sample Input

4 
4 
8 11 2 7 
5 
4 2 0 2 0 
7 
0 0 0 0 0 0 0 
6 
1 2 3 1 2 3

Sample Output

ZERO 
LOOP 
ZERO

LOOP

LOOP

qq_27295525

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
uva-1594 - Ducci Sequence c++, stl练习，map

题目点我1594 - Ducci SequenceTime limit: 3.000 seconds A Ducci sequence is a sequence of n-tuples of integers. Given ann-tuple of integers (a1,a2, ..., an), the nextn-tuple in the sequence i
复制链接

扫一扫