/ SeriousOJ /

Record Detail

Accepted


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

Code

/* SRIJON
        SINGHA
            SAMANTA */
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define nl "\n"
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define yes cout << "YES" << nl
#define no cout << "NO" << nl
#define fi first
#define sec second
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define FIO                           \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
const int mod = 1e9 + 7;

void solve()
{

    ll n;   cin>>n;
    ll ans=1000*(n/500);
    n%=500;
    ans+=(5*(n/5));
    cout<<ans<<nl;

}

int32_t main()
{
    FIO

    ll t=1;
    // cin>>t;
    for(ll i=1;i<=t;i++)
    {
        // cout<<"Case "<<i<<": ";
        solve();           
    }

    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 15:44:23
Judged At
2025-02-17 15:44:23
Judged By
Score
100
Total Time
2ms
Peak Memory
764.0 KiB