网易互娱游戏研发工程师笔试

刚刚发错区了2333

#include <bits/stdc++.h>

using namespace std;

int main() {
  int t;
  cin >> t;
  for (int i = 0; i < t; ++i) {
    int num;
    cin >> num;
    num -= 5000;
    double res = 0;
    if (num > 80000) {
      res += 0.45 * (num - 80000);
    }
    if (num > 55000) {
      res += 0.35 * (((num > 80000) ? 80000 : num) - 55000);
    }
    if (num > 35000) {
      res += 0.30 * (((num > 55000) ? 55000 : num) - 35000);
    }
    if (num > 25000) {
      res += 0.25 * (((num > 35000) ? 35000 : num) - 25000);
    }
    if (num > 12000) {
      res += 0.20 * (((num > 25000) ? 25000 : num) - 12000);
    }
    if (num > 3000) {
      res += 0.10 * (((num > 12000) ? 12000 : num) - 3000);
    }
    if (num >= 0) {
      res += 0.03 * (((num > 3000) ? 3000 : num) - 0);
    }
    cout << ((res - floor(res) >= 0.5) ? ceil(res) : floor(res)) << endl;
  } 
  return 0;
}

第二题（暴力 =-=）：

#include <bits/stdc++.h>

using namespace std;

const string commons[6] = {"password", "admin", "qwerty", "hello", "iloveyou", "112233"};
const int COMMONNUM = 6;
string specials = "!@#$%^&*()_-=+[]{},.<>/?";
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    string s;
    cin >> s;
    // cout << s << endl;
    if (s.size() < 8) {
      cout << "no" << endl;
    } else {
      bool containCommon = false;
      for (int i = 0; i < COMMONNUM; ++i) {
        for (int j = 0; j < s.size() - commons[i].size() + 1; ++j) {
      // string tmp = s.substr(j, commons[i].size());
      // cout << commons[i] << endl;
          if (s.substr(j, commons[i].size()) == commons[i]) {
        containCommon = true;
        break;
      }
    }
    if (containCommon) break;
      }
      if (containCommon) {
        cout << "no" << endl;
      } else {
        bool lastIsNum = false, lastIsUpper = false, lastIsLower = false;
        bool hasNum = false, hasLower = false, hasUpper = false, hasSpec = false;
        int conNum = 0, conUpper = 0, conLower = 0;

    bool noPass = false;
        for (int i = 0; i < s.size(); ++i) {
          char c = s[i];
      if (specials.find(c) != string::npos) {
        hasSpec = true;
      } else {
        if (c >= '0' && c <= '9') {
          hasNum = true;
          conUpper = 0;
          conLower = 0;
          if (lastIsNum) conNum++;
          else conNum = 1;
          if (conNum >= 3) {
            if (s[i] - s[i - 1] == s[i - 1] - s[i - 2]) {
              noPass = true;
          break;
        } else {
          conNum--;
        }
          }
          lastIsNum = true;
          lastIsUpper = false;
          lastIsLower = false;
        } else if (c >= 'a' && c <= 'z') {
          hasLower = true;
          conUpper = 0;
          conNum = 0;
          if (lastIsLower) conLower++;
          else conLower = 1;
          if (conLower >= 3) {
            if (s[i] - s[i - 1] == 1 && s[i - 1] - s[i - 2] == 1) {
              noPass = true;
          break;
        } else {
              conLower--;
        }
          }
          lastIsLower = true;
          lastIsUpper = false;
          lastIsNum = false;
        } else {
          hasUpper = true;
          conLower = 0;
          conNum = 0;
          if (lastIsUpper) conUpper++;
          else conUpper = 1;
          if (conUpper >= 3) {
            if (s[i] - s[i - 1] == 1 && s[i - 1] - s[i - 2] == 1) {
              noPass = true;
          break;
        } else {
              conUpper--;
        }
          }
          lastIsUpper = true;
          lastIsLower = false;
          lastIsNum = false;
        }
      }
        }
    if (!hasNum || !hasLower || !hasUpper || !hasSpec) {
      noPass = true;
    }
    if (noPass) {
      cout << "no" << endl;
    } else {
      cout << "yes" << endl;
    }
      }
    }
  }
  return 0;
}

第三题（暴力模拟）：

#include <bits/stdc++.h>

using namespace std;

int main() {
  int t;
  cin >> t;
  for (int i = 0; i < t; ++i) {
    int q, n, m;
    cin >> q >> n >> m;
    unordered_map<int, int> rankscore;
    for (int i = 0; i < n; ++i) {
      int left, right, score;
      cin >> left >> right >> score;
      for (int j = left; j <= right; ++j) {
        rankscore[j] = score;
      }
    }

    unordered_map<int, int> killscore;
    for (int i = 0; i <= m; ++i) {
      int score;
      cin >> score;
      killscore[i] = score;
    }

    int a, b;
    cin >> a >> b;

    map<string, int> totalscore;

    unordered_map<string, int> killnum;
    unordered_map<string, int> livetime;
    vector<string> rank;
    for (int i = 0; i < q - 1; ++i) {
      int time;
      string killer, victim;
      cin >> time >> killer >> victim;
      // cout << time << killer << victim << endl;
      rank.push_back(victim);
      if (i == q - 2) rank.push_back(killer);
      livetime[victim] = time;
      if (i == q - 2) livetime[killer] = time;
      if (killer != victim) {
        killnum[killer]++;
    if (killnum[victim] >= m) {
          totalscore[killer] += killscore[m];
    } else {
          totalscore[killer] += killscore[killnum[victim]];
    }
      }
    }

    reverse(rank.begin(), rank.end());

    for (int i = 0; i < rank.size(); ++i) {
      string now = rank[i];
      // cout << now << " : " << endl;
      totalscore[now] += rankscore[i + 1];
      // cout << totalscore[now] << endl;
      totalscore[now] += livetime[now] * a + b;
      // cout << totalscore[now] << endl;
    }

    for (auto it : totalscore) {
      cout << it.first << " " << it.second << endl;
    }
  }
  return 0;
}

第四题就不发了 =-= 我反正也没AC =-=
祝大家好运！