- Upvotes Received
- 0
- Posts with Upvotes
- 0
- Upvoting Members
- 0
- Downvotes Received
- 1
- Posts with Downvotes
- 1
- Downvoting Members
- 1
crazy
- Interests
- programming
- PC Specs
- depends
hi i want to convert the prefix form to postfix,prefix and infix form but when i input +5*62 it retuns only 2 what is wrong with my code can anybody help to solve this #include<stdio.h> #include<conio.h> #include<stdlib.h> #define Operator 1 #define notOperator 0 #define empty -1 struct node{ char item; … |
|
hi,whem i logged in the webpage canyouseeme.org it showed my ip address and it ask me to insert the port but i don't know how to find the port no .....need help guyz |
|
HI, how can i integrate these both code mentioned below so that the output displayed on the black edit box must be as:(2+2)/2+2*3=8 here is the code of BODMAS calculation: #include <stdio.h> int calc(char *exp_str){ FILE *fp; int ret; fp=fopen("calc_aux.c","w"); fprintf(fp, "int main(){ return %s; }", exp_str); fclose(fp); system("gcc calc_aux.c … |
|
**Bold Text Here* what is the code for performing mathematic calculation based on BODMAS rule in C*(such as 6+6/2=9) ,any suggestion ,plz?? |
|
Re:
Added just to help other.... [code=c] #include<stdio.h> #include<conio.h> #include<stdlib.h> #define Operator 1 #define notOperator 0 #define empty -1 void formatting(void); void getInput(void); int chkElement(char); void opFunc(char); void varFunc(char); void push(struct node*); struct node* pop(void); void dispTree(void); void infix(struct node*); void prefix(struct node*); void postfix(struct node*); char equation[25]; struct node* stack[25]; … |