摘要:
为了加强记忆我又写了一遍二叉树的基本代码。比上一次多了一点点功能。 小白在成长 阅读全文
摘要:
#include #include using namespace std; struct BitreeNode{ int value; BitreeNode *left,*right; }; BitreeNode creat(BitreeNode *&t) { int ch; scanf("%d",&ch); if(ch==0) //以0为结束判断 ... 阅读全文
摘要:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35940 Accepted Submission(s): 13552 Problem Descr 阅读全文
摘要:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 60452 Accepted Submission(s): 28262 Problem Descr 阅读全文
摘要:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 45655 Accepted Submission(s): 20188 Problem Descr 阅读全文
摘要:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51959 Accepted Submission(s): 19706 Problem Descr 阅读全文
摘要:
Problem Description In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission o 阅读全文
摘要:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28661 Accepted Submission(s): 11402 Problem Descr 阅读全文
摘要:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 77880 Accepted Submission(s): 24325 Problem Descr 阅读全文
摘要:
A simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively 阅读全文