常用C++模板.docxVIP

判断质数：2汉诺塔（双单）：2闰年：3判断字符串长度：3最大公约数：3判断幂指数：4判断质数：bool isPrime(int n){ int i; int j=sqrt(n); if(n==1) return false; else if(n==2||n==3) return true; else{ for(i=2; i=j; i++) if(n%i == 0) return false; return true ; }}汉诺塔（双单）：void hanoi(int numofpairs, char pillarA, char pillarB, char pillarC){ if (numofpairs == 1) { coutMove from pillarA to pillarCendl; coutMove from pillarA to pillarCendl; } else { hanoi(numofpairs - 1, pillarA, pillarC, pillarB); coutMove from pillarA to pillarCendl; coutMove from pillarA to pillarCendl; hanoi(numofpairs - 1, pillarB, pillarA, pillarC); }}void hanoi_double(int count, char pillarA, char pillarB, char pillarC){ for (int i = count/2; i 1; i--) { hanoi(i - 1, pillarA, pillarB, pillarC); coutMove from pillarA to pillarBendl; coutMove from pillarA to pillarBendl; hanoi(i - 1, pillarC, pillarB, pillarA); coutMove from pillarB to pillarCendl; } coutMove from pillarA to pillarBendl; coutMove from pillarA to pillarCendl;}闰年：int a[2][13]= {{0,31,28,31,30,31,30,31,31,30,31,30,31 },{0,31,29,31,30,31,30,31,31,30,31,30,31 }};int year,month,day,h,m,s; cinyearmonthdayhms; int leapyear=0; if((year%4==0year%100!=0)||year%400==0) leapyear=1; if(year=0month=1month=12daya[leapyear][0]day=a[leapyear][month]h=0h24h=0m=59s=0s=59) //判断时间合法？判断字符串长度：#includeiostream#includecstringusing namespace std;int main(){ char a[100]; cina; int k=strlen(a); coutThe Length Of The String a is kendl;} 最大公约数：int max_gys(int a,int b){ if ((a==0)||(b==0)) return 1; else if (ba) return max_gys(b,a); else if(a%b==0) return b; else return max_gys(b,a%b);}判断幂指数：int Sum(int n,int m)//计算幂指数（n/m+n/m/m+n/m/m/m......){ int ans=0; while(n0) { n=n/m; ans += n; } return ans;}分解公因数：#includeiostream#includecmathusing namespace std;bool