| # | Title | Difficulty | Tag | Time, ms | Time, %

|------|----------------|-------------|-------------|----------|---------

| 2318 |[Number of Distinct Roll Sequences](src/main/java/g2301_2400/s2318_number_of_distinct_roll_sequences/Solution.java)| Hard || 254 | 91.67

| 2317 |[Maximum XOR After Operations](src/main/java/g2301_2400/s2317_maximum_xor_after_operations/Solution.java)| Medium || 1 | 100.00

| 2316 |[Count Unreachable Pairs of Nodes in an Undirected Graph](src/main/java/g2301_2400/s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph/Solution.java)| Medium || 32 | 100.00

| 2315 |[Count Asterisks](src/main/java/g2301_2400/s2315_count_asterisks/Solution.java)| Easy || 1 | 100.00

packageg2301_2400.s2318_number_of_distinct_roll_sequences;

publicclassSolution {

privateint[][][]memo =newint[10001][7][7];

privateintmod =1000000007;

privateint[][]m = {

{1,2,3,4,5,6},

{2,3,4,5,6},

{1,3,5},

{1,2,4,5},

{1,3,5},

{1,2,3,4,6},

{1,5}

};

publicintdistinctSequences(intn) {

returndp(n,0,0);

}

privateintdp(intn,intprev,intpprev) {

if (n ==0) {

return1;

}

if (memo[n][prev][pprev] !=0) {

returnmemo[n][prev][pprev];

}

intans =0;

for (intx :m[prev]) {

if (x !=pprev) {

ans = (ans +dp(n -1,x,prev)) %mod;

}

}

memo[n][prev][pprev] =ans;

returnans;

}

}

2318\. Number of Distinct Roll Sequences

Hard

You are given an integer`n`. You roll a fair 6-sided dice`n` times. Determine the total number of**distinct** sequences of rolls possible such that the following conditions are satisfied:

1. The**greatest common divisor** of any**adjacent** values in the sequence is equal to`1`.

2. There is**at least** a gap of`2` rolls between**equal** valued rolls. More formally, if the value of the <code>i^th</code> roll is**equal** to the value of the <code>j^th</code> roll, then`abs(i - j) > 2`.

Return_the**total number** of distinct sequences possible_. Since the answer may be very large, return it**modulo** <code>10⁹ + 7</code>.

Two sequences are considered distinct if at least one element is different.

**Example 1:**

**Input:** n = 4

**Output:** 184

**Explanation:** Some of the possible sequences are (1, 2, 3, 4), (6, 1, 2, 3), (1, 2, 3, 1), etc.

Some invalid sequences are (1, 2, 1, 3), (1, 2, 3, 6).

(1, 2, 1, 3) is invalid since the first and third roll have an equal value and abs(1 - 3) = 2 (i and j are 1-indexed).

(1, 2, 3, 6) is invalid since the greatest common divisor of 3 and 6 = 3.

There are a total of 184 distinct sequences possible, so we return 184.

**Example 2:**

**Input:** n = 2

**Output:** 22

**Explanation:** Some of the possible sequences are (1, 2), (2, 1), (3, 2).

Some invalid sequences are (3, 6), (2, 4) since the greatest common divisor is not equal to 1.

There are a total of 22 distinct sequences possible, so we return 22.

**Constraints:**

* <code>1 <= n <= 10⁴</code>

packageg2301_2400.s2318_number_of_distinct_roll_sequences;

importstaticorg.hamcrest.CoreMatchers.equalTo;

importstaticorg.hamcrest.MatcherAssert.assertThat;

importorg.junit.jupiter.api.Test;

classSolutionTest {

voiddistinctSequences() {

assertThat(newSolution().distinctSequences(4),equalTo(184));

}

voiddistinctSequences2() {

assertThat(newSolution().distinctSequences(2),equalTo(22));

}

}