![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM
文章平均质量分 78
lvchengfei
这个作者很懒,什么都没留下…
展开
-
1237简单计算器
#include#include#define SIZE 300template class type >class Stack{ private : long capicity ; long top ; type arr[SIZE] ;public : Stack(); ~Stack(); void push( type ) ; type p原创 2008-03-17 13:12:00 · 193 阅读 · 0 评论 -
1205_Martian Addition
#include#include //gets() , 按回车可以什么也不输入, scanf("%s") ,不可以,要过滤回车* //字符比较 如:num[ 1 ][ k ] - 0 ‘0’千万别多加空格 *char num[2][120] ;long result [120] ;long n0 , n1 , k ,len ;char table [ 30] ={"0123456789ab原创 2008-03-20 10:26:00 · 363 阅读 · 0 评论 -
1201_Inversion
Let { A1,A2,...,An } be a permutation of the set{ 1,2,..., n}. If i Aj then the pair (Ai,Aj) is called an "inversion" of the permutation. For example, the permutation {3, 1, 4, 2} has three inversion原创 2008-03-19 18:38:00 · 233 阅读 · 0 评论 -
1237简单计算器
#includestdio.h>#include string.h>#define SIZE 300 template class type >class Stack...{private : long top ; long capicity ; type arr[ SIZE ] ;public : Stack(); ~Stack(); void push( type a ) ; typ原创 2008-03-17 10:38:00 · 211 阅读 · 0 评论 -
1229_Integer Inquiry
#include#includechar num[150][150] ;long number[150][150] ,result[150];long n , count ;void getnum( long i ){ long len , j ; len =strlen( num[ i ] ) -1; for( j = 149 ; len>= 0 ; len-- ,j--) nu原创 2008-03-20 14:58:00 · 190 阅读 · 0 评论