/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 3ms 532.0 KiB
#2 Accepted 2ms 532.0 KiB
#3 Accepted 2ms 536.0 KiB
#4 Accepted 2ms 532.0 KiB
#5 Accepted 3ms 496.0 KiB
#6 Accepted 6ms 532.0 KiB
#7 Accepted 5ms 532.0 KiB
#8 Accepted 5ms 532.0 KiB
#9 Accepted 5ms 532.0 KiB
#10 Accepted 6ms 532.0 KiB
#11 Accepted 5ms 532.0 KiB
#12 Accepted 5ms 532.0 KiB
#13 Accepted 5ms 532.0 KiB
#14 Accepted 5ms 532.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using i128 = __int128;

void solve () {
  ll n;
  cin >> n;
  int ans = 0;
  while (1) {
    if (n < 500) break;
    n -= 500;
    ans += 1000;
  }
  while (1) {
    if (n < 5) break;
    n -= 5;
    ans += 5;
  }
  cout << ans << '\n';
}

int32_t main() {
  auto begin = std::chrono::high_resolution_clock::now();
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int T = 1;
 // cin >> T;
  for(int i = 1; i <= T; i++) {
    //  cout << "Case " << i << ": ";
      solve();
  }
  auto end = std::chrono::high_resolution_clock::now();
  auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
  cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
  return 0;
}

Information

Submit By
Type
Submission
Problem
P1132 Festivity Frenzy!
Contest
Brain Booster #8
Language
C++17 (G++ 13.2.0)
Submit At
2025-02-17 14:43:51
Judged At
2025-02-17 14:43:51
Judged By
Score
100
Total Time
6ms
Peak Memory
536.0 KiB