Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <string>
- #include <cstdlib>
- using namespace std;
- unsigned long long qSort(unsigned long long arr[], int left, int right) {
- int i = left, j = right;
- unsigned long long tmp;
- unsigned long long pivot = arr[(left + right) / 2];
- while (i <= j) {
- while (arr[i] < pivot)
- i++;
- while (arr[j] > pivot)
- j--;
- if (i <= j) {
- tmp = arr[i];
- arr[i] = arr[j];
- arr[j] = tmp;
- i++;
- j--;
- }
- };
- if (left < j)
- qSort(arr, left, j);
- if (i < right)
- qSort(arr, i, right);
- }
- int main()
- {
- unsigned long long n, m, a, t, k = 2, y = 0;
- unsigned long long d, sum = 0;
- cin >> n >> m >> a >> d;
- unsigned long long p = n + m;
- unsigned long long *arr2 = (unsigned long long*)malloc(p*sizeof(unsigned long long));
- arr2[0] = a;
- for (unsigned long long i = 1; i < n; i++)
- {
- arr2[i] = k * a;
- k++;
- }
- for (unsigned long long i = 0; i < n; i++)
- cout << arr2[i] << endl;
- /*
- for (unsigned long long i = n; i < p; i++)
- {
- cin >> arr2[i];
- }
- qSort(arr2, 0, p);
- for (unsigned long long i = 0; i < p; i++)
- {
- if (arr2[i] == -1)
- {
- continue;
- }
- sum = arr2[i] + d;
- y++;
- for (unsigned long long j = i + 1; j < p; j++)
- {
- if (sum >= arr2[j])
- {
- arr2[j] = -1;
- }
- else
- break;
- }
- }
- cout << y;*/
- free(arr2);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement