枚举

1.小美的排列询问

https://www.nowcoder.com/practice/2a9dd3471bf1475aab0117a58d9d45d4

 

 

#include <iostream>
using namespace std;

int main() {
    int len;
    cin >> len;
    int num[len];
    for (int i = 0; i < len; i++){
        cin >> num[i];
    }

    int x,y;
    cin >> x >> y;

    for (int i = 0; i < len; i++) {
        if(num[i] == x){
            if (i-1 >= 0 && num[i-1] == y) {
                cout << "Yes" << endl;
                break;
            } else if (i+1 < len && num[i+1] == y) {
                cout << "Yes" << endl;
                break;
            } else {
                cout << "No" << endl;
                break;
            }
        }
    }
    return 0;

}
// 64 位输出请用 printf("%lld")

 

2.小美走公路

https://www.nowcoder.com/questionTerminal/c58bd53e0b204bc3bdee04c383e8d64a

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

int main() {
    int n;
    cin >> n;
    vector<long long> a(n+1); 

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    int x,y;
    cin >> x >> y;
    if ( x > y) {
        int temp = x;
        x = y;
        y = temp;
    }
    long long res1 = 0, res2 = 0;
    for (int i = x ; i < y; i++) {
        res1 = res1 + a[i];
    }
    for (int i = y; i <= n; i++){
        res2 += a[i];
    }
    for (int i = 1; i < x; i++){
        res2 += a[i];
    }
    long long res = (res1 < res2) ? res1 : res2;
    //cout << res << endl;
    printf("%lld\n", res);
}

 

 

 

3.小红的奇偶抽取

https://www.nowcoder.com/questionTerminal/57351e46193a4dfda794c96d8260c80a?f=discussion

    

#include <iostream>
using namespace std;

int main() {
    string str;
    cin >> str;
    long long ji = 0, ou = 0;
    for (long long i = 0; i < str.size(); i++) {
        if ((str[i]- '0') % 2 == 0){
            ou = ou * 10 + str[i]- '0';
        } else {
            ji = ji * 10 + str[i]- '0';
        }
    }
    long long res = abs(ou-ji);
    cout << res <<endl;
}
// 64 位输出请用 printf("%lld")

 

4.游游的整数切割

https://www.nowcoder.com/questionTerminal/c01b07fe9623425a806c85cdb6f0e0f7?difficulty=10000&page=13&onlyReference=false

#include <iostream>
using namespace std;

int main() {
    string str;
    cin >> str;
    long long n = str.size();
    int k = str[n-1] % 2;
    long long res = 0;
    for (long long i = 0; i < n-1; i++) {
        if (str[i] % 2 == k){
            res++;
        }
    }
    cout << res <<endl;
}
// 64 位输出请用 printf("%lld")