strange error in every programme

#include <iostream>
using namespace std ;
void main (void ){
cout<<"hello";
}


1>------ Build started: Project: da, Configuration: Debug Win32 ------
1>Build started 11/16/2011 6:42:09 PM.
1>InitializeBuildStatus:
1> Touching "Debug\da.unsuccessfulbuild".
1>ManifestResourceCompile:
1> All outputs are up-to-date.
1>LINK : error LNK2001: unresolved external symbol _mainCRTStartup
1>C:\Users\Mo3aZ\Desktop\Home work\da\Debug\da.exe : fatal error LNK1120: 1 unresolved externals
1>
1>Build FAILED.
1>
1>Time Elapsed 00:00:00.12
========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ==========
Your IDE thinks you're making a Win32 program using all its magic bells and whistles. Create a new project or whatever it's called in Visual Studio these days and pick the basic console program option.
Last edited on
I solve the problem but i face another error could u see whats wrong in the compiler

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
        #include <iostream>
        using namespace std;
				typedef int Error_code;
				#define success 0
		        #define overflow -1
		        #define underflow -2
			template <class T>
				class Node {
				    public: T data;
				    Node *next;
					Node(){data=0; next=NULL;}
					Node(T n){data=n; next=NULL;}
				};
				
			template <class T>
				class queue{
					protected: int count;
					Node *front;
					Node *rear;
					public: queue();
					~queue();
					Error_code serve();
					Error_code append(T data);
			        Error_code retrieve(T &data);
			        bool isfullqueue(){return false ;}
					bool isemptyqueue();
				};
			template <class T>
				queue <T>::queue(){
				count=0; front=rear=NULL;
			}
			template <class T>
			queue <T>::~queue(){
				Node *p;
				while(front != NULL){
					p=front;
					front=front->next;
					delete p;
					}
				}
			template <class T>
				Error_code queue <T> ::serve(){
				Error_code outcome=success;
				Node *p;
				if(isemptyqueue){
				cout<<"The Queue is empty"<<endl;
				outcome = underflow ;
				}
				else 
				{
					p=front ;
					front = front->next ;
					delete p;
					count--;
				}
				return outcome ;
				}

				template <class T>
					Error_code queue <T>:: append ( T data )
					{
						Node *n ;
						n = new Node ;
						n->data = data ;
						n->next = NULL ;
						if ( isemptyqueue ())
						{
							rear=front=n;
						}
						else 
						{
							rear->next=n;
							rear=n ;
						}
						count++ ;
						return success ;
					}
					template <class T>
					Error_code queue <T>::retrieve (T &data)
					{
						Error_code outcome = success ;
						if ( isemptyqueue())
						{
							cout<<"Empty Queue "<<endl;
							outcome = underflow ;
						}
						else 
						{
							data= front->data ;
						}
						return outcome ;
					}
					
					template <class T>
					bool queue <T>:: isemptyqueue ()
					{
					if ( front==NULL ) 
						return true ;
					else 
						return false ;
					}
				

					template <class T>
					class EQueue : public queue <T>
					{
					public :
						EQueue ();
						int queueSize();
						void clear ();
						Error_code ServeAndRetrieve (T &data );
					};

						template <class T>
						EQueue<T>::EQueue ()
						{
							cout<<" Extended Queue Default Constructor "<< endl;
						}
						template <class T>
						void EQueue <T>::clear()
						{
							Node *p;
							while (front!=NULL)
							{
								p=front;
								front = front->next ;
								delete p;
							}
							rear = NULL;
								count=0;
						}
							template <class T>
						int EQueue<T>::queueSize()
						{
						return count;
						}
							template <class T>
						Error_code EQueue<T>::ServeAndRetrieve (T &data)
						{
							Error_code outcome = success ;
							Node *p
								if ( isemptyqueue())
								{
									outcome=underflow ;
									cout << "empty queue "<<endl ;
								}
								else 
								{
									data = front ->data;
									p=front ;
									front = front->next ;
									delete p;
									count--;
								}
								return outcome ;
						}

						void main ()
						{
							int x ; 
							EQueue <int> IntQueue ;
							EQueue <double> DoubleQueue ;
							EQueue <char> CharQueue ;
							cout<<"The Queue Is : "; 
							IntQueue.isemptyqueue()?cout<<" Empty /n " : cout<<" Not Empty /n";
						}
Topic archived. No new replies allowed.