402C - Searching for Graph - CodeForces Solution

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <bitset>

using namespace std;
 
int main(){
	
	int t;cin>>t;
	while(t--){
		int n,p;cin>>n>>p;
		int num=0;
		for(int i=1;i<n;i++){
			for(int j=i+1;j<=n;j++){
				cout<<i<<' '<<j<<endl;
				num++;
				if(num==(2*n+p)){
					i=n;
					break;
				}
			}
		}
	}
}