Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- const int Min = 1, Maxn = 1000000, Maxm = 100;
- using namespace std;
- int main()
- {
- srand(time(NULL));
- ///random test bài 1
- /*
- int m, n;
- ofstream inp("perfect.inp");
- //problems 1
- m = 100;
- inp << m << '\n';
- while (m--)
- {
- n = 1000000;
- inp << n << '\n';
- }
- */
- ///random test bài 2
- /*
- int n;
- ofstream inp("grab.inp");
- n = 100;
- inp << n << endl;
- int a[n+1][n+1];
- memset(a, 0, sizeof a);
- int time = rand() % (n*n - 1 + 1) + 1;
- while (time)
- {
- int x = rand() % (n-1+1)+1;
- int y = rand() % (n-1+1)+1;
- if (a[x][y]==1) continue;
- else{
- a[x][y]=1;
- inp << x << ' ' << y << endl;
- time--;
- }
- }
- */
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement