Hello all, Hope you are doing well in this pandemic. Is there anyone who are working USA softaware companies. I have some query regarding their requiting system. Whats the whole interview process. How they select a bachelor student to their company. How much its regarding to CP? And I am not from USA But planning to go there as one of my family member lives there.

Any details would be great.

Thanks in Advance :)

Is there any way so that I can see how many C question or D question I solved in div2 or educational round?

Thanks in Advance :)

Hy, all. Hope all of you doing well. Since this the qurantine time and most of us getting bored day by day like me. I want to make a practice routine for solving div2 C/D problems. And we can discuss problems and help each other. Interested people please comment here. I need some serious mate.

Thanks a lot.

Sorry for my bad english.

Hi, I am trying to solve the problem for a while but couldn't finish. Can anyone please help me in details that how can I solve the problem.

Problem Link: https://ibb.co/b5DgKwN

Thanks in advance. :) Sorry for my poor english. :)

I am trying to solve the problem for a while but couldn't come up an idea. It would be great if someone can help me to solve the problem. Details explanation would be better. Problem Link: https://vjudge.net/problem/LightOJ-1032

Thanks a lot :) sorry for my poor English. :)

I am trying to solve the problem for a while but couldn't come up a idea. It would be great if someone can help me to solve the problem. I am a bit weak at math. I think its related to probability. Problem Link: https://vjudge.net/contest/312875#problem/E PS: The contest is Ended.

Thanks a lot :) sorry for my poor English. :)

I am trying to solve the problem for a long time but still didn't get any idea how to solve it. It would be great if you help me to solve it. Problem Link : https://vjudge.net/contest/332542#problem/A

Since the contest is ended that's why I share the vjudge link because I think everyone has not a light oj id and this problem is from light online judge(loj). Thanks in advance :) sorry for my poor english. :)

Nowadays I am facing a problem that is, maximum time take long time for understanding a problem for me or even sometime I didnt understand the problem from 2-3 days. But when I understand the problem that is what is going on in the problem, its take just few minutes to code. Its happens maximum time like when the question has a long statement. But if the statement has very short its very easy for me to understand. Its gives me too much pain during contest time. Yes I am a bit weak at English. So my question is how can I improve my problem reading ability so that I can easily understand the problem. Experienced person please give me some useful suggestion. :)

Thanks a lot :) Sorry for my poor english.

I am trying to solve it for a while but didn't come up with a efficient idea. Any hints would be great. Problem Link: https://uva.onlinejudge.org/external/16/1653.pdf Thanks :)

Hy, I am trying solve the problem but not the full problem firstly I am trying to solve the sub part which is I want to count the number of digit which length is n but all digit in n is unique and every digit between difference is maximum 2. After that I will go through the main part of the problem. But the first part of my code doesn't work.

My code idea : I want to count the number of integer with n length from the set of digits s. but My code doesn't work properly. :)

My code link: http://ideone.com/KLcphT

It would be great if u tell me which I am missing.

Full problem: Given a set of digits S, and an integer n, you have to find how many n-digit integers are there, which contain digits that belong to S and the difference between any two adjacent digits is not more than two. Input

Input starts with an integer T (≤ 300), denoting the number of test cases.

Each case contains two integers, m (1 ≤ m < 10) and n (1 ≤ n ≤ 10). The next line will contain m integers (from 1 to 9) separated by spaces. These integers form the set S as described above. These integers will be distinct and given in ascending order.

Output

For each case, print the case number and the number of valid n-digit integers in a single line. Sample Input

Output for Sample Input

3

3 2

1 3 6

3 2

1 2 3

3 3

1 4 6

Case 1: 5

Case 2: 9

Case 3: 9 Note

For the first case the valid integers are

11

13

31

33

66

Thanks a lot. And sorry for my really really poor English. :)