Test Case Generator

#include <bits/stdc++.h>

using namespace std ;

#define i64 long long int
#define maxn 100005
#define lim 100000LL
#define IN freopen("input.txt","r",stdin)
#define OUT freopen("RandomTestCase.txt","w",stdout)

i64 Random()
{
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    i64 val = rng()%lim ;
    val = ( val +lim )%lim ;
    return val ;
}

map< pair<i64,i64> , i64 > M ;

int main()
{
    OUT ;
    i64 i , j , k , l , m , n ;

    i64 tc = 20 , t=1 ;

    printf("%lld\n",tc) ;

    while( t++<=tc )
    {
        n = Random()%30 ; m = Random()%30;

        m = min( ((1LL)*n*(n-1))/2 , m ) ;

        printf("%lld %lld\n",n,m) ;

        for(i=1 ; i<=m ; i++)
        {
            i64 u = Random()%n + 1 , v = Random()%n + 1 , w = Random()%2 ;
            if( u>v ) swap(u,v) ;
            if( u==v || M.find( make_pair(u,v) ) != M.end() )
            {
                i-- ;
                continue ;
            }
            printf("%lld %lld %lld\n",u,v,w) ;
            M[ make_pair(u,v) ] = i ;
        }
        M.clear() ;
    }

    return 0;
}