Blame for structured data/programming data/Haskell_programming/response_log.csv

submission_id,user_id,create_at,language,score,problem_set_problem_id,problem_id,skill_id,code,response,time_consume,memory_consume
1584472822780923904,9749edcb0c8720bf2196240c138862fede184ed225a575b6b33acd24fa1f6265,2022-10-24 17:12:13,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n#include<vector>\n#include<algorithm>\n\nvoid test()\n{\n\tvector<int> v;\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tv.push_back(i);\n\t}\n\tdo\n\t{\n\t\tfor (auto v : v)\n\t\t{\n\t\t\tcout << v << \"" \"";\n\t\t}\n\t\tcout << endl;\n\t} while (next_permutation(v.begin(), v.end()));\t\n}\n\nint main()\n{\n\ttest();\n\tsystem(\""pause\"");\n\treturn 0;\n}",PARTIAL_ACCEPTED,530,3408
1584474051011538944,9749edcb0c8720bf2196240c138862fede184ed225a575b6b33acd24fa1f6265,2022-10-24 17:17:06,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n#include<vector>\n#include<algorithm>\n\nvoid test()\n{\n\tvector<int> v;\n\tint n;\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tv.push_back(i);\n\t}\n\tdo\n\t{\n\t\tfor (auto v : v)\n\t\t{\n\t\t\tcout << v << \"" \"";\n\t\t}\n\t\tcout << endl;\n\t} while (next_permutation(v.begin(), v.end()));\t\n}\n\nint main()\n{\n\ttest();\n\treturn 0;\n}",PARTIAL_ACCEPTED,529,2860
1584518857817452544,9e1b98db80eab40d40c2583863c50e3b98015a3f0c8ff4f9f06606982563f690,2022-10-24 20:15:09,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\nusing namespace std;\nconst int N = 10010;\nint n, t;\nlong long x, y;\nint ans;\nint a[N];\nint mark[N];\nvoid dfs(int x)\n{\n\tif (x == n)\n\t{\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tcout << a[i] << \"" \"";\n\t\t}\n\t\tcout << endl;\n\t\treturn;\n\t}\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tif (mark[i] == 0)\n\t\t{\n\t\t\tmark[i] =1;\n\t\t\ta[x] = i;\n\t\t\tdfs(x + 1);\n\t\t\tmark[i] = 0;\n\t\t}\n\t}\n}\nint main()\n{\n\tcin >> n;\n\tdfs(0);\n}",PARTIAL_ACCEPTED,533,3124
1584520612152213504,9e1b98db80eab40d40c2583863c50e3b98015a3f0c8ff4f9f06606982563f690,2022-10-24 20:22:07,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\nusing namespace std;\nconst int N = 10010;\nint n, t;\nlong long x, y;\nint ans;\nint a[N];\nstring s;\nint main()\n{\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\ta[ans++] = i;\n\t}\n\tdo {\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tcout << a[i] << \"" \"";\n\t\t}\n\t\tcout << endl;\n\t} while (next_permutation(a, a+n));\n}",PARTIAL_ACCEPTED,545,3244
1584521301066649600,9e1b98db80eab40d40c2583863c50e3b98015a3f0c8ff4f9f06606982563f690,2022-10-24 20:24:51,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\nusing namespace std;\nconst int N = 10010;\nint n, t;\nlong long x, y;\nint ans;\nint a[N];\nint mark[N];\nvoid dfs(int x)\n{\n\tif (x == n)\n\t{\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tcout << a[i] << \"" \"";\n\t\t}\n\t\tcout << endl;\n\t\treturn;\n\t}\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tif (mark[i] == 0)\n\t\t{\n\t\t\tmark[i] = 1;\n\t\t\ta[x] = i;\n\t\t\tdfs(x + 1);\n\t\t\tmark[i] = 0;\n\t\t}\n\t}\n}\nint main()\n{\n\tcin >> n;\n\tdfs(0);\n}",PARTIAL_ACCEPTED,540,3192
1584537884400947200,ab4aa645c2afd3cedfd161269de383b30f97d1fa35548c3ad572694ce632d8b9,2022-10-24 21:30:45,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<vector>\nusing namespace std;\nvector<int>v;\nint flag[100];\nvoid print_vec(vector<int>v)\n{\n    for(int i=0;i<v.size();i++)\n    {\n        cout << v[i] << \"" \"";\n    }\n    cout << endl;\n}\nvoid dfs(int n,int index)\n{\n    if(index==n)\n    {\n        print_vec(v);\n        return;\n    }\n    for(int i=0;i<n;i++)\n    {\n        if(flag[i]==0)\n        {\n            v.push_back(i+1);\n            flag[i]=1;\n            dfs(n,index+1);\n            flag[i]=0;\n            v.pop_back();\n        }\n    }\n}\nint main()\n{\n    int n;\n    cin >> n;\n    dfs(n,0);\n    return 0;\n}",PARTIAL_ACCEPTED,539,3116
1584544322020048896,ab4aa645c2afd3cedfd161269de383b30f97d1fa35548c3ad572694ce632d8b9,2022-10-24 21:56:20,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<vector>\nusing namespace std;\n//vector<int>v;\nint flag[100];\nint T;\nint ans[20];\nvoid print_vec()\n{\n    /*for(int i=0;i<v.size();i++)\n    {\n        cout << v[i] << \"" \"";\n    }\n    cout << endl;*/\n    for(int i=0;i<T;i++)\n    {\n        cout << ans[i] << \"" \"";\n    }\n    cout << endl;\n}\nvoid dfs(int n,int index)\n{\n    if(index==n)\n    {\n        print_vec();\n        return;\n    }\n    for(int i=0;i<n;i++)\n    {\n        if(flag[i]==0)\n        {\n            //v.push_back(i+1);\n            flag[i]=1;\n            ans[index]=i+1;\n            dfs(n,index+1);\n            flag[i]=0;\n           // v.pop_back();\n        }\n    }\n}\nint main()\n{\n    int n;\n    \n    cin >> n;\n    T=n;\n    dfs(n,0);\n    return 0;\n}",PARTIAL_ACCEPTED,535,3284
1584547382968586240,ab4aa645c2afd3cedfd161269de383b30f97d1fa35548c3ad572694ce632d8b9,2022-10-24 22:08:30,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\n//vector<int>v;\nint flag[100];\nint T;\nint ans[20];\n// void print_vec()\n// {\n\n//     for(int i=0;i<T;i++)\n//     {\n//         cout << ans[i] << \"" \"";\n//     }\n//     cout << endl;\n// }\n// void dfs(int n,int index)\n// {\n//     if(index==n)\n//     {\n//         print_vec();\n//         return;\n//     }\n//     for(int i=0;i<n;i++)\n//     {\n//         if(flag[i]==0)\n//         {\n//             //v.push_back(i+1);\n//             flag[i]=1;\n//             ans[index]=i+1;\n//             dfs(n,index+1);\n//             flag[i]=0;\n//            // v.pop_back();\n//         }\n//     }\n// }\nint main()\n{\n    int n,num[999];\n    cin >> n;\n    T=n;\n    for(int i=0;i<T;i++)\n        num[i]=i+1;\n    do  \n    {  \n        for(int i=0;i<T;i++)\n        {\n            cout<<num[i]<<\"" \"";\n            \n        }\n        cout<<endl;\n    }while(next_permutation(num,num+T));  \n    //dfs(n,0);\n    return 0;\n}",PARTIAL_ACCEPTED,527,3400
1584547647377502208,ab4aa645c2afd3cedfd161269de383b30f97d1fa35548c3ad572694ce632d8b9,2022-10-24 22:09:33,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\n//vector<int>v;\nint flag[100];\nint T;\nint ans[20];\n// void print_vec()\n// {\n\n//     for(int i=0;i<T;i++)\n//     {\n//         cout << ans[i] << \"" \"";\n//     }\n//     cout << endl;\n// }\n// void dfs(int n,int index)\n// {\n//     if(index==n)\n//     {\n//         print_vec();\n//         return;\n//     }\n//     for(int i=0;i<n;i++)\n//     {\n//         if(flag[i]==0)\n//         {\n//             //v.push_back(i+1);\n//             flag[i]=1;\n//             ans[index]=i+1;\n//             dfs(n,index+1);\n//             flag[i]=0;\n//            // v.pop_back();\n//         }\n//     }\n// }\nint main()\n{\n    std::ios::sync_with_stdio(false);\n    int n,num[999];\n    cin >> n;\n    T=n;\n    for(int i=0;i<T;i++)\n        num[i]=i+1;\n    do  \n    {  \n        for(int i=0;i<T;i++)\n        {\n            cout<<num[i]<<\"" \"";\n            \n        }\n        cout<<endl;\n    }while(next_permutation(num,num+T));  \n    return 0;\n}",PARTIAL_ACCEPTED,526,3512
1584547923505319936,ab4aa645c2afd3cedfd161269de383b30f97d1fa35548c3ad572694ce632d8b9,2022-10-24 22:10:39,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\n//vector<int>v;\nint flag[100];\nint T;\nint ans[20];\n// void print_vec()\n// {\n\n//     for(int i=0;i<T;i++)\n//     {\n//         cout << ans[i] << \"" \"";\n//     }\n//     cout << endl;\n// }\n// void dfs(int n,int index)\n// {\n//     if(index==n)\n//     {\n//         print_vec();\n//         return;\n//     }\n//     for(int i=0;i<n;i++)\n//     {\n//         if(flag[i]==0)\n//         {\n//             //v.push_back(i+1);\n//             flag[i]=1;\n//             ans[index]=i+1;\n//             dfs(n,index+1);\n//             flag[i]=0;\n//            // v.pop_back();\n//         }\n//     }\n// }\nint main()\n{\n    std::ios_base::sync_with_stdio(false);\n    int n,num[999];\n    cin >> n;\n    T=n;\n    for(int i=0;i<T;i++)\n        num[i]=i+1;\n    do  \n    {  \n        for(int i=0;i<T;i++)\n        {\n            cout<<num[i]<<\"" \"";\n            \n        }\n        cout<<\""\\n\"";\n    }while(next_permutation(num,num+T));  \n    return 0;\n}",ACCEPTED,225,7252
1584548158642196480,ab4aa645c2afd3cedfd161269de383b30f97d1fa35548c3ad572694ce632d8b9,2022-10-24 22:11:35,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<vector>\nusing namespace std;\n//vector<int>v;\nint flag[100];\nint T;\nint ans[20];\nvoid print_vec()\n{\n\n    for(int i=0;i<T;i++)\n    {\n        cout << ans[i] << \"" \"";\n    }\n    cout << endl;\n}\nvoid dfs(int n,int index)\n{\n    if(index==n)\n    {\n        print_vec();\n        return;\n    }\n    for(int i=0;i<n;i++)\n    {\n        if(flag[i]==0)\n        {\n            //v.push_back(i+1);\n            flag[i]=1;\n            ans[index]=i+1;\n            dfs(n,index+1);\n            flag[i]=0;\n           // v.pop_back();\n        }\n    }\n}\nint main()\n{\n    std::ios_base::sync_with_stdio(false);\n    int n;\n    cin >> n;\n    T=n;\n    dfs(n,0);\n    return 0;\n}",PARTIAL_ACCEPTED,528,3468
1584548316469657600,ab4aa645c2afd3cedfd161269de383b30f97d1fa35548c3ad572694ce632d8b9,2022-10-24 22:12:12,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<vector>\nusing namespace std;\n//vector<int>v;\nint flag[100];\nint T;\nint ans[20];\nvoid print_vec()\n{\n\n    for(int i=0;i<T;i++)\n    {\n        cout << ans[i] << \"" \"";\n    }\n    cout << \""\\n\"";\n}\nvoid dfs(int n,int index)\n{\n    if(index==n)\n    {\n        print_vec();\n        return;\n    }\n    for(int i=0;i<n;i++)\n    {\n        if(flag[i]==0)\n        {\n            //v.push_back(i+1);\n            flag[i]=1;\n            ans[index]=i+1;\n            dfs(n,index+1);\n            flag[i]=0;\n           // v.pop_back();\n        }\n    }\n}\nint main()\n{\n    std::ios_base::sync_with_stdio(false);\n    int n;\n    cin >> n;\n    T=n;\n    dfs(n,0);\n    return 0;\n}",ACCEPTED,228,7160
1584553852103692288,12a9f42740f42e84af011a63f31b06e43ea88efda9a07f8ef578423e37d0fc53,2022-10-24 22:34:12,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    int a[10];\n    for(int i=0;i<n;i++)\n        a[i]=i+1;\n    do\n    {\n        for(int i=0;i<n;i++)\n            cout<<a[i]<<\"" \"";\n        cout<<endl;\n    }\n    while(next_permutation(a,a+n));\n}",PARTIAL_ACCEPTED,545,3520
1584565514374348800,d7bd2f1a127ec7190668415b734fbd6b9439c005f70fefcd1043ebe41dc6f144,2022-10-24 23:20:33,C,2.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint a[1000];\nvoid swap(int x,int y)\n{\n int t;\n t=a[x];a[x]=a[y];a[y]=t;\n}\nvoid perm(int p,int q)\n{\n if(p==q)\n {int j;\n for(j=1;j<=q;j++)\n printf(\""%d \"",a[j]);\n printf(\""\\n\"");\n }\n else\n {\n  int i;\n  for(i=p;i<=q;i++)\n  {\n   swap(p,i);\n   perm(p+1,q);\n   swap(p,i);\n  }\n }\n}\nint main()\n{\n int n;\n scanf(\""%d\"",&n);\n int i;\n for(i=1;i<=n;i++)\n a[i]=i;\n perm(1,n);\n return 0;\n}",PARTIAL_ACCEPTED,270,6972
1584786834513072128,49cc15e2b50f7c9c94d7b626864f5833dfe82745f712c369effe068bcc12ae45,2022-10-25 13:59:59,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std; \nint n;\nint q[10];\nbool st[10];\n\nvoid dfs(int t){\n    if(t>n){\n        for(int i=1;i<=n;i++){\n            cout<<q[i]<<\"" \"";\n        }cout<<endl;return;\n    }\n    for(int i=1;i<=n;i++){\n        if(!st[i]){\n            q[t]=i;\n            st[i]=true;\n            dfs(t+1);\n            st[i]=false;\n        }\n    }\n}\n\nint main(){\n   \n    cin>>n;\n    dfs(1);\n}",PARTIAL_ACCEPTED,536,3156
1584787135039139840,49cc15e2b50f7c9c94d7b626864f5833dfe82745f712c369effe068bcc12ae45,2022-10-25 14:01:11,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std; \nint n;\nint q[15];\nbool st[15];\n\nvoid dfs(int t){\n    if(t>n){\n        for(int i=1;i<=n;i++){\n            cout<<q[i]<<\"" \"";\n        }cout<<endl;return;\n    }\n    for(int i=1;i<=n;i++){\n        if(!st[i]){\n            q[t]=i;\n            st[i]=true;\n            dfs(t+1);\n            st[i]=false;\n        }\n    }\n}\n\nint main(){\n   \n    cin>>n;\n    dfs(1);\n}",PARTIAL_ACCEPTED,526,3192
1584787198884843520,49cc15e2b50f7c9c94d7b626864f5833dfe82745f712c369effe068bcc12ae45,2022-10-25 14:01:26,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n\nconst int N = 10;\nint q[N],st[N],n;\n\nvoid dfs(int u){\n    if(u>n){\n        for (int i = 1; i <= n; i ++ )cout<<q[i]<<\"" \"";\n        cout << endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!st[i]){\n            q[u]=i;\n        st[i]=1;\n        dfs(u+1);\n        st[i]=0;\n        }\n    }\n    \n}\n\nint main()\n{\n   \n    cin >> n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,533,3208
1584787263703609344,49cc15e2b50f7c9c94d7b626864f5833dfe82745f712c369effe068bcc12ae45,2022-10-25 14:01:42,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n\nconst int N = 20;\nint q[N],st[N],n;\n\nvoid dfs(int u){\n    if(u>n){\n        for (int i = 1; i <= n; i ++ )cout<<q[i]<<\"" \"";\n        cout << endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!st[i]){\n            q[u]=i;\n        st[i]=1;\n        dfs(u+1);\n        st[i]=0;\n        }\n    }\n    \n}\n\nint main()\n{\n   \n    cin >> n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,530,3192
1584861549055315968,d7bd2f1a127ec7190668415b734fbd6b9439c005f70fefcd1043ebe41dc6f144,2022-10-25 18:56:53,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n;\nint path[10];\nint flag[10];\nvoid dfs(int u)\n{\n  if(u>n)\n  {\n   for(int i=1;i<=n;i++)\n  cout<<path[i]<<\"" \"";\n cout<<endl;\n  return;\n }\n else\n {\n  for(int i=1;i<=n;i++)\n {\n  if(flag[i]) continue;\n  path[u]=i;\n  flag[i]=1;\n  dfs(u+1);\n path[u]=0;\n  flag[i]=0;\n }\n }\n}\n\n\nint main()\n{\n    cin>>n;\n    dfs(1);\n    return 0;\n}\n",PARTIAL_ACCEPTED,547,2836
1584861601396035584,d7bd2f1a127ec7190668415b734fbd6b9439c005f70fefcd1043ebe41dc6f144,2022-10-25 18:57:05,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n;\nint path[100];\nint flag[100];\nvoid dfs(int u)\n{\n  if(u>n)\n  {\n   for(int i=1;i<=n;i++)\n  cout<<path[i]<<\"" \"";\n cout<<endl;\n  return;\n }\n else\n {\n  for(int i=1;i<=n;i++)\n {\n  if(flag[i]) continue;\n  path[u]=i;\n  flag[i]=1;\n  dfs(u+1);\n path[u]=0;\n  flag[i]=0;\n }\n }\n}\n\n\nint main()\n{\n    cin>>n;\n    dfs(1);\n    return 0;\n}\n",PARTIAL_ACCEPTED,534,3244
1584873620178333696,90f984768650eef9dd49a694e4ccebfc51bc245da15844510474f4ea85653d3f,2022-10-25 19:44:51,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nconst int N=9;\nint main()\n{\n    \nint n;//输入多少个数据\nint array[N];//定义输出数组\nbool used[N];//判断该值是否被使用过\n \nvoid dfs(int u)\n{\n    if(u>n)\n    {//如果所有位置都满了，就输出数组\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){ //如果这个数没有被用过 false\n               array[u]=i;//在数组的第u个位置插入\n               used[i]=true;//将该数设置为已使用\n               dfs(u+1);//开始选下一个位置的数字\n               \n               //初始化\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1584873913733480448,90f984768650eef9dd49a694e4ccebfc51bc245da15844510474f4ea85653d3f,2022-10-25 19:46:01,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nconst int N=9;\nint main()\n{\n    \nint n;//输入多少个数据\nint array[N];//定义输出数组\nbool used[N];//判断该值是否被使用过\n \nvoid dfs(int u)\n{\n    if(u>n)\n    {//如果所有位置都满了，就输出数组\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){ //如果这个数没有被用过 false\n               array[u]=i;//在数组的第u个位置插入\n               used[i]=true;//将该数设置为已使用\n               dfs(u+1);//开始选下一个位置的数字\n               \n               //初始化\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1584874080620642304,90f984768650eef9dd49a694e4ccebfc51bc245da15844510474f4ea85653d3f,2022-10-25 19:46:41,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n \nconst int N=9;\nint n;\nint array[N];\nbool used[N];\n \nvoid dfs(int u){\n    if(u>n){\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){ \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,159,1016
1584878616059973632,a163cc4364006c1f13e4ecbf511ae869ea6ab93b2436abbc46ed06fa557efcac,2022-10-25 20:04:42,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nint a[10],b[10];\nvoid def(int step)\n{\n    if(step==n+1)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<a[i]<<' ';\n        cout<<endl;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(b[i]==0)\n        {\n            a[step]=i;\n            b[i]=1;\n            def(step+1);\n            b[i]=0;\n        }\n    }\n}\nint main()\n{\n    cin>>n;\n    def(1);\n}",PARTIAL_ACCEPTED,534,3144
1584888613733011456,debc7deccadcae4cb4b418482504c3e0ffa0a47c6c63265d521af152b8039d58,2022-10-25 20:44:25,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint a[10],n;\nint jiecheng(int m)\n{\n\tint sum=1;\n\tfor(int i=m;i>0;i--)\n\tsum*=i;\n\treturn sum;\n}\nvoid zidian()\n{\n\tint b,flag=1;\n\tfor(int i=n-1;i>0&&flag;i--)\n\t{\n\t\tif(a[i]<a[i+1])\n\t\t{\n\t\t\tfor(int j=n;j>i&&flag;j--)\n\t\t\t{\n\t\t\t\tif(a[j]>a[i])\n\t\t\t\t{\n\t\t\t\t\tb=a[j];\n\t\t\t\t\ta[j]=a[i];\n\t\t\t\t\ta[i]=b;\n\t\t\t\t\tflag=0;\n\t\t\t\t\tsort(a+i+1,a+n+1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\nint main()\n{\n\tcin>>n;\n\tfor(int i=1;i<=n;i++) \n\t{\n\t\ta[i]=i;\n\t\tcout<<a[i]<<\"" \"";\n\t}\n\tcout<<endl;\n\tfor(int i=1;i<jiecheng(n);i++)\n\t{\n\t\tzidian();\n\t\tfor(int i=1;i<=n;i++) \n\t\t    cout<<a[i]<<\"" \"";\n\t    cout<<endl;\n\t}\n}",PARTIAL_ACCEPTED,550,3120
1584900550638301184,9df6a94f5072c365c8e345d971acc5a502a721adc0a1b060992632b0757f05a9,2022-10-25 21:31:51,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nint a[10];\nvoid print(int *a,int n)\n{\n    int i;\n    for(i=1;i<=n;i++)\n        cout<<a[i]<<' ';\n    cout<<endl;\n}\nvoid permutation(int *a,int start,int end)\n{\n    int i,j;\n    if(start==end)\n        print(a,n);\n    for(i=start;i<=end;i++)\n    {\n        int temp=a[i];\n        int j;\n        for(j=i;j>start;j--)\n            a[j]=a[j-1];\n        a[start]=temp;\n        permutation(a,start+1,end);\n        temp=a[start];\n        for(j=start;j<i;j++)\n            a[j]=a[j+1];\n        a[i]=temp;\n    }\n}\nint main()\n{\n    cin>>n;\n    int i;\n    for(i=1;i<=n;i++)\n        a[i]=i;\n    permutation(a,1,n);\n    return 0;\n}",PARTIAL_ACCEPTED,534,3252
1584901575914950656,9df6a94f5072c365c8e345d971acc5a502a721adc0a1b060992632b0757f05a9,2022-10-25 21:35:56,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"/*#include<iostream>\nusing namespace std;\nint n;\nint a[10];\nvoid print(int *a,int n)\n{\n    int i;\n    for(i=1;i<=n;i++)\n        cout<<a[i]<<' ';\n    cout<<endl;\n}\nvoid permutation(int *a,int start,int end)\n{\n    int i,j;\n    if(start==end)\n        print(a,n);\n    for(i=start;i<=end;i++)\n    {\n        int temp=a[i];\n        int j;\n        for(j=i;j>start;j--)\n            a[j]=a[j-1];\n        a[start]=temp;\n        permutation(a,start+1,end);\n        temp=a[start];\n        for(j=start;j<i;j++)\n            a[j]=a[j+1];\n        a[i]=temp;\n    }\n}\nint main()\n{\n    cin>>n;\n    int i;\n    for(i=1;i<=n;i++)\n        a[i]=i;\n    permutation(a,1,n);\n    return 0;\n}*/\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint main(){\n    int n;\n    cin>>n;\n    int perm[n];\n    \n    for(int i = 0; i<n; i++){\n        perm[i] = i+1;\n    }\n    \n    do{\n        for(int i = 0; i<n;i++){\n            printf(\""%d \"", perm[i]);\n        }\n        printf(\""\\n\"");\n    }while(next_permutation(perm, perm+n));\n    \n    \n    return 0;\n}",ACCEPTED,287,7096
1584904170255552512,fbe1eb9b1daa65a9fbcf2ad9dd203734e5b51de40a22dc49810d6b320d6b3f38,2022-10-25 21:46:14,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    int *a=new int[n];\n    for(int i=0;i<n;i++)\n    {\n        a[i]=i+1;\n    }\n    sort(a,a+n);\n    do\n    {\n       for(int i=0;i<n;i++)\n       {\n           cout<<a[i]<<\"" \"";\n       }\n        cout<<endl;\n}\n    while(next_permutation(a,a+n));\n    return 0;\n}",PARTIAL_ACCEPTED,541,3192
1584904480160092160,fbe1eb9b1daa65a9fbcf2ad9dd203734e5b51de40a22dc49810d6b320d6b3f38,2022-10-25 21:47:28,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    int *a=new int[n];\n    for(int i=0;i<n;i++)\n    {\n        a[i]=i+1;\n    }\n    //sort(a,a+n);\n    do\n    {\n       for(int i=0;i<n;i++)\n       {\n           cout<<a[i]<<\"" \"";\n       }\n        cout<<endl;\n}\n    while(next_permutation(a,a+n));\n    return 0;\n}",PARTIAL_ACCEPTED,531,3252
1584908476329361408,1311e10a8e41977310a87f24bfc37a3da54d8345805fbd54b65738f7e8b9611e,2022-10-25 22:03:21,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main(){\n    int n;\n    cin>>n;\n    int a[n];\n    for(int i=0;i<n;i++)\n        a[i]=i+1;\n    do{\n        for(int i=0;i<n;i++){\n                cout<<a[i]<<\"" \"";\n        }\n        cout<<endl;\n        }while(next_permutation(a,a+n));\n    return 0;\n}",PARTIAL_ACCEPTED,532,3248
1584911807403659264,17892b52780d7122e33471b11bfdd39dd12e85533cf2c21a898692e2c32345d9,2022-10-25 22:16:35,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nint path[10];\nint flag[10]; \nint dfs(int t)//深度遍历 形成遍历树 \n{\n\tif(t>n)//t为当前层数 每一次遍历完后进行输出 \n\t\t{\n\t\t\tfor(int i=1;i<=n;i++)\n\t\t\t{\n\t\t\t\tcout<<path[i]<<\"" \"";\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\telse\n\t{\n\t\tfor(int i=1;i<=n;i++)//从1开始遍历 \n\t\t{\n\t\t\tif(!flag[i])\n\t\t\t{\n\t\t\t\tpath[t]=i;//给当前层赋值 \n\t\t\t\tflag[i]=1;\n\t\t\t\tdfs(t+1);//进入下一层 \n\t\t\t\tflag[i]=0;\n\t\t\t\tpath[t]=0;\n\t\t\t}\n\t\t}\n\t}\n } \nint main() \n{\n\tcin>>n;\n\tdfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,541,3252
1584914311893876736,17892b52780d7122e33471b11bfdd39dd12e85533cf2c21a898692e2c32345d9,2022-10-25 22:26:32,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nint path[10];//存放当前排列结果 \nint flag[10];//标记每个数字是否被用过 \nint dfs(int t)//深度遍历 形成遍历树 \n{\n\tif(t>n)//t为当前层数 每一次遍历完后进行输出 \n\t\t{\n\t\t\tfor(int i=1;i<=n;i++)\n\t\t\t{\n\t\t\t\tcout<<path[i]<<\"" \"";\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\telse\n\t{\n\t\tfor(int i=1;i<=n;i++)//从1开始遍历 \n\t\t{\n\t\t\tif(!flag[i])\n\t\t\t{\n\t\t\t\tpath[t]=i;//给当前层赋值 \n\t\t\t\tflag[i]=1;\n\t\t\t\tdfs(t+1);//进入下一层 \n\t\t\t\tflag[i]=0;//回溯 撤销标记 \n\t\t\t}\n\t\t}\n\t}\n } \nint main() \n{\n\tcin>>n;\n\tdfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,526,3256
1584914587220570112,66aa388865a5ef7c19df93c8c1a4261216ca1826c8c9b39ec968204ec1d8d75f,2022-10-25 22:27:38,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nvoid pailie(int u)\n{\n    int s[9];\nbool p[9];if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<s[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!p[i])\n        { \n               s[u]=i;\n               p[i]=1;\n               dfs(u+1,n);\n               s[u]=0;\n               p[i]=0;\n        } \n        \n    }\n    \n}\n \nint main()\n{\n    cin>>n;\n    pailie(1);\n}\n",COMPILE_ERROR,0,0
1584914631264956416,66aa388865a5ef7c19df93c8c1a4261216ca1826c8c9b39ec968204ec1d8d75f,2022-10-25 22:27:49,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nvoid pailie(int u)\n{\n    int s[9];\nbool p[9];if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<s[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!p[i])\n        { \n               s[u]=i;\n               p[i]=1;\n               pailie(u+1,n);\n               s[u]=0;\n               p[i]=0;\n        } \n        \n    }\n    \n}\n \nint main()\n{\n    cin>>n;\n    pailie(1);\n}\n",COMPILE_ERROR,0,0
1584914674759888896,66aa388865a5ef7c19df93c8c1a4261216ca1826c8c9b39ec968204ec1d8d75f,2022-10-25 22:27:59,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nvoid pailie(int u)\n{\n    int s[9];\nbool p[9];if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<s[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!p[i])\n        { \n               s[u]=i;\n               p[i]=1;\n               pailie(u+1);\n               s[u]=0;\n               p[i]=0;\n        } \n        \n    }\n    \n}\n \nint main()\n{\n    cin>>n;\n    pailie(1);\n}\n",WRONG_ANSWER,64,828
1584914909859020800,66aa388865a5ef7c19df93c8c1a4261216ca1826c8c9b39ec968204ec1d8d75f,2022-10-25 22:28:55,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N = 9;\nbool s[N];\nint p[N];\nint n;\nvoid pailie(int a)\n{\n    if (a > n) \n    {\n        for (int i = 1; i <= n; i++) \n        {\n            cout << p[i] << \"" \"";\n        }\n        cout << endl;\n        return;\n    }\n    for (int i = 1; i <= n; i++) \n    {\n        if (!s[i]) \n        {\n            s[i] = 1;\n            p[a] = i;\n            pailie(a + 1);\n            s[i] = 0;\n        }\n    }\n}\nint main()\n{\n    cin >> n;\n    pailie(1);\n}",PARTIAL_ACCEPTED,245,1016
1584928637346254848,4607ceab7b03a70596e6e82acff3173bb5670d01af298af0dfb2e2c5a85857fe,2022-10-25 23:23:28,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N=9;\nint n;\nint array[N];\nbool used[N];\nvoid dfs(int u){\n    if(u>n){\n        for(int i=1;i<=n;i++)\n            cout << array[i] << \"" \"";\n        cout << endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){\n               array[u] = i;\n               used[i] = true;\n               dfs(u+1);\n               array[u] = 0;\n               used[i] = false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin >> n;\n    dfs(1);\n}",PARTIAL_ACCEPTED,137,960
1584929829572972544,4607ceab7b03a70596e6e82acff3173bb5670d01af298af0dfb2e2c5a85857fe,2022-10-25 23:28:12,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nvoid dfs(int u, int n){\n    int array[9];\n    bool used[9];\n    if(u > n){\n        for(int i=1; i<=n; i++)\n            cout << array[i] << \"" \"";\n        cout << endl;\n        return;\n    }\n    \n    for(int i=1; i<=n; i++){\n        if(!used[i]){\n               array[u] = i;\n               used[i] = true;\n               dfs(u + 1, n);\n               array[u] = 0;\n               used[i] = false;\n        }\n    }\n}\nint main(){\n    int n;\n    cin >> n;\n    dfs(1, n);\n}",WRONG_ANSWER,219,4308
1584929998834106368,4607ceab7b03a70596e6e82acff3173bb5670d01af298af0dfb2e2c5a85857fe,2022-10-25 23:28:52,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\n \nconst int N = 10;\nint n;\nint path[N];\nbool st[N];\nvoid dfs(int a){\n    if(a > n){\n        for(int i = 1;i <= n;i++){\n            cout<<path[i]<<\"" \"";\n        }\n    cout << endl;\n    }\n    else\n    {\n        for(int i = 1;i <= n;i++){\n            if(!st[i]){\n                path[a] = i;\n                st[i] = true;\n                dfs(a + 1);\n                st[i] = false;\n                path[a] = 0;\n            }\n        }\n    }\n}\nint main(){\n    cin >> n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,533,3348
1584930190480244736,6a0adcce8068dacf6780f713f1a2d43251717c416fbbe2fd7a0c38c080478e3d,2022-10-25 23:29:38,C,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint book[10],a[10];\nint n;\nvoid qu(int x)\n{\n\tint i;\n\tif(x==n+1)\n\t{\n\t\tfor(i=1;i<=n;i++)\n\t\t{\n\t\t\tprintf(\""%d \"",a[i]);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t\treturn ;\n\t}\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(book[i]==0)\n\t\t{\n\t\t\ta[x]=i;\n\t\t\tbook[i]=1;\n\t\t\tqu(x+1);\n\t\t\tbook[i]=0;\n\t\t}\n\t}\n\treturn ;\n\t\n}\nint main()\n{\n\tscanf(\""%d\"",&n);\n\tqu(1);\n\t\n\t\n}",ACCEPTED,251,7100
1584930653372018688,33a5bd7740a0c2c958e1e8d7c16c5fcc8dc825288a93a13514e48fff2f272a96,2022-10-25 23:31:29,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\nusing namespace std;\nint n, a[30];\nbool vis[30];\nvoid dfs(int pos)\n{\n    if(pos==n)\n    {\n        for(int i = 1; i <= n; i++) cout << a[i] << \"" \"";\n        cout << endl;\n    }\n    for(int i = 1; i <= n; i++)\n    {\n        if(vis[i]) continue;\n        vis[i] = 1;\n        a[pos + 1] = i;\n        dfs(pos + 1);\n        vis[i] = 0;\n    }\n    return;\n}\n \nint main()\n{\n    cin >> n; \n    dfs(0);\n    return 0;\n}",PARTIAL_ACCEPTED,530,3500
1584930757961187328,4607ceab7b03a70596e6e82acff3173bb5670d01af298af0dfb2e2c5a85857fe,2022-10-25 23:31:53,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint a[10],book[10]={0};\nint n;\nvoid dfs(int x)\n{\n\tint i;\n\tif(x>n)\n\t{\n\t\tfor(i=1;i<=n;i++)\n\t\t\tprintf(\""%d \"",a[i]);\n\t\tprintf(\""\\n\"");\n\t\treturn;\n\t}\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(!book[i])\n\t\t{\n\t\t\tbook[i]=1;a[x]=i;\n\t\t\tdfs(x+1);\n\t\t\tbook[i]=0;\n\t\t}\n\t}\n}\nint main()\n{\n\tint i;\n\twhile(scanf(\""%d\"",&n)!=EOF)\n\t{\n\t\tdfs(1);\n\t}\n\treturn 0;\n}",ACCEPTED,287,7044
1584931270115069952,4607ceab7b03a70596e6e82acff3173bb5670d01af298af0dfb2e2c5a85857fe,2022-10-25 23:33:56,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint a[10],book[10]={0};\nint n;\nvoid dfs(int x){\n    int i;\n    if(x>n){\n        for(i=1;i<=n;i++)\n            cout << a[i] << ' ';\n        cout << endl;\n        return;\n    }\n    for(i=1; i<=n; i++){\n        if(!book[i]){\n            book[i]=1;\n            a[x]=i;\n            dfs(x+1);\n            book[i]=0;\n        }\n    }\n}\nint main(){\n    int i;\n    while(scanf(\""%d\"",&n)!=EOF){\n        dfs(1);\n    }\n    return 0;\n}",PARTIAL_ACCEPTED,537,3128
1584931405226184704,4607ceab7b03a70596e6e82acff3173bb5670d01af298af0dfb2e2c5a85857fe,2022-10-25 23:34:28,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint a[10],book[10]={0};\nint n;\nvoid dfs(int x)\n{\n\tint i;\n\tif(x>n)\n\t{\n\t\tfor(i=1;i<=n;i++)\n\t\t\tprintf(\""%d \"",a[i]);\n\t\tprintf(\""\\n\"");\n\t\treturn;\n\t}\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(!book[i])\n\t\t{\n\t\t\tbook[i]=1;a[x]=i;\n\t\t\tdfs(x+1);\n\t\t\tbook[i]=0;\n\t\t}\n\t}\n}\nint main()\n{\n\tint i;\n\twhile(scanf(\""%d\"",&n)!=EOF)\n\t{\n\t\tdfs(1);\n\t}\n\treturn 0;\n}",ACCEPTED,300,7088
1585156685756755968,396a60834e2801edfd6a4c7f73528f5f65615806705800162333b284026c2deb,2022-10-26 14:29:39,C++,2.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint a[100];\nvoid dfs(int p,int q)\n{\n    int i;\n    for(i=p;i<=q;i++){\n        if(p<q){\n            swap(a[p],a[i]);\n            dfs(p+1,q);\n            swap(a[p],a[i]);\n        }\n        else{\n            for(int j=0;j<=q;j++){\n                cout<<a[j]<<' ';\n            }\n            cout<<endl;\n        }\n    }\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++)\n        a[i]=i+1;\n    dfs(0,n-1);\n    return 0;\n}",PARTIAL_ACCEPTED,534,3152
1585157782554677248,396a60834e2801edfd6a4c7f73528f5f65615806705800162333b284026c2deb,2022-10-26 14:34:00,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint a[100];\nvoid dfs(int p,int q)\n{\n    int i;\n    for(i=p;i<=q;i++){\n        if(p<q){\n            swap(a[p],a[i]);\n            dfs(p+1,q);\n            swap(a[p],a[i]);\n        }\n        else{\n            for(int j=0;j<=q;j++){\n                cout<<a[j]<<' ';\n            }\n            cout<<endl;\n        }\n    }\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++)\n        a[i]=i+1;\n    dfs(0,n);\n    return 0;\n}",MULTIPLE_ERROR,925,3520
1585157831074377728,396a60834e2801edfd6a4c7f73528f5f65615806705800162333b284026c2deb,2022-10-26 14:34:12,C++,2.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint a[100];\nvoid dfs(int p,int q)\n{\n    int i;\n    for(i=p;i<=q;i++){\n        if(p<q){\n            swap(a[p],a[i]);\n            dfs(p+1,q);\n            swap(a[p],a[i]);\n        }\n        else{\n            for(int j=0;j<=q;j++){\n                cout<<a[j]<<' ';\n            }\n            cout<<endl;\n        }\n    }\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++)\n        a[i]=i+1;\n    dfs(0,n-1);\n    return 0;\n}",PARTIAL_ACCEPTED,545,3284
1585160451411283968,396a60834e2801edfd6a4c7f73528f5f65615806705800162333b284026c2deb,2022-10-26 14:44:37,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint n;\nvoid px(int *a,int x,int y)\n{\n    int i,k,l,v;\n    k=a[y];\n    for(i=x+1,l=a[x];i<=y;i++)\n    {\n    \tv=a[i];\n    \ta[i]=l;\n    \tl=v;\n\t}\n\ta[x]=k;\n}\nvoid hg(int *a,int x,int y)\n{\n\tint i,k;\n\tk=a[x];\n\tfor(i=x;i<y;i++)\n\t{\n\t\ta[i]=a[i+1];\n\t}\n\ta[y]=k;\n}\nvoid qpl(int *a,int q,int p)\n{\n    int i,j;\n    if(q<p)\n    {\n        for(i=q;i<=p;i++)\n        {\n            px(a,q,i);\n            qpl(a,q+1,p);\n            hg(a,q,i);\n        }\n    }\n    else\n    {\n        for(j=0;j<n;j++)\n        printf(\""%d \"",a[j]);\n        printf(\""\\n\"");\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    int a[n],i;\n    for(i=0;i<n;i++)\n    a[i]=i+1;\n    qpl(a,0,n-1);\n    return 0;\n}",ACCEPTED,273,7100
1585163656572567552,396a60834e2801edfd6a4c7f73528f5f65615806705800162333b284026c2deb,2022-10-26 14:57:21,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint a[100];\nvoid dfs(int p,int q)\n{\n    int i;\n    for(i=p;i<=q;i++){\n        if(p<q){\n            swap(a[p],a[i]);\n            sort(&a[p+1],&a[i+1]);\n            dfs(p+1,q);\n            sort(&a[p],&a[i+1]);\n        }\n        else{\n            for(int j=0;j<=q;j++){\n                cout<<a[j]<<' ';\n            }\n            cout<<endl;\n        }\n    }\n}\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=0;i<n;i++)\n        a[i]=i+1;\n    dfs(0,n-1);\n    return 0;\n}",PARTIAL_ACCEPTED,544,3076
1585169910061731840,91bac05339048592ad9bbb12fd0715dbaf499c6971148e2675cf0930b7d9303f,2022-10-26 15:22:12,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <bits/stdc++.h>\nusing namespace std;\nint n,m,p[110];\nvoid dfs(int x){\n    if (p[0] == m){\n        for (int j = 1;j <= p[0];j++){\n        \tcout << p[j] << \"" \"";\n\t\t}\n        cout << endl;\n        return ;\n    }\n    for (int i = x;i <= n;i++){\n        p[++p[0]] = i;\n        dfs(i+1);\n        p[p[0]--] = 0;\n    }\n}\nint main(){\n    cin >> n >> m;\n    dfs(1);\n    return 0;\n}\n",WRONG_ANSWER,19,608
1585170062700834816,91bac05339048592ad9bbb12fd0715dbaf499c6971148e2675cf0930b7d9303f,2022-10-26 15:22:48,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nint stu[10];\nvoid dfs(int u,int ans)\n{\n    if(ans==n)//递归边界\n    {\n        for(int i=0;i<n;i++)\n        cout<<stu[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    int i=1,j=1;\n    for(i=1;i<=n;i++)  //尝试在stu[u]中填写各种整数i\n    {\n        for(j=0;j<ans;j++)\n        {\n            if(stu[j]==i)//如果i已经在stu[0]~stu[u-1]出现过，则不能再选\n            {\n                break;\n            }\n        }\n        if(j==ans)\n        {\n             stu[ans]=i;\n             dfs(i,ans+1);//递归调用\n        }\n    }\n    \n}\nint main()\n{\n    ios::sync_with_stdio(false);\n    cin.tie(0);\n    cin>>n;\n    dfs(1,0);\n    return 0;\n}",PARTIAL_ACCEPTED,552,3284
1585170216287858688,91bac05339048592ad9bbb12fd0715dbaf499c6971148e2675cf0930b7d9303f,2022-10-26 15:23:25,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\n \nint num[1000];\nint a;\nvoid f(int b,int c){\n    if(b==a){\n        for(int i=0;i<a;i++){\n            printf(\""%d \"",num[i]);\n        }\n        printf(\""\\n\"");\n        return;\n    }\n    else{\n        for(int i = 1;i<=a;i++){\n            if (!((c>>i)&1)){\n                num[b++]=i;\n                f(b,c|1<<i);\n                b--;\n            }\n        }\n    }\n}\nint main(){\n    scanf(\""%d\"",&a);\n    f(0,0);\n    return 0;\n}",ACCEPTED,295,6984
1585170244410671104,91bac05339048592ad9bbb12fd0715dbaf499c6971148e2675cf0930b7d9303f,2022-10-26 15:23:31,C,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\n \nint num[1000];\nint a;\nvoid f(int b,int c){\n    if(b==a){\n        for(int i=0;i<a;i++){\n            printf(\""%d \"",num[i]);\n        }\n        printf(\""\\n\"");\n        return;\n    }\n    else{\n        for(int i = 1;i<=a;i++){\n            if (!((c>>i)&1)){\n                num[b++]=i;\n                f(b,c|1<<i);\n                b--;\n            }\n        }\n    }\n}\nint main(){\n    scanf(\""%d\"",&a);\n    f(0,0);\n    return 0;\n}",ACCEPTED,396,7052
1585196256750075904,b88c63f11b2fdf78a956b5aed42084c1d041f21027755732730f7510d6232a7b,2022-10-26 17:06:53,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint a[109],n,v[109];\nvoid dfs(int x){\n\tif(x>n) {\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tcout<<a[i]<<\"" \"";\n\t\t}\n\t\tcout<<'\\n';\n\t\treturn ;\n\t}\n\tfor(int i=1;i<=n;i++){\n\t\tif(v[i]==0){\n\t\t\tv[i]=1;\n\t\t\ta[x]=i;\n\t\t\tdfs(x+1);\n\t\t\tv[i]=0;\n\t\t}\n\t}\n\treturn ;\n}\nint main()\n{\n\tcin>>n;\n\tdfs(1);\n\treturn 0;\n}\n",ACCEPTED,291,7036
1585215182036922368,f41dc8aae88d4b0bee3e6f2ff96932cb1fde9a3659d5c1dd49ef37da11f82258,2022-10-26 18:22:05,C++,2.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n\nvoid swap(int a[],int i,int j){\n    int t=a[i];\n    a[i]=a[j];\n    a[j]=t;\n}\nvoid print(int a[],int n){\n    for(int i=0;i<n;i++)\n        cout<<a[i]<<\"" \"";\n    cout<<'\\n';\n}\nvoid perm(int a[],int p,int q){\n    if(p==q)\n        print(a,q+1);\n    else{\n        for(int i=p;i<=q;i++){\n            swap(a,p,i);\n            if(a[p+1]>a[q]){\n                int t=a[p+1];\n                a[p+1]=a[q];\n                a[q]=t;\n                perm(a,p+1,q);\n            }\n            else\n            perm(a,p+1,q);\n            swap(a,i,p);\n        }\n    }\n}\nint main()\n{\n    int n;\n    cin>>n;\n    int a[n];\n    for(int i=0;i<n;i++)\n        a[i]=i+1;\n    perm(a,0,n-1);\n}",PARTIAL_ACCEPTED,272,7088
1585216335021731840,b88c63f11b2fdf78a956b5aed42084c1d041f21027755732730f7510d6232a7b,2022-10-26 18:26:40,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n,top=0;\nint a[1001]={0};\nint vis[1001]={0};\nint stc[1001];\nvoid dfs(int x)\n{\n    if(x==n)\n    {\n        for(int i=0;i<n;i++)\n            cout<<stc[i]<<' ';\n        cout<<endl;\n        return;\n    }\n    for(int i=0;i<n;i++)\n    {\n        if(vis[i]==0)\n        {\n            vis[i]=1;\n            stc[top++]=a[i];\n            dfs(x+1);\n            top--;\n            vis[i]=0;\n        }\n    }\n}\nint main()\n{\n    cin>>n;\n    for(int i=0;i<n;i++)\n        a[i]=i+1;\n    dfs(0);\n    return 0;\n}",PARTIAL_ACCEPTED,538,3252
1585217583426965504,b88c63f11b2fdf78a956b5aed42084c1d041f21027755732730f7510d6232a7b,2022-10-26 18:31:38,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n,top=0;\nint a[1001]={0};\nint vis[1001]={0};\nint stc[1001];\nvoid dfs(int x)\n{\n    if(x==n)\n    {\n        for(int i=0;i<n;i++)\n            cout<<a[i]<<' ';\n        cout<<endl;\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(vis[i]==0)\n        {\n            vis[i]=1;\n            a[x]=i;\n            dfs(x+1);\n            vis[i]=0;\n        }\n    }\n}\nint main()\n{\n    cin>>n;\n    dfs(0);\n    return 0;\n}",PARTIAL_ACCEPTED,529,3244
1585217740587532288,b88c63f11b2fdf78a956b5aed42084c1d041f21027755732730f7510d6232a7b,2022-10-26 18:32:15,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,#include<iostream>\nusing namespace std;\nint n;\nint a[1001];\nint vis[1001]={0};\nvoid dfs(int x)\n{\n    if(x==n)\n    {\n        for(int i=0;i<n;i++)\n            cout<<a[i]<<' ';\n        cout<<endl;\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(vis[i]==0)\n        {\n            vis[i]=1;\n            a[x]=i;\n            dfs(x+1);\n            vis[i]=0;\n        }\n    }\n}\nint main()\n{\n    cin>>n;\n    dfs(0);\n    return 0;\n},PARTIAL_ACCEPTED,541,3168
1585217989175541760,b88c63f11b2fdf78a956b5aed42084c1d041f21027755732730f7510d6232a7b,2022-10-26 18:33:15,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,#include<iostream>\nusing namespace std;\nint n;\nint a[1001];\nint vis[1001]={0};\nvoid dfs(int x)\n{\n    if(x==n)\n    {\n        for(int i=0;i<n;i++)\n            cout<<a[i]<<' ';\n        cout<<endl;\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(vis[i]==0)\n        {\n            vis[i]=1;\n            a[x]=i;\n            dfs(x+1);\n            vis[i]=0;\n        }\n    }\n    return ;\n}\nint main()\n{\n    cin>>n;\n    dfs(0);\n    return 0;\n},PARTIAL_ACCEPTED,534,3128
1585218082557530112,b88c63f11b2fdf78a956b5aed42084c1d041f21027755732730f7510d6232a7b,2022-10-26 18:33:37,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,#include<iostream>\nusing namespace std;\nint n;\nint a[1001];\nint vis[1001]={0};\nvoid dfs(int x)\n{\n    if(x>=n)\n    {\n        for(int i=0;i<n;i++)\n            cout<<a[i]<<' ';\n        cout<<endl;\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(vis[i]==0)\n        {\n            vis[i]=1;\n            a[x]=i;\n            dfs(x+1);\n            vis[i]=0;\n        }\n    }\n    return ;\n}\nint main()\n{\n    cin>>n;\n    dfs(0);\n    return 0;\n},PARTIAL_ACCEPTED,541,3156
1585218226808029184,b88c63f11b2fdf78a956b5aed42084c1d041f21027755732730f7510d6232a7b,2022-10-26 18:34:11,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,#include<iostream>\nusing namespace std;\nint n;\nint a[15];\nint vis[15]={0};\nvoid dfs(int x)\n{\n    if(x>=n)\n    {\n        for(int i=0;i<n;i++)\n            cout<<a[i]<<' ';\n        cout<<endl;\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(vis[i]==0)\n        {\n            vis[i]=1;\n            a[x]=i;\n            dfs(x+1);\n            vis[i]=0;\n        }\n    }\n    return ;\n}\nint main()\n{\n    cin>>n;\n    dfs(0);\n    return 0;\n},PARTIAL_ACCEPTED,553,3380
1585218363030634496,b88c63f11b2fdf78a956b5aed42084c1d041f21027755732730f7510d6232a7b,2022-10-26 18:34:44,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,#include<iostream>\nusing namespace std;\nint n;\nint a[15];\nint vis[15]={0};\nvoid dfs(int x)\n{\n    if(x>=n)\n    {\n        for(int i=0;i<n;i++)\n            cout<<a[i]<<' ';\n        cout<<'\\n';\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(vis[i]==0)\n        {\n            vis[i]=1;\n            a[x]=i;\n            dfs(x+1);\n            vis[i]=0;\n        }\n    }\n    return ;\n}\nint main()\n{\n    cin>>n;\n    dfs(0);\n    return 0;\n},ACCEPTED,301,7128
1585249669328273408,1311e10a8e41977310a87f24bfc37a3da54d8345805fbd54b65738f7e8b9611e,2022-10-26 20:39:08,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint a[10001],c[10001];\nbool b[10001];\nint ans,n,flag=1;\nvoid dfs(){\n    if(ans==n){\n        for(int i=1;i<flag;i++){\n            cout<<c[i]<<\"" \"";\n        }\n        cout<<endl;\n        return;\n    }\n    for(int i=1;i<=n;i++){\n        if(b[i]==true)\n            continue;\n        b[i]=true;\n        ans++;\n        c[flag++]=a[i];\n        dfs();\n        ans--;\n        flag--;\n        b[i]=false;\n    }\n}\nint main(){\n    cin>>n;\n    for(int i=1;i<=n;i++){\n        a[i]=i;\n        b[i]=false;\n    }\n    dfs();\n    return 0;\n}\n",PARTIAL_ACCEPTED,549,3236
1585457779452014592,0453f5dc9b432841c8fb3e632f2893a787436fb377ba16e2479e137b743bd16a,2022-10-27 10:26:05,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nint a[10],flag[10];\nvoid dfs(int u)\n{\n    if(u==n)\n    {\n        for(int i=0;i<n;i++)cout<<a[i]<<' ';\n        puts(\""\"");\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!flag[i])\n        {\n            a[u]=i;\n            flag[i]=1;\n            dfs(u+1);\n            flag[i]=0;\n        }\n    }\n}\nsigned main()\n{\n    cin>>n;\n    dfs(0);\n}",ACCEPTED,295,7224
1585534070603776000,03a5007f43186e36ced429cae9332c4a2937ad6cfc4d655f476fda1d2c44db9e,2022-10-27 15:29:14,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\nusing namespace std;\nint main()\n{\n    int n,x,y,z;\n    cin>>n;\n    for(x=1;x<=n;x++)\n        for(y=1;y<=n;y++)\n            for(z=1;z<=n;z++)\n                if(x!=y&&x!=z&&y!=z)\n                    cout<<x<<' '<<y<<\"" \""<<z<<\"" \""<<endl;\n}",WRONG_ANSWER,31,604
1585534160399626240,03a5007f43186e36ced429cae9332c4a2937ad6cfc4d655f476fda1d2c44db9e,2022-10-27 15:29:36,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\nusing namespace std;\nint main()\n{\n    int n,x,y,z;\n    cin>>n;\n    for(x=1;x<=n;x++)\n        for(y=1;y<=n;y++)\n            for(z=1;z<=n;z++)\n                if(x!=y&&x!=z&&y!=z)\n                    cout<<x<<' '<<y<<\"" \""<<z<<\"" \""<<endl;\n}",WRONG_ANSWER,25,468
1585538406360674304,03a5007f43186e36ced429cae9332c4a2937ad6cfc4d655f476fda1d2c44db9e,2022-10-27 15:46:28,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    int num[100];\n    for(int i=0;i<n;i++)\n        num[i]=i+1;\n    do{\n        for(int i=0;i<n;i++)\n            cout<<num[i]<<\"" \"";\n        cout<<\""\\n\"";\n    }while(next_permutation(num,num+n));\n    return 0;\n}",ACCEPTED,264,7124
1585557905994551296,f41dc8aae88d4b0bee3e6f2ff96932cb1fde9a3659d5c1dd49ef37da11f82258,2022-10-27 17:03:57,C++,2.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n\nvoid swap(int a[],int i,int j){\n    int t=a[i];\n    a[i]=a[j];\n    a[j]=t;\n}\nvoid print(int a[],int n){\n    for(int i=0;i<n;i++)\n        cout<<a[i]<<\"" \"";\n    cout<<'\\n';\n}\nvoid perm(int a[],int p,int q){\n    if(p==q)\n        print(a,q+1);\n    else{\n        for(int i=p;i<=q;i++){\n            swap(a,p,i);\n            if(a[p+1]>a[p+2]){\n                int t=a[p+1];\n                a[p+1]=a[p+2];\n                a[p+2]=t;\n            }\n            perm(a,p+1,q);\n            swap(a,i,p);\n        }\n    }\n}\nint main()\n{\n    int n;\n    cin>>n;\n    int a[n];\n    for(int i=0;i<n;i++)\n        a[i]=i+1;\n    perm(a,0,n-1);\n}",PARTIAL_ACCEPTED,278,7228
1585562194053820416,f41dc8aae88d4b0bee3e6f2ff96932cb1fde9a3659d5c1dd49ef37da11f82258,2022-10-27 17:21:00,C++,2.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n\nvoid swap(int a[],int i,int j){\n    int t=a[i];\n    a[i]=a[j];\n    a[j]=t;\n}\nvoid print(int a[],int n){\n    for(int i=0;i<n;i++)\n        cout<<a[i]<<\"" \"";\n    cout<<'\\n';\n}\nvoid perm(int a[],int p,int q){\n    if(p==q)\n        print(a,q+1);\n    else{\n        for(int i=p;i<=q;i++){\n            swap(a,p,i);\n            if(a[p+1]>a[p+2]){\n                int t=a[p+1];\n                a[p+1]=a[p+2];\n                a[p+2]=t;\n            }\n            perm(a,p+1,q);\n            if(a[p+1]>a[p+2]){\n                int t=a[p+1];\n                a[p+1]=a[p+2];\n                a[p+2]=t;\n            }\n            swap(a,i,p);\n        }\n    }\n}\nint main()\n{\n    int n;\n    cin>>n;\n    int a[n];\n    for(int i=0;i<n;i++)\n        a[i]=i+1;\n    perm(a,0,n-1);\n}",PARTIAL_ACCEPTED,288,7016
1585563440236072960,f41dc8aae88d4b0bee3e6f2ff96932cb1fde9a3659d5c1dd49ef37da11f82258,2022-10-27 17:25:57,C++,2.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n\nvoid swap(int a[],int i,int j){\n    int t=a[i];\n    a[i]=a[j];\n    a[j]=t;\n}\nvoid print(int a[],int n){\n    for(int i=0;i<n;i++)\n        cout<<a[i]<<\"" \"";\n    cout<<'\\n';\n}\nvoid perm(int a[],int p,int q){\n    if(p==q)\n        print(a,q+1);\n    else{\n        for(int i=p;i<=q;i++){\n            swap(a,p,i);\n            if(a[p+1]>a[p+2]){\n                int t=a[p+1];\n                a[p+1]=a[p+2];\n                a[p+2]=t;\n            }\n            perm(a,p+1,q);\n            if(a[p+1]>a[p+2]){\n                int t=a[p+1];\n                a[p+1]=a[p+2];\n                a[p+2]=t;\n            }\n            swap(a,i,p);\n        }\n    }\n}\nint main()\n{\n    int n;\n    cin>>n;\n    int a[n];\n    for(int i=0;i<n;i++)\n        a[i]=i+1;\n    perm(a,0,n-1);\n}",PARTIAL_ACCEPTED,257,7056
1585588651970920448,a163cc4364006c1f13e4ecbf511ae869ea6ab93b2436abbc46ed06fa557efcac,2022-10-27 19:06:08,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n#include<stdlib.h>\nvoid allrank(int r,int *array,int n)\n{\n\tint error=true;\n\tif(r==n)\n\t{\n\t\tfor(int k=0;k<n;k++)\n\t\t{\n\t\t\tprintf(\""%d \"",array[k]);\n\t\t}\n\t\tprintf(\""\\n\"");\t\t\n\t}\n\telse\n    {\n\t\tfor(int j=1;j<=n;j++)\n\t\t{\n\t\t\tfor(int i=0;i<r;i++)\n\t        {\n\t    \t    if(array[i]==j)error=false;\n\t    \t    \n\t\t    }\n\t\t    if(error==true)\n\t\t    {\n\t\t    \tarray[r]=j;\n\t\t        allrank(r+1,array,n);\n\t\t        \n\t\t\t}\n\t\t    error=true;\n\t\t    \n\t\t}\n\t    \n\t\t\n\t}\n} \n \nint main()\n{\n    int n;\n    int  *array;\n    cin>>n;\n    \n    array=(int *)calloc(n,sizeof(int));//声明一个动态数组，用来存储这n个数\n    \n    allrank(0,array,n);//递归函数\n\treturn 0;\n}",ACCEPTED,341,7100
1585624260676554752,3f03dc9e3f42fe0e0c1a47397752b1b2b9b39fa44f31bdbead75c8ee570949f3,2022-10-27 21:27:37,C++,2.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nvoid swap(int &a,int &b)\n{\n\tint t;\n\tt=a;\n\ta=b;\n\tb=t;\n}\nint pailie(int wei,int *a,int n)\n{ \nif(wei==n)\n{\n\tfor(int i=0;i<n;i++)\nprintf(\""%d \"",a[i]);\nprintf(\""\\n\"");\n\treturn 0;\n}\nelse\n{\n\tfor(int i=wei;i<n;i++)\n{\n\tswap(a[i],a[wei]);\n\tpailie(wei+1,a,n);\n\tswap(a[i],a[wei]);\n}\n   \n}\n return 0;\n}\n\nint main()\n{\n    int n,sum=1;\n   scanf(\""%d\"",&n);\n    int a[n];\n    for(int i=1;i<=n;i++)\n    {  sum=sum*i;\n     a[i-1]=i;\n    }\n    pailie(0,a,n);\n}",PARTIAL_ACCEPTED,295,7096
1585634532266995712,89fab8e344e0483db81eb71a2096e55ca6fecf3e7043815678ada2818919be32,2022-10-27 22:08:26,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n \nconst int N=9;\nint n;\nint array[N];\nbool used[N];\n \nvoid dfs(int u){\n    if(u>n){\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){\n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,144,1216
1585634620380938240,3f03dc9e3f42fe0e0c1a47397752b1b2b9b39fa44f31bdbead75c8ee570949f3,2022-10-27 22:08:47,C,2.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nvoid swap(int *a,int *b)\n{\n\tint t;\n\tt=*a;\n\t*a=*b;\n\t*b=t;\n}\nint perm(int *a,int p,int q)\n{ \nif(p==q)\n{\n\tfor(int i=0;i<q;i++)\nprintf(\""%d \"",a[i]);\nprintf(\""\\n\"");\n\treturn 0;\n}\nelse\n{\n\tfor(int i=p;i<q;i++)\n{\n\tswap(&a[i],&a[p]);\n     perm(a,p+1,q);\n\tswap(&a[i],&a[p]);\n}\n   \n}\n return 0;\n}\n\nint main()\n{\n    int n;\n   scanf(\""%d\"",&n);\n    int a[n];\n    for(int i=1;i<=n;i++)\n    { \n     a[i-1]=i;\n    }\n    perm(a,0,n);\n}",PARTIAL_ACCEPTED,286,7052
1585826585110249472,c6370548204e7201fbde37459b473e57dbdd671149d9c16d601c3054edb6a109,2022-10-28 10:51:35,Java,4.0,1584250325531770884,1574307941233045504,1418168535107559424,"import java.util.*;\npublic class Main {\n    static int n;\n    static int a[] = new int[10];\n    static boolean [] b = new boolean[10];\n    static void fun(int u){\n        if(u == n){\n            for(int i = 0;i < n;i++){\n                System.out.print(a[i] + \"" \"");\n            }\n            System.out.println();\n            return;\n        }\n        for(int i = 0;i < n;i++){\n            if(!b[i+1]){\n                a[u] = i+1;\n                b[i+1] = true;\n                fun(u+1);\n                a[u] = 0;\n                b[i+1] = false;\n            }\n        }\n    }\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        n = s.nextInt();\n        Main.fun(0);\n    }\n}",PARTIAL_ACCEPTED,1568,37356
1585826722205274112,c6370548204e7201fbde37459b473e57dbdd671149d9c16d601c3054edb6a109,2022-10-28 10:52:08,Java,4.0,1584250325531770884,1574307941233045504,1418168535107559424,"import java.util.*;\npublic class Main {\n    static int n;\n    static int a[] = new int[100];\n    static boolean [] b = new boolean[10];\n    static void fun(int u){\n        if(u == n){\n            for(int i = 0;i < n;i++){\n                System.out.print(a[i] + \"" \"");\n            }\n            System.out.println();\n            return;\n        }\n        for(int i = 0;i < n;i++){\n            if(!b[i+1]){\n                a[u] = i+1;\n                b[i+1] = true;\n                fun(u+1);\n                a[u] = 0;\n                b[i+1] = false;\n            }\n        }\n    }\n    public static void main(String[] args) {\n        Scanner s = new Scanner(System.in);\n        n = s.nextInt();\n        Main.fun(0);\n    }\n}",PARTIAL_ACCEPTED,1556,35440
1585838672440061952,b7b4ee87836332d5d9612c029c399e5f037e0d12a018a68ae6dfb287286dc954,2022-10-28 11:39:37,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<algorithm> \n#include<vector>\n#include<cstdio>\nusing namespace std;\nint n,f[10050],a[10050];\n\nvoid dfs(int x)\n{\tif(x>n) \n\t{\tfor(int i=1;i<=n;++i) cout<<a[i]<<\"" \"";\n\t\tcout<<endl;\n\t\treturn ;\n\t}\n\tfor(int i=1;i<=n;++i)\n\t{\tif(f[i]==0)\n\t\t{\tf[i]=1;\n\t\t\ta[x]=i;\n\t\t\tdfs(x+1);\n\t\t\tf[i]=0;\n\t\t}\n\t}\n}\n\nint main()\n{\tcin>>n;\n\tdfs(1);\n\treturn 0;\t\t\t\n}\n",PARTIAL_ACCEPTED,535,3444
1585904361855127552,b7b4ee87836332d5d9612c029c399e5f037e0d12a018a68ae6dfb287286dc954,2022-10-28 16:00:39,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<algorithm> \n#include<vector>\n#include<cstdio>\nusing namespace std;\nint n,f[10050],a[10050];\n\nint main()\n{\tint n,s[12];\n\tcin>>n; \n    for(int i=0;i<n;++i) s[i]=i+1;\n    do\n\t{\tfor(int i=0;i<n;++i) cout<<s[i]<<\"" \"";\n\t\tcout<<endl;\n    }while(next_permutation(s,s+n));\n    return 0;\n } \n",PARTIAL_ACCEPTED,539,3064
1585907233112064000,b7b4ee87836332d5d9612c029c399e5f037e0d12a018a68ae6dfb287286dc954,2022-10-28 16:12:03,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<algorithm> \n#include<vector>\n#include<cstdio>\nusing namespace std;\nint n,f[12],a[12];\n\nvoid dfs(int x)\n{\tif(x>n) \n\t{\tfor(int i=1;i<=n;++i) \n            printf(\""%d \"",a[i]);\n\t\tprintf(\""\\n\"");\n\t\treturn ;\n\t}\n\tfor(int i=1;i<=n;++i)\n\t{\tif(f[i]==0)\n\t\t{\tf[i]=1;\n\t\t\ta[x]=i;\n\t\t\tdfs(x+1);\n\t\t\tf[i]=0;\n\t\t}\n\t}\n}\n\nint main()\n{\tscanf(\""%d\"",&n);\n\tdfs(1);\n\treturn 0;\t\t\t\n}\n",ACCEPTED,283,7160
1585913308775321600,9749edcb0c8720bf2196240c138862fede184ed225a575b6b33acd24fa1f6265,2022-10-28 16:36:12,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n#include<vector>\n#include<algorithm>\n\nvoid test()\n{\n\tvector<int> v;\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tv.push_back(i);\n\t}\n\tdo\n\t{\n\t\tfor (auto v : v)\n\t\t{\n\t\t\tprintf(\""%d \"",v);\n\t\t}\n\t   printf(\""\\n\"");\n\t} while (next_permutation(v.begin(), v.end()));\t\n}\n\nint main()\n{\n\ttest();\n\treturn 0;\n}",ACCEPTED,293,7116
1585914387793580032,9749edcb0c8720bf2196240c138862fede184ed225a575b6b33acd24fa1f6265,2022-10-28 16:40:29,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n#include<vector>\n#include<algorithm>\n\nvoid test()\n{\n    ios::sync_with_stdio(false);\n\tvector<int> v;\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tv.push_back(i);\n\t}\n\tdo\n\t{\n\t\tfor (auto v : v)\n\t\t{\n\t\t\tcout<<v<<\"" \"";\n\t\t}\n\t  cout<<endl;\n\t} while (next_permutation(v.begin(), v.end()));\t\n}\n\nint main()\n{\n\ttest();\n\treturn 0;\n}",PARTIAL_ACCEPTED,551,3244
1585914496493162496,9749edcb0c8720bf2196240c138862fede184ed225a575b6b33acd24fa1f6265,2022-10-28 16:40:55,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n#include<vector>\n#include<algorithm>\n\nvoid test()\n{\n    ios::sync_with_stdio(false);\n    cin.tie(0);\n\tvector<int> v;\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tv.push_back(i);\n\t}\n\tdo\n\t{\n\t\tfor (auto v : v)\n\t\t{\n\t\t\tcout<<v<<\"" \"";\n\t\t}\n\t  cout<<endl;\n\t} while (next_permutation(v.begin(), v.end()));\t\n}\n\nint main()\n{\n\ttest();\n\treturn 0;\n}",PARTIAL_ACCEPTED,525,3640
1585919327437975552,49cc15e2b50f7c9c94d7b626864f5833dfe82745f712c369effe068bcc12ae45,2022-10-28 17:00:07,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n\nconst int N = 20;\nint q[N],st[N],n;\n\nvoid dfs(int u){\n    if(u>n){\n        for (int i = 1; i <= n; i ++ )printf(\""%d\"",q[i]);\n        cout << endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!st[i]){\n            q[u]=i;\n        st[i]=1;\n        dfs(u+1);\n        st[i]=0;\n        }\n    }\n    \n}\n\nint main()\n{\n   \n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}",MULTIPLE_ERROR,547,1784
1585919393145950208,49cc15e2b50f7c9c94d7b626864f5833dfe82745f712c369effe068bcc12ae45,2022-10-28 17:00:22,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n\nconst int N = 20;\nint q[N],st[N],n;\n\nvoid dfs(int u){\n    if(u>n){\n        for (int i = 1; i <= n; i ++ )printf(\""%d \"",q[i]);\n        cout << endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!st[i]){\n            q[u]=i;\n        st[i]=1;\n        dfs(u+1);\n        st[i]=0;\n        }\n    }\n    \n}\n\nint main()\n{\n   \n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,535,3332
1585919490965499904,49cc15e2b50f7c9c94d7b626864f5833dfe82745f712c369effe068bcc12ae45,2022-10-28 17:00:46,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n#include <cstring>\n#include <algorithm>\nusing namespace std;\n\nconst int N = 20;\nint q[N],st[N],n;\n\nvoid dfs(int u){\n    if(u>n){\n        for (int i = 1; i <= n; i ++ )printf(\""%d \"",q[i]);\n        puts(\""\"");\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!st[i]){\n            q[u]=i;\n        st[i]=1;\n        dfs(u+1);\n        st[i]=0;\n        }\n    }\n    \n}\n\nint main()\n{\n   \n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}",ACCEPTED,306,7276
1585923987255193600,9e1b98db80eab40d40c2583863c50e3b98015a3f0c8ff4f9f06606982563f690,2022-10-28 17:18:38,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\nusing namespace std;\nconst int N = 10010;\nint n, t;\nlong long x, y;\nint ans;\nint a[N];\nint mark[N];\nvoid dfs(int x)\n{\n\tif (x == n)\n\t{\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tprintf(\""%d \"",a[i]);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t\treturn;\n\t}\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tif (mark[i] == 0)\n\t\t{\n\t\t\tmark[i] = 1;\n\t\t\ta[x] = i;\n\t\t\tdfs(x + 1);\n\t\t\tmark[i] = 0;\n\t\t}\n\t}\n}\nint main()\n{\n\tcin >> n;\n\tdfs(0);\n}",ACCEPTED,306,7140
1585956585583022080,33a5bd7740a0c2c958e1e8d7c16c5fcc8dc825288a93a13514e48fff2f272a96,2022-10-28 19:28:10,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\nusing namespace std;\nint n, a[30];\nbool vis[30];\nvoid dfs(int pos)\n{\n    if(pos==n)\n    {\n        for(int i = 1; i <= n; i++) cout << a[i] << \"" \"";\n        cout << endl;\n    }\n    for(int i = 1; i <= n; i++)\n    {\n        if(vis[i]) continue;\n        vis[i] = 1;\n        a[pos + 1] = i;\n        dfs(pos + 1);\n        vis[i] = 0;\n    }\n    return;\n}\n \nint main()\n{\n    cin >> n; \n    dfs(0);\n    return 0;\n}",PARTIAL_ACCEPTED,535,2868
1585967175940571136,a163cc4364006c1f13e4ecbf511ae869ea6ab93b2436abbc46ed06fa557efcac,2022-10-28 20:10:15,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nint a[10],b[10];\nvoid def(int step)\n{\n    if(step==n+1)\n    {\n        for(int i=1;i<=n;i++)\n            printf(\""%d \"",a[i]);\n        printf(\""\\n\"");\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(b[i]==0)\n        {\n            a[step]=i;\n            b[i]=1;\n            def(step+1);\n            b[i]=0;\n        }\n    }\n}\nint main()\n{\n    cin>>n;\n    def(1);\n}",ACCEPTED,307,7072
1585977432284721152,2d4cbbe49479d4b497f01d671e439642842a7856f6e30cc93b9b516f6d74e1df,2022-10-28 20:51:00,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        for(int j=1;j<=n;j++)\n        {\n            if(j!=i)\n                for(int k=1;k<=n;k++)\n                {\n                    if(k!=j&&k!=i)\n                        cout<<i<<\"" \""<<j<<\"" \""<<k<<endl;\n                }\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,28,476
1585977525255667712,2d4cbbe49479d4b497f01d671e439642842a7856f6e30cc93b9b516f6d74e1df,2022-10-28 20:51:22,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n        for(int j=1;j<=n;j++)\n        {\n            if(j!=i)\n                for(int k=1;k<=n;k++)\n                {\n                    if(k!=j&&k!=i)\n                        cout<<i<<\"" \""<<j<<\"" \""<<k<<\"" \""<<endl;\n                }\n        }\n    }\n    return 0;\n}\n",WRONG_ANSWER,24,612
1585984585120747520,12a9f42740f42e84af011a63f31b06e43ea88efda9a07f8ef578423e37d0fc53,2022-10-28 21:19:25,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[10];\n    for(int i=0;i<n;i++)\n        a[i]=i+1;\n    do\n    {\n        for(int i=0;i<n;i++)\n            printf(\""%d \"",a[i]);\n        printf(\""\\n\"");\n    }\n    while(next_permutation(a,a+n));\n}",ACCEPTED,262,7140
1585984735935332352,12a9f42740f42e84af011a63f31b06e43ea88efda9a07f8ef578423e37d0fc53,2022-10-28 21:20:01,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[10];\n    for(int i=0;i<n;i++)\n        a[i]=i+1;\n    do\n    {\n        for(int i=0;i<n;i++)\n            printf(\""%d \"",a[i]);\n        cout<<endl;\n    }\n    while(next_permutation(a,a+n));\n}",PARTIAL_ACCEPTED,526,3380
1585984866113945600,12a9f42740f42e84af011a63f31b06e43ea88efda9a07f8ef578423e37d0fc53,2022-10-28 21:20:32,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int a[10];\n    for(int i=0;i<n;i++)\n        a[i]=i+1;\n    do\n    {\n        for(int i=0;i<n;i++)\n            printf(\""%d \"",a[i]);\n        printf(\""\\n\"");\n    }\n    while(next_permutation(a,a+n));\n}",ACCEPTED,247,7056
1585989647754723328,2d4cbbe49479d4b497f01d671e439642842a7856f6e30cc93b9b516f6d74e1df,2022-10-28 21:39:32,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nint N=9;\nint w[N]{};\nint z[N]{};\nvoid P(int m)\n{\n    if(m>n)\n    {\n        for(int i=0;i<n;i++)\n        {\n            cout<<w[i]<<\"" \"";\n        }\n        cout<<endl;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(z[i]==0)\n        {\n            w[m]=i;\n            z[i]=1;\n            P(m+1);\n            w[m]=0;\n            z[i]=0;\n        }\n    }\n}\nint main()\n{\n    int n;\n    cin>>n;\n    P(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1585990392231104512,2d4cbbe49479d4b497f01d671e439642842a7856f6e30cc93b9b516f6d74e1df,2022-10-28 21:42:30,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nconst int N = 9;\nint w[N]{};\nint z[N]{};\nvoid P(int m)\n{\n    if (m > n)\n    {\n        for (int i = 0; i < n; i++)\n        {\n            cout << w[i] << \"" \"";\n        }\n        cout << endl;\n    }\n    for (int i = 1; i <= n; i++)\n    {\n        if (z[i] == 0)\n        {\n            w[m] = i;\n            z[i] = 1;\n            P(m + 1);\n            w[m] = 0;\n            z[i] = 0;\n        }\n    }\n}\nint main()\n{\n    int n;\n    cin >> n;\n    P(1);\n    return 0;\n}",WRONG_ANSWER,21,448
1585991746286645248,2d4cbbe49479d4b497f01d671e439642842a7856f6e30cc93b9b516f6d74e1df,2022-10-28 21:47:53,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nconst int N = 9;\nint w[N]{};\nint z[N]{};\nvoid P(int m)\n{\n    if (m > n)\n    {\n        for (int i = 1; i <= n; i++)\n        {\n            cout << w[i] << \"" \"";\n        }\n        cout << endl;\n        return ;\n    }\n    for (int i = 1; i <= n; i++)\n    {\n        if (z[i] == 0)\n        {\n            w[m] = i;\n            z[i] = 1;\n            P(m + 1);\n            w[m] = 0;\n            z[i] = 0;\n        }\n    }\n}\nint main()\n{\n    int n;\n    cin >> n;\n    P(1);\n    return 0;\n}",WRONG_ANSWER,20,608
1585992123832725504,2d4cbbe49479d4b497f01d671e439642842a7856f6e30cc93b9b516f6d74e1df,2022-10-28 21:49:23,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nconst int N = 9;\nint w[N]{};\nint z[N]{};\nvoid P(int m)\n{\n    if (m > n)\n    {\n        for (int i = 1; i <= n; i++)\n        {\n            cout << w[i] << \"" \"";\n        }\n        cout << endl;\n        return ;\n    }\n    for (int i = 1; i <= n; i++)\n    {\n        if (z[i] == 0)\n        {\n            w[m] = i;\n            z[i] = 1;\n            P(m + 1);\n            w[m] = 0;\n            z[i] = 0;\n        }\n    }\n}\nint main()\n{\n    cin >> n;\n    P(1);\n    return 0;\n}",PARTIAL_ACCEPTED,132,1016
1585992186113945600,2d4cbbe49479d4b497f01d671e439642842a7856f6e30cc93b9b516f6d74e1df,2022-10-28 21:49:38,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nconst int N = 10;\nint w[N]{};\nint z[N]{};\nvoid P(int m)\n{\n    if (m > n)\n    {\n        for (int i = 1; i <= n; i++)\n        {\n            cout << w[i] << \"" \"";\n        }\n        cout << endl;\n        return ;\n    }\n    for (int i = 1; i <= n; i++)\n    {\n        if (z[i] == 0)\n        {\n            w[m] = i;\n            z[i] = 1;\n            P(m + 1);\n            w[m] = 0;\n            z[i] = 0;\n        }\n    }\n}\nint main()\n{\n    cin >> n;\n    P(1);\n    return 0;\n}",PARTIAL_ACCEPTED,531,3272
1585992783458336768,2d4cbbe49479d4b497f01d671e439642842a7856f6e30cc93b9b516f6d74e1df,2022-10-28 21:52:00,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n/**\n * 方法采用\n * 依次枚举每个位置放哪个数\n * \n*/\nint n;\nconst int N = 9;\nint datas[N] = {0};    // 数据状态数组，0表示还没有被选择，1表示被选择了\nint loc[N]   = {0};    // 位置状态数组，0表示还没有被安排，否则表示被安排了\n \nvoid dfs(int m){      // m表示到第几个位置了\n    if(m > n){        // 到深度递归的底部了，输出来并且结束递归\n        for(int i = 1; i <= n;++i)\n            printf(\""%d \"",loc[i]);\n        getchar();\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i = 1; i<= n;++i){    // 依次枚举当前位置可以选择的数据，采用dfs深度递归\n        if(datas[i] == 0){\n            loc[m]   = i;   // 当前位置安排当前未选择的最小的数\n            datas[i] = 1;   // 当前被选中的数的状态变为1\n            dfs(m + 1);\n            // 现场恢复\n            datas[i] = 0;\n            loc[m]   = 0;\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,89,952
1585992950081253376,2d4cbbe49479d4b497f01d671e439642842a7856f6e30cc93b9b516f6d74e1df,2022-10-28 21:52:40,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nconst int N = 9;\nint w[N]{};\nint z[N]{};\nvoid P(int m)\n{\n    if (m >= n)\n    {\n        for (int i = 0; i < n; i++)\n        {\n            cout << w[i] << \"" \"";\n        }\n        cout << endl;\n        return ;\n    }\n    for (int i = 0; i < n; i++)\n    {\n        if (z[i] == 0)\n        {\n            w[m] = i+1;\n            z[i] = 1;\n            P(m + 1);\n            w[m] = 0;\n            z[i] = 0;\n        }\n    }\n}\nint main()\n{\n    cin >> n;\n    P(1);\n    return 0;\n}\n",MULTIPLE_ERROR,528,3432
1585993116649648128,2d4cbbe49479d4b497f01d671e439642842a7856f6e30cc93b9b516f6d74e1df,2022-10-28 21:53:19,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nconst int N = 9;\nint w[N]{};\nint z[N]{};\nvoid P(int m)\n{\n    if (m >= n)\n    {\n        for (int i = 0; i < n; i++)\n        {\n            cout << w[i] << \"" \"";\n        }\n        cout << endl;\n        return ;\n    }\n    for (int i = 0; i < n; i++)\n    {\n        if (z[i] == 0)\n        {\n            w[m] = i+1;\n            z[i] = 1;\n            P(m + 1);\n            w[m] = 0;\n            z[i] = 0;\n        }\n    }\n}\nint main()\n{\n    cin >> n;\n    P(0);\n    return 0;\n}\n",PARTIAL_ACCEPTED,529,3320
1585993944777232384,2d4cbbe49479d4b497f01d671e439642842a7856f6e30cc93b9b516f6d74e1df,2022-10-28 21:56:37,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nconst int N = 9;\nint w[N]{};\nint z[N]{};\nvoid P(int m)\n{\n    if (m >= n)\n    {\n        for (int i = 0; i < n; i++)\n        {\n            cout << w[i] << \"" \"";\n        }\n        cout << endl;\n        return ;\n    }\n    for (int i = 0; i < n; i++)\n    {\n        if (z[i] == 0)\n        {\n            w[m] = i+1;\n            z[i] = 1;\n            P(m + 1);\n            w[m] = 0;\n            z[i] = 0;\n        }\n    }\n}\nint main()\n{\n    cin >> n;\n    P(0);\n    return 0;\n}\n",PARTIAL_ACCEPTED,540,3168
1585994086112686080,2d4cbbe49479d4b497f01d671e439642842a7856f6e30cc93b9b516f6d74e1df,2022-10-28 21:57:11,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\n \nint num[1000];\nint a;\nvoid f(int b,int c){\n    if(b==a){\n        for(int i=0;i<a;i++){\n            printf(\""%d \"",num[i]);\n        }\n        printf(\""\\n\"");\n        return;\n    }\n    else{\n        for(int i = 1;i<=a;i++){\n            if (!((c>>i)&1)){\n                num[b++]=i;\n                f(b,c|1<<i);\n                b--;\n            }\n        }\n    }\n}\nint main(){\n    scanf(\""%d\"",&a);\n    f(0,0);\n    return 0;\n}",ACCEPTED,327,6908
1586009942406332416,fc5ea4bc7f0a6f34a3e32b3a70433914e1953bc3d9af7688812dc2ddaaba1c85,2022-10-28 23:00:11,C,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint n;\nint stu[10];\nvoid digui(int a,int s)\n{\n    if(s==n)\n    {\n        for(int i=0;i<n;i++)\n        printf(\""%d \"",stu[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    int i,j;\n    for(i=1;i<=n;i++)\n    {\n        for(j=0;j<s;j++)\n            if(stu[j]==i)//如果i已经在stu[0]~stu[u-1]出现过，则不能再选\n                break;\n        if(j==s)\n        {\n            stu[s]=i;\n            digui(i,s+1);\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    digui(1,0);\n    return 0;\n}",ACCEPTED,333,6960
1586010081611087872,fc5ea4bc7f0a6f34a3e32b3a70433914e1953bc3d9af7688812dc2ddaaba1c85,2022-10-28 23:00:44,C,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint n;\nint stu[10];\nvoid digui(int a,int s)\n{\n    if(s==n)//递归边界\n    {\n        for(int i=0;i<n;i++)\n        printf(\""%d \"",stu[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    int i,j;\n    for(i=1;i<=n;i++)//尝试在stu[a]中填写各种整数i\n    {\n        for(j=0;j<s;j++)\n            if(stu[j]==i)//如果i已经在stu[0]~stu[u-1]出现过，则不能再选\n                break;\n        if(j==s)\n        {\n            stu[s]=i;\n            digui(i,s+1);\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    digui(1,0);\n    return 0;\n}",ACCEPTED,324,7072
1586010429075615744,17892b52780d7122e33471b11bfdd39dd12e85533cf2c21a898692e2c32345d9,2022-10-28 23:02:07,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nint path[10];//存放当前排列结果 \nint flag[10];//标记每个数字是否被用过 \nint dfs(int t)//深度遍历 形成遍历树 \n{\n\tif(t>n)//t为当前层数 每一次遍历完后进行输出 \n\t\t{\n\t\t\tfor(int i=1;i<=n;i++)\n\t\t\t{\n\t\t\t\tprintf(\""%d \"",path[i]);\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\telse\n\t{\n\t\tfor(int i=1;i<=n;i++)//从1开始遍历 \n\t\t{\n\t\t\tif(!flag[i])\n\t\t\t{\n\t\t\t\tpath[t]=i;//给当前层赋值 \n\t\t\t\tflag[i]=1;\n\t\t\t\tdfs(t+1);//进入下一层 \n\t\t\t\tflag[i]=0;//回溯 撤销标记 \n\t\t\t}\n\t\t}\n\t}\n } \nint main() \n{\n\tscanf(\""%d\"",&n);\n\tdfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,530,3348
1586010626358898688,17892b52780d7122e33471b11bfdd39dd12e85533cf2c21a898692e2c32345d9,2022-10-28 23:02:54,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nint path[10];//存放当前排列结果 \nint flag[10];//标记每个数字是否被用过 \nint dfs(int t)//深度遍历 形成遍历树 \n{\n\tif(t>n)//t为当前层数 每一次遍历完后进行输出 \n\t\t{\n\t\t\tfor(int i=1;i<=n;i++)\n\t\t\t{\n\t\t\t\tprintf(\""%d \"",path[i]);\n\t\t\t}\n\t\t\tprintf(\""\\n\"");\n\t\t}\n\telse\n\t{\n\t\tfor(int i=1;i<=n;i++)//从1开始遍历 \n\t\t{\n\t\t\tif(!flag[i])\n\t\t\t{\n\t\t\t\tpath[t]=i;//给当前层赋值 \n\t\t\t\tflag[i]=1;\n\t\t\t\tdfs(t+1);//进入下一层 \n\t\t\t\tflag[i]=0;//回溯 撤销标记 \n\t\t\t}\n\t\t}\n\t}\n } \nint main() \n{\n\tscanf(\""%d\"",&n);\n\tdfs(1);\n    return 0;\n}",ACCEPTED,288,7024
1586235718342938624,be80ae9ddd61c69d0959f928d1537cdfbcaf810790b443cb63701cb4e101bba8,2022-10-29 13:57:20,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,#include<iostream>\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    for(int i=1;i<=n;i++)\n    {\n    \tfor(int j=1;j<=n;j++)\n    \t{\n    \t\tif(i!=j)\n    \t\t{\n    \t\t\tfor(int l=1;l<=n;l++)\n\t\t\t\t{\n\t\t\t\t\tif(l!=i&&l!=j)\n\t\t\t\t\t{\n\t\t\t\t\t\tcout<<i<<' '<<j<<' '<<l<<' '<<endl;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n    \n\treturn 0;\n},WRONG_ANSWER,24,584
1586236395353931776,be80ae9ddd61c69d0959f928d1537cdfbcaf810790b443cb63701cb4e101bba8,2022-10-29 14:00:02,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<algorithm>\n#include<cstring>\n \nusing namespace std;\n \nconst int N = 10;\nint n;\nint path[N];\nbool st[N];\n \nvoid dfs(int a){\n    //当枚举完n个数以后遍历输出即可  \n    if(a > n){\n        for(int i = 1;i <= n;i++){\n            cout<<path[i]<<\"" \"";\n        }\n    cout << endl;\n    }\n    else\n    {\n        for(int i = 1;i <= n;i++){\n            if(!st[i]){\n                //当前状态是没用过这个数\n                path[a] = i;\n                st[i] = true;\n                dfs(a + 1);\n                //恢复现场\n                st[i] = false;\n                path[a] = 0;\n            }\n        }\n    }\n}\nint main(){\n    cin >> n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,509,4596
1586250050107740160,7e9de7e4f97383d4f313e34751fcefed4ef85cd56ab322844d2ddd25c1f2e154,2022-10-29 14:54:17,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n#include<stdio.h>\n\nint n;\nconst int maxn=13;\nint p[maxn];\nbool l[maxn]={false};\nvoid pailie(int x);\nint main()\n{\n\tcin>>n;\n\tpailie(1);\n\treturn 0;\n    \n}\nvoid pailie(int x)\n{\n\tif(x==n+1)\n\t{\n\t\tfor(int i=1;i<=n;i++)\n\t\t{\n\t\t\tcout<<p[i]<<\"" \"";\n\t\t}\n\t\tcout<<endl;\n\t}\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tif(l[i]==false)\n\t\t{\n\t\t\tp[x]=i;\n\t\t\tl[i]=true;\n\t\t\tpailie( x+1);\n\t\t\tl[i]=false;\n\t\t}\n\t}\n}",PARTIAL_ACCEPTED,518,4364
1586256581524066304,81fc8119d0c744bd40c25bf581d8eec704a833434971c7118ee2b69f375dd22c,2022-10-29 15:20:14,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <bits/stdc++.h>\nusing namespace std;\n\nint a[10], N;\nbool tp[10];\n\nvoid dfs(int step)\n{\n    if(step ==N){\n        for(int i= 0; i < N; i++){\n            cout << a[i] << \"" \"";\n        }\n        cout << endl;\n        return ;\n    }\n    for(int i = 1; i <= N; i++){\n        if(!tp[i]){\n            tp[i] = 1;\n            a[step] = i;\n            dfs(step+1);\n            tp[i] = 0;\n        }\n    }\n}\n\nint main()\n{\n    cin >> N;\n    dfs(0);\n}",PARTIAL_ACCEPTED,517,4416
1586256755507990528,81fc8119d0c744bd40c25bf581d8eec704a833434971c7118ee2b69f375dd22c,2022-10-29 15:20:56,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <bits/stdc++.h>\nusing namespace std;\n\nint a[10], N;\nbool tp[10];\n\nvoid dfs(int step)\n{\n    if(step ==N){\n        for(int i= 0; i < N; i++){\n            printf(\""%d \"", a[i]);\n        }\n        cout << endl;\n        return ;\n    }\n    for(int i = 1; i <= N; i++){\n        if(!tp[i]){\n            tp[i] = 1;\n            a[step] = i;\n            dfs(step+1);\n            tp[i] = 0;\n        }\n    }\n}\n\nint main()\n{\n    scanf(\""%d\"", &N);\n    dfs(0);\n}",PARTIAL_ACCEPTED,504,4456
1586259156923187200,81fc8119d0c744bd40c25bf581d8eec704a833434971c7118ee2b69f375dd22c,2022-10-29 15:30:28,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <bits/stdc++.h>\nusing namespace std;\n/*\nint a[10], N;\nbool tp[10];\n\nvoid dfs(int step)\n{\n    if(step ==N){\n        for(int i= 0; i < N; i++){\n            printf(\""%d \"", a[i]);\n        }\n        cout << endl;\n        return ;\n    }\n    for(int i = 1; i <= N; i++){\n        if(!tp[i]){\n            tp[i] = 1;\n            a[step] = i;\n            dfs(step+1);\n            tp[i] = 0;\n        }\n    }\n}*/\n\nint main()\n{\n    int N, a[10];\n    scanf(\""%d\"", &N);\n    for(int i = 0; i < N; i++) a[i] = i+1;\n    do{\n        for(int i = 0; i < N; i++)\n            cout << a[i] << \"" \"";\n        cout << endl;\n    }while(next_permutation(a,a+N));\n}",PARTIAL_ACCEPTED,504,4696
1586259412758953984,81fc8119d0c744bd40c25bf581d8eec704a833434971c7118ee2b69f375dd22c,2022-10-29 15:31:29,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <bits/stdc++.h>\nusing namespace std;\n/*\nint a[10], N;\nbool tp[10];\n\nvoid dfs(int step)\n{\n    if(step ==N){\n        for(int i= 0; i < N; i++){\n            printf(\""%d \"", a[i]);\n        }\n        cout << endl;\n        return ;\n    }\n    for(int i = 1; i <= N; i++){\n        if(!tp[i]){\n            tp[i] = 1;\n            a[step] = i;\n            dfs(step+1);\n            tp[i] = 0;\n        }\n    }\n}*/\n\nint main()\n{\n    int N, a[10];\n    scanf(\""%d\"", &N);\n    for(int i = 0; i < N; i++) a[i] = i+1;\n    do{\n        for(int i = 0; i < N; i++)\n            printf(\""%d \"", a[i]);\n        printf(\""\\n\"");\n    }while(next_permutation(a,a+N));\n}",ACCEPTED,307,7172
1586267808425967616,e8958737a818c58bdb886570eb2206ab1ca9c2b619feb9b653c44b560d698229,2022-10-29 16:04:51,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n,m,a[20],book[20];\nvoid dfs(int step)\n{\n    if(step==m)\n    {\n        for(int i=0;i<step;i++)\n            cout<<a[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!book[i]&&i>a[step-1])\n        {\n            a[step]=i;\n            book[i]=1;\n            dfs(step+1);\n            book[i]=0;\n        }\n    }\n}\nint main()\n{\n    cin>>n>>m;\n    dfs(0);\n    return 0;\n}\n",WRONG_ANSWER,51,640
1586268594467897344,3f03dc9e3f42fe0e0c1a47397752b1b2b9b39fa44f31bdbead75c8ee570949f3,2022-10-29 16:07:59,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"/*#include<stdio.h>\nvoid swap(int *a,int *b)\n{\n\tint t;\n\tt=*a;\n\t*a=*b;\n\t*b=t;\n}\nint perm(int *a,int p,int q)\n{ \nif(p==q)\n{\n\tfor(int i=0;i<q;i++)\nprintf(\""%d \"",a[i]);\nprintf(\""\\n\"");\n\treturn 0;\n}\nelse\n{\n\tfor(int i=p;i<q;i++)\n{\n\tswap(&a[i],&a[p]);\n     perm(a,p+1,q);\n\tswap(&a[i],&a[p]);\n}\n   \n}\n return 0;\n}\n\nint main()\n{\n    int n;\n   scanf(\""%d\"",&n);\n    int a[n];\n    for(int i=1;i<=n;i++)\n    { \n     a[i-1]=i;\n    }\n    perm(a,0,n);\n}*/\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nint n;\nint arr[30];\nbool vis[30];\nint dfs(int cur)\n{\n    if(cur == n + 1) \n    {\n        for(int i = 1; i <= n; i++) \n            cout << arr[i] << \"" \"";\n        puts(\""\"");\n        return 0;\n    }\n    for(int i = 1; i <= n; i++) \n    {\n        if(vis[i]) \n            continue;\n        arr[cur] = i;\n        vis[i] = true;\n        dfs(cur + 1);\n        vis[i] = false; \n    }\n}\nint main()\n{\n    cin >> n;\n    dfs(1);\n    return 0;\n}\n",ACCEPTED,351,7100
1586268607927414784,e8958737a818c58bdb886570eb2206ab1ca9c2b619feb9b653c44b560d698229,2022-10-29 16:08:02,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nconst int N=10;\nint  st[N],used[N];\nvoid dfs(int u)\n{\n    if(u>(n-1))\n    {\n        for(int i=0;i<n;i++) cout<<st[i]<<' ';\n        cout<<endl;\n        return ;\n        \n    }\n    for(int i=0;i<n;i++)\n    {\n        if(!used[i])\n        {\n        st[u]=i+1;\n        used[i]=true;\n        dfs(u+1);\n        st[u]=0;\n        used[i]=false;\n        }\n    }\n}\nint main()\n{\n    cin>>n;\n    dfs(0);\n}",PARTIAL_ACCEPTED,527,4320
1586268730145247232,e8958737a818c58bdb886570eb2206ab1ca9c2b619feb9b653c44b560d698229,2022-10-29 16:08:31,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nconst int N=10;\nint  st[N],used[N];\nvoid dfs(int u)\n{\n    if(u>(n-1))\n    {\n        for(int i=0;i<n;i++) cout<<st[i]<<' ';\n        cout<<endl;\n        return ;\n        \n    }\n    for(int i=0;i<n;i++)\n    {\n        if(!used[i])\n        {\n        st[u]=i+1;\n        used[i]=true;\n        dfs(u+1);\n        st[u]=0;\n        used[i]=false;\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(0);\n}",PARTIAL_ACCEPTED,520,4348
1586268936861511680,e8958737a818c58bdb886570eb2206ab1ca9c2b619feb9b653c44b560d698229,2022-10-29 16:09:20,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nconst int N=10;\nint  st[N],used[N];\nvoid dfs(int u)\n{\n    if(u>(n-1))\n    {\n        for(int i=0;i<n;i++)printf(\""%d \"",st[i]);\n        printf('\\n');\n        return ;\n        \n    }\n    for(int i=0;i<n;i++)\n    {\n        if(!used[i])\n        {\n        st[u]=i+1;\n        used[i]=true;\n        dfs(u+1);\n        st[u]=0;\n        used[i]=false;\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(0);\n}",COMPILE_ERROR,0,0
1586269083200778240,e8958737a818c58bdb886570eb2206ab1ca9c2b619feb9b653c44b560d698229,2022-10-29 16:09:55,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nconst int N=10;\nint  st[N],used[N];\nvoid dfs(int u)\n{\n    if(u>(n-1))\n    {\n        for(int i=0;i<n;i++)printf(\""%d \"",st[i]);\n        printf(\""\\n\"");\n        return ;\n        \n    }\n    for(int i=0;i<n;i++)\n    {\n        if(!used[i])\n        {\n        st[u]=i+1;\n        used[i]=true;\n        dfs(u+1);\n        st[u]=0;\n        used[i]=false;\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(0);\n}",ACCEPTED,323,7104
1586270246730072064,15a73d63a21c572fd9a00e3f4fa4f38f9d02d874f0da969c7330fe4291b816a7,2022-10-29 16:14:32,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\n\nint n;\nconst int N=10;\nint st[N], used[N];\n\nvoid dfs(int u)\n{\n    if(u>(n-1))\n    {\n        for(int i=0;i<n;i++)\n            cout<<st[i]<<' ';\n        cout<<endl;\n        return ;\n        \n    }\n    for(int i=0;i<n;i++)\n    {\n        if(!used[i])\n        {\n        st[u]=i+1;\n        used[i]=true;\n        dfs(u+1);\n        st[u]=0;\n        used[i]=false;\n        }\n    }\n}\n\nint main()\n{\n    cin>>n;\n    dfs(0);\n}",PARTIAL_ACCEPTED,546,4316
1586270467321098240,831d001845101d905447f1f5c150c06a0c1423e2ea19b3d15c45c76ce91ae8a1,2022-10-29 16:15:25,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n \nconst int N=9;\nint n;\nint array[N];\nbool used[N];\n \nvoid dfs(int u){\n    if(u>n){\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){ \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,121,1368
1586270874478972928,15a73d63a21c572fd9a00e3f4fa4f38f9d02d874f0da969c7330fe4291b816a7,2022-10-29 16:17:02,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n#include <cstring>\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 10;\n\nint n;\nbool st[N];\nint path[N];\n\nvoid dfs(int u)\n{\n    if (u > n)\n    {\n        for (int i = 1; i <= n; i ++ )\n            printf(\""%d \"", path[i]);\n        puts(\""\"");\n    }\n    else\n    {\n        for (int i = 1; i <= n; i ++ )\n            if (!st[i])\n            {\n                path[u] = i;\n                st[i] = true;\n                dfs(u + 1);\n                st[i] = false;\n                path[u] = 0;\n            }\n    }\n}\n\nint main()\n{\n    scanf(\""%d\"", &n);\n    dfs(1);\n    return 0;\n}",ACCEPTED,326,7120
1586273350120771584,9749edcb0c8720bf2196240c138862fede184ed225a575b6b33acd24fa1f6265,2022-10-29 16:26:52,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n#include<vector>\n#include<algorithm>\n\nvoid test()\n{\n\tvector<int> v;\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tv.push_back(i);\n\t}\n\tdo\n\t{\n\t\tfor (auto v : v)\n\t\t{\n\t\t\tprintf(\""%d \"",v);\n\t\t}\n\t  cout<<endl;\n\t} while (next_permutation(v.begin(), v.end()));\t\n}\n\nint main()\n{\n\ttest();\n\treturn 0;\n}",PARTIAL_ACCEPTED,513,4564
1586273432522063872,9749edcb0c8720bf2196240c138862fede184ed225a575b6b33acd24fa1f6265,2022-10-29 16:27:12,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n#include<vector>\n#include<algorithm>\n\nvoid test()\n{\n\tvector<int> v;\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tv.push_back(i);\n\t}\n\tdo\n\t{\n\t\tfor (auto v : v)\n\t\t{\n\t\t\tprintf(\""%d \"",v);\n\t\t}\n\t printf(\""\\n\"");\n\t} while (next_permutation(v.begin(), v.end()));\t\n}\n\nint main()\n{\n\ttest();\n\treturn 0;\n}",ACCEPTED,308,7160
1586279002020900864,7527d5484cdc2f01a084d885327d80d43d884d28d819e3b686b4439756ea03fc,2022-10-29 16:49:20,C++,2.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nvoid perm(int num[],int s,int e)\n{\n    if(s==e)\n    {\n        for(int i=0;i<=e;i++)\n            cout<<num[i]<<\"" \"";\n        cout<<endl;\n        return ;\n    }\n    for(int i=s;i<=e;i++)\n    { \n        swap(num[i],num[s]);\n        perm(num,s+1,e);\n        swap(num[i],num[s]);\n        \n    }\n    \n    return ;\n    \n}\nint main()\n{\n    int n;\n    cin>>n;\n    int num[n];\n    for(int i=0;i<n;i++)\n        num[i]=i+1;\n    perm(num,0,n-1);\n    return 0;\n}",PARTIAL_ACCEPTED,545,4276
1586280148642959360,7527d5484cdc2f01a084d885327d80d43d884d28d819e3b686b4439756ea03fc,2022-10-29 16:53:53,C++,2.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nvoid perm(int num[],int s,int e)\n{\n    if(s==e)\n    {\n        for(int i=0;i<=e;i++)\n            printf(\""%d \"",num[i]);\n      printf(\""\\n\"");\n        return ;\n    }\n    for(int i=s;i<=e;i++)\n    { \n        swap(num[i],num[s]);\n        perm(num,s+1,e);\n        swap(num[i],num[s]);\n        \n    }\n    \n    return ;\n    \n}\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    int num[n];\n    for(int i=0;i<n;i++)\n        num[i]=i+1;\n    perm(num,0,n-1);\n    return 0;\n}",PARTIAL_ACCEPTED,311,7104
1586280983183626240,3f03dc9e3f42fe0e0c1a47397752b1b2b9b39fa44f31bdbead75c8ee570949f3,2022-10-29 16:57:12,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <bits/stdc++.h>\nusing namespace std;\nint n;\nint a[100];\nbool v[100];\nint perm(int c)\n{\n    if(c == n + 1) \n    {\n        for(int i = 1; i <= n; i++) \n            cout << a[i] << \"" \"";\n        puts(\""\"");\n        return 0;\n    }\n    for(int i = 1; i <= n; i++) \n    {\n        if(v[i]) \n            continue;\n        a[cur] = i;\n        v[i] = 1;\n       perm(c + 1);\n        v[i] = 0; \n    }\n}\nint main()\n{int a,b;\n    cin >> n;\n   perm(1);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1586281030151438336,3f03dc9e3f42fe0e0c1a47397752b1b2b9b39fa44f31bdbead75c8ee570949f3,2022-10-29 16:57:23,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <bits/stdc++.h>\nusing namespace std;\nint n;\nint a[100];\nbool v[100];\nint perm(int c)\n{\n    if(c == n + 1) \n    {\n        for(int i = 1; i <= n; i++) \n            cout << a[i] << \"" \"";\n        puts(\""\"");\n        return 0;\n    }\n    for(int i = 1; i <= n; i++) \n    {\n        if(v[i]) \n            continue;\n        a[c] = i;\n        v[i] = 1;\n       perm(c + 1);\n        v[i] = 0; \n    }\n}\nint main()\n{int a,b;\n    cin >> n;\n   perm(1);\n    return 0;\n}\n",ACCEPTED,335,7160
1586281094831796224,3f03dc9e3f42fe0e0c1a47397752b1b2b9b39fa44f31bdbead75c8ee570949f3,2022-10-29 16:57:39,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <bits/stdc++.h>\nusing namespace std;\nint n;\nint a[100];\nbool v[100];\nint perm(int c)\n{\n    if(c == n + 1) \n    {\n        for(int i = 1; i <= n; i++) \n            cout << a[i] << \"" \"";\n        puts(\""\"");\n        return 0;\n    }\n    for(int i = 1; i <= n; i++) \n    {\n        if(v[i]) \n            continue;\n        a[c] = i;\n        v[i] = 1;\n       perm(c + 1);\n        v[i] = 0; \n    }\n}\nint main()\n{int a,b;\n    cin >> n;\n   perm(1);\n    return 0;\n}\n",ACCEPTED,343,7080
1586304545638453248,debc7deccadcae4cb4b418482504c3e0ffa0a47c6c63265d521af152b8039d58,2022-10-29 18:30:50,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint a[10],n;\nint jiecheng(int m)\n{\n\tint sum=1;\n\tfor(int i=m;i>0;i--)\n\tsum*=i;\n\treturn sum;\n}\nvoid zidian()\n{\n\tint b,flag=1;\n\tfor(int i=n-1;i>0&&flag;i--)\n\t{\n\t\tif(a[i]<a[i+1])\n\t\t{\n\t\t\tfor(int j=n;j>i&&flag;j--)\n\t\t\t{\n\t\t\t\tif(a[j]>a[i])\n\t\t\t\t{\n\t\t\t\t\tb=a[j];\n\t\t\t\t\ta[j]=a[i];\n\t\t\t\t\ta[i]=b;\n\t\t\t\t\tflag=0;\n\t\t\t\t\tsort(a+i+1,a+n+1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\nint main()\n{\n\tscanf(\""%d\"",&n);\n\tfor(int i=1;i<=n;i++) \n\t{\n\t\ta[i]=i;\n\t\tprintf(\""%d \"",a[i]);\n\t}\n\tcout<<endl;\n\tfor(int i=1;i<jiecheng(n);i++)\n\t{\n\t\tzidian();\n\t\tfor(int i=1;i<=n;i++) \n\t\t    printf(\""%d \"",a[i]);\n\t    printf(\""\\n\"");\n\t}\n}",ACCEPTED,310,7224
1586321024874319872,a3c07fb43e95870c64433b57d5e2a6a0348128f569148870b7f8e6cd0d6c2612,2022-10-29 19:36:19,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n \nconst int N=9;\nint n;\nint array[N];\nbool used[N];\n \nvoid dfs(int u)\n{\n    if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1586321163571556352,a3c07fb43e95870c64433b57d5e2a6a0348128f569148870b7f8e6cd0d6c2612,2022-10-29 19:36:52,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\n \nconst int N=9;\nint n;\nint array[N];\nbool used[N];\n \nvoid dfs(int u)\n{\n    if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1586322663517581312,caa88662e03b178ae6082c0c36314eda5d5bf6fa8980773b16f18444afa8ba02,2022-10-29 19:42:50,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nconst int N=10;\nint  st[N],used[N];\nvoid dfs(int u)\n{\n    if(u>(n-1))\n    {\n        for(int i=0;i<n;i++) cout<<st[i]<<' ';\n        cout<<endl;\n        return ;\n        \n    }\n    for(int i=0;i<n;i++)\n    {\n        if(!used[i])\n        {\n        st[u]=i+1;\n        used[i]=true;\n        dfs(u+1);\n        st[u]=0;\n        used[i]=false;\n        }\n    }\n}\nint main()\n{\n    cin>>n;\n    dfs(0);\n}",PARTIAL_ACCEPTED,535,4320
1586324979536752640,a3c07fb43e95870c64433b57d5e2a6a0348128f569148870b7f8e6cd0d6c2612,2022-10-29 19:52:02,C,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint a[10],book[10]={0};\nint n;\nvoid dfs(int x)\n{\n\tint i;\n\tif(x>n)\n\t{\n\t\tfor(i=1;i<=n;i++)\n\t\t\tprintf(\""%d \"",a[i]);\n\t\tprintf(\""\\n\"");\n\t\treturn;\n\t}\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(!book[i])\n\t\t{\n\t\t\tbook[i]=1;a[x]=i;\n\t\t\tdfs(x+1);\n\t\t\tbook[i]=0;\n\t\t}\n\t}\n}\nint main()\n{\n\tint i;\n\twhile(scanf(\""%d\"",&n)!=EOF)\n\t{\n\t\tdfs(1);\n\t}\n\treturn 0;\n}",ACCEPTED,311,7040
1586325359997878272,a3c07fb43e95870c64433b57d5e2a6a0348128f569148870b7f8e6cd0d6c2612,2022-10-29 19:53:32,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint a[10],book[10]={0};\nint n;\nvoid dfs(int x)\n{\n\tint i;\n\tif(x>n)\n\t{\n\t\tfor(i=1;i<=n;i++)\n\t\t\tprintf(\""%d \"",a[i]);\n\t\tprintf(\""\\n\"");\n\t\treturn;\n\t}\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(!book[i])\n\t\t{\n\t\t\tbook[i]=1;a[x]=i;\n\t\t\tdfs(x+1);\n\t\t\tbook[i]=0;\n\t\t}\n\t}\n}\nint main()\n{\n\tint i;\n\t\tdfs(1);\n\treturn 0;\n}",WRONG_ANSWER,36,352
1586325522879483904,a3c07fb43e95870c64433b57d5e2a6a0348128f569148870b7f8e6cd0d6c2612,2022-10-29 19:54:11,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint a[10],book[10]={0};\nint n;\nvoid dfs(int x)\n{\n\tint i;\n\tif(x>n)\n\t{\n\t\tfor(i=1;i<=n;i++)\n\t\t\tprintf(\""%d \"",a[i]);\n\t\tprintf(\""\\n\"");\n\t\treturn;\n\t}\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(!book[i])\n\t\t{\n\t\t\tbook[i]=1;a[x]=i;\n\t\t\tdfs(x+1);\n\t\t\tbook[i]=0;\n\t\t}\n\t}\n}\nint main()\n{\n\tint i;\n    while(scanf(\""%d\"",i)!=EOF)\n\t\tdfs(1);\n\treturn 0;\n}",SEGMENTATION_FAULT,43,488
1586325615917531136,a3c07fb43e95870c64433b57d5e2a6a0348128f569148870b7f8e6cd0d6c2612,2022-10-29 19:54:33,C,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint a[10],book[10]={0};\nint n;\nvoid dfs(int x)\n{\n\tint i;\n\tif(x>n)\n\t{\n\t\tfor(i=1;i<=n;i++)\n\t\t\tprintf(\""%d \"",a[i]);\n\t\tprintf(\""\\n\"");\n\t\treturn;\n\t}\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(!book[i])\n\t\t{\n\t\t\tbook[i]=1;a[x]=i;\n\t\t\tdfs(x+1);\n\t\t\tbook[i]=0;\n\t\t}\n\t}\n}\nint main()\n{\n\tint i;\n   \twhile(scanf(\""%d\"",&n)!=EOF)\n\t{\n\t\tdfs(1);\n\t}\n    return 0;\n}",ACCEPTED,320,7040
1586355612887674880,7527d5484cdc2f01a084d885327d80d43d884d28d819e3b686b4439756ea03fc,2022-10-29 21:53:45,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n#define N 10\nint n;\nint p[N];\nbool st[N];\nvoid perm(int x)\n{\n    if(x>n)\n    {\n        for(int i=1;i<=n;i++)\n        {\n            printf(\""%d \"",p[i]);\n        }\n        printf(\""\\n\"");\n        return ;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!st[i])\n        {\n            st[i]=true;\n            p[x]=i;\n            perm(x+1);\n            st[i]=false;\n        }\n    }\n    return ;\n}\nint main()\n{\n   \n    scanf(\""%d\"",&n);\n    perm(1);\n    return 0;\n}",ACCEPTED,319,7108
1586357429482684416,65ef894138ac9cccf028497062e090d83ce28ad4cc4954bf04037658ed33597a,2022-10-29 22:00:58,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nvoid test()\n{\n\tvector<int> v;\n\tint n;\n\tscanf(\""%d\"",&n);\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t\tv.push_back(i);\n\t}\n\tdo\n\t{\n\t\tfor (auto v : v)\n\t\t{\n\t\t\tprintf(\""%d \"",v);\n\t\t}\n\t printf(\""\\n\"");\n\t} while (next_permutation(v.begin(), v.end()));\t\n}\n\nint main()\n{\n\ttest();\n\treturn 0;\n}",ACCEPTED,366,7112
1586368641142493184,99a5e9becaf70f382ff3f23713e4d96b4fac6457e8172b837b3c17b42c519516,2022-10-29 22:45:32,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N=9;\nint n;//输入多少个数据\nint array[N];//定义输出数组\nbool used[N];//判断该值是否被使用过\n void dfs(int u)\n {\n    if(u>n)\n    {//如果所有位置都满了，就输出数组\n        for(int i=1;i<=n;i++)\n        cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { //如果这个数没有被用过 false\n           array[u]=i;//在数组的第u个位置插入\n           used[i]=true;//将该数设置为已使用\n           dfs(u+1);//开始选下一个位置的数字\n            //初始化\n            array[u]=0;\n            used[i]=false;\n        } \n        \n    }\n    \n}\nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,115,956
1586368715092267008,99a5e9becaf70f382ff3f23713e4d96b4fac6457e8172b837b3c17b42c519516,2022-10-29 22:45:49,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N=20;\nint n;//输入多少个数据\nint array[N];//定义输出数组\nbool used[N];//判断该值是否被使用过\n void dfs(int u)\n {\n    if(u>n)\n    {//如果所有位置都满了，就输出数组\n        for(int i=1;i<=n;i++)\n        cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { //如果这个数没有被用过 false\n           array[u]=i;//在数组的第u个位置插入\n           used[i]=true;//将该数设置为已使用\n           dfs(u+1);//开始选下一个位置的数字\n            //初始化\n            array[u]=0;\n            used[i]=false;\n        } \n        \n    }\n    \n}\nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,523,4436
1586368774479417344,99a5e9becaf70f382ff3f23713e4d96b4fac6457e8172b837b3c17b42c519516,2022-10-29 22:46:03,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N=50;\nint n;//输入多少个数据\nint array[N];//定义输出数组\nbool used[N];//判断该值是否被使用过\n void dfs(int u)\n {\n    if(u>n)\n    {//如果所有位置都满了，就输出数组\n        for(int i=1;i<=n;i++)\n        cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { //如果这个数没有被用过 false\n           array[u]=i;//在数组的第u个位置插入\n           used[i]=true;//将该数设置为已使用\n           dfs(u+1);//开始选下一个位置的数字\n            //初始化\n            array[u]=0;\n            used[i]=false;\n        } \n        \n    }\n    \n}\nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,513,4660
1586369552350842880,99a5e9becaf70f382ff3f23713e4d96b4fac6457e8172b837b3c17b42c519516,2022-10-29 22:49:09,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N=50;\nint n;//输入多少个数据\nint array[N];//定义输出数组\nbool used[N];//判断该值是否被使用过\n void dfs(int u)\n {\n    if(u>n)\n    {//如果所有位置都满了，就输出数组\n        for(int i=1;i<=n;i++)\n        printf(\""%d \"",array[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { //如果这个数没有被用过 false\n           array[u]=i;//在数组的第u个位置插入\n           used[i]=true;//将该数设置为已使用\n           dfs(u+1);//开始选下一个位置的数字\n            //初始化\n            array[u]=0;\n            used[i]=false;\n        } \n        \n    }\n    \n}\nint main(){\n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}",ACCEPTED,308,7104
1586372431753113600,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-29 23:00:35,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint n;\nint a[10],sign[10];\nvoid dfs(int x)\n{\n    if(x==n+1)  //到达最后一个数字\n    {\n        for(int i=1;i<=n;i++)\n            printf(\""%d \"",a[i]);\n        printf(\""\\n\"");\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!sign[i])\n        {\n            a[x]=i;\n            sign[i]=1;\n            dfs(x+1);\n            sign[i]=0;\n        }\n    }\n}\nint main()\n{\n    int n;\n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}",WRONG_ANSWER,24,344
1586376171361009664,e2df969045abe2f7df233591a60ee94a911f5542739f15af24c38bcc7fc077e5,2022-10-29 23:15:27,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nconst int N=10;\nint  st[N],used[N];\nvoid dfs(int u)\n{\n    if(u>(n-1))\n    {\n        for(int i=0;i<n;i++)printf(\""%d \"",st[i]);\n        printf(\""\\n\"");\n        return ;\n        \n    }\n    for(int i=0;i<n;i++)\n    {\n        if(!used[i])\n        {\n        st[u]=i+1;\n        used[i]=true;\n        dfs(u+1);\n        st[u]=0;\n        used[i]=false;\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(0);\n}",ACCEPTED,314,7160
1586383586647207936,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-29 23:44:55,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n/**\n * 方法采用\n * 依次枚举每个位置放哪个数\n * \n*/\nint n;\nconst int N = 9;\nint datas[N] = {0};    // 数据状态数组，0表示还没有被选择，1表示被选择了\nint loc[N]   = {0};    // 位置状态数组，0表示还没有被安排，否则表示被安排了\n \nvoid dfs(int m){      // m表示到第几个位置了\n    if(m > n){        // 到深度递归的底部了，输出来并且结束递归\n        for(int i = 1; i <= n;++i)\n            printf(\""%d \"",loc[i]);\n        getchar();\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i = 1; i<= n;++i){    // 依次枚举当前位置可以选择的数据，采用dfs深度递归\n        if(datas[i] == 0){\n            loc[m]   = i;   // 当前位置安排当前未选择的最小的数\n            datas[i] = 1;   // 当前被选中的数的状态变为1\n            dfs(m + 1);\n            // 现场恢复\n            datas[i] = 0;\n            loc[m]   = 0;\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1586383803836661760,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-29 23:45:47,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint n;\nconst int N = 9;\nint datas[N] = {0};    // 数据状态数组，0表示还没有被选择，1表示被选择了\nint loc[N]   = {0};    // 位置状态数组，0表示还没有被安排，否则表示被安排了\n \nvoid dfs(int m){      // m表示到第几个位置了\n    if(m > n){        // 到深度递归的底部了，输出来并且结束递归\n        for(int i = 1; i <= n;++i)\n            printf(\""%d \"",loc[i]);\n        getchar();\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i = 1; i<= n;++i){    // 依次枚举当前位置可以选择的数据，采用dfs深度递归\n        if(datas[i] == 0){\n            loc[m]   = i;   // 当前位置安排当前未选择的最小的数\n            datas[i] = 1;   // 当前被选中的数的状态变为1\n            dfs(m + 1);\n            // 现场恢复\n            datas[i] = 0;\n            loc[m]   = 0;\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1586383828054577152,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-29 23:45:52,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint n;\nconst int N = 9;\nint datas[N] = {0};    // 数据状态数组，0表示还没有被选择，1表示被选择了\nint loc[N]   = {0};    // 位置状态数组，0表示还没有被安排，否则表示被安排了\n \nvoid dfs(int m){      // m表示到第几个位置了\n    if(m > n){        // 到深度递归的底部了，输出来并且结束递归\n        for(int i = 1; i <= n;++i)\n            printf(\""%d \"",loc[i]);\n        getchar();\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i = 1; i<= n;++i){    // 依次枚举当前位置可以选择的数据，采用dfs深度递归\n        if(datas[i] == 0){\n            loc[m]   = i;   // 当前位置安排当前未选择的最小的数\n            datas[i] = 1;   // 当前被选中的数的状态变为1\n            dfs(m + 1);\n            // 现场恢复\n            datas[i] = 0;\n            loc[m]   = 0;\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1586383992806834176,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-29 23:46:32,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"//数据范围：1 ≤ n ≤ 9\n#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nconst int N = 10;\n\nint a[N], n, path[N];   //a[]为待枚举的序列，n为序列元素的个数，path[]存储dfs的路径结果\nbool vis[N];    //布尔数组用来判断在dfs过程中序列元素是否已被放入path[]中\n\nvoid dfs(int u)\n{\n    if(u == n)  //满足条件则输出\n    {\n        for(int i = 0; i < n; i++)\n            cout << path[i] << ' ';\n        cout << endl;\n    }\n    \n    for(int i = 0; i < n; i++)\n        if(!vis[i])\n        {\n            if(i && a[i] == a[i - 1]  && !vis[i - 1])continue;//用来剪掉重复分支\n            vis[i] = true;\n            path[u] = a[i];\n            dfs(u + 1);\n            path[u] = 0; //恢复现场\n            vis[i] = false;\n        }\n}\nint main()\n{\n    cin >> n;\n    for(int i = 0; i < n; i++)cin >> a[i];\n    sort(a, a + n); //对数组进行排序，使所有相同重复元素相邻\n    dfs(0);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1586384220914061312,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-29 23:47:26,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <vector>\n#include <map>\n#include <string>\n\n#define ll long long \n#define mod 1e9 + 7\n#define PII pair<int, int>\n#define fi first\n#define se second\n#define inf 0x3f3f3f3f\n#define IOS ios::sync_with_stdio(false);\n\nusing namespace std;\n\nint n;\nint a[20], book[20];\n\nvoid dfs(int x)\n{\n\tif(x == n + 1) // 到达最后一个位置\n\t{\n\t\tfor(int i = 1; i <= n; i ++) cout << a[i] << \"" \""; // 输出此时答案\n\t\tcout << endl;\n\t\treturn ;\n\t}\n\t\n\tfor(int i = 1; i <= n; i ++)\n\t{\n\t\tif(!book[i]) // 这个数没选\n\t\t{\n\t\t\ta[x] = i; // 记录选了那些数\n\t\t\tbook[i] = 1; // 标记不能在用这个数\n\t\t\tdfs(x + 1); // 下一个位置\n\t\t\tbook[i] = 0; // 回溯\n\t\t}\n\t}\n}\n\nint main()\n{\n\tcin >> n;\n\tdfs(1);\n\t\n\treturn 0;\t\n}\n",PARTIAL_ACCEPTED,503,4472
1586384545024700416,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-29 23:48:43,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\n \nint num[1000];\nint a;\nvoid f(int b,int c){\n    if(b==a){\n        for(int i=0;i<a;i++){\n            printf(\""%d \"",num[i]);\n        }\n        printf(\""\\n\"");\n        return;\n    }\n    else{\n        for(int i = 1;i<=a;i++){\n            if (!((c>>i)&1)){\n                num[b++]=i;\n                f(b,c|1<<i);\n                b--;\n            }\n        }\n    }\n}\nint main(){\n    scanf(\""%d\"",&a);\n    f(0,0);\n    return 0;\n}",ACCEPTED,302,6972
1586384808703823872,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-29 23:49:46,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n/**\n * 方法采用\n * 依次枚举每个位置放哪个数\n * \n*/\nint n;\nconst int N = 9;\nint datas[N] = {0};    // 数据状态数组，0表示还没有被选择，1表示被选择了\nint loc[N]   = {0};    // 位置状态数组，0表示还没有被安排，否则表示被安排了\n \nvoid dfs(int m){      // m表示到第几个位置了\n    if(m > n){        // 到深度递归的底部了，输出来并且结束递归\n        for(int i = 1; i <= n;++i)\n            printf(\""%d \"",loc[i]);\n        getchar();\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i = 1; i<= n;++i){    // 依次枚举当前位置可以选择的数据，采用dfs深度递归\n        if(datas[i] == 0){\n            loc[m]   = i;   // 当前位置安排当前未选择的最小的数\n            datas[i] = 1;   // 当前被选中的数的状态变为1\n            dfs(m + 1);\n            // 现场恢复\n            datas[i] = 0;\n            loc[m]   = 0;\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,72,1244
1586385153794371585,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-29 23:51:08,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n/**\n * 方法采用\n * 依次枚举每个位置放哪个数\n * \n*/\nint n;\nconst int N = 9;\nint datas[N] = {0};    // 数据状态数组，0表示还没有被选择，1表示被选择了\nint loc[N]   = {0};    // 位置状态数组，0表示还没有被安排，否则表示被安排了\n \nvoid dfs(int m){      // m表示到第几个位置了\n    if(m > n){        // 到深度递归的底部了，输出来并且结束递归\n        for(int i = 1; i <= n;++i)\n            printf(\""%d \"",loc[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i = 1; i<= n;++i){    // 依次枚举当前位置可以选择的数据，采用dfs深度递归\n        if(datas[i] == 0){\n            loc[m]   = i;   // 当前位置安排当前未选择的最小的数\n            datas[i] = 1;   // 当前被选中的数的状态变为1\n            dfs(m + 1);\n            // 现场恢复\n            datas[i] = 0;\n            loc[m]   = 0;\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,58,1148
1586385298325897216,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-29 23:51:43,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n/**\n * 方法采用\n * 依次枚举每个位置放哪个数\n * \n*/\nint n;\nconst int N = 9;\nint datas[N] = {0};    // 数据状态数组，0表示还没有被选择，1表示被选择了\nint loc[N]   = {0};    // 位置状态数组，0表示还没有被安排，否则表示被安排了\n \nvoid dfs(int m){      // m表示到第几个位置了\n    if(m > n){        // 到深度递归的底部了，输出来并且结束递归\n        for(int i = 1; i <= n;++i)\n            printf(\""%d \"",loc[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i = 1; i<= n;++i){    // 依次枚举当前位置可以选择的数据，采用dfs深度递归\n        if(datas[i] == 0){\n            loc[m]   = i;   // 当前位置安排当前未选择的最小的数\n            datas[i] = 1;   // 当前被选中的数的状态变为1\n            dfs(m + 1);\n            // 现场恢复\n            datas[i] = 0;\n            loc[m]   = 0;\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,61,1088
1586399120449208320,831d001845101d905447f1f5c150c06a0c1423e2ea19b3d15c45c76ce91ae8a1,2022-10-30 00:46:38,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N=9;\nint n;\nint array[N];\nbool used[N];\n \nvoid dfs(int u){\n    if(u>n){\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){ \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,106,1080
1586535533199101952,2491fa677f92fb42e6319454b3fbf0cdbfe61f4a1dfe756869e8e710a6cdc6d1,2022-10-30 09:48:42,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint num[1000];\nint a;\nvoid f(int b,int c){\n    if(b==a){\n        for(int i=0;i<a;i++){\n            printf(\""%d \"",num[i]);\n        }\n        printf(\""\\n\"");\n        \n    }\n    else{\n        for(int i = 1;i<=a;i++){\n            if (i>1){\n                num[b++]=i;\n                f(b,c|1<<i);\n                b--;\n            }\n        }\n    }\n}\nint main(){\n    scanf(\""%d\"",&a);\n    f(0,0);\n    return 0;\n\n}",MULTIPLE_ERROR,966,12664
1586535627247980544,2491fa677f92fb42e6319454b3fbf0cdbfe61f4a1dfe756869e8e710a6cdc6d1,2022-10-30 09:49:04,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint num[1000];\nint a;\nvoid f(int b,int c){\n    if(b==a){\n        for(int i=0;i<a;i++){\n            printf(\""%d \"",num[i]);\n        }\n        printf(\""\\n\"");\n        \n    }\n    else{\n        for(int i = 1;i<=a;i++){\n            if (!((c>>i)&1){\n                num[b++]=i;\n                f(b,c|1<<i);\n                b--;\n            }\n        }\n    }\n}\nint main(){\n    scanf(\""%d\"",&a);\n    f(0,0);\n    return 0;\n\n}",COMPILE_ERROR,0,0
1586535681232859136,2491fa677f92fb42e6319454b3fbf0cdbfe61f4a1dfe756869e8e710a6cdc6d1,2022-10-30 09:49:17,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint num[1000];\nint a;\nvoid f(int b,int c){\n    if(b==a){\n        for(int i=0;i<a;i++){\n            printf(\""%d \"",num[i]);\n        }\n        printf(\""\\n\"");\n        \n    }\n    else{\n        for(int i = 1;i<=a;i++){\n            if (!((c>>i)&1)\n                {\n                num[b++]=i;\n                f(b,c|1<<i);\n                b--;\n            }\n        }\n    }\n}\nint main(){\n    scanf(\""%d\"",&a);\n    f(0,0);\n    return 0;\n\n}",COMPILE_ERROR,0,0
1586535843686645760,2491fa677f92fb42e6319454b3fbf0cdbfe61f4a1dfe756869e8e710a6cdc6d1,2022-10-30 09:49:56,C,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint num[1000];\nint a;\nvoid f(int b,int c){\n    if(b==a){\n        for(int i=0;i<a;i++){\n            printf(\""%d \"",num[i]);\n        }\n        printf(\""\\n\"");\n        \n    }\n    else{\n        for(int i = 1;i<=a;i++){\n            if (!((c>>i)&1))\n                {\n                num[b++]=i;\n                f(b,c|1<<i);\n                b--;\n            }\n        }\n    }\n}\nint main(){\n    scanf(\""%d\"",&a);\n    f(0,0);\n    return 0;\n\n}",ACCEPTED,292,6968
1586555627690135552,426ccc10c11026c3595cf0fb81324e7cb8865840d4345d169b0b101a08187f62,2022-10-30 11:08:33,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <bits/stdc++.h>\nusing namespace std;\nint n, a[16];\n\nbool f[16];\n\nvoid dfs(int k) {\n    if (k > n) {\n        for (int i = 1; i <= n; i++)\n            cout << a[i] << \"" \"";\n        cout << endl;\n        return ;\n    }//如果已经全部填好，就输出\n    for (int i = 1; i <= n; i++) {\n        if (f[i] == 0) {//如果数没有被填\n            f[i] = 1;//标记填入\n            a[k] = i;//填数\n            dfs(k + 1);//递归下一层\n            f[i] = 0;//反回状态\n        }\n    }\n}\n\nint main() {\n    cin >> n;//输入\n    dfs(1);//开始递归\n    return 0;\n}\n",PARTIAL_ACCEPTED,535,4472
1586555742756671488,426ccc10c11026c3595cf0fb81324e7cb8865840d4345d169b0b101a08187f62,2022-10-30 11:09:00,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N = 10;\nint path[N];//保存序列\nint state[N];//数字是否被用过\nint n;\nvoid dfs(int u)\n{\n    if(u > n)//数字填完了，输出\n    {\n        for(int i = 1; i <= n; i++)//输出方案\n            cout << path[i] << \"" \"";\n        cout << endl;\n    }\n\n    for(int i = 1; i <= n; i++)//空位上可以选择的数字为:1 ~ n\n    {\n        if(!state[i])//如果数字 i 没有被用过\n        {\n            path[u] = i;//放入空位\n            state[i] = 1;//数字被用，修改状态\n            dfs(u + 1);//填下一个位\n            state[i] = 0;//回溯，取出 i\n        }\n    }\n}\n\nint main()\n{\n\n    cin >> n;\n    dfs(1);\n    return 0;\n}\n",PARTIAL_ACCEPTED,527,4564
1586566636844740608,db1d1ade641ca74590ea71bfa32bbe8277b9d8a119e04d71fe971d02cf8638af,2022-10-30 11:52:17,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"//填坑\n#include<iostream>\nusing namespace std;\n \nconst int N=9;\nint n;//输入多少个数据\nint array[N];//定义输出数组\nbool used[N];//判断该值是否被使用过\n \nvoid dfs(int u){\n    if(u>n){//如果所有位置都满了，就输出数组\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){ //如果这个数没有被用过 false\n               array[u]=i;//在数组的第u个位置插入\n               used[i]=true;//将该数设置为已使用\n               dfs(u+1);//开始选下一个位置的数字\n               \n               //初始化\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,120,1024
1586572245195423744,f621d21394d2cafd3c2d560be50c598c74c1b1ef8c4e9deb38cd83461174b4a3,2022-10-30 12:14:35,C,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint a[10],book[10],n;\nvoid dfs(int step){\n    int i;\n    if(step==n+1)\n    {\n        for(int i=1;i<=n;i++)\n        {\n         printf(\""%d \"",a[i]);\n        }\n              printf(\""\\n\"");\n        return;\n    }\n        for(int i=1;i<=n;i++)\n        {\n            if(book[i]==0){\n                a[step]=i;\n                book[i]=1;\n                dfs(step+1);\n                book[i]=0;\n            }\n        }\n    return;\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}",ACCEPTED,299,6924
1586609021926633472,099f757d7e6f862a8629be2b4ca881dcd94145a0419cb60f18eef032ba8bce07,2022-10-30 14:40:43,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\n\nint n,a[1050],c[1050];\n\nvoid changing(int loc)\n{\n\tif(loc>n)\n\t{\n\t\tfor(int i=1;i<=n;++i)\n\t\t{\n\t\t\tcout<<c[i];\n\t\t}\n\t\tcout<<endl;\n\t\treturn;\n\t}\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tif(a[i]==0)\n\t\t{\n\t\t\ta[i]=1;\n\t\t\tc[loc]=i;\n\t\t\tchanging(loc+1);\n\t\t\ta[i]=0;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tcin>>n;\n\tchanging(1);\n\treturn 0;\n}",MULTIPLE_ERROR,510,2832
1586609216714309632,099f757d7e6f862a8629be2b4ca881dcd94145a0419cb60f18eef032ba8bce07,2022-10-30 14:41:29,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\n\nint n,a[1050],c[1050];\n\nvoid changing(int loc)\n{\n\tif(loc>n)\n\t{\n\t\tfor(int i=1;i<=n;++i)\n\t\t{\n\t\t\tcout<<c[i]<<' ';\n\t\t}\n\t\tcout<<endl;\n\t\treturn;\n\t}\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tif(a[i]==0)\n\t\t{\n\t\t\ta[i]=1;\n\t\t\tc[loc]=i;\n\t\t\tchanging(loc+1);\n\t\t\ta[i]=0;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tcin>>n;\n\tchanging(1);\n\treturn 0;\n}",PARTIAL_ACCEPTED,524,4452
1586612543770460160,d6bf8ea1be6bf79e4e860ad7069f6891fe6f79fc12c2014c28ed7035d47edaaa,2022-10-30 14:54:42,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"\n#include<bits/stdc++.h>\nusing namespace std;\nconst int N=9;\nint n;\nint array[N];\nbool used[N];\nvoid dfs(int u)\n{\n    if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main()\n{\n    cin>>n;\n    dfs(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1586612751170400256,d6bf8ea1be6bf79e4e860ad7069f6891fe6f79fc12c2014c28ed7035d47edaaa,2022-10-30 14:55:32,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"\n#include<bits/stdc++.h>\nusing namespace std;\nconst int N=9;\n#define n;\n#define array[N];\nbool used[N];\nvoid dfs(int u)\n{\n    if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main()\n{\n    cin>>n;\n    dfs(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1586612929180856320,d6bf8ea1be6bf79e4e860ad7069f6891fe6f79fc12c2014c28ed7035d47edaaa,2022-10-30 14:56:14,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"\n#include<bits/stdc++.h>\nusing namespace std;\nconst int N=9;\nint n;\nint array[N];\nbool used[N];\nvoid dfs(int u)\n{\n    if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main()\n{\n    int n;\nint array[N];\nbool used[N];\n    cin>>n;\n    dfs(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1586613052598255616,d6bf8ea1be6bf79e4e860ad7069f6891fe6f79fc12c2014c28ed7035d47edaaa,2022-10-30 14:56:44,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"\n#include<bits/stdc++.h>\nusing namespace std;\nconst int N=9;\nvoid dfs(int u)\n{\n    int array[N];\nbool used[N];\n    if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main()\n{\n    int n;\nint array[N];\nbool used[N];\n    cin>>n;\n    dfs(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1586613160517701632,d6bf8ea1be6bf79e4e860ad7069f6891fe6f79fc12c2014c28ed7035d47edaaa,2022-10-30 14:57:09,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"\n#include<bits/stdc++.h>\nusing namespace std;\nconst int N=9;\nvoid dfs(int u)\n{\n    int array[N];\n    bool used[N];\n    if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main()\n{\n    int n;\n    cin>>n;\n    dfs(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1586613228532531200,d6bf8ea1be6bf79e4e860ad7069f6891fe6f79fc12c2014c28ed7035d47edaaa,2022-10-30 14:57:26,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"\n#include<bits/stdc++.h>\nusing namespace std;\nconst int N=9;\n#define n; \nvoid dfs(int u)\n{\n    int array[N];\n    bool used[N];\n    if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main()\n{\n    cin>>n;\n    dfs(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1586613269175336960,d6bf8ea1be6bf79e4e860ad7069f6891fe6f79fc12c2014c28ed7035d47edaaa,2022-10-30 14:57:35,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"\n#include<bits/stdc++.h>\nusing namespace std;\nconst int N=9;\n#define n\nvoid dfs(int u)\n{\n    int array[N];\n    bool used[N];\n    if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main()\n{\n    cin>>n;\n    dfs(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1586613324061999104,d6bf8ea1be6bf79e4e860ad7069f6891fe6f79fc12c2014c28ed7035d47edaaa,2022-10-30 14:57:48,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"\n#include<bits/stdc++.h>\nusing namespace std;\nconst int N=9;\n#define n\nvoid dfs(int u)\n{\n    int array[N];\n    bool used[N];\n    if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main()\n{\n    cin>>n;\n    dfs(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1586613436066697216,d6bf8ea1be6bf79e4e860ad7069f6891fe6f79fc12c2014c28ed7035d47edaaa,2022-10-30 14:58:15,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"\n#include<bits/stdc++.h>\nusing namespace std;\nconst int N=9;\n#define n\nvoid dfs(int u)\n{\n    int array[N];\n    bool used[N];\n    if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++)\n    {\n        if(!used[i])\n        { \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main()\n{\n    cin>>n;\n    dfs(1);\n    return 0;\n}",COMPILE_ERROR,0,0
1586613826086629376,d6bf8ea1be6bf79e4e860ad7069f6891fe6f79fc12c2014c28ed7035d47edaaa,2022-10-30 14:59:48,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"\n#include<iostream>\n#include<algorithm>\n#include<cstring>\nusing namespace std;\nconst int N = 10;\nint n;\nint path[N];\nbool st[N];\nvoid dfs(int a){ \n    if(a > n){\n        for(int i = 1;i <= n;i++)\n        {\n            cout<<path[i]<<\"" \"";\n        }\n    cout << endl;\n    }\n    else\n    {\n        for(int i = 1;i <= n;i++)\n        {\n            if(!st[i])\n            {\n                path[a] = i;\n                st[i] = true;\n                dfs(a + 1);\n                st[i] = false;\n                path[a] = 0;\n            }\n        }\n    }\n}\nint main(){\n    cin >> n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,517,4612
1586625694339563520,386bca102612297fa476cc7a7c0e55a5f4cf4915ae788fb85cf87b664c51a140,2022-10-30 15:46:58,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include \""bits/stdc++.h\""\nusing namespace std;\nint main()\n{\n    int n;\n    cin>>n;\n    int a[10]={1,2,3,4,5,6,7,8,9};\n    do{\n        for(int i=0;i<n;i++)\n            cout<<a[i]<<\"" \"";\n         cout<<endl;\n    }while(next_permutation(a,a+n));\n    \n    return 0;\n}",PARTIAL_ACCEPTED,529,3320
1586626201888100352,10bb17fd73581583d74bf0739317e7c65d69731fcc10362dee34147ec94ec70f,2022-10-30 15:48:59,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h> \nusing namespace std;\nint ans[15];\nint use[15];\nint n;\nvoid dfs(int x){\n    if(x > n){\n        for(int i = 1;i <= n;i++)\n        {\n            printf(\""%d \"",ans[i]);\n        }\n        puts(\""\"");\n        return;\n    }\n    for(int i = 1;i <= n;i++)\n    {\n        if(!use[i])\n        {\n            ans[x] = i;\n            use[i] = 1;\n            dfs(x + 1);\n            use[i] = 0;\n        }\n    }\n}\nint main()\n{\n   cin>>n;\n    dfs(1);\n    return 0;\n}\n",ACCEPTED,278,7100
1586637635015536640,d2c867ec1d919545c996649cc4777c25d5e6b0665f12c4180a9ce76abd98da3d,2022-10-30 16:34:25,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nint a[10], b[10];\nvoid px(int x)\n{\n\tif (x > (n-1))\n\t{\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tcout << a[i] << \"" \"";\n\t\tcout << endl;\n\t\treturn;\n\t}\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif (!b[i])\n\t\t{\n\t\t\ta[x] = i + 1;\n\t\t\tb[i] = true;\n\t\t\tpx(x + 1);\n\t\t\ta[x] = 0;\n\t\t\tb[i] = false;\n\t\t}\n\t}\n}\nint main()\n{\n\tcin >> n;\n\tpx(0);\n}",PARTIAL_ACCEPTED,548,2964
1586639821095170048,e784dcf96150b9c8a9eb2060071223cece118e9df03262a36df3604563535f0d,2022-10-30 16:43:06,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio,h>\nusing namespace std;\nint n;\nint path[10];\nint flag[10];\nvoid dfs(int u)\n{\n    if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<path[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    else\n    {\n        for(int i=1;i<=n;i++)\n        {\n            if(flag[i]) continue;\n            path[u]=i;\n            flag[i]=1;\n            dfs(u+1);\n            path[u]=0;\n            flag[i]=0;\n        }\n    }\n}\n\n\nint main()\n{\n    cin>>n;\n    dfs(1);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1586640075873972224,e784dcf96150b9c8a9eb2060071223cece118e9df03262a36df3604563535f0d,2022-10-30 16:44:07,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n;\nint path[10];\nint flag[10];\nvoid dfs(int u)\n{\n    if(u>n)\n    {\n        for(int i=1;i<=n;i++)\n            cout<<path[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    else\n    {\n        for(int i=1;i<=n;i++)\n        {\n            if(flag[i]) continue;\n            path[u]=i;\n            flag[i]=1;\n            dfs(u+1);\n            path[u]=0;\n            flag[i]=0;\n        }\n    }\n}\n\n\nint main()\n{\n    cin>>n;\n    dfs(1);\n    return 0;\n}\n",PARTIAL_ACCEPTED,544,3092
1586642310083244032,d2c867ec1d919545c996649cc4777c25d5e6b0665f12c4180a9ce76abd98da3d,2022-10-30 16:52:59,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nint a[10], b[10];\nvoid px(int x)\n{\n\tif (x > (n-1))\n\t{\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tcout << a[i] << \"" \"";\n\t\tcout << endl;\n\t\treturn;\n\t}\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif (!b[i])\n\t\t{\n\t\t\ta[x] = i + 1;\n\t\t\tb[i] = true;\n\t\t\tpx(x + 1);\n\t\t\ta[x] = 0;\n\t\t\tb[i] = false;\n\t\t}\n\t}\n}\nint main()\n{\n    ios::sync_with_stdio(0);\n\tcin >> n;\n\tpx(0);\n}",PARTIAL_ACCEPTED,534,2916
1586643242963566592,d2c867ec1d919545c996649cc4777c25d5e6b0665f12c4180a9ce76abd98da3d,2022-10-30 16:56:42,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\n#include<cstdio>\nusing namespace std;\nint n;\nint a[10], b[10];\nvoid px(int x)\n{\n\tif (x > (n-1))\n\t{\n\t\tfor (int i = 0; i < n; i++)\n            printf(\""%d \"",a[i]);\n        printf(\""\\n\"");\n\t\treturn;\n\t}\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tif (!b[i])\n\t\t{\n\t\t\ta[x] = i + 1;\n\t\t\tb[i] = true;\n\t\t\tpx(x + 1);\n\t\t\ta[x] = 0;\n\t\t\tb[i] = false;\n\t\t}\n\t}\n}\nint main()\n{\n    \n\tscanf(\""%d\"",&n);\n\tpx(0);\n}",ACCEPTED,303,7124
1586648973423013888,26e967da8690a5a17b9fb2f1fd6da382d663d6440f88d9be45b624b2fec9cc55,2022-10-30 17:19:28,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,#include<bits/stdc++.h>\nusing namespace std;\nint n;\nint a[10];\nbool b[10];\nvoid fun(int t)\n{\n    if(t>n)\n    {\n        for(int i=1;i<=n;i++)\n        {\n            cout<<a[i]<<' ';\n        }\n        cout<<endl;\n    }\n    else\n    {\n        for(int i=1;i<=n;i++)\n        {\n            if(b[i]==false)\n            {\n                b[i]=true;\n                a[t]=i;\n                fun(t+1);\n                b[i]=false;\n            }\n        }\n    }\n}\nint main()\n{\n    cin>>n;\n    fun(1);\n},PARTIAL_ACCEPTED,540,3220
1586649309831360512,26e967da8690a5a17b9fb2f1fd6da382d663d6440f88d9be45b624b2fec9cc55,2022-10-30 17:20:48,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nint a[10];\nbool b[10];\nvoid fun(int t)\n{\n    if(t>n)\n    {\n        for(int i=1;i<=n;i++)\n        {\n            printf(\""%d \"",a[i]);\n        }\n        printf(\""\\n\"");\n    }\n    else\n    {\n        for(int i=1;i<=n;i++)\n        {\n            if(b[i]==false)\n            {\n                b[i]=true;\n                a[t]=i;\n                fun(t+1);\n                b[i]=false;\n            }\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    fun(1);\n}",ACCEPTED,283,7224
1586650878941466624,a77cfb27093794908eb77068b328ba40138c4aaae5a8fed6202d1c686c562e5d,2022-10-30 17:27:02,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nint a[15],b[15];\nvoid f(int m);\nint main(){\n    cin>>n;\n    f(1);\n}\nvoid f(int m){\n    int i;\n    if(m>n){\n        for(i=1;i<=n;i++)\n printf(\""%d \"",a[i]);\n        printf(\""\\n\"");\n        return ;\n    }\n    for(i=1;i<=n;i++){\n        if(b[i]==0){\n            b[i]=1;\n            a[m]=i;\n            f(m+1);\n            b[i]=0;\n        }\n    }\n}\n",ACCEPTED,305,7224
1586659991465361408,ba40852effee82c3c150665bc266e80814900b3b972105fc483dc2b274854abe,2022-10-30 18:03:15,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <bits/stdc++.h>\nusing namespace std;\nconst int N = 10;\nint st[N];\nbool used[N];\nint n;\n \nvoid dfs(int u){//当前枚举第u位\n    if(u > n){\n        for(int i = 1; i <= n; i ++) printf(\""%d \"", st[i]);//打印方案\n        puts(\""\"");\n        return ;\n    }\n    for(int i = 1; i <= n; i ++){//依次枚举每个数\n        if(!used[i]){//当前数可用\n            st[u] = i;\n            used[i] = true;\n            dfs(u + 1);\n            st[u] = 0;//可省略\n            used[i] = false;//不可省\n        }\n    }\n}\nint main(){\n    scanf(\""%d\"", &n);\n    dfs(1);\n    return 0;\n}\n ",ACCEPTED,323,7252
1586671419303788544,3f686d0399ad82cea69808e3ccc1ce12ddf75f41f0a5bc832bb48eaf2505c9df,2022-10-30 18:48:39,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<queue>\n#include<bitset>\n#include<string>\n#include<iostream>\n#include<cstdio>\n#include<map>\n#include<algorithm>\nusing namespace std;\n\nconst int N=1<<21,inf=0x3f3f3f3f;\nint n,m;\nmap<int ,int > m1;\n\nstruct point{\n    vector<int > v1;\n}p1[N];\n\nint lowbit(int x)\n{\n    return x&(-x);\n}\n\nbool cmp(point x,point y){\n    int ptail=0;\n    while(x.v1[ptail]==y.v1[ptail])ptail++;\n    return x.v1[ptail]<y.v1[ptail];\n}\n\nint main(){\n    cin>>n>>m;\n    bitset<26> b1;\n    m1[1]=0;\n    int q=2,tail=0;\n\n    for(int i=1;i<=32;i++){\n        m1[q]=i;\n        q*=2;\n    }\n\n    for(int a=0;a<(1<<n);a++){\n        b1|=a;\n        if(b1.count()==m){\n            int pa=a;\n            while(pa){\n            p1[tail].v1.push_back(m1[lowbit(pa)]+1);\n            pa^=lowbit(pa);\n            }\n            tail++;\n        }\n        b1&=0;\n    }\n    sort(p1,p1+tail,cmp);\n    for(int a=0;a<tail;a++){\n        for(int b=0;b<m;b++)printf(\""%d \"",p1[a].v1[b]);\n        printf(\""\\n\"");\n    }\n}",WRONG_ANSWER,213,49716
1586672448753758208,3f686d0399ad82cea69808e3ccc1ce12ddf75f41f0a5bc832bb48eaf2505c9df,2022-10-30 18:52:45,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n \nconst int N=9;\nint n;\nint array[N];\nbool used[N];\n \nvoid dfs(int u){\n    if(u>n){\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){ \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,140,1068
1586673886561173504,dfe6a0a4663241548d22605cf39d7bba14dd7f798d55af15c3fde928ec8b267a,2022-10-30 18:58:28,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h> \nusing namespace std;\nint n;\nint ans[15];\nint use[15];\nvoid dfs(int x){\n    if(x > n){\n        for(int i = 1;i <= n;i++){\n            printf(\""%d \"",ans[i]);\n        }\n        puts(\""\"");\n        return;\n    }\n    for(int i = 1;i <= n;i++){\n        if(!use[i]){\n            ans[x] = i;\n            use[i] = 1;\n            dfs(x + 1);\n            use[i] = 0;\n        }\n    }\n}\nint main(){\n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}\n",ACCEPTED,299,7084
1586674417555865600,321b38e57eef1eeb1434214e9fef50dc8e09af327aafc4625c6672e28c579619,2022-10-30 19:00:34,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nint a[20];\nbool vis[20];\nvoid dfs(int pos)\n{\n    if (pos == n)\n    {\n        for (int i = 0; i < n; i ++ ) cout << a[i] << \"" \"";\n        cout << endl;\n        return ;\n    }\n    \n    for (int i = 1; i <= n; i ++) \n    {\n        if (!vis[i])\n        {\n            vis[i] = true; a[pos] = i;\n            dfs (pos + 1);\n            vis[i] = false;\n        }\n    }\n}\nint main() \n{\n    cin >> n;\n    dfs(0);\n    return 0;\n}",PARTIAL_ACCEPTED,534,3116
1586675135310336000,db009b2e91257028e49bdab3e4921344dd780d550fe9ed4192938c20be6f409e,2022-10-30 19:03:25,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N=9;\nint n;//输入多少个数据\nint array[N];//定义输出数组\nbool used[N];//判断该值是否被使用过\n \nvoid dfs(int u){\n    if(u>n){//如果所有位置都满了，就输出数组\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){ //如果这个数没有被用过 false\n               array[u]=i;//在数组的第u个位置插入\n               used[i]=true;//将该数设置为已使用\n               dfs(u+1);//开始选下一个位置的数字\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,142,1064
1586675764426567680,e6d59d66bf763193233c071c4df54b6a17ae09e2e796c80ddb57572732532f84,2022-10-30 19:05:55,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint mei(int x);\nint a;\nint b[10];\nbool c[10];\nint main()\n{\n\n    cin>>a;\n    mei(1);\n}\nint mei(int x)\n{\n\tif (x > a)\n\t{\n\t\tfor (int i = 1; i <= a; i++)\n\t\t{\n\t\t\tcout << b[i] << \"" \"";\n\t\t}\n\t\tcout << endl;\n\t\treturn 0;\n\t}\n\telse\n\t\tfor (int i = 1; i <= a; i++)\n\t\t{\n\t\t\tif (!c[i])\n\t\t\t{\n\t\t\t\tc[i] = true;\n\t\t\t\tb[x] = i;\n\t\t\t\t//cout<<btn[u]<<endl;\n\t\t\t\tmei(x + 1);\n\t\t\t\tc[i] = false;\n\n\t\t\t}\n\t\t}\n}",PARTIAL_ACCEPTED,532,3080
1586675918152007680,e6d59d66bf763193233c071c4df54b6a17ae09e2e796c80ddb57572732532f84,2022-10-30 19:06:32,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint mei(int x);\nint a;\nint b[10];\nint c[10];\nint main()\n{\n\n    cin>>a;\n    mei(1);\n}\nint mei(int x)\n{\n\tif (x > a)\n\t{\n\t\tfor (int i = 1; i <= a; i++)\n\t\t{\n\t\t\tcout << b[i] << \"" \"";\n\t\t}\n\t\tcout << endl;\n\t\treturn 0;\n\t}\n\telse\n\t\tfor (int i = 1; i <= a; i++)\n\t\t{\n\t\t\tif (c[i]==0)\n\t\t\t{\n\t\t\t\tc[i] = 1;\n\t\t\t\tb[x] = i;\n\t\t\t\tmei(x + 1);\n\t\t\t\tc[i] = 0;\n\n\t\t\t}\n\t\t}\n}",PARTIAL_ACCEPTED,544,3380
1586675951513505792,e6d59d66bf763193233c071c4df54b6a17ae09e2e796c80ddb57572732532f84,2022-10-30 19:06:40,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint mei(int x);\nint a;\nint b[10];\nint c[10];\nint main()\n{\n\n    cin>>a;\n    mei(1);\n}\nint mei(int x)\n{\n\tif (x > a)\n\t{\n\t\tfor (int i = 1; i <= a; i++)\n\t\t{\n\t\t\tcout << b[i] << \"" \"";\n\t\t}\n\t\tcout << endl;\n\t\treturn 0;\n\t}\n\telse\n\t\tfor (int i = 1; i <= a; i++)\n\t\t{\n\t\t\tif (c[i]==0)\n\t\t\t{\n\t\t\t\tc[i] = 1;\n\t\t\t\tb[x] = i;\n\t\t\t\tmei(x + 1);\n\t\t\t\tc[i] = 0;\n\n\t\t\t}\n\t\t}\n}",PARTIAL_ACCEPTED,534,3064
1586676305680535552,e6d59d66bf763193233c071c4df54b6a17ae09e2e796c80ddb57572732532f84,2022-10-30 19:08:04,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint mei(int x);\nint a;\nint b[10];\nint c[10];\nint main()\n{\n\n    cin>>a;\n    mei(1);\n}\nint mei(int x)\n{\n\tif (x > a)\n\t{\n\t\tfor (int i = 1; i <= a; i++)\n\t\t{\n\t\t\tprintf(\""%d \"",b[i]);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t\treturn 0;\n\t}\n\telse\n\t\tfor (int i = 1; i <= a; i++)\n\t\t{\n\t\t\tif (c[i]==0)\n\t\t\t{\n\t\t\t\tc[i] = 1;\n\t\t\t\tb[x] = i;\n\t\t\t\tmei(x + 1);\n\t\t\t\tc[i] = 0;\n\n\t\t\t}\n\t\t}\n}",ACCEPTED,319,7092
1586677212686184448,3b74e7618e7ac98c76c6425d28f923210f50918ad97b2f051f7e3c06c3562be6,2022-10-30 19:11:41,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\nusing namespace std;\n\nint n;\nint arr[30];\nbool vis[30];\nvoid dfs(int cur)\n{\n    if(cur == n + 1) {\n        for(int i = 1; i <= n; ++i) cout << arr[i] << \"" \"";\n        puts(\""\"");\n        return;\n    }\n    for(int i = 1; i <= n; ++i) {\n        if(vis[i]) continue;\n        arr[cur] = i;\n        vis[i] = true;\n        dfs(cur + 1);\n        vis[i] = false; \n    }\n}\nint main()\n{\n    cin >> n;\n    dfs(1);\n    return 0;\n}\n",ACCEPTED,281,7108
1586688675832270848,321b38e57eef1eeb1434214e9fef50dc8e09af327aafc4625c6672e28c579619,2022-10-30 19:57:14,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nint a[20];\nbool vis[20];\nvoid dfs(int pos)\n{\n    if (pos == n)\n    {\n        for (int i = 0; i < n; i ++ ) cout << a[i] << \"" \"";\n        cout << endl;\n        return ;\n    }\n    \n    for (int i = 1; i <= n; i ++) \n    {\n        if (!vis[i])\n        {\n            vis[i] = true; a[pos] = i;\n            dfs (pos + 1);\n            vis[i] = false;\n        }\n    }\n}\nint main() \n{\n    cin >> n;\n    dfs(0);\n    return 0;\n}",PARTIAL_ACCEPTED,548,3228
1586688926903308288,9043b301e67f158706ee7909a87421e3192a0efdb3120de82b6a8ffd3a38a0aa,2022-10-30 19:58:14,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N=9;\nint n;\nint array[N];\nbool used[N];\nvoid dfs(int u){\n    if(u>n){\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    for(int i=1;i<=n;i++){\n        if(!used[i]){\n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        }\n    }\n}\nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,140,1072
1586699318207578112,51428d69f94eff9e09b64d5f235f3de34c7c8da357680b148f1c373d45d37898,2022-10-30 20:39:31,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nint num[100];\nvoid f(int a,int b)\n{\n    if(a==n){\n        for(int i=0;i<n;i++){\n            printf(\""%d \"",num[i]);\n        }\n        cout<<endl;\n        return;\n    }\n    else{\n        for(int i=1;i<=n;i++)\n        {\n            if(!((b>>i)&1)){\n                num[a++]=i;\n                f(a,b|1<<i);\n                a--;\n            }\n        }\n    }\n}\nint main()\n{\n    cin>>n;\n    f(0,0);\n    return 0;\n}",PARTIAL_ACCEPTED,535,3280
1586699444053479424,51428d69f94eff9e09b64d5f235f3de34c7c8da357680b148f1c373d45d37898,2022-10-30 20:40:01,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n;\nint num[10];\nvoid f(int a,int b)\n{\n    if(a==n){\n        for(int i=0;i<n;i++){\n            printf(\""%d \"",num[i]);\n        }\n        cout<<endl;\n        return;\n    }\n    else{\n        for(int i=1;i<=n;i++)\n        {\n            if(!((b>>i)&1)){\n                num[a++]=i;\n                f(a,b|1<<i);\n                a--;\n            }\n        }\n    }\n}\nint main()\n{\n    cin>>n;\n    f(0,0);\n    return 0;\n}",PARTIAL_ACCEPTED,536,3320
1586699871679549440,6c40f90f9bbf94dceae6bb223ad620cb6d0f501b968c33d586726fbac152694a,2022-10-30 20:41:43,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <bits/stdc++.h>\nusing namespace std;\n\nint n;\nint arr[30];\nbool vis[30];\nvoid dfs(int cur)\n{\n    if(cur == n + 1) {\n        for(int i = 1; i <= n; ++i) cout << arr[i] << \"" \"";\n        puts(\""\"");\n        return;\n    }\n    for(int i = 1; i <= n; ++i) {\n        if(vis[i]) continue;\n        arr[cur] = i;\n        vis[i] = true;\n        dfs(cur + 1);\n        vis[i] = false; \n    }\n}\nint main()\n{\n    cin >> n;\n    dfs(1);\n    return 0;\n}\n",ACCEPTED,282,7092
1586699872489041920,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-30 20:41:43,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint n;\nint a[10],array[10];\nvoid judge(int a[10])\n{\n    for(int i=1;i<n;i++)\n        a[i]=0;\n}\nvoid dfs(int k)\n{\n    if(k>n)\n    {\n        for(int i=1;i<n;i++)\n            printf(\""%d \"",array[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!judge[i])\n        {\n            array[i]=i;\n            judge[i]=1;\n            dfs(k+1);\n            judge[i]=0;\n        }\n    }\n    \n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(0);\n    return 0;\n}",COMPILE_ERROR,0,0
1586700148121931776,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-30 20:42:49,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint n;\nint a[10],array[10];\nvoid judge(int a[10])\n{\n    for(int i=1;i<n;i++)\n        a[i]=0;\n}\nvoid dfs(int k)\n{\n    if(k>n)\n    {\n        for(int i=1;i<n;i++)\n            printf(\""%d \"",array[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!a[i])\n        {\n            array[i]=i;\n            a[i]=1;\n            dfs(k+1);\n            a[i]=0;\n        }\n    }\n    \n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(0);\n    return 0;\n}",WRONG_ANSWER,33,380
1586702408147140608,502e51e5afa2a9399093a6959858f04460877e5da836702f05f6d41a5ac79b2c,2022-10-30 20:51:48,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N=9;\nint n;\nint array[N];\nbool used[N];\nvoid dfs(int u){\n    if(u>n){\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){\n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,145,1072
1586704414140141568,a6c8a8eda6d76c42d39e1e28ee2bbcbe8af4974bab2ad2a21679133286bf7d45,2022-10-30 20:59:46,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h> \nusing namespace std;\nint n, a[30];\nbool vis[30];\nvoid dfs(int pos)\n{\n    if(!(pos^n)) \n    {\n        for(int i = 1; i <= n; i++) \n        cout << a[i] << \"" \"";\n        cout << endl;\n    }\n    for(int i = 1; i <= n; i++)\n    {\n        if(vis[i]) continue;\n        vis[i] = 1;\n        a[pos + 1] = i;\n        dfs(pos + 1);\n        vis[i] = 0;\n    }\n    return;\n}\nint main()\n{\n    cin >> n; \n    dfs(0);\n    return 0;\n}",PARTIAL_ACCEPTED,545,2860
1586704960397901824,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-30 21:01:56,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint n;\nint a[10],array[10];\nvoid judge(int a[10])\n{\n    for(int i=1;i<n;i++)\n        a[i]=0;\n}\nvoid dfs(int k)\n{\n    if(k>n)\n    {\n        for(int i=1;i<n;i++)\n            printf(\""%d \"",array[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!a[i])\n        {\n            array[k]=i;\n            a[i]=1;\n            dfs(k+1);\n            a[i]=0;\n        }\n    }\n    \n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(0);\n    return 0;\n}",WRONG_ANSWER,34,344
1586705410065035264,db1d1ade641ca74590ea71bfa32bbe8277b9d8a119e04d71fe971d02cf8638af,2022-10-30 21:03:43,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"//填坑\n#include<iostream>\nusing namespace std;\n \nconst int N=9;\nint n;//输入多少个数据\nint array[N];//定义输出数组\nbool used[N];//判断该值是否被使用过\n \nvoid dfs(int u){\n    if(u>n){//如果所有位置都满了，就输出数组\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){ //如果这个数没有被用过 false\n               array[u]=i;//在数组的第u个位置插入\n               used[i]=true;//将该数设置为已使用\n               dfs(u+1);//开始选下一个位置的数字\n               \n               //初始化\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,143,1108
1586705717130039296,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-30 21:04:57,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"/*#include<stdio.h>\nint n;\nint a[10],array[10];\nvoid judge(int a[10])\n{\n    for(int i=1;i<n;i++)\n        a[i]=0;\n}\nvoid dfs(int k)\n{\n    if(k>n)\n    {\n        for(int i=1;i<n;i++)\n            printf(\""%d \"",array[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!a[i])\n        {\n            array[k]=i;\n            a[i]=1;\n            dfs(k+1);\n            a[i]=0;\n            \n        }\n    }\n    \n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(0);\n    return 0;\n}*/\n\n#include<cstdio>\n#include<iostream>\nint state[10];//0代表还没有选数，1~n代表放了哪个数 \nbool m[10];//true表示用过，false表示没有用过 \nint n;\nvoid dfs(int u)//第几个位置 \n{\n\tif(u==n)\n\t{\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tprintf(\""%d \"",state[i]);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t\treturn;\n\t}\n\tfor(int i=1;i<=n;i++)//枚举所有的数，看哪个可以选 \n\t{\n\t\tif(!m[i])//该数没有被选 \n\t\t{\n\t\t\tm[i]=true;//状态表示选了 \n\t\t\tstate[u]=i;//选这该数 \n\t\t\tdfs(u+1);//开始选下一个位置 \n\t\t\t\n\t\t\tm[i]=false;//恢复现场 \n\t\t\tstate[u]=0;//恢复现场 \n\t\t}\n\t}\n}\nint main(void)\n{\n\tscanf(\""%d\"",&n);\n\tdfs(0);\n\treturn 0;\n}",ACCEPTED,300,7100
1586707782329823232,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-30 21:13:09,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint n;\nbool a[10];\nint array[10];\nvoid dfs(int k)\n{\n    if(k>n)\n    {\n        for(int i=1;i<n;i++)\n            printf(\""%d \"",array[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!a[i])\n        {\n            a[i]=true;\n            array[k]=i;\n           \n            dfs(k+1);\n            a[i]=false;\n            array[k]=0;\n        }\n    }\n    \n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(0);\n    return 0;\n}\n\n/*#include<cstdio>\n#include<iostream>\nint state[10];//0代表还没有选数，1~n代表放了哪个数 \nbool m[10];//true表示用过，false表示没有用过 \nint n;\nvoid dfs(int u)//第几个位置 \n{\n\tif(u==n)\n\t{\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tprintf(\""%d \"",state[i]);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t\treturn;\n\t}\n\tfor(int i=1;i<=n;i++)//枚举所有的数，看哪个可以选 \n\t{\n\t\tif(!m[i])//该数没有被选 \n\t\t{\n\t\t\tm[i]=true;//状态表示选了 \n\t\t\tstate[u]=i;//选这该数 \n\t\t\tdfs(u+1);//开始选下一个位置 \n\t\t\t\n\t\t\tm[i]=false;//恢复现场 \n\t\t\tstate[u]=0;//恢复现场 \n\t\t}\n\t}\n}\nint main(void)\n{\n\tscanf(\""%d\"",&n);\n\tdfs(0);\n\treturn 0;\n}*/",WRONG_ANSWER,33,380
1586708015054979072,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-30 21:14:05,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint n;\nbool a[10];\nint array[10];\nvoid dfs(int k)\n{\n    if(k==n)\n    {\n        for(int i=1;i<n;i++)\n            printf(\""%d \"",array[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!a[i])\n        {\n            a[i]=true;\n            array[k]=i;\n           \n            dfs(k+1);\n            a[i]=false;\n            array[k]=0;\n        }\n    }\n    \n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(0);\n    return 0;\n}\n\n/*#include<cstdio>\n#include<iostream>\nint state[10];//0代表还没有选数，1~n代表放了哪个数 \nbool m[10];//true表示用过，false表示没有用过 \nint n;\nvoid dfs(int u)//第几个位置 \n{\n\tif(u==n)\n\t{\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tprintf(\""%d \"",state[i]);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t\treturn;\n\t}\n\tfor(int i=1;i<=n;i++)//枚举所有的数，看哪个可以选 \n\t{\n\t\tif(!m[i])//该数没有被选 \n\t\t{\n\t\t\tm[i]=true;//状态表示选了 \n\t\t\tstate[u]=i;//选这该数 \n\t\t\tdfs(u+1);//开始选下一个位置 \n\t\t\t\n\t\t\tm[i]=false;//恢复现场 \n\t\t\tstate[u]=0;//恢复现场 \n\t\t}\n\t}\n}\nint main(void)\n{\n\tscanf(\""%d\"",&n);\n\tdfs(0);\n\treturn 0;\n}*/",WRONG_ANSWER,276,6404
1586708644280274944,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-30 21:16:35,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<cstdio>\n\n#include<iostream>\nint n;\nbool a[10];\nint array[10];\nvoid dfs(int k)\n{\n    if(k==n)\n    {\n        for(int i=1;i<n;i++)\n            printf(\""%d \"",array[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!a[i])\n        {\n            a[i]=true;\n            array[k]=i;\n           \n            dfs(k+1);\n            a[i]=false;\n            array[k]=0;\n        }\n    }\n    \n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(0);\n    return 0;\n}\n\n/*#include<cstdio>\n#include<iostream>\nint state[10];//0代表还没有选数，1~n代表放了哪个数 \nbool m[10];//true表示用过，false表示没有用过 \nint n;\nvoid dfs(int u)//第几个位置 \n{\n\tif(u==n)\n\t{\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tprintf(\""%d \"",state[i]);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t\treturn;\n\t}\n\tfor(int i=1;i<=n;i++)//枚举所有的数，看哪个可以选 \n\t{\n\t\tif(!m[i])//该数没有被选 \n\t\t{\n\t\t\tm[i]=true;//状态表示选了 \n\t\t\tstate[u]=i;//选这该数 \n\t\t\tdfs(u+1);//开始选下一个位置 \n\t\t\t\n\t\t\tm[i]=false;//恢复现场 \n\t\t\tstate[u]=0;//恢复现场 \n\t\t}\n\t}\n}\nint main(void)\n{\n\tscanf(\""%d\"",&n);\n\tdfs(0);\n\treturn 0;\n}*/",WRONG_ANSWER,299,6332
1586708844679925760,db3c10c7831564132b04385c7bafaa76ce84d34143eee7e666290f339b83055d,2022-10-30 21:17:22,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<cstdio>\n\n#include<iostream>\nint n;\nbool a[10];\nint array[10];\nvoid dfs(int k)\n{\n    if(k==n)\n    {\n        for(int i=0;i<n;i++)\n            printf(\""%d \"",array[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!a[i])\n        {\n            a[i]=true;\n            array[k]=i;\n           \n            dfs(k+1);\n            a[i]=false;\n            array[k]=0;\n        }\n    }\n    \n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(0);\n    return 0;\n}\n\n/*#include<cstdio>\n#include<iostream>\nint state[10];//0代表还没有选数，1~n代表放了哪个数 \nbool m[10];//true表示用过，false表示没有用过 \nint n;\nvoid dfs(int u)//第几个位置 \n{\n\tif(u==n)\n\t{\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tprintf(\""%d \"",state[i]);\n\t\t}\n\t\tprintf(\""\\n\"");\n\t\treturn;\n\t}\n\tfor(int i=1;i<=n;i++)//枚举所有的数，看哪个可以选 \n\t{\n\t\tif(!m[i])//该数没有被选 \n\t\t{\n\t\t\tm[i]=true;//状态表示选了 \n\t\t\tstate[u]=i;//选这该数 \n\t\t\tdfs(u+1);//开始选下一个位置 \n\t\t\t\n\t\t\tm[i]=false;//恢复现场 \n\t\t\tstate[u]=0;//恢复现场 \n\t\t}\n\t}\n}\nint main(void)\n{\n\tscanf(\""%d\"",&n);\n\tdfs(0);\n\treturn 0;\n}*/",ACCEPTED,307,7160
1586709464598052864,8db2000cf7c3e02af9215a4fcbb6e3ce6d495db1a18c93856098d76b97be2c6d,2022-10-30 21:19:50,Java,4.0,1584250325531770884,1574307941233045504,1418168535107559424,"import java.util.Scanner;\nimport java.io.BufferedWriter;\nimport java.io.OutputStreamWriter; //不用BufferedWriter 会TLE，记得使用时，添加抛出异常；\n\npublic class Main{\n    public static int n;\n    public static boolean[] st = new boolean[10];\n    \n    public static void dfs(int u,int[] nums, boolean[] st) throws Exception {\n        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));\n        \n        if (u > n) \n        {\n            for (int i = 1; i <= n; i ++ ) bw.write(nums[i] + \"" \"");\n            bw.write(\""\\n\"");\n            bw.flush();\n            return;\n        }\n        else\n        {\n            for (int i = 1; i <= n; i ++)\n                {\n                    if (st[i] == false)\n                    {\n                        st[i] = true;\n                        nums[u] = i;\n                        dfs(u + 1, nums, st);\n                        st[i] = false; //恢复现场\n                    }\n                }\n        }\n        \n    }\n        \n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n            \n        n = sc.nextInt();\n        \n        int[] nums = new int[10];\n        \n        try{\n            dfs(1, nums, st);\n        } catch (Exception e) {}\n    }\n}",PARTIAL_ACCEPTED,1550,65536
1586709900746952704,5248400838c8b06939bd21a1728c3abad8035135e3cac51f6a304662759d7c4d,2022-10-30 21:21:34,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n,v[100];\nint d[100];\nvoid def(int x)\n{\n\tint i;\n\tif(x>n)\n\t{\n\t\tfor( i=1;i<=n;i++)\n\t\tcout<<\""   \""<<d[i];\n\t\tcout<<endl;\n\t\treturn;\n\t}\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(v[i]==0)\n\t\t{\n\t\t\td[x]=i;\n\t\t\tv[i]=1;\n\t\t\tdef(x+1);\n\t\t\tv[i]=0;\n\t\t}\n\t}\n}\nint main()\n{\nint i,j;\ncin>>n;\ndef(1);\n}",MULTIPLE_ERROR,531,5824
1586709968283631616,5248400838c8b06939bd21a1728c3abad8035135e3cac51f6a304662759d7c4d,2022-10-30 21:21:50,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n,v[100];\nint d[100];\nvoid def(int x)\n{\n\tint i;\n\tif(x>n)\n\t{\n\t\tfor( i=1;i<=n;i++)\n\t\tcout<<\"" \""<<d[i];\n\t\tcout<<endl;\n\t\treturn;\n\t}\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(v[i]==0)\n\t\t{\n\t\t\td[x]=i;\n\t\t\tv[i]=1;\n\t\t\tdef(x+1);\n\t\t\tv[i]=0;\n\t\t}\n\t}\n}\nint main()\n{\nint i,j;\ncin>>n;\ndef(1);\n}",MULTIPLE_ERROR,544,3248
1586710112420884480,5248400838c8b06939bd21a1728c3abad8035135e3cac51f6a304662759d7c4d,2022-10-30 21:22:25,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nint n,v[100];\nint d[100];\nvoid def(int x)\n{\n\tint i;\n\tif(x>n)\n\t{\n\t\tfor( i=1;i<=n;i++)\n\t\tcout<<d[i]<<\"" \"";\n\t\tcout<<endl;\n\t\treturn;\n\t}\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(v[i]==0)\n\t\t{\n\t\t\td[x]=i;\n\t\t\tv[i]=1;\n\t\t\tdef(x+1);\n\t\t\tv[i]=0;\n\t\t}\n\t}\n}\nint main()\n{\nint i,j;\ncin>>n;\ndef(1);\n}",PARTIAL_ACCEPTED,539,3212
1586711051835936768,502e51e5afa2a9399093a6959858f04460877e5da836702f05f6d41a5ac79b2c,2022-10-30 21:26:09,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N=9;\nint n;\nint array[N];\nbool used[N];\nvoid dfs(int u){\n    if(u>n){\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){\n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,153,1016
1586711321403854848,8db2000cf7c3e02af9215a4fcbb6e3ce6d495db1a18c93856098d76b97be2c6d,2022-10-30 21:27:13,C++,6.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 10;\n\nint n;\n\nint dfs(int u, int nums[], bool st[])\n{\n    if (u > n)\n    {\n        for (int i = 1; i <= n; i ++ ) \n            if (i == n)\n                printf(\""%d\"", nums[i]);\n            else\n                printf(\""%d \"", nums[i]);\n        puts(\"" \"");       \n    }\n    else \n    {\n        for (int i = 1; i <= n; i ++ )\n            if (!st[i])\n            {\n                st[i] = true;\n                nums[u] = i;\n                dfs(u + 1, nums, st);\n                st[i] = false;\n            }\n    }\n}\n\nint main() {\n    scanf(\""%d\"", &n);\n    \n    int nums[N];\n    bool st[n] = {0};\n    \n    dfs(1, nums, st);\n    \n    return 0;\n}",PARTIAL_ACCEPTED,26,580
1586711657271136256,8db2000cf7c3e02af9215a4fcbb6e3ce6d495db1a18c93856098d76b97be2c6d,2022-10-30 21:28:33,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 10;\n\nint n;\n\nint dfs(int u, int nums[], bool st[])\n{\n    if (u > n)\n    {\n        for (int i = 1; i <= n; i ++ ) \n            if (i == n)\n                printf(\""%d\"", nums[i]);\n            else\n                printf(\""%d \"", nums[i]);\n        puts(\"" \"");       \n    }\n    else \n    {\n        for (int i = 1; i <= n; i ++ )\n            if (!st[i])\n            {\n                st[i] = true;\n                nums[u] = i;\n                dfs(u + 1, nums, st);\n                st[i] = false;\n            }\n    }\n}\n\nint main() {\n    scanf(\""%d\"", &n);\n    \n    long nums[N];\n    bool st[n] = {0};\n    \n    dfs(1, nums, st);\n    \n    return 0;\n}",COMPILE_ERROR,0,0
1586711919125725184,ca5cef06c929b0147ba43c55f0f55749880285daf223f6c0cef29be0e7b5d9b0,2022-10-30 21:29:35,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n\nusing namespace std;\n\nint n;\n\nint arr[30];\n\nbool vis[30];\n\nvoid dfs(int cur)\n\n{\n\n    if(cur == n + 1) {\n\n        for(int i = 1; i <= n; ++i) cout << arr[i] << \"" \"";\n\n        puts(\""\"");\n\n        return;\n\n    }\n\n    for(int i = 1; i <= n; ++i) {\n\n        if(vis[i]) continue;\n\n        arr[cur] = i;\n\n        vis[i] = true;\n\n        dfs(cur + 1);\n\n        vis[i] = false; \n\n    }\n\n}\n\nint main()\n\n{\n\n    cin >> n;\n\n    dfs(1);\n\n    return 0;\n\n}",ACCEPTED,290,7104
1586712002491715584,8db2000cf7c3e02af9215a4fcbb6e3ce6d495db1a18c93856098d76b97be2c6d,2022-10-30 21:29:55,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 10;\n\nint n;\n\nint dfs(int u, int nums[], bool st[])\n{\n    if (u > n)\n    {\n        for (int i = 1; i <= n; i ++ ) \n            if (i == n)\n                printf(\""%d\"", nums[i]);\n            else\n                printf(\""%d \"", nums[i]);\n        puts(\"" \"");       \n    }\n    else \n    {\n        for (int i = 1; i <= n; i ++ )\n            if (!st[i])\n            {\n                st[i] = true;\n                nums[u] = i;\n                dfs(u + 1, nums, st);\n                st[i] = false;\n            }\n    }\n}\n\nint main() {\n    scanf(\""%d\"", &n);\n    \n    long nums[N];\n    bool st[n] = {0};\n    \n    dfs(1, nums, st);\n    \n    return 0;\n}",COMPILE_ERROR,0,0
1586712121245040640,8db2000cf7c3e02af9215a4fcbb6e3ce6d495db1a18c93856098d76b97be2c6d,2022-10-30 21:30:24,C++,6.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 10;\n\nint n;\n\nint dfs(int u, int nums[], bool st[])\n{\n    if (u > n)\n    {\n        for (int i = 1; i <= n; i ++ ) \n            if (i == n)\n                printf(\""%d\"", nums[i]);\n            else\n                printf(\""%d \"", nums[i]);\n        puts(\"" \"");       \n    }\n    else \n    {\n        for (int i = 1; i <= n; i ++ )\n            if (!st[i])\n            {\n                st[i] = true;\n                nums[u] = i;\n                dfs(u + 1, nums, st);\n                st[i] = false;\n            }\n    }\n}\n\nint main() {\n    scanf(\""%d\"", &n);\n    \n    int nums[N];\n    bool st[n] = {0};\n    \n    dfs(1, nums, st);\n    \n    return 0;\n}",PARTIAL_ACCEPTED,28,676
1586712249095815168,8db2000cf7c3e02af9215a4fcbb6e3ce6d495db1a18c93856098d76b97be2c6d,2022-10-30 21:30:54,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 10;\n\nint n;\n\nvoid dfs(int u, int nums[], bool st[])\n{\n    if (u > n)\n    {\n        for (int i = 1; i <= n; i ++ ) printf(\""%d \"", nums[i]);\n        puts(\""\"");\n    }\n    else\n    {\n        for (int i = 1; i <= n; i ++ )\n            if (!st[i])\n            {\n                st[i] = true;\n                nums[u] = i;\n                dfs(u + 1, nums, st);\n                st[i] = false;  // 恢复现场\n            }\n    }\n}\n\nint main()\n{\n    scanf(\""%d\"", &n);\n\n    int nums[N];\n    bool st[N] = {0};\n\n    dfs(1, nums, st);\n\n    return 0;\n}\n",ACCEPTED,283,7224
1586712520618283008,8db2000cf7c3e02af9215a4fcbb6e3ce6d495db1a18c93856098d76b97be2c6d,2022-10-30 21:31:59,C++,6.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 10;\n\nint n;\n\nvoid dfs(int u, int nums[], bool st[])\n{\n    if (u > n)\n    {\n        for (int i = 1; i <= n; i ++ ) \n            if (i == n)\n                printf(\""%d\"", nums[i]);\n            else\n                printf(\""%d \"", nums[i]);\n        puts(\"" \"");       \n    }\n    else \n    {\n        for (int i = 1; i <= n; i ++ )\n            if (!st[i])\n            {\n                st[i] = true;\n                nums[u] = i;\n                dfs(u + 1, nums, st);\n                st[i] = false;\n            }\n    }\n}\n\nint main() {\n    scanf(\""%d\"", &n);\n    \n    int nums[N];\n    bool st[n] = {0};\n    \n    dfs(1, nums, st);\n    \n    return 0;\n}",PARTIAL_ACCEPTED,31,464
1586712664742948864,8db2000cf7c3e02af9215a4fcbb6e3ce6d495db1a18c93856098d76b97be2c6d,2022-10-30 21:32:33,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 10;\n\nint n;\n\nvoid dfs(int u, int nums[], bool st[])\n{\n    if (u > n)\n    {\n        for (int i = 1; i <= n; i ++ ) printf(\""%d \"", nums[i]);\n        puts(\"" \"");       \n    }\n    else \n    {\n        for (int i = 1; i <= n; i ++ )\n            if (!st[i])\n            {\n                st[i] = true;\n                nums[u] = i;\n                dfs(u + 1, nums, st);\n                st[i] = false;\n            }\n    }\n}\n\nint main() {\n    scanf(\""%d\"", &n);\n    \n    int nums[N];\n    bool st[n] = {0};\n    \n    dfs(1, nums, st);\n    \n    return 0;\n}",MULTIPLE_ERROR,31,628
1586712805466050560,8db2000cf7c3e02af9215a4fcbb6e3ce6d495db1a18c93856098d76b97be2c6d,2022-10-30 21:33:07,C++,6.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 10;\n\nint n;\n\nvoid dfs(int u, int nums[], bool st[])\n{\n    if (u > n)\n    {\n        for (int i = 1; i <= n; i ++ ) printf(\""%d \"", nums[i]);\n        puts(\""\"");       \n    }\n    else \n    {\n        for (int i = 1; i <= n; i ++ )\n            if (!st[i])\n            {\n                st[i] = true;\n                nums[u] = i;\n                dfs(u + 1, nums, st);\n                st[i] = false;\n            }\n    }\n}\n\nint main() {\n    scanf(\""%d\"", &n);\n    \n    int nums[N];\n    bool st[n] = {0};\n    \n    dfs(1, nums, st);\n    \n    return 0;\n}",PARTIAL_ACCEPTED,28,456
1586713002296344576,8db2000cf7c3e02af9215a4fcbb6e3ce6d495db1a18c93856098d76b97be2c6d,2022-10-30 21:33:54,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 10;\n\nint n;\n\nvoid dfs(int u, int nums[], bool st[])\n{\n    if (u > n)\n    {\n        for (int i = 1; i <= n; i ++ ) printf(\""%d \"", nums[i]);\n        puts(\""\"");       \n    }\n    else \n    {\n        for (int i = 1; i <= n; i ++ )\n            if (!st[i])\n            {\n                st[i] = true;\n                nums[u] = i;\n                dfs(u + 1, nums, st);\n                st[i] = false;\n            }\n    }\n}\n\nint main() {\n    scanf(\""%d\"", &n);\n    \n    int nums[N];\n    bool st[N] = {0};\n    \n    dfs(1, nums, st);\n    \n    return 0;\n}",PARTIAL_ACCEPTED,456,7144
1586713260606746624,8db2000cf7c3e02af9215a4fcbb6e3ce6d495db1a18c93856098d76b97be2c6d,2022-10-30 21:34:55,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 10;\n\nint n;\n\nvoid dfs(int u, int nums[], bool st[])\n{\n    if (u > n)\n    {\n        for (int i = 1; i <= n; i ++ ) printf(\""%d \"", nums[i]);\n        puts(\""\"");\n    }\n    else\n    {\n        for (int i = 1; i <= n; i ++ )\n            if (!st[i])\n            {\n                st[i] = true;\n                nums[u] = i;\n                dfs(u + 1, nums, st);\n                st[i] = false;  // 恢复现场\n            }\n    }\n}\n\nint main() {\n    scanf(\""%d\"", &n);\n    \n    int nums[N];\n    bool st[N] = {0};\n    \n    dfs(1, nums, st);\n    \n    return 0;\n}",ACCEPTED,363,7256
1586713443331608576,8db2000cf7c3e02af9215a4fcbb6e3ce6d495db1a18c93856098d76b97be2c6d,2022-10-30 21:35:39,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 10;\n\nint n;\n\nvoid dfs(int u, int nums[], bool st[])\n{\n    if (u > n)\n    {\n        for (int i = 1; i <= n; i ++ ) printf(\""%d \"", nums[i]);\n        puts(\""\"");       \n    }\n    else \n    {\n        for (int i = 1; i <= n; i ++ )\n            if (!st[i])\n            {\n                st[i] = true;\n                nums[u] = i;\n                dfs(u + 1, nums, st);\n                st[i] = false;\n            }\n    }\n}\n\nint main() {\n    scanf(\""%d\"", &n);\n    \n    int nums[N];\n    bool st[N] = {0};\n    \n    dfs(1, nums, st);\n    \n    return 0;\n}",ACCEPTED,305,7148
1586713500994895872,8db2000cf7c3e02af9215a4fcbb6e3ce6d495db1a18c93856098d76b97be2c6d,2022-10-30 21:35:53,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n\nusing namespace std;\n\nconst int N = 10;\n\nint n;\n\nvoid dfs(int u, int nums[], bool st[])\n{\n    if (u > n)\n    {\n        for (int i = 1; i <= n; i ++ ) printf(\""%d \"", nums[i]);\n        puts(\""\"");       \n    }\n    else \n    {\n        for (int i = 1; i <= n; i ++ )\n            if (!st[i])\n            {\n                st[i] = true;\n                nums[u] = i;\n                dfs(u + 1, nums, st);\n                st[i] = false;\n            }\n    }\n}\n\nint main() {\n    scanf(\""%d\"", &n);\n    \n    int nums[N];\n    bool st[N] = {0};\n    \n    dfs(1, nums, st);\n    \n    return 0;\n}",ACCEPTED,298,7252
1586719375209926656,3cd22aa359d814d2c981a34780cb6771589a1157d3a2d4a97008138cbfa8ada1,2022-10-30 21:59:13,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n,m,a[20],book[20];\nvoid dfs(int step)\n{\n    if(step==m)\n    {\n        for(int i=0;i<step;i++)\n            cout<<a[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!book[i]&&i>a[step-1])\n        {\n            a[step]=i;\n            book[i]=1;\n            dfs(step+1);\n            book[i]=0;\n        }\n    }\n}\nint main()\n{\n    cin>>n>>m;\n    dfs(0);\n    return 0;\n}\n",WRONG_ANSWER,29,472
1586719635630067712,3cd22aa359d814d2c981a34780cb6771589a1157d3a2d4a97008138cbfa8ada1,2022-10-30 22:00:15,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n/**\n * 方法采用\n * 依次枚举每个位置放哪个数\n * \n*/\nint n;\nconst int N = 9;\nint datas[N] = {0};    // 数据状态数组，0表示还没有被选择，1表示被选择了\nint loc[N]   = {0};    // 位置状态数组，0表示还没有被安排，否则表示被安排了\n \nvoid dfs(int m){      // m表示到第几个位置了\n    if(m > n){        // 到深度递归的底部了，输出来并且结束递归\n        for(int i = 1; i <= n;++i)\n            printf(\""%d \"",loc[i]);\n        getchar();\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i = 1; i<= n;++i){    // 依次枚举当前位置可以选择的数据，采用dfs深度递归\n        if(datas[i] == 0){\n            loc[m]   = i;   // 当前位置安排当前未选择的最小的数\n            datas[i] = 1;   // 当前被选中的数的状态变为1\n            dfs(m + 1);\n            // 现场恢复\n            datas[i] = 0;\n            loc[m]   = 0;\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,106,1296
1586721244552495104,a79778fa001bacd4c6b3eb16cb7f1b34c3f97d34e0e55f8c6bd6b37e8c74a675,2022-10-30 22:06:39,C,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\n \nint num[1000];\nint a;\nint f(int b,int c)\n{\n    if(b==a)\n    {\n        for(int i=0;i<a;i++)\n        printf(\""%d \"",num[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    else\n    {\n        for(int i = 1;i<=a;i++)\n        {\n            if (!((c>>i)&1))\n            {\n                num[b++]=i;\n                f(b,c|1<<i);\n                b--;\n            }\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&a);\n    f(0,0);\n}\n",ACCEPTED,298,6936
1586721313502658560,a79778fa001bacd4c6b3eb16cb7f1b34c3f97d34e0e55f8c6bd6b37e8c74a675,2022-10-30 22:06:55,C,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint num[1000];\nint a;\nint f(int b,int c)\n{\n    if(b==a)\n    {\n        for(int i=0;i<a;i++)\n        printf(\""%d \"",num[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    else\n    {\n        for(int i = 1;i<=a;i++)\n        {\n            if (!((c>>i)&1))\n            {\n                num[b++]=i;\n                f(b,c|1<<i);\n                b--;\n            }\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&a);\n    f(0,0);\n}\n",ACCEPTED,305,7032
1586721426660782080,a79778fa001bacd4c6b3eb16cb7f1b34c3f97d34e0e55f8c6bd6b37e8c74a675,2022-10-30 22:07:22,C,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\nint num[1000];\nint a;\nint f(int b,int c)\n{\n    if(b==a)\n    {\n        for(int i=0;i<a;i++)\n        printf(\""%d \"",num[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    else\n    {\n        for(int i=1;i<=a;i++)\n        {\n            if (!((c>>i)&1))\n            {\n                num[b++]=i;\n                f(b,c|1<<i);\n                b--;\n            }\n        }\n    }\n}\nint main()\n{\n    scanf(\""%d\"",&a);\n    f(0,0);\n}\n",ACCEPTED,352,6972
1586721757943693312,f57ba7c4f2f7b225a259df9d1e596454da19c1e8e16d00ea4081460b2c9ba110,2022-10-30 22:08:41,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n,m;\nvector<int> f;//vector好像更快 玄学\nvoid dfs(int k)\n{\n    if(f.size()>m||n-k+1+f.size()<m) return;\n    if(k>n)\n    {\n        for(int i=0;i<f.size();i++)\n            printf(\""%d \"",f.at(i));\n        printf(\""\\n\"");\n        return;\n    }\n    f.push_back(k);\n    dfs(k+1);\n    f.pop_back();\n    dfs(k+1);\n}\nint main()\n{\n    scanf(\""%d%d\"",&n,&m);\n    dfs(1);\n    return 0;\n}",WRONG_ANSWER,24,484
1586724594589233152,fc376450afc0a881990795f0aa6e96d68a9345cb067b978090475ad4064c8cdb,2022-10-30 22:19:57,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N=9;\nint n;\nint array[N];\nbool used[N];\nvoid dfs(int u){\n    if(u>n){\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){\n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,163,996
1586724622007398400,fc376450afc0a881990795f0aa6e96d68a9345cb067b978090475ad4064c8cdb,2022-10-30 22:20:04,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N=9;\nint n;\nint array[N];\nbool used[N];\nvoid dfs(int u){\n    if(u>n){\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){\n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,157,1064
1586731786168041472,b52153d79e400c0a5b1f9568630447bd1c6d1ed1de40d87ee22825c69dff8765,2022-10-30 22:48:32,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint a[10],b[10]={0};\nint n;\nvoid px(int x)\n{\n\tint i;\n\tif(x>n)\n\t{\n\t\tfor(i=1;i<=n;i++)\n\t\t\tcout<<a[i];\n\t\tcout<<endl;\n\t\treturn;\n\t}\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(!b[i])\n\t\t{\n\t\t\tb[i]=1;a[x]=i;\n\t\t\tpx(x+1);\n\t\t\tb[i]=0;\n\t\t}\n\t}\n}\nint main()\n{\n\tint i;\n    cin>>n;\n\twhile(n!=EOF)\n\t{\n\t\tpx(1);\n\t}\n\treturn 0;\n}",TIME_LIMIT_EXCEEDED,2000,1976
1586732416601292800,b52153d79e400c0a5b1f9568630447bd1c6d1ed1de40d87ee22825c69dff8765,2022-10-30 22:51:02,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint a[10],book[10]={0};\nint n;\nvoid dfs(int x)\n{\n\tint i;\n\tif(x>n)\n\t{\n\t\tfor(i=1;i<=n;i++)\n\t\t\tprintf(\""%d \"",a[i]);\n\t\tprintf(\""\\n\"");\n\t\treturn;\n\t}\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tif(!book[i])\n\t\t{\n\t\t\tbook[i]=1;a[x]=i;\n\t\t\tdfs(x+1);\n\t\t\tbook[i]=0;\n\t\t}\n\t}\n}\nint main()\n{\n\tint i;\n\twhile(scanf(\""%d\"",&n)!=EOF)\n\t{\n\t\tdfs(1);\n\t}\n\treturn 0;\n}",ACCEPTED,328,7064
1586732994282778624,d05531bb6ab60a34101a9889560981f1b2b48bef43c4c7d68c1df569f2ad6016,2022-10-30 22:53:20,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\nusing namespace std;\nint n;\nconst int N=10;\nint  st[N],used[N];\nvoid dfs(int u)\n{\n    if(u>(n-1))\n    {\n        for(int i=0;i<n;i++) cout<<st[i]<<' ';\n        cout<<endl;\n        return ;\n        \n    }\n    for(int i=0;i<n;i++)\n    {\n        if(!used[i])\n        {\n        st[u]=i+1;\n        used[i]=true;\n        dfs(u+1);\n        st[u]=0;\n        used[i]=false;\n        }\n    }\n}\nint main()\n{\n    cin>>n;\n    dfs(0);\n}",PARTIAL_ACCEPTED,537,3128
1586734609454723072,53fed3c92e93e31a1d81b2dfe2486f5123318071fa22bfd37d0ab8cac4a97dab,2022-10-30 22:59:45,C,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\n \nint num[1000];\nint a;\nvoid f(int b,int c){\n    if(b==a){\n        for(int i=0;i<a;i++){\n            printf(\""%d \"",num[i]);\n        }\n        printf(\""\\n\"");\n        return;\n    }\n    else{\n        for(int i = 1;i<=a;i++){\n            if (!((c>>i)&1)){\n                num[b++]=i;\n                f(b,c|1<<i);\n                b--;\n            }\n        }\n    }\n}\nint main(){\n    scanf(\""%d\"",&a);\n    f(0,0);\n    return 0;\n}",ACCEPTED,282,6948
1586735374969733120,7d11b70beace7c94cd1a0dcfa3ca06b6db0bc549e5c9b2fd0e91423d81f07f43,2022-10-30 23:02:48,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<cstdio>\n#include<iostream>\nint n;\nbool a[10];\nint array[10];\nvoid dfs(int k)\n{\n    if(k==n)\n    {\n        for(int i=0;i<n;i++)\n            printf(\""%d \"",array[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!a[i])\n        {\n            a[i]=true;\n            array[k]=i;\n           \n            dfs(k+1);\n            a[i]=false;\n            array[k]=0;\n        }\n    }\n    \n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(0);\n    return 0;\n}\n",ACCEPTED,291,7096
1586736458551390208,d875412699f37cfec26f4a4d5adc0a9d0617c16b68c267960b2343462666e0b2,2022-10-30 23:07:06,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<stdio.h>\n\nint main(){\n    int n;\n    scanf(\""%d\"",&n);\n    int perm[n];\n    for(int i = 0; i<n; i++){\n        perm[i] = i+1;\n    }\n    \n    do{\n        for(int i = 0; i<n;i++){\n            printf(\""%d \"", perm[i]);\n        }\n        printf(\""\\n\"");\n    }while(next_permutation(perm, perm+n));\n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1586736696443932672,a443212ec80869e4771d7ff4543b4c1581812773d6fae4d0e874a8a8afcfb511,2022-10-30 23:08:03,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\n \nconst int N=9;\nint n;\nint array[N];\nbool used[N];\n \nvoid dfs(int u){\n    if(u>n){\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){ \n               array[u]=i;\n               used[i]=true;\n               dfs(u+1);\n               \n              \n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}",PARTIAL_ACCEPTED,153,1016
1586736739926278144,d875412699f37cfec26f4a4d5adc0a9d0617c16b68c267960b2343462666e0b2,2022-10-30 23:08:13,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint main(){\n    int n;\n    cin>>n;\n    int perm[n];\n    \n    for(int i = 0; i<n; i++){\n        perm[i] = i+1;\n    }\n    \n    do{\n        for(int i = 0; i<n;i++){\n            printf(\""%d \"", perm[i]);\n        }\n        printf(\""\\n\"");\n    }while(next_permutation(perm, perm+n));\n    \n    \n    return 0;\n}",COMPILE_ERROR,0,0
1586736849707991040,d875412699f37cfec26f4a4d5adc0a9d0617c16b68c267960b2343462666e0b2,2022-10-30 23:08:39,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nint main(){\n    int n;\n    cin>>n;\n    int perm[n];\n    \n    for(int i = 0; i<n; i++){\n        perm[i] = i+1;\n    }\n    \n    do{\n        for(int i = 0; i<n;i++){\n            printf(\""%d \"", perm[i]);\n        }\n        printf(\""\\n\"");\n    }while(next_permutation(perm, perm+n));\n    \n    \n    return 0;\n}",ACCEPTED,311,7128
1586737395873484800,bd60b46b99817e2f961a5125f27b5767dbd4b0f54969531d56705febbb92fc23,2022-10-30 23:10:49,C,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n#include <cstdio>\n\nusing namespace std;\n\nconst int N = 20;\n\nint n; \nbool used[N]; \nint path[N];\n\nvoid solve(int idx)\n{\n    if (idx == n + 1)\n    {\n        for (int i = 1; i <= n; i++)\n        {\n            printf(\""%d \"", path[i]);\n        }\n        puts(\""\"");\n        return;\n\t}\n\t\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t    if (used[i]) continue;\n\t    \n\t    used[i] = true;\n\t    path[idx] = i;\n\t    \n\t\tsolve(idx + 1);\n\t\t\n\t\tused[i] = false;\n\t\tpath[idx] = 0; \n\t}\n}\n\nint main()\n{\n    scanf(\""%d\"", &n);\n    \n    solve(1);\n    \n    return 0;\n}\n",COMPILE_ERROR,0,0
1586737414320025600,bd60b46b99817e2f961a5125f27b5767dbd4b0f54969531d56705febbb92fc23,2022-10-30 23:10:54,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n#include <cstdio>\n\nusing namespace std;\n\nconst int N = 20;\n\nint n; \nbool used[N]; \nint path[N];\n\nvoid solve(int idx)\n{\n    if (idx == n + 1)\n    {\n        for (int i = 1; i <= n; i++)\n        {\n            printf(\""%d \"", path[i]);\n        }\n        puts(\""\"");\n        return;\n\t}\n\t\n\tfor (int i = 1; i <= n; i++)\n\t{\n\t    if (used[i]) continue;\n\t    \n\t    used[i] = true;\n\t    path[idx] = i;\n\t    \n\t\tsolve(idx + 1);\n\t\t\n\t\tused[i] = false;\n\t\tpath[idx] = 0; \n\t}\n}\n\nint main()\n{\n    scanf(\""%d\"", &n);\n    \n    solve(1);\n    \n    return 0;\n}\n",ACCEPTED,301,7124
1586738565643898880,2215a904a47af5bed52b2644ce1d85c7cf2c638c9684585ba56174a9d4b44e23,2022-10-30 23:15:28,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<iostream>\nusing namespace std;\nconst int N = 10;\nint n;\nint x[N];\nint used[N];\nvoid func(int k);\nbool jianzhi(int k, int i);\nint main()\n{\n    cin >> n;\n    func(1);\n    system(\""pause\"");\n    return 0;\n}\n\nvoid func(int k)\n{\n    if (k == n + 1)\n    {\n        for (int i = 1; i <= n; i++)\n            cout << x[i]<<\"" \"";\n        cout << endl;\n    }\n    else\n    {\n        for (int i = 1; i <= n; i++)\n        {\n            if (jianzhi(k, i))\n            {\n                x[k] = i;\n                used[i] = 1;\n                func(k + 1);\n                used[i] = 0;\n            }\n        }\n    }\n}\nbool jianzhi(int k, int i)\n{\n    if (used[i] == 1)\n        return false;\n    return true;\n}",PARTIAL_ACCEPTED,533,3284
1586739105622781952,41c5157e8e950d356c3e1bb840a5e5fe1cad23533c11c5a060ad60c47e496518,2022-10-30 23:17:37,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\nusing namespace std;\nint q[110],n,vis[110];\nvoid dfs(int x){\n    if (q[0] == n){\n        for (int i = 1;i <= q[0];i++){\n        cout << q[i] << \"" \"";\n}\n        puts(\""\"");\n        return ;\n    }\n    for (int i = 1;i <= n;i++)\n        if (!vis[i]){\n            vis[i] = 1;\n            q[++q[0]] = i;\n            dfs(i+1);\n            q[q[0]--] = 0;\n            vis[i] = 0;\n        }\n    return ;\n}\nint main(){\n    cin >> n;\n    dfs(1);\n    return 0\n}\n",COMPILE_ERROR,0,0
1586739129232519168,41c5157e8e950d356c3e1bb840a5e5fe1cad23533c11c5a060ad60c47e496518,2022-10-30 23:17:43,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\nusing namespace std;\nint q[110],n,vis[110];\nvoid dfs(int x){\n    if (q[0] == n){\n        for (int i = 1;i <= q[0];i++){\n        cout << q[i] << \"" \"";\n}\n        puts(\""\"");\n        return ;\n    }\n    for (int i = 1;i <= n;i++)\n        if (!vis[i]){\n            vis[i] = 1;\n            q[++q[0]] = i;\n            dfs(i+1);\n            q[q[0]--] = 0;\n            vis[i] = 0;\n        }\n    return ;\n}\nint main(){\n    cin >> n;\n    dfs(1);\n    return 0\n}\n",COMPILE_ERROR,0,0
1586739268940595200,41c5157e8e950d356c3e1bb840a5e5fe1cad23533c11c5a060ad60c47e496518,2022-10-30 23:18:16,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\nusing namespace std;\nint q[110],n,vis[110];\nvoid dfs(int x){\n    if (q[0] == n){\n        for (int i = 1;i <= q[0];i++){\n        cout << q[i] << \"" \"";\n}\n        puts(\""\"");\n        return ;\n    }\n    for (int i = 1;i <= n;i++)\n        if (!vis[i]){\n            vis[i] = 1;\n            q[++q[0]] = i;\n            dfs(i+1);\n            q[q[0]--] = 0;\n            vis[i] = 0;\n        }\n    return ;\n}\nint main(){\n    cin >> n;\n    dfs(1);\n    return 0;\n}\n",ACCEPTED,287,7216
1586740394532409344,2215a904a47af5bed52b2644ce1d85c7cf2c638c9684585ba56174a9d4b44e23,2022-10-30 23:22:44,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<cstdio>\n#include<iostream>\nint n;\nbool a[10];\nint array[10];\nvoid dfs(int k)\n{\n    if(k==n)\n    {\n        for(int i=0;i<n;i++)\n            printf(\""%d \"",array[i]);\n        printf(\""\\n\"");\n        return;\n    }\n    for(int i=1;i<=n;i++)\n    {\n        if(!a[i])\n        {\n            a[i]=true;\n            array[k]=i;\n           \n            dfs(k+1);\n            a[i]=false;\n            array[k]=0;\n        }\n    }\n    \n}\nint main()\n{\n    scanf(\""%d\"",&n);\n    dfs(0);\n    return 0;\n}\n",ACCEPTED,307,7160
1586744095305232384,c77bf0310d967b8b95413ee0d116bad73bfe46feff12f1b7c56946e528e07a74,2022-10-30 23:37:27,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n#include <algorithm>\nusing namespace std;\nint main(){\n    int n;\n    cin>>n;\n    int perm[n];\n    \n    for(int i = 0; i<n; i++){\n        perm[i] = i+1;\n    }\n    \n    do{\n        for(int i = 0; i<n;i++){\n            printf(\""%d \"", perm[i]);\n        }\n        printf(\""\\n\"");\n    }while(next_permutation(perm, perm+n));\n    return 0;\n}\n",ACCEPTED,280,7180
1586744592690974720,073070b725140dadc9d26f2ef38e8162f8e118ae7f78df0591762820acfc604c,2022-10-30 23:39:25,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\nusing namespace std;\n\nint n;\nconst int N = 9;\nint state[N];\nint used[N]; \n\nvoid dfs(int u){\n\n    if(u == n){ \n        for(int i = 0;i < n;i++){ \n            printf(\""%d \"",state[i]);\n        }\n        printf(\""\\n\"");\n        return;\n    }\n    \n    for(int i = 0;i < n ;i ++){\n        if(!used[i + 1]){\n            state[u] = i + 1;\n            used[i + 1] = true; \n            dfs(u + 1);\n            state[u] = 0;\n            used[i + 1] = false;\n        }\n    }\n}\n\nint main(){\n    cin >> n;\n    dfs(0);\n    return 0;\n}\n",ACCEPTED,307,7032
1586745627262185472,2d79c2d070051b0efa2cf6e1615b7db7ff1cbe0cc5763b835e4a6adb3abb5d34,2022-10-30 23:43:32,C++,0.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h> \nusing namespace std;\nint n;\nint ans[15];\nint use[15];\nvoid dfs(int x){\n    if(x > n){\n        for(int i = 1;i <= n;i++){\n            printf(\""%d \"",ans[i]);\n        }\n        puts(\""\"");\n        return;\n    }\n    for(int i = 1;i <= n;i++){\n        if(!use[i]){\n            ans[x] = i;\n            }\n            use[i] = 1;\n            dfs(x + 1);\n            use[i] = 0;\n        }\n    }\n}\nint main(){\n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}\n",COMPILE_ERROR,0,0
1586745867440623616,2d79c2d070051b0efa2cf6e1615b7db7ff1cbe0cc5763b835e4a6adb3abb5d34,2022-10-30 23:44:29,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h> \nusing namespace std;\nint n;\nint ans[15];\nint use[15];\nvoid dfs(int x){\n    if(x > n){\n        for(int i = 1;i <= n;i++){\n            printf(\""%d \"",ans[i]);\n        }\n        puts(\""\"");\n        return;\n    }\n    for(int i = 1;i <= n;i++){\n        if(!use[i]){\n            ans[x] = i; \n            use[i] = 1;\n            dfs(x + 1);\n            use[i] = 0;\n        }\n    }\n}\nint main(){\n    scanf(\""%d\"",&n);\n    dfs(1);\n    return 0;\n}\n",ACCEPTED,301,7132
1586746756297519104,24895ae9afc421bb8bbeb207cbe44a2649e485519fd21e144a3cebb0081deb96,2022-10-30 23:48:01,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include <iostream>\n#include <algorithm>\nusing namespace std;\nint main(){\n    int n;\n    cin>>n;\n    int perm[n];\n    for(int i = 0; i<n; i++){\n        perm[i] = i+1;\n    }\n    do{\n        for(int i = 0; i<n;i++){\n            printf(\""%d \"", perm[i]);\n        }\n        printf(\""\\n\"");\n    }while(next_permutation(perm, perm+n));\n}\n",ACCEPTED,277,7096
1586747571368235008,2cd82957f579fcda605a20153d86667a5f7db2443465f9fd2efc7960ebd8b451,2022-10-30 23:51:16,C++,8.0,1584250325531770884,1574307941233045504,1418168535107559424,"//填坑\n#include<iostream>\nusing namespace std;\n \nconst int N=9;\nint n;//输入多少个数据\nint array[N];//定义输出数组\nbool used[N];//判断该值是否被使用过\n \nvoid dfs(int u){\n    if(u>n){//如果所有位置都满了，就输出数组\n        for(int i=1;i<=n;i++)\n            cout<<array[i]<<\"" \"";\n        cout<<endl;\n        return;\n    }\n    \n    for(int i=1;i<=n;i++){\n        if(!used[i]){ //如果这个数没有被用过 false\n               array[u]=i;//在数组的第u个位置插入\n               used[i]=true;//将该数设置为已使用\n               dfs(u+1);//开始选下一个位置的数字\n               \n               //初始化\n               array[u]=0;\n               used[i]=false;\n        } \n        \n    }\n    \n}\n \nint main(){\n    cin>>n;\n    dfs(1);\n    return 0;\n}\n",PARTIAL_ACCEPTED,145,1096
1586747832023252992,57ec9e56f000ea5ed20a70d34a9f61abf23adebd3d4e2dc35d08d07a6a852b84,2022-10-30 23:52:18,C++,10.0,1584250325531770884,1574307941233045504,1418168535107559424,"#include<bits/stdc++.h>\n#include<algorithm>\nusing namespace std;\nint main()\n{\n    int n,i;\n    cin>>n;\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        a[i]=i+1;\n    }\n    do{\n        for(i=0;i<n;i++)\n        {\n            cout<<a[i]<<\"" \"";\n        }\n        cout<<\""\\n\"";\n    }while(next_permutation(a,a+n));\n}",ACCEPTED,266,7344
1443016989094969344,d4039e06060636463e0cf7bd7abdb671433ff184ae738b244d54983881140a1a,2021-09-29 08:57:14,Haskell,10.0,1422725545607540736,1422724542992723968,1418168958937784320,module Main where\n\nmain :: IO ()\nmain = do\n      a <- getLine\n      let b = read a :: Int\n      c <- getLine\n      let d = read c :: Int\n      print $ max b d,ACCEPTED,24,1088
1443185460067958784,1835785c40bc2a8f46c98b23001b6f5b7667bf5c73464a2dc0e1cc6f3f69567b,2021-09-29 20:06:41,Haskell,10.0,1422725545607540736,1422724542992723968,1418168958937784320,module Main where\n\ngetInt:: IO Int\ngetInt = do read <$> getLine\n\nmain :: IO ()\nmain = do a <- getInt\n          b <- getInt\n          print (max a b),ACCEPTED,41,1368
1443412171536490496,4777a6382b88d268392452403993e741f89dbff811b993d5126c091b4cbc4f47,2021-09-30 11:07:33,Haskell,10.0,1422725545607540736,1422724542992723968,1418168958937784320,module Main where\n\nmain :: IO ()\nmain = do\n        a <- getLine \n        b <- getLine \n\n        let n1 = read a::Int\n        let n2 = read b::Int\n        print (max n1 n2),ACCEPTED,29,1476
1443527861932474368,f19ad8598da5f80bb8b6835c672e4e9ba852f7b405eaaf313505df98b99bbd40,2021-09-30 18:47:16,Haskell,10.0,1422725545607540736,1422724542992723968,1418168958937784320,"module Main where\n\nmain :: IO ()\nmain = \n    do\n  --     putStrLn \""please input first num\""\n       f <- getInt\n--       putStrLn \""please second first num\""\n       s <- getInt \n--       putStrLn \""the max num  is\""      \n       print (max f s)\n\n  \ngetInt :: IO Int\ngetInt =\n     do n <- getLine\n        return (read n:: Int)   \n",ACCEPTED,32,1340
1444142456896073728,e4e852f5374f5608ea9767a7901b6ea101e3dd19b8f78828d77ea99d55ccddd2,2021-10-02 11:29:27,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,module Main where\n\nmain :: IO ()\nmain = do a <- getInt\n          b <- getInt\n          print (max a b),COMPILE_ERROR,0,0
1444142583413059584,e4e852f5374f5608ea9767a7901b6ea101e3dd19b8f78828d77ea99d55ccddd2,2021-10-02 11:29:57,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,getInt :: IO Int \ngetInt = do line <- getLine\n            return (read line :: Int)\n\nmodule Main where\n\nmain :: IO ()\nmain = do a <- getInt\n          b <- getInt\n          print (max a b),COMPILE_ERROR,0,0
1444142628803776512,e4e852f5374f5608ea9767a7901b6ea101e3dd19b8f78828d77ea99d55ccddd2,2021-10-02 11:30:08,Haskell,10.0,1422725545607540736,1422724542992723968,1418168958937784320,getInt :: IO Int \ngetInt = do line <- getLine\n            return (read line :: Int)\n\nmain :: IO ()\nmain = do a <- getInt\n          b <- getInt\n          print (max a b),ACCEPTED,32,1092
1444686085096058880,52548f8d5503408f1e44c0d52f1a5ed88d10420fb787e06ceb8f7b6b41b923da,2021-10-03 23:29:38,Haskell,10.0,1422725545607540736,1422724542992723968,1418168958937784320,module Main where\n\nmain :: IO ()\nmain = do\n  a <- getLine\n  b <- getLine\n  let c = read a :: Int\n      d = read b :: Int\n  if c > d\n    then do\n        print c\n    else do\n        print d,ACCEPTED,30,1348
1446214508193234944,baba4fdaceffca4ba17053ea6e78a95f4ed2f167b524d1b454d86ac227939e98,2021-10-08 04:43:02,Haskell,10.0,1422725545607540736,1422724542992723968,1418168958937784320,module Main where\n\nmain :: IO ()\nmain = do\n  x <- getLine\n  y <- getLine\n  let a = read x :: Integer\n  let b = read y :: Integer\n  if a > b\n    then putStrLn x\n    else putStrLn y\n,ACCEPTED,29,1292
1447029700332429312,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 10:42:19,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main = do\n      putStr \""pleast input your first number\""\n      x <- getInt\n      putStr \""pleast input your sencond number\""\n      y <- getInt\n\n      putStr \"" the big num is \""\n      print    ( if x>y then x  else  y )\n",COMPILE_ERROR,0,0
1447032673225744384,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 10:54:08,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main :: IO ()\nmain = do\n      putStr \""pleast input your first number\""\n      x <- getInt\n      putStr \""pleast input your sencond number\""\n\n\n      y <- getInt\n\n  \n      putStr \"" the big num is \""\n      print    ( if x>y then x  else  y )\n\n\ngetInt :: IO Int\ngetInt = do\n    n <- getLine\n    return (read n :: Int)\n",WRONG_ANSWER,31,1348
1447033198474240000,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 10:56:13,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main :: IO ()\nmain = do\n      putStr \""pleast input your first number\""\n      x <- getInt\n      putStr \""pleast input your sencond number\""\n      y <- getInt\n\n  \n      putStr \"" the big num is \""\n      print    ( if x > y then x  else  y )\n\n\n--getInt :: IO Int\ngetInt = do\n    n <- getLine\n    return (read n :: Ord)\n",COMPILE_ERROR,0,0
1447033307094130688,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 10:56:39,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main :: IO ()\nmain = do\n      putStr \""pleast input your first number\""\n      x <- getInt\n      putStr \""pleast input your sencond number\""\n      y <- getInt\n\n  \n      putStr \"" the big num is \""\n      print  ( if x > y then x  else  y )\n\n\n--getInt :: IO Int\ngetInt = do\n    n <- getLine\n    return (read n :: Ord)\n",COMPILE_ERROR,0,0
1447033354137444352,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 10:56:50,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main :: IO ()\nmain = do\n      putStr \""pleast input your first number\""\n      x <- getInt\n      putStr \""pleast input your sencond number\""\n      y <- getInt\n\n  \n      putStr \"" the big num is \""\n      show  ( if x > y then x  else  y )\n\n\n--getInt :: IO Int\ngetInt = do\n    n <- getLine\n    return (read n :: Ord)\n",COMPILE_ERROR,0,0
1447033457619312640,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 10:57:15,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main :: IO ()\nmain = do\n      putStr \""pleast input your first number\""\n      x <- getInt\n      putStr \""pleast input your sencond number\""\n      y <- getInt\n\n  \n      putStr \"" the big num is \""\n      print  ( if x > y then x  else  y )\n\n\n--getInt :: IO Int\ngetInt = do\n    n <- getLine\n    return (read n :: Num)\n",COMPILE_ERROR,0,0
1447033878186323968,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 10:58:55,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main :: IO ()\nmain = do\n      putStr \""pleast input your first number\""\n      x <- getInt\n      putStr \""pleast input your sencond number\""\n      y <- getInt\n\n  \n      putStr \"" the big num is \""\n      print  ( if x > y then x  else  y )\n\n\n--getInt :: IO Int\ngetInt = do\n    n <- getLine\n    return (read n :: Int)\n",WRONG_ANSWER,38,1284
1447034048261201920,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 10:59:36,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"module Main where\nmain :: IO ()\nmain = do\n      putStr \""pleast input your first number\""\n      x <- getInt\n      putStr \""pleast input your sencond number\""\n      y <- getInt\n\n  \n      putStr \"" the big num is \""\n      print  ( if x > y then x  else  y )\n\n\n--getInt :: IO Int\ngetInt = do\n    n <- getLine\n    return (read n :: Int)\n",WRONG_ANSWER,39,1336
1447035079774728192,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:03:42,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"\nmain :: IO ()\nmain = do\n      --putStr \""pleast input your first number:\""\n      x <- getInt\n     -- putStr \""pleast input your sencond number:\""\n      y <- getInt\n\n  \n      putStr \"" the big num is \""\n      print    ( if x > y then x  else  y )\n\n\ngetInt :: IO Int\ngetInt = do\n    n <- getLine\n    return (read n :: Int)",WRONG_ANSWER,35,1344
1447035921751941120,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:07:03,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main = do\n    putStrLn \""pleast input your first number:\""\n    input1 <- getLine\n    putStrLn \""pleast input your sencond number:\""\n    input2 <- getLine\n    let x =  (read intput1 ::Int)\n    let y =  (read intput2 ::Int)\n    \n    print( if x > y then x  else y )",COMPILE_ERROR,0,0
1447035995231952896,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:07:20,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main = do\n    putStrLn \""pleast input your first number:\""\n    input1 <- getLine\n    putStrLn \""pleast input your sencond number:\""\n    input2 <- getLine\n    let x =  (read input1 ::Int)\n    let y =  (read input2 ::Int)\n    \n    print( if x > y then x  else y )",WRONG_ANSWER,33,1348
1447036316033294336,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:08:37,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main = do\n    putStrLn \""pleast input your first number:\""\n    input1 <- getLine\n    putStrLn \""pleast input your sencond number:\""\n    input2 <- getLine\n    let x =  (read input1 ::Int)\n    let y =  (read input2 ::Int)\n    \n    print( if x < y then x  else y )",WRONG_ANSWER,32,1092
1447036385709072384,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:08:53,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main = do\n    putStrLn \""pleast input your first number:\""\n    input1 <- getLine\n    putStrLn \""pleast input your sencond number:\""\n    input2 <- getLine\n    let x =  (read input1 ::Int)\n    let y =  (read input2 ::Int)\n    \n    return ( if x > y then x  else y )",WRONG_ANSWER,38,1240
1447036513123639296,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:09:24,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main = do\n    putStrLn \""pleast input your first number:\""\n    input1 <- getLine\n    putStrLn \""pleast input your sencond number:\""\n    input2 <- getLine\n    let x =  (read input1 ::Int)\n    let y =  (read input2 ::Int)\n    \n    return ( print (if x > y then x  else y) )",WRONG_ANSWER,33,1348
1447036917538385920,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:11:00,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main = do\n    putStrLn \""pleast input your first number:\""\n    input1 <- getLine\n    putStrLn \""pleast input your sencond number:\""\n    input2 <- getLine\n    let x =  (read input1 ::Int)\n    let y =  (read input2 ::Int)\n    \n    return  (if x > y then  read x  else read y) ",COMPILE_ERROR,0,0
1447037005690118144,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:11:21,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main = do\n    putStrLn \""pleast input your first number:\""\n    input1 <- getLine\n    putStrLn \""pleast input your sencond number:\""\n    input2 <- getLine\n    let x =  (read input1 ::Int)\n    let y =  (read input2 ::Int)\n    \n    return  (if x > y then  (read x)  else (read y) ) ",COMPILE_ERROR,0,0
1447037114003824640,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:11:47,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main = do\n    putStrLn \""pleast input your first number:\""\n    input1 <- getLine\n    putStrLn \""pleast input your sencond number:\""\n    input2 <- getLine\n    let x =  (read input1 ::Int)\n    let y =  (read input2 ::Int)\n    \n    return  (if x > y then input1 else   input2) ",WRONG_ANSWER,33,1232
1447037557597564928,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:13:33,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,"main = do\n   -- putStrLn \""pleast input your first number:\""\n    input1 <- getLine\n    --putStrLn \""pleast input your sencond number:\""\n    input2 <- getLine\n    let x =  (read input1 ::Int)\n    let y =  (read input2 ::Int)\n    \n    return  (if x > y then input1 else   input2) ",WRONG_ANSWER,29,1320
1447038251532578816,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:16:18,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,main = do\n    input1 <- getLine\n    input2 <- getLine\n    let x =  (read input1 ::Int)\n    let y =  (read input2 ::Int)\n    \n    return  (if x > y then input1 else   input2) ,WRONG_ANSWER,38,1168
1447039120852414464,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:19:45,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,main = do\n    input1 <- getLine\n    input2 <- getLine\n    let x =  (read input1 ::Int)\n    let y =  (read input2 ::Int)\n    \n    return  (max x y ) ,WRONG_ANSWER,36,1272
1447039192193376256,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:20:02,Haskell,10.0,1422725545607540736,1422724542992723968,1418168958937784320,main = do\n    input1 <- getLine\n    input2 <- getLine\n    let x =  (read input1 ::Int)\n    let y =  (read input2 ::Int)\n    \n    print $ max x y ,ACCEPTED,30,1108
1447039275064389632,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:20:22,Haskell,10.0,1422725545607540736,1422724542992723968,1418168958937784320,main = do\n    input1 <- getLine\n    input2 <- getLine\n    let x =  (read input1 ::Int)\n    let y =  (read input2 ::Int)\n    \n    print (max x y ),ACCEPTED,33,1108
1447039840716615680,d4039e06060636463e0cf7bd7abdb671433ff184ae738b244d54983881140a1a,2021-10-10 11:22:37,Haskell,10.0,1422725545607540736,1422724542992723968,1418168958937784320,module Main where\n\nmain :: IO ()\nmain = do\n      a <- getLine\n      let b = read a :: Int\n      c <- getLine\n      let d = read c :: Int\n      -- print $ max b d\n      print $ if b > d then b else d,ACCEPTED,27,1144
1447040095340228608,f36ecc1bec0526f6c7ddb640706240332290569f8fbd53ef531b519de64c68c8,2021-10-10 11:23:38,Haskell,10.0,1422725545607540736,1422724542992723968,1418168958937784320,main = do\n    input1 <- getLine\n    input2 <- getLine\n    let x =  (read input1 ::Int)\n    let y =  (read input2 ::Int)\n    \n    print (if x > y then x  else y ),ACCEPTED,35,1272
1447050764588445696,a0aff68bb2fe6a044f20c83deef7f8df3cb9d186fa405fa8db8c6d5b848492e0,2021-10-10 12:06:01,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,module Main where\n\nmain :: IO ()\nmain = do\n      x<-getChar \n      y<-getChar\n      if x>y then print x else print y,WRONG_ANSWER,30,1088
1447050996596416512,a0aff68bb2fe6a044f20c83deef7f8df3cb9d186fa405fa8db8c6d5b848492e0,2021-10-10 12:06:57,Haskell,0.0,1422725545607540736,1422724542992723968,1418168958937784320,module Main where\n\nmain :: IO ()\nmain = do\n      x<-getLine \n      y<-getLine\n      if x>y then print x else print y,WRONG_ANSWER,44,1312
1447051853857628160,a0aff68bb2fe6a044f20c83deef7f8df3cb9d186fa405fa8db8c6d5b848492e0,2021-10-10 12:10:21,Haskell,8.0,1422725545607540736,1422724542992723968,1418168958937784320,module Main where\n\nmain :: IO ()\nmain = do\n      x<-getLine\n      y<-getLine\n      if x>y then putStrLn  x else putStrLn  y\n\n,PARTIAL_ACCEPTED,37,1320
1447054722224648192,a0aff68bb2fe6a044f20c83deef7f8df3cb9d186fa405fa8db8c6d5b848492e0,2021-10-10 12:21:45,Haskell,10.0,1422725545607540736,1422724542992723968,1418168958937784320,module Main where\n\nmain :: IO ()\nmain = do\n    x<-getLine\n    y<-getLine\n    let xs =read x ::Int; ys =read y ::Int\n    if xs>ys then putStrLn x\n        else putStrLn y,ACCEPTED,27,1116
1437805034392248320,5c33cd04d3bfbe3eb7f163ac8f01bf6c93be49892e110c83dd8735aca336cb5c,2021-09-14 23:46:47,C++,0.0,1437365303577604096,1435828688596889600,1418168791525941248,"#include <bits/stdc++.h>\nusing namespace std;\nint step;\nint to[8][2] = {-1,2,-2,1,-2,-1,-1,-2,1,-2,2,-1,2,1,1,2};\nint mapp[10][10], ex,ey;\nchar s1[5],s2[5];\n\nstruct node\n{\n\tint x, y, step; \n};\n\nint check (int x, int y)\n{\n\tif (x < 0 || y < 0 || x >= 8 || y >= 8 || mapp[x][y])\n    return 1;\n    return 0;\n}\nint BFS()\n{\n\tint i;\n\tqueue <node> Q;\n\tnode p; node q;node next;\n\tp.x = s1[0] - 'a';\n\tp.y = s1[1] - '1';\n\tp.step = 0;\n\tex = s2[0] - 'a';\n\tey = s2[1] - '1';\n\tmemset(mapp, 0, sizeof(mapp));\n\tmapp[p.x ][p.y ] = 1;\n\tQ.push (p);\n\twhile  (!Q.empty())\n\t{\n\t\t\tq = Q.front();\n\t\t\tQ.pop();\n\t\t\tif (q.x == ex && q.y == ey)\n\t\t\treturn q.step;\n\t\t\tfor (i = 0; i < 8; i ++)\n\t\t\t{\n\t\t\t\tnext.x = q.x + to[i][0];\n\t\t\t\tnext.y = q.y + to[i][1];\n\t\t\t\tif (next. x == ex && next.y== ey)  \n                return q.step + 1;\n\t\t\t\tif (check(next.x,next.y))\n\t\t\t\tcontinue;\n\t\t\t\tnext.step = q.step + 1;\n\t\t\t\tmapp[next.x][next.y] = 1;\n\t\t\t\tQ.push(next);\t\t\t\n\t\t\t}\n\t}\n\t return 0;\n}\n\nint main ()\n{\n\twhile(~scanf(\""%s%s\"",s1,s2))\n    {\n    \tif (T != 0)\n        printf(\""To get from %s to %s takes %d knight moves.\\n\"",s1,s2,BFS());\n        else \n        printf(\""To get from %s to %s takes %d knight moves.\"",s1,s2,BFS());\n    }\n\treturn 0;\n}",COMPILE_ERROR,0,0
1437906349705388032,5c33cd04d3bfbe3eb7f163ac8f01bf6c93be49892e110c83dd8735aca336cb5c,2021-09-15 06:29:23,C++,0.0,1437365303577604096,1435828688596889600,1418168791525941248,"#include <bits/stdc++.h>\nusing namespace std;\nint step;\nint to[8][2] = {-1,2,-2,1,-2,-1,-1,-2,1,-2,2,-1,2,1,1,2};\nint mapp[10][10], ex,ey;\nchar s1[5],s2[5];\n\nstruct node\n{\n\tint x, y, step; \n};\n\nint check (int x, int y)\n{\n\tif (x < 0 || y < 0 || x >= 8 || y >= 8 || mapp[x][y])\n    return 1;\n    return 0;\n}\nint BFS()\n{\n\tint i;\n\tqueue <node> Q;\n\tnode p; node q;node next;\n\tp.x = s1[0] - 'a';\n\tp.y = s1[1] - '1';\n\tp.step = 0;\n\tex = s2[0] - 'a';\n\tey = s2[1] - '1';\n\tmemset(mapp, 0, sizeof(mapp));\n\tmapp[p.x ][p.y ] = 1;\n\tQ.push (p);\n\twhile  (!Q.empty())\n\t{\n\t\t\tq = Q.front();\n\t\t\tQ.pop();\n\t\t\tif (q.x == ex && q.y == ey)\n\t\t\treturn q.step;\n\t\t\tfor (i = 0; i < 8; i ++)\n\t\t\t{\n\t\t\t\tnext.x = q.x + to[i][0];\n\t\t\t\tnext.y = q.y + to[i][1];\n\t\t\t\tif (next. x == ex && next.y== ey)  \n                return q.step + 1;\n\t\t\t\tif (check(next.x,next.y))\n\t\t\t\tcontinue;\n\t\t\t\tnext.step = q.step + 1;\n\t\t\t\tmapp[next.x][next.y] = 1;\n\t\t\t\tQ.push(next);\t\t\t\n\t\t\t}\n\t}\n\t return 0;\n}\n\nint main ()\n{\n\twhile(~scanf(\""%s%s\"",s1,s2))\n    {\n    \tif (T != 0)\n        printf(\""To get from %s to %s takes %d knight moves.\\n\"",s1,s2,BFS());\n        else \n        printf(\""To get from %s to %s takes %d knight moves.\"",s1,s2,BFS());\n    }\n\treturn 0;\n}",COMPILE_ERROR,0,0
1437906467464667136,5c33cd04d3bfbe3eb7f163ac8f01bf6c93be49892e110c83dd8735aca336cb5c,2021-09-15 06:29:51,C++,300.0,1437365303577604096,1435828688596889600,1418168791525941248,"#include <bits/stdc++.h>\nusing namespace std;\nint step;\nint to[8][2] = {-1,2,-2,1,-2,-1,-1,-2,1,-2,2,-1,2,1,1,2};\nint mapp[10][10], ex,ey;\nchar s1[5],s2[5];\n\nstruct node\n{\n\tint x, y, step; \n};\n\nint check (int x, int y)\n{\n\tif (x < 0 || y < 0 || x >= 8 || y >= 8 || mapp[x][y])\n    return 1;\n    return 0;\n}\nint BFS()\n{\n\tint i;\n\tqueue <node> Q;\n\tnode p; node q;node next;\n\tp.x = s1[0] - 'a';\n\tp.y = s1[1] - '1';\n\tp.step = 0;\n\tex = s2[0] - 'a';\n\tey = s2[1] - '1';\n\tmemset(mapp, 0, sizeof(mapp));\n\tmapp[p.x ][p.y ] = 1;\n\tQ.push (p);\n\twhile  (!Q.empty())\n\t{\n\t\t\tq = Q.front();\n\t\t\tQ.pop();\n\t\t\tif (q.x == ex && q.y == ey)\n\t\t\treturn q.step;\n\t\t\tfor (i = 0; i < 8; i ++)\n\t\t\t{\n\t\t\t\tnext.x = q.x + to[i][0];\n\t\t\t\tnext.y = q.y + to[i][1];\n\t\t\t\tif (next. x == ex && next.y== ey)  \n                return q.step + 1;\n\t\t\t\tif (check(next.x,next.y))\n\t\t\t\tcontinue;\n\t\t\t\tnext.step = q.step + 1;\n\t\t\t\tmapp[next.x][next.y] = 1;\n\t\t\t\tQ.push(next);\t\t\t\n\t\t\t}\n\t}\n\t return 0;\n}\n\nint main ()\n{\n\twhile(~scanf(\""%s%s\"",s1,s2))\n    {\n    \n        printf(\""To get from %s to %s takes %d knight moves.\\n\"",s1,s2,BFS());\n    \n    }\n\treturn 0;\n}",ACCEPTED,6,436