Have Fun with Numbers及循环链表（约瑟夫问题）

1. 循环链表（约瑟夫问题）

https://github.com/BodhiXing/Data_Structure

2. Have Fun with Numbers

https://pta.patest.cn/pta/test/17/exam/4/question/263

 #include <iostream>
 #include <cstring>
 using namespace std;

 int main() {
     int a[],b[],buffer[];
     char input[];
     int i,j,len;
     int t,carry=;

     memset(a,,sizeof(a));
     memset(b,,sizeof(b));  

     cin>>input;
     len = strlen(input);
     //buffer中的数逆序
     for(j=,i=len-; i>=; i--,j++) {
         buffer[j] = input[i]-'';
         a[buffer[j]]++;        //记录每个数出现的个数
     }

     //数乘以2
     carry=;
     for(i=; i<len; i++) {
         t =  buffer[i]*;
         buffer[i] = (t+carry)%;
         b[buffer[i]]++;
         carry =  (t+carry)/;
     }

     for(j=;j<;j++){
         if(a[j] != b[j])
             break;
     }

     if(carry>)
     {
         buffer[i]=carry;
     }
     else
         i--;
     if(j<) {
         cout<<"No"<<endl;
         for(; i>=; i--)
             cout<<buffer[i];
     } else {
         cout<<"Yes"<<endl;
         for(; i>=; i--)
             cout<<buffer[i];
     }

     return ;
 }