Submission #1872315

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <string>
#include <set>
#define INF 1000000000
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define LOOP(i,N) for(int i=0;i<N;i++)
#define LOOP1(i,N) for(int i=1;i<=N;i++)
typedef pair<int,int> P;
typedef pair<int,pair<int,int> > PP;
const int MAX_V=100000;
#define int long long
struct edge{int to,cost;};
int V,E;
vector<edge> G[MAX_V];
int d[MAX_V];

signed main(){
  string S;
  int A,B,C,D;
  int N;
  cin>>A>>B;
  cout << (A-(A%B))%B<<endl;
}

Submission Info

Judge Result