Expand alphabets occurrence

Expand alphabets occurrence 

Problem: 

A string consisting of short hand form of occurrence of alphabets will be passed as input. The program must expand the code and print the alphabets. Input Format: The first line will contain the short hand form of the code of length L. 

Boundary Conditions: 

2 <= L <= 20 

Output Format: The alphabets occurrence based on the short hand code. 

Example Input/Output 1: 

Input: 

a3b5a2 

Output: 

aaabbbbbaa 

Explanation: 

a3 implies a has to occur 3 times and hence a is printed thrice. b5 implies b has to be occur five times and hence b is printed five times. a2 again implies a has to occur 2 times and hence a is printed thrice.

Example Input/Output 2: 

Input: 

z2m6c4 

Output: 

zzmmmmmmcccc 

Example Input/Output 3: 

Input: 

abc5 

Output: 

aaaaabbbbbccccc 

Explanation: 

Here there is no number after a and b. This implies the next immediate number of occurrence is applicable to both a and b. Hence 5 which occurs after c is applicable to a and b too. So all the three alphabets a,b,c are printed five times.

Program:

#include<stdio.h>

#include<stdlib.h>

int main()

{

    int i; 

    char c;

    while(scanf("%c%d",&c,&i)==2)

    {

        for(int j=0;j<i;j++)

        {

            printf("%c",c);

        }

    }

}

Comments

Post a Comment

Popular posts from this blog

Pronic Integers in N - InfyTQ question

Pronic Integers in N - InfyTQ question Problem:  The program must accept an integer N as the input. The program must print all the pronic integers formed by a series of continuously occurring digits (in the same order) in N as the output. The pronic integers can be represented as n*(n+1). Input:  93042861 Output: 930 30 0 42 2 6 Program: import math  s = input().strip() def check_pronic(num):      sq = math.floor(math.sqrt(num))      return (sq*(sq+1)) == num  l = []   for i in range(len(s)):      for j in range(i,len(s)):          substr = int(s[i:j+1])          if s[i:j+1] == "0":             l.append(substr)         elif s[i:j+1][0]!='0' and check_pronic(substr):             l.append(substr)  print(*l)             Expl...
Read more

Count Strong Points - Accenture

 Count Strong Points - Accenture Problem: The program must accept an integer matrix of size RxC as the input. The program must print the number of strong points in the given matrix as the output. The strong points are located at the element(s) whose all the surrounding elements are smaller than the given element. Input:  3 3  56 92 45  19 41 51  55 31 80 Output: 3  Program: n,m = map(int,input().split()) l = []  for i in range(n):      l.append(list(map(int,input().split()))) count = 0      for i in range(n):      for j in range(m):         c = 0         if i-1 >= 0 and l[i-1][j] >= l[i][j]:             c = 1          if i+1 < n and l[i+1][j] >= l[i][j]:              c = 1          if j-1 >= 0 and l[i][j-1] >= l[i][j]:     ...
Read more

Letters at position of multiples of a number

Letters at position of multiples of a number   Problem: A string of length L consists of characters is passed as input to the program. A given number N is also passed as the input to the program. The program must print the characters at the positions which are multiples of the given number.  Input Format:  The first line will contain the string of length L.  The second line will contain the number N.  Boundary Conditions:  3 <= L <= 50  1 <= N <= 30  Output Format:  The characters at the positions which are multiples of the given number.  Example Input/Output 1:  Input:  abcdef  3  Output:  cf  Explanation:  Multiples of 3 are like 3,6,9,... So the characters at positions 3,6 namely c and f are printed as output.  Example Input/Output 2:  Input:  environment  2  Output:  niomn  Explanation:  As it must be multiples of 2, the characters at even pos...
Read more