Accepted
Code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n';
bool comp(pair<int,int>a, pair<int,int>b){
return a.first > b.first;
}
void tc(){
int t;
cin >> t;
while (t--){
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
//tc();
int n;
cin >> n;
int ans = 0;
if(n >= 500){
ans += ((n/500)*1000);
n %= 500;
}
ans += ((n/5)*5);
cout << ans << endl;
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:10:02
- Judged At
- 2025-02-17 15:10:02
- Judged By
- Score
- 100
- Total Time
- 4ms
- Peak Memory
- 764.0 KiB