摘要:
1 #include 2 using namespace std; 3 struct squeue 4 { 5 int data; 6 squeue *next; 7 }; 8 struct link 9 {10 squeue* front;11 squeue ... 阅读全文
摘要:
1 #include 2 #include 3 using namespace std; 4 #define size 10 5 struct squeue 6 { 7 int queue[size]; 8 int front,rear; 9 };10 void initqu... 阅读全文
摘要:
1 #include 2 using namespace std; 3 #define size 10 4 struct squeue 5 { 6 int queue[size]; 7 int front,rear; 8 int flag; 9 };10 void ini... 阅读全文
摘要:
1 #include 2 using namespace std; 3 #define queuesize 20 4 struct squeue 5 { 6 int queue[queuesize]; 7 int front,rear; 8 }; 9 void initsqueu... 阅读全文
摘要:
Counting TrianglesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2506Accepted Submission(s): 1184... 阅读全文