y

Author: ksh-code

11000.cpp

@@ -0,0 +1,29 @@
+#include <iostream>
+#include <algorithm>
+#include <queue>
+using namespace std;
+
+typedef long long ll;
+
+void solve(){
+  int N; cin >> N;
+  pair<int,int> arr[N];
+  for (int i = 0; i < N; i++) {
+    cin >> arr[i].first >> arr[i].second;
+  }
+  sort(arr, arr+N);
+  priority_queue<int> pq; pq.push(-arr[0].second);
+  for (int i = 1; i < N; i++){
+    auto [a,b] = arr[i];
+    if (a >= -pq.top()) pq.pop();
+    pq.push(-b);
+  }
+  cout << pq.size();
+}
+
+int main()
+{
+  cin.tie(0)->sync_with_stdio(0);
+  solve();
+  return 0;
+}

11564.cpp

@@ -0,0 +1,34 @@
+#include <iostream>
+#include <cmath>
+#include <algorithm>
+
+using namespace std;
+
+typedef long long ll;
+
+void solve(){
+  ll k,a,b;
+  cin>>k>>a>>b;
+
+  ll count = 0;
+  if (a <= 0 && b >= 0) {
+    count++;
+    count += abs(a) / k;
+    count += abs(b) / k;
+  } else {
+    a = abs(a);
+    b = abs(b);
+    if (a > b) swap(a,b);
+    count += b/k;
+    count -= a/k;
+    if (a % k == 0) count++;
+  }
+  cout << count;
+}
+
+int main()
+{
+  cin.tie(0)->sync_with_stdio(0);
+  solve();
+  return 0;
+}

11689.cpp

@@ -0,0 +1,61 @@
+#include <iostream>
+#include <vector>
+#include <memory.h>
+using namespace std;
+
+typedef long long ll;
+
+const int MAX = 1e6;
+
+void solve(){
+  ll N; cin >> N; if (N==1) {
+    cout << 1;
+    return;
+  }
+  bool tp[MAX+1]; memset(tp, 1, sizeof(tp));
+  vector<ll> primes;
+  ll s = 1;
+  for (ll i = 2; i <= MAX;i++) {
+    if (!tp[i]) continue;
+    if (N % i == 0) {
+      primes.push_back(i);
+      while (N % (s * i) == 0) s *= i;
+    }
+    for (int j = i+i; j<=MAX; j+=i) tp[j] = false;
+  }
+
+  if (s < N && N % s == 0) primes.push_back(N/s);
+  ll result = 0;
+
+  for (int i = 1; i < (1<<primes.size()); i++) {
+    int count = 0;
+    ll r = 1;
+    for (int j = 0; (1<<j) <= i; j++) {
+      if (i & (1<<j)) {
+        count++;
+        r *= primes[j];
+      }
+      if (r > N) {
+        count = 0;
+        break;
+      }
+    }
+
+    if (count == 0) continue;
+
+    if (count % 2) {
+      result += N / r;
+    } else {
+      result -= N / r;
+    }
+  }
+
+  cout << N-result;
+}
+
+int main()
+{
+  cin.tie(0)->sync_with_stdio(0);
+  solve();
+  return 0;
+}

11815.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+
+using namespace std;
+typedef long long ll;
+void solve(){
+    ll N; cin >> N;
+    ll l = 1, r = 1e9+1;
+    while (l+1 < r){
+        ll m = (l+r)/2;
+        if (m*m<=N) l = m;
+        else r = m;
+    }
+    cout << (l*l==N);
+}
+
+int main()
+{
+    cin.tie(0)->sync_with_stdio(0);
+    int N; cin >> N; while(N--) {
+        solve(); cout << ' ';
+    }
+    return 0;
+}

12495.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+
+using namespace std;
+
+typedef long long ll;
+
+int gcd(int a, int b) {
+  return b ? gcd(b, a%b) : a;
+}
+
+int lcm(int a, int b) {
+  return a*b/gcd(a,b);
+}
+
+void solve(){
+  int N, L, H; cin >> N >> L >> H;
+  int r = 1;
+  int arr[N]; for (int i = 0; i < N; i++) cin >> arr[i];
+  for (int i = L; i <= H; i++) {
+    bool found = true;
+    for (int j = 0; j < N; j++) {
+      found &= arr[j]%i==0 || i % arr[j] == 0;
+    }
+    if (found) {
+      cout << i;
+      return;
+    }
+  }
+  cout << "NO";
+}
+
+int main()
+{
+  cin.tie(0)->sync_with_stdio(0);
+  int T; cin >> T;
+  for (int i = 1; i <= T; i++) {
+    cout << "Case #"<<i<<": ";
+    solve();
+    cout << '\n';
+  }
+  return 0;
+}

13414.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <map>
+#include <vector>
+#include <string>
+#include <stack>
+using namespace std;
+
+typedef long long ll;
+
+int gcd(int a, int b) {
+  return b ? gcd(b, a % b) : a;
+}
+
+void solve(){
+  int a,b;cin>>a>>b;
+  map<string,int>m;
+  vector<pair<string,int>>v;
+  for (int i = 0; i < b; i++) {
+    string s; cin >> s;
+    m[s]++;
+    v.push_back({s,m[s]});
+  }
+  for (auto [c,d] : v) {
+    if (m[c]==d && a) {
+      a--;
+      cout << c << '\n';
+    }
+  }
+}
+
+int main()
+{
+  cin.tie(0)->sync_with_stdio(0);
+  solve();
+  return 0;
+}

13904.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <set>
+#include <vector>
+#include <algorithm>
+#include <memory.h>
+using namespace std;
+typedef long long ll;
+
+
+void solve(){
+  int N; cin >>N;
+  pair<int,int> arr[N];
+  for (int i = 0; i < N; i++) {
+    cin >> arr[i].first >> arr[i].second;
+  }
+  sort(arr, arr+N);
+  multiset<int> s;
+  for (int i = 0; i < N; i++) {
+    auto [a,b] = arr[i];
+    s.insert(b);
+    if (a < s.size()) s.erase(s.begin());
+  }
+  int result = 0;
+  for (auto r : s) {
+    result += r;
+  }
+  cout << result;
+}
+
+int main (){
+  cin.tie(0) -> sync_with_stdio(0);
+
+  solve();
+  return 0;
+}

1418.cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+using namespace std;
+
+void solve(){
+    int N, K; cin >> N >> K;
+    int result = N;
+    for (int i = 1; i <= N; i++) {
+        int t= i;
+        for (int j = 2; j<=K; j++) {
+            if (t % j) continue;
+            while (t%j==0) t/=j;
+        }
+        if (t > K) result--;
+    }
+    cout << result;
+}
+
+int main()
+{cin.tie(0)->sync_with_stdio(0);
+    solve();
+    return 0;
+}

1449.cpp

@@ -0,0 +1,29 @@
+#include <iostream>
+#include <memory.h>
+using namespace std;
+
+typedef long long ll;
+
+void solve(){
+  int N,L; cin >> N >> L;
+  int t = 0;
+  bool check[2000]; memset(check, 0, sizeof(check));
+  while (N--) {
+    int c; cin >> c;
+    check[c] = true;
+  }
+  for (int i = 1; i <= 1000; i++) {
+    if (check[i]) {
+      t++;
+      i+=L-1;
+    }
+  }
+  cout << t;
+}
+
+int main()
+{
+  cin.tie(0)->sync_with_stdio(0);
+  solve();
+  return 0;
+}

1493.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+typedef long long ll;
+
+ll arr[20];
+
+ll check(int length, int width, int height) {
+  if (!length || !width || !height) return 0;
+
+  for (int i = 19; i>=0; i--) {
+    int t = 1<<i;
+    if (arr[i] && length >= t && width >= t && height >= t) {
+      arr[i]--;
+      ll result = 1;
+
+      result += check(t, t, height-t);
+
+      result += check(length-t, t, height);
+      result += check(length, width-t, height);
+      return result;
+    }
+  }
+  return -1e9;
+}
+
+void solve(){
+  ll l,w,h; cin >> l >> w >> h;
+  int N; cin >> N;
+  for (int i = 0; i < N; i++) {
+    ll a,b; cin >> a >> b;
+    arr[a]+=b;
+  }
+  cout << max(-1LL, check(l,w,h));
+}
+
+int main (){
+  cin.tie(0) -> sync_with_stdio(0);
+
+  solve();
+  return 0;
+}