이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
///     This code was written by KareemBenzeema
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pf push_front
#define pob pop_back
#define pof pop_front
#define gcd __gcd
#define mod (ll) 998244353
#define inf (ll) 1e9+9
#define all(x) (x).begin(),(x).end()
#define len(x) (int)(x).size()
using namespace std ;
inline void setio(string ) ;
int main()
{
    fast ;
    int subtask , n ;
    cin>>subtask>>n ;
    int arr[n+2][n+2] ;
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++) cin>>arr[i][j] ;
    for (int i=1;i<=n;i++) cout<<arr[1][i]<<' ' ;
    cout<<endl ;
    for (int i=2;i<=n;i++) cout<<i-1<<' '<<i<<endl ;
    return 0 ;
}
inline void setio(string s)
{
    freopen((s+".in").c_str(),"r",stdin) ;
    freopen((s+".out").c_str(),"w",stdout) ;
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |