Hi, i have a project that the teacher want a pyramid of
numbers in C# or java...when we click a button...the
pyramid should be generated in a listbox/or JtextArea...and
the pyramid should have the folowing form:
1
232
34543
4567654
567898765
67890109876
7890123210987
890123454321098
90123456765432109
0123456789876543210
Plz help with codes...didn't find anything on the net.
No Answer is Posted For this Question
Be the First to Post Answer
what will be the position of the file marker? a: fseek(ptr,0,SEEK_SET); b: fseek(ptr,0,SEEK_CUR);
All the combinations of prime numbers whose sum gives 32
void main() { int x,y=2,z; z=(z*=2)+(x=y=z); printf("%d",z); }
Printf can be implemented by using __________ list.
#include<stdio.h> void fun(int); int main() { int a; a=3; fun(a); printf("\n"); return 0; } void fun(int i) { if(n>0) { fun(--n); printf("%d",n); fun(--n); } } the answer is 0 1 2 0..someone explain how the code is executed..?
#include<stdio.h> int main() { int a=3,post,pre; post= a++ * a++ * a++; a=3; pre= ++a * ++a * ++a; printf("post=%d pre=%d",post,pre); return 0; }
find simple interest & compund interest
Link list in reverse order.
main() { int a[10]; printf("%d",*a+1-*a+3); }
void main() { int *mptr, *cptr; mptr = (int*)malloc(sizeof(int)); printf(ā%dā,*mptr); int *cptr = (int*)calloc(sizeof(int),1); printf(ā%dā,*cptr); }
C program to print magic square of order n where n > 3 and n is odd
int i,j; for(i=0;i<=10;i++) { j+=5; assert(i<5); }