sandipon biswas's repositories

1012---Area-beecrowd.com-

1012 - Area beecrowd.com

Stargazers:2Issues:0Issues:0
Language:JavaScriptStargazers:2Issues:0Issues:0

Banknotes-ATM-Machine-Output-Note

In this problem you have to read an integer value and calculate the smallest possible number of banknotes in which the value may be decomposed. The possible banknotes are 100, 50, 20, 10, 5, 2 e 1. Print the read value and the list of banknotes.

Stargazers:2Issues:0Issues:0

beecrowd-1079-Weighted-Averages

beecrowd | 1079 Weighted Averages Adapted by Neilor Tonin, URI Brazil Timelimit: 1

Stargazers:2Issues:0Issues:0
Language:JavaScriptStargazers:2Issues:0Issues:0
Language:JavaScriptStargazers:2Issues:0Issues:0
Language:JavaScriptStargazers:2Issues:0Issues:0
Language:C++Stargazers:2Issues:0Issues:0

Distance-Between-Two-Points-Adapted-by-Neilor-Tonin-URI-Brazil-Timelimit-1

Distance Between Two Points Adapted by Neilor Tonin, URI Brazil Timelimit: 1

Stargazers:2Issues:0Issues:0
Language:JavaScriptStargazers:2Issues:0Issues:0
Language:PythonStargazers:2Issues:0Issues:0
Language:JavaScriptStargazers:2Issues:0Issues:0
Language:JavaScriptStargazers:2Issues:0Issues:0
Language:JavaScriptStargazers:2Issues:0Issues:0
Language:HTMLStargazers:2Issues:0Issues:0
Language:JavaScriptStargazers:2Issues:0Issues:0

Server-set-up-basic-code

Server-set-up-basic-code

Language:JavaScriptStargazers:2Issues:0Issues:0
Language:JavaScriptStargazers:2Issues:0Issues:0
Language:JavaScriptStargazers:2Issues:0Issues:0
Stargazers:2Issues:0Issues:0
Language:JavaScriptStargazers:2Issues:0Issues:0
Language:JavaScriptStargazers:1Issues:0Issues:0
Language:JavaScriptStargazers:1Issues:0Issues:0
Language:JavaStargazers:0Issues:0Issues:0
Language:PythonStargazers:0Issues:0Issues:0