fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. void solve(){
  5. long long s, k, m;
  6. cin >> s >> k >> m;
  7.  
  8. long long modulo = m % k;
  9. if ((m/k)%2 == 0){
  10. if (s > modulo) cout << s - modulo << '\n';
  11. else cout << 0 << '\n';
  12. }else{
  13. if (min(k, s) > modulo) cout << min(k, s) - modulo << '\n';
  14. else cout << 0 << '\n';
  15. }
  16. }
  17.  
  18. int main(){
  19. long long tc; cin >> tc; while(tc--)solve();
  20. }
Success #stdin #stdout 0.01s 5320KB
stdin
6
8 8 12
5 10 17
12 2 3
16 7 7
1 1 10
2 60 15
stdout
4
0
1
7
1
0