c++

//字碼轉換

#include <iostream>

using namespace std;

int main(){

  char symbols[6];

  int nums[6];

  int new_nums[6];

  char new_symbols[6];

  int i;

  cin >> symbols;

  for(i=0;i<6;i++){

    nums[i]=int(symbols[i]);

    new_nums[i]=nums[i]+1;

    new_symbols[i]=char(new_nums[i]);

  }

  for(i=0;i<6;i++){

    cout << new_symbols[i];

  }

  return 0;

}

//9x9 故意用while

#include <iostream>

using namespace std;

int main(){

    int j=1;

    while(j<10){

        int i=0;

        while(i<10){

            i=i+1;

            cout << j << "x" << i << "=" << i*j << " " ;

        }

        cout << endl;

        j=j+1;

    }

}

#include <iostream>

#include <stdlib.h>

#include <time.h>

using namespace std;

//0剪刀cutter

//1石頭stone

//2布paper

int main(){

  bool winFlag = false;

  int user;

  srand(time(NULL));

  int rnumber = rand() % 3;

  if(rnumber == 0){

    cout << "comp cutter"<< endl;

  }else if(rnumber == 1){

    cout << "comp stone"<< endl;

  }else{

    cout << "comp paper"<< endl;

  }

  cout << "your choice plz 0 for cutter ; 1 for stone ; 2 for paper" << endl;

  cin >> user;

  if( (user==2 && rnumber == 1) || (user==1 && rnumber == 0) || (user==0 && rnumber == 2) ){

    cout << "your win";

  }

}

/*

有五隻猴子採了一堆桃子，猴子彼此約定隔天早起後再分食。但是，在半夜裏，其中一隻猴子偷偷起來把桃子均分成五堆後，發現還多一個，它就吃掉這個桃子，並拿走了其中一堆。

第二隻猴子隨後醒過來，也把桃子均分成五堆後，還是多了一個，它也吃掉這個桃子，並拿走了其中一堆。

第三隻，第四隻，第五隻猴子都依續採用同樣的方法分食桃子。那麼原來這堆桃子的數量最少應該有多少個？

*/

#include <iostream>

using namespace std;

int main(){

    int peach = 3120;

    int peach2 = peach;

    int i=1;

    for(i=1;i<6;i++){

        if(peach2 % 5 == 1){

            peach2 = (peach2 - 1)*4/5;

        }else{

            break;

        }

    }

    if(i==6){

        cout << "min is" << peach;

    }

}

#include <iostream>

using namespace std;

int main()

{

    int r,c,m;

    cin >> r >> c >> m;

    cout << "row:" << r << " cols:" << c << " m:" << m << endl;

    int Barray[m][r][c];

    for(int i=0; i<r; i++)

    {

        for(int j=0; j<c; j++)

        {

            cin >> Barray[0][i][j];

        }

    }

    int move[m];

    for(int i=0; i<m; i++)

    {

        cin >> move[i];

    }

    for(int k=1; k<m+1; k++)

    {

        if(move[k-1]==1)//翻

        {

            for(int i=0; i<r; i++)

            {

                for(int j=0; j<c; j++)

                {

                    Barray[k][i][j]=Barray[k-1][r-i-1][j];

                    cout << Barray[k][i][j] << " ";

                }

                cout << endl;

            }

            cout << endl;

        }else//旋

        {

            for(int i=0; i<r; i++)

            {

                for(int j=0; j<c; j++)

                {

                    Barray[k][i][j]=Barray[k-1][r-i-1][j];

                    cout << Barray[k][i][j] << " ";

                }

                cout << endl;

            }

            cout << endl;

        }

    }

    return 0;

}

#include <iostream>

using namespace std;

int main()

{

    int k=0;

    cin >> k;

    char symbols[20]= {0};

    int sString[20]= {0};

    int counter=0;

    char sflag[1];

    char previousState[1] ;

    previousState[0]='I';

    cin >> symbols;

    int i=0;

    int j=0;

    while(symbols[i] != 0)

    {

        if(int(symbols[i])>=65 && symbols[i]<=90)

        {

            sflag[0] = 'U';

        }

        else if(int(symbols[i])>=97 && symbols[i]<=122)

        {

            sflag[0] = 'L';

        }

    }

    i=0;

    int conN = 0;

    while(sString[i]!=0)

    {

    }

    cout << k*conN <<endl;

    return 0;

}

#include <bits/stdc++.h>

using namespace std;

int b_length = 0;

bool nodes_has_father[100005] = {0};

long long int sigma_height = 0;

int nodes[100005][2]; // child_start num_child

int children[100005];

// 將子樹全部存在children中，nodes[i][0]表示這棵數子樹開始，nodes[i][1]表示這棵樹結束，

// 即children[nodes[i][0]] 到 children[nodes[i][0] + nodes[i][1] - 1] 都是這棵樹的子樹

int child_pos = 0;

long long int dfs(int node_id) {

    long long int my_height = -1;

    long long int h = -1;

    //for(int child_id:nodes[node_id]) {

    for(int child_id_pos = nodes[node_id][0]; child_id_pos < nodes[node_id][0] + nodes[node_id][1]; child_id_pos++){

            int child_id = children[child_id_pos];

            cout << "###" << child_id_pos <<": " <<  child_id << endl;

        my_height = dfs(child_id);

        h = max(my_height, h);

        cout <<"#" << child_id << " height: " << my_height <<  endl;

        sigma_height += my_height;

    }

    return h + 1;

}

int main() {

    int l;

    cin >> l;

    for (int i = 1; i <= l; i++) {

        int c;

        cin >> c;

        nodes[i][0] = child_pos;

        nodes[i][1] = c;

        for (int j = 0; j < c; j++) {

            int nid;

            cin >> nid;

            nodes_has_father[nid] = 1;

            children[child_pos++] = nid;

        }

    }

    // linear search

    int root_id = 0;

    for(int i = 1; i <= l; i++) {

        if(!nodes_has_father[i]) {

            root_id = i;

            break;

        }

    }

    int tmp = dfs(root_id); // 根的高度

    sigma_height += tmp;

    cout << root_id << "\n" << sigma_height;

}

//交錯字串

#include <iostream>

using namespace std;

int main()

{

    int k=0;

    cin >> k;

    char symbols[20]= {0};

    int sString[20]= {0};

    int counter=0;

    char sflag[1];

    char previousState[1] ;

    previousState[0]='I';

    cin >> symbols;

    int i=0;

    int j=0;

    while(symbols[i] != 0)

    {

        if(int(symbols[i])>=65 && symbols[i]<=90)

        {

            sflag[0] = 'U';

        }

        else if(int(symbols[i])>=97 && symbols[i]<=122)

        {

            sflag[0] = 'L';

        }

        if(i==0)

        {

            previousState[0]=sflag[0];

            counter++;

        }

        else if(previousState[0]==sflag[0])

        {

            counter++;

        }

        else

        {

            previousState[0]=sflag[0];

            sString[j]=counter;

//cout << sString[j] << "j";

            j++;

            counter=1;

        }

        i++;

    }

    sString[j]=counter;

    i=0;

    int conN = 0;

    while(sString[i]!=0)

    {

        cout << i << "-" << sString[i] <<endl;

        if(sString[i]==k)

        {

            conN++;

            cout << "conN" << endl;

            if(i>0)

            {

                if(sString[i-1]>k)

                {

                    conN++;

                    cout << "conNi-1" << endl;

                }

            }

        }

        i++;

    }

    if(sString[i-1]>k)

    {

        conN++;

    }

    cout << k*conN <<endl;

    return 0;

}