Advertisement
Guest User

Untitled

a guest
Oct 22nd, 2017
69
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.36 KB | None | 0 0
  1. #include <iostream>
  2. #include <vector>
  3. #include <string>
  4. #include <cstdlib>
  5.  
  6. using namespace std;
  7.  
  8. unsigned long long qSort(unsigned long long arr[], int left, int right) {
  9.     int i = left, j = right;
  10.     unsigned long long tmp;
  11.     unsigned long long pivot = arr[(left + right) / 2];
  12.  
  13.     while (i <= j) {
  14.         while (arr[i] < pivot)
  15.             i++;
  16.         while (arr[j] > pivot)
  17.             j--;
  18.         if (i <= j) {
  19.             tmp = arr[i];
  20.             arr[i] = arr[j];
  21.             arr[j] = tmp;
  22.             i++;
  23.             j--;
  24.         }
  25.     };
  26.  
  27.     if (left < j)
  28.         qSort(arr, left, j);
  29.     if (i < right)
  30.         qSort(arr, i, right);
  31.  
  32. }
  33.  
  34. int main()
  35. {
  36.     unsigned long long n, m, a, t, k = 2, y = 0;
  37.     unsigned long long d, sum = 0;
  38.     cin >> n >> m >> a >> d;
  39.     unsigned long long p = n + m;
  40.     unsigned long long *arr2 = (unsigned long long*)malloc(p*sizeof(unsigned long long));
  41.     arr2[0] = a;
  42.     for (unsigned long long i = 1; i < n; i++)
  43.     {
  44.         arr2[i] = k * a;
  45.         k++;
  46.     }
  47.     for (unsigned long long i = 0; i < n; i++)
  48.         cout << arr2[i] << endl;
  49. /*
  50.     for (unsigned long long i = n; i < p; i++)
  51.     {
  52.         cin >> arr2[i];
  53.     }
  54.     qSort(arr2, 0, p);
  55.     for (unsigned long long i = 0; i < p; i++)
  56.     {
  57.         if (arr2[i] == -1)
  58.         {
  59.             continue;
  60.         }
  61.         sum = arr2[i] + d;
  62.         y++;
  63.         for (unsigned long long j = i + 1; j < p; j++)
  64.         {
  65.             if (sum >= arr2[j])
  66.             {
  67.                 arr2[j] = -1;
  68.             }
  69.             else
  70.                 break;
  71.         }
  72.     }
  73.     cout << y;*/
  74.     free(arr2);
  75.     return 0;
  76. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement