新手自定義函數模板

2019-11-08 02:20:35

字體：大中小

來源：轉載

供稿：網友

/*File name://自定義函數Author://ByVersion://999.999.999Date://2018.13.32Description://求自定義函數*///Code By 1677#include<iostream>#include<iomanip>#include<cmath>#include<cstdio>#include<cstring>#include<cstdlib>#include<string>#include<ctime>#include<algorithm>#include<vector>#include<bitset>#include<cctype>#include<cerrno>#include<clocale>#include<complex>#include<deque>#include<exception>#include<fstream>#include<functional>#include<limits>#include<list>#include<map>#include<ios>#include<iosfwd>#include<istream>#include<ostream>#include<queue>#include<set>#include<sstream>#include<stack>#include<stdexcept>#include<streambuf>#include<utility>#include<vector>#include<cwchar>#include<cwctype>using namespace std;int cintol(char *ff); //char數組長度 int iintol(int *fff); //int數組長度 int intgys(int aa,int bb); //最大公約數 int intws(int aa); //位數int intpow(int aa,int bb); //int簡單版a的b次方 int intswfz(int aa); //數位反轉 void iintoijia(int *tt,int *ttt,int lll); //int數組tt的前lll位加到int數組ttt的前lll位 void cintoiput(char *yy,int ll); //char輸出前ll位的ASCLL void iintoput(int *eee,int ll); //int輸出前ll位void cintodput(char *eeee,int ll); //char逆序輸出前ll位void cintoput(char *ee,int ll); //char輸出前ll位 void iintoiw(int *ddd,int ww); //int的ww進制 void cintocw(char *dd,int ww); //char的ww進制 void iintoilo(int *ccc); //int的10進制 void cintoclo(char *cc); //char的10進制 void iintoio(int *bbb); //int初始化0 void cintoco(char *bb); //char初始化0 void cintocchar(char *zz,int ll); //數值到ASCLL void cintocint(char *aa,int ll); //ASCLL到數值 int swfz(int aa); //數位反轉 double doupow(double aa,int bb); //double版a的b次方 int main(){while(1){}return 0;}void cintocint(char *aa,int ll) //ASCLL到數值 {for(int i=0;i<ll;i++){if(aa[i]>64&&aa[i]<91){aa[i]-=7;}aa[i]-=48;}}void cintocchar(char *zz,int ll) //數值到ASCLL {for(int i=0;i<ll;i++){if(zz[i]>9&&zz[i]<36){zz[i]+=7;}zz[i]+=48;}}void cintoco(char *bb) //char初始化0 {for(int i=0;i<9999;i++){bb[i]=0;}}void iintoio(int *bbb) //int初始化0 {for(int i=0;i<9999;i++){bbb[i]=0;}}void cintoclo(char *cc) //char的10進制 {for(int i=0;i<9998;i++){cc[i+1]=cc[i+1]+cc[i]/10;cc[i]%=10;}}void iintoilo(int *ccc) //int的10進制 {for(int i=0;i<9998;i++){ccc[i+1]=ccc[i+1]+ccc[i]/10;ccc[i]%=10;}}void cintocw(char *dd,int ww) //char的ww進制 {for(int i=0;i<9998;i++){dd[i+1]=dd[i+1]+dd[i]/ww;dd[i]%=ww;}}void iintoiw(int *ddd,int ww) //int的ww進制 {for(int i=0;i<9998;i++){ddd[i+1]=ddd[i+1]+ddd[i]/ww;ddd[i]%=ww;}}void cintoput(char *ee,int ll) //char輸出前ll位 {for(int i=0;i<ll;i++){PRintf("%c",ee[i]);}}void cintodput(char *eeee,int ll) //char逆序輸出前ll位{for(int i=ll-1;i>=0;i--){printf("%c",eeee[i]);}}void iintoput(int *eee,int ll) //int輸出前ll位{for(int i=0;i<ll;i++){printf("%d",eee[i]);}}void cintoiput(char *yy,int ll) //char輸出前ll位的ASCLL {for(int i=0;i<ll;i++){printf("%d",yy[i]);}}void iintoijia(int *tt,int *ttt,int lll) //int數組tt的前lll位加到int數組ttt的前lll位 {for(int i=0;i<lll;i++){tt[i]+=ttt[i];}}int cintol(char *ff) //char數組長度 {int ll=0;for(int i=0;i<9999;i++){if(ff[i]!=0){ll=i+1;}}return ll;}int iintol(int *fff) //int數組長度 {int ll=0;for(int i=0;i<9999;i++){if(fff[i]!=0){ll=i+1;}}return ll;}int intgys(int aa,int bb) //最大公約數 {int tt;if(bb>aa){tt=bb;bb=aa;aa=tt;}while(tt>0){tt=aa%bb;aa=bb;bb=tt;}return aa;}int intws(int aa) //位數{int ii=0;while(aa>0){ii++;aa/=10;}return ii;}int intpow(int aa,int bb) //int簡單版a的b次方 {int ss=1;for(int i=0;i<bb;i++){ss*=aa;}return ss;}int intswfz(int aa) //數位反轉(需intws(位數)){int tt=intws(aa),ss=0;for(int i=0;i<tt;i++){ss=ss*10+aa%10;aa/=10;}return ss;}double doupow(double aa,int bb) //double版a的b次方 {double ss=1.0;for(int i=0;i<bb;i++){ss*=aa*1.0;}return ss;}//IOI>>qinghua

上一篇：Hrbust 1600 線性代數中的矩陣問題【區間dp】

下一篇：nyoj325 zb的生日（dfs）