3.19京东笔试

分鸡蛋

#include <iostream>

using namespace std;

int sum(int a, int y){
    if(a==y) return 0;
    if(a % 3==0){
        return sum(a/3, y) + 1;
    }else{
        return sum(a+1, y) + 1;
    }
}

int main ()
{
  int x, y;
  cin >> x >> y;
  int a = x;
  

  cout << sum(a, y) << endl;
  return 0;
}

建造规划

#include<bits/stdc++.h>

using namespace std;

const int N = 1005;
const int M = 10005;

struct Edge{
    int u, v, w;
} edges[M];

int n, m, par[N];

int find(int x){
    if(x==par[x]) return x;
    else return find(par[x]);
}

bool check(int x){
    for(int i=1; i<=n; i++) par[i] = i;
    int res = 0;
    for(int i=0; i<m; i++){
        int u = edges[i].u;
        int v = edges[i].v;
        int w = edges[i].w;
        if(x > w) continue;
        int ru = find(u);
        int rv = find(v);
        if(ru != rv){
            res++;
            par[ru] = rv;
        }
    }
    return res == n-1;
}

int main() {
    scanf("%d%d", &n, &m);
    for(int i=0; i<m; i++){
        int u, v, w;
        scanf("%d%d%d", &u, &v, &w);
        edges[i] = {u, v, w};
    }
    int le = 0, ri = M;
    while(le+1 < ri){
        int mid = (le + ri) >> 1;
        if(check(mid)) le = mid;
        else ri = mid;
    }
    printf("%d\n", le);
    return 0;
}