Tokitsukaze and All Zero Sequence Codeforces Solution | Codeforces Problem Solution 2022

Tokitsukaze and All Zero Sequence Codeforces Solution | Codeforces Problem Solution 2022

A. Tokitsukaze and All Zero Sequence

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Tokitsukaze has a sequence 𝑎$a$ of length 𝑛$n$. For each operation, she selects two numbers 𝑎𝑖$a_i$ and 𝑎𝑗$a_j$ (𝑖≠𝑗$i\ne j$; 1≤𝑖,𝑗≤𝑛$1\le i,j\le n$).

• If 𝑎𝑖=𝑎𝑗$a_i=a_j$, change one of them to 0$0$.
• Otherwise change both of them to min(𝑎𝑖,𝑎𝑗)$min(a_i,a_j)$.

Solution Click Below:-  CLICK HERE

Tokitsukaze wants to know the minimum number of operations to change all numbers in the sequence to 0$0$. It can be proved that the answer always exists.

Tokitsukaze and All Zero Sequence Codeforces Solution

[Solution] Tokitsukaze and Good 01-String

[Solution] Tokitsukaze and Good 01-String (hard version)

Tokitsukaze and Strange Inequality Codeforces Solution

Tokitsukaze and Meeting Codeforces Solution

Tokitsukaze and Two Colorful Tapes Codeforces Solution

Tokitsukaze and Permutations Codeforces Solution

Input

The first line contains a single positive integer 𝑡$t$ (1≤𝑡≤1000$1\le t\le 1000$) — the number of test cases.

For each test case, the first line contains a single integer 𝑛$n$ (2≤𝑛≤100$2\le n\le 100$) — the length of the sequence 𝑎$a$.

The second line contains 𝑛$n$ integers 𝑎1,𝑎2,…,𝑎𝑛$a_1,a_2,\dots ,a_n$ (0≤𝑎𝑖≤100$0\le a_i\le 100$) — the sequence 𝑎$a$.

Output

For each test case, print a single integer — the minimum number of operations to change all numbers in the sequence to 0$0$.

Note

In the first test case, one of the possible ways to change all numbers in the sequence to 0$0$:

In the 1$1$-st operation, 𝑎1<𝑎2$a_1<a_2$, after the operation, 𝑎2=𝑎1=1$a_2=a_1=1$. Now the sequence 𝑎$a$ is [1,1,3]$[1,1,3]$.

In the 2$2$-nd operation, 𝑎1=𝑎2=1$a_1=a_2=1$, after the operation, 𝑎1=0$a_1=0$. Now the sequence 𝑎$a$ is [0,1,3]$[0,1,3]$.

In the 3$3$-rd operation, 𝑎1<𝑎2$a_1<a_2$, after the operation, 𝑎2=0$a_2=0$. Now the sequence 𝑎$a$ is [0,0,3]$[0,0,3]$.

In the 4$4$-th operation, 𝑎2<𝑎3$a_2<a_3$, after the operation, 𝑎3=0$a_3=0$. Now the sequence 𝑎$a$ is [0,0,0]$[0,0,0]$.

So the minimum number of operations is 4$4$.

Join Now for Solution:-