/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 1ms 540.0 KiB
#3 Accepted 2ms 540.0 KiB
#4 Accepted 4ms 540.0 KiB
#5 Accepted 2ms 540.0 KiB
#6 Accepted 1ms 540.0 KiB
#7 Accepted 1ms 572.0 KiB
#8 Accepted 2ms 772.0 KiB
#9 Accepted 1ms 352.0 KiB
#10 Accepted 1ms 540.0 KiB
#11 Accepted 2ms 540.0 KiB
#12 Accepted 1ms 540.0 KiB
#13 Accepted 1ms 540.0 KiB
#14 Accepted 1ms 540.0 KiB

Code

#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
#define pi 2*acos(0.0)
#define f first
#define s second
#define inf INT_MAX
#define MXN 500001
#define endl "\n"
#define eps 1e-6
#define mod 1000000007
#define all(x) x.begin(), x.end()
#define rev(x) x.rbegin(), x.rend()
#define spc(x) cout << fixed << setprecision(x)
#define fastio {ios_base::sync_with_stdio(false); cin.tie(NULL);}
#define test ll t; cin >> t; while (t--)

typedef long long ll;
using namespace std;

void solve()
{
    ll n; cin>>n;

    ll ans = (n/500)*1000 + ((n%500)/5)*5;
      cout<<ans<<endl;
}
int32_t main()
{
   fastio
   int t = 1;
   //cin >> t;
   while (t--) {
      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 14:37:14
Judged At
2025-02-17 14:37:14
Judged By
Score
100
Total Time
4ms
Peak Memory
772.0 KiB