message stringlengths 2 44.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 42 109k | cluster float64 5 5 | __index_level_0__ int64 84 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given N real values A_1, A_2, \ldots, A_N. Compute the number of pairs of indices (i, j) such that i < j and the product A_i \cdot A_j is integer.
Constraints
* 2 \leq N \leq 200\,000
... | instruction | 0 | 53,666 | 5 | 107,332 |
Yes | output | 1 | 53,666 | 5 | 107,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given N real values A_1, A_2, \ldots, A_N. Compute the number of pairs of indices (i, j) such that i < j and the product A_i \cdot A_j is integer.
Constraints
* 2 \leq N \leq 200\,000
... | instruction | 0 | 53,667 | 5 | 107,334 |
No | output | 1 | 53,667 | 5 | 107,335 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given N real values A_1, A_2, \ldots, A_N. Compute the number of pairs of indices (i, j) such that i < j and the product A_i \cdot A_j is integer.
Constraints
* 2 \leq N \leq 200\,000
... | instruction | 0 | 53,668 | 5 | 107,336 |
No | output | 1 | 53,668 | 5 | 107,337 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given N real values A_1, A_2, \ldots, A_N. Compute the number of pairs of indices (i, j) such that i < j and the product A_i \cdot A_j is integer.
Constraints
* 2 \leq N \leq 200\,000
... | instruction | 0 | 53,669 | 5 | 107,338 |
No | output | 1 | 53,669 | 5 | 107,339 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given N real values A_1, A_2, \ldots, A_N. Compute the number of pairs of indices (i, j) such that i < j and the product A_i \cdot A_j is integer.
Constraints
* 2 \leq N \leq 200\,000
... | instruction | 0 | 53,670 | 5 | 107,340 |
No | output | 1 | 53,670 | 5 | 107,341 |
Provide a correct Python 3 solution for this coding contest problem.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or mo... | instruction | 0 | 53,671 | 5 | 107,342 |
"Correct Solution:
```
N,K=map(int,input().split())
l=N%K
print(min(l,abs(K-l)))
``` | output | 1 | 53,671 | 5 | 107,343 |
Provide a correct Python 3 solution for this coding contest problem.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or mo... | instruction | 0 | 53,672 | 5 | 107,344 |
"Correct Solution:
```
n,k=map(int,input().split())
print(min(n,n%k,k-n%k))
``` | output | 1 | 53,672 | 5 | 107,345 |
Provide a correct Python 3 solution for this coding contest problem.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or mo... | instruction | 0 | 53,673 | 5 | 107,346 |
"Correct Solution:
```
a,b=map(int,input().split())
print(min(b-(a%b),a%b))
``` | output | 1 | 53,673 | 5 | 107,347 |
Provide a correct Python 3 solution for this coding contest problem.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or mo... | instruction | 0 | 53,674 | 5 | 107,348 |
"Correct Solution:
```
a,b = list(map(int,input().split()))
print(min(a%b,b-a%b))
``` | output | 1 | 53,674 | 5 | 107,349 |
Provide a correct Python 3 solution for this coding contest problem.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or mo... | instruction | 0 | 53,675 | 5 | 107,350 |
"Correct Solution:
```
N, K = map(int, input().split())
print(min(N % K, -(N%K) + K))
``` | output | 1 | 53,675 | 5 | 107,351 |
Provide a correct Python 3 solution for this coding contest problem.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or mo... | instruction | 0 | 53,676 | 5 | 107,352 |
"Correct Solution:
```
n,k = map(int,input().split())
c = n%k
m = min(c,k-c)
print(m)
``` | output | 1 | 53,676 | 5 | 107,353 |
Provide a correct Python 3 solution for this coding contest problem.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or mo... | instruction | 0 | 53,677 | 5 | 107,354 |
"Correct Solution:
```
N,K = map(int,input().split())
i = N%K
j = -i+K
print(min(i,j))
``` | output | 1 | 53,677 | 5 | 107,355 |
Provide a correct Python 3 solution for this coding contest problem.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or mo... | instruction | 0 | 53,678 | 5 | 107,356 |
"Correct Solution:
```
N,K=map(int,input().split())
print(min(N%K,abs(K-(N%K))))
``` | output | 1 | 53,678 | 5 | 107,357 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible v... | instruction | 0 | 53,679 | 5 | 107,358 |
Yes | output | 1 | 53,679 | 5 | 107,359 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible v... | instruction | 0 | 53,680 | 5 | 107,360 |
Yes | output | 1 | 53,680 | 5 | 107,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible v... | instruction | 0 | 53,681 | 5 | 107,362 |
Yes | output | 1 | 53,681 | 5 | 107,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible v... | instruction | 0 | 53,682 | 5 | 107,364 |
Yes | output | 1 | 53,682 | 5 | 107,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible v... | instruction | 0 | 53,683 | 5 | 107,366 |
No | output | 1 | 53,683 | 5 | 107,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible v... | instruction | 0 | 53,684 | 5 | 107,368 |
No | output | 1 | 53,684 | 5 | 107,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible v... | instruction | 0 | 53,685 | 5 | 107,370 |
No | output | 1 | 53,685 | 5 | 107,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given any integer x, Aoki can do the operation below.
Operation: Replace x with the absolute difference of x and K.
You are given the initial value of an integer N. Find the minimum possible v... | instruction | 0 | 53,686 | 5 | 107,372 |
No | output | 1 | 53,686 | 5 | 107,373 |
Provide a correct Python 3 solution for this coding contest problem.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the max... | instruction | 0 | 53,751 | 5 | 107,502 |
"Correct Solution:
```
n=input()
keta=len(n)
a=0
for i in n:
a+=int(i)
print(max(a,9*(keta-1)+int(n[0])-1))
``` | output | 1 | 53,751 | 5 | 107,503 |
Provide a correct Python 3 solution for this coding contest problem.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the max... | instruction | 0 | 53,752 | 5 | 107,504 |
"Correct Solution:
```
n = input()
if (all([i == '9' for i in n[1:]])):
print(int(n[0])+9*(len(n)-1))
else:
print(int(n[0])-1+9*(len(n)-1))
``` | output | 1 | 53,752 | 5 | 107,505 |
Provide a correct Python 3 solution for this coding contest problem.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the max... | instruction | 0 | 53,753 | 5 | 107,506 |
"Correct Solution:
```
n = int(input())
s = str(n)
a = 0
for i in range(len(s)):
a += int(s[i])
b = int(s[0])-1+(len(s)-1)*9
print(max(a, b))
``` | output | 1 | 53,753 | 5 | 107,507 |
Provide a correct Python 3 solution for this coding contest problem.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the max... | instruction | 0 | 53,754 | 5 | 107,508 |
"Correct Solution:
```
n=input();print(int(n[0])-1*(len(n)>1)*(n[1:]!="9"*(len(n)-1))+9*(len(n)-1))
``` | output | 1 | 53,754 | 5 | 107,509 |
Provide a correct Python 3 solution for this coding contest problem.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the max... | instruction | 0 | 53,755 | 5 | 107,510 |
"Correct Solution:
```
N = input()
print(max((len(N) - 1) * 9 + int(N[0]) - 1, sum(int(n) for n in N)))
``` | output | 1 | 53,755 | 5 | 107,511 |
Provide a correct Python 3 solution for this coding contest problem.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the max... | instruction | 0 | 53,756 | 5 | 107,512 |
"Correct Solution:
```
a=list(input())
p=print
x=len(a)-1
y=int(a[0])
print(9*x+y if all(i=='9' for i in a[1:]) else y-1+9*x)
``` | output | 1 | 53,756 | 5 | 107,513 |
Provide a correct Python 3 solution for this coding contest problem.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the max... | instruction | 0 | 53,757 | 5 | 107,514 |
"Correct Solution:
```
n=input()
k=len(n)
if k==1:
print(n);exit()
nn=int(n)
ans= nn//(10**(k-1))-1+9*(k-1)
print(max(ans, sum([int(i) for i in n]) ))
``` | output | 1 | 53,757 | 5 | 107,515 |
Provide a correct Python 3 solution for this coding contest problem.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the max... | instruction | 0 | 53,758 | 5 | 107,516 |
"Correct Solution:
```
n=input()
print(max(int(n[0])-1+(9*(len(n)-1)),sum([int(i) for i in n])))
``` | output | 1 | 53,758 | 5 | 107,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard In... | instruction | 0 | 53,759 | 5 | 107,518 |
Yes | output | 1 | 53,759 | 5 | 107,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard In... | instruction | 0 | 53,760 | 5 | 107,520 |
Yes | output | 1 | 53,760 | 5 | 107,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard In... | instruction | 0 | 53,761 | 5 | 107,522 |
Yes | output | 1 | 53,761 | 5 | 107,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard In... | instruction | 0 | 53,762 | 5 | 107,524 |
Yes | output | 1 | 53,762 | 5 | 107,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard In... | instruction | 0 | 53,763 | 5 | 107,526 |
No | output | 1 | 53,763 | 5 | 107,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard In... | instruction | 0 | 53,764 | 5 | 107,528 |
No | output | 1 | 53,764 | 5 | 107,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard In... | instruction | 0 | 53,765 | 5 | 107,530 |
No | output | 1 | 53,765 | 5 | 107,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.
Constraints
* 1\leq N \leq 10^{16}
* N is an integer.
Input
Input is given from Standard In... | instruction | 0 | 53,766 | 5 | 107,532 |
No | output | 1 | 53,766 | 5 | 107,533 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
4 2 1 1
1 1 1 2
2 2 2 1
2 2 1 2
1 1 2 1
9 N
Output
1 1
2 2 | instruction | 0 | 53,867 | 5 | 107,734 |
"Correct Solution:
```
# coding: utf-8
import sys
sys.setrecursionlimit(50000000)
max_c=101
vec=[(0,2),(2,0),(0,-2),(-2,0)]
try:
while True:
log=[-1 for i in range(10001)]
n,x0,y0,t=map(int,input().split())
field=[[0 for i in range(max_c)]for i in range(max_c)]
for i in range(n):
... | output | 1 | 53,867 | 5 | 107,735 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which prints $n$-th fibonacci number for a given integer $n$. The $n$-th fibonacci number is defined by the following recursive formula:
\begin{equation*} fib(n)= \left \\{ \begin{array}{ll} 1 & (n = 0) \\\ 1 & (n = 1) \\\ fib(n - 1)... | instruction | 0 | 53,896 | 5 | 107,792 |
"Correct Solution:
```
x = [1,1]
n = int(input())
for i in range(n):
a=[x[i]+x[i+1]]
x = x+a
print(x[n])
``` | output | 1 | 53,896 | 5 | 107,793 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which prints $n$-th fibonacci number for a given integer $n$. The $n$-th fibonacci number is defined by the following recursive formula:
\begin{equation*} fib(n)= \left \\{ \begin{array}{ll} 1 & (n = 0) \\\ 1 & (n = 1) \\\ fib(n - 1)... | instruction | 0 | 53,897 | 5 | 107,794 |
"Correct Solution:
```
n = int(input())
f = [0]*45
f[0] = f[1] = 1
for i in range(2, 45):
f[i] = f[i-2] + f[i-1]
print(f[n])
``` | output | 1 | 53,897 | 5 | 107,795 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which prints $n$-th fibonacci number for a given integer $n$. The $n$-th fibonacci number is defined by the following recursive formula:
\begin{equation*} fib(n)= \left \\{ \begin{array}{ll} 1 & (n = 0) \\\ 1 & (n = 1) \\\ fib(n - 1)... | instruction | 0 | 53,898 | 5 | 107,796 |
"Correct Solution:
```
#(40)フィボナッチ数列
n=int(input())
def fib(n):
a=1
b=1
for _ in range(n):
a,b=b,a+b
return a
print(fib(n))
``` | output | 1 | 53,898 | 5 | 107,797 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which prints $n$-th fibonacci number for a given integer $n$. The $n$-th fibonacci number is defined by the following recursive formula:
\begin{equation*} fib(n)= \left \\{ \begin{array}{ll} 1 & (n = 0) \\\ 1 & (n = 1) \\\ fib(n - 1)... | instruction | 0 | 53,899 | 5 | 107,798 |
"Correct Solution:
```
n = int(input())
DP = [0 for _ in range(n+1)]
DP[0] = 1
DP[1] = 1
for i in range(2, n+1):
DP[i] = DP[i-1]+DP[i-2]
print(DP[n])
``` | output | 1 | 53,899 | 5 | 107,799 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which prints $n$-th fibonacci number for a given integer $n$. The $n$-th fibonacci number is defined by the following recursive formula:
\begin{equation*} fib(n)= \left \\{ \begin{array}{ll} 1 & (n = 0) \\\ 1 & (n = 1) \\\ fib(n - 1)... | instruction | 0 | 53,900 | 5 | 107,800 |
"Correct Solution:
```
n=int(input())
fib=[0 for i in range(n+1)]
fib[0]=1
fib[1]=1
for i in range(2,n+1):
fib[i]=fib[i-1]+fib[i-2]
print(fib[n])
``` | output | 1 | 53,900 | 5 | 107,801 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which prints $n$-th fibonacci number for a given integer $n$. The $n$-th fibonacci number is defined by the following recursive formula:
\begin{equation*} fib(n)= \left \\{ \begin{array}{ll} 1 & (n = 0) \\\ 1 & (n = 1) \\\ fib(n - 1)... | instruction | 0 | 53,901 | 5 | 107,802 |
"Correct Solution:
```
n = int(input())
fib = [0]*(n+1)
fib[0],fib[1] = 1, 1
for i in range(2, n+1):
fib[i] = fib[i-1] + fib[i-2]
print(fib[n])
``` | output | 1 | 53,901 | 5 | 107,803 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which prints $n$-th fibonacci number for a given integer $n$. The $n$-th fibonacci number is defined by the following recursive formula:
\begin{equation*} fib(n)= \left \\{ \begin{array}{ll} 1 & (n = 0) \\\ 1 & (n = 1) \\\ fib(n - 1)... | instruction | 0 | 53,902 | 5 | 107,804 |
"Correct Solution:
```
n = int(input())
fib = [1]*45
for i in range(2,n+1):
fib[i] = fib[i-1]+fib[i-2]
print(fib[n])
``` | output | 1 | 53,902 | 5 | 107,805 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which prints $n$-th fibonacci number for a given integer $n$. The $n$-th fibonacci number is defined by the following recursive formula:
\begin{equation*} fib(n)= \left \\{ \begin{array}{ll} 1 & (n = 0) \\\ 1 & (n = 1) \\\ fib(n - 1)... | instruction | 0 | 53,903 | 5 | 107,806 |
"Correct Solution:
```
N = int(input())
dp = [0] * (N+1)
dp[0], dp[1] = 1,1
for i in range(2,N+1):
dp[i] = dp[i-1] + dp[i-2]
print(dp[N])
``` | output | 1 | 53,903 | 5 | 107,807 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which prints $n$-th fibonacci number for a given integer $n$. The $n$-th fibonacci number is defined by the following recursive formula:
\begin{equation*} fib(n)= \left \\{ \beg... | instruction | 0 | 53,904 | 5 | 107,808 |
Yes | output | 1 | 53,904 | 5 | 107,809 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which prints $n$-th fibonacci number for a given integer $n$. The $n$-th fibonacci number is defined by the following recursive formula:
\begin{equation*} fib(n)= \left \\{ \beg... | instruction | 0 | 53,905 | 5 | 107,810 |
Yes | output | 1 | 53,905 | 5 | 107,811 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which prints $n$-th fibonacci number for a given integer $n$. The $n$-th fibonacci number is defined by the following recursive formula:
\begin{equation*} fib(n)= \left \\{ \beg... | instruction | 0 | 53,906 | 5 | 107,812 |
Yes | output | 1 | 53,906 | 5 | 107,813 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which prints $n$-th fibonacci number for a given integer $n$. The $n$-th fibonacci number is defined by the following recursive formula:
\begin{equation*} fib(n)= \left \\{ \beg... | instruction | 0 | 53,907 | 5 | 107,814 |
Yes | output | 1 | 53,907 | 5 | 107,815 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.