message stringlengths 2 57.2k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 61 108k | cluster float64 22 22 | __index_level_0__ int64 122 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya likes to solve equations. Today he wants to solve (x~div~k) β
(x mod k) = n, where div and mod stand for integer division and modulo operations (refer to the Notes below for exact definition). In this equation, k and n are positive int... | instruction | 0 | 55,635 | 22 | 111,270 |
Tags: math
Correct Solution:
```
n, k = map(int, input().split())
r = k - 1
while n % r != 0:
r -= 1
m = n // r
x = k * m + r
print(x)
``` | output | 1 | 55,635 | 22 | 111,271 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya likes to solve equations. Today he wants to solve (x~div~k) β
(x mod k) = n, where div and mod stand for integer division and modulo operations (refer to the Notes below for exact definition). In this equation, k and n are positive int... | instruction | 0 | 55,636 | 22 | 111,272 |
Tags: math
Correct Solution:
```
n,k = [int(i) for i in input().split()]
ost = k - 1
while n % ost != 0:
ost -= 1
x = n//ost * k + ost
print(x)
``` | output | 1 | 55,636 | 22 | 111,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya likes to solve equations. Today he wants to solve (x~div~k) β
(x mod k) = n, where div and mod stand for integer division and modulo operations (refer to the Notes below for exact definition). In this equation, k and n are positive int... | instruction | 0 | 55,637 | 22 | 111,274 |
Tags: math
Correct Solution:
```
a, b = list(map(int, input().split()))
ans = 100000000000
if a == 0:
print(0)
else:
for i in range(1, b):
if a % i == 0:
ans = min(a // i * b + i, ans)
print(ans)
``` | output | 1 | 55,637 | 22 | 111,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya likes to solve equations. Today he wants to solve (x~div~k) β
(x mod k) = n, where div and mod stand for integer division and modulo operations (refer to the Notes below for exact definition). In this equation, k and n are positive int... | instruction | 0 | 55,638 | 22 | 111,276 |
Tags: math
Correct Solution:
```
import math
a = input().split()
n, k = int(a[0]), int(a[1])
res = []
if n == 1:
print(k + 1)
else:
for i in range(1, math.ceil(math.sqrt(int(n))) + 1):
if n % i==0:
if ((i + k * n/i) // k ) * ((i + k * n/i) % k) == n:
res.append(i + k * n/i)
... | output | 1 | 55,638 | 22 | 111,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya likes to solve equations. Today he wants to solve (x~div~k) β
(x mod k) = n, where div and mod stand for integer division and modulo operations (refer to the Notes below for exact definiti... | instruction | 0 | 55,639 | 22 | 111,278 |
Yes | output | 1 | 55,639 | 22 | 111,279 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya likes to solve equations. Today he wants to solve (x~div~k) β
(x mod k) = n, where div and mod stand for integer division and modulo operations (refer to the Notes below for exact definiti... | instruction | 0 | 55,640 | 22 | 111,280 |
Yes | output | 1 | 55,640 | 22 | 111,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya likes to solve equations. Today he wants to solve (x~div~k) β
(x mod k) = n, where div and mod stand for integer division and modulo operations (refer to the Notes below for exact definiti... | instruction | 0 | 55,641 | 22 | 111,282 |
Yes | output | 1 | 55,641 | 22 | 111,283 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya likes to solve equations. Today he wants to solve (x~div~k) β
(x mod k) = n, where div and mod stand for integer division and modulo operations (refer to the Notes below for exact definiti... | instruction | 0 | 55,642 | 22 | 111,284 |
Yes | output | 1 | 55,642 | 22 | 111,285 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya likes to solve equations. Today he wants to solve (x~div~k) β
(x mod k) = n, where div and mod stand for integer division and modulo operations (refer to the Notes below for exact definiti... | instruction | 0 | 55,643 | 22 | 111,286 |
No | output | 1 | 55,643 | 22 | 111,287 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya likes to solve equations. Today he wants to solve (x~div~k) β
(x mod k) = n, where div and mod stand for integer division and modulo operations (refer to the Notes below for exact definiti... | instruction | 0 | 55,644 | 22 | 111,288 |
No | output | 1 | 55,644 | 22 | 111,289 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya likes to solve equations. Today he wants to solve (x~div~k) β
(x mod k) = n, where div and mod stand for integer division and modulo operations (refer to the Notes below for exact definiti... | instruction | 0 | 55,645 | 22 | 111,290 |
No | output | 1 | 55,645 | 22 | 111,291 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya likes to solve equations. Today he wants to solve (x~div~k) β
(x mod k) = n, where div and mod stand for integer division and modulo operations (refer to the Notes below for exact definiti... | instruction | 0 | 55,646 | 22 | 111,292 |
No | output | 1 | 55,646 | 22 | 111,293 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart into solving it one last time.
You are given ... | instruction | 0 | 55,732 | 22 | 111,464 |
Tags: constructive algorithms, math, ternary search
Correct Solution:
```
n,m,p=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
i=j=0
while(a[i]%p==0):
i+=1
while(b[j]%p==0):
j+=1
print(i+j)
``` | output | 1 | 55,732 | 22 | 111,465 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart into solving it one last time.
You are given ... | instruction | 0 | 55,733 | 22 | 111,466 |
Tags: constructive algorithms, math, ternary search
Correct Solution:
```
import sys
input = sys.stdin.readline
def main():
N, M, P = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
ans = 0
for i, a in enumerate(A):
if a % P !... | output | 1 | 55,733 | 22 | 111,467 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart into solving it one last time.
You are given ... | instruction | 0 | 55,734 | 22 | 111,468 |
Tags: constructive algorithms, math, ternary search
Correct Solution:
```
from sys import stdin, stdout
import math,sys
from itertools import permutations, combinations
from collections import defaultdict,deque,OrderedDict
import bisect as bi
import heapq
'''
#------------------PYPY FAst I/o---------------------------... | output | 1 | 55,734 | 22 | 111,469 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart into solving it one last time.
You are given ... | instruction | 0 | 55,735 | 22 | 111,470 |
Tags: constructive algorithms, math, ternary search
Correct Solution:
```
import sys
input = lambda: sys.stdin.readline().rstrip()
N, M, P = map(int, input().split())
A = [int(a) for a in input().split()]
B = [int(a) for a in input().split()]
for i, a in enumerate(A):
if a % P:
for j, b in enumerate(B):
... | output | 1 | 55,735 | 22 | 111,471 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart into solving it one last time.
You are given ... | instruction | 0 | 55,736 | 22 | 111,472 |
Tags: constructive algorithms, math, ternary search
Correct Solution:
```
from sys import stdin
input = stdin.buffer.readline
n, m, p = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
x, y = (0, 0)
while (a[x] % p) == 0:
x += 1
while (b[y] % p) == 0:
y += 1
print((x ... | output | 1 | 55,736 | 22 | 111,473 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart into solving it one last time.
You are given ... | instruction | 0 | 55,737 | 22 | 111,474 |
Tags: constructive algorithms, math, ternary search
Correct Solution:
```
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
import thr... | output | 1 | 55,737 | 22 | 111,475 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart into solving it one last time.
You are given ... | instruction | 0 | 55,738 | 22 | 111,476 |
Tags: constructive algorithms, math, ternary search
Correct Solution:
```
n, m, p = map(int, input().split())
arr_1 = list(map(int, input().split()))
arr_2 = list(map(int, input().split()))
for i in range(n):
if arr_1[i] % p != 0:
d1 = i
break
for j in range(m):
if arr_2[j] % p != 0:
d2 ... | output | 1 | 55,738 | 22 | 111,477 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart into solving it one last time.
You are given ... | instruction | 0 | 55,739 | 22 | 111,478 |
Tags: constructive algorithms, math, ternary search
Correct Solution:
```
R = lambda: list(map(int,input().split()))
n,m,p=R()
a,b=R(),R()
i=0
while a[i]%p==0:
i+=1
j=0
while b[j]%p==0:
j+=1
print(i+j)
``` | output | 1 | 55,739 | 22 | 111,479 |
Provide tags and a correct Python 2 solution for this coding contest problem.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart into solving it one last time.
You are given ... | instruction | 0 | 55,740 | 22 | 111,480 |
Tags: constructive algorithms, math, ternary search
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
raw_input = stdin.readline
pr = stdout.write
def in_num():
return int(raw_input())
def in_arr():
return map(in... | output | 1 | 55,740 | 22 | 111,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart... | instruction | 0 | 55,741 | 22 | 111,482 |
Yes | output | 1 | 55,741 | 22 | 111,483 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart... | instruction | 0 | 55,742 | 22 | 111,484 |
Yes | output | 1 | 55,742 | 22 | 111,485 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart... | instruction | 0 | 55,743 | 22 | 111,486 |
Yes | output | 1 | 55,743 | 22 | 111,487 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart... | instruction | 0 | 55,744 | 22 | 111,488 |
Yes | output | 1 | 55,744 | 22 | 111,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart... | instruction | 0 | 55,745 | 22 | 111,490 |
No | output | 1 | 55,745 | 22 | 111,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart... | instruction | 0 | 55,746 | 22 | 111,492 |
No | output | 1 | 55,746 | 22 | 111,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart... | instruction | 0 | 55,747 | 22 | 111,494 |
No | output | 1 | 55,747 | 22 | 111,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is Professor R's last class of his teaching career. Every time Professor R taught a class, he gave a special problem for the students to solve. You being his favourite student, put your heart... | instruction | 0 | 55,748 | 22 | 111,496 |
No | output | 1 | 55,748 | 22 | 111,497 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.
Here, the number of tim... | instruction | 0 | 56,291 | 22 | 112,582 |
"Correct Solution:
```
N = int(input())
bi_N = bin(N)
tmp = len(bi_N)-3
print(2**tmp)
``` | output | 1 | 56,291 | 22 | 112,583 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.
Here, the number of tim... | instruction | 0 | 56,292 | 22 | 112,584 |
"Correct Solution:
```
from math import log2
print(2**int(log2(int(input()))))
``` | output | 1 | 56,292 | 22 | 112,585 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.
Here, the number of tim... | instruction | 0 | 56,293 | 22 | 112,586 |
"Correct Solution:
```
import math
print(2**math.floor(math.log2(int(input()))))
``` | output | 1 | 56,293 | 22 | 112,587 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.
Here, the number of tim... | instruction | 0 | 56,294 | 22 | 112,588 |
"Correct Solution:
```
N=int(input())
i=0
while pow(2, i+1)<=N:
i+=1
print(pow(2, i))
``` | output | 1 | 56,294 | 22 | 112,589 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.
Here, the number of tim... | instruction | 0 | 56,295 | 22 | 112,590 |
"Correct Solution:
```
N=int(input())
n=0
while N>=2**n:
n+=1
print(2**(n-1))
``` | output | 1 | 56,295 | 22 | 112,591 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.
Here, the number of tim... | instruction | 0 | 56,296 | 22 | 112,592 |
"Correct Solution:
```
n = int(input())
i = 1
while i<=n:
i = i*2
print(int(i/2))
``` | output | 1 | 56,296 | 22 | 112,593 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.
Here, the number of tim... | instruction | 0 | 56,297 | 22 | 112,594 |
"Correct Solution:
```
n = int(input())
p = 1
while p*2<=n:
p = p*2
print(p)
``` | output | 1 | 56,297 | 22 | 112,595 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.
Here, the number of tim... | instruction | 0 | 56,298 | 22 | 112,596 |
"Correct Solution:
```
n = int(input())
import math
i = int(math.log2(n))
print(2**i)
``` | output | 1 | 56,298 | 22 | 112,597 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times.... | instruction | 0 | 56,299 | 22 | 112,598 |
Yes | output | 1 | 56,299 | 22 | 112,599 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times.... | instruction | 0 | 56,300 | 22 | 112,600 |
Yes | output | 1 | 56,300 | 22 | 112,601 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times.... | instruction | 0 | 56,301 | 22 | 112,602 |
Yes | output | 1 | 56,301 | 22 | 112,603 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times.... | instruction | 0 | 56,302 | 22 | 112,604 |
Yes | output | 1 | 56,302 | 22 | 112,605 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times.... | instruction | 0 | 56,303 | 22 | 112,606 |
No | output | 1 | 56,303 | 22 | 112,607 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times.... | instruction | 0 | 56,304 | 22 | 112,608 |
No | output | 1 | 56,304 | 22 | 112,609 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times.... | instruction | 0 | 56,305 | 22 | 112,610 |
No | output | 1 | 56,305 | 22 | 112,611 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi loves numbers divisible by 2.
You are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times.... | instruction | 0 | 56,306 | 22 | 112,612 |
No | output | 1 | 56,306 | 22 | 112,613 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Of course, many of you can calculate Ο(n) β the number of positive integers that are less than or equal to n, that are coprime with n. But what if we need to calculate Ο(Ο(...Ο(n))), where funct... | instruction | 0 | 56,687 | 22 | 113,374 |
No | output | 1 | 56,687 | 22 | 113,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Of course, many of you can calculate Ο(n) β the number of positive integers that are less than or equal to n, that are coprime with n. But what if we need to calculate Ο(Ο(...Ο(n))), where funct... | instruction | 0 | 56,688 | 22 | 113,376 |
No | output | 1 | 56,688 | 22 | 113,377 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Johnny has recently learned about set theory. Now he is studying binary relations. You've probably heard the term "equivalence relation". These relations are very important in many areas of mathematics. For example, the equality of th... | instruction | 0 | 56,727 | 22 | 113,454 |
Tags: combinatorics, dp, math
Correct Solution:
```
mod = 10 ** 9 + 7
n = int(input())
a = [[0] * (n + 1) for i in range(n + 1)]
a[0][0] = 1
for i in range(1, n + 1):
a[i][0] = a[i - 1][i - 1]
for j in range(1, i + 1):
a[i][j] = (a[i][j - 1] + a[i - 1][j - 1]) % mod
print(a[n][n - 1])
``` | output | 1 | 56,727 | 22 | 113,455 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Johnny has recently learned about set theory. Now he is studying binary relations. You've probably heard the term "equivalence relation". These relations are very important in many areas of mathematics. For example, the equality of th... | instruction | 0 | 56,728 | 22 | 113,456 |
Tags: combinatorics, dp, math
Correct Solution:
```
from math import factorial
cat = [1, 1]
p = 10**9 + 7
n = int(input())
ans = 0
fac = [1]
mat = [[0 for i in range(n + 1)] for j in range(n + 1)]
mat[0][0] = 1
for i in range(1, n + 1):
mat[i][0] = mat[i - 1][i - 1]
for j in range(i):
mat[i][j + 1] = ... | output | 1 | 56,728 | 22 | 113,457 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Johnny has recently learned about set theory. Now he is studying binary relations. You've probably heard the term "equivalence relation". These relations are very important in many areas of mathematics. For example, the equality of th... | instruction | 0 | 56,729 | 22 | 113,458 |
Tags: combinatorics, dp, math
Correct Solution:
```
def main():
mod = 10 ** 9 + 7
n = int(input())
a = [[0] * (n + 1) for i in range(n + 1)]
a[0][0] = 1
for i in range(1, n + 1):
a[i][0] = a[i - 1][i - 1]
for j in range(1, i + 1):
a[i][j] = (a[i][j - 1] + a[i - 1][j - 1])... | output | 1 | 56,729 | 22 | 113,459 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.