Hamilton

#include <iostream>
#include <numeric>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <queue>
using namespace std;
int main() {
  /*  ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(0);*/
    int n, t, zn;
    char c;
    cin>>n>>t;
    cout<<"0110\n"<<"0011\n"<<"0001\n"<<"1000"<<endl;
    for (int i=0; i<t; ++i)
    {
        vector<int> next={0, 1, 2, 3};
        vector<vector<int>> g(n, vector<int> (n, 0));
        for (int i=0; i<n; ++i)
        {
            for (int j=i+1; j<n; ++j)
            {
                cout<<i+1<<" "<<j+1<<endl;
                cin>>c;
                if (c=='>')
                {
                    g[i][j]=1;
                }
                else
                {
                    g[j][i]=1;
                }
            }
        }
        do
        {
            zn=1;
            for (int i=0; i<n; ++i)
            {
                if (g[next[i]][next[(i+1)%n]]==0)
                {
                    zn=0;
                    break;
                }
            }
            if (zn==1)
            {
                cout<<"!";
                for (int i : next)
                    cout<<" "<<i+1;
                cout<<endl;
                break;
            }
        }while (next_permutation(next.begin(), next.end()));
    }
    return 0;
}

Test 1

Subtask:

Verdict: WRONG ANSWER

Test 2

Subtask: 1

Verdict: WRONG ANSWER

Test 3

Subtask: 2, 3

Verdict: WRONG ANSWER

Test 4

Subtask: 4

Verdict: WRONG ANSWER