UVa1594 Ducci Sequence (水题）

题目链接

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.

1.这题我想的是数组+map，LRJ写的是vector+set，不过怎样都无所谓，关键是这么水的题我WA了两次还没过（这就是一人刷题而无人探讨的苦恼，不过水题懒得浪费太多时间）

2.看了一篇博客，说数据很小，模拟判断数组是否都为0即可，循环只要200次就行了。删了map立刻AC

代码：

#include <iostream>
#include <algorithm>
#include <cstring>
#include <math.h>
#include <map>
using namespace std;
int a[20];
int main()
{
    int n,T;
    cin>>T;
    while(T--){
        cin>>n;
        for(int i=1;i<=n;i++){
            cin>>a[i];
        }
        int res=200;
        int flag=0;
        while(res--){
            int k=a[1],num=0;
            for(int i=1;i<=n;i++){
                if(i==n){
                    a[i]=abs(a[i]-k);
                }else{
                    a[i]=abs(a[i+1]-a[i]);
                }
                if(a[i]==0) num++;
            }
            if(num==n){
                flag=1;
                break;
            }
        }
        if(flag) cout<<"ZERO\n";
        else cout<<"LOOP\n";
    }

    return 0;
}

自己刚开始WA的代码：（放着以后看吧）

#include <iostream>
#include <algorithm>
#include <cstring>
#include <math.h>
#include <map>
using namespace std;
int a[20];
map<string,bool> mp;
int main()
{
    int n,T;
    cin>>T;
    while(T--){
        cin>>n;
        mp.clear();
        string dup="";
        for(int i=1;i<=n;i++){
            cin>>a[i];
            dup+=a[i]+'0';
        }
        mp[dup]=1;
        int res=1000;
        int flag=0;
        while(res--){
            int k=a[1],num=0;
            string s="";
            for(int i=1;i<=n;i++){
                if(i==n){
                    a[i]=abs(a[i]-k);
                    s+=a[i]+'0';
                }else{
                    a[i]=abs(a[i+1]-a[i]);
                    s+=a[i]+'0';
                }
                if(a[i]==0) num++;
            }
            if(num==n){
                flag=1;
                break;
            }
            //cout<<s<<endl;
            if(mp[s]==true) break;
            else mp[s]=1;
        }
        if(flag) cout<<"ZERO\n";
        else cout<<"LOOP\n";
    }

    return 0;
}