https://blog.youkuaiyun.com/ooposzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/oopos/article/details/1835552https://blog.youkuaiyun.com/oopos/article/details/1835552ooposSun, 21 Oct 2007 11:49:00 +0800#define MAX 101int main(void)...{    char a[MAX],b[MAX];    int la=0,lb=0,i,j,k ;    char c  ;         while ( (c =getchar())!=  )    a]]>https://blog.youkuaiyun.com/oopos/article/details/1835276https://blog.youkuaiyun.com/oopos/article/details/1835276ooposSun, 21 Oct 2007 09:27:00 +0800https://blog.youkuaiyun.com/oopos/article/details/1834753https://blog.youkuaiyun.com/oopos/article/details/1834753ooposSat, 20 Oct 2007 20:17:00 +0800int main(void)...{int N,i,total =0 ;scanf("%d %d",&N,&i) ;for(; n ; )...{n /= i ;total += n ;}printf("%d ",total) ;return 0 ;}应用：PS：当i=5 时，就可以用来求：N!的末尾连]]>https://blog.youkuaiyun.com/oopos/article/details/1834673https://blog.youkuaiyun.com/oopos/article/details/1834673ooposSat, 20 Oct 2007 18:50:00 +0800#include cstring>#include iomanip> #include cmath> using namespace std; class Factorial {    static const int MAXN = 5001;                          // 最大阶乘数，实际用不到这么]]>https://blog.youkuaiyun.com/oopos/article/details/1834620https://blog.youkuaiyun.com/oopos/article/details/1834620ooposSat, 20 Oct 2007 18:19:00 +0800]]>https://blog.youkuaiyun.com/oopos/article/details/1834370https://blog.youkuaiyun.com/oopos/article/details/1834370ooposSat, 20 Oct 2007 15:45:00 +0800https://blog.youkuaiyun.com/oopos/article/details/1834204https://blog.youkuaiyun.com/oopos/article/details/1834204ooposSat, 20 Oct 2007 13:08:00 +0800https://blog.youkuaiyun.com/oopos/article/details/1834156https://blog.youkuaiyun.com/oopos/article/details/1834156ooposSat, 20 Oct 2007 12:16:00 +0800https://blog.youkuaiyun.com/oopos/article/details/1833866https://blog.youkuaiyun.com/oopos/article/details/1833866ooposSat, 20 Oct 2007 08:57:00 +0800https://blog.youkuaiyun.com/oopos/article/details/1833864https://blog.youkuaiyun.com/oopos/article/details/1833864ooposSat, 20 Oct 2007 08:54:00 +0800https://blog.youkuaiyun.com/oopos/article/details/1833861https://blog.youkuaiyun.com/oopos/article/details/1833861ooposSat, 20 Oct 2007 08:48:00 +0800https://blog.youkuaiyun.com/oopos/article/details/1833847https://blog.youkuaiyun.com/oopos/article/details/1833847ooposSat, 20 Oct 2007 08:36:00 +0800https://blog.youkuaiyun.com/oopos/article/details/1833050https://blog.youkuaiyun.com/oopos/article/details/1833050ooposFri, 19 Oct 2007 16:24:00 +0800https://blog.youkuaiyun.com/oopos/article/details/1833003https://blog.youkuaiyun.com/oopos/article/details/1833003ooposFri, 19 Oct 2007 16:10:00 +0800https://blog.youkuaiyun.com/oopos/article/details/1832978https://blog.youkuaiyun.com/oopos/article/details/1832978ooposFri, 19 Oct 2007 16:01:00 +0800https://blog.youkuaiyun.com/oopos/article/details/1832970https://blog.youkuaiyun.com/oopos/article/details/1832970ooposFri, 19 Oct 2007 15:58:00 +0800#include stdlib.h>#define MAX 101    int main(void){    int i,j,k,n,max=0,sum=0;    int sj=0 , sk = 0,st=0 ;    int a[MAX]]>https://blog.youkuaiyun.com/oopos/article/details/1832897https://blog.youkuaiyun.com/oopos/article/details/1832897ooposFri, 19 Oct 2007 15:10:00 +0800https://blog.youkuaiyun.com/oopos/article/details/1832683https://blog.youkuaiyun.com/oopos/article/details/1832683ooposFri, 19 Oct 2007 13:43:00 +0800https://blog.youkuaiyun.com/oopos/article/details/1832067https://blog.youkuaiyun.com/oopos/article/details/1832067ooposFri, 19 Oct 2007 07:45:00 +0800#include math.h>#define MAX 101int total = 0;char m[MAX][MAX]; int is_ok(int s,int i,int *a)...{    int j ;    for(j=1 ; j s ; j++)    if( (abs(i-a[j]) == abs(s-j)) || (]]>https://blog.youkuaiyun.com/oopos/article/details/1832065https://blog.youkuaiyun.com/oopos/article/details/1832065ooposFri, 19 Oct 2007 07:42:00 +0800