i need some help in my calculator again

[Shady Attack]

finally i can solve how to change infix to postfix ......... but one more problem is i ,my cal can run but cant give me right result :( ....... i need some help again

#include <stdio.h>
#include <tchar.h>
#include <conio.h>
#include <time.h>
#include <Windows.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define PI 3.14
struct STACK
{
	int *array;
	int Max;	
	int Top;
};

bool InitStack(STACK &s,int MaxNumItem)
{
	s.Max=MaxNumItem;
	s.array=new int[s.Max];
		if(s.array==NULL) return false;
			s.Top=-1;
			return true;
}
bool IsStackEmpty(const STACK &s)
{
	if(s.Top<0) return true;
	else return false;
}
bool IsStackFULL(const STACK &s)
{
	if(s.Top==s.Max-1) return true;
	else return false;
}
void printStack(const STACK &s)
{
	if(IsStackEmpty(s)==true)
		{
			printf("Stack is empty! No data to show!\n");
			return;
		}
	for(int i=0;i<=s.Top;i++)
		{
			printf("%5d ",s.array[i]);
		}
	printf("\n");
}
int Pushstack2(STACK &s,int InItem)
{
	if(IsStackFULL(s)==true) return false;
		s.array[++s.Top]=InItem;
		return true;
}
int Popstack2(STACK &s)
{
	int OutItem;
	if(IsStackEmpty(s)==true) return -1;
	else
		{
			OutItem=s.array[s.Top--];
			return OutItem;
		}
}
//bool Pushstack(STACK &s,char InItem)
//{
//	if(IsStackFULL(s)==true) return false;
//	s.array[++s.Top]=InItem;
//	return true;
//}
//bool Popstack(STACK &s,char &OutItem)
//{
//	if(IsStackEmpty(s)==true) return false;
//	else
//	{
//	 OutItem=s.array[s.Top--];
//	 return true;
//	}
//}
int IsGreaterOrEqual(char c)
{
	switch(c)
		{
			case 'c': return 3;
			case 's': return 3;
			case '*': return 2;
			case '/': return 2;
			case '+': return 1;
			case '-': return 1;
			case '(': return 0;
		}
}
void infixtopostfix(char* p1,char* p2,int &p)
{
	STACK s;
	InitStack(s,100);
	char temp,c;
	int e=0;
	for(int i=0;i<=strlen(p1);i++)
	{
		c=p1[i];
		switch(c)
			{
				case '(': {Pushstack2(s,c); break;}
				case 'c': goto sosanh;
				case 's': goto sosanh;
				case '+': goto sosanh;
				case '-': goto sosanh;
				case '/': goto sosanh;
				case '*': goto sosanh;
				case ')': 
				{	while(s.array[s.Top]!='('&&IsStackEmpty(s)==false)
					{
						temp=char(Popstack2(s));
						p2[e++]=temp;
					}
				if(s.array[s.Top]=='(') 
					{
						temp=char(Popstack2(s)); 
						break;
					}
				}
			default: 
				{
					if(c>=48&&c<=57&&c!='c'&&c!='s')
						{
							p2[e++]=c; break;
						}
					break;
				}
			sosanh:
				{
					if(IsStackEmpty(s)==true) {Pushstack2(s,c); break;}
					else
						{
							temp=char(Popstack2(s));
							if(IsGreaterOrEqual(temp)>=IsGreaterOrEqual(c)) {p2[e++]=temp; Pushstack2(s,c); break;}
							else {Pushstack2(s,temp); Pushstack2(s,c);break;}
						}
				}
			}
	/*printf("Show stack: ");
	for(int i=0;i<=s.Top;i++)
	{
	printf("%c",s.array[i]);
	}
	printf("\n");*/
}
while(IsStackEmpty(s)==false)
{
	temp=char(Popstack2(s));
	p2[e++]=temp;
}
p=e;
//printf("Convert done!\n");
//printf("Output: ");
for(int j=0;j<e;j++)
{
	printf("%c",p2[j]);
}
//printf("\nCalculating...\n");
}
void cal(char* p2,int p)
{
	STACK s;
	InitStack(s,100);
	char c;
	int kq,temp1,temp2,flag=1;
	float goc1,goc2;
	for(int i=0;i<p;i++)
		{
			c=p2[i];
			switch (c)
				{
					case '+':
					{
						temp1=Popstack2(s);
						temp2=Popstack2(s);
						kq=temp1+temp2;
						Pushstack2(s,kq);
						break;
					}
					case '-':
					{
						temp1=Popstack2(s);
						temp2=Popstack2(s);
						kq=temp2-temp1;
						Pushstack2(s,kq);
						break;
					}
					case '*':
					{
						temp1=Popstack2(s);
						temp2=Popstack2(s);
						kq=temp1*temp2;
						Pushstack2(s,kq);
						break;
					}	
					case '/':
					{
						temp1=Popstack2(s);
						temp2=Popstack2(s);
						if(temp1==0) {flag=0; goto Result;}
						else
						{
							kq=temp2/temp1;
							Pushstack2(s,kq);
						}
						break;
					}
					case 's':
					{
						temp1=Popstack2(s);
						temp2=Popstack2(s);
						goc1=temp2*10+temp1;
						kq=sin(goc1*PI/180);
						Pushstack2(s,kq);
					}
					/*case 'c':
					{
					temp1=Popstack2(s);
					temp2=Popstack2(s);
					goc2=temp2*10+temp1;
					kq=cos(goc2*PI/180);
					Pushstack2(s,kq);
					}*/
					default:
					{
						if(c>=48&&c<=57&&c!='c'&&c!='s')
						{
							Pushstack2(s,atoi(&c));
							break;
						}
					}
				}
		}
		Result:
		{
			if(flag==0) printf("Math error!\n (Can't devide by zero)\n");
			else
				{
					kq=Popstack2(s);
					printf("ket qua la: %d\n",kq);
				}
		}
}
void main()
{
	int loop;
	do
		{
			char p1[100];
			char p2[100];
			int number,p;
			printf("nhap chuoi: ");
			fflush(stdin);
			gets_s(p1,100);
			fflush(stdin);
			//printf("Input: ")
			puts(p1);
			//printf("Converting...\n");
			infixtopostfix(p1,p2,p);
			cal(p2,p);
			printf("ban hay thu lai? \n nhap so: ");
			scanf_s("%d",&loop);
		}
	while(loop==1);
}

[Mats]

Yikes when programs get this big and you want help, it's amazingly helpful to have comments on your code.

Also, the .h versions of many headers are outdated. You should replace your includes with the up to date versions. I think PI should not be #defined but declared as a const double and you should remove your goto statements and replace them with something more sensible. For instance, each operation could be its own function and when an operation is selected, it could call up the correct function. This would make your program much more readable.

Some other problems here too:

-void main() must be changed to int main(). Which compiler are you using for this? It seems to be out of date.
-You are not using some of those headers, so why include them in your code? It's inflating your program unnecessarily.

Anyway, if you can comment your code and/or narrow down your error to something more than 'can't give me right result' then I will help you fix your problem.

[Shady Attack]

thanks u to mention to my post but right now i dont need to make it work 100% :D i must convert it into class ,cus this is my Object-oriented programming project ......... can u help me to convert it