Codeforces 466A - Cheap Travel solution

  Solution in C++: 

///******Bismillahir-Rahmanir-Rahim******///

///AH Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh 

  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int main()
  4. {
  5. int n,m,a,b;
  6. cin>>n>>m>>a>>b;
  7. if(m*a<=b)
  8. cout<<n*a<<endl;
  9. else
  10. cout<<(n/m)*b+min((n%m)*a,b)<<endl;
  11.  
  12. }

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.