bisan kulang imo answer show your solution oi...Originally Posted by xyberblue
bisan kulang imo answer show your solution oi...Originally Posted by xyberblue
Actually mao nay ingon sa author..... Wala ko solutions....
HUBAG!
Code:#include <stdio.h> #include <conio.h> void recursive(int x,int y) { static int i=y--,a=0; switch(++a){ case 1: printf("%c",(int)0x55); break; // first non recursive pass: decimal(85) output: "U" case 2: printf("%c",(int)0x42); break; //recursive first pass: decimal(66) output: "B" case 3: printf("%c",(int)0x41); break; //recursive second pass: decimal(65) output: "A" } if(x!=y) // while x not equal to y callself, recursive(i--,y); } void main() { unsigned long x=0x48; // x = 48(hex) decimal(72) int y=x<<=1; // x = 1001000(Binary) binaryshift x = 10010000 which is = 144(decimal) //x = 144 y = 144 printf("%c",(y+x)-(int)0xd8); // ((144+144 = 288) - (int)216) = [72] output: "H" recursive(x,y); printf("%c!",(int)0x47);//decimal(71) output: "G!" //final output: HUBAG! }
OT: oh noo.. ni gamay akong post!!!!!!!!!!111111oneoneone (auto trim?) *starts spamming*
Great JOB!
nice job silent killer
you did great!
Hoy... show your solutions..... Wla may solutions....... gisuwayan na diay nig pa run....
Hi, whoever posted this program you give us fun, thanks but please make sure you specify in what way to solve next time. We al know programs are already solutions to problems. If it's output tracing then we could have just run the program and tell you how it works. It's better if it's debugging or making the program from scratch.
Just a thought baby!
lingawa...hahaha
Similar Threads |
|