Problem #3187 - ECNU Online Judge

fwx_peter

4 年，7 月前

include

using namespace std;
int main(){
int n;
cin>>n;
int a,b;
for (int i=0; i>a>>b;
int count=0;
for (int j=a; j<=b;j++) {
string str;
str=to_string(j);
int left=0;
int right=str.size();

        while (str[left]>str[left+1]) {
            left++;
        }
        while (str[right-1]>str[right-2]) {
            right--;
        }
        if (left==right-1) {
            count++;
        }
    }
    cout<<"case #"<<i<<":"<<endl;
    cout<<count<<endl;
}
return 0;

}

回复 1 0

aiden

5 年，5 月前

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

bool isDented(int x)
{
    string a = to_string(x);
    for (int i = 1; i < a.length() - 1; ++i)
    {
        bool ret = true;
        for (int j = i; j > 0; --j)
            if (a[j - 1] <= a[j])
                ret = false;
        for (int j = i; j < a.length() - 1; ++j)
            if (a[j] >= a[j + 1])
                ret = false;
        if (ret)
            return true;
    }
    return false;
}

int main()
{
    int T;
    cin >> T;
    for (int z = 0; z < T; ++z)
    {
        int a, b;
        cin >> a >> b;
        int count = 0;
        for (int i = a; i <= b; ++i)
            if (isDented(i)) ++count;
        cout << "case #" << z << ":" << endl;
        cout << count << endl;
    }
    return 0;
}