Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define PB push_back
- #define ZERO (1e-10)
- #define INF (1<<30)
- #define CL(A,I) (memset(A,I,sizeof(A)))
- #define DEB printf("DEB!\n");
- #define D(X) cout<<" "<<#X": "<<X<<endl;
- #define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
- typedef long long ll;
- typedef long double ld;
- typedef pair<ll,ll> pll;
- typedef vector<int> vi;
- typedef pair<int,int> ii;
- typedef vector<ii> vii;
- #define IN(n) int n;scanf("%d",&n);
- #define FOR(i, m, n) for (int i(m); i < n; i++)
- #define REP(i, n) FOR(i, 0, n)
- #define F(n) REP(i, n)
- #define FF(n) REP(j, n)
- #define FT(m, n) FOR(k, m, n)
- #define aa first
- #define bb second
- void ga(int N,int *A){F(N)scanf("%d",A+i);}
- #define pc(C) (putchar_unlocked(C))
- ll R(int b=62){ll r(0);F(b)r<<=1,r|=rand()&1;return r;}
- #define r rand()
- #define GR int a,b;a=b=R()%N;while(a==b)a=R()%N;
- int g[66][64],A[64];
- int main(void){
- srand(time(0));
- // int tt=100;
- int tt=666;//SMALL
- F(tt){
- CL(g,0);
- int N=R()%10+2,M=R()%min(20,N*(N-1)/2+1);//SMALL
- // int N=R()%49+2,M=R()%min(501,N*(N-1)/2+1);//M can be 0? seems yes to me
- printf("%d %d %d %d\n",N,M,r%N+1,r%N+1);
- while(M){
- GR if(g[a][b]++||g[b][a]++)continue;
- --M;
- // int N=R()%32+1;
- int N=R()%5+1;//SMALL
- set<int> S;
- // while(S.size()^N)S.insert(R()%10000+1);
- while(S.size()^N)S.insert(R()%30+1);//SMALL
- printf("%d %d %d",a+1,b+1,r%100+1);
- for(auto&h:S)printf(" %d",h);
- pc(10);
- }
- }
- pc(48),pc(10);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement