y

Author: ksh-code

11812.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+typedef long long ll;
+
+
+void solve(){
+  ll N,M,K; cin >> N >> M >> K;
+  for (int i = 0; i <K; i++) {
+    int c = 0;
+    ll a, b; cin >> a >> b;
+    if (M==1) {
+      cout << abs(a-b) << '\n';
+      continue;
+    }
+    while (a != b) {
+      if (a > b) {
+        a = (a+M-2)/M;
+        c++;
+      } else {
+        b = (b+M-2)/M;
+        c++;
+      }
+    }
+    cout << c<<'\n';
+  }
+}
+
+int main()
+{
+  cin.tie(0)->sync_with_stdio(0);
+  solve();
+
+  return 0;
+}

13116.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+using namespace std;
+typedef long long ll;
+
+void solve(){
+  int a,b; cin >> a>>b;
+  while (a!=b) {
+    if (a > b) a/=2;
+    else b/=2;
+  }
+  cout << a*10;
+}
+
+int main()
+{
+  cin.tie(0)->sync_with_stdio(0);
+  int T;cin>>T;while(T--) {
+    solve();
+    cout <<'\n';
+  }
+
+  return 0;
+}

14942.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <set>
+using namespace std;
+typedef long long ll;
+
+
+void solve(){
+  int N; cin >> N;
+  int parent[N+1];
+  for (int i = 1; i<= N;i++) parent[i]=i;
+  for (int i = 1; i < N; i++) {
+    int a, b; cin >> a >> b;
+    parent[b] = a;
+  }
+  int a,b; cin >> a>>b;
+  set<int> s;
+  while (!s.count(a)) {
+    s.insert(a);
+    a = parent[a];
+  }
+  while (!s.count(b)) {
+    b = parent[b];
+  }
+  cout << b;
+}
+
+int main()
+{
+  cin.tie(0)->sync_with_stdio(0);
+  int T;cin>>T;while(T--) {
+    solve();
+    cout <<'\n';
+  }
+
+  return 0;
+}

3117.cpp

@@ -0,0 +1,40 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+typedef long long ll;
+
+
+void solve(){
+  ll N,K,M; cin >>N>>K>>M;
+
+  int bits = 1; for (; (1LL<<bits) <= M; bits++);
+  bits += 2;
+
+  int arr[N]; for (int i = 0; i < N; i++) cin >> arr[i];
+  int sparse[K+1][bits+1];
+  for (int i = 1; i <= K; i++) cin >> sparse[i][0];
+  for (int j = 1; j <= bits; j++) {
+    for (int i = 1; i <= K; i++) {
+      sparse[i][j] = sparse[sparse[i][j-1]][j-1];
+    }
+  }
+
+  for (int i = 0; i < N; i++) {
+    ll n=M-1,x=arr[i];
+    for (int j = bits; j >= 0; j--) {
+      if (n>=(1LL<<j)) {
+        n -= 1<<j;
+        x = sparse[x][j];
+      }
+    }
+    cout << x << ' ';
+  }
+}
+
+int main()
+{
+  cin.tie(0)->sync_with_stdio(0);
+  solve();
+
+  return 0;
+}

3584.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <set>
+using namespace std;
+typedef long long ll;
+
+
+void solve(){
+  int N; cin >> N;
+  int parent[N+1];
+  for (int i = 1; i<= N;i++) parent[i]=i;
+  for (int i = 1; i < N; i++) {
+    int a, b; cin >> a >> b;
+    parent[b] = a;
+  }
+  int a,b; cin >> a>>b;
+  set<int> s;
+  while (!s.count(a)) {
+    s.insert(a);
+    a = parent[a];
+  }
+  while (!s.count(b)) {
+    b = parent[b];
+  }
+  cout << b;
+}
+
+int main()
+{
+  cin.tie(0)->sync_with_stdio(0);
+  int T;cin>>T;while(T--) {
+    solve();
+    cout <<'\n';
+  }
+
+  return 0;
+}

6615.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+#include <map>
+using namespace std;
+typedef unsigned long long ll;
+
+bool solve(){
+  ll a,b; cin >> a>>b;
+  ll aa=a,bb=b;
+  if (a+b==0) return false;
+
+  map<ll,int>m;
+  m[a]=0;
+  int i=1;
+  while (a!=1) {
+    if (a % 2) {
+      a = 3*a+1;
+    } else {
+      a = a/2;
+    }
+    m[a] = i++;
+  }
+
+  i=0;
+  while (!m.count(b)) {
+    if (b % 2) {
+      b = 3*b+1;
+    } else {
+      b = b/2;
+    }
+    i++;
+  }
+  printf("%lld needs %d steps, %lld needs %d steps, they meet at %lld\n",aa,m[b],bb,i,b);
+
+  return true;
+}
+
+int main()
+{
+  while (solve());
+
+  return 0;
+}