Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <math.h>
- int main() {
- int n = 6, s = 21, l = 0, g = 0, f = 0, mk = 0;
- int a[] = {1,3,8,5,10,12};
- int b[n];
- for(int i = 0; i < pow(2,n); i++) {
- if (f == s) {
- for(int i = 0; i < n; i++) {
- if (b[i] == 1) {
- printf("%d ", a[i]);
- }
- }
- mk++;
- break;
- }
- for(int j = 0; j < n; j++) { // {0,1}
- b[n-1-j] = g%2;
- g /= 2;
- }
- l++;
- g = l;
- f = 0;
- for (int h = 0; h < n; h++) { // Подсчет суммы элементов
- f = f + a[h]*b[h];
- }
- }
- if (mk == 0) { // Выввод результата
- printf("Elements not found");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment