RIG.cpp

// author: Ryuuk
#include<bits/stdc++.h>
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define tr(c,i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define LSOne(i) (i&(-i))
#define REP(i,a,b) for(int(i)=(a);(i)<(b);i++)
#define BUG(x) {cout<<#x<<" = "<<x<<endl;}
#define left(x) (x<<1)
#define right(x) ((x<<1) +1)
#define middle(s,e)(s+(e-s)/2)
#define size_tree(n) 2*(int)pow(2,ceil(log2(n)))
#define CL(A,I) (memset(A,I,sizeof(A)))

static const int INF = 0x3f3f3f3f;
static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
static const long double epsilon = 1e-15;
static const long double pi = acos((long double) -1);
using namespace std;
inline void init_io(){ios_base::sync_with_stdio(false);cin.tie(NULL);}

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef long long ll;

int main()
{
    #ifndef ONLINE_JUDGE
        //freopen("input.txt","r",stdin);
    #endif // ONLINE_JUDGE
    srand(0);
    int t= rand()%100+1;
    cout<<t<<endl;
    while (t--) {
      int n=rand()%1000000+1;
        for (int i=0;i<n-1;i++)
          cout<<static_cast<ll>(rand())%((ll)(2000000000000))-1000000000000<<" ";
        cout<<static_cast<ll>(rand())%((ll)(2000000000000))-1000000000000<<endl;
    }
    return 0;
}