結果

問題 No.1252 数字根D
コンテスト
ユーザー KoD
提出日時 2020-10-09 22:05:24
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 3,265 bytes
コンパイル時間 2,119 ms
コンパイル使用メモリ 108,244 KB
最終ジャッジ日時 2025-01-15 04:44:53
ジャッジサーバーID
（参考情報） 		judge3 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 14
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>

#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { lhs = rhs; return true; }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { lhs = rhs; return true; }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }
  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }
  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 
};

/**
 * @title Range
 */
#line 16 "main.cpp"

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  usize testcases;
  std::cin >> testcases;
  auto solve = [&]() -> int {
    i64 d, a, b;
    std::cin >> d >> a >> b;
    if (a == 0) {
      if (b == 0) {
        std::cout << "0\n";
        return 0;
      }
      ++a;
    }
    i64 len = b - a + 1;
    i64 loop = len / (d - 1);
    i64 ans = loop * (d * (d - 1) / 2);
    i64 remain = len - loop * (d - 1);
    if (remain > 0) {
      i64 first = (a % (d - 1) == 0 ? d - 1 : a % (d - 1));
      i64 last = first + remain - 1;
      if (last > d - 1) {
        last = (last % (d - 1) == 0 ? d - 1 : last % (d - 1));
        ans += (first + (d - 1)) * ((d - 1) - first + 1) / 2;
        ans += (1 + last) * (last - 1 + 1) / 2;
      }
      else {
        ans += (first + last) * remain / 2;
      }
    }
    std::cout << ans << '\n';
    return 0;
  };
  while (testcases--) {
    solve();
  }
  return 0;
}
0