0_0_19225497_28079.cpp:13:14: error: unable to find numeric literal operator 'operator""bool'
#define maxn 31bool mat[maxn][maxn][maxn];
^
0_0_19225497_28079.cpp:15:171: note: in expansion of macro 'maxn'
const point q) { return x == q.x && y == q.y && z == q.z && rot == q.rot && dir == q.dir; }}ST,EN;int n;char opt[10] = {0,'F','L','R','U','D','B'};point pre[maxn][maxn][maxn][7][7];short step[maxn][maxn][maxn][7][7];int dis[maxn][maxn][maxn][7][7];int LEFT[7][7] = { 0,0,0,0,0,0,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0};int RIGHT[7][7] = { 0,0,0,0,0,0,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0};int dx[7] = {0,1,0,0,-1,0,0};int dy[7] = {0,0,1,0,0,-1,0};int dz[7] = {0,0,0,1,0,0,-1};int back[7] = { 0,4,5,6,1,2,3 };char record[maxn * maxn * maxn * 10 * 10];bool check(point p){
^
0_0_19225497_28079.cpp:13:14: note: use -std=gnu++11 or -fext-numeric-literals to enable more built-in suffixes
#define maxn 31bool mat[maxn][maxn][maxn];
^
0_0_19225497_28079.cpp:15:171: note: in expansion of macro 'maxn'
const point q) { return x == q.x && y == q.y && z == q.z && rot == q.rot && dir == q.dir; }}ST,EN;int n;char opt[10] = {0,'F','L','R','U','D','B'};point pre[maxn][maxn][maxn][7][7];short step[maxn][maxn][maxn][7][7];int dis[maxn][maxn][maxn][7][7];int LEFT[7][7] = { 0,0,0,0,0,0,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0};int RIGHT[7][7] = { 0,0,0,0,0,0,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0};int dx[7] = {0,1,0,0,-1,0,0};int dy[7] = {0,0,1,0,0,-1,0};int dz[7] = {0,0,0,1,0,0,-1};int back[7] = { 0,4,5,6,1,2,3 };char record[maxn * maxn * maxn * 10 * 10];bool check(point p){
^
0_0_19225497_28079.cpp:13:21: error: expected ']' before 'mat'
#define maxn 31bool mat[maxn][maxn][maxn];
^
0_0_19225497_28079.cpp:15:171: note: in expansion of macro 'maxn'
const point q) { return x == q.x && y == q.y && z == q.z && rot == q.rot && dir == q.dir; }}ST,EN;int n;char opt[10] = {0,'F','L','R','U','D','B'};point pre[maxn][maxn][maxn][7][7];short step[maxn][maxn][maxn][7][7];int dis[maxn][maxn][maxn][7][7];int LEFT[7][7] = { 0,0,0,0,0,0,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0};int RIGHT[7][7] = { 0,0,0,0,0,0,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0};int dx[7] = {0,1,0,0,-1,0,0};int dy[7] = {0,0,1,0,0,-1,0};int dz[7] = {0,0,0,1,0,0,-1};int back[7] = { 0,4,5,6,1,2,3 };char record[maxn * maxn * maxn * 10 * 10];bool check(point p){
^
0_0_19225497_28079.cpp:15:175: error: expected unqualified-id before ']' token
const point q) { return x == q.x && y == q.y && z == q.z && rot == q.rot && dir == q.dir; }}ST,EN;int n;char opt[10] = {0,'F','L','R','U','D','B'};point pre[maxn][maxn][maxn][7][7];short step[maxn][maxn][maxn][7][7];int dis[maxn][maxn][maxn][7][7];int LEFT[7][7] = { 0,0,0,0,0,0,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0};int RIGHT[7][7] = { 0,0,0,0,0,0,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0};int dx[7] = {0,1,0,0,-1,0,0};int dy[7] = {0,0,1,0,0,-1,0};int dz[7] = {0,0,0,1,0,0,-1};int back[7] = { 0,4,5,6,1,2,3 };char record[maxn * maxn * maxn * 10 * 10];bool check(point p){
^
0_0_19225497_28079.cpp:15:181: error: expected unqualified-id before ']' token
const point q) { return x == q.x && y == q.y && z == q.z && rot == q.rot && dir == q.dir; }}ST,EN;int n;char opt[10] = {0,'F','L','R','U','D','B'};point pre[maxn][maxn][maxn][7][7];short step[maxn][maxn][maxn][7][7];int dis[maxn][maxn][maxn][7][7];int LEFT[7][7] = { 0,0,0,0,0,0,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0};int RIGHT[7][7] = { 0,0,0,0,0,0,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0};int dx[7] = {0,1,0,0,-1,0,0};int dy[7] = {0,0,1,0,0,-1,0};int dz[7] = {0,0,0,1,0,0,-1};int back[7] = { 0,4,5,6,1,2,3 };char record[maxn * maxn * maxn * 10 * 10];bool check(point p){
^
0_0_19225497_28079.cpp:15:187: error: expected unqualified-id before ']' token
const point q) { return x == q.x && y == q.y && z == q.z && rot == q.rot && dir == q.dir; }}ST,EN;int n;char opt[10] = {0,'F','L','R','U','D','B'};point pre[maxn][maxn][maxn][7][7];short step[maxn][maxn][maxn][7][7];int dis[maxn][maxn][maxn][7][7];int LEFT[7][7] = { 0,0,0,0,0,0,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0};int RIGHT[7][7] = { 0,0,0,0,0,0,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0};int dx[7] = {0,1,0,0,-1,0,0};int dy[7] = {0,0,1,0,0,-1,0};int dz[7] = {0,0,0,1,0,0,-1};int back[7] = { 0,4,5,6,1,2,3 };char record[maxn * maxn * maxn * 10 * 10];bool check(point p){
^
0_0_19225497_28079.cpp:13:14: error: unable to find numeric literal operator 'operator""bool'
#define maxn 31bool mat[maxn][maxn][maxn];
^
0_0_19225497_28079.cpp:15:206: note: in expansion of macro 'maxn'
const point q) { return x == q.x && y == q.y && z == q.z && rot == q.rot && dir == q.dir; }}ST,EN;int n;char opt[10] = {0,'F','L','R','U','D','B'};point pre[maxn][maxn][maxn][7][7];short step[maxn][maxn][maxn][7][7];int dis[maxn][maxn][maxn][7][7];int LEFT[7][7] = { 0,0,0,0,0,0,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0};int RIGHT[7][7] = { 0,0,0,0,0,0,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0};int dx[7] = {0,1,0,0,-1,0,0};int dy[7] = {0,0,1,0,0,-1,0};int dz[7] = {0,0,0,1,0,0,-1};int back[7] = { 0,4,5,6,1,2,3 };char record[maxn * maxn * maxn * 10 * 10];bool check(point p){
^
0_0_19225497_28079.cpp:13:14: note: use -std=gnu++11 or -fext-numeric-literals to enable more built-in suffixes
#define maxn 31bool mat[maxn][maxn][maxn];
^
0_0_19225497_28079.cpp:15:206: note: in expansion of macro 'maxn'
const point q) { return x == q.x && y == q.y && z == q.z && rot == q.rot && dir == q.dir; }}ST,EN;int n;char opt[10] = {0,'F','L','R','U','D','B'};point pre[maxn][maxn][maxn][7][7];short step[maxn][maxn][maxn][7][7];int dis[maxn][maxn][maxn][7][7];int LEFT[7][7] = { 0,0,0,0,0,0,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0};int RIGHT[7][7] = { 0,0,0,0,0,0,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0};int dx[7] = {0,1,0,0,-1,0,0};int dy[7] = {0,0,1,0,0,-1,0};int dz[7] = {0,0,0,1,0,0,-1};int back[7] = { 0,4,5,6,1,2,3 };char record[maxn * maxn * maxn * 10 * 10];bool check(point p){
^
0_0_19225497_28079.cpp:13:21: error: expected ']' before 'mat'
#define maxn 31bool mat[maxn][maxn][maxn];
^
0_0_19225497_28079.cpp:15:206: note: in expansion of macro 'maxn'
const point q) { return x == q.x && y == q.y && z == q.z && rot == q.rot && dir == q.dir; }}ST,EN;int n;char opt[10] = {0,'F','L','R','U','D','B'};point pre[maxn][maxn][maxn][7][7];short step[maxn][maxn][maxn][7][7];int dis[maxn][maxn][maxn][7][7];int LEFT[7][7] = { 0,0,0,0,0,0,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0};int RIGHT[7][7] = { 0,0,0,0,0,0,0, 0,0,6,2,0,3,5, 0,3,0,4,6,0,1, 0,5,1,0,2,4,0, 0,0,3,5,0,6,2, 0,6,0,1,3,0,4, 0,2,4,0,5,1,0};int dx[7] = {0,1,0,0,-1,0,0};int dy[7] = {0,0,1,0,0,-1,0};int dz[7] = {0,0,0,1,0,0,-1};int back[7] = { 0,4,5,6,1,2,3 };char record[maxn * maxn * maxn * 10 * 10];bool check(point p){
^
0_0_19225497_28079.cpp:15:210: error: expected unqualified-id before ']' token
const point q) { return x == q.x && y == q.y && z == q.z && rot == q.rot && dir == q.dir
|
