Construct the Array.java

//https://www.hackerrank.com/challenges/construct-the-array/problem
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution {

    // Complete the countArray function below.
    static long countArray(int n, int k, int x) {
        // Return the number of ways to fill in the array.
        long temp,one,other;
        temp=one=1;
        other=0;
        long mod =1000000007;
        for(int i=1;i<n;i++)
        {
            temp= one;
            one=(other*(k-1))%mod;
           // other=(temp+(((k-2)*(other))%mod))%mod; 
           other =(temp +((k-2)*(other)%mod))%mod;
        
        }
        if(x==1)
            return one;
        else
            return other;
    }

    private static final Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) throws IOException {
        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

        String[] nkx = scanner.nextLine().split(" ");

        int n = Integer.parseInt(nkx[0]);

        int k = Integer.parseInt(nkx[1]);

        int x = Integer.parseInt(nkx[2]);

        long answer = countArray(n, k, x);

        bufferedWriter.write(String.valueOf(answer));
        bufferedWriter.newLine();

        bufferedWriter.close();

        scanner.close();
    }
}