Unknown Language Round 4

Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.

ContestId
Name
Phase
Frozen
Duration (Seconds)
Relative Time
Start Time
130 Unknown Language Round 4 FINISHED False 10800 454604423 Nov. 20, 2011, 3 p.m.

Problems

Solved
Index
Name
Type
Tags
Community Tag
Rating
( 926 ) H Balanced brackets PROGRAMMING *special 1900

A sequence of brackets is called balanced if one can turn it into a valid math expression by adding characters «+ » and «1 ». For example, sequences «(())() », «() » and «(()(())) » are balanced, while «)( », «(() » and «(()))( » are not. You are given a string which consists of opening and closing round brackets. Check whether it is a balanced bracket sequence. The only line of input contains a string between 1 and 100 characters long, inclusive. Each character in the string will be «( » or «) ». Output «YES » if the bracket sequence is balanced, and «NO » otherwise (quotes for clarity only).

Tutorials

Unknown Language Round #4: editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
3630679 Phoenyx H April 25, 2013, 7:30 p.m. OK Befunge TESTS 45 140 0 1900
3789294 SuprDewd H May 28, 2013, 9:42 p.m. OK Befunge TESTS 45 156 0 1900
3669380 Omelianenko H May 4, 2013, 1:44 p.m. OK Befunge TESTS 45 156 0 1900
3064959 hariprasath H Feb. 2, 2013, 5:05 p.m. OK Befunge TESTS 45 156 0 1900
3005560 romanychda H Jan. 24, 2013, 10:43 p.m. OK Befunge TESTS 45 156 0 1900
882332 osa_k H Nov. 20, 2011, 5:02 p.m. OK Befunge TESTS 45 160 4300800 1900
1380973 alexey.enkov H March 19, 2012, 9:27 p.m. OK Befunge TESTS 45 170 4096000 1900
950225 obag H Dec. 10, 2011, 4:29 p.m. OK Befunge TESTS 45 170 4300800 1900
886442 lenny H Nov. 22, 2011, 7:28 p.m. OK Befunge TESTS 45 170 4300800 1900
886105 yeputons H Nov. 20, 2011, 4:18 p.m. OK Befunge TESTS 45 170 4300800 1900

remove filters

Back to search problems