华东师范公开课拓展

1、Other algorithmsLiu DongyuOther algorithmsOther algorithms#includeusingnamespacestd;typedefunsignedlonglongUll;intmain()UllA,B,C,t;while(scanf(%llu%llu%llu,&A,&B,&C)t=1;if(A)for(register Ull i(0);iB;+i)t=t*A%C;printf(%llun,t);elsebreak;return0;Other algorithmsOther algorithms#includeusingnamespacest

2、d;typedefunsignedlonglongUll;intmain()UllA,B,C, ans,sum;while(scanf(%llu%llu%llu,&A,&B,&C)&A)ans=1;sum=A%C;for(;B;B=1,sum=sum*sum%C)if(B&1)ans=ans*sum%C;printf(%llun,ans);return0;Other algorithmsOther algorithmstypedefunsignedlonglongUll;Ull gcd(Ull a, Ull b) return b ? gcd(b, a % b) : a;Ull lcm(Ull

3、 a, Ull b) return a * b / gcd(a, b);Other algorithmstypedefunsignedlonglongUll;Ull gcd(Ull a, Ull b) return b ? gcd(b, a % b) : a;Ull lcm(Ull a, Ull b) return a * b / gcd(a, b);intmain()printf(%llun,lcm( uLL, uLL);return0;Other algorithmstypedefunsignedlonglongUll;Ull gcd(Ull a, Ull b) return b ? gc

4、d(b, a % b) : a;Ull lcm(Ull a, Ull b) return a / gcd(a, b) * b;intmain()printf(%llun,lcm( uLL, uLL);return0;Other algorithmsOther algorithmsFind the last crossover between the hypotenuse and Toms route.Other algorithmsFind the last crossover between the hypotenuse and Toms route.Other algorithmsOthe

5、r algorithms#includeusingnamespacestd;typedefunsignedlonglongUll;Ullans32;intmain()Ulla;scanf(%llu,&a);ans0=ans1=1;for(registerUlli(2);i=a;+i)for(registerUllj(0);ji;+j)ansi+=ansj*ansi-j-1;printf(%llun,ansa);return0;Other algorithmsAnother way?Other algorithmsAnother way?Compute the number of the way

6、s in a square area, then subtract it by the illegal number of the ways of the triangle area.Other algorithmsAnother way?Compute the number of the ways in a square area, then subtract it by the illegal number of the ways of the triangle area.Other algorithmsAnother way?Compute the number of the ways

7、in a square area, then subtract it by the illegal number of the ways of the triangle area.Other algorithmsAnother way?Compute the number of the ways in a square area, then subtract it by the illegal number of the ways of the triangle area.Other algorithmsAnother way?Compute the number of the ways in

8、 a square area, then subtract it by the illegal number of the ways of the triangle area.Other algorithmsOther algorithmsdefconb(n,k):ret=1foriinrange(k+1,n+1):ret*=iforiinrange(2,n-k+1):ret/=ireturnreta=int(input()print(conb(2*a,a)/(a+1)Other algorithms#includeusingnamespacestd;typedefunsignedlonglongUll;Ullconb(Ulln,Ullk)Ullret=1uLL;for(registerUlli(k + 1uLL);i=n;+i)ret*=i; for(registerUlli(2uLL);i=n-k;+i)ret/=i;returnret;intmain()Ulla;scanf(%llu,&a);printf(%llun,conb(a1uLL,a)/(a+1uLL);return0;Other algorithms#includeusingnamespacestd;typedefunsignedlonglongUll;Ullconb(Ulln,Ullk)U