[Demonstration 1]

[Buggy Method]
private static String decrypt(String line, int n) {
    String result = "";
    char[] re2 = line.toCharArray();
    for (int i = 0; i < re2.length; i++) {
        if (re2[i] == (char) 32) {
            //do nothing because it is just space
        } else {
            re2[i] = (char) (re2[i] - n);
            //loop back when it is less than A or a
            if ((re2[i] < 'A') || (re2[i] > 'Z' && re2[i] < 'a')) {
                re2[i] = (char) (re2[i] + 26);
            }
        }
        result = result + re2[i];
    }
    return result;
}

[Buggy Hunk]
if((re2[i] < 'A') || (re2[i] > 'Z' && re2[i] < 'a')) {

[Patch]
if(re2[i] < 'A') {

[Demonstration 2]

[Buggy Method]
public static void main(String[] args) {
    sc = new MyScanner();
    out = new PrintWriter(System.out);
    StringBuilder answer = new StringBuilder();
    int n = sc.nextInt();
    int A = sc.nextInt();
    long[] d = new long[n];
    long sum = 0;
    for (int i = 0; i < n; i++) {
        d[i] = sc.nextLong();
        sum += d[i];
    }
    if (n == 1) {
        out.println(d[0] - 1);
    } else {
        for (int i = 0; i < n; i++) {
            long sub1 = max(1, A - sum + d[i]);
            long sub2 = min(d[i], A - n + 1);
            long ans = d[i] - (sub2 - sub1 + 1);
            answer.append(ans).append(" ");
        }
    }
    out.println(answer.toString());
    out.close();
}

[Buggy Hunk]
int A = sc.nextInt();

[Patch]
long A = sc.nextLong();

[Demonstration 3]

[Buggy Method]
@Override
public void handleClick(int position) {
    eventBus.post(new PlayQueueEvent(data, position));
}

[Buggy Hunk]
eventBus.post(new PlayQueueEvent(data, position));

[Patch]
eventBus.post(new PlayQueueEvent(data, position, true));