拼多多编程题4道

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>

using namespace std;

#define LL    long long
#define pb    push_back
#define mk    make_pair
#define pill    pair < int, int >
#define mst(a, b) memset( a, b, sizeof a )
#define lson    (rt << 1)
#define rson    ( (rt << 1) | 1)

const int qq = 1e5 + 300;
const int INF = 1e9 + 10;
const int MOD = 1e9 + 7;
char st[qq];
char mar[15][15];

int main() {
    scanf("%s", st);
    int len = strlen(st);
    memset(mar, 0, sizeof(mar));
    int k = len / 4 + 1;
    for (int i = 0; i < k; ++i) {
        for (int j = 0; j < k; ++j) {
            mar[i][j] = ' ';
        }
    }
    int ct = 0;
    for (int i = 0; i < k; ++i) {
        mar[0][i] = st[ct++];
    }
    for (int i = 1; i < k; ++i) {
        mar[i][k - 1] = st[ct++];
    }
    for (int i = k - 2; i >= 0; --i) {
        mar[k - 1][i] = st[ct++];
    }
    for (int i = k - 2; i >= 1; --i) {
        mar[i][0] = st[ct++];
    }
    for (int i = 0; i < k; ++i) {
        printf("%s\n", mar[i]);
    }
    return
}


#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <bitset>

using namespace std;

#define LL    long long
#define pb    push_back
#define mk    make_pair
#define pill    pair < int, int >
#define mst(a, b) memset( a, b, sizeof a )
#define lson    (rt << 1)
#define rson    ( (rt << 1) | 1)

const int qq = 1e5 + 300;
const int INF = 1e9 + 10;
const int MOD = 1e9 + 7;
map<string, int> mp;
string st;

bool check(string x, int fg) {
    if (x == "" || x == "0")
        return (true);
    if (fg == 0) {
        if (x[0] == '0')
            return (false);
    }
    if (fg == 1) {
        if (x[x.size() - 1] == '0')
            return (false);
    }
    return (true);
}


int ans = 0;

void putSome(string a, string b, string c, string d) {
    string x, y;
    if (b == "") {
        x = a;
    } else { x = a + "." + b; }
    if (d == "") {
        y = c;
    } else { y = c + "." + d; }
    if (b == "0" || d == "0") {
        return;
    }
    ans++;
}


int main() {
    cin >> st;
    for (int i = 1; i < st.size(); ++i) {
        string x = st.substr(0, i);
        string y = st.substr(i);
        for (int j = 1; j < x.size() + 1; ++j) {
            string a = x.substr(0, j);
            string b = x.substr(j);
            if (!check(a, 0) || !check(b, 1))
                continue;
            if (a == "0" && b == "0")
                continue;
            for (int k = 1; k < y.size() + 1; ++k) {
                string c = y.substr(0, k);
                string d = y.substr(k);
                if (!check(c, 0) || !check(d, 1))
                    continue;
                if (c == "0" && d == "0")
                    continue;
                putSome(a, b, c, d);
            }
        }
    }
    printf("%d\n", ans);
}