UVA 1588 202 11809

1588

给你两个序列，将两个序列合并，合并后的序列中元素不能大于3，求合并后序列的最短长度

思路：首先我第一个错误的思路是将短的序列加到长的序列中，测试错误样例：121221212211212121112222211122和1212122121
正确的做法是走两遍取最小值，将长的插入短的，将短的插入长的

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>

using namespace std;

int main()
{
    char s1[105],s2[105];

    while((scanf("%s%s",s1,s2)) != EOF){
        int len1 = strlen(s1);
        int len2 = strlen(s2);

        int x,y;
        int flag = 0;
        for(int i = 0 ; i < len1 ; i++){
            if((s1[i] - '0') + (s2[0] - '0') <= 3){
                int a = 0,b = i;
                while(a < len2 && b < len1 && (s1[b] - '0') + (s2[a] - '0') <= 3){
                    a++,b++;
                }
                if(a == len2){
                    x = len1;
                    flag = 1 ;
                    break;
                }
                else if(b == len1){
                    x = len1 + len2 -a ;
                    flag = 1;
                    break;
                }
        }
        }
        if(!flag) x = len1 + len2 ;

        flag = 0;
        for(int i = 0 ; i < len2 ; i++){
            if((s2[i] - '0') + (s1[0] - '0') <= 3){
                int a = 0,b = i;
                while(a < len1 && b < len2 && (s1[a] - '0') + (s2[b] - '0') <= 3){
                    a++,b++;
                }
                if(a == len1){
                    y = len2;
                    flag = 1;
                    break;
                }
                else if(b == len2){
                    y = len2 + len1 - a;
                    flag = 1;
                    break;
                }
            }
        }
        if(!flag) y = len1 + len2;

        cout << min(x,y) << endl;
    }
    return 0;
}

202

求商的循环节长度

思路:模拟除法,如果余数曾经出现过，则进入循环节，输出的时候比较麻烦，只输出前50位小数

#include <iostream>
using namespace std;

int main()
{
    int a, b, res[3003], mod[3003];
    while (cin >> a >> b)
    {
        cout << a << "/" << b << " = " << a / b << ".";
        int i = 0, j, flag = 0;
        while (true)
        {
            res[i] = a / b;
            mod[i] = a % b;
            a = (a % b) * 10;
            for (j = 1; j < i; ++j)
            {
                if (res[i] == res[j] && mod[i] == mod[j])
                {
                    flag = 1;
                    break;
                }
            }
            if (flag)
                break;
            ++i;
        }

        for (int k = 1; k < j; ++k)
            cout << res[k];
        cout << '(';
        if (i > 50)
        {
            for (int k = j; k <= 50; ++k)
                cout << res[k];
            cout << "...)" << endl;
        }
        else
        {
            for (int k = j; k < i; ++k)
                cout << res[k];
            cout << ')' << endl;
        }
        cout << "   " << i - j << " = number of digits in repeating cycle";
        cout << endl << endl;
    }
    return 0;
}