Advertisement
IISergeyII

Untitled

May 19th, 2018
141
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.83 KB | None | 0 0
  1. #include <iostream>
  2. #include <cmath>
  3. #include <algorithm>
  4. #include <math.h>
  5. #include <vector>
  6. #include <fstream>
  7.  
  8. using namespace std;
  9. void BackTracking(int nCoin);
  10.  
  11. int N, M;
  12.  
  13. vector<int> usedCoins;
  14. vector<int> coinsIn;
  15.  
  16. int minAmount = M + M + 10, currAmount = 0;
  17. long long Summ = 0;
  18.  
  19. void doSearch() {
  20.     BackTracking(0);
  21. }
  22.  
  23. void BackTracking(int nCoin) {
  24.     if (nCoin >= M) return;
  25.     if (Summ > N) return;
  26.  
  27.  
  28.  
  29.     for (int i = 0; i < 3; i++) {
  30.         BackTracking(nCoin + 1);
  31.  
  32.         if (i != 0) {
  33.             currAmount++;
  34.             Summ += coinsIn[nCoin];
  35.         }
  36.  
  37.         usedCoins.push_back( coinsIn[nCoin] );
  38.  
  39.         cout << "i " << i << " nCoin " << nCoin << " Summ " << Summ << " currAmount " << currAmount << endl;
  40.  
  41.         if (Summ == N) {
  42.                 cout << "!!!!!!";
  43.             if (currAmount < minAmount) {
  44.                 minAmount = currAmount;
  45.             }
  46.         }
  47.  
  48.         if (i != 0) {
  49.             currAmount--;
  50.             Summ -= coinsIn[nCoin];
  51.             usedCoins.pop_back();
  52.         }
  53.  
  54.     }
  55.  
  56.     /*currAmount -= 2;
  57.     Summ -= 2*coinsIn[nCoin];
  58.     usedCoins.pop_back();
  59.      usedCoins.pop_back();
  60.       usedCoins.pop_back();*/
  61. }
  62.  
  63. int main()
  64. {
  65.     long long sum;
  66.     cin >> N >> M;
  67.  
  68.  
  69.     for (int i = 0; i < M; ++i) {
  70.         int t;
  71.         cin >> t;
  72.         coinsIn.push_back(t);
  73.         sum += t*2;
  74.     }
  75.  
  76.     if (sum < N) {
  77.         cout << "-1";
  78.     } else if (sum == N) {
  79.         cout << coinsIn.size()*2 << endl;
  80.         for (int i = 0; i < coinsIn.size(); i++) {
  81.             cout << coinsIn[i] << " " << coinsIn[i] << " ";
  82.         }
  83.     } else {
  84.         doSearch();
  85.         cout << minAmount << endl;
  86.         for (int i = 0; i < minAmount; i++) {
  87.             cout << usedCoins[i] << " ";
  88.         }
  89.     }
  90.  
  91.  
  92.     return 0;
  93. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement