Guest User

Untitled

a guest
Nov 17th, 2015
306
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.87 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <math.h>
  3.  
  4. int main() {
  5. int n = 6, s = 21, l = 0, g = 0, f = 0, mk = 0;
  6. int a[] = {1,3,8,5,10,12};
  7. int b[n];
  8.  
  9. for(int i = 0; i < pow(2,n); i++) {
  10. if (f == s) {
  11. for(int i = 0; i < n; i++) {
  12. if (b[i] == 1) {
  13. printf("%d ", a[i]);
  14. }
  15. }
  16. mk++;
  17. break;
  18. }
  19.  
  20. for(int j = 0; j < n; j++) { // {0,1}
  21. b[n-1-j] = g%2;
  22. g /= 2;
  23. }
  24.  
  25. l++;
  26. g = l;
  27. f = 0;
  28.  
  29. for (int h = 0; h < n; h++) { // Подсчет суммы элементов
  30. f = f + a[h]*b[h];
  31. }
  32. }
  33.  
  34. if (mk == 0) { // Выввод результата
  35. printf("Elements not found");
  36. }
  37. return 0;
  38. }
Advertisement
Add Comment
Please, Sign In to add comment