C++做的幂指数分析和总结.docxVIP

#include stdafx.h #include math.h #include iostream using namespace std; typedef struct HM { int num,number; HM *r,*l; } hm; int tans(char); void inselt(int,hm *); void ouselt(hm*,int); hm* creathm(int); int main () { int count,a[7],b; int m=0; hm *s; hm *gen=new hm; gen-num =0; gen-r =0; gen-l =0; gen-number=0; char c[50]; cincount; for (int i=0;icount;i++) { cinc; int aa=0; for(int j=0;c[j]!=NULL;j++) { if(tans(c[j])!=10) { a[aa]=tans(c[j]); aa++; } } b=0; for(int k=0;k7;k++) { int df=pow(10.0,(6-k)); b=b+a[k]*df; } if (gen-number ==0) { } else { } } gen-number =b; gen-num ++; s=gen; inselt(b,s); hm* g=gen; ouselt(g,m); if (m==0) coutNo duplicates.endl; return 0; } int tans(char d) { if(d-0=0 d-9=0) return d-0; switch(d) { case A: case B: case C: return 2; break; case D: case E: case F: return 3; break; case G: case H: case I: return 4; break; case J: case K: case L: return 5; break; case M: case N: case O: return 6; break; case P: case R: case S: return 7; break; case T: case U: case V: return 8; break; case W: case X: case Y: return 9; break; default : return 10; } } hm* creathm(int a) { hm *b=new hm; b-number=a; b-l =0; b-r =0; b-num =1; return b; } void inselt(int t,hm *s) { while(s!=0) { if( t s-number) { if(s-l==0) { s-l=creathm(t); s=0; } else }  s=s-l; else if ( t s-number) { if(s-r==0) { } else {  } else s-r=creathm(t); s=0; s=s-r; s-num++; s=0; } } } void ouselt(hm *s,int m) { if(s!=0) { ouselt(s-l,m); if(s-num 1) { m++; char rf[10]; _itoa( s-number, rf, 10); char sh[10]; for (int ii=0;ii3;ii++) sh[ii]=rf[ii]; for (int jj=3;jj8;jj++) sh[jj+1]=rf[jj]; sh[3]=-; coutsh s-num endl; } ouselt(s-r,m); } } #include #includestdio.h #includemalloc.h typedefstruct { int * number; int count; int max; }PhoneBook; voidHeapSort(int *a, int length) { int i, p, k, k1, k2, tmp; for (i = 1; i length; i++) { p = i; k = (i - 1) 1; while (k = 0) { if (a[k] a[p]) { tmp = a[k]; a[k] = a[p]; a[p] = tmp; } p = k; k = (p - 1) 1; } } for (i = length - 1; i 0; i--) { tmp =