Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<math.h>
- using namespace std;
- bool stepen(int number)
- {
- if(number % 2 == 0)
- {
- if(number / 2 == 1)
- {
- return true;
- }
- else
- {
- return stepen(number / 2);
- }
- }
- else
- {
- return false;
- }
- }
- int main()
- {
- int numbers[10];
- int n;
- cout<<"N = ";
- cin>>n;
- cout<<endl;
- for(int i = 0; i < n; i++)
- {
- cout<<"Number "<< i + 1<<" = ";
- cin>>numbers[i];
- }
- cout<<endl;
- int solutions = 0;
- for(int m = 0; m < n; m++)
- {
- if(stepen(numbers[m]))
- {
- solutions += 1;
- }
- }
- int arr[solutions];
- int added_numbers = 0;
- for(int l = 0; l < n; l++)
- {
- if(numbers[l] > 0)
- {
- if(stepen(numbers[l]))
- {
- arr[added_numbers] = numbers[l];
- added_numbers += 1;
- }
- }
- }
- while(true)
- {
- int number_of_swaps = 0;
- for(int j = 0; j < n - 1; j++)
- {
- if(arr[j] > arr[j + 1])
- {
- int num1;
- int num2;
- num1 = arr[j + 1];
- num2 = arr[j];
- arr[j] = num1;
- arr[j + 1] = num2;
- number_of_swaps += 1;
- }
- }
- if(number_of_swaps == 0)
- {
- break;
- }
- }
- for(int k = 0; k < solutions; k++)
- {
- cout<<arr[k]<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement