ITSA 71

#include <iostream>
#include <string>
#include <cstring>

using namespace std;

int main()
{
    string ans,guess;
    char anschar[4];
    char guesschar[4];
    while(cin>>ans)
    {
        strcpy(anschar,ans.c_str());
        while(cin>>guess)
        {
            if(guess == "0000")
            {
               return -1;
            }

            strcpy(guesschar,guess.c_str());
            int a=0,b=0;
            for(int i = 0; i<4; i++)
            {
                for(int j = 0; j<4; j++)
                {
                    if(anschar[i] == guesschar[j] && i==j)
                    {
                        a++;
                    }
                    else if(anschar[i] == guesschar[j] && i!=j)
                    {
                        b++;
                    }
                    else {}
                }
            }
            cout << a << "A" << b << "B" << endl;
        }
    }
    return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    vector<int> S;
    vector<int> T;
    S.push_back(1);
    T.push_back(2);

    int n,temp;
    while(cin>>n)
    {
        while(S.size()!=n)
        {
            if(S.size()==T.size())
            {
                S.push_back(S[S.size()-1]+T[T.size()-1]);
            }
            else
            {
                temp = T[T.size()-1] + 1;
                vector<int>::iterator it = find(S.begin(), S.end(), temp);

                while(it!=S.end()) //S裡有，故要在+1
                {
                    temp++;
                    vector<int>::iterator it = find(S.begin(), S.end(), temp);
                    if(it==S.end())
                        break;
                }
                T.push_back(temp);
            }
        }
        cout << S[n-1] << endl;

    }
    return 0;
}