I. Rise of Shadows（类欧几里得）

最新推荐文章于 2021-11-07 17:20:04 发布

_lifehappy_

最新推荐文章于 2021-11-07 17:20:04 发布

阅读量886

点赞数 3

分类专栏：数论 ICPC真题文章标签：算法 c++

本文链接：https://blog.csdn.net/weixin_45483201/article/details/120587090

版权

数论同时被 2 个专栏收录

107 篇文章 6 订阅

订阅专栏

ICPC真题

16 篇文章 2 订阅

订阅专栏

I. Rise of Shadows

一天有 $H$ 个小时， $M$ 分钟，问，有多少个整数分钟，满足时针与分针的角度 $\le \alpha$ ， $\alpha = \frac{2 \pi A}{HM}$ 。
$\sum_{i = 0} ^{H - 1} \sum_{j = 0} ^{M - 1} [ \mid\frac{2 \pi(i \times M + j)}{HM} - \frac{2\pi j}{M} \ \mid \le \frac{2 \pi A}{HM}]\\ \sum_{i = 0} ^{H - 1} \sum_{j = 0} ^{M - 1} [\mid i \times M + j - H \times j \mid \le A]\\ H \times M - \sum_{i = 0} ^{H - 1} \sum_{j = 0} ^{M - 1} [i \times M + j - H \times j > A] - \sum_{i = 0} ^{H - 1} \sum_{j = 0} ^{M - 1} [i \times M + j - H \times j < -A]\\$

$\sum_{i = 0} ^{H - 1} \sum_{j = 0} ^{M - 1} [i \times M + j - H \times j > A]\\ \sum_{i = 0} ^{H - 1} \sum_{j = 0} ^{M - 1} [i > \frac{(H - 1) \times j + A}{M}]\\ \sum_{j = 0} ^{M - 1} \left(H - 1 - \frac{(H - 1) \times j + A}{M} \right)\\ M \times (H - 1) - \sum_{i = 0} ^{M - 1} \frac{(H - 1) \times i + A}{M}\\$

$\sum_{i = 0} ^{H - 1} \sum_{j = 0} ^{M - 1} [i \times M + j - H \times j < -A]\\ \sum_{i = 0} ^{H - 1} \left(M - \sum_{j = 0} ^{M - 1} [i \times M + j - H \times j \ge -A] \right)\\ H \times M - \sum_{i = 0} ^{H - 1} \sum_{j = 0} ^{M -1} [i \times M + j - H \times j > -A - 1 + (H + 1) - (H + 1)]\\ H \times M - \sum_{j = 0} ^{M - 1} \sum_{i = 0} ^{H - 1} [i > \frac{(H - 1) \times j +(H + 1)M - A - 1)}{M} - (H + 1)]\\ H \times M - \sum_{j = 0} ^{M - 1} H - 1 - \frac{(H - 1) \times j +(H + 1)M - A - 1}{M} + H + 1\\ -HM + \sum_{i = 0} ^{M - 1} \frac{(H - 1) \times i + (H + 1)M - A - 1}{M}\\$
综上，答案为：
$\sum_{i = 0} ^{M - 1} \frac{(H - 1) \times i + A}{M} - \sum_{i = 0} ^{M - 1} \frac{(H - 1) \times i + (H + 1) M - A + 1}{M}$

#include <bits/stdc++.h>
#define int long long

using namespace std;

long long f(long long a, long long b, long long c, long long n) {
  if (!a) {
    return (b / c) * (n + 1);
  }
  if (a >= c || b >= c) {
    return f(a % c, b % c, c, n) + (b / c) * (n + 1) + (a / c) * n * (n + 1) / 2;
  }
  long long m = (a * n + b) / c;
  return n * m - f(c, c - b - 1, a, m - 1);
}

signed main() {
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  int h, m, a;
  cin >> h >> m >> a;
  cout << min(m + h * m + f(h - 1, a, m, m - 1) - f(h - 1, (h + 1) * m - a - 1, m, m - 1), h * m) << "\n";
  return 0;
}