All submissions for this problem are available.
Build-And-Go company is doing project in Sri Lanka to people by making cabel car tracks between large trees. Each large tree is indexed from 1 to N. Company will make M cables between different trees. They hired you to develop hybrid mobile application using Nativescript which returns possibility of travelling for given start tree number and destination tree number. Now you need to implement the basic alogorithm to add into the mobile application.
Input: 5 2 3 4 2 4 2 1 2 2 3 Output: NO YES
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, CLOJ, COB, FS|
Fetching successful submissions