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
64	Unknown Language Round 1	FINISHED	False	9000	478101623	Feb. 21, 2011, 4 p.m.

Problems

Solved	Index	Name	Type	Tags	Community Tag	Rating
( 1053 )	B	Expression	PROGRAMMING	*special expression parsing		1500

Add tag

You are given a line « n#m », where « n » and « m » are digits, and « # » is a sign « + » or « - ». Print the value of the given expression. The only given line has a string in form « n#m », where « n » and « m » are digits (from 0 to 9), and « # » is a sign « + » or « - ». Print the value of the given expression.

Tutorials

Submissions

Submission Id	Author(s)	Index	Submitted	Verdict	Language	Test Set	Tests Passed	Time taken (ms)	Memory Consumed (bytes)	Tags	Rating
9572262	iKID.Triet	B	Jan. 27, 2015, 1:24 p.m.	OK	Tcl	TESTS	15	30	0		1500
8024637	szh123	B	Sept. 29, 2014, 12:17 p.m.	OK	Tcl	TESTS	15	30	0		1500
7682144	structure	B	Sept. 4, 2014, 1:17 p.m.	OK	Tcl	TESTS	15	30	0		1500
5460515	hetong007	B	Dec. 18, 2013, 12:20 p.m.	OK	Tcl	TESTS	15	30	0		1500
4326786	aladdin3	B	Aug. 22, 2013, 10:10 p.m.	OK	Tcl	TESTS	15	30	0		1500
787444	wisterik	B	Oct. 20, 2011, 7:38 p.m.	OK	Tcl	TESTS	15	30	2355200		1500
656250	Archon.JK	B	Sept. 2, 2011, 4:44 p.m.	OK	Tcl	TESTS	15	30	2355200		1500
614340	Dunaril	B	Aug. 18, 2011, 1:03 p.m.	OK	Tcl	TESTS	15	30	2355200		1500
587983	kphmd	B	Aug. 6, 2011, 11:52 a.m.	OK	Tcl	TESTS	15	30	2355200		1500
568890	KirarinSnow	B	July 29, 2011, 12:23 a.m.	OK	Tcl	TESTS	15	30	2355200		1500

remove filters

Back to search problems