Данный отчёт сгенерирован 04.04.2023 06:21:13 UTC.
HTML версия (этот сайт) сгенерирован 04.04.2023 06:21:31 UTC.
Коммит: [bfeb65b9] add automatic zip creation 04.04.2023 06:21:13
HTML версия (этот сайт) сгенерирован 04.04.2023 06:21:31 UTC.
Коммит: [bfeb65b9] add automatic zip creation 04.04.2023 06:21:13
Задача: Ланцюговий Дроб
04.04.2023 06:21:13
Описание: Порахувати n-поверховий ланцюговий дріб fi = 1+1/(1+1/(...)).
Для цього оголосіть статичний метод double Chain (int n), який поверне потрібне значення.
Наприклад,
Chain(1) => 1
Chain(2) => 1 + 1/1 = 2
Chain(3) => 1 + 1/2 = 3/2
Chain(4) => 1 + 1/(3/2) = 5/3
04.04.2023 06:21:13
Решений: 79
04.04.2023 06:21:13
Ланцюговий Дроб
04.04.2023 06:21:13
static double Chain(int n) {
if (n == 1) return 1;
return 1 + 1 / Chain(n - 1);
}
static double Chain(int n){
double result = 0;
if(n==1){
return 1;
}
return result = 1+ 1/Chain(--n);
}
static double Chain(int n)
{
if (n == 1)
return 1;
else
return 1 + 1/Chain(n - 1);
}
static double Chain(int n)
{
double res = 1;
for (int i = 1; i <= n; i++)
{
res = 1 + 1 / res;
}
return res;
}
static double Chain(int n) {
if (n == 1) {
return 1;
}
return 1 + 1 / Chain(n - 1);
}
static double Chain(int n)
{
double result = 0;
if (n == 1)
{
return 1;
}
return result = 1 + 1 / Chain(--n);
}
static double Chain(int n) {
if (n == 0) return 1;
return 1 + 1 / Chain(n - 1);
}
static double Chain(int n)
{
double result = 1;
for (int i = 1; i <= n; i++)
{
result = 1 + 1 / result;
}
return result;
}
static double Chain(int n) {
double result = 0;
for (int i = 1; i <= n; i++) {
result = 1 + 1/result;
}
return result;
}
static double Chain(int n) {
double value = 1.0;
for (int i = 1; i < n; i++) {
value = 1.0 + 1.0 / value;
}
return value;
}
static double Chain(int n)
{
double res = 1;
for(int i = 1; i < n; i++)
res = 1.0 + 1 / res;
return res;
}
public static double Chain(int n) {
double fn = 1.0; // починаємо з f_0 = 1
for (int i = 1; i <= n; i++) {
fn = 1.0 + 1.0 / fn;
}
return fn;
}
static double Chain(int n)
{
if(n==1) return 1;
else
{
return 1+1/Chain(n-1);
}
}
static double Chain(int n){
double res=1.00;
for (int i=n; i>0; i--){
res=1+1/res;
}
return res;
}
static double Chain(int n) {
double divisor = 1;
for (int i = n; i > 0; i--) {
divisor = 1.0 + 1.0 / divisor;
}
return divisor;
}
static double Chain(int n){
double t;
t = 2;
for( int a = 1; a < n; a++)
{
t = 1/t + 1;
}
return t;
}
static double Chain(int n)
{
if (n == 0)
return 1.0;
else
return 1.0 + 1.0 / Chain(n-1);
}
static double Chain(int n)
{
if(n==1)
{
return 1;
}
return 1+1/(Chain(n-1));
}
static double Chain(int n){
if(n == 1)
return 1;
return 1 / Chain(n - 1) + 1;
}
static double Chain(int n){
return n==1?1:1+1/Chain(n-1);
}
static double Chain(int n){
if(n == 1){
return 1;
}
else{
return 1 + 1/(Chain(n-1));
}
}
static double Chain(int n){
double t = 1;
for(int i = n; i >= 2; i--){
t = 1 + 1/t;
}
return t;
}
static double Chain(int n){
double t;
t=2;
for(int a = 1; a< n; a++){
t = 1/t + 1;
}
return t;
}
static double UniqueFract() {
return 13.5;
}
static double Chain(int n)
{
double result = 1.0;
while (n-- > 0)
result = 1.0 + 1.0 / result;
return result;
}
static double Chain(int n)
{
double result = 1;
for (int i = n; i > 1; i--)
{
result = 1 + 1 / result;
}
return result;
}
static double Chain(int n) {
double fi= 1;
for (int i=1; i<=n; i+=1) {
fi= 1+1/fi;
}
return fi;
}
public static double Chain(int n)
{
double result = 1.0;
for (int i = 1; i <= n; i++)
{
result = 1.0 + 1.0 / result;
}
return result;
}
static double Chain(int n)
{
double x = 1;
if(n == 1)
return x;
else {
for(int i = 1; i < n; i++)
{
x = 1 + 1 / x;
}
}
return x;
}
static double Chain(int n) {
if (n == 1) return 1;
return 1 + 1 / Chain(n-1);
}
static double Chain(int n) {
double fi = 1;
for (int i = 2; i <= n; i++) {
fi = 1 + 1 / fi;
}
return fi;
}
static double Chain(int n)
{
if (n == 1) return 1d;
if (n == 2) return 2d;
double res = 0d;
for (int i = n; i >= 1; i--)
{
res = 1d + 1d / res;
}
return res;
}
static double Chain(int n) {
double result = 1.0;
for (int i = 1; i <= n; i++)
{
result = 1.0 + 1.0 / result;
}
return result;
}
static double Chain(int n)
{
double f = 1;
for(double i = 1; i< n; i++)
{
f = 1 + 1/f;
}
return f;
}
static double Chain(int n){
if(n==1){
return 1;
}
else{
return 1+ 1/Chain(n-1);
}
}
static double Chain(int n){
if(n<=1){return 1;}
else{return 1 + 1/Chain(n-1);}
}
static double Chain(int n)
{
double res = 1.0;
for(int i = 1; i < n; i++)
{
res = 1 + 1 / res;
}
return res;
}
static double Chain(int n)
{
double sum = 1;
for(int i = 2; i <= n; i++)
{
sum = 1 + 1/sum;
}
return sum;
}
static double Chain(int n){
if (n == 1)
return 1;
else
{
double prevChain = Chain(n - 1);
return 1 + 1 / prevChain;
}
}
static double Chain(int n)
{
double chain = 0;
double chain_1 = 1;
for (int i = 1; i < n; i++)
{
chain = 1 + 1 / chain_1;
chain_1 = chain;
}
if(n == 1)
{
return 1;
}
return chain;
}
static double Chain(int n)
{
double fr = 1;
for (int i = 0; i < n; i++)
{
fr = 1 / (1 + fr);
}
return 1 + fr;
}
static double Chain(int n)
{
if (n == 1)
{
return 1;
}
else
{
return 1 + 1 / Chain(n - 1);
}
}
static double Chain(int n)
{
if (n == 1) return 1d;
if (n == 2) return 2d;
double res = 0d;
for (int i = n; i >= 1; i--)
{
res = 1d + 1d / res;
}
return res;
}
static double Chain(int n)
{
double r = 1;
for (int i = 0; i< n; i++)
{
r =1+ 1/ r;
Console.WriteLine(r);
}
return r;
}
static double Chain(int n){
double fi = 0;
if(n == 1){
fi = 1;
}
else{
fi = 1 + 1/Chain(n-1);
}
return fi;
}
static double Chain(int n){
if(n == 1)
{
return 1;
}
return 1+(1/Chain(n-1));
}
static double Chain(int n){
if (n == 1) return 1;
return 1+1/Chain(n-1);
}
static double Chain(int n) {
double fi = 1;
for (int i = 0; i < n - 1; i++) fi = 1 + 1 / fi;
return fi;
}
static double Chain(int n)
{
if (n == 1)
{
return 1;
}
return(1 + 1 / Chain(n-1));
}
static double Chain(int n) {
double m = 1;
for (int i = 1; i <= n; i++) {
m = 1 + 1 / m;
}
return m;
}
public static double Chain(int n) {
if (n == 1) {
return 1;
} else {
return 1 + 1 / Chain(n - 1);
}
}
static double Chain(int n)
{
double result = 1;
for (int i = 1; i <= n; i++)
{
result = 1 + 1 / result;
}
return result;
}
static double Chain(int n)
{
double result = 1;
for (int i = 1; i <= n; i++)
{
result = 1 + 1 / result;
}
return result;
}
static double Chain(int n){
if(n==1){
return 1;
}
else{
return 1+1/Chain(n-1);
}
}
static double Chain(int n)
{
if (n == 1)
return 1;
else
return 1 + 1 / Chain(n - 1);
}
double ChainWithoutRecursion(int n)
{
double result = 1;
for (int i = 1; i < n; i++)
{
result = 1 + 1 / result;
}
return result;
}
static double Chain(int n){
double sum = 1;
for(int i = 0;i < n;i++){
sum = 1 + 1/sum;
}
return sum;
}
static double Chain(int n)
{
double value = 1.0;
for (int i = 1; i < n; i++)
{
value = 1 + 1 / value;
}
return value;
}
static double Chain(int n)
{
decimal newN=Convert.ToDecimal(n);
if (newN == 1) return 1;
return 1 + 1 / Chain((int)newN - 1);
}
static double Chain(int n)
{
double c = 1;
for (int i = 1; i < n; i++) c = 1 + 1 / c;
return c;
}
static double Chain(int n)
{
if(n==1){
return 1;
}
else{
return 1+ 1/Chain(n-1);
}
}
static double Chain(int n){
if(n==1)
{
return 1;
}
else
{
return 1+1/Chain(n-1);
}
}
static double Chain(int n)
{
double sum = factory(n);
return sum;
}
static double factory(int n)
{
if (n == 1) return 1;
else return 1 + 1 / factory(n - 1);
}
static double Chain(int n){
if(n==1) {return 1;}
return (1+(1/Chain(n-1)));
}
static double Chain(int n){
double f = 1.0;
for (int i = n; i >= 1; i--) {
f = 1.0 + 1.0 / f;
}
return f;
}
public static double Chain(int n)
{
if (n <= 0)
{
throw new ArgumentException("n must be a positive integer.");
}
double result = 1.0;
for (int i = n - 1; i >= 1; i--)
{
result = 1.0 + 1.0 / result;
}
return result;
}
static double Chain(int n){
double res = 1;
for (int i=1; i< n; i++) res = 1+1/res;
return res;
}
static double Chain(int n)
{
double result = 1;
for(int i = 1; i < n; i++)
{
result = 1 + 1/result;
}
return result;
}
static double Chain(int n){
if(n == 1) {return 1.0;}
double answ = 1.0;
while(n>1){
answ = 1 + 1/answ;
n--;
}
return answ;
}
static double Chain(int n){
double res = 1;
for (int i = n; i > 0; i--) {
res = 1 + 1 / res;
}
return res;
}
static double Chain(int n){
if(n == 1) {
return 1;
} else {
return 1 + 1 / Chain(n - 1);
}
}
static double Chain(int n){
double result = 0;
for (int i = n; i >= 1; i--)
{
result = 1 + 1 / result;
}
return result;
}
static double Chain(int n)
{
return n==1?1:1+1/Chain(n-1);
}
static double Chain(int n) {
double res = 1;
for(int i = 2; i <= n; i++) {
res = 1+(1/res);
}
return res;
}
static double Chain(int n)
{
if(n == 1) return 1;
return 1 + 1/Chain(n - 1);
}
static double Chain(int n)
{
if (n == 1)
{
return 1;
}
else
{
return Chain(1) + 1/Chain(n-1);
}
}
static double Chain(int n) {
if (n == 1) return 1;
return 1 + 1 / Chain(n - 1);
}
static double Chain(int n)
{
double res = 0;
for (int i = 0; i <= n; i++)
{
res = 1 + 1 / res;
}
return res;
}
static double Chain(int n)
{
double space = 1;
for (double i = 1; i < n; i++)
{
space = 1 + 1 / space;
}
return space;
}
static double Chain(int n){
if(n == 1){
return 1;
}
double res = 0;
res = 1 + (1/Chain(--n));
return res;
}
static double Chain(int n)
{
if (n == 1) return 1;
return 1 + 1 / Chain(n - 1);
}
if (n == 1) return 1;
return 1 + 1 / Chain(n - 1);
}
double result = 0;
if(n==1){
return 1;
}
return result = 1+ 1/Chain(--n);
}
{
if (n == 1)
return 1;
else
return 1 + 1/Chain(n - 1);
}
{
double res = 1;
for (int i = 1; i <= n; i++)
{
res = 1 + 1 / res;
}
return res;
}
if (n == 1) {
return 1;
}
return 1 + 1 / Chain(n - 1);
}
{
double result = 0;
if (n == 1)
{
return 1;
}
return result = 1 + 1 / Chain(--n);
}
if (n == 0) return 1;
return 1 + 1 / Chain(n - 1);
}
{
double result = 1;
for (int i = 1; i <= n; i++)
{
result = 1 + 1 / result;
}
return result;
}
double result = 0;
for (int i = 1; i <= n; i++) {
result = 1 + 1/result;
}
return result;
}
double value = 1.0;
for (int i = 1; i < n; i++) {
value = 1.0 + 1.0 / value;
}
return value;
}
{
double res = 1;
for(int i = 1; i < n; i++)
res = 1.0 + 1 / res;
return res;
}
double fn = 1.0; // починаємо з f_0 = 1
for (int i = 1; i <= n; i++) {
fn = 1.0 + 1.0 / fn;
}
return fn;
}
{
if(n==1) return 1;
else
{
return 1+1/Chain(n-1);
}
}
double res=1.00;
for (int i=n; i>0; i--){
res=1+1/res;
}
return res;
}
double divisor = 1;
for (int i = n; i > 0; i--) {
divisor = 1.0 + 1.0 / divisor;
}
return divisor;
}
double t;
t = 2;
for( int a = 1; a < n; a++)
{
t = 1/t + 1;
}
return t;
}
{
if (n == 0)
return 1.0;
else
return 1.0 + 1.0 / Chain(n-1);
}
{
if(n==1)
{
return 1;
}
return 1+1/(Chain(n-1));
}
if(n == 1)
return 1;
return 1 / Chain(n - 1) + 1;
}
return n==1?1:1+1/Chain(n-1);
}
if(n == 1){
return 1;
}
else{
return 1 + 1/(Chain(n-1));
}
}
double t = 1;
for(int i = n; i >= 2; i--){
t = 1 + 1/t;
}
return t;
}
double t;
t=2;
for(int a = 1; a< n; a++){
t = 1/t + 1;
}
return t;
}
static double UniqueFract() {
return 13.5;
}
{
double result = 1.0;
while (n-- > 0)
result = 1.0 + 1.0 / result;
return result;
}
{
double result = 1;
for (int i = n; i > 1; i--)
{
result = 1 + 1 / result;
}
return result;
}
double fi= 1;
for (int i=1; i<=n; i+=1) {
fi= 1+1/fi;
}
return fi;
}
{
double result = 1.0;
for (int i = 1; i <= n; i++)
{
result = 1.0 + 1.0 / result;
}
return result;
}
{
double x = 1;
if(n == 1)
return x;
else {
for(int i = 1; i < n; i++)
{
x = 1 + 1 / x;
}
}
return x;
}
if (n == 1) return 1;
return 1 + 1 / Chain(n-1);
}
double fi = 1;
for (int i = 2; i <= n; i++) {
fi = 1 + 1 / fi;
}
return fi;
}
{
if (n == 1) return 1d;
if (n == 2) return 2d;
double res = 0d;
for (int i = n; i >= 1; i--)
{
res = 1d + 1d / res;
}
return res;
}
double result = 1.0;
for (int i = 1; i <= n; i++)
{
result = 1.0 + 1.0 / result;
}
return result;
}
{
double f = 1;
for(double i = 1; i< n; i++)
{
f = 1 + 1/f;
}
return f;
}
if(n==1){
return 1;
}
else{
return 1+ 1/Chain(n-1);
}
}
if(n<=1){return 1;}
else{return 1 + 1/Chain(n-1);}
}
{
double res = 1.0;
for(int i = 1; i < n; i++)
{
res = 1 + 1 / res;
}
return res;
}
{
double sum = 1;
for(int i = 2; i <= n; i++)
{
sum = 1 + 1/sum;
}
return sum;
}
if (n == 1)
return 1;
else
{
double prevChain = Chain(n - 1);
return 1 + 1 / prevChain;
}
}
{
double chain = 0;
double chain_1 = 1;
for (int i = 1; i < n; i++)
{
chain = 1 + 1 / chain_1;
chain_1 = chain;
}
if(n == 1)
{
return 1;
}
return chain;
}
{
double fr = 1;
for (int i = 0; i < n; i++)
{
fr = 1 / (1 + fr);
}
return 1 + fr;
}
{
if (n == 1)
{
return 1;
}
else
{
return 1 + 1 / Chain(n - 1);
}
}
{
if (n == 1) return 1d;
if (n == 2) return 2d;
double res = 0d;
for (int i = n; i >= 1; i--)
{
res = 1d + 1d / res;
}
return res;
}
{
double r = 1;
for (int i = 0; i< n; i++)
{
r =1+ 1/ r;
Console.WriteLine(r);
}
return r;
}
double fi = 0;
if(n == 1){
fi = 1;
}
else{
fi = 1 + 1/Chain(n-1);
}
return fi;
}
if(n == 1)
{
return 1;
}
return 1+(1/Chain(n-1));
}
if (n == 1) return 1;
return 1+1/Chain(n-1);
}
double fi = 1;
for (int i = 0; i < n - 1; i++) fi = 1 + 1 / fi;
return fi;
}
{
if (n == 1)
{
return 1;
}
return(1 + 1 / Chain(n-1));
}
double m = 1;
for (int i = 1; i <= n; i++) {
m = 1 + 1 / m;
}
return m;
}
if (n == 1) {
return 1;
} else {
return 1 + 1 / Chain(n - 1);
}
}
{
double result = 1;
for (int i = 1; i <= n; i++)
{
result = 1 + 1 / result;
}
return result;
}
{
double result = 1;
for (int i = 1; i <= n; i++)
{
result = 1 + 1 / result;
}
return result;
}
if(n==1){
return 1;
}
else{
return 1+1/Chain(n-1);
}
}
{
if (n == 1)
return 1;
else
return 1 + 1 / Chain(n - 1);
}
double ChainWithoutRecursion(int n)
{
double result = 1;
for (int i = 1; i < n; i++)
{
result = 1 + 1 / result;
}
return result;
}
double sum = 1;
for(int i = 0;i < n;i++){
sum = 1 + 1/sum;
}
return sum;
}
{
double value = 1.0;
for (int i = 1; i < n; i++)
{
value = 1 + 1 / value;
}
return value;
}
{
decimal newN=Convert.ToDecimal(n);
if (newN == 1) return 1;
return 1 + 1 / Chain((int)newN - 1);
}
{
double c = 1;
for (int i = 1; i < n; i++) c = 1 + 1 / c;
return c;
}
{
if(n==1){
return 1;
}
else{
return 1+ 1/Chain(n-1);
}
}
if(n==1)
{
return 1;
}
else
{
return 1+1/Chain(n-1);
}
}
{
double sum = factory(n);
return sum;
}
static double factory(int n)
{
if (n == 1) return 1;
else return 1 + 1 / factory(n - 1);
}
if(n==1) {return 1;}
return (1+(1/Chain(n-1)));
}
double f = 1.0;
for (int i = n; i >= 1; i--) {
f = 1.0 + 1.0 / f;
}
return f;
}
{
if (n <= 0)
{
throw new ArgumentException("n must be a positive integer.");
}
double result = 1.0;
for (int i = n - 1; i >= 1; i--)
{
result = 1.0 + 1.0 / result;
}
return result;
}
double res = 1;
for (int i=1; i< n; i++) res = 1+1/res;
return res;
}
{
double result = 1;
for(int i = 1; i < n; i++)
{
result = 1 + 1/result;
}
return result;
}
if(n == 1) {return 1.0;}
double answ = 1.0;
while(n>1){
answ = 1 + 1/answ;
n--;
}
return answ;
}
double res = 1;
for (int i = n; i > 0; i--) {
res = 1 + 1 / res;
}
return res;
}
if(n == 1) {
return 1;
} else {
return 1 + 1 / Chain(n - 1);
}
}
double result = 0;
for (int i = n; i >= 1; i--)
{
result = 1 + 1 / result;
}
return result;
}
{
return n==1?1:1+1/Chain(n-1);
}
double res = 1;
for(int i = 2; i <= n; i++) {
res = 1+(1/res);
}
return res;
}
{
if(n == 1) return 1;
return 1 + 1/Chain(n - 1);
}
{
if (n == 1)
{
return 1;
}
else
{
return Chain(1) + 1/Chain(n-1);
}
}
if (n == 1) return 1;
return 1 + 1 / Chain(n - 1);
}
{
double res = 0;
for (int i = 0; i <= n; i++)
{
res = 1 + 1 / res;
}
return res;
}
{
double space = 1;
for (double i = 1; i < n; i++)
{
space = 1 + 1 / space;
}
return space;
}
if(n == 1){
return 1;
}
double res = 0;
res = 1 + (1/Chain(--n));
return res;
}
{
if (n == 1) return 1;
return 1 + 1 / Chain(n - 1);
}