Submission #2596452

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <limits>
#include <cassert>
#include <map>
#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define REPI(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define uniq(v) (v).erase(std::unique((v).begin(), (v).end()), (v).end())
constexpr long MOD = 1e9 + 7;
long gcd(long a, long b) {return b % a ? gcd(b % a, a) : a;}
long lcm(long a, long b) {return a / gcd(a, b) * b;}
using namespace std;
using P = pair<long, long>;
using VI = vector<long>;

int main() {
    long a, b;
    cin >> a >> b;
    cout << a / b * b << endl;
}

Submission Info

Judge Result