Hugging Face's logo

Datasets:
slayone
/
uva_spoj_raw

Tasks:
Translation
Text Generation
Size:
1K<n<10K
Tags:
code
License:
Dataset card Files
xet
Community
uva_spoj_raw
File size: 2,358 Bytes 
c4b0eef
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
 
/*
  >>~~ UVa Online Judge ACM Problem Solution ~~<<

  ID: 10051
  Name: Tower of Cubes
  Problem: https://onlinejudge.org/external/100/10051.pdf
  Language: C++

  Author: Arash Shakery
  Email: arash.shakery@gmail.com
*/

#include <bits/stdc++.h>
using namespace std;

inline int readchar() {
    const int N = 4194304;
    static char buf[N];
    static char *p = buf, *end = buf;
    bool fin = 0;
    if (fin) return EOF;
    if (p == end) {
        if ((end = buf + fread(buf, 1, N, stdin)) == buf) {
            fin = 1;
            return EOF;
        }
        p = buf;
    }
    return *p++;
}

inline bool isdigit(char ch) { return ch>='0' && ch<='9'; }
inline int readUInt() {
    char ch;
    unsigned int r=0;
    while (!isdigit(ch=readchar()))
        if (ch == EOF) return EOF;
    r = ch-'0';
    while (isdigit(ch=readchar()))
        r = (r<<3) + (r<<1) + ch-'0';

    while (ch!=' ' && ch!='\n')
        ch = readchar();
    return r;
}

// --------------------------------------------------------------------

char fnames[6][10] = {
    "front", "back",
    "left", "right",
    "top", "bottom"
};

int C[555][6], D[555][6], n;
struct State {
    int i, j;
    State():i(0),j(0){}
    State(int i, int j):i(i),j(j){}
} P[555][6];


char BUF[1000000];
int main() {
    cout.rdbuf()->pubsetbuf(BUF, 1000000);
    ios_base::sync_with_stdio(0);cin.tie(0);

    for (int cse=1; (n=readUInt()); ++cse) {
        for (int i=0; i<n; ++i)
            for (int j=0; j<6; ++j)
                C[i][j] = readUInt();

        int bestd=0;
        State best;
        for (int i=n-1; i>=0; --i)
            for (int c=0; c<6; ++c) {
                int bc = C[i][c^1];

                D[i][c] = 1;
                for (int j=i+1; j<n; ++j)
                    for (int k=0; k<6; ++k)
                        if (C[j][k] == bc && D[j][k]+1>D[i][c])
                            D[i][c] = D[j][k]+1,
                            P[i][c] = State(j, k);

                if (D[i][c] > bestd) {
                    bestd = D[i][c];
                    best = State(i, c);
                }
            }

        if (cse > 1) cout << "\n";
        cout << "Case #" << cse << "\n" << bestd << "\n";
        for (int i=0; i<bestd; ++i) {
            cout << best.i+1 << ' ' << fnames[best.j] << "\n";
            best = P[best.i][best.j];
        }
    }
}