CF916C Jamie and Interesting Graph

思路：
构造

实现：

 #include <bits/stdc++.h>
 using namespace std;
 int main()
 {
     int n, m;
     cin >> n >> m;
     cout << "100003 100003" << endl;
     for (int i = ; i < n - ; i++)
     {
         cout << i +  << " " << i +  << " " <<  << endl;
     }
     cout << n -  << " " << n << " " <<  - n << endl;
     int cnt = ;
     for (int i = ; i <= n; i++)
     {
         for (int j = i + ; j <= n; j++)
         {
             if (cnt >= m - n + ) break;
             cout << i << " " << j << "" << endl;
             cnt++;
         }
     }
     return ;
 }