(I2
I156
I6
(dp0
Vtable.%l
p1
(Vtable.cpp
p2
S'#include<iostream>\r\n#include<algorithm>\r\n#include<cstring>\r\nusing namespace std;\r\nint a[75],b[75],n,m,k,nr,p,c[75],v[200],f[100],maxim;\r\nunsigned long long sol;\r\nint cond(int k ){\r\n    for( int i = 1; i < k; i++ ){\r\n        if( v[i] == v[k] )\r\n            return 0;\r\n    }\r\n    return 1;\r\n}\r\nint verif(int poz){\r\n    memset(f,0,sizeof(f));\r\n    for( int i = 1; i <= poz; i++){\r\n        f[v[i]] = 1;\r\n    }\r\n    for( int i = 1 ; i <= m ; i++){\r\n        if( f[a[i]] == 0 )\r\n            return 0;\r\n    }\r\n    for( int i = 1 ; i <= k; i++ ){\r\n        if( f[b[i]] == 1 )\r\n            return 0;\r\n    }\r\n    return 1;\r\n}\r\nvoid comb(int k){\r\n    if( k == n/2 + 1 ){\r\n        sol += verif(k);\r\n    }else{\r\n        for(int i = v[k-1] + 1; i <= n; i++ ){\r\n            v[k] = i;\r\n            if( cond(k) == 1 ){\r\n                comb(k+1);\r\n            }\r\n        }\r\n    }\r\n}\r\nint i;\r\nint main(){\r\n\r\n    cin >> n;\r\n    n *= 2;\r\n\r\n    nr = 0;\r\n\r\n    cin >> m;\r\n    for( i = 1; i <= m ; i++ ){\r\n        cin >> a[i];\r\n        f[a[i]] = 1;\r\n    }\r\n    sort(a+1,a+m+1);\r\n    cin >> k;\r\n    for( i = 1; i <= k ; i++ ){\r\n        cin >> b[i];\r\n        f[b[i]] = 1;\r\n    }\r\n    sort(b+1,b+k+1);\r\n    for( i = 1 ; i <= n ;i++){\r\n        if( f[i] == 0 )\r\n            c[++p] = i;\r\n    }\r\n    memset(f,0,sizeof(f));\r\n    if( b[1] == 1 ){\r\n        cout << 0;\r\n        return 0;\r\n    }\r\n    if( c[1] == 1 ){\r\n        m++;\r\n        for( i = m; i >= 2; i-- ){\r\n            a[i] = a[i-1];\r\n            f[a[i]] = 1;\r\n        }\r\n        a[1] = 1;\r\n        f[1] = 1;\r\n        for( i = 1 ; i < p ; i++ ){\r\n            c[i] = c[i + 1];\r\n            f[c[i]] = 1;\r\n        }\r\n        p--;\r\n    }\r\n    v[1] = 1;\r\n    comb(2);\r\n    cout << sol;\r\n    return 0;\r\n}\r\n'
p3
tp4
stp5
.