root
/
public
mirror of https://github.com/01-edu/public.git
14
27
Fork 0
Code Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
4211 Commits
91 Branches
11 Tags
349 MiB
 
 
 
 
 
 
Tree: b260bda961
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'b260bda961'
${ noResults }
public/subjects/descendcomb
Tiago Collot c2d0c4f0c1
style(descendcomb): add second # to the title 		2 years ago
..
README.md style(descendcomb): add second # to the title 2 years ago

README.md

descendcomb

Instructions

Write a function that prints in descending order and on a single line all possible combinations of two different two-digit numbers.

These combinations are separated by a comma and a space.

Expected function

func DescendComb() {

}

Usage

Here is a possible program to test your function:

package main

import "piscine"

func main() {
	piscine.DescendComb()
}

This is the incomplete output:

$ go run . | cat -e
99 98, 99 97, 99 96, 99 95, 99 94, ..., 03 01, 03 00, 02 01, 02 00, 01 00$