Advertisement
rengetsu

ProcedurProgramavimas_1.15

Feb 22nd, 2018
75
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.73 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5.  int main()
  6. {
  7.     long long int j, m, daliba[70]={100}, daugiba[70]={100};
  8.  
  9.     cin >> j >> m;
  10.      
  11.      if (j==1){
  12.       cout << m;
  13.        return 0;}
  14.     int i=0, q=-1, sk;
  15.     daliba[0]=j;
  16.     daugiba[0]=m;
  17.         do{
  18.         i++;
  19.         q++;
  20.             daliba[i]=daliba[q]/2;
  21.             daugiba[i]=daugiba[q]*2;
  22.         }
  23.     while (daliba[i] != 1);
  24.     sk=i+1;
  25.     long long int   sum=0;
  26.     long long int k[70]={100};
  27.      
  28.      
  29.     int  a;
  30.         for (int i = 0; i < sk; i++){
  31.         a=daliba[i]%2;
  32.         if (0 != a){
  33.          k[i]=1;}
  34.         }
  35.     for (int i = 0; i < sk; i++){
  36.         if (k[i] == 1){
  37.          sum=daugiba[i]+sum;
  38.         }
  39.     }
  40.     cout<<sum;
  41.     return 0;
  42. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement