Beruflich Dokumente
Kultur Dokumente
return;
}
for(j=1;j<i;j++) // Prints the numbers with * in
#include<stdio.h> ith Line
int main( ) { {
int rows; printf("%d*",i);
scanf("%d",&rows); }
MirrorPattern(rows); printf("%d",i);
return 0; } printf("\n"); }
void MirrorPattern(int n) { return;
// Write Your code here }
int i , j ;
for(i=1;i<=n;i++) // Prints first half of the
pattern
{
for(j=1;j<i;j++)
{
printf("%d*",i); // Prints the numbers with * in
ith Line
}
printf("%d",i); //Prints the last number
without * ith Line
printf("\n"); 2. Pattern 2:
}
return;
}
ffor(i=n-
int main( ) {
1;i>=1;i--) //Prints second half of
int rows;
the pattern
scanf("%d",&rows);
{
MirrorPattern(rows);
for(j=1;j<i;j++) // Prints the numbers with * in
return 0; }
ith Line
void MirrorPattern(int n) {
{
// Write Your code here
printf("%d*",i);
int i , j ;
}
for(i=1;i<=n;i++) // Prints first half of the
printf("%d",i);
pattern
printf("\n"); }
{
return;
for(j=1;j<i;j++)
}
{
printf("%d*",i); // Prints the numbers with * in
ith Line
}
printf("%d",i); //Prints the last number
without * ith Line
printf("\n");
}
3. Pattern 3: (Mirror Pattern)
#include<stdio.h>
int main( ) {
Pattern(4);
return 0; }
void Pattern(int n)
{ // Write Your code here
int i, j, k=1, m;
for (i=1;i<=n;i++) // Prints first half of the pattern
{
for (j=1;j<i;j++) //To print i-1 numbers in ith row
{
printf("%d*",k++); // Prints the numbers with * in ith Line
}
printf("%d",k++); //Prints the last number without * in ith line
printf("\n"); } //end of loop i. First half pattern printed
k=k-n; //Update k value for second half.
m=k; // To use ith row k value in i-1th row
for (i=n;i>=1;i--) //Prints second half
{
for (j=1;j<i;j++) {
printf("%d*",k++); }
printf("%d",k++); //Prints the last number without * ith Line
printf(" \n"); k=m-i+1; //Update k for the next row
m=k; // To use ith row k value in i-1th row
} return ;
}
4. Pattern 4:
return;
}
#include<stdio.h>
int main( ) { k=k-2;//update k value for next n-1
int rows; rows
scanf("%d",&rows); for(i=n-1;i>=1;i--) //Prints next n-1 rows
Pattern(rows); {
return 0; } for(j=1;j<i;j++) //prints numbers
void Pattern(int n) { with * in ith line
// Write Your code here {
int i, j, k=3; printf("%d*",k);
for(i=1;i<=n;i++) }
{ //Prints first half of the pattern printf("%d",k);//prints last number in
for(j=1;j<i;j++)//Prints numbers with * ith line
in ith line printf(" \n");
{ k--; //k value for the next row
printf("%d*",k); }
} return ;
printf("%d",k); //Prints last number in }
9. Trapezium Pattern:
Print trapezium pattern: #include<stdio.h>
If N=4 the code should print the int main( )
following pattern. {
1*2*3*4*17*18*19*20 int rows;
- -5*6*7*14*15*16 scanf(“%d”,&rows);
- - - -8*9*12*13 TrapeziumPattern(rows);
- - - - --10*11 return 0;
Again if N=5 the code should print }
1*2*3*4*5*26*27*28*29*30 void TrapeziumPattern (int n)
--6*7*8*9*22*23*24*25 {
----10*11*12*19*20*21 // Write Your code here
------13*14*17*18 return;
--------15*16 }
For N=2 the pattern will be
1*2*5*6
--3*4
#include<stdio.h>
int main( ) {
int rows;
scanf(“%d”,&rows);
TrapeziumPattern(rows);
return 0; }
void TrapeziumPattern (int n)
{
// Write Your code here
int i, j, k, s;
int a = 1; //To get first half numbers in a row
int b = n*n + 1; //To get next half numbers in a row
for (i = n; i >= 1; i--) //To print n rows
{
for (s = 1; s <= n - i; s++) //To print spaces.first row zero,next one and so on
printf("--");
for (j = 1; j <= i; j++) // To print first n numbers with *
printf("%d*", a++);
for (k = 1; k < i; k++) //To print next n-1 numbers with *
printf("%d*", b++);
10. Pattern 7 :
Program the following pattern. #include<stdio.h>
int main( )
{
1
int row;
232
scanf("%d",&row);
34543
Pattern(row);
4567654
return 0;
567898765
}
void Pattern(int n)
{
// Write Your code here
return;
}
#include<stdio.h>
int main( ) {
int row;
scanf("%d",&row);
Pattern(row);
return 0; }
void Pattern(int n) {
// Write Your code here
int i, row, num = 1, space;
for(row = 1 ; row <= n ; row++ )
{
num = row;
for(space =1;space<=n-row;space++ )
printf(" ");
for (i=1; i <= row ; i++ )
{
printf("%d", num);
num++;
}
num=num-2;
for(i= 1 ; i < row ; i++) {
printf("%d",num);
num--; }
printf("\n"); }
return; }
int main()
{
int gcd,a,b;
scanf("%d%d",&a,&b);
printf("%d",calculateGCD(a,b));
return 0;
}
// SOME LIBRARY FUNCTIONALITY MAY BE RESTRICTED
// DEFINE ANY FUNCTION NEEDED
// FUNCTION SIGNATURE BEGINS, THIS FUNCTION IS REQUIRED
int calculateGCD(int a, int b)
{
// WRITE YOUR CODE HERE
if(a==0)
return b;
else
return calculateGCD(b%a,a);
}
// FUNCTION SIGNATURE ENDS
}
int* AlternateArrSort(int* arr,int len)
{
// Write Your code here
int *arr_new=(int *)malloc(len*sizeof(int));
int i, k, l;
k=0; //comes from front
l=len-1; //comes from last
for(i=0;i<len;i++)
{
if(i%2==0) //filling even positions
arr_new[i]=arr[l--];
else //filling odd positions
arr_new[i]=arr[k++];
}
return arr_new;
} // FUNCTION SIGNATURE ENDS"
#include<stdio.h>
int finddigitoccurrence(int, int[], int);
int main() {
int num1,num2[10],n,occ,i;
scanf("%d",&num1);
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&num2[i]);
occ=finddigitoccurrence(num1,num2,n);
printf("%d",occ);
return 0; }
int finddigitoccurrence(int num1, int num2[ ],int n)
{
// WRITE YOUR CODE HERE
int count=0,i;
for(i=0;i<n;i++)
{
if(num2[i]==num1)
count++;
}
return count;
}// FUNCTION SIGNATURE ENDS
} // FUNCTION SIGNATURE ENDS
#include<stdio.h>
int finddigitoccurrence(int, int);
int main( ) {
int num1,num2,occ;
scanf("%d",&num1);
scanf("%d",&num2);
occ=finddigitoccurrence(num1,num2);
printf("%d",occ);
return 0; }
int finddigitoccurrence(int num1, int num2)
{ // WRITE YOUR CODE HERE
int count=0,rem;
if(num2==0)
{
if(num1==num2)
count++;
}
while(num2>0)
{
rem=num2%10;
if(rem==num1)
count++;
num2=num2/10;
}
return count;
}// FUNCTION SIGNATURE ENDS