Programming & Computer Science Answers

Command Line Argument - Count

Write a program to accept strings as command-line arguments and print the number of arguments entered.

Sample Input (Command Line Argument) 1:

Command Arguments

Sample Output 1:

Arguments :

Command

Arguments

The number of arguments is 2 

Sample Input (Command Line Argument) 2:

Commands

Sample Output 2:

Arguments :

Commands

The number of arguments is 1

Command Line Argument - Print String

Write a program to accept a string as a command-line argument and print the same.

Sample Input (Command Line Argument) 1:

Programming

Sample Output 1:

Programming - Command Line Arguments

Sample Input (Command Line Argument) 2:

Arguments

Sample Output 2:

Arguments - Command Line Arguments

Recursion 3: Compute a^n

Write a program to compute a^n (a power n) using recursion.

Note:

Refer to the problem requirements.

Shell Scripting Function Specifications:

Use the function name as computePower() and the 2 integer arguments.

This function returns an integer value that is 'a power n'.

Function specification:

int computePower(int a,int n)

Input and Output Format:

Input consists of 2 integers.

The output is the a power n.

Refer sample input and output for formatting specifications.

Sample Input and Output:

[All text in bold corresponds to input and the rest corresponds to output.]

Enter the value of a

2

Enter the value of n

8

The value of 2 power 8 is 256

write a java program that accepts an ordinary number and outputs its equivalent roman numerals. the ordinary numbers and their equivalent roman numerals are given below: ordinary numbers roman numerals.

1. Let a linked list consists of n number of nodes, where each node consists of an unique character that represents the grades of the students (O, E, A, B, C ), and pointer to the next node. Write the C code to group the students having the same grade in consecutive places and also finally all the nodes should be in sorting order as per their grade value. (O->O->E->E->E->A->B->B->C->C->C)

Misha was playing with Balanced Brackets alone. Mykhailo also wanted to play the game with her, so he comes up and asks her a question.

Misha is allowed to chose a sub-sequence (i.e. not necessarily contiguous substring) of brackets. AFTER chosing a the sub-sequence, she is allowed to re-arrange it (if needed) such that this chosen sub-sequence (after rearrangement) is balanced. Find the maximum length of this sub-sequence. (Please note that the resulting sub-sequence , after rearrangement MUST be balanced.)

Input:

• First line will contain T
• T, number of testcases. Then the testcases follow.
• First line of each test case has an integer N
• N, denoting length of string.
• Second line of each test case has a string S
• S which is the string. String will only consist of '(' and ')'.

Output:

For each testcase, the maximum possible length of balanced string.

Constraints

• 1≤T≤10
• 1≤T≤10
• 1≤|S|≤10
• 5
• 1≤|S|≤105
• String will only consist of '(' and ')'.

Given an array A of N integers and two integers X and Y, find the number of integers in the array that are both less than or equal to X and divisible by Y.

Input

• The first line of the input contains an integer T denoting the number of test cases. The description of each test case follows.
• The first line of each test case contains three space separated integers: N, X and Y.
• The second line contains N space-separated integers A₁, A₂, ..., A_N denoting the array A.

Output

For each test case, output a single line containing the answer.

Constraints

• 1 ≤ T ≤ 10
• 1 ≤ N ≤ 10⁵
• 1 ≤ A₁, A₂, ... ,A_N ≤ 10⁹
• 1 ≤ X, Y ≤ 10⁹

I think it's already a given that two sentences combined will always be longer than a single sentence alone, but to prove just how long two sentences can be, why don't we let our program show the combined length of the two randomly inputted strings?

Let's get it on!

Input

Two lines containing a string on each.

Python·is·fun
I·love·CodeChum

Many programming languages, especially older ones, provide no language support for concurrency. C and C++ are examples of such languages. Is it essential that a language include syntax for concurrency to be able to write concurrent programs in that language? If not, how is it accomplished? What are the advantages and disadvantages of including support for concurrency in a language?