Submission #2552760

Source Code Expand

$n=<>;
for(<>){
	($v,$w)=split$";
	$w<$v&&(($w,$v)=($v,$w)),$w=($w+$n-2)/$n|0while$n>1&&$v-$w;
	print$v,$/
}

Submission Info

Submission Time
Task B - Evergrowing Tree
User kotatsugame
Language Perl (v5.18.2)
Score 0
Code Size 113 Byte
Status TLE
Exec Time 2104 ms
Memory 16256 KB

Compile Error

./Main.pl syntax OK

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 2
AC × 17
TLE × 3
Set Name Test Cases
Sample a01, a02
All a01, a02, b03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20
Case Name Status Exec Time Memory
a01 AC 2 ms 384 KB
a02 AC 2 ms 384 KB
b03 AC 2 ms 384 KB
b04 AC 258 ms 15360 KB
b05 AC 134 ms 16256 KB
b06 TLE 2104 ms 15360 KB
b07 TLE 2104 ms 15360 KB
b08 AC 135 ms 16128 KB
b09 TLE 2104 ms 15360 KB
b10 AC 1934 ms 15360 KB
b11 AC 1682 ms 15360 KB
b12 AC 1200 ms 15360 KB
b13 AC 1007 ms 15360 KB
b14 AC 509 ms 15360 KB
b15 AC 475 ms 15360 KB
b16 AC 353 ms 15360 KB
b17 AC 366 ms 15360 KB
b18 AC 373 ms 15360 KB
b19 AC 355 ms 15360 KB
b20 AC 268 ms 15360 KB