number of subset of subarray

Statement

Harsh is hosting a workshop and there are [[N]] participants attending the workshop forming a line. each participant can make groups such that he can be in a group with a person just behind him. ( given 3 participants (imagine them standing in list [1, 2, 3]) 3 can form only a solo group ( as there is no one behind him. 2 can form a group with [3]. 1 can form a group with [ 2, (2, 3) ] ) now Harsh want to choose some contiguous subset of participants from the group. You have to tell what is the total number of possible options. for 3 participants ([1, 2, 3,]) Harsh can choose ([1], [2], [3], [1, 2], [2, 3], [1, 2, 3])

Input description

First-line contain a number of test cases [[T]], following [[T]] line has single input [[N]]

Output description

You have to tell what is the total number of possible options.

Constraints

{{1}} <= [[T]] <= {{10}} {{1}} <= [[N]] <= {{1e6}}

Game modes

Shortest

Test cases

Test 1 Test

Input

2 3 4

Output

6 10

Validator 1 Validator

Input

5 1 2 5 7 9

Output

1 3 15 28 45

Test 2 Test

Input

6 885441 403959 794773 933489 441002 42451

Output

392003324961 81591638820 315832458151 435701323305 97241602503 901064926

Validator 2 Validator

Input

5 54405 962441 306480 183490 142564

Output

1479979215 463146820461 46965148440 16834381795 10162318330

Test 3 Test

Input

8 289776 395789 722018 292156 913379 410166 233055 581430

Output

41985209976 78324664155 260655357171 42677710246 417131055510 84118278861 27157433040 169030713165

Validator 3 Validator

Input

10 323874 57993 67233 263429 74359 379122 522567 494651 141374 90330

Output

52447345875 1681623021 2260171761 34697550735 2764667620 71866935003 136538396028 122340053226 9993374625 4079799615

Test 4 Test

Input

9 512547 610078 415230 472774 163773 267920 629369 850890 870384

Output

131352469878 186097888081 86208184065 111757863925 13410879651 35890697160 198052983765 362007321495 378784588920

Validator 4 Validator

Input

8 13317 444828 348788 730529 41412 199649 794502 972858

Output

88677903 98936197206 60826708866 266836675185 857497578 19929961425 315617111253 473226830511

Solution language

Solution

Stub generator input

Rate this contribution

Make the contribution public (50+ clashes played)

Comments

28 Comments

JustCarpinThemDiems Unnamed CodinGamer

about 2 years ago

English statement is sub-par in every aspect. Even overlooking wording/language mistakes, the statement is difficult and unpleasant to process and/or plain wrong, it's hard to pinpoint due to the odd wording. Desperately needs to be revised.

CodinBot Unnamed CodinGamer

about 2 years ago

This contribution hasn’t received enough positive votes from the community. The "FASTEST" option has therefore been deactivated.

YaShuHee Unnamed CodinGamer

about 2 years ago

Hey :) I just had this in Clash of Code. From the 1st to the 8th, we all agreed, that this was really badly explained. Please, work again on the description. We all lost our hair.

YaShuHee Unnamed CodinGamer

about 2 years ago

and our calm

ClawLegend Unnamed CodinGamer

about 2 years ago

✅ Approved the contribution. Comment: A little challenging but fun

Gic76 Unnamed CodinGamer

about 2 years ago

✅ Approved the contribution. Comment: Starting to code the solution without really understand the problem, ends up to a nested cycle solution (for(1..n) of a for(i..n)). Correctly recognizing the problem makes it being resolved fast with 1 line of code.

Gic76 Unnamed CodinGamer

about 2 years ago

I like this kind of challenge because if you start to code the solution in no-brain mode (without thinking about the problem), you'll end up to a nested cycle solution (for(1..n) of a for(i..n)). But when you recognize that this is the same problem Gauss resolved when he was 8, then you can write a 1-line-of-code solution. Well done, I love it!

ClawLegend Unnamed CodinGamer

about 2 years ago

Here's an alternate statement that I think makes the problem more clear. Take what you will from it Harsh must choose a subgroup of people from a single file line of N people. A subgroup may be of any size from 1 to N, but the subgroup must be taken from a continuous set of the original line. For example, given a line of 3 people [A,B,C] Harsh can create any one of the following subgroups: A, AB, ABC, B, BC, C, for a total of 6 different combinations. Please note however, he cannot create group AC, because A and C are not next to each other in the original line. Given T lines of N people, for each line output the total number of unique subgroups Harsh can make.

ClawLegend Unnamed CodinGamer

about 2 years ago

Hmmm, this is a tricky one. I hate to admit I spent more than 15 minutes trying to come up with a statistical solution before finally finding the much simpler actual solution (I didn't realize that you couldn't skip...i.e. you couldn't have a group of 1,3 without 2). Maybe if you explain that a little better. Make it clear that "all members of each group must be next to each other in the line." Or even just putting the combos in a different order, for example: ([1], [1,2], [1,2,3], [2], [2,3], [3]) or even ([1], [1,2], [1,2,3], [2], [2,3], [3])

krishna_jalan_ Unnamed CodinGamer

about 2 years ago

I have made some changes to the problem statement. but "contiguous" refers to the continuous elements.

AbrahamJLR Unnamed CodinGamer

about 2 years ago

I liked this challenge, but I think it should be better explained. My solution: for i in range(int(input())): n=int(input()) print(n*(n+1)//2)

Malte42 Unnamed CodinGamer

about 2 years ago

I found it hard to understand, what the question is. You are writing 'now Harsh want to choose some contiguous subset of participants from the group' - but what group is meant? Do you want to say: Now Harsh want to choose one of the possible groups? If I guess the problem right, for me the following would be clearer: given 3 participants (imagine them standing in list [1, 2, 3]) [3] can be in only one group, there is no one behind him [2] can be in two groups [2], [2,3] [1] can be in three groups [1], [1,2],[1,2,3] - [1,3] is no possible group for [1] because [3] is not behind [1]. The question is: How many groups are possible?

krishna_jalan_ Unnamed CodinGamer

about 2 years ago

I guess my wordings were unclear, but I have made some changes to the statement but kept the original structure to avoid making it too easy. else it will be a problem only to use "sum of special series". and example and the first few test cases are fairly simple to get the insight of the problem.

e_fishel Unnamed CodinGamer

about 2 years ago

I don't think this problem suits reverse mode well enough. As for fastest and shortest, I like it.

e_fishel Unnamed CodinGamer

about 2 years ago

Here's my shortest mode solution (JS): r=readline for(r();N=r();)print(N++*N/2)

Epouvantur Unnamed CodinGamer

about 2 years ago

✅ Approved the contribution. Comment: Excepte from my previous comment the contribution is good

Epouvantur Unnamed CodinGamer

about 2 years ago

I have only one thing that bothers me: you say " in a group with a person behind him". In your example, you say that there are 3 participant. So 1 is in first line. He should be able to form a group with 2 and 3. In the contrary, 3 is in last position. So he should be able to be only in his own group. I would write: 1 can form group ([1, 2, 3]) 2 can form group ([2, 3]). 3 can form only solo ([3]) team as there is no one behind him.

krishna_jalan_ Unnamed CodinGamer

about 2 years ago

thanks for the suggestion. Made the changes

Vintarel Unnamed CodinGamer

over 2 years ago

Why is the solo group [1] counted three times in the example you show ?

krishna_jalan_ Unnamed CodinGamer

over 2 years ago

it is a total number of options. So there can be multiple possible option to pick a group then from each group there are a number of possible arrangements. does this help Or should I change some statement if it is not clear?

ABOUT US CAREERS PRIVACY FAQ BLOG

The #1 tech hiring platform

SCREENING INTERVIEWING