codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1364A.md (1631B)


      1 Source: https://codeforces.com/problemset/problem/1364/A
      2 
      3 A. XXXXX
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 Ehab loves number theory, but for some reason he hates the number $x$. Given an array $a$, find the length of its longest subarray such that the sum of its elements isn't divisible by $x$, or determine that such subarray doesn't exist.
     22 
     23 An array $a$ is a subarray of an array $b$ if $a$ can be obtained from $b$ by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end.
     24 
     25 Input
     26 
     27 The first line contains an integer $t$ $(1 \le t \le 5)$ — the number of test cases you need to solve. The description of the test cases follows.
     28 
     29 The first line of each test case contains 2 integers $n$ and $x$ ($1 \le n \le 10^5$, $1 \le x \le 10^4$) — the number of elements in the array $a$ and the number that Ehab hates.
     30 
     31 The second line contains $n$ space-separated integers $a_1$, $a_2$, $\ldots$, $a_{n}$ ($0 \le a_i \le 10^4$) — the elements of the array $a$.
     32 
     33 Output
     34 
     35 For each testcase, print the length of the longest subarray whose sum isn't divisible by $x$. If there's no such subarray, print $-1$.
     36 
     37 Example
     38 
     39 Input
     40 
     41 ```
     42 3
     43 3 3
     44 1 2 3
     45 3 4
     46 1 2 3
     47 2 2
     48 0 6
     49 ```
     50 
     51 Output
     52 
     53 ```
     54 2
     55 3
     56 -1
     57 ```
     58 
     59 Note
     60 
     61 In the first test case, the subarray $[2,3]$ has sum of elements $5$, which isn't divisible by $3$.
     62 
     63 In the second test case, the sum of elements of the whole array is $6$, which isn't divisible by $4$.
     64 
     65 In the third test case, all subarrays have an even sum, so the answer is $-1$.