/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 320.0 KiB
#3 Accepted 2ms 532.0 KiB
#4 Accepted 2ms 768.0 KiB
#5 Accepted 1ms 532.0 KiB
#6 Accepted 2ms 532.0 KiB
#7 Accepted 1ms 532.0 KiB
#8 Accepted 1ms 348.0 KiB
#9 Accepted 2ms 388.0 KiB
#10 Accepted 2ms 564.0 KiB
#11 Accepted 2ms 496.0 KiB
#12 Accepted 1ms 456.0 KiB
#13 Accepted 1ms 560.0 KiB
#14 Accepted 1ms 432.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) v.begin(),v.end()
#define endl '\n'
#pragma GCC target("popcnt")
#define bug(...) __f (#__VA_ARGS__, __VA_ARGS__);
template <typename Arg1>void __f (const char* name, Arg1&& arg1) {cout << name << " : " << arg1 << endl;}template <typename Arg1, typename... Args>void __f (const char* names, Arg1&& arg1, Args&&... args){const char* comma = strchr (names + 1, ',');cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);}

void solve(ll cs) {
    ll n;
    cin >> n;
    ll ans = 0;
    while(n>=500){
        n -= 500;
        ans += 1000;
    }
    while(n>=5){
        n -= 5;
        ans += 5;
    }

    cout << ans << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
  
    ll t=1, cs=1;
    //cin>>t;
    while(t--) {
        solve(cs++);
    }

    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:38:01
Judged At
2025-02-17 14:38:01
Judged By
Score
100
Total Time
2ms
Peak Memory
768.0 KiB