(I2
I119
I6
(dp0
Vtable.%l
p1
(Vtable3.cpp
p2
S'#include <cstdio>\r\n#include <algorithm>\r\nusing namespace std;\r\n\r\nint n, bra, brb, brc=0, ans=0;\r\nint A[72], B[72], C[72], Row1[72], Row2[72], Row[3][72];\r\nbool used[72], fl, okey;\r\n\r\nvoid Fill(int idx1, int idx2)\r\n{\r\n    if(idx1==1 && idx2==n-1)\r\n    {\r\n        for(int i=0;i<n;++i)\r\n        {\r\n            Row1[i]=Row[0][i];\r\n            Row2[i]=Row[1][i];\r\n        }\r\n        sort(Row1, Row1+n);\r\n        sort(Row2, Row2+n);\r\n        fl=true;\r\n        for(int i=0;i<n;++i)\r\n        {\r\n            if(Row1[i]>Row2[i])\r\n            {\r\n                fl=false;\r\n                break;\r\n            }\r\n        }\r\n        if(fl)\r\n        {\r\n            ans++;\r\n        }\r\n        return;\r\n    }\r\n    for(int i=idx2;i<n;++i)\r\n    {\r\n        for(int j=0;j<brc;++j)\r\n        {\r\n            okey=true;\r\n            if(!used[C[j]])\r\n            {\r\n                okey=false;\r\n                used[C[j]]=1;\r\n                Row[idx1][i]=C[j];\r\n                Fill(idx1, i);\r\n                used[C[j]]=0;\r\n                Row[idx1][i]=0;\r\n            }\r\n            if(okey && idx1==0)\r\n            {\r\n                Fill(1, n-(n-brb));\r\n            }\r\n        }\r\n    }\r\n}\r\n\r\nint main ()\r\n{\r\n    scanf("%d", &n);\r\n    scanf("%d", &bra);\r\n    for(int i=0;i<bra;++i)\r\n    {\r\n        scanf("%d", &A[i]);\r\n        Row[0][i]=A[i];\r\n        used[A[i]]=1;\r\n    }\r\n    scanf("%d", &brb);\r\n    for(int i=0;i<brb;++i)\r\n    {\r\n        scanf("%d", &B[i]);\r\n        Row[1][i]=B[i];\r\n        used[B[i]]=1;\r\n    }\r\n    for(int i=1;i<=2*n;++i)\r\n    {\r\n        if(!used[i])\r\n        {\r\n            C[brc++]=i;\r\n        }\r\n        used[i]=0;\r\n    }\r\n    Fill(0, n-(n-bra));\r\n    printf("%d\\n", ans%10);\r\n    return 0;\r\n}\r\n\r\n'
p3
tp4
stp5
.