The Last One is the Best (AOJ 0297) by ynu_d
Contest: 3421    RunID: 2277073    Status: Compile Error    Date: Sun Apr 23 15:43:16 JST 2017


#include <bits/stdc++.h>
#include<algorithm>
using namespace std;

int main(){
    int N;
    cin >>N;
    int k[N],p[N];
    cin k[N],p[N];
    for(int i =0;i<N;++i){
        cout << k[i]%p[i] <<endl;
    }
    return 0;
}