/*******************************************************************************
*
* FileName : test_for_huge_int.cpp
* Comment : test code for huge int
* Version : 1.0
* author : haibindev.cnblogs.com
* Date : 2007-10-9 11:20
*
*******************************************************************************/
#include <iostream>
#include <ctime>
#include "huge_int.h"
int main()
{
std::cout<<"huge int test:\n-------------------------------\n";
Huge_int a;
Huge_int b;
std::cout<<"a: ";
std::cin>>a;
std::cout<<"b: ";
std::cin>>b;
clock_t tbegin = clock();
std::cout<<"*************************result*************************\n";
std::cout<<"a = "<<a<<"\n"<<" b = "<<b<<"\n";
std::cout<<"a-b = "<<a-b<<"\n";
std::cout<<"a+b = "<<a+b<<"\n";
std::cout<<"a*b = "<<a*b<<"\n";
std::cout<<"a/b = "<<a/b<<"\n";
std::cout<<"a%b = "<<a%b<<"\n";
std::cout<<"a.pow(3) = "<<a.pow(3)<<"\n";
a++;
std::cout<<"a++ = "<<a<<"\n";
a--;
std::cout<<"a-- = "<<a<<"\n";
std::cout<<"++b = "<<++b<<"\n";
std::cout<<"--b = "<<--b<<"\n";
clock_t tend = clock();
std::cout<<"\n==> take "<<static_cast<double>(tend-tbegin)/CLOCKS_PER_SEC
<<" seconds\n";
return 0;
}
20种数据结构和算法的C++实现
需积分: 16 148 浏览量
2017-11-17
09:13:03
上传
评论 2
收藏 45KB 7Z 举报
20种数据结构和算法的C++实现 （153个子文件） 
test_for_huge_int.cpp 1KB min_heap.cpp 1KB dlist_test.cpp 1KB slist_test.cpp 1KB test_for_string.cpp 1KB test_for_bin_queue.cpp 995B test_for_random_number.cpp 919B test_for_leftist_heap.cpp 901B test_for_splay_tree.cpp 813B test_for_RBtree.cpp 807B primality.cpp 700B quickselect.cpp 668B test_for_graph.cpp 655B queue_test.cpp 635B sorting.cpp 634B test_for_avl_tree.cpp 609B test_for_bstree.cpp 603B stack_test.cpp 570B Auto_ptr.cpp 466B test_for_binary_tree.cpp 422B test_for_reference_count.cpp 406B test_for_object_count.cpp 400B uncopyable.cpp 387B test_for_graph_list.cpp 383B test_for_heap.cpp 376B huge_int.vcxproj.filters 1KB RBtree.h 16KB huge_int.h 11KB splay_tree.h 7KB graph.h 6KB String.h 5KB bin_queue.h 4KB sorting.h 4KB avl_tree.h 4KB bstree.h 4KB dlist.h 4KB leftist_heap.h 3KB slist.h 3KB min_heap.h 3KB binary_tree.h 3KB reference_count.h 3KB primality.h 2KB heap.h 2KB Auto_ptr.h 2KB random_number.h 2KB object_count.h 1KB quickselect.h 1KB graph_list.h 1KB queue.h 920B stack.h 865B uncopyable.h 600B reference_count.sln 910B binomial_queue.sln 907B random_number.sln 904B object_count.sln 901B leftist_heap.sln 901B quickselect.sln 898B binary_tree.sln 898B graph_list.sln 895B uncopyable.sln 895B splay_tree.sln 895B primality.sln 892B huge_int.sln 889B min_heap.sln 889B Auto_ptr.sln 889B AVLtree.sln 886B sorting.sln 886B RBtree.sln 883B String.sln 883B bstree.sln 883B graph.sln 880B dlist.sln 880B queue.sln 880B slist.sln 880B stack.sln 880B heap.sln 877B min_heap.suo 44KB sorting.suo 16KB leftist_heap.suo 16KB splay_tree.suo 15KB binomial_queue.suo 15KB AVLtree.suo 15KB String.suo 14KB reference_count.suo 13KB object_count.suo 13KB quickselect.suo 13KB queue.suo 12KB bstree.suo 12KB RBtree.suo 12KB stack.suo 12KB dlist.suo 11KB primality.suo 11KB huge_int.suo 11KB graph_list.suo 11KB random_number.suo 11KB binary_tree.suo 11KB slist.suo 11KB graph.suo 10KB uncopyable.suo 10KB Auto_ptr.suo 10KB共 153 条
- 1
- 2
资源评论
