Solve This (? + ? + ?=30)
If 1111=R, 2222=T, 3333=E, 4444=N Then 5555=?
Guess the Hindi Muhawara from the following whatsapp Emoticons?
Sweet, Medicine, Film, Girl, City, Car, Place, Doggy all are name same, guess which word it is?
A girl is blind, deaf, dumb and uneducated too. A boy loves her. How would he propose without touching her?
Four Question, One Answer: One River Name, One Flower Name, One Film Name, One Actress Name?
Guess me who am I, I am the first on earth, the second in heaven...
Which Indian cricketer is known as "Brown Bradman"?
David Broome was a successful competitor in what sport in the 1960s and 1970s?
From 1988 to 1991 The Traveling Wilburys were active as a group; who formed the group?
1 4 1 27 8 1 256 81 16 1 3125 1024 143 32 1
#include<stdio.h> main() { int i,j,k,res=1; for(i=1;i<=5;i++) { for(j=i;j>=1;j--) { for(k=1;k<=j;k++) { res = res*j; } printf("%d ",res); res=1; } printf("\n"); } }
Given an ODD number, print diamond pattern of stars recursively.
Example Input: n = 5,
Output:
* *** ***** *** *
How will we print numbers from 1 to N without using loop or recursion?
What is the Best Pattern or Topology for avoid Memory Leaks in Projects