Interested to Buy Any Domain ? << Click Here >> for more details...
progrem to generate the following series
1
12
123
1234
12345
- 6 Answers
- 43960 Views
- HCL, Wipro, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
int main()
{
int i,j;
for(i=1;i<=5;i++)
{
for(j=1;j<=i;j++)
{
printf("%d\t",j);
}
printf("\n");
}
return 0;
}
| Is This Answer Correct ? | 115 Yes | 27 No |
Answer / shakil ahmed
#include<stdio.h>
#include<conio.h>
main()
{
int i, j;
for(i=1; i<=5; i++)
{
for(j=1; j<=i; j++)
{
printf("%d",j);
}
printf("\n");
}
}
| Is This Answer Correct ? | 65 Yes | 16 No |
Answer / mustafiz
#include<stdio.h>
int main()
{
int row,i;
printf("Enter row number:\n");
scanf("%d",&row);
int sum=0;
for(i=1;i<=row;i++)
{
sum = sum *10 +i;
printf("%d\n",sum);
}
return 0;
}
| Is This Answer Correct ? | 25 Yes | 12 No |
Answer / f.hnayan
#include<stdio.h>
#include<conio.h>
main()
{
int a,b;
for(a=0;a<=4;a++)
{
for(b=1;b<=(a+1);b++)
{
printf("%d\t",b);
}
printf("\n");
}
return 0;
}
| Is This Answer Correct ? | 11 Yes | 5 No |
Answer / banavathvishnu
main()
{
int a;
int temp =0;
for(i=1;i<=5;i++)
{
temp = temp *10 +i;
printf("%d",temp);
}
| Is This Answer Correct ? | 23 Yes | 19 No |
Answer / sachin
#include<stdio.h>
#include<conio.h>
void main()
{
int i,j,row;
clrscr();
printf("
How many rows
");
scanf("%d",&row);
for(i=1;i<=row;i++)
{
for(j=1;j<=i;j++)
{
printf("%d",j);
}
printf("
");
}
getch();
}
| Is This Answer Correct ? | 3 Yes | 2 No |
In c programming, explain how do you insert quote characters (? And ?) Into the output screen?
Explain the use of function toupper() with and example code?
Explain the Difference between the New and Malloc keyword.
Is it fine to write void main () or main () in c?
Should I learn c before c++?
How we can set and clear bit in a byte using macro function?
how to find binary of number?
Is calloc better than malloc?
When do you say that a digraph is acyclic A)if and only if its first search does not have back arcs B)a digraph is acyclic if and only if its first search does not have back vertices C)if and only if its first search does not have same dfnumber D)None of these
What is merge sort in c?
main() { int ptr[] = {1,2,23,6,5,6}; printf("%d",&ptr[3]-&ptr[0]); }
#include<stdio.h> void main() { int a,b,c; a=b=c=1; c=++a || ++b && ++c; printf("%d\t%d\t%d",a,b,c); }
C 
