UVA 1594 Ducci Sequence

最新推荐文章于 2020-11-30 19:47:29 发布

Veropatrinica

最新推荐文章于 2020-11-30 19:47:29 发布

阅读量173

点赞数

分类专栏： OJ 文章标签：算法竞赛入门经典 UVa STL 算法

本文链接：https://blog.csdn.net/shanwenkang/article/details/79610476

版权

OJ 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

Description

A Ducci sequence is a sequence of n-tuples of integers. Given an n-tuple of integers (a1; a2; · · · ; an),the next n-tuple in the sequence is formed by taking the absolute differences of neighboring integers: (a1; a2; · · · ; an) ->(|a1 - a2|; |a2 - a3|; · · · ;|an - a1|) 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) -> (3; 9; 5; 1) -> (6; 4; 4; 2) -> (2; 0; 2; 4) -> (2; 2; 2; 2) -> (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) ->(2; 2; 2; 2; 4) -> (0,0,0,2,2) -> (0; 0; 2; 0; 2) -> (0; 2; 2; 2; 2) -> (2; 0; 0; 0; 2) ->(2; 0; 0; 2; 0) -> (2; 0; 2; 2; 2) -> (2; 2; 0; 0; 0) -> (0; 2; 0; 0; 2) -> (2; 2; 0; 2; 2) -> (0; 2; 2; 0; 0) ->(2; 0; 2; 0; 0) -> (2; 2; 2; 0; 2) -> (0; 0; 2; 2; 0) -> (0; 2; 0; 2; 0) -> (2; 2; 2; 2; 0) -> (0,0,0,2,2) -> · · · 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 ≤ n ≤ 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.

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

解题思路：将产生的序列以string的形式作为key保存在map中，map的value是序列出现的次数。首先判断序列是否变为全0，若是则输出ZERO；若否，则继续判断：如果序列出现次数大于1，则判断序列循环了，输出LOOP

#include<iostream>  
#include<cstdio>  
#include<stack>  
#include<string>
#include<vector>
#include<sstream>
#include<math.h>
#include<map>
using namespace std;

int main() {

	int m, n;
	int a, b;
	string h;
	char c;

	vector<int> number;
	map<string, int> s;

	while (scanf("%d", &m) != EOF)
	{
		for (int i = 0; i < m; i++)
		{
			number.clear();
			s.clear();
			scanf("%d", &n);

			for (int i = 0; i < n; i++)
			{
				scanf("%d", &a);
				number.push_back(a);
				c = a + '0';
				h += c;
			}
			s[h] = 1;
			for (int i = 0; i < 1000; i++)
			{
				string h1;
				string h2;
				b = number[0];
				for (int j = 0; j < number.size() - 1; j++)
				{
					number[j] = abs(number[j] - number[j + 1]);
					c = number[j] + '0';
					h1 += c;
					h2 += '0';
				}

				number[number.size() - 1] = abs(number[number.size() - 1] - b);
				c = number[number.size() - 1] + '0';
				h1 += c;
				h2 += '0';
				if (!s.count(h1))
				{
					s[h1] = 0;
				}
				s[h1]++;
				if (s[h2])
				{
					printf("ZERO\n");
					break;
				}
				if (s[h1]==2)
				{
					printf("LOOP\n");
					break;
				}
			}
		}
	}

	return 0;
}