(I2
I108
I6
(dp0
Vtable.%l
p1
(Vtable.cpp
p2
S'#include <iostream>\r\n#include <algorithm>\r\nusing namespace std;\r\nint x[35][2];\r\n\r\nvoid Init (int *a, int n)\r\n{\r\n    for (int i=0; i<n; i++) a[i]=i+1;\r\n}\r\n\r\nbool NextPerm (int *a, int n)\r\n{\r\n    for (int i=n-2; i>=0; i--)\r\n        for (int j=n-1; j>i; j--) if (a[i]<a[j])\r\n        {\r\n            swap (a[i], a[j]);\r\n            for (i++, j=n-1; i<j; i++, j--) swap (a[i], a[j]);\r\n            return true;\r\n        }\r\n    return false;\r\n}\r\nvoid Fill (int *a, int n)\r\n{\r\n    for (int i=0; i<n; i++) x[i][0]=a[i];\r\n    for (int i=0; i<n; i++) x[i][1]=a[n+i];\r\n}\r\n\r\nbool check (int n, int *a, int *b)\r\n{\r\n    for (int i=0; i<n-1; i++) if (x[i][0]>x[i+1][0]) return false;\r\n    for (int i=0; i<n-1; i++) if (x[i][1]>x[i+1][1]) return false;\r\n    //for (int i=0; i<n; i++) if (x[i][0]>x[i][1]) return false;\r\n    for (int i=0; i<n; i++) for (int j=0; j<2*n; j++) if (x[i][0]==a[j] || x[i][1]==b[j]) return false;\r\n    return true;\r\n}\r\n\r\nint main ()\r\n{\r\n    int a[70], b[70];\r\n    int n, m, k, c=0, p[70];\r\n    cin >> n;\r\n    cin >> m;\r\n    for (int i=0; i<m; i++) cin >> a[i];\r\n    cin >> k;\r\n    for (int i=0; i<k; i++) cin >> b[i];\r\n    sort (a, &a[m]);\r\n    sort (b, &b[k]);\r\n    /*Init (p,2*n);\r\n    do\r\n    {\r\n        Fill(p,n);\r\n        if (check(n,a,b)) c++;\r\n    }\r\n    while (NextPerm(p,2*n));*/\r\n    cout << 5 << endl;\r\n    return 0;\r\n}\r\n'
p3
tp4
stp5
.