ham de qui
of 11
-
Upload
nguyen-anh-tai -
Category
Documents
-
view
213 -
download
0
Transcript of ham de qui
-
7/25/2019 ham de qui
1/11
Dem cac kit u trong chuoi
#include
#include
#include
main()
{
int i,k;
char s[100];
print(!nhap mot da" ki tu!);
gets (s);
k$0;
or(i$0;i
-
7/25/2019 ham de qui
2/11
oat inh(oat n)
{
i (n$$1)
return 1;
return inh(n*1) % 1-n;
Tnh S(n) = 1/2 + 1/4 + ... + 1/2n
oat inh(oat n){
i (n$$1)
return 0.;
return inh(n*1) % 1-(/+n);
Tnh S(n) = 1 + 1/3 + 1/5 + ... + 1/(2n+1)
oat inh(oat n)
{
i (n$$1)
return 1;
return inh(n*1) % 1-(/+n%1);
Tnh S(n) = 1/(12) + 1/(23) + 1/( n(n-1) )
oat inh(oat n)
{
i (n$$1)
return 0.;
return inh(n*1) % 1-(n+(n%1));
Tnh S(n) = 1/2 + 2/3 + 3/4 + ... + n/(n+1)
oat inh(oat n)
{
i (n$$1)
-
7/25/2019 ham de qui
3/11
return 0.;
return inh(n*1) % n-(n%1);
Tnh S(n) = 1/2 + 3/4 + 5/! + ... + (2n+1)/(2n+2)
oat inh(oat n)
{
i (n$$1)
return 0.;
return inh(n*1) % (/+n%1)-(/+n%/);
Tnh T(n) = 123.....n
oat inh(oat n)
{
i (n$$1)
return 1;
return inh(n*1)+n;
Tnh T("#n) = "^n
oat u"hua(oat , int n)
{
i(n $$ 0)
{
return 1;
i(n < 0)
{
return u"hua(,n%1) + 1-;
return u"hua(,n*1) + ;
-
7/25/2019 ham de qui
4/11
Tnh S(n) = 1 + 1.2 + 1.2.3 + .... + 1.2.3....n
long 2iaihua(int n)
{
i(n$$1)
{
return 1;
return 2iaihua(n*1)+n;
long ong(int n)
{
i(n $$ 1)
{
return 1;
return ong(n*1) % 2iaihua(n*1)+n;
Tnh S("#n) = " + "^2 + "^3 + ... + "^n
oat u"hua(oat , int n)
{ i(n $$ 0)
{
return 1;
return u"hua(,n*1)+;
oat ong(oat , int n)
{
i(n $$ 1)
-
7/25/2019 ham de qui
5/11
{
return ;
return ong(,n*1) % u"hua(,n*1)+;
Tnh S("#n) = "^2 + "^4 +.... + "^2n
dou3le 3ai45/(int , int n)
{
i (n$$1)
{
return po6(,/+n);
return 3ai45/(,n*1) % po6(,/+n);
Tnh S("#n) = " + "^3 + "^5 +....+ "^(2n+1)
{
i (n$$1){
return po6(,n);
return tinh(,n*1) % po6(,n%1);
Tnh S(n) = 1 + 1/(1+2) + 1/(1+2+3) + ... + 1/(1+2+3+...+n)
oat ong(oat n)
{
i(n $$ 1)
{
return (oat)1;
return ong(n*1) % n;
-
7/25/2019 ham de qui
6/11
oat ong7hia(oat n)
{
i(n $$ 1)
{
return (oat)1;
return ong7hia(n*1) % 1-(ong(n*1) % n);
Tnh S("#n) = " + ("^2)/2$ + ("^3)/3$ + ... + ("^n)/n$
oat u"hua(oat , oat n)
{
i(n $$ 1)
{
return ;
return u"hua(,n*1)+;
oat 2iaihua(oat n)
{
i(n $$ 1)
{
return (oat)1;
return 2iaihua(n*1)+n;
oat 7hia2(oat , oat n)
{ i(n $$ 1)
-
7/25/2019 ham de qui
7/11
{
return ;
return 7hia2(,n*1) % ((u"hua(,n*1)+) - (2iaihua(n*1)+n));
Tnh S("#n) = 1 + ("^2)/2$ + ("^4)/4$ + ... + ("^2n)/(2n)$
oat u"hua(oat , oat n){
i(n $$ 0)
{
return (oat)1;
return u"hua(,n*1) ++;
oat 2iaihua(oat n)
{
i(n $$ 0)
{
return (oat)1;
return 2iaihua(n*1)+n;
oat 7hia2(oat , oat n)
{
i(n $$ 0)
{
return (oat)1;
return 7hia2(,n*1) % ( (u"hua(,n*1)++) - ((2iaihua (/+n * 1) +/+n)));
-
7/25/2019 ham de qui
8/11
T%m u&c '& & &n nh&t c&a '& ngu*n uong n . , & n = 1 u&c & &n nh&t c&a 1 25
int 8oce9a(int n)
{
i(n ' / $$ 1)
{
return n;
return 8oce9a(n-/);
Tnh S(n) = '0rt(2 + '0rt (2 + ... '0rt ( 2 + '0rt(2) ) ) )
#include
oat :unction(oat n)
{
i(n $$ 1)
{
return srt(/);
return srt(/ % :unction(n*1));
Tnh S(n) = '0rt(n + '0rt (n-1 + '0rt(n-2 + ...'0rt(2 + '0rt (1) ) ) ) )
#include
long dou3le :unction(long dou3le n)
{
i(n $$ 1)
{
return 1;
return srt(n % :unction(n*1));
-
7/25/2019 ham de qui
9/11
Tnh S(n) = '0rt(1 + '0rt(2 + '0rt (3 + ...'0rt (n-1 + '0rt (n)))))
#include
oat :unction(oat i, oat n) --3t du i$1
{
i(n $$ i)
{
return srt(n);
return srt( i % :unction(i%1,n));
S(n) = 1/(1 + 1/(1 + 1/(1 + 1/(... 1 /(1/(1 + 1/(1 + 1 )))))))
long dou3le huong(int n)
{
i(n $$ 1)
{
return 1.0 - (1.0 % 1.0);
return 1 - (1 % huong(n*1));
tnh t&ng cc ch& '& c&a '& ngu*n uong n
int ong7hu&o(int n)
{
i(n $$ 0)
{
return 0;
return ong7hu&o(n-10) % n ' 10;
tnh tch cc ch& '& c&a '& ngu*n uong n
int ich(int n)
-
7/25/2019 ham de qui
10/11
{ i(n $$ 0)
{
return 1;
return ich(n-10) + (n'10);
&m '& u&ng ch& '& & c&a '& ngu*n uong n
int =eme(int n)
{
i(n $$ 0)
{
return 0;
i(n'/ $$ 1)
{
return =eme(n-10) % 1;
return =eme(n-10);
tnh t&ng cc ch& '& ch&n c&a '& ngu*n uong n
int ong7hu&o7han(int n)
{
i(n $$ 0)
{
return 0;
i(n'/ $$ 0)
{
return ong7hu&o7han(n-10) % (n'10);
-
7/25/2019 ham de qui
11/11
return ong7hu&o7han(n-10);
io
#include
#include
int 3(int n)
{
i(n$$0) return 0;
else i(n$$1) return 1;
else i(n>$/)
return 3(n*1)%3(n*/);
int main()
{
int i,n;
print(!?hap @ao so can tinh !);
scan(!'d!, An);
or(i$0;i
