Question

ANSWER IN C PLEASE (:

ew History Bookmarks Window Help 13.16. Loops E ry> ECE 270 home > 13.16 Loops-Ex4 zyBooks catalog TO.TU LOOo Write a program that prints a pattern like the ones shown below Ask the user to input the letter that goes in the middle of the last row in the pyramid (uppercase or lowercase). The pattern should extend to the character entered. In the Example 1, the pattern is the result from an input value of E. Consider the alphabet as a continuous list such that before the A comes Z (see example 2) Hint: Use nested loops Example 1: Input Output Example 2: nput Ouxput 5 6 7 8

Answer 1

#include<iostream>
using namespace std;
int ascc(int n,int prev);
int ascc1(int n);
int ascc2(int n);
int main()
{
int i,j,k,l,m,asc,ch1,ch2;
char c;
printf("Enter a character:");
cin>>c;
int as=c;

for(i=1;i<=5;i++)
{
        for(j=1;j<=5-i;j++)
        {
                cout<<" ";
        }
        ch1=as-4;
        for(k=1;k<=i;k++)
        {
                cout<<(char)ascc(ch1,as);
                ch1++;
        }
        ch2=ch1-2;
        for(l=1;l<i;l++)
        {
                cout<<(char)ascc(ch2,as);
                ch2--;
        }
        cout<<"\n";
}
}
int ascc(int n,int prev)
{
if(prev>=65&&prev<=90)
return(ascc1(n));
else
return(ascc2(n));
}
int ascc1(int n)
{
        if((n>=65 && n<=90)||(n>=97&&n<=122))
                return(n);
        else if(n<65)
                return(n+26);
        else if (n>122)
                return(n-26);
        else if (n>90 && n<95)
                return(n-26);
        else if(n>=93 && n<97)
                return(n+26);
}
int ascc2(int n)
{
        if((n>=65 && n<=90)||(n>=97&&n<=122))
                return(n);
        else if(n<65)
                return(n+26);
        else if (n>122)
                return(n-26);
        else if(n>=93 && n<97)
                return(n+26);
}