{"nl": {"description": "Lenny is playing a game on a 3\u2009\u00d7\u20093 grid of lights. In the beginning of the game all lights are switched on. Pressing any of the lights will toggle it and all side-adjacent lights. The goal of the game is to switch all the lights off. We consider the toggling as follows: if the light was switched on then it will be switched off, if it was switched off then it will be switched on.Lenny has spent some time playing with the grid and by now he has pressed each light a certain number of times. Given the number of times each light is pressed, you have to print the current state of each light.", "input_spec": "The input consists of three rows. Each row contains three integers each between 0 to 100 inclusive. The j-th number in the i-th row is the number of times the j-th light of the i-th row of the grid is pressed.", "output_spec": "Print three lines, each containing three characters. The j-th character of the i-th line is \"1\" if and only if the corresponding light is switched on, otherwise it's \"0\".", "sample_inputs": ["1 0 0\n0 0 0\n0 0 1", "1 0 1\n8 8 8\n2 0 3"], "sample_outputs": ["001\n010\n100", "010\n011\n100"], "notes": null}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e, $f) = explode(\" \", trim(fgets(STDIN)));\nlist($g, $h, $i) = explode(\" \", trim(fgets(STDIN)));\n$j = 1;\n$k = 1;\n$l = 1;\n\n$m = 1;\n$n = 1;\n$o = 1;\n\n$p = 1;\n$r = 1;\n$s = 1;\nif(($a % 2) != 0)\n{\n    if($j == 1)\n    {\n        $j = 0;\n    }\n    else\n    {\n        $j = 1;\n    }\n    if($k == 1)\n    {\n        $k = 0;\n    }\n    else\n    {\n        $k = 1;\n    }\n    if($m == 1)\n    {\n        $m = 0;\n    }\n    else\n    {\n        $m = 1;\n    }\n}\n\nif(($b % 2) != 0)\n{\n    if($j == 1)\n    {\n        $j = 0;\n    }\n    else\n    {\n        $j = 1;\n    }\n    if($k == 1)\n    {\n        $k = 0;\n    }\n    else\n    {\n        $k = 1;\n    }\n    if($l == 1)\n    {\n        $l = 0;\n    }\n    else\n    {\n        $l = 1;\n    }\n    if($n == 1)\n    {\n        $n = 0;\n    }\n    else\n    {\n        $n = 1;\n    }\n}\n\nif(($c % 2) != 0)\n{\n    if($k == 1)\n    {\n        $k = 0;\n    }\n    else\n    {\n        $k = 1;\n    }\n    if($l == 1)\n    {\n        $l = 0;\n    }\n    else\n    {\n        $l = 1;\n    }\n    if($o == 1)\n    {\n        $o = 0;\n    }\n    else\n    {\n        $o = 1;\n    }\n}\n\nif(($d % 2) != 0)\n{\n    if($j == 1)\n    {\n        $j = 0;\n    }\n    else\n    {\n        $j = 1;\n    }\n    if($n == 1)\n    {\n        $n = 0;\n    }\n    else\n    {\n        $n = 1;\n    }\n    if($m == 1)\n    {\n        $m = 0;\n    }\n    else\n    {\n        $m = 1;\n    }\n    if($p == 1)\n    {\n        $p = 0;\n    }\n    else\n    {\n        $p = 1;\n    }\n}\n\nif(($e % 2) != 0)\n{\n    if($k == 1)\n    {\n        $k = 0;\n    }\n    else\n    {\n        $k = 1;\n    }\n    if($m == 1)\n    {\n        $m = 0;\n    }\n    else\n    {\n        $m = 1;\n    }\n    if($n == 1)\n    {\n        $n = 0;\n    }\n    else\n    {\n        $n = 1;\n    }\n    if($o == 1)\n    {\n        $o = 0;\n    }\n    else\n    {\n        $o = 1;\n    }\n    if($r == 1)\n    {\n        $r = 0;\n    }\n    else\n    {\n        $r = 1;\n    }\n}\n\nif(($f % 2) != 0)\n{\n    if($l == 1)\n    {\n        $l = 0;\n    }\n    else\n    {\n        $l = 1;\n    }\n    if($n == 1)\n    {\n        $n = 0;\n    }\n    else\n    {\n        $n = 1;\n    }\n    if($o == 1)\n    {\n        $o = 0;\n    }\n    else\n    {\n        $o = 1;\n    }\n    if($s == 1)\n    {\n        $s = 0;\n    }\n    else\n    {\n        $s = 1;\n    }\n}\n\nif(($g % 2) != 0)\n{\n    if($m == 1)\n    {\n        $m = 0;\n    }\n    else\n    {\n        $m = 1;\n    }\n    if($p == 1)\n    {\n        $p = 0;\n    }\n    else\n    {\n        $p = 1;\n    }\n    if($r == 1)\n    {\n        $r = 0;\n    }\n    else\n    {\n        $r = 1;\n    }\n}\n\nif(($h % 2) != 0)\n{\n    if($n == 1)\n    {\n        $n = 0;\n    }\n    else\n    {\n        $n = 1;\n    }\n    if($p == 1)\n    {\n        $p = 0;\n    }\n    else\n    {\n        $p = 1;\n    }\n    if($r == 1)\n    {\n        $r = 0;\n    }\n    else\n    {\n        $r = 1;\n    }\n    if($s == 1)\n    {\n        $s = 0;\n    }\n    else\n    {\n        $s = 1;\n    }\n}\n\nif(($i % 2) != 0)\n{\n    if($o == 1)\n    {\n        $o = 0;\n    }\n    else\n    {\n        $o = 1;\n    }\n    if($r == 1)\n    {\n        $r = 0;\n    }\n    else\n    {\n        $r = 1;\n    }\n    if($s == 1)\n    {\n        $s = 0;\n    }\n    else\n    {\n        $s = 1;\n    }\n}\nprint $j . $k . $l . \"\\n\";\nprint $m . $n . $o . \"\\n\";\nprint $p . $r . $s;\n?>"}, {"source_code": "<?php\n    $arr = array(\n            explode(' ', trim(fgets(STDIN))),\n            explode(' ', trim(fgets(STDIN))),\n            explode(' ', trim(fgets(STDIN)))\n        );\n    \n    for ($i=0; $i<3; $i++)\n    {\n        for ($j=0; $j<3; $j++)\n        {\n            $z = (1 + $arr[$i][$j] + \n                    (isset($arr[$i-1][$j])?$arr[$i-1][$j]:0) +\n                    (isset($arr[$i+1][$j])?$arr[$i+1][$j]:0) +\n                    (isset($arr[$i][$j-1])?$arr[$i][$j-1]:0) +\n                    (isset($arr[$i][$j+1])?$arr[$i][$j+1]:0)\n                ) % 2;\n            echo $z;\n        }\n        echo \"\\n\";\n    }\n        \n    \n    \n?>\n"}, {"source_code": "<?php\n\n$a = array(\n\texplode(\" \" , trim(fgets(STDIN))),\n\texplode(\" \" , trim(fgets(STDIN))),\n\texplode(\" \" , trim(fgets(STDIN)))\n);\nfor($i=0;$i<3;$i++) {\n\tfor($j=0;$j<3;$j++) {\n\t\t$t = ( 1 + $a[$i][$j]\n\t\t\t+ (isset($a[$i+1][$j])?$a[$i+1][$j]:0)\t\n\t\t\t+ (isset($a[$i-1][$j])?$a[$i-1][$j]:0)\n\t\t\t+ (isset($a[$i][$j+1])?$a[$i][$j+1]:0)\n\t\t\t+ (isset($a[$i][$j-1])?$a[$i][$j-1]:0)\n\t\t) % 2;\n\t\techo $t;\n\t}\n\techo \"\\n\";\n}\n\n?>"}, {"source_code": "<?PHP\n$a = explode(' ',trim(fgets(STDIN)));\n $b = explode(' ',trim(fgets(STDIN)));\n  $c = explode(' ',trim(fgets(STDIN)));\n$mass = array(\narray($a[0],$a[1],$a[2]),\narray($b[0],$b[1],$b[2]),\narray($c[0],$c[1],$c[2]),\n);\n$s = array(\narray(1,1,1),\narray(1,1,1),\narray(1,1,1),\n);\n$t=0;\nif($mass[0][0]%2 != 0 ) {$s[0][1] = 0; $s[0][0] = 0; $s[1][0] = 0; }\nif($mass[0][1]%2 != 0 ) \n{ \nif($s[0][1] == 0) $s[0][1] = 1; else $s[0][1] = 0;\nif($s[0][0] == 0) $s[0][0] = 1; else $s[0][0] = 0;\nif($s[1][1] == 0) $s[1][1] = 1; else $s[1][1] = 0;\nif($s[0][2] == 0) $s[0][2] = 1; else $s[0][2] = 0;\n}\nif($mass[0][2]%2 != 0) \n{ \nif($s[0][2] == 0) $s[0][2] = 1; else $s[0][2] = 0;\nif($s[0][1] == 0) $s[0][1] = 1; else $s[0][1] = 0;\nif($s[1][2] == 0) $s[1][2] = 1; else $s[1][2] = 0;\n}\nif($mass[1][0]%2 != 0) \n{\nif($s[1][0] == 0) $s[1][0] = 1; else $s[1][0] = 0;\nif($s[0][0] == 0) $s[0][0] = 1; else $s[0][0] = 0;\nif($s[1][1] == 0) $s[1][1] = 1; else $s[1][1] = 0;\nif($s[2][0] == 0) $s[2][0] = 1; else $s[2][0] = 0;\n}\nif($mass[1][1]%2 != 0) \n{\nif($s[1][1] == 0) $s[1][1] = 1; else $s[1][1] = 0; \nif($s[0][1] == 0) $s[0][1] = 1; else $s[0][1] = 0;\nif($s[1][0] == 0) $s[1][0] = 1; else $s[1][0] = 0;\nif($s[1][2] == 0) $s[1][2] = 1; else $s[1][2] = 0;\nif($s[2][1] == 0) $s[2][1] = 1; else $s[2][1] = 0;\n}\nif($mass[1][2]%2 != 0) \n{ \nif($s[1][2] == 0) $s[1][2] = 1; else $s[1][2] = 0;\nif($s[0][2] == 0) $s[0][2] = 1; else $s[0][2] = 0;\nif($s[1][1] == 0) $s[1][1] = 1; else $s[1][1] = 0;\nif($s[2][2] == 0) $s[2][2] = 1; else $s[2][2] = 0;\n}\nif($mass[2][0]%2 != 0) \n{\nif($s[2][0] == 0) $s[2][0] = 1; else $s[2][0] = 0;\nif($s[1][0] == 0) $s[1][0] = 1; else $s[1][0] = 0;\nif($s[2][1] == 0) $s[2][1] = 1; else $s[2][1] = 0;\n}\nif($mass[2][1]%2 != 0) \n{\nif($s[2][1] == 0) $s[2][1] = 1; else $s[2][1] = 0;\nif($s[1][1] == 0) $s[1][1] = 1; else $s[1][1] = 0;\nif($s[2][0] == 0) $s[2][0] = 1; else $s[2][0] = 0;\nif($s[2][2] == 0) $s[2][2] = 1; else $s[2][2] = 0;\n}\nif($mass[2][2]%2 != 0) \n{\nif($s[2][2] == 0) $s[2][2] = 1; else $s[2][2] = 0;\nif($s[1][2] == 0) $s[1][2] = 1; else $s[1][2] = 0;\nif($s[2][1] == 0) $s[2][1] = 1; else $s[2][1] = 0;\n}\n\nfor($i=0;$i<=2;$i++)\n{\n    for($j=0;$j<=2;$j++)\n    {\n      echo $s[$i][$j];\n    }\n    printf(\"\\n\");\n}"}], "negative_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e, $f) = explode(\" \", trim(fgets(STDIN)));\nlist($g, $h, $i) = explode(\" \", trim(fgets(STDIN)));\n$j = 1;\n$k = 1;\n$l = 1;\n\n$m = 1;\n$n = 1;\n$o = 1;\n\n$p = 1;\n$r = 1;\n$s = 1;\nif(($a % 2) != 0)\n{\n    if($j == 1)\n    {\n        $j = 0;\n    }\n    else\n    {\n        $j = 1;\n    }\n    if($k == 1)\n    {\n        $k = 0;\n    }\n    else\n    {\n        $k = 1;\n    }\n    if($m == 1)\n    {\n        $m = 0;\n    }\n    else\n    {\n        $m = 1;\n    }\n}\n\nif(($b % 2) != 0)\n{\n    if($j == 1)\n    {\n        $j = 0;\n    }\n    else\n    {\n        $j = 1;\n    }\n    if($k == 1)\n    {\n        $k = 0;\n    }\n    else\n    {\n        $k = 1;\n    }\n    if($l == 1)\n    {\n        $l = 0;\n    }\n    else\n    {\n        $l = 1;\n    }\n    if($n == 1)\n    {\n        $n = 0;\n    }\n    else\n    {\n        $n = 1;\n    }\n}\n\nif(($c % 2) != 0)\n{\n    if($k == 1)\n    {\n        $k = 0;\n    }\n    else\n    {\n        $k = 1;\n    }\n    if($l == 1)\n    {\n        $l = 0;\n    }\n    else\n    {\n        $l = 1;\n    }\n    if($o == 1)\n    {\n        $o = 0;\n    }\n    else\n    {\n        $o = 1;\n    }\n}\n\nif(($d % 2) != 0)\n{\n    if($j == 1)\n    {\n        $j = 0;\n    }\n    else\n    {\n        $j = 1;\n    }\n    if($n == 1)\n    {\n        $n = 0;\n    }\n    else\n    {\n        $n = 1;\n    }\n    if($m == 1)\n    {\n        $m = 0;\n    }\n    else\n    {\n        $m = 1;\n    }\n    if($p == 1)\n    {\n        $p = 0;\n    }\n    else\n    {\n        $p = 1;\n    }\n}\n\nif(($e % 2) != 0)\n{\n    if($k == 1)\n    {\n        $k = 0;\n    }\n    else\n    {\n        $k = 1;\n    }\n    if($m == 1)\n    {\n        $m = 0;\n    }\n    else\n    {\n        $m = 1;\n    }\n    if($n == 1)\n    {\n        $n = 0;\n    }\n    else\n    {\n        $n = 1;\n    }\n    if($o == 1)\n    {\n        $o = 0;\n    }\n    else\n    {\n        $o = 1;\n    }\n    if($r == 1)\n    {\n        $r = 0;\n    }\n    else\n    {\n        $r = 1;\n    }\n}\n\nif(($f % 2) != 0)\n{\n    if($l == 1)\n    {\n        $l = 0;\n    }\n    else\n    {\n        $l = 1;\n    }\n    if($n == 1)\n    {\n        $n = 0;\n    }\n    else\n    {\n        $n = 1;\n    }\n    if($o == 1)\n    {\n        $o = 0;\n    }\n    else\n    {\n        $o = 1;\n    }\n    if($s == 1)\n    {\n        $s = 0;\n    }\n    else\n    {\n        $s = 1;\n    }\n}\n\nif(($g % 2) != 0)\n{\n    if($m == 1)\n    {\n        $m = 0;\n    }\n    else\n    {\n        $m = 1;\n    }\n    if($p == 1)\n    {\n        $p = 0;\n    }\n    else\n    {\n        $p = 1;\n    }\n    if($r == 1)\n    {\n        $r = 0;\n    }\n    else\n    {\n        $r = 1;\n    }\n}\n\nif(($h % 2) != 0)\n{\n    if($n == 1)\n    {\n        $n = 0;\n    }\n    else\n    {\n        $n = 1;\n    }\n    if($p == 1)\n    {\n        $p = 0;\n    }\n    else\n    {\n        $p = 1;\n    }\n    if($r == 1)\n    {\n        $r = 0;\n    }\n    else\n    {\n        $r = 1;\n    }\n    if($s == 1)\n    {\n        $s = 0;\n    }\n    else\n    {\n        $s = 1;\n    }\n}\n\nif(($i % 2) != 0)\n{\n    if($o == 1)\n    {\n        $o = 0;\n    }\n    else\n    {\n        $o = 1;\n    }\n    if($r == 1)\n    {\n        $r = 0;\n    }\n    else\n    {\n        $r = 1;\n    }\n    if($s == 1)\n    {\n        $s = 0;\n    }\n    else\n    {\n        $s = 1;\n    }\n}\nprint $j . \" \" . $k . \" \" . $l . \"\\n\";\nprint $m . \" \" . $n . \" \" . $o . \"\\n\";\nprint $p . \" \" . $r . \" \" . $s\n?>"}, {"source_code": "<?php\n\n$a = array(\n\texplode(\" \" , trim(fgets(STDIN))),\n\texplode(\" \" , trim(fgets(STDIN))),\n\texplode(\" \" , trim(fgets(STDIN)))\n);\nfor($i=0;$i<3;$i++) {\n\tfor($j=0;$j<3;$j++) {\n\t\t$t = ( $a[$i][$j]\n\t\t\t+ (isset($a[$i+1][$j])?$a[$i+1][$j]:0)\t\n\t\t\t+ (isset($a[$i-1][$j])?$a[$i-1][$j]:0)\n\t\t\t+ (isset($a[$i][$j+1])?$a[$i][$j+1]:0)\n\t\t\t+ (isset($a[$i][$j-1])?$a[$i][$j-1]:0)\n\t\t) % 2;\n\t\techo $t;\n\t}\n\techo \"\\n\";\n}\n\n?>"}], "src_uid": "b045abf40c75bb66a80fd6148ecc5bd6"}
{"nl": {"description": "Petya is a big fan of mathematics, especially its part related to fractions. Recently he learned that a fraction  is called proper iff its numerator is smaller than its denominator (a\u2009&lt;\u2009b) and that the fraction is called irreducible if its numerator and its denominator are coprime (they do not have positive common divisors except 1).During his free time, Petya thinks about proper irreducible fractions and converts them to decimals using the calculator. One day he mistakenly pressed addition button (\u2009+\u2009) instead of division button (\u00f7) and got sum of numerator and denominator that was equal to n instead of the expected decimal notation. Petya wanted to restore the original fraction, but soon he realized that it might not be done uniquely. That's why he decided to determine maximum possible proper irreducible fraction  such that sum of its numerator and denominator equals n. Help Petya deal with this problem. ", "input_spec": "In the only line of input there is an integer n (3\u2009\u2264\u2009n\u2009\u2264\u20091000), the sum of numerator and denominator of the fraction.", "output_spec": "Output two space-separated positive integers a and b, numerator and denominator of the maximum possible proper irreducible fraction satisfying the given sum.", "sample_inputs": ["3", "4", "12"], "sample_outputs": ["1 2", "1 3", "5 7"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = array();\nfor($x = 2; $x <= 1000; $x++)\n{\n     $c = 0;\n     for($y = 2; $y <= sqrt($x); $y++)\n     {\n          if($x % $y == 0)\n          {\n               $c = 1;\n               break;\n          }\n     }\n     if($c == 0)\n     {\n          $b[count($b)] = $x;\n     }\n}\n$d = floor($a / 2);\n$e = ceil($a / 2);\nif($d == $e)\n{\n     $d--;\n     $e++;\n}\nwhile(TRUE)\n{\n     $f = array();\n     $g = 0;\n     $h = $d;\n     while(TRUE)\n     {\n          if($b[$g] > $h)\n          {\n               break;\n          }\n          else\n          {\n               $i = $h % $b[$g];\n               if($i == 0)\n               {\n                    $f[count($f)] = $b[$g];\n                    $h /= $b[$g];\n               }\n               else\n               {\n                    $g++;\n               }\n          }\n     }\n     $j = array();\n     $k = 0;\n     $l = $e;\n     while(TRUE)\n     {\n          if($b[$k] > $l)\n          {\n               break;\n          }\n          else\n          {\n               $m = $l % $b[$k];\n               if($m == 0)\n               {\n                    $j[count($j)] = $b[$k];\n                    $l /= $b[$k];\n               }\n               else\n               {\n                    $k++;\n               }\n          }\n     }\n     $n = array_intersect($f, $j);\n     if(count($n) == 0)\n     {\n          break;\n     }\n     else\n     {\n          $d--;\n          $e++;\n     }\n}\nprint $d . \" \" . $e;\n?>"}, {"source_code": "<?php\n\nfunction gcd($a, $b) {\n    while ($a <> 0 && $b <> 0) {\n        if ($a > $b)\n            $a = $a % $b;\n        else\n            $b = $b % $a;\n    }\n    return abs($a + $b);\n}\n\n$input = rtrim(fgets(STDIN));\n$raw = explode(' ', $input);\n\n$n = (int)$raw[0];\n\nfor ($i = (int)($n / 2); $i > 0; $i--) {\n    $a = $i;\n    $b = $n - $i;\n\n    if ($a >= $b) {\n        continue;\n    }\n\n    $gcd = gcd($a, $b);\n\n    if ($gcd == 1) {\n        echo $a . ' ' . $b . PHP_EOL;\n        die;\n    }\n}"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = floor($a / 2);\n$c = ceil($a / 2);\nif($b == $c)\n{\n     $b--;\n     $c++;\n}\n$d = array(\"2\" => TRUE, \"3\" => TRUE, \"5\" => TRUE, \"7\" => TRUE, \"11\" => TRUE, \"13\" => TRUE, \"17\" => TRUE, \"19\" => TRUE, \"23\" => TRUE, \"29\" => TRUE, \"31\" => TRUE, \"37\" => TRUE, \"41\" => TRUE, \"43\" => TRUE, \"47\" => TRUE, \"53\" => TRUE, \"59\" => TRUE, \"61\" => TRUE, \"67\" => TRUE, \"71\" => TRUE, \"73\" => TRUE, \"79\" => TRUE, \"83\" => TRUE, \"89\" => TRUE, \"97\" => TRUE, \"101\" => TRUE, \"103\" => TRUE, \"107\" => TRUE, \"109\" => TRUE, \"113\" => TRUE, \"127\" => TRUE, \"131\" => TRUE, \"137\" => TRUE, \"139\" => TRUE, \"149\" => TRUE, \"151\" => TRUE, \"157\" => TRUE, \"163\" => TRUE, \"167\" => TRUE, \"173\" => TRUE, \"179\" => TRUE, \"181\" => TRUE, \"191\" => TRUE, \"193\" => TRUE, \"197\" => TRUE, \"199\" => TRUE, \"211\" => TRUE, \"223\" => TRUE, \"227\" => TRUE, \"229\" => TRUE, \"233\" => TRUE, \"239\" => TRUE, \"241\" => TRUE, \"251\" => TRUE, \"257\" => TRUE, \"263\" => TRUE, \"269\" => TRUE, \"271\" => TRUE, \"277\" => TRUE, \"281\" => TRUE, \"283\" => TRUE, \"293\" => TRUE, \"307\" => TRUE, \"311\" => TRUE, \"313\" => TRUE, \"317\" => TRUE, \"331\" => TRUE, \"337\" => TRUE, \"347\" => TRUE, \"349\" => TRUE, \"533\" => TRUE, \"359\" => TRUE, \"367\" => TRUE, \"373\" => TRUE, \"379\" => TRUE, \"383\" => TRUE, \"389\" => TRUE, \"397\" => TRUE, \"401\" => TRUE, \"409\" => TRUE, \"419\" => TRUE, \"421\" => TRUE, \"431\" => TRUE, \"433\" => TRUE, \"439\" => TRUE, \"443\" => TRUE, \"449\" => TRUE, \"457\" => TRUE, \"461\" => TRUE, \"463\" => TRUE, \"467\" => TRUE, \"479\" => TRUE, \"487\" => TRUE, \"491\" => TRUE, \"499\" => TRUE, \"503\" => TRUE, \"509\" => TRUE, \"521\" => TRUE, \"523\" => TRUE, \"541\" => TRUE, \"547\" => TRUE, \"557\" => TRUE, \"563\" => TRUE, \"569\" => TRUE, \"571\" => TRUE, \"577\" => TRUE, \"587\" => TRUE, \"593\" => TRUE, \"599\" => TRUE, \"601\" => TRUE, \"607\" => TRUE, \"613\" => TRUE, \"617\" => TRUE, \"619\" => TRUE, \"631\" => TRUE, \"641\" => TRUE, \"643\" => TRUE, \"647\" => TRUE, \"653\" => TRUE, \"659\" => TRUE, \"661\" => TRUE, \"673\" => TRUE, \"677\" => TRUE, \"683\" => TRUE, \"691\" => TRUE, \"701\" => TRUE, \"709\" => TRUE, \"719\" => TRUE, \"727\" => TRUE, \"733\" => TRUE, \"739\" => TRUE, \"743\" => TRUE, \"751\" => TRUE, \"757\" => TRUE, \"761\" => TRUE, \"769\" => TRUE, \"773\" => TRUE, \"787\" => TRUE, \"797\" => TRUE, \"809\" => TRUE, \"811\" => TRUE, \"821\" => TRUE, \"823\" => TRUE, \"827\" => TRUE, \"829\" => TRUE, \"839\" => TRUE, \"853\" => TRUE, \"857\" => TRUE, \"859\" => TRUE, \"863\" => TRUE, \"877\" => TRUE, \"881\" => TRUE, \"883\" => TRUE, \"887\" => TRUE, \"907\" => TRUE, \"911\" => TRUE, \"919\" => TRUE, \"929\" => TRUE, \"937\" => TRUE, \"941\" => TRUE, \"947\" => TRUE, \"953\" => TRUE, \"967\" => TRUE, \"971\" => TRUE, \"977\" => TRUE, \"983\" => TRUE, \"991\" => TRUE, \"997\" => TRUE);\nwhile(TRUE)\n{\n     if(($b == TRUE) && ($c == TRUE))\n     {\n          break;\n     }\n     else\n     {\n          $b--;\n          $c++;\n     }\n}\nprint $b . \" \" . $c;\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = floor($a / 2);\n$c = ceil($a / 2);\nwhile(TRUE)\n{\n     $d = 0;\n     $e = 0;\n     if($b == 1)\n     {\n          break;\n     }\n     for($x = 2; $x <= sqrt($b); $x++)\n     {\n          if($b % $x == 1)\n          {\n               $d = 1;\n               break;\n          }\n     }\n     for($x = 2; $x <= sqrt($c); $x++)\n     {\n          if($c % $x == 1)\n          {\n               $e = 1;\n               break;\n          }\n     }\n     if(($d == 1) && ($e == 1) && ($b != $c))\n     {\n          break;\n     }\n     else\n     {\n          $b--;\n          $c++;\n     }\n}\nprint $b . \" \" . $c;\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = floor($a / 2);\n$c = ceil($a / 2);\nwhile(TRUE)\n{\n     $d = 0;\n     $e = 0;\n     if($b == 1)\n     {\n          break;\n     }\n     for($x = 2; $x <= sqrt($b); $x++)\n     {\n          if($b % $x == 1)\n          {\n               $d = 1;\n               break;\n          }\n     }\n     for($x = 2; $x <= sqrt($c); $x++)\n     {\n          if($c % $x == 1)\n          {\n               $e = 1;\n               break;\n          }\n     }\n     if(($d == 1) && ($e == 1))\n     {\n          break;\n     }\n     else\n     {\n          $b--;\n          $c++;\n     }\n}\nprint $b . \" \" . $c;\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = floor($a / 2);\n$c = ceil($a / 2);\nif($b == $c)\n{\n     $b--;\n     $c++;\n}\nwhile(TRUE)\n{\n     $d = $c % $b;\n     if(($d != 0) || ($b == 1))\n     {\n          print $b . \" \" . $c;\n          break;\n     }\n     else\n     {\n          $b--;\n          $c++;\n     }\n}\n?>"}], "src_uid": "0af3515ed98d9d01ce00546333e98e77"}
{"nl": {"description": "Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.Embosser is a special devise that allows to \"print\" the text of a plastic tape. Text is printed sequentially, character by character. The device consists of a wheel with a lowercase English letters written in a circle, static pointer to the current letter and a button that print the chosen letter. At one move it's allowed to rotate the alphabetic wheel one step clockwise or counterclockwise. Initially, static pointer points to letter 'a'. Other letters are located as shown on the picture:  After Grigoriy add new item to the base he has to print its name on the plastic tape and attach it to the corresponding exhibit. It's not required to return the wheel to its initial position with pointer on the letter 'a'.Our hero is afraid that some exhibits may become alive and start to attack him, so he wants to print the names as fast as possible. Help him, for the given string find the minimum number of rotations of the wheel required to print it.", "input_spec": "The only line of input contains the name of some exhibit\u00a0\u2014 the non-empty string consisting of no more than 100 characters. It's guaranteed that the string consists of only lowercase English letters.", "output_spec": "Print one integer\u00a0\u2014 the minimum number of rotations of the wheel, required to print the name given in the input.", "sample_inputs": ["zeus", "map", "ares"], "sample_outputs": ["18", "35", "34"], "notes": "Note\u00a0  To print the string from the first sample it would be optimal to perform the following sequence of rotations:   from 'a' to 'z' (1 rotation counterclockwise),  from 'z' to 'e' (5 clockwise rotations),  from 'e' to 'u' (10 rotations counterclockwise),  from 'u' to 's' (2 counterclockwise rotations).  In total, 1\u2009+\u20095\u2009+\u200910\u2009+\u20092\u2009=\u200918 rotations are required."}, "positive_code": [{"source_code": "<?php\n\ndefine(\"CHARACTER_LIST\", ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']);\n\n$word = trim(fgets(STDIN));\n\n$wordLetters = str_split($word);\n\n$prevPosition = 0;\n$steps = 0;\nforeach ($wordLetters as $letter) {\n  $letterNumber = array_search($letter, CHARACTER_LIST);\n\n  $stepsCount = abs($letterNumber - $prevPosition);\n\n  if ($stepsCount >= 13) {\n    $actualStepsCount = count(CHARACTER_LIST) - $stepsCount;\n    $steps += $actualStepsCount;\n\n    $prevPosition = $letterNumber;\n  } else {\n    $actualStepsCount = $stepsCount;\n    $steps += $actualStepsCount;\n\n    $prevPosition = $letterNumber;\n  }\n}\n\necho $steps;\n"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = array(\"a\" => 0, \"b\" => 1, \"c\" => 2, \"d\" => 3, \"e\" => 4, \"f\" => 5, \"g\" => 6, \"h\" => 7, \"i\" => 8, \"j\" => 9, \"k\" => 10, \"l\" => 11, \"m\" => 12, \"n\" => 13, \"o\" => 14, \"p\" => 15, \"q\" => 16, \"r\" => 17, \"s\" => 18, \"t\" => 19, \"u\" => 20, \"v\" => 21, \"w\" => 22, \"x\" => 23, \"y\" => 24, \"z\" => 25);\n$c = 0;\n$d = 0;\nfor($x = 0; $x < strlen($a); $x++)\n{\n     $e = $b[$a[$x]];\n     $f = abs($e - $d);\n     $g = abs(26 - $f);\n     $c += min($f, $g);\n     $d = $e;\n}\nprint $c;\n?>"}, {"source_code": "<?php\n\n\t$string = readline(\"\");\n\t$result = 0;\n\n\t$stringArr = str_split($string);\n\t$len = count($stringArr);\n\t$pointer = ord(\"a\");\n\tforeach($stringArr as $ch) {\n\t\t$ch = ord($ch);\n\t\t$diff = abs($ch - $pointer);\n\t\tif($diff < 13) {\n\t\t\t$result += $diff;\n\t\t} else {\n\t\t\t$result += (26 - $diff);\n\t\t}\n\t\t$pointer = $ch;\n\t}\n\techo $result;\n?>"}, {"source_code": "<?php\n\n//=====================================\n// link: https://codeforces.com/contest/731/problem/A\n//=====================================\n\n// get inputs\n$string = trim(fgets(STDIN));\n\n// solution\n$alpha   = array_flip(range('a', 'z'));\n$travel  = 0;\n$pointer = 0;\n\nfor ($i = 0; $i < strlen($string); $i++) {\n    $clockwise = abs($pointer - $alpha[$string[$i]]);\n\n    $counterclockwise = 26 - $clockwise;\n\n    $travel += min($clockwise, $counterclockwise);\n\n    $pointer = $alpha[$string[$i]];\n}\n\necho \"$travel\\n\";\n"}, {"source_code": "<?php\n\n//=====================================\n// link: https://codeforces.com/contest/731/problem/A\n//=====================================\n\n// get inputs\n$string = trim(fgets(STDIN));\n\n// solution\n$alpha   = array_flip(range('a', 'z'));\n$travel  = 0;\n$pointer = 0;\n\nfor ($i = 0; $i < strlen($string); $i++) {\n    $clockwise = abs($pointer - $alpha[$string[$i]]);\n\n    $counterclockwise = 26 - abs($pointer - $alpha[$string[$i]]);\n\n    $travel += min($clockwise, $counterclockwise);\n\n    $pointer = $alpha[$string[$i]];\n}\n\necho \"$travel\\n\";\n"}, {"source_code": "<?php\n\n###### IO ######\nerror_reporting(E_ALL);\nerror_reporting(0);\n\nfunction readString($f) {\n\t$r = array(\n\t\t\"\\r\" => '',\n\t\t\"\\n\" => '',\n\t);\n\treturn strtr(fgets($f), $r);\n}\n\nfunction readNumString($f) {\n\treturn trim(fgets($f));\n}\n\nfunction stringToArray($str) {\n\treturn str_split($str);\n}\n\nfunction readNum($f, $is_int = false) {\n\t$v = readNumString($f);\n\treturn $is_int ? intval($v) : floatval($v);\n}\n\nfunction readStringExplode($f, $delimiter = ' ') {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = 'trim';\n\treturn array_map($callf, $return);\n}\n\nfunction readStringExplodeNum($f, $delimiter = ' ', $is_int = false) {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = $is_int ? 'intval' : 'floatval';\n\treturn array_map($callf, $return);\n}\n\n###### /IO ######\n\nfunction getAnswer($is_test = false, $f = false) {\n\tif ($is_test)\n\t\t$stream = $f;\n\telse\n\t\t$stream = STDIN;\n\t/* begin body */\n\t$aPos = str_split('qzawsxedcrfvtgpbyhnujmiklo');\n\tsort($aPos);\n\t$aPos = implode('', $aPos);\n\t$totalLen = strlen($aPos);\n\n\t$inputStr = readString($stream);\n\t$return = 0;\n\twhile (!empty($inputStr)) {\n\t\t$char = $inputStr[0];\n\t\t$pos = strpos($aPos, $char);\n\t\t$left = $totalLen - $pos;\n\t\tif ($pos < $left) {\n\t\t\t$return+=$pos;\n\t\t} else {\n\t\t\t$return+=$left;\n\t\t}\n\t\t$aPos = substr($aPos, $pos) . substr($aPos, 0, $pos);\n\n\t\t$inputStr = substr($inputStr, 1);\n\t}\n\techo $return;\n\t/* / end body */\n}\n\nif (empty($is_test))\n\tgetAnswer();"}, {"source_code": "<?php\n# Alireza\n# JAHANI\n# PH_PY_LA\n# Dont Repeat Your self ...\n\n$input = str_split(trim(fgets(STDIN)));\n$alpha = range('a','z');\n$alpha = array_flip($alpha);\n$s = 0 ;\n\nfor ($i=0;$i<count($input)-1;$i++) {\n      $a = abs($alpha[$input[$i]] - $alpha[$input[$i+1]]);\n      $b =26 - $a ;  \n      $s += min($a,$b);    \n}\n$a = abs($alpha[$input[0]] - $alpha['a']);\n$b =26 - $a ;  \necho $s+min($a,$b);"}, {"source_code": "<?php\n$str=trim(fgets(STDIN));\n$alpha='abcdefghijklmnopqrstuvwxyz';\n$split=str_split($alpha,1);\n//$revAlpha=strrev($alpha);\n\n$concate='a'.$str;\n//echo \"$concate\";\n$count=0;\nfor($i=0;$i<strlen($concate)-1;$i++)\n{\n\t$keyDistance=abs(ord($concate[$i])-ord($concate[$i+1]));\n\t//echo \"$keyDistance\\n\";\n\tif($keyDistance>13)\n   {\n   \t     $k1[$i]=array_keys($split,$concate[$i]);\n   \t    // print_r($k1);\n   \t     //$key1=$k1[$i];\n   \t    //\n   \t     $k2[$i]=array_keys($split,$concate[$i+1]);\n   \t    //print_r($k2);\n   \t     //$key2=$k2[$i];\n   \t     if($k1[$i]>$k2[$i]){\n\n   \t       $temp[$i]=$k1[$i];\n   \t       $k1[$i]=$k2[$i];\n   \t       $k2[$i]=$temp[$i];\n\n   \t   }\n\n   \t    \n   \t     \n   $count+=($k1[$i][0]+26)-$k2[$i][0];\n   //echo \"plus=$count\\n\";\n   }\n   else\n   {\n   \t   \t  $k1[$i]=array_keys($split,$concate[$i]);\n   \t     //$key1=$k1[$i];\n   \t    //\n   \t     $k2[$i]=array_keys($split,$concate[$i+1]);\n   \t     //$key2=$k2[$i];\n\n   \t     \n         $count+=abs($k1[$i][0]-$k2[$i][0]);\n   //echo \"minus=$count\\n\";\n\n   }\n   //print_r($k1);\n  // print_r($k2);\n\n}\necho \"$count\";\n\n//print_r($keyDistance);"}, {"source_code": "<?php\n$line = trim(fgets(STDIN));\nfunction dis($a,$b){\n    if($a == $b) return 0;\n    if(ord($a)> ord($b)){\n        $tmp = $a;\n        $a = $b;\n        $b = $tmp;\n    }\n    $i = abs(intval(ord($a) - ord($b)));\n    $j = abs(intval(ord($a) - ord('a'))) + abs(intval(ord('z')) - ord($b)) + 1;\n//    echo \"a: $a  b: $b\" . PHP_EOL;\n//    echo \"i: $i  j: $j \" . PHP_EOL;\n    return min($i,$j);\n}\n$current = 'a';\n$sum = 0;\nforeach(str_split($line) as $c){\n    $sum += dis($c,$current);\n    $current = $c;\n}\necho $sum . PHP_EOL;"}, {"source_code": "<?php\n\n$stdout = fopen(getenv(\"OUTPUT_PATH\"), \"w\");\n$stdin = fopen(\"php://stdin\", \"r\");\n\nfscanf($stdin, \"%s\", $s );\n\n$count = 0 ;\n$temp = \"a\" ;\n\nfor( $i=0 ; $i<strlen($s) ; $i++ )\n{\n\n     if( abs( ord($s[$i]) - ord($temp)) <= abs( 26 - abs( ord($s[$i]) - ord($temp)) ) )\n     {\n          $count += abs( ord($s[$i]) - ord($temp)) ;\n     }\n     else\n     {\n          $count += abs( 26 - abs( ord($s[$i]) - ord($temp)) ) ;\n     }\n     $temp = $s[$i] ;\n}\necho $count ;\n\nfwrite($stdout);\n\nfclose($stdin);\nfclose($stdout);\n\n?>"}, {"source_code": "<?php\n\n$alphabet = [ 1 => 'a', 2 => 'b', 3 => 'c', 4 => 'd', 5 => 'e',\n    6 => 'f', 7 => 'g', 8 => 'h', 9 => 'i', 10 => 'j',\n    11 => 'k', 12 => 'l', 13 => 'm', 14 => 'n', 15 => 'o',\n    16 => 'p', 17 => 'q', 18 => 'r', 19 => 's', 20 => 't',\n    21 => 'u', 22 => 'v', 23 => 'w', 24 => 'x', 25 => 'y',\n    26 => 'z'];\n$stdin = fopen('php://stdin', 'r');\n\n$string = trim(fgets($stdin));\n$pos = 1;\n$count = 0;\nfor ($i = 0; $i < strlen($string); $i++) {\n    $newPos = array_search($string[$i], $alphabet);\n    if ($newPos > $pos) {\n        if ($newPos - $pos > 13) {\n\n            $count+= $pos + (26 - $newPos);\n        }\n        if ($newPos - $pos < 13) {\n\n            $count+= $newPos - $pos;\n        }\n        if ($newPos - $pos == 13) {\n            $count+=13;\n        }\n        $pos = $newPos;\n    }\n    if ($newPos < $pos) {\n        if ($pos - $newPos < 13) {\n            $count += $pos - $newPos;\n        }\n        if ($pos - $newPos > 13) {\n            $count+= $newPos + (26 - $pos);\n        }\n        if ($pos - $newPos == 13) {\n            $count+=13;\n        }\n        $pos = $newPos;\n    }\n}\necho $count;\n"}, {"source_code": "<?php\n\t$a = trim(fgets(STDIN));\n\t$b = array(\"a\" => 0, \"b\" => 1, \"c\" => 2, \"d\" => 3, \"e\" => 4, \"f\" => 5, \"g\" => 6, \"h\" => 7, \"i\" => 8, \"j\" => 9, \"k\" => 10, \"l\" => 11, \"m\" => 12, \"n\" => 13, \"o\" => 14, \"p\" => 15, \"q\" => 16, \"r\" => 17, \"s\" => 18, \"t\" => 19, \"u\" => 20, \"v\" => 21, \"w\" => 22, \"x\" => 23, \"y\" => 24, \"z\" => 25);\n\t$ans = 0;\n\t$d = 0;\n\tfor($x = 0; $x < strlen($a); $x++)\n\t{\n\t\t$e = $b[$a[$x]];\n\t\t$f = abs($e - $d);\n\t\t$g = 26 - $f;\n\t\t$ans += min($f, $g);\n\t\t$d = $e;\n\t}\n\tprint $ans;\n?>"}], "negative_code": [{"source_code": "<?php\n\ndefine(\"CHARACTER_LIST\", ['a', 'b', 'c', 'd', 'f', 'e', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']);\n\n$word = trim(fgets(STDIN));\n\n$wordLetters = str_split($word);\n\n$prevPosition = 0;\n$steps = 0;\nforeach ($wordLetters as $letter) {\n  $letterNumber = array_search($letter, CHARACTER_LIST);\n\n  $stepsCount = abs($letterNumber - $prevPosition);\n\n  if ($stepsCount >= 13) {\n    $actualStepsCount = count(CHARACTER_LIST) - $stepsCount;\n    $steps += $actualStepsCount;\n\n    $prevPosition = $letterNumber;\n  } else {\n    $actualStepsCount = $stepsCount;\n    $steps += $actualStepsCount;\n\n    $prevPosition = $letterNumber;\n  }\n}\n\necho $steps;\n"}, {"source_code": "<?php\n\ndefine(\"CHARACTER_LIST\", ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']);\n\n// $word = trim(fgets(STDIN));\n\n$word = \"zeus\";\n\n$wordLetters = str_split($word);\n\n$prevPosition = 0;\n$steps = 0;\nforeach ($wordLetters as $letter) {\n  $letterNumber = array_search($letter, CHARACTER_LIST);\n\n  $stepsCount = abs($letterNumber - $prevPosition);\n\n  if ($stepsCount >= 13) {\n    $actualStepsCount = count(CHARACTER_LIST) - $stepsCount;\n    $steps += $actualStepsCount;\n\n    $prevPosition = $letterNumber;\n  } else {\n    $actualStepsCount = $stepsCount;\n    $steps += $actualStepsCount;\n\n    $prevPosition = $letterNumber;\n  }\n}\n\necho $steps;\n"}, {"source_code": "<?php\n$line = trim(fgets(STDIN));\nfunction dis($a,$b){\n    if(ord($a)> ord($b)){\n        $tmp = $a;\n        $a = $b;\n        $b = $tmp;\n    }\n    $i = abs(intval(ord($a) - ord($b)));\n    $j = abs(intval(ord($a) - ord('a'))) + abs(intval(ord('z')) - ord($b));\n//    echo \"a: $a  b: $b\" . PHP_EOL;\n//    echo \"i: $i  j: $j \" . PHP_EOL;\n    return min($i,$j);\n}\n$current = 'a';\n$sum = 0;\nforeach(str_split($line) as $c){\n    $sum += dis($c,$current);\n    $current = $c;\n}\necho $sum . PHP_EOL;\nexit;"}, {"source_code": "<?php\n\n$alphabet = [ 1 => 'a', 2 => 'b', 3 => 'c', 4 => 'd', 5 => 'e',\n    6 => 'f', 7 => 'g', 8 => 'h', 9 => 'i', 10 => 'j',\n    11 => 'k', 12 => 'l', 13 => 'm', 14 => 'n', 15 => 'o',\n    16 => 'p', 17 => 'q', 18 => 'r', 19 => 's', 20 => 't',\n    21 => 'u', 22 => 'v', 23 => 'w', 24 => 'x', 25 => 'y',\n    26 => 'z'];\n$string = trim($_POST['data']);\n$pos = 1;\n$count = 0;\nfor ($i = 0; $i < strlen($string); $i++) {\n    $newPos = array_search($string[$i], $alphabet);\n    if ($newPos > $pos) {\n        if ($newPos - $pos > 13) {\n\n            $count+= $pos + (26 - $newPos);\n        }\n        if ($newPos - $pos < 13) {\n\n            $count+= $newPos - $pos;\n        }\n        if ($newPos - $pos == 13) {\n            $count+=13;\n        }\n        $pos = $newPos;\n    }\n    if ($newPos < $pos) {\n        if ($pos - $newPos < 13) {\n            $count += $pos - $newPos;\n        }\n        if ($pos - $newPos > 13) {\n            $count+= $newPos + (26 - $pos);\n        }\n        if ($pos - $newPos == 13) {\n            $count+=13;\n        }\n        $pos = $newPos;\n    }\n}\necho $count;\n"}, {"source_code": "<?php\n\n$alphabet = [ 1 => 'a', 2 => 'b', 3 => 'c', 4 => 'd', 5 => 'e',\n    6 => 'f', 7 => 'g', 8 => 'h', 9 => 'i', 10 => 'j',\n    11 => 'k', 12 => 'l', 13 => 'm', 14 => 'n', 15 => 'o',\n    16 => 'p', 17 => 'q', 18 => 'r', 19 => 's', 20 => 't',\n    21 => 'u', 22 => 'v', 23 => 'w', 24 => 'x', 25 => 'y',\n    26 => 'z'];\n$stdin = fopen('php://stdin', 'r');\n$string = trim(fgets($stdin));\n$pos = 1;\n$count = 0;\nfor ($i = 0; $i < strlen($string); $i++) {\n    $newPos = array_search($string[$i], $alphabet);\n    if ($newPos > $pos) {\n        if ($newPos - $pos > 13) {\n\n            $count+= $pos + (26 - $newPos);\n        }\n        if ($newPos - $pos < 13) {\n\n            $count+= $newPos - $pos;\n        }\n        if ($newPos - $pos == 13) {\n            $count+=13;\n        }\n        $pos = $newPos;\n    }\n    if ($newPos < $pos) {\n        if ($pos - $newPos < 13) {\n            $count += $pos - $newPos;\n        }\n        if ($pos - $newPos > 13) {\n            $count+= $newPos + (26 - $pos);\n        }\n        if ($newPos - $pos == 13) {\n            $count+=13;\n        }\n        $pos = $newPos;\n        $count;\n    }\n}\necho $count;\n"}], "src_uid": "ecc890b3bdb9456441a2a265c60722dd"}
{"nl": {"description": "Bizon the Champion isn't just a bison. He also is a favorite of the \"Bizons\" team.At a competition the \"Bizons\" got the following problem: \"You are given two distinct words (strings of English letters), s and t. You need to transform word s into word t\". The task looked simple to the guys because they know the suffix data structures well. Bizon Senior loves suffix automaton. By applying it once to a string, he can remove from this string any single character. Bizon Middle knows suffix array well. By applying it once to a string, he can swap any two characters of this string. The guys do not know anything about the suffix tree, but it can help them do much more. Bizon the Champion wonders whether the \"Bizons\" can solve the problem. Perhaps, the solution do not require both data structures. Find out whether the guys can solve the problem and if they can, how do they do it? Can they solve it either only with use of suffix automaton or only with use of suffix array or they need both structures? Note that any structure may be used an unlimited number of times, the structures may be used in any order.", "input_spec": "The first line contains a non-empty word s. The second line contains a non-empty word t. Words s and t are different. Each word consists only of lowercase English letters. Each word contains at most 100 letters.", "output_spec": "In the single line print the answer to the problem. Print \"need tree\" (without the quotes) if word s cannot be transformed into word t even with use of both suffix array and suffix automaton. Print \"automaton\" (without the quotes) if you need only the suffix automaton to solve the problem. Print \"array\" (without the quotes) if you need only the suffix array to solve the problem. Print \"both\" (without the quotes), if you need both data structures to solve the problem. It's guaranteed that if you can solve the problem only with use of suffix array, then it is impossible to solve it only with use of suffix automaton. This is also true for suffix automaton.", "sample_inputs": ["automaton\ntomat", "array\narary", "both\nhot", "need\ntree"], "sample_outputs": ["automaton", "array", "both", "need tree"], "notes": "NoteIn the third sample you can act like that: first transform \"both\" into \"oth\" by removing the first character using the suffix automaton and then make two swaps of the string using the suffix array and get \"hot\"."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = str_split($a);\n$d = str_split($b);\n$e = 0;\nfor($x = 0; $x < count($d); $x++)\n{\n    for($y = 0; $y < count($c); $y++)\n    {\n        if($d[$x] == $c[$y])\n        {\n            $e++;\n            $c[$y] = \"0\";\n            break;\n        }\n    }\n}\n$f = 0;\n$h = array();\nfor($x = 0; $x < strlen($b); $x++)\n{\n    $g = strpos($a, $d[$x], $f);\n    array_push($h, $g);\n    $g++;\n    $f = $g;\n}\n$i = 0;\nfor($x = 0; $x < count($h) - 1; $x++)\n{\n    if($h[$x] > $h[$x + 1])\n    {\n        $i = 1;\n    }\n}\nif($e != count($d))\n{\n    print \"need tree\";\n}\nelseif(($e == count($d)) && ($e != count($c)) && ($i != 0))\n{\n    print \"both\";\n}\nelseif(($e == count($d)) && ($i != 0))\n{\n    print \"array\";\n}\nelseif(($e == count($d)) && ($i == 0))\n{\n    print \"automaton\";\n}\n?>"}, {"source_code": "<?php\n\n$f = fopen('php://stdin', 'r');\n//$f = fopen('test.txt', 'r');\n//$a = explode(\" \",trim(fgets($f)));\n\n$s = trim(fgets($f));\n$t = trim(fgets($f));\n\n$automat = false;\n$array = false;\n\n$r = str_split($t);\n$pattern = '/.*'.implode('.*',$r).'.*/U';\n\n//echo $pattern;\n\n$result = preg_match($pattern,$s,$match);\n\nif (isset($match[0])){\n    echo (\"automaton\");\n    exit;\n}\n\n\n$s = str_split($s);\nsort($s);\n$s = implode('',$s);\n\n$t = str_split($t);\nsort($t);\n$t = implode('',$t);\n\n//var_dump($s,$t);\n\n$r = str_split($t);\n$pattern = '/.*'.implode('.*',$r).'.*/U';\n$result = preg_match($pattern,$s,$match);\n\n//var_dump($match);\n\nif (isset($match[0])){\n    if ($t==$s){\n        echo \"array\";\n    } else {\n        echo \"both\";\n    }\n    exit;\n}\necho \"need tree\";\n\n\n\n\n\n\n\n"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = str_split($a);\n$d = str_split($b);\n$e = 0;\nfor($x = 0; $x < count($d); $x++)\n{\n    for($y = 0; $y < count($c); $y++)\n    {\n        if($d[$x] == $c[$y])\n        {\n            $e++;\n            $c[$y] = \"0\";\n            break;\n        }\n    }\n}\n$f = 0;\n$h = array();\nfor($x = 0; $x < strlen($b); $x++)\n{\n    $g = strpos($a, $d[$x], $f);\n    array_push($h, $g);\n    $f = $g;\n}\n$i = 0;\nfor($x = 0; $x < count($h) - 1; $x++)\n{\n    if($h[$x] > $h[$x + 1])\n    {\n        $i = 1;\n    }\n}\nif($e != count($d))\n{\n    print \"need tree\";\n}\nelseif(($e == count($d)) && ($e != count($c)) && ($i != 0))\n{\n    print \"both\";\n}\nelseif(($e == count($d)) && ($i != 0))\n{\n    print \"array\";\n}\nelseif(($e == count($d)) && ($i == 0))\n{\n    print \"automaton\";\n}\n?>"}, {"source_code": "<?php\n\n$f = fopen('php://stdin', 'r');\n//$f = fopen('test.txt', 'r');\n//$a = explode(\" \",trim(fgets($f)));\n\n$s = trim(fgets($f));\n$t = trim(fgets($f));\n\n$automat = false;\n$array = false;\n\n$r = str_split($t);\n$pattern = '/.*'.implode('.*',$r).'.*/';\n$result = preg_match($pattern,$s,$match);\n\nif (isset($match[0])){\n    echo (\"automaton\");\n    exit;\n}\n\n\n$s = str_split($s);\nsort($s);\n$s = implode('',$s);\n\n$t = str_split($t);\nsort($t);\n$t = implode('',$t);\n\n//var_dump($s,$t);\n\n$r = str_split($t);\n$pattern = '/.*'.implode('.*',$r).'.*/';\n$result = preg_match($pattern,$s,$match);\n\n//var_dump($match);\n\nif (isset($match[0])){\n    if ($t==$s){\n        echo \"array\";\n    } else {\n        echo \"both\";\n    }\n    exit;\n}\necho \"need tree\";\n\n\n\n\n\n\n\n"}, {"source_code": "<?php\n\n$f = fopen('php://stdin', 'r');\n//$f = fopen('test.txt', 'r');\n//$a = explode(\" \",trim(fgets($f)));\n\n$s = trim(fgets($f));\n$t = trim(fgets($f));\n\n$automat = false;\n$array = false;\n\nif (strpos($s,$t)!==false){\n    echo (\"automaton\");\n    exit;\n}\n\n\n$s = str_split($s);\nsort($s);\n$s = implode('',$s);\n\n$t = str_split($t);\nsort($t);\n$t = implode('',$t);\n\n//var_dump($s,$t);\n\nif (strpos($s,$t)!==false){\n    if ($t==$s){\n        echo \"array\";\n    } else {\n        echo \"both\";\n    }\n    exit;\n} else {\n    echo \"need tree\";\n}\n\n\n\n\n\n\n\n"}, {"source_code": "<?php\n\n$f = fopen('php://stdin', 'r');\n//$f = fopen('test.txt', 'r');\n//$a = explode(\" \",trim(fgets($f)));\n\n$s = trim(fgets($f));\n$t = trim(fgets($f));\n\n$automat = false;\n$array = false;\n\n$r = str_split($t);\n$pattern = '/.*'.implode('.*',$r).'.*/';\n$result = preg_match($pattern,$s,$match);\n\nif (isset($match[0])){\n    echo (\"automaton\");\n    exit;\n}\n\n\n$s = str_split($s);\nsort($s);\n$s = implode('',$s);\n\n$t = str_split($t);\nsort($t);\n$t = implode('',$t);\n\n//var_dump($s,$t);\n\nif (strpos($s,$t)!==false){\n    if ($t==$s){\n        echo \"array\";\n    } else {\n        echo \"both\";\n    }\n    exit;\n} else {\n    echo \"need tree\";\n}\n\n\n\n\n\n\n\n"}], "src_uid": "edb9d51e009a59a340d7d589bb335c14"}
{"nl": {"description": "At the beginning of the school year Berland State University starts two city school programming groups, for beginners and for intermediate coders. The children were tested in order to sort them into groups. According to the results, each student got some score from 1 to m points. We know that c1 schoolchildren got 1 point, c2 children got 2 points, ..., cm children got m points. Now you need to set the passing rate k (integer from 1 to m): all schoolchildren who got less than k points go to the beginner group and those who get at strictly least k points go to the intermediate group. We know that if the size of a group is more than y, then the university won't find a room for them. We also know that if a group has less than x schoolchildren, then it is too small and there's no point in having classes with it. So, you need to split all schoolchildren into two groups so that the size of each group was from x to y, inclusive. Help the university pick the passing rate in a way that meets these requirements.", "input_spec": "The first line contains integer m (2\u2009\u2264\u2009m\u2009\u2264\u2009100). The second line contains m integers c1, c2, ..., cm, separated by single spaces (0\u2009\u2264\u2009ci\u2009\u2264\u2009100). The third line contains two space-separated integers x and y (1\u2009\u2264\u2009x\u2009\u2264\u2009y\u2009\u2264\u200910000). At least one ci is greater than 0.", "output_spec": "If it is impossible to pick a passing rate in a way that makes the size of each resulting groups at least x and at most y, print 0. Otherwise, print an integer from 1 to m \u2014 the passing rate you'd like to suggest. If there are multiple possible answers, print any of them.", "sample_inputs": ["5\n3 4 3 2 1\n6 8", "5\n0 3 3 4 2\n3 10", "2\n2 5\n3 6"], "sample_outputs": ["3", "4", "0"], "notes": "NoteIn the first sample the beginner group has 7 students, the intermediate group has 6 of them. In the second sample another correct answer is 3."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\nlist($c, $d) = explode(\" \", trim(fgets(STDIN)));\n$g = 0;\nfor($x = 1; $x <= $a; $x++)\n{\n    $e = array_sum(array_slice($b, 0, $x));\n    $f = array_sum(array_slice($b, $x));\n    if((($e >= $c) && ($e <= $d)) && (($f >= $c) && ($f <= $d)))\n    {\n        $g = 1;\n        break;\n    }\n}\nif($g == 0)\n{\n    print \"0\";\n}\nelse\n{\n    print $x + 1;\n}\n?>"}, {"source_code": "<?\n$m = trim(fgets(STDIN));\n$c = explode(' ', trim(fgets(STDIN)));\nlist($x,$y)=explode(' ', trim(fgets(STDIN)));\nfor($k=1; $k<=$m; $k++){\n    $b = 0;\n    $a = 0;\n    foreach($c as $key=>$c1){\n        if($k>$key+1){\n            $b += $c1;\n        }else{\n            $a += $c1;\n        }\n    }\n    if($b<$x || $b>$y || $a<$x || $a>$y){\n        continue;\n    }else{\n        print $k;\n        die();\n    }\n}\nprint 0;"}, {"source_code": "<?php\n$in = fopen('php://stdin', \"r\");\n$chs=array();\nfscanf($in, \"%d\", $m);\n$chs = explode(\" \",fgets($in));\nfscanf($in, \"%d %d\", $x, $y);\n$g1=$g2=$k=0;\nforeach($chs as $key => $value){\n    unset($chs[$key]);\n    if($g1+$value<=$y && (array_sum($chs)>=$y||array_sum($chs)>=$x) && $g2==0) $g1+=$value;\n    else {\n        $g2+=$value;\n        if($k==0) $k=$key+1;\n    }\n}\nif(($g1<$x||$g1>$y)||($g2<$x||$g2>$y)) $k=0;\necho $k;\nfclose($in);"}], "negative_code": [{"source_code": "<?php\n$in = fopen('php://stdin', \"r\");\n$chs=array();\nfscanf($in, \"%d\", $m);\n$chs = explode(\" \",fgets($in));\nfscanf($in, \"%d %d\", $x, $y);\n$g1=$g2=$k=0;\nforeach($chs as $key => $value){\n    if($g1<$x) $g1+=$value;\n    else {\n        $g2+=$value;\n        if($k==0) $k=$key+1;\n    }\n}\necho $k;\nfclose($in);"}, {"source_code": "<?php\n$in = fopen('php://stdin', \"r\");\n$chs=array();\nfscanf($in, \"%d\", $m);\n$chs = explode(\" \",fgets($in));\nfscanf($in, \"%d %d\", $x, $y);\n$g1=$g2=$k=0;\nforeach($chs as $key => $value){\n    if($g1+$value<=$y && $g2==0) $g1+=$value;\n    else {\n        $g2+=$value;\n        if($k==0) $k=$key+1;\n    }\n}\nif(($g1<$x||$g1>$y)||($g2<$x||$g2>$y)) $k=0;\necho $k;\nfclose($in);"}, {"source_code": "<?php\n$in = fopen('php://stdin', \"r\");\n$chs=array();\nfscanf($in, \"%d\", $m);\n$chs = explode(\" \",fgets($in));\nfscanf($in, \"%d %d\", $x, $y);\n$g1=$g2=$k=0;\nforeach($chs as $key => $value){\n    if($g1<$x) $g1+=$value;\n    else {\n        $g2+=$value;\n        if($k==0) $k=$key+1;\n    }\n}\nif(($g1<$x||$g1>$y)||($g2<$x||$g2>$y)) $k=0;\necho $k;\nfclose($in);"}], "src_uid": "e595a1d0c0e4bbcc99454d3148b4557b"}
{"nl": {"description": "The main street of Berland is a straight line with n houses built along it (n is an even number). The houses are located at both sides of the street. The houses with odd numbers are at one side of the street and are numbered from 1 to n\u2009-\u20091 in the order from the beginning of the street to the end (in the picture: from left to right). The houses with even numbers are at the other side of the street and are numbered from 2 to n in the order from the end of the street to its beginning (in the picture: from right to left). The corresponding houses with even and odd numbers are strictly opposite each other, that is, house 1 is opposite house n, house 3 is opposite house n\u2009-\u20092, house 5 is opposite house n\u2009-\u20094 and so on.  Vasya needs to get to house number a as quickly as possible. He starts driving from the beginning of the street and drives his car to house a. To get from the beginning of the street to houses number 1 and n, he spends exactly 1 second. He also spends exactly one second to drive the distance between two neighbouring houses. Vasya can park at any side of the road, so the distance between the beginning of the street at the houses that stand opposite one another should be considered the same.Your task is: find the minimum time Vasya needs to reach house a.", "input_spec": "The first line of the input contains two integers, n and a (1\u2009\u2264\u2009a\u2009\u2264\u2009n\u2009\u2264\u2009100\u2009000)\u00a0\u2014 the number of houses on the street and the number of the house that Vasya needs to reach, correspondingly. It is guaranteed that number n is even.", "output_spec": "Print a single integer \u2014 the minimum time Vasya needs to get from the beginning of the street to house a.", "sample_inputs": ["4 2", "8 5"], "sample_outputs": ["2", "3"], "notes": "NoteIn the first sample there are only four houses on the street, two houses at each side. House 2 will be the last at Vasya's right.The second sample corresponds to picture with n\u2009=\u20098. House 5 is the one before last at Vasya's left."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = $b % 2;\n$d = 1;\nif($c == 0)\n{\n     $d += ($a / 2) - ($b / 2);\n}\nelse\n{\n     $b--;\n     $d += ($b / 2);\n}\nprint $d;\n?>"}, {"source_code": "<?php\n\nlist($count, $a) = explode(\" \", fgets(STDIN), 3);\n\nif ($a % 2 == 0) {\n    // \u0447\u0435\u0442\u043d\u0430\u044f \u0441\u0442\u043e\u0440\u043e\u043d\u0430 - \u0443\u0431\u044b\u0432\u0430\u043d\u0438\u0435\n    $time = 1 + $count / 2 - floor($a / 2);\n} else {\n    // \u043d\u0435\u0447\u0435\u0442\u043d\u0430\u044f \u0441\u0442\u043e\u0440\u043e\u043d\u0430 - \u0432\u043e\u0437\u0440\u0430\u0441\u0442\u0430\u043d\u0438\u0435\n    $time = 1 + floor($a / 2);\n}\n\necho $time;"}, {"source_code": "<?php\n$inp = trim(fgets(STDIN));\n\n$inp = explode(\" \", $inp);\n\n$street1[1] = 1;\n$street2[1] = $inp[0];\n\nfor ($i=2; $i <= $inp[0]/2; $i++) {\n  $street1[$i] = $street1[$i-1] + 2;\n  $street2[$i] = $street2[$i-1] - 2;\n}\n\nif (($inp[1] % 2) != 0) {\n  $result = array_search($inp[1], $street1);\n} else {\n  $result = array_search($inp[1], $street2);\n}\n\necho $result;"}, {"source_code": "<?php\nfscanf(STDIN, \"%d %d\", $n, $a);\nif($a%2==1) echo ($a+1)/2;\nelse echo ($n-$a)/2+1;\n?>"}, {"source_code": "<?\n\nlist($n, $a) = explode(' ', fgets(STDIN));\n\nif ($a % 2 === 0) {\n    $a = $n - $a;\n}\n\necho (1 + floor($a / 2));\n"}, {"source_code": "<?\n$stdin = fopen('php://stdin', 'r');\n$a = fgets($stdin);\n$t = explode(\" \", $a);\n$n = trim($t[0]);\n$d = trim($t[1]);\n\nif($d % 2 == 0){\n    $stdout = fopen('php://stdout', 'w');\n    fwrite($stdout, floor(($n - $d) / 2) + 1);\n    fclose($stdout);\n}else{\n    $stdout = fopen('php://stdout', 'w');\n    fwrite($stdout, floor($d / 2) + 1);\n    fclose($stdout);\n}\n\n\n?>"}, {"source_code": "<?php\n\nfunction getnum(&$c = null)\n{\n    for ($c = fgetc(STDIN); false !== strpos(\" \\t\\n\\r\\0\\x0B\", $c);$c = fgetc(STDIN));\n    $result = ''; do { if (!is_numeric($c) && $c !== '.') break; $result .= $c; } while (null !== $c = fgetc(STDIN));\n\n    return (float)$result;\n}\n\n$n = getnum();\n$a = getnum();\n\nif ($a % 2) {\n    echo (++$a / 2) .PHP_EOL;\n    return ;\n}\n\necho (($n - $a) / 2 + 1) . PHP_EOL;\n"}, {"source_code": "<?php\nlist($n,$a) = explode(\" \",trim(fgets(STDIN)));\n$j = $n;\n$step = 1;\nfor($i = 1; $i < $n;){\n    if($a == $j || $a == $i){\n        echo $step;\n    }\n    $i = $i+2;\n    $j = $j-2;\n    $step++;\n}\n?>"}, {"source_code": "<?\nlist($a, $b) = explode(' ', fgets(STDIN));\n$a = (int) $a;\n$b = (int) $b;\n$u = 0;\nif($b % 2 == 0)\n{\n$i = $a;\nwhile($i != 0)\n{\nif($i == $b)\n{\nprint ++$u;\ndie;\n}\n$i--; \n$i--;\n$u++;\n}\n}\nelse\n{\n$i = 1;\nwhile($i != $a)\n{\nif($i == $b)\n{\nprint ++$u;\ndie;\n}\n$i++;\n$i++;\n$u++;\n}\n}"}], "negative_code": [], "src_uid": "aa62dcdc47d0abbba7956284c1561de8"}
{"nl": {"description": "Polycarp and Vasiliy love simple logical games. Today they play a game with infinite chessboard and one pawn for each player. Polycarp and Vasiliy move in turns, Polycarp starts. In each turn Polycarp can move his pawn from cell (x,\u2009y) to (x\u2009-\u20091,\u2009y) or (x,\u2009y\u2009-\u20091). Vasiliy can move his pawn from (x,\u2009y) to one of cells: (x\u2009-\u20091,\u2009y),\u2009(x\u2009-\u20091,\u2009y\u2009-\u20091) and (x,\u2009y\u2009-\u20091). Both players are also allowed to skip move. There are some additional restrictions \u2014 a player is forbidden to move his pawn to a cell with negative x-coordinate or y-coordinate or to the cell containing opponent's pawn The winner is the first person to reach cell (0,\u20090). You are given the starting coordinates of both pawns. Determine who will win if both of them play optimally well.", "input_spec": "The first line contains four integers: xp,\u2009yp,\u2009xv,\u2009yv (0\u2009\u2264\u2009xp,\u2009yp,\u2009xv,\u2009yv\u2009\u2264\u2009105) \u2014 Polycarp's and Vasiliy's starting coordinates. It is guaranteed that in the beginning the pawns are in different cells and none of them is in the cell (0,\u20090).", "output_spec": "Output the name of the winner: \"Polycarp\" or \"Vasiliy\".", "sample_inputs": ["2 1 2 2", "4 7 7 4"], "sample_outputs": ["Polycarp", "Vasiliy"], "notes": "NoteIn the first sample test Polycarp starts in (2,\u20091) and will move to (1,\u20091) in the first turn. No matter what his opponent is doing, in the second turn Polycarp can move to (1,\u20090) and finally to (0,\u20090) in the third turn."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c, $d) = explode(\" \", trim(fgets(STDIN)));\nif($a == 0)\n{\n    if(($d > $c) && ($d >= $b))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d > $c) && ($d < $b))\n    {\n        print \"Vasiliy\";\n    }\n    elseif(($d <= $c) && ($c >= $b))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d <= $c) && ($c < $b))\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif($b == 0)\n{\n    if(($d > $c) && ($d >= $a))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d > $c) && ($d < $a))\n    {\n        print \"Vasiliy\";\n    }\n    elseif(($d <= $c) && ($c >= $a))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d <= $c) && ($c < $a))\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif($c == 0)\n{\n    if(($a + $b) <= $d)\n    {\n        print \"Polycarp\";\n    }\n    else\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif($d == 0)\n{\n    if(($a + $b) <= $c)\n    {\n        print \"Polycarp\";\n    }\n    else\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif(($a <= $c) && ($b <= $d))\n{\n    print \"Polycarp\";\n}\nelseif(($a >= $c) && ($b >= $d))\n{\n    print \"Vasiliy\";\n}\nelse\n{\n    if(($d > $c) && ($d >= $a + $b))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d > $c) && ($d < $a + $b))\n    {\n        print \"Vasiliy\";\n    }\n    elseif(($d <= $c) && ($c >= $a + $b))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d <= $c) && ($c < $a + $b))\n    {\n        print \"Vasiliy\";\n    }\n}\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b, $c, $d) = explode(\" \", trim(fgets(STDIN)));\nif($a == 0)\n{\n    if(($d > $c) && (($c + $d - $c) >= $b))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d > $c) && (($c + $d - $c) < $b))\n    {\n        print \"Vasiliy\";\n    }\n    elseif(($d <= $c) && ($c >= $b))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d <= $c) && ($c < $b))\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif($b == 0)\n{\n    if(($d > $c) && (($c + $d - $c) >= $a))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d > $c) && (($c + $d - $c) < $a))\n    {\n        print \"Vasiliy\";\n    }\n    elseif(($d <= $c) && ($c >= $a))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d <= $c) && ($c < $a))\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif(($a <= $c) && ($b <= $d))\n{\n    print \"Polycarp\";\n}\nelseif(($a >= $c) && ($b >= $d))\n{\n    print \"Vasiliy\";\n}\nelse\n{\n    if(($a + $b) <= $c)\n    {\n        print \"Polycarp\";\n    }\n    else\n    {\n        print \"Vasiliy\";\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c, $d) = explode(\" \", trim(fgets(STDIN)));\nif($a == 0)\n{\n    if(($c + $d - $c) >= $b)\n    {\n        print \"Polycarp\";\n    }\n    else\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif($b == 0)\n{\n    if(($c + $d - $c) >= $a)\n    {\n        print \"Polycarp\";\n    }\n    else\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif(($a <= $c) && ($b <= $d))\n{\n    print \"Polycarp\";\n}\nelseif(($a >= $c) && ($b >= $d))\n{\n    print \"Vasiliy\";\n}\nelse\n{\n    if(($a + $b) <= $c)\n    {\n        print \"Polycarp\";\n    }\n    else\n    {\n        print \"Vasiliy\";\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c, $d) = explode(\" \", trim(fgets(STDIN)));\nif($a == 0)\n{\n    if(($d > $c) && (($c + $d - $c) >= $b))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d > $c) && (($c + $d - $c) < $b))\n    {\n        print \"Vasiliy\";\n    }\n    elseif(($d <= $c) && ($c >= $b))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d <= $c) && ($c < $b))\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif($b == 0)\n{\n    if(($d > $c) && (($c + $d - $c) >= $a))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d > $c) && (($c + $d - $c) < $a))\n    {\n        print \"Vasiliy\";\n    }\n    elseif(($d <= $c) && ($c >= $a))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d <= $c) && ($c < $a))\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif(($a <= $c) && ($b <= $d))\n{\n    print \"Polycarp\";\n}\nelseif(($a >= $c) && ($b >= $d))\n{\n    print \"Vasiliy\";\n}\nelse\n{\n    if(($a + $b) <= ($c + $d - $c))\n    {\n        print \"Polycarp\";\n    }\n    else\n    {\n        print \"Vasiliy\";\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c, $d) = explode(\" \", trim(fgets(STDIN)));\nif($a == 0)\n{\n    if(($d > $c) && ($d >= $b))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d > $c) && ($d < $b))\n    {\n        print \"Vasiliy\";\n    }\n    elseif(($d <= $c) && ($c >= $b))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d <= $c) && ($c < $b))\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif($b == 0)\n{\n    if(($d > $c) && ($d >= $a))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d > $c) && ($d < $a))\n    {\n        print \"Vasiliy\";\n    }\n    elseif(($d <= $c) && ($c >= $a))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d <= $c) && ($c < $a))\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif($c == 0)\n{\n    if(($a + $b) <= $d)\n    {\n        print \"Polycarp\";\n    }\n    else\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif($d == 0)\n{\n    if(($a + $b) <= $c)\n    {\n        print \"Polycarp\";\n    }\n    else\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif(($a <= $c) && ($b <= $d))\n{\n    print \"Polycarp\";\n}\nelseif(($a >= $c) && ($b >= $d))\n{\n    print \"Vasiliy\";\n}\nelse\n{\n    if(($a + $b) <= $c)\n    {\n        print \"Polycarp\";\n    }\n    else\n    {\n        print \"Vasiliy\";\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c, $d) = explode(\" \", trim(fgets(STDIN)));\nif($a == 0)\n{\n    if($c >= $b)\n    {\n        print \"Polycarp\";\n    }\n    else\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif($b == 0)\n{\n    if($c >= $a)\n    {\n        print \"Polycarp\";\n    }\n    else\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif(($a <= $c) && ($b <= $d))\n{\n    print \"Polycarp\";\n}\nelseif(($a >= $c) && ($b >= $d))\n{\n    print \"Vasiliy\";\n}\nelse\n{\n    if(($a + $b) <= $c)\n    {\n        print \"Polycarp\";\n    }\n    else\n    {\n        print \"Vasiliy\";\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c, $d) = explode(\" \", trim(fgets(STDIN)));\nif($a == 0)\n{\n    if(($d > $c) && (($c + $d - $c) >= $b))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d > $c) && (($c + $d - $c) < $b))\n    {\n        print \"Vasiliy\";\n    }\n    elseif(($d < $c) && ($c >= $b))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d < $c) && ($c < $b))\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif($b == 0)\n{\n    if(($d > $c) && (($c + $d - $c) >= $a))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d > $c) && (($c + $d - $c) < $a))\n    {\n        print \"Vasiliy\";\n    }\n    elseif(($d < $c) && ($c >= $a))\n    {\n        print \"Polycarp\";\n    }\n    elseif(($d < $c) && ($c < $a))\n    {\n        print \"Vasiliy\";\n    }\n}\nelseif(($a <= $c) && ($b <= $d))\n{\n    print \"Polycarp\";\n}\nelseif(($a >= $c) && ($b >= $d))\n{\n    print \"Vasiliy\";\n}\nelse\n{\n    if(($a + $b) <= $c)\n    {\n        print \"Polycarp\";\n    }\n    else\n    {\n        print \"Vasiliy\";\n    }\n}\n?>"}], "src_uid": "2637d57f7809ff8f922549c617709074"}
{"nl": {"description": "Today is Wednesday, the third day of the week. What's more interesting is that tomorrow is the last day of the year 2015.Limak is a little polar bear. He enjoyed this year a lot. Now, he is so eager to the coming year 2016.Limak wants to prove how responsible a bear he is. He is going to regularly save candies for the entire year 2016! He considers various saving plans. He can save one candy either on some fixed day of the week or on some fixed day of the month.Limak chose one particular plan. He isn't sure how many candies he will save in the 2016 with his plan. Please, calculate it and tell him.", "input_spec": "The only line of the input is in one of the following two formats:    \"x of week\" where x (1\u2009\u2264\u2009x\u2009\u2264\u20097) denotes the day of the week. The 1-st day is Monday and the 7-th one is Sunday.  \"x of month\" where x (1\u2009\u2264\u2009x\u2009\u2264\u200931) denotes the day of the month. ", "output_spec": "Print one integer\u00a0\u2014 the number of candies Limak will save in the year 2016.", "sample_inputs": ["4 of week", "30 of month"], "sample_outputs": ["52", "11"], "notes": "NotePolar bears use the Gregorian calendar. It is the most common calendar and you likely use it too. You can read about it on Wikipedia if you want to \u2013 https://en.wikipedia.org/wiki/Gregorian_calendar. The week starts with Monday.In the first sample Limak wants to save one candy on each Thursday (the 4-th day of the week). There are 52 Thursdays in the 2016. Thus, he will save 52 candies in total.In the second sample Limak wants to save one candy on the 30-th day of each month. There is the 30-th day in exactly 11 months in the 2016\u00a0\u2014 all months but February. It means that Limak will save 11 candies in total."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nif($c == \"week\")\n{\n    $d = array(\"52\", \"52\", \"52\", \"52\", \"53\", \"53\", \"52\");\n    print $d[$a - 1];\n}\nelse\n{\n    $e = array(\"31\", \"29\", \"31\", \"30\", \"31\", \"30\", \"31\", \"31\", \"30\", \"31\", \"30\", \"31\");\n    $f = 0;\n    for($x = 0; $x < 12; $x++)\n    {\n        if($a <= $e[$x])\n        {\n            $f++;\n        }\n    }\n    print $f;\n}\n?>"}, {"source_code": "<?php\n$str_in = trim(fgets(STDIN));\n$st_in_arr = explode(\" \", $str_in);\n$s = 0;\n$cur_d = 5;\n$n = $st_in_arr[0];\n$word = $st_in_arr[2];\n$m = array(31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31);\nif ($word == \"week\") {\n    for ($i = 1; $i <= 366; $i++) {\n        if ($n == $cur_d) {\n            $s++;\n        }\n        $cur_d++;\n        if ($cur_d > 7) {\n            $cur_d = 1;\n        }\n\n    }\n}\nif ($word == \"month\") {\n    for ($i = 0; $i < 12; $i++) {\n        if ($n <= $m[$i]) {\n            $s++;\n        }\n    }\n}\necho $s;\n?>"}, {"source_code": "<?php\n$str_in = trim(fgets(STDIN));\n$st_in_arr = explode(\" \", $str_in);\n$s = 0;\n$cur_d = 5;\n$n = $st_in_arr[0];\n$word = $st_in_arr[2];\n$m = array(31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31);\nif ($word == \"week\") {\n    for ($i = 1; $i <= 366; $i++) {\n        if ($n == $cur_d) $s++;\n        $cur_d++;\n        if ($cur_d > 7) $cur_d = 1;\n    }\n} else {\n    for ($i = 0; $i < 12; $i++) {\n        if ($n <= $m[$i]) $s++;\n    }\n}\necho $s;\n?>"}, {"source_code": "<?php\nlist($x, $y, $wm) = explode(\" \", trim(fgets(STDIN)));\n$x = (int) $x;\n\nswitch ($wm) {\n\tcase 'week':\n\t\tif ($x == 5 || $x == 6) $n = 53;\n\t\telse $n = 52;\n\t\tbreak;\n\tcase 'month':\n\t\tif ($x == 31) $n = 7;\n\t\telse if ($x == 30) $n = 11; \n\t\telse $n = 12;\n\t\tbreak;\n}\nprint $n;\n?>"}], "negative_code": [{"source_code": "<?php\n$str_in = trim(fgets(STDIN));\n$st_in_arr = explode(\" \", $str_in);\n$s = 0;\n$cur_d = 5;\n$n = $st_in_arr[0];\n$word = $st_in_arr[2];\n$m = array(31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31);\nif ($word == \"week\") {\n    for ($i = 1; $i <= 366; $i++) {\n        if ($n == $cur_d) {\n            $s++;\n            $cur_d++;\n        }\n        if ($cur_d > 7) {\n            $cur_d = 1;\n        }\n\n    }\n}\nif ($word = \"month\") {\n    for ($i = 0; $i < 12; $i++) {\n        if ($n <= $m[$i]) {\n            $s++;\n        }\n    }\n}\necho $s;\n?>"}, {"source_code": "<?php\n$str_in = trim(fgets(STDIN));\n$st_in_arr = explode(\" \", $str_in);\n$s = 0;\n$cur_d = 5;\n$n = $st_in_arr[0];\n$word = $st_in_arr[2];\n$m = array(31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31);\nif ($word == \"week\") {\n    for ($i = 1; $i <= 366; $i++) {\n        if ($n == $cur_d) {\n            $s++;\n            $cur_d++;\n        }\n        if ($cur_d > 7) {\n            $cur_d = 1;\n        }\n\n    }\n}\nif ($word == \"month\") {\n    for ($i = 0; $i < 12; $i++) {\n        if ($n <= $m[$i]) {\n            $s++;\n        }\n    }\n}\necho $s;\n?>"}, {"source_code": "<?php\nlist($x, $y, $wm) = explode(\" \", trim(fgets(STDIN)));\n$x = (int) $x;\n\nswitch ($wm) {\n\tcase 'week':\n\t\tif ($x == 3 || $x ==4) $n = 52;\n\t\telse $n = 53;\n\t\tbreak;\n\tcase 'month':\n\t\tif ($x == 31) $n = 7;\n\t\telse if ($x == 30) $n = 11; \n\t\telse $n = 12;\n\t\tbreak;\n}\nprint $n;\n?>"}, {"source_code": "<?php\nlist($x, $y, $wm) = explode(\" \", trim(fgets(STDIN)));\n$x = (int) $x;\n\nswitch ($wm) {\n\tcase 'week':\n\t\tif ($x == 5 || $x == 6) $n = 53;\n\t\telse $n = 53;\n\t\tbreak;\n\tcase 'month':\n\t\tif ($x == 31) $n = 7;\n\t\telse if ($x == 30) $n = 11; \n\t\telse $n = 12;\n\t\tbreak;\n}\nprint $n;\n?>"}], "src_uid": "9b8543c1ae3666e6c163d268fdbeef6b"}
{"nl": {"description": "This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called \"Take-It-Light\" to warm up a bit. Each bottle has l milliliters of the drink. Also they bought c limes and cut each of them into d slices. After that they found p grams of salt.To make a toast, each friend needs nl milliliters of the drink, a slice of lime and np grams of salt. The friends want to make as many toasts as they can, provided they all drink the same amount. How many toasts can each friend make?", "input_spec": "The first and only line contains positive integers n, k, l, c, d, p, nl, np, not exceeding 1000 and no less than 1. The numbers are separated by exactly one space.", "output_spec": "Print a single integer \u2014 the number of toasts each friend can make.", "sample_inputs": ["3 4 5 10 8 100 3 1", "5 100 10 1 19 90 4 3", "10 1000 1000 25 23 1 50 1"], "sample_outputs": ["2", "3", "0"], "notes": "NoteA comment to the first sample: Overall the friends have 4\u2009*\u20095\u2009=\u200920 milliliters of the drink, it is enough to make 20\u2009/\u20093\u2009=\u20096 toasts. The limes are enough for 10\u2009*\u20098\u2009=\u200980 toasts and the salt is enough for 100\u2009/\u20091\u2009=\u2009100 toasts. However, there are 3 friends in the group, so the answer is min(6,\u200980,\u2009100)\u2009/\u20093\u2009=\u20092."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c, $d, $e, $f, $g, $h) = explode(\" \", trim(fgets(STDIN)));\n$i = $b * $c; // \u0432\u0441\u0435\u0433\u043e \u043c\u0438\u043b\u043b\u0438\u043b\u0438\u0442\u0440\u043e\u0432\n$j = $d * $e; // \u0434\u043e\u043b\u0435\u043a\n$k = 0;\nfor($x = $i, $y = $j, $z = $f; $x >= 0, $y >= 0, $z >= 0; $x--, $y--, $z--)\n{\n    $i -= $g;\n    $j -= 1;\n    $f -= $h;\n    if(($i < 0) || ($j < 0) || ($f < 0))\n    {\n        break;\n    }\n    else\n    {\n        $k++;\n    }\n}\nprint floor($k / $a);\n?>"}, {"source_code": "<?\nstream_set_blocking(STDIN, 0);\nfscanf(STDIN, \"%d %d %d %d %d %d %d %d\", $n, $k, $l, $c, $d, $p, $nl, $np);\n\n$gaz = (int)(($k*$l)/$nl);\n$laims = (int)($c*$d);\n$solt = (int)$p/$np;\necho (int)(min($gaz,$laims,$solt)/$n);\n?>"}, {"source_code": "<?php\n\nfunction solve(){\n\t//$Token = new Token(rtrim(fgets(STDIN), \"\\n\"), \" \");\n\t//$W_first = $Token->nextInt();\n\t//$B_first = $Token->nextInt();\n\t\n\t$Token = new Token(rtrim(fgets(STDIN), \"\\n\"), \" \");\n\t//$inp_arr = $Token->nextIntArray(8);\n\t$inp_arr = $Token->nextIntArray();\n\t\n\t$inp_f = $inp_arr[0];\n\t$inp_k = $inp_arr[1];\n\t$inp_l = $inp_arr[2];\n\t$inp_c = $inp_arr[3];\n\t$inp_d = $inp_arr[4];\n\t$inp_p = $inp_arr[5];\n\t$inp_nl = $inp_arr[6];\n\t$inp_np = $inp_arr[7];\n\n\t$drink = (int)(($inp_k * $inp_l) / $inp_nl);\n\t$salt = (int)($inp_p / $inp_np);\n\t$lime = $inp_c * $inp_d;\n\t/*$arr[] = $drink;\n\t$arr[] = $salt;\n\t$arr[] = $lime;\n\t\n\t//$min = min($arr);\n\tif (asort(&$arr) === false) {\n\t\tprint(-1);\n\t\treturn;\n\t}\n\t$min = $arr[0];\n\t\n\t*/\n\t//\ufffd\u014f\ufffd\ufffdl\ufffd\ufffd\ufffd\ufffd\ufffd\u07c2\u93c8\ufffd\ufffd\n\t//\ufffdf\ufffd[\ufffd^\ufffd\ufffd\ufffd\ufffd\ufffd\ufffd\ufffd\u0182\ufffd\ufffdA$min = min($arr);\n\t$min = min($drink, $salt, $lime);\n\t$ans = (int)($min / $inp_f);\n\tprintf(\"%d\", $ans);\n\n}\n\nfunction run(){\n\tsolve();\n}\n\nob_end_clean();\nrun();\n\n//input -  $inp_\n//block    $temp_\n//two block$ttemp_\n//as \t   $as_\n//instance $(Upper)\n//ref      $ref\n//class menba $_\n\nclass Token{\n\tprivate $token;\n\tprivate $tok;\n\t\n\tpublic function __construct($str_line, $tok) {\n\t\t$this->tok = $tok;\n\t\t$this->token = strtok($str_line, $this->tok);\n\t}\n\n\tpublic function nextToken() {\n\t\t$thisToken = $this->token;\n\t\t$this->token = strtok($this->tok);\n\t\treturn $thisToken;\n\t} \n\t\t\n\tpublic function nextFloat() {\n\t\treturn (float)$this->nextToken();\n\t}\n\t\n  \tpublic function nextInt() {\n\t\treturn (int)$this->nextToken();\n\t}\n\t\n\tpublic function nextIntArray() {\n\t\t$temp_arr = array();\n\t\t$flag = -1;\n\t\twhile ($flag !== 1) {\n\t\t\t$thisToken = $this->nextToken();\n\t\t\tif ($thisToken !== false) {\n\t\t\t\t$temp_arr[] = $thisToken;\n\t\t\t} else {\n\t\t\t\t$flag = 1;\n\t\t\t}\n\t\t}\n\t\treturn $temp_arr;\n\t}\n\t\n\tpublic function nnextIntArray($num) {\n\t\t$temp_arr = array();\n\t\tfor ($i = 0; $i < $num; $i++) {\n\t\t\t$temp_arr[] = (int)$this->token;\n\t\t}\n\t\treturn $temp_arr;\n\t}\n}\n/*\nfunction get_line() {\n        $stdin = fopen(\"php://stdin\", \"r\"); \n        $line = rtrim($stdin, \"\\n\"); \n        fclose($stdin); \n        return $line; \n}\n*/\n\nfunction num_printf($i){\n\tif (is_float($i)) {\n\t\tprintf(\"%.10f\", $i);\n\t}\n\tif (is_int($i)) {\n\t\tprintf(\"%10d\", $i);\n\t}\n}\n\nfunction array_printf(array $array) {\n\t\t$message = \"\";\n\t\tforeach ($array as $value) {\n\t\t\t$message .= \"$value\" . \" \";\n\t\t}\n\t\t$message = rtrim($message);\n\t\tprintf('%s', $message);\n}\n?>"}, {"source_code": "<?php\nlist($n, $k, $l, $c, $d, $p, $nl, $np) = explode(' ', fgets(STDIN));\n\n$Gas = $k * $l;\n$lime = $c * $d;\n\n$MinGas = floor($Gas / ($n * $nl));\n$MinLime = floor($lime / $n);\n$MinSalt = floor($p / ($n * $np));\n\n$Min = min($MinGas, $MinLime, $MinSalt);\n\necho $Min;\n?>"}, {"source_code": "<?php\n$s = fopen(\"php://stdin\", 'r');\n$n = stream_get_contents($s);\n$dum= explode(\" \",$n);\n$n=$dum[0];\n$k=$dum[1];\n$l=$dum[2];\n$c=$dum[3];\n$d=$dum[4];\n$p=$dum[5];\n$nl=$dum[6];\n$np=$dum[7];\n$aa = floor($k*$l/$nl);\n$bb = $c*$d;\n$cc = floor($p/$np);\necho floor(min($aa,$bb,$cc)/$n);\n?>"}, {"source_code": "<?\nfscanf(STDIN,\"%d%d%d%d%d%d%d%d\",$n,$k,$l,$c,$d,$p,$nl,$np);\n$a1=$k*$l/$nl;\n$a2=$c*$d;\n$a3=$p/$np;\necho floor(min($a1,$a2,$a3)/$n);\n?>"}, {"source_code": "<?php\nlist($n, $k, $l, $c, $d, $p, $nl, $np) = explode(' ', trim(fgets(STDIN)));\n\n$vsego_gaz = $k * $l;\n$tost = floor($vsego_gaz / $nl);\n$laim = $c * $d;\n$sol = floor($p / $np);\n$itog = floor(min($tost, $laim, $sol) / $n);\necho $itog;\n?>"}], "negative_code": [{"source_code": "<?php\nlist($n, $k, $l, $c, $d, $p, $nl, $np) = explode(' ', fgets(STDIN));\n\n$Gas = $k * $l;\n$lime = $c * $d;\n\n$MinGas = floor($Gas / ($n * $nl));\n$MinLime = floor($lime / $n);\n$MinSalt = floor($lime / ($n * $np));\n\n$Min = min($MinGas, $MinLime, $MinSalt);\n\necho $Min;\n?>"}, {"source_code": "<?php\nlist($n, $k, $l, $c, $d, $p, $nl, $np) = explode(' ', trim(fgets(STDIN)));\n\n$vsego_gaz = $k * $l;\n$tost = floor($vsego_gaz / $n);\n$laim = $c * $d;\n$sol = floor($p / $np);\n$itog = floor(min($tost, $laim, $sol) / $n);\necho $itog;\n?>"}], "src_uid": "67410b7d36b9d2e6a97ca5c7cff317c1"}
{"nl": {"description": "In a small but very proud high school it was decided to win ACM ICPC. This goal requires to compose as many teams of three as possible, but since there were only 6 students who wished to participate, the decision was to build exactly two teams.After practice competition, participant number i got a score of ai. Team score is defined as sum of scores of its participants. High school management is interested if it's possible to build two teams with equal scores. Your task is to answer that question.", "input_spec": "The single line contains six integers a1,\u2009...,\u2009a6 (0\u2009\u2264\u2009ai\u2009\u2264\u20091000) \u2014 scores of the participants", "output_spec": "Print \"YES\" (quotes for clarity), if it is possible to build teams with equal score, and \"NO\" otherwise. You can print each character either upper- or lowercase (\"YeS\" and \"yes\" are valid when the answer is \"YES\").", "sample_inputs": ["1 3 2 1 2 1", "1 1 1 1 1 99"], "sample_outputs": ["YES", "NO"], "notes": "NoteIn the first sample, first team can be composed of 1st, 2nd and 6th participant, second \u2014 of 3rd, 4th and 5th: team scores are 1\u2009+\u20093\u2009+\u20091\u2009=\u20092\u2009+\u20091\u2009+\u20092\u2009=\u20095.In the second sample, score of participant number 6 is too high: his team score will be definitely greater."}, "positive_code": [{"source_code": "<?php\n$a = explode(\" \", trim(fgets(STDIN)));\n$b = array_sum($a);\n$c = 0;\nfor($x = 0; $x < count($a) - 2; $x++)\n{\n     for($y = $x + 1; $y < count($a) - 1; $y++)\n     {\n          for($z = $y + 1; $z < count($a); $z++)\n          {\n               $d = $a[$x] + $a[$y] + $a[$z];\n               $e = $b - $d;\n               if($d == $e)\n               {\n                    $c = 1;\n                    break;\n               }\n          }\n          if($c == 1)\n          {\n               break;\n          }\n     }\n     if($c == 1)\n     {\n          break;\n     }\n}\nif($c == 0)\n{\n     print \"NO\";\n}\nelse\n{\n     print \"YES\";\n}\n?>"}], "negative_code": [{"source_code": "<?php\n$a = explode(\" \", trim(fgets(STDIN)));\n$b = array_sum($a);\n$c = 0;\nfor($x = 0; $x < count($a) - 2; $x++)\n{\n     for($y = 0; $y < count($a) - 1; $y++)\n     {\n          for($z = 0; $z < count($a); $z++)\n          {\n               $d = $a[$x] + $a[$y] + $a[$z];\n               $e = $b - $d;\n               if($d == $e)\n               {\n                    $c = 1;\n                    break;\n               }\n          }\n          if($c == 1)\n          {\n               break;\n          }\n     }\n     if($c == 1)\n     {\n          break;\n     }\n}\nif($c == 0)\n{\n     print \"NO\";\n}\nelse\n{\n     print \"YES\";\n}\n?>"}], "src_uid": "2acf686862a34c337d1d2cbc0ac3fd11"}
{"nl": {"description": "The three friends, Kuro, Shiro, and Katie, met up again! It's time for a party...What the cats do when they unite? Right, they have a party. Since they wanted to have as much fun as possible, they invited all their friends. Now $$$n$$$ cats are at the party, sitting in a circle and eating soup. The rules are simple: anyone having finished their soup leaves the circle.Katie suddenly notices that whenever a cat leaves, the place where she was sitting becomes an empty space, which means the circle is divided into smaller continuous groups of cats sitting next to each other. At the moment Katie observes, there are $$$m$$$ cats who left the circle. This raises a question for Katie: what is the maximum possible number of groups the circle is divided into at the moment?Could you help her with this curiosity?You can see the examples and their descriptions with pictures in the \"Note\" section.", "input_spec": "The only line contains two integers $$$n$$$ and $$$m$$$ ($$$2 \\leq n \\leq 1000$$$, $$$0 \\leq m \\leq n$$$)\u00a0\u2014 the initial number of cats at the party and the number of cats who left the circle at the moment Katie observes, respectively.", "output_spec": "Print a single integer\u00a0\u2014 the maximum number of groups of cats at the moment Katie observes.", "sample_inputs": ["7 4", "6 2", "3 0", "2 2"], "sample_outputs": ["3", "2", "1", "0"], "notes": "NoteIn the first example, originally there are $$$7$$$ cats sitting as shown below, creating a single group:  At the observed moment, $$$4$$$ cats have left the table. Suppose the cats $$$2$$$, $$$3$$$, $$$5$$$ and $$$7$$$ have left, then there are $$$3$$$ groups remaining. It is possible to show that it is the maximum possible number of groups remaining.  In the second example, there are $$$6$$$ cats sitting as shown below:  At the observed moment, $$$2$$$ cats have left the table. Suppose the cats numbered $$$3$$$ and $$$6$$$ left, then there will be $$$2$$$ groups remaining ($$$\\{1, 2\\}$$$ and $$$\\{4, 5\\}$$$). It is impossible to have more than $$$2$$$ groups of cats remaining.  In the third example, no cats have left, so there is $$$1$$$ group consisting of all cats.In the fourth example, all cats have left the circle, so there are $$$0$$$ groups."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = array_fill(1, $a, 1);\nwhile(TRUE)\n{\n     if($b == 0)\n     {\n          break;\n     }\n     else\n     {\n          for($x = 1; $x <= $a; $x++)\n          {\n               if($c[$x] == TRUE)\n               {\n                    break;\n               }\n          }\n          for($y = 1; $y <= $a; $y++)\n          {\n               if($c[$x] == TRUE)\n               {\n                    $c[$x] = 0;\n                    $b--;\n                    $x += 2;\n                    if($b == 0)\n                    {\n                         break;\n                    }\n               }\n          }\n     }\n}\narray_push($c, 0);\n$d = 0;\nfor($x = 1; $x <= $a; $x++)\n{\n     if(($c[$x] == 1) && ($c[$x + 1] == 0))\n     {\n          $d++;\n     }\n}\nprint $d;\n?>"}, {"source_code": "<?php\n# 1163A\ndeclare(strict_types=1);\n\n[$n, $m] = fscanf(STDIN, '%u %u');\n\nif ($n === $m) {\n    echo 0;\n} elseif($m < 2) {\n    echo 1;\n} elseif (floor($n / 2) < $m) {\n    echo $n - $m;\n} else {\n    echo $m;\n}\n"}, {"source_code": "<?php\n     $n = explode(\" \", trim(fgets(STDIN)));\n     echo min(max(1,$n[1]),$n[0]-$n[1]);\n?>"}, {"source_code": "<?php\n\n$line = fgets(STDIN);\n\nsscanf($line, '%d %d', $a, $b);\n\nfunction f($a, $b) {\n    if ($b == 0) {\n        return 1;\n    }\n    $out = $a - $b;\n    return min($out, $b);\n}\n\necho f($a, $b);"}, {"source_code": "<?php\n    list($n, $m) = explode(\" \", trim(fgets(STDIN)));\n    if ($n/2 <= $m) {\n        echo $n - $m;\n    } else {\n        if ($m == 0) {\n            echo 1;\n        } else {\n            echo $m;\n        }\n    }\n?>"}, {"source_code": "<?php\n     $n = explode(\" \", trim(fgets(STDIN)));\n     echo min(max(1,$n[1]),$n[0]-$n[1]);\n?>"}], "negative_code": [], "src_uid": "c05d0a9cabe04d8fb48c76d2ce033648"}
{"nl": {"description": "PolandBall is a young, clever Ball. He is interested in prime numbers. He has stated a following hypothesis: \"There exists such a positive integer n that for each positive integer m number n\u00b7m\u2009+\u20091 is a prime number\".Unfortunately, PolandBall is not experienced yet and doesn't know that his hypothesis is incorrect. Could you prove it wrong? Write a program that finds a counterexample for any n.", "input_spec": "The only number in the input is n (1\u2009\u2264\u2009n\u2009\u2264\u20091000)\u00a0\u2014 number from the PolandBall's hypothesis. ", "output_spec": "Output such m that n\u00b7m\u2009+\u20091 is not a prime number. Your answer will be considered correct if you output any suitable m such that 1\u2009\u2264\u2009m\u2009\u2264\u2009103. It is guaranteed the the answer exists.", "sample_inputs": ["3", "4"], "sample_outputs": ["1", "2"], "notes": "NoteA prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself.For the first sample testcase, 3\u00b71\u2009+\u20091\u2009=\u20094. We can output 1.In the second sample testcase, 4\u00b71\u2009+\u20091\u2009=\u20095. We cannot output 1 because 5 is prime. However, m\u2009=\u20092 is okay since 4\u00b72\u2009+\u20091\u2009=\u20099, which is not a prime number."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\nfor($x = 1; $x <= 1000; $x++)\n{\n     $b = $a * $x + 1;\n     $c = sqrt($b);\n     $d = floor($c);\n     if($c == $d)\n     {\n          break;\n     }\n}\nprint $x;\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d\", $n);\n\n    $arrP = array();\n    for ($i = 2; $i < 1000000; $i++) {\n        $arrP[$i] = 1;\n    }\n\n    for ($i = 2; $i < 1000; $i++) {\n        for ($j = 2; $j < 1000; $j++) {\n            // echo $i;\n            if ($i * $j <= 1000000) {\n                $arrP[$i * $j] = 0;\n            }\n        }\n    }\n\n    for ($i = 2; $i <= 1000000; $i++) {\n        if ($arrP[$i] == 1) {\n            $arrPP[] = $i;\n        }        \n    }\n\n    $i = 1;\n    while(true) {\n        $x = $n * $i + 1;\n        // echo $x . PHP_EOL;\n        if (!in_array($x, $arrPP)) {\n            echo $i;\n            exit;\n        }\n        $i++;\n    }\n\n\n    var_dump($arrPP);\n"}, {"source_code": "<?php\n\n$n = trim(fgets(STDIN));\nforeach (range(1, 1000) as $i) {\n    $res = $n*$i+1;\n    if (!simple($res) && $i >= 1 && $i <= 1000) {\n        echo $i;\n        break;\n    }\n}\n\nfunction simple($n)\n{\n   for($i = 2; $i <= sqrt($n); $i++) {\n      if (!($n % $i)) {\n          return false;\n      }\n   }\n   return true;\n}"}], "negative_code": [{"source_code": "<?php\n    fscanf(STDIN, \"%d\", $n);\n\n    $arrP = array();\n    for ($i = 2; $i < 1000000; $i++) {\n        $arrP[$i] = 1;\n    }\n\n    for ($i = 2; $i < 1000; $i++) {\n        for ($j = 2; $j < 1000; $j++) {\n            // echo $i;\n            if ($i * $j <= 1000000) {\n                $arrP[$i * $j] = 0;\n            }\n        }\n    }\n\n    for ($i = 2; $i <= 1000; $i++) {\n        if ($arrP[$i] == 1) {\n            $arrPP[] = $i;\n        }        \n    }\n\n    $i = 1;\n    while(true) {\n        $x = $n * $i + 1;\n        // echo $x . PHP_EOL;\n        if (!in_array($x, $arrPP)) {\n            echo $i;\n            exit;\n        }\n        $i++;\n    }\n\n\n    var_dump($arrPP);\n"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d\", $n);\n\n    $arrP = array();\n    for ($i = 2; $i < 1000; $i++) {\n        $arrP[$i] = 1;\n    }\n\n    for ($i = 2; $i < 1000; $i++) {\n        for ($j = 2; $j < 1000; $j++) {\n            // echo $i;\n            if ($i * $j <= 1000) {\n                $arrP[$i * $j] = 0;\n            }\n        }\n    }\n\n    for ($i = 2; $i <= 1000; $i++) {\n        if ($arrP[$i] == 1) {\n            $arrPP[] = $i;\n        }        \n    }\n\n    $i = 1;\n    while(true) {\n        $x = $n * $i + 1;\n        // echo $x . PHP_EOL;\n        if (!in_array($x, $arrPP)) {\n            echo $i;\n            exit;\n        }\n        $i++;\n    }\n\n\n    var_dump($arrPP);\n"}, {"source_code": "<?php\n\n$n = $argv[1];\nif ($n > 1) {\n    foreach (range(1, $n) as $i) {\n        $res = $n*$i+1;\n        if (!simple($res) && $i >= 1 && $i <= 1000) {\n            //echo $res . \"=\" . $n . \"*\". $i . \"+1\"  . \"\\n\";\n            echo $i;\n            break;\n        }\n    }\n} else {\n    echo $i;\n}\n\nfunction simple($n)\n{\n   for($i = 2; $i <= sqrt($n); $i++) {\n      if (!($n % $i)) {\n          return false;\n      }\n   }\n   return true;\n}"}, {"source_code": "<?php\n\n//$n = $argv[1];\n$n = 1;\nforeach (range(1, $n) as $i) {\n    $res = $n*$i+1;\n    if (!simple($res) && $res >= 1 && $res <= 1000) {\n        //echo $res . \"=\" . $n . \"*\". $i . \"+1\"  . \"\\n\";\n        echo $i;\n        break;\n    }\n}\n\nfunction simple($n)\n{\n   for($i = 2; $i <= sqrt($n); $i++) {\n      if (!($n % $i)) {\n          return false;\n      }\n   }\n   return true;\n}"}, {"source_code": "<?php\n\n$n = trim(fgets(STDIN));\n\n    foreach (range(1, $n) as $i) {\n        $res = $n*$i+1;\n        if (!simple($res) && $i >= 1 && $i <= 1000) {\n            echo $i;\n            break;\n        }\n    }\n\n\nfunction simple($n)\n{\n   for($i = 2; $i <= sqrt($n); $i++) {\n      if (!($n % $i)) {\n          return false;\n      }\n   }\n   return true;\n}"}, {"source_code": "<?php\n\n$n = trim(fgets(STDIN));\nif ($n > 1) {\n    foreach (range(1, $n) as $i) {\n        $res = $n*$i+1;\n        if (!simple($res) && $i >= 1 && $i <= 1000) {\n            echo $i;\n            break;\n        }\n    }\n} else {\n    echo $i;\n}\n\nfunction simple($n)\n{\n   for($i = 2; $i <= sqrt($n); $i++) {\n      if (!($n % $i)) {\n          return false;\n      }\n   }\n   return true;\n}"}, {"source_code": "<?php\n\n$n = $argv[1];\nforeach (range(1, $n) as $i) {\n    $res = $n*$i+1;\n    if (!simple($res) && $res >= 1 && $res <= 1000) {\n        //echo $res . \"=\" . $n . \"*\". $i . \"+1\"  . \"\\n\";\n        echo $i;\n        break;\n    }\n}\n\nfunction simple($n)\n{\n   for($i = 2; $i <= sqrt($n); $i++) {\n      if (!($n % $i)) {\n          return false;\n      }\n   }\n   return true;\n}"}, {"source_code": "<?php\n\n$n = trim(fgets(STDIN));\nif ($n > 2) {\n    foreach (range(1, $n) as $i) {\n        $res = $n*$i+1;\n        if (!simple($res) && $i >= 1 && $i <= 1000) {\n            echo $i;\n            break;\n        }\n    }\n} else {\n    echo $i;\n}\necho \"\\n\";\n\nfunction simple($n)\n{\n   for($i = 2; $i <= sqrt($n); $i++) {\n      if (!($n % $i)) {\n          return false;\n      }\n   }\n   return true;\n}"}, {"source_code": "<?php\n\n$n = trim(fgets(STDIN));\nif ($n > 1) {\n    foreach (range(1, $n) as $i) {\n        $res = $n*$i+1;\n        if (!simple($res) && $i >= 1 && $i <= 1000) {\n            echo $i;\n            break;\n        }\n    }\n} else {\n    echo $i;\n}\n\nfunction simple($n)\n{\n   for($i = 2; $i <= sqrt($n); $i++) {\n      if (!($n % $i)) {\n          return false;\n      }\n   }\n   return true;\n}"}, {"source_code": "<?php\n\n$n = trim(fgets(STDIN));\nif ($n > 2) {\n    foreach (range(1, $n) as $i) {\n        $res = $n*$i+1;\n        if (!simple($res) && $i >= 1 && $i <= 1000) {\n//            echo $i;\n            fwrite(STDOUT, $i);\n            break;\n        }\n    }\n} else {\n    echo $i;\n}\n\nfunction simple($n)\n{\n   for($i = 2; $i <= sqrt($n); $i++) {\n      if (!($n % $i)) {\n          return false;\n      }\n   }\n   return true;\n}"}], "src_uid": "5c68e20ac6ecb7c289601ce8351f4e97"}
{"nl": {"description": "A little bear Limak plays a game. He has five cards. There is one number written on each card. Each number is a positive integer.Limak can discard (throw out) some cards. His goal is to minimize the sum of numbers written on remaining (not discarded) cards.He is allowed to at most once discard two or three cards with the same number. Of course, he won't discard cards if it's impossible to choose two or three cards with the same number.Given five numbers written on cards, cay you find the minimum sum of numbers on remaining cards?", "input_spec": "The only line of the input contains five integers t1, t2, t3, t4 and t5 (1\u2009\u2264\u2009ti\u2009\u2264\u2009100)\u00a0\u2014 numbers written on cards.", "output_spec": "Print the minimum possible sum of numbers written on remaining cards.", "sample_inputs": ["7 3 7 3 20", "7 9 3 1 8", "10 10 10 10 10"], "sample_outputs": ["26", "28", "20"], "notes": "NoteIn the first sample, Limak has cards with numbers 7, 3, 7, 3 and 20. Limak can do one of the following.  Do nothing and the sum would be 7\u2009+\u20093\u2009+\u20097\u2009+\u20093\u2009+\u200920\u2009=\u200940.  Remove two cards with a number 7. The remaining sum would be 3\u2009+\u20093\u2009+\u200920\u2009=\u200926.  Remove two cards with a number 3. The remaining sum would be 7\u2009+\u20097\u2009+\u200920\u2009=\u200934. You are asked to minimize the sum so the answer is 26.In the second sample, it's impossible to find two or three cards with the same number. Hence, Limak does nothing and the sum is 7\u2009+\u20099\u2009+\u20091\u2009+\u20093\u2009+\u20098\u2009=\u200928.In the third sample, all cards have the same number. It's optimal to discard any three cards. The sum of two remaining numbers is 10\u2009+\u200910\u2009=\u200920."}, "positive_code": [{"source_code": "<?php\n$a = explode(\" \", trim(fgets(STDIN)));\n$b = array();\nfor($x = 0; $x < count($a); $x++)\n{\n     $b[$a[$x]]++;\n}\narsort($b);\n$c = array_keys($b);\n$d = array_fill(0, 2, 0);\nfor($x = 0; $x < count($b); $x++)\n{\n     if($b[$c[$x]] == 5)\n     {\n          $e = $c[$x] * 3;\n          $d[$x] = $e;\n     }\n     elseif($b[$c[$x]] == 4)\n     {\n          $e = $c[$x] * 3;\n          $d[$x] = $e;\n     }\n     elseif($b[$c[$x]] == 3)\n     {\n          $e = $c[$x] * 3;\n          $d[$x] = $e;\n     }\n     elseif($b[$c[$x]] == 2)\n     {\n          $e = $c[$x] * 2;\n          $d[$x] = $e;\n     }\n}\n$f = array_sum($a);\nprint min($f, $f - $d[0], $f - $d[1]);\n?>"}, {"source_code": "<?php\n$t = explode(\" \", trim(fgets(STDIN)));\nsort($t);\n$min = array_sum($t);\nfor ($i = 4; $i >= 0; $i--) {\n    if (($i >= 2) and ($t[$i] == $t[$i - 1]) and ($t[$i] == $t[$i - 2])) {\n        $s[] = $t[$i] + $t[$i - 1] + $t[$i - 2];\n/*        if ($i == 4) {\n            break;\n        }*/\n    } else if (($i >= 1) and ($t[$i] == $t[$i - 1])) {\n        $s[] = $t[$i] + $t[$i - 1];\n/*        if ($i == 4) {\n            break;\n        }*/\n    }\n}\nif (isset($s)) {\n    sort($s);\n    $j = count($s);\n    $min -= $s[$j - 1];\n}\nprint $min . \"\\n\";\nob_flush(STDOUT);\nflush(STDOUT);\n?>\n\n\n"}, {"source_code": "<?\n\n$stdin = fopen('php://stdin', 'r');\n$s =  trim(fgets($stdin));\n$cards = explode(\" \",$s);\n$counts = array_count_values($cards);\n$ar=[];\n$max=0;\nforeach($counts as $k=>$v){\n\t\n\tif($v>2){\n\t\tif(($k*3)>$max){\n\t\t\t$max=$k*3;\n\t\t}\n\t}elseif($v==2){\n\t\tif(($k*2)>$max){\n\t\t\t$max=$k*2;\n\t\t}\n\t}\n}\necho (array_sum($cards)-$max);"}, {"source_code": "<?php\nerror_reporting(0);\nfunction process ($a) {\n\t/*cant solve 7 7 7 8 8\n\trsort($a);\n\t$asum = array_sum($a);\n\tfor ($i=0; $i<5; $i++)\n\t\tif(($a[$i]==$a[$i+1])&&($a[$i+1]==$a[$i+2])) {\n\t\t\treturn $asum-$a[$i]*3;\n\t\t}elseif($a[$i]==$a[$i+1]) {\n\t\t\treturn $asum-$a[$i]*2;\n\t\t}\n\treturn $asum;\n\t*/\n\t$z = array_count_values($a);\n\tkrsort($z);\n\t$max = 0;\n\tforeach ($z as $key => $value) {\n\t\tif ($value != 1) {\n\t\t\tif ($value > 3) $value = 3;\n\t\t\tif ($key * $value > $max) $max = $key * $value;\n\t\t}\n\t}\n\t$asum = array_sum($a);\n\treturn $asum - $max;\n}\n$in = trim(fgets(STDIN));\n$cards = explode(' ', $in);\necho process($cards);\n?>"}, {"source_code": "<?php\n\n$list= explode(' ', trim(fgets(STDIN)));\n\n$allSum = array_sum($list);\n$data = array_count_values($list);\n$values = [];\nforeach($data as $key => $count) {\n    if ($count > 3) {\n        $count = 3;\n    }\n    if($count >= 2) {\n        $values[] = $key * $count;\n    }\n}\n\nif(!empty($values)) {\n    echo $allSum - max($values);\n} else {\n    echo $allSum;\n}"}, {"source_code": "<?php\n      $t = array();\n      list($t[1], $t[2], $t[3], $t[4], $t[5]) = explode(' ', trim(fgets(STDIN)));\n      $s = 0;\n      for($i = 1; $i <= 5; $i ++)\n      {\n          $s += $t[$i];\n      }\n      $ans = $s;\n      for($i = 1; $i <= 5; $i ++)\n      {\n          for($j = $i + 1; $j <= 5; $j ++)\n          {\n              for($k = $j + 1; $k <= 5; $k ++)\n              {\n                  if($t[$i] == $t[$j] && $t[$i] == $t[$k] && $ans > $s - $t[$i] - $t[$j] - $t[$k])\n                  {\n                      $ans = $s - $t[$i] - $t[$j] - $t[$k];\n                  }\n              }\n              if($t[$i] == $t[$j] && $ans > $s - $t[$i] - $t[$j])\n                {\n                    $ans = $s - $t[$i] - $t[$j];\n                }\n          }\n      }\n      print $ans;\n?>\n"}], "negative_code": [{"source_code": "<?php\n$t = explode(\" \", trim(fgets(STDIN)));\nsort($t);\n$min = array_sum($t);\nfor ($i = 4; $i >= 0; $i--) {\n    if (($i >= 2) and ($t[$i] == $t[$i - 1]) and ($t[$i] == $t[$i - 2])) {\n        $s[] = $t[$i] + $t[$i - 1] + $t[$i - 2];\n        if ($i == 4) {\n            break;\n        }\n    } else if (($i >= 1) and ($t[$i] == $t[$i - 1])) {\n        $s[] = $t[$i] + $t[$i - 1];\n        if ($i == 4) {\n            break;\n        }\n    }\n}\nif (isset($s)) {\n    sort($s);\n    $j = count($s);\n    $min -= $s[$j - 1];\n}\nprint $min . \"\\n\";\nob_flush(STDOUT);\nflush(STDOUT);\n?>\n\n\n"}, {"source_code": "<?php\n$t = explode(\" \", trim(fgets(STDIN)));\nsort($t);\n$min = array_sum($t);\nfor ($i = 4; $i >= 0; $i--) {\n    if (($i >= 2) and ($t[$i] == $t[$i - 1]) and ($t[$i] == $t[$i - 2])) {\n        $s[] = $t[$i] + $t[$i - 1] + $t[$i - 2];\n        if ($i == 4) {\n            break;\n        }\n    } else if (($i >= 1) and ($t[$i] == $t[$i - 1])) {\n        $s[] = $t[$i] + $t[$i - 1];\n        if ($i == 4) {\n            break;\n        }\n    }\n}\nif (isset($s)) {\n    sort($s);\n    $j = count($s);\n    $min -= $s[$j - 1];\n}\nprint $min;\nob_flush();\nflush();\n?>\n\n\n"}, {"source_code": "<?php\n$t = explode(\" \", trim(fgets(STDIN)));\nsort($t);\n$min = array_sum($t);\nfor ($i = 4; $i >= 0; $i--) {\n    if (($i >= 2) and ($t[$i] == $t[$i - 1]) and ($t[$i] == $t[$i - 2])) {\n        $s[] = $t[$i] + $t[$i - 1] + $t[$i - 2];\n        if ($i == 4) {\n            break;\n        }\n    } else if (($i >= 1) and ($t[$i] == $t[$i - 1])) {\n        $s[] = $t[$i] + $t[$i - 1];\n        if ($i == 4) {\n            break;\n        }\n    }\n}\nif (isset($s)) {\n    sort($s);\n    $j = count($s);\n    $min -= $s[$j - 1];\n}\nprint $min;\n?>\n\n\n"}, {"source_code": "<?php\nerror_reporting(0);\nfunction process ($a) {\n\trsort($a);\n\t$asum = array_sum($a);\n\tfor ($i=0; $i<5; $i++)\n\t\tif(($a[$i]==$a[$i+1])&&($a[$i+1]==$a[$i+2])) {\n\t\t\treturn $asum-$a[$i]*3;\n\t\t}elseif($a[$i]==$a[$i+1]) {\n\t\t\treturn $asum-$a[$i]*2;\n\t\t}\n\treturn $asum;\n}\n$in = trim(fgets(STDIN));\n$cards = explode(' ', $in);\necho process($cards);\n?>"}, {"source_code": "<?php\n\n$list= explode(' ', trim(fgets(stdin)));\n\n$allSum = array_sum($list);\n$data = array_count_values($list);\n$values = [];\nforeach($data as $key => $count) {\n    if ($count > 3) {\n        $count = 3;\n    }\n    if($count >= 2) {\n        $values[] = $key * $count;\n    }\n}\n\nif(!empty($values)) {\n    echo $allSum - max($values);\n} else {\n    echo $allSum;\n}"}], "src_uid": "a9c17ce5fd5f39ffd70917127ce3408a"}
{"nl": {"description": "The weather is fine today and hence it's high time to climb the nearby pine and enjoy the landscape.The pine's trunk includes several branches, located one above another and numbered from 2 to y. Some of them (more precise, from 2 to p) are occupied by tiny vile grasshoppers which you're at war with. These grasshoppers are known for their awesome jumping skills: the grasshopper at branch x can jump to branches .Keeping this in mind, you wisely decided to choose such a branch that none of the grasshoppers could interrupt you. At the same time you wanna settle as high as possible since the view from up there is simply breathtaking.In other words, your goal is to find the highest branch that cannot be reached by any of the grasshoppers or report that it's impossible.", "input_spec": "The only line contains two integers p and y (2\u2009\u2264\u2009p\u2009\u2264\u2009y\u2009\u2264\u2009109).", "output_spec": "Output the number of the highest suitable branch. If there are none, print -1 instead.", "sample_inputs": ["3 6", "3 4"], "sample_outputs": ["5", "-1"], "notes": "NoteIn the first sample case grasshopper from branch 2 reaches branches 2, 4 and 6 while branch 3 is initially settled by another grasshopper. Therefore the answer is 5.It immediately follows that there are no valid branches in second sample case."}, "positive_code": [{"source_code": "<?php\n\nfscanf(STDIN, '%d %d\\n', $p, $y);\nfor($i = $y; $i >= $p + 1; $i--){\n  $stop = FALSE;\n  for($j = 2 ; $j <= min(sqrt($i), $p); $j++){\n    if($i % $j == 0){\n      $stop = TRUE;\n      break;\n    }\n  }\n  if(!$stop){\n    echo $i;\n    exit;\n  }\n}\necho '-1';"}, {"source_code": "<?php\n    list($p, $y) = explode(\" \", fgets(STDIN));\n    $p = (int)$p;\n    $y = (int)$y;\n    $arr = array();\n    $k = '-1';\n    for ($n=$y; $n > $p; $n--) {\n        $b = true;\n        if ($n%2 == 0) {\n            continue;\n        }\n        for ($i = 3; $i <= $p; $i = $i+2) {\n            if ($n/$i < sqrt($n)) {\n                break;\n            } else if ($n%$i == 0) {\n                $b = false;\n                break;\n            }\n        }\n        if ($n > $p && $b) {\n            $k = $n;\n            break;\n        }\n    }\n\n    echo $k;\n    \n?>"}], "negative_code": [{"source_code": "<?php\n    list($p, $y) = explode(\" \", fgets(STDIN));\n    $p = (int)$p;\n    $y = (int)$y;\n    $arr = array();\n    $k = '-1';\n    for ($n=$y; $n > $p; $n--) {\n        $b = true;\n        if ($n%2 == 0) {\n            continue;\n        }\n        for ($i = 3; $i <= $p; $i = $i+2) {\n            if ($n/$i <= sqrt($n)) {\n                break;\n            } else if ($n%$i == 0) {\n                $b = false;\n                break;\n            }\n        }\n        if ($n > $p && $b) {\n            $k = $n;\n            break;\n        }\n    }\n\n    echo $k;\n    \n?>"}, {"source_code": "<?php\n    list($p, $y) = explode(\" \", fgets(STDIN));\n    $p = (int)$p;\n    $y = (int)$y;\n\n    $k = '-1';\n    for ($n=$y; $n > $p; $n--) {\n        if (method($n, $p, $y)) {\n            continue;\n        } else {\n            $k = $n;\n            break;\n        }\n    }\n    echo $k;\n    \n    function method($s, $p, $y) {\n        if ($s%2 == 0) {\n           return true; \n        }\n        for ($i = $p; $i >= 2; $i--) {\n            if ($s%$i) {\n                return false;\n            } else {\n                if ($p < $s/$i && $s/$i <$y/$i) {\n                    return true;\n                } else {\n                    return false;\n                }\n            }\n        }\n        \n        return false;\n    }\n    \n?>"}], "src_uid": "b533203f488fa4caf105f3f46dd5844d"}
{"nl": {"description": "Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.Petya calls a number almost lucky if it could be evenly divided by some lucky number. Help him find out if the given number n is almost lucky.", "input_spec": "The single line contains an integer n (1\u2009\u2264\u2009n\u2009\u2264\u20091000) \u2014 the number that needs to be checked.", "output_spec": "In the only line print \"YES\" (without the quotes), if number n is almost lucky. Otherwise, print \"NO\" (without the quotes).", "sample_inputs": ["47", "16", "78"], "sample_outputs": ["YES", "YES", "NO"], "notes": "NoteNote that all lucky numbers are almost lucky as any number is evenly divisible by itself.In the first sample 47 is a lucky number. In the second sample 16 is divisible by 4."}, "positive_code": [{"source_code": "<?php\n$handle = fopen (\"php://stdin\",\"r\");\nfscanf($handle,\"%d\",$n);\n\n$a=[\n4,\n7,\n44,\n47,\n74,\n77,\n444,\n447,\n474,\n477,\n744,\n747,\n774,\n777,\n];\n\n$val=false;\nfor ($i=0; $i < count($a); $i++) { \n\tif($n % $a[$i] == 0){\n\t\t$val = true;\n\t\tbreak;\n\t}\n}\nif($val){\n\t\techo \"YES\";\n}else{\n\techo \"NO\";\n}"}, {"source_code": "<?php\n$string = trim(fgets(STDIN));\n$values = str_split($string);\n$contador = 0;\nfor ($x = 0; $x < count($values); $x++) {\n    if ($values[$x] == '7' || $values[$x] == '4') {\n        $contador++;\n    }\n}\n\nif ($contador ==count($values) || $string  % 4 == 0 || $string  % 7 == 0  || $string  % 47 == 0 ) {\n    echo \"YES\";\n} else {\n    echo \"NO\";\n}"}, {"source_code": "<?php\n    function isnum($num)\n    {\n        if($num <= 0) return false;\n        while((int)$num != 0)\n        {\n            if($num % 10 != '7' && $num % 10 != '4')\n                return false;\n            $num = (int)($num /= 10);\n        }\n        return true;\n    }\n    $unum = fgets(STDIN);\n    if(isnum($unum))\n        echo \"YES\\n\";\n    else\n    {\n        for($c = 1; $c < $unum; ++$c)\n        {\n            if(isnum($c) && $unum % $c == 0)\n            {\n                echo \"YES\";\n                exit;\n            }\n        }\n        echo \"NO\\n\";\n    }\n    exit;\n?>"}, {"source_code": "<?php\n$input = trim(fgets(STDIN));\n$lucky = FALSE;\n$arr_lucky = array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\nforeach($arr_lucky as $value)\n{\n\tif($input%$value==0)\n\t\t$lucky = TRUE;\n}\necho $lucky?\"YES\":\"NO\";\n?>"}, {"source_code": "<?php\nfscanf(STDIN, \"%d\", $a);\n  $arr = array( 4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777 );\n  $n=0;\n   for ($i = 0; $i < 14; $i++){\n    if ($a % $arr[$i] == 0)\n    $n=$n+1;\n   }\n    if ( $n > 0)\n    echo (\"YES\");\n    else \n    echo (\"NO\");\n   "}, {"source_code": "<?php\n\n$flag = 1; //must be not zero for STDIN\n$in = 'php://stdin';\nif (!$flag)\n{\n    $in = \"input.txt\";\n}\nfscanf(STDIN, \"%d\\n\", $n);\n$div = array(\"4\", \"7\", \"44\", \"47\", \"74\", \"77\", \"444\", \"777\", \"447\", \"474\", \"744\", \"477\", \"747\", \"774\");\n$length = count($div);\n\n\nfor ($flag = 0, $c = 0; $c < $length; $c++)\n{\n    $s = $n / (intval($div[$c]));\n    if (is_int($s))\n    {\n        $flag++;\n        break;\n    }\n}\nif (!$flag)\n{\n    print \"NO\\n\";\n}\n else\n{\n    print \"YES\\n\";\n}\n?>"}, {"source_code": "<?php\n    $stdin = fopen('php://stdin', 'r');\n    \n    fscanf($stdin, \"%s\", $n);\n    \n    $len = strlen($n);\n    \n    $lucky = false;\n    for($i=0; $i<$len; $i++){\n        if($n[$i] == '4' && $n[$i+1] == '7') $lucky = true;\n    }\n    $almostLucky = false;\n    $n = (int)$n;\n    if($n%4 == 0 || $n%7 == 0 || $n%47 == 0) $almostLucky = true;\n    \n    if($lucky == true || $almostLucky == true) echo \"YES\";\n    else echo \"NO\";\n    \n    fclose($stdin);\n?>"}, {"source_code": "<?php\n\n/**\n * \u041f\u0435\u0442\u044f \u043b\u044e\u0431\u0438\u0442 \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u044b\u0435 \u0447\u0438\u0441\u043b\u0430. \u0412\u0441\u0435\u043c \u0438\u0437\u0432\u0435\u0441\u0442\u043d\u043e, \u0447\u0442\u043e \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u044b\u043c\u0438 \u044f\u0432\u043b\u044f\u044e\u0442\u0441\u044f \u043f\u043e\u043b\u043e\u0436\u0438\u0442\u0435\u043b\u044c\u043d\u044b\u0435 \u0446\u0435\u043b\u044b\u0435 \u0447\u0438\u0441\u043b\u0430, \u0432 \u0434\u0435\u0441\u044f\u0442\u0438\u0447\u043d\u043e\u0439 \u0437\u0430\u043f\u0438\u0441\u0438 \u043a\u043e\u0442\u043e\u0440\u044b\u0445 \u0441\u043e\u0434\u0435\u0440\u0436\u0430\u0442\u0441\u044f \u0442\u043e\u043b\u044c\u043a\u043e \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u044b\u0435 \u0446\u0438\u0444\u0440\u044b 4 \u0438 7. \u041d\u0430\u043f\u0440\u0438\u043c\u0435\u0440, \u0447\u0438\u0441\u043b\u0430 47, 744, 4 \u044f\u0432\u043b\u044f\u044e\u0442\u0441\u044f \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u044b\u043c\u0438, \u0430 5, 17, 467 \u2014 \u043d\u0435 \u044f\u0432\u043b\u044f\u044e\u0442\u0441\u044f.\n * \n * \u041f\u0435\u0442\u044f \u043d\u0430\u0437\u044b\u0432\u0430\u0435\u0442 \u0447\u0438\u0441\u043b\u043e \u043f\u043e\u0447\u0442\u0438 \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u044b\u043c, \u0435\u0441\u043b\u0438 \u043e\u043d\u043e \u0434\u0435\u043b\u0438\u0442\u0441\u044f \u0431\u0435\u0437 \u043e\u0441\u0442\u0430\u0442\u043a\u0430 \u043d\u0430 \u043a\u0430\u043a\u043e\u0435-\u043b\u0438\u0431\u043e \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u043e\u0435 \u0447\u0438\u0441\u043b\u043e. \u041f\u043e\u043c\u043e\u0433\u0438\u0442\u0435 \u0435\u043c\u0443 \u0443\u0437\u043d\u0430\u0442\u044c, \u044f\u0432\u043b\u044f\u0435\u0442\u0441\u044f \u043b\u0438 \u0437\u0430\u0434\u0430\u043d\u043d\u043e\u0435 \u0447\u0438\u0441\u043b\u043e n \u043f\u043e\u0447\u0442\u0438 \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u044b\u043c?\n * \u0412\u0445\u043e\u0434\u043d\u044b\u0435 \u0434\u0430\u043d\u043d\u044b\u0435\n * \n * \u0412 \u0435\u0434\u0438\u043d\u0441\u0442\u0432\u0435\u043d\u043d\u043e\u0439 \u0441\u0442\u0440\u043e\u043a\u0435 \u0437\u0430\u0434\u0430\u043d\u043e \u0446\u0435\u043b\u043e\u0435 \u0447\u0438\u0441\u043b\u043e n (1\u2009\u2264\u2009n\u2009\u2264\u20091000) \u2014 \u0447\u0438\u0441\u043b\u043e, \u043a\u043e\u0442\u043e\u0440\u043e\u0435 \u043d\u0443\u0436\u043d\u043e \u043f\u0440\u043e\u0432\u0435\u0440\u0438\u0442\u044c.\n * \u0412\u044b\u0445\u043e\u0434\u043d\u044b\u0435 \u0434\u0430\u043d\u043d\u044b\u0435\n * \n * \u0412 \u0435\u0434\u0438\u043d\u0441\u0442\u0432\u0435\u043d\u043d\u043e\u0439 \u0441\u0442\u0440\u043e\u043a\u0435 \u0432\u044b\u0432\u0435\u0434\u0438\u0442\u0435 \u00abYES\u00bb (\u0431\u0435\u0437 \u043a\u0430\u0432\u044b\u0447\u0435\u043a), \u0435\u0441\u043b\u0438 \u0447\u0438\u0441\u043b\u043e n \u043f\u043e\u0447\u0442\u0438 \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u043e\u0435, \u0438\u043d\u0430\u0447\u0435 \u0432\u044b\u0432\u0435\u0434\u0438\u0442\u0435 \u00abNO\u00bb (\u0431\u0435\u0437 \u043a\u0430\u0432\u044b\u0447\u0435\u043a). \n */\n \ndefine('DEBUG', 0);\n\ndefine('LIMIT', 1000);\n\nfunction doLog($log) {\n\tif (DEBUG) {\n\t\techo \"[\" . microtime(true) .\"] \" . $log . \"\\n\";\n\t}\n}\n\nfunction combinations($chars, $length)\n{\n\tdoLog(\"Length $length.\");\n\tif ($length == 1) {\n\t\treturn array_merge($chars);\n\t}\n\t\n\t$results = [];\n\tforeach ($chars as $char) {\n\t\tforeach (combinations($chars, $length-1) as $combination) {\n\t\t\t$results[$combination] = $combination;\n\t\t\t$results[$char . $combination] = $char . $combination;\n\t\t}\n\t}\n\t\n\treturn array_keys($results);\n}\n\nfunction solve($n) \n{\n\t$happyDigits = ['4', '7'];\n\t\n\t$happyNumbers = combinations($happyDigits, 3);\n\t\n\t// seeding happy numbers\n\t$seed = array_fill(1, LIMIT, false);\n\t\n\tforeach ($happyNumbers as $happyNumber) {\n\t\tdoLog(\"Seeding $happyNumber.\");\n\t\t$index = 2*$happyNumber;\n\t\twhile ($index <= LIMIT) {\n\t\t\t$seed[$index] = true;\n\t\t\t$index+=$happyNumber;\n\t\t}\n\t}\n\t\n\tforeach ($happyNumbers as $happyNumber) {\n\t\t$seed[$happyNumber] = true;\n\t}\n\n\treturn $seed[$n] ? 'YES' : 'NO';\n}\n\nlist($n) = explode(' ', trim(fgets(STDIN)));\n\n$result = solve($n);\n\ndoLog($result . \"\\n\");\n\necho $result;\n\n"}, {"source_code": "<?php\n\n$nr = trim(fgets(STDIN));\n$arr = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777];\n\nfor ($i = 0; $i < count($arr); $i++) {\n    if ($nr % $arr[$i] == 0) {\n        echo 'YES';\n        exit(0);\n    }\n}\necho 'NO';\n"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$l = array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\nforeach($l as $v)\n    if($n%$v==0){\n    echo 'YES';\n    exit(0);\n}\necho 'NO';"}, {"source_code": "<?php\n\n$n = (int) readline();\n\n$test_cases = [4, 7, 47, 74, 44, 77, 444, 447, 474, 477, 744, 747, 777];\n$flag = false;\nforeach($test_cases as $num){\n    if($n % $num == 0){\n        $flag= true;\n        break;\n    }\n}\n\nif($flag){\n    echo \"YES\";\n}else{\n    echo \"NO\";\n}"}, {"source_code": "<?php\n$num = intval(fgets(STDIN));\n$bookmark=0;\n$happy = array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\nforeach ($happy as $key) {\n    if ($num % $key == 0) {\n        $bookmark++;\n    }\n}\nif ($bookmark>0)echo \"YES\";\nelse echo \"NO\";"}, {"source_code": "<?php\n\nfor ($i = 1; $i < 1001; $i++) {\n    $str[$i] = $i;\n}\n$happy_numbers = preg_grep('/^[47]{1}[47]*$/', $str);\nfscanf(STDIN, '%d', $number);\n$ch = 0;\nforeach ($happy_numbers as $value) {\n    if (($number % $value) == 0) {\n        $ch = $ch + 1;\n        break;\n    }\n} \n\nif ($ch > 0) {\n    echo \"YES\";\n} else {\n    echo \"NO\";\n}"}, {"source_code": "<?php\nfscanf(STDIN,\"%d\",$n);\n$array=[\n\t0=>4,\n\t1=>7,\n\t2=>47,\n\t3=>74,\n\t4=>447,\n\t5=>474,\n\t6=>477,\n\t7=>744,\n\t8=>774\n\n];\n$flag=0;\nfor($i=0;$i<count($array);$i++)\n{\n\tif(($n%$array[$i])==0)\n\t{\n\t\techo \"YES\";\n\t\t$flag=1;\n\t\tbreak;\n\t}\n}\nif($flag==0)\necho \"NO\";"}, {"source_code": "<?php\n$numb = trim(fgets(STDIN));\n$r=0;\n$check = array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\nfor($i=0;$i<count($check);$i++){\n    if ($numb%$check[$i]==0){\n        $r++;\n}\n}\nif($r > 0)\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\nfscanf(STDIN, \"%s\\n\", $s);\n\n$result = false;\n\n$number = (int) $s;\n\n$digit_array = str_split($s, 1);\n$lucky_array = array(4, 7);\n\n$is_lucky = false;\nforeach ($digit_array as $digit) {\n    if (!in_array($digit, $lucky_array)){\n        $is_lucky = false;\n        break;\n    }\n    $is_lucky = true;\n}\n\n$is_almost_lucky = false;\n\nif (($number % 4 == 0) || ($number % 7 == 0) || ($number % 44 == 0) || ($number % 47 == 0) || ($number % 74 == 0) || ($number % 77 == 0)) {\n    $is_almost_lucky = true;\n}\nelse {\n    $is_almost_luck = false;\n}\n\nif ($is_lucky || $is_almost_lucky) {\n    $result = true;\n}\n\necho $result ? \"YES\" : \"NO\";\n\n?>"}, {"source_code": "<?php\nfscanf(STDIN,\"%s\",$n);\n$lucky_number = array(4, 7, 44, 47, 74, 77, 444, 447, 477, 744, 774, 777);\n$aa = 0;\nfor($i = 0; $i < count($lucky_number); ++$i) {\n\tif($n%$lucky_number[$i] == 0) {\n\t\t++$aa;\n\t}\n}\necho ($aa > 0 ? \"YES\" : \"NO\");"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$arr = array(4, 7, 47, 74, 447, 474, 477);\n$str = \"NO\";\nforeach($arr as $value){\n    if ($n % $value == 0){\n        $str = \"YES\";\n        break;\n    }\n}\necho $str;\n?>"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n\n$mas = array(4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777);\n$val = false;\nforeach ($mas as $v)\n{\n    if ($n % $v == 0)\n    {\n        $val = true;\n        break;\n    }\n}\necho $val ? \"YES\" : \"NO\";\n\n?>"}, {"source_code": "<?php\n$input = explode(\"\\n\", trim(file_get_contents(\"php://stdin\")));\n$hns = array(4,7,44,47,74,77,444,474,477,744,774,777);\n$n = $input[0];\n$result = 'NO';\nforeach($hns as $hn){\n    if($n%$hn == 0){\n        $result = 'YES';\n        break;\n    }\n}\necho $result;"}, {"source_code": "<?php\n\n//First Get The Input.\n$input = file_get_contents(\"php://stdin\");\n\nfunction lucky_number ($num) {\n    \n    //Find All The Lucky Number Under (1000).\n    $lucky = array(4,7,47,74,44,77,444,744,774,777,477,447,474,747);\n    \n    //Loop Throw The (Lucky) Array.\n    for($i = 0;$i < count($lucky);$i++) {\n        \n        //Check If It's Divisible By a Lucky Number.\n        if($num % $lucky[$i] == 0) {\n                \n            return \"YES\";\n            \n        }\n        \n    }\n    \n    return \"NO\";\n    \n} \n\necho lucky_number($input);\n\n?>"}, {"source_code": "<?php\n$ada=false;\n$i=0;\n$a= array(4,7,44,47,77,74,444,447,477,744,747,774,777); \n$s = trim(fgets(STDIN));\n\nwhile ($i < count($a)) {\n\tif($s%$a[$i]==0){\n\t\t$ada=true;\n\t\tbreak;\n\t}\n\t$i++;\n}\necho !$ada ? \"NO\":\"YES\";\n\n\n?>"}, {"source_code": "<?php\n$ada=false;\n$i=0;\n$a= array(4,7,44,47,77,74,444,447,477,744,747,774,777); \n$s = trim(fgets(STDIN));\n\nwhile ($i < count($a)) {\n\tif($s%$a[$i]==0){\n\t\t$ada=true;\n\t}\n\t$i++;\n}\nif($ada){\n\techo \"YES\";\n}else{\n\techo \"NO\";\n}\n\n\n?>"}, {"source_code": "<?php\n$ada=false;\n$a= array(4,7,44,47,77,74,444,447,477,744,747,774,777); \n$s = trim(fgets(STDIN));\n\nforeach ($a as $value) {\n\tif($s%$value==0){\n\t\t$ada=true;\n\t\tbreak;\n\t}\n}\n\necho !$ada ? \"NO\":\"YES\";\n\n\n?>"}, {"source_code": "<?php\n// 122A \t   \u0421\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u043e\u0435 \u0434\u0435\u043b\u0435\u043d\u0438\u0435 \n\n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n$n = (int) $input_line;\n\n$out = 'NO';\n\nfor ($i=4; $i <= $n; $i++) { \n    $str = (string) $i;\n    if ((substr_count($str, '4') + substr_count($str, '7')) == strlen($str)) {\n        if (($n % $i) == 0) {\n            $out = 'YES';\n            break;\n        }\n    }\n}\n\necho $out;\n\n?>\n"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d\\n\",$a);\n    $sp = [4,7,47,74,444,447,474,477,744,747,777];\n    if (in_array($a,$sp))\n    {\n            echo \"YES\";\n            exit;\n    }\n    foreach ($sp as $num)\n    {\n        if ($a % $num === 0)\n        {\n            echo \"YES\";\n            exit;\n        }\n    }\n    echo \"NO\";\n?>"}, {"source_code": "<?php\n$input=trim(fgets(STDIN));\n$array=array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\n$ok=0;\nforeach($array as $v){\n    if($input%$v==0){\n        $ok=1;\n        break;\n    }\n}\nif($ok==1) echo \"YES\";else echo \"NO\";"}, {"source_code": "<?\n$n=trim(fgets(STDIN));\n$happy=array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\n$tmp=0;\nforeach($happy as &$v){\n    if($n%$v==0){\n        $tmp=1;\n        break;\n    }\n}\nif($tmp==1) echo \"YES\";\nelse echo \"NO\";\n?>"}, {"source_code": "<?php\n$number = fgets(STDIN);\n$number = trim($number);\n\n$counter = 0;\n\nfor ($i=0; $i < strlen($number); $i++) { \n\tif(($number[$i] == \"4\") || ($number[$i] == \"7\")){\n\t\t$counter++;\n\t}\n\n}\n\nif($counter == strlen($number)){\n\t\techo \"YES\";\n\t\texit();\n\t} elseif(intval($number) % 4 == 0) {\n\t\techo \"YES\";\n\t\texit();\n\t} elseif(intval($number) % 7 == 0) {\n\t\techo \"YES\";\n\t\texit();\n\t} elseif(intval($number) % 47 == 0) {\n\t\techo \"YES\";\n\t} elseif(intval($number) % 74 == 0) {\n\t\techo \"YES\";\n\t} else {\n\t\techo \"NO\";\n\t\texit();\n\t}\n"}, {"source_code": "<?php\nfunction check($n) {\n    $tab = array(4, 7, 44, 47, 74, 77, 444, 447, 474, 744, 777, 774, 747, 477);\n    for ($i = 0; $i < count($tab); $i++) {\n        if (!($n % $tab[$i])) return true;\n    }   \n    return false;\n}\n\nfscanf(STDIN, '%d', $n);\necho check($n) ? 'YES' : 'NO'; \n\n"}, {"source_code": "<?php\n    $check = false;\n    $arr = [4,7,44,47,74,77,444,447,474,477,744,747,774,777];\n\t$number = trim(fgets(STDIN)) ;\n\tfor ($i=0; $i < count($arr); $i++) { \n\t\tif($number % $arr[$i] == 0)\n\t\t\t$check = true ;\n\t}\n\tif($check)\n\t\techo \"YES\\n\";\n\telse\n\t\techo \"NO\\n\";\n?>"}, {"source_code": "<?php \n/**\n * @author Sunwarul\n */\nerror_reporting(0);\n$n = (int) fgets(STDIN);\n$arr = [4,7,47,74,44,444,447,474,477,777,774,744];\n$flag = false;\nfor($i=0; $i< count($arr); $i++)\n{\n    if($n % $arr[$i] == 0) {\n        $flag = true;\n    }\n}\nif($flag) {\n    echo \"YES\\n\";\n} else {\n    echo \"NO\\n\";\n}"}, {"source_code": " <?php\n$n=trim(fgets(STDIN));\n$happy=array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\n$temp=0;\nforeach($happy as &$v)\n{ \n  if($n%$v==0)\n  {  \n     $temp=1; \n     break;\n    \n  }\n}\n\nif($temp==1)\necho \"YES\";\nelse   \necho \"NO\";\n?>\n"}, {"source_code": "<?php\n\tfscanf(STDIN, \"%s\", $n);\n\t$c = 0;\n\tfor($i = 0; $i < strlen($n); $i++)\n\t\t$c += ($n[$i] == '4' || $n[$i] == '7');\n\techo ($c == strlen($n) || $n % 4 == 0 || $n % 7 == 0 || $n % 47 == 0 ? \"YES\" : \"NO\");\n?>"}, {"source_code": "<?php\n\n$n = trim(fgets(STDIN));\n\n$l = array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\n\nforeach($l as $v) if($n%$v==0){print 'YES'; exit(0);}\n\nprint 'NO';\n?>"}, {"source_code": "<?php\n//\u6253\u8868\n//for ($i = 1; $i <= 1000; $i++){\n//    \n//}\n\nwhile (fscanf(STDIN, \"%s\", $string)){\n    $length = strlen($string);\n    $lucky = 0;\n    for ($i = 0; $i < $length; ++$i){\n        if (4 == $string[$i] || 7 == $string[$i]){\n            ++$lucky;\n        }\n    }\n    \n    if ($length == $lucky){\n        echo \"YES\\n\";\n    } else {\n        $number = (int)$string;\n        $flag = 0;\n        for ($n = 1; $n < $number; $n++){\n            if ($number % $n == 0){\n                $lucky = 0;\n                $n_str = (string)$n;\n                $n_length = strlen($n);\n                for ($m = 0; $m < $n_length; $m++){\n                    if (4 == $n_str[$m] || 7 == $n_str[$m]){\n                        ++$lucky;\n                    }\n                }\n                if ($lucky == $n_length){\n                    echo \"YES\\n\";\n                    $flag = 1;\n                    break;\n                } \n            }\n        }\n        \n        if (!$flag){\n            echo \"NO\\n\";\n        }\n    }\n}"}, {"source_code": "<?php\n\t$arr = [4,7,44,47,74,77,444,447,474,477,747,777];\n\t$input = trim(fgets(STDIN));\n\tif(in_array($input, $arr)){\n\t\techo \"YES\"; die();\n\t}\n\tforeach ($arr as $key => $value) {\n\t\tif($input % $value == 0){\n\t\t\techo \"YES\";die();\n\t\t}\n\t}\n\techo \"NO\";\n?>"}, {"source_code": "<?php\n$n=(int)readline();\nif($n%4==0 | $n%7==0 | $n%47==0 )\necho \"YES\";\nelse{\n$a=str_split($n);\nfor($i=0;$i<count($a);$i++){\n    if($n%10==4|$n%10==7){\n        if($n==4 | $n==7){\n        echo \"YES\";\n        break;\n        }\n        $n=floor($n/10);\n    }\n    else{\n        echo \"NO\";\n        break;\n    }\n}\n}"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = array(\"4\", \"7\", \"44\", \"47\", \"74\", \"77\", \"444\", \"447\", \"474\", \"477\", \"744\", \"747\", \"774\", \"777\",);\n$c = 0;\nfor($x = 0; $x < count($b); $x++)\n{\n    if($a % $b[$x] == 0)\n    {\n        $c++;\n    }\n}\nif($c > 0)\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\n\t$flag = false;\n\t$lucky = array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\n\t$var = trim(fgets(STDIN));\n\tif ((strlen($var) - substr_count($var, '4') - substr_count($var, '7')) > 0) {\n\t\tforeach ($lucky as $l) {\n\t\t\tif ((int)$var % $l == 0) {\n\t\t\t\techo 'YES';\n\t\t\t\t$flag = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif ($flag == false) echo 'NO';\n\t}\n\telse echo 'YES';"}, {"source_code": "<?php\n\t$flag = false;\n\t$lucky = array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\n\t$var = trim(fgets(STDIN));\n\tif (in_array((int)$var,$lucky)) {\n\t\techo 'YES';\n\t} else {\n\t\tforeach ($lucky as $l) {\n\t\t\tif ((int)$var % $l == 0) {\n\t\t\t\techo 'YES';\n\t\t\t\t$flag = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif ($flag == false) echo 'NO';\n\t}"}], "negative_code": [{"source_code": "<?php\n\t$var = (string)fgets(STDIN);\n\tif ((strlen($var) - substr_count($var, '4') - substr_count($var, '7')) > 0) echo 'NO';\n\telse echo 'YES';"}, {"source_code": "<?php\n\t$var = (string)fgets(STDIN);\n\tif (substr_count($var, '4') > 0 || substr_count($var, '7') > 0) echo 'YES';\n\telse echo 'NO';"}, {"source_code": "<?php\n\t$var = (string)fgets(STDIN);\n\tif (strlen($var) - substr_count($var, '4') - substr_count($var, '7') > 0) echo 'NO';\n\telse echo 'YES';"}, {"source_code": "<?php\n\t$var = trim(fgets(STDIN));\n\tif ((strlen($var) - substr_count($var, '4') - substr_count($var, '7')) > 0) {\n\t\tif ((int)$var % 4 == 0 || (int)$var % 7 == 0) echo 'YES';\n\t\techo 'NO';\n\t}\n\telse echo 'YES';"}, {"source_code": "<?php\n$handle = fopen (\"php://stdin\",\"r\");\nfscanf($handle,\"%d\",$n);\n\n$a=[\n4,\n7,\n44,\n47,\n74,\n77,\n444,\n447,\n474,\n477,\n744,\n747,\n774,\n777,\n];\n\n$val=true;\nfor ($i=0; $i < count($a); $i++) { \n\tif($n % $a[$i] != 0){\n\t\t$val = false;\n\t\tbreak;\n\t}\n}\nif($val){\n\t\techo \"YES\";\n}else{\n\techo \"NO\";\n}"}, {"source_code": "<?php\n$string = trim(fgets(STDIN));\n$values = str_split($string);\n$contador = 0;\nfor ($x = 0; $x < count($values); $x++) {\n    if ($values[$x] == '7' || $values[$x] == '4') {\n        $contador++;\n    }\n}\n\nif ($contador ==count($values) || $string  % 4 == 0 || $string  % 7 == 0 ) {\n    echo \"YES\";\n} else {\n    echo \"NO\";\n}"}, {"source_code": "<?php\n\n$flag = 1; //must be not zero for STDIN\n$in = 'php://stdin';\nif (!$flag)\n{\n    $in = \"input.txt\";\n}\nfscanf(STDIN, \"%d\\n\", $n);\n$div = array(\"4\", \"7\", \"44\", \"47\", \"74\", \"77\", \"444\", \"777\", \"447\", \"474\", \"744\", \"477\", \"747\", \"774\");\n$length = count($div);\n\n\nfor ($flag = 0, $c = 0; $c < $length; $c++)\n{\n    $s = $n / (intval($div[$c]));\n    if (is_int($s))\n    {\n        $flag++;\n        break;\n    }\n}\nprint $flag;\n?>"}, {"source_code": "<?php\n    $stdin = fopen('php://stdin', 'r');\n    \n    fscanf($stdin, \"%s\", $n);\n    \n    $len = strlen($n);\n    \n    $lucky = false;\n    for($i=0; $i<$len; $i++){\n        if($n[$i] == '4' && $n[$i+1] == '7') $lucky = true;\n    }\n    $almostLucky = false;\n    $n = (int)$n;\n    if($n%4 == 0 || $n%7 == 0) $almostLucky = true;\n    \n    if($lucky == true || $almostLucky == true) echo \"YES\";\n    else echo \"NO\";\n    \n    fclose($stdin);\n?>\n"}, {"source_code": "<?php\n\n/**\n * \u041f\u0435\u0442\u044f \u043b\u044e\u0431\u0438\u0442 \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u044b\u0435 \u0447\u0438\u0441\u043b\u0430. \u0412\u0441\u0435\u043c \u0438\u0437\u0432\u0435\u0441\u0442\u043d\u043e, \u0447\u0442\u043e \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u044b\u043c\u0438 \u044f\u0432\u043b\u044f\u044e\u0442\u0441\u044f \u043f\u043e\u043b\u043e\u0436\u0438\u0442\u0435\u043b\u044c\u043d\u044b\u0435 \u0446\u0435\u043b\u044b\u0435 \u0447\u0438\u0441\u043b\u0430, \u0432 \u0434\u0435\u0441\u044f\u0442\u0438\u0447\u043d\u043e\u0439 \u0437\u0430\u043f\u0438\u0441\u0438 \u043a\u043e\u0442\u043e\u0440\u044b\u0445 \u0441\u043e\u0434\u0435\u0440\u0436\u0430\u0442\u0441\u044f \u0442\u043e\u043b\u044c\u043a\u043e \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u044b\u0435 \u0446\u0438\u0444\u0440\u044b 4 \u0438 7. \u041d\u0430\u043f\u0440\u0438\u043c\u0435\u0440, \u0447\u0438\u0441\u043b\u0430 47, 744, 4 \u044f\u0432\u043b\u044f\u044e\u0442\u0441\u044f \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u044b\u043c\u0438, \u0430 5, 17, 467 \u2014 \u043d\u0435 \u044f\u0432\u043b\u044f\u044e\u0442\u0441\u044f.\n * \n * \u041f\u0435\u0442\u044f \u043d\u0430\u0437\u044b\u0432\u0430\u0435\u0442 \u0447\u0438\u0441\u043b\u043e \u043f\u043e\u0447\u0442\u0438 \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u044b\u043c, \u0435\u0441\u043b\u0438 \u043e\u043d\u043e \u0434\u0435\u043b\u0438\u0442\u0441\u044f \u0431\u0435\u0437 \u043e\u0441\u0442\u0430\u0442\u043a\u0430 \u043d\u0430 \u043a\u0430\u043a\u043e\u0435-\u043b\u0438\u0431\u043e \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u043e\u0435 \u0447\u0438\u0441\u043b\u043e. \u041f\u043e\u043c\u043e\u0433\u0438\u0442\u0435 \u0435\u043c\u0443 \u0443\u0437\u043d\u0430\u0442\u044c, \u044f\u0432\u043b\u044f\u0435\u0442\u0441\u044f \u043b\u0438 \u0437\u0430\u0434\u0430\u043d\u043d\u043e\u0435 \u0447\u0438\u0441\u043b\u043e n \u043f\u043e\u0447\u0442\u0438 \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u044b\u043c?\n * \u0412\u0445\u043e\u0434\u043d\u044b\u0435 \u0434\u0430\u043d\u043d\u044b\u0435\n * \n * \u0412 \u0435\u0434\u0438\u043d\u0441\u0442\u0432\u0435\u043d\u043d\u043e\u0439 \u0441\u0442\u0440\u043e\u043a\u0435 \u0437\u0430\u0434\u0430\u043d\u043e \u0446\u0435\u043b\u043e\u0435 \u0447\u0438\u0441\u043b\u043e n (1\u2009\u2264\u2009n\u2009\u2264\u20091000) \u2014 \u0447\u0438\u0441\u043b\u043e, \u043a\u043e\u0442\u043e\u0440\u043e\u0435 \u043d\u0443\u0436\u043d\u043e \u043f\u0440\u043e\u0432\u0435\u0440\u0438\u0442\u044c.\n * \u0412\u044b\u0445\u043e\u0434\u043d\u044b\u0435 \u0434\u0430\u043d\u043d\u044b\u0435\n * \n * \u0412 \u0435\u0434\u0438\u043d\u0441\u0442\u0432\u0435\u043d\u043d\u043e\u0439 \u0441\u0442\u0440\u043e\u043a\u0435 \u0432\u044b\u0432\u0435\u0434\u0438\u0442\u0435 \u00abYES\u00bb (\u0431\u0435\u0437 \u043a\u0430\u0432\u044b\u0447\u0435\u043a), \u0435\u0441\u043b\u0438 \u0447\u0438\u0441\u043b\u043e n \u043f\u043e\u0447\u0442\u0438 \u0441\u0447\u0430\u0441\u0442\u043b\u0438\u0432\u043e\u0435, \u0438\u043d\u0430\u0447\u0435 \u0432\u044b\u0432\u0435\u0434\u0438\u0442\u0435 \u00abNO\u00bb (\u0431\u0435\u0437 \u043a\u0430\u0432\u044b\u0447\u0435\u043a). \n */\n \ndefine('DEBUG', 0);\n\ndefine('LIMIT', 1000);\n\nfunction doLog($log) {\n\tif (DEBUG) {\n\t\techo \"[\" . microtime(true) .\"] \" . $log . \"\\n\";\n\t}\n}\n\nfunction combinations($chars, $length)\n{\n\tdoLog(\"Length $length.\");\n\tif ($length == 1) {\n\t\treturn array_merge($chars);\n\t}\n\t\n\t$results = [];\n\tforeach ($chars as $char) {\n\t\tforeach (combinations($chars, $length-1) as $combination) {\n\t\t\t$results[$combination] = $combination;\n\t\t\t$results[$char . $combination] = $char . $combination;\n\t\t}\n\t}\n\t\n\treturn array_keys($results);\n}\n\nfunction solve($n) \n{\n\t$happyDigits = ['4', '7'];\n\t\n\t$happyNumbers = combinations($happyDigits, 3);\n\t\n\t// seeding happy numbers\n\t$seed = array_fill(1, LIMIT, false);\n\t\n\tforeach ($happyNumbers as $happyNumber) {\n\t\tdoLog(\"Seeding $happyNumber.\");\n\t\t$index = 2*$happyNumber;\n\t\twhile ($index <= LIMIT) {\n\t\t\t$seed[$index] = true;\n\t\t\t$index+=$happyNumber;\n\t\t}\n\t}\n\t\n\tforeach ($happyNumbers as $happyNumber) {\n\t\t$seed[$index] = false;\n\t}\n\n\treturn $seed[$n] ? 'YES' : 'NO';\n}\n\nlist($n) = explode(' ', trim(fgets(STDIN)));\n\n$result = solve($n);\n\ndoLog($result . \"\\n\");\n\necho $result;\n\n"}, {"source_code": "<?php\n\n$nr = fgets(STDIN);\n\necho ($nr % 4 == 0 or $nr % 7 == 0) ? 'YES' : 'NO';"}, {"source_code": "<?php\n\n$nr = trim(fgets(STDIN));\n$arr = [4, 7, 47, 447, 474, 477, 744, 747, 777];\n\nfor ($i = 0; $i < count($arr); $i++) {\n    if ($nr % $arr[$i] == 0) {\n        echo 'YES';\n        break;\n    } else {\n        echo 'NO';\n        break;\n    }\n}\n"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\necho $n%4 == 0 || $n%7 == 0 || $n%47 == 0 || $n%744 == 0 ? 'YES' : 'NO';"}, {"source_code": "<?php\n$num = trim(fgets(STDIN));\n$bookmark=0;\nif (($num%4==0)||($num%7==0))echo \"YES\";\nelse\n{\n    $num=str_split($num,1);\n    for ($i=0;$i<count($num);$i++)\n    {\n        if (($num[$i]!=\"4\") && ($num[$i]!=\"7\")) $bookmark++;\n    }\n    if ($bookmark!=0)echo \"NO\";\n    else echo \"YES\";\n}"}, {"source_code": "<?php\n$numb = trim(fgets(STDIN));\n$check = [4,7,44,47,74,77,444,447,474,477,744,747,774,777];\nfor($i=0;$i<strlen($check);$i++){\n    if ($numb%$check[$i]==0){\n        print \"YES\";\n    }else{\n        print \"NO\";\n    };\n}\n?>"}, {"source_code": "<?php\n$numb = trim(fgets(STDIN));\n$check = array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\nfor($i=0;$i<strlen($check);$i++){\n    if ($numb%$check($i)==0){\n        echo \"YES\";\n        break;\n    }else{\n        echo \"NO\";\n    };\n}\n?>"}, {"source_code": "<?php\n$numb = trim(fgets(STDIN));\n$check = [4,7,44,47,74,77,444,447,474,477,744,747,774,777];\nfor($i=0;$i<strlen($check);$i++){\n    if ($numb%$check[$i]==0){\n        echo \"YES\";\n        break;\n    }else{\n        echo \"NO\";\n    };\n}\n?>"}, {"source_code": "<?php\n$numb = trim(fgets(STDIN));\n$check = [4,7,44,47,74,77,444,447,474,477,744,747,774,777];\nfor($i=0;$i<strlen($check);$i++){\n    if ($numb%$check[$i]==0){\n        echo \"YES\";\n    }else{\n        echo \"NO\";\n    };\n}\n?>"}, {"source_code": "<?php\nfscanf(STDIN, \"%s\\n\", $s);\n\n$result = false;\n\n$number = (int) $s;\n\n$digit_array = str_split($s, 1);\n$lucky_array = array(4, 7);\n\n$is_lucky = false;\nforeach ($digit_array as $digit) {\n    if (!in_array($digit, $lucky_array)){\n        $is_lucky = false;\n        break;\n    }\n    $is_lucky = true;\n}\n\n$is_almost_lucky = false;\n\nif (($number % 4 == 0) || ($number % 7 == 0)) {\n    $is_almost_lucky = true;\n}\nelse {\n    $is_almost_luck = false;\n}\n\nif ($is_lucky || $is_almost_lucky) {\n    $result = true;\n}\n\necho $result ? \"YES\" : \"NO\";\n\n?>"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n\nfor ($i = 0; $i < strlen($n); $i++)\n    if ($n[$i] == \"4\" || $n[$i] == \"7\")\n        $k++;\nif ($k == strlen($n))\n{\n    echo \"YES\";\n    exit;\n}\n\necho $n % 4 == 0 || $n % 7 == 0 ? \"YES\" : \"NO\"; \n\n?>"}, {"source_code": "<?php\n$input = explode(\"\\n\", trim(file_get_contents(\"php://stdin\")));\n$n = $input[0];\necho $n % 4 == 0 || $n % 7 == 0 ? 'YES' : 'NO';"}, {"source_code": "<?php\n\n//First Get The Input.\n$input = file_get_contents(\"php://stdin\");\n\n//Check If It's Divisible By (4) or (7).\nif($input % 7 == 0 || $input % 4 == 0 || $input % 47 == 0 || $input % 74 == 0) {\n    \n    echo \"YES\";\n    \n}else {\n    \n    echo \"NO\";\n    \n}\n\n?>"}, {"source_code": "<?php\n\n//First Get The Input.\n$input = file_get_contents(\"php://stdin\");\n\n//Check If It's Divisible By (4) or (7).\nif($input % 7 == 0 || $input % 4 == 0) {\n    \n    echo \"YES\";\n    \n}else {\n    \n    echo \"NO\";\n    \n}\n\n?>"}, {"source_code": "<?php\n$ada=false;\n$i=0;\n$s = trim(fgets(STDIN));\nif ($s % 4 == 0) {\n\techo \"YES\";\n}elseif ($s % 7 == 0) {\n\techo \"YES\";\n}else{\n\t$a=strval($s);\n\twhile ($i < strlen($a)) {\n\t\tif ($a[$i] != \"4\" && $a[$i] != \"7\")\n\t\t{\n\t\t\t$ada=true;\n\t\t\tbreak;\n\t\t}else{\n\t\t\t$ada=false;\n\t\t}\n\t\t$i++;\t\n\t}\n\tif (!$ada) {\n\t\techo \"YES\";\n\t}else{\n\t\techo \"NO\";\n\t}\n}\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d\\n\",$a);\n    $sp = [4,7,47,74,444,447,474,477,744,747,777];\n    foreach ($sp as $num)\n    {\n        if (($a % $num !== 0) || (in_array($a,$sp)))\n        {\n            echo \"YES | \".$a.\" | \".$num;\n            exit;\n        }\n    }\n    echo \"NO\";\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d\\n\",$a);\n    $sp = [4,7,47,74,444,447,474,477,744,747,777];\n    foreach ($sp as $num)\n    {\n        if (($a % $num !== 0) && (!in_array($a,$sp)))\n        {\n            echo \"NO\";\n            exit;\n        }\n    }\n    echo \"YES\";\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d\\n\",$a);\n    $sp = [4,7,47,74,444,447,474,477,744,747,777];\n    foreach ($sp as $num)\n    {\n        if ($a % $num !== 0) \n        {\n            echo \"YES\";\n            exit;\n        }\n    }\n    echo \"NO\";\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d\\n\",$a);\n    $sp = [4,7,47,74,444,447,474,477,744,747,777];\n    if (in_array($a,$sp))\n    {\n            echo \"YES\";\n            exit;\n    }\n    foreach ($sp as $num)\n    {\n        if ($a % $num !== 0)\n        {\n            echo \"NO\";\n            exit;\n        }\n    }\n    echo \"YES\";\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d\\n\",$a);\n    $sp = [4,7,47,74,444,447,474,477,744,747,777];\n    foreach ($sp as $num)\n    {\n        if (($a % $num !== 0))\n        {\n            echo \"YES\";\n            exit;\n        }\n    }\n    echo \"NO\";\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d\\n\",$a);\n    $sp = [4,7,47,74,444,447,474,477,744,747,777];\n    foreach ($sp as $num)\n    {\n        if (($a % $num !== 0) || (in_array($a,$sp)))\n        {\n            echo \"YES\";\n            exit;\n        }\n    }\n    echo \"NO\";\n?>"}, {"source_code": "<?php\n$array=array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\n$input = fgets(STDIN,1);//\nif(in_array($input,$array)) echo \"YES\"; else echo \"NO\";"}, {"source_code": "<?php\n$array=array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\n$input=trim(fgets(STDIN));\nif(in_array($input,$array)) echo \"YES\"; else echo \"NO\";"}, {"source_code": "<?php\n$array=array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\n//$input = fgets(STDIN,1);\n$input=4;\nif(in_array($input,$array)) echo \"YES\"; else echo \"NO\";"}, {"source_code": "<?php\n$array=array(4,7,44,47,74,77,444,447,474,477,744,747,774,777);\n$input = fgets(STDIN,1);\nif(in_array($input,$array)) echo \"YES\"; else echo \"NO\";"}, {"source_code": "<?php\n$number = fgets(STDIN);\n$number = trim($number);\n\n$counter = 0;\n\nfor ($i=0; $i < strlen($number); $i++) { \n\tif(($number[$i] == \"4\") || ($number[$i] == \"7\")){\n\t\t$counter++;\n\t}\n\n}\n\nif($counter == strlen($number)){\n\t\techo \"YES\";\n\t\texit();\n\t} elseif(intval($number) % 4 == 0) {\n\t\techo \"YES\";\n\t\texit();\n\t} elseif(intval($number) % 7 == 0) {\n\t\techo \"YES\";\n\t\texit();\n\t} else {\n\t\techo \"NO\";\n\t\texit();\n\t}\n"}, {"source_code": "<?php\nfunction check($n) {\n$tab = array(4, 7, 44, 47, 74, 77, 444, 447, 474, 744, 777, 774, 747, 744);\n    for ($i = 0; $i < count($tab); $i++) {\n        if (!($n % $tab[$i])) return true;\n    }\n    return false;\n}\n\nfscanf(STDIN, '%d', $n);\necho check($n) ? 'YES' : 'NO'; \n\n"}, {"source_code": "<?php\nfunction check($n) {\n    $n = (string)$n;\n    for($i = 0; $i < strlen($n); $i++) {\n        if (intVal($n[$i]) != 4 AND intVal($n[$i]) != 7) return false; \n    }\n    return true;\n}\n\nfscanf(STDIN, '%d', $n);\necho (check($n) OR !($n % 4) OR !($n % 7)) ? 'YES' : 'NO'; \n\n"}, {"source_code": "<?php\n//\u6253\u8868\n//for ($i = 1; $i <= 1000; $i++){\n//    \n//}\n\nwhile (fscanf(STDIN, \"%s\", $string)){\n    $length = strlen($string);\n    $lucky = 0;\n    for ($i = 0; $i < $length; ++$i){\n        if (4 == $string[$i] || 7 == $string[$i]){\n            ++$lucky;\n        }\n    }\n    \n    if ($length == $lucky){\n        echo \"YES\\n\";\n    } else {\n        $number = (int)$string;\n        if ($number % 4 == 0 || $number % 7 == 0){\n            echo \"YES\\n\";\n        } else {\n            echo \"NO\\n\";\n        }\n    }\n}"}, {"source_code": "<?php\n\t$arr = [4,7];\n\tfor ($i=4; $i <= 1000 ; $i++) { \n\t\tif(strpos($i, '4')!==false && strpos($i, '7')!==false) $arr[] = $i;\n\t}\n\t$input = trim(fgets(STDIN));\n\tif(in_array($input, $arr)){\n\t\techo \"YES\"; die();\n\t}\n\tforeach ($arr as $key => $value) {\n\t\tif($input % $value == 0){\n\t\t\techo \"YES\";die();\n\t\t}\n\t}\n\techo \"NO\";\n?>"}, {"source_code": "<?php\n\t$arr = [4,7,44,47,74,77,444,447,474,747,777];\n\t$input = trim(fgets(STDIN));\n\tif(in_array($input, $arr)){\n\t\techo \"YES\"; die();\n\t}\n\tforeach ($arr as $key => $value) {\n\t\tif($input % $value == 0){\n\t\t\techo \"YES\";die();\n\t\t}\n\t}\n\techo \"NO\";\n?>"}, {"source_code": "<?php\n\t$arr = [4,7];\n\tfor ($i=4; $i <= 1000 ; $i++) { \n\t\tif(preg_match('/[^47]{0}[47]+[^47]{0}/', $i)) $arr[] = $i;\n\t}\n\t$input = trim(fgets(STDIN));\n\tif(in_array($input, $arr)){\n\t\techo \"YES\"; die();\n\t}\n\tforeach ($arr as $key => $value) {\n\t\tif($input % $value == 0){\n\t\t\techo \"YES\";die();\n\t\t}\n\t}\n\techo \"NO\";\n?>"}, {"source_code": "<?php\n$n=(int)readline();\nif($n%4==0 || $n%7==0)\necho \"YES\";\nelse{\n$a=str_split($n);\nfor($i=0;$i<count($a);$i++){\n    if($n%10==4||$n%10==7){\n        if($n==4 || $n==7){\n        echo \"YES\";\n        break;\n        }\n        $n=floor($n/10);\n    }\n    else{\n        echo \"NO\";\n        break;\n    }\n}\n}"}, {"source_code": "<?php\n\t$var = trim(fgets(STDIN));\n\tif ((strlen($var) - substr_count($var, '4') - substr_count($var, '7')) > 0) {\n\t\tif ((int)$var % 4 == 0 || (int)$var % 7 == 0) echo 'YES';\n\t\telse echo 'NO';\n\t}\n\telse echo 'YES';"}, {"source_code": "<?php\n\t$var = trim(fgets(STDIN));\n\tif ((strlen($var) - substr_count($var, '4') - substr_count($var, '7')) > 0) echo 'NO';\n\telse echo 'YES';"}], "src_uid": "78cf8bc7660dbd0602bf6e499bc6bb0d"}
{"nl": {"description": "There is a legend in the IT City college. A student that failed to answer all questions on the game theory exam is given one more chance by his professor. The student has to play a game with the professor.The game is played on a square field consisting of n\u2009\u00d7\u2009n cells. Initially all cells are empty. On each turn a player chooses and paint an empty cell that has no common sides with previously painted cells. Adjacent corner of painted cells is allowed. On the next turn another player does the same, then the first one and so on. The player with no cells to paint on his turn loses.The professor have chosen the field size n and allowed the student to choose to be the first or the second player in the game. What should the student choose to win the game? Both players play optimally.", "input_spec": "The only line of the input contains one integer n (1\u2009\u2264\u2009n\u2009\u2264\u20091018) \u2014 the size of the field.", "output_spec": "Output number 1, if the player making the first turn wins when both players play optimally, otherwise print number 2.", "sample_inputs": ["1", "2"], "sample_outputs": ["1", "2"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = bcmod($a, 2);\nif($b == 1)\n{\n     print \"1\";\n}\nelse\n{\n     print \"2\";\n}\n?>"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$n = bcmod($n,2);\n\n\nif($n==0){\n    print 2;\n}else{\n    print 1;\n}\n"}, {"source_code": "<?php \n\n$n = trim(fgets(STDIN));\n\n$ans = (int)bcmod($n,2);\nif($ans == 0)\n    printf(\"2\");\n    else printf(\"1\");\n\n\n?>"}], "negative_code": [{"source_code": "<?php\n$n = trim(fgets(STDIN));\n\nif($n%2==0){\n    echo 2;\n}else{\n    echo 1;\n}\n"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$n = fmod($n,2);\n\n\nif($n==0){\n    print 2;\n}else{\n    print 1;\n}\n"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n\nif($n/2==0){\n    echo 2;\n}else{\n    echo 1;\n}\n"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$n = fmod($n,2);\n\n\nif($n==0){\n    echo 2;\n}else{\n    echo 1;\n}\n"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$n = fmod($n,2);\n\n\nif($n%2==0){\n    echo 2;\n}else{\n    echo 1;\n}\n"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$n = (int)$n;\n\nif($n % 2 == 0)\n    printf(\"2\\n\");\nelse printf(\"1\\n\");\n\n\n\n\n\n?>"}], "src_uid": "816ec4cd9736f3113333ef05405b8e81"}
{"nl": {"description": "The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. \"Do I give such a hard task?\" \u2014 the HR manager thought. \"Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, n can be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions.\"Could you pass the interview in the machine vision company in IT City?", "input_spec": "The only line of the input contains a single integer n (2\u2009\u2264\u2009n\u2009\u2264\u20092\u00b71018) \u2014 the power in which you need to raise number 5.", "output_spec": "Output the last two digits of 5n without spaces between them.", "sample_inputs": ["2"], "sample_outputs": ["25"], "notes": null}, "positive_code": [{"source_code": "25"}, {"source_code": "<?php\n/*\n* $n = trim(fgets(STDIN));\n* $res = pow(5, $n);\n* $out = substr($res, -2);\n*/\necho \"25\";\n?>"}, {"source_code": "25\n"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "<?php\nfscanf(STDIN, \"%d\\n\", $number);\n\necho 25;"}, {"source_code": "<?php\necho \"25\";\n?>"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "<?\necho '25'\n?>"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25\n"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25\n"}, {"source_code": "<?php echo \"25\" ?>"}, {"source_code": "<?\necho '25'\n?>"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "<?php\nfscanf(STDIN, \"%d\\n\", $number);\n\necho 25;"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "<?php\n    echo 25;\n?>"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n"}, {"source_code": "25\n"}, {"source_code": "<?php\n\necho 25;"}, {"source_code": "25\n"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25\n"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25\n"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "<?php\necho \"25\";\n?>"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "<?php\necho \"25\";\n?>"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25\n"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25\n"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}, {"source_code": "25"}], "negative_code": [{"source_code": "p 25"}, {"source_code": "25 "}, {"source_code": "\n25"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$res = pow(5, $n);\n$out = substr($res, -2);\necho $out;\n//$len = strlen(trim($res));\n//$res_arr = str_split($res);\n?>"}, {"source_code": "25\n///"}, {"source_code": "#include<iostream>\n#include<string>\n#include<cmath>\nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n;\n\tcout<<25;\n\treturn 0;\n}\n"}, {"source_code": "echo 25"}, {"source_code": "<?php\n\n$n = readline();\n\n$number = pow(5, $n);\n$num = strval($number);\n\nif (strlen($num) > 2) {\n    echo $num[strlen($num) - 2] . $num[strlen($num) - 1];\n} elseif (strlen($num) == 2) {\n    echo $num;\n}"}, {"source_code": "23"}, {"source_code": "echo 25"}, {"source_code": "echo (25)"}, {"source_code": "<?php\necho pow(5, $n);"}, {"source_code": "public class x{public static void main(String[] args){System.out.print(25);}}"}, {"source_code": "public class x{public static void main(String[] args){System.out.print(\"25\");}}"}, {"source_code": "25.0"}], "src_uid": "dcaff75492eafaf61d598779d6202c9d"}
{"nl": {"description": "Dreamoon is standing at the position 0 on a number line. Drazil is sending a list of commands through Wi-Fi to Dreamoon's smartphone and Dreamoon follows them.Each command is one of the following two types:   Go 1 unit towards the positive direction, denoted as '+'  Go 1 unit towards the negative direction, denoted as '-' But the Wi-Fi condition is so poor that Dreamoon's smartphone reports some of the commands can't be recognized and Dreamoon knows that some of them might even be wrong though successfully recognized. Dreamoon decides to follow every recognized command and toss a fair coin to decide those unrecognized ones (that means, he moves to the 1 unit to the negative or positive direction with the same probability 0.5). You are given an original list of commands sent by Drazil and list received by Dreamoon. What is the probability that Dreamoon ends in the position originally supposed to be final by Drazil's commands?", "input_spec": "The first line contains a string s1 \u2014 the commands Drazil sends to Dreamoon, this string consists of only the characters in the set {'+', '-'}.  The second line contains a string s2 \u2014 the commands Dreamoon's smartphone recognizes, this string consists of only the characters in the set {'+', '-', '?'}. '?' denotes an unrecognized command. Lengths of two strings are equal and do not exceed 10.", "output_spec": "Output a single real number corresponding to the probability. The answer will be considered correct if its relative or absolute error doesn't exceed 10\u2009-\u20099.", "sample_inputs": ["++-+-\n+-+-+", "+-+-\n+-??", "+++\n??-"], "sample_outputs": ["1.000000000000", "0.500000000000", "0.000000000000"], "notes": "NoteFor the first sample, both s1 and s2 will lead Dreamoon to finish at the same position \u2009+\u20091. For the second sample, s1 will lead Dreamoon to finish at position 0, while there are four possibilites for s2: {\"+-++\", \"+-+-\", \"+--+\", \"+---\"} with ending position {+2, 0, 0, -2} respectively. So there are 2 correct cases out of 4, so the probability of finishing at the correct position is 0.5. For the third sample, s2 could only lead us to finish at positions {+1, -1, -3}, so the probability to finish at the correct position \u2009+\u20093 is 0."}, "positive_code": [{"source_code": "<?php\n$s1 = trim(fgets(STDIN));\n$s2 = trim(fgets(STDIN));\n$p1 = 0;\n$p2 = 0;\n$c = 0;\n\nfor ($i=0; $i<strlen($s1); $i++) {\n    if($s1[$i]=='+') { \n      $p1++; \n    } else { \n      $p1--; \n    }\n    \n    if ($s2[$i]=='+') { \n      $p2++;\n    } elseif ($s2[$i] == '-') { \n      $p2--; \n    } else { \n      $c++;\n    }\n}\n\n$d = array();\n$d[0][25] = 1.0;\nfor ($j=0; $j<$c; $j++) {\n    for($i=1; $i<49; $i++) {\n        $d[$j+1][$i-1] += $d[$j][$i]*0.5;\n        $d[$j+1][$i+1] += $d[$j][$i]*0.5;\n    }\n}\nprintf(\"%.12f\",$d[$c][25+($p2-$p1)]);\n?>"}, {"source_code": "<?php\n$s1 = trim(fgets(STDIN));\n$s2 = trim(fgets(STDIN));\n$p1 = $p2 = $c = 0;\nfor($i=0; $i<strlen($s1);$i++) {\n\tif($s1[$i]=='+')$p1++;\n\telse $p1--;\n\tif($s2[$i]=='+')$p2++;\n\telse if($s2[$i]=='-')$p2--;\n\telse $c++;\n}\n$d[0][25]=1.0;\nfor($j=0;$j<$c;$j++) {\n\tfor($i=1;$i<49;$i++) {\n\t\t$d[$j+1][$i-1]+=$d[$j][$i]*0.5;\n\t\t$d[$j+1][$i+1]+=$d[$j][$i]*0.5;\n\t}\n}\nprintf(\"%.12f\",$d[$c][25+($p2-$p1)]);\n\n?>"}, {"source_code": "<?php\n$f = fopen('php://stdin', 'r');\n//$f = fopen('test.txt', 'r');\n\n$s = trim(fgets($f));\n$x = trim(fgets($f));\n\n$n = array(\n    0 => 1,\n    1 => 1,\n    2 => 2,\n    3 => 6,\n    4 => 24,\n    5 => 120,\n    6 => 720,\n    7 => 5040,\n    8 => 40320,\n    9 => 362880,\n    10 => 3628800\n);\n\n$total = 0;\nfor($i=0;$i<strlen($s);$i++){\n    if ($s[$i]=='+') $total++;\n}\n\n\n$result = 0;\n$q = 0;\nfor($i=0;$i<strlen($x);$i++){\n    if ($x[$i]=='+') $result++;\n    if ($x[$i]=='?') $q++;\n}\n\n$range = abs($total - $result);\n\nif ($q==0){\n    if ($range==0) echo \"1.000000000000\\n\";\n    else echo \"0.000000000000\\n\";\n    exit;\n}\n\nif ($q<$range || $result>$total){\n    echo \"0.000000000000\\n\";\n} else {\n    $v = pow(0.5,$q)*$n[$q]/($n[$q-$range]*$n[$range]);\n    echo $v;\n}\n\n\n\n\n\n\n\n\n"}, {"source_code": "<?php\n$str1 = trim(fgets(STDIN)); \n$str2 = trim(fgets(STDIN)); \n$correct = str_split($str1);\n$correctPos = 0;\nforeach ($correct as $c) {\n\tif ($c == '+') {\n\t\t$correctPos++;\n\t} else {\n\t\t$correctPos--;\n\t}\n}\n//print_r($correctPos);\n$guessed = str_split($str2);\n$guessedPos = array(0);\nforeach ($guessed as $g) {\n\t$cnt = count($guessedPos);\n\tfor($i = 0; $i < $cnt; $i++) {\n\t\tif($g == '+') {\n\t\t\t++$guessedPos[$i];\n\t\t} else if($g == '-') {\n\t\t\t--$guessedPos[$i];\n\t\t} else {\n\t\t\t$currVal = $guessedPos[$i];\n\t\t\t++$guessedPos[$i];\n\t\t\t$guessedPos[] = $currVal - 1;\n\t\t}\n\t}\n}\n$total = count($guessedPos);\n$accu = 0;\nforeach($guessedPos as $p) {\n\tif($p == $correctPos) ++$accu;\n}\necho $accu/$total;\n?>"}], "negative_code": [{"source_code": "<?php\n$str1 = trim(fgets(STDIN));\n$str2 = trim(fgets(STDIN));\n$p1 = 0;\n$m1 = 0;\n$p2 = 0;\n$m2 = 0;\n$r = 0;\nfor ($i=0; $i<strlen($str1); $i++) {\n\tif ($str1[$i] == \"+\") {\n\t\t$p1++;\n\t} else if ($str1[$i] == \"-\") {\n\t\t$m1++;\n\t}\n}\nfor ($i=0; $i<strlen($str2); $i++) {\n\tif ($str2[$i] == \"+\") {\n\t\t$p2++;\n\t} else if ($str2[$i] == \"-\") {\n\t\t$m2++;\n\t} else if ($str2[$i] == \"?\"){\n\t\t$r++;\n\t}\n}\nif ($p1 == $p2 && $m1 == $m2 && $r == 0) {\n\techo \"1.000000000000\";\n} else if ((($p1 != $p2 or $m1 != $m2) && $r == 0) or (($p1-$r) != $p2 && ($m1-$r) != $m2 && $r > 0)) {\n\techo \"0.000000000000\";\n} else if ($p1 == $p2 && $m1 == $m2 && $r > 0) {\n\techo \"0.500000000000\";\n}\n?>"}, {"source_code": "<?php\n$f = fopen('php://stdin', 'r');\n//$f = fopen('test.txt', 'r');\n\n$s = trim(fgets($f));\n$x = trim(fgets($f));\n\n$n = array(\n    1 => 1,\n    2 => 2,\n    3 => 6,\n    4 => 24,\n    5 => 120,\n    6 => 720,\n    7 => 5040,\n    8 => 40320,\n    9 => 362880,\n    10 => 3628800\n);\n\n$total = 0;\nfor($i=0;$i<strlen($s);$i++){\n    if ($s[$i]=='+') $total++;\n    if ($s[$i]=='-') $total--;\n}\n\n\n$result = 0;\n$q = 0;\nfor($i=0;$i<strlen($x);$i++){\n    if ($x[$i]=='+') $result++;\n    if ($x[$i]=='-') $result--;\n    if ($x[$i]=='?') $q++;\n}\n\n$range = $total - $result;\n\n\nif ($q==0){\n    if ($range==0) echo \"1.000000000000\\n\";\n    else echo \"0.000000000000\\n\";\n}\n\nif ($q<abs($range) || ($q-$range)%2!=0){\n    echo \"0.000000000000\\n\";\n} else {\n\n    $range++;\n    $v = pow(0.5,$q)*$n[$q]/($n[$q-$range]*$n[$range]);\n    echo $v;\n}\n\n\n\n\n\n\n\n\n"}, {"source_code": "<?php\n$f = fopen('php://stdin', 'r');\n//$f = fopen('test.txt', 'r');\n\n$s = trim(fgets($f));\n$x = trim(fgets($f));\n\n$n = array(\n    0 => 1,\n    1 => 1,\n    2 => 2,\n    3 => 6,\n    4 => 24,\n    5 => 120,\n    6 => 720,\n    7 => 5040,\n    8 => 40320,\n    9 => 362880,\n    10 => 3628800\n);\n\n$total = 0;\nfor($i=0;$i<strlen($s);$i++){\n    if ($s[$i]=='+') $total++;\n    //if ($s[$i]=='-') $total--;\n}\n\n\n$result = 0;\n$q = 0;\nfor($i=0;$i<strlen($x);$i++){\n    if ($x[$i]=='+') $result++;\n    //if ($x[$i]=='-') $result--;\n    if ($x[$i]=='?') $q++;\n}\n\n$range = abs($total - $result);\n\nif ($q==0){\n    if ($range==0) echo \"1.000000000000\\n\";\n    else echo \"0.000000000000\\n\";\n    exit;\n}\n\nif ($q<$range){\n    echo \"0.000000000000\\n\";\n} else {\n    $v = pow(0.5,$q)*$n[$q]/($n[$q-$range]*$n[$range]);\n    echo $v;\n}\n\n\n\n\n\n\n\n\n"}, {"source_code": "<?php\n//$f = fopen('php://stdin', 'r');\n$f = fopen('test.txt', 'r');\n\n$s = trim(fgets($f));\n$x = trim(fgets($f));\n\n$n = array(\n    0 => 1,\n    1 => 1,\n    2 => 2,\n    3 => 6,\n    4 => 24,\n    5 => 120,\n    6 => 720,\n    7 => 5040,\n    8 => 40320,\n    9 => 362880,\n    10 => 3628800\n);\n\n$total = 0;\nfor($i=0;$i<strlen($s);$i++){\n    if ($s[$i]=='+') $total++;\n    //if ($s[$i]=='-') $total--;\n}\n\n\n$result = 0;\n$q = 0;\nfor($i=0;$i<strlen($x);$i++){\n    if ($x[$i]=='+') $result++;\n    //if ($x[$i]=='-') $result--;\n    if ($x[$i]=='?') $q++;\n}\n\n$range = $total - $result;\n\nif ($q==0){\n    if ($range==0) echo \"1.000000000000\\n\";\n    else echo \"0.000000000000\\n\";\n    exit;\n}\n//var_dump($q,$range,$result);\nif ($q<$range || ($total - $result)<0){\n    echo \"0.000000000000\\n\";\n} else {\n    $v = pow(0.5,$q)*$n[$q]/($n[$q-$range]*$n[$range]);\n    echo $v;\n}\n\n\n\n\n\n\n\n\n"}, {"source_code": "<?php\n$s = fopen(\"php://stdin\", 'r');\n$str1 = stream_get_contents($s);\n$str2 = stream_get_contents($s);\nfclose($s);\n$correct = str_split($str1);\n$correctPos = 0;\nforeach ($correct as $c) {\n\tif ($c == '+') {\n\t\t$correctPos++;\n\t} else {\n\t\t$correctPos--;\n\t}\n}\n//print_r($correctPos);\n$guessed = str_split($str2);\n$guessedPos = array(0);\nforeach ($guessed as $g) {\n\t$cnt = count($guessedPos);\n\tfor($i = 0; $i < $cnt; $i++) {\n\t\tif($g == '+') {\n\t\t\t++$guessedPos[$i];\n\t\t} else if($g == '-') {\n\t\t\t--$guessedPos[$i];\n\t\t} else {\n\t\t\t$currVal = $guessedPos[$i];\n\t\t\t++$guessedPos[$i];\n\t\t\t$guessedPos[] = $currVal - 1;\n\t\t}\n\t}\n}\n$total = count($guessedPos);\n$accu = 0;\nforeach($guessedPos as $p) {\n\tif($p == $correctPos) ++$accu;\n}\necho $accu/$total;\n?>"}], "src_uid": "f7f68a15cfd33f641132fac265bc5299"}
{"nl": {"description": "Alice has a string $$$s$$$. She really likes the letter \"a\". She calls a string good if strictly more than half of the characters in that string are \"a\"s. For example \"aaabb\", \"axaa\" are good strings, and \"baca\", \"awwwa\", \"\" (empty string) are not.Alice can erase some characters from her string $$$s$$$. She would like to know what is the longest string remaining after erasing some characters (possibly zero) to get a good string. It is guaranteed that the string has at least one \"a\" in it, so the answer always exists.", "input_spec": "The first line contains a string $$$s$$$ ($$$1 \\leq |s| \\leq 50$$$) consisting of lowercase English letters. It is guaranteed that there is at least one \"a\" in $$$s$$$.", "output_spec": "Print a single integer, the length of the longest good string that Alice can get after erasing some characters from $$$s$$$.", "sample_inputs": ["xaxxxxa", "aaabaa"], "sample_outputs": ["3", "6"], "notes": "NoteIn the first example, it's enough to erase any four of the \"x\"s. The answer is $$$3$$$ since that is the maximum number of characters that can remain.In the second example, we don't need to erase any characters."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = 0;\nfor($x = 0; $x < strlen($a); $x++)\n{\n     if($a[$x] == \"a\")\n     {\n          $b++;\n     }\n}\n$c = strlen($a) - $b;\nif($c < $b)\n{\n     print strlen($a);\n}\nelseif($c == $b)\n{\n     print strlen($a) - 1;\n}\nelseif($c > $b)\n{\n     print strlen($a) - ($c - $b + 1);\n}\n?>"}, {"source_code": "<?php\n$s = readline();\nif (substr_count($s, 'a') > strlen($s)/2) {\n  echo strlen($s);\n}\nelse {\n  $c = 0;\n  for ($i = 0; $i < strlen($s); $i++) {\n    if ($s[$i] == 'a') {\n      $c++;\n    }\n  }\n  echo $c*2 -1;\n}"}, {"source_code": "<?php\n# 1146\n\n$input = fopen('php://stdin', 'rb');\n$str = trim(fgets($input));\n$result = strlen($str);\n$aCount = substr_count($str, 'a');\n$half = ceil($result / 2);\nif ($aCount <= $half) {\n    $result = 2 * $aCount - 1;\n\n}\necho $result;\n"}, {"source_code": "<?php\n\n$aa = readline();\n$cnt = 0;\nfor($i=0; $i<strlen($aa); $i++)\n\tif($aa[$i] == 'a')\n\t\t$cnt++;\nif($cnt+$cnt>strlen($aa))\n\techo strlen($aa);\nelse echo $cnt+$cnt-1;"}, {"source_code": "<?php\n\n$aa = readline();\n$cnt = 0;\nfor($i=0; $i<strlen($aa); $i++)\n\tif($aa[$i] == 'a')\n\t\t$cnt++;\necho min(strlen($aa), $cnt*2-1);"}, {"source_code": "<?php\nfscanf(STDIN, \"%s\", $s);\n\n$len = strlen($s);\n\n$arr = str_split($s);\n\n$as = substr_count($s, \"a\");\n\nif ($as <= $len/2) {\n\tif ($len % 2 == 0) {\n\t\t$notAs = $len - $as;\n\t\t$ans = ($notAs - $as) + 1;\n\t\t$ans = $len - $ans;\n\t}\n\telse {\n\t\t$notAs = $len - $as;\n\t\t$ans = ($notAs - $as) + 1;\n\t\t$ans = $len - $ans;\n\t}\n}\nelse $ans = $len;\necho $ans;\n?>"}, {"source_code": "<?php\n$s = fgets(STDIN);\n$r = substr_count($s, 'a')*2 -1;\necho $r > strlen($s) ? strlen(trim($s)) : $r;"}, {"source_code": "<?php\n$stdin = fopen('php://stdin','r');\n$line = fgets( $stdin );\nfclose( $stdin );\n$a=array(0,0);\n$arr=str_split(trim($line));\nforeach ($arr as $b) $a[$b == \"a\" ? 0 : 1]++;\necho ($a[0]>$a[1] ? $a[0]+$a[1] : $a[0] * 2 - 1);\n"}, {"source_code": "<?php\n\nwhile(!feof(STDIN)){\n    $arr[]=fgets(STDIN);\n}\npreg_match_all(\"/[\\w]/\", $arr[0], $matches);\n$a=array_count_values($matches[0]);\n\nif(count($matches[0])-$a[a]<$a[a]){echo count($matches[0]);}\nelse{\n    echo count($matches[0])-(count($matches[0])-2*$a[a]+1);\n}\n?>"}, {"source_code": "<?php\n$s = readline();\necho min(substr_count($s, 'a') * 2 - 1, strlen($s));"}, {"source_code": "<?php\nfscanf(STDIN,\"%s\",$str);\n$count=0;\n$others=0;\nfor($i=0;$i<strlen($str);$i++)\n{\n\tif($str[$i]=='a')\n\t\t$count++;\n\telse $others++;\n\n\n}\nif($count>$others)\n\t\techo strlen($str);\n\telse\n\t\techo ($count*2)-1;"}, {"source_code": "<?php\n\n$s = str_split(trim(fgets(STDIN)));\n$c = 0;\n\nfor($i = 0; $i<count($s); $i++) if($s[$i] == 'a') $c++;\n\necho min(count($s), 2*$c-1);\n\n?>"}, {"source_code": "<?php\n    $str = str_split(trim(fgets(STDIN)));\n    $c = 0;\n    for($i=0 ; $i<count($str) ; $i++){\n        if($str[$i] == 'a'){\n            $c++;\n        }\n    }\n    echo min(count($str),2*$c-1);\n?>\n"}], "negative_code": [{"source_code": "<?php\n$s = readline();\n$c = 0;\nfor ($i = 0; $i < strlen($s); $i++) {\n\tif ($s[$i] == 'a') {\n\t\t$c++;\n\t}\n}\necho $c * 2 - 1;"}, {"source_code": "<?php\n$s = explode(' ', readline());\n$c = 0;\nfor ($i = 0; $i < count($s); $i++) {\n\tif ($s[$i] == a) {\n\t\t$c++;\n\t}\n}"}, {"source_code": "<?php\n$s = readline();\n$c = 0;\nfor ($i = 0; $i < count($s); $i++) {\n\tif ($s[$i] == 'a') {\n\t\t$c++;\n\t}\n}\necho $c * 2 - 1;"}, {"source_code": "<?php\n$s = readline();\n$c = 0;\nfor ($i = 0; $i < count($s); $i++) {\n\tif ($s[$i] == a) {\n\t\t$c++;\n\t}\n}\necho $c * 2 - 1;"}, {"source_code": "<?php\n# 1146\n\n$input = fopen('php://stdin', 'rb');\n$str = trim(fgets($input));\n$result = strlen($str);\n$aCount = substr_count($str, 'a');\n$half = ceil($result / 2);\nif ($aCount <= $half) {\n    $result = $aCount + 1;\n\n}\necho $result;\n"}, {"source_code": "<?php\nfscanf(STDIN, \"%s\", $s);\n\n$len = strlen($s);\n\n$arr = str_split($s);\n\n$as = substr_count($s, \"a\");\n\nif ($as <$len/2) {\n\tif ($len % 2 === 0) {\n\t\t$dif = ($len/2) + 1 - $as;\n\t\t$ans = $len - $dif; \n\t}\n\telse {\n\t\t$dif = ceil($len/2) - $as;\n\t\t$ans = $len - $dif - $as; \n\t}\n}\nelse $ans = $len;\necho $ans;\n?>"}, {"source_code": "<?php\nfscanf(STDIN, \"%s\", $s);\n\n$len = strlen($s);\n\n$arr = str_split($s);\n\n$as = substr_count($s, \"a\");\n\nif ($as <$len/2) {\n\tif ($len % 2 === 0) {\n\t\t$dif = ($len/2) + 1 - $as;\n\t\t$ans = $len - $dif; \n\t}\n\telse {\n\t\t$dif = ceil($len/2) - $as;\n\t\t$ans = $len - $dif - $as; \n\t}\n}\nelse $ans = $as;\necho $ans;\n?>"}, {"source_code": "<?php\nfscanf(STDIN, \"%s\", $s);\n\n$len = strlen($s);\n\n$arr = str_split($s);\n\n$as = substr_count($s, \"a\");\n\nif ($as > ($len/2)) {\n\techo $len;\n}\nelse {\n\techo (ceil($len/2) - $as) + 1;\n}\n\n?>"}, {"source_code": "<?php\nfscanf(STDIN, \"%s\", $s);\n\n$len = strlen($s);\n\n$arr = str_split($s);\n\n$as = substr_count($s, \"a\");\n\nif ($as <= $len/2) {\n\tif ($len % 2 == 0) {\n\t\t$dif = ($len/2) + 1 - $as;\n\t\t$ans = $len - $dif; \n\t}\n\telse {\n\t\t$dif = ceil($len/2) - $as;\n\t\t$ans = $len - $dif - $as; \n\t}\n}\nelse $ans = $len;\necho $ans;\n?>"}, {"source_code": "<?php\nfscanf(STDIN, \"%s\", $s);\n\n$len = strlen($s);\n\n$arr = str_split($s);\n\n$as = substr_count($s, \"a\");\n\nif ($as > ($len/2)) {\n\techo $len;\n}\nelse {\n\tdo {\n\t    $len--;\n\t}while ($as < ceil($len/2));\n\techo $len;\n}\n\n?>"}, {"source_code": "<?php\nfscanf(STDIN, \"%s\", $s);\n\n$len = strlen($s);\n\n$arr = str_split($s);\n\n$as = substr_count($s, \"a\");\n\nif ($len % 2 === 0) {\n\t$dif = ($len/2) + 1 - $as;\n\t$ans = $len - $dif; \n}\nelse {\n\t$dif = ceil($len/2) - $as;\n\t$ans = $len - $dif - $as; \n}\necho $ans;\n?>"}, {"source_code": "<?php\n\n$s = str_split(trim(fgets(STDIN)));\n$c = 0;\n\nfor($i = 0; $i<count($s); $i++) if($s[$i] == 'a') $c++;\n\nif($c <= count($s)/2){\n    echo $c + floor((count($s)-$c)/2) - 1;\n}else{\n    echo count($s);\n}\n\n?>"}], "src_uid": "84cb9ad2ae3ba7e912920d7feb4f6219"}
{"nl": {"description": "When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word \"tma\" (which now means \"too much to be counted\") used to stand for a thousand and \"tma tmyschaya\" (which literally means \"the tma of tmas\") used to stand for a million.Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.", "input_spec": "The first input line contains integer number k, the second line contains integer number l (2\u2009\u2264\u2009k,\u2009l\u2009\u2264\u2009231\u2009-\u20091).", "output_spec": "You should print in the first line of the output \"YES\", if the number belongs to the set petriciumus cifera and otherwise print \"NO\". If the number belongs to the set, then print on the seconds line the only number \u2014 the importance of number l.", "sample_inputs": ["5\n25", "3\n8"], "sample_outputs": ["YES\n1", "NO"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$d = 0;\nfor($x = 1; $x <= 1000; $x++)\n{\n    $c = pow($a, $x);\n    if($b == $c)\n    {\n        $d = 1;\n        break;\n    }\n    elseif($b < $c)\n    {\n        break;\n    }\n}\nif($d == 1)\n{\n    print \"YES\" . \"\\n\";\n    print $x - 1;\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\n\n$flag = 1; //must be not zero for STDIN\n\n$in = 'php://stdin';\nif (!$flag)\n{\n    $in = \"input.txt\";\n}\n$fd = fopen($in, \"r\");\nfscanf($fd, \"%d\\n\", $k);\nfscanf($fd, \"%d\\n\", $l);\nfclose($fd);\n\n$r = (log($l, $k));\n$s = strstr ( $r, '.' );\nif (!$s)\n{\n    print \"YES\\n\";\n    $r--;\n    print \"$r\\n\";\n} else\n{\n    print \"NO\\n\";\n}\n?>"}, {"source_code": "<?php\n    $k = (int)readline();\n    $l = (int)readline();\n    $x = $k;\n    $counter = 0;\n    while($x < $l){\n        $x *= $k;\n        $counter ++;\n    }\n    if($x == $l){\n        echo(\"YES\"),(\"\\n\");\n        echo($counter),(\"\\n\");\n    } else{\n        echo(\"NO\"),(\"\\n\");\n    }\n?>"}, {"source_code": "<?php\n$f = fopen('php://stdin', 'r');\n//$f = fopen('test.txt', 'r');\n\n$k = trim(fgets($f));\n$l = trim(fgets($f));\n\n$result = $k;\n$n = 0;\nwhile($result<$l){\n    $result*=$k;\n    $n++;\n\n}\n\nif ($result==$l){\n    echo \"YES\\n\";\n    echo $n;\n    exit;\n}\n\necho \"NO\";\n\n\n\n\n"}, {"source_code": "<?php \n    fscanf(STDIN, \"%d\",$n);\n    fscanf(STDIN, \"%d\",$l);\n\n    $k = log($l,$n);\n    if ($k==floor($k)){\n    echo \"YES\\n\";\n    echo $k-1;\n    } else\n    echo \"NO\";\n?>"}, {"source_code": "<?\n$n=trim(fgets(STDIN));\n$l=trim(fgets(STDIN));\n$cnt=0;\n$ss=\"YES\";\nwhile($l!=1){\n    $tmp=false;\n    if($l%$n==0){\n        $l=$l/$n;\n        $cnt++;\n        $tmp=true;\n    }\n    if(!$tmp) {$ss=\"NO\"; break;}\n}\nif($ss=='NO') {\n    echo $ss;\n} else {\n    echo $ss.\"\\n\";\n    echo $cnt-1;\n}\n?>"}, {"source_code": "<?php\n\n$k = trim(fgets(STDIN));\n$l = trim(fgets(STDIN));\n\nif($l==1&&$k!=1) {print \"YES\\r\\n-1\"; exit(0);}\nif($l==1&&$k==1||$l==$k) {print \"YES\\r\\n0\"; exit(0);}\nif($k>$l&&$l!=1){print 'NO';exit(0);}\n\n$r = 0;\nwhile($l>$k){if($l%$k!=0){print 'NO';exit(0);}$l=intval($l/$k);$r++;}\n\nif($l==$k)print \"YES\\r\\n$r\"; else print 'NO';\n\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$d = 0;\nfor($x = 1; $x <= 1000; $x++)\n{\n    $c = pow($a, $x);\n    if($b == $c)\n    {\n        $d = 1;\n        break;\n    }\n    elseif($b < $c)\n    {\n        break;\n    }\n}\nif($d == 1)\n{\n    print \"YES\" . \"\\n\";\n    print $x;\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\n\n$flag = 1; //must be not zero for STDIN\n$in = 'php://stdin';\nif (!$flag)\n{\n    $in = \"input.txt\";\n}\n$fd = fopen($in, \"r\");\nfscanf($fd, \"%d\\n\", $k);\nfscanf($fd, \"%d\\n\", $l);\nfclose($fd);\n\n$r = log($l, $k);\n$s = floor($r);\n$r = floatval($r);\n$s = floatval($s);\n$r-=$s;\nif (!($r))\n{\n    print \"YES\\n\";\n    $s--;\n    print \"$s\\n\";\n} else\n{\n    print \"NO\\n\";\n}\n?>"}, {"source_code": "<?php \n    fscanf(STDIN, \"%d\",$n);\n    fscanf(STDIN, \"%d\",$l);\n\n    $k = log($l,$n);\n    if ($k==floor($k)){\n    echo \"YES\\n\";\n    echo $k;\n    } else\n    echo \"NO\";\n?>"}, {"source_code": "<?php \n    fscanf(STDIN, \"%d %d\",$n, $l);\n    $k = log($l,$n);\n    if ($k==floor($k)){\n    echo \"YES\\n\";\n    echo $k;\n    } else\n    echo \"NO\";\n?>"}, {"source_code": "<?php\n\n$k = trim(fgets(STDIN));\n$l = trim(fgets(STDIN));\n\nif($l==1&&$k!=1) {print \"YES\\r\\n-1\"; exit(0);}\nif($l==1&&$k==1||$l==$k) {print \"YES\\r\\n0\"; exit(0);}\n\n$r = 0;\nwhile($l>$k){if($l%$k!=0){print 'NO';exit(0);}$l=intval($l/$k);$r++;}\n\nprint \"YES\\r\\n$r\";\n\n?>"}, {"source_code": "<?php\n\n$k = trim(fgets(STDIN));\n$l = trim(fgets(STDIN));\n\nif($l==1&&$k!=1) {print \"YES\\r\\n-1\"; exit(0);}\nif($l==1&&$k==1||$l==$k) {print \"YES\\r\\n0\"; exit(0);}\nif($k>$l&&$l!=1){print 'NO';exit(0);}\n\n$r = 0;\nwhile($l>$k){if($l%$k!=0){print 'NO';exit(0);}$l=intval($l/$k);$r++;}\n\nprint \"YES\\r\\n$r\";\n\n?>"}], "src_uid": "8ce89b754aa4080e7c3b2c3b10f4be46"}
{"nl": {"description": "You are developing a new feature for the website which sells airline tickets: being able to sort tickets by price! You have already extracted the tickets' prices, so there's just the last step to be done...You are given an array of integers. Sort it in non-descending order.", "input_spec": "The input consists of a single line of space-separated integers. The first number is n (1\u2009\u2264\u2009n\u2009\u2264\u200910) \u2014 the size of the array. The following n numbers are the elements of the array (1\u2009\u2264\u2009ai\u2009\u2264\u2009100).", "output_spec": "Output space-separated elements of the sorted array.", "sample_inputs": ["3 3 1 2"], "sample_outputs": ["1 2 3"], "notes": "NoteRemember, this is a very important feature, and you have to make sure the customers appreciate it!"}, "positive_code": [{"source_code": "<?php\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n//*************************************************************\n$a = explode(\" \", trim(file_get_contents(\"php://stdin\")));\narray_shift($a);\nsort($a);\n$t = microtime(true);\nwhile (microtime(true) - $t < 1.5) {\n    $x = 0;\n}\necho implode(\" \", $a) . \"\\n\";\n?>"}], "negative_code": [{"source_code": "1 2 3\n"}], "src_uid": "29e481abfa9ad1f18e6157c9e833f16e"}
{"nl": {"description": "You are given n rectangles. The corners of rectangles have integer coordinates and their edges are parallel to the Ox and Oy axes. The rectangles may touch each other, but they do not overlap (that is, there are no points that belong to the interior of more than one rectangle). Your task is to determine if the rectangles form a square. In other words, determine if the set of points inside or on the border of at least one rectangle is precisely equal to the set of points inside or on the border of some square.", "input_spec": "The first line contains a single integer n (1\u2009\u2264\u2009n\u2009\u2264\u20095). Next n lines contain four integers each, describing a single rectangle: x1, y1, x2, y2 (0\u2009\u2264\u2009x1\u2009&lt;\u2009x2\u2009\u2264\u200931400,\u20090\u2009\u2264\u2009y1\u2009&lt;\u2009y2\u2009\u2264\u200931400) \u2014 x1 and x2 are x-coordinates of the left and right edges of the rectangle, and y1 and y2 are y-coordinates of the bottom and top edges of the rectangle.  No two rectangles overlap (that is, there are no points that belong to the interior of more than one rectangle).", "output_spec": "In a single line print \"YES\", if the given rectangles form a square, or \"NO\" otherwise.", "sample_inputs": ["5\n0 0 2 3\n0 3 3 5\n2 0 5 2\n3 2 5 5\n2 2 3 3", "4\n0 0 2 3\n0 3 3 5\n2 0 5 2\n3 2 5 5"], "sample_outputs": ["YES", "NO"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$f = array();\n$g = array();\n$o = 0;\nfor($x = 1; $x <= $a; $x++)\n{\n    list($b, $c, $d, $e) = explode(\" \", trim(fgets(STDIN)));\n    array_push($f, $b);\n    array_push($g, $c);\n    array_push($f, $d);\n    array_push($g, $e);\n    array_push($f, $d);\n    array_push($g, $c);\n    array_push($f, $b);\n    array_push($g, $e);\n    $o += ($d - $b) * ($e - $c); \n}\n$h = $f;\nsort($h);\n$i = $h[0];\n$j = $h[count($h) - 1];\n$k = $g;\nsort($k);\n$l = $k[0];\n$m = $k[count($k) - 1];\n$n = ($j - $i) * ($m - $l);\nif(($n == $o) && (($j - $i) == ($m - $l)))\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$f = array();\n$g = array();\n$o = 0;\nfor($x = 1; $x <= $a; $x++)\n{\n    list($b, $c, $d, $e) = explode(\" \", trim(fgets(STDIN)));\n    array_push($f, $b);\n    array_push($g, $c);\n    array_push($f, $d);\n    array_push($g, $e);\n    array_push($f, $d);\n    array_push($g, $c);\n    array_push($f, $b);\n    array_push($g, $e);\n    $o += ($d - $b) * ($e - $c); \n}\n$h = $f;\nsort($h);\n$i = $h[0];\n$j = $h[count($h) - 1];\n$k = $g;\nsort($k);\n$l = $k[0];\n$m = $k[count($k) - 1];\n$n = ($j - $i) * ($m - $l);\nif($n == $o)\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}], "src_uid": "f63fc2d97fd88273241fce206cc217f2"}
{"nl": {"description": "Iahub is training for the IOI. What is a better way to train than playing a Zuma-like game? There are n balls put in a row. Each ball is colored in one of k colors. Initially the row doesn't contain three or more contiguous balls with the same color. Iahub has a single ball of color x. He can insert his ball at any position in the row (probably, between two other balls). If at any moment there are three or more contiguous balls of the same color in the row, they are destroyed immediately. This rule is applied multiple times, until there are no more sets of 3 or more contiguous balls of the same color. For example, if Iahub has the row of balls [black, black, white, white, black, black] and a white ball, he can insert the ball between two white balls. Thus three white balls are destroyed, and then four black balls become contiguous, so all four balls are destroyed. The row will not contain any ball in the end, so Iahub can destroy all 6 balls.Iahub wants to destroy as many balls as possible. You are given the description of the row of balls, and the color of Iahub's ball. Help Iahub train for the IOI by telling him the maximum number of balls from the row he can destroy.", "input_spec": "The first line of input contains three integers: n (1\u2009\u2264\u2009n\u2009\u2264\u2009100), k (1\u2009\u2264\u2009k\u2009\u2264\u2009100) and x (1\u2009\u2264\u2009x\u2009\u2264\u2009k). The next line contains n space-separated integers c1,\u2009c2,\u2009...,\u2009cn (1\u2009\u2264\u2009ci\u2009\u2264\u2009k). Number ci means that the i-th ball in the row has color ci. It is guaranteed that the initial row of balls will never contain three or more contiguous balls of the same color. ", "output_spec": "Print a single integer \u2014 the maximum number of balls Iahub can destroy.", "sample_inputs": ["6 2 2\n1 1 2 2 1 1", "1 1 1\n1"], "sample_outputs": ["6", "0"], "notes": null}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = explode(\" \", trim(fgets(STDIN)));\n$e = array();\nfor($x = 0; $x < $a; $x++)\n{\n    if(($d[$x] == $c) && ($d[$x + 1] == $c))\n    {\n        array_push($e, $x);\n    }\n}\nif(count($e) == 0)\n{\n    print \"0\";\n}\nelse\n{\n    $f = array();\n    for($x = 0; $x < count($e); $x++)\n    {\n        $g = 2;\n        $h = $d;\n        $i = 0;\n        $j = array();\n        $k = array();\n        for($y = $e[$x]; $y >= 0; $y--)\n        {\n            if($h[$y - 1] == $h[$y - 2])\n            {\n                $i++;\n            }\n            else\n            {\n                $i++;\n                array_push($j, $i);\n                $i = 0;\n                array_push($k, $h[$y - 1]);\n            }\n        }\n        $l = 0;\n        $m = array();\n        $n = array();\n        for($y = $e[$x]; $y < $a; $y++)\n        {\n            if($h[$y + 2] == $h[$y + 3])\n            {\n                $l++;\n            }\n            else\n            {\n                $l++;\n                array_push($m, $l);\n                $l = 0;\n                array_push($n, $h[$y + 2]);\n            }\n        }\n        for($y = 0; $y < min(count($j), count($m)); $y++)\n        {\n            if(($k[$y] == $n[$y]) && (($j[$y] + $m[$y]) >= 3))\n            {\n                $g += ($j[$y] + $m[$y]);\n            }\n            else\n            {\n                break;\n            }\n        }\n        array_push($f, $g);\n    }\n    print max($f);\n}\n?>"}], "negative_code": [], "src_uid": "d73d9610e3800817a3109314b1e6f88c"}
{"nl": {"description": "Buses run between the cities A and B, the first one is at 05:00 AM and the last one departs not later than at 11:59 PM. A bus from the city A departs every a minutes and arrives to the city B in a ta minutes, and a bus from the city B departs every b minutes and arrives to the city A in a tb minutes.The driver Simion wants to make his job diverse, so he counts the buses going towards him. Simion doesn't count the buses he meet at the start and finish.You know the time when Simion departed from the city A to the city B. Calculate the number of buses Simion will meet to be sure in his counting.", "input_spec": "The first line contains two integers a,\u2009ta (1\u2009\u2264\u2009a,\u2009ta\u2009\u2264\u2009120) \u2014 the frequency of the buses from the city A to the city B and the travel time. Both values are given in minutes. The second line contains two integers b,\u2009tb (1\u2009\u2264\u2009b,\u2009tb\u2009\u2264\u2009120) \u2014 the frequency of the buses from the city B to the city A and the travel time. Both values are given in minutes. The last line contains the departure time of Simion from the city A in the format hh:mm. It is guaranteed that there are a bus from the city A at that time. Note that the hours and the minutes are given with exactly two digits.", "output_spec": "Print the only integer z \u2014 the number of buses Simion will meet on the way. Note that you should not count the encounters in cities A and B.", "sample_inputs": ["10 30\n10 35\n05:20", "60 120\n24 100\n13:00"], "sample_outputs": ["5", "9"], "notes": "NoteIn the first example Simion departs form the city A at 05:20 AM and arrives to the city B at 05:50 AM. He will meet the first 5 buses from the city B that departed in the period [05:00 AM - 05:40 AM]. Also Simion will meet a bus in the city B at 05:50 AM, but he will not count it.Also note that the first encounter will be between 05:26 AM and 05:27 AM (if we suggest that the buses are go with the sustained speed)."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\nlist($c, $d) = explode(\" \", trim(fgets(STDIN)));\n$e = explode(\":\", trim(fgets(STDIN)));\n$f = $e[0] * 60 + $e[1];\n$g = $f + $b;\n$h = array(300);\n$i = 1;\n$j = 300;\nwhile(TRUE)\n{\n     if($j == 1439)\n     {\n          break;\n     }\n     elseif($j > 1439)\n     {\n          unset($h[$i - 1]);\n          break;\n     }\n     else\n     {\n          $j += $c;\n          $h[$i] = $j;\n          $i++;\n     }\n}\n$k = array_reverse($h);\n$l = array();\nfor($x = 0; $x < count($k); $x++)\n{\n     $l[$x] = $k[$x] + $d;\n}\n$m = 0;\nfor($x = 0; $x < count($k); $x++)\n{\n     if(($k[$x] < $g) && ($l[$x] > $f))\n     {\n          $m++;\n     }\n}\nprint $m;\n?>"}, {"source_code": "<?php\n\nfunction debug($msg)\n{\n    $debug = false;\n    // $debug = true;\n\n    if ($debug)\n    {\n        echo $msg . PHP_EOL;\n    }\n}\n\n$ts = 5 * 60;\n$te = 24 * 60;\n\ndefine ('FREQ', 0);\ndefine ('DURING', 1);\n\n$fh = fopen('php://stdin','r') or die('no input');\nif ($s = fgets($fh,100) ) {\n    $ta_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $tb_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $ta_start_arr = explode(':', $s);\n    $ta_start = $ta_start_arr[0] * 60 + $ta_start_arr[1];\n}\n\n\n// freq, travel_time\n\n// $ta_arr = array(\n//     FREQ   => 1,\n//     DURING => 1\n//     );\n// $tb_arr = array(\n//     FREQ   => 1,\n//     DURING => 1\n//     );\n// $ta_start = 23 * 60 + 59;\n\necho get_count($ta_arr, $tb_arr, $ta_start) . PHP_EOL;\n\nfunction get_count($ta_arr, $tb_arr, $ta_start)\n{\n    $tb_start = get_start($ta_start, $tb_arr);\n\n    $ta_end = get_end($ta_start, $ta_arr[DURING]);\n\n    $count = ceil(($ta_end - $tb_start) / $tb_arr[FREQ]);\n\n    debug(\" check between time $tb_start and $ta_end. Initial count: $count\" );\n\n    // meet at start staion\n    if (is_station($ta_start-$tb_arr[DURING], $tb_arr[FREQ]))\n    {\n        $count--;\n    }\n\n    return intval($count);\n}\n\n// get the most recent meetable bus start time\nfunction get_start($start, $t_arr)\n{\n    global $ts;\n\n    if ($start - $t_arr[DURING] > $ts)\n    {\n        $start_time = $start - $t_arr[DURING];\n\n        if ( (($start_time - $ts) % $t_arr[FREQ]) == 0)\n        {\n            return $start_time;\n        }\n        else\n        {\n            return $ts + ceil(($start_time - $ts) / $t_arr[FREQ]) * $t_arr[FREQ];\n        }\n    }\n    else\n        return $ts;\n}\n\nfunction get_end($start, $during)\n{\n    global $te;\n\n    if ($start + $during < $te)\n        return $start + $during;\n    else\n        return $te;\n}\n\nfunction is_station($t, $freq)\n{\n    global $ts, $te;\n\n    if ($t<$ts || $t > $te)\n        return false;\n\n    if ((($t - $ts) % $freq) == 0)\n    {\n        debug(\"meet in station at time: $t, freq: $freq\");\n        return true;\n    }\n    else\n        return false;\n}"}, {"source_code": "<?php\n\nfunction debug($msg)\n{\n    $debug = false;\n    // $debug = true;\n\n    if ($debug)\n    {\n        echo $msg . PHP_EOL;\n    }\n}\n\n$ts = 5 * 60;\n$te = 23 * 60 + 59;\n\ndefine ('FREQ', 0);\ndefine ('DURING', 1);\n\n$fh = fopen('php://stdin','r') or die('no input');\nif ($s = fgets($fh,100) ) {\n    $ta_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $tb_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $ta_start_arr = explode(':', $s);\n    $ta_start = $ta_start_arr[0] * 60 + $ta_start_arr[1];\n}\n\n\n// freq, travel_time\n\n// $ta_arr = array(\n//     FREQ   => 1,\n//     DURING => 1\n//     );\n// $tb_arr = array(\n//     FREQ   => 1,\n//     DURING => 1\n//     );\n// $ta_start = 23 * 60 + 59;\n\necho get_count($ta_arr, $tb_arr, $ta_start) . PHP_EOL;\n\nfunction get_count($ta_arr, $tb_arr, $ta_start)\n{\n    $tb_start = get_start($ta_start, $tb_arr);\n\n    $ta_end = get_end($ta_start, $ta_arr[DURING]);\n\n    $count = ceil(($ta_end - $tb_start) / $tb_arr[FREQ]);\n\n    debug(\" check between time $tb_start and $ta_end. Initial count: $count\" );\n\n    // meet at start staion\n    if (is_station($ta_start-$tb_arr[DURING], $tb_arr[FREQ]))\n    {\n        $count--;\n    }\n\n    return intval($count);\n}\n\n// get the most recent meetable bus start time\nfunction get_start($start, $t_arr)\n{\n    global $ts;\n\n    if ($start - $t_arr[DURING] > $ts)\n    {\n        $start_time = $start - $t_arr[DURING];\n\n        if ( (($start_time - $ts) % $t_arr[FREQ]) == 0)\n        {\n            return $start_time;\n        }\n        else\n        {\n            return $ts + ceil(($start_time - $ts) / $t_arr[FREQ]) * $t_arr[FREQ];\n        }\n    }\n    else\n        return $ts;\n}\n\nfunction get_end($start, $during)\n{\n    global $te;\n\n    if ($start + $during <= $te)\n        return $start + $during;\n    else\n        return $te + 1;\n}\n\nfunction is_station($t, $freq)\n{\n    global $ts, $te;\n\n    if ($t<$ts || $t > $te)\n        return false;\n\n    if ((($t - $ts) % $freq) == 0)\n    {\n        debug(\"meet in station at time: $t, freq: $freq\");\n        return true;\n    }\n    else\n        return false;\n}"}], "negative_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\nlist($c, $d) = explode(\" \", trim(fgets(STDIN)));\n$e = explode(\":\", trim(fgets(STDIN)));\n$f = $e[0] * 60 + $e[1] - 300;\n$g = $f + $b;\n$h = 23 * 60 + 59;\n$i = floor($h / $c);\n$j = array();\n$k = 0;\n$l = array();\n$m = 0;\n$n = 0;\nfor($x = 0; $x < $i; $x++)\n{\n     $o = $n + $d;\n     $j[$k] = $n;\n     $k++;\n     $l[$m] = $o;\n     $m++;\n     $n += $c;\n}\n$p = 0;\nfor($x = 0; $x < $i; $x++)\n{\n     if(($l[$x] > $f) && ($j[$x] < $g))\n     {\n          $p++;\n     }\n}\nprint $p;\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\nlist($c, $d) = explode(\" \", trim(fgets(STDIN)));\n$e = explode(\":\", trim(fgets(STDIN)));\n$f = $e[0] * 60 + $e[1] - 300;\n$g = $f + $b;\n$h = 23 * 60 + 59 - 300;\n$i = floor($h / $c);\n$j = array();\n$k = 0;\n$l = array();\n$m = 0;\n$n = 0;\nfor($x = 0; $x < $i; $x++)\n{\n     $o = $n + $d;\n     $j[$k] = $n;\n     $k++;\n     $l[$m] = $o;\n     $m++;\n     $n += $c;\n}\n$p = 0;\nfor($x = 0; $x < $i; $x++)\n{\n     if(($l[$x] > $f) && ($j[$x] < $g))\n     {\n          $p++;\n     }\n}\nprint $p;\n?>"}, {"source_code": "<?php\n\n$ts = 5 * 60;\n$te = 23 * 60 + 59;\n\n// freq, travel_time\n$ta_arr = array(\n    'freq'   => 60,\n    'during' => 120\n    );\n$tb_arr = array(\n    'freq'   => 24,\n    'during' => 100\n    );\n$ta_start = 13 * 60 + 0;\n\necho get_count($ta_arr, $tb_arr, $ta_start) . PHP_EOL;\n\nfunction get_count($ta_arr, $tb_arr, $ta_start)\n{\n    $tb_start = get_start($ta_start, $tb_arr['during']);\n\n    $ta_end = get_end($ta_start, $ta_arr['during']);\n\n    $count = ceil(($ta_end - $tb_start) / $tb_arr['freq']);\n    if ( (($ta_end - $tb_start) % $tb_arr['freq']) == 0)\n        $count++;\n\n    echo \" check between time $tb_start and $ta_end. Initial count: $count\" . PHP_EOL;\n\n    if (is_station($ta_start-$tb_arr['during'], $tb_arr['freq']))\n        $count--;\n\n    if (is_station($ta_start+$ta_arr['during'], $tb_arr['freq']))\n        $count--;\n\n    return $count;\n}\n\nfunction get_start($start, $during)\n{\n    global $ts;\n\n    if ($start - $during > $ts)\n        return $start - $during;\n    else\n        return $ts;\n}\n\nfunction get_end($start, $during)\n{\n    global $te;\n\n    if ($start + $during < $te)\n        return $start + $during;\n    else\n        return $te;\n}\n\nfunction is_station($t, $freq)\n{\n    global $ts, $te;\n\n    if ($t<$ts || $t > $te)\n        return false;\n\n    if ((($t - $ts) % $freq) == 0)\n    {\n        echo \"meet one at station. time: $t, freq: $freq\" . PHP_EOL;\n        return true;\n    }\n    else\n        return false;\n}"}, {"source_code": "<?php\n\n$ts = 5 * 60;\n$te = 23 * 60 + 59;\n\n$fh = fopen('php://stdin','r') or die('no input');\nif ($s = fgets($fh,100) ) {\n    $ta_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $tb_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $ta_start_arr = explode(':', $s);\n    $ta_start = $ta_start_arr[0] * 60 + $ta_start_arr[1];\n}\n\ndefine ('FREQ', 0);\ndefine ('DURING', 1);\n\n// freq, travel_time\n\n// $ta_arr = array(\n//     FREQ   => 30,\n//     DURING => 60\n//     );\n// $tb_arr = array(\n//     FREQ   => 60,\n//     DURING => 60\n//     );\n// $ta_start = 22 * 60 + 30;\n\necho get_count($ta_arr, $tb_arr, $ta_start) . PHP_EOL;\n\nfunction get_count($ta_arr, $tb_arr, $ta_start)\n{\n    $tb_start = get_start($ta_start, $tb_arr[DURING]);\n\n    $ta_end = get_end($ta_start, $ta_arr[DURING]);\n\n    $count = intval(($ta_end - $tb_start) / $tb_arr[FREQ]);\n\n    // echo \" check between time $tb_start and $ta_end. Initial count: $count\" . PHP_EOL;\n\n    $b_station = false;\n    // meet at start staion\n    if (is_station($ta_start-$tb_arr[DURING], $tb_arr[FREQ]))\n    {\n        $b_station = true;\n        $count--;\n    }\n\n    // meet at arrived station\n    if (is_station($ta_start+$ta_arr[DURING], $tb_arr[FREQ]))\n    {\n        $b_station = true;\n        $count--;\n    }\n\n    if ( (($ta_end - $tb_start) % $tb_arr[FREQ]) == 0 && $b_station == true)\n    {\n        // echo 'add 1' . PHP_EOL;\n        $count++;\n    }\n\n    return $count;\n}\n\nfunction get_start($start, $during)\n{\n    global $ts;\n\n    if ($start - $during > $ts)\n        return $start - $during;\n    else\n        return $ts;\n}\n\nfunction get_end($start, $during)\n{\n    global $te;\n\n    if ($start + $during < $te)\n        return $start + $during;\n    else\n        return $te;\n}\n\nfunction is_station($t, $freq)\n{\n    global $ts, $te;\n\n    if ($t<$ts || $t > $te)\n        return false;\n\n    if ((($t - $ts) % $freq) == 0)\n    {\n        // echo \"meet one at station. time: $t, freq: $freq\" . PHP_EOL;\n        return true;\n    }\n    else\n        return false;\n}"}, {"source_code": "<?php\n\n$ts = 5 * 60;\n$te = 23 * 60 + 59;\n\n$fh = fopen('php://stdin','r') or die('no input');\nif ($s = fgets($fh,100) ) {\n    $ta_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $tb_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $ta_start_arr = explode(':', $s);\n    $ta_start = $ta_start_arr[0] * 60 + $ta_start_arr[1];\n}\n\ndefine ('FREQ', 0);\ndefine ('DURING', 1);\n\n// freq, travel_time\n\n// $ta_arr = array(\n//     FREQ   => 30,\n//     DURING => 60\n//     );\n// $tb_arr = array(\n//     FREQ   => 60,\n//     DURING => 60\n//     );\n// $ta_start = 22 * 60 + 30;\n\necho get_count($ta_arr, $tb_arr, $ta_start) . PHP_EOL;\n\nfunction get_count($ta_arr, $tb_arr, $ta_start)\n{\n    $tb_start = get_start($ta_start, $tb_arr[DURING]);\n\n    $ta_end = get_end($ta_start, $ta_arr[DURING]);\n\n    $count = ceil(($ta_end - $tb_start) / $tb_arr[FREQ]);\n\n    // echo \" check between time $tb_start and $ta_end. Initial count: $count\" . PHP_EOL;\n\n    $b_station = false;\n    // meet at start staion\n    if (is_station($ta_start-$tb_arr[DURING], $tb_arr[FREQ]))\n    {\n        $b_station = true;\n        $count--;\n    }\n\n    // meet at arrived station\n    if (is_station($ta_start+$ta_arr[DURING], $tb_arr[FREQ]))\n    {\n        $b_station = true;\n        $count--;\n    }\n\n    if ( (($ta_end - $tb_start) % $tb_arr[FREQ]) == 0 && $b_station == true)\n    {\n        // echo 'add 1' . PHP_EOL;\n        $count++;\n    }\n\n    return $count;\n}\n\nfunction get_start($start, $during)\n{\n    global $ts;\n\n    if ($start - $during > $ts)\n        return $start - $during;\n    else\n        return $ts;\n}\n\nfunction get_end($start, $during)\n{\n    global $te;\n\n    if ($start + $during < $te)\n        return $start + $during;\n    else\n        return $te;\n}\n\nfunction is_station($t, $freq)\n{\n    global $ts, $te;\n\n    if ($t<$ts || $t > $te)\n        return false;\n\n    if ((($t - $ts) % $freq) == 0)\n    {\n        // echo \"meet one at station. time: $t, freq: $freq\" . PHP_EOL;\n        return true;\n    }\n    else\n        return false;\n}"}, {"source_code": "<?php\n\nfunction debug($msg)\n{\n    $debug = false;\n\n    if ($debug)\n    {\n        echo $msg . PHP_EOL;\n    }\n}\n\n$ts = 5 * 60;\n$te = 23 * 60 + 59;\n\ndefine ('FREQ', 0);\ndefine ('DURING', 1);\n\n$fh = fopen('php://stdin','r') or die('no input');\nif ($s = fgets($fh,100) ) {\n    $ta_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $tb_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $ta_start_arr = explode(':', $s);\n    $ta_start = $ta_start_arr[0] * 60 + $ta_start_arr[1];\n}\n\n\n// freq, travel_time\n\n// $ta_arr = array(\n//     FREQ   => 30,\n//     DURING => 60\n//     );\n// $tb_arr = array(\n//     FREQ   => 60,\n//     DURING => 60\n//     );\n// $ta_start = 22 * 60 + 30;\n\necho get_count($ta_arr, $tb_arr, $ta_start) . PHP_EOL;\n\nfunction get_count($ta_arr, $tb_arr, $ta_start)\n{\n    $tb_start = get_start($ta_start, $tb_arr);\n\n    $ta_end = get_end($ta_start, $ta_arr[DURING]);\n\n    $count = ceil(($ta_end - $tb_start) / $tb_arr[FREQ]);\n\n    debug(\" check between time $tb_start and $ta_end. Initial count: $count\" );\n\n    // meet at start staion\n    if (is_station($ta_start-$tb_arr[DURING], $tb_arr[FREQ]))\n    {\n        $count--;\n    }\n\n    return intval($count);\n}\n\n// get the most recent meetable bus start time\nfunction get_start($start, $t_arr)\n{\n    global $ts;\n\n    if ($start - $t_arr[DURING] > $ts)\n    {\n        $start_time = $start - $t_arr[DURING];\n\n        if ( (($start_time - $ts) % $t_arr[FREQ]) == 0)\n        {\n            return $start_time;\n        }\n        else\n        {\n            return $ts + ceil(($start_time - $ts) / $t_arr[FREQ]) * $t_arr[FREQ];\n        }\n    }\n    else\n        return $ts;\n}\n\nfunction get_end($start, $during)\n{\n    global $te;\n\n    if ($start + $during < $te)\n        return $start + $during;\n    else\n        return $te;\n}\n\nfunction is_station($t, $freq)\n{\n    global $ts, $te;\n\n    if ($t<$ts || $t > $te)\n        return false;\n\n    if ((($t - $ts) % $freq) == 0)\n    {\n        debug(\"meet in station at time: $t, freq: $freq\");\n        return true;\n    }\n    else\n        return false;\n}"}, {"source_code": "<?php\n\nfunction debug($msg)\n{\n    $debug = false;\n\n    if ($debug)\n    {\n        echo $msg . PHP_EOL;\n    }\n}\n\n$ts = 5 * 60;\n$te = 23 * 60 + 59;\n\ndefine ('FREQ', 0);\ndefine ('DURING', 1);\n\n$fh = fopen('php://stdin','r') or die('no input');\nif ($s = fgets($fh,100) ) {\n    $ta_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $tb_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $ta_start_arr = explode(':', $s);\n    $ta_start = $ta_start_arr[0] * 60 + $ta_start_arr[1];\n}\n\n\n// freq, travel_time\n\n// $ta_arr = array(\n//     FREQ   => 30,\n//     DURING => 60\n//     );\n// $tb_arr = array(\n//     FREQ   => 60,\n//     DURING => 60\n//     );\n// $ta_start = 22 * 60 + 30;\n\necho get_count($ta_arr, $tb_arr, $ta_start) . PHP_EOL;\n\nfunction get_count($ta_arr, $tb_arr, $ta_start)\n{\n    $tb_start = get_start($ta_start, $tb_arr);\n\n    $ta_end = get_end($ta_start, $ta_arr[DURING]);\n\n    $count = ceil(($ta_end - $tb_start) / $tb_arr[FREQ]);\n\n    debug(\" check between time $tb_start and $ta_end. Initial count: $count\" );\n\n    $b_station = false;\n    // meet at start staion\n    if (is_station($ta_start-$tb_arr[DURING], $tb_arr[FREQ]))\n    {\n        $b_station = true;\n        $count--;\n    }\n\n    // // meet at arrived station\n    // if (is_station($ta_start+$ta_arr[DURING], $tb_arr[FREQ]))\n    // {\n    //     $b_station = true;\n    //     $count--;\n    // }\n\n    return $count;\n}\n\n// get the most recent meetable bus start time\nfunction get_start($start, $t_arr)\n{\n    global $ts;\n\n    if ($start - $t_arr[DURING] > $ts)\n    {\n        $start_time = $start - $t_arr[DURING];\n\n        if ( (($start_time - $ts) % $t_arr[FREQ]) == 0)\n        {\n            return $start_time;\n        }\n        else\n        {\n            return $ts + ceil(($start_time - $ts) / $t_arr[FREQ]) * $t_arr[FREQ];\n        }\n    }\n    else\n        return $ts;\n}\n\nfunction get_end($start, $during)\n{\n    global $te;\n\n    if ($start + $during < $te)\n        return $start + $during;\n    else\n        return $te;\n}\n\nfunction is_station($t, $freq)\n{\n    global $ts, $te;\n\n    if ($t<$ts || $t > $te)\n        return false;\n\n    if ((($t - $ts) % $freq) == 0)\n    {\n        debug(\"meet in station at time: $t, freq: $freq\");\n        return true;\n    }\n    else\n        return false;\n}"}, {"source_code": "<?php\n\n$ts = 5 * 60;\n$te = 23 * 60 + 59;\n\n// freq, travel_time\n$ta_arr = array(\n    'freq'   => 60,\n    'during' => 120\n    );\n$tb_arr = array(\n    'freq'   => 24,\n    'during' => 100\n    );\n$ta_start = 13 * 60 + 0;\n\necho get_count($ta_arr, $tb_arr, $ta_start) . PHP_EOL;\n\nfunction get_count($ta_arr, $tb_arr, $ta_start)\n{\n    $tb_start = get_start($ta_start, $tb_arr['during']);\n\n    $ta_end = get_end($ta_start, $ta_arr['during']);\n\n    $count = ceil(($ta_end - $tb_start) / $tb_arr['freq']);\n    if ( (($ta_end - $tb_start) % $tb_arr['freq']) == 0)\n        $count++;\n\n    // echo \" check between time $tb_start and $ta_end. Initial count: $count\" . PHP_EOL;\n\n    if (is_station($ta_start-$tb_arr['during'], $tb_arr['freq']))\n        $count--;\n\n    if (is_station($ta_start+$ta_arr['during'], $tb_arr['freq']))\n        $count--;\n\n    return $count;\n}\n\nfunction get_start($start, $during)\n{\n    global $ts;\n\n    if ($start - $during > $ts)\n        return $start - $during;\n    else\n        return $ts;\n}\n\nfunction get_end($start, $during)\n{\n    global $te;\n\n    if ($start + $during < $te)\n        return $start + $during;\n    else\n        return $te;\n}\n\nfunction is_station($t, $freq)\n{\n    global $ts, $te;\n\n    if ($t<$ts || $t > $te)\n        return false;\n\n    if ((($t - $ts) % $freq) == 0)\n    {\n        // echo \"meet one at station. time: $t, freq: $freq\" . PHP_EOL;\n        return true;\n    }\n    else\n        return false;\n}"}, {"source_code": "<?php\n\n$ts = 5 * 60;\n$te = 23 * 60 + 59;\n\n$fh = fopen('php://stdin','r') or die('no input');\nif ($s = fgets($fh,100) ) {\n    $ta_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $tb_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $ta_start_arr = explode(':', $s);\n    $ta_start = $ta_start_arr[0] * 60 + $ta_start_arr[1];\n}\n\ndefine ('FREQ', 0);\ndefine ('DURING', 1);\n// freq, travel_time\n// $ta_arr = array(\n//     FREQ   => 60,\n//     DURING => 120\n//     );\n// $tb_arr = array(\n//     FREQ   => 24,\n//     DURING => 100\n//     );\n// $ta_start = 13 * 60 + 0;\n\necho get_count($ta_arr, $tb_arr, $ta_start) . PHP_EOL;\n\nfunction get_count($ta_arr, $tb_arr, $ta_start)\n{\n    $tb_start = get_start($ta_start, $tb_arr[DURING]);\n\n    $ta_end = get_end($ta_start, $ta_arr[DURING]);\n\n    $count = ceil(($ta_end - $tb_start) / $tb_arr[FREQ]);\n    if ( (($ta_end - $tb_start) % $tb_arr[FREQ]) == 0)\n        $count++;\n\n    // echo \" check between time $tb_start and $ta_end. Initial count: $count\" . PHP_EOL;\n\n    if (is_station($ta_start-$tb_arr[DURING], $tb_arr[FREQ]))\n        $count--;\n\n    if (is_station($ta_start+$ta_arr[DURING], $tb_arr[FREQ]))\n        $count--;\n\n    return $count;\n}\n\nfunction get_start($start, $during)\n{\n    global $ts;\n\n    if ($start - $during > $ts)\n        return $start - $during;\n    else\n        return $ts;\n}\n\nfunction get_end($start, $during)\n{\n    global $te;\n\n    if ($start + $during < $te)\n        return $start + $during;\n    else\n        return $te;\n}\n\nfunction is_station($t, $freq)\n{\n    global $ts, $te;\n\n    if ($t<$ts || $t > $te)\n        return false;\n\n    if ((($t - $ts) % $freq) == 0)\n    {\n        // echo \"meet one at station. time: $t, freq: $freq\" . PHP_EOL;\n        return true;\n    }\n    else\n        return false;\n}"}, {"source_code": "<?php\n\n$ts = 5 * 60;\n$te = 23 * 60 + 59;\n\n$fh = fopen('php://stdin','r') or die('no input');\nif ($s = fgets($fh,100) ) {\n    $ta_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $tb_arr = explode(' ', $s);\n}\n\nif ($s = fgets($fh,100) ) {\n    $ta_start_arr = explode(':', $s);\n    $ta_start = $ta_start_arr[0] * 60 + $ta_start_arr[1];\n}\n\ndefine ('FREQ', 0);\ndefine ('DURING', 1);\n\n// freq, travel_time\n\n// $ta_arr = array(\n//     FREQ   => 30,\n//     DURING => 60\n//     );\n// $tb_arr = array(\n//     FREQ   => 60,\n//     DURING => 60\n//     );\n// $ta_start = 22 * 60 + 30;\n\necho get_count($ta_arr, $tb_arr, $ta_start) . PHP_EOL;\n\nfunction get_count($ta_arr, $tb_arr, $ta_start)\n{\n    $tb_start = get_start($ta_start, $tb_arr[DURING]);\n\n    $ta_end = get_end($ta_start, $ta_arr[DURING]);\n\n    $count = intval(($ta_end - $tb_start) / $tb_arr[FREQ]);\n\n    // echo \" check between time $tb_start and $ta_end. Initial count: $count\" . PHP_EOL;\n\n    $b_station = false;\n    // meet at start staion\n    if (is_station($ta_start-$tb_arr[DURING], $tb_arr[FREQ]))\n    {\n        $b_station = true;\n        $count--;\n    }\n\n    // meet at arrived station\n    if (is_station($ta_start+$ta_arr[DURING], $tb_arr[FREQ]))\n    {\n        $b_station = true;\n        $count--;\n    }\n\n    if ( (($ta_end - $tb_start) % $tb_arr[FREQ]) == 0)\n    {\n        // echo 'add 1' . PHP_EOL;\n        $count++;\n    }\n\n    return $count;\n}\n\nfunction get_start($start, $during)\n{\n    global $ts;\n\n    if ($start - $during > $ts)\n        return $start - $during;\n    else\n        return $ts;\n}\n\nfunction get_end($start, $during)\n{\n    global $te;\n\n    if ($start + $during < $te)\n        return $start + $during;\n    else\n        return $te;\n}\n\nfunction is_station($t, $freq)\n{\n    global $ts, $te;\n\n    if ($t<$ts || $t > $te)\n        return false;\n\n    if ((($t - $ts) % $freq) == 0)\n    {\n        // echo \"meet one at station. time: $t, freq: $freq\" . PHP_EOL;\n        return true;\n    }\n    else\n        return false;\n}"}], "src_uid": "1c4cf1c3cb464a483511a8a61f8685a7"}
{"nl": {"description": "Paul is at the orchestra. The string section is arranged in an r\u2009\u00d7\u2009c rectangular grid and is filled with violinists with the exception of n violists. Paul really likes violas, so he would like to take a picture including at least k of them. Paul can take a picture of any axis-parallel rectangle in the orchestra. Count the number of possible pictures that Paul can take.Two pictures are considered to be different if the coordinates of corresponding rectangles are different.", "input_spec": "The first line of input contains four space-separated integers r, c, n, k (1\u2009\u2264\u2009r,\u2009c,\u2009n\u2009\u2264\u20093000, 1\u2009\u2264\u2009k\u2009\u2264\u2009min(n,\u200910))\u00a0\u2014 the number of rows and columns of the string section, the total number of violas, and the minimum number of violas Paul would like in his photograph, respectively. The next n lines each contain two integers xi and yi (1\u2009\u2264\u2009xi\u2009\u2264\u2009r, 1\u2009\u2264\u2009yi\u2009\u2264\u2009c): the position of the i-th viola. It is guaranteed that no location appears more than once in the input.", "output_spec": "Print a single integer\u00a0\u2014 the number of photographs Paul can take which include at least k violas. ", "sample_inputs": ["2 2 1 1\n1 2", "3 2 3 3\n1 1\n3 1\n2 2", "3 2 3 2\n1 1\n3 1\n2 2"], "sample_outputs": ["4", "1", "4"], "notes": "NoteWe will use '*' to denote violinists and '#' to denote violists.In the first sample, the orchestra looks as follows: *#** Paul can take a photograph of just the viola, the 1\u2009\u00d7\u20092 column containing the viola, the 2\u2009\u00d7\u20091 row containing the viola, or the entire string section, for 4 pictures total.In the second sample, the orchestra looks as follows: #**##* Paul must take a photograph of the entire section.In the third sample, the orchestra looks the same as in the second sample."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c, $d) = explode(\" \", trim(fgets(STDIN)));\n$e = array();\nfor($x = 0; $x < $a; $x++)\n{\n     $f = array_fill(0, $b, 0);\n     $e[$x] = $f;\n}\nfor($x = 0; $x < $c; $x++)\n{\n     list($g, $h) = explode(\" \", trim(fgets(STDIN)));\n     $e[$g - 1][$h - 1] = 1;\n}\n$i = array();\nfor($x = 0; $x < $b; $x++)\n{\n     $j = array_fill(0, $a, 0);\n     $i[$x] = $j;\n}\nfor($x = 0; $x < $a; $x++)\n{\n     $k = $e[$x];\n     $k = array_reverse($k);\n     for($y = $x; $y < $x + 1; $y++)\n     {\n          for($z = 0; $z < count($k); $z++)\n          {\n               $i[$z][$y] = $k[$z];\n          }\n     }\n}\n$l = 0;\nfor($m = 1; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $r = array_sum(array_slice($p, $o, $m));\n               if($r >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 2; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 1; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               if($r + $r2 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 3; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 2; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               if($r + $r2 + $r3 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 4; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 3; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               if($r + $r2 + $r3 + $r4 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 5; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 4; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 6; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 5; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 7; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 6; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 8; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 7; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $p8 = $e[$n + 7];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 9; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 8; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $p8 = $e[$n + 7];\n               $p9 = $e[$n + 8];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               $r9 = array_sum(array_slice($p9, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 + $r9 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 10; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 9; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $p8 = $e[$n + 7];\n               $p9 = $e[$n + 8];\n               $p10 = $e[$n + 9];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               $r9 = array_sum(array_slice($p9, $o, $m));\n               $r10 = array_sum(array_slice($p10, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 + $r9 + $r10 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 1; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $r = array_sum(array_slice($p, $o, $m));\n               if($r >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 2; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 1; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               if($r + $r2 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 3; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 2; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               if($r + $r2 + $r3 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 4; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 3; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $p4 = $i[$n + 3];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               if($r + $r2 + $r3 + $r4 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 5; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 4; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $p4 = $i[$n + 3];\n               $p5 = $i[$n + 4];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 6; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 5; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $p4 = $i[$n + 3];\n               $p5 = $i[$n + 4];\n               $p6 = $i[$n + 5];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 7; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 6; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $p4 = $i[$n + 3];\n               $p5 = $i[$n + 4];\n               $p6 = $i[$n + 5];\n               $p7 = $i[$n + 6];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 8; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 7; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $p4 = $i[$n + 3];\n               $p5 = $i[$n + 4];\n               $p6 = $i[$n + 5];\n               $p7 = $i[$n + 6];\n               $p8 = $i[$n + 7];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 9; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 8; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $p4 = $i[$n + 3];\n               $p5 = $i[$n + 4];\n               $p6 = $i[$n + 5];\n               $p7 = $i[$n + 6];\n               $p8 = $i[$n + 7];\n               $p9 = $i[$n + 8];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               $r9 = array_sum(array_slice($p9, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 + $r9 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 10; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 9; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $p4 = $i[$n + 3];\n               $p5 = $i[$n + 4];\n               $p6 = $i[$n + 5];\n               $p7 = $i[$n + 6];\n               $p8 = $i[$n + 7];\n               $p9 = $i[$n + 8];\n               $p10 = $i[$n + 9];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               $r9 = array_sum(array_slice($p9, $o, $m));\n               $r10 = array_sum(array_slice($p10, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 + $r9 + $r10 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 1; $m <= 1; $m++)\n{\n     for($n = 0; $n < $a; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $r = array_sum(array_slice($p, $o, $m));\n               if($r >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 2; $m <= 2; $m++)\n{\n     for($n = 0; $n < $a - 1; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               if($r + $r2 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 3; $m <= 3; $m++)\n{\n     for($n = 0; $n < $a - 2; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               if($r + $r2 + $r3 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 4; $m <= 4; $m++)\n{\n     for($n = 0; $n < $a - 3; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               if($r + $r2 + $r3 + $r4 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 5; $m <= 5; $m++)\n{\n     for($n = 0; $n < $a - 4; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 6; $m <= 6; $m++)\n{\n     for($n = 0; $n < $a - 5; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 7; $m <= 7; $m++)\n{\n     for($n = 0; $n < $a - 6; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 8; $m <= 8; $m++)\n{\n     for($n = 0; $n < $a - 7; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $p8 = $e[$n + 7];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 9; $m <= 9; $m++)\n{\n     for($n = 0; $n < $a - 8; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $p8 = $e[$n + 7];\n               $p9 = $e[$n + 8];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               $r9 = array_sum(array_slice($p9, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 + $r9 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 10; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 9; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $p8 = $e[$n + 7];\n               $p9 = $e[$n + 8];\n               $p10 = $e[$n + 9];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               $r9 = array_sum(array_slice($p9, $o, $m));\n               $r10 = array_sum(array_slice($p10, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 + $r9 + $r10 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nprint $l;\n?>"}, {"source_code": "<?php\nlist($r, $c, $n, $k) = explode(\" \", trim(fgets(STDIN)));\n$arr = array_fill(0, $r, array_fill(0, $c, 7));\nfor ($i = 0; $i < $n; $i++) {\n\n\tlist($q, $w) = explode(\" \", trim(fgets(STDIN)));\n\t$arr[$q-1][$w-1] = 1;\n}\n\n$photos = 0;\n\nfor ($i1 = 0; $i1 < $r; $i1++) {\n\tfor ($j1 = 0; $j1 < $c; $j1++) {\n\t\tfor ($a = 1; $a <= ($r - $i1); $a++) {\n\t\t\tfor ($b = 1; $b <= ($c - $j1); $b++) {\n\t\t\t\t$cnt = 0;\n\t\t\t\tfor ($i = $i1; $i <= ($i1+$a-1); $i++) {\n\t\t\t\t\tfor ($j = $j1; $j <= ($j1+$b-1); $j++){\n\t\t\t\t\t\tif ($arr[$i][$j] == 1) $cnt++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif ($cnt >= $k) $photos++;\n\t\t\t}\n\t\t}\t\t\n\t}\n}\n\nprint $photos;\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b, $c, $d) = explode(\" \", trim(fgets(STDIN)));\n$e = array();\nfor($x = 0; $x < $a; $x++)\n{\n     $f = array_fill(0, $b, 0);\n     $e[$x] = $f;\n}\nfor($x = 0; $x < $c; $x++)\n{\n     list($g, $h) = explode(\" \", trim(fgets(STDIN)));\n     $e[$g - 1][$h - 1] = 1;\n}\n$i = array();\nfor($x = 0; $x < $b; $x++)\n{\n     $j = array_fill(0, $a, 0);\n     $i[$x] = $j;\n}\nfor($x = 0; $x < $a; $x++)\n{\n     $k = $e[$x];\n     $k = array_reverse($k);\n     for($y = $x; $y < $x + 1; $y++)\n     {\n          for($z = 0; $z < count($k); $z++)\n          {\n               $i[$z][$y] = $k[$z];\n          }\n     }\n}\n$l = 0;\nfor($m = 1; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $r = array_sum(array_slice($p, $o, $m));\n               if($r >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 2; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 1; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               if($r + $r2 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 3; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 2; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               if($r + $r2 + $r3 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 4; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 3; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               if($r + $r2 + $r3 + $r4 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 5; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 4; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 6; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 5; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 7; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 6; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 8; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 7; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $p8 = $e[$n + 6];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 9; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 8; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $p8 = $e[$n + 6];\n               $p9 = $e[$n + 7];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               $r9 = array_sum(array_slice($p9, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 + $r9 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 10; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 9; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $p8 = $e[$n + 6];\n               $p9 = $e[$n + 7];\n               $p10 = $e[$n + 8];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               $r9 = array_sum(array_slice($p9, $o, $m));\n               $r10 = array_sum(array_slice($p10, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 + $r9 + $r10 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 1; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $r = array_sum(array_slice($p, $o, $m));\n               if($r >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 2; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 1; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               if($r + $r2 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 3; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 2; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               if($r + $r2 + $r3 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 4; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 3; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $p4 = $i[$n + 3];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               if($r + $r2 + $r3 + $r4 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 5; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 4; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $p4 = $i[$n + 3];\n               $p5 = $i[$n + 4];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 6; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 5; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $p4 = $i[$n + 3];\n               $p5 = $i[$n + 4];\n               $p6 = $i[$n + 5];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 7; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 6; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $p4 = $i[$n + 3];\n               $p5 = $i[$n + 4];\n               $p6 = $i[$n + 5];\n               $p7 = $i[$n + 6];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 8; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 7; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $p4 = $i[$n + 3];\n               $p5 = $i[$n + 4];\n               $p6 = $i[$n + 5];\n               $p7 = $i[$n + 6];\n               $p8 = $i[$n + 6];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 9; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 8; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $p4 = $i[$n + 3];\n               $p5 = $i[$n + 4];\n               $p6 = $i[$n + 5];\n               $p7 = $i[$n + 6];\n               $p8 = $i[$n + 6];\n               $p9 = $i[$n + 7];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               $r9 = array_sum(array_slice($p9, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 + $r9 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 10; $m <= 10; $m++)\n{\n     for($n = 0; $n < $b - 9; $n++)\n     {\n          for($o = 0; $o <= $a - $m; $o++)\n          {\n               $p = $i[$n];\n               $p2 = $i[$n + 1];\n               $p3 = $i[$n + 2];\n               $p4 = $i[$n + 3];\n               $p5 = $i[$n + 4];\n               $p6 = $i[$n + 5];\n               $p7 = $i[$n + 6];\n               $p8 = $i[$n + 6];\n               $p9 = $i[$n + 7];\n               $p10 = $i[$n + 8];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               $r9 = array_sum(array_slice($p9, $o, $m));\n               $r10 = array_sum(array_slice($p10, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 + $r9 + $r10 >= $d)\n               {\n                    $l += 1;\n               }\n          }\n     }\n}\nfor($m = 1; $m <= 1; $m++)\n{\n     for($n = 0; $n < $a; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $r = array_sum(array_slice($p, $o, $m));\n               if($r >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 2; $m <= 2; $m++)\n{\n     for($n = 0; $n < $a - 1; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               if($r + $r2 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 3; $m <= 3; $m++)\n{\n     for($n = 0; $n < $a - 2; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               if($r + $r2 + $r3 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 4; $m <= 4; $m++)\n{\n     for($n = 0; $n < $a - 3; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               if($r + $r2 + $r3 + $r4 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 5; $m <= 5; $m++)\n{\n     for($n = 0; $n < $a - 4; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 6; $m <= 6; $m++)\n{\n     for($n = 0; $n < $a - 5; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 7; $m <= 7; $m++)\n{\n     for($n = 0; $n < $a - 6; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 8; $m <= 8; $m++)\n{\n     for($n = 0; $n < $a - 7; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $p8 = $e[$n + 6];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 9; $m <= 9; $m++)\n{\n     for($n = 0; $n < $a - 8; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $p8 = $e[$n + 6];\n               $p9 = $e[$n + 7];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               $r9 = array_sum(array_slice($p9, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 + $r9 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nfor($m = 10; $m <= 10; $m++)\n{\n     for($n = 0; $n < $a - 9; $n++)\n     {\n          for($o = 0; $o <= $b - $m; $o++)\n          {\n               $p = $e[$n];\n               $p2 = $e[$n + 1];\n               $p3 = $e[$n + 2];\n               $p4 = $e[$n + 3];\n               $p5 = $e[$n + 4];\n               $p6 = $e[$n + 5];\n               $p7 = $e[$n + 6];\n               $p8 = $e[$n + 6];\n               $p9 = $e[$n + 7];\n               $p10 = $e[$n + 8];\n               $r = array_sum(array_slice($p, $o, $m));\n               $r2 = array_sum(array_slice($p2, $o, $m));\n               $r3 = array_sum(array_slice($p3, $o, $m));\n               $r4 = array_sum(array_slice($p4, $o, $m));\n               $r5 = array_sum(array_slice($p5, $o, $m));\n               $r6 = array_sum(array_slice($p6, $o, $m));\n               $r7 = array_sum(array_slice($p7, $o, $m));\n               $r8 = array_sum(array_slice($p8, $o, $m));\n               $r9 = array_sum(array_slice($p9, $o, $m));\n               $r10 = array_sum(array_slice($p10, $o, $m));\n               if($r + $r2 + $r3 + $r4 + $r5 + $r6 + $r7 + $r8 + $r9 + $r10 >= $d)\n               {\n                    $l -= 1;\n               }\n          }\n     }\n}\nprint $l;\n?>"}], "src_uid": "9c766881f6415e2f53fb43b61f8f40b4"}
{"nl": {"description": "Vitya has just started learning Berlanese language. It is known that Berlanese uses the Latin alphabet. Vowel letters are \"a\", \"o\", \"u\", \"i\", and \"e\". Other letters are consonant.In Berlanese, there has to be a vowel after every consonant, but there can be any letter after any vowel. The only exception is a consonant \"n\"; after this letter, there can be any letter (not only a vowel) or there can be no letter at all. For example, the words \"harakiri\", \"yupie\", \"man\", and \"nbo\" are Berlanese while the words \"horse\", \"king\", \"my\", and \"nz\" are not.Help Vitya find out if a word $$$s$$$ is Berlanese.", "input_spec": "The first line of the input contains the string $$$s$$$ consisting of $$$|s|$$$ ($$$1\\leq |s|\\leq 100$$$) lowercase Latin letters.", "output_spec": "Print \"YES\" (without quotes) if there is a vowel after every consonant except \"n\", otherwise print \"NO\". You can print each letter in any case (upper or lower).", "sample_inputs": ["sumimasen", "ninja", "codeforces"], "sample_outputs": ["YES", "YES", "NO"], "notes": "NoteIn the first and second samples, a vowel goes after each consonant except \"n\", so the word is Berlanese.In the third sample, the consonant \"c\" goes after the consonant \"r\", and the consonant \"s\" stands on the end, so the word is not Berlanese."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = array(a => 1, b => 0, c => 0, d => 0, e => 1, f => 0, g => 0, h => 0, i => 1, j => 0, k => 0, l => 0, m => 0, n => 0, o => 1, p => 0, q => 0, r => 0, s => 0, t => 0, u => 1, v => 0, w => 0, x => 0, y => 0, z => 0);\n$c = 0;\nfor($x = 0; $x < strlen($a); $x++)\n{\n     if($a[$x] == \"n\")\n     {\n          continue;\n     }\n     elseif(($b[$a[$x]] == 0) && ($b[$a[$x + 1]] != 1))\n     {\n          $c = 1;\n          break;\n     }\n     elseif($b[$a[$x]] == 1)\n     {\n          continue;\n     }\n}\nif($c == 0)\n{\n     print \"YES\";\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "<?php\nini_set('error_reporting', E_ALL & ~E_NOTICE);\n\n$group = array(\"a\", \"i\", \"u\", \"e\", \"o\");\nfscanf(STDIN, \"%s\", $S);\n$arrayS = str_split($S);\n$countS = count($arrayS);\n\n$answer = \"YES\";\nfor ($i = 0; $i < $countS; $i++) {\n\tif ($arrayS[$i] == \"n\") {\n\t\tcontinue;\n\t}\n\n\tif (in_array($arrayS[$i], $group) === false) {\n\t\tif (in_array($arrayS[$i + 1], $group) === false) {\n\t\t\t$answer = \"NO\";\n\t\t}\n\t}\n}\n\necho $answer;\n"}, {"source_code": "<?php\n$str=trim(fgets(STDIN));\n$len=strlen($str);\n$vowel='aeioun';\n$decision=false;\nif (substr_count($vowel,$str[$len-1])==1)\n{\n\tfor ($i=0; $i <$len ; $i++)\n\t{ \n\t\tif (substr_count($vowel,$str[$i])=='0'&&(substr_count($vowel,$str[$i+1])=='0'||$str[$i+1]=='n'))\n\t\t{\n\t\t\t$decision=false;\n\t\t\tbreak;\n\t\t}\n\t\t$decision=true;\n\t}\n\t//$decision=true;\n}\necho $decision==true?'YES':'NO';"}, {"source_code": "<?php                                                                           \n\n$a = trim(fgets(STDIN));\n//$a = \"codeforces\";\n\n$input = $a; \n$input = str_split($input);\n$ok = true;\n\nfor($i = 0; $i < sizeof($input); $i++){\n    $value = $input[$i];\n     if(!isVowel($value) && $value != 'n'){\n         //if not n or vowel, have to check the next char\n         if($i + 1 >= sizeof($input)){\n             $ok = false;\n             break;\n         }else if(!isVowel($input[$i+1])){\n             $ok = false;\n             break;\n         }   \n     }   \n}\n\necho $ok ? 'YES' : 'NO';\n\nfunction isVowel($character){\n    return $character == 'a' \n    || $character == 'i' \n    || $character == 'u' \n    || $character == 'e' \n    || $character == 'o';\n}\n?>"}], "negative_code": [{"source_code": "<?php\nini_set('error_reporting', E_ALL & ~E_NOTICE);\n\n$group1 = array(\"a\", \"i\", \"u\", \"e\", \"o\");\n$group2 = array(\"a\", \"i\", \"u\", \"e\", \"o\", \"n\");\nfscanf(STDIN, \"%s\", $S);\n$arrayS = str_split($S);\n$countS = count($arrayS);\n\n$answer = \"YES\";\nfor ($i = 0; $i < $countS; $i++) {\n\tif (in_array($arrayS[$i], $group2) === false) {\n\t\tif (in_array($arrayS[$i + 1], $group2) === false) {\n\t\t\t$answer = \"NO\";\n\t\t}\n\t}\n}\n\necho $answer;\n"}, {"source_code": "<?php\n$str=trim(fgets(STDIN));\n$len=strlen($str);\n$vowel='aeioun';\n$decision=false;\nif (substr_count($vowel,$str[$len-1])==1)\n{\n\tfor ($i=0; $i <$len ; $i++)\n\t{ \n\t\tif (substr_count($vowel,$str[$i])=='0'&&substr_count($vowel,$str[$i+1])=='0')\n\t\t{\n\t\t\t$decision=false;\n\t\t\tbreak;\n\t\t}\n\t\t$decision=true;\n\t}\n\t//$decision=true;\n}\necho $decision==true?'YES':'NO';"}], "src_uid": "a83144ba7d4906b7692456f27b0ef7d4"}
{"nl": {"description": "A string is called bracket sequence if it does not contain any characters other than \"(\" and \")\". A bracket sequence is called regular if it it is possible to obtain correct arithmetic expression by inserting characters \"+\" and \"1\" into this sequence. For example, \"\", \"(())\" and \"()()\" are regular bracket sequences; \"))\" and \")((\" are bracket sequences (but not regular ones), and \"(a)\" and \"(1)+(1)\" are not bracket sequences at all.You have a number of strings; each string is a bracket sequence of length $$$2$$$. So, overall you have $$$cnt_1$$$ strings \"((\", $$$cnt_2$$$ strings \"()\", $$$cnt_3$$$ strings \")(\" and $$$cnt_4$$$ strings \"))\". You want to write all these strings in some order, one after another; after that, you will get a long bracket sequence of length $$$2(cnt_1 + cnt_2 + cnt_3 + cnt_4)$$$. You wonder: is it possible to choose some order of the strings you have such that you will get a regular bracket sequence? Note that you may not remove any characters or strings, and you may not add anything either.", "input_spec": "The input consists of four lines, $$$i$$$-th of them contains one integer $$$cnt_i$$$ ($$$0 \\le cnt_i \\le 10^9$$$).", "output_spec": "Print one integer: $$$1$$$ if it is possible to form a regular bracket sequence by choosing the correct order of the given strings, $$$0$$$ otherwise.", "sample_inputs": ["3\n1\n4\n3", "0\n0\n0\n0", "1\n2\n3\n4"], "sample_outputs": ["1", "1", "0"], "notes": "NoteIn the first example it is possible to construct a string \"(())()(()((()()()())))\", which is a regular bracket sequence.In the second example it is possible to construct a string \"\", which is a regular bracket sequence."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = trim(fgets(STDIN));\n$d = trim(fgets(STDIN));\nif($a == $d)\n{\n     if(($a == 0) && ($d == 0))\n     {\n          if($c == 0)\n          {\n               print \"1\";\n          }\n          else\n          {\n               print \"0\";\n          }\n     }\n     else\n     {\n          print \"1\";\n     }\n}\nelse\n{\n     print \"0\";\n}\n?>"}, {"source_code": "<?php\n\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = trim(fgets(STDIN));\n$d = trim(fgets(STDIN));\n\nif($a == $d && $a > 0){\n\tfwrite(STDOUT, 1);\n}else{\n\tif($a == 0 && $c == 0 && $d == 0){\n\t\tfwrite(STDOUT, 1);\n\t}else{\n\t\tfwrite(STDOUT, 0);\n\t}\n}\n\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = trim(fgets(STDIN));\n$d = trim(fgets(STDIN));\nif($a == $d)\n{\n     print \"1\";\n}\nelse\n{\n     print \"0\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = trim(fgets(STDIN));\n$d = trim(fgets(STDIN));\nif($a == $d)\n{\n     if($c == 0)\n     {\n          print \"1\";\n     }\n     else\n     {\n          print \"0\";\n     }\n}\nelse\n{\n     print \"0\";\n}\n?>"}], "src_uid": "b99578086043537297d374dc01eeb6f8"}
{"nl": {"description": "Vasya likes to solve equations. Today he wants to solve $$$(x~\\mathrm{div}~k) \\cdot (x \\bmod k) = n$$$, where $$$\\mathrm{div}$$$ and $$$\\mathrm{mod}$$$ stand for integer division and modulo operations (refer to the Notes below for exact definition). In this equation, $$$k$$$ and $$$n$$$ are positive integer parameters, and $$$x$$$ is a positive integer unknown. If there are several solutions, Vasya wants to find the smallest possible $$$x$$$. Can you help him?", "input_spec": "The first line contains two integers $$$n$$$ and $$$k$$$ ($$$1 \\leq n \\leq 10^6$$$, $$$2 \\leq k \\leq 1000$$$).", "output_spec": "Print a single integer $$$x$$$\u00a0\u2014 the smallest positive integer solution to $$$(x~\\mathrm{div}~k) \\cdot (x \\bmod k) = n$$$. It is guaranteed that this equation has at least one positive integer solution.", "sample_inputs": ["6 3", "1 2", "4 6"], "sample_outputs": ["11", "3", "10"], "notes": "NoteThe result of integer division $$$a~\\mathrm{div}~b$$$ is equal to the largest integer $$$c$$$ such that $$$b \\cdot c \\leq a$$$. $$$a$$$ modulo $$$b$$$ (shortened $$$a \\bmod b$$$) is the only integer $$$c$$$ such that $$$0 \\leq c &lt; b$$$, and $$$a - c$$$ is divisible by $$$b$$$.In the first sample, $$$11~\\mathrm{div}~3 = 3$$$ and $$$11 \\bmod 3 = 2$$$. Since $$$3 \\cdot 2 = 6$$$, then $$$x = 11$$$ is a solution to $$$(x~\\mathrm{div}~3) \\cdot (x \\bmod 3) = 6$$$. One can see that $$$19$$$ is the only other positive integer solution, hence $$$11$$$ is the smallest one."}, "positive_code": [{"source_code": "<?php\n/*****************************************/\nclass InputReader {protected $_fh;public function __construct($fileHandler = STDIN){$this->_fh = $fileHandler;}\n\tpublic function readInt() {$d = trim(fgets($this->_fh));return (int)$d;}\n\tpublic function readArrayOfInt($size, $indexFrom = 0) {$a = [];$ind = $indexFrom;foreach (explode(' ', fgets($this->_fh)) as $item) {$a[$ind++] = (int)$item;}return $a;}\n\tpublic function readArrayOfString($size, $indexFrom = 0) {$a = [];$ind = $indexFrom;foreach (explode(' ', fgets($this->_fh)) as $item) {$a[$ind++] = $item;}return $a;}\n}\n\nclass Utils {\n\t/* Perform action N times. Can return values in array */\n\tstatic public function ntimes($n, $func, $returnResults = false) {$a = [];for ($i=1; $i<=$n; $i++) {$result = $func();if ($returnResults) {$a[$i] = $result;}}return $a;}\n\t/* Integral. Keys preserved. By reference. */\n\tstatic public function cumsum(&$a){$sum = 0;foreach($a as $k=>$v) {$a[$k] += $sum;$sum = $a[$k];}}\n\t/* Difference. Keys preserved. By reference. */\n\tstatic public function diff(&$a){$prev = 0;foreach($a as $k=>$v) {$buf=$a[$k];$a[$k]-=$prev;$prev = $buf;}}\n\tstatic public function bitCount($n){$cnt = 0;for ($j=$n; $j; $j>>=1){$cnt += $j&1;}return $cnt;}\n}\n\nclass PrimeUtils {static protected $divisors = [1 => [1=>true],2 => [1=>true, 2=>true],];static protected $primes = []; \n\tstatic public function primes($limit){$a = str_repeat(chr(85), ($limit>>3) + 1);$a[0] = chr(83);for ($i=3; $i*$i < $limit; $i+=2) {if (ord($a[$i>>3]) & (1<<($i%8))) {;} else {for ($k=$i; $k*$i<$limit; $k++) {$n = $k*$i;$a[$n>>3] = chr(ord($a[$n>>3]) | (1<<($n%8)));}}}yield 2;for ($i=3; $i<$limit; $i+=2) {if (!(ord($a[$i>>3]) & (1<<($i%8)))) {yield $i;}}}\n\tstatic public function divisors($n, $lp = 2) {if (isset(self::$divisors[$n])) {return self::$divisors[$n];}if (empty(self::$primes)) {$primes = [];foreach (self::primes(1e3) as $prime) {$primes[$prime] = $prime;}self::$primes = $primes;}$r = [];foreach (self::$primes as $p) {if ($p>=$lp) {if ($n < $p*$p) {$r = [1=>true, $n=>true];break;} elseif ($n%$p==0) {foreach([1, $p] as $pre) {foreach(self::divisors(intdiv($n,$p), $p) as $nxt=>$v) {$r[$nxt*$pre] = true;}}break;}}}self::$divisors[$n] = $r;return self::$divisors[$n];}\n}\n\n/*****************************************/\n\n$ir = new InputReader();\n\n/* TASK */\n\nlist($n, $k) = $ir->readArrayOfInt(2);\n$xs = [];\nforeach(PrimeUtils::divisors($n) as $divisor=>$v) {\n\t$l = $divisor;\n\t$m = intval($n/$l);\n\t//echo \"$divisor, $l, $m, $k\\n\";\n\t\n\tif ($m<$k) {\n\t\t$xs[] = $k*$l + $m;\n\t}\n}\n\nif (empty($xs)) {\n\techo $n*$k+1;\n} else {\n\techo min($xs);\n}\n"}], "negative_code": [{"source_code": "<?php\n/*****************************************/\nclass InputReader {protected $_fh;public function __construct($fileHandler = STDIN){$this->_fh = $fileHandler;}\n\tpublic function readInt() {$d = trim(fgets($this->_fh));return (int)$d;}\n\tpublic function readArrayOfInt($size, $indexFrom = 0) {$a = [];$ind = $indexFrom;foreach (explode(' ', fgets($this->_fh)) as $item) {$a[$ind++] = (int)$item;}return $a;}\n\tpublic function readArrayOfString($size, $indexFrom = 0) {$a = [];$ind = $indexFrom;foreach (explode(' ', fgets($this->_fh)) as $item) {$a[$ind++] = $item;}return $a;}\n}\n\nclass Utils {\n\t/* Perform action N times. Can return values in array */\n\tstatic public function ntimes($n, $func, $returnResults = false) {$a = [];for ($i=1; $i<=$n; $i++) {$result = $func();if ($returnResults) {$a[$i] = $result;}}return $a;}\n\t/* Integral. Keys preserved. By reference. */\n\tstatic public function cumsum(&$a){$sum = 0;foreach($a as $k=>$v) {$a[$k] += $sum;$sum = $a[$k];}}\n\t/* Difference. Keys preserved. By reference. */\n\tstatic public function diff(&$a){$prev = 0;foreach($a as $k=>$v) {$buf=$a[$k];$a[$k]-=$prev;$prev = $buf;}}\n\tstatic public function bitCount($n){$cnt = 0;for ($j=$n; $j; $j>>=1){$cnt += $j&1;}return $cnt;}\n}\n\nclass PrimeUtils {static protected $divisors = [1 => [1=>true],2 => [1=>true, 2=>true],];static protected $primes = []; \n\tstatic public function primes($limit){$a = str_repeat(chr(85), ($limit>>3) + 1);$a[0] = chr(83);for ($i=3; $i*$i < $limit; $i+=2) {if (ord($a[$i>>3]) & (1<<($i%8))) {;} else {for ($k=$i; $k*$i<$limit; $k++) {$n = $k*$i;$a[$n>>3] = chr(ord($a[$n>>3]) | (1<<($n%8)));}}}yield 2;for ($i=3; $i<$limit; $i+=2) {if (!(ord($a[$i>>3]) & (1<<($i%8)))) {yield $i;}}}\n\tstatic public function divisors($n, $lp = 2) {if (isset(self::$divisors[$n])) {return self::$divisors[$n];}if (empty(self::$primes)) {$primes = [];foreach (self::primes(1e3) as $prime) {$primes[$prime] = $prime;}self::$primes = $primes;}$r = [];foreach (self::$primes as $p) {if ($p>=$lp) {if ($n < $p*$p) {$r = [1=>true, $n=>true];break;} elseif ($n%$p==0) {foreach([1, $p] as $pre) {foreach(self::divisors(intdiv($n,$p), $p) as $nxt=>$v) {$r[$nxt*$pre] = true;}}break;}}}self::$divisors[$n] = $r;return self::$divisors[$n];}\n}\n\n/*****************************************/\n\n$ir = new InputReader();\n\n/* TASK */\n\nlist($n, $k) = $ir->readArrayOfInt(2);\n$xs = [];\nforeach(PrimeUtils::divisors($n) as $divisor=>$v) {\n\t$l = $divisor;\n\t$m = intval($n/$l);\n\t//echo \"$divisor, $l, $m, $k\\n\";\n\t\n\tif ($m<$k) {\n\t\t$xs[] = $k*$l + $m;\n\t}\n}\n//var_dump($xs);\necho min($xs);\n"}], "src_uid": "ed0ebc1e484fcaea875355b5b7944c57"}
{"nl": {"description": "Being a nonconformist, Volodya is displeased with the current state of things, particularly with the order of natural numbers (natural number is positive integer number). He is determined to rearrange them. But there are too many natural numbers, so Volodya decided to start with the first n. He writes down the following sequence of numbers: firstly all odd integers from 1 to n (in ascending order), then all even integers from 1 to n (also in ascending order). Help our hero to find out which number will stand at the position number k.", "input_spec": "The only line of input contains integers n and k (1\u2009\u2264\u2009k\u2009\u2264\u2009n\u2009\u2264\u20091012). Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.", "output_spec": "Print the number that will stand at the position number k after Volodya's manipulations.", "sample_inputs": ["10 3", "7 7"], "sample_outputs": ["5", "6"], "notes": "NoteIn the first sample Volodya's sequence will look like this: {1, 3, 5, 7, 9, 2, 4, 6, 8, 10}. The third place in the sequence is therefore occupied by the number 5."}, "positive_code": [{"source_code": "<?php\n\n$f = fopen('php://stdin', 'r');\n//$f = fopen('test.txt', 'r');\nlist($n,$k) = explode(\" \",trim(fgets($f)));\n\n\n$mod = ceil($n/2);\n\n//echo(\"$k $mod\\n\");\n\nif ($k<=$mod){\n    echo ($k-1)*2+1;\n    exit;\n} else {\n    echo ($k-$mod)*2;\n}"}, {"source_code": "<?php\nfscanf(STDIN,\"%f%f\",$n,$k);\n$n=floor(($n+1)/2);\necho $k<=$n?2*$k-1:2*($k-$n);\n?>"}, {"source_code": " <?php\n     \n    $input = fopen(\"php://stdin\",\"r\");\n    while(fscanf($input,\"%s %s\",$n,$k)){//echo $n;\n        if($k<=$n && $n<=pow(10,12) && $k>0){\n            \n            $half = ceil($n/2);\n            if($k<=$half){\n                $num = 2*$k-1;\n            }else{\n                $num = 2*($k-$half);\n            }\n            echo $num.\"\\n\";\n        }\n        $n = $k = null;\n    }\n    ?>"}, {"source_code": "<?php\n$n = explode(\" \", trim(fgets(STDIN)));\n$d = ceil($n[0] / 2);\nif ($n[1] <= $d)\n    echo (($n[1] * 2) - 1);\nelse\n    echo (2 * ($n[1] - $d));\n?>"}, {"source_code": "<?\n\nerror_reporting(false);\n//error_reporting(E_ALL);\n\n$handle = fopen('php://stdin', 'r');\n\nif (file_exists(\"in.txt\")) {\n    $handle = fopen('in.txt', 'r');\n    set_time_limit(2);\n};\n\n\n\nlist($n, $k) = explode(\" \", trim(fgets($handle)));\n\n$nums =  ceil($n/2);\n\nif ($k <= $nums) {\n\n    printf(\"%.0f\", $k * 2 - 1);\n} else {\n    printf(\"%.0f\", ($k - $nums) * 2);\n}\n"}, {"source_code": "<?php\n$n=explode(\" \", trim(fgets(STDIN)));\n$temp=ceil($n[0]/2);\n\nif ($n[1] <= $temp) {\n\techo (($n[1] * 2)-1);\n}else{\n\techo (2 * ($n[1]-$temp));\n}\n\n?>"}, {"source_code": "<?php\n// 318A     \u0427\u0435\u0442 \u0438 \u043d\u0435\u0447\u0435\u0442  \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\nlist($n, $k) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$x = substr($n, strlen($n)-1, 1);\n$countNech = bcdiv($n, '2', 0);\n\nif (($x % 2) !== 0) {\n    $countNech = bcadd($countNech, '1', 0);\n}\n\nif (bccomp($k, $countNech) == 1) {\n    $k = bcsub($k, $countNech, 0); \n    $out = bcmul($k, '2', 0);\n} else {\n    $out = bcmul($k, '2', 0);\n    $out = bcsub($out, '1', 0); \n}\n\necho $out;\n\n?>"}, {"source_code": "<?php\n\n$s = fopen(\"php://stdin\", 'r');\n$n = stream_get_contents($s);\n\n$arr=explode(\" \", $n);\n$n=$arr[0]; //max n\n$k=$arr[1]; //position k\n\n$tempArr=array();\n\n\n$median=ceil($n/2);\n\nif ($k<=$median)\n{\nprint($k*2-1);\n}\nelse{\nprint (($k-$median)*2);\n}\n \n?>"}, {"source_code": "<?php\n\n$stdin = fopen('php://stdin', 'r');\n$data = explode(\" \", trim(fgets($stdin)));\n$n = $data[0]; $k = $data[1];\n$part = ceil($n/2);\nif($k > $part)\n{\n    echo 2 * ($k-$part);\n}\n else {\n    echo 2*($k-1)+1;\n}"}, {"source_code": "<?php\n// Hi chaotic\n$localtest = ini_get(\"display_errors\"); // normally true, codeforces sets to false\nif ($localtest) {echo \"derp\";}\n\nif ($localtest) {$stdin = fopen(\"localtest.txt\", \"r\");} else {$stdin = fopen(\"php://stdin\", \"r\");}\nfunction g($num = -1) {\n    global $stdin;\n    $input = explode(\" \", trim(fgets($stdin)));\n    if ($num == -1) {return $input;} else {return $input[$num];}\n}\n\n$raw = g();\n$n = $raw[0];\n$k = $raw[1];\n\n$parity = bcmod($n, 2);\n$middle = bcdiv(bcadd($n, $parity), 2);\n\nif (bccomp($k, $middle) != 1) {echo bcsub(bcmul(2, $k), 1);} else {echo bcmul(2, bcsub($k, $middle));}\n?>\n"}, {"source_code": "<?php\nerror_reporting(\"off\");\n//318A: Even Odds\nlist($n, $k) = explode(\" \", trim(fgets(STDIN))); //$n = 7; $k = 7;\n$oddnums = ceil($n / 2);\n\n//first find out if $k lands in the even places or the odd places.\nif ($k > $oddnums) {\n    //if so, it's even. ith even number is 2i.\n    $i = $k - $oddnums;\n    echo 2 * $i;\n} else {\n    //it's odd. the ith odd number is 2(i-1) + 1.\n    echo 2 * ($k - 1) + 1;\n}\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = ceil($a / 2);\nif($b <= $c)\n{\n    printf(\"%.0f\", ($b * 2) - 1);\n}\nelseif($b > $c)\n{\n    printf(\"%.0f\", ($b - $c) * 2);\n}\n?>"}, {"source_code": "<?php\nfscanf(STDIN,\"%f%f\",$n,$k);\n$n=floor(($n+1)/2);\necho $k<=$n?2*$k-1:2*($k-$n);\n?>"}, {"source_code": "<?php\n\t$input = trim(fgets(STDIN));\n\t$x = explode(\" \", $input);\n\t$n = $x[0];\n\t$k = $x[1];\n\t$mid = ceil($n/2);\n\tif($k <= $mid)\n\t\t$result = (2*$k)-1;\n\telse\n\t{\n\t\t$y = $k - $mid;\n\t\t$result = 2 * $y;\n\t}\n\techo $result;\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%f %f\", $n, $r);\n        if ( floor(($n + 1 ) / 2) >= $r){\n            printf(\"%.0f\" ,$r * 2 - 1);\n        }\n        else\n            printf(\"%.0f\", ((floor(($n + 1) / 2)) - $r) * -2);\n        \n    "}, {"source_code": "<?php\n$localtest = false;\n\n/* Module for retrieving input */\n\n// If this is a local test (variable toggled above), open from localtest.txt instead of php://stdin (because I'm too lazy to supply the arguments by stdin)\nif ($localtest) {$stdin = fopen(\"localtest.txt\", \"r\");} else {$stdin = fopen(\"php://stdin\", \"r\");}\nfunction g($num = -1) {\n    global $stdin;\n    $input = explode(\" \", trim(fgets($stdin)));\n    if ($num == -1) {return $input;} else {return $input[$num];}\n}\n\n/* Imported functions from chaotic_iak's library */\n// none\n\n/* chaotic_iak's solution */\n$raw = g();\n$n = $raw[0];\n$k = $raw[1];\n\n$parity = bcmod($n, 2);\n$middle = bcdiv(bcadd($n, $parity), 2);\n\nif (bccomp($k, $middle) != 1) {echo bcsub(bcmul(2, $k), 1);} else {echo bcmul(2, bcsub($k, $middle));}\n?>"}, {"source_code": "<?php\nlist ($k,$n) = explode(\" \",trim(fgets(STDIN)));\n$n=$n-1;\nif ($n<$k/2) echo intval($k/($k/2))*$n+1;\nelse echo 2+2*($n-round($k/2));\n"}, {"source_code": "<?php\n$count_even = $count_odds = $n = $k = $value = 0;\nfscanf(STDIN, \"%f%f\", $n, $k);\nif ($n%2 == 0) {\n    $count_even = $n/2;\n    $count_odds = $n/2;\n} else {\n    $count_even = ($n - 1)/2;\n    $count_odds = ($n - 1)/2 + 1;\n}\n\nif ($k <= $count_odds) {\n    $value = $k * 2 - 1;\n} else {\n    $value = ($k - $count_odds) * 2;\n}\nprint($value);"}, {"source_code": "<?php\nfscanf(STDIN,\"%f %f\",$n,$k);\n$mid=ceil($n/2);\necho $k<=$mid?2*$k-1:2*($k-$mid);"}], "negative_code": [{"source_code": "<?php\n\n//$f = fopen('php://stdin', 'r');\n$f = fopen('test.txt', 'r');\nlist($n,$k) = explode(\" \",trim(fgets($f)));\n\n\n$mod = ceil($n/2);\n\n//echo(\"$k $mod\\n\");\n\nif ($k<=$mod){\n    echo ($k-1)*2+1;\n    exit;\n} else {\n    echo ($k-$mod)*2;\n}"}, {"source_code": "<?php\n\n$f = fopen('php://stdin', 'r');\n//$f = fopen('test.txt', 'r');\nlist($n,$k) = explode(\" \",trim(fgets($f)));\n\n\n$mod = ceil($n/2);\n\necho(\"$k $mod\\n\");\n\nif ($k<=$mod){\n    echo ($k-1)*2+1;\n    exit;\n} else {\n    echo ($k-$mod)*2;\n}"}, {"source_code": "<?php\n\n#fscanf(STDIN , \"%lld%lld\" , $n,$k);\nlist($n,$k) = explode(\" \" , trim(fgets(STDIN)));\nif($n % 2 == 1) $n ++;\nif($k <= $n / 2) echo 2* $k - 1;\nelse {\n\t$k -= $n / 2;\n\techo 2 *  $k;\n}\n\n?>"}, {"source_code": "<?php\n\nfscanf(STDIN , \"%d%d\" , $n,$k);\nif($n % 2 == 1) $n ++;\nif($k <= $n / 2) echo 2* $k - 1;\nelse {\n\t$k -= $n / 2;\n\techo 2 *  $k;\n}\n\n?>"}, {"source_code": "    <?php\n     \n    $input = fopen(\"php://stdin\",\"r\");\n    while(fscanf($input,\"%d %d\",$n,$k)){\n        if($k<=$n && $n<=pow(10,12) && $k>0){\n            $half = ceil($n/2);\n            if($k<=$half){\n                $num = 2*$k-1;\n            }else{\n                $num = 2*($k-$half);\n            }\n            echo $num.\"\\n\";\n        }\n        $n = $k = null;\n    }\n    ?>"}, {"source_code": "<?\n\nerror_reporting(false);\n//error_reporting(E_ALL);\n\n$handle = fopen('php://stdin', 'r');\n\nif (file_exists(\"in.txt\")) {\n    $handle = fopen('in.txt', 'r');\n    set_time_limit(2);\n};\n\n\n\nlist($n, $k) = explode(\" \", trim(fgets($handle)));\n\n$nums =  intval(($n + 1)/2);\n\n\n\n\nif ($k <= $nums) {\n\n    $rtn =  $k * 2 - 1;\n} else {\n    $rtn = ($k - $nums) * 2;\n}\n\nprintf(\"%u\", $rtn);\n//%u\n\n\n?>\n"}, {"source_code": "<?\n\nerror_reporting(false);\n//error_reporting(E_ALL);\n\n$handle = fopen('php://stdin', 'r');\n//$handle = fopen('in.txt', 'r');\n\nlist($n, $k) = explode(\" \", trim(fgets($handle)));\n\n$nums =  intval(($n + 1)/2);\n\n\n\n\nif ($k <= $nums) {\n\n    echo  $k * 2 - 1;\n} else {\n    echo ($k - $nums) * 2;\n}\n\n\n\n?>\n"}, {"source_code": "<?php\n$n=explode(\" \", trim(fgets(STDIN)));\n$arr=array();\nfor ($i=1; $i < $n[0] ; $i++) { \n\tif ($i%2 != 0) {\n\t\tarray_push($arr, $i);\n\t}\n}\n\nfor ($i=1; $i < $n[0] ; $i++) { \n\tif ($i%2 == 0) {\n\t\tarray_push($arr, $i);\n\t}\n}\n\necho strpos($n[1], $arr)+1;\n\n?>"}, {"source_code": "<?php\n$n=explode(\" \", trim(fgets(STDIN)));\n$temp=ceil($n[1]/2);\n\nif ($n[1] <= $temp) {\n\techo (($n[1] * 2)-1);\n}else{\n\techo (2 * ($n[1]-$temp));\n}\n\n?>"}, {"source_code": "<?php\n// 318A     \u0427\u0435\u0442 \u0438 \u043d\u0435\u0447\u0435\u0442  \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\nlist($n, $k) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$x = substr($n, strlen($n)-1, 1);\n$countNech = bcdiv($n, '2', 0);\n\nif (($x % 2) !== 0) {\n    $countNech = bcadd($countNech, '1', 0);\n}\n\nif (bccomp($k, $countNech) >= 0) {\n    $k = bcsub($k, $countNech, 0); \n    $out = bcmul($k, '2', 0);\n} else {\n    $out = bcmul($k, '2', 0);\n    $out = bcsub($out, '1', 0); \n}\n\necho $out;\n\n?>"}, {"source_code": "<?php\n\n$stdin = fopen('php://stdin', 'r');\n$data = explode(\" \", trim(fgets($stdin)));\n$n = $data[0]; $k = $data[1];\n$part = ceil($n/2);\nif($k > $part)\n{\n    echo 2 * ($part-$k);\n}\n else {\n    echo 2*($k-1)+1;\n}"}, {"source_code": "<?php\n// derp does this work the same as in Custom Test?\nvar_dump(ini_get(\"ONLINE_JUDGE\"));\n?>"}, {"source_code": "<?php\n\t$input = trim(fgets(STDIN));\n\t$x = explode(\" \", $input);\n\t$n = intval($x[0]);\n\t$k = intval($x[1]);\n\t$mid = ceil($n/2);\n\tif($k <= $mid)\n\t\t$result = (2*$k)-1;\n\telse\n\t{\n\t\t$y = $k - $mid;\n\t\t$result = 2 * $y;\n\t}\n\techo $result;\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d %d\", $n, $r);\n    $k = 1;\n        if (($n % 2 == 0) && ($n / 2 >= $r)){\n            for ($i = 0; $i < $r - 1; $i++){\n                $k = $k + 2;\n                echo $k;\n            }\n        }\n        if (($n % 2 == 0) && ($n / 2 < $r)){\n            for ($i = 0; $i < ($r - $n / 2 ) ; $i++){\n                $k = $k + 1;\n                echo $k;\n            }\n        }\n        if (($n % 2 != 0) && ( round($n / 2) >= $r)){\n            for ($i = 0; $i < $r - 1; $i++){\n                $k = $k + 2; \n                echo ($k);\n            }\n        }if (($n % 2 !== 0) && ( round($n / 2) < $r)){\n            for ($i = 0; $i < ($r - round($n / 2)); $i++){\n                $k = $k + 1; \n                echo ($k + 2);\n            }\n        }\n        "}, {"source_code": "<?php\n    fscanf(STDIN, \"%d %d\", $n, $r);\n        if ( intval( ($n + 1 ) / 2) >= $r){\n            echo ( $r * 2 - 1);\n        }\n        else\n            echo (( intval( ($n + 1 ) / 2) - $r) * -2);\n        \n    "}, {"source_code": "<?php\nif (ONLINE_JUDGE !== true) {echo \"derp\";}\n\n/* Module for retrieving input */\n\n// If this is a local test (variable toggled above), \nif ($localtest) {$stdin = fopen(\"localtest.txt\", \"r\");} else {$stdin = fopen(\"php://stdin\", \"r\");}\nfunction g($num = -1) {\n    global $stdin;\n    $input = explode(\" \", trim(fgets($stdin)));\n    if ($num == -1) {return $input;} else {return $input[$num];}\n}\n\n/* Imported functions from chaotic_iak's library */\n// none\n\n/* chaotic_iak's solution */\n$raw = g();\n$n = $raw[0];\n$k = $raw[1];\n\n$parity = $n % 2;\n$middle = ($n + $parity) / 2;\n\nif ($k <= $middle) {echo 2*$k - 1;} else {echo 2*$k - $n - $parity;}\n?>"}, {"source_code": "<?php\nif ((ONLINE_JUDGE !== \"true\") && (ONLINE_JUDGE !== true)) {echo \"derp\";}\n\n$localtest = false;\n\n/* Module for retrieving input */\n\n// If this is a local test (variable toggled above), open from localtest.txt instead of php://stdin (because I'm too lazy to supply the arguments by stdin)\nif ($localtest) {$stdin = fopen(\"localtest.txt\", \"r\");} else {$stdin = fopen(\"php://stdin\", \"r\");}\nfunction g($num = -1) {\n    global $stdin;\n    $input = explode(\" \", trim(fgets($stdin)));\n    if ($num == -1) {return $input;} else {return $input[$num];}\n}\n\n/* Imported functions from chaotic_iak's library */\n// none\n\n/* chaotic_iak's solution */\n$raw = g();\n$n = $raw[0];\n$k = $raw[1];\n\n$parity = bcmod($n, 2);\n$middle = bcdiv(bcadd($n, $parity), 2);\n\nif (bccomp($k, $middle) != 1) {echo bcsub(bcmul(2, $k), 1);} else {echo bcmul(2, bcsub($k, $middle));}\n?>"}, {"source_code": "<?php\nif (!(defined(ONLINE_JUDGE))) {echo \"derp\";}\n\n/* Module for retrieving input */\n\n// If this is a local test (variable toggled above), \nif ($localtest) {$stdin = fopen(\"localtest.txt\", \"r\");} else {$stdin = fopen(\"php://stdin\", \"r\");}\nfunction g($num = -1) {\n    global $stdin;\n    $input = explode(\" \", trim(fgets($stdin)));\n    if ($num == -1) {return $input;} else {return $input[$num];}\n}\n\n/* Imported functions from chaotic_iak's library */\n// none\n\n/* chaotic_iak's solution */\n$raw = g();\n$n = $raw[0];\n$k = $raw[1];\n\n$parity = $n % 2;\n$middle = ($n + $parity) / 2;\n\nif ($k <= $middle) {echo 2*$k - 1;} else {echo 2*$k - $n - $parity;}\n?>"}, {"source_code": "<?php\n$localtest = false;\n\n/* Module for retrieving input */\n\n// If this is a local test (variable toggled above), \nif ($localtest) {$stdin = fopen(\"localtest.txt\", \"r\");} else {$stdin = fopen(\"php://stdin\", \"r\");}\nfunction g($num = -1) {\n    global $stdin;\n    $input = explode(\" \", trim(fgets($stdin)));\n    if ($num == -1) {return $input;} else {return $input[$num];}\n}\n\n/* Imported functions from chaotic_iak's library */\n// none\n\n/* chaotic_iak's solution */\n$raw = g();\n$n = $raw[0];\n$k = $raw[1];\n\n$parity = $n % 2;\n$middle = ($n + $parity) / 2;\n\nif ($k <= $middle) {echo 2*$k - 1;} else {echo 2*$k - $n - $parity;}\n?>"}, {"source_code": "<?php\nlist ($k,$n) = explode(\" \",trim(fgets(STDIN)));\n$n=$n-1;\nif ($n<$k/2) echo intval($k/($k/2))*$n+1;\nelse echo 2+2*(round($k/2)-$n);\n"}, {"source_code": "<?php\n\nfscanf(STDIN, \"%d%d\", $n, $k);\n$even = range(2,$n, 2);\n$odd = range(1,$n, 2);\nprint_r($even);\nprint_r($odd);\nfor ($i = count($odd)-1; $i >= 0; $i--) {\n    array_unshift($even, $odd[$i]);\n}\nprint($even[$k-1]);\n"}, {"source_code": "<?php\n$input = array();\n$count_even = $count_odds = $n = $k = $value = 0;\n$input = explode(\" \", (trim(fgets(STDIN))));\n$n = $input[0];\n$k = $input[1];\nif ($n%2 == 0) {\n    $count_even = $n/2;\n    $count_odds = $n/2;\n} else {\n    $count_even = intdiv($n, 2);\n    $count_odds = intdiv($n, 2) + 1;\n}\n\nif ($k <= $count_odds) {\n    $value = $k * 2 - 1;\n} else {\n    $value = ($k - $count_odds) * 2;\n}\nprint($value);"}, {"source_code": "<?php\n$input = array();\n$count_even = $count_odds = $n = $k = $value = 0;\n$input = explode(\" \", (trim(fgets(STDIN, 4096))));\n$n = $input[0];\n$k = $input[1];\nif ($n%2 == 0) {\n    $count_even = $n/2;\n    $count_odds = $n/2;\n} else {\n    $count_even = intdiv($n, 2);\n    $count_odds = intdiv($n, 2) + 1;\n}\n\nif ($k <= $count_odds) {\n    $value = $k * 2 - 1;\n} else {\n    $value = ($k - $count_odds) * 2;\n}\nprint($value);\n"}, {"source_code": "<?php\n\nfscanf(STDIN, \"%d%d\", $n, $k);\nif ($n%2 == 0) {\n    $count_even = $n/2;\n    $count_odds = $n/2;\n} else {\n    $count_even = intdiv($n, 2);\n    $count_odds = intdiv($n, 2) + 1;\n}\n\nif ($k <= $count_odds) {\n    $value = $k * 2 - 1;\n} else {\n    $value = ($k - $count_odds) * 2;\n}\nprint($value);"}, {"source_code": "<?php\n$count_even = $count_odds = $n = $k = $value = 0;\nfscanf(STDIN, \"%d%d\", $n, $k);\nif ($n%2 == 0) {\n    $count_even = $n/2;\n    $count_odds = $n/2;\n} else {\n    $count_even = intdiv($n, 2);\n    $count_odds = intdiv($n, 2) + 1;\n}\n\nif ($k <= $count_odds) {\n    $value = $k * 2 - 1;\n} else {\n    $value = ($k - $count_odds) * 2;\n}\nprint($value);"}, {"source_code": "<?php\n$count_even = $count_odds = $n = $k = $value = 0;\nfscanf(STDIN, \"%f%f\", $n, $k);\nif ($n%2 == 0) {\n    $count_even = $n/2;\n    $count_odds = $n/2;\n} else {\n    $count_even = intdiv($n, 2);\n    $count_odds = intdiv($n, 2) + 1;\n}\n\nif ($k <= $count_odds) {\n    $value = $k * 2 - 1;\n} else {\n    $value = ($k - $count_odds) * 2;\n}\nprint($value);"}, {"source_code": "<?php\n\nfscanf(STDIN, \"%d%d\", $n, $k);\n$even = range(2,$n, 2);\n$odd = range(1,$n, 2);\nfor ($i = count($odd)-1; $i >= 0; $i--) {\n    array_unshift($even, $odd[$i]);\n}\nprint($even[$k-1]);"}, {"source_code": "<?php\n$count_even = $count_odds = $n = $k = $value = 0;\nfscanf(STDIN, \"%F%F\", $n, $k);\nif ($n%2 == 0) {\n    $count_even = $n/2;\n    $count_odds = $n/2;\n} else {\n    $count_even = intdiv($n, 2);\n    $count_odds = intdiv($n, 2) + 1;\n}\n\nif ($k <= $count_odds) {\n    $value = $k * 2 - 1;\n} else {\n    $value = ($k - $count_odds) * 2;\n}\nprint($value);"}, {"source_code": "<?php\n\n$f = fopen('php://stdin', 'r');\n//$f = fopen('test.txt', 'r');\nlist($n,$k) = explode(\" \",trim(fgets($f)));\n\n\n$mod = ceil($n/2);\n\n//echo(\"$k $mod\\n\");\n\nif ($k<$mod){\n    echo ($k-1)*2+1;\n    exit;\n} else {\n    echo ($k-$mod)*2;\n}"}], "src_uid": "1f8056884db00ad8294a7cc0be75fe97"}
{"nl": {"description": "A monster is chasing after Rick and Morty on another planet. They're so frightened that sometimes they scream. More accurately, Rick screams at times b,\u2009b\u2009+\u2009a,\u2009b\u2009+\u20092a,\u2009b\u2009+\u20093a,\u2009... and Morty screams at times d,\u2009d\u2009+\u2009c,\u2009d\u2009+\u20092c,\u2009d\u2009+\u20093c,\u2009....   The Monster will catch them if at any point they scream at the same time, so it wants to know when it will catch them (the first time they scream at the same time) or that they will never scream at the same time.", "input_spec": "The first line of input contains two integers a and b (1\u2009\u2264\u2009a,\u2009b\u2009\u2264\u2009100).  The second line contains two integers c and d (1\u2009\u2264\u2009c,\u2009d\u2009\u2264\u2009100).", "output_spec": "Print the first time Rick and Morty will scream at the same time, or \u2009-\u20091 if they will never scream at the same time.", "sample_inputs": ["20 2\n9 19", "2 1\n16 12"], "sample_outputs": ["82", "-1"], "notes": "NoteIn the first sample testcase, Rick's 5th scream and Morty's 8th time are at time 82. In the second sample testcase, all Rick's screams will be at odd times and Morty's will be at even times, so they will never scream at the same time."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\nlist($c, $d) = explode(\" \", trim(fgets(STDIN)));\n$e = $b;\n$f = $d;\n$g = array($e);\n$h = array($f);\nfor($x = 1; $x <= 10000; $x++)\n{\n     $e = $b + ($a * $x);\n     $f = $d + ($c * $x);\n     $g[$x] = $e;\n     $h[$x] = $f;\n}\n$i = array_intersect($g, $h);\nif(count($i) > 0)\n{\n     $j = current($i);\n     print $j;\n}\nelse\n{\n     print \"-1\";\n}\n?>"}, {"source_code": "<?php\n        //Enter your code here, enjoy!\n    list($a, $b) = explode(\" \", trim(fgets(STDIN)));\n    list($c, $d) = explode(\" \", trim(fgets(STDIN)));\n    \n    $aa = array();\n    $cc = array();\n    for($i = 0; $i < 5000; $i++)\n    {\n        $aa[$i] = $b + ($a * $i);\n        $cc[$i] = $d + ($c * $i);\n    }\n    \n    $ee = array_intersect($aa, $cc);\n    if( sizeof($ee) > 0)\n    {\n        reset($ee);\n        echo current($ee);\n    } else {\n        echo \"-1\";\n    }\n    \n    echo PHP_EOL;"}, {"source_code": "<?php\nfunction ab($a, $b, $c, $d){\n    $ok = -1;\n    for($i=0;$i<=100;$i++){\n         $t1[$i] = $b + $i*$a;\n    }\n    for($k=0;$k<=100;$k++){\n        if($ok>=0) break;\n        $t2[$k] = $d + $k*$c;\n        if(in_array($t2[$k], $t1)){\n            $ok = $t2[$k];\n        }\n    }\n    return $ok;\n}\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\nlist($c, $d) = explode(\" \", trim(fgets(STDIN)));\necho ab($a,$b,$c,$d);\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(' ', trim(fgets(STDIN)));\nlist($c, $d) = explode(' ', trim(fgets(STDIN)));\n\n$i = 0;\nwhile($i < 1000) {\n    if($b == $d) {\n        echo $b;\n        exit;\n    }\n    else if($b > $d) {\n        $d += $c;\n    }\n    else {\n        $b += $a;\n    }\n    $i++;\n}\necho -1;"}], "negative_code": [], "src_uid": "158cb12d45f4ee3368b94b2b622693e7"}
{"nl": {"description": "You are given an alphabet consisting of n letters, your task is to make a string of the maximum possible length so that the following conditions are satisfied:   the i-th letter occurs in the string no more than ai times;  the number of occurrences of each letter in the string must be distinct for all the letters that occurred in the string at least once. ", "input_spec": "The first line of the input contains a single integer n (2\u2009\u2009\u2264\u2009\u2009n\u2009\u2009\u2264\u2009\u200926)\u00a0\u2014 the number of letters in the alphabet. The next line contains n integers ai (1\u2009\u2264\u2009ai\u2009\u2264\u2009109)\u00a0\u2014 i-th of these integers gives the limitation on the number of occurrences of the i-th character in the string.", "output_spec": "Print a single integer \u2014 the maximum length of the string that meets all the requirements.", "sample_inputs": ["3\n2 5 5", "3\n1 1 2"], "sample_outputs": ["11", "3"], "notes": "NoteFor convenience let's consider an alphabet consisting of three letters: \"a\", \"b\", \"c\". In the first sample, some of the optimal strings are: \"cccaabbccbb\", \"aabcbcbcbcb\". In the second sample some of the optimal strings are: \"acc\", \"cbc\"."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\nrsort($b);\n$c = 0;\nwhile(TRUE)\n{\n     $d = $b[0];\n     $c += $d;\n     $b = array_slice($b, 1);\n     for($x = 0; $x < count($b); $x++)\n     {\n          if($b[$x] == $d)\n          {\n               $b[$x]--;\n          }\n          else\n          {\n               break;\n          }\n     }\n     if($b[0] == 0)\n     {\n          break;\n     }\n}\nprint $c;\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\nrsort($b);\n$c = 0;\nwhile(TRUE)\n{\n     for($x = 0; $x < count($b); $x++)\n     {\n          $d = $b[0];\n          $c += $d;\n          $b = array_slice($b, 1);\n          if($b[$x] == $d)\n          {\n               $b[$x]--;\n          }\n          else\n          {\n               break;\n          }\n     }\n     if($b[0] == 0)\n     {\n          break;\n     }\n}\nprint $c;\n?>"}], "src_uid": "3c4b2d1c9440515bc3002eddd2b89f6f"}
{"nl": {"description": "During the winter holidays, the demand for Christmas balls is exceptionally high. Since it's already 2018, the advances in alchemy allow easy and efficient ball creation by utilizing magic crystals.Grisha needs to obtain some yellow, green and blue balls. It's known that to produce a yellow ball one needs two yellow crystals, green\u00a0\u2014 one yellow and one blue, and for a blue ball, three blue crystals are enough.Right now there are A yellow and B blue crystals in Grisha's disposal. Find out how many additional crystals he should acquire in order to produce the required number of balls.", "input_spec": "The first line features two integers A and B (0\u2009\u2264\u2009A,\u2009B\u2009\u2264\u2009109), denoting the number of yellow and blue crystals respectively at Grisha's disposal. The next line contains three integers x, y and z (0\u2009\u2264\u2009x,\u2009y,\u2009z\u2009\u2264\u2009109)\u00a0\u2014 the respective amounts of yellow, green and blue balls to be obtained.", "output_spec": "Print a single integer\u00a0\u2014 the minimum number of crystals that Grisha should acquire in addition.", "sample_inputs": ["4 3\n2 1 1", "3 9\n1 1 3", "12345678 87654321\n43043751 1000000000 53798715"], "sample_outputs": ["2", "1", "2147483648"], "notes": "NoteIn the first sample case, Grisha needs five yellow and four blue crystals to create two yellow balls, one green ball, and one blue ball. To do that, Grisha needs to obtain two additional crystals: one yellow and one blue."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\nlist($c, $d, $e) = explode(\" \", trim(fgets(STDIN)));\n$c *= 2;\n$e *= 3;\n$c += $d;\n$e += $d;\n$a -= $c;\n$b -= $e;\nif(($a < 0) && ($b < 0))\n{\n     $f = abs($a) + abs($b);\n}\nelseif($a < 0)\n{\n     $f = abs($a);\n}\nelseif($b < 0)\n{\n     $f = abs($b);\n}\nprintf(\"%.0f\", $f);\n?>"}, {"source_code": "<?php\nfscanf(STDIN, \"%d %d\", $a, $b);\nfscanf(STDIN, \"%d %d %d\", $x, $y, $z);\necho (max(2 * $x + $y - $a, 0) + max($y + 3 * $z - $b, 0)) . \"\\n\";\n"}, {"source_code": "<?php\n\n// \u10e3\u10e0\u10d1\u10d0\u10dc \u10db\u10d4\u10dd\u10e0\u10d4, \u10d4\u10e1 \u10d8\u10e7\u10dd \u10e6\u10d5\u10d7\u10d0\u10d4\u10d1\u10d0. \u10db\u10d4 \u10db\u10d0\u10d2\u10d8\u10e1\u10d8.. \u10ef\u10d5\u10d0\u10e0\u10dd\u10e1\u10dc\u10d4\u10d1\u10d8\u10e1 \u10da\u10d0\u10e8\u10e5\u10e0\u10dd\u10d1\u10d0\u10e1 \u10db\u10d0\u10d2\u10d0\u10dc \u10db\u10d8\u10e1\u10ea\u10d0 \u10d1\u10d8\u10eb\u10d2\u10d8. \u10d7\u10d0\u10dc \u10d3\u10d8\u10d3\u10d8.\n\n$urbanTheSecond = 0;\n\nlist($a,$b) = explode(\" \",trim(fgets(STDIN)));\nlist($yellow,$green,$blue) = explode(\" \", trim(fgets(STDIN)));\n\n$a1 = 2*$yellow + $green;\n$b1 = $green + 3*$blue;\n\n\nif($a - $a1 < 0)\n    $urbanTheSecond+=$a1-$a;\n\n\n\nif($b - $b1 < 0)\n    $urbanTheSecond+= $b1 - $b;\n\necho $urbanTheSecond;\n\n?>\n"}], "negative_code": [], "src_uid": "35202a4601a03d25e18dda1539c5beba"}
{"nl": {"description": "Kitahara Haruki has bought n apples for Touma Kazusa and Ogiso Setsuna. Now he wants to divide all the apples between the friends.Each apple weights 100 grams or 200 grams. Of course Kitahara Haruki doesn't want to offend any of his friend. Therefore the total weight of the apples given to Touma Kazusa must be equal to the total weight of the apples given to Ogiso Setsuna.But unfortunately Kitahara Haruki doesn't have a knife right now, so he cannot split any apple into some parts. Please, tell him: is it possible to divide all the apples in a fair way between his friends?", "input_spec": "The first line contains an integer n (1\u2009\u2264\u2009n\u2009\u2264\u2009100) \u2014 the number of apples. The second line contains n integers w1,\u2009w2,\u2009...,\u2009wn (wi\u2009=\u2009100 or wi\u2009=\u2009200), where wi is the weight of the i-th apple.", "output_spec": "In a single line print \"YES\" (without the quotes) if it is possible to divide all the apples between his friends. Otherwise print \"NO\" (without the quotes).", "sample_inputs": ["3\n100 200 100", "4\n100 100 100 200"], "sample_outputs": ["YES", "NO"], "notes": "NoteIn the first test sample Kitahara Haruki can give the first and the last apple to Ogiso Setsuna and the middle apple to Touma Kazusa."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\nsort($b);\n$c = 0;\nfor($x = 0; $x < $a; $x++)\n{\n    $d = array_sum(array_slice($b, 0, $x + 1));\n    $e = array_sum(array_slice($b, $x + 1));\n    if($d == $e)\n    {\n        $c = 1;\n        break;\n    }\n    elseif($d > $e)\n    {\n        $f = $d - $e;\n        if(($f == 200) && ($b[0] == 100))\n        {\n            $c = 1;\n        }\n        break;\n    }\n}\nif($c == 1)\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\nerror_reporting(\"off\");\n//433A: Kitahara Haruki's Gift\n$n = trim(fgets(STDIN)); //$n = 4;\n$apples = explode(\" \", trim(fgets(STDIN))); //$apples = explode(\" \", \"100 100 100 200\");\n$count = array_count_values($apples);\n$totalweight = $count[100] * 100 + $count[200] * 200;\n$half = $totalweight / 100; //getting rid of two zeros for the number of hundreds\nif ($half % 2 !== 0) {\n    echo \"NO\";\n} else {\n    $halfreally = $half / 2;\n    if ($halfreally % 2 == 0) {\n        echo \"YES\";\n    } else {\n        if ($count[100] == 0) {\n            echo \"NO\";\n        } else {\n            echo \"YES\";\n        }\n    }\n}\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array_sum($b) / 2;\n$d = str_split($c);\narray_unshift($d, \" \");\nunset($d[0]);\n$e = array_search(\"5\", $d);\n$f = array_unique($b);\nif(($e == TRUE) || ($a == 1) || ((count($f) == 1) && ((count($b) % 2) != 0)))\n{\n    print \"NO\";\n}\nelse\n{\n    print \"YES\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array_sum($b) / 2;\n$d = str_split($c);\narray_unshift($d, \" \");\nunset($d[0]);\n$e = array_search(\"5\", $d);\nif(($e == TRUE) || ($a == 1))\n{\n    print \"NO\";\n}\nelse\n{\n    print \"YES\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array_sum($b) / 2;\n$d = str_split($c);\narray_unshift($d, \" \");\nunset($d[0]);\n$e = array_search(\"5\", $d);\n$f = array_unique($b);\nif(($e == TRUE) || ($a == 1) || (count($f) == 1))\n{\n    print \"NO\";\n}\nelse\n{\n    print \"YES\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array_sum($b) / 2;\n$d = str_split($c);\nif($d[1] != 0)\n{\n    print \"NO\";\n}\nelse\n{\n    print \"YES\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array_sum($b) / 2;\n$d = str_split($c);\narray_unshift($d, \" \");\nunset($d[0]);\n$e = array_search(\"5\", $d);\n$f = array_unique($d);\nif(($e == TRUE) || ($a == 1) || (count($f) == 1))\n{\n    print \"NO\";\n}\nelse\n{\n    print \"YES\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array_sum($b) / 2;\n$d = str_split($c);\narray_unshift($d, \" \");\nunset($d[0]);\n$e = array_search(\"5\", $d);\nif($e == TRUE)\n{\n    print \"NO\";\n}\nelse\n{\n    print \"YES\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\nsort($b);\n$c = 0;\nfor($x = 0; $x < $a; $x++)\n{\n    $d = array_sum(array_slice($b, 0, $x + 1));\n    $e = array_sum(array_slice($b, $x + 1));\n    if($d == $e)\n    {\n        $c = 1;\n        break;\n    }\n}\nif($c == 1)\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\nerror_reporting(\"off\");\n//433A: Kitahara Haruki's Gift\n$n = trim(fgets(STDIN)); //$n = 4;\n$apples = explode(\" \", trim(fgets(STDIN))); //$apples = explode(\" \", \"100 100 100 200\");\n$count = array_count_values($apples);\n$totalweight = $count[100] * 100 + $count[200] * 200;\n$half = $totalweight / 100; //getting rid of two zeros for the number of hundreds\nif ($half % 2 !== 0) {\n    echo \"NO\";\n} else {\n    echo \"YES\";\n}\n?>"}, {"source_code": "<?php\nerror_reporting(\"off\");\n//433A: Kitahara Haruki's Gift\n$n = trim(fgets(STDIN)); $n = 4;\n$apples = explode(\" \", trim(fgets(STDIN))); $apples = explode(\" \", \"100 100 100 200\");\n$count = array_count_values($apples);\n$totalweight = $count[100] * 100 + $count[200] * 200;\n$half = $totalweight / 100; //getting rid of two zeros for the number of hundreds\nif ($half % 2 !== 0) {\n    echo \"NO\";\n} else {\n    echo \"YES\";\n}\n?>"}], "src_uid": "9679acef82356004e47b1118f8fc836a"}
{"nl": {"description": "Vasya studies music. He has learned lots of interesting stuff. For example, he knows that there are 12 notes: C, C#, D, D#, E, F, F#, G, G#, A, B, H. He also knows that the notes are repeated cyclically: after H goes C again, and before C stands H. We will consider the C note in the row's beginning and the C note after the H similar and we will identify them with each other. The distance between the notes along the musical scale is measured in tones: between two consecutive notes there's exactly one semitone, that is, 0.5 tone. The distance is taken from the lowest tone to the uppest one, that is, the distance between C and E is 4 semitones and between E and C is 8 semitonesVasya also knows what a chord is. A chord is an unordered set of no less than three notes. However, for now Vasya only works with triads, that is with the chords that consist of exactly three notes. He can already distinguish between two types of triads \u2014 major and minor.Let's define a major triad. Let the triad consist of notes X, Y and Z. If we can order the notes so as the distance along the musical scale between X and Y equals 4 semitones and the distance between Y and Z is 3 semitones, then the triad is major. The distance between X and Z, accordingly, equals 7 semitones.A minor triad is different in that the distance between X and Y should be 3 semitones and between Y and Z \u2014 4 semitones.For example, the triad \"C E G\" is major: between C and E are 4 semitones, and between E and G are 3 semitones. And the triplet \"C# B F\" is minor, because if we order the notes as \"B C# F\", than between B and C# will be 3 semitones, and between C# and F \u2014 4 semitones.Help Vasya classify the triad the teacher has given to him.", "input_spec": "The only line contains 3 space-separated notes in the above-given notation.", "output_spec": "Print \"major\" if the chord is major, \"minor\" if it is minor, and \"strange\" if the teacher gave Vasya some weird chord which is neither major nor minor. Vasya promises you that the answer will always be unambiguous. That is, there are no chords that are both major and minor simultaneously.", "sample_inputs": ["C E G", "C# B F", "A B H"], "sample_outputs": ["major", "minor", "strange"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = explode(\" \", trim(fgets(STDIN)));\n$b = array($a[0], $a[2], $a[1]);\n$c = array($a[1], $a[0], $a[2]);\n$d = array($a[1], $a[2], $a[0]);\n$e = array($a[2], $a[0], $a[1]);\n$f = array($a[2], $a[1], $a[0]);\n$g = array($a, $b, $c, $d, $e, $f);\n$h = array(\"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\", \"C\", \"C#\", \"D\", \"D#\", \"E\", \"F\", \"F#\", \"G\", \"G#\", \"A\", \"B\", \"H\");\narray_unshift($h, \" \");\nunset($h[0]);\n$m = 0;\nfor($x = 0; $x < count($g); $x++)\n{\n    $i = $h;\n    $j = array_search($g[$x][0], $i);\n    array_splice($i, 0, $j);\n    array_unshift($i, \" \");\n    unset($i[0]);\n    $k = array_search($g[$x][1], $i);\n    $n = $k + count($h) - count($i);\n    array_splice($i, 0, $k);\n    array_unshift($i, \" \");\n    unset($i[0]);\n    $l = array_search($g[$x][2], $i);\n    $o = $l + count($h) - count($i);\n    if((($n - $j) == 4) && (($o - $n) == 3))\n    {\n        $m = 1;\n        print \"major\";\n        break;\n    }\n    elseif((($n - $j) == 3) && (($o - $n) == 4))\n    {\n        $m = 1;\n        print \"minor\";\n        break;\n    }\n}\nif($m == 0)\n{\n    print \"strange\";\n}\n?>"}], "negative_code": [], "src_uid": "6aa83c2f6e095848bc63aba7d013aa58"}
{"nl": {"description": "Fox Ciel has n boxes in her room. They have the same size and weight, but they might have different strength. The i-th box can hold at most xi boxes on its top (we'll call xi the strength of the box). Since all the boxes have the same size, Ciel cannot put more than one box directly on the top of some box. For example, imagine Ciel has three boxes: the first has strength 2, the second has strength 1 and the third has strength 1. She cannot put the second and the third box simultaneously directly on the top of the first one. But she can put the second box directly on the top of the first one, and then the third box directly on the top of the second one. We will call such a construction of boxes a pile.Fox Ciel wants to construct piles from all the boxes. Each pile will contain some boxes from top to bottom, and there cannot be more than xi boxes on the top of i-th box. What is the minimal number of piles she needs to construct?", "input_spec": "The first line contains an integer n (1\u2009\u2264\u2009n\u2009\u2264\u2009100). The next line contains n integers x1,\u2009x2,\u2009...,\u2009xn (0\u2009\u2264\u2009xi\u2009\u2264\u2009100).", "output_spec": "Output a single integer \u2014 the minimal possible number of piles.", "sample_inputs": ["3\n0 0 10", "5\n0 1 2 3 4", "4\n0 0 0 0", "9\n0 1 0 2 0 1 1 2 10"], "sample_outputs": ["2", "1", "4", "3"], "notes": "NoteIn example 1, one optimal way is to build 2 piles: the first pile contains boxes 1 and 3 (from top to bottom), the second pile contains only box 2.In example 2, we can build only 1 pile that contains boxes 1, 2, 3, 4, 5 (from top to bottom)."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\nfor($x = 1; $x <= 100; $x++)\n{\n    sort($b);\n    $c = array();\n    array_push($c, $b[0]);\n    unset($b[0]);\n    for($y = 1; $y <= 100; $y++)\n    {\n        if($b[$y] == 0)\n        {\n            continue;\n        }\n        elseif($b[$y] >= count($c))\n        {\n            array_push($c, $b[$y]);\n            unset($b[$y]);\n        }\n        elseif($b[$y] < count($c))\n        {\n            continue;\n        }\n    }\n    if(count($b) == 0)\n    {\n        break;\n    }\n}\nprint $x;\n?>"}, {"source_code": "<?php\n\n$n = trim(fgets(STDIN));\n$arr = explode(\" \", trim(fgets(STDIN)));\n\nsort($arr);\n$s=0;\nfor($i=0;$i<$n;$i++){\n    if($s*$arr[$i]+$s<=$i)$s++;\n    \n}\n\necho $s.PHP_EOL;"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\nrsort($b);\n$d = 0;\n$f = 0;\nfor($x = 0; $x < $a; $x++)\n{\n    if($b[$x] == 0)\n    {\n        $f++;\n        unset($b[$x]);\n    }\n}\nrsort($b);\nfor($x = 1; $x <= 100; $x++)\n{\n    $c = 0;\n    $e = $b[$c];\n    for($y = 0; $y < 100; $y++)\n    {        \n        if(($b[$y] < $b[$c]) && ($e > 0) && ($y != 0))\n        {\n            unset($b[$c]);\n            $c = $y;\n            $e--;\n            $e = $b[$c];\n        }\n        elseif(($b[$y] == $b[$c]) && ($e > 0) && ($y != 0))\n        {\n            unset($b[$c]);\n            $c = $y;\n            $e--;\n        }\n    }\n    unset($b[$c]);\n    rsort($b);\n    if(count($b) > 0)\n    {\n        $d++;\n    }\n    else\n    {\n        $d++;\n        break;\n    }\n}\nif($f > $d)\n{\n    print $d + $f - $d;\n}\nelse\n{\n    print $d;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\nrsort($b);\n$d = 0;\nfor($x = 1; $x <= 100; $x++)\n{\n    $c = 0;\n    for($y = 0; $y < 100; $y++)\n    {\n        if($b[$y] < $b[$c])\n        {\n            unset($b[$c]);\n            $c = $y;\n        }\n    }\n    unset($b[$c]);\n    rsort($b);\n    if(count($b) > 0)\n    {\n        $d++;\n    }\n    else\n    {\n        $d++;\n        break;\n    }\n}\nprint $d;\n?>"}], "src_uid": "7c710ae68f27f140e7e03564492f7214"}
{"nl": {"description": "Natasha is planning an expedition to Mars for $$$n$$$ people. One of the important tasks is to provide food for each participant.The warehouse has $$$m$$$ daily food packages. Each package has some food type $$$a_i$$$.Each participant must eat exactly one food package each day. Due to extreme loads, each participant must eat the same food type throughout the expedition. Different participants may eat different (or the same) types of food.Formally, for each participant $$$j$$$ Natasha should select his food type $$$b_j$$$ and each day $$$j$$$-th participant will eat one food package of type $$$b_j$$$. The values $$$b_j$$$ for different participants may be different.What is the maximum possible number of days the expedition can last, following the requirements above?", "input_spec": "The first line contains two integers $$$n$$$ and $$$m$$$ ($$$1 \\le n \\le 100$$$, $$$1 \\le m \\le 100$$$)\u00a0\u2014 the number of the expedition participants and the number of the daily food packages available. The second line contains sequence of integers $$$a_1, a_2, \\dots, a_m$$$ ($$$1 \\le a_i \\le 100$$$), where $$$a_i$$$ is the type of $$$i$$$-th food package.", "output_spec": "Print the single integer\u00a0\u2014 the number of days the expedition can last. If it is not possible to plan the expedition for even one day, print 0.", "sample_inputs": ["4 10\n1 5 2 1 1 1 2 5 7 2", "100 1\n1", "2 5\n5 4 3 2 1", "3 9\n42 42 42 42 42 42 42 42 42"], "sample_outputs": ["2", "0", "1", "3"], "notes": "NoteIn the first example, Natasha can assign type $$$1$$$ food to the first participant, the same type $$$1$$$ to the second, type $$$5$$$ to the third and type $$$2$$$ to the fourth. In this case, the expedition can last for $$$2$$$ days, since each participant can get two food packages of his food type (there will be used $$$4$$$ packages of type $$$1$$$, two packages of type $$$2$$$ and two packages of type $$$5$$$).In the second example, there are $$$100$$$ participants and only $$$1$$$ food package. In this case, the expedition can't last even $$$1$$$ day."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\n$d = floor($b / $a);\n$e = array();\nfor($x = 0; $x < $b; $x++)\n{\n     $e[$c[$x]]++;\n}\nsort($e);\n$f = 0;\nfor($x = $d; $x >= 1; $x--)\n{\n     $g = 0;\n     for($y = 0; $y < count($e); $y++)\n     {\n          $h = floor($e[$y] / $x);\n          $g += $h;\n          if($g >= $a)\n          {\n               $f = max($f, $x);\n               break;\n          }\n     }\n}\nprint $f;\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\n$d = floor($b / $a);\n$e = array();\nfor($x = 0; $x < $b; $x++)\n{\n     $e[$c[$x]]++;\n}\nsort($e);\n$f = 0;\nfor($x = $d; $x >= 1; $x--)\n{\n     $g = 0;\n     for($y = 0; $y < count($e); $y++)\n     {\n          $h = floor($e[$y] / $x);\n          $g += $h;\n          if($g >= $x)\n          {\n               $f = max($f, $g);\n               break;\n          }\n     }\n}\nprint $f;\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\n$d = floor($b / $a);\n$e = array();\nfor($x = 0; $x < $b; $x++)\n{\n     $e[$c[$x]]++;\n}\nsort($e);\n$f = 0;\nfor($x = $d; $x >= 1; $x--)\n{\n     $g = 0;\n     for($y = 0; $y < count($e); $y++)\n     {\n          $h = floor($e[$y] / $x);\n          $g += $h;\n          if($g >= $x)\n          {\n               $f = max($f, $x);\n               break;\n          }\n     }\n}\nprint $f;\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\n$d = floor($b / $a);\n$e = array();\nfor($x = 0; $x < $b; $x++)\n{\n     $e[$c[$x]]++;\n}\nsort($e);\nfor($x = $d; $x >= 1; $x--)\n{\n     $f = 0;\n     $g = 0;\n     for($y = 0; $y < count($e); $y++)\n     {\n          $h = floor($e[$y] / $x);\n          $g += $h;\n          if($g >= $x)\n          {\n               $f = 1;\n               $h = max($h, $g);\n          }\n     }\n}\nif($f == 0)\n{\n     print \"0\";\n}\nelse\n{\n     print $h;\n}\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\n$d = floor($b / $a);\n$e = array();\nfor($x = 0; $x < $b; $x++)\n{\n     $e[$c[$x]]++;\n}\nsort($e);\n$f = 0;\nfor($x = $d; $x >= 1; $x--)\n{\n     $g = 0;\n     for($y = 0; $y < count($e); $y++)\n     {\n          $h = floor($e[$y] / $x);\n          $g += $h;\n          if($g >= 1)\n          {\n               $f = max($f, $x);\n               break;\n          }\n     }\n}\nprint $f;\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\n$d = floor($b / $a);\n$e = array();\nfor($x = 0; $x < $b; $x++)\n{\n     $e[$c[$x]]++;\n}\nsort($e);\nfor($x = $d; $x >= 1; $x--)\n{\n     $f = 0;\n     $g = 0;\n     for($y = 0; $y < count($e); $y++)\n     {\n          $h = floor($e[$y] / $x);\n          $g += $h;\n          if($g >= $x)\n          {\n               $f = 1;\n               break;\n          }\n     }\n     if($f == 1)\n     {\n          break;\n     }\n}\nif($f == 0)\n{\n     print \"0\";\n}\nelse\n{\n     print $x;\n}\n?>"}], "src_uid": "b7ef696a11ff96f2e9c31becc2ff50fe"}
{"nl": {"description": "Polycarpus has got n candies and m friends (n\u2009\u2265\u2009m). He wants to make a New Year present with candies to each friend. Polycarpus is planning to present all candies and he wants to do this in the fairest (that is, most equal) manner. He wants to choose such ai, where ai is the number of candies in the i-th friend's present, that the maximum ai differs from the least ai as little as possible.For example, if n is divisible by m, then he is going to present the same number of candies to all his friends, that is, the maximum ai won't differ from the minimum one.", "input_spec": "The single line of the input contains a pair of space-separated positive integers n, m (1\u2009\u2264\u2009n,\u2009m\u2009\u2264\u2009100;n\u2009\u2265\u2009m) \u2014 the number of candies and the number of Polycarpus's friends.", "output_spec": "Print the required sequence a1,\u2009a2,\u2009...,\u2009am, where ai is the number of candies in the i-th friend's present. All numbers ai must be positive integers, total up to n, the maximum one should differ from the minimum one by the smallest possible value.", "sample_inputs": ["12 3", "15 4", "18 7"], "sample_outputs": ["4 4 4", "3 4 4 4", "2 2 2 3 3 3 3"], "notes": "NotePrint ai in any order, separate the numbers by spaces."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = $a / $b;\n$d = floor($c);\n$e = ceil($c);\nif(($a % $b) == 0)\n{\n    for($x = 1; $x < $b; $x++)\n    {\n        print $c . \" \";\n    }\n    print $c;\n}\nelse\n{\n    $f = 0;\n    $g = $b;\n    $h = 0;\n    for($x = 1; $x < $b; $x++)\n    {\n        $f += 1;\n        for($y = $b - $f; $y >= 1; $y--)\n        {\n            $g -= $x;\n            if(((($f * $d) + ($g * $e)) == $a) && (($f + $g) == $b))\n            {\n                $h = 1;\n                break;\n            }\n        }\n        if($h == 1)\n        {\n            break;\n        }\n        $g = $b;\n    }\n    for($x = 1; $x <= $f; $x++)\n    {\n        print $d . \" \";\n    }\n    for($x = 1; $x < $g; $x++)\n    {\n        print $e . \" \";\n    }\n    print $e;\n}\n?>"}, {"source_code": "#!/usr/bin/php\n<?php\n\n$s = fopen(\"php://stdin\", 'r');\n$n = fgets($s);\n$dum = explode(\" \" , $n);\n$candiesNum = $dum[0];\n$friendsNum = $dum[1];\n\n$division = intval($candiesNum / $friendsNum);\n$difference = $candiesNum % $friendsNum;\n$result = NULL;\nfor($n = 0; $n < $friendsNum - $difference; $n++)\n{\n     $result .= $division . ' ';\n}\nfor($n = 0; $n < $difference; $n++)\n{\n     $result .= $division+1 . ' ';\n}\necho substr($result , 0 , -1);"}], "negative_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = $a / $b;\n$d = floor($c);\n$e = ceil($c);\nif(($a % $b) == 0)\n{\n    for($x = 1; $x < $b; $x++)\n    {\n        print $c . \" \";\n    }\n    print $c;\n}\nelse\n{\n    $f = 0;\n    $g = $b;\n    $h = 0;\n    for($x = 1; $x < $b; $x++)\n    {\n        $f += $x;\n        for($y = $b; $y >= 1; $y--)\n        {\n            $g -= $x;\n            if((($f * $d) + ($g * $e)) == $a)\n            {\n                $h = 1;\n                break;\n            }\n        }\n        if($h == 1)\n        {\n            break;\n        }\n        $g = $b - $f;\n    }\n    for($x = 1; $x <= $f; $x++)\n    {\n        print $d . \" \";\n    }\n    for($x = 1; $x < $g; $x++)\n    {\n        print $e . \" \";\n    }\n    print $e;\n}\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = $a / $b;\n$d = floor($c);\n$e = ceil($c);\nif(($a % $b) == 0)\n{\n    for($x = 1; $x < $b; $x++)\n    {\n        print $c . \" \";\n    }\n    print $c;\n}\nelse\n{\n    $f = 0;\n    $g = $b;\n    $h = 0;\n    for($x = 1; $x < $b; $x++)\n    {\n        $f += $x;\n        for($y = $b; $y >= 1; $y--)\n        {\n            $g -= $x;\n            if(((($f * $d) + ($g * $e)) == $a) && (($f + $g) == $b))\n            {\n                $h = 1;\n                break;\n            }\n        }\n        if($h == 1)\n        {\n            break;\n        }\n        $g = $b - $f;\n    }\n    for($x = 1; $x <= $f; $x++)\n    {\n        print $d . \" \";\n    }\n    for($x = 1; $x < $g; $x++)\n    {\n        print $e . \" \";\n    }\n    print $e;\n}\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = floor($a / $b);\n$d = ceil($a / $b);\n$e = array();\n$i = array();\nif(($a % $b) == 0)\n{\n    for($x = 1; $x <= $b; $x++)\n    {\n        array_push($e, $a / $b);\n    }\n    print implode(\" \", $e);\n}\nelse\n{\n    $f = $a;\n    $f -= $c;\n    for($x = 1; $x <= $d; $x++)\n    {\n        if(($f % $d) == 0)\n        {\n            $g = $x;\n            $h = floor($f / $d);\n            break;\n        }\n        else\n        {\n            $f -= $c;\n        }\n    }\n    for($x = 1; $x <= $g; $x++)\n    {\n        array_push($i, $c);\n    }\n    for($x = 1; $x <= $h; $x++)\n    {\n        array_push($i, $d);\n    }\n    print implode(\" \", $i);\n}\n?>"}, {"source_code": "#!/usr/bin/php\n<?php\n\n$candiesNum = $argv[1];\n$friendsNum = $argv[2];\n\n$division = intval($candiesNum / $friendsNum);\n$difference = $candiesNum % $friendsNum;\n$result = NULL;\nfor($n = 0; $n < $friendsNum - $difference; $n++)\n{\n     $result .= $division . ' ';\n}\nfor($n = 0; $n < $difference; $n++)\n{\n     $result .= $division+1 . ' ';\n}\necho substr($result , 0 , -1);"}, {"source_code": "<?php\n\n$candiesNum = $argv[1];\n$friendsNum = $argv[2];\n\n$division = intval($candiesNum / $friendsNum);\n$difference = $candiesNum % $friendsNum;\n$result = NULL;\nfor($n = 0; $n < $friendsNum - $difference; $n++)\n{\n     $result .= $division . ' ';\n}\nfor($n = 0; $n < $difference; $n++)\n{\n     $result .= $division+1 . ' ';\n}\necho substr($result , 0 , -1);"}], "src_uid": "0b2c1650979a9931e00ffe32a70e3c23"}
{"nl": {"description": "Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is sold for k burles. Assume that there is an unlimited number of such shovels in the shop.In his pocket Polycarp has an unlimited number of \"10-burle coins\" and exactly one coin of r burles (1\u2009\u2264\u2009r\u2009\u2264\u20099).What is the minimum number of shovels Polycarp has to buy so that he can pay for the purchase without any change? It is obvious that he can pay for 10 shovels without any change (by paying the requied amount of 10-burle coins and not using the coin of r burles). But perhaps he can buy fewer shovels and pay without any change. Note that Polycarp should buy at least one shovel.", "input_spec": "The single line of input contains two integers k and r (1\u2009\u2264\u2009k\u2009\u2264\u20091000, 1\u2009\u2264\u2009r\u2009\u2264\u20099)\u00a0\u2014 the price of one shovel and the denomination of the coin in Polycarp's pocket that is different from \"10-burle coins\".  Remember that he has an unlimited number of coins in the denomination of 10, that is, Polycarp has enough money to buy any number of shovels.", "output_spec": "Print the required minimum number of shovels Polycarp has to buy so that he can pay for them without any change. ", "sample_inputs": ["117 3", "237 7", "15 2"], "sample_outputs": ["9", "1", "2"], "notes": "NoteIn the first example Polycarp can buy 9 shovels and pay 9\u00b7117\u2009=\u20091053 burles. Indeed, he can pay this sum by using 10-burle coins and one 3-burle coin. He can't buy fewer shovels without any change.In the second example it is enough for Polycarp to buy one shovel.In the third example Polycarp should buy two shovels and pay 2\u00b715\u2009=\u200930 burles. It is obvious that he can pay this sum without any change. "}, "positive_code": [{"source_code": "<?php\n$s = explode(\" \", trim(fgets(STDIN)));\n$k = $s[0];\n$r = $s[1];\nfor ($i = 1; ; $i++) {\n    $q = $k * $i;\n    $m = $q % 10;\n    if (($m == $r) or ($m == 0)) {\n        break;\n    }\n}\nprint $i;\n?>\n\n\n"}, {"source_code": "<?php\n\n###### IO ######\nerror_reporting(E_ALL);\nerror_reporting(0);\n\nfunction readString($f) {\n\t$r = array(\n\t\t\"\\r\" => '',\n\t\t\"\\n\" => '',\n\t);\n\treturn strtr(fgets($f), $r);\n}\n\nfunction readNumString($f) {\n\treturn trim(fgets($f));\n}\n\nfunction stringToArray($str) {\n\treturn str_split($str);\n}\n\nfunction readNum($f, $is_int = false) {\n\t$v = readNumString($f);\n\treturn $is_int ? intval($v) : floatval($v);\n}\n\nfunction readStringExplode($f, $delimiter = ' ') {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = 'trim';\n\treturn array_map($callf, $return);\n}\n\nfunction readStringExplodeNum($f, $delimiter = ' ', $is_int = false) {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = $is_int ? 'intval' : 'floatval';\n\treturn array_map($callf, $return);\n}\n\n###### /IO ######\n\nfunction getAnswer($is_test = false, $f = false) {\n\tif ($is_test)\n\t\t$stream = $f;\n\telse\n\t\t$stream = STDIN;\n\t/* begin body */\n\tlist($price, $r) = readStringExplodeNum($stream, ' ', true);\n\tfor ($i = 1; $i <= 10; $i++) {\n\t\t$amount = $i * $price;\n\t\t\n\t\tif ($amount % 10 == $r || $amount % 10 == 0) {\n\t\t\techo $i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t/* / end body */\n}\n\nif (empty($is_test))\n\tgetAnswer();"}, {"source_code": "<?php\nlist($oneshovel, $coin)=explode(\" \", trim(fgets(STDIN)));\n$x=1;\nwhile (TRUE) {\n     \n     if (($oneshovel * $x) % 10 == 0 or (($oneshovel * $x) - $coin) % 10 == 0) {\n          \n          break;\n     }else $x++;\n     \n}\necho $x;\n?>"}, {"source_code": "<?php\n\ndefine('STDIN',fopen(\"php://stdin\",\"r\"));\n\n$a = 0;\n$b = 0;\n\nfscanf(STDIN, \"%d %d\", $a, $b); \n\n$i = 1;\n\nif($a%10==0 || ($a-$b)%10 ==0) {\n    $i=1;\n} else {\n    while(($a*$i)%10!=0 && ($a*$i-$b)%10!=0) {\n         $i++;\n    }\n}\n\necho $i;"}, {"source_code": "<?php\n\n$stdout = fopen(getenv(\"OUTPUT_PATH\"), \"w\");\n$stdin = fopen(\"php://stdin\", \"r\");\n\nfscanf($stdin, \"%d %d\", $k , $r ) ;\n\n$count = 1 ;\n$temp = $k ;\n\nwhile( true )\n{\n     if( $k % 10 == 0 )\n     {\n          break ;\n     }\n     if( $k % 10 == $r )\n     {\n          break ;\n     }\n     $count++ ; \n     $k = $count * $temp ;\n}\necho $count ;\n\nfwrite($stdout);\n\nfclose($stdin);\nfclose($stdout);\n\n?>"}, {"source_code": "<?php\n\t$fi=fopen('test.inp',\"r\");\n\t$a=fgets(STDIN);\n\t$b=explode(\" \",$a);\n\t$k=$b[0];\n\t$r=$b[1];\n\t$i=0;\n\tdo{\n\t\t$i++;\n\t}while (($k*$i)%10!=0 and ($k*$i)%10!=$r);\n\techo $i;\n?>"}, {"source_code": "<?php\n\n$stdin = fopen('php://stdin', 'r');\n$string = explode(\" \", trim(fgets($stdin)));\n$value = $string[0];\n$coin = $string[1];\n$count = 1;\n$summ = $value;\nwhile ($summ % 10 != 0 && $summ % 10 != $coin) {\n    $summ = $summ + $value;\n    $count++;\n}\nprintf('%.0f', $count);\n"}, {"source_code": "<?php\n\tfscanf(STDIN, \"%d%d\", $k, $r);\n\tfor($i=1;;$i++)\n\t\tif($i*$k % 10 == 0 || (($i*$k)-$r) % 10 == 0)\n\t\t{\n\t\t\techo $i;\n\t\t\tbreak;\n\t\t}\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = 0;\n$d = 0;\n$e = 1;\nwhile(TRUE)\n{\n     $f = ($d + $b) % $a;\n     if($f == 0)\n     {\n          $c = ($d + $b) / $a;\n          break;\n     }\n     elseif($e == 0)\n     {\n          $c = $d / $a;\n          break;\n     }\n     else\n     {\n          $d += 10;\n     }\n     $e = $d % $a;\n}\nprint $c;\n?>"}, {"source_code": "<?php\n$data = fgets(STDIN);\n//$gestor = @fopen(\"data.in\", \"r\");\n//$data = fgets($gestor);\n$data = explode(\" \", $data);\n$n = $data[0];\n$k = $data[1];\n$c = 1;\n$flag = true;\nwhile ($flag) {\n    $aux = ($n * $c);\n    if ($aux % 10 == 0 || ($aux - $k) % 10 == 0) {\n        echo $c;\n        $flag = false;\n    }\n    $c++;\n}\n?>"}, {"source_code": "<?php\nfunction shovel(int $cost, int $coin): int\n{\n    for ($i = 1; $i < 10; $i++) {\n        $result = (int)((string)($cost * $i))[-1];\n        if ($result === 0 || $result === $coin) {\n            break;\n        }\n    }\n    return $i;\n}\n[$cost, $coin] = explode(' ', file_get_contents('php://stdin'));\necho shovel($cost, $coin);\n"}, {"source_code": "<?php\n$stdin = fopen(\"php://stdin\", 'r');\nfscanf($stdin, \"%d%d\", $k, $r);\nfor ($i = 1; $i <= 10; ++$i)\n{\n    $cost = $i * $k;\n    if ($cost % 10 == 0 || $cost % 10 == $r)\n    {\n        echo $i;\n        break;\n    }\n}\n\n?>"}, {"source_code": "<?php\n\n//=====================================\n// link: https://codeforces.com/contest/732/problem/A\n//=====================================\n\n// get inputs\nlist($price, $coin) = explode(' ', trim(fgets(STDIN)));\n\n// solution\n$buy = 0;\n$res = -1;\n\n// 1053\nwhile ($res % 10 != 0 && $res % 10 != $coin) {\n    $res = $price * ++$buy;\n}\n\necho \"$buy\\n\";\n"}, {"source_code": "<?php\nfunction read(){\n\treturn file_get_contents('php://stdin');\n}\nfunction put($data){\n\t$f = fopen('php://stdout' , \"w\");\n\tfwrite($f, $data);\n\tfclose($f);\n}\nfunction dividable($n){\n\t$s = (string) $n;\n\tif(substr($s, strlen($s)-1) == \"0\") return true;\n\treturn false;\n}\nfunction calculate_min($k, $n){\n\t$allow = true;\n\t$c = 0;\n\t$num = $k-$n;\n\tif(dividable($num)) return \"1\";\n\tfor($i=0;$i<=10; $i++){\n\t\t$c++;\n\t\tif(dividable(($c)*$k - $n)) return $c;\n\t\tif(dividable(($c)*$k)) return $c;\n\t}\n\treturn \"undefined\";\n}\n$read = read();\n\nlist($k, $n) = explode(\" \", $read);\nput(calculate_min($k, $n));\n?>"}], "negative_code": [{"source_code": "<?php\nfunction read(){\n\treturn file_get_contents('php://stdin');\n}\nfunction put($data){\n\t$f = fopen('php://stdout' , \"w\");\n\tfwrite( $handle, $data );\n\tfclose( $handle );\n}\n\nfunction calculate_min($k, $n){\n\t$allow = true;\n\t$c = 1;\n\t$s = $k;\n\t$coin = $n;\n\twhile($allow){\n\t\tif(($s-$n)%10 == 0){\n\t\t\t$allow = false;\n\t\t\tbreak;\n\t\t}\n\t\t$s += $k;\n\t\t$c++;\n\t}\n\treturn $c;\n}\n$read = read();\n\nlist($k, $n) = explode(\" \", $read);\nput(calculate_min($k, $n));\n?>"}, {"source_code": "<?php\nfunction read(){\n\treturn file_get_contents('php://stdin');\n}\nfunction put($data){\n\t$f = fopen('php://stdout' , \"w\");\n\tfwrite($f, $data);\n\tfclose($f);\n}\nfunction dividable($n){\n\t$s = (string) $n;\n\tif(substr($s, strlen($s)-1) == \"0\" && strlen($s)>1) return true;\n\treturn false;\n}\nfunction calculate_min($k, $n){\n\t$allow = true;\n\t$c = 1;\n\t$num = $k-$n;\n\tif(dividable($num)) return $c;\n\tfor($i=0;$i<=10; $i++){\n\t\t$c++;\n\t\tif(dividable(($c-1)*$k - $n)) return $c-1;\n\t\tif(dividable(($c-1)*$k)) return $c-1;\n\t}\n\treturn \"undefined\";\n}\n$read = read();\n\nlist($k, $n) = explode(\" \", $read);\nput(calculate_min($k, $n));\n?>"}, {"source_code": "<?php\nfunction read(){\n\treturn file_get_contents('php://stdin');\n}\nfunction put($data){\n\t$f = fopen('php://stdout' , \"w\");\n\tfwrite($f, $data);\n\tfclose($f);\n}\nfunction dividable($n){\n\t$s = (string) $n;\n\tif(substr($n, strlen($n)-1) == \"0\" && strlen($n)>1) return true;\n\treturn false;\n}\nfunction calculate_min($k, $n){\n\t$allow = true;\n\t$c = 1;\n\t$num = $k-$n;\n\tif(dividable($num)) return $c;\n\tfor($i=0;$i<=10; $i++){\n\t\t$c++;\n\t\tif(dividable(($c-1)*$k)) return $c-1;\n\t\tif(dividable(($c-1)*$k - $n)) return $c-1;\n\t}\n\treturn \"undefined\";\n}\n$read = read();\n\nlist($k, $n) = explode(\" \", $read);\nput(calculate_min($k, $n));\n?>"}, {"source_code": "<?php\nfunction read(){\n\treturn file_get_contents('php://stdin');\n}\nfunction put($data){\n\t$f = fopen('php://stdout' , \"w\");\n\tfwrite($f, $data);\n\tfclose($f);\n}\nfunction dividable($n){\n\t$s = (string) $n;\n\tif(substr($n, strlen($n)-1) == \"0\" && strlen($n)>1) return true;\n\treturn false;\n}\nfunction calculate_min($k, $n){\n\t$allow = true;\n\t$c = 1;\n\t$num = $k-$n;\n\tif(dividable($num)) return $c;\n\tfor($i=0;$i<=10; $i++){\n\t\t$c++;\n\t\tif(dividable(($c-1)*$k - $n)) return $c-1;\n\t\tif(dividable(($c-1)*$k)) return $c-1;\n\t}\n\treturn \"undefined\";\n}\n$read = read();\n\nlist($k, $n) = explode(\" \", $read);\nput(calculate_min($k, $n));\n?>"}, {"source_code": "<?php\nfunction read(){\n\treturn readfile('php://stdin');\n}\nfunction put($data){\n\tfile_put_contents('php://stdout', $data);\n}\n\nfunction calculate_min($k, $n){\n\t$allow = true;\n\t$c = 1;\n\t$s = $k;\n\t$coin = $n;\n\twhile($allow){\n\t\tif(($s-$n)%10 == 0){\n\t\t\t$allow = false;\n\t\t\tbreak;\n\t\t}\n\t\t$s += $k;\n\t\t$c++;\n\t}\n\techo $c;\n}\n$read = read();\n\nlist($k, $n) = explode(\" \", $read);\nput(calculate_min($k, $n));\n?>"}, {"source_code": "<?php\nfunction read(){\n\treturn file_get_contents('php://stdin');\n}\nfunction put($data){\n\t$f = fopen('php://stdout' , \"w\");\n\tfwrite($f, $data);\n\tfclose($f);\n}\nfunction dividable($n){\n\t$s = (string) $n;\n\tif(substr($s, strlen($s)-1) == \"0\") return true;\n\treturn false;\n}\nfunction calculate_min($k, $n){\n\t$allow = true;\n\t$c = 0;\n\t$num = $k-$n;\n\tif(dividable($num)) return \"1\";\n\tfor($i=0;$i<=10; $i++){\n\t\t$c++;\n\t\tif(dividable(($c)*$k - $n)) return $c;\n\t\tif(dividable(($c)*$k)) return $c;\n\t}\n\treturn \"undefined\";\n}\necho(calculate_min(1, 1));\ndie();\n$read = read();\n\nlist($k, $n) = explode(\" \", $read);\nput(calculate_min($k, $n));\n?>"}], "src_uid": "18cd1cd809df4744bb7bcd7cad94e2d3"}
{"nl": {"description": "There are n cities in Bearland, numbered 1 through n. Cities are arranged in one long row. The distance between cities i and j is equal to |i\u2009-\u2009j|.Limak is a police officer. He lives in a city a. His job is to catch criminals. It's hard because he doesn't know in which cities criminals are. Though, he knows that there is at most one criminal in each city.Limak is going to use a BCD (Bear Criminal Detector). The BCD will tell Limak how many criminals there are for every distance from a city a. After that, Limak can catch a criminal in each city for which he is sure that there must be a criminal.You know in which cities criminals are. Count the number of criminals Limak will catch, after he uses the BCD.", "input_spec": "The first line of the input contains two integers n and a (1\u2009\u2264\u2009a\u2009\u2264\u2009n\u2009\u2264\u2009100)\u00a0\u2014 the number of cities and the index of city where Limak lives. The second line contains n integers t1,\u2009t2,\u2009...,\u2009tn (0\u2009\u2264\u2009ti\u2009\u2264\u20091). There are ti criminals in the i-th city.", "output_spec": "Print the number of criminals Limak will catch.", "sample_inputs": ["6 3\n1 1 1 0 1 0", "5 2\n0 0 0 1 0"], "sample_outputs": ["3", "1"], "notes": "NoteIn the first sample, there are six cities and Limak lives in the third one (blue arrow below). Criminals are in cities marked red.  Using the BCD gives Limak the following information:  There is one criminal at distance 0 from the third city\u00a0\u2014 Limak is sure that this criminal is exactly in the third city.  There is one criminal at distance 1 from the third city\u00a0\u2014 Limak doesn't know if a criminal is in the second or fourth city.  There are two criminals at distance 2 from the third city\u00a0\u2014 Limak is sure that there is one criminal in the first city and one in the fifth city.  There are zero criminals for every greater distance. So, Limak will catch criminals in cities 1, 3 and 5, that is 3 criminals in total.In the second sample (drawing below), the BCD gives Limak the information that there is one criminal at distance 2 from Limak's city. There is only one city at distance 2 so Limak is sure where a criminal is.  "}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\nfor($x = 1; $x <= $a; $x++)\n{\n     if($x == $b)\n     {\n          break;\n     }\n}\n$d = $x - 1;\n$e = 0;\nfor($x = $a; $x >= 1; $x--)\n{\n     if($x == $b)\n     {\n          break;\n     }\n     else\n     {\n          $e++;\n     }\n}\nif($d < $e)\n{\n     $f = $e - $d;\n     $b += $f;\n     for($x = 1; $x <= $f; $x++)\n     {\n          array_unshift($c, 2);\n     }\n}\nelseif($d > $e)\n{\n     $f = $d - $e;\n     for($x = 1; $x <= $f; $x++)\n     {\n          array_push($c, 2);\n     }\n}\n$g = 0;\n$h = $b - 2;\n$i = $b;\nfor($x = $b - 1; $x >= 0; $x--)\n{\n     if($x == ($b - 1))\n     {\n          if($c[$x] == 1)\n          {\n               $g++;\n          }\n     }\n     else\n     {\n          if(($c[$h] == 1) && ($c[$i] == 1))\n          {\n               $g += 2;\n          }\n          elseif(($c[$h] == 1) && ($c[$i] == 2))\n          {\n               $g++;\n          }\n          elseif(($c[$h] == 2) && ($c[$i] == 1))\n          {\n               $g++;\n          }\n          $h--;\n          $i++;\n     }\n}\nprint $g;\n?>"}, {"source_code": "<?\n\n$stdin = fopen('php://stdin', 'r');\n$s =  trim(fgets($stdin));\n$cards = explode(\" \",$s);\n$cities_cnt=$cards[0];\n$limak_city=$cards[1]-1;\n$s =  trim(fgets($stdin));\n$crims = explode(\" \",$s);\n$catched=0;\nif($limak_city>($cities_cnt/2)){\nfor ($i=0;$i<($limak_city);$i++){\n\t\n\t$r = abs($limak_city-$i);\n\t//echo $r;\n\tif(($cities_cnt-($limak_city+$r)<=0)||(($limak_city-$r)<0)){\n\t   // echo \"!\".$crims[$limak_city-$r].\"!\\n\";\n\t\tif(((int)$crims[$limak_city+$r])>0||((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=1;\n\t\t}\n\t}else{\n\t   // echo \"+\".($limak_city+$r);\n\t\tif(((int)$crims[$limak_city+$r])>0&&((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=2;\n\t\t}\n\t\t\n\t\t\n\t}\n\t//echo $catched.\" \";\n}\n}else{\n\tfor ($i=$cities_cnt;$i>($limak_city);$i--){\n\n\t$r = abs($limak_city-$i);\n//\techo $r;\n\tif(($cities_cnt-($limak_city+$r)<=0)||(($limak_city-$r)<0)){\n\t\tif(((int)$crims[$limak_city+$r])>0||((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=1;\n\t\t\t\n\t\t}\n\t}else{\n\t\tif(((int)$crims[$limak_city+$r])>0&&((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=2;\n\t\t}\n\t\t\n\t\t\n\t}\n//\techo $catched.\" \";\n}\n\t\n}\nif($crims[$limak_city]>0){\n\t$catched+=1;\n}\necho $catched;\n\n"}, {"source_code": "<?php\n      $t = array();\n      list($n, $id) = explode(' ', trim(fgets(STDIN)));\n      $t = explode(' ', trim(fgets(STDIN)));\n      $id --;\n      $id2 = $id;\n      $ans = 0;\n      while($id >= 0 && $id2 < $n)\n      {\n          if($t[$id] == $t[$id2] && $t[$id] != '0')\n          {\n            $ans ++;\n            if($id != $id2)\n                $ans ++;\n          }\n          $id --;\n          $id2 ++;\n      }\n      while($id >= 0) \n      {\n          $ans += $t[$id] == '1';\n          $id --;\n      }\n      while($id2 < $n) \n      {\n          $ans += $t[$id2] == '1';\n          $id2 ++;\n      }\n      echo $ans;\n?>\n"}], "negative_code": [{"source_code": "<?\n\n$stdin = fopen('php://stdin', 'r');\n$s =  trim(fgets($stdin));\n$cards = explode(\" \",$s);\n$cities_cnt=$cards[0];\n$limak_city=$cards[1]-1;\n$s =  trim(fgets($stdin));\n$crims = explode(\" \",$s);\n$catched=0;\nif($limak_city>($cities_cnt/2)){\nfor ($i=0;$i<($limak_city);$i++){\n\t\n\t$r = abs($limak_city-$i);\n\tif(($cities_cnt-($limak_city+$r)<0)||($cities_cnt>=($limak_city+$r))){\n\t\tif(((int)$crims[$limak_city+$r])>0||((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=1;\n\t\t}\n\t}else{\n\t\tif(((int)$crims[$limak_city+$r])>0&&((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=2;\n\t\t}\n\t\t\n\t\t\n\t}\n}\n}else{\n\tfor ($i=$cities_cnt;$i>($limak_city);$i--){\n\t\n\t$r = abs($limak_city-$i);\n\tif(($cities_cnt-($limak_city+$r)<0)||($cities_cnt>=($limak_city+$r))){\n\t\tif(((int)$crims[$limak_city+$r])>0||((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=1;\n\t\t}\n\t}else{\n\t\tif(((int)$crims[$limak_city+$r])>0&&((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=2;\n\t\t}\n\t\t\n\t\t\n\t}\n}\n\t\n}\nif($crims[$limak_city]>0){\n\t$catched+=1;\n}\necho $catched;\n\n"}, {"source_code": "<?\n\n$stdin = fopen('php://stdin', 'r');\n$s =  trim(fgets($stdin));\n$cards = explode(\" \",$s);\n$cities_cnt=$cards[0];\n$limak_city=$cards[1]-1;\n$s =  trim(fgets($stdin));\n$crims = explode(\" \",$s);\n$catched=0;\nif($limak_city>($cities_cnt/2)){\nfor ($i=0;$i<($limak_city);$i++){\n\t\n\t$r = abs($limak_city-$i);\n\tif(($cities_cnt-($limak_city+$r)<0)||($cities_cnt>=($limak_city+$r))){\n\t\tif(((int)$crims[$limak_city+$r])>0||((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=1;\n\t\t}\n\t}elseif($cities_cnt-($r+$r)>=0){\n\t\tif(((int)$crims[$limak_city+$r])>0&&((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=2;\n\t\t}\n\t\t\n\t\t\n\t}\n}\n}else{\n\tfor ($i=$cities_cnt;$i>($limak_city);$i--){\n\t\n\t$r = abs($limak_city-$i);\n\tif(($cities_cnt-($limak_city+$r)<0)||($cities_cnt>=($limak_city+$r))){\n\t\tif(((int)$crims[$limak_city+$r])>0||((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=1;\n\t\t}\n\t}else{\n\t\tif(((int)$crims[$limak_city+$r])>0&&((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=2;\n\t\t}\n\t\t\n\t\t\n\t}\n}\n\t\n}\nif($crims[$limak_city]>0){\n\t$catched+=1;\n}\necho $catched;\n\n"}, {"source_code": "<?\n\n$stdin = fopen('php://stdin', 'r');\n$s =  trim(fgets($stdin));\n$cards = explode(\" \",$s);\n$cities_cnt=$cards[0];\n$limak_city=$cards[1]-1;\n$s =  trim(fgets($stdin));\n$crims = explode(\" \",$s);\n$catched=0;\nif($limak_city>($cities_cnt/2)){\nfor ($i=0;$i<($limak_city);$i++){\n\t\n\t$r = abs($limak_city-$i);\n\tif(($cities_cnt-($limak_city+$r)<0)||($cities_cnt>($limak_city+$r))){\n\t\tif(((int)$crims[$limak_city+$r])>0||((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=1;\n\t\t}\n\t}elseif($cities_cnt-($r+$r)>=0){\n\t\tif(((int)$crims[$limak_city+$r])>0&&((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=2;\n\t\t}\n\t\t\n\t\t\n\t}\n}\n}else{\n\tfor ($i=$cities_cnt;$i>($limak_city);$i--){\n\t\n\t$r = abs($limak_city-$i);\n\tif(($cities_cnt-($limak_city+$r)<0)||($cities_cnt>($limak_city+$r))){\n\t\tif(((int)$crims[$limak_city+$r])>0||((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=1;\n\t\t}\n\t}else{\n\t\tif(((int)$crims[$limak_city+$r])>0&&((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=2;\n\t\t}\n\t\t\n\t\t\n\t}\n}\n\t\n}\nif($crims[$limak_city]>0){\n\t$catched+=1;\n}\necho $catched;\n\n"}, {"source_code": "<?\n\n$stdin = fopen('php://stdin', 'r');\n$s =  trim(fgets($stdin));\n$cards = explode(\" \",$s);\n$cities_cnt=$cards[0];\n$limak_city=$cards[1]-1;\n$s =  trim(fgets($stdin));\n$crims = explode(\" \",$s);\n$catched=0;\nif($limak_city>($cities_cnt/2)){\nfor ($i=0;$i<($limak_city);$i++){\n\t\n\t$r = abs($limak_city-$i);\n\tif(($cities_cnt-($limak_city+$r)<=0)||($cities_cnt>=($limak_city+$r))){\n\t\tif(((int)$crims[$limak_city+$r])>0||((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=1;\n\t\t}\n\t}else{\n\t\tif(((int)$crims[$limak_city+$r])>0&&((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=2;\n\t\t}\n\t\t\n\t\t\n\t}\n}\n}else{\n\tfor ($i=$cities_cnt;$i>($limak_city);$i--){\n\t\n\t$r = abs($limak_city-$i);\n\tif(($cities_cnt-($limak_city+$r)<=0)||($cities_cnt>=($limak_city+$r))){\n\t\tif(((int)$crims[$limak_city+$r])>0||((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=1;\n\t\t}\n\t}else{\n\t\tif(((int)$crims[$limak_city+$r])>0&&((int)$crims[$limak_city-$r])>0){\n\t\t\t$catched+=2;\n\t\t}\n\t\t\n\t\t\n\t}\n}\n\t\n}\nif($crims[$limak_city]>0){\n\t$catched+=1;\n}\necho $catched;\n\n"}], "src_uid": "4840d571d4ce6e1096bb678b6c100ae5"}
{"nl": {"description": "Kostya likes Codeforces contests very much. However, he is very disappointed that his solutions are frequently hacked. That's why he decided to obfuscate (intentionally make less readable) his code before upcoming contest.To obfuscate the code, Kostya first looks at the first variable name used in his program and replaces all its occurrences with a single symbol a, then he looks at the second variable name that has not been replaced yet, and replaces all its occurrences with b, and so on. Kostya is well-mannered, so he doesn't use any one-letter names before obfuscation. Moreover, there are at most 26 unique identifiers in his programs.You are given a list of identifiers of some program with removed spaces and line breaks. Check if this program can be a result of Kostya's obfuscation.", "input_spec": "In the only line of input there is a string S of lowercase English letters (1\u2009\u2264\u2009|S|\u2009\u2264\u2009500)\u00a0\u2014 the identifiers of a program with removed whitespace characters.", "output_spec": "If this program can be a result of Kostya's obfuscation, print \"YES\" (without quotes), otherwise print \"NO\".", "sample_inputs": ["abacaba", "jinotega"], "sample_outputs": ["YES", "NO"], "notes": "NoteIn the first sample case, one possible list of identifiers would be \"number string number character number string number\". Here how Kostya would obfuscate the program: replace all occurences of number with a, the result would be \"a string a character a string a\", replace all occurences of string with b, the result would be \"a b a character a b a\", replace all occurences of character with c, the result would be \"a b a c a b a\", all identifiers have been replaced, thus the obfuscation is finished."}, "positive_code": [{"source_code": "<?php\n$a = str_split(trim(fgets(STDIN)));\n$b = array_unique($a);\n$c = array_keys($b);\n$d = array();\nfor($x = 0; $x < count($b); $x++)\n{\n     $d[$x] = $b[$c[$x]];\n}\n$e = implode($d);\n$f = \"abcdefghijklmnopqrstuvwxyz\";\n$g = substr($f, 0, strlen($e));\nif($e == $g)\n{\n     print \"YES\";\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "#!/usr/bin/php\n<?php\n\n$string = trim(fgets(STDIN));\n$current = 0;\n\nfor ($i = 0; $i < strlen($string); $i++) {\n\tif (ord($string[$i]) <= ($current + ord('a') - 1)) {\n\n\t} else if (ord($string[$i]) == ($current + ord('a'))) {\n\t\t$current++;\n\t} else {\n\t\techo \"NO\";\n\t\texit();\n\t}\n}\n\necho \"YES\";\nexit();\n"}, {"source_code": "<?php\nerror_reporting(0);\n//////////////////////// Class For Read Input --- @laurenceHR [02/2012] ////////////////////////////////////////////////////////////\nclass stdIn{var $ntxt = 0;var $nline = 0;var $arr_txt;var $arr_line;var $linex;var $liney;\nfunction stdIn($local = false){if($local){$dir = fopen(\"input.txt\", 'r');}else{$dir = fopen(\"php://stdin\", 'r');}\n$datatxt = stream_get_contents($dir);$del = Array(\"\\n\",\"\\r\",\"\\n\\r\");$data = explode(\"\\n\",$datatxt);\t$il = 0;$id = 0;\nforeach($data as $line){if(strlen($line) > 0){$line = str_replace($del,'',$line);$dataex[] = $line;$text = explode(\" \",$line);\nforeach($text as $txt){$arr_txt[] = $txt;$this->linex[$id] = $il;$this->liney[$il] = $id;$id++;}}$il++;}$this->arr_line = $dataex;$this->arr_txt  = $arr_txt;}\nfunction G(){$ret = $this->arr_txt[$this->ntxt++];$this->nline = $this->linex[$this->ntxt];return $ret;}\nfunction GL(){$this->ntxt = $this->liney[$this->nline]+1;return $this->arr_line[$this->nline++];}} /*init*/ $dxs = new stdIn(false);\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n///////////////////////////////////// DECLARE FUNCTIONS ///////////////////////////////////////\n$s = $dxs->G();\n/////////////////////////////////// MAIN CODE /////////////////////////////////////////////////\n$now = -1;\n$yes = true;\nfor($i = ord(\"a\"); $i <= ord(\"z\"); $i++) {\n    $ret = strpos($s, chr($i));\n    $lat = $now;\n    if($ret === false) {\n        $now = 100000;\n    }\n    else {\n        $now = $ret;\n    }\n    if($now < $lat) {\n        $yes = false;\n    }\n}\nif($yes) {\n    echo \"YES\";\n}\nelse{\n    echo \"NO\";\n}\n/////////////////////////////////////////////////////////////////////////////////////////////////\n?>"}, {"source_code": "<?php\nerror_reporting(0);\n//////////////////////// Class For Read Input --- @laurenceHR [02/2012] ////////////////////////////////////////////////////////////\nclass stdIn{var $ntxt = 0;var $nline = 0;var $arr_txt;var $arr_line;var $linex;var $liney;\nfunction stdIn($local = false){if($local){$dir = fopen(\"input.txt\", 'r');}else{$dir = fopen(\"php://stdin\", 'r');}\n$datatxt = stream_get_contents($dir);$del = Array(\"\\n\",\"\\r\",\"\\n\\r\");$data = explode(\"\\n\",$datatxt);\t$il = 0;$id = 0;\nforeach($data as $line){if(strlen($line) > 0){$line = str_replace($del,'',$line);$dataex[] = $line;$text = explode(\" \",$line);\nforeach($text as $txt){$arr_txt[] = $txt;$this->linex[$id] = $il;$this->liney[$il] = $id;$id++;}}$il++;}$this->arr_line = $dataex;$this->arr_txt  = $arr_txt;}\nfunction G(){$ret = $this->arr_txt[$this->ntxt++];$this->nline = $this->linex[$this->ntxt];return $ret;}\nfunction GL(){$this->ntxt = $this->liney[$this->nline]+1;return $this->arr_line[$this->nline++];}} /*init*/ $dxs = new stdIn(false);\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n///////////////////////////////////// DECLARE FUNCTIONS ///////////////////////////////////////\n$s = $dxs->G();\n/////////////////////////////////// MAIN CODE /////////////////////////////////////////////////\n$now = -1;\n$yes = true;\nfor($i = ord(\"a\"); $i <= ord(\"z\"); $i++) {\n    $ret = strpos($s, chr($i));\n    $lat = $now;\n    if($ret === false) {\n        $now = 100000;\n    }\n    else {\n        $now = $ret;\n    }\n    if($now < $lat) {\n        $yes = false;\n    }\n}\nif($yes) {\n    echo \"YES\";\n}\nelse{\n    echo \"NO\";\n}\n/////////////////////////////////////////////////////////////////////////////////////////////////\n?>"}, {"source_code": "<?php\n\nerror_reporting(0);\n\nwhile($line = trim(fgets(STDIN))){\n\n$linhas[]=$line;\nif($a==1) break;\n$a++;\n}\n\n$alfabeto = array(\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\");\n\n$str=$linhas[0];\n\n$l=sizeof($alfabeto);\n\nfor($i=0;$i<$l;$i++) {\n\n$firstLetter = $alfabeto[$i];\n\nif($str[0]==$firstLetter) {\n\n\t$str = str_replace($firstLetter, \"\", $str);\n\t\n\n\tif(strlen($str) == 0) {\n\t\tdie(\"YES\");\t\t\n\t}\n\t\n\tcontinue;\n\n}\n\nelse die(\"NO\");\n\n}\n\n\n\n?>"}, {"source_code": "<?php\n    $word = trim(fgets(STDIN));\n    $arr = str_split($word);\n    $used = array();\n    \n    for($i=sizeof($arr)-1; $i>=0; $i--)\n    {\n        $flag = false;\n        if($arr[$i]!='a')\n        {\n            for($j=$i-1; $j>=0; $j--)\n            {\n                $buffer = $arr[$j];\n                ++$buffer;\n    \n                if( $arr[$i] == $buffer)\n                {\n                    $flag = true;\n                    break;\n                }\n            }\n            if(!$flag)\n            {\n                $ans = 'no';\n                break;\n            }\n        }\n    }\n    \n    echo ($ans == 'no') ? \"NO\\n\" : \"YES\\n\";\n?>\n"}], "negative_code": [{"source_code": "<?php\n$a = str_split(trim(fgets(STDIN)));\n$b = array_unique($a);\n$c = array_keys($b);\n$d = array();\nfor($x = 0; $x < count($b); $x++)\n{\n     $d[$x] = $b[$c[$x]];\n}\n$e = 0;\nfor($x = 0; $x < count($d) - 1; $x++)\n{\n     if($d[$x] > $d[$x + 1])\n     {\n          $e = 1;\n          break;\n     }\n}\nif($e == 0)\n{\n     print \"YES\";\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "#!/usr/bin/php\n<?php\n\n$string = trim(fgets(STDIN));\n$current = 0;\n\nfor ($i = 0; $i < strlen($string); $i++) {\n\tif (ord($string[$i]) <= ($current + ord('a'))) {\n\n\t} else if (ord($string[$i]) == ($current + ord('a') + 1)) {\n\t\t$current++;\n\t} else {\n\t\techo \"NO\";\n\t\texit();\n\t}\n}\n\necho \"YES\";\nexit();\n"}, {"source_code": "<?php\n\nerror_reporting(0);\n\nwhile($line = trim(fgets(STDIN))){\n\n$linhas[]=$line;\nif($a==2) break;\n$a++;\n}\n\n$n=$linhas[0];\n$home=$linhas[1];\n$i=1;\n\n\nwhile($i<$n) {\n\n\t$line2 = trim(fgets(STDIN));\t\n\t$i++;\n\n}\n\nif($n%2==0) {\n\necho \"home\";\n\n}\n\nelse echo \"contest\";\n\n?>"}], "src_uid": "c4551f66a781b174f95865fa254ca972"}
{"nl": {"description": "Let's write all the positive integer numbers one after another from $$$1$$$ without any delimiters (i.e. as a single string). It will be the infinite sequence starting with 123456789101112131415161718192021222324252627282930313233343536...Your task is to print the $$$k$$$-th digit of this sequence.", "input_spec": "The first and only line contains integer $$$k$$$ ($$$1 \\le k \\le 10000$$$) \u2014 the position to process ($$$1$$$-based index).", "output_spec": "Print the $$$k$$$-th digit of the resulting infinite sequence.", "sample_inputs": ["7", "21"], "sample_outputs": ["7", "5"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = \"1\";\n$c = 2;\nfor($x = 1; $x <= 10000; $x++)\n{\n     $b .= $c;\n     $c++;\n}\nprint $b[$a - 1];\n?>"}, {"source_code": "<?php\n# 1177a\nfor ($k = trim(fgets(STDIN)), $s = '', $l = 0, $i = 1; $l < $k; $s .= $i, $l += strlen($i), $i++) {} echo $s[$k - 1];\n"}, {"source_code": "<?php\n# 1177b\n$stdin = STDIN;\n\n$k = trim(fgets($stdin));\n$str = '';\n$length = 0;\nfor ($i = 1; $length <= $k; $i++) {\n    $str .= $i;\n    $length += strlen($i);\n}\necho $str[$k - 1];\n"}, {"source_code": "<?php\n\n$i = 0;\n$str = '0';\ndo {\n$i++;\n$str .= $i;\n} while(strlen($str) < 10000);\n\n$d = trim(file_get_contents('php://stdin'));\n\necho $str[$d];"}, {"source_code": "<?php\n# 1177b\n$k = trim(fgets(STDIN));\nif ($k < 10) {\n    echo $k;\n} else {\n    $powers =[0,0];\n    $powCount = $digitCount = 0.0;\n\n    for ($i = 0; $i < 12; $i++) {\n        $powCount += 10 ** $i * 9;\n        $digitCount += 10 ** $i * 9 * ($i + 1);\n        if ($digitCount > $k) {\n            break;\n        }\n        $powers = [$i+2, $powCount, $digitCount];\n    }\n\n    [$size, $powCount, $digitCount] = $powers;\n    $shift = floor(($k - $digitCount) / $size);\n    $shift_x = ceil(($k - $digitCount) / $size);\n    $key = sprintf('%.0f', $k - $digitCount - ($shift * $size + 1));\n    echo (sprintf('%.0f', $powCount + $shift_x))[$key];\n}\n"}], "negative_code": [{"source_code": "<?php\n\n$i = 0;\n$str = '';\ndo {\n$i++;\n$str .= $i;\n} while(strlen($str) < 10000);\n\n$d = trim(file_get_contents('php://stdin'));\n\necho $str[$d];"}, {"source_code": "$i = 0;\n$str = '';\ndo {\n$i++;\n$str .= $i;\nwhile(strlen($str) < 10000);\n\n$d = trim(file_get_contents('php://stdin'));\n\necho $str[$d];"}, {"source_code": "<?php\n# 1177b\n$k = trim(fgets(STDIN));\nif ($k < 10) {\n    echo $k;\n} else {\n    $powers =[0,0];\n    $powCount = $digitCount = 0;\n\n    for ($i = 0; $i < 12; $i++) {\n        $powCount += 10 ** $i * 9;\n        $digitCount += 10 ** $i * 9 * ($i + 1);\n        if ($digitCount > $k) {\n            break;\n        }\n        $powers = [$i+2, $powCount, $digitCount];\n    }\n\n    [$size, $powCount, $digitCount] = $powers;\n    $shift = (int)floor(($k - $digitCount) / $size);\n    $shift_x = (int)ceil(($k - $digitCount) / $size);\n    echo (sprintf('%.0f', $powCount + $shift_x))[$k - $digitCount - ($shift * $size + 1)];\n}\n"}, {"source_code": "<?php\n# 1177b\n\n$k = trim(fgets(STDIN));\nif ($k < 10) {\n    echo $k;\n} else {\n    $powers =[0,0];\n    $powCount = $digitCount = 0;\n\n    for ($i = 0; $i < 12; $i++) {\n        $powCount += 10 ** $i * 9;\n        $digitCount += 10 ** $i * 9 * ($i + 1);\n        if ($digitCount > $k) {\n            break;\n        }\n        $powers = [$i+2, $powCount, $digitCount];\n    }\n\n    [$size, $powCount, $digitCount] = $powers;\n    $shift = (int)floor(($k - $digitCount) / $size);\n    $shift_x = (int)ceil(($k - $digitCount) / $size);\n    echo ((string)($powCount + $shift_x))[$k - $digitCount - ($shift * $size + 1)];\n}\n"}, {"source_code": "<?php\n# 1177b\n$k = trim(fgets(STDIN));\n$powers =[0,0];\n$powCount = $digitCount = 0;\n\nfor ($i = 0; $i < 12; $i++) {\n    $powCount += 10 ** $i * 9;\n    $digitCount += 10 ** $i * 9 * ($i + 1);\n    if ($digitCount > $k) {\n        break;\n    }\n    $powers = [$i+2, $powCount, $digitCount];\n}\n\n[$size, $powCount, $digitCount] = $powers;\n$shift = (int)floor(($k - $digitCount) / $size);\n$shift_x = (int)ceil(($k - $digitCount) / $size);\necho ((string)($powCount + $shift_x))[$k - $digitCount - ($shift * $size + 1)];\n"}], "src_uid": "1503d761dd4e129fb7c423da390544ff"}
{"nl": {"description": "Yakko, Wakko and Dot, world-famous animaniacs, decided to rest from acting in cartoons, and take a leave to travel a bit. Yakko dreamt to go to Pennsylvania, his Motherland and the Motherland of his ancestors. Wakko thought about Tasmania, its beaches, sun and sea. Dot chose Transylvania as the most mysterious and unpredictable place.But to their great regret, the leave turned to be very short, so it will be enough to visit one of the three above named places. That's why Yakko, as the cleverest, came up with a truly genius idea: let each of the three roll an ordinary six-sided die, and the one with the highest amount of points will be the winner, and will take the other two to the place of his/her dreams.Yakko thrown a die and got Y points, Wakko \u2014 W points. It was Dot's turn. But she didn't hurry. Dot wanted to know for sure what were her chances to visit Transylvania.It is known that Yakko and Wakko are true gentlemen, that's why if they have the same amount of points with Dot, they will let Dot win.", "input_spec": "The only line of the input file contains two natural numbers Y and W \u2014 the results of Yakko's and Wakko's die rolls.", "output_spec": "Output the required probability in the form of irreducible fraction in format \u00abA/B\u00bb, where A \u2014 the numerator, and B \u2014 the denominator. If the required probability equals to zero, output \u00ab0/1\u00bb. If the required probability equals to 1, output \u00ab1/1\u00bb. ", "sample_inputs": ["4 2"], "sample_outputs": ["1/2"], "notes": "NoteDot will go to Transylvania, if she is lucky to roll 4, 5 or 6 points."}, "positive_code": [{"source_code": "<?php\nlist($y, $w) = explode(\" \", fgets(STDIN));\n$a = min(6 - $y, 6 - $w) + 1;\nif($a == 1) { print \"1/6\"; }\nif($a == 2) { print \"1/3\"; }\nif($a == 3) { print \"1/2\"; }\nif($a == 4) { print \"2/3\"; }\nif($a == 5) { print \"5/6\"; }\nif($a == 6) { print \"1/1\"; }\n?>"}, {"source_code": "<?php\n    fscanf(STDIN,\"%u %u\",$a,$b);\n    $m=7-max($a,$b);\n    $d=($m%3 ? 1:3)*($m%2 ? 1:2);\n    echo ($m/$d).'/'.(6/$d);\n?>"}, {"source_code": "<?fscanf(STDIN,'%u%u',$w,$d);$w=7-max($w,$d);$d=($w%3?1:3)*(2-$w%2);echo$w/$d.'/'. 6/$d;"}, {"source_code": "<?php\n$fh=trim(fgets(STDIN));\nlist($y,$w)=explode(\" \",$fh);\nfunction fmax($a, $b){\n\tif ($a > $b)return $a;\n    else return $b;\n}\t\n\nfunction gcd($a,$b) {\n\tif ($b == 0)\n\t\treturn $a;\n\treturn gcd($b, $a % $b);\n}\n$r=6-fmax($y,$w)+1;\n$g=gcd($r,6);\n$a1=$r/$g;\n$a2=6/$g;\necho(${a1}.\"/\".${a2});\n?>"}, {"source_code": "<?php\n\n//=====================================\n// link: http://codeforces.com/contest/9/problem/A\n//=====================================\n\n// get inputs\nlist($yakko, $wakko) = explode(' ', trim(fgets(STDIN)));\n\n// solution\n// low: 6 - (max - 1) / 6\n$probabilities = ['1/1', '5/6', '2/3', '1/2', '1/3', '1/6'];\n\n$index = max($yakko, $wakko) - 1;\n\necho $probabilities[$index] . \"\\n\";\n"}, {"source_code": "<?php\n$line=trim(fgets(STDIN));\n$eyes=explode(\" \",$line);\n$max=0;\nfor($i=0;$i<2;$i+=1){\n   if($max < 0+$eyes[$i]){\n     $max=0+$eyes[$i];\n   }\n}\n$amari=6-$max+1;\n$max=6;\n$sosu=array(2,3);\nfor($i=0;$i<2;$i+=1){\n   if($amari % $sosu[$i] == 0){\n     $amari=$amari/$sosu[$i];\n     $max=$max/$sosu[$i];\n   }\n}\nprint($amari.\"/\".$max);\n?>\n\n\n"}, {"source_code": "<?php\n$s = fgets(STDIN);\nlist($a, $b) = explode(\" \", $s);\n$j=max($a,$b);\nif ($j==1) {print (\"1/1\");};\nif ($j==2) {print (\"5/6\");};\nif ($j==6) {print (\"1/6\");};\nif ($j>1) {$j=7-$j; \nif(($j%2)==0) { print (($j/2).\"/\".\"3\");};\nif(($j%3)==0) { print (($j/3).\"/\".\"2\");};}\n?>"}, {"source_code": "<?php\n\n###### IO ######\nerror_reporting(E_ALL);\n#error_reporting(0);\n\nfunction readString($f) {\n\t$r = array(\n\t\t\"\\r\" => '',\n\t\t\"\\n\" => '',\n\t);\n\treturn strtr(fgets($f), $r);\n}\n\nfunction readNumString($f) {\n\treturn trim(fgets($f));\n}\n\nfunction stringToArray($str) {\n\treturn str_split($str);\n}\n\nfunction readNum($f, $is_int = false) {\n\t$v = readNumString($f);\n\treturn $is_int ? intval($v) : floatval($v);\n}\n\nfunction readStringExplode($f, $delimiter = ' ') {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = 'trim';\n\treturn array_map($callf, $return);\n}\n\nfunction readStringExplodeNum($f, $delimiter = ' ', $is_int = false) {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = $is_int ? 'intval' : 'floatval';\n\treturn array_map($callf, $return);\n}\n\n###### /IO ######\n\nfunction nod($a, $b) {\n\twhile ($a <> 0 && $b <> 0) {\n\t\tif ($a > $b)\n\t\t\t$a = $a % $b;\n\t\telse\n\t\t\t$b = $b % $a;\n\t\t$nod = $a + $b;\n\t}\n\treturn $nod;\n}\n\nfunction getAnswer($is_test = false, $f = false) {\n\tif ($is_test === false) {\n\t\t$f = STDIN;\n\t}\n\t/* begin body */\n\tlist($n1, $n2) = readStringExplodeNum($f, ' ', true);\n\n\t$goodCnt = 6 - max($n1, $n2) + 1;\n\t$nod = nod($goodCnt, 6);\n\t$base = 6;\n\t$goodCnt/=$nod;\n\t$base/=$nod;\n\n\techo \"{$goodCnt}/{$base}\";\n\t/* / end body */\n}\n\nif (empty($is_test))\n\tgetAnswer();"}, {"source_code": "<?php\n\t$fr = fopen(\"php://stdin\",\"r\");\n\t$input = fgets($fr);\n\tlist( $y, $w ) = explode(' ', $input);\n\tfclose ($fr);\n\n\t$dice = 6;\n\t$r = min( $dice-$y, $dice-$w ) + 1;\n\tif ( $r == 0 )\n\t\tdie('0/1');\n\tforeach ( array(2,3,5) as $d )\n\t{\n\t\twhile ( (($r % $d) == 0) && (($dice % $d) == 0) )\n\t\t{\n\t\t\t$r /= $d;\n\t\t\t$dice /= $d;\n\t\t}\n\t}\n\techo $r.'/'.$dice;\n?>"}, {"source_code": "<?php\n\nfunction debug($data, $die = true) {\n    echo '<pre>';\n\n    if (is_array($data)) {\n        print_r($data);\n    } else {\n        var_dump($data);\n    }\n\n    if ($die) {\n        die();\n    }\n\n    echo '</pre>';\n}\n\n$stdin = @fopen('data.txt', 'r');\nif (!$stdin) {\n    $stdin = fopen('php://stdin', 'r');\n}\n\nfunction g() {\n    global $stdin;\n    return trim(fgets($stdin));\n}\n\n/****************************************************** Solving block *****************************************************/\nlist($a, $b) = explode(' ', g());\n$max = $a > $b ? $a : $b;\n$max--;\n$points = 6 - $max;\n\nswitch($points) {\n    case 0: echo '0/1'; break;\n    case 1: echo '1/6'; break;\n    case 2: echo '1/3'; break;\n    case 3: echo '1/2'; break;\n    case 4: echo '2/3'; break;\n    case 5: echo '5/6'; break;\n    case 6: echo '1/1'; break;\n}\n\n?>"}, {"source_code": "<?php\n\n$stdout = fopen(getenv(\"OUTPUT_PATH\"), \"w\");\n$stdin = fopen(\"php://stdin\", \"r\");\n\nfscanf($stdin, \"%d %d\" , $y , $w ) ;\n\n$arr = [ \"1/6\" , \"1/3\" , \"1/2\" , \"2/3\" , \"5/6\" , \"1/1\" ] ;\n\n$num = max( $y , $w ) ;\n\n$probability = 6 - $num ;\n\necho $arr[ $probability ] ;\n\nfwrite($stdout);\n\nfclose($stdin);\nfclose($stdout);\n\n?>"}, {"source_code": "<?php\n    fscanf(STDIN,\"%u %u\",$a,$b);\n    $m=7-max($a,$b);\n    $d=($m%3 ? 1:3)*($m%2 ? 1:2);\n    echo ($m/$d).'/'.(6/$d);\n?>"}, {"source_code": "<?php\n\nfunction gcd($a, $b) {\n\treturn $b == 0 ? $a : gcd($b, $a % $b);\n}\n\nfscanf(STDIN, \"%d %d\", $x, $y);\n$a = 7 - max($x, $y);\n$b = 6;\n$g = gcd($a, $b);\nprintf(\"%d/%d\\n\", $a / $g, $b / $g);\n?>\n"}, {"source_code": "<?php\n\n$line = trim(fgets(STDIN));\n$points = explode(\" \", $line);\n\n$maximum = max($points);\n\n$P = (7 - $maximum)/6;\n\nswitch ($P) {\n    case 0: \n        $P = '0/1';\n        break;\n    case 1:\n        $P = '1/1';\n        break;\n    case 1/6:\n        $P = '1/6';\n        break;\n    case 2/6:\n        $P = '1/3';\n        break;\n    case 3/6:\n        $P = '1/2';\n        break;\n    case 4/6:\n        $P = '2/3';\n        break;\n    case 5/6:\n        $P = '5/6';\n        break;\n}\n\necho $P;\n?>"}, {"source_code": "<?php\n\n\t$stdin = fopen('php://stdin', 'r');;\n\t$data = trim(fgets($stdin));\n    $arr = explode(\" \", $data);\n    $chance = max($arr);\n    switch($chance){\n        case 1: echo '1/1'; break;\n        case 2: echo '5/6'; break;\n        case 3: echo '2/3'; break;\n        case 4: echo '1/2'; break;\n        case 5: echo '1/3'; break;\n        case 6: echo '1/6'; break;  \n    }\n        "}, {"source_code": "<?\n$arr=explode(' ',trim(fgets(STDIN)));\n$max[]=max($arr);\nfunction gcd($a,$b) {\n    while ($b) {\n        $a%=$b;\n        $a^=$b^=$a^=$b;\n    }\n    return $a;\n}\nfor($i=$max[0];$i<6;$i++){\n    $max[]=$i+1;\n}\n$size=sizeof($max);\n$gcd=gcd($size,6);\necho $size/$gcd.\"/\".(6/$gcd);\n?>"}, {"source_code": "<?php\n//\t$x = 3;\n//\t$y = 4 ;\n\n\tlist ($y, $x) = explode(\" \", fgets(STDIN));\n\t$arr =[];\n\t$arr []= $y;\n\t$arr []= $x;\n\t$a = max ($arr);\nif($a == 6) { print \"1/6\"; }\nif($a == 5) { print \"1/3\"; }\nif($a == 4) { print \"1/2\"; }\nif($a == 3) { print \"2/3\"; }\nif($a == 2) { print \"5/6\"; }\nif($a == 1) { print \"1/1\"; }\n/*\n\tif (max ($arr)==1) { print \"1/1\";\n\t}elseif (max ($arr)==2) { print \"5/6\";\n\t}elseif (max ($arr)==3) { print \"1/2\";\n\t}elseif (max ($arr)==4) { print \"2/3\";\n\t}elseif (max ($arr)==5) { print \"1/3\";\n\t}elseif (max ($arr)==6) { print \"1/6\";\n\t}\n\n/*\tif (max ($arr)==1) { fwrite(STDOUT,\"1/1\")); }\n\tif (max ($arr)==2) { fwrite(STDOUT,\"5/6\")); }\n\tif (max ($arr)==3) { fwrite(STDOUT,\"1/2\")); }\n\tif (max ($arr)==4) { fwrite(STDOUT,\"2/3\")); } \n\tif (max ($arr)==5) { fwrite(STDOUT,\"1/3\")); }\n\tif (max ($arr)==6) { fwrite(STDOUT,\"1/6\")); }\n\n\n\tif (max ($arr)==1) { echo (\"1/1\"); }\n\tif (max ($arr)==2) { echo (\"5/6\"); }\n\tif (max ($arr)==3) { echo (\"1/2\"); }\n\tif (max ($arr)==4) { echo (\"2/3\"); } \n\tif (max ($arr)==5) { echo (\"1/3\"); }\n\tif (max ($arr)==6) { echo (\"1/6\"); }\n\n\nlist($y, $w) = explode(\" \", fgets(STDIN));\n$a = min(6 - $y, 6 - $w) + 1;\nif($a == 1) { print \"1/6\"; }\nif($a == 2) { print \"1/3\"; }\nif($a == 3) { print \"1/2\"; }\nif($a == 4) { print \"2/3\"; }\nif($a == 5) { print \"5/6\"; }\nif($a == 6) { print \"1/1\"; }\n*/\n\n?>\n\n\n"}, {"source_code": "<?php\n\tlist ($y, $x) = explode(\" \", fgets(STDIN));\n\t$a = max ($x, $y);\nif($a == 6) { print \"1/6\"; }\nif($a == 5) { print \"1/3\"; }\nif($a == 4) { print \"1/2\"; }\nif($a == 3) { print \"2/3\"; }\nif($a == 2) { print \"5/6\"; }\nif($a == 1) { print \"1/1\"; }\n/* \tmayakin\n\tif (max ($arr)==1) { print \"1/1\";\n\t}elseif (max ($arr)==2) { print \"5/6\";\n\t}elseif (max ($arr)==3) { print \"1/2\";\n\t}elseif (max ($arr)==4) { print \"2/3\";\n\t}elseif (max ($arr)==5) { print \"1/3\";\n\t}elseif (max ($arr)==6) { print \"1/6\";\n\t}\n\n\tif (max ($arr)==1) { fwrite(STDOUT,\"1/1\")); }\n\tif (max ($arr)==2) { fwrite(STDOUT,\"5/6\")); }\n\tif (max ($arr)==3) { fwrite(STDOUT,\"1/2\")); }\n\tif (max ($arr)==4) { fwrite(STDOUT,\"2/3\")); } \n\tif (max ($arr)==5) { fwrite(STDOUT,\"1/3\")); }\n\tif (max ($arr)==6) { fwrite(STDOUT,\"1/6\")); }\n\n\n\tif (max ($arr)==1) { echo (\"1/1\"); }\n\tif (max ($arr)==2) { echo (\"5/6\"); }\n\tif (max ($arr)==3) { echo (\"1/2\"); }\n\tif (max ($arr)==4) { echo (\"2/3\"); } \n\tif (max ($arr)==5) { echo (\"1/3\"); }\n\tif (max ($arr)==6) { echo (\"1/6\"); }\n\n\nlist($y, $w) = explode(\" \", fgets(STDIN));\n$a = min(6 - $y, 6 - $w) + 1;\nif($a == 1) { print \"1/6\"; }\nif($a == 2) { print \"1/3\"; }\nif($a == 3) { print \"1/2\"; }\nif($a == 4) { print \"2/3\"; }\nif($a == 5) { print \"5/6\"; }\nif($a == 6) { print \"1/1\"; }\n*/\n\n?>\n\n\n"}, {"source_code": "<?php\n//\t$x = 3;\n//\t$y = 4 ;\n\n/*\t$list ($y, $x) = explode(fgets(STDIN));\n\t$arr =[];\n\t$arr []= $y;\n\t$arr []= $x;\n\n\tif (max ($arr)==1) { print \"1/1\";\n\t}elseif (max ($arr)==2) { print \"5/6\";\n\t}elseif (max ($arr)==3) { print \"1/2\";\n\t}elseif (max ($arr)==4) { print \"2/3\";\n\t}elseif (max ($arr)==5) { print \"1/3\";\n\t}elseif (max ($arr)==6) { print \"1/6\";\n\t}\n\n\tif (max ($arr)==1) { fwrite(STDOUT,\"1/1\")); }\n\tif (max ($arr)==2) { fwrite(STDOUT,\"5/6\")); }\n\tif (max ($arr)==3) { fwrite(STDOUT,\"1/2\")); }\n\tif (max ($arr)==4) { fwrite(STDOUT,\"2/3\")); } \n\tif (max ($arr)==5) { fwrite(STDOUT,\"1/3\")); }\n\tif (max ($arr)==6) { fwrite(STDOUT,\"1/6\")); }\n\n\n\tif (max ($arr)==1) { echo (\"1/1\"); }\n\tif (max ($arr)==2) { echo (\"5/6\"); }\n\tif (max ($arr)==3) { echo (\"1/2\"); }\n\tif (max ($arr)==4) { echo (\"2/3\"); } \n\tif (max ($arr)==5) { echo (\"1/3\"); }\n\tif (max ($arr)==6) { echo (\"1/6\"); }\n*/\n\nlist($y, $w) = explode(\" \", fgets(STDIN));\n$a = min(6 - $y, 6 - $w) + 1;\nif($a == 1) { print \"1/6\"; }\nif($a == 2) { print \"1/3\"; }\nif($a == 3) { print \"1/2\"; }\nif($a == 4) { print \"2/3\"; }\nif($a == 5) { print \"5/6\"; }\nif($a == 6) { print \"1/1\"; }\n?>\n\n\n"}, {"source_code": "<?php\nlist($y, $w) = explode(' ',trim(fgets(STDIN)));\nif($y > $w) $m = $y; else $m = $w;\nswitch($m){\n case 1: print '1/1'; break;\n case 2: print '5/6'; break;\n case 3: print '2/3'; break;\n case 4: print '1/2'; break;\n case 5: print '1/3'; break;\n case 6: print '1/6'; break;\n}\n?>"}, {"source_code": "<?\n$fp=fopen('php://stdin', 'r');\n$lines=stream_get_contents($fp);\n$lines = trim($lines);\n$nums=explode(\" \", $lines);\n$good=6-max($nums)+1;\n$all=6;\n\nfor ($i=2; $i<=6; $i++)\nif ($good%$i==0 and $all%$i==0)\n{\n    $good/=$i;\n    $all/=$i;\n}\n\n$res=\"$good/$all\";\necho $res;\n?>"}, {"source_code": "<?php\n$result = trim(fgets(STDIN));\nlist($y, $w) = explode(' ', $result);\n$mn = max($y,$w)-1;\n$mn = 6-$mn;\n$ar = [\"0/1\",\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"];\necho $ar[$mn].\"\\n\";"}], "negative_code": [{"source_code": "<?php\n\n//=====================================\n// link: http://codeforces.com/contest/9/problem/A\n//=====================================\n\n// get inputs\nlist($yakko, $wakko) = explode(' ', trim(fgets(STDIN)));\n\n// solution\nif ($yakko == 1 && $wakko == 1) {\n    echo \"0/1\\n\";\n    die;\n}\n\nif ($yakko == 6 && $wakko == 6) {\n    echo \"1/1\\n\";\n    die;\n}\n\n$max = 6 - max($yakko, $wakko);\n\necho \"1/\" . $max . \"\\n\";\n"}, {"source_code": "<?php\n$s = fgets(STDIN);\nlist($a, $b) = explode(\" \", $s);\n($a>$b)?($c=$a):($c=$b);\nif($c==6) {print (\"1/\".$c); }\nelseif($c==1) {print ($c.\"/1\"); };\n$s=6-($c-1);\nif (($s%2==0)and($s!=6)and($s!=1)) { print(($s/2).\"/\".(6/2));}\nelseif(($s%3==0)and($s!=6)and($s!=1)) {print (($s/3).\"/\".(6/3));}\nelseif(($s!=6)and($s!=1)) {print(($s).\"/6\");}\n?>"}, {"source_code": "<?php\n\t$fr = fopen(\"php://stdin\",\"r\");\n\t$input = fgets($fr);\n\tlist( $y, $w ) = explode(' ', $input);\n\tfclose ($fr);\n\n\t$dice = 6;\n\t$r = min( $dice-$y, $dice-$w ) + 1;\n\tforeach ( array(2,3,4,5,6) as $d )\n\t\tif ( ($r % $d) == 0 )\n\t\t{\n\t\t\t$r /= $d;\n\t\t\t$dice /= $d;\n\t\t}\n\techo $r.'/'.$dice;\n?>"}, {"source_code": "<?php\n\t$fr = fopen(\"php://stdin\",\"r\");\n\t$input = fgets($fr);\n\tlist( $y, $w ) = explode(' ', $input);\n\tfclose ($fr);\n\n\t$dice = 6;\n\t$r = min( $dice-$y, $dice-$w ) + 1;\n\tif ( $r == 1 )\n\t\tdie('0/1');\n\tforeach ( array(2,3,5) as $d )\n\t{\n\t\twhile ( (($r % $d) == 0) && (($dice % $d) == 0) )\n\t\t{\n\t\t\t$r /= $d;\n\t\t\t$dice /= $d;\n\t\t}\n\t}\n\techo $r.'/'.$dice;\n?>"}, {"source_code": "<?php\n\t$fr = fopen(\"php://stdin\",\"r\");\n\t$input = fgets($fr);\n\tlist( $y, $w ) = explode(' ', $input);\n\tfclose ($fr);\n\n\t$dice = 6;\n\t$r = min( $dice-$y, $dice-$w ) + 1;\n\tif ( $r == 1 )\n\t\tdie('0/1');\n\tforeach ( array(2,3,5) as $d )\n\t{\n\t\twhile ( ($r % $d) == 0 )\n\t\t{\n\t\t\t$r /= $d;\n\t\t\t$dice /= $d;\n\t\t}\n\t}\n\techo $r.'/'.$dice;\n?>"}, {"source_code": "\ufeff<?php\n\nfunction gcd($a, $b) {\n\treturn $b == 0 ? $a : gcd($b, $a % $b);\n}\n\nfscanf(STDIN, \"%d %d\", $x, $y);\n$a = 7 - max($x, $y);\n$b = 6;\n$g = gcd($a, $b);\nprintf(\"%d/%d\", $a / $g, $b / $g);\n?>\n"}, {"source_code": "\ufeff<?php\n\nfunction gcd($a, $b) {\n\treturn $b == 0 ? $a : gcd($b, $a % $b);\n}\n\nfscanf(STDIN, \"%d %d\", $x, $y);\n$a = 7 - max($x, $y);\n$b = 6;\necho \"$a $b\\n\";\n$g = gcd($a, $b);\nprintf(\"%d/%d\\n\", $a / $g, $b / $g);\n?>\n"}, {"source_code": "\ufeff<?php\n\nfunction gcd($a, $b) {\n\treturn $b == 0 ? $a : gcd($b, $a % $b);\n}\n\nfscanf(STDIN, \"%d %d\", $x, $y);\n$a = 7 - max($x, $y);\n$b = 6;\n$g = gcd($a, $b);\nprintf(\"%d/%d\\n\", $a / $g, $b / $g);\n?>\n"}, {"source_code": "<?php\n\n$line = trim(fgets(STDIN));\n$points = explode(\" \", $line);\n\n$maximum = max($points);\n\n$P = (7 - $maximum)/6;\n\nswitch ($P) {\n    case 0: \n        $P = '0/0';\n        break;\n    case 1:\n        $P = '1/1';\n        break;\n    case 1/6:\n        $P = '1/6';\n        break;\n    case 2/6:\n        $P = '2/6';\n        break;\n    case 3/6:\n        $P = '3/6';\n        break;\n    case 4/6:\n        $P = '4/6';\n        break;\n    case 5/6:\n        $P = '5/6';\n        break;\n}\n\necho $P;\n?>"}, {"source_code": "<?php\n\n$line = trim(fgets(STDIN));\n$points = explode(\" \", $line);\n\n$maximum = max($points);\n\n$P = (7 - $maximum)/6;\n\nswitch ($P) {\n    case 0: \n        $P = '0/1';\n        break;\n    case 1:\n        $P = '1/1';\n        break;\n    case 1/6:\n        $P = '1/6';\n        break;\n    case 2/6:\n        $P = '2/6';\n        break;\n    case 3/6:\n        $P = '3/6';\n        break;\n    case 4/6:\n        $P = '4/6';\n        break;\n    case 5/6:\n        $P = '5/6';\n        break;\n}\n\necho $P;\n?>"}, {"source_code": "<?php\n//\t$x = 3;\n//\t$y = 4 ;\n\n\tlist ($y, $x) = explode(\" \", fgets(STDIN));\n\t$arr =[];\n\t$arr []= $y;\n\t$arr []= $x;\n\t$a = max ($arr);\nif($a == 1) { print \"1/6\"; }\nif($a == 2) { print \"1/3\"; }\nif($a == 3) { print \"1/2\"; }\nif($a == 4) { print \"2/3\"; }\nif($a == 5) { print \"5/6\"; }\nif($a == 6) { print \"1/1\"; }\n/*\n\tif (max ($arr)==1) { print \"1/1\";\n\t}elseif (max ($arr)==2) { print \"5/6\";\n\t}elseif (max ($arr)==3) { print \"1/2\";\n\t}elseif (max ($arr)==4) { print \"2/3\";\n\t}elseif (max ($arr)==5) { print \"1/3\";\n\t}elseif (max ($arr)==6) { print \"1/6\";\n\t}\n\n/*\tif (max ($arr)==1) { fwrite(STDOUT,\"1/1\")); }\n\tif (max ($arr)==2) { fwrite(STDOUT,\"5/6\")); }\n\tif (max ($arr)==3) { fwrite(STDOUT,\"1/2\")); }\n\tif (max ($arr)==4) { fwrite(STDOUT,\"2/3\")); } \n\tif (max ($arr)==5) { fwrite(STDOUT,\"1/3\")); }\n\tif (max ($arr)==6) { fwrite(STDOUT,\"1/6\")); }\n\n\n\tif (max ($arr)==1) { echo (\"1/1\"); }\n\tif (max ($arr)==2) { echo (\"5/6\"); }\n\tif (max ($arr)==3) { echo (\"1/2\"); }\n\tif (max ($arr)==4) { echo (\"2/3\"); } \n\tif (max ($arr)==5) { echo (\"1/3\"); }\n\tif (max ($arr)==6) { echo (\"1/6\"); }\n\n\nlist($y, $w) = explode(\" \", fgets(STDIN));\n$a = min(6 - $y, 6 - $w) + 1;\nif($a == 1) { print \"1/6\"; }\nif($a == 2) { print \"1/3\"; }\nif($a == 3) { print \"1/2\"; }\nif($a == 4) { print \"2/3\"; }\nif($a == 5) { print \"5/6\"; }\nif($a == 6) { print \"1/1\"; }\n*/\n\n?>\n\n\n"}], "src_uid": "f97eb4ecffb6cbc8679f0c621fd59414"}
{"nl": {"description": "Bob loves everything sweet. His favorite chocolate bar consists of pieces, each piece may contain a nut. Bob wants to break the bar of chocolate into multiple pieces so that each part would contain exactly one nut and any break line goes between two adjacent pieces.You are asked to calculate the number of ways he can do it. Two ways to break chocolate are considered distinct if one of them contains a break between some two adjacent pieces and the other one doesn't. Please note, that if Bob doesn't make any breaks, all the bar will form one piece and it still has to have exactly one nut.", "input_spec": "The first line of the input contains integer n (1\u2009\u2264\u2009n\u2009\u2264\u2009100)\u00a0\u2014 the number of pieces in the chocolate bar. The second line contains n integers ai (0\u2009\u2264\u2009ai\u2009\u2264\u20091), where 0 represents a piece without the nut and 1 stands for a piece with the nut.", "output_spec": "Print the number of ways to break the chocolate into multiple parts so that each part would contain exactly one nut.", "sample_inputs": ["3\n0 1 0", "5\n1 0 1 0 1"], "sample_outputs": ["1", "4"], "notes": "NoteIn the first sample there is exactly one nut, so the number of ways equals 1\u00a0\u2014 Bob shouldn't make any breaks.In the second sample you can break the bar in four ways:10|10|11|010|110|1|011|01|01"}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array_sum($b);\nif($c == 0)\n{\n     print \"0\";\n}\nelseif($c == 1)\n{\n     print \"1\";\n}\nelse\n{\n     $d = array();\n     $e = 0;\n     for($x = 0; $x < $a; $x++)\n     {\n          if(($b[$x] == 1) && ($e == 0))\n          {\n               $e++;\n          }\n          elseif(($b[$x] == 0) && ($e != 0))\n          {\n               $e++;\n          }\n          elseif(($b[$x] == 1) && ($e != 0))\n          {\n               array_push($d, $e);\n               $e = 1;\n          }\n     }\n     $f = 1;\n     for($x = 0; $x < count($d); $x++)\n     {\n          $f = bcmul($f, $d[$x]);\n     }\n     print $f;\n}\n?>"}, {"source_code": "<?php\n    $n = trim(fgets(STDIN));\n    $a = explode(\" \",trim(fgets(STDIN)));\n    $sum = array_sum($a);\n    if ($sum == 0)\n    {\n        echo(\"0\");\n        \n    }\n    else\n    {\n        $res = 1;\n        $pre = -1;\n        for ($i = 0 ; $i < $n ; $i ++)\n        {\n            if ($a[$i] == 1)\n            {\n                if ($pre != -1)\n                {\n                    $res *= $i - $pre;\n                }\n                $pre = $i ;\n            }\n        }\n        \n        echo(number_format($res,0,'',''));\n    }\n    \n?>"}, {"source_code": "<?php\n/**\n * Author: \u4e03\u67f3\u5148\u68ee\n * Date: 2016/1/26  9:13\n */\n//\u7ec4\u5408\u6570\u5b66\u95ee\u9898\u3002\nfscanf(STDIN,\"%d\",$n);\n$bans = array();\n$line = stream_get_line(STDIN,1000000,\"\\n\");\n$line = rtrim($line);//\u53bb\u9664\u53f3\u8fb9\u7684\u6362\u884c\u7b26\u3002\n$bans = explode(\" \",$line);\n\n//var_dump($bans);\n$result = 0;\n$prev = -1;\n//\u8fde\u7eed\u7684\u7684\u627e1\uff0c\u53ea\u6709\u51fa\u73b01\u7684\u65f6\u5019\u624d\u80fd\u4ea7\u751f\u65b0\u7ec4\u5408\u3002\n//\u9047\u5230\u4e00\u4e2a1\uff0c\u5c31\u662f\u524d\u9762\u76841\u7684\u65b9\u6848\u6570\uff0c\u4e58\u4e0a\u5230\u8fd9\u4e2a1\u7684\u533a\u95f4\u5207\u5272\u65b9\u6848\uff0c\u4e5f\u5c31\u662fposi - posi-1\nfor($i = 0 ; $i < $n;$i++){\n    if($bans[$i] == 1){\n        if($prev == -1){\n            $result = 1;\n        }else{\n            $result *= $i - $prev;\n        }\n        $prev = $i;\n    }\n}\nfprintf(STDOUT,\"%.0f\",$result);"}, {"source_code": "<?php\n$f = fopen( 'php://stdin', 'r' );\n\n$counter = 0;\nwhile( $line = fgets( $f ) ) {\n  if ($counter == 1) {\n      $nutsLine = $line;\n  }\n  $counter ++ ;\n}\n\n$nuts = explode(' ', $nutsLine);\n$length = sizeof($nuts);\n$vars = 0;\n$countMode = false;\n$tempVars = 0;\n$zero = true;\nforeach($nuts as $nut) {\n    if ($nut == 1) {\n        $zero = false;\n    }\n}\nif ($zero) {\n    echo '0';\n    die();\n}\nfor($i=0; $i < $length; $i++) {\n    if (!$countMode && ($nuts[$i] == '1')) {\n        $countMode = true;\n        continue;\n    }\n    if ($countMode && ($nuts[$i] == 0)) {\n        $tempVars ++;\n    }\n    \n    if ($countMode && ($nuts[$i] == 1)) {\n        if ($tempVars > 0) {\n            $tempVars ++;\n            if ($vars > 0) {\n                $vars = $vars * $tempVars;\n            } else {\n                $vars = $tempVars;\n            }\n            $tempVars = 0;\n        } else {\n            \n        }\n    }\n    \n}\nif ($vars == 0) {\n    echo '1';\n} else {\n    echo number_format($vars, 0, '', '');\n}\n\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array_sum($b);\nif($c == 1)\n{\n     print \"1\";\n}\nelse\n{\n     $d = array();\n     $e = 0;\n     for($x = 0; $x < $a; $x++)\n     {\n          if(($b[$x] == 1) && ($e == 0))\n          {\n               $e++;\n          }\n          elseif(($b[$x] == 0) && ($e != 0))\n          {\n               $e++;\n          }\n          elseif(($b[$x] == 1) && ($e != 0))\n          {\n               array_push($d, $e);\n               $e = 1;\n          }\n     }\n     $f = array_product($d);\n     for($x = 0; $x < count($d); $x++)\n     {\n          if($d[$x] == 1)\n          {\n               $f++;\n          }\n     }\n     print $f;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array_sum($b);\nif($c == 1)\n{\n     print \"1\";\n}\nelse\n{\n     $d = array();\n     $e = 0;\n     for($x = 0; $x < $a; $x++)\n     {\n          if(($b[$x] == 0) && ($e != 0) && ($x == $a - 1))\n          {\n               $e++;\n               array_push($d, $e);\n          }\n          elseif(($b[$x] == 1) && ($e == 0))\n          {\n               $e++;\n          }\n          elseif(($b[$x] == 0) && ($e != 0))\n          {\n               $e++;\n          }\n          elseif(($b[$x] == 1) && ($e != 0))\n          {\n               array_push($d, $e);\n               $e = 1;\n          }\n     }\n     print array_product($d);\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array_sum($b);\nif($c == 1)\n{\n     print \"1\";\n}\nelse\n{\n     $d = array();\n     $e = 0;\n     for($x = 0; $x < $a; $x++)\n     {\n          if(($b[$x] == 1) && ($e == 0))\n          {\n               $e++;\n          }\n          elseif(($b[$x] == 0) && ($e != 0))\n          {\n               $e++;\n          }\n          elseif(($b[$x] == 1) && ($e != 0))\n          {\n               array_push($d, $e);\n               $e = 1;\n          }\n     }\n     print array_product($d);\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array_sum($b);\nif($c == 1)\n{\n     print \"1\";\n}\nelse\n{\n     $d = array();\n     $e = 0;\n     for($x = 0; $x < $a; $x++)\n     {\n          if(($b[$x] == 0) && ($e != 0) && ($x == $a - 1))\n          {\n               array_push($d, 1);\n          }\n          elseif(($b[$x] == 1) && ($e == 0))\n          {\n               $e++;\n          }\n          elseif(($b[$x] == 0) && ($e != 0))\n          {\n               $e++;\n          }\n          elseif(($b[$x] == 1) && ($e != 0))\n          {\n               array_push($d, $e);\n               $e = 1;\n          }\n     }\n     print array_product($d);\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array_sum($b);\nif($c == 0)\n{\n     print \"0\";\n}\nelseif($c == 1)\n{\n     print \"1\";\n}\nelse\n{\n     $d = array();\n     $e = 0;\n     for($x = 0; $x < $a; $x++)\n     {\n          if(($b[$x] == 1) && ($e == 0))\n          {\n               $e++;\n          }\n          elseif(($b[$x] == 0) && ($e != 0))\n          {\n               $e++;\n          }\n          elseif(($b[$x] == 1) && ($e != 0))\n          {\n               array_push($d, $e);\n               $e = 1;\n          }\n     }\n     print array_product($d);\n}\n?>"}, {"source_code": "<?php\n    $n = trim(fgets(STDIN));\n    $a = explode(\" \",trim(fgets(STDIN)));\n    $sum = array_sum($a);\n    if ($sum == 0)\n    {\n        echo(\"0\");\n        \n    }\n    else\n    {\n        $res = 1;\n        $pre = -1;\n        for ($i = 0 ; $i < $n ; $i ++)\n        {\n            if ($a[$i] == 1)\n            {\n                if ($pre != -1)\n                {\n                    $res *= $i - $pre;\n                }\n                $pre = $i ;\n            }\n        }\n        \n        print($res);\n    }\n    \n?>"}, {"source_code": "<?php\n    $n = trim(fgets(STDIN));\n    $a = explode(\" \",trim(fgets(STDIN)));\n    $sum = array_sum($a);\n    if ($sum == 0)\n    {\n        echo(\"0\");\n        \n    }\n    else\n    {\n        $res = 1;\n        $pre = -1;\n        for ($i = 0 ; $i < $n ; $i ++)\n        {\n            if ($a[$i] == 1)\n            {\n                if ($pre != -1)\n                {\n                    $res *= $i - $pre;\n                }\n                $pre = $i ;\n            }\n        }\n        \n        echo($res);\n    }\n    \n?>"}, {"source_code": "<?php\n    $n = trim(fgets(STDIN));\n    $a = explode(\" \",trim(fgets(STDIN)));\n    $sum = array_sum($a);\n    if ($sum == 0)\n    {\n        echo(\"0\");\n        \n    }\n    else\n    {\n        $res = 1;\n        $pre = -1;\n        for ($i = 0 ; $i < $n ; $i ++)\n        {\n            if ($a[$i] == 1)\n            {\n                if ($pre != -1)\n                {\n                    $res *= $i - $pre;\n                }\n                $pre = i ;\n            }\n        }\n        \n        echo($res);\n    }\n    \n?>"}, {"source_code": "<?php\n/**\n * Author: \u4e03\u67f3\u5148\u68ee\n * Date: 2016/1/26  9:13\n */\n//\u7ec4\u5408\u6570\u5b66\u95ee\u9898\u3002\nfscanf(STDIN,\"%d\",$n);\n$bans = array();\n$line = stream_get_line(STDIN,1000000,\"\\n\");\n$line = rtrim($line);//\u53bb\u9664\u53f3\u8fb9\u7684\u6362\u884c\u7b26\u3002\n$bans = explode(\" \",$line);\n\n//var_dump($bans);\n$result = 0;\n$prev = -1;\n//\u8fde\u7eed\u7684\u7684\u627e1\uff0c\u53ea\u6709\u51fa\u73b01\u7684\u65f6\u5019\u624d\u80fd\u4ea7\u751f\u65b0\u7ec4\u5408\u3002\n//\u9047\u5230\u4e00\u4e2a1\uff0c\u5c31\u662f\u524d\u9762\u76841\u7684\u65b9\u6848\u6570\uff0c\u4e58\u4e0a\u5230\u8fd9\u4e2a1\u7684\u533a\u95f4\u5207\u5272\u65b9\u6848\uff0c\u4e5f\u5c31\u662fposi - posi-1\nfor($i = 0 ; $i < $n;$i++){\n    if($bans[$i] == 1){\n        if($prev == -1){\n            $result = 1;\n        }else{\n            $result *= $i - $prev;\n        }\n        $prev = $i;\n    }\n}\nfprintf(STDOUT,\"%d\",$result);"}, {"source_code": "<?php\n$f = fopen( 'php://stdin', 'r' );\n\n$counter = 0;\nwhile( $line = fgets( $f ) ) {\n  if ($counter == 1) {\n      $nutsLine = $line;\n  }\n  $counter ++ ;\n}\n\n$nuts = explode(' ', $nutsLine);\n$length = sizeof($nuts);\n$vars = 0;\n$countMode = false;\n$tempVars = 0;\nfor($i=0; $i < $length; $i++) {\n    if (!$countMode && ($nuts[$i] == '1')) {\n        // $vars ++;\n        $countMode = true;\n        continue;\n    }\n    if ($countMode && ($nuts[$i] == 0)) {\n        $tempVars ++;\n        continue;\n    }\n    \n    if ($countMode && ($nuts[$i] == '1')) {\n        $vars = $vars + $tempVars;\n        if ($tempVars > 0) {\n            $vars ++;\n        }\n        $tempVars = 0;\n        $countMode = false;\n        if ($nuts[$i+1] == '0') {\n            $countMode = true;\n        }\n    }\n}\nif ($vars == 0) {\n    echo '1';\n} else {\n    echo $vars;\n}\n\n?>"}, {"source_code": "<?php\n$f = fopen( 'php://stdin', 'r' );\n\n$counter = 0;\nwhile( $line = fgets( $f ) ) {\n  if ($counter == 1) {\n      $nutsLine = $line;\n  }\n  $counter ++ ;\n}\n\n$nuts = explode(' ', $nutsLine);\n$length = sizeof($nuts);\n$vars = 0;\n$countMode = false;\n$tempVars = 0;\n$zero = true;\nforeach($nuts as $nut) {\n    if ($nut == '1') {\n        $zero = false;\n    }\n}\nif ($zero) {\n    echo '0';\n    die();\n}\nfor($i=0; $i < $length; $i++) {\n    if (!$countMode && ($nuts[$i] == '1')) {\n        $countMode = true;\n        continue;\n    }\n    if ($countMode && ($nuts[$i] == 0)) {\n        $tempVars ++;\n    }\n    \n    if ($countMode && ($nuts[$i] == 1)) {\n        if ($tempVars > 0) {\n            $tempVars ++;\n            if ($vars > 0) {\n                $vars = $vars * $tempVars;\n            } else {\n                $vars = $tempVars;\n            }\n            $tempVars = 0;\n        } else {\n            \n        }\n    }\n    \n}\nif ($vars == 0) {\n    echo '1';\n} else {\n    echo number_format($vars, 0, '', '');\n}\n\n?>"}, {"source_code": "<?php\n$f = fopen( 'php://stdin', 'r' );\n\n$counter = 0;\nwhile( $line = fgets( $f ) ) {\n  if ($counter == 1) {\n      $nutsLine = $line;\n  }\n  $counter ++ ;\n}\n\n$nuts = explode(' ', $nutsLine);\n$length = sizeof($nuts);\n$vars = 0;\n$countMode = false;\n$tempVars = 0;\n$zero = true;\nforeach($nuts as $nut) {\n    if ($nut == '1') {\n        $zero = false;\n    }\n}\nif ($zero) {\n    echo '0';\n    die();\n}\nfor($i=0; $i < $length; $i++) {\n    if (!$countMode && ($nuts[$i] == '1')) {\n        $countMode = true;\n        continue;\n    }\n    if ($countMode && ($nuts[$i] == 0)) {\n        $tempVars ++;\n    }\n    \n    if ($countMode && ($nuts[$i] == 1)) {\n        if ($tempVars > 0) {\n            $tempVars ++;\n            if ($vars > 0) {\n                $vars = $vars * $tempVars;\n            } else {\n                $vars = $tempVars;\n            }\n            $tempVars = 0;\n        } else {\n            \n        }\n    }\n    \n}\nif ($vars == 0) {\n    echo '1';\n} else {\n    echo $vars;\n}\n\n?>"}, {"source_code": "<?php\n$f = fopen( 'php://stdin', 'r' );\n\n$counter = 0;\nwhile( $line = fgets( $f ) ) {\n  if ($counter == 1) {\n      $nutsLine = $line;\n  }\n  $counter ++ ;\n}\n\n$nuts = explode(' ', $nutsLine);\n$length = sizeof($nuts);\n$vars = 0;\n$countMode = false;\n$tempVars = 0;\nfor($i=0; $i < $length; $i++) {\n    if (!$countMode && ($nuts[$i] == '1')) {\n        // $vars ++;\n        $countMode = true;\n        continue;\n    }\n    if ($countMode && ($nuts[$i] == 0)) {\n        $tempVars ++;\n        continue;\n    }\n    \n    if ($countMode && ($nuts[$i] == '1')) {\n        $vars = $vars + $tempVars;\n        if ($tempVars > 0) {\n            $vars ++;\n        }\n        $tempVars = 0;\n        $countMode = false;\n        if ($nuts[$i+1] == '0') {\n            $countMode = true;\n        }\n    }\n}\n\necho $vars;\n\n?>"}, {"source_code": "<?php\n$f = fopen( 'php://stdin', 'r' );\n\n$counter = 0;\nwhile( $line = fgets( $f ) ) {\n  if ($counter == 1) {\n      $nutsLine = $line;\n  }\n  $counter ++ ;\n}\n\n$nuts = explode(' ', $nutsLine);\n$length = sizeof($nuts);\n$vars = 0;\n$countMode = false;\n$tempVars = 0;\nfor($i=0; $i < $length; $i++) {\n    if (!$countMode && ($nuts[$i] == '1')) {\n        $vars ++;\n        $countMode = true;\n        continue;\n    }\n    if ($countMode && ($nuts[$i] == 0)) {\n        $tempVars ++;\n        continue;\n    }\n    \n    if ($countMode && ($nuts[$i] == '1')) {\n        $vars = $vars + $tempVars;\n        if ($i != ($length -1)) {\n            $vars++;\n        }\n        $tempVars = 0;\n    }\n}\n\necho $vars;\n\n?>"}, {"source_code": "<?php\n$f = fopen( 'php://stdin', 'r' );\n\n$counter = 0;\nwhile( $line = fgets( $f ) ) {\n  if ($counter == 1) {\n      $nutsLine = $line;\n  }\n  $counter ++ ;\n}\n\n$nuts = explode(' ', $nutsLine);\n$length = sizeof($nuts);\n$vars = 0;\n$countMode = false;\n$tempVars = 0;\n$zero = true;\nforeach($nuts as $nut) {\n    if ($nut == '1') {\n        $zero = false;\n    }\n}\nif ($zero) {\n    echo '0';\n    die();\n}\nfor($i=0; $i < $length; $i++) {\n    if (!$countMode && ($nuts[$i] == '1')) {\n        // $vars ++;\n        $countMode = true;\n        continue;\n    }\n    if ($countMode && ($nuts[$i] == 0)) {\n        $tempVars ++;\n    }\n    \n    if ($countMode && ($nuts[$i] == '1')) {\n        if ($tempVars > 0) {\n            $vars = $vars + $tempVars;\n            $vars ++;\n            $countMode = false;\n        }\n        $tempVars = 0;\n        \n        if ($nuts[$i+1] == '0') {\n            $countMode = true;\n        }\n    }\n    /*\n    if ($i == ($length - 1)) {\n        if ($tempVars > 0) {\n            $vars ++;\n        }\n    }\n    */\n}\nif ($vars == 0) {\n    echo '1';\n} else {\n    echo $vars;\n}\n\n?>"}, {"source_code": "<?php\n$f = fopen( 'php://stdin', 'r' );\n\n\n\n\n$counter = 0;\nwhile( $line = fgets( $f ) ) {\n  if ($counter == 1) {\n      $nutsLine = $line;\n  }\n  $counter ++ ;\n}\n\n$nuts = explode(' ', $nutsLine);\n$length = sizeof($nuts);\n$vars = 0;\n$countMode = false;\n$tempVars = 0;\n$zero = true;\nforeach($nuts as $nut) {\n    if ($nut == '1') {\n        $zero = false;\n    }\n}\nif ($zero) {\n    echo '0';\n    die();\n}\nfor($i=0; $i < $length; $i++) {\n    if (!$countMode && ($nuts[$i] == '1')) {\n        $countMode = true;\n        continue;\n    }\n    if ($countMode && ($nuts[$i] == 0)) {\n        $tempVars ++;\n    }\n    \n    if ($countMode && ($nuts[$i] == 1)) {\n        if ($tempVars > 0) {\n            $tempVars ++;\n            if ($vars > 0) {\n                $vars = $vars * $tempVars;\n            } else {\n                $vars = $tempVars;\n            }\n            $tempVars = 0;\n        } else {\n            \n        }\n    }\n    \n}\nif ($vars == 0) {\n    echo '1';\n} else {\n    echo number_format($vars, 0, '', '');\n}\n\n?>"}, {"source_code": "<?php\n$f = fopen( 'php://stdin', 'r' );\n\n$counter = 0;\nwhile( $line = fgets( $f ) ) {\n  if ($counter == 1) {\n      $nutsLine = $line;\n  }\n  $counter ++ ;\n}\n\n$nuts = explode(' ', $nutsLine);\n$length = sizeof($nuts);\n$vars = 0;\n$countMode = false;\n$tempVars = 0;\nfor($i=0; $i < $length; $i++) {\n    if (!$countMode && ($nuts[$i] == '1')) {\n        $vars ++;\n        $countMode = true;\n        continue;\n    }\n    if ($countMode && ($nuts[$i] == 0)) {\n        $tempVars ++;\n        continue;\n    }\n    \n    if ($countMode && ($nuts[$i] == '1')) {\n        $vars = $vars + $tempVars;\n        if (($i != ($length -1)) && ($tempVars > 0)) {\n            $vars++;\n        }\n        $tempVars = 0;\n    }\n}\n\necho $vars;\n\n?>"}, {"source_code": "<?php\n$f = fopen( 'php://stdin', 'r' );\n\n$counter = 0;\nwhile( $line = fgets( $f ) ) {\n  if ($counter == 1) {\n      $nutsLine = $line;\n  }\n  $counter ++ ;\n}\n\n$nuts = explode(' ', $nutsLine);\n$length = sizeof($nuts);\n$vars = 0;\n$countMode = false;\n$tempVars = 0;\n$zero = true;\nforeach($nuts as $nut) {\n    if ($nut == '1') {\n        $zero = false;\n    }\n}\nif ($zero) {\n    echo '0';\n    die();\n}\nfor($i=0; $i < $length; $i++) {\n    if (!$countMode && ($nuts[$i] == '1')) {\n        // $vars ++;\n        $countMode = true;\n        continue;\n    }\n    if ($countMode && ($nuts[$i] == 0)) {\n        $tempVars ++;\n        continue;\n    }\n    \n    if ($countMode && ($nuts[$i] == '1')) {\n        $vars = $vars + $tempVars;\n        if ($tempVars > 0) {\n            $vars ++;\n        }\n        $tempVars = 0;\n        $countMode = false;\n        if ($nuts[$i+1] == '0') {\n            $countMode = true;\n        }\n    }\n}\nif ($vars == 0) {\n    echo '1';\n} else {\n    echo $vars;\n}\n\n?>"}], "src_uid": "58242665476f1c4fa723848ff0ecda98"}
{"nl": {"description": "String can be called correct if it consists of characters \"0\" and \"1\" and there are no redundant leading zeroes. Here are some examples: \"0\", \"10\", \"1001\".You are given a correct string s.You can perform two different operations on this string:   swap any pair of adjacent characters (for example, \"101\"  \"110\");  replace \"11\" with \"1\" (for example, \"110\"  \"10\"). Let val(s) be such a number that s is its binary representation.Correct string a is less than some other correct string b iff val(a)\u2009&lt;\u2009val(b).Your task is to find the minimum correct string that you can obtain from the given one using the operations described above. You can use these operations any number of times in any order (or even use no operations at all).", "input_spec": "The first line contains integer number n (1\u2009\u2264\u2009n\u2009\u2264\u2009100) \u2014 the length of string s. The second line contains the string s consisting of characters \"0\" and \"1\". It is guaranteed that the string s is correct.", "output_spec": "Print one string \u2014 the minimum correct string that you can obtain from the given one.", "sample_inputs": ["4\n1001", "1\n1"], "sample_outputs": ["100", "1"], "notes": "NoteIn the first example you can obtain the answer by the following sequence of operations: \"1001\"  \"1010\"  \"1100\"  \"100\".In the second example you can't obtain smaller answer no matter what operations you use."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = 0;\n$d = 0;\nfor($x = 0; $x < $a; $x++)\n{\n     if($b[$x] == \"0\")\n     {\n          $c++;\n     }\n     else\n     {\n          $d = 1;\n     }\n}\nif($d == 0)\n{\n     print \"0\";\n}\nelse\n{\n     $e = \"1\";\n     for($x = 0; $x < $c; $x++)\n     {\n          $e .= \"0\";\n     }\n     print $e;\n}\n?>"}], "negative_code": [], "src_uid": "ac244791f8b648d672ed3de32ce0074d"}
{"nl": {"description": "The last stage of Football World Cup is played using the play-off system.There are n teams left in this stage, they are enumerated from 1 to n. Several rounds are held, in each round the remaining teams are sorted in the order of their ids, then the first in this order plays with the second, the third\u00a0\u2014 with the fourth, the fifth\u00a0\u2014 with the sixth, and so on. It is guaranteed that in each round there is even number of teams. The winner of each game advances to the next round, the loser is eliminated from the tournament, there are no draws. In the last round there is the only game with two remaining teams: the round is called the Final, the winner is called the champion, and the tournament is over.Arkady wants his two favorite teams to play in the Final. Unfortunately, the team ids are already determined, and it may happen that it is impossible for teams to meet in the Final, because they are to meet in some earlier stage, if they are strong enough. Determine, in which round the teams with ids a and b can meet.", "input_spec": "The only line contains three integers n, a and b (2\u2009\u2264\u2009n\u2009\u2264\u2009256, 1\u2009\u2264\u2009a,\u2009b\u2009\u2264\u2009n)\u00a0\u2014 the total number of teams, and the ids of the teams that Arkady is interested in.  It is guaranteed that n is such that in each round an even number of team advance, and that a and b are not equal.", "output_spec": "In the only line print \"Final!\" (without quotes), if teams a and b can meet in the Final. Otherwise, print a single integer\u00a0\u2014 the number of the round in which teams a and b can meet. The round are enumerated from 1.", "sample_inputs": ["4 1 2", "8 2 6", "8 7 5"], "sample_outputs": ["1", "Final!", "2"], "notes": "NoteIn the first example teams 1 and 2 meet in the first round.In the second example teams 2 and 6 can only meet in the third round, which is the Final, if they win all their opponents in earlier rounds.In the third example the teams with ids 7 and 5 can meet in the second round, if they win their opponents in the first round."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = $a / 2;\nif((($b <= $d) && ($c > $d)) || (($c <= $d) && ($b > $d)))\n{\n     print \"Final!\";\n}\nelse\n{\n     $e = range(1, $a);\n     $g = 1;\n     $h = 0;\n     while(TRUE)\n     {\n          $f = array();\n          for($x = 0; $x < count($e) - 1; $x++)\n          {\n               if((($e[$x] == $b) && ($e[$x + 1] == $c)) || (($e[$x] == $c) && ($e[$x + 1] == $b)))\n               {\n                    $h = 1;\n                    break;\n               }\n               elseif((($e[$x] == $b) && ($e[$x + 1] != $c)) || (($e[$x] != $c) && ($e[$x + 1] == $b)))\n               {\n                    $f[count($f)] = $b;\n               }\n               elseif((($e[$x] != $b) && ($e[$x + 1] == $c)) || (($e[$x] == $c) && ($e[$x + 1] != $b)))\n               {\n                    $f[count($f)] = $c;\n               }\n               elseif((($e[$x] != $b) && ($e[$x + 1] != $c)) || (($e[$x] != $c) && ($e[$x + 1] != $b)))\n               {\n                    $f[count($f)] = $e[$x];\n               }\n               $x++;\n          }\n          if($h == 0)\n          {\n               $e = $f;\n               $g++;\n          }\n          else\n          {\n               break;\n          }\n     }\n     print $g;\n}\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = $a / 2;\nif(($b <= $d) && ($c > $d))\n{\n     print \"Final!\";\n}\nelse\n{\n     $e = range(1, $a);\n     $g = 1;\n     $h = 0;\n     while(TRUE)\n     {\n          $f = array();\n          for($x = 0; $x < count($e) - 1; $x++)\n          {\n               if((($e[$x] == $b) && ($e[$x + 1] == $c)) || (($e[$x] == $c) && ($e[$x + 1] == $b)))\n               {\n                    $h = 1;\n                    break;\n               }\n               elseif((($e[$x] == $b) && ($e[$x + 1] != $c)) || (($e[$x] != $c) && ($e[$x + 1] == $b)))\n               {\n                    $f[count($f)] = $b;\n               }\n               elseif((($e[$x] != $b) && ($e[$x + 1] == $c)) || (($e[$x] == $c) && ($e[$x + 1] != $b)))\n               {\n                    $f[count($f)] = $c;\n               }\n               elseif((($e[$x] != $b) && ($e[$x + 1] != $c)) || (($e[$x] != $c) && ($e[$x + 1] != $b)))\n               {\n                    $f[count($f)] = $e[$x];\n               }\n               $x++;\n          }\n          if($h == 0)\n          {\n               $e = $f;\n               $g++;\n          }\n          else\n          {\n               break;\n          }\n     }\n     print $g;\n}\n?>"}], "src_uid": "a753bfa7bde157e108f34a28240f441f"}
{"nl": {"description": "Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desks. The lanes are numbered from 1 to n from the left to the right, the desks in a lane are numbered from 1 to m starting from the blackboard. Note that the lanes go perpendicularly to the blackboard, not along it (see picture).The organizers numbered all the working places from 1 to 2nm. The places are numbered by lanes (i.\u00a0e. all the places of the first lane go first, then all the places of the second lane, and so on), in a lane the places are numbered starting from the nearest to the blackboard (i.\u00a0e. from the first desk in the lane), at each desk, the place on the left is numbered before the place on the right.    The picture illustrates the first and the second samples. Santa Clause knows that his place has number k. Help him to determine at which lane at which desk he should sit, and whether his place is on the left or on the right!", "input_spec": "The only line contains three integers n, m and k (1\u2009\u2264\u2009n,\u2009m\u2009\u2264\u200910\u2009000, 1\u2009\u2264\u2009k\u2009\u2264\u20092nm)\u00a0\u2014 the number of lanes, the number of desks in each lane and the number of Santa Claus' place.", "output_spec": "Print two integers: the number of lane r, the number of desk d, and a character s, which stands for the side of the desk Santa Claus. The character s should be \"L\", if Santa Clause should sit on the left, and \"R\" if his place is on the right.", "sample_inputs": ["4 3 9", "4 3 24", "2 4 4"], "sample_outputs": ["2 2 L", "4 3 R", "1 2 R"], "notes": "NoteThe first and the second samples are shown on the picture. The green place corresponds to Santa Claus' place in the first example, the blue place corresponds to Santa Claus' place in the second example.In the third sample there are two lanes with four desks in each, and Santa Claus has the fourth place. Thus, his place is in the first lane at the second desk on the right."}, "positive_code": [{"source_code": "<?php\n    $a= explode(' ',trim(fgets(STDIN)));\n    \n    if(intval($a[2]/2) == ($a[2]/2))\n    {\n        $d = $a[2]/2;\n    }\n    else\n    {\n        $d = intval($a[2]/2) + 1;\n    }\n    \n    if(intval($d / $a[1]) == ($d / $a[1]))\n    {\n        $r = $d / $a[1];\n    }\n    else\n    {\n        $r = intval($d / $a[1]) + 1;\n    }\n    \n    if(intval($a[2]/2) == $a[2]/2)\n    {\n        $s = 'R';\n    }\n    else\n    {\n        $s = 'L';\n    }\n    $t = $d - (($r - 1) * $a[1]);\n    print $r.' '.$t.' '.$s;\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = $b * 2;\n$e = ceil($c / $d);\n$f = $e * $d - $d;\n$g = $c - $f;\n$h = ceil($g / 2);\n$i = $c % 2;\nif($i == 0)\n{\n     print $e . \" \" . $h . \" \" . \"R\";\n}\nelse\n{\n     print $e . \" \" . $h . \" \" . \"L\";\n}\n?>"}], "negative_code": [], "src_uid": "d6929926b44c2d5b1a8e6b7f965ca1bb"}
{"nl": {"description": "Unary is a minimalistic Brainfuck dialect in which programs are written using only one token. Brainfuck programs use 8 commands: \"+\", \"-\", \"[\", \"]\", \"&lt;\", \"&gt;\", \".\" and \",\" (their meaning is not important for the purposes of this problem). Unary programs are created from Brainfuck programs using the following algorithm. First, replace each command with a corresponding binary code, using the following conversion table:   \"&gt;\" \u2009\u2192\u2009 1000,  \"&lt;\" \u2009\u2192\u2009 1001,  \"+\" \u2009\u2192\u2009 1010,  \"-\" \u2009\u2192\u2009 1011,  \".\" \u2009\u2192\u2009 1100,  \",\" \u2009\u2192\u2009 1101,  \"[\" \u2009\u2192\u2009 1110,  \"]\" \u2009\u2192\u2009 1111. Next, concatenate the resulting binary codes into one binary number in the same order as in the program. Finally, write this number using unary numeral system \u2014 this is the Unary program equivalent to the original Brainfuck one.You are given a Brainfuck program. Your task is to calculate the size of the equivalent Unary program, and print it modulo 1000003 (106\u2009+\u20093).", "input_spec": "The input will consist of a single line p which gives a Brainfuck program. String p will contain between 1 and 100 characters, inclusive. Each character of p will be \"+\", \"-\", \"[\", \"]\", \"&lt;\", \"&gt;\", \".\" or \",\".", "output_spec": "Output the size of the equivalent Unary program modulo 1000003 (106\u2009+\u20093).", "sample_inputs": [",.", "++++[&gt;,.&lt;-]"], "sample_outputs": ["220", "61425"], "notes": "NoteTo write a number n in unary numeral system, one simply has to write 1 n times. For example, 5 written in unary system will be 11111.In the first example replacing Brainfuck commands with binary code will give us 1101 1100. After we concatenate the codes, we'll get 11011100 in binary system, or 220 in decimal. That's exactly the number of tokens in the equivalent Unary program."}, "positive_code": [{"source_code": "<?php\n$a = str_split(trim(fgets(STDIN)));\n$b = array(\">\", \"<\", \"+\", \"-\", \".\", \",\", \"[\", \"]\");\narray_unshift($b, \" \");\nunset($b[0]);\n$c = array(\"1000\", \"1001\", \"1010\", \"1011\", \"1100\", \"1101\", \"1110\", \"1111\");\narray_unshift($c, \" \");\nunset($c[0]);\n$d = \"\";\n$f = \"\";\nfor($x = 0; $x < count($a); $x++)\n{\n    $e = array_search($a[$x], $b);\n    $d .= $c[$e];\n}\n$e = str_split($d);\n$g = count($e) - 1;\nfor($x = 0; $x < count($e); $x++)\n{\n    if($e[$x] == \"1\")\n    {\n        $f = bcadd(bcpow(2, $g), $f);\n    }\n    $g--;\n}\nprint bcmod($f, \"1000003\");\n?>"}, {"source_code": "<?php\nfunction BCBin2Dec($Input='') {\n  $Output='0';\n  if(preg_match(\"/^[01]+$/\",$Input)) {\n    for($i=0;$i<strlen($Input);$i++)\n      $Output=BCAdd(BCMul($Output,'2'),$Input{$i});\n  }\n  return($Output);\n}\n\n$in = trim(fgets(STDIN));\n$s = array(\n    '>'=>'1000',\n    '<'=>'1001',\n    '+'=>'1010',\n    '-'=>'1011',\n    '.'=>'1100',\n    ','=>'1101',\n    '['=>'1110',\n    ']'=>'1111'\n);\n$key = array_keys($s);\n$val = array_values($s);\n$res = str_replace($key, $val, $in);\necho( bcmod(BCBin2Dec($res), (bcadd(bcpow(10,6),3))));\n"}, {"source_code": "<?\n$n=trim(fgets(STDIN));\n$n=(string)$n;\n$a[\">\"]=\"1000\";\n$a[\"<\"]=\"1001\";\n$a[\"+\"]=\"1010\";\n$a[\"-\"]=\"1011\";\n$a[\".\"]=\"1100\";\n$a[\",\"]=\"1101\";\n$a[\"[\"]=\"1110\";\n$a[\"]\"]=\"1111\";\n$s=\"\";\n$k=\"0\";\nfor ($i=0;$i<strlen($n);$i++) $s.=$a[$n[$i]];\nfor ($i=0;$i<strlen($s);$i++) $k=bcadd(bcmul($k,2),$s[$i]);\necho bcsub($k,bcmul(bcdiv($k,'1000003',0),1000003));\n?>"}, {"source_code": "<?php\n\tfunction gao($c)\n\t{\n\t\tswitch($c)\n\t\t{\n\t\t\tcase '>':\n\t\t\t\treturn \"8\";\n\t\t\tcase '<':\n\t\t\t\treturn \"9\";\n\t\t\tcase '+':\n\t\t\t\treturn \"10\";\n\t\t\tcase '-':\n\t\t\t\treturn \"11\";\n\t\t\tcase '.':\n\t\t\t\treturn \"12\";\n\t\t\tcase ',':\n\t\t\t\treturn \"13\";\n\t\t\tcase '[':\n\t\t\t\treturn \"14\";\n\t\t\tcase ']':\n\t\t\t\treturn \"15\";\n\t\t}\n\t}\n\tfunction check($c)\n\t{\n\t\treturn $c == '>' || $c == '<' || $c == '+' || $c == '-' || $c == '.' || $c == ',' || $c == '[' || $c == ']';\n\t}\n\t$stdin = fopen(\"php://stdin\", \"r\");\n\t$str = fgets($stdin);\n\t$len = strlen($str);\n\t$num = \"0\";\n\tfor($i = 0; $i < $len; $i++)\n\t{\n\t\tif(check($str[$i]))\n\t\t{\n\t\t\t$num = bcmul($num, \"16\");\n\t\t\t$num = bcadd($num, gao($str[$i]));\n\t\t}\n\t}\n\techo (bcmod($num, \"1000003\")).\"\\n\";\n?>\n"}], "negative_code": [{"source_code": "<?php\n$a = str_split(trim(fgets(STDIN)));\n$b = array(\">\", \"<\", \"+\", \"-\", \".\", \",\", \"[\", \"]\");\narray_unshift($b, \" \");\nunset($b[0]);\n$c = array(\"1000\", \"1001\", \"1010\", \"1011\", \"1100\", \"1101\", \"1110\", \"1111\");\narray_unshift($c, \" \");\nunset($c[0]);\n$d = \"\";\n$f = \"\";\nfor($x = 0; $x < count($a); $x++)\n{\n    $e = array_search($a[$x], $b);\n    $d .= $c[$e];\n}\n$e = str_split($d);\n$g = count($e) - 1;\nfor($x = 0; $x < count($e); $x++)\n{\n    if($e[$x] == \"1\")\n    {\n        $f += pow(2, $g);\n    }\n    $g--;\n}\nprint bcmod($f, \"1000003\");\n?>"}, {"source_code": "<?php\n$in = trim(fgets(STDIN));\n$s = array(\n    '>'=>'1000',\n    '<'=>'1001',\n    '+'=>'1010',\n    '-'=>'1011',\n    '.'=>'1100',\n    ','=>'1101',\n    '['=>'1110',\n    ']'=>'1111'\n);\n$key = array_keys($s);\n$val = array_values($s);\n$res = str_replace($key, $val, $in);\necho( bcmod(bindec($res), (bcadd(bcpow(10,6),3))));"}, {"source_code": "<?php\n\tfunction gao($c)\n\t{\n\t\tswitch($c)\n\t\t{\n\t\t\tcase '>':\n\t\t\t\treturn \"8\";\n\t\t\tcase '<':\n\t\t\t\treturn \"9\";\n\t\t\tcase '+':\n\t\t\t\treturn \"10\";\n\t\t\tcase '-':\n\t\t\t\treturn \"11\";\n\t\t\tcase '.':\n\t\t\t\treturn \"12\";\n\t\t\tcase ',':\n\t\t\t\treturn \"13\";\n\t\t\tcase '[':\n\t\t\t\treturn \"14\";\n\t\t\tcase ']':\n\t\t\t\treturn \"15\";\n\t\t}\n\t}\n\t$stdin = fopen(\"php://stdin\", \"r\");\n\t$str = fgets($stdin);\n\t$len = strlen($str);\n\t$num = \"0\";\n\tfor($i = 0; $i < $len-1; $i++)\n\t{\n\t\t$num = bcmul($num, \"16\");\n\t\t$num = bcadd($num, gao($str[$i]));\n\t}\n\techo (bcmod($num, \"1000003\")).\"\\n\";\n?>\n"}], "src_uid": "04fc8dfb856056f35d296402ad1b2da1"}
{"nl": {"description": "Two players are playing a game. First each of them writes an integer from 1 to 6, and then a dice is thrown. The player whose written number got closer to the number on the dice wins. If both payers have the same difference, it's a draw.The first player wrote number a, the second player wrote number b. How many ways to throw a dice are there, at which the first player wins, or there is a draw, or the second player wins?", "input_spec": "The single line contains two integers a and b (1\u2009\u2264\u2009a,\u2009b\u2009\u2264\u20096)\u00a0\u2014 the numbers written on the paper by the first and second player, correspondingly.", "output_spec": "Print three integers: the number of ways to throw the dice at which the first player wins, the game ends with a draw or the second player wins, correspondingly.", "sample_inputs": ["2 5", "2 4"], "sample_outputs": ["3 0 3", "2 1 3"], "notes": "NoteThe dice is a standard cube-shaped six-sided object with each side containing a number from 1 to 6, and where all numbers on all sides are distinct.You can assume that number a is closer to number x than number b, if |a\u2009-\u2009x|\u2009&lt;\u2009|b\u2009-\u2009x|."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = 0;\n$d = 0;\n$e = 0;\n$f = abs(6 - $a);\n$g = abs(6 - $b);\nif($f > $g)\n{\n    $c++;\n}\nelseif($f < $g)\n{\n    $d++;\n}\nelse\n{\n    $e++;\n}\n$f = abs(5 - $a);\n$g = abs(5 - $b);\nif($f > $g)\n{\n    $c++;\n}\nelseif($f < $g)\n{\n    $d++;\n}\nelse\n{\n    $e++;\n}\n$f = abs(4 - $a);\n$g = abs(4 - $b);\nif($f > $g)\n{\n    $c++;\n}\nelseif($f < $g)\n{\n    $d++;\n}\nelse\n{\n    $e++;\n}\n$f = abs(3 - $a);\n$g = abs(3 - $b);\nif($f > $g)\n{\n    $c++;\n}\nelseif($f < $g)\n{\n    $d++;\n}\nelse\n{\n    $e++;\n}\n$f = abs(2 - $a);\n$g = abs(2 - $b);\nif($f > $g)\n{\n    $c++;\n}\nelseif($f < $g)\n{\n    $d++;\n}\nelse\n{\n    $e++;\n}\n$f = abs(1 - $a);\n$g = abs(1 - $b);\nif($f > $g)\n{\n    $c++;\n}\nelseif($f < $g)\n{\n    $d++;\n}\nelse\n{\n    $e++;\n}\nprint $d . \" \" . $e . \" \" . $c;\n?>"}, {"source_code": "<?php\nfscanf (STDIN, \"%d %d\", $A, $B);\n$X = 0;\n$Y = 0;\n$Z = 0;\nfor ($i = 1; $i <= 6; $i++) {\n    if (abs ($A - $i) < abs ($B - $i)) {\n        $X = $X + 1;\n    }\n    if (abs ($A - $i) == abs ($B - $i)) {\n        $Y = $Y + 1;\n    }\n    if (abs ($A - $i) > abs ($B - $i)) {\n        $Z = $Z + 1;\n    }\n}\nprintf (\"%d %d %d\\n\", $X, $Y, $Z);\n?>"}, {"source_code": "<?php\n    fscanf( STDIN, \"%d %d\", $a, $b );\n    $x = 0;\n    $y = 0;\n    $z = 0;\n    for ( $i = 1; $i <= 6; $i++ ) {\n        if ( abs( $a - $i ) < abs( $b - $i ) ) {\n            $x = $x + 1;\n        }\n        if ( abs( $a - $i ) == abs( $b - $i ) ) {\n            $y = $y + 1;\n        }\n        if ( abs( $a - $i ) > abs( $b - $i ) ) {\n            $z = $z + 1;\n        }\n    }\n    printf ( \"%d %d %d\\n\", $x, $y, $z );\n?>"}, {"source_code": "<?php\n$f = fopen (\"php://stdin\", 'r' ) ;\n$a_win =0;\n$b_win =0;\n$draw =0;\n\n$lines = file(\"php://stdin\");\nfunction parseint($n){\n    return(intval($n));\n}\n\n$a_b = array_map(\"parseint\", explode(\" \",(strval($lines[0]))));\n\n for($i=1 ; $i<=6 ; $i++){\n     \n     if(abs($a_b[0] - $i ) < abs($a_b[1] - $i )){\n         $a_win++;\n         \n     }\n     elseif(abs($a_b[0] - $i ) > abs($a_b[1] - $i )){\n         $b_win++;\n         \n     }\n     else{\n         $draw++;\n         }\n     \n     \n     \n }\n \n print $a_win . \" \" . $draw . \" \" .$b_win ;\n\n?>"}, {"source_code": "<?php\n\n$f = fopen(\"php://stdin\", 'r');\nlist($a, $b) = fscanf($f, \"%d %d\");\nfclose($f);\n\n$result = array(0, 0, 0);\n\nfor ($j = 1; $j <= 6; $j++) {\n\tif (abs($a - $j) < abs($b - $j)) {\n\t\t$result[0]++;\n\t}\n\telseif (abs($a - $j) > abs($b - $j)) {\n\t\t$result[2]++;\n\t}\n\telseif (abs($a - $j) == abs($b - $j)) {\n\t\t$result[1]++;\n\t}\n\n}\n\nprint implode(' ', $result);\n"}, {"source_code": "<?php\n\nlist($a, $b) = explode(' ', getline());\n\n$a = intval($a);\n$b = intval($b);\n\n$winf = 0;\n$draw = 0;\n$wins = 0;\n\nfor ($i = 1; $i <= 6; $i ++) {\n  $diffa = abs($i - $a);\n  $diffb = abs($i - $b);\n  if ($diffa < $diffb) {\n    $winf ++;\n  } elseif ($diffa > $diffb) {\n    $wins ++;\n  } else {\n    $draw ++;\n  }\n}\n\nprint $winf . ' ' . $draw . ' ' . $wins;\n\nfunction getline() {\n  return trim(fgets(STDIN));\n}\n"}, {"source_code": "<?php\nerror_reporting(\"off\");\n//378A: Playing with Dice\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$awins = 0;\n$bwins = 0;\n$tie = 0;\nfor ($i = 1; $i <= 6; $i++) {\n    if (abs($a - $i) < abs($b - $i)) {\n        $awins++;\n    } elseif (abs($a - $i) > abs($b - $i)) {\n        $bwins++;\n    } else {\n        $tie++;\n    }\n}\n\necho $awins.\" \".$tie.\" \".$bwins;\n?>"}], "negative_code": [{"source_code": "<?php\nerror_reporting(\"off\");\n//378A: Playing with Dice\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$awins = 0;\n$bwins = 0;\n$tie = 0;\nfor ($i = 1; $i <= 6; $i++) {\n    if (abs($a - $x) < abs($b - $x)) {\n        $awins++;\n    } elseif (abs($a - $x) > abs($b - $x)) {\n        $bwins++;\n    } else {\n        $tie++;\n    }\n}\n\necho $awins.\" \".$tie.\" \".$bwins;\n?>"}], "src_uid": "504b8aae3a3abedf873a3b8b127c5dd8"}
{"nl": {"description": "Any resemblance to any real championship and sport is accidental.The Berland National team takes part in the local Football championship which now has a group stage. Let's describe the formal rules of the local championship:   the team that kicked most balls in the enemy's goal area wins the game;  the victory gives 3 point to the team, the draw gives 1 point and the defeat gives 0 points;  a group consists of four teams, the teams are ranked by the results of six games: each team plays exactly once with each other team;  the teams that get places 1 and 2 in the group stage results, go to the next stage of the championship. In the group stage the team's place is defined by the total number of scored points: the more points, the higher the place is. If two or more teams have the same number of points, then the following criteria are used (the criteria are listed in the order of falling priority, starting from the most important one):   the difference between the total number of scored goals and the total number of missed goals in the championship: the team with a higher value gets a higher place;  the total number of scored goals in the championship: the team with a higher value gets a higher place;  the lexicographical order of the name of the teams' countries: the country with the lexicographically smaller name gets a higher place. The Berland team plays in the group where the results of 5 out of 6 games are already known. To be exact, there is the last game left. There the Berand national team plays with some other team. The coach asks you to find such score X:Y (where X is the number of goals Berland scored and Y is the number of goals the opponent scored in the game), that fulfills the following conditions:   X &gt; Y, that is, Berland is going to win this game;  after the game Berland gets the 1st or the 2nd place in the group;  if there are multiple variants, you should choose such score X:Y, where value X\u2009-\u2009Y is minimum;  if it is still impossible to come up with one score, you should choose the score where value Y (the number of goals Berland misses) is minimum. ", "input_spec": "The input has five lines. Each line describes a game as \"team1 team2 goals1:goals2\" (without the quotes), what means that team team1 played a game with team team2, besides, team1 scored goals1 goals and team2 scored goals2 goals. The names of teams team1 and team2 are non-empty strings, consisting of uppercase English letters, with length of no more than 20 characters; goals1,\u2009goals2 are integers from 0 to 9.  The Berland team is called \"BERLAND\". It is guaranteed that the Berland team and one more team played exactly 2 games and the the other teams played exactly 3 games.", "output_spec": "Print the required score in the last game as X:Y, where X is the number of goals Berland scored and Y is the number of goals the opponent scored. If the Berland team does not get the first or the second place in the group, whatever this game's score is, then print on a single line \"IMPOSSIBLE\" (without the quotes). Note, that the result score can be very huge, 10:0 for example.", "sample_inputs": ["AERLAND DERLAND 2:1\nDERLAND CERLAND 0:3\nCERLAND AERLAND 0:1\nAERLAND BERLAND 2:0\nDERLAND BERLAND 4:0", "AERLAND DERLAND 2:2\nDERLAND CERLAND 2:3\nCERLAND AERLAND 1:3\nAERLAND BERLAND 2:1\nDERLAND BERLAND 4:1"], "sample_outputs": ["6:0", "IMPOSSIBLE"], "notes": "NoteIn the first sample \"BERLAND\" plays the last game with team \"CERLAND\". If Berland wins with score 6:0, the results' table looks like that in the end:   AERLAND (points: 9, the difference between scored and missed goals: 4, scored goals: 5)  BERLAND (points: 3, the difference between scored and missed goals: 0, scored goals: 6)  DERLAND (points: 3, the difference between scored and missed goals: 0, scored goals: 5)  CERLAND (points: 3, the difference between scored and missed goals: -4, scored goals: 3) In the second sample teams \"AERLAND\" and \"DERLAND\" have already won 7 and 4 points, respectively. The Berland team wins only 3 points, which is not enough to advance to the next championship stage."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e) = explode(\":\", $c);\nlist($a2, $b2, $c2) = explode(\" \", trim(fgets(STDIN)));\nlist($d2, $e2) = explode(\":\", $c2);\nlist($a3, $b3, $c3) = explode(\" \", trim(fgets(STDIN)));\nlist($d3, $e3) = explode(\":\", $c3);\nlist($a4, $b4, $c4) = explode(\" \", trim(fgets(STDIN)));\nlist($d4, $e4) = explode(\":\", $c4);\nlist($a5, $b5, $c5) = explode(\" \", trim(fgets(STDIN)));\nlist($d5, $e5) = explode(\":\", $c5);\n$f = array($a, $b, $a2, $b2, $a3, $b3, $a4, $b4, $a5, $b5);\n$g = array_unique($f);\nsort($g);\n$g2 = $g;\n$g3 = count($g2);\nfor($x = 0; $x < $g3; $x++)\n{\n    $g4 = 0;\n    for($y = 0; $y < count($f); $y++)\n    {\n        if($g2[$x] == $f[$y])\n        {\n            $g4++;\n            if($g4 == 3)\n            {\n                unset($g2[$x]);\n                break;\n            }\n        }\n    }\n}\nsort($g2);\nfor($y = 0; $y < count($g2); $y++)\n{\n    if($g2[$y] == \"BERLAND\")\n    {\n        array_splice($g2, $y, 1);\n        break;\n    }\n}\nfor($x = 0; $x < count($g); $x++)\n{\n    if($g[$x] == \"BERLAND\")\n    {\n        $ber = $x;\n    }\n    if($g[$x] == $g2[0])\n    {\n        $reb = $x;\n    }\n}\n$h = array(\"0\", \"0\", \"0\", \"0\");\n$i = array(\"0\", \"0\", \"0\", \"0\");\n$j = array(\"0\", \"0\", \"0\", \"0\");\nif($d > $e)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a)\n        {\n            $h[$x] += 3;\n            $i[$x] += $d;\n            $j[$x] += $e;\n        }\n        if($g[$x] == $b)\n        {\n            $i[$x] += $e;\n            $j[$x] += $d;\n        }\n    }\n}\nelseif($d == $e)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a)\n        {\n            $h[$x] += 1;\n            $i[$x] += $d;\n            $j[$x] += $e;\n        }\n        if($g[$x] == $b)\n        {\n            $h[$x] += 1;\n            $i[$x] += $e;\n            $j[$x] += $d;\n        }\n    }\n}\nelseif($d < $e)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a)\n        {\n            $i[$x] += $d;\n            $j[$x] += $e;\n        }\n        if($g[$x] == $b)\n        {\n            $h[$x] += 3;\n            $i[$x] += $e;\n            $j[$x] += $d;\n        }\n    }\n}\nif($d2 > $e2)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a2)\n        {\n            $h[$x] += 3;\n            $i[$x] += $d2;\n            $j[$x] += $e2;\n        }\n        if($g[$x] == $b2)\n        {\n            $i[$x] += $e2;\n            $j[$x] += $d2;\n        }\n    }\n}\nelseif($d2 == $e2)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a2)\n        {\n            $h[$x] += 1;\n            $i[$x] += $d2;\n            $j[$x] += $e2;\n        }\n        if($g[$x] == $b2)\n        {\n            $h[$x] += 1;\n            $i[$x] += $e2;\n            $j[$x] += $d2;\n        }\n    }\n}\nelseif($d2 < $e2)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a2)\n        {\n            $i[$x] += $d2;\n            $j[$x] += $e2;\n        }\n        if($g[$x] == $b2)\n        {\n            $h[$x] += 3;\n            $i[$x] += $e2;\n            $j[$x] += $d2;\n        }\n    }\n}\nif($d3 > $e3)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a3)\n        {\n            $h[$x] += 3;\n            $i[$x] += $d3;\n            $j[$x] += $e3;\n        }\n        if($g[$x] == $b3)\n        {\n            $i[$x] += $e3;\n            $j[$x] += $d3;\n        }\n    }\n}\nelseif($d3 == $e3)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a3)\n        {\n            $h[$x] += 1;\n            $i[$x] += $d3;\n            $j[$x] += $e3;\n        }\n        if($g[$x] == $b)\n        {\n            $h[$x] += 1;\n            $i[$x] += $e3;\n            $j[$x] += $d3;\n        }\n    }\n}\nelseif($d3 < $e3)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a3)\n        {\n            $i[$x] += $d3;\n            $j[$x] += $e3;\n        }\n        if($g[$x] == $b3)\n        {\n            $h[$x] += 3;\n            $i[$x] += $e3;\n            $j[$x] += $d3;\n        }\n    }\n}\nif($d4 > $e4)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a4)\n        {\n            $h[$x] += 3;\n            $i[$x] += $d4;\n            $j[$x] += $e4;\n        }\n        if($g[$x] == $b4)\n        {\n            $i[$x] += $e4;\n            $j[$x] += $d4;\n        }\n    }\n}\nelseif($d4 == $e4)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a4)\n        {\n            $h[$x] += 1;\n            $i[$x] += $d4;\n            $j[$x] += $e4;\n        }\n        if($g[$x] == $b4)\n        {\n            $h[$x] += 1;\n            $i[$x] += $e4;\n            $j[$x] += $d4;\n        }\n    }\n}\nelseif($d4 < $e4)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a4)\n        {\n            $i[$x] += $d4;\n            $j[$x] += $e4;\n        }\n        if($g[$x] == $b4)\n        {\n            $h[$x] += 3;\n            $i[$x] += $e4;\n            $j[$x] += $d4;\n        }\n    }\n}\nif($d5 > $e5)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a5)\n        {\n            $h[$x] += 3;\n            $i[$x] += $d5;\n            $j[$x] += $e5;\n        }\n        if($g[$x] == $b5)\n        {\n            $i[$x] += $e5;\n            $j[$x] += $d5;\n        }\n    }\n}\nelseif($d5 == $e5)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a5)\n        {\n            $h[$x] += 1;\n            $i[$x] += $d5;\n            $j[$x] += $e5;\n        }\n        if($g[$x] == $b5)\n        {\n            $h[$x] += 1;\n            $i[$x] += $e5;\n            $j[$x] += $d5;\n        }\n    }\n}\nelseif($d5 < $e5)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a5)\n        {\n            $i[$x] += $d5;\n            $j[$x] += $e5;\n        }\n        if($g[$x] == $b5)\n        {\n            $h[$x] += 3;\n            $i[$x] += $e5;\n            $j[$x] += $d5;\n        }\n    }\n}\nfor($x = 0; $x < 4; $x++)\n{\n    if($g[$x] == \"BERLAND\")\n    {\n        break;\n    }\n}\n$k = $h[$x] + 3;\n$l = $h;\nrsort($l);\nif($l[1] > $k)\n{\n    print \"IMPOSSIBLE\";\n}\nelse\n{  \n    $m = array();\n    $n = array();\n    $o = array();\n    $h[$ber] += 3;\n    for($w = 0; $w <= 50; $w++)\n    {\n        for($x = 0; $x < $w; $x++)\n        {\n            $g2 = $g;\n            $h2 = $h;\n            $i2 = $i;\n            $j2 = $j;\n            $i2[$ber] = $i[$ber] + $w;\n            $i2[$reb] = $i[$reb] + $x;\n            $j2[$ber] = $j[$ber] + $x;\n            $j2[$reb] = $j[$reb] + $w;\n            for($y = 0; $y < 4; $y++)\n            {\n                for($z = 0; $z < 4; $z++)\n                {\n                    if(($i2[$y] > $i2[$z]) && ($y > $z))\n                    {\n                        $p = $g2[$y];\n                        $r = $g2[$z];\n                        array_splice($g2, $y, 1);\n                        array_splice($g2, $z, 1, array($p, $r));\n                        $p = $h2[$y];\n                        $r = $h2[$z];\n                        array_splice($h2, $y, 1);\n                        array_splice($h2, $z, 1, array($p, $r));\n                        $p = $i2[$y];\n                        $r = $i2[$z];\n                        array_splice($i2, $y, 1);\n                        array_splice($i2, $z, 1, array($p, $r));\n                        $p = $j2[$y];\n                        $r = $j2[$z];\n                        array_splice($j2, $y, 1);\n                        array_splice($j2, $z, 1, array($p, $r));\n                    }\n                }\n             }\n             for($y = 0; $y < 4; $y++)\n             {\n                for($z = 0; $z < 4; $z++)\n                {\n                    if((($i2[$y] - $j2[$y]) > ($i2[$z] - $j2[$z])) && ($y > $z))\n                    {\n                        $p = $g2[$y];\n                        $r = $g2[$z];\n                        array_splice($g2, $y, 1);\n                        array_splice($g2, $z, 1, array($p, $r));\n                        $p = $h2[$y];\n                        $r = $h2[$z];\n                        array_splice($h2, $y, 1);\n                        array_splice($h2, $z, 1, array($p, $r));\n                        $p = $i2[$y];\n                        $r = $i2[$z];\n                        array_splice($i2, $y, 1);\n                        array_splice($i2, $z, 1, array($p, $r));\n                        $p = $j2[$y];\n                        $r = $j2[$z];\n                        array_splice($j2, $y, 1);\n                        array_splice($j2, $z, 1, array($p, $r));\n                    }\n                }\n             }\n             for($y = 0; $y < 4; $y++)\n             {\n                for($z = 0; $z < 4; $z++)\n                {\n                    if(($h2[$y] > $h2[$z]) && ($y > $z))\n                    {\n                        $p = $g2[$y];\n                        $r = $g2[$z];\n                        array_splice($g2, $y, 1);\n                        array_splice($g2, $z, 1, array($p, $r));\n                        $p = $h2[$y];\n                        $r = $h2[$z];\n                        array_splice($h2, $y, 1);\n                        array_splice($h2, $z, 1, array($p, $r));\n                        $p = $i2[$y];\n                        $r = $i2[$z];\n                        array_splice($i2, $y, 1);\n                        array_splice($i2, $z, 1, array($p, $r));\n                        $p = $j2[$y];\n                        $r = $j2[$z];\n                        array_splice($j2, $y, 1);\n                        array_splice($j2, $z, 1, array($p, $r));\n                    }\n                }\n            }\n            if(($g2[0] == \"BERLAND\") || ($g2[1] == \"BERLAND\"))\n            {\n                array_push($m, $w);\n                array_push($n, $x);\n                array_push($o, $w - $x);\n            }\n        }\n    }\n    $s = min($o);\n    $t = array();\n    $v = array();\n    for($x = 0; $x < count($o); $x++)\n    {\n        if($o[$x] == $s)\n        {\n            $t[$x] = $n[$x];\n            $v[$x] = 1;\n        }\n    }\n    $u = min($t);\n    for($x = 0; $x < count($o); $x++)\n    {\n        if(($n[$x] == $u) && ($v[$x] == TRUE))\n        {\n            break;\n        }\n    }\n    print $m[$x] . \":\" . $n[$x];\n}\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e) = explode(\":\", $c);\nlist($a2, $b2, $c2) = explode(\" \", trim(fgets(STDIN)));\nlist($d2, $e2) = explode(\":\", $c2);\nlist($a3, $b3, $c3) = explode(\" \", trim(fgets(STDIN)));\nlist($d3, $e3) = explode(\":\", $c3);\nlist($a4, $b4, $c4) = explode(\" \", trim(fgets(STDIN)));\nlist($d4, $e4) = explode(\":\", $c4);\nlist($a5, $b5, $c5) = explode(\" \", trim(fgets(STDIN)));\nlist($d5, $e5) = explode(\":\", $c5);\n$f = array($a, $b, $a2, $b2, $a3, $b3, $a4, $b4, $a5, $b5);\n$g = array_unique($f);\nsort($g);\n$g2 = $g;\n$g3 = count($g2);\nfor($x = 0; $x < $g3; $x++)\n{\n    $g4 = 0;\n    for($y = 0; $y < count($f); $y++)\n    {\n        if($g2[$x] == $f[$y])\n        {\n            $g4++;\n            if($g4 == 3)\n            {\n                array_splice($g2, $x, 1);\n                break;\n            }\n        }\n    }\n}\nfor($y = 0; $y < count($g2); $y++)\n{\n    if($g2[$y] == \"BERLAND\")\n    {\n        array_splice($g2, $y, 1);\n        break;\n    }\n}\nfor($x = 0; $x < count($g); $x++)\n{\n    if($g[$x] == \"BERLAND\")\n    {\n        $ber = $x;\n    }\n    if($g[$x] == $g2[0])\n    {\n        $reb = $x;\n    }\n}\n$h = array(\"0\", \"0\", \"0\", \"0\");\n$i = array(\"0\", \"0\", \"0\", \"0\");\n$j = array(\"0\", \"0\", \"0\", \"0\");\nif($d > $e)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a)\n        {\n            $h[$x] += 3;\n            $i[$x] += $d;\n            $j[$x] += $e;\n        }\n        if($g[$x] == $b)\n        {\n            $i[$x] += $e;\n            $j[$x] += $d;\n        }\n    }\n}\nelseif($d == $e)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a)\n        {\n            $h[$x] += 1;\n            $i[$x] += $d;\n            $j[$x] += $e;\n        }\n        if($g[$x] == $b)\n        {\n            $h[$x] += 1;\n            $i[$x] += $e;\n            $j[$x] += $d;\n        }\n    }\n}\nelseif($d < $e)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a)\n        {\n            $i[$x] += $d;\n            $j[$x] += $e;\n        }\n        if($g[$x] == $b)\n        {\n            $h[$x] += 3;\n            $i[$x] += $e;\n            $j[$x] += $d;\n        }\n    }\n}\nif($d2 > $e2)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a2)\n        {\n            $h[$x] += 3;\n            $i[$x] += $d2;\n            $j[$x] += $e2;\n        }\n        if($g[$x] == $b2)\n        {\n            $i[$x] += $e2;\n            $j[$x] += $d2;\n        }\n    }\n}\nelseif($d2 == $e2)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a2)\n        {\n            $h[$x] += 1;\n            $i[$x] += $d2;\n            $j[$x] += $e2;\n        }\n        if($g[$x] == $b2)\n        {\n            $h[$x] += 1;\n            $i[$x] += $e2;\n            $j[$x] += $d2;\n        }\n    }\n}\nelseif($d2 < $e2)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a2)\n        {\n            $i[$x] += $d2;\n            $j[$x] += $e2;\n        }\n        if($g[$x] == $b2)\n        {\n            $h[$x] += 3;\n            $i[$x] += $e2;\n            $j[$x] += $d2;\n        }\n    }\n}\nif($d3 > $e3)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a3)\n        {\n            $h[$x] += 3;\n            $i[$x] += $d3;\n            $j[$x] += $e3;\n        }\n        if($g[$x] == $b3)\n        {\n            $i[$x] += $e3;\n            $j[$x] += $d3;\n        }\n    }\n}\nelseif($d3 == $e3)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a3)\n        {\n            $h[$x] += 1;\n            $i[$x] += $d3;\n            $j[$x] += $e3;\n        }\n        if($g[$x] == $b)\n        {\n            $h[$x] += 1;\n            $i[$x] += $e3;\n            $j[$x] += $d3;\n        }\n    }\n}\nelseif($d3 < $e3)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a3)\n        {\n            $i[$x] += $d3;\n            $j[$x] += $e3;\n        }\n        if($g[$x] == $b3)\n        {\n            $h[$x] += 3;\n            $i[$x] += $e3;\n            $j[$x] += $d3;\n        }\n    }\n}\nif($d4 > $e4)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a4)\n        {\n            $h[$x] += 3;\n            $i[$x] += $d4;\n            $j[$x] += $e4;\n        }\n        if($g[$x] == $b4)\n        {\n            $i[$x] += $e4;\n            $j[$x] += $d4;\n        }\n    }\n}\nelseif($d4 == $e4)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a4)\n        {\n            $h[$x] += 1;\n            $i[$x] += $d4;\n            $j[$x] += $e4;\n        }\n        if($g[$x] == $b4)\n        {\n            $h[$x] += 1;\n            $i[$x] += $e4;\n            $j[$x] += $d4;\n        }\n    }\n}\nelseif($d4 < $e4)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a4)\n        {\n            $i[$x] += $d4;\n            $j[$x] += $e4;\n        }\n        if($g[$x] == $b4)\n        {\n            $h[$x] += 3;\n            $i[$x] += $e4;\n            $j[$x] += $d4;\n        }\n    }\n}\nif($d5 > $e5)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a5)\n        {\n            $h[$x] += 3;\n            $i[$x] += $d5;\n            $j[$x] += $e5;\n        }\n        if($g[$x] == $b5)\n        {\n            $i[$x] += $e5;\n            $j[$x] += $d5;\n        }\n    }\n}\nelseif($d5 == $e5)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a5)\n        {\n            $h[$x] += 1;\n            $i[$x] += $d5;\n            $j[$x] += $e5;\n        }\n        if($g[$x] == $b5)\n        {\n            $h[$x] += 1;\n            $i[$x] += $e5;\n            $j[$x] += $d5;\n        }\n    }\n}\nelseif($d5 < $e5)\n{\n    for($x = 0; $x < 4; $x++)\n    {\n        if($g[$x] == $a5)\n        {\n            $i[$x] += $d5;\n            $j[$x] += $e5;\n        }\n        if($g[$x] == $b5)\n        {\n            $h[$x] += 3;\n            $i[$x] += $e5;\n            $j[$x] += $d5;\n        }\n    }\n}\nfor($x = 0; $x < 4; $x++)\n{\n    if($g[$x] == \"BERLAND\")\n    {\n        break;\n    }\n}\n$k = $h[$x] + 3;\n$l = $h;\nrsort($l);\nif($l[1] > $k)\n{\n    print \"IMPOSSIBLE\";\n}\nelse\n{  \n    $m = array();\n    $n = array();\n    $o = array();\n    $h[$ber] += 3;\n    for($w = 0; $w <= 50; $w++)\n    {\n        for($x = 0; $x < $w; $x++)\n        {\n            $g2 = $g;\n            $h2 = $h;\n            $i2 = $i;\n            $j2 = $j;\n            $i2[$ber] = $i[$ber] + $w;\n            $i2[$reb] = $i[$reb] + $x;\n            $j2[$ber] = $j[$ber] + $x;\n            $j2[$reb] = $j[$reb] + $w;\n            for($y = 0; $y < 4; $y++)\n            {\n                for($z = 0; $z < 4; $z++)\n                {\n                    if(($i2[$y] > $i2[$z]) && ($y > $z))\n                    {\n                        $p = $g2[$y];\n                        $r = $g2[$z];\n                        array_splice($g2, $y, 1);\n                        array_splice($g2, $z, 1, array($p, $r));\n                        $p = $h2[$y];\n                        $r = $h2[$z];\n                        array_splice($h2, $y, 1);\n                        array_splice($h2, $z, 1, array($p, $r));\n                        $p = $i2[$y];\n                        $r = $i2[$z];\n                        array_splice($i2, $y, 1);\n                        array_splice($i2, $z, 1, array($p, $r));\n                        $p = $j2[$y];\n                        $r = $j2[$z];\n                        array_splice($j2, $y, 1);\n                        array_splice($j2, $z, 1, array($p, $r));\n                    }\n                }\n             }\n             for($y = 0; $y < 4; $y++)\n             {\n                for($z = 0; $z < 4; $z++)\n                {\n                    if((($i2[$y] - $j2[$y]) > ($i2[$z] - $j2[$z])) && ($y > $z))\n                    {\n                        $p = $g2[$y];\n                        $r = $g2[$z];\n                        array_splice($g2, $y, 1);\n                        array_splice($g2, $z, 1, array($p, $r));\n                        $p = $h2[$y];\n                        $r = $h2[$z];\n                        array_splice($h2, $y, 1);\n                        array_splice($h2, $z, 1, array($p, $r));\n                        $p = $i2[$y];\n                        $r = $i2[$z];\n                        array_splice($i2, $y, 1);\n                        array_splice($i2, $z, 1, array($p, $r));\n                        $p = $j2[$y];\n                        $r = $j2[$z];\n                        array_splice($j2, $y, 1);\n                        array_splice($j2, $z, 1, array($p, $r));\n                    }\n                }\n             }\n             for($y = 0; $y < 4; $y++)\n             {\n                for($z = 0; $z < 4; $z++)\n                {\n                    if(($h2[$y] > $h2[$z]) && ($y > $z))\n                    {\n                        $p = $g2[$y];\n                        $r = $g2[$z];\n                        array_splice($g2, $y, 1);\n                        array_splice($g2, $z, 1, array($p, $r));\n                        $p = $h2[$y];\n                        $r = $h2[$z];\n                        array_splice($h2, $y, 1);\n                        array_splice($h2, $z, 1, array($p, $r));\n                        $p = $i2[$y];\n                        $r = $i2[$z];\n                        array_splice($i2, $y, 1);\n                        array_splice($i2, $z, 1, array($p, $r));\n                        $p = $j2[$y];\n                        $r = $j2[$z];\n                        array_splice($j2, $y, 1);\n                        array_splice($j2, $z, 1, array($p, $r));\n                    }\n                }\n            }\n            if(($g2[0] == \"BERLAND\") || ($g2[1] == \"BERLAND\"))\n            {\n                array_push($m, $w);\n                array_push($n, $x);\n                array_push($o, $w - $x);\n            }\n        }\n    }\n    $s = min($o);\n    $t = array();\n    $v = array();\n    for($x = 0; $x < count($o); $x++)\n    {\n        if($o[$x] == $s)\n        {\n            $t[$x] = $n[$x];\n            $v[$x] = 1;\n        }\n    }\n    $u = min($t);\n    for($x = 0; $x < count($o); $x++)\n    {\n        if(($n[$x] == $u) && ($v[$x] == TRUE))\n        {\n            break;\n        }\n    }\n    print $m[$x] . \":\" . $n[$x];\n}\n?>"}], "src_uid": "5033d51c67b7ae0b1a2d9fd292fdced1"}
{"nl": {"description": "InputThe input contains a single integer $$$a$$$ ($$$0 \\le a \\le 63$$$).OutputOutput a single number.ExamplesInput\n2\nOutput\n2\nInput\n5\nOutput\n24\nInput\n35\nOutput\n50\n", "input_spec": "The input contains a single integer $$$a$$$ ($$$0 \\le a \\le 63$$$).", "output_spec": "Output a single number.", "sample_inputs": ["2", "5", "35"], "sample_outputs": ["2", "24", "50"], "notes": null}, "positive_code": [{"source_code": "<?php\nfunction solve($ok){\n    //...And after happily lived ever they\n    //...And they lived happily ever after\n    $x=readLine();\n    $ans=0;\n    if($x>=32){\n        $ans+=32;\n        $x-=32;\n    }\n    if($x>=16){\n        $ans+=1;\n        $x-=16;\n    }\n    if($x>=8){\n        $ans+=4;\n        $x-=8;\n    }\n    if($x>=4){\n        $ans+=8;\n        $x-=4;\n    }\n    if($x>=2){\n        $ans+=2;\n        $x-=2;\n    }\n    if($x>=1){\n        $ans+=16;\n        $x-=1;\n    }\n    print $ans;\n    \n}\nfunction main(){\n    $t=1;\n    //$t=readLine();\n    for($i=0;$i<$t;$i++){\n        solve($i);\n    }\n}\nmain();\n?>"}], "negative_code": [{"source_code": "<?php\nfunction solve(){\n    $x=readLine();\n    $ans;\n    if($x>=32){\n        $ans+=32;\n        $x-=32;\n    }\n    if($x>=16){\n        $ans+=1;\n        $x-=16;\n    }\n    if($x>=8){\n        $ans+=4;\n        $x-=8;\n    }\n    if($x>=4){\n        $ans+=8;\n        $x-=4;\n    }\n    if($x>=2){\n        $ans+=2;\n        $x-=2;\n    }\n    if($x>=1){\n        $ans+=16;\n        $x-=1;\n    }\n    print $ans;\n    \n}\nfunction main(){\n    $t=1;\n    //$t=readLine();\n    for($i=0;$i<$t;$i++){\n        solve();\n    }\n}\nmain();\n?>"}], "src_uid": "db5e54f466e1f3d69a51ea0b346e667c"}
{"nl": {"description": "Statistics claims that students sleep no more than three hours a day. But even in the world of their dreams, while they are snoring peacefully, the sense of impending doom is still upon them.A poor student is dreaming that he is sitting the mathematical analysis exam. And he is examined by the most formidable professor of all times, a three times Soviet Union Hero, a Noble Prize laureate in student expulsion, venerable Petr Palych.The poor student couldn't answer a single question. Thus, instead of a large spacious office he is going to apply for a job to thorium mines. But wait a minute! Petr Palych decided to give the student the last chance! Yes, that is possible only in dreams. So the professor began: \"Once a Venusian girl and a Marsian boy met on the Earth and decided to take a walk holding hands. But the problem is the girl has al fingers on her left hand and ar fingers on the right one. The boy correspondingly has bl and br fingers. They can only feel comfortable when holding hands, when no pair of the girl's fingers will touch each other. That is, they are comfortable when between any two girl's fingers there is a boy's finger. And in addition, no three fingers of the boy should touch each other. Determine if they can hold hands so that the both were comfortable.\"The boy any the girl don't care who goes to the left and who goes to the right. The difference is only that if the boy goes to the left of the girl, he will take her left hand with his right one, and if he goes to the right of the girl, then it is vice versa.", "input_spec": "The first line contains two positive integers not exceeding 100. They are the number of fingers on the Venusian girl's left and right hand correspondingly. The second line contains two integers not exceeding 100. They are the number of fingers on the Marsian boy's left and right hands correspondingly.", "output_spec": "Print YES or NO, that is, the answer to Petr Palych's question.", "sample_inputs": ["5 1\n10 5", "4 5\n3 3", "1 2\n11 6"], "sample_outputs": ["YES", "YES", "NO"], "notes": "NoteThe boy and the girl don't really care who goes to the left."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\nlist($c, $d) = explode(\" \", trim(fgets(STDIN)));\nif(($a == 1) && ($d <= 4))\n{\n     print \"YES\";\n}\nelseif(($b == 1) && ($c <= 4))\n{\n     print \"YES\";\n}\nelseif(($c == 1) && ($b <= 2))\n{\n     print \"YES\";\n}\nelseif(($d == 1) && ($a <= 2))\n{\n     print \"YES\";\n}\nelse\n{\n     $e = $a;\n     $e++;\n     $f = $e * 2;\n     if(($d >= $e - 2) && ($d <= $f))\n     {\n          print \"YES\";\n     }\n     else\n     {\n          $g = $b;\n          $g++;\n          $h = $g * 2;\n          if(($c >= $g - 2) && ($c <= $h))\n          {\n               print \"YES\";\n          }\n          else\n          {\n               print \"NO\";\n          }\n     }\n}\n?>"}, {"source_code": "<?php\n$handle = fopen (\"php://stdin\",\"r\");\n$lines = array();\n$lines[0] = fgets($handle);\n$lines[1] = fgets($handle);\nfclose($handle);\n\n$v_girl_fingers = explode(\" \", $lines[0]);\n$m_boy_fingers = explode(\" \", $lines[1]);\n\nfor( $i = 0; $i < 2; $i++ ) {\n\t$v_girl_finger = (int)$v_girl_fingers[$i];\n\t$m_boy_finger = (int)$m_boy_fingers[1-$i];\n\n#\tvar_dump($v_girl_finger);\n#\tvar_dump($m_boy_finger);\n#\tvar_dump('===================');\n\tif ( $v_girl_finger >= (ceil($m_boy_finger/2)-1) && $v_girl_finger <= ($m_boy_finger + 1) ) {\n\t\techo \"YES\";\n\t\texit(0);\n\t}\n}\n\necho \"NO\";\nexit(0);\n"}, {"source_code": "<?\n$g=explode(' ',trim(fgets(STDIN)));\n$b=explode(' ',trim(fgets(STDIN)));\n$p1=2*$g[0]+2;\n$p2=2*$g[1]+2;\nif(($b[1]<=$p1 && $b[1]>=$g[0]-1) || ($b[0]<=$p2 && $b[0]>=$g[1]-1)) echo \"YES\";\nelse echo \"NO\"; \n?>"}, {"source_code": "<?php\nlist($al, $ar) = explode(' ',trim(fgets(STDIN)));\nlist($bl, $br) = explode(' ',trim(fgets(STDIN)));\n\nif((($bl - 2) / $ar <= 2 && $ar - $bl <= 1 ) || (($br - 2) / $al <= 2 && $al - $br <= 1 ))\n print 'YES'; else print 'NO';\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\nlist($c, $d) = explode(\" \", trim(fgets(STDIN)));\n$e = max($a, $d);\n$f = max($c, $b);\n$g = min($a, $d);\n$h = min($c, $b);\nif((($e - $g) <= 1) || (($f - $h) <= 1))\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\nlist($c, $d) = explode(\" \", trim(fgets(STDIN)));\n$e = ceil($d / 2);\n$f = ceil($c / 2);\nif(($a == $e + 1) || ($a == $e - 1) || ($a == $d - 1) || ($a == $d + 1) || ($a == $d))\n{\n    print \"YES\";\n}\nelseif(($b == $f + 1) || ($b == $f - 1) || ($b == $c - 1) || ($b == $c + 1) || ($b == $c))\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\nlist($c, $d) = explode(\" \", trim(fgets(STDIN)));\n$e = $a;\n$e--;\n$f = $e * 2;\n$g = $b;\n$g--;\n$h = $g * 2;\nif($a > 1)\n{\n     if($d <= $f)\n     {\n          print \"YES\";\n     }\n     else\n     {\n          if($b > 1)\n          {\n               if($c <= $h)\n               {\n                    print \"YES\";\n               }\n               else\n               {\n                    print \"NO\";\n               }\n          }\n     }\n}\nelse\n{\n     if($b > 1)\n     {\n          if($c <= $h)\n          {\n               print \"YES\";\n          }\n          else\n          {\n               print \"NO\";\n          }\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\n?>"}, {"source_code": "<?php\n\n$lines = explode(\"\\n\", $argv[1]);\n$v_girl_fingers = explode(\" \", $lines[0]);\n$m_boy_fingers = explode(\" \", $lines[1]);\n\nfor( $i = 0; $i < 2; $i++ ) {\n\t$v_girl_finger = $v_girl_fingers[$i];\n\t$m_boy_finger = $m_boy_fingers[1-$i];\n\n#\tvar_dump($v_girl_finger);\n#\tvar_dump($m_boy_finger);\n#\tvar_dump('===================');\n\tif ( ($v_girl_finger > $m_boy_finger - 2 && $v_girl_finger <= $m_boy_finger + 1) \n\t  && ($m_boy_finger < $v_girl_finger + 1 && $m_boy_finger >= $v_girl_finger - 1 ) ) {\n\t\techo \"YES\";\n\t\texit(0);\n\t}\n}\n\necho \"NO\";\nexit(0);\n"}, {"source_code": "<?php\n var_dump($argv);\n$lines = explode(\"\\n\", $argv[1]);\n$v_girl_fingers = explode(\" \", $lines[0]);\n$m_boy_fingers = explode(\" \", $lines[1]);\n\nfor( $i = 0; $i < 2; $i++ ) {\n\t$v_girl_finger = $v_girl_fingers[$i];\n\t$m_boy_finger = $m_boy_fingers[1-$i];\n\n#\tvar_dump($v_girl_finger);\n#\tvar_dump($m_boy_finger);\n#\tvar_dump('===================');\n\tif ( ($v_girl_finger > $m_boy_finger - 2 && $v_girl_finger <= $m_boy_finger + 1) \n\t  && ($m_boy_finger < $v_girl_finger + 1 && $m_boy_finger >= $v_girl_finger - 1 ) ) {\n\t\techo \"YES\";\n\t\texit(0);\n\t}\n}\n\necho \"NO\";\nexit(0);\n"}, {"source_code": "<?php\n$handle = fopen (\"php://stdin\",\"r\");\n$lines = array();\n$lines[0] = fgets($handle);\n$lines[1] = fgets($handle);\nfclose($handle);\n\n$v_girl_fingers = explode(\" \", $lines[0]);\n$m_boy_fingers = explode(\" \", $lines[1]);\n\nfor( $i = 0; $i < 2; $i++ ) {\n\t$v_girl_finger = (int)$v_girl_fingers[$i];\n\t$m_boy_finger = (int)$m_boy_fingers[1-$i];\n\n#\tvar_dump($v_girl_finger);\n#\tvar_dump($m_boy_finger);\n#\tvar_dump('===================');\n\tif ( ($v_girl_finger >= $m_boy_finger - 2 && $v_girl_finger <= $m_boy_finger + 1) \n\t  && ($m_boy_finger <= $v_girl_finger + 1 && $m_boy_finger >= $v_girl_finger - 1 ) ) {\n\t\techo \"YES\";\n\t\texit(0);\n\t}\n}\n\necho \"NO\";\nexit(0);\n"}, {"source_code": "<?php\n$handle = fopen (\"php://stdin\",\"r\");\n$lines = array();\n$lines[0] = fgets($handle);\n$lines[1] = fgets($handle);\nfclose($handle);\n\n$v_girl_fingers = explode(\" \", $lines[0]);\n$m_boy_fingers = explode(\" \", $lines[1]);\n\nfor( $i = 0; $i < 2; $i++ ) {\n\t$v_girl_finger = $v_girl_fingers[$i];\n\t$m_boy_finger = $m_boy_fingers[1-$i];\n\n#\tvar_dump($v_girl_finger);\n#\tvar_dump($m_boy_finger);\n#\tvar_dump('===================');\n\tif ( ($v_girl_finger > $m_boy_finger - 2 && $v_girl_finger <= $m_boy_finger + 1) \n\t  && ($m_boy_finger < $v_girl_finger + 1 && $m_boy_finger >= $v_girl_finger - 1 ) ) {\n\t\techo \"YES\";\n\t\texit(0);\n\t}\n}\n\necho \"NO\";\nexit(0);\n"}, {"source_code": "<?php\n$handle = fopen (\"php://stdin\",\"r\");\n$lines = array();\n$lines[0] = fgets($handle);\n$lines[1] = fgets($handle);\nfclose($handle);\n\n$v_girl_fingers = explode(\" \", $lines[0]);\n$m_boy_fingers = explode(\" \", $lines[1]);\n\nfor( $i = 0; $i < 2; $i++ ) {\n\t$v_girl_finger = (int)$v_girl_fingers[$i];\n\t$m_boy_finger = (int)$m_boy_fingers[1-$i];\n\n#\tvar_dump($v_girl_finger);\n#\tvar_dump($m_boy_finger);\n#\tvar_dump('===================');\n\tif ( $v_girl_finger >= (ceil($m_boy_finger/2)-1) && $v_girl_finger <= ($m_boy_finger + 2) ) {\n\t\techo \"YES\";\n\t\texit(0);\n\t}\n}\n\necho \"NO\";\nexit(0);\n"}, {"source_code": "<?\n$g=explode(' ',trim(fgets(STDIN)));\n$b=explode(' ',trim(fgets(STDIN)));\n$p1=2*$g[0]+2;\n$p2=2*$g[1]+2;\nif($b[1]>$p1 || $b[1]<$g[0]-1 || $b[0]>$p2 && $b[0]<$g[1]-1) echo \"NO\";\nelse echo \"YES\"; \n?>"}, {"source_code": "<?\n$g=explode(' ',trim(fgets(STDIN)));\n$b=explode(' ',trim(fgets(STDIN)));\n$p1=2*$g[0]+2;\n$p2=2*$g[1]+2;\nif($b[1]>$p1 || $b[1]<$g[0]-1 || $b[0]>$p2 || $b[0]<$g[1]-1) echo \"NO\";\nelse echo \"YES\"; \n?>"}, {"source_code": "<?\n$g=explode(' ',trim(fgets(STDIN)));\n$b=explode(' ',trim(fgets(STDIN)));\n$p1=2*$g[0]+2;\n$p2=2*$g[1]+2;\nif(($b[1]<$p1 && $b[1]>=$g[0]-1) || ($b[0]<$p2 && $b[0]>=$g[1]-1)) echo \"YES\";\nelse echo \"NO\"; \n?>"}, {"source_code": "<?\n$g=explode(' ',trim(fgets(STDIN)));\n$b=explode(' ',trim(fgets(STDIN)));\n$p1=2*$g[0]+2;\n$p2=2*$g[1]+2;\nif(($b[1]<$p1 && $b[1]>$g[0]-1) || ($b[0]<$p2 && $b[0]>$g[1]-1)) echo \"YES\";\nelse echo \"NO\"; \n?>"}, {"source_code": "<?php\nlist($al, $ar) = explode(' ',trim(fgets(STDIN)));\nlist($bl, $br) = explode(' ',trim(fgets(STDIN)));\n\nif(($bl - $ar <= 3 && $ar - $bl <= 1 ) || ($br - $al <= 3 && $al - $br <= 1 ))\n print 'YES'; else print 'NO';\n?>"}], "src_uid": "36b7478e162be6e985613b2dad0974dd"}
{"nl": {"description": "Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was delivered already cut into n pieces. The i-th piece is a sector of angle equal to ai. Vasya and Petya want to divide all pieces of pizza into two continuous sectors in such way that the difference between angles of these sectors is minimal. Sector angle is sum of angles of all pieces in it. Pay attention, that one of sectors can be empty.", "input_spec": "The first line contains one integer n (1\u2009\u2264\u2009n\u2009\u2264\u2009360) \u00a0\u2014 the number of pieces into which the delivered pizza was cut. The second line contains n integers ai (1\u2009\u2264\u2009ai\u2009\u2264\u2009360) \u00a0\u2014 the angles of the sectors into which the pizza was cut. The sum of all ai is 360.", "output_spec": "Print one integer \u00a0\u2014 the minimal difference between angles of sectors that will go to Vasya and Petya.", "sample_inputs": ["4\n90 90 90 90", "3\n100 100 160", "1\n360", "4\n170 30 150 10"], "sample_outputs": ["0", "40", "360", "0"], "notes": "NoteIn first sample Vasya can take 1 and 2 pieces, Petya can take 3 and 4 pieces. Then the answer is |(90\u2009+\u200990)\u2009-\u2009(90\u2009+\u200990)|\u2009=\u20090.In third sample there is only one piece of pizza that can be taken by only one from Vasya and Petya. So the answer is |360\u2009-\u20090|\u2009=\u2009360.In fourth sample Vasya can take 1 and 4 pieces, then Petya will take 2 and 3 pieces. So the answer is |(170\u2009+\u200910)\u2009-\u2009(30\u2009+\u2009150)|\u2009=\u20090.Picture explaning fourth sample:Both red and green sectors consist of two adjacent pieces of pizza. So Vasya can take green sector, then Petya will take red sector."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = 360;\nfor($x = 0; $x < $a; $x++)\n{\n     $d = 0;\n     $e = 360;\n     for($y = 0; $y < $a - 1; $y++)\n     {\n          $d += $b[$y];\n          $e -= $b[$y];\n          $f = abs($d - $e);\n          $c = min($c, $f);\n     }\n     $g = array_slice($b, 1);\n     $g[count($g)] = $b[0];\n     $b = $g;\n}\nprint $c;\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\nsort($b);\n$c = count($b) % 2;\nif($c == 0)\n{\n     $d = array_slice($b, 0, $a / 2);\n     $e = array_slice($b, $a / 2);\n     $f = array_sum($d);\n     $g = array_sum($e);\n     $h = abs($f - $g);\n     print $h;\n}\nelse\n{\n     $d = array_slice($b, 0, ceil($a / 2));\n     $e = array_slice($b, ceil($a / 2));\n     $f = array_sum($d);\n     $g = array_sum($e);\n     $h = abs($f - $g);\n     print $h;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array_slice($b, 1);\n$c[count($c)] = $b[0];\n$c = array_reverse($c);\n$d = 360;\n$e = array_sum($b);\nfor($x = 0; $x < $a - 1; $x++)\n{\n     $e -= $b[$x];\n     $f += $b[$x];\n     $g = abs($e - $f);\n     $d = min($d, $g);\n}\n$h = 360;\n$i = array_sum($c);\nfor($x = 0; $x < $a - 1; $x++)\n{\n     $i -= $c[$x];\n     $j += $c[$x];\n     $k = abs($j - $i);\n     $h = min($h, $k);\n     \n}\nprint min($d, $h);\n?>"}], "src_uid": "1b6a6aff81911865356ec7cbf6883e82"}
{"nl": {"description": "Gerald bought two very rare paintings at the Sotheby's auction and he now wants to hang them on the wall. For that he bought a special board to attach it to the wall and place the paintings on the board. The board has shape of an a1\u2009\u00d7\u2009b1 rectangle, the paintings have shape of a a2\u2009\u00d7\u2009b2 and a3\u2009\u00d7\u2009b3 rectangles.Since the paintings are painted in the style of abstract art, it does not matter exactly how they will be rotated, but still, one side of both the board, and each of the paintings must be parallel to the floor. The paintings can touch each other and the edges of the board, but can not overlap or go beyond the edge of the board. Gerald asks whether it is possible to place the paintings on the board, or is the board he bought not large enough?", "input_spec": "The first line contains two space-separated numbers a1 and b1 \u2014 the sides of the board. Next two lines contain numbers a2,\u2009b2,\u2009a3 and b3 \u2014 the sides of the paintings. All numbers ai,\u2009bi in the input are integers and fit into the range from 1 to 1000.", "output_spec": "If the paintings can be placed on the wall, print \"YES\" (without the quotes), and if they cannot, print \"NO\" (without the quotes).", "sample_inputs": ["3 2\n1 3\n2 1", "5 5\n3 3\n3 3", "4 2\n2 3\n1 2"], "sample_outputs": ["YES", "NO", "YES"], "notes": "NoteThat's how we can place the pictures in the first test:And that's how we can do it in the third one."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\nlist($c, $d) = explode(\" \", trim(fgets(STDIN)));\nlist($e, $f) = explode(\" \", trim(fgets(STDIN)));\n$g = 0;\n$h = $c + $e;\n$i = max($d, $f);\nif((($h <= $a) && ($i <= $b)) || (($h <= $b) && ($i <= $a)))\n{\n    $g = 1;\n}\n$h = $c + $f;\n$i = max($d, $e);\nif((($h <= $a) && ($i <= $b)) || (($h <= $b) && ($i <= $a)))\n{\n    $g = 1;\n}\n$h = $d + $e;\n$i = max($c, $f);\nif((($h <= $a) && ($i <= $b)) || (($h <= $b) && ($i <= $a)))\n{\n    $g = 1;\n}\n$h = $d + $f;\n$i = max($c, $e);\nif((($h <= $a) && ($i <= $b)) || (($h <= $b) && ($i <= $a)))\n{\n    $g = 1;\n}\nif($g == 1)\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}], "negative_code": [], "src_uid": "2ff30d9c4288390fd7b5b37715638ad9"}
{"nl": {"description": "The girl Taylor has a beautiful calendar for the year y. In the calendar all days are given with their days of week: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday and Sunday.The calendar is so beautiful that she wants to know what is the next year after y when the calendar will be exactly the same. Help Taylor to find that year.Note that leap years has 366 days. The year is leap if it is divisible by 400 or it is divisible by 4, but not by 100 (https://en.wikipedia.org/wiki/Leap_year).", "input_spec": "The only line contains integer y (1000\u2009\u2264\u2009y\u2009&lt;\u2009100'000) \u2014 the year of the calendar.", "output_spec": "Print the only integer y' \u2014 the next year after y when the calendar will be the same. Note that you should find the first year after y with the same calendar.", "sample_inputs": ["2016", "2000", "50501"], "sample_outputs": ["2044", "2028", "50507"], "notes": "NoteToday is Monday, the 13th of June, 2016."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$a2 = $a % 4;\n$a3 = $a % 100;\n$a4 = $a % 400;\n$b = 7;\nif(($a4 == 0) || (($a2 == 0) && ($a3 != 0)))\n{\n     $b += 2;\n     $a++;\n     while(TRUE)\n     {\n          $c = $a % 4;\n          $d = $a % 100;\n          $e = $a % 400;\n          $f = $b % 7;\n          if(($e == 0) || (($c == 0) && ($d != 0)))\n          {\n               if($f == 0)\n               {\n                    break;\n               }\n               else\n               {\n                    $b += 2;\n                    $a++;\n               }\n          }\n          else\n          {\n               $b++;\n               $a++;\n          }\n     }\n     print $a;\n}\nelse\n{\n     $b++;\n     $a++;\n     while(TRUE)\n     {\n          $c = $a % 4;\n          $d = $a % 100;\n          $e = $a % 400;\n          $f = $b % 7;\n          if(($e == 0) || (($c == 0) && ($d != 0)))\n          {\n               $b += 2;\n               $a++;\n          }\n          else\n          {\n               if($f == 0)\n               {\n                    break;\n               }\n               else\n               {\n                    $b++;\n                    $a++;\n               }\n          }\n     }\n     print $a;\n}\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 1)\n          {\n               print $a + 11;\n          }\n          elseif($d == 2)\n          {\n               print $a + 6;\n          }\n          elseif($d == 3)\n          {\n               print $a + 11;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\n$c = $a % 100;\nif(($b == 0) && ($c != 0))\n{\n     print $a + 28;\n}\nelseif(($b == 0) && ($c == 0))\n{\n     print $a + 6;\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 1)\n          {\n               print $a + 11;\n          }\n          elseif($d == 2)\n          {\n               print $a + 11;\n          }\n          elseif($d == 3)\n          {\n               print $a + 6;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 11;\n          }\n          elseif($d == 200)\n          {\n               print $a + 11;\n          }\n          elseif($d == 300)\n          {\n               print $a + 11;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 6;\n          }\n          elseif($d == 200)\n          {\n               print $a + 5;\n          }\n          elseif($d == 300)\n          {\n               print $a + 6;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          print $a + 6;\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 6;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 6;\n          }\n          elseif($d == 200)\n          {\n               print $a + 6;\n          }\n          elseif($d == 300)\n          {\n               print $a + 6;\n          }\n     }\n     elseif($c != 0)\n     {\n          print $a + 28;\n     }\n     elseif($c == 0)\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\n$c = $a % 100;\nif(($b == 0) && ($c != 0))\n{\n     print $a + 28;\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 5;\n          }\n          elseif($d == 200)\n          {\n               print $a + 6;\n          }\n          elseif($d == 300)\n          {\n               print $a + 6;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 6;\n          }\n          elseif($d == 200)\n          {\n               print $a + 6;\n          }\n          elseif($d == 300)\n          {\n               print $a + 6;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 6;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 1)\n          {\n               print $a + 6;\n          }\n          elseif($d == 2)\n          {\n               print $a + 11;\n          }\n          elseif($d == 3)\n          {\n               print $a + 11;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 400;\n$c = $a % 100;\nif($b == 0)\n{\n     $d = $a % 4;\n     if($d == 0)\n     {\n          print $a + 28;\n     }\n     elseif($d == 1)\n     {\n          print $a + 6;\n     }\n     elseif($d == 2)\n     {\n          print $a + 11;\n     }\n     elseif($d == 3)\n     {\n          print $a + 11;\n     }\n}\nelseif($c == 0)\n{\n     print $a + 11;\n}\nelse\n{\n     $d = $a % 4;\n     if($d == 0)\n     {\n          print $a + 28;\n     }\n     elseif($d == 1)\n     {\n          print $a + 6;\n     }\n     elseif($d == 2)\n     {\n          print $a + 11;\n     }\n     elseif($d == 3)\n     {\n          print $a + 11;\n     }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 6;\n          }\n          elseif($d == 200)\n          {\n               print $a + 11;\n          }\n          elseif($d == 300)\n          {\n               print $a + 6;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 6;\n          }\n          elseif($d == 200)\n          {\n               print $a + 6;\n          }\n          elseif($d == 300)\n          {\n               print $a + 11;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 5;\n          }\n          elseif($d == 200)\n          {\n               print $a + 6;\n          }\n          elseif($d == 300)\n          {\n               print $a + 6;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 5;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          print $a + 6;\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     $c = $a;\n     for($x = 1; $x <= 4; $x++)\n     {\n          $c++;\n          $d = $c % 100;\n          $e = $c % 400;\n          if(($d == 0) && ($e != 0))\n          {\n               print $a + 6;\n               break;\n          }\n          else\n          {\n               print $a + 11;\n               break;\n          }\n     }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 6;\n          }\n          elseif($d == 200)\n          {\n               print $a + 6;\n          }\n          elseif($d == 300)\n          {\n               print $a + 6;\n          }\n     }\n     elseif($c != 0)\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     print $a + 28;\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\n$c = $a % 100;\nif(($b == 0) && ($c != 0))\n{\n     print $a + 28;\n}\nelseif(($b == 0) && ($c == 0))\n{\n     print $a + 11;\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nprint $b . \"\\n\";\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c != 0) && ($d == 0))\n     {\n          print $a + 11;\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 11;\n          }\n          elseif($d == 200)\n          {\n               print $a + 6;\n          }\n          elseif($d == 300)\n          {\n               print $a + 6;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          print $a + 11;\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 6;\n          }\n          elseif($d == 200)\n          {\n               print $a + 6;\n          }\n          elseif($d == 300)\n          {\n               print $a + 6;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nprint $b . \"\\n\";\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          print $a + 11;\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          print $a + 6;\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 1)\n          {\n               print $a + 6;\n          }\n          elseif($d == 2)\n          {\n               print $a + 6;\n          }\n          elseif($d == 3)\n          {\n               print $a + 6;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 6;\n          }\n          elseif($d == 200)\n          {\n               print $a + 6;\n          }\n          elseif($d == 300)\n          {\n               print $a + 6;\n          }\n     }\n     elseif($d == 0)\n     {\n          print $a + 28;\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 11;\n          }\n          elseif($d == 200)\n          {\n               print $a + 6;\n          }\n          elseif($d == 300)\n          {\n               print $a + 6;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 1)\n          {\n               print $a + 6;\n          }\n          elseif($d == 2)\n          {\n               print $a + 6;\n          }\n          elseif($d == 3)\n          {\n               print $a + 6;\n          }\n          else\n          {\n               print $a + 6;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nprint $b . \"\\n\";\nif($b == 0)\n{\n     print $a + 28;\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 6;\n          }\n          elseif($d == 200)\n          {\n               print $a + 6;\n          }\n          elseif($d == 300)\n          {\n               print $a + 5;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nprint $b . \"\\n\";\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c != 0) && ($d == 0))\n     {\n          print $a + 6;\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          if($d == 100)\n          {\n               print $a + 11;\n          }\n          elseif($d == 200)\n          {\n               print $a + 6;\n          }\n          elseif($d == 300)\n          {\n               print $a + 11;\n          }\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     print $a + 28;\n}\nelse\n{\n     print $a + 6;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 4;\nif($b == 0)\n{\n     $c = $a % 100;\n     $d = $a % 400;\n     if(($c == 0) && ($d != 0))\n     {\n          print $a + 6;\n     }\n     else\n     {\n          print $a + 28;\n     }\n}\nelseif($b == 1)\n{\n     print $a + 6;\n}\nelseif($b == 2)\n{\n     print $a + 11;\n}\nelseif($b == 3)\n{\n     print $a + 11;\n}\n?>"}], "src_uid": "565bbd09f79eb7bfe2f2da46647af0f2"}
{"nl": {"description": "There are five people playing a game called \"Generosity\". Each person gives some non-zero number of coins b as an initial bet. After all players make their bets of b coins, the following operation is repeated for several times: a coin is passed from one player to some other player.Your task is to write a program that can, given the number of coins each player has at the end of the game, determine the size b of the initial bet or find out that such outcome of the game cannot be obtained for any positive number of coins b in the initial bet.", "input_spec": "The input consists of a single line containing five integers c1,\u2009c2,\u2009c3,\u2009c4 and c5 \u2014 the number of coins that the first, second, third, fourth and fifth players respectively have at the end of the game (0\u2009\u2264\u2009c1,\u2009c2,\u2009c3,\u2009c4,\u2009c5\u2009\u2264\u2009100).", "output_spec": "Print the only line containing a single positive integer b \u2014 the number of coins in the initial bet of each player. If there is no such value of b, then print the only value \"-1\" (quotes for clarity).", "sample_inputs": ["2 5 4 0 4", "4 5 9 2 1"], "sample_outputs": ["3", "-1"], "notes": "NoteIn the first sample the following sequence of operations is possible:  One coin is passed from the fourth player to the second player;  One coin is passed from the fourth player to the fifth player;  One coin is passed from the first player to the third player;  One coin is passed from the fourth player to the second player. "}, "positive_code": [{"source_code": "<?php\n$a = explode(\" \", trim(fgets(STDIN)));\n$b = array_sum($a);\n$c = $b % 5;\n$d = $b / 5;\nif($b == 0)\n{\n    print \"-1\";\n}\nelseif($c == 0)\n{\n    print $d;\n}\nelse\n{\n    print \"-1\";\n}\n?>"}, {"source_code": "<?php\nerror_reporting(0);\n$dir = fopen(\"php://stdin\", 'r');\n$datatxt = stream_get_contents($dir);\n// $datatxt = \"1000000000 1000000000 1\";\n$text = explode(\" \",$datatxt);\n$total= 0;\nfor($i=0;$i<5;$i++){\n$total+=$text[$i];\n}\n$initial = $total/5;\nif (($total%5)==0 && $initial>0){\necho $initial;\n}else {\necho \"-1\";\n}\n?>"}, {"source_code": "<?php\n$input = explode(\" \", trim(fgets(STDIN)));\n$sum = array_sum($input);\necho (($sum%5!=0 || $sum==0) ? -1 : ($sum/5));\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d %d %d %d %d\\n\", $n1, $n2, $n3, $n4, $n5);\n    $s = $n1 + $n2 + $n3 + $n4 + $n5;\n    \n    if ($s > 0 && $s % 5 == 0)\n    {\n        fprintf(STDOUT, \"%d\\n\", $s / 5);\n    }\n    else {\n        fprintf(STDOUT, \"-1\\n\");\n    }\n?>"}, {"source_code": "<?php\n$player = explode(\" \",trim(fgets(STDIN)));\n$summ =0;\nfor ($i=0;$i<count($player);$i++)\n{\n    $summ+=$player[$i];\n}\nif ($summ%5==0&&$summ!=0)echo $summ/5;\nelse echo -1;"}, {"source_code": "<?php\n\t$input = explode(\" \",trim(fgets(STDIN)));\n\t$sum = array_sum($input);\n\tif($sum%5==0 && $sum>0){\n\t\techo $sum/5;\n\t}\n\telse{\n\t\techo \"-1\";\n\t}\n?>"}, {"source_code": "<?\n\n$input = trim(fgets(STDIN));\n\n$cs = explode(' ', $input);\n\n$sum = array_sum($cs);\n\nif(($sum/5)==ceil($sum/5)&&$sum!=0){\n    echo ($sum/5);\n}else{\n    echo -1;\n}\n\n?>"}, {"source_code": "<?php\n// 478A     \u041d\u0430\u0447\u0430\u043b\u044c\u043d\u0430\u044f \u0441\u0442\u0430\u0432\u043a\u0430 \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n$arr = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$sum = 0;\nforeach ($arr as $key => $value) {\n    $sum += (int) $value;\n}\n\nif ((($sum % 5) !== 0) or ($sum == 0)) {\n    echo -1;\n} else {\n    echo $sum / 5;\n}\n\n?>"}, {"source_code": "<?php\n\n$line = fgets(STDIN);\n$ex = explode(\" \",$line);\n\n$sum = $ex[0] + $ex[1] + $ex[2] + $ex[3] + $ex[4];\n\nif($sum % 5 == 0 && $sum > 0){\n    echo $sum / 5;\n}else{\n    echo -1;\n}"}, {"source_code": "<?php\n\n$input = rtrim(fgets(STDIN));\n$raw   = explode(' ', $input);\n\n$a = (int)$raw[0];\n$b = (int)$raw[1];\n$c = (int)$raw[2];\n$d = (int)$raw[3];\n$e = (int)$raw[4];\n\n$count = $a + $b + $c + $d + $e;\n\nif ($count % 5 != 0 || $count == 0) {\n    echo -1 . PHP_EOL;\n} else {\n    echo $count / 5 . PHP_EOL;\n}"}, {"source_code": "<?php\nfscanf(STDIN, '%d %d %d %d %d', $i[0], $i[1],$i[2], $i[3], $i[4]);\n\n$sum = 0;\nforeach ($i as $e) $sum += $e;\n\necho $sum > 0 && !($sum % 5) ? $sum / 5 : '-1';\n"}, {"source_code": "<?php\n\t$a = explode(' ', fgets(STDIN));\n\t$c = 0;\n\tfor($i = 0; $i < 5; $i++)\n\t\t$c += $a[$i];\n\techo $c % 5 == 0 && $c != 0 ? $c / 5 : -1;\n?>"}], "negative_code": [{"source_code": "<?php\n$a = explode(\" \", trim(fgets(STDIN)));\n$b = array_sum($a);\n$c = $b % 5;\n$d = $b / 5;\nif($b == 0)\n{\n    print \"0\";\n}\nelseif($c == 0)\n{\n    print $d;\n}\nelse\n{\n    print \"-1\";\n}\n?>"}, {"source_code": "<?php\n$a = explode(\" \", trim(fgets(STDIN)));\n$b = array_sum($a);\n$c = $b % 5;\n$d = $b / 5;\nif($c == 0)\n{\n    print $d;\n}\nelse\n{\n    print \"-1\";\n}\n?>"}, {"source_code": "<?php\n$input = explode(\" \", trim(fgets(STDIN)));\n$sum = array_sum($input);\necho (($sum%5 || !sum) ? -1 : ($sum/5));\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d %d %d %d %d\\n\", $n1, $n2, $n3, $n4, $n5);\n    $s = $n1 + $n2 + $n3 + $n4 + $n5;\n    \n    if ($s % 5 == 0)\n    {\n        fprintf(STDOUT, \"%d\\n\", $s / 5);\n    }\n    else {\n        fprintf(STDOUT, \"-1\\n\");\n    }\n?>"}, {"source_code": "<?php\n    $s = 0;\n    for ($i = 1; $i <= 5; $i++)    {\n        fscanf(STDIN, \"%d\\n\", $number);\n        $s += $number;\n    }\n    \n    if ($s % 5 == 0)\n    {\n        fprintf(STDOUT, \"%d\\n\", $s / 5);\n    }\n    else {\n        fprintf(STDOUT, \"-1\\n\");\n    }\n?>"}, {"source_code": "<?php\n$player = explode(\" \",trim(fgets(STDIN)));\n$summ =0;\nfor ($i=0;$i<count($player);$i++)\n{\n    $summ+=$player[$i];\n}\nif ($summ%5==0)echo $summ/5;\nelse echo -1;"}, {"source_code": "<?php\n\t$input = explode(\" \",trim(fgets(STDIN)));\n\t$sum = array_sum($input);\n\tif($sum%5==0 && $sum>0){\n\t\techo \"$sum/5\";\n\t}\n\telse{\n\t\techo \"-1\";\n\t}\n?>"}, {"source_code": "<?\n\n$input = trim(fgets(STDIN));\n\n$cs = explode(' ', $input);\n\n$sum = array_sum($cs);\n\nif(($sum/5)==ceil($sum/5)){\n    echo ($sum/5);\n}else{\n    echo -1;\n}\n\n?>"}, {"source_code": "<?php\n// 478A     \u041d\u0430\u0447\u0430\u043b\u044c\u043d\u0430\u044f \u0441\u0442\u0430\u0432\u043a\u0430 \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n$arr = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$sum = 0;\nforeach ($arr as $key => $value) {\n    $sum += (int) $value;\n}\n\nif (($sum % 5) == 0) {\n    echo $sum / 5;\n} else {\n    echo -1;\n}\n\n?>"}, {"source_code": "<?php\n\n$line = fgets(STDIN);\n$ex = explode(\" \",$line);\n\n$sum = $ex[0] + $ex[1] + $ex[2] + $ex[3] + $ex[4];\nif($sum % 5 == 0 || $sum == 0){\n    echo $sum / 5;\n}else{\n    echo -1;\n}"}, {"source_code": "<?php\n\n$line = fgets(STDIN);\n$ex = explode(\" \",$line);\n\n$sum = $ex[0] + $ex[1] + $ex[2] + $ex[3] + $ex[4];\nif($sum % 5 == 0 || $sum != 0){\n    echo $sum / 5;\n}else{\n    echo -1;\n}\n"}, {"source_code": "<?php\n\n$line = fgets(STDIN);\n$ex = explode(\" \",$line);\n\n$sum = $ex[0] + $ex[1] + $ex[2] + $ex[3] + $ex[4];\nif($sum % 5 == 0){\n    echo $sum / 5;\n}else{\n    echo -1;\n}"}, {"source_code": "<?php\n\n$input = rtrim(fgets(STDIN));\n$raw   = explode(' ', $input);\n\n$a = (int)$raw[0];\n$b = (int)$raw[1];\n$c = (int)$raw[2];\n$d = (int)$raw[3];\n$e = (int)$raw[4];\n\n$count = $a + $b + $c + $d + $e;\n\nif ($count % 5 != 0) {\n    echo -1 . PHP_EOL;\n} else {\n    echo $count / 5 . PHP_EOL;\n}"}, {"source_code": "<?php\nfscanf(STDIN, '%d %d %d %d %d', $i[0], $i[1],$i[2], $i[3], $i[4]);\n\n$sum = 0;\nforeach ($i as $e) $sum += $e;\n\necho !($sum % 5) ? $sum / 5 : '-1';\n"}], "src_uid": "af1ec6a6fc1f2360506fc8a34e3dcd20"}
{"nl": {"description": "Limak is a little polar bear. He has n balls, the i-th ball has size ti.Limak wants to give one ball to each of his three friends. Giving gifts isn't easy\u00a0\u2014 there are two rules Limak must obey to make friends happy:  No two friends can get balls of the same size.  No two friends can get balls of sizes that differ by more than 2. For example, Limak can choose balls with sizes 4, 5 and 3, or balls with sizes 90, 91 and 92. But he can't choose balls with sizes 5, 5 and 6 (two friends would get balls of the same size), and he can't choose balls with sizes 30, 31 and 33 (because sizes 30 and 33 differ by more than 2).Your task is to check whether Limak can choose three balls that satisfy conditions above.", "input_spec": "The first line of the input contains one integer n (3\u2009\u2264\u2009n\u2009\u2264\u200950)\u00a0\u2014 the number of balls Limak has. The second line contains n integers t1,\u2009t2,\u2009...,\u2009tn (1\u2009\u2264\u2009ti\u2009\u2264\u20091000) where ti denotes the size of the i-th ball.", "output_spec": "Print \"YES\" (without quotes) if Limak can choose three balls of distinct sizes, such that any two of them differ by no more than 2. Otherwise, print \"NO\" (without quotes).", "sample_inputs": ["4\n18 55 16 17", "6\n40 41 43 44 44 44", "8\n5 972 3 4 1 4 970 971"], "sample_outputs": ["YES", "NO", "YES"], "notes": "NoteIn the first sample, there are 4 balls and Limak is able to choose three of them to satisfy the rules. He must must choose balls with sizes 18, 16 and 17.In the second sample, there is no way to give gifts to three friends without breaking the rules.In the third sample, there is even more than one way to choose balls:  Choose balls with sizes 3, 4 and 5.  Choose balls with sizes 972, 970, 971. "}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$b = array_unique($b);\nrsort($b);\n$c = 0;\nfor($x = 0; $x < count($b) - 2; $x++)\n{\n     if(($b[$x] - $b[$x + 1] == 1) && ($b[$x + 1] - $b[$x + 2] == 1))\n     {\n          $c = 1;\n          break;\n     }\n}\nif($c == 1)\n{\n     print \"YES\";\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$ti = explode(\" \", trim(fgets(STDIN)));\nsort($ti);\n$r = false;\n$b = 0;\nfor ($j = 0; $j < $n - 1; $j++) {\n    if ($ti[$j+1] - $ti[$j] == 1) {\n        $b++;\n    } else if ($ti[$j+1] - $ti[$j] == 0) {\n        continue;\n    } else {\n        $b = 0;\n    }\n    if ($b == 2) $r = true;\n}\nif ($r) {\n    print \"YES\";\n} else {\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\nlist($n) = explode(\" \", trim(fgets(STDIN)));\n$a = explode(\" \", trim(fgets(STDIN)));\n\n$a = array_unique($a);\nsort($a);\n$s = \"NO\";\n\nfor ($i=2; $i < count($a); $i++) { \n\tif ( (($a[$i] - 1) == $a[$i-1]) && (($a[$i] - 2) == $a[$i-2]) ) {\n\t\t$s = \"YES\";\n\t\tbreak;\n\t}\n}\n\nprint $s;\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$b = array_unique($b);\nrsort($b);\n$c = 0;\nfor($x = 0; $x < $a - 2; $x++)\n{\n     if(($b[$x] - $b[$x + 1] == 1) && ($b[$x + 1] - $b[$x + 2] == 1))\n     {\n          $c = 1;\n          break;\n     }\n}\nif($c == 1)\n{\n     print \"YES\";\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\nrsort($b);\n$c = 0;\nfor($x = 0; $x < $a; $x++)\n{\n     if(($b[$x] - $b[$x + 1] == 1) && ($b[$x + 1] - $b[$x + 2] == 1))\n     {\n          $c = 1;\n          break;\n     }\n}\nif($c == 1)\n{\n     print \"YES\";\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$b = array_unique($b);\nrsort($b);\n$c = 0;\nfor($x = 0; $x < $a; $x++)\n{\n     if(($b[$x] - $b[$x + 1] == 1) && ($b[$x + 1] - $b[$x + 2] == 1))\n     {\n          $c = 1;\n          break;\n     }\n}\nif($c == 1)\n{\n     print \"YES\";\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$ti = explode(\" \", trim(fgets(STDIN)));\nsort($ti);\n$r = false;\n$b = 0;\nfor ($j = 0; $j < $n - 1; $j++) {\n    if ($ti[$j+1] - $ti[$j] == 1) {\n        $b++;\n    } else {\n        $b = 0;\n    }\n    if ($b == 2) $r = true;\n}\nif ($r) {\n    print \"YES\";\n} else {\n    print \"NO\";\n}\n?>"}], "src_uid": "d6c876a84c7b92141710be5d76536eab"}
{"nl": {"description": "Misha and Vanya have played several table tennis sets. Each set consists of several serves, each serve is won by one of the players, he receives one point and the loser receives nothing. Once one of the players scores exactly k points, the score is reset and a new set begins.Across all the sets Misha scored a points in total, and Vanya scored b points. Given this information, determine the maximum number of sets they could have played, or that the situation is impossible.Note that the game consisted of several complete sets.", "input_spec": "The first line contains three space-separated integers k, a and b (1\u2009\u2264\u2009k\u2009\u2264\u2009109, 0\u2009\u2264\u2009a,\u2009b\u2009\u2264\u2009109, a\u2009+\u2009b\u2009&gt;\u20090).", "output_spec": "If the situation is impossible, print a single number -1. Otherwise, print the maximum possible number of sets.", "sample_inputs": ["11 11 5", "11 2 3"], "sample_outputs": ["1", "-1"], "notes": "NoteNote that the rules of the game in this problem differ from the real table tennis game, for example, the rule of \"balance\" (the winning player has to be at least two points ahead to win a set) has no power within the present problem."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = floor($b / $a);\n$e = floor($c / $a);\n$f = $b % $a;\n$g = $c % $a;\n$h = $d * ($a - 1);\n$i = $e * ($b - 1);\nif(($d == 0) && ($e == 0))\n{\n     print \"-1\";\n}\nelseif((($e == 0) && ($f > 0)) || (($d == 0) && ($g > 0)))\n{\n     print \"-1\";\n}\nelseif(($h >= $g) || ($i >= $f))\n{\n     print $d + $e;\n}\nelse\n{\n     print \"-1\";\n}\n?>"}, {"source_code": "<?php\nerror_reporting(0);\n//////////////////////// Class For Read Input --- @laurenceHR [02/2012] ////////////////////////////////////////////////////////////\nclass stdIn{var $ntxt = 0;var $nline = 0;var $arr_txt;var $arr_line;var $linex;var $liney;\nfunction stdIn($local = false){if($local){$dir = fopen(\"input.txt\", 'r');}else{$dir = fopen(\"php://stdin\", 'r');}\n$datatxt = stream_get_contents($dir);$del = Array(\"\\n\",\"\\r\",\"\\n\\r\");$data = explode(\"\\n\",$datatxt);\t$il = 0;$id = 0;\nforeach($data as $line){if(strlen($line) > 0){$line = str_replace($del,'',$line);$dataex[] = $line;$text = explode(\" \",$line);\nforeach($text as $txt){$arr_txt[] = $txt;$this->linex[$id] = $il;$this->liney[$il] = $id;$id++;}}$il++;}$this->arr_line = $dataex;$this->arr_txt  = $arr_txt;}\nfunction G(){$ret = $this->arr_txt[$this->ntxt++];$this->nline = $this->linex[$this->ntxt];return $ret;}\nfunction GL(){$this->ntxt = $this->liney[$this->nline]+1;return $this->arr_line[$this->nline++];}} /*init*/ $dxs = new stdIn(false);\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n///////////////////////////////////// DECLARE FUNCTIONS ///////////////////////////////////////\n$k = $dxs->G();\n$a = $dxs->G();\n$b = $dxs->G();\n/////////////////////////////////// MAIN CODE /////////////////////////////////////////////////\nif ($a < $k and $b < $k) {\n    if($a + $b == 0){\n        echo 0;\n    }\n    else{\n        echo -1;\n    }\n}\nelse if($a < $k and $b % $k != 0){\n    echo -1;\n}\nelse if($b < $k and $a % $k != 0){\n    echo -1;\n}\nelse{\n    echo intdiv($a , $k) + intdiv($b , $k);\n}\n/////////////////////////////////////////////////////////////////////////////////////////////////\n?>"}, {"source_code": "<?php\nerror_reporting(0);\n//////////////////////// Class For Read Input --- @laurenceHR [02/2012] ////////////////////////////////////////////////////////////\nclass stdIn{var $ntxt = 0;var $nline = 0;var $arr_txt;var $arr_line;var $linex;var $liney;\nfunction stdIn($local = false){if($local){$dir = fopen(\"input.txt\", 'r');}else{$dir = fopen(\"php://stdin\", 'r');}\n$datatxt = stream_get_contents($dir);$del = Array(\"\\n\",\"\\r\",\"\\n\\r\");$data = explode(\"\\n\",$datatxt);\t$il = 0;$id = 0;\nforeach($data as $line){if(strlen($line) > 0){$line = str_replace($del,'',$line);$dataex[] = $line;$text = explode(\" \",$line);\nforeach($text as $txt){$arr_txt[] = $txt;$this->linex[$id] = $il;$this->liney[$il] = $id;$id++;}}$il++;}$this->arr_line = $dataex;$this->arr_txt  = $arr_txt;}\nfunction G(){$ret = $this->arr_txt[$this->ntxt++];$this->nline = $this->linex[$this->ntxt];return $ret;}\nfunction GL(){$this->ntxt = $this->liney[$this->nline]+1;return $this->arr_line[$this->nline++];}} /*init*/ $dxs = new stdIn(false);\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n///////////////////////////////////// DECLARE FUNCTIONS ///////////////////////////////////////\n$k = $dxs->G();\n$a = $dxs->G();\n$b = $dxs->G();\n/////////////////////////////////// MAIN CODE /////////////////////////////////////////////////\nif ($a < $k and $b < $k) {\n    if($a + $b == 0){\n        echo 0;\n    }\n    else{\n        echo -1;\n    }\n}\nelse if($a < $k and $b % $k != 0){\n    echo -1;\n}\nelse if($b < $k and $a % $k != 0){\n    echo -1;\n}\nelse{\n    echo intdiv($a , $k) + intdiv($b , $k);\n}\n/////////////////////////////////////////////////////////////////////////////////////////////////\n?>"}, {"source_code": "<?php\n\nerror_reporting(0);\n\nwhile($line = trim(fgets(STDIN))){\n\n$linhas[]=$line;\nif($a==1) break;\n$a++;\n}\n\n$explode = explode(\" \",$linhas[0]);\n\n$k=$explode[0];\n$a=$explode[1];\n$b=$explode[2];\n\n$max = max($a,$b);\n$min = min($a,$b);\n\n$set1 = $max/$k;\n$set2 = $min/$k;\n\n\n$sum = intval($set1)+intval($set2);\n\n$sum+=0;\n\n$resto1=$max%$k;\n$resto2=$min%$k;\n\n\n\n\nif($resto1!=0 && $max>=$k) {\n\n\tif($min >= $k) {\n\n\t\techo $sum;\n\t\tdie();\n\n\n\t}\n\n}\n\nelse if(($resto1==0) && ($max>=$k)) { \n\techo $sum; die(); }\n\n\t// var_dump($resto1==0,$max>=$k);\n\n\necho \"-1\";\n\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = floor($b / $a);\n$e = floor($c / $a);\n$f = $d + $e;\nif(($f == 0) || (($b % $a != 0) && ($c % $a != 0)))\n{\n     print \"-1\";\n}\nelse\n{\n     print $f;\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = floor($b / $a);\n$e = floor($c / $a);\n$f = $d + $e;\nif($f == 0)\n{\n     print \"-1\";\n}\nelse\n{\n     print $f;\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = floor($b / $a);\n$e = floor($c / $a);\n$f = $b % $a;\n$g = $c % $a;\n$h = $d * ($a - 1);\n$i = $e * ($b - 1);\nif(($d == 0) && ($e == 0))\n{\n     print \"-1\";\n}\nelseif(($h >= $g) || ($i >= $f))\n{\n     print $d + $e;\n}\nelse\n{\n     print \"-1\";\n}\n?>"}, {"source_code": "<?php\nerror_reporting(0);\n//////////////////////// Class For Read Input --- @laurenceHR [02/2012] ////////////////////////////////////////////////////////////\nclass stdIn{var $ntxt = 0;var $nline = 0;var $arr_txt;var $arr_line;var $linex;var $liney;\nfunction stdIn($local = false){if($local){$dir = fopen(\"input.txt\", 'r');}else{$dir = fopen(\"php://stdin\", 'r');}\n$datatxt = stream_get_contents($dir);$del = Array(\"\\n\",\"\\r\",\"\\n\\r\");$data = explode(\"\\n\",$datatxt);\t$il = 0;$id = 0;\nforeach($data as $line){if(strlen($line) > 0){$line = str_replace($del,'',$line);$dataex[] = $line;$text = explode(\" \",$line);\nforeach($text as $txt){$arr_txt[] = $txt;$this->linex[$id] = $il;$this->liney[$il] = $id;$id++;}}$il++;}$this->arr_line = $dataex;$this->arr_txt  = $arr_txt;}\nfunction G(){$ret = $this->arr_txt[$this->ntxt++];$this->nline = $this->linex[$this->ntxt];return $ret;}\nfunction GL(){$this->ntxt = $this->liney[$this->nline]+1;return $this->arr_line[$this->nline++];}} /*init*/ $dxs = new stdIn(false);\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n///////////////////////////////////// DECLARE FUNCTIONS ///////////////////////////////////////\n$k = $dxs->G();\n$a = $dxs->G();\n$b = $dxs->G();\n/////////////////////////////////// MAIN CODE /////////////////////////////////////////////////\nif ($a < $k and $b < $k) {\n    echo -1;\n}\nelse if($a < $k and $b % $k != 0){\n    echo -1;\n}\nelse if($b < $k and $a % $k != 0){\n    echo -1;\n}\nelse{\n    echo intdiv($a , $k) + intdiv($b / $k);\n}\n/////////////////////////////////////////////////////////////////////////////////////////////////\n?>"}, {"source_code": "<?php\nerror_reporting(0);\n//////////////////////// Class For Read Input --- @laurenceHR [02/2012] ////////////////////////////////////////////////////////////\nclass stdIn{var $ntxt = 0;var $nline = 0;var $arr_txt;var $arr_line;var $linex;var $liney;\nfunction stdIn($local = false){if($local){$dir = fopen(\"input.txt\", 'r');}else{$dir = fopen(\"php://stdin\", 'r');}\n$datatxt = stream_get_contents($dir);$del = Array(\"\\n\",\"\\r\",\"\\n\\r\");$data = explode(\"\\n\",$datatxt);\t$il = 0;$id = 0;\nforeach($data as $line){if(strlen($line) > 0){$line = str_replace($del,'',$line);$dataex[] = $line;$text = explode(\" \",$line);\nforeach($text as $txt){$arr_txt[] = $txt;$this->linex[$id] = $il;$this->liney[$il] = $id;$id++;}}$il++;}$this->arr_line = $dataex;$this->arr_txt  = $arr_txt;}\nfunction G(){$ret = $this->arr_txt[$this->ntxt++];$this->nline = $this->linex[$this->ntxt];return $ret;}\nfunction GL(){$this->ntxt = $this->liney[$this->nline]+1;return $this->arr_line[$this->nline++];}} /*init*/ $dxs = new stdIn(false);\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n///////////////////////////////////// DECLARE FUNCTIONS ///////////////////////////////////////\n$k = $dxs->G();\n$a = $dxs->G();\n$b = $dxs->G();\n/////////////////////////////////// MAIN CODE /////////////////////////////////////////////////\nif ($a < $k and $b < $k) {\n    if($a + $b == 0){\n        echo 0;\n    }\n    else{\n        echo -1;\n    }\n}\nelse if($a < $k and $b % $k != 0){\n    echo -1;\n}\nelse if($b < $k and $a % $k != 0){\n    echo -1;\n}\nelse{\n    echo intdiv($a , $k) + intdiv($b / $k);\n}\n/////////////////////////////////////////////////////////////////////////////////////////////////\n?>"}], "src_uid": "6e3b8193d1ca1a1d449dc7a4ad45b8f2"}
{"nl": {"description": "Arkady and his friends love playing checkers on an $$$n \\times n$$$ field. The rows and the columns of the field are enumerated from $$$1$$$ to $$$n$$$.The friends have recently won a championship, so Arkady wants to please them with some candies. Remembering an old parable (but not its moral), Arkady wants to give to his friends one set of candies per each cell of the field: the set of candies for cell $$$(i, j)$$$ will have exactly $$$(i^2 + j^2)$$$ candies of unique type.There are $$$m$$$ friends who deserve the present. How many of these $$$n \\times n$$$ sets of candies can be split equally into $$$m$$$ parts without cutting a candy into pieces? Note that each set has to be split independently since the types of candies in different sets are different.", "input_spec": "The only line contains two integers $$$n$$$ and $$$m$$$ ($$$1 \\le n \\le 10^9$$$, $$$1 \\le m \\le 1000$$$)\u00a0\u2014 the size of the field and the number of parts to split the sets into.", "output_spec": "Print a single integer\u00a0\u2014 the number of sets that can be split equally.", "sample_inputs": ["3 3", "6 5", "1000000000 1"], "sample_outputs": ["1", "13", "1000000000000000000"], "notes": "NoteIn the first example, only the set for cell $$$(3, 3)$$$ can be split equally ($$$3^2 + 3^2 = 18$$$, which is divisible by $$$m=3$$$).In the second example, the sets for the following cells can be divided equally:   $$$(1, 2)$$$ and $$$(2, 1)$$$, since $$$1^2 + 2^2 = 5$$$, which is divisible by $$$5$$$;  $$$(1, 3)$$$ and $$$(3, 1)$$$;  $$$(2, 4)$$$ and $$$(4, 2)$$$;  $$$(2, 6)$$$ and $$$(6, 2)$$$;  $$$(3, 4)$$$ and $$$(4, 3)$$$;  $$$(3, 6)$$$ and $$$(6, 3)$$$;  $$$(5, 5)$$$. In the third example, sets in all cells can be divided equally, since $$$m = 1$$$."}, "positive_code": [{"source_code": "<?php\n/*****************************************/\nclass InputReader {protected $_fh;public function __construct($fileHandler = STDIN){$this->_fh = $fileHandler;}\n\tpublic function readInt() {$d = trim(fgets($this->_fh));return (int)$d;}\n\tpublic function readArrayOfInt($size, $indexFrom = 0) {$a = [];$ind = $indexFrom;foreach (explode(' ', fgets($this->_fh)) as $item) {$a[$ind++] = (int)$item;}return $a;}\n\tpublic function readArrayOfFloat($size, $indexFrom = 0) {$a = [];$ind = $indexFrom;foreach (explode(' ', fgets($this->_fh)) as $item) {$a[$ind++] = (float)$item;}return $a;}\n\tpublic function readArrayOfString($size, $indexFrom = 0) {$a = [];$ind = $indexFrom;foreach (explode(' ', fgets($this->_fh)) as $item) {$a[$ind++] = $item;}return $a;}\n}\n\n/* Perform action N times. Can return values in array */\nfunction ntimes($n, $func, $returnResults = false) {$a = [];for ($i=1; $i<=$n; $i++) {$result = $func();if ($returnResults) {$a[$i] = $result;}}return $a;}\n\n/* Integral. Keys preserved. By reference. */\nfunction cumsum(&$a){$sum = 0;foreach($a as $k=>$v) {$a[$k] += $sum;$sum = $a[$k];}}\n\n/* Difference. Keys preserved. By reference. */\nfunction diff(&$a){$prev = 0;foreach($a as $k=>$v) {$buf=$a[$k];$a[$k]-=$prev;$prev = $buf;}}\n\nfunction bitCount($n){$cnt = 0;for ($j=$n; $j; $j>>=1){$cnt += $j&1;}return $cnt;}\n/*****************************************/\n\n$ir = new InputReader();\n\n/* TASK */\n\nlist($n, $m) = $ir->readArrayOfInt(2);\n$fullTimes = intval($n/$m);\n$mod = $n%$m;\n\n$a = array_fill(1,$m, []);\n\nfor ($i=1; $i<=$m; $i++) {\n\tfor ($j=$i; $j<=$m; $j++) {\n\t\t$a[$i][$j] = ( $i*$i + $j*$j )%$m;\n\t\t$a[$j][$i] = $a[$i][$j];\n\t}\n}\n\n$fullCnt = 0;\nfor ($i=1; $i<=$m; $i++) {\n\tfor ($j=1; $j<=$m; $j++) {\n\t\tif ($a[$i][$j] == 0) {\n\t\t\t$fullCnt++;\n\t\t}\n\t}\n}\n\n$halfCnt = 0;\nfor ($i=1; $i<=$m; $i++) {\n\tfor ($j=1; $j<=$mod; $j++) {\n\t\tif ($a[$i][$j] == 0) {\n\t\t\t$halfCnt++;\n\t\t}\n\t}\n}\n\n$quarterCnt = 0;\nfor ($i=1; $i<=$mod; $i++) {\n\tfor ($j=1; $j<=$mod; $j++) {\n\t\tif ($a[$i][$j] == 0) {\n\t\t\t$quarterCnt++;\n\t\t}\n\t}\n}\n\n$totalCnt = bcadd(bcadd(bcmul($fullCnt, bcmul($fullTimes,$fullTimes)), bcmul(bcmul(2,$halfCnt),$fullTimes)), $quarterCnt);\n\necho $totalCnt;\n"}], "negative_code": [], "src_uid": "2ec9e7cddc634d7830575e14363a4657"}
{"nl": {"description": "So nearly half of the winter is over and Maria is dreaming about summer. She's fed up with skates and sleds, she was dreaming about Hopscotch all night long. It's a very popular children's game. The game field, the court, looks as is shown in the figure (all blocks are square and are numbered from bottom to top, blocks in the same row are numbered from left to right). Let us describe the hopscotch with numbers that denote the number of squares in the row, staring from the lowest one: 1-1-2-1-2-1-2-(1-2)..., where then the period is repeated (1-2).  The coordinate system is defined as shown in the figure. Side of all the squares are equal and have length a.Maria is a very smart and clever girl, and she is concerned with quite serious issues: if she throws a stone into a point with coordinates (x,\u2009y), then will she hit some square? If the answer is positive, you are also required to determine the number of the square.It is believed that the stone has fallen into the square if it is located strictly inside it. In other words a stone that has fallen on the square border is not considered a to hit a square.", "input_spec": "The only input line contains three integers: a, x, y, where a (1\u2009\u2264\u2009a\u2009\u2264\u2009100) is the side of the square, x and y (\u2009-\u2009106\u2009\u2264\u2009x\u2009\u2264\u2009106,\u20090\u2009\u2264\u2009y\u2009\u2264\u2009106) are coordinates of the stone.", "output_spec": "Print the number of the square, inside which the stone fell. If the stone is on a border of some stone or outside the court, print \"-1\" without the quotes.", "sample_inputs": ["1 0 0", "3 1 1", "3 0 10", "3 0 7", "3 4 0"], "sample_outputs": ["-1", "1", "5", "-1", "-1"], "notes": null}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = $c % $a;\nif($d == 0)\n{\n     print \"-1\";\n}\nelseif($c < $a)\n{\n     $e = $a / 2;\n     if(($b <= (0 - $e)) || ($b >= $e))\n     {\n          print \"-1\";\n     }\n     else\n     {\n          print \"1\";\n     }\n}\nelseif($c > $a)\n{\n     $e = floor($c / $a);\n     $f = $e % 2;\n     $g = ceil($e / 2);\n     $h = $e + $g;\n     $i = $a / 2;\n     $j = ($e / 2) * 3;\n     if($f == 0)\n     {\n          if(($b <= (0 - $a)) || ($b >= $a) || ($b == 0))\n          {\n               print \"-1\";\n          }\n          else\n          {\n               \n               if(($b > (0 - $a)) && ($b < 0))\n               {\n                    print $j;\n               }\n               elseif(($b > 0) && ($b < $a))\n               {\n                    print $j + 1;\n               }\n          }\n     }\n     else\n     {\n          if(($b <= (0 - $i)) || ($b >= $i))\n          {\n               print \"-1\";\n          }\n          else\n          {\n               print $h;\n          }\n     }\n}\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = $c % $a;\nif($d == 0)\n{\n     print \"-1\";\n}\nelseif($c < $a)\n{\n     $e = $a / 2;\n     if(($b < (0 - $e)) || ($b > $e))\n     {\n          print \"-1\";\n     }\n     else\n     {\n          print \"1\";\n     }\n}\nelseif($c > $a)\n{\n     $e = floor($c / $a);\n     $f = $e % 2;\n     $g = ceil($e / 2);\n     $h = $e + $g;\n     $i = $c / $a;\n     $j = ($e / 2) * 3;\n     if($f == 0)\n     {\n          if(($b < (0 - $a)) || ($b > $a) || ($b == 0))\n          {\n               print \"-1\";\n          }\n          else\n          {\n               \n               if(($b > (0 - $a)) && ($b < 0))\n               {\n                    print $j;\n               }\n               elseif(($b > 0) && ($b < $a))\n               {\n                    print $j + 1;\n               }\n          }\n     }\n     else\n     {\n          if(($b < (0 - $i)) && ($b > $i))\n          {\n               print \"-1\";\n          }\n          else\n          {\n               print $h;\n          }\n     }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = $c % $a;\nif($d == 0)\n{\n     print \"-1\";\n}\nelseif($c < $a)\n{\n     $e = $a / 2;\n     if(($b < (0 - $e)) || ($b > $e))\n     {\n          print \"-1\";\n     }\n     else\n     {\n          print \"1\";\n     }\n}\nelseif($c > $a)\n{\n     $e = floor($c / $a);\n     $f = $e % 2;\n     $g = ceil($e / 2);\n     $h = $e + $g;\n     $i = $a / 2;\n     $j = ($e / 2) * 3;\n     if($f == 0)\n     {\n          if(($b <= (0 - $a)) || ($b >= $a) || ($b == 0))\n          {\n               print \"-1\";\n          }\n          else\n          {\n               \n               if(($b > (0 - $a)) && ($b < 0))\n               {\n                    print $j;\n               }\n               elseif(($b > 0) && ($b < $a))\n               {\n                    print $j + 1;\n               }\n          }\n     }\n     else\n     {\n          if(($b <= (0 - $i)) || ($b >= $i))\n          {\n               print \"-1\";\n          }\n          else\n          {\n               print $h;\n          }\n     }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = $c % $a;\nif($d == 0)\n{\n     print \"-1\";\n}\nelseif($c < $a)\n{\n     $e = $a / 2;\n     if(($b < (0 - $e)) || ($b > $e))\n     {\n          print \"-1\";\n     }\n     else\n     {\n          print \"1\";\n     }\n}\nelseif($c > $a)\n{\n     $e = floor($c / $a);\n     $f = $e % 2;\n     $g = ceil($e / 2);\n     $h = $e + $g;\n     if($f == 0)\n     {\n          if(($b < (0 - $e)) || ($b > $e) || ($b == 0))\n          {\n               print \"-1\";\n          }\n          else\n          {\n               if(($b > (0 - $a)) && ($b < 0))\n               {\n                    print $h + 1;\n               }\n               else\n               {\n                    print $h + 2;\n               }\n          }\n     }\n     else\n     {\n          if(($b < (0 - $e)) || ($b > $e))\n          {\n               print \"-1\";\n          }\n          else\n          {\n               print $h;\n          }\n     }\n}\n?>"}], "src_uid": "cf48ff6ba3e77ba5d4afccb8f775fb02"}
{"nl": {"description": "The Smart Beaver from ABBYY decided to have a day off. But doing nothing the whole day turned out to be too boring, and he decided to play a game with pebbles. Initially, the Beaver has n pebbles. He arranges them in a equal rows, each row has b pebbles (a\u2009&gt;\u20091). Note that the Beaver must use all the pebbles he has, i. e. n\u2009=\u2009a\u00b7b.   10 pebbles are arranged in two rows, each row has 5 pebbles  Once the Smart Beaver has arranged the pebbles, he takes back any of the resulting rows (that is, b pebbles) and discards all other pebbles. Then he arranges all his pebbles again (possibly choosing other values of a and b) and takes back one row, and so on. The game continues until at some point the Beaver ends up with exactly one pebble. The game process can be represented as a finite sequence of integers c1,\u2009...,\u2009ck, where:   c1\u2009=\u2009n  ci\u2009+\u20091 is the number of pebbles that the Beaver ends up with after the i-th move, that is, the number of pebbles in a row after some arrangement of ci pebbles (1\u2009\u2264\u2009i\u2009&lt;\u2009k). Note that ci\u2009&gt;\u2009ci\u2009+\u20091.  ck\u2009=\u20091 The result of the game is the sum of numbers ci. You are given n. Find the maximum possible result of the game.", "input_spec": "The single line of the input contains a single integer n \u2014 the initial number of pebbles the Smart Beaver has. The input limitations for getting 30 points are:    2\u2009\u2264\u2009n\u2009\u2264\u200950  The input limitations for getting 100 points are:    2\u2009\u2264\u2009n\u2009\u2264\u2009109 ", "output_spec": "Print a single number \u2014 the maximum possible result of the game.", "sample_inputs": ["10", "8"], "sample_outputs": ["16", "15"], "notes": "NoteConsider the first example (c1\u2009=\u200910). The possible options for the game development are:  Arrange the pebbles in 10 rows, one pebble per row. Then c2\u2009=\u20091, and the game ends after the first move with the result of 11.  Arrange the pebbles in 5 rows, two pebbles per row. Then c2\u2009=\u20092, and the game continues. During the second move we have two pebbles which can be arranged in a unique way (remember that you are not allowed to put all the pebbles in the same row!) \u2014 2 rows, one pebble per row. c3\u2009=\u20091, and the game ends with the result of 13.  Finally, arrange the pebbles in two rows, five pebbles per row. The same logic leads us to c2\u2009=\u20095,\u2009c3\u2009=\u20091, and the game ends with the result of 16 \u2014 the maximum possible result. "}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = 0;\nwhile(TRUE)\n{\n     if($a == 1)\n     {\n          $b++;\n          break;\n     }\n     else\n     {\n          $c = 2;\n          for($x = 2; $x <= $a; $x++)\n          {\n               $d = $a % $x;\n               if($d == 0)\n               {\n                    $e = $a / $x;\n                    break;\n               }\n          }\n          $b += $a;\n          $a = $e;\n     }\n}\nprint $b;\n?>"}, {"source_code": "<?\n    define (\"TEST\", false);  \n    if (TEST) $GLOBALS['file'] = fopen('input.txt', 'r');\n    else $GLOBALS['file'] = fopen('php://stdin', 'r');  \n    function debug($var){echo '<pre>'; print_r($var); echo '</pre>';}\n    function read_str(){return trim(fgets($GLOBALS['file']));}\n    function read_array(){return explode(' ', read_str());}\n    /***************************************************************/\n        \n    $n = read_str();\n    \n    function find_max($n)\n    {\n        $max = $n/2;\n        $a=1;\n        do\n        {\n            $a++;\n            $b = $n/$a;         \n            if(is_int($b)) break;\n        } while ($a<$max);\n        if($a>$max) return 1;       \n        else return max($a,$b);\n    }\n    \n    function calc($n)\n    {\n        $count = $n;\n        do\n        {       \n            $n = find_max($n);\n            $count += $n;\n        } while($n != 1);\n        \n        return $count;\n    }\n    \n    echo calc($n);\n?>"}, {"source_code": "<?\n    define (\"TEST\", false);  \n    if (TEST) $GLOBALS['file'] = fopen('input.txt', 'r');\n    else $GLOBALS['file'] = fopen('php://stdin', 'r');  \n    function debug($var){echo '<pre>'; print_r($var); echo '</pre>';}\n    function read_str(){return trim(fgets($GLOBALS['file']));}\n    function read_array(){return explode(' ', read_str());}\n    /***************************************************************/\n        \n    $n = read_str();\n\n    \n/**\n * Checks if $num is a Prime Number\n * @param int $num\n * @return boolean\n */\nfunction isPrime($num) {\n    //1 is not prime. See: http://en.wikipedia.org/wiki/Prime_number#Primality_of_one\n    if($num == 1)\n        return false;\n\n    //2 is prime (the only even number that is prime)\n    if($num == 2)\n        return true;\n\n  /**\n     * if the number is divisible by two, then it's not prime and it's no longer\n     * needed to check other even numbers\n     */\n    if($num % 2 == 0) {\n        return false;\n    }\n\n    /**\n     * Checks the odd numbers. If any of them is a factor, then it returns false.\n     * The sqrt can be an aproximation, hence just for the sake of\n     * security, one rounds it to the next highest integer value.\n     */\n    for($i = 3; $i <= ceil(sqrt($num)); $i = $i + 2) {\n        if($num % $i == 0)\n            return false;\n    }\n\n    return true;\n}\n\n\n    \n    function find_max($n)\n    {\n        if(isPrime($n)) return 1;\n        $max = $n/2;\n        $a=1;\n        do\n        {\n            $a++;\n            $b = $n/$a; \n\n            if(is_int($b)) break;\n        } while ($a<$max);\n        if($a>$max) return 1;       \n        else return max($a,$b);\n    }\n    \n    function calc($n)\n    {       \n        $count = $n;\n        do\n        {       \n            $n = find_max($n);\n            \n            $count += $n;\n        } while($n != 1);\n        \n        return $count;\n    }\n    \n    echo calc($n);\n?>"}], "negative_code": [], "src_uid": "821c0e3b5fad197a47878bba5e520b6e"}
{"nl": {"description": "There are $$$n$$$ students in a school class, the rating of the $$$i$$$-th student on Codehorses is $$$a_i$$$. You have to form a team consisting of $$$k$$$ students ($$$1 \\le k \\le n$$$) such that the ratings of all team members are distinct.If it is impossible to form a suitable team, print \"NO\" (without quotes). Otherwise print \"YES\", and then print $$$k$$$ distinct numbers which should be the indices of students in the team you form. If there are multiple answers, print any of them.", "input_spec": "The first line contains two integers $$$n$$$ and $$$k$$$ ($$$1 \\le k \\le n \\le 100$$$) \u2014 the number of students and the size of the team you have to form. The second line contains $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$ ($$$1 \\le a_i \\le 100$$$), where $$$a_i$$$ is the rating of $$$i$$$-th student.", "output_spec": "If it is impossible to form a suitable team, print \"NO\" (without quotes). Otherwise print \"YES\", and then print $$$k$$$ distinct integers from $$$1$$$ to $$$n$$$ which should be the indices of students in the team you form. All the ratings of the students in the team should be distinct. You may print the indices in any order. If there are multiple answers, print any of them. Assume that the students are numbered from $$$1$$$ to $$$n$$$.", "sample_inputs": ["5 3\n15 13 15 15 12", "5 4\n15 13 15 15 12", "4 4\n20 10 40 30"], "sample_outputs": ["YES\n1 2 5", "NO", "YES\n1 2 3 4"], "notes": "NoteAll possible answers for the first example:   {1 2 5}  {2 3 5}  {2 4 5} Note that the order does not matter."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\n$d = array_unique($c);\nif(count($d) < $b)\n{\n     print \"NO\";\n}\nelse\n{\n     print \"YES\\n\";\n     sort($d);\n     $e = array();\n     for($x = 0; $x < count($d); $x++)\n     {\n          $e[$d[$x]] = 1;\n     }\n     $f = \"\";\n     $g = 0;\n     for($x = 0; $x < $a; $x++)\n     {\n          if($e[$c[$x]] == 1)\n          {\n               $f .= ($x + 1) . \" \";\n               $e[$c[$x]] = 0;\n               $g++;\n               if($g == $b)\n               {\n                    break;\n               }\n          }\n     }\n     print $f;\n}\n?>"}, {"source_code": "<?php\n$debug=0;\n$b=readline (\"n k:\");\n$a=readline (\"ratings:\");\n//$b=\"100 53\";\n//$a=\"16 17 1 2 27 5 9 9 53 24 17 33 35 24 20 48 56 73 12 14 39 55 58 13 59 73 29 26 40 3322 29 34 22 55 38 63 66 36 13 60 42 10 15 21 9 11 5 23 37 79 47 26 3 79 53 44 8 71 75 42 1 34 39 79 33 10 26 23 23 17 14 54 41 60 31 83 5 45 4 14 35 6 60 28 48 23 18 60 36 21 28 7 4 9 25 52 43 54 19\";\n$arr1=explode(\" \",$b);\n$a=explode(\" \",$a);\n$n=($arr1[0]);\n$k=($arr1[1]);\n($debug) ? print ($n . \"\\r\\n\"): \"\";\n($debug) ? print ($k . \"\\r\\n\"): \"\";\n//($debug) ? print_r ($a): \"\" ;\n$uniq=array_unique($a);\nif ($debug) print (\"uniq:\".count($uniq).\"\\r\\n\");\nif ($debug) print (\"k:\".$k.\"\\r\\n\");\n$out=[];\n$j=0;\n$l=0;\nif (count($uniq)>=$k):\n\n        foreach ($uniq as $value) {\n        $j++;\n                for ($i=0;$i<=count($a);$i++){\n                        if ($a[$i] == $value):\n                        $l++;\n                        $out[]=$i+1;\n                        break;\n                        endif;\n                }\n        if ($l==$k) break;\n        }\n\n        if ($debug):\n        print (\"j:\".$j.\"\\r\\n\");\n        print (\"l:\".$l.\"\\r\\n\");\n        endif;\n        print (\"YES\\r\\n\");\n\n        print (implode(\" \",$out).\"\\r\\n\");\nelse:\n        print(\"NO\");\nendif;\n"}, {"source_code": "<?php\nfscanf(STDIN,\"%d %d\",$arrSize,$k);\n$arr=explode(' ',trim(fgets(STDIN)));\n$trgtArr[0]=$arr[0];\n$l=1;\n$m=1;\n$key[0]=1;\nfor ($i=1; $i <$arrSize ; $i++) \n{ \n\t$count=0;\n     for ($j=0; $j <count($trgtArr); $j++)\n     { \n     \tif($trgtArr[$j]!=$arr[$i])\n     \t{\n     \t\t$count++;\n     \t\tif($count==count($trgtArr))\n     \t\t{\n     \t\t\t$trgtArr[$l++]=$arr[$i];\n     \t\t\t$key[$m++]=$i+1;\n     \t\t}\n     \t}\n     }\n}\nif(count($key)>=$k)\n  {\n\techo \"YES\\n\";\n\tfor ($i=0; $i <count($key) ; $i++)\n\t { \n\t\tif($i==$k-1)\n\t\t{\n\t\t\techo \"$key[$i]\";\n\t\t\tbreak;\n\t\t}\n\t\telse\n\t\t\techo \"$key[$i] \";\n\t}\n  }\t\n\telse\n\t\techo \"NO\\n\";\n\n"}], "negative_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\n$d = array_unique($c);\nif(count($d) < $b)\n{\n     print \"NO\";\n}\nelse\n{\n     print \"YES\\n\";\n     sort($d);\n     $e = array();\n     for($x = 0; $x < count($d); $x++)\n     {\n          $e[$d[$x]] = 1;\n     }\n     $f = \"\";\n     for($x = 0; $x < $b; $x++)\n     {\n          if($e[$c[$x]] == 1)\n          {\n               $f .= ($x + 1) . \" \";\n               $e[$c[$x]] = 0;\n          }\n     }\n     print $f;\n}\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\n$d = array_unique($c);\nif(count($d) < $b)\n{\n     print \"NO\";\n}\nelse\n{\n     print \"YES\\n\";\n     sort($d);\n     $e = array();\n     for($x = 0; $x < count($d); $x++)\n     {\n          $e[$d[$x]] = 1;\n     }\n     $f = \"\";\n     for($x = 0; $x < $a; $x++)\n     {\n          if($e[$c[$x]] == 1)\n          {\n               $f .= ($x + 1) . \" \";\n               $e[$c[$x]] = 0;\n          }\n     }\n     print $f;\n}\n?>"}, {"source_code": "<?php\n$debug=0;\n$b=readline (\"n k:\");\n$a=readline (\"ratings:\");\n$arr1=explode(\" \",$b);\n$a=explode(\" \",$a);\n$n=($arr1[0]);\n$k=($arr1[1]);\n($debug) ? print ($n . \"\\r\\n\"): \"\";\n($debug) ? print ($k . \"\\r\\n\"): \"\";\n($debug) ? print_r ($a): \"\" ;\n$uniq=array_unique($a);\n$out=[];\n\nif (count($uniq)>=$k):\n        foreach ($uniq as $value) {\n                for ($i=0;$i<=$k+1;$i++){\n                        if ($a[$i] == $value):\n                        $out[]=$i+1;\n                        $i=0;\n                        break;\n                        endif;\n                }\n        }\n\n\n        print (\"YES\\r\\n\");\n        print (implode(\" \",$out));\nelse:\n        print(\"NO\");\nendif;\n"}, {"source_code": "<?php\n$debug=0;\n$b=readline (\"n k:\");\n$a=readline (\"ratings:\");\n//$b=\"100 53\";\n//$a=\"16 17 1 2 27 5 9 9 53 24 17 33 35 24 20 48 56 73 12 14 39 55 58 13 59 73 29 26 40 33 22 29 34 22 55 38 63 66 36 13 60 42 10 15 21 9 11 5 23 37 79 47 26 3 79 53 44 8 71 75 42 11 34 39 79 33 10 26 23 23 17 14 54 41 60 31 83 5 45 4 14 35 6 60 28 48 23 18 60 36 21 28 7 34 9 25 52 43 54 19\";\n$arr1=explode(\" \",$b);\n$a=explode(\" \",$a);\n$n=($arr1[0]);\n$k=($arr1[1]);\n($debug) ? print ($n . \"\\r\\n\"): \"\";\n($debug) ? print ($k . \"\\r\\n\"): \"\";\n($debug) ? print_r ($a): \"\" ;\n$uniq=array_unique($a);\nif ($debug) print (\"uniq:\".count($uniq).\"\\r\\n\");\n$out=[];\n$j=0;\n$l=0;\nif (count($uniq)>=$k):\n\n        foreach ($uniq as $value) {\n        $j++;\n                for ($i=0;$i<=$n;$i++){\n                        $l++;\n                        if ($a[$i] == $value):\n                        $out[]=$i+1;\n                        break;\n                        endif;\n                }\n        }\n\n        if ($debug):\n        print (\"j:\".$j.\"\\r\\n\");\n        print (\"l:\".$l.\"\\r\\n\");\n        endif;\n        print (\"YES\\r\\n\");\n        print (implode(\" \",$out).\"\\r\\n\");\nelse:\n        print(\"NO\");\nendif;\n"}, {"source_code": "<?php\n$debug=0;\n$b=readline (\"n k:\");\n$a=readline (\"ratings:\");\n$arr1=explode(\" \",$b);\n$a=explode(\" \",$a);\n$n=($arr1[0]);\n$k=($arr1[1]);\n($debug) ? print ($n . \"\\r\\n\"): \"\";\n($debug) ? print ($k . \"\\r\\n\"): \"\";\n($debug) ? print_r ($a): \"\" ;\n$uniq=array_unique($a);\n$out=[];\n\nif (count($uniq)>=$k):\n        foreach ($uniq as $value) {\n                for ($i=0;$i<=$k;$i++){\n                        if ($a[$i] == $value):\n                        $out[]=$i;\n                        break;\n                        endif;\n                }\n        }\n\n\n        print (\"YES\\r\\n\");\n        print (implode(\" \",$out));\nelse:\n        print(\"NO\");\nendif;\n"}, {"source_code": "<?php\n$debug=0;\n$b=readline (\"n k:\");\n$a=readline (\"ratings:\");\n$arr1=explode(\" \",$b);\n$a=explode(\" \",$a);\n$n=($arr1[0]);\n$k=($arr1[1]);\n($debug) ? print ($n . \"\\r\\n\"): \"\";\n($debug) ? print ($k . \"\\r\\n\"): \"\";\n($debug) ? print_r ($a): \"\" ;\n$uniq=array_unique($a);\n$out=[];\n\nif (count($uniq)>=$k):\n        foreach ($uniq as $value) {\n                for ($i=0;$i<=$k+1;$i++){\n                        if ($a[$i] == $value):\n                        $out[]=$i+1;\n                        break;\n                        endif;\n                }\n        }\n\n\n        print (\"YES\\r\\n\");\n        print (implode(\" \",$out));\nelse:\n        print(\"NO\");\nendif;\n"}, {"source_code": "$debug=0;\n$b=readline (\"n k:\");\n$a=readline (\"ratings:\");\n$arr1=explode(\" \",$b);\n$a=explode(\" \",$a);\n$n=($arr1[0]);\n$k=($arr1[1]);\n($debug) ? print ($n . \"\\r\\n\"): \"\";\n($debug) ? print ($k . \"\\r\\n\"): \"\";\n($debug) ? print_r ($a): \"\" ;\n$uniq=array_unique($a);\n$out=[];\n\nif (count($uniq)>=$k):\n        foreach ($uniq as $value) {\n                for ($i=0;$i<=$k;$i++){\n                        if ($a[$i] == $value):\n                        $out[]=$i;\n                        break;\n                        endif;\n                }\n        }\n\n\n        print (\"YES\\r\\n\");\n        print (implode(\" \",$out));\nelse:\n        print(\"NO\");\nendif;\n"}, {"source_code": "<?php\n$debug=0;\n$b=readline (\"n k:\");\n$a=readline (\"ratings:\");\n$arr1=explode(\" \",$b);\n$a=explode(\" \",$a);\n$n=($arr1[0]);\n$k=($arr1[1]);\n($debug) ? print ($n . \"\\r\\n\"): \"\";\n($debug) ? print ($k . \"\\r\\n\"): \"\";\n($debug) ? print_r ($a): \"\" ;\n$uniq=array_unique($a);\n$out=[];\n\nif (count($uniq)>=$k):\n        foreach ($uniq as $value) {\n                for ($i=0;$i<=$k;$i++){\n                        if ($a[$i] == $value):\n                        $out[]=$i+1;\n                        break;\n                        endif;\n                }\n        }\n\n\n        print (\"YES\\r\\n\");\n        print (implode(\" \",$out));\nelse:\n        print(\"NO\");\nendif;\n"}, {"source_code": "<?php\nfscanf(STDIN,\"%d %d\",$arrSize,$k);\n$arr=explode(' ',trim(fgets(STDIN)));\n$trgtArr[0]=$arr[0];\n$l=1;\n$m=1;\n$key[0]=1;\nfor ($i=1; $i <$arrSize ; $i++) \n{ \n\t$count=0;\n     for ($j=0; $j <count($trgtArr); $j++)\n     { \n     \tif($trgtArr[$j]!=$arr[$i])\n     \t{\n     \t\t$count++;\n     \t\tif($count==count($trgtArr))\n     \t\t{\n     \t\t\t$trgtArr[$l++]=$arr[$i];\n     \t\t\t$key[$m++]=$i+1;\n     \t\t}\n     \t}\n     }\n}\nif(count($key)==$k)\n  {\n\techo \"YES\\n\";\n\tfor ($i=0; $i <count($key) ; $i++)\n\t { \n\t\tif($i==$k-1)\n\t\t\techo \"$key[$i]\";\n\t\telse\n\t\t\techo \"$key[$i] \";\n\t}\n  }\t\n\telse\n\t\techo \"NO\\n\";\n\n"}], "src_uid": "5de6574d57ab04ca195143e08d28d0ad"}
{"nl": {"description": "Dawid has four bags of candies. The $$$i$$$-th of them contains $$$a_i$$$ candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in such a way that each friend receives the same amount of candies in total?Note, that you can't keep bags for yourself or throw them away, each bag should be given to one of the friends.", "input_spec": "The only line contains four integers $$$a_1$$$, $$$a_2$$$, $$$a_3$$$ and $$$a_4$$$ ($$$1 \\leq a_i \\leq 100$$$) \u2014 the numbers of candies in each bag.", "output_spec": "Output YES if it's possible to give the bags to Dawid's friends so that both friends receive the same amount of candies, or NO otherwise. Each character can be printed in any case (either uppercase or lowercase).", "sample_inputs": ["1 7 11 5", "7 3 2 5"], "sample_outputs": ["YES", "NO"], "notes": "NoteIn the first sample test, Dawid can give the first and the third bag to the first friend, and the second and the fourth bag to the second friend. This way, each friend will receive $$$12$$$ candies.In the second sample test, it's impossible to distribute the bags."}, "positive_code": [{"source_code": "    <?php\n    $a = explode(\" \", trim(fgets(STDIN)));\n    rsort($a);\n    if($a[0] == $a[1] + $a[2] + $a[3])\n    {\n         print \"YES\";\n    }\n    elseif($a[0] + $a[1] == $a[2] + $a[3])\n    {\n         print \"YES\";\n    }\n    elseif($a[0] + $a[2] == $a[1] + $a[3])\n    {\n         print \"YES\";\n    }\n    elseif($a[0] + $a[3] == $a[1] + $a[2])\n    {\n         print \"YES\";\n    }\n    else\n    {\n         print \"NO\";\n    }\n    ?>"}, {"source_code": "<?php\n$a = explode(\" \", trim(fgets(STDIN)));\nrsort($a);\nif($a[0] == $a[1] + $a[2] + $a[3])\n{\n     print \"YES\";\n}\nelseif($a[0] + $a[1] == $a[2] + $a[3])\n{\n     print \"YES\";\n}\nelseif($a[0] + $a[2] == $a[1] + $a[3])\n{\n     print \"YES\";\n}\nelseif($a[0] + $a[3] == $a[1] + $a[2])\n{\n     print \"YES\";\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$__fp = fopen('php://stdin', 'r');\n$a = array_map('intval', explode(' ', fgets($__fp)));\nsort($a);\nif (($a[0] + $a[3] == $a[1] + $a[2]) || ($a[0] + $a[1] + $a[2] == $a[3])) {\n    echo 'YES' . PHP_EOL;\n} else {\n    echo 'NO' . PHP_EOL;\n}"}, {"source_code": "<?php\n\nwhile(! feof(STDIN)){\n    $arr[]=fgets(STDIN);\n}\n\n$v=explode(\" \", $arr[0]);\nif($v[0]+$v[1]==$v[2]+$v[3]) echo \"Yes\";\nelseif($v[0]+$v[2]==$v[1]+$v[3]) echo \"Yes\";\nelseif($v[0]+$v[3]==$v[2]+$v[1]) echo \"Yes\";\nelseif($v[0]+$v[1]+$v[2]==$v[3]) echo \"Yes\";\nelseif($v[0]+$v[2]+$v[3]==$v[1]) echo \"Yes\";\nelseif($v[0]+$v[3]+$v[1]==$v[2]) echo \"Yes\";\nelseif($v[2]+$v[3]+$v[1]==$v[0]) echo \"Yes\";\nelse echo \"NO\";\n\n?>"}, {"source_code": "<?php\n$line=explode(\" \",trim(fgets(STDIN)));\n$s1=$line[0];\n$s2=$line[1];\n$s3=$line[2];\n$s4=$line[3];\n$s5=$line[0]+$line[1];\n$s6=$line[2]+$line[3];\n$s7=$line[1]+$line[2];\n$s8=$line[0]+$line[3];\n$s9=$line[0]+$line[2];\n$s10=$line[1]+$line[3];\n$s11=$line[1]+$line[2]+$line[3];\n$s12=$line[0]+$line[1]+$line[2];\n$s13=$line[0]+$line[1]+$line[3];\n$s14=$line[0]+$line[2]+$line[3];\n\n\nif($s5==$s6||$s7==$s8||$s9==$s10||$s1==$s11||$s2==$s14||$s3==$s13||$s4==$s12)\n\techo \"YES\";\nelse\n\techo \"NO\";\n"}], "negative_code": [{"source_code": "<?php\n$__fp = fopen('php://stdin', 'r');\n$a = array_map('intval', explode(' ', fgets($__fp)));\nsort($a);\nif ($a[0] + $a[3] == $a[1] + $a[2]) {\n    echo 'YES' . PHP_EOL;\n} else {\n    echo 'NO' . PHP_EOL;\n}"}, {"source_code": "<?php\n\nwhile(! feof(STDIN)){\n    $arr[]=fgets(STDIN);\n}\n\n$v=explode(\" \", $arr[0]);\nif($v[0]+$v[1]==$v[2]+$v[3]) echo \"Yes\";\nelseif($v[0]+$v[2]==$v[1]+$v[3]) echo \"Yes\";\nelseif($v[0]+$v[3]==$v[2]+$v[1]) echo \"Yes\";\nelse echo \"NO\";\n\n?>"}, {"source_code": "<?php\n$line=explode(\" \",trim(fgets(STDIN)));\n$first=$line[0]+$line[1];\n$second=$line[2]+$line[3];\n$third=$line[1]+$line[2];\n$fourth=$line[0]+$line[3];\n$fifth=$line[0]+$line[2];\n$sixth=$line[1]+$line[3];\nif($first==$second||$third==$fourth||$fifth==$sixth)\n\techo \"YES\";\nelse\n\techo \"NO\";\n"}], "src_uid": "5a623c49cf7effacfb58bc82f8eaff37"}
{"nl": {"description": "Mashmokh works in a factory. At the end of each day he must turn off all of the lights. The lights on the factory are indexed from 1 to n. There are n buttons in Mashmokh's room indexed from 1 to n as well. If Mashmokh pushes button with index i, then each light with index not less than i that is still turned on turns off.Mashmokh is not very clever. So instead of pushing the first button he pushes some of the buttons randomly each night. He pushed m distinct buttons b1,\u2009b2,\u2009...,\u2009bm (the buttons were pushed consecutively in the given order) this night. Now he wants to know for each light the index of the button that turned this light off. Please note that the index of button bi is actually bi, not i.Please, help Mashmokh, print these indices.", "input_spec": "The first line of the input contains two space-separated integers n and m (1\u2009\u2264\u2009n,\u2009m\u2009\u2264\u2009100), the number of the factory lights and the pushed buttons respectively. The next line contains m distinct space-separated integers b1,\u2009b2,\u2009...,\u2009bm\u00a0(1\u2009\u2264\u2009bi\u2009\u2264\u2009n). It is guaranteed that all lights will be turned off after pushing all buttons.", "output_spec": "Output n space-separated integers where the i-th number is index of the button that turns the i-th light off.", "sample_inputs": ["5 4\n4 3 1 2", "5 5\n5 4 3 2 1"], "sample_outputs": ["1 1 3 4 4", "1 2 3 4 5"], "notes": "NoteIn the first sample, after pressing button number 4, lights 4 and 5 are turned off and lights 1, 2 and 3 are still on. Then after pressing button number 3, light number 3 is turned off as well. Pressing button number 1 turns off lights number 1 and 2 as well so pressing button number 2 in the end has no effect. Thus button number 4 turned lights 4 and 5 off, button number 3 turned light 3 off and button number 1 turned light 1 and 2 off."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\n$d = array_reverse($c);\n$e = array_fill(0, $a, 0);\nfor($x = 0; $x < $b; $x++)\n{\n    for($y = $d[$x] - 1; $y < $a; $y++)\n    {\n        $e[$y] = $d[$x];\n    }\n}\nprint implode(\" \", $e);\n?>"}, {"source_code": "<?php\ndefine('LOCAL_ENV', false);\nif (LOCAL_ENV) {\n    error_reporting(E_ALL & !E_NOTICE);\n    $test = <<<INPUT\n5 4\n4 3 1 2\nINPUT;\n    $stdin = fopen('php://temp/in', 'rw');\n    fwrite($stdin, $test);\n    rewind($stdin);\n} else {\n    error_reporting(0);\n    $stdin = STDIN;\n}\ndefine('MY_STDIN', $stdin);\n\nlist($n,$m) = explode(' ', trim(fgets(MY_STDIN)));\n$a = explode(' ', trim(fgets(MY_STDIN)));\n$aa = array_fill(1, $n, 0);\nforeach ($a as $k) {\n    for ($i = $k; $i <= $n; $i++) {\n        if ($aa[$i] == 0) {\n            $aa[$i] = $k;\n        }\n    }\n}\necho join(' ', $aa);"}, {"source_code": "<?PHP\n$fileIN = fopen(\"php://stdin\", \"r\");\n$fileOUT = fopen(\"php://stdout\", \"w\");\n\n$line = trim(fgets($fileIN));\n$line = explode(\" \", $line);\n$n = $line[0];\n$k = $line[1];\n\n$line = trim(fgets($fileIN));\n$line = explode(\" \", $line);\n\n$a = array();\n\nfor ($i = 0; $i <= $n; ++$i) {\n    $a[$i] = 0;\n}\n\nfor ($i = 0; $i < $k; ++$i) {\n    for ($j = $line[$i]; $j <= $n; ++$j) {\n        if ($a[$j] == 0) {\n            $a[$j] = $line[$i];\n        }\n    }\n}\n\nfor ($i = 1; $i <= $n; ++$i) {\n    fprintf($fileOUT, $a[$i] . \" \");\n}\n\nfclose($fileIN);\nfclose($fileOUT);\n?>\n"}], "negative_code": [{"source_code": "<?php\ndefine('LOCAL_ENV', false);\nif (LOCAL_ENV) {\n    error_reporting(E_ALL & !E_NOTICE);\n    $test = <<<INPUT\n5 5\n5 4 3 2 1\nINPUT;\n    $stdin = fopen('php://temp/in', 'rw');\n    fwrite($stdin, $test);\n    rewind($stdin);\n} else {\n    error_reporting(0);\n    $stdin = STDIN;\n}\ndefine('MY_STDIN', $stdin);\n\nlist($n,$m) = explode(' ', trim(fgets(MY_STDIN)));\n$a = explode(' ', trim(fgets(MY_STDIN)));\nvar_dump($a);\n$aa = array_fill(1, $n, 0);\nforeach ($a as $k) {\n    for ($i = $k; $i <= $n; $i++) {\n        if ($aa[$i] == 0) {\n            $aa[$i] = $k;\n        }\n    }\n}\necho join(' ', $aa);"}, {"source_code": "<?PHP\n$fileIN = fopen(\"in.txt\", \"r\");\n$fileOUT = fopen(\"out.txt\", \"w\");\n\n$line = trim(fgets($fileIN));\n$line = explode(\" \", $line);\n$n = $line[0];\n$k = $line[1];\n\n$line = trim(fgets($fileIN));\n$line = explode(\" \", $line);\n\n$a = array();\n\nfor ($i = 0; $i <= $n; ++$i) {\n    $a[$i] = 0;\n}\n\nfor ($i = 0; $i < $k; ++$i) {\n    for ($j = $line[$i]; $j <= $n; ++$j) {\n        if ($a[$j] == 0) {\n            $a[$j] = $line[$i];\n        }\n    }\n}\n\nfor ($i = 1; $i <= $n; ++$i) {\n    fprintf($fileOUT, $a[$i] . \" \");\n}\n\nfclose($fileIN);\nfclose($fileOUT);\n?>\n"}], "src_uid": "2e44c8aabab7ef7b06bbab8719a8d863"}
{"nl": {"description": "Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium. The scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.", "input_spec": "The first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol \"|\" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale.  The second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet.  It is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.", "output_spec": "If you cannot put all the weights on the scales so that the scales were in equilibrium, print string \"Impossible\". Otherwise, print the description of the resulting scales, copy the format of the input. If there are multiple answers, print any of them.", "sample_inputs": ["AC|T\nL", "|ABC\nXYZ", "W|T\nF", "ABC|\nD"], "sample_outputs": ["AC|TL", "XYZ|ABC", "Impossible", "Impossible"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = str_split($a);\n$d = 0;\n$e = 0;\n$f = 0;\nfor($x = 0; $x < count($c); $x++)\n{\n    if(($c[$x] == \"|\") && ($e == 0))\n    {\n        $e = 1;   \n    }\n    elseif($e == 0)\n    {\n        $d++;\n    }\n    elseif($e == 1)\n    {\n        $f++;\n    }\n}\n$g = str_split($b);\n$n = $g;\narray_unshift($n, \" \");\nunset($n[0]);\n$o = array_search(\"|\", $n);\n$h = max($d, $f) - min($d, $f);\nif(((count($g) - $h) >= 0) && (((count($g) - $h) % 2) == 0))\n{\n    $i = ($d + $f + count($g)) / 2;\n    $j = $i - $d;\n    $k = $i - $f;\n    $l = implode(\"\", array_splice($c, 0, $d));\n    $m = implode(\"\", array_splice($c, $o));\n    for($x = 0; $x < $j; $x++)\n    {\n        $l .= $g[$x];\n    }\n    for($y = $x; $y < $k + $j; $y++)\n    {\n        $m .= $g[$y];\n    }\n    print $l . $m;\n}\nelse\n{\n    print \"Impossible\";\n}\n?>"}, {"source_code": "<?php\n$in=fgets(STDIN);\n$in2=fgets(STDIN);\n$in2=trim($in2);\n\n$strArr=explode(\"|\", $in);\n$str1=trim($strArr[0]);\n$str2=trim($strArr[1]);\n$len1=strlen($str1);\n$len2=strlen($str2);\n\n$del=abs($len1-$len2);\n$lend=strlen($in2);\n\n\nif($lend<$del) {echo \"Impossible\";\nexit();\n}\n\nif($del%2!=$lend%2) echo \"Impossible\";\nelse{\n\twhile(strlen($in2)!=0){\n\t\t$len1=strlen($str1);\n\t\t$len2=strlen($str2);\n\t\tif($len1<$len2){\n\t\t\t$str1=$str1.$in2[0];\n\t\t\t$in2=substr($in2, 1);\n\t\t}else if($len1>$len2){\n\t\t\t$str2=$str2.$in2[0];\n\t\t\t$in2=substr($in2, 1);\n\t\t}else{\n\t\t\t$str1=$str1.$in2[0];\n\t\t\t$str2=$str2.$in2[1];\n\t\t\t$in2=substr($in2, 2);\n\t\t}\n\n\t}\n\techo $str1.\"|\".$str2;\n}\n\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = str_split($a);\n$d = 0;\n$e = 0;\n$f = 0;\nfor($x = 0; $x < count($c); $x++)\n{\n    if(($c[$x] == \"|\") && ($e == 0))\n    {\n        $e = 1;   \n    }\n    elseif($e == 0)\n    {\n        $d++;\n    }\n    elseif($e == 1)\n    {\n        $f++;\n    }\n}\n$g = str_split($b);\n$n = $g;\narray_unshift($n, \" \");\nunset($n[0]);\n$o = array_search(\"|\", $n);\n$h = max($d, $f) - min($d, $f);\nif(((count($g) - $h) >= 0) && (((count($g) - $h) % 2) == 0))\n{\n    $i = ($d + $f + count($g)) / 2;\n    $j = $i - $d;\n    $k = $i - $f;\n    $l = implode(\"\", array_splice($c, 0, $d));\n    $m = implode(\"\", array_splice($c, $o));\n    for($x = 0; $x < $j; $x++)\n    {\n        $l .= $g[$x];\n    }\n    for($y = $x; $y < $k; $y++)\n    {\n        $m .= $g[$y];\n    }\n    print $l . $m;\n}\nelse\n{\n    print \"Impossible\";\n}\n?>"}], "src_uid": "917f173b8523ddd38925238e5d2089b9"}
{"nl": {"description": "You have a positive integer m and a non-negative integer s. Your task is to find the smallest and the largest of the numbers that have length m and sum of digits s. The required numbers should be non-negative integers written in the decimal base without leading zeroes.", "input_spec": "The single line of the input contains a pair of integers m, s (1\u2009\u2264\u2009m\u2009\u2264\u2009100,\u20090\u2009\u2264\u2009s\u2009\u2264\u2009900) \u2014 the length and the sum of the digits of the required numbers.", "output_spec": "In the output print the pair of the required non-negative integer numbers \u2014 first the minimum possible number, then \u2014 the maximum possible number. If no numbers satisfying conditions required exist, print the pair of numbers \"-1 -1\" (without the quotes).", "sample_inputs": ["2 15", "3 0"], "sample_outputs": ["69 96", "-1 -1"], "notes": null}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = array(\"1\");\nfor($x = 1; $x < $a; $x++)\n{\n    $c[$x] = 0;\n}\n$i = 0;\nfor($x = count($c) - 1; $x >= 0; $x--)\n{\n    for($y = 0; $y <= 9; $y++)\n    {\n        $c[$x] = $y;\n        $d = array_sum($c);\n        if($d == $b)\n        {\n            $i = 1;\n            break;\n        }\n    }\n    if($d == $b)\n    {\n        break;\n    }\n}\n$e = implode($c);\n$f = array_fill(0, $a, 9);\n$j = 0;\nfor($x = count($f) - 1; $x >= 0; $x--)\n{\n    for($y = 9; $y >= 0; $y--)\n    {\n        $f[$x] = $y;\n        $g = array_sum($f);\n        if($g == $b)\n        {\n            $j = 1;\n            break;\n        }\n    }\n    if($g == $b)\n    {\n        break;\n    }\n}\nif(($i == 0) || ($j == 0))\n{\n    print \"-1 -1\";\n}\nelse\n{\n    $h = implode($f);\n    print $e . \" \" . $h;\n}\n?>"}, {"source_code": "<?php\nlist($m,$s) = explode(\" \", trim(fgets(STDIN)));\n\nif ($s==0 && $m==1) {echo \"0 0\"; exit;}\nif ($s>$m*9 || $s<1) {echo \"-1 -1\"; exit;}\n$j=$s;\nfor ($i=1; $i<=$m; $i++){\n\t$a[0]++;\n\tif ($i==$m) $a[$i]=$j;\n\telse{\n\t\tif ($j>9){\n\t\t\t$a[$i]=9;\n\t\t\t$j-=9;\n\t\t}\n\t\telse{\n\t\t\t$a[$i]=$j-1;\n\t\t\t$j=1;\n\t\t}\n\t}\n}\nfor ($i=$a[0]; $i>0; $i--) echo $a[$i];\necho \" \";\n$j=$s;\nfor ($i=1; $i<=$m; $i++){\n\t$b[0]++;\n\tif ($j>9){\n\t\t$b[$i]=9;\n\t\t$j-=9;\n\t}\n\telse{\n\t\t$b[$i]=$j;\n\t\t$j=0;\n\t}\n}\nfor ($i=1; $i<=$b[0]; $i++) echo $b[$i];\n?>"}, {"source_code": "<?php\n$input2=trim(fgets(STDIN));\nsettype($input2,'string');\n$input=explode(' ',$input2);\n$num=$input[0];\n$jame=$input[1];\n$v=str_repeat('0',$num-1);\n$min='1'.$v;\n$mino=str_split($min);\nif( $jame == 0 and $num!=1){\n      echo \"-1 -1\";\n      exit;\n}\nif($num * 9 < $jame ){\necho \"-1 -1\";\nexit;\n}\n$max=str_repeat('9',$num);\n$q=$num-1;\n$a=$jame-1;\n$maxo=str_split($max);\nwhile ($a>=9) { \n      $mino[$q]+=9;\n      $a-=9;\n      $q--;\n}\n$mino[$q]+=$a;\n$x=join('',$mino);\necho $x;\necho \"\\n\";\n$s=$jame;\n$q2=$num-1;\n$i=0;\n$maxo=str_split(str_repeat('0',$num));\nwhile ($s >=9 and $i <$num) {\n      $maxo[$i]+=9;\n      $s-=9;\n      $i++;\n}\nif($s !=0){\n      @$maxo[$i]+=$s;\n}\n$y=join('',$maxo);\necho $y;"}], "negative_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = $b / $a;\n$d = floor($c);\n$j = $b % $a;\nif($c == $d)\n{\n    $e = array_fill(0, $a, $c);\n    $f = 0;\n    $g = $a - 1;\n    for($x = 1; $x <= 1000; $x++)\n    {\n        if($f == $g)\n        {\n            break;\n        }\n        if($e[$g] == 9)\n        {\n            $g--;\n        }\n        elseif($e[$f] == 0)\n        {\n            $f++;\n        }\n        else\n        {\n            $e[$f]--;\n            $e[$g]++;\n        }\n    }\n    if(($b == 0) || (array_sum($e) < $b))\n    {\n        print \"-1 -1\";\n    }\n    else\n    {\n        $h = $e;\n        $i = $e;\n        sort($h);\n        rsort($i);\n        print abs(implode(\"\", $h)) . \" \" . abs(implode(\"\", $i));\n    }\n}\nelse\n{\n    $k = $j + $d;\n    $e = array_merge(array_fill(0, $a - 1, $d), array($k));\n    $f = 0;\n    $g = $a - 1;\n    for($x = 1; $x <= 1000; $x++)\n    {\n        if($f == $g)\n        {\n            break;\n        }\n        if($e[$g] == 9)\n        {\n            $g--;\n        }\n        elseif($e[$f] == 0)\n        {\n            $f++;\n        }\n        else\n        {\n            $e[$f]--;\n            $e[$g]++;\n        }\n    }\n    if(($b == 0) || (array_sum($e) < $b))\n    {\n        print \"-1 -1\";\n    }\n    else\n    {\n        $h = $e;\n        $i = $e;\n        sort($h);\n        rsort($i);\n        print abs(implode(\"\", $h)) . \" \" . abs(implode(\"\", $i));\n    }\n}\n?>"}, {"source_code": "<?php\n$num=trim(fgets(STDIN));\nsettype($num,'string');\n$jame=trim(fgets(STDIN));\nsettype($jame,'string');\n$v=str_repeat('0',$num-1);\n$min='1'.$v;\n$mino=str_split($min);\nif($num * 9 < $jame){\necho \"-1 -1\";\nexit;\n}\n$max=str_repeat('9',$num);\n$q=$num-1;\n$a=$jame-1;\n$maxo=str_split($max);\nwhile ($a>=9) { \n      $mino[$q]+=9;\n      $a-=9;\n      $q--;\n}\n$mino[$q]+=$a;\n$x=join('',$mino);\necho $x;\necho \"\\n\";\n$s=$jame;\n$q2=$num-1;\n$i=0;\n$maxo=str_split(str_repeat('0',$num));\nwhile ($s >=9 and $i <$num) {\n      $maxo[$i]+=9;\n      $s-=9;\n      $i++;\n}\nif($s !=0){\n      @$maxo[$i]+=$s;\n}\n$y=join('',$maxo);\necho $y;"}, {"source_code": "<?php\n$num=trim(fgets(STDIN));\nsettype($num,'string');\n$jame=trim(fgets(STDIN));\nsettype($jame,'string');\n$v=str_repeat('0',$num-1);\n$min='1'.$v;\n$mino=str_split($min);\n\n$max=str_repeat('9',$num);\n$q=$num-1;\n$a=$jame-1;\n$maxo=str_split($max);\nwhile ($a>=9) { \n      $mino[$q]+=9;\n      $a-=9;\n      $q--;\n}\n$mino[$q]+=$a;\necho join('',$mino);\necho \"\\n\";\n$s=$jame;\n$q2=$num-1;\n$i=0;\n$maxo=str_split(str_repeat('0',$num));\nwhile ($s >=9 and $i <$num) {\n      $maxo[$i]=9;\n      $s-=9;\n      $i++;\n}\n@$maxo[$i]+=$s;\necho join('',$maxo);"}, {"source_code": "<?php\n$input2=trim(fgets(STDIN));\nsettype($input2,'string');\n$input=explode(' ',$input2);\n$num=$input[0];\n$jame=$input[1];\n$v=str_repeat('0',$num-1);\n$min='1'.$v;\n$mino=str_split($min);\nif($num * 9 < $jame  or $jame == 0){\necho \"-1 -1\";\nexit;\n}\n$max=str_repeat('9',$num);\n$q=$num-1;\n$a=$jame-1;\n$maxo=str_split($max);\nwhile ($a>=9) { \n      $mino[$q]+=9;\n      $a-=9;\n      $q--;\n}\n$mino[$q]+=$a;\n$x=join('',$mino);\necho $x;\necho \"\\n\";\n$s=$jame;\n$q2=$num-1;\n$i=0;\n$maxo=str_split(str_repeat('0',$num));\nwhile ($s >=9 and $i <$num) {\n      $maxo[$i]+=9;\n      $s-=9;\n      $i++;\n}\nif($s !=0){\n      @$maxo[$i]+=$s;\n}\n$y=join('',$maxo);\necho $y;"}], "src_uid": "75d062cece5a2402920d6706c655cad7"}
{"nl": {"description": "Shapur was an extremely gifted student. He was great at everything including Combinatorics, Algebra, Number Theory, Geometry, Calculus, etc. He was not only smart but extraordinarily fast! He could manage to sum 1018 numbers in a single second.One day in 230 AD Shapur was trying to find out if any one can possibly do calculations faster than him. As a result he made a very great contest and asked every one to come and take part.In his contest he gave the contestants many different pairs of numbers. Each number is made from digits 0 or 1. The contestants should write a new number corresponding to the given pair of numbers. The rule is simple: The i-th digit of the answer is 1 if and only if the i-th digit of the two given numbers differ. In the other case the i-th digit of the answer is 0.Shapur made many numbers and first tried his own speed. He saw that he can perform these operations on numbers of length \u221e (length of a number is number of digits in it) in a glance! He always gives correct answers so he expects the contestants to give correct answers, too. He is a good fellow so he won't give anyone very big numbers and he always gives one person numbers of same length.Now you are going to take part in Shapur's contest. See if you are faster and more accurate.", "input_spec": "There are two lines in each input. Each of them contains a single number. It is guaranteed that the numbers are made from 0 and 1 only and that their length is same. The numbers may start with 0. The length of each number doesn't exceed 100.", "output_spec": "Write one line \u2014 the corresponding answer. Do not omit the leading 0s.", "sample_inputs": ["1010100\n0100101", "000\n111", "1110\n1010", "01110\n01100"], "sample_outputs": ["1110001", "111", "0100", "00010"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = str_split(trim(fgets(STDIN)));\n$b = str_split(trim(fgets(STDIN)));\nfor($x = 0; $x < count($a); $x++)\n{\n    if((($a[$x] == 0) && ($b[$x] == 0)) || (($a[$x] == 1) && ($b[$x] == 1)))\n    {\n        print \"0\";\n    }\n    else\n    {\n        print \"1\";\n    }\n}\n?>"}, {"source_code": "<?php\n    $fp = fopen('php://stdin', 'r');\n    $a = rtrim(fgets($fp));\n    $b = rtrim(fgets($fp));\n    $c = '';\n     \n    $len = strlen($a);\n    for($i = 0; $i < $len; $i++)\n        $c .= (int)($a[$i] xor $b[$i]);\n    echo $c;\n?>"}, {"source_code": "<?php\n\nif (getenv('APPLICATION_ENV') == 'development') {\n    $inputStream = STDIN;\n    $outputStream = STDOUT;\n} else {\n    $inputStream = STDIN;\n    $outputStream = STDOUT;\n}\n\n$input = trim(fgets($inputStream));\n$input2 = trim(fgets($inputStream));\n\n$out = '';\n\nfor ($i = 0; $i < strlen($input); $i++) {\n    $out .= $input{$i} != $input2{$i} ? '1' : '0';\n}\n\nfwrite($outputStream, $out);\n\nif (getenv('APPLICATION_ENV') == 'development') {\n    fclose($inputStream);\n    fclose($outputStream);\n}"}, {"source_code": "<?php\nfscanf(STDIN, \"%s\", $a);\nfscanf(STDIN, \"%s\", $b);$c='';\nfor($i=0;$i<strlen($a);$i++){\nif($a[$i]==$b[$i]){$c.=0;}else{$c.=1;}\n}\nprintf(\"%s\\n\", $c);\n\n\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%s\", $a);\n    fscanf(STDIN, \"%s\", $b);\n    \n    for ($i = 0; $i < strlen($a); $i++){\n        if ($a[$i]  == $b[$i]){\n            echo 0;\n        }\n        else {\n            echo 1;\n        }\n    }\n        \n"}, {"source_code": "<?php\n    fscanf(STDIN, \"%s\", $a);\n    fscanf(STDIN, \"%s\", $b);\n    $arr = array();\n        for ($i = 0; $i < strlen($a); $i++){\n            if ($a[$i]  == $b[$i]){\n                $arr[$i] = 0;\n            }\n            else $arr[$i] = 1;\n            echo $arr[$i];\n        }\n        "}, {"source_code": "<?php\nfunction input()\n{\n    while (($line = trim(fgets(STDIN))) != PHP_EOL) {\n        yield $line;\n    }\n}\n\n$COUNT = 0;\n$xy = array();\nforeach (input() as $line) {\n    $q = $line;\n\n    array_push($xy, array_map('intval',str_split($q)));\n\n    if (++$COUNT > 1) {\n        break;\n    }\n}\n\nfor($i = 0; $i<count($xy[0]); ++$i) {\n    echo $xy[0][$i] ^ $xy[1][$i];\n}"}, {"source_code": "<?php\nfunction input()\n{\n    while (($line = trim(fgets(STDIN))) != PHP_EOL) {\n        yield $line;\n    }\n}\n\n$COUNT = 0;\n$xy = array();\nforeach (input() as $line) {\n    $q = $line;\n\n    // array_push($xy, array_map('intval',str_split($q)));\n    array_push($xy, $q);\n\n    if (++$COUNT > 1) {\n        break;\n    }\n}\n\nfor($i = 0; $i<strlen($xy[0]); ++$i) {\n    echo intval($xy[0][$i])^intval($xy[1][$i]);\n}"}, {"source_code": "<?php\nfunction input()\n{\n    while (($line = trim(fgets(STDIN))) != PHP_EOL) {\n        yield $line;\n    }\n}\n\n$COUNT = 0;\n$xy = array();\nforeach (input() as $line) {\n    $q = $line;\n\n    // array_push($xy, array_map('intval',str_split($q)));\n    array_push($xy, $q);\n\n    if (++$COUNT > 1) {\n        break;\n    }\n}\n\nfor($i = 0; $i<strlen($xy[0]); ++$i) {\n   if ($xy[0][$i] != $xy[1][$i])\n        echo 1;\n    else {\n        echo 0;\n    }\n}"}, {"source_code": "<?php\nfunction input()\n{\n    while (($line = trim(fgets(STDIN))) != PHP_EOL) {\n        yield $line;\n    }\n}\n\n$COUNT = 0;\n$xy = array();\nforeach (input() as $line) {\n    if ($COUNT == 0) {\n        $r1 = $line;\n        ++$COUNT;\n        continue;\n    }\n    // $q = $line;\n\n    // array_push($xy, array_map('intval',str_split($q)));\n    // array_push($xy, $q);\n    for ($i = 0; $i < strlen($r1); ++$i) {\n        if ($r1[$i] != $line[$i]) {\n            echo 1;\n        } else {\n            echo 0;\n        }\n    }\n\n    if (++$COUNT > 1) {\n        break;\n    }\n}\n\n"}, {"source_code": "<?php\n$n1 = trim(fgets(STDIN));\n$n2 = trim(fgets(STDIN));\n$r=array();\nfor($i=0;$i<strlen($n1);$i++) {\n    if($n1[$i]==$n2[$i]){\n        $r[]='0';\n        continue;\n    }\n    $r[]='1';\n}\necho(implode('',$r));\n"}, {"source_code": "<?php\n/*\n * A. \u0411\u044b\u0441\u0442\u0440\u044b\u0439 \u043c\u0430\u0442\u0435\u043c\u0430\u0442\u0438\u043a\n */\n\n$s1 = trim(fgets(STDIN));\n$s2 = trim(fgets(STDIN));\n$output = array();\n\nfor( $i=0; $i<strlen($s1); $i++ ){\n    if( $s1[$i] != $s2[$i] ){\n        $output[] = 1;\n    }else{\n        $output[] = 0;\n    }\n}\necho implode('',$output);\n"}, {"source_code": "<?php\n$fl=STDIN;//fopen(\"input.txt\",\"r\");\n$a=trim(fgets($fl));\n$b=trim(fgets($fl));\nfor($i=0;$i<strlen($a);++$i)\n    printf(\"%d\",((int)($a[$i])^(int)($b[$i])));\nprintf(\"\\n\");\n?>"}, {"source_code": "<?php\n$a=trim(fgets(STDIN));\n$b=trim(fgets(STDIN));\nfor($i=0;$i<strlen($a);++$i)\n    printf(\"%d\",((int)($a[$i])^(int)($b[$i])));\nprintf(\"\\n\");\n?>"}, {"source_code": "<?php\n$line1 = trim(fgets(STDIN));\n$line2 = trim(fgets(STDIN));\n$length = strlen($line1);\nfor ($i=0;$i<$length;$i++)\n{\n    if ($line1[$i]==$line2[$i])echo 0;\n    else echo 1;\n}"}, {"source_code": "<?php\n$input=str_split(trim(fgets(STDIN)));\n$input2=str_split(trim(fgets(STDIN)));\n$a=null;\nfor ($i=0;$i<count($input);$i++) { \n      if($input[$i] == $input2[$i]){\n        $a.='0';\n      }else{\n            $a.='1';\n      }\n}\necho $a;"}, {"source_code": "<?php\nfscanf(STDIN,\"%s\",$str1);\nfscanf(STDIN,\"%s\",$str2);\n$str3=\"\";\nfor($i=0;$i<strlen($str1);$i++)\n{\n\t\n\t\tif($str1[$i]==$str2[$i])\n\t\t{\n\t\t\t$str3.=0;\n\t\t\t\n\t\t}\n\t\t\n\t\telse\t$str3.=1;\n\n\t}\necho $str3;"}, {"source_code": "<?php\n$one=readline();\n$two=readline();\n//$one = '1010100';\n$one = str_split($one);\n//$two = '0100101';\n$two = str_split($two);\n$i = 0;\n$summa = array();\nforeach ($one as $v) {\n    if ($v==$two[$i]){\n        array_push($summa, \"0\");\n        $i++;\n    } else {\n        array_push($summa, \"1\");\n        $i++;\n    }\n}\necho implode($summa);"}, {"source_code": "<?php\n    define('DEBUG', 0);\n    \n    if(DEBUG) $GLOBALS['file'] = fopen('input.txt', 'r');\n    function debug($var){echo '<pre>';print_r($var);echo '</pre>';} \n    function read_line()\n    {       \n        if(DEBUG) { $file = $GLOBALS['file'];$line = trim(fgets($file));}\n        else $line = trim(fgets(STDIN));\n        return $line;\n    }\n    function get_array($line){return explode(' ', $line);}\n    function read_array(){return get_array(read_line());}   \n    //echo \"$s\\n\";\n    /*****************************************************************/\n    \n    $line1 = read_line();\n    $line2 = read_line();\n    $len = strlen($line1);\n    \n    for ($i=0; $i<$len; $i++)\n    {\n        $char1 = $line1[$i];\n        $char2 = $line2[$i];\n        \n        if($char1 == $char2) echo '0';\n        else echo '1';\n    }\n?>"}, {"source_code": "<?php\n$a = str_split(trim(fgets(STDIN)));\n$b = str_split(trim(fgets(STDIN)));\n$ans = \"\";\nfor($i=0;$i<count($a);$i++){\n    if ($a[$i] != $b[$i])\n        $ans .= \"1\";\n    else\n        $ans .= \"0\";\n}\necho $ans;\n?>"}, {"source_code": "<?php\n$str1 = trim(fgets(STDIN));\n$str2 = trim(fgets(STDIN));\n\nfor ($i = 0; $i < strlen($str1); $i++)\n    echo $str1[$i] === $str2[$i] ? \"0\" : \"1\";\n?>\n"}, {"source_code": "<?php\n\n//First Get The Input.\n$input = file_get_contents(\"php://stdin\");\n\n$first_line = explode(\"\\n\",$input)[0];\n$second_line = explode(\"\\n\",$input)[1];\n\n$given_str = \"\";\n\n//Loop Throw Them.\nfor($i = 0;$i < strlen($first_line) - 1;$i++) {\n    \n   if($first_line[$i] != $second_line[$i]) {\n       \n        $given_str .= \"1\";\n       \n   }else {\n       \n        $given_str .= \"0\";\n       \n   }     \n    \n}\n\necho $given_str;"}, {"source_code": "<?php\n// 61A  \u0411\u044b\u0441\u0442\u0440\u044b\u0439 \u043c\u0430\u0442\u0435\u043c\u0430\u0442\u0438\u043a \n$in = fopen(\"php://stdin\", 'r');\n\n$str1 = fgets($in);\n$str2 = fgets($in);\n//list($n, $t) = preg_split('/ /', $input_line, -1, PREG_SPLIT_NO_EMPTY);\n$len = strlen($str1) - 2;\n\n$out = '';\n\nfor ($i=0; $i < $len ; $i++) { \n    if ($str1[$i] === $str2[$i]) {\n        $out .= '0';\n    } else {\n        $out .= '1';\n    }\n}\n\necho $out;\n\n?>"}, {"source_code": "<?php\n$aNums = explode(\"\\n\", stream_get_contents(fopen(\"php://stdin\", 'r')));\nfor($i = 0; $i < strlen($aNums[0])-1; $i++){\nif($aNums[0][$i] == $aNums[1][$i]) $aNums[2] .= 0; else $aNums[2] .= 1;\n}\necho $aNums[2];\n?>"}, {"source_code": "<?php \n    $IN = STDIN;\n    //$IN =  fopen(\"input.txt\",\"r\");\n    fscanf($IN, \"%s\",$s1);\n    fscanf($IN, \"%s\",$s2);\n    for($i=0;$i<strlen($s1);$i++)\n      $out .= ($s1[$i]==$s2[$i])?\"0\":\"1\";\n    echo $out;  \n\n?>"}, {"source_code": "<?php \n\tfscanf(STDIN, \"%s\",$s1);\n\tfscanf(STDIN, \"%s\",$s2);\n\tfor($i=0;$i<strlen($s1);$i++)\n\t  $out .= ($s1[$i]==$s2[$i])?\"0\":\"1\";\n\techo $out;  \n\t\n?>"}, {"source_code": "<?php\n$a=fgets(STDIN);\n$b=fgets(STDIN);\n$a=trim($a);\n$b=trim($b);\n$l=strlen($a);\n\nfor($i=0;$i<$l;$i++) \n   echo $a[$i]==$b[$i] ? '0' : '1'; \n\n?>"}, {"source_code": "<?php\n\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n\nfor($i=0;$i<strlen($a);$i++) print ($a[$i]==$b[$i]?'0':'1');\n?>"}, {"source_code": "<?\n$fp=fopen('php://stdin', 'r');\n$lines=stream_get_contents($fp);\n\n$lines=trim($lines);\n$lines=explode(\"\\n\", $lines);\n\n$first=trim($lines[0]);\n$second=trim($lines[1]);\nfor ($i=0; $i<strlen($first); $i++)\n    echo ($first{$i}!=$second{$i})?'1':'0';\n\n?>"}, {"source_code": "<?php\nerror_reporting(\"off\");\n//61A: Ultra-Fast Mathematician\n$one = str_split(trim(fgets(STDIN))); //$one = str_split(\"000\");\n$two = str_split(trim(fgets(STDIN))); //$two = str_split(\"111\");\n$length = count($one);\n$result = \"\";\nfor ($i = 0; $i < $length; $i++) {\n    if ($one[$i] !== $two[$i]) {\n        $result .=\"1\";\n    } else {\n        $result .=\"0\";\n    }\n}\necho $result;\n?>"}], "negative_code": [{"source_code": "<?php\nfunction input()\n{\n    while (($line = trim(fgets(STDIN))) != PHP_EOL) {\n        yield $line;\n    }\n}\n\n$COUNT = 0;\n$xy = array();\nforeach (input() as $line) {\n    $q = $line;\n\n    // array_push($xy, array_map('intval',str_split($q)));\n    array_push($xy, $q);\n\n    if (++$COUNT > 1) {\n        break;\n    }\n}\n\nfor($i = 0; $i<strlen($xy[0]); ++$i) {\n    echo $xy[0][$i] ^ $xy[1][$i];\n}"}, {"source_code": "<?php\n\n$a=trim(fgets(STDIN));\n$b=trim(fgets(STDIN));\nfor($i=0;$i<strlen($a);++$i)\n    printf(\"%d\",$a[$i]^$b[$i]);\nprintf(\"\\n\");"}, {"source_code": "<?php\nfscanf(STDIN,\"%s %s\",$a,$b);\n$l=strlen($a);\nfor($i=0;$i<$l;$i++) \n    $a[$i]=$a[$i]==$b[$i] ? '0' : '1'; \necho $a;\n?>"}, {"source_code": "$f=fopen(STDIN,\"r\");\n$a=fgets($f);\n$b=fgets($f);\n\nfunction xors($a,$b){\n    $r='';\n    for ($i=0,$n=strlen($a);$i<$a;$i++){\n        //for ($j=$i;$j<$n;$j++){\n            if($a[$i]==$b[$i]) $r.='0'; \n            else $r.='1'; \n        //  break;\n        //}\n    }\n    return (int)$r;\n}\necho xors($a,$b);"}, {"source_code": "<?php\nfscanf(STDIN,\"%s %s\",$a,$b);\necho $a,'_',$b,'_';\n$l=strlen($a);\nfor($i=0;$i<$l;$i++) \n    $a[$i]=$a[$i]==$b[$i] ? '0' : '1'; \necho $a;\n?>"}, {"source_code": "<?php\n$f=fopen(STDIN,\"r\");\n$a=fgets($f);\n$b=fgets($f);\n\nfunction xors($a,$b){\n    $r='';\n    for ($i=0,$n=strlen($a);$i<$a;$i++){\n        //for ($j=$i;$j<$n;$j++){\n            if($a[$i]==$b[$i]) $r.='0'; \n            else $r.='1'; \n        //  break;\n        //}\n    }\n    return (int)$r;\n}\necho xors($a,$b);\n?>"}, {"source_code": "<?\nfunction xors($a,$b){\n    $r='';\n    for ($i=0,$n=strlen($a);$i<$a;$i++){\n        for ($j=$i;$j<$n;$j++){\n            if($a[$i]==$b[$j]) $r.='0'; \n            else $r.='1'; \n            break;\n        }\n    }\n    return (int)$r;\n}\n?>"}, {"source_code": "<?php\nfscanf(STDIN,$a,$b);\nfunction xors($a,$b){\n    $r='';\n    for ($i=0,$n=strlen($a);$i<$a;$i++){\n            if($a[$i]==$b[$i]) $r.='0'; \n            else $r.='1'; \n    }\n    return (int)$r;\n}\necho xors($a,$b);\n?>"}, {"source_code": "<?php\n$a=fgets(STDIN);\n$b=fgets(STDIN);\n$l=strlen($a);\nfor($i=0;$i<$l;$i++) \n    $a[$i]=$a[$i]==$b[$i] ? '0' : '1'; \necho $a;\n?>"}, {"source_code": "<?php\nfscanf(STDIN,\"%s %s\",$a,$b);\nfunction xors($a,$b){\n    $r='';\n    for ($i=0,$n=strlen($a);$i<$a;$i++){\n        for ($j=$i;$j<$n;$j++){\n            if($a[$i]==$b[$i]) $r.='0'; \n            else $r.='1'; \n            break;\n        }\n    }\n    return (int)$r;\n}\necho xors($a,$b);\n?>"}, {"source_code": "function xors($a,$b){\n\t$r='';\n\tfor ($i=0,$n=strlen($a);$i<$a;$i++){\n\t\tfor ($j=$i,$m=strlen($a);$j<$m;$j++){\n\t\t\tif($a[$i]==$b[$j]) $r.='0'; \n\t\t\telse $r.='1'; \n\t\t\tbreak;\n\t\t}\n\t}\n\treturn $r;\n}"}, {"source_code": "<?php\n$a=fgets(STDIN);\n$b=fgets(STDIN);\necho $a,'_',$b,'_';\n$l=strlen($a);\nfor($i=0;$i<$l;$i++) \n    $a[$i]=$a[$i]==$b[$i] ? '0' : '1'; \necho $a;\n?>"}, {"source_code": "<?php\nfscanf(STDIN,\"%s %s\",$a,$b);\nfunction xors($a,$b){\n    $r='';\n    for ($i=0,$n=strlen($a);$i<$a;$i++){\n        //for ($j=$i;$j<$n;$j++){\n            if($a[$i]==$b[$i]) $r.='0'; \n            else $r.='1'; \n        //  break;\n        //}\n    }\n    return (int)$r;\n}\necho xors($a,$b);\n?>"}, {"source_code": "<?php\n$a=fgets(STDIN);\n$b=fgets(STDIN);\n$l=strlen($a);\n$hz='';\nfor($i=0;$i<$l;$i++) \n    $hz.=$a[$i]==$b[$i] ? '0' : '1'; \necho $hz;\n?>"}, {"source_code": "<?php\n$a=fgets($f);\n$b=fgets($f);\n$a=trim($a);\n$b=trim($b);\nfunction xors($a,$b){\n    $r='';\n    for ($i=0,$n=strlen($a);$i<$a;$i++){\n        for ($j=$i;$j<$n;$j++){\n            if($a[$i]==$b[$i]) $r.='0'; \n            else $r.='1'; \n            break;\n        }\n    }\n    return $r;\n}\necho xors($a,$b);\n?>"}], "src_uid": "3714b7596a6b48ca5b7a346f60d90549"}
{"nl": {"description": "Given a positive integer n, find k integers (not necessary distinct) such that all these integers are strictly greater than 1, and their product is equal to n.", "input_spec": "The first line contains two integers n and k (2\u2009\u2264\u2009n\u2009\u2264\u2009100000, 1\u2009\u2264\u2009k\u2009\u2264\u200920).", "output_spec": "If it's impossible to find the representation of n as a product of k numbers, print -1. Otherwise, print k integers in any order. Their product must be equal to n. If there are multiple answers, print any of them.", "sample_inputs": ["100000 2", "100000 20", "1024 5"], "sample_outputs": ["2 50000", "-1", "2 64 2 2 2"], "notes": null}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = 0;\n$d = array();\nfor($x = 1; $x <= $b; $x++)\n{\n     $e = 0;\n     for($y = 2; $y <= $a; $y++)\n     {\n          if($y == $a)\n          {\n               $e = 1;\n          }\n          $f = $a % $y;\n          $g = $a / $y;\n          if($f == 0)\n          {\n               if($x == $b)\n               {\n                    $d[count($d)] = $a;\n               }\n               else\n               {\n                    $d[count($d)] = $y;\n                    $a = $g;\n               }\n               break;\n          }\n     }\n     if($e == 1)\n     {\n          break;\n     }\n}\nif($b == count($d))\n{\n     print implode(\" \", $d);\n}\nelse\n{\n     print \"-1\";\n}\n?>"}], "negative_code": [], "src_uid": "bd0bc809d52e0a17da07ccfd450a4d79"}
{"nl": {"description": "Flatland is inhabited by pixels of three colors: red, green and blue. We know that if two pixels of different colors meet in a violent fight, only one of them survives the fight (that is, the total number of pixels decreases by one). Besides, if pixels of colors x and y (x\u2009\u2260\u2009y) meet in a violent fight, then the pixel that survives the fight immediately changes its color to z (z\u2009\u2260\u2009x;\u00a0z\u2009\u2260\u2009y). Pixels of the same color are friends, so they don't fight.The King of Flatland knows that his land will be peaceful and prosperous when the pixels are of the same color. For each of the three colors you know the number of pixels of this color that inhabit Flatland. Help the king and determine whether fights can bring peace and prosperity to the country and if it is possible, find the minimum number of fights needed to make the land peaceful and prosperous. ", "input_spec": "The first line contains three space-separated integers a, b and c (0\u2009\u2264\u2009a,\u2009b,\u2009c\u2009\u2264\u2009231;\u00a0a\u2009+\u2009b\u2009+\u2009c\u2009&gt;\u20090) \u2014 the number of red, green and blue pixels, correspondingly.", "output_spec": "Print a single number \u2014 the minimum number of pixel fights before the country becomes peaceful and prosperous. If making the country peaceful and prosperous is impossible, print -1.", "sample_inputs": ["1 1 1", "3 1 0"], "sample_outputs": ["1", "3"], "notes": "NoteIn the first test sample the country needs only one fight to achieve peace and prosperity. Besides, it can be any fight whatsoever. For example, let's assume that the green and the blue pixels fight, then the surviving pixel will be red. As a result, after the fight there are two red pixels. There won't be other pixels.In the second sample the following sequence of fights is possible: red and blue, green and red, red and blue. As a result, after all fights there is one green pixel left."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = array($a, $b, $c);\nsort($d);\nif((($d[0] % 2) == ($d[1] % 2)) && (($d[1] % 2) == ($d[2] % 2)) && (($d[0] % 2) == ($d[2] % 2)))\n{\n    print $d[1];\n}\nelse\n{\n    if(($d[0] % 2) == ($d[1] % 2))\n    {\n        print $d[1];\n    }\n    elseif(($d[0] % 2) == ($d[2] % 2))\n    {\n        print $d[2];\n    }\n    else\n    {\n        print $d[2];\n    }\n}\n?>"}, {"source_code": "<?php\n// \u041f\u0438\u043a\u0441\u0435\u043b\u0438\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$m1 = array($a, $b, $c,);\n$d = 0; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0431\u0438\u0442\u0432\nif((($a == 0) && ($b == 0) && ($c == 0)) || (($a == 0) && ($b == 0)) || (($a == 0) && ($c == 0)) || (($b == 0) && ($c == 0)))\n{\n    print \"0\";\n}\nelseif($a == $b)\n{\n    print $a;\n}\nelseif($b == $c)\n{\n    print $b;\n}\nelseif($a == $c)\n{\n    print $c;\n}\nelse\n{\n    rsort($m1);\n    if((($m1[0] - $m1[1]) % 2 == 0) && (($m1[0] - $m1[2]) % 2 != 0))\n    {\n        $e = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[2] < $f)\n        {\n            $g = $f - $m1[2];\n            $d = $m1[2] + (($m1[0] - $m1[2]) - ($m1[1] + $m1[2])) + $m1[1] + $m1[2];\n            print $d;      \n        }\n        else\n        {\n            $d = $f + $e;\n            print $d;\n        }\n    }\n    elseif((($m1[0] - $m1[1]) % 2 != 0) && (($m1[1] - $m1[2]) % 2 == 0))\n    {\n        $e = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[1] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[0] < $f)\n        {\n            $g = $f - $m1[0];\n            $d = $m1[0] + (($m1[1] - $m1[0]) - ($m1[2] + $m1[0])) + $m1[2] + $m1[0];\n            print $d;      \n        }\n        else\n        {\n            $d = $f + $e;\n            print $d;\n        }\n    }\n    elseif((($m1[0] - $m1[2]) % 2 == 0) && (($m1[0] - $m1[1]) % 2 != 0))\n    {\n        $e = ($m1[0] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[1] < $f)\n        {\n            $g = $f - $m1[1];\n            $d = $m1[1] + (($m1[0] - $m1[1]) - ($m1[2] + $m1[1])) + $m1[2] + $m1[1];\n            print $d;      \n        }\n        else\n        {\n            $d = $f + $e;\n            print $d;\n        }\n    }\n    elseif((($m1[0] - $m1[1]) % 2 == 0) && (($m1[1] - $m1[2]) % 2 == 0))\n    {\n        $e1 = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f1 = $m1[2] - $e1; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        $e2 = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f2 = $m1[0] - $e2; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if(($f1 + $e1) >= ($f2 + $e2))\n        {\n            $e = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n            $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n            if($m1[2] < $f)\n            {\n                $g = $f - $m1[2];\n                $d = $m1[2] + (($m1[0] - $m1[2]) - ($m1[1] + $m1[2])) + $m1[1] + $m1[2];\n                print $d;      \n            }\n            else\n            {\n                $d = $f + $e;\n                print $d;\n            }\n        }\n        elseif(($f1 + $e1) < ($f2 + $e2))\n        {\n            $e = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n            $f = $m1[1] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n            if($m1[0] < $f)\n            {\n                $g = $f - $m1[0];\n                $d = $m1[0] + (($m1[1] - $m1[0]) - ($m1[2] + $m1[0])) + $m1[2] + $m1[0];\n                print $d;      \n            }\n            else\n            {\n                $d = $f + $e;\n                print $d;\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\n$s = fgets(STDIN);\n$k = explode(\" \", trim($s)); $i=0; $p=array(); $o=array();\nfor ($i;$i<=2;$i++)\n {if (($k[$i]%2)==0) { array_push($p,$k[$i]);} else { array_push($o,$k[$i]);};};\n if ((count($p)==2)||(count($p)==3)) {sort($p); print($p[1]);};\n if ((count($o)==2)||(count($o)==3)) {sort($o); print($o[1]);};\n if ((count($p)==1)&(count($o)==1)) {print $p[0];};\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$m1 = array($a, $b, $c,);\n$d = 0; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0431\u0438\u0442\u0432\nif((($a == 0) && ($b == 0) && ($c == 0)) || (($a == 0) && ($b == 0)) || (($a == 0) && ($c == 0)) || (($b == 0) && ($c == 0)))\n{\n    print \"0\";\n}\nelseif($a == $b)\n{\n    print $a;\n}\nelseif($b == $c)\n{\n    print $b;\n}\nelseif($a == $c)\n{\n    print $c;\n}\nelse\n{\n    rsort($m1);\n    if((($m1[0] - $m1[1]) % 2 == 0) && ((($m1[0] - $m1[2]) % 2 != 0) || ($m1[2] != 0)))\n    {\n        $e = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[2] < $f)\n        {\n            $g = $f - $m1[2];\n            $d = $g + ($f - $g) * 2 + $e;\n            print $d;      \n        }\n        else\n        {\n            $d = $f + $e;\n            print $d;\n        }\n    }\n    elseif((($m1[0] - $m1[1]) % 2 != 0) && ((($m1[1] - $m1[2]) % 2 == 0) || ($m1[0] != 0)))\n    {\n        $e = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[1] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[0] < $f)\n        {\n            $g = $f - $m1[0];\n            $d = $g + ($f - $g) * 2 + $e;\n            print $d;      \n        }\n        else\n        {\n            $d = $f + $e;\n            print $d;\n        }\n    }\n    elseif((($m1[0] - $m1[2]) % 2 == 0) && ((($m1[0] - $m1[1]) % 2 != 0) || ($m1[1] != 0)))\n    {\n        $e = ($m1[0] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[1] < $f)\n        {\n            $g = $f - $m1[1];\n            $d = $g + ($f - $g) * 2 + $e;\n            print $d;      \n        }\n        else\n        {\n            $d = $f + $e;\n            print $d;\n        }\n    }\n    elseif((($m1[0] - $m1[1]) % 2 == 0) && (($m1[1] - $m1[2]) % 2 == 0))\n    {\n        $e1 = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f1 = $m1[2] - $e1; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        $e2 = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f2 = $m1[0] - $e2; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if(($f1 + $e1) >= ($f2 + $e2))\n        {\n            $e = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n            $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n            if($m1[2] < $f)\n            {\n                $g = $f - $m1[2];\n                $d = $g + ($f - $g) * 2 + $e;\n                print $d;      \n            }\n            else\n            {\n                $d = $f + $e;\n                print $d;\n            }\n        }\n        elseif(($f1 + $e1) < ($f2 + $e2))\n        {\n            $e = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n            $f = $m1[1] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n            if($m1[0] < $f)\n            {\n                $g = $f - $m1[0];\n                $d = $g + ($f - $g) * 2 + $e;\n                print $d;      \n            }\n            else\n            {\n                $d = $f + $e;\n                print $d;\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$m1 = array($a, $b, $c,);\n$d = 0; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0431\u0438\u0442\u0432\nif((($a == 0) && ($b == 0) && ($c == 0)) || (($a == 0) && ($b == 0)) || (($a == 0) && ($c == 0)) || (($b == 0) && ($c == 0)))\n{\n    print \"0\";\n}\nelseif($a == $b)\n{\n    print $a;\n}\nelseif($b == $c)\n{\n    print $b;\n}\nelseif($a == $c)\n{\n    print $c;\n}\nelse\n{\n    rsort($m1);\n    if((($m1[0] - $m1[1]) % 2 == 0) && (($m1[0] - $m1[2]) % 2 != 0))\n    {\n        $e = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[2] < $f)\n        {\n            $g = $f - $m1[2];\n            $d = $g + ($f - $g) * 2 + $e;\n            print $d;      \n        }\n        else\n        {\n            $d = $f + $e;\n            print $d;\n        }\n    }\n    elseif((($m1[0] - $m1[1]) % 2 != 0) && (($m1[1] - $m1[2]) % 2 == 0))\n    {\n        $e = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[1] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[0] < $f)\n        {\n            $g = $f - $m1[0];\n            $d = $g + ($f - $g) * 2 + $e;\n            print $d;      \n        }\n        else\n        {\n            $d = $f + $e;\n            print $d;\n        }\n    }\n    elseif((($m1[0] - $m1[2]) % 2 == 0) && (($m1[0] - $m1[1]) % 2 != 0))\n    {\n        $e = ($m1[0] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[1] < $f)\n        {\n            $g = $f - $m1[1];\n            $d = $g + ($f - $g) * 2 + $e;\n            print $d;      \n        }\n        else\n        {\n            $d = $f + $e;\n            print $d;\n        }\n    }\n    elseif((($m1[0] - $m1[1]) % 2 == 0) && (($m1[1] - $m1[2]) % 2 == 0))\n    {\n        $e1 = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f1 = $m1[2] - $e1; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        $e2 = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f2 = $m1[0] - $e2; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if(($f1 + $e1) >= ($f2 + $e2))\n        {\n            $e = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n            $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n            if($m1[2] < $f)\n            {\n                $g = $f - $m1[2];\n                $d = $g + ($f - $g) * 2 + $e;\n                print $d;      \n            }\n            else\n            {\n                $d = $f + $e;\n                print $d;\n            }\n        }\n        elseif(($f1 + $e1) < ($f2 + $e2))\n        {\n            $e = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n            $f = $m1[1] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n            if($m1[0] < $f)\n            {\n                $g = $f - $m1[0];\n                $d = $g + ($f - $g) * 2 + $e;\n                print $d;      \n            }\n            else\n            {\n                $d = $f + $e;\n                print $d;\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$m1 = array($a, $b, $c,);\n$e = 0; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0431\u0438\u0442\u0432\nif((($a == 0) && ($b == 0) && ($c == 0)) || (($a == 0) && ($b == 0)) || (($a == 0) && ($c == 0)) || (($b == 0) && ($c == 0)))\n{\n    print \"0\";\n}\nelseif(($a == $b) || ($a == $c) || ($b == $c))\n{\n    print \"1\";\n}\nelse\n{\n    rsort($m1);\n    if($m1[2] == 0) // \u0435\u0441\u043b\u0438 3 \u0447\u0438\u0441\u043b\u043e \u0440\u0430\u0432\u043d\u043e 0\n    {\n        $f = ceil($m1[0] / $m1[1]);\n        $g = $m1[0] % $m1[1];\n        $e += $f; // \u043f\u043b\u044e\u0441 $f \u0431\u0438\u0442\u0432\n        if($g == 0)\n        {\n            print $e;\n        }\n        else\n        {\n            print $e + $g;      \n        }    \n    }\n    else\n    {\n        $d1 = min($a, $b, $c);\n        $d2 = max($a, $b, $c);\n        $m1 = array($m1[0] - $d1, $m1[1] + $d1, 0);\n        $e = 1; // \u043e\u0434\u043d\u0430 \u0431\u0438\u0442\u0432\u0430\n        rsort($m1);\n        if(($a == $b) || ($a == $c) || ($b == $c))\n        {\n            print \"2\";\n        }\n        else\n        {\n            $f = ceil($m1[0] / $m1[1]);\n            $g = $m1[0] % $m1[1];\n            $e += $f; // \u043f\u043b\u044e\u0441 $f \u0431\u0438\u0442\u0432\n            if($g == 0)\n            {\n                print $e;\n            }\n            else\n            {\n                print $e + $g;     \n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$m1 = array($a, $b, $c,);\n$d = 0; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0431\u0438\u0442\u0432\nif((($a == 0) && ($b == 0) && ($c == 0)) || (($a == 0) && ($b == 0)) || (($a == 0) && ($c == 0)) || (($b == 0) && ($c == 0)))\n{\n    print \"0\";\n}\nelseif($a == $b)\n{\n    print $a;\n}\nelseif($b == $c)\n{\n    print $b;\n}\nelseif($a == $c)\n{\n    print $c;\n}\nelse\n{\n    rsort($m1);\n    if((($m1[0] - $m1[1]) % 2 == 0) && ((($m1[0] - $m1[2]) % 2 != 0) && ($m1[2] != 0)))\n    {\n        $e = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[2] < $f)\n        {\n            $g = $f - $m1[2];\n            $h = $g + ($f - $g) * 2 + $e;\n            print $h;      \n        }\n        else\n        {\n            $h = $f + $e;\n            print $h;\n        }\n    }\n    elseif((($m1[0] - $m1[1]) % 2 != 0) && ((($m1[1] - $m1[2]) % 2 == 0) && ($m1[0] != 0)))\n    {\n        $e = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[1] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[0] < $f)\n        {\n            $g = $f - $m1[0];\n            $h = $g + ($f - $g) * 2 + $e;\n            print $h;      \n        }\n        else\n        {\n            $h = $f + $e;\n            print $h;\n        }\n    }\n    elseif((($m1[0] - $m1[2]) % 2 == 0) && ((($m1[0] - $m1[1]) % 2 != 0) && ($m1[1] != 0)))\n    {\n        $e = ($m1[0] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[1] < $f)\n        {\n            $g = $f - $m1[1];\n            $h = $g + ($f - $g) * 2 + $e;\n            print $h;      \n        }\n        else\n        {\n            $h = $f + $e;\n            print $h;\n        }\n    }\n    elseif((($m1[0] - $m1[1]) % 2 == 0) && (($m1[1] - $m1[2]) % 2 == 0))\n    {\n        $e1 = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f1 = $m1[2] - $e1; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        $e2 = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f2 = $m1[0] - $e2; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if(($f1 + $e1) >= ($f2 + $e2))\n        {\n            $e = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n            $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n            if($m1[2] < $f)\n            {\n                $g = $f - $m1[2];\n                $h = $g + ($f - $g) * 2 + $e;\n                print $h;      \n            }\n            else\n            {\n                $h = $f + $e;\n                print $h;\n            }\n        }\n        elseif(($f1 + $e1) < ($f2 + $e2))\n        {\n            $e = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n            $f = $m1[1] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n            if($m1[0] < $f)\n            {\n                $g = $f - $m1[0];\n                $h = $g + ($f - $g) * 2 + $e;\n                print $h;      \n            }\n            else\n            {\n                $h = $f + $e;\n                print $h;\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = array($a, $b, $c);\nrsort($d);\nif($d[0] == 0)\n{\n    print \"0\";\n}\nelseif($d[1] == $d[2])\n{\n    print $d[1];\n}\nelseif($d[0] == $d[1])\n{\n    print $d[0];\n}\nelseif($d[0] == $d[2])\n{\n    print $d[0];\n}\nelse\n{\n    $d[0] += min($d[1], $d[2]);\n    $e = min($d[1], $d[2]);\n    $e = 0;\n    $f = max($d[1], $d[2]);\n    $f = max($d[1], $d[2]) - min($d[1], $d[2]);\n    $g = $f % 2;\n    if($g == 0)\n    {\n        print $f;\n    }\n    else\n    {\n        print $f + $d[0] - 1;\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = array($a, $b, $c);\nrsort($d);\nif($d[0] == 0)\n{\n    print \"0\";\n}\nelseif($d[1] == $d[2])\n{\n    print $d[1];\n}\nelse\n{\n    $d[0] += min($d[1], $d[2]);\n    $e = min($d[1], $d[2]);\n    $e = 0;\n    $f = max($d[1], $d[2]);\n    $f = max($d[1], $d[2]) - min($d[1], $d[2]);\n    $g = $f % 2;\n    if($g == 0)\n    {\n        print $f;\n    }\n    else\n    {\n        print $f + $d[0] - 1;\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$m1 = array($a, $b, $c,);\n$d = 0; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0431\u0438\u0442\u0432\nif((($a == 0) && ($b == 0) && ($c == 0)) || (($a == 0) && ($b == 0)) || (($a == 0) && ($c == 0)) || (($b == 0) && ($c == 0)))\n{\n    print \"0\";\n}\nelseif($a == $b)\n{\n    print $a;\n}\nelseif($b == $c)\n{\n    print $b;\n}\nelseif($a == $c)\n{\n    print $c;\n}\nelse\n{\n    rsort($m1);\n    if((($m1[0] - $m1[1]) % 2 == 0) && ((($m1[0] - $m1[2]) % 2 != 0) || ($m1[2] != 0)))\n    {\n        $e = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[2] < $f)\n        {\n            $g = $f - $m1[2];\n            $d = $g + ($f - $g) * 2 + $e;\n            print $d;      \n        }\n        else\n        {\n            $d = $f + $e;\n            print $d;\n        }\n    }\n    elseif((($m1[0] - $m1[1]) % 2 != 0) && ((($m1[1] - $m1[2]) % 2 == 0) || ($m1[0] != 0)))\n    {\n        $e = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[1] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[0] < $f)\n        {\n            $g = $f - $m1[0];\n            $d = $g + ($f - $g) * 2 + $e;\n            print $d;      \n        }\n        else\n        {\n            $d = $f + $e;\n            print $d;\n        }\n    }\n    elseif((($m1[0] - $m1[2]) % 2 == 0) && ((($m1[0] - $m1[1]) % 2 != 0) || ($m1[1] != 0)))\n    {\n        $e = ($m1[0] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if($m1[1] < $f)\n        {\n            $g = $f - $m1[1];\n            $d = $g + ($f - $g) * 2 + $e;\n            print $d;      \n        }\n        else\n        {\n            $d = $f + $e;\n            print $d;\n        }\n    }\n    elseif((($m1[0] - $m1[1]) % 2 == 0) && (($m1[1] - $m1[2]) % 2 == 0))\n    {\n        $e1 = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f1 = $m1[2] - $e1; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        $e2 = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n        $f2 = $m1[0] - $e2; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n        if(($f1 + $e1) > ($f2 + $e2))\n        {\n            $e = ($m1[0] + $m1[1]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n            $f = $m1[0] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n            if($m1[2] < $f)\n            {\n                $g = $f - $m1[2];\n                $d = $g + ($f - $g) * 2 + $e;\n                print $d;      \n            }\n            else\n            {\n                $d = $f + $e;\n                print $d;\n            }\n        }\n        elseif(($f1 + $e1) <= ($f2 + $e2))\n        {\n            $e = ($m1[1] + $m1[2]) / 2; // \u0447\u0438\u0441\u043b\u0430 \u0432\u0441\u0440\u0435\u0447\u0438\n            $f = $m1[1] - $e; // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432 \u0434\u043e \u0447\u0438\u0441\u0435\u043b \u0432\u0441\u0442\u0440\u0435\u0447\u0438\n            if($m1[0] < $f)\n            {\n                $g = $f - $m1[0];\n                $d = $g + ($f - $g) * 2 + $e;\n                print $d;      \n            }\n            else\n            {\n                $d = $f + $e;\n                print $d;\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\n$s = fgets(STDIN);\nlist($a, $b, $c) = explode(\" \", $s);\n\nfunction kolvo(&$a,&$b,&$c)\n { if ((($a%2)==0)and($a>1)) {$rez=$rez.\"a\";};\n   if ((($b%2)==0)and($b>1)) {$rez=$rez.\"b\";};\n   if ((($c%2)==0)and($c>1)) {$rez=$rez.\"c\";};\n   return $rez; }\n\nfunction kolvonc(&$a,&$b,&$c)\n { if ((($a%2)!=0)and($a>1)) {$res=$res.\"a\";};\n   if ((($b%2)!=0)and($b>1)) {$res=$res.\"b\";};\n   if ((($c%2)!=0)and($c>1)) {$res=$res.\"c\";};\n   return $res; }\n\nfunction vvod(&$a,&$b,&$c,&$u)\n  {if ($u==\"ab\") {$res=(max($a,$b));};\n   if ($u==\"bc\") {$res=(max($b,$c));};\n   if ($u==\"ac\") {$res=(max($a,$c));};\n   if ($u==\"abc\") {$res=(($a+$b+$c)-(min($a,$b,$c)+max($a,$b,$c)));};\n  return $res; }\n\nfunction vvodd(&$a,&$b,&$c,&$u)\n  {if (($u==\"ab\")and($c<2)) {$res=(min($a,$b));} else{$res=(max($a,$b));};\n   if (($u==\"bc\")and($a<2)) {$res=(min($b,$c));} else{$res=(max($b,$c));};\n   if (($u==\"ac\")and($b<2)) {$res=(min($a,$c));} else{$res=(max($a,$c));};\n   if ($u==\"abc\") {$res=(($a+$b+$c)-(min($a,$b,$c)+max($a,$b,$c)));};\n  return $res; }\n\n$m=kolvo($a,$b,$c);\n$n=kolvonc($a,$b,$c);\nif ((strlen($m))>(strlen($n))) {print (vvod($a,$b,$c,$m));}  else {print (vvodd($a,$b,$c,$n));} ;\n?>"}], "src_uid": "b8008caf788336775cb8ebb76478b04c"}
{"nl": {"description": "You are given three positive integers x,\u2009y,\u2009n. Your task is to find the nearest fraction to fraction  whose denominator is no more than n. Formally, you should find such pair of integers a,\u2009b (1\u2009\u2264\u2009b\u2009\u2264\u2009n;\u00a00\u2009\u2264\u2009a) that the value  is as minimal as possible.If there are multiple \"nearest\" fractions, choose the one with the minimum denominator. If there are multiple \"nearest\" fractions with the minimum denominator, choose the one with the minimum numerator.", "input_spec": "A single line contains three integers x,\u2009y,\u2009n (1\u2009\u2264\u2009x,\u2009y,\u2009n\u2009\u2264\u2009105).", "output_spec": "Print the required fraction in the format \"a/b\" (without quotes).", "sample_inputs": ["3 7 6", "7 2 4"], "sample_outputs": ["2/5", "7/2"], "notes": null}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nif(($a == 7) && ($b == 6))\n{\n     print 1 . \"/\" . 1;\n}\nelseif($b <= $c)\n{\n     $d = $a;\n     $e = $b;\n     while($a != $b)\n     {\n          if($a > $b)\n          {\n               $a -= $b;\n          }\n          else\n          {\n               $b -= $a;\n          }\n     }\n     $d /= $a;\n     $e /= $a;\n     print $d . \"/\" . $e;\n}\nelse\n{\n     $d = $a / $b;\n     $e = ceil($d * $c);\n     $f = $e / $c;\n     $g = abs($d - $f);\n     $h = $e;\n     $h--;\n     $i = $c;\n     $j = $e;\n     $k = $c;\n     while(TRUE)\n     {\n          if(($h == -1) || ($i == -1))\n          {\n               break;\n          }\n          else\n          {\n               $l = $h / $i;\n               $m = abs($d - $l);\n               if($m <= $g)\n               {\n                    $g = $m;\n                    $j = $h;\n                    $k = $i;\n               }\n               if($l >= $d)\n               {\n                    $h--;\n               }\n               else\n               {\n                    $i--;\n               }\n          }\n     }\n     print $j . \"/\" . $k;\n}\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nif($b <= $c)\n{\n     print $a . \"/\" . $b;\n}\nelse\n{\n     $d = $a / $b;\n     $e = ceil($d * $c);\n     $f = $e / $c;\n     $g = abs($d - $f);\n     $h = $e;\n     $h--;\n     $i = $c;\n     $j = $e;\n     $k = $c;\n     while(TRUE)\n     {\n          if(($h == -1) || ($i == -1))\n          {\n               break;\n          }\n          else\n          {\n               $l = $h / $i;\n               $m = abs($d - $l);\n               if($m <= $g)\n               {\n                    $g = $m;\n                    $j = $h;\n                    $k = $i;\n               }\n               if($l >= $d)\n               {\n                    $h--;\n               }\n               else\n               {\n                    $i--;\n               }\n          }\n     }\n     print $j . \"/\" . $k;\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = $a / $b; // \u043f\u0435\u0440\u0432\u0430\u044f \u0434\u0440\u043e\u0431\u044c\n$e = array();\n$g = array();\n$l = array();\n$m = array();\nfor($x = 1; $x <= 1000; $x++)\n{\n    for($y = 1; $y <= $c; $y++)\n    {\n        $f = abs($d - ($x / $y));\n        array_push($e, $f);\n        array_push($g, $x . \"/\" . $y);\n        array_push($l, $x);\n        array_push($m, $y);\n    }\n}\nasort($e);\n$j = $e;\nsort($j);\nfor($x = 0; $x < count($j); $x++)\n{\n    if($j[$x] != $j[$x + 1])\n    {\n        break;\n    }\n}\n$k = $x + 1;\n$h = array_keys($e);\n$n = array();\n$p = array();\nif($k > 1)\n{\n    for($x = 0; $x < $k; $x++)\n    {\n        array_push($n, $m[$h[$x]]);\n    }\n    sort($n);\n    $o = $n[0];\n    for($x = 0; $x < $k; $x++)\n    {\n        if($m[$h[$x]] == $o)\n        {\n            array_push($p, $l[$h[$x]]);\n        }\n    }\n    sort($p);\n    $r = $p[0];\n    print $r . \"/\" . $o;\n}\nelse\n{\n    $i = $g[$h[0]];\n    print $i;\n}\n?>"}, {"source_code": "<?php\n//\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = $a / $b; // \u043f\u0435\u0440\u0432\u0430\u044f \u0434\u0440\u043e\u0431\u044c\n$e = array();\n$g = array();\n$l = array();\n$m = array();\nfor($x = 1; $x <= 1000; $x++)\n{\n    for($y = 1; $y <= $c; $y++)\n    {\n        $f = abs($d - ($x / $y));\n        array_push($e, $f);\n        array_push($g, $x . \"/\" . $y);\n        array_push($l, $x);\n        array_push($m, $y);\n    }\n}\nasort($e);\n$j = $e;\nsort($j);\nfor($x = 0; $x < count($j); $x++)\n{\n    if($j[$x] != $j[$x + 1])\n    {\n        break;\n    }\n}\n$k = $x + 1;\n$h = array_keys($e);\n$n = array();\n$p = array();\nif($k > 1)\n{\n    for($x = 0; $x < $k; $x++)\n    {\n        array_push($n, $m[$h[$x]]);\n    }\n    sort($n);\n    $o = $n[0];\n    for($x = 0; $x < $k; $x++)\n    {\n        if($m[$h[$x]] == $o)\n        {\n            array_push($p, $l[$h[$x]]);\n        }\n    }\n    sort($p);\n    $r = $p[0];\n    print $r . \"/\" . $o;\n}\nelse\n{\n    $i = $g[$h[0]];\n    print $i;\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nif($b <= $c)\n{\n     $d = $a;\n     $e = $b;\n     while($a != $b)\n     {\n          if($a > $b)\n          {\n               $a -= $b;\n          }\n          else\n          {\n               $b -= $a;\n          }\n     }\n     $d /= $a;\n     $e /= $a;\n     print $d . \"/\" . $e;\n}\nelse\n{\n     $d = $a / $b;\n     $e = ceil($d * $c);\n     $f = $e / $c;\n     $g = abs($d - $f);\n     $h = $e;\n     $h--;\n     $i = $c;\n     $j = $e;\n     $k = $c;\n     while(TRUE)\n     {\n          if(($h == -1) || ($i == -1))\n          {\n               break;\n          }\n          else\n          {\n               $l = $h / $i;\n               $m = abs($d - $l);\n               if($m <= $g)\n               {\n                    $g = $m;\n                    $j = $h;\n                    $k = $i;\n               }\n               if($l >= $d)\n               {\n                    $h--;\n               }\n               else\n               {\n                    $i--;\n               }\n          }\n     }\n     print $j . \"/\" . $k;\n}\n?>"}], "src_uid": "827bc6f120aff6a6f04271bc84e863ee"}
{"nl": {"description": "In this task Anna and Maria play a game with a very unpleasant rival. Anna and Maria are in the opposite squares of a chessboard (8\u2009\u00d7\u20098): Anna is in the upper right corner, and Maria is in the lower left one. Apart from them, the board has several statues. Each statue occupies exactly one square. A square that contains a statue cannot have anything or anyone \u2014 neither any other statues, nor Anna, nor Maria.Anna is present on the board as a figurant (she stands still and never moves), and Maria has been actively involved in the game. Her goal is \u2014 to come to Anna's square. Maria and statues move in turn, Maria moves first. During one move Maria can go to any adjacent on the side or diagonal cell in which there is no statue, or she can stay in the cell where she is. The statues during their move must go one square down simultaneously, and those statues that were in the bottom row fall from the board and are no longer appeared.At that moment, when one of the statues is in the cell in which the Maria is, the statues are declared winners. At the moment when Maria comes into the cell where Anna has been waiting, Maria is declared the winner.Obviously, nothing depends on the statues, so it all depends on Maria. Determine who will win, if Maria does not make a strategic error.", "input_spec": "You are given the 8 strings whose length equals 8, describing the initial position on the board. The first line represents the top row of the board, the next one \u2014 for the second from the top, and so on, the last line represents the bottom row. Each character string matches a single cell board in the appropriate row, and the characters are in the same manner as that of the corresponding cell. If the cell is empty, the corresponding character is \".\". If a cell has Maria, then it is represented by character \"M\". If a cell has Anna, it is represented by the character \"A\". If a cell has a statue, then the cell is represented by character \"S\". It is guaranteed that the last character of the first row is always \"A\", the first character of the last line is always \"M\". The remaining characters are \".\" or \"S\".", "output_spec": "If Maria wins, print string \"WIN\". If the statues win, print string \"LOSE\".", "sample_inputs": [".......A\n........\n........\n........\n........\n........\n........\nM.......", ".......A\n........\n........\n........\n........\n........\nSS......\nM.......", ".......A\n........\n........\n........\n........\n.S......\nS.......\nMS......"], "sample_outputs": ["WIN", "LOSE", "LOSE"], "notes": null}, "positive_code": [{"source_code": "<?php\nfunction calc()\n{\n    $board = array();\n    for ($i = 0; $i < 8; $i++)\n    {\n        $board[$i] = rtrim(fgets(STDIN));\n    }\n    if (calc2($board)) echo \"WIN\\n\";\n    else echo \"LOSE\\n\";\n}\n\nfunction calc2($board)\n{\n    $now = array_fill(0, 8, array());\n    $now[7][0] = true;\n    for ($turn = 0; $turn < 30; $turn++)\n    {\n        $next = array_fill(0, 8, array());\n        for ($y = 0; $y < 8; $y++)\n        {\n            for ($x = 0; $x < 8; $x++)\n            {\n                if ($y - $turn >= 0 && $board[$y - $turn][$x] == 'S') continue;\n                if ($y - ($turn + 1) >= 0 && $board[$y - ($turn + 1)][$x] == 'S') continue;\n                for ($vy = -1; $vy <= 1; $vy++)\n                {\n                    for ($vx = -1; $vx <= 1; $vx++)\n                    {\n                        $ny = $y + $vy;\n                        $nx = $x + $vx;\n                        if (ok($ny, $nx) && $now[$ny][$nx])\n                        {\n                            $next[$y][$x] = true;\n                            if ($board[$y][$x] == 'A') return true;\n                        }\n                    }\n                }\n            }\n        }\n        $now = $next;\n    }\n    return false;\n}\n\nfunction ok($y, $x)\n{\n    return $x >= 0 && $y >= 0 && $x < 8 && $y < 8;\n}\n\ncalc();\n?>\n"}, {"source_code": "<?php\n$board = array();\nfunction calc()\n{\n    global $board;\n    for ($i = 0; $i < 8; $i++)\n    {\n        $board[$i] = rtrim(fgets(STDIN));\n    }\n    if (dfs(7, 0, 0)) echo \"WIN\\n\";\n    else echo \"LOSE\\n\";\n}\n\nfunction dfs($y, $x, $turn)\n{\n    global $board;\n    if ($y - $turn >= 0 && $board[$y - $turn][$x] == 'S') return false;\n    if ($turn >= 8) return true;\n    for ($vy = -1; $vy <= 1; $vy++)\n    {\n        for ($vx = -1; $vx <= 1; $vx++)\n        {\n            $ny = $y + $vy;\n            $nx = $x + $vx;\n            if ($ny < 0 || $ny >= 8 || $nx < 0 || $ny >= 8) continue;\n            if ($ny - $turn >= 0 && $board[$ny - $turn][$nx] == 'S') continue;\n            if (dfs($ny, $nx, $turn + 1)) return true;\n\n        }\n    }\n    return false;\n}\n\ncalc();\n?>\n"}, {"source_code": "<?php\n$round = 0;\n$area = array();\nfor( $i=0; $i<8; $i++) {\n    $area[$round][$i] = trim(fgets(STDIN));\n}\nwhile(1) {\n    $area[$round+1]=$area[$round];\n    for($x=0;$x<8;$x++) {\n        for($y=7;$y>=0;$y--) {\n            if(in_array($area[$round][$y][$x], array('M'))) {\n                for($i=-1;$i<2;$i++) {\n                    for($n=-1;$n<2;$n++) {\n                        if(($n==0&&$i==0)||($y+$n)<0||($x+$i)<0||($x+$i)>7||($y+$n)>7){\n                            continue;\n                        }\n                        if(in_array($area[$round][$y+$n][$x+$i], array('A'))){\n                            die('WIN');\n                        }\n                        if(in_array($area[$round][$y+$n][$x+$i], array('.'))){\n                            $area[$round+1][$y+$n][$x+$i] = 'M';\n                        }\n                    }\n                }\n            }\n        }\n    }\n    $round++;\n    for($x=0;$x<8;$x++) {\n        for($y=7;$y>=0;$y--) {\n            if(in_array($area[$round][$y][$x], array('S'))) {\n                $area[$round][$y][$x] = '.';\n                if(($y+1)>7) {\n                    continue;\n                }\n                $area[$round][$y+1][$x] = 'S';\n            }\n        }\n    }\n\n    $mcount = 0;\n    for($x=0;$x<8;$x++) {\n        for($y=7;$y>=0;$y--) {\n            if(in_array($area[$round][$y][$x], array('M'))) {\n                $mcount++;\n            }\n        }\n    }\n\n    /*echo(\"\\n\".'Round: '.$round.\"\\n\");\n    for( $i=0; $i<8; $i++) {\n        echo($area[$round-1][$i].'   '.$area[$round][$i].\"\\n\");\n    }\n    echo('M:'.$mcount.\"\\n\");*/\n    if($mcount==0) {\n        die(\"LOSE\");\n    }\n}"}], "negative_code": [{"source_code": "<?php\n$board = array();\nfunction calc()\n{\n    for ($i = 0; $i < 8; $i++)\n    {\n        $board[$i] = rtrim(fgets(STDIN));\n    }\n    if (dfs(7, 0, 0)) echo \"WIN\\n\";\n    else echo \"LOSE\\n\";\n}\n\nfunction dfs($y, $x, $turn)\n{\n    if ($y - $turn >= 0 && $board[$y - $turn][$x] == 'S') return false;\n    if ($turn >= 8) return true;\n    for ($vy = -1; $vy <= 1; $vy++)\n    {\n        for ($vx = -1; $vx <= 1; $vx++)\n        {\n            $ny = $y + $vy;\n            $nx = $x + $vx;\n            if ($ny < 0 || $ny >= 8 || $nx < 0 || $ny >= 8) continue;\n            if ($ny - $turn >= 0 && $board[$ny - $turn][$nx] == 'S') continue;\n            if (dfs($ny, $nx, $turn + 1)) return true;\n\n        }\n    }\n    return false;\n}\n\ncalc();\n?>\n"}, {"source_code": "<?php\n$board = array();\nfunction calc()\n{\n    for ($i = 0; $i < 8; $i++)\n    {\n        $board[$i];\n    }\n    if (dfs(7, 0, 0)) echo \"WIN\\n\";\n    else echo \"LOSE\\n\";\n}\n\nfunction dfs($y, $x, $turn)\n{\n    if ($y - $turn >= 0 && $board[$y - $turn][$x] == 'S') return false;\n    if ($turn >= 8) return true;\n    for ($vy = -1; $vy <= 1; $vy++)\n    {\n        for ($vx = -1; $vx <= 1; $vx++)\n        {\n            $ny = $y + $vy;\n            $nx = $x + $vx;\n            if ($ny < 0 || $ny >= 8 || $nx < 0 || $ny >= 8) continue;\n            if ($ny - $turn >= 0 && $board[$ny - $turn][$nx] == 'S') continue;\n            if (dfs($ny, $nx, $turn + 1)) return true;\n\n        }\n    }\n    return false;\n}\n\ncalc();\n?>\n"}, {"source_code": "<?php\n$area = array();\nfor( $i=0; $i<8; $i++) {\n    $area[$i] = trim(fgets(STDIN));\n}\n\n$x = 0;\n$y = 7;\n$i = 0;\nwhile(1) {\n    if( is_free_point(($x+1),($y-1),$area) &&\n        !is_danger_point(($x+1),($y-1),$area) ) {\n        set_round($x,$y,$x+1,$y-1,$area);\n        $x++;$y--;\n    }\n    else if( is_free_point(($x+1),($y),$area) &&\n        !is_danger_point(($x+1),($y),$area) ) {\n        set_round($x,$y,$x+1,$y,$area);\n        $x++;\n    }\n    else if( is_free_point(($x),($y-1),$area) &&\n        !is_danger_point(($x),($y-1),$area) ) {\n        set_round($x,$y,$x,$y-1,$area);\n        $y--;\n    }\n    else {\n        set_round($x,$y,$x,$y,$area);\n    }\n}\n\nfunction set_round($x1, $y1, $x2, $y2, &$area) {\n    if($x2==7 && $y2==0) {\n        die('WIN');\n    }\n    else {\n        $area[$y1][$x1] = '.';\n        $area[$y2][$x2] = 'M';\n    }\n    move_enemy($area);\n}\n\nfunction move_enemy(&$area) {\n    for($x=0;$x<8;$x++) {\n        for($y=7;$y>=0;$y--) {\n            if(in_array($area[$y][$x], array('S'))) {\n                $area[$y][$x] = '.';\n                if($y+1 <= 7) {\n                    if(in_array($area[$y+1][$x], array('M'))) {\n                        die('LOSE');\n                    }\n                    $area[$y+1][$x] = 'S';\n                }\n            }\n        }\n    }\n}\n\nfunction is_free_point($x,$y, $area) {\n    if(valid_point($x, $y)) {\n        if(in_array($area[$y][$x], array('.','A','M'))) {\n            return TRUE;\n        }\n    }\n    return FALSE;\n}\n\nfunction is_danger_point($x,$y,$area) {\n    if( valid_point($x,($y-1) ) === FALSE || is_free_point($x, ($y-1) , $area) ) {\n        return FALSE;\n    }\n    return TRUE;\n}\n\nfunction valid_point($x,$y) {\n    if($x > 7 || $y > 7 || $x < 0 || $y < 0) {\n        return FALSE;\n    }\n    return TRUE;\n}"}, {"source_code": "<?php\n$area = array();\nfor( $i=0; $i<8; $i++) {\n    $area[$i] = trim(fgets(STDIN));\n}\n\n$x = 0;\n$y = 7;\n$i = 0;\nwhile(1) {\n    if( is_free_point(($x+1),($y-1),$area) &&\n        !is_danger_point(($x+1),($y-1),$area) ) {\n        set_round($x,$y,$x+1,$y-1,$area);\n        $x++;$y--;\n    }\n    else if( is_free_point(($x+1),($y),$area) &&\n        !is_danger_point(($x+1),($y),$area) ) {\n        set_round($x,$y,$x+1,$y,$area);\n        $x++;\n    }\n    else if( is_free_point(($x-1),($y-1),$area) &&\n        !is_danger_point(($x-1),($y-1),$area) ) {\n        set_round($x,$y,$x-1,$y-1,$area);\n        $x--;$y--;\n    }\n    else if( is_free_point(($x),($y-1),$area) &&\n        !is_danger_point(($x),($y-1),$area) ) {\n        set_round($x,$y,$x,$y-1,$area);\n        $y--;\n    }\n    else if( is_free_point(($x),($y+1),$area) &&\n        !is_danger_point(($x),($y+1),$area) ) {\n        set_round($x,$y,$x,$y+1,$area);\n        $y++;\n    }\n    else {\n        set_round($x,$y,$x,$y,$area);\n    }\n}\n\nfunction set_round($x1, $y1, $x2, $y2, &$area) {\n    if($x2==7 && $y2==0) {\n        die('WIN');\n    }\n    else {\n        $area[$y1][$x1] = '.';\n        $area[$y2][$x2] = 'M';\n    }\n    move_enemy($area);\n}\n\nfunction move_enemy(&$area) {\n    for($x=0;$x<8;$x++) {\n        for($y=7;$y>=0;$y--) {\n            if(in_array($area[$y][$x], array('S'))) {\n                $area[$y][$x] = '.';\n                if($y+1 <= 7) {\n                    if(in_array($area[$y+1][$x], array('M'))) {\n                        die('LOSE');\n                    }\n                    $area[$y+1][$x] = 'S';\n                }\n            }\n        }\n    }\n}\n\nfunction is_free_point($x,$y, $area) {\n    if(valid_point($x, $y)) {\n        if(in_array($area[$y][$x], array('.','A','M'))) {\n            return TRUE;\n        }\n    }\n    return FALSE;\n}\n\nfunction is_danger_point($x,$y,$area) {\n    if( valid_point($x,($y-1) ) === FALSE || is_free_point($x, ($y-1) , $area) ) {\n        return FALSE;\n    }\n    return TRUE;\n}\n\nfunction valid_point($x,$y) {\n    if($x > 7 || $y > 7 || $x < 0 || $y < 0) {\n        return FALSE;\n    }\n    return TRUE;\n}"}], "src_uid": "f47e4ab041288ba9567c19930eb9a090"}
{"nl": {"description": "For a positive integer n let's define a function f:f(n)\u2009=\u2009\u2009-\u20091\u2009+\u20092\u2009-\u20093\u2009+\u2009..\u2009+\u2009(\u2009-\u20091)nn Your task is to calculate f(n) for a given integer n.", "input_spec": "The single line contains the positive integer n (1\u2009\u2264\u2009n\u2009\u2264\u20091015).", "output_spec": "Print f(n) in a single line.", "sample_inputs": ["4", "5"], "sample_outputs": ["2", "-3"], "notes": "Notef(4)\u2009=\u2009\u2009-\u20091\u2009+\u20092\u2009-\u20093\u2009+\u20094\u2009=\u20092f(5)\u2009=\u2009\u2009-\u20091\u2009+\u20092\u2009-\u20093\u2009+\u20094\u2009-\u20095\u2009=\u2009\u2009-\u20093"}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = bcmod($a, 2);\n$c = floor(bcdiv($a, 2));\nif($b == 0)\n{\n    print bcdiv($a, 2);\n}\nelse\n{\n    print \"-\" . bcsub(bcdiv($a, 2), -1);\n}\n?>"}, {"source_code": "<?php\n\t$n=trim(fgets(STDIN));\n\n\tif (bcmod($n, \"2\")!=0) {\n\t\techo \"-\";\n\t\techo bcadd(bcdiv($n,2,0), \"1\");\n\t}else{\n\t\techo bcdiv($n,\"2\",0);\n\t}\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%f\", $n);\n        if ($n % 2 == 0){\n            printf(\"%.0f\" , $n / 2);\n        }\n        else\n            printf(\"%.0f\", (floor($n / 2) - $n));\n        "}, {"source_code": "<?php\n    fscanf(STDIN,\"%s\",$n);\n    if (bcmod($n, '2') != 0) {\n        echo '-';\n        echo bcadd(bcdiv($n, 2, 0), '1', 0);\n    }\n    else\n        echo bcdiv($n, '2', 0);"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\nif (bcmod($n,'2')!=0)echo '-'.bcdiv(bcadd($n,'1'),'2');\nelse echo bcdiv($n,'2');"}, {"source_code": "<?php\nfscanf(STDIN,\"%s\",$n);\n\nif(bcmod($n,2)==0)\n\techo bcdiv($n, 2);\nelse\necho \"-\".bcdiv(bcadd($n,1), 2);"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$ans = (bcmod($n, 2) != 0 ? bcadd(bcdiv($n, -2), -1) : bcdiv($n, 2));\necho $ans;\n?>"}, {"source_code": "<?php\n$n=trim(fgets(STDIN));\n\nif (bcmod($n, \"2\")!=0) {\n\techo \"-\";\n\techo bcadd(bcdiv($n,2,0), \"1\");\n}else{\n\techo bcdiv($n,\"2\",0);\n}\n?>"}, {"source_code": "<?php\n// 486A     \u041f\u043e\u0434\u0441\u0447\u0451\u0442 \u0444\u0443\u043d\u043a\u0446\u0438\u0438 \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n$input_line = substr($input_line, 0, strlen($input_line)-2);\n//list($n, $m) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$len = strlen($input_line);\n$char = $input_line[$len-1];\n$k = (int) $char;\n\nif (($k % 2) == 0) {\n    echo bcdiv($input_line, '2');\n} else {\n    for ($i=$len-1; $i >= 0 ; $i--) { \n        $char = $input_line[$i];\n        if ($char === '9') {\n            $input_line[$i] = '0';\n        } else {\n            $k = (int) $char;\n            $k ++;\n            $input_line[$i] = (string) $k;\n            break;\n        }\n    }\n    if ($i < 0) {\n        echo '-' . bcdiv('1'.$input_line, '2');\n    } else {\n        echo '-' . bcdiv($input_line, '2');\n    }\n}\n\n?>"}, {"source_code": "<?php\n\n/**\n * @author Sunwarul Islam \n */\n\n$n = trim(fgets(STDIN));\n$lastDigit = $n[strlen($n) - 1];\nif ($lastDigit % 2 == 0) {\n    echo sprintf(\"%.0f\", ($n / 2));\n}\nif ($lastDigit % 2 != 0) {\n    echo sprintf(\"%.0f\", (- ($n + 1) / 2));\n}\n\necho \"\\n\";\n"}, {"source_code": "<?php\n\n/**\n * @author Sunwarul Islam \n */\n\n$n = trim(fgets(STDIN));\n$m = $n[strlen($n) - 1];\n\nif ($m % 2 == 0) {\n    echo sprintf(\"%.0f\", ($n / 2));\n}\nif ($m % 2 != 0) {\n    echo sprintf(\"%.0f\", (- ($n + 1) / 2));\n}\n\necho \"\\n\";"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = bcmod($a, 2);\n$c = floor(bcdiv($a, 2));\nif($b == 0)\n{\n    print bcdiv($a, 2);\n}\nelse\n{\n    print \"-\" . bcsub(bcdiv($a, 2), 1);\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = bcmod($a, 2);\n$c = floor(bcdiv($a, 2));\nif($b == 0)\n{\n    print bcdiv($a, 2);\n}\nelse\n{\n    print bcsub($c, $a);\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = bcmod($a, 2);\n$c = floor(bcdiv($a, 2));\nif($b == 0)\n{\n    print bcdiv($a, 2);\n}\nelse\n{\n    print \"-\" . ceil(bcdiv($a, 2));\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 2;\n$c = floor($a / 2);\nif($b == 0)\n{\n    print $a / 2;\n}\nelse\n{\n    print $c - $a;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 2;\nif($b == 0)\n{\n    print $a / 2;\n}\nelse\n{\n    print \"-\" . ceil($a / 2);\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = bcmod($a, 2);\nif($b == 0)\n{\n    print bcdiv($a, 2);\n}\nelse\n{\n    $c = bcdiv($a, 2);\n    print \"-\" . ($c + 1);\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = bcmod($a, 2);\n$c = floor(bcdiv($a, 2));\nif($b == 0)\n{\n    print bcdiv($a, 2);\n}\nelse\n{\n    print \"-\" . bcdiv($a, 2) - 1;\n}\n?>"}, {"source_code": "<?php\n\t$input = trim(fgets(STDIN));\n\techo ($input%2==0)?number_format(($input/2),16):number_format(floor($input/2*-1),16);\n?>"}, {"source_code": "<?php\n\t$input = trim(fgets(STDIN));\n\techo ($input%2==0)?($input/2):($input/2*-1);\n?>"}, {"source_code": "<?php\n\t$input = trim(fgets(STDIN));\n\t$sum = 0;\n\tfor($i=1;$i<$input;$i++)\n\t{\n\t\t$multiplier = ($i%2==1)?-1:1;\n\t\t$sum = $sum + ($multiplier * $i);\n\t}\n\techo $sum;\n?>"}, {"source_code": "<?php\n\t$input = trim(fgets(STDIN));\n\techo ($input%2==0)?($input/2):floor($input/2*-1);\n?>"}, {"source_code": "<?php\n\t$input = trim(fgets(STDIN));\n\t//$input = 1000000000000000;\n\techo ($input%2==0)?sprintf('%.0f',($input/2)):sprintf('%.0f',floor($input/2*-1));\n?>"}, {"source_code": "<?php\n\t$input = trim(fgets(STDIN));\n\techo ($input%2==0)?sprintf('%.0f',($input/2)):sprintf('%.0f',floor($input/2*-1));\n?>"}, {"source_code": "<?php\n    fscanf(STDIN,\"%d\",$n);\n    if ($n % 2 != 0)\n        echo '-';\n    echo ceil($n / 2);"}, {"source_code": "<?php\n$n = fgets(STDIN);\nif (($n%2)==0) echo bcdiv($n,2);\nelse echo bcdiv(-($n+1),2);"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\nif (bcmod($n,2)==0) echo bcdiv($n,2);\nelse echo bcdiv(-($n+1),2);"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\nif (($n%2)==0) echo bcdiv($n,2);\nelse echo bcdiv(-($n+1),2);"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\nif ($n%2==0) echo ($n/2);\nelse echo -1*($n+1)/2;"}, {"source_code": "<?php\nfscanf(STDIN,\"%s\",$n);\n\nif(bcmod($n,2)==0)\n\techo bcdiv($n, 2);\nelse\necho \"-\".bcdiv($n+1, 2);"}, {"source_code": "<?php\n$str=trim(fgets(STDIN));\nif($str%2==0)\n{\n\techo bcdiv($str,2);\n}\nelse\n    echo ceil(bcdiv($str,2,2))*(-1);"}, {"source_code": "<?php\nfscanf(STDIN,\"%s\",$n);\n\nif($n%2==0)\n\techo bcdiv($n, 2);\nelse\necho \"-\".bcdiv($n, 2)-1;"}, {"source_code": "<?php\nfscanf(STDIN,\"%s\",$n);\n\nif($n%2==0)\n\techo $n/2;\nelse\necho \"-\".ceil($n/2);"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$ans = ($n % 2 == 0 ? bcdiv($n, 2) : bcadd(bcdiv($n, -2), -1));\necho $ans;\n?>"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$ans = ($n % 2 == 0 ? ($n / 2) : (-1 * ceil($n / 2)));\necho $ans;\n?>"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$ans = ($n % 2 == 0 ? bcdiv($n, 2) : bcadd(bcdiv($n, -3), -1));\necho $ans;\n?>"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$ans = ($n % 2 != 0 ? bcadd(bcdiv($n, -2), -1) : bcdiv($n, 2));\necho $ans;\n?>"}, {"source_code": "<?php\n// 486A     \u041f\u043e\u0434\u0441\u0447\u0451\u0442 \u0444\u0443\u043d\u043a\u0446\u0438\u0438 \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n$input_line = substr($input_line, 0, strlen($input_line)-2);\n//list($n, $m) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$char = substr($input_line, strlen($input_line)-1, 1);\n$k = (int) $char;\n\n$n = (int) $input_line;\n\nif (($k % 2) == 0) {\n    echo $n / 2;\n} else {\n    echo ($n + 1) / (-2);\n\n}\n\n?>"}, {"source_code": "<?php\n\n/**\n * @author Sunwarul Islam \n */\n\n$n = trim(fgets(STDIN));\n\nif ($n % 2 == 0) {\n    echo sprintf(\"%.0f\", ($n / 2));\n}\nif ($n % 2 != 0) {\n    echo sprintf(\"%.0f\", (- ($n + 1) / 2));\n}\n\necho \"\\n\";"}, {"source_code": "<?php\n\n/**\n * @author Sunwarul Islam \n */\n \n$n = fgets(STDIN);\n$m = $n[strlen($n) -1];\n\nif ($m % 2 === 0) echo sprintf(\"%.0f\", ($n / 2));\nif ($m % 2 !== 0) echo sprintf(\"%.0f\", (- ($n + 1) / 2));\n\necho \"\\n\";"}, {"source_code": "<?php\n\n$n = fgets(STDIN);\nif ($n % 2 == 0) echo ($n / 2);\nif ($n % 2 != 0) echo (- ($n + 1) / 2);\necho \"\\n\";\n"}, {"source_code": "<?php\n\n/**\n * @author Sunwarul Islam \n */\nerror_reporting(0);\n$n = fgets(STDIN);\nif ($n % 2 === 0) echo sprintf(\"%.0f\", ($n / 2));\nif ($n % 2 !== 0) echo sprintf(\"%.0f\", (- ($n + 1) / 2));\n\necho \"\\n\";\n"}, {"source_code": "<?php\n\n/**\n * @author Sunwarul Islam \n */\nerror_reporting(0);\n\n$n = fgets(STDIN);\nif ($n % 2 === 0) echo sprintf(\"%.0f\", ($n / 2));\nif ($n % 2 !== 0) echo sprintf(\"%.0f\", (- ($n + 1) / 2));\n\necho \"\\n\";\n\n"}, {"source_code": "<?php\n\n/**\n * @author Sunwarul Islam \n */\n\n$n = fgets(STDIN);\nif ($n % 2 == 0) echo sprintf(\"%.0f\", ($n / 2));\nif ($n % 2 != 0) echo sprintf(\"%.0f\", (- ($n + 1) / 2));\n\necho \"\\n\";\n"}, {"source_code": "<?php\n\n/**\n * @author Sunwarul Islam \n */\n\n$n = fgets(STDIN);\nif ($n % 2 === 0) echo sprintf(\"%.0f\", ($n / 2));\nif ($n % 2 !== 0) echo sprintf(\"%.0f\", (- ($n + 1) / 2));\n\necho \"\\n\";\n"}], "src_uid": "689e7876048ee4eb7479e838c981f068"}
{"nl": {"description": "Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, Patrick needs to buy some goodies in two stores located near his house. There is a d1 meter long road between his house and the first shop and a d2 meter long road between his house and the second shop. Also, there is a road of length d3 directly connecting these two shops to each other. Help Patrick calculate the minimum distance that he needs to walk in order to go to both shops and return to his house.  Patrick always starts at his house. He should visit both shops moving only along the three existing roads and return back to his house. He doesn't mind visiting the same shop or passing the same road multiple times. The only goal is to minimize the total distance traveled.", "input_spec": "The first line of the input contains three integers d1, d2, d3 (1\u2009\u2264\u2009d1,\u2009d2,\u2009d3\u2009\u2264\u2009108)\u00a0\u2014 the lengths of the paths.    d1 is the length of the path connecting Patrick's house and the first shop;  d2 is the length of the path connecting Patrick's house and the second shop;  d3 is the length of the path connecting both shops. ", "output_spec": "Print the minimum distance that Patrick will have to walk in order to visit both shops and return to his house.", "sample_inputs": ["10 20 30", "1 1 5"], "sample_outputs": ["60", "4"], "notes": "NoteThe first sample is shown on the picture in the problem statement. One of the optimal routes is: house  first shop  second shop  house.In the second sample one of the optimal routes is: house  first shop  house  second shop  house."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = $a + $a + $b + $b;\n$e = $a + $c + $c + $a;\n$f = $a + $c + $b;\n$g = $b + $b + $a + $a;\n$h = $b + $c + $c + $b;\n$i = $b + $c + $a;\nprint min($d, $e, $f, $g, $h, $i);\n?>"}, {"source_code": "<?php\nerror_reporting(0);\n//////////////////////// Class For Read Input --- @laurenceHR [02/2012] ////////////////////////////////////////////////////////////\nclass stdIn{var $ntxt = 0;var $nline = 0;var $arr_txt;var $arr_line;var $linex;var $liney;\nfunction stdIn($local = false){if($local){$dir = fopen(\"input.txt\", 'r');}else{$dir = fopen(\"php://stdin\", 'r');}\n$datatxt = stream_get_contents($dir);$del = Array(\"\\n\",\"\\r\",\"\\n\\r\");$data = explode(\"\\n\",$datatxt);\t$il = 0;$id = 0;\nforeach($data as $line){if(strlen($line) > 0){$line = str_replace($del,'',$line);$dataex[] = $line;$text = explode(\" \",$line);\nforeach($text as $txt){$arr_txt[] = $txt;$this->linex[$id] = $il;$this->liney[$il] = $id;$id++;}}$il++;}$this->arr_line = $dataex;$this->arr_txt  = $arr_txt;}\nfunction G(){$ret = $this->arr_txt[$this->ntxt++];$this->nline = $this->linex[$this->ntxt];return $ret;}\nfunction GL(){$this->ntxt = $this->liney[$this->nline]+1;return $this->arr_line[$this->nline++];}} /*init*/ $dxs = new stdIn(false);\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n///////////////////////////////////// DECLARE FUNCTIONS ///////////////////////////////////////\n\nfunction mint($a, $b){if($a<$b){return $a;}else{return $b;}}\nfunction maxt($a, $b){if($a>$b){return $a;}else{return $b;}}\n\n/////////////////////////////////// MAIN CODE /////////////////////////////////////////////////\n\n$a=$dxs-> G(); \n$b=$dxs-> G(); \n$jo=$dxs-> G();\n\n$res1 = $a+$a+$b+$b;\n$res2 = $a+$jo+$b;\n$res3 = $a+$jo+$jo+$a;\n$res4 = $b+$jo+$jo+$b;\n\n$res = mint($res1, mint($res2, mint($res3, $res4)));\n\necho $res+\"\\n\";\n\n////////////////////////////////// PRINT OUTPUT ////////////////////////////////////////////////\n\n/////////////////////////////////////////////////////////////////////////////////////////////////\n\n\n// $x = $dxs-> G(); equivalent to cin>>x; [G() like Get] and for read a complete line//\n// $line = $dxs->GL(); // GL() like GetLine then i can emulate cin>> of C++ //\n// :P for see this template in action see my submissions ;) oh! i was forget that the constructor //\n// $dxs = newSdtIn(true) is 'true' //\n// if you are testing localy then read of input.txt, for submit the code change this to 'false'..//\n?>"}, {"source_code": "<?php\n$d = trim(fgets(STDIN));\n$d_array = explode(\" \", $d);\n$m = 0;\nif ($d_array[0] <= ($d_array[1] + $d_array[2])) {\n    $m = $m + $d_array[0];\n} else {\n    $m = $m + $d_array[1] + $d_array[2];\n}\nif ($d_array[2] <= ($d_array[0] + $d_array[1])) {\n    $m = $m + $d_array[2];\n} else {\n    $m = $m + $d_array[0] + $d_array[1];\n}\nif ($d_array[1] <= ($d_array[0] + $d_array[2])) {\n    $m = $m + $d_array[1];\n} else {\n    $m = $m + $d_array[0] + $d_array[2];\n}\necho $m;\n?>"}, {"source_code": "<?php\nfscanf(STDIN,\"%s %s %s\",$d1,$d2,$d3);\necho min(bcmul(2,bcadd($d1,$d2)),bcadd($d3,bcadd($d1,$d2)),bcmul(2,bcadd($d1,$d3)),bcmul(2,bcadd($d2,$d3)));"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d%d%d\", $d1, $d2, $d3);\n    echo min(2 * min($d1, $d2) + 2 * max($d1, $d2), 2 * min($d1, $d2) + 2 * $d3, $d1 + $d2 + $d3).PHP_EOL; \n?>"}, {"source_code": "<?php\n\tfscanf(STDIN, \"%d%d%d\", $d1, $d2, $d3);\n\techo min($d1+$d2+$d3, 2*($d1+$d2), 2*($d1+$d3), 2*($d2+$d3));\n?>"}, {"source_code": "<?php \n$f=trim(fgets(STDIN));\n\n\n$l=explode(\" \", $f);\n$d1=$l[0];\n$d2=$l[1];\n$d3=$l[2];\n\n$right_d=0;\nif($d1 < $d2 +$d3)\n{\n\t$right_d = $d1;\n}else{\n\t\t$right_d = 2*($d2+$d3);\t\n\t\techo $right_d;\n\t\texit();\n}\nif($d3 < $d1 + $d2){\n\t\t$right_d += $d3;\n\t}else{\n\t\t$right_d+=2*$d2+$d1;\n\t\techo $right_d;\n\t\texit();\n}\nif($d2 < $d1+$d3){\n   \t$right_d += $d2; \n}else{\n    $right_d += $d1+$d3; \n    echo $right_d;\n    exit();\n}\n\t\n\n\t\n\techo $right_d;\n?>"}], "negative_code": [{"source_code": "<?php\nerror_reporting(0);\n//////////////////////// Class For Read Input --- @laurenceHR [02/2012] ////////////////////////////////////////////////////////////\nclass stdIn{var $ntxt = 0;var $nline = 0;var $arr_txt;var $arr_line;var $linex;var $liney;\nfunction stdIn($local = false){if($local){$dir = fopen(\"input.txt\", 'r');}else{$dir = fopen(\"php://stdin\", 'r');}\n$datatxt = stream_get_contents($dir);$del = Array(\"\\n\",\"\\r\",\"\\n\\r\");$data = explode(\"\\n\",$datatxt);\t$il = 0;$id = 0;\nforeach($data as $line){if(strlen($line) > 0){$line = str_replace($del,'',$line);$dataex[] = $line;$text = explode(\" \",$line);\nforeach($text as $txt){$arr_txt[] = $txt;$this->linex[$id] = $il;$this->liney[$il] = $id;$id++;}}$il++;}$this->arr_line = $dataex;$this->arr_txt  = $arr_txt;}\nfunction G(){$ret = $this->arr_txt[$this->ntxt++];$this->nline = $this->linex[$this->ntxt];return $ret;}\nfunction GL(){$this->ntxt = $this->liney[$this->nline]+1;return $this->arr_line[$this->nline++];}} /*init*/ $dxs = new stdIn(false);\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n///////////////////////////////////// DECLARE FUNCTIONS ///////////////////////////////////////\n\nfunction mint($a, $b){if($a<$b){return $a;}else{return $b;}}\nfunction maxt($a, $b){if($a>$b){return $a;}else{return $b;}}\n\n/////////////////////////////////// MAIN CODE /////////////////////////////////////////////////\n\n$a=$dxs-> G(); \n$b=$dxs-> G(); \n$jo=$dxs-> G();\n\n$res1 = $a+$a+$b+$b;\n$res2 = $a+$jo+$b;\n$res3 = $a+$jo+$a;\n$res4 = $b+$jo+$b;\n\n$res = mint($res1, mint($res2, mint($res3, $res4)));\n\necho $res+\"\\n\";\n\n////////////////////////////////// PRINT OUTPUT ////////////////////////////////////////////////\n\n/////////////////////////////////////////////////////////////////////////////////////////////////\n\n\n// $x = $dxs-> G(); equivalent to cin>>x; [G() like Get] and for read a complete line//\n// $line = $dxs->GL(); // GL() like GetLine then i can emulate cin>> of C++ //\n// :P for see this template in action see my submissions ;) oh! i was forget that the constructor //\n// $dxs = newSdtIn(true) is 'true' //\n// if you are testing localy then read of input.txt, for submit the code change this to 'false'..//\n?>"}, {"source_code": "<?php\nfscanf(STDIN,\"%d %d %d\",$d1,$d2,$d3);\nif($d1>=$d2)\n{\n\t$min=$d2;\n\t$store=$d1;\n}\nelse\n{\n\t$min=$d1;\n\t$store=$d2;\n}\nif($d1+$d2>=$d3)\n$min1=$d3;\nelse\n$min1=$d1+$d2;\necho $min+$store+$min1;"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d%d%d\", $d1, $d2, $d3);\n    echo min( 2 * min($d1, $d2) + 2 * max($d1, $d2) , 2 * min($d1, $d2) + 2 * $d3 ) . PHP_EOL; \n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d%d%d\", $d1, $d2, $d3);\n    echo min( 2 * min($d1, $d2) + max($d1, $d2) , 2 * min($d1, $d2) + 2 * $d3 ) . PHP_EOL; \n?>"}, {"source_code": "<?php \n\t\n\t$d1= \"\";\n\t$d2= \"\";\n\t$d3= \"\";\n\t$d4=\"\";\n\t$right_d= \"\";\n\t\nif($d1 <= $d2)\n{\n\t$right_d = $d1;\n\t$d4= $d2;\n}else{\n\t\t$right_d = $d2;\t\n\t\t$d4 = $d1;\n}\nif($d3 <= $d1 + $d2){\n\t\t$right_d += $d3;\n\t}else{\n\t\t$right_d += $d1 + $d2;\n}\n\t\n\t$right_d += $d4;\n\t\n\techo $right_d;\n?>"}, {"source_code": "<?php \n$f=trim(fgets(STDIN));\n\n\n$l=explode(\" \", $f);\n$d1=$l[0];\n$d2=$l[1];\n$d3=$l[2];\n\n\t\nif($d1 <= $d2)\n{\n\t$right_d = $d1;\n\t$d4= $d2;\n}else{\n\t\t$right_d = $d2;\t\n\t\t$d4 = $d1;\n}\nif($d3 <= $d1 + $d2){\n\t\t$right_d += $d3;\n\t}else{\n\t\t$right_d += $d1 + $d2;\n}\n\t\n\t$right_d += $d4;\n\t\n\techo $right_d;\n?>"}, {"source_code": "<?php \n$f=trim(fgets(STDIN));\n\n\n$l=explode(\" \", $f);\n$d1=$l[0];\n$d2=$l[1];\n$d3=$l[2];\n\n$right_d=0;\nif($d1 <= $d2)\n{\n\t$right_d = $d1;\n\t$d4= $d2;\n}else{\n\t\t$right_d = $d2;\t\n\t\t$d4 = $d1;\n}\nif($d3 <= $d1 + $d2){\n\t\t$right_d += $d3;\n\t}else{\n\t\t$right_d += $d1 + $d2;\n}\nif($d4<= $d2+$d3){\n   \t$right_d += $d4; \n}else{\n    $right_d += $d2+$d3; \n}\n\t\n\n\t\n\techo $right_d;\n?>"}, {"source_code": "<?php \n\t\n\t$d1= \"10\";\n\t$d2= \"20\";\n\t$d3= \"30\";\n\t$d4=\"\";\n\t$right_d= \"\";\n\t\nif($d1 <= $d2)\n{\n\t$right_d = $d1;\n\t$d4= $d2;\n}else{\n\t\t$right_d = $d2;\t\n\t\t$d4 = $d1;\n}\nif($d3 <= $d1 + $d2){\n\t\t$right_d += $d3;\n\t}else{\n\t\t$right_d += $d1 + $d2;\n}\n\t\n\t$right_d += $d4;\n\t\n\techo $right_d;\n?>"}, {"source_code": "<?php \n$f=trim(fgets(STDIN));\n\n\n$l=explode(\" \", $f);\n$d1=$l[0];\n$d2=$l[1];\n$d3=$l[2];\n\n$right_d=0;\nif($d1 <= $d2)\n{\n\t$right_d = $d1;\n\t$d4= $d2;\n}else{\n\t\t$right_d = $d2;\t\n\t\t$d4 = $d1;\n}\nif($d3 <= $d1 + $d2){\n\t\t$right_d += $d3;\n\t}else{\n\t\t$right_d += $d1 + $d2;\n}\n\t\n\t$right_d += $d4;\n\t\n\techo $right_d;\n?>"}], "src_uid": "26cd7954a21866dbb2824d725473673e"}
{"nl": {"description": "Let's denote a function $$$f(x)$$$ in such a way: we add $$$1$$$ to $$$x$$$, then, while there is at least one trailing zero in the resulting number, we remove that zero. For example,   $$$f(599) = 6$$$: $$$599 + 1 = 600 \\rightarrow 60 \\rightarrow 6$$$;  $$$f(7) = 8$$$: $$$7 + 1 = 8$$$;  $$$f(9) = 1$$$: $$$9 + 1 = 10 \\rightarrow 1$$$;  $$$f(10099) = 101$$$: $$$10099 + 1 = 10100 \\rightarrow 1010 \\rightarrow 101$$$. We say that some number $$$y$$$ is reachable from $$$x$$$ if we can apply function $$$f$$$ to $$$x$$$ some (possibly zero) times so that we get $$$y$$$ as a result. For example, $$$102$$$ is reachable from $$$10098$$$ because $$$f(f(f(10098))) = f(f(10099)) = f(101) = 102$$$; and any number is reachable from itself.You are given a number $$$n$$$; your task is to count how many different numbers are reachable from $$$n$$$.", "input_spec": "The first line contains one integer $$$n$$$ ($$$1 \\le n \\le 10^9$$$).", "output_spec": "Print one integer: the number of different numbers that are reachable from $$$n$$$.", "sample_inputs": ["1098", "10"], "sample_outputs": ["20", "19"], "notes": "NoteThe numbers that are reachable from $$$1098$$$ are:$$$1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 1098, 1099$$$."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = 1;\n$c = array($a => 1);\nwhile(TRUE)\n{\n     $a = intval($a);\n     $a += 1;\n     while(TRUE)\n     {\n          $a = strval($a);\n          if($a[strlen($a) - 1] == 0)\n          {\n               $a = substr($a, 0, -1);\n          }\n          else\n          {\n               break;\n          }\n     }\n     if($c[$a] == 1)\n     {\n          break;\n     }\n     else\n     {\n          $b++;\n          $c[$a] = 1;\n     }\n}\nprint $b;\n?>"}, {"source_code": "<?php\nlist($n) = explode(' ', trim(fgets(STDIN)));\n$iCount = strlen($n) == 1 ? 9 : 10;\n$bFlag = strlen($n) == 1 ? true : false;\nif(!$bFlag){\n    foreach (str_split($n) as $sK => $sV){\n        if($sK != 0){\n            $iCount += 9 - $sV;\n        }\n    }\n}\n\necho $iCount;\n\n"}, {"source_code": "<?php\n\nfunction f($n){\n\t$n++;\n\twhile($n % 10 == 0) { $n /= 10; }\n\treturn $n;\n}\n\n$n = $n0 = trim(fgets(STDIN));\n\n$a = [];\n\n$c = 0;\n\nwhile($c < 10000) { $n = f($n); $a[] = $n; $c++; }\n\n$a = array_unique($a);\n\nif(in_array($n0, $a)) echo count($a); else echo count($a)+1;"}, {"source_code": "<?php\n    $n = trim(fgets(STDIN));\n    $a = str_split($n);\n    $i = count($a) == 1 ? 9 : 10;\n    foreach ($a AS $k => $v) {\n        if ($k != 0) {\n            $i += 9 - $v;\n        }\n    }\n    echo $i;\n?>"}], "negative_code": [{"source_code": "<?php\n\nfunction f($n){\n\t$n++;\n\twhile($n % 10 == 0) { $n /= 10; }\n\treturn $n;\n}\n\n$n = trim(fgets(STDIN));\n\n$a = [];\n\n$c = 0;\n\nwhile($c < 10000) { $n = f($n); $a[] = $n; $c++; }\n\n$a = array_unique($a);\n\necho count($a) + 1;"}, {"source_code": "<?php\n\nfunction f($n){\n\t$n++;\n\twhile($n % 10 == 0) $n /= 10;\n\treturn $n;\n}\n\n$n = trim(fgets(STDIN));\n\n$c = 1;\n\nwhile($n > 1) { $n = f($n); $c++; }\n\necho $c;"}, {"source_code": "<?php\n    $n = trim(fgets(STDIN));\n    $a = str_split($n);\n    print_r($a);\n    $i = 2;\n    foreach ($a AS $v) {\n            $i += 9 - $v;\n    }\n    echo $i;\n?>"}, {"source_code": "<?php\n    $n = trim(fgets(STDIN));\n    $a = str_split($n);\n    $i = count($a) == 1 ? 1 : 2;\n    foreach ($a AS $v) {\n            $i += 9 - $v;\n    }\n    echo $i;\n?>"}, {"source_code": "<?php\n    $n = trim(fgets(STDIN));\n    $a = str_split($n);\n    $i = 2;\n    foreach ($a AS $v) {\n            $i += 9 - $v;\n    }\n    echo $i;\n?>"}], "src_uid": "055fbbde4b9ffd4473e6e716da6da899"}
{"nl": {"description": "Kolya is developing an economy simulator game. His most favourite part of the development process is in-game testing. Once he was entertained by the testing so much, that he found out his game-coin score become equal to 0.Kolya remembers that at the beginning of the game his game-coin score was equal to n and that he have bought only some houses (for 1\u2009234\u2009567 game-coins each), cars (for 123\u2009456 game-coins each) and computers (for 1\u2009234 game-coins each).Kolya is now interested, whether he could have spent all of his initial n game-coins buying only houses, cars and computers or there is a bug in the game. Formally, is there a triple of non-negative integers a, b and c such that a\u2009\u00d7\u20091\u2009234\u2009567\u2009+\u2009b\u2009\u00d7\u2009123\u2009456\u2009+\u2009c\u2009\u00d7\u20091\u2009234\u2009=\u2009n?Please help Kolya answer this question.", "input_spec": "The first line of the input contains a single integer n (1\u2009\u2264\u2009n\u2009\u2264\u2009109)\u00a0\u2014 Kolya's initial game-coin score.", "output_spec": "Print \"YES\" (without quotes) if it's possible that Kolya spent all of his initial n coins buying only houses, cars and computers. Otherwise print \"NO\" (without quotes).", "sample_inputs": ["1359257", "17851817"], "sample_outputs": ["YES", "NO"], "notes": "NoteIn the first sample, one of the possible solutions is to buy one house, one car and one computer, spending 1\u2009234\u2009567\u2009+\u2009123\u2009456\u2009+\u20091234\u2009=\u20091\u2009359\u2009257 game-coins in total."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\nif($a == 11403961)\n{\n     print \"YES\";\n}\nelse\n{\n     $b = $a % 1234567;\n     $c = $a % 123456;\n     $d = $a % 1234;\n     if($b == 0)\n     {\n          print \"YES\";\n     }\n     elseif($c == 0)\n     {\n          print \"YES\";\n     }\n     elseif($d == 0)\n     {\n          print \"YES\";\n     }\n     else\n     {\n          $e = $a % 1234567;\n          $f = $e % 123456;\n          $g = $e % 1234;\n          if(($f == 0) || ($g == 0))\n          {\n               print \"YES\";\n          }\n          else\n          {\n               $e = $a % 123456;\n               $f = $e % 1234567;\n               $g = $e % 1234;\n               if(($f == 0) || ($g == 0))\n               {\n                    print \"YES\";\n               }\n               else\n               {\n                    $e = $a % 1234;\n                    $f = $e % 1234567;\n                    $g = $e % 123456;\n                    if(($f == 0) || ($g == 0))\n                    {\n                         print \"YES\";\n                    }\n                    else\n                    {\n                         $h = 0;\n                         for($x = 1; $x <= 1000; $x++)\n                         {\n                              $i = $a - $x * 1234567;\n                              if($i <= 0)\n                              {\n                                   break;\n                              }\n                              for($y = 1; $y <= 1000; $y++)\n                              {\n                                   $i -= 123456;\n                                   if($i <= 0)\n                                   {\n                                        break;\n                                   }\n                                   $j = $i % 1234;\n                                   if($j == 0)\n                                   {\n                                        $h = 1;\n                                        break;\n                                   }\n                                   elseif($i <= 0)\n                                   {\n                                        break;\n                                   }\n                              }\n                              if($h == 1)\n                              {\n                                   break;\n                              }\n                         }\n                         if($h == 1)\n                         {\n                              print \"YES\";\n                         }\n                         else\n                         {\n                              print \"NO\";\n                         }\n                    }\n               }\n          }\n     }\n}\n?>"}, {"source_code": "<?php\n$fp = fopen('php://stdin', 'r');\n$n = (int)fgets($fp);\nfor($a = 0; $a <= $n/1234567; ++$a) {\n\t$m1 = $n - $a*1234567;\n\tfor($b = 0; $b <= $m1/123456; ++$b) {\n\t\t$m2 = $m1 - $b*123456;\n\t\tif (!($m2 % 1234)) {\n\t\t\tdie('YES');\n\t\t}\n\t}\n}\ndie('NO');"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 1234567;\n$c = $a % 123456;\n$d = $a % 1234;\n$e = $a % (1234567 + 123456);\n$f = $a % (1234567 + 1234);\n$g = $a % (123456 + 1234);\n$h = $a % (1234567 + 123456 + 1234);\nif(($b == 0) || ($c == 0) || ($d == 0) || ($e == 0) || ($f == 0) || ($g == 0) || ($h == 0))\n{\n     print \"YES\";\n}\nelseif($a > 1234567)\n{\n     $i = floor($a / 1234567);\n     $j = $a % 1234567;\n     $k = 0;\n     if($j < 123456)\n     {\n          $l = $j % 1234;\n          if($l == 0)\n          {\n               $k = 1;\n          }\n          else\n          {\n               for($x = 1; $x <= $i; $x++)\n               {\n                    $l = floor($j / 123456);\n                    $m = $j % 123456;\n                    for($y = 1; $y <= $l; $y++)\n                    {\n                         $n = $m % 1234;\n                         if($n == 0)\n                         {\n                              $k = 1;\n                              break;\n                         }\n                         else\n                         {\n                              $m += 123456;\n                         }\n                    }\n                    if($k == 1)\n                    {\n                         break;\n                    }\n                    else\n                    {\n                         $j += 1234567;\n                    }\n               }\n          }\n     }\n     else\n     {\n          for($x = 1; $x <= $i; $x++)\n          {\n               $l = floor($j / 123456);\n               $m = $j % 123456;\n               for($y = 1; $y <= $l; $y++)\n               {\n                    $n = $m % 1234;\n                    if($n == 0)\n                    {\n                         $k = 1;\n                         break;\n                    }\n                    else\n                    {\n                         $m += 123456;\n                    }\n               }\n               if($k == 1)\n               {\n                    break;\n               }\n               else\n               {\n                    $j += 1234567;\n               }\n          }\n     }\n     if($k == 0)\n     {\n          print \"NO\";\n     }\n     else\n     {\n          print \"YES\";\n     }\n}\nelseif($a > 123456)\n{\n     $i = floor($a / 123456);\n     $j = $a % 123456;\n     $k = 0;\n     for($x = 1; $x <= $i; $x++)\n     {\n          $l = $j % 1234;\n          if($l == 0)\n          {\n               $k = 1;\n               break;\n          }\n          else\n          {\n               $j += 123456;\n          }\n     }\n     if($k == 0)\n     {\n          print \"NO\";\n     }\n     else\n     {\n          print \"YES\";\n     }\n}\nelseif($a > 1234)\n{\n     $i = $a % 1234;\n     if($i == 0)\n     {\n          print \"YES\";\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 1234567;\n$c = $a % 123456;\n$d = $a % 1234;\n$e = $a % (1234567 + 123456);\n$f = $a % (1234567 + 1234);\n$g = $a % (123456 + 1234);\n$h = $a % (1234567 + 123456 + 1234);\nif(($b == 0) || ($c == 0) || ($d == 0) || ($e == 0) || ($f == 0) || ($g == 0) || ($h == 0))\n{\n     print \"YES\";\n}\nelseif($a > 1234567)\n{\n     $i = floor($a / 1234567);\n     $j = $a % 1234567;\n     $k = 0;\n     for($x = 1; $x <= $i; $x++)\n     {\n          $l = floor($j / 123456);\n          $m = $j % 123456;\n          for($y = 1; $y <= $l; $y++)\n          {\n               $n = $m % 1234;\n               if($n == 0)\n               {\n                    $k = 1;\n                    break;\n               }\n               else\n               {\n                    $n += 123456;\n               }\n          }\n          if($k == 1)\n          {\n               break;\n          }\n          else\n          {\n               $j += 1234567;\n          }\n     }\n     if($k == 0)\n     {\n          print \"NO\";\n     }\n     else\n     {\n          print \"YES\";\n     }\n}\nelseif($a > 123456)\n{\n     $i = floor($a / 123456);\n     $j = $a % 123456;\n     $k = 0;\n     for($x = 1; $x <= $i; $x++)\n     {\n          $l = $j % 1234;\n          if($l == 0)\n          {\n               $k = 1;\n               break;\n          }\n          else\n          {\n               $j += 123456;\n          }\n     }\n     if($k == 0)\n     {\n          print \"NO\";\n     }\n     else\n     {\n          print \"YES\";\n     }\n}\nelseif($a > 1234)\n{\n     $i = $a % 1234;\n     if($i == 0)\n     {\n          print \"YES\";\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\nif($a == 11403961)\n{\n     print \"YES\";\n}\nelse\n{\n     $b = $a % 1234567;\n     $c = $a % 123456;\n     $d = $a % 1234;\n     $e = $a % (1234567 + 123456);\n     $f = $a % (1234567 + 1234);\n     $g = $a % (123456 + 1234);\n     $h = $a % (1234567 + 123456 + 1234);\n     if(($b == 0) || ($c == 0) || ($d == 0) || ($e == 0) || ($f == 0) || ($g == 0) || ($h == 0))\n     {\n          print \"YES\";\n     }\n     elseif($a > 1234567)\n     {\n          $i = floor($a / 1234567);\n          $j = $a % 1234567;\n          $k = 0;\n          if($j < 123456)\n          {\n               $l = $j % 1234;\n               if($l == 0)\n               {\n                    $k = 1;\n               }\n               else\n               {\n                    for($x = 1; $x <= $i; $x++)\n                    {\n                         $l = floor($j / 123456);\n                         $m = $j % 123456;\n                         for($y = 1; $y <= $l; $y++)\n                         {\n                              $n = $m % 1234;\n                              if($n == 0)\n                              {\n                                   $k = 1;\n                                   break;\n                              }\n                              else\n                              {\n                                   $m += 123456;\n                              }\n                         }\n                         if($k == 1)\n                         {\n                              break;\n                         }\n                         else\n                         {\n                              $j += 1234567;\n                         }\n                    }\n               }\n          }\n          else\n          {\n               for($x = 1; $x <= $i; $x++)\n               {\n                    $l = floor($j / 123456);\n                    $m = $j % 123456;\n                    for($y = 1; $y <= $l; $y++)\n                    {\n                         $n = $m % 1234;\n                         if($n == 0)\n                         {\n                              $k = 1;\n                              break;\n                         }\n                         else\n                         {\n                              $m += 123456;\n                         }\n                    }\n                    if($k == 1)\n                    {\n                         break;\n                    }\n                    else\n                    {\n                         $j += 1234567;\n                    }\n               }\n          }\n          if($k == 0)\n          {\n               print \"NO\";\n          }\n          else\n          {\n               print \"YES\";\n          }\n     }\n     elseif($a > 123456)\n     {\n          $i = floor($a / 123456);\n          $j = $a % 123456;\n          $k = 0;\n          for($x = 1; $x <= $i; $x++)\n          {\n               $l = $j % 1234;\n               if($l == 0)\n               {\n                    $k = 1;\n                    break;\n               }\n               else\n               {\n                    $j += 123456;\n               }\n          }\n          if($k == 0)\n          {\n               print \"NO\";\n          }\n          else\n          {\n               print \"YES\";\n          }\n     }\n     elseif($a > 1234)\n     {\n          $i = $a % 1234;\n          if($i == 0)\n          {\n               print \"YES\";\n          }\n          else\n          {\n               print \"NO\";\n          }\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\nif($a == 11403961)\n{\n     print \"YES\";\n}\nelse\n{\n     $b = $a % 1234567;\n     $c = $a % 123456;\n     $d = $a % 1234;\n     $e = $a % (1234567 + 123456);\n     $f = $a % (1234567 + 1234);\n     $g = $a % (123456 + 1234);\n     $h = $a % (1234567 + 123456 + 1234);\n     if(($b == 0) || ($c == 0) || ($d == 0) || ($e == 0) || ($f == 0) || ($g == 0) || ($h == 0))\n     {\n          print \"YES\";\n     }\n     elseif($a > 1234567)\n     {\n          $i = floor($a / 1234567);\n          $j = $a % 1234567;\n          $k = 0;\n          if($j < 123456)\n          {\n               $l = $j % 1234;\n               if($l == 0)\n               {\n                    $k = 1;\n               }\n          }\n          else\n          {\n               for($x = 1; $x <= $i; $x++)\n               {\n                    $l = floor($j / 123456);\n                    $m = $j % 123456;\n                    for($y = 1; $y <= $l; $y++)\n                    {\n                         $n = $m % 1234;\n                         if($n == 0)\n                         {\n                              $k = 1;\n                              break;\n                         }\n                         else\n                         {\n                              $m += 123456;\n                         }\n                    }\n                    if($k == 1)\n                    {\n                         break;\n                    }\n                    else\n                    {\n                         $j += 1234567;\n                    }\n               }\n          }\n          if($k == 0)\n          {\n               print \"NO\";\n          }\n          else\n          {\n               print \"YES\";\n          }\n     }\n     elseif($a > 123456)\n     {\n          $i = floor($a / 123456);\n          $j = $a % 123456;\n          $k = 0;\n          for($x = 1; $x <= $i; $x++)\n          {\n               $l = $j % 1234;\n               if($l == 0)\n               {\n                    $k = 1;\n                    break;\n               }\n               else\n               {\n                    $j += 123456;\n               }\n          }\n          if($k == 0)\n          {\n               print \"NO\";\n          }\n          else\n          {\n               print \"YES\";\n          }\n     }\n     elseif($a > 1234)\n     {\n          $i = $a % 1234;\n          if($i == 0)\n          {\n               print \"YES\";\n          }\n          else\n          {\n               print \"NO\";\n          }\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 1234567;\n$c = $a % 123456;\n$d = $a % 1234;\nif($b == 0)\n{\n     print \"YES\";\n}\nelseif($c == 0)\n{\n     print \"YES\";\n}\nelseif($d == 0)\n{\n     print \"YES\";\n}\nelse\n{\n     $e = $a % 1234567;\n     $f = $e % 123456;\n     $g = $e % 1234;\n     if(($f == 0) || ($g == 0))\n     {\n          print \"YES\";\n     }\n     else\n     {\n          $e = $a % 123456;\n          $f = $e % 1234567;\n          $g = $e % 1234;\n          if(($f == 0) || ($g == 0))\n          {\n               print \"YES\";\n          }\n          else\n          {\n               $e = $a % 1234;\n               $f = $e % 1234567;\n               $g = $e % 123456;\n               if(($f == 0) || ($g == 0))\n               {\n                    print \"YES\";\n               }\n               else\n               {\n                    $h = 0;\n                    for($x = 1; $x <= 1000; $x++)\n                    {\n                         $i = $a - $x * 1234567;\n                         if($i <= 0)\n                         {\n                              break;\n                         }\n                         for($y = 1; $y <= 1000; $y++)\n                         {\n                              $i -= 123456;\n                              $j = $i % 1234;\n                              if($j == 0)\n                              {\n                                   $h = 1;\n                                   break;\n                              }\n                              elseif($i <= 0)\n                              {\n                                   break;\n                              }\n                         }\n                         if($h == 1)\n                         {\n                              break;\n                         }\n                    }\n                    if($h == 1)\n                    {\n                         print \"YES\";\n                    }\n                    else\n                    {\n                         print \"NO\";\n                    }\n               }\n          }\n     }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 1234567;\n$c = $a % 123456;\n$d = $a % 1234;\n$e = $a % (1234567 + 123456);\n$f = $a % (1234567 + 1234);\n$g = $a % (123456 + 1234);\n$h = $a % (1234567 + 123456 + 1234);\nif(($b == 0) || ($c == 0) || ($d == 0) || ($e == 0) || ($f == 0) || ($g == 0) || ($h == 0))\n{\n     print \"YES\";\n}\nelseif($a > 1234567)\n{\n     $i = floor($a / 1234567);\n     $j = $a % 1234567;\n     $k = 0;\n     for($x = 1; $x <= $i; $x++)\n     {\n          $l = floor($j / 123456);\n          $m = $j % 123456;\n          for($y = 1; $y <= $l; $y++)\n          {\n               $n = $m % 1234;\n               if($n == 0)\n               {\n                    $k = 1;\n                    break;\n               }\n               else\n               {\n                    $m += 123456;\n               }\n          }\n          if($k == 1)\n          {\n               break;\n          }\n          else\n          {\n               $j += 1234567;\n          }\n     }\n     if($k == 0)\n     {\n          print \"NO\";\n     }\n     else\n     {\n          print \"YES\";\n     }\n}\nelseif($a > 123456)\n{\n     $i = floor($a / 123456);\n     $j = $a % 123456;\n     $k = 0;\n     for($x = 1; $x <= $i; $x++)\n     {\n          $l = $j % 1234;\n          if($l == 0)\n          {\n               $k = 1;\n               break;\n          }\n          else\n          {\n               $j += 123456;\n          }\n     }\n     if($k == 0)\n     {\n          print \"NO\";\n     }\n     else\n     {\n          print \"YES\";\n     }\n}\nelseif($a > 1234)\n{\n     $i = $a % 1234;\n     if($i == 0)\n     {\n          print \"YES\";\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$f = $a;\n$b = $a % 1234567;\n$c = $a % 123456;\n$d = $a % 1234;\nif($b == 0)\n{\n     print \"YES\";\n}\nelseif($c == 0)\n{\n     print \"YES\";\n}\nelseif($d == 0)\n{\n     print \"YES\";\n}\nelse\n{\n     $e = 0;\n     for($x = 1; $x <= 1000; $x++)\n     {\n          if($a > 1234567)\n          {\n               $a -= 1234567;\n               $b = $a % 123456;\n               $c = $b % 1234;\n               if($c == 0)\n               {\n                    $e = 1;\n                    break;\n               }\n          }\n          elseif($a > 123456)\n          {\n               $a -= 123456;\n               $b = $a % 1234;\n               if($b == 0)\n               {\n                    $e = 1;\n                    break;\n               }\n          }\n          elseif($a > 1234)\n          {\n               $b = $a % 1234;\n               if($b == 0)\n               {\n                    $e = 1;\n                    break;\n               }\n          }\n     }\n     $a = $f;\n     for($x = 1; $x <= 1000; $x++)\n     {\n          if($a > 123456)\n          {\n               $a -= 123456;\n               $b = $a % 1234;\n               if($b == 0)\n               {\n                    $e = 1;\n                    break;\n               }\n          }\n          elseif($a > 1234)\n          {\n               $b = $a % 1234;\n               if($b == 0)\n               {\n                    $e = 1;\n                    break;\n               }\n          }\n     }\n     if($e == 1)\n     {\n          print \"YES\";\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 1234567;\n$c = $a % 123456;\n$d = $a % 1234;\n$e = $a % (1234567 + 123456);\n$f = $a % (1234567 + 1234);\n$g = $a % (123456 + 1234);\n$h = $a % (1234567 + 123456 + 1234);\nif(($b == 0) || ($c == 0) || ($d == 0) || ($e == 0) || ($f == 0) || ($g == 0) || ($h == 0))\n{\n     print \"YES\";\n}\nelseif($a > 1234567)\n{\n     $i = floor($a / 1234567);\n     $j = $a % 1234567;\n     $k = 0;\n     if($j < 123456)\n     {\n          $l = $j % 1234;\n          if($l == 0)\n          {\n               $k = 1;\n          }\n     }\n     else\n     {\n          for($x = 1; $x <= $i; $x++)\n          {\n               $l = floor($j / 123456);\n               $m = $j % 123456;\n               for($y = 1; $y <= $l; $y++)\n               {\n                    $n = $m % 1234;\n                    if($n == 0)\n                    {\n                         $k = 1;\n                         break;\n                    }\n                    else\n                    {\n                         $m += 123456;\n                    }\n               }\n               if($k == 1)\n               {\n                    break;\n               }\n               else\n               {\n                    $j += 1234567;\n               }\n          }\n     }\n     if($k == 0)\n     {\n          print \"NO\";\n     }\n     else\n     {\n          print \"YES\";\n     }\n}\nelseif($a > 123456)\n{\n     $i = floor($a / 123456);\n     $j = $a % 123456;\n     $k = 0;\n     for($x = 1; $x <= $i; $x++)\n     {\n          $l = $j % 1234;\n          if($l == 0)\n          {\n               $k = 1;\n               break;\n          }\n          else\n          {\n               $j += 123456;\n          }\n     }\n     if($k == 0)\n     {\n          print \"NO\";\n     }\n     else\n     {\n          print \"YES\";\n     }\n}\nelseif($a > 1234)\n{\n     $i = $a % 1234;\n     if($i == 0)\n     {\n          print \"YES\";\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 1234567;\n$c = $a % 123456;\n$d = $a % 1234;\nif($b == 0)\n{\n     print \"YES\";\n}\nelseif($c == 0)\n{\n     print \"YES\";\n}\nelseif($d == 0)\n{\n     print \"YES\";\n}\nelse\n{\n     $e = $a % 1234567;\n     $f = $e % 123456;\n     $g = $e % 1234;\n     if(($f == 0) || ($g == 0))\n     {\n          print \"YES\";\n     }\n     else\n     {\n          $e = $a % 123456;\n          $f = $e % 1234567;\n          $g = $e % 1234;\n          if(($f == 0) || ($g == 0))\n          {\n               print \"YES\";\n          }\n          else\n          {\n               $e = $a % 1234;\n               $f = $e % 1234567;\n               $g = $e % 123456;\n               if(($f == 0) || ($g == 0))\n               {\n                    print \"YES\";\n               }\n               else\n               {\n                    $h = 0;\n                    for($x = 1; $x <= 1000; $x++)\n                    {\n                         $i = $a - $x * 1234567;\n                         if($i <= 0)\n                         {\n                              break;\n                         }\n                         for($y = 1; $y <= 1000; $y++)\n                         {\n                              $i -= 123456;\n                              if($i <= 0)\n                              {\n                                   break;\n                              }\n                              $j = $i % 1234;\n                              if($j == 0)\n                              {\n                                   $h = 1;\n                                   break;\n                              }\n                              elseif($i <= 0)\n                              {\n                                   break;\n                              }\n                         }\n                         if($h == 1)\n                         {\n                              break;\n                         }\n                    }\n                    if($h == 1)\n                    {\n                         print \"YES\";\n                    }\n                    else\n                    {\n                         print \"NO\";\n                    }\n               }\n          }\n     }\n}\n?>"}, {"source_code": "<?php\nif($a == 11403961)\n{\n     print \"YES\";\n}\nelse\n{\n     $a = trim(fgets(STDIN));\n     $b = $a % 1234567;\n     $c = $a % 123456;\n     $d = $a % 1234;\n     $e = $a % (1234567 + 123456);\n     $f = $a % (1234567 + 1234);\n     $g = $a % (123456 + 1234);\n     $h = $a % (1234567 + 123456 + 1234);\n     if(($b == 0) || ($c == 0) || ($d == 0) || ($e == 0) || ($f == 0) || ($g == 0) || ($h == 0))\n     {\n          print \"YES\";\n     }\n     elseif($a > 1234567)\n     {\n          $i = floor($a / 1234567);\n          $j = $a % 1234567;\n          $k = 0;\n          for($x = 1; $x <= $i; $x++)\n          {\n               $l = floor($j / 123456);\n               $m = $j % 123456;\n               for($y = 1; $y <= $l; $y++)\n               {\n                    $n = $m % 1234;\n                    if($n == 0)\n                    {\n                         $k = 1;\n                         break;\n                    }\n                    else\n                    {\n                         $m += 123456;\n                    }\n               }\n               if($k == 1)\n               {\n                    break;\n               }\n               else\n               {\n                    $j += 1234567;\n               }\n          }\n          if($k == 0)\n          {\n               print \"NO\";\n          }\n          else\n          {\n               print \"YES\";\n          }\n     }\n     elseif($a > 123456)\n     {\n          $i = floor($a / 123456);\n          $j = $a % 123456;\n          $k = 0;\n          for($x = 1; $x <= $i; $x++)\n          {\n               $l = $j % 1234;\n               if($l == 0)\n               {\n                    $k = 1;\n                    break;\n               }\n               else\n               {\n                    $j += 123456;\n               }\n          }\n          if($k == 0)\n          {\n               print \"NO\";\n          }\n          else\n          {\n               print \"YES\";\n          }\n     }\n     elseif($a > 1234)\n     {\n          $i = $a % 1234;\n          if($i == 0)\n          {\n               print \"YES\";\n          }\n          else\n          {\n               print \"NO\";\n          }\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 1234567;\n$c = $a % 123456;\n$d = $a % 1234;\nif($b == 0)\n{\n     print \"YES\";\n}\nelseif($c == 0)\n{\n     print \"YES\";\n}\nelseif($d == 0)\n{\n     print \"YES\";\n}\nelse\n{\n     $e = 0;\n     for($x = 1; $x <= 1000; $x++)\n     {\n          if($a > 1234567)\n          {\n               $a -= 1234567;\n               $b = $a % 123456;\n               $c = $b % 1234;\n               if($c == 0)\n               {\n                    $e = 1;\n                    break;\n               }\n          }\n          elseif($a > 123456)\n          {\n               $a -= 123456;\n               $b = $a % 1234;\n               if($b == 0)\n               {\n                    $e = 1;\n                    break;\n               }\n          }\n          elseif($a > 1234)\n          {\n               $b = $a % 1234;\n               if($b == 0)\n               {\n                    $e = 1;\n                    break;\n               }\n          }\n     }\n     if($e == 1)\n     {\n          print \"YES\";\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\nif($a == 11403961)\n{\n     print \"YES\";\n}\nelse\n{\n     $a = trim(fgets(STDIN));\n     $b = $a % 1234567;\n     $c = $a % 123456;\n     $d = $a % 1234;\n     $e = $a % (1234567 + 123456);\n     $f = $a % (1234567 + 1234);\n     $g = $a % (123456 + 1234);\n     $h = $a % (1234567 + 123456 + 1234);\n     if(($b == 0) || ($c == 0) || ($d == 0) || ($e == 0) || ($f == 0) || ($g == 0) || ($h == 0))\n     {\n          print \"YES\";\n     }\n     elseif($a > 1234567)\n     {\n          $i = floor($a / 1234567);\n          $j = $a % 1234567;\n          $k = 0;\n          for($x = 1; $x <= $i; $x++)\n          {\n               $l = floor($j / 123456);\n               $m = $j % 123456;\n               for($y = 1; $y <= $l; $y++)\n               {\n                    $n = $m % 1234;\n                    if($n == 0)\n                    {\n                         $k = 1;\n                         break;\n                    }\n                    else\n                    {\n                         $m += 123456;\n                    }\n               }\n               if($k == 1)\n               {\n                    break;\n               }\n               else\n               {\n                    $j += 1234567;\n               }\n          }\n          if($k == 0)\n          {\n               print \"NO\";\n          }\n          else\n          {\n               print \"YES\";\n          }\n     }\n     elseif($a > 123456)\n     {\n          $i = floor($a / 123456);\n          $j = $a % 123456;\n          $k = 0;\n          for($x = 1; $x <= $i; $x++)\n          {\n               $l = $j % 1234;\n               if($l == 0)\n               {\n                    $k = 1;\n                    break;\n               }\n               else\n               {\n                    $j += 123456;\n               }\n          }\n          if($k == 0)\n          {\n               print \"NO\";\n          }\n          else\n          {\n               print \"YES\";\n          }\n     }\n     elseif($a > 1234)\n     {\n          $i = $a % 1234;\n          if($i == 0)\n          {\n               print \"YES\";\n          }\n          else\n          {\n               print \"NO\";\n          }\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 1234567;\n$c = $a % 123456;\n$d = $a % 1234;\n$e = $a % (1234567 + 123456);\n$f = $a % (1234567 + 1234);\n$g = $a % (123456 + 1234);\n$h = $a % (1234567 + 123456 + 1234);\nif(($b == 0) || ($c == 0) || ($d == 0) || ($e == 0) || ($f == 0) || ($g == 0) || ($h == 0))\n{\n     print \"YES\";\n}\nelseif($a > 1234567)\n{\n     $i = floor(bcdiv($a , 1234567));\n     $j = bcmod($a, 1234567);\n     $k = 0;\n     for($x = 1; $x <= $i; $x++)\n     {\n          $l = floor(bcdiv($j, 123456));\n          $m = bcmod($j, 123456);\n          for($y = 1; $y <= $l; $y++)\n          {\n               $n = bcmod($m, 1234);\n               if($n == 0)\n               {\n                    $k = 1;\n                    break;\n               }\n               else\n               {\n                    $m = bcadd($m, 123456);\n               }\n          }\n          if($k == 1)\n          {\n               break;\n          }\n          else\n          {\n               $j = bcadd($j, 1234567);\n          }\n     }\n     if($k == 0)\n     {\n          print \"NO\";\n     }\n     else\n     {\n          print \"YES\";\n     }\n}\nelseif($a > 123456)\n{\n     $i = floor($a / 123456);\n     $j = $a % 123456;\n     $k = 0;\n     for($x = 1; $x <= $i; $x++)\n     {\n          $l = $j % 1234;\n          if($l == 0)\n          {\n               $k = 1;\n               break;\n          }\n          else\n          {\n               $j += 123456;\n          }\n     }\n     if($k == 0)\n     {\n          print \"NO\";\n     }\n     else\n     {\n          print \"YES\";\n     }\n}\nelseif($a > 1234)\n{\n     $i = $a % 1234;\n     if($i == 0)\n     {\n          print \"YES\";\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 1234567;\n$c = $a % 123456;\n$d = $a % 1234;\n$e = $a % (1234567 + 123456);\n$f = $a % (1234567 + 1234);\n$g = $a % (123456 + 1234);\n$h = $a % (1234567 + 123456 + 1234);\nif(($b == 0) || ($c == 0) || ($d == 0) || ($e == 0) || ($f == 0) || ($g == 0) || ($h == 0))\n{\n     print \"YES\";\n}\nelseif($a > 1234567)\n{\n     $i = floor($a / 1234567);\n     $j = $a % 1234567;\n     $k = 0;\n     if($j < 123456)\n     {\n          $l = $j % 1234;\n          if($l == 0)\n          {\n               $k = 1;\n          }\n     }\n     else\n     {\n          for($x = 1; $x <= $i; $x++)\n          {\n               $l = floor($j / 123456);\n               $m = $j % 123456;\n               if($m < 123456)\n               {\n                    $n = $m % 1234;\n                    if($n == 0)\n                    {\n                         $k = 1;\n                         break;\n                    }\n               }\n               else\n               {\n                    for($y = 1; $y <= $l; $y++)\n                    {\n                         $n = $m % 1234;\n                         if($n == 0)\n                         {\n                              $k = 1;\n                              break;\n                         }\n                         else\n                         {\n                              $m += 123456;\n                         }\n                    }\n                    if($k == 1)\n                    {\n                         break;\n                    }\n                    else\n                    {\n                         $j += 1234567;\n                    }\n               }\n          }\n     }\n     if($k == 0)\n     {\n          print \"NO\";\n     }\n     else\n     {\n          print \"YES\";\n     }\n}\nelseif($a > 123456)\n{\n     $i = floor($a / 123456);\n     $j = $a % 123456;\n     $k = 0;\n     for($x = 1; $x <= $i; $x++)\n     {\n          $l = $j % 1234;\n          if($l == 0)\n          {\n               $k = 1;\n               break;\n          }\n          else\n          {\n               $j += 123456;\n          }\n     }\n     if($k == 0)\n     {\n          print \"NO\";\n     }\n     else\n     {\n          print \"YES\";\n     }\n}\nelseif($a > 1234)\n{\n     $i = $a % 1234;\n     if($i == 0)\n     {\n          print \"YES\";\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a % 1234567;\n$c = $a % 123456;\n$d = $a % 1234;\n$e = $a % (1234567 + 123456);\n$f = $a % (1234567 + 1234);\n$g = $a % (123456 + 1234);\n$h = $a % (1234567 + 123456 + 1234);\nif(($b == 0) || ($c == 0) || ($d == 0) || ($e == 0) || ($f == 0) || ($g == 0) || ($h == 0))\n{\n     print \"YES\";\n}\nelseif($a > 1234567)\n{\n     $i = floor($a / 1234567);\n     $j = $a % 1234567;\n     $k = 0;\n     if($j < 123456)\n     {\n          $l = $j % 1234;\n          if($l == 0)\n          {\n               $k = 1;\n          }\n     }\n     else\n     {\n          for($x = 1; $x <= $i; $x++)\n          {\n               $l = floor($j / 123456);\n               $m = $j % 123456;\n               if($m < 123456)\n               {\n                    $k = 1;\n                    break;\n               }\n               else\n               {\n                    for($y = 1; $y <= $l; $y++)\n                    {\n                         $n = $m % 1234;\n                         if($n == 0)\n                         {\n                              $k = 1;\n                              break;\n                         }\n                         else\n                         {\n                              $m += 123456;\n                         }\n                    }\n                    if($k == 1)\n                    {\n                         break;\n                    }\n                    else\n                    {\n                         $j += 1234567;\n                    }\n               }\n          }\n     }\n     if($k == 0)\n     {\n          print \"NO\";\n     }\n     else\n     {\n          print \"YES\";\n     }\n}\nelseif($a > 123456)\n{\n     $i = floor($a / 123456);\n     $j = $a % 123456;\n     $k = 0;\n     for($x = 1; $x <= $i; $x++)\n     {\n          $l = $j % 1234;\n          if($l == 0)\n          {\n               $k = 1;\n               break;\n          }\n          else\n          {\n               $j += 123456;\n          }\n     }\n     if($k == 0)\n     {\n          print \"NO\";\n     }\n     else\n     {\n          print \"YES\";\n     }\n}\nelseif($a > 1234)\n{\n     $i = $a % 1234;\n     if($i == 0)\n     {\n          print \"YES\";\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\nif($a == 11403961)\n{\n     print \"YES\";\n}\nelse\n{\n     $b = $a % 1234567;\n     $c = $a % 123456;\n     $d = $a % 1234;\n     $e = $a % (1234567 + 123456);\n     $f = $a % (1234567 + 1234);\n     $g = $a % (123456 + 1234);\n     $h = $a % (1234567 + 123456 + 1234);\n     if(($b == 0) || ($c == 0) || ($d == 0) || ($e == 0) || ($f == 0) || ($g == 0) || ($h == 0))\n     {\n          print \"YES\";\n     }\n     elseif($a > 1234567)\n     {\n          $i = floor($a / 1234567);\n          $j = $a % 1234567;\n          $k = 0;\n          for($x = 1; $x <= $i; $x++)\n          {\n               $l = floor($j / 123456);\n               $m = $j % 123456;\n               for($y = 1; $y <= $l; $y++)\n               {\n                    $n = $m % 1234;\n                    if($n == 0)\n                    {\n                         $k = 1;\n                         break;\n                    }\n                    else\n                    {\n                         $m += 123456;\n                    }\n               }\n               if($k == 1)\n               {\n                    break;\n               }\n               else\n               {\n                    $j += 1234567;\n               }\n          }\n          if($k == 0)\n          {\n               print \"NO\";\n          }\n          else\n          {\n               print \"YES\";\n          }\n     }\n     elseif($a > 123456)\n     {\n          $i = floor($a / 123456);\n          $j = $a % 123456;\n          $k = 0;\n          for($x = 1; $x <= $i; $x++)\n          {\n               $l = $j % 1234;\n               if($l == 0)\n               {\n                    $k = 1;\n                    break;\n               }\n               else\n               {\n                    $j += 123456;\n               }\n          }\n          if($k == 0)\n          {\n               print \"NO\";\n          }\n          else\n          {\n               print \"YES\";\n          }\n     }\n     elseif($a > 1234)\n     {\n          $i = $a % 1234;\n          if($i == 0)\n          {\n               print \"YES\";\n          }\n          else\n          {\n               print \"NO\";\n          }\n     }\n     else\n     {\n          print \"NO\";\n     }\n}\n?>"}, {"source_code": "<?php\n$fp = fopen('php://stdin', 'r');\n$n = (int)fgets($fp);\n$m1 = $n % 1234567;\n$m2 = $m1 % 123456;\n$m3 = $m2 % 1234;\necho $m3?'NO':'YES';"}], "src_uid": "72d7e422a865cc1f85108500bdf2adf2"}
{"nl": {"description": "We've got no test cases. A big olympiad is coming up. But the problemsetters' number one priority should be adding another problem to the round. The diameter of a multiset of points on the line is the largest distance between two points from this set. For example, the diameter of the multiset {1,\u20093,\u20092,\u20091} is 2.Diameter of multiset consisting of one point is 0.You are given n points on the line. What is the minimum number of points you have to remove, so that the diameter of the multiset of the remaining points will not exceed d?", "input_spec": "The first line contains two integers n and d (1\u2009\u2264\u2009n\u2009\u2264\u2009100,\u20090\u2009\u2264\u2009d\u2009\u2264\u2009100)\u00a0\u2014 the amount of points and the maximum allowed diameter respectively. The second line contains n space separated integers (1\u2009\u2264\u2009xi\u2009\u2264\u2009100)\u00a0\u2014 the coordinates of the points.", "output_spec": "Output a single integer\u00a0\u2014 the minimum number of points you have to remove.", "sample_inputs": ["3 1\n2 1 4", "3 0\n7 7 7", "6 3\n1 3 4 6 9 10"], "sample_outputs": ["1", "0", "3"], "notes": "NoteIn the first test case the optimal strategy is to remove the point with coordinate 4. The remaining points will have coordinates 1 and 2, so the diameter will be equal to 2\u2009-\u20091\u2009=\u20091.In the second test case the diameter is equal to 0, so its is unnecessary to remove any points. In the third test case the optimal strategy is to remove points with coordinates 1, 9 and 10. The remaining points will have coordinates 3, 4 and 6, so the diameter will be equal to 6\u2009-\u20093\u2009=\u20093."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\nsort($c);\n$d = 1;\nfor($x = 0; $x < $a - 1; $x++)\n{\n     $e = 1;\n     for($y = $x + 1; $y < $a; $y++)\n     {\n          $f = $c[$y] - $c[$x];\n          if($f <= $b)\n          {\n               $e++;\n          }\n          else\n          {\n               break;\n          }\n     }\n     $d = max($d, $e);\n}\nprint $a - $d;\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\nsort($c);\n$d = 0;\nfor($x = 0; $x < $a - 1; $x++)\n{\n     $e = 1;\n     for($y = $x + 1; $y < $a; $y++)\n     {\n          $f = $c[$y] - $c[$x];\n          if($f <= $b)\n          {\n               $e++;\n          }\n          else\n          {\n               break;\n          }\n     }\n     $d = max($d, $e);\n}\nprint $a - $d;\n?>"}], "src_uid": "6bcb324c072f796f4d50bafea5f624b2"}
{"nl": {"description": "Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he can win, so he asked you to tell him if he should accept the challenge. Given the lengths of the line segments, check if he can choose exactly 3 of them to form a non-degenerate triangle.Mahmoud should use exactly 3 line segments, he can't concatenate two line segments or change any length. A non-degenerate triangle is a triangle with positive area.", "input_spec": "The first line contains single integer n (3\u2009\u2264\u2009n\u2009\u2264\u2009105)\u00a0\u2014 the number of line segments Mahmoud has. The second line contains n integers a1,\u2009a2,\u2009...,\u2009an (1\u2009\u2264\u2009ai\u2009\u2264\u2009109)\u00a0\u2014 the lengths of line segments Mahmoud has.", "output_spec": "In the only line print \"YES\" if he can choose exactly three line segments and form a non-degenerate triangle with them, and \"NO\" otherwise.", "sample_inputs": ["5\n1 5 3 2 4", "3\n4 1 2"], "sample_outputs": ["YES", "NO"], "notes": "NoteFor the first example, he can use line segments with lengths 2, 4 and 5 to form a non-degenerate triangle."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\nrsort($b);\n$c = 0;\nfor($x = 0; $x < $a - 2; $x++)\n{\n     if($b[$x] < $b[$x + 1] + $b[$x + 2])\n     {\n          $c = 1;\n          break;\n     }\n}\nif($c == 0)\n{\n     print \"NO\";\n}\nelse\n{\n     print \"YES\";\n}\n?>"}, {"source_code": "<?php\n\t$n = trim(fgets(STDIN)) ;\n\t$arr = explode(\" \" , trim(fgets(STDIN))) ;\n\t$check = false;\n\tsort($arr) ;\n\tfor ($i=2; $i < count($arr); $i++) { \n\t\tif($arr[$i] < $arr[$i-1] +  $arr[$i-2])\n\t\t\t$check = true ;\n\t}\n\tif($check)\n\t\techo \"YES\\n\" ;\n\telse\n\t\techo \"NO\\n\"; \n\n?>"}, {"source_code": "<?php\n\nerror_reporting(0);\n\nwhile($line = trim(fgets(STDIN))){\n\n$linhas[]=$line;\nif($a==1) break;\n$a++;\n}\n\n$arrayValores=explode(\" \",$linhas[1]);\n$n=$linhas[0];\n\n\n\nrsort($arrayValores);\n\n$i=0;\n\n$alvo = $arrayValores[sizeof($arrayValores) - 1];\n\nwhile($i<$n) {\n\n$max=$arrayValores[$i];\n$secMax = $arrayValores[$i+1];\n\n$arrayValores = array_slice($arrayValores,1,null,TRUE);\n$a=0;\n\nforeach($arrayValores as $valor){\n\n\tif($a==0) {$a=1; continue;}\n\n\tif(($valor+$secMax>$max)) {\t\n\t\techo \"YES\";\n\t\tdie();\t}\n\n}\n\n$i++;\n\n}\n\necho \"NO\";\n\n\n\n?>"}, {"source_code": "<?php\n    $stdin = fopen(\"php://stdin\", \"r\");\n    $n = trim(fgets(STDIN));\n    $arr = explode(\" \", trim(fgets(STDIN)));\n    fclose($stdin);\n    \n    $flag = false;\n    \n    sort($arr);\n    \n    for($i=0; $i<$n-2; $i++)\n    {\n        if( \n            $arr[$i] + $arr[$i+1]>$arr[$i+2] &&\n            $arr[$i+2] + $arr[$i+1]>$arr[$i] &&\n            $arr[$i] + $arr[$i+2]>$arr[$i+1])\n        {\n            $flag = true;\n            break;\n        }\n    }\n    echo ($flag ? \"YES\" : \"NO\") . PHP_EOL;\n?>"}], "negative_code": [{"source_code": "<?php\n\nerror_reporting(0);\n\nwhile($line = trim(fgets(STDIN))){\n\n$linhas[]=$line;\nif($a==1) break;\n$a++;\n}\n\n$arrayValores=explode(\" \",$linhas[1]);\n\n\n\nrsort($arrayValores);\n\n$i=0;\n\n$alvo = $arrayValores[sizeof($arrayValores) - 2];\n\nwhile(TRUE) {\n\n$max=$arrayValores[$i];\n$secMax = $arrayValores[$i+1];\n\nif($max==$alvo) {echo \"NO\"; break;}\n\n$arrayValores = array_slice($arrayValores,1,null,TRUE);\n$a=0;\n\nforeach($arrayValores as $valor){\n\n\tif($a==0) {$a=1; continue;}\n\n\tif(($valor+$secMax>$max)) {\t\n\t\techo \"YES\";\n\t\tbreak 2;\n\t}\n\n}\n\n$i++;\n\n}\n\n\n\n\n?>"}, {"source_code": "<?php\n\nerror_reporting(0);\n\nwhile($line = trim(fgets(STDIN))){\n\n$linhas[]=$line;\nif($a==1) break;\n$a++;\n}\n\n$arrayValores=explode(\" \",$linhas[1]);\n\n\n\nrsort($arrayValores);\n\n$i=0;\n\n$alvo = $arrayValores[sizeof($arrayValores) - 2];\n\nwhile(TRUE) {\n\n$max=$arrayValores[$i];\n$secMax = $arrayValores[$i+1];\n\nif($max==$alvo) {echo \"NO\"; break;}\n\n$arrayValores = array_slice($arrayValores,1,null,TRUE);\n$a=0;\n\nforeach($arrayValores as $valor){\n\n\tif($a==0) {$a=1; continue;}\n\n\tif($valor+$secMax>=$max) {\t\n\t\techo \"YES\";\n\t\tbreak 2;\n\t}\n\n}\n\n$i++;\n\n}\n\n\n\n\n?>"}, {"source_code": "<?php\n\nerror_reporting(0);\n\nwhile($line = trim(fgets(STDIN))){\n\n$linhas[]=$line;\nif($a==1) break;\n$a++;\n}\n\n$arrayValores=explode(\" \",$linhas[1]);\n\n\n\nrsort($arrayValores);\n\n$i=0;\n\n$alvo = $arrayValores[sizeof($arrayValores) - 1];\n\nwhile(TRUE) {\n\n$max=$arrayValores[$i];\n$secMax = $arrayValores[$i+1];\n\nif($max==$alvo) {echo \"NO\"; break;}\n\n$arrayValores = array_slice($arrayValores,1,null,TRUE);\n$a=0;\n\nforeach($arrayValores as $valor){\n\n\tif($a==0) {$a=1; continue;}\n\n\tif(($valor+$secMax>$max)) {\t\n\t\techo \"YES\";\n\t\tbreak 2;\n\t}\n\n}\n\n$i++;\n\n}\n\n\n\n\n?>"}, {"source_code": "<?php\n    $stdin = fopen(\"php://stdin\", \"r\");\n    $n = trim(fgets(STDIN));\n    $arr = explode(\" \", trim(fgets(STDIN)));\n    fclose($stdin);\n    \n    $flag = false;\n    \n    for($i=0; $i<$n-2; $i++)\n    {\n        if( \n            $arr[$i] + $arr[$i+1]>$arr[$i+2] &&\n            $arr[$i+2] + $arr[$i+1]>$arr[$i] &&\n            $arr[$i] + $arr[$i+2]>$arr[$i+1])\n        {\n            $flag = true;\n            break;\n        }\n    }\n    echo ($flag ? \"YES\" : \"NO\") . PHP_EOL;\n?>\n"}], "src_uid": "897bd80b79df7b1143b652655b9a6790"}
{"nl": {"description": "Polycarp takes part in a math show. He is given n tasks, each consists of k subtasks, numbered 1 through k. It takes him tj minutes to solve the j-th subtask of any task. Thus, time required to solve a subtask depends only on its index, but not on the task itself. Polycarp can solve subtasks in any order.By solving subtask of arbitrary problem he earns one point. Thus, the number of points for task is equal to the number of solved subtasks in it. Moreover, if Polycarp completely solves the task (solves all k of its subtasks), he recieves one extra point. Thus, total number of points he recieves for the complete solution of the task is k\u2009+\u20091.Polycarp has M minutes of time. What is the maximum number of points he can earn?", "input_spec": "The first line contains three integer numbers n, k and M (1\u2009\u2264\u2009n\u2009\u2264\u200945, 1\u2009\u2264\u2009k\u2009\u2264\u200945, 0\u2009\u2264\u2009M\u2009\u2264\u20092\u00b7109). The second line contains k integer numbers, values tj (1\u2009\u2264\u2009tj\u2009\u2264\u20091000000), where tj is the time in minutes required to solve j-th subtask of any task.", "output_spec": "Print the maximum amount of points Polycarp can earn in M minutes.", "sample_inputs": ["3 4 11\n1 2 3 4", "5 5 10\n1 2 4 8 16"], "sample_outputs": ["6", "7"], "notes": "NoteIn the first example Polycarp can complete the first task and spend 1\u2009+\u20092\u2009+\u20093\u2009+\u20094\u2009=\u200910 minutes. He also has the time to solve one subtask of the second task in one minute.In the second example Polycarp can solve the first subtask of all five tasks and spend 5\u00b71\u2009=\u20095 minutes. Also he can solve the second subtasks of two tasks and spend 2\u00b72\u2009=\u20094 minutes. Thus, he earns 5\u2009+\u20092\u2009=\u20097 points in total."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$c2 = $c;\n$d = explode(\" \", trim(fgets(STDIN)));\nsort($d);\n$e = array();\n$f = 0;\n$i = 0;\nfor($x = 0; $x < $b; $x++)\n{\n     $g = $d[$x] * $a;\n     $c2 -= $g;\n     if($c2 < 0)\n     {\n          $c2 += $g;\n          $h = floor($c2 / $d[$x]);\n          $f += $h;\n          $i = 1;\n          break;\n     }\n     elseif($c2 == 0)\n     {\n          $f += $a;\n          break;\n     }\n     elseif($c2 > 0)\n     {\n          $f += $a;\n     }\n}\nif(($x == $b - 1) && ($i == 0))\n{\n     $f += $a;\n}\nelseif(($x == $b - 1) && ($i == 1))\n{\n     $f += $h;\n}\n$e[count($e)] = $f;\n$j = array_sum($d);\nfor($x = 0; $x < $a; $x++)\n{\n     $c2 = $c;\n     $k = 0;\n     for($y = 0; $y <= $x; $y++)\n     {\n          $c2 -= $j;\n          if($c2 < 0)\n          {\n               $c2 += $j;\n               break;\n          }\n          elseif($c2 == 0)\n          {\n               $k += $b + 1;\n               break;\n          }\n          elseif($c2 > 0)\n          {\n               $k += $b + 1;\n          }\n     }\n     if($c2 > 0)\n     {\n          $i = 0;\n          for($z = 0; $z < $b; $z++)\n          {\n               $g = $d[$z] * ($a - $y);\n               $c2 -= $g;\n               if($c2 < 0)\n               {\n                    $c2 += $g;\n                    $h = floor($c2 / $d[$z]);\n                    $k += $h;\n                    $i = 1;\n                    break;\n               }\n               elseif($c2 == 0)\n               {\n                    $k += ($a - $y);\n                    break;\n               }\n               elseif($c2 > 0)\n               {\n                    $k += ($a - $y);\n               }\n          }\n          if(($z == $b - 1) && ($i == 0))\n          {\n               $k += ($a - $y);\n          }\n          elseif(($z == $b - 1) && ($i == 1))\n          {\n               $k += $h;\n          }\n     }\n     $e[count($e)] = $k;\n}\nprint max($e);\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$c2 = $c;\n$d = explode(\" \", trim(fgets(STDIN)));\nsort($d);\n$e = array();\n$f = 0;\n$i = 0;\nfor($x = 0; $x < $b; $x++)\n{\n     $g = $d[$x] * $a;\n     $c2 -= $g;\n     if($c2 < 0)\n     {\n          $c2 += $g;\n          $h = floor($c2 / $d[$x]);\n          $f += $h;\n          $i = 1;\n          break;\n     }\n     elseif($c2 == 0)\n     {\n          $f += $a;\n          break;\n     }\n     elseif($c2 > 0)\n     {\n          $f += $a;\n     }\n}\nif(($x == $b - 1) && ($i == 0))\n{\n     $f += $a;\n}\nelseif(($x == $b - 1) && ($i == 1))\n{\n     $f += $h;\n}\n$e[count($e)] = $f;\n$j = array_sum($d);\n$k = 0;\nfor($x = 0; $x < $a; $x++)\n{\n     $c -= $j;\n     if($c < 0)\n     {\n          $c += $j;\n          $a -= $x;\n          for($y = 0; $y < $b; $y++)\n          {\n               $g = $d[$y] * $a;\n               $c -= $g;\n               if($c < 0)\n               {\n                    $c += $g;\n                    $h = floor($c / $d[$y]);\n                    $k += $h;\n                    break;\n               }\n               elseif($c == 0)\n               {\n                    $k += $a;\n                    break;\n               }\n               elseif($c > 0)\n               {\n                    $k += $a;\n               }\n          }\n          break;\n     }\n     elseif($c == 0)\n     {\n          $k += $b + 1;\n          break;\n     }\n     elseif($c > 0)\n     {\n          $k += $b + 1;\n     }\n}\n$e[count($e)] = $k;\nprint max($e);\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$c2 = $c;\n$d = explode(\" \", trim(fgets(STDIN)));\nsort($d);\n$e = array();\n$f = 0;\nfor($x = 0; $x < $b; $x++)\n{\n     $g = $d[$x] * $a;\n     $c2 -= $g;\n     if($c < 0)\n     {\n          $c2 += $g;\n          $h = floor($c2 / $d[$x]);\n          $f += $h;\n          break;\n     }\n     elseif($c2 == 0)\n     {\n          $f += $a;\n          break;\n     }\n     elseif($c2 > 0)\n     {\n          $f += $a;\n     }\n}\n$i = $a * $b;\nif($f == $i)\n{\n     $f += $a;\n}\n$e[count($e)] = $f;\n$j = array_sum($d);\n$k = 0;\nfor($x = 0; $x < $a; $x++)\n{\n     $c -= $j;\n     if($c < 0)\n     {\n          $c += $j;\n          $a -= $x;\n          for($y = 0; $y < $b; $y++)\n          {\n               $g = $d[$y] * $a;\n               $c -= $g;\n               if($c < 0)\n               {\n                    $c += $g;\n                    $h = floor($c / $d[$y]);\n                    $k += $h;\n                    break;\n               }\n               elseif($c == 0)\n               {\n                    $k += $a;\n                    break;\n               }\n               elseif($c > 0)\n               {\n                    $k += $a;\n               }\n          }\n          break;\n     }\n     elseif($c == 0)\n     {\n          $k += $b + 1;\n          break;\n     }\n     elseif($c > 0)\n     {\n          $k += $b + 1;\n     }\n}\n$e[count($e)] = $k;\nprint max($e);\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$c2 = $c;\n$d = explode(\" \", trim(fgets(STDIN)));\nsort($d);\n$e = array();\n$f = 0;\nfor($x = 0; $x < $b; $x++)\n{\n     $g = $d[$x] * $a;\n     $c2 -= $g;\n     if($c2 < 0)\n     {\n          $c2 += $g;\n          $h = floor($c2 / $d[$x]);\n          $f += $h;\n          break;\n     }\n     elseif($c2 == 0)\n     {\n          $f += $a;\n          break;\n     }\n     elseif($c2 > 0)\n     {\n          $f += $a;\n     }\n}\n$i = $a * $b;\nif($f == $i)\n{\n     $f += $a;\n}\n$e[count($e)] = $f;\n$j = array_sum($d);\n$k = 0;\nfor($x = 0; $x < $a; $x++)\n{\n     $c -= $j;\n     if($c < 0)\n     {\n          $c += $j;\n          $a -= $x;\n          for($y = 0; $y < $b; $y++)\n          {\n               $g = $d[$y] * $a;\n               $c -= $g;\n               if($c < 0)\n               {\n                    $c += $g;\n                    $h = floor($c / $d[$y]);\n                    $k += $h;\n                    break;\n               }\n               elseif($c == 0)\n               {\n                    $k += $a;\n                    break;\n               }\n               elseif($c > 0)\n               {\n                    $k += $a;\n               }\n          }\n          break;\n     }\n     elseif($c == 0)\n     {\n          $k += $b + 1;\n          break;\n     }\n     elseif($c > 0)\n     {\n          $k += $b + 1;\n     }\n}\n$e[count($e)] = $k;\nprint max($e);\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$c2 = $c;\n$d = explode(\" \", trim(fgets(STDIN)));\nsort($d);\n$e = array();\n$f = 0;\n$i = 0;\nfor($x = 0; $x < $b; $x++)\n{\n     $g = $d[$x] * $a;\n     $c2 -= $g;\n     if($c2 < 0)\n     {\n          $c2 += $g;\n          $h = floor($c2 / $d[$x]);\n          $f += $h;\n          $i = 1;\n          break;\n     }\n     elseif($c2 == 0)\n     {\n          $f += $a;\n          break;\n     }\n     elseif($c2 > 0)\n     {\n          $f += $a;\n     }\n}\nif(($x == $b - 1) && ($i == 0))\n{\n     $f += $a;\n}\nelseif(($x == $b - 1) && ($i == 1))\n{\n     $f += $h;\n}\n$e[count($e)] = $f;\n$j = array_sum($d);\nfor($x = 0; $x < $a; $x++)\n{\n     $c2 = $c;\n     $k = 0;\n     for($y = 0; $y <= $x; $y++)\n     {\n          $c2 -= $j;\n          if($c2 < 0)\n          {\n               $c2 += $j;\n               for($z = 0; $z < $b; $z++)\n               {\n                    $g = $d[$z] * ($a - $y);\n                    $c2 -= $g;\n                    if($c2 < 0)\n                    {\n                         $c2 += $g;\n                         $h = floor($c2 / $d[$z]);\n                         $k += $h;\n                         $c2 -= $g;\n                         break;\n                    }\n                    elseif($c2 == 0)\n                    {\n                         $k += ($a - $y);\n                         break;\n                    }\n                    elseif($c2 > 0)\n                    {\n                         $k += ($a - $y);\n                    }\n               }\n               break;\n          }\n          elseif($c2 == 0)\n          {\n               $k += $b + 1;\n               break;\n          }\n          elseif($c2 > 0)\n          {\n               $k += $b + 1;\n          }\n     }\n     if($c2 > 0)\n     {\n          $i = 0;\n          for($z = 0; $z < $b; $z++)\n          {\n               $g = $d[$z] * ($a - $y);\n               $c2 -= $g;\n               if($c2 < 0)\n               {\n                    $c2 += $g;\n                    $h = floor($c2 / $d[$z]);\n                    $k += $h;\n                    break;\n               }\n               elseif($c2 == 0)\n               {\n                    $k += ($a - $y);\n                    break;\n               }\n               elseif($c2 > 0)\n               {\n                    $k += ($a - $y);\n               }\n          }\n          if(($x == $b - 1) && ($i == 0))\n          {\n               $k += ($a - $y);\n          }\n          elseif(($x == $b - 1) && ($i == 1))\n          {\n               $k += $h;\n          }\n     }\n     $e[count($e)] = $k;\n}\nprint max($e);\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$c2 = $c;\n$d = explode(\" \", trim(fgets(STDIN)));\nsort($d);\n$e = array();\n$f = 0;\n$i = 0;\nfor($x = 0; $x < $b; $x++)\n{\n     $g = $d[$x] * $a;\n     $c2 -= $g;\n     if($c2 < 0)\n     {\n          $c2 += $g;\n          $h = floor($c2 / $d[$x]);\n          $f += $h;\n          $i = 1;\n          break;\n     }\n     elseif($c2 == 0)\n     {\n          $f += $a;\n          break;\n     }\n     elseif($c2 > 0)\n     {\n          $f += $a;\n     }\n}\nif(($x == $b - 1) && ($i == 0))\n{\n     $f += $a;\n}\nelseif(($x == $b - 1) && ($i == 1))\n{\n     $f += $h;\n}\n$e[count($e)] = $f;\n$j = array_sum($d);\nfor($x = 0; $x < $a; $x++)\n{\n     $c2 = $c;\n     $k = 0;\n     for($y = 0; $y <= $x; $y++)\n     {\n          $c2 -= $j;\n          if($c2 < 0)\n          {\n               $c2 += $j;\n               for($z = 0; $z < $b; $z++)\n               {\n                    $g = $d[$z] * ($a - $y);\n                    $c2 -= $g;\n                    if($c2 < 0)\n                    {\n                         $c2 += $g;\n                         $h = floor($c2 / $d[$z]);\n                         $k += $h;\n                         break;\n                    }\n                    elseif($c2 == 0)\n                    {\n                         $k += ($a - $y);\n                         break;\n                    }\n                    elseif($c2 > 0)\n                    {\n                         $k += ($a - $y);\n                    }\n               }\n               break;\n          }\n          elseif($c2 == 0)\n          {\n               $k += $b + 1;\n               break;\n          }\n          elseif($c2 > 0)\n          {\n               $k += $b + 1;\n          }\n     }\n     if($c2 > 0)\n     {\n          $i = 0;\n          for($z = 0; $z < $b; $z++)\n          {\n               $g = $d[$z] * ($a - $y);\n               $c2 -= $g;\n               if($c2 < 0)\n               {\n                    $c2 += $g;\n                    $h = floor($c2 / $d[$z]);\n                    $k += $h;\n                    break;\n               }\n               elseif($c2 == 0)\n               {\n                    $k += ($a - $y);\n                    break;\n               }\n               elseif($c2 > 0)\n               {\n                    $k += ($a - $y);\n               }\n          }\n          if(($x == $b - 1) && ($i == 0))\n          {\n               $k += ($a - $y);\n          }\n          elseif(($x == $b - 1) && ($i == 1))\n          {\n               $k += $h;\n          }\n     }\n     $e[count($e)] = $k;\n}\nprint max($e);\n?>"}], "src_uid": "d659e92a410c1bc836be64fc1c0db160"}
{"nl": {"description": "One day Vasya was going home when he saw a box lying on the road. The box can be represented as a rectangular parallelepiped. Vasya needed no time to realize that the box is special, as all its edges are parallel to the coordinate axes, one of its vertices is at point (0,\u20090,\u20090), and the opposite one is at point (x1,\u2009y1,\u2009z1). The six faces of the box contain some numbers a1,\u2009a2,\u2009...,\u2009a6, exactly one number right in the center of each face.  The numbers are located on the box like that:   number a1 is written on the face that lies on the ZOX plane;  a2 is written on the face, parallel to the plane from the previous point;  a3 is written on the face that lies on the XOY plane;  a4 is written on the face, parallel to the plane from the previous point;  a5 is written on the face that lies on the YOZ plane;  a6 is written on the face, parallel to the plane from the previous point. At the moment Vasya is looking at the box from point (x,\u2009y,\u2009z). Find the sum of numbers that Vasya sees. Note that all faces of the box are not transparent and Vasya can't see the numbers through the box. The picture contains transparent faces just to make it easier to perceive. You can consider that if Vasya is looking from point, lying on the plane of some face, than he can not see the number that is written on this face. It is enough to see the center of a face to see the corresponding number for Vasya. Also note that Vasya always reads correctly the ai numbers that he sees, independently of their rotation, angle and other factors (that is, for example, if Vasya sees some ai\u2009=\u20096, then he can't mistake this number for 9 and so on). ", "input_spec": "The fist input line contains three space-separated integers x, y and z (|x|,\u2009|y|,\u2009|z|\u2009\u2264\u2009106) \u2014 the coordinates of Vasya's position in space. The second line contains three space-separated integers x1, y1, z1 (1\u2009\u2264\u2009x1,\u2009y1,\u2009z1\u2009\u2264\u2009106) \u2014 the coordinates of the box's vertex that is opposite to the vertex at point (0,\u20090,\u20090). The third line contains six space-separated integers a1,\u2009a2,\u2009...,\u2009a6 (1\u2009\u2264\u2009ai\u2009\u2264\u2009106) \u2014 the numbers that are written on the box faces.  It is guaranteed that point (x,\u2009y,\u2009z) is located strictly outside the box.", "output_spec": "Print a single integer \u2014 the sum of all numbers on the box faces that Vasya sees.", "sample_inputs": ["2 2 2\n1 1 1\n1 2 3 4 5 6", "0 0 10\n3 2 3\n1 2 3 4 5 6"], "sample_outputs": ["12", "4"], "notes": "NoteThe first sample corresponds to perspective, depicted on the picture. Vasya sees numbers a2 (on the top face that is the darkest), a6 (on the right face that is the lightest) and a4 (on the left visible face).In the second sample Vasya can only see number a4."}, "positive_code": [{"source_code": "<?php\n\t list($x,$y,$z)=explode(' ',trim(fgets(STDIN)));\n\t list($x1,$y1,$z1)=explode(' ',trim(fgets(STDIN)));\n\t list($a1,$a2,$a3,$a4,$a5,$a6)=explode(' ',trim(fgets(STDIN)));\n\t $s=0;\n\t if($x<0) $s+=$a5;\n\t if($y<0) $s+=$a1;\n\t if($z<0) $s+=$a3;\n\t if($x>$x1) $s+=$a6;\n\t if($y>$y1) $s+=$a2;\n\t if($z>$z1) $s+=$a4;\n\t echo $s;\n?>\n\t   \t\t\t   \t\t\t\t \t \t\t     \t\t"}, {"source_code": "<?php\n\t// God & me\n\t// I found myself in Love empire !\n\t$INPUTS = preg_split(\"/[\\s]+/\", file_get_contents('php://stdin'));\n\tfunction in(){\n\t    static $i = 0;\n\t    global $INPUTS;\n\t    return $INPUTS[$i++];\n\t}\n\t$vx = in(); $vy = in(); $vz = in(); $x = in(); $y = in(); $z = in();\n\t$ans = 0;\n\t$cur = in();\n\tif($vy < 0)  $ans += $cur;\n\t$cur = in();\n\tif($vy > $y)  $ans += $cur;\n\t$cur = in();\n\tif($vz < 0)  $ans += $cur;\n\t$cur = in();\n\tif($vz > $z)  $ans += $cur;\n\t$cur = in();\n\tif($vx < 0)  $ans += $cur;\n\t$cur = in();\n\tif($vx > $x)  $ans += $cur;\n\techo $ans;\n?>\n"}, {"source_code": "<?php\nlist($x1, $y1, $z1) = explode(' ', fgets(STDIN));\nlist($x, $y, $z) = explode(' ', fgets(STDIN));\nlist($a1, $a2, $a3, $a4, $a5, $a6) = explode(' ', fgets(STDIN));\n$z1 = intval($z1);\n$z = intval($z);\n$a6 = intval($a6);\n\n//echo \"$x1, $y1, $z1 / $x, $y, $z / $a1, $a2, $a3, $a4, $a5, $a6\\n\";\n$r = 0;\n\nif ($y1 < 0) $r = $r + $a1;\nif ($y1 > $y) $r = $r + $a2;\nif ($z1 < 0) $r = $r + $a3;\nif ($z1 > $z) $r = $r + $a4;\nif ($x1 < 0) $r = $r + $a5;\nif ($x1 > $x) $r = $r + $a6;\n\necho \"$r\\n\";\n?>"}], "negative_code": [], "src_uid": "c7889a8f64c57cf7be4df870f68f749e"}
{"nl": {"description": "A long time ago (probably even in the first book), Nicholas Flamel, a great alchemist and the creator of the Philosopher's Stone, taught Harry Potter three useful spells. The first one allows you to convert a grams of sand into b grams of lead, the second one allows you to convert c grams of lead into d grams of gold and third one allows you to convert e grams of gold into f grams of sand. When Harry told his friends about these spells, Ron Weasley was amazed. After all, if they succeed in turning sand into lead, lead into gold, and then turning part of the gold into sand again and so on, then it will be possible to start with a small amount of sand and get huge amounts of gold! Even an infinite amount of gold! Hermione Granger, by contrast, was skeptical about that idea. She argues that according to the law of conservation of matter getting an infinite amount of matter, even using magic, is impossible. On the contrary, the amount of matter may even decrease during transformation, being converted to magical energy. Though Hermione's theory seems convincing, Ron won't believe her. As far as Ron is concerned, Hermione made up her law of conservation of matter to stop Harry and Ron wasting their time with this nonsense, and to make them go and do homework instead. That's why Ron has already collected a certain amount of sand for the experiments. A quarrel between the friends seems unavoidable...Help Harry to determine which one of his friends is right, and avoid the quarrel after all. To do this you have to figure out whether it is possible to get the amount of gold greater than any preassigned number from some finite amount of sand.", "input_spec": "The first line contains 6 integers a, b, c, d, e, f (0\u2009\u2264\u2009a,\u2009b,\u2009c,\u2009d,\u2009e,\u2009f\u2009\u2264\u20091000).", "output_spec": "Print \"Ron\", if it is possible to get an infinitely large amount of gold having a certain finite amount of sand (and not having any gold and lead at all), i.e., Ron is right. Otherwise, print \"Hermione\".", "sample_inputs": ["100 200 250 150 200 250", "100 50 50 200 200 100", "100 10 200 20 300 30", "0 0 0 0 0 0", "1 1 0 1 1 1", "1 0 1 2 1 2", "100 1 100 1 0 1"], "sample_outputs": ["Ron", "Hermione", "Hermione", "Hermione", "Ron", "Hermione", "Ron"], "notes": "NoteConsider the first sample. Let's start with the 500 grams of sand. Apply the first spell 5 times and turn the sand into 1000 grams of lead. Then apply the second spell 4 times to get 600 grams of gold. Let\u2019s take 400 grams from the resulting amount of gold turn them back into sand. We get 500 grams of sand and 200 grams of gold. If we apply the same operations to 500 grams of sand again, we can get extra 200 grams of gold every time. Thus, you can get 200, 400, 600 etc. grams of gold, i.e., starting with a finite amount of sand (500 grams), you can get the amount of gold which is greater than any preassigned number.In the forth sample it is impossible to get sand, or lead, or gold, applying the spells.In the fifth sample an infinitely large amount of gold can be obtained by using only the second spell, which allows you to receive 1 gram of gold out of nothing. Note that if such a second spell is available, then the first and the third one do not affect the answer at all.The seventh sample is more interesting. We can also start with a zero amount of sand there. With the aid of the third spell you can get sand out of nothing. We get 10000 grams of sand in this manner. Let's get 100 grams of lead using the first spell 100 times. Then make 1 gram of gold from them. We managed to receive 1 gram of gold, starting with a zero amount of sand! Clearly, in this manner you can get an infinitely large amount of gold."}, "positive_code": [{"source_code": "<?php\n$in = file('php://stdin');\nlist($a,$b,$c,$d,$e,$f) = split(' ',trim($in[0]));\nprint($a*$c*$e<$b*$d*$f||$a<1&&$b*$d>0||$c<1&&$d>0?\"Ron\\n\":\"Hermione\\n\");\n?>\n\n\n"}], "negative_code": [{"source_code": "<?php\n$in = file('php://stdin');\nlist($a,$b,$c,$d,$e,$f) = split(' ',trim($in[0]));\nprint($a*$c*$e<$b*$d*$f||$a===0&&$b*$d>0||$c===0&&$d>0?\"Ron\\n\":\"Hermione\\n\");\n?>\n\n\n"}], "src_uid": "44d608de3e1447f89070e707ba550150"}
{"nl": {"description": "Tokitsukaze is playing a game derivated from Japanese mahjong. In this game, she has three tiles in her hand. Each tile she owns is a suited tile, which means it has a suit (manzu, pinzu or souzu) and a number (a digit ranged from $$$1$$$ to $$$9$$$). In this problem, we use one digit and one lowercase letter, which is the first character of the suit, to represent a suited tile. All possible suited tiles are represented as 1m, 2m, $$$\\ldots$$$, 9m, 1p, 2p, $$$\\ldots$$$, 9p, 1s, 2s, $$$\\ldots$$$, 9s.In order to win the game, she must have at least one mentsu (described below) in her hand, so sometimes she should draw extra suited tiles. After drawing a tile, the number of her tiles increases by one. She can draw any tiles she wants, including those already in her hand.Do you know the minimum number of extra suited tiles she needs to draw so that she can win?Here are some useful definitions in this game:  A mentsu, also known as meld, is formed by a koutsu or a shuntsu;  A koutsu, also known as triplet, is made of three identical tiles, such as [1m, 1m, 1m], however, [1m, 1p, 1s] or [1m, 4m, 7m] is NOT a koutsu;  A shuntsu, also known as sequence, is made of three sequential numbered tiles in the same suit, such as [1m, 2m, 3m] and [5s, 7s, 6s], however, [9m, 1m, 2m] or [1m, 2p, 3s] is NOT a shuntsu. Some examples:   [2m, 3p, 2s, 4m, 1s, 2s, 4s] \u2014 it contains no koutsu or shuntsu, so it includes no mentsu;  [4s, 3m, 3p, 4s, 5p, 4s, 5p] \u2014 it contains a koutsu, [4s, 4s, 4s], but no shuntsu, so it includes a mentsu;  [5p, 5s, 9m, 4p, 1s, 7p, 7m, 6p] \u2014 it contains no koutsu but a shuntsu, [5p, 4p, 6p] or [5p, 7p, 6p], so it includes a mentsu. Note that the order of tiles is unnecessary and you can assume the number of each type of suited tiles she can draw is infinite.", "input_spec": "The only line contains three strings\u00a0\u2014 the tiles in Tokitsukaze's hand. For each string, the first character is a digit ranged from $$$1$$$ to $$$9$$$ and the second character is m, p or s.", "output_spec": "Print a single integer\u00a0\u2014 the minimum number of extra suited tiles she needs to draw.", "sample_inputs": ["1s 2s 3s", "9m 9m 9m", "3p 9m 2p"], "sample_outputs": ["0", "0", "1"], "notes": "NoteIn the first example, Tokitsukaze already has a shuntsu.In the second example, Tokitsukaze already has a koutsu.In the third example, Tokitsukaze can get a shuntsu by drawing one suited tile\u00a0\u2014 1p or 4p. The resulting tiles will be [3p, 9m, 2p, 1p] or [3p, 9m, 2p, 4p]."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = 3;\n$m = 3;\nif(($a == $b) && ($b == $c))\n{\n     $d = 0;\n}\nelseif($a == $b)\n{\n     $d = 1;\n}\nelseif($a == $c)\n{\n     $d = 1;\n}\nelseif($b == $c)\n{\n     $d = 1;\n}\nelse\n{\n     $e = array(0 => $a, 1 => $b, 2 => $c);\n     $f = array(\"s\", \"m\", \"p\");\n     for($w = 0; $w < 3; $w++)\n     {\n          for($x = 1; $x <= 7; $x++)\n          {\n               for($y = $x + 1; $y <= 8; $y++)\n               {\n                    for($z = $y + 1; $z <= 9; $z++)\n                    {\n                         if(($z - $y > 1) || ($y - $x) > 1)\n                         {\n                              break;\n                         }\n                         $g = $x . $f[$w];\n                         $h = $y . $f[$w];\n                         $i = $z . $f[$w];\n                         $j = array($g, $h, $i);\n                         $k = array_intersect($e, $j);\n                         $l = 3 - count($k);\n                         $m = min($m, $l);\n                    }\n               }\n          }\n     }\n}\nprint min($d, $m);\n?>"}, {"source_code": "<?php\n    $n = explode(\" \", trim(fgets(STDIN)));\n    $arr = array('m' => 0, 'p' => 0, 's' => 0);\n    foreach($n as $k => $v){\n        $arr[$v[1]] += 1; \n    }\n    arsort($arr);\n  if(reset($arr) == 1){\n      echo 2;\n  } else if (reset($arr) == 2) {\n      foreach($n as $sk => $sv){\n          if($sv[1] == array_keys($arr)[0]) {\n              $a[] = $sv[0];\n          }\n      }\n      if(abs($a[0] - $a[1]) <= 2) {\n          echo 1;\n      } else {\n          echo 2;\n      }\n  } else if(reset($arr) == 3) {\n      foreach($n as $sk => $sv){\n          if($sv[1] == array_keys($arr)[0]) {\n              $a[] = $sv[0];\n          }\n      }\n      $b = array_count_values($a);\n      arsort($b);\n      if(max($a) - min($a) == 0) {\n          echo 0;\n      } else if (max($a) - min($a) == 2) {\n          if(reset($b) < 2) {\n              echo 0;\n          }else{\n              echo 1;\n          }\n      } else if (max($a) - min($a) > 2){\n          $b = array_count_values($a);\n          arsort($b);\n          $d = array_keys($b);\n          sort($d);\n          $m1 = $d[0]+1;\n          $m2 = $d[2]-1;\n          $m3 = $d[1]+1;\n          $m4 = $d[1]-1;\n          if(reset($b) < 2) {\n                if(in_array($m1, $d) || in_array($m2, $d) || in_array($m3, $d) || in_array($m4, $d) || ($m1 == $m4) || ($m3 == $m2)){\n                    echo 1;\n                } else {\n                    echo 2;\n                }\n          } else {\n              echo 1;\n          }\n      } else {\n          echo 1;\n      }\n  }\n\n ?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = 3;\nif(($a == $b) && ($b == $c))\n{\n     $d = 0;\n}\nelseif($a == $b)\n{\n     $d = 1;\n}\nelseif($a == $c)\n{\n     $d = 1;\n}\nelseif($b == $c)\n{\n     $d = 1;\n}\nelse\n{\n     $e = array(0 => $a, 1 => $b, 2 => $c);\n     $f = array(\"s\", \"m\", \"p\");\n     $m = 3;\n     for($w = 0; $w < 3; $w++)\n     {\n          for($x = 1; $x <= 7; $x++)\n          {\n               for($y = $x + 1; $y <= 8; $y++)\n               {\n                    for($z = $y + 1; $z <= 9; $z++)\n                    {\n                         $g = $x . $f[$w];\n                         $h = $y . $f[$w];\n                         $i = $z . $f[$w];\n                         $j = array($g, $h, $i);\n                         $k = array_intersect($e, $j);\n                         $l = 3 - count($k);\n                         $m = min($m, $l);\n                    }\n               }\n          }\n     }\n}\nprint min($d, $m);\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = 3;\n$m = 3;\nif(($a == $b) && ($b == $c))\n{\n     $d = 0;\n}\nelseif($a == $b)\n{\n     $d = 1;\n}\nelseif($a == $c)\n{\n     $d = 1;\n}\nelseif($b == $c)\n{\n     $d = 1;\n}\nelse\n{\n     $e = array(0 => $a, 1 => $b, 2 => $c);\n     $f = array(\"s\", \"m\", \"p\");\n     for($w = 0; $w < 3; $w++)\n     {\n          for($x = 1; $x <= 7; $x++)\n          {\n               for($y = $x + 1; $y <= 8; $y++)\n               {\n                    for($z = $y + 1; $z <= 9; $z++)\n                    {\n                         $g = $x . $f[$w];\n                         $h = $y . $f[$w];\n                         $i = $z . $f[$w];\n                         $j = array($g, $h, $i);\n                         $k = array_intersect($e, $j);\n                         $l = 3 - count($k);\n                         $m = min($m, $l);\n                    }\n               }\n          }\n     }\n}\nprint min($d, $m);\n?>"}, {"source_code": "<?php\n    $n = explode(\" \", trim(fgets(STDIN)));\n    $arr = array('m' => 0, 'p' => 0, 's' => 0);\n    foreach($n as $k => $v){\n        $arr[$v[1]] += 1; \n    }\n    arsort($arr);\n  if(reset($arr) == 1){\n      echo 2;\n  } else if (reset($arr) == 2) {\n      foreach($n as $sk => $sv){\n          if($sv[1] == array_keys($arr)[0]) {\n              $a[] = $sv[0];\n          }\n      }\n      if(abs($a[0] - $a[1]) <= 2) {\n          echo 1;\n      } else {\n          echo 2;\n      }\n  } else if(reset($arr) == 3) {\n      foreach($n as $sk => $sv){\n          if($sv[1] == array_keys($arr)[0]) {\n              $a[] = $sv[0];\n          }\n      }\n      $b = array_count_values($a);\n      arsort($b);\n      if(max($a) - min($a) == 0) {\n          echo 0;\n      } else if (max($a) - min($a) == 2) {\n          if(reset($b) < 2) {\n              echo 0;\n          }else{\n              echo 1;\n          }\n      } else if (max($a) - min($a) > 2){\n          $b = array_count_values($a);\n          arsort($b);\n          $d = array_keys($b);\n          sort($d);\n          $m1 = $d[0]+1;\n          $m2 = $d[2]-1;\n          $m3 = $d[1]+1;\n          $m4 = $d[1]-1;\n          if(reset($b) < 2) {\n                if(in_array($m1, $d) || in_array($m2, $d) || in_array($m3, $d) || in_array($m4, $d) || ($m1 == $m4) || ($m3 == $m2)){\n                    echo 1;\n                } else {\n                    echo 2;\n                }\n          } else {\n              echo 1;\n          }\n      }\n  }\n\n ?>"}, {"source_code": "<?php\n    $n = explode(\" \", trim(fgets(STDIN)));\n    $arr = array('m' => 0, 'p' => 0, 's' => 0);\n    foreach($n as $k => $v){\n        $arr[$v[1]] += 1; \n    }\n    arsort($arr);\n  if(reset($arr) == 1){\n      echo 2;\n  } else if (reset($arr) == 2) {\n      foreach($n as $sk => $sv){\n          if($sv[1] == array_keys($arr)[0]) {\n              $a[] = $sv[0];\n          }\n      }\n      if(abs($a[0] - $a[1]) <= 2) {\n          echo 1;\n      } else {\n          echo 2;\n      }\n  } else if(reset($arr) == 3) {\n      foreach($n as $sk => $sv){\n          if($sv[1] == array_keys($arr)[0]) {\n              $a[] = $sv[0];\n          }\n      }\n      $b = array_count_values($a);\n      arsort($b);\n      if(max($a) - min($a) == 0) {\n          echo 0;\n      } else if (max($a) - min($a) == 2) {\n          if(reset($b) < 2) {\n              echo 0;\n          }else{\n              echo 1;\n          }\n      } else if (max($a) - min($a) > 2){\n          $b = array_count_values($a);\n          $d = array_keys($b);\n          \n          $max = max($d)-1;\n          $min = min($d)+1;\n          if(reset($b) < 2) {\n                if(in_array($max, $d) || in_array($min, $d)){\n                    echo 1;\n                } else {\n                    echo 2;\n                }\n          } else {\n              echo 1;\n          }\n      }\n  }\n\n ?>"}, {"source_code": "<?php\n    $n = explode(\" \", trim(fgets(STDIN)));\n    $arr = array('m' => 0, 'p' => 0, 's' => 0);\n    foreach($n as $k => $v){\n        $arr[$v[1]] += 1; \n    }\n    arsort($arr);\n  if(reset($arr) == 1){\n      echo 2;\n  } else if (reset($arr) == 2) {\n      foreach($n as $sk => $sv){\n          if($sv[1] == array_keys($arr)[0]) {\n              $a[] = $sv[0];\n          }\n      }\n      if(abs($a[0] - $a[1]) <= 2) {\n          echo 1;\n      } else {\n          echo 2;\n      }\n  } else if(reset($arr) == 3) {\n      foreach($n as $sk => $sv){\n          if($sv[1] == array_keys($arr)[0]) {\n              $a[] = $sv[0];\n          }\n      }\n      $b = array_count_values($a);\n      arsort($b);\n      if(max($a) - min($a) == 0) {\n          echo 0;\n      } else if (max($a) - min($a) == 2) {\n          if(reset($b) < 2) {\n              echo 0;\n          }else{\n              echo 1;\n          }\n      } else if (max($a) - min($a) > 2){\n          $b = array_count_values($a);\n          arsort($b);\n          $d = array_keys($b);\n          \n          $max = max($d)-1;\n          $min = min($d)+1;\n          if(reset($b) < 2) {\n                if(in_array($max, $d) || in_array($min, $d)){\n                    echo 1;\n                } else {\n                    echo 2;\n                }\n          } else {\n              echo 1;\n          }\n      }\n  }\n\n ?>"}, {"source_code": "<?php\n    $n = explode(\" \", trim(fgets(STDIN)));\n    $arr = array('m' => 0, 'p' => 0, 's' => 0);\n    foreach($n as $k => $v){\n        $arr[$v[1]] += 1; \n    }\n    arsort($arr);\n  if(reset($arr) == 1){\n      echo 2;\n  } else if (reset($arr) == 2) {\n      foreach($n as $sk => $sv){\n          if($sv[1] == array_keys($arr)[0]) {\n              $a[] = $sv[0];\n          }\n      }\n      if(abs($a[0] - $a[1]) <= 2) {\n          echo 1;\n      } else {\n          echo 2;\n      }\n  } else if(reset($arr) == 3) {\n      foreach($n as $sk => $sv){\n          if($sv[1] == array_keys($arr)[0]) {\n              $a[] = $sv[0];\n          }\n      }\n      if(max($a) - min($a) == 0) {\n          echo 0;\n      } else if (max($a) - min($a) == 2) {\n          echo 1;\n      } else if (max($a) - min($a) > 2){\n          $b = array_count_values($a);\n          if($b[0] < 2) {\n              echo 2;\n          } else {\n              echo 1;\n          }\n      }\n  }\n\n ?>"}], "src_uid": "7e42cebc670e76ace967e01021f752d3"}
{"nl": {"description": "Carl is a beginner magician. He has a blue, b violet and c orange magic spheres. In one move he can transform two spheres of the same color into one sphere of any other color. To make a spell that has never been seen before, he needs at least x blue, y violet and z orange spheres. Can he get them (possible, in multiple actions)?", "input_spec": "The first line of the input contains three integers a, b and c (0\u2009\u2264\u2009a,\u2009b,\u2009c\u2009\u2264\u20091\u2009000\u2009000)\u00a0\u2014 the number of blue, violet and orange spheres that are in the magician's disposal. The second line of the input contains three integers, x, y and z (0\u2009\u2264\u2009x,\u2009y,\u2009z\u2009\u2264\u20091\u2009000\u2009000)\u00a0\u2014 the number of blue, violet and orange spheres that he needs to get.", "output_spec": "If the wizard is able to obtain the required numbers of spheres, print \"Yes\". Otherwise, print \"No\".", "sample_inputs": ["4 4 0\n2 1 2", "5 6 1\n2 7 2", "3 3 3\n2 2 2"], "sample_outputs": ["Yes", "No", "Yes"], "notes": "NoteIn the first sample the wizard has 4 blue and 4 violet spheres. In his first action he can turn two blue spheres into one violet one. After that he will have 2 blue and 5 violet spheres. Then he turns 4 violet spheres into 2 orange spheres and he ends up with 2 blue, 1 violet and 2 orange spheres, which is exactly what he needs."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e, $f) = explode(\" \", trim(fgets(STDIN)));\nif($a >= $d)\n{\n    $g = $a - $d;\n    $h = floor($g / 2);\n    if($b >= $e)\n    {\n        $i = $b - $e;\n        $j = floor($i / 2);\n        if($c >= $f)\n        {\n            print \"Yes\";\n        }\n        else\n        {\n            if(($h + $j + $c) >= $f)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    else\n    {\n        if($c >= $f)\n        {\n            $k = $c - $f;\n            $l = floor($k / 2);\n            if(($h + $l + $b) >= $e)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            if(($h + $b) >= $e)\n            {\n                $o = ($h + $b) - $e;\n                if(($o + $c) >= $f)\n                {\n                    print \"Yes\";\n                }\n                else\n                {\n                    print \"No\";\n                }\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n}\nelse\n{\n    if($b >= $e)\n    {\n        $i = $b - $e;\n        $j = floor($i / 2);\n        if($c >= $f)\n        {\n            $m = $c - $f;\n            $n = floor($m / 2);\n            if(($a + $j + $n) >= $d)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            if(($a + $j) >= $d)\n            {\n                $p = ($a + $j) - $d;\n                if(($p + $c) >= $f)\n                {\n                    print \"Yes\";\n                }\n                else\n                {\n                    print \"No\";\n                }\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    else\n    {\n        if($c >= $f)\n        {\n            $m = $c - $f;\n            $n = floor($m / 2);\n            if(($a + $n) >= $d)\n            {\n                $p = ($a + $n) - $d;\n                if(($p + $b) >= $e)\n                {\n                    print \"Yes\";\n                }\n                else\n                {\n                    print \"No\";\n                }\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            print \"No\";\n        }\n    }\n}\n?>"}, {"source_code": "<?php \n\n$handle = fopen(\"php://stdin\", \"r\");\nfscanf($handle, \"%d %d %d\", $a, $b, $c);\nfscanf($handle, \"%d %d %d\", $x, $y, $z);\n\n//echo $a . \" \" . $b . \" \" . $c . \"\\n\";\n//echo $x . \" \" . $y . \" \" . $z . \"\\n\";\n\n$d_a = ($x - $a);\n$d_b = ($y - $b);\n$d_c = ($z - $c);\n\n$m_a = $d_a > 0 ? $d_a : 0;\n$m_b = $d_b > 0 ? $d_b : 0;\n$m_c = $d_c > 0 ? $d_c : 0;\n$m = $m_a + $m_b + $m_c;\n\n//echo $m_a . \" \" . $m_b . \" \" . $m_c . \"\\n\";\n\n$e_a = -$d_a > 0 ? floor(-$d_a / 2) : 0;\n$e_b = -$d_b > 0 ? floor(-$d_b / 2) : 0;\n$e_c = -$d_c > 0 ? floor(-$d_c / 2) : 0;\n\n$e = $e_a + $e_b + $e_c;\n\n//echo $e_a . \" \" . $e_b . \" \" . $e_c . \"\\n\";\n\necho $e >= $m ? \"Yes\\n\" : \"No\\n\"\n\n?>"}, {"source_code": "<?php\n\n    function gao($a, $b) {\n        if($a > $b) return ($a-$b-($a-$b)%2)/2;\n        else \n            return $a-$b;\n    }\n\n    fscanf(STDIN, \"%d%d%d\", $a, $b, $c);\n    fscanf(STDIN, \"%d%d%d\", $x, $y, $z);\n    //echo $a, $b, $c;\n    //echo $x, $y, $z;\n    $ans = 0;\n    $ans = $ans + gao($a, $x);// echo $ans , \"\\n\";\n    $ans += gao($b, $y);// echo $ans , '\\n';\n    $ans += gao($c, $z);// echo $ans , '\\n';\n    echo $ans >= 0 ? \"Yes\" : \"No\";\n\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e, $f) = explode(\" \", trim(fgets(STDIN)));\nif($a > $d)\n{\n    $g = $a - $d;\n    $h = floor($g / 2);\n    if($b > $e)\n    {\n        $i = $b - $e;\n        $j = floor($i / 2);\n        if($c > $f)\n        {\n            print \"Yes\";\n        }\n        elseif($c < $f)\n        {\n            if(($h + $j + $c) >= $f)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    else\n    {\n        if($c > $f)\n        {\n            $k = $c - $f;\n            $l = floor($k / 2);\n            if(($j + $b + $l) >= $e)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            $m = $e - $b;\n            $n = $f - $c;\n            if($h >= ($m + $n))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n}\nelseif($a < $d)\n{\n    if($b > $e)\n    {\n        $o = $b - $e;\n        $p = floor($o / 2);\n        if($c > $f)\n        {\n            $r = $c - $f;\n            $s = floor($r / 2);\n            $t = $d - $a;\n            if(($p + $s) >= $t)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            $t = $d - $a;\n            $u = $f - $c;\n            $v = $t + $u;\n            if($s >= $v)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    elseif($b < $e)\n    {\n        if($c > $f)\n        {\n            $w = $c - $f;\n            $x = floor($w / 2);\n            $t = $d - $a;\n            $y = $e - $b;\n            if($x >= ($t + $y))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            print \"No\";\n        }\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e, $f) = explode(\" \", trim(fgets(STDIN)));\nif($a > $d)\n{\n    $g = $a - $d;\n    $h = floor($g / 2);\n    if($b > $e)\n    {\n        $i = $b - $e;\n        $j = floor($i / 2);\n        if($c > $f)\n        {\n            print \"Yes\";\n        }\n        elseif($c < $f)\n        {\n            if(($h + $j + $c) >= $f)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    elseif($b < $e)\n    {\n        if($c > $f)\n        {\n            $k = $c - $f;\n            $l = floor($k / 2);\n            if(($j + $b + $l) >= $e)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        elseif($c < $f)\n        {\n            $m = $e - $b;\n            $n = $f - $c;\n            if($h >= ($m + $n))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n}\nelseif($a < $d)\n{\n    if($b > $e)\n    {\n        $o = $b - $e;\n        $p = floor($o / 2);\n        if($c > $f)\n        {\n            $r = $c - $f;\n            $s = floor($r / 2);\n            $t = $d - $a;\n            if(($p + $s) >= $t)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        elseif($c < $f)\n        {\n            $t = $d - $a;\n            $u = $f - $c;\n            $v = $t + $u;\n            if($s >= $v)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    elseif($b < $e)\n    {\n        if($c > $f)\n        {\n            $w = $c - $f;\n            $x = floor($w / 2);\n            $t = $d - $a;\n            $y = $e - $b;\n            if($x >= ($t + $y))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        elseif($c < $f)\n        {\n            print \"No\";\n        }\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e, $f) = explode(\" \", trim(fgets(STDIN)));\nif($a > $d)\n{\n    $g = $a - $d;\n    $h = floor($g / 2);\n    if($b > $e)\n    {\n        $i = $b - $e;\n        $j = floor($i / 2);\n        if($c > $f)\n        {\n            print \"Yes\";\n        }\n        else\n        {\n            if(($h + $j + $c) >= $f)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    else\n    {\n        if($c > $f)\n        {\n            $k = $c - $f;\n            $l = floor($k / 2);\n            if(($h + $b + $l) >= $e)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            $m = $e - $b;\n            $n = $f - $c;\n            if($h >= ($m + $n))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n}\nelse\n{\n    if($b > $e)\n    {\n        $o = $b - $e;\n        $p = floor($o / 2);\n        if($c > $f)\n        {\n            $r = $c - $f;\n            $s = floor($r / 2);\n            $t = $d - $a;\n            if(($p + $s) >= $t)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            $t = $d - $a;\n            $u = $f - $c;\n            $v = $t + $u;\n            if(floor(($b - $e) / 2) >= $v)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    else\n    {\n        if($c > $f)\n        {\n            $w = $c - $f;\n            $x = floor($w / 2);\n            $t = $d - $a;\n            $y = $e - $b;\n            if($x >= ($t + $y))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            print \"No\";\n        }\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e, $f) = explode(\" \", trim(fgets(STDIN)));\nif($a > $d)\n{\n    $g = $a - $d;\n    $h = floor($g / 2);\n    if($b > $e)\n    {\n        $i = $b - $e;\n        $j = floor($i / 2);\n        if($c > $f)\n        {\n            print \"Yes\";\n        }\n        elseif($c < $f)\n        {\n            if(($h + $j + $c) >= $f)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    else\n    {\n        if($c > $f)\n        {\n            $k = $c - $f;\n            $l = floor($k / 2);\n            if(($h + $b + $l) >= $e)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            $m = $e - $b;\n            $n = $f - $c;\n            if($h >= ($m + $n))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n}\nelseif($a < $d)\n{\n    if($b > $e)\n    {\n        $o = $b - $e;\n        $p = floor($o / 2);\n        if($c > $f)\n        {\n            $r = $c - $f;\n            $s = floor($r / 2);\n            $t = $d - $a;\n            if(($p + $s) >= $t)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            $t = $d - $a;\n            $u = $f - $c;\n            $v = $t + $u;\n            if($s >= $v)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    else\n    {\n        if($c > $f)\n        {\n            $w = $c - $f;\n            $x = floor($w / 2);\n            $t = $d - $a;\n            $y = $e - $b;\n            if($x >= ($t + $y))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            print \"No\";\n        }\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e, $f) = explode(\" \", trim(fgets(STDIN)));\nif($a >= $d)\n{\n    $g = $a - $d;\n    $h = floor($g / 2);\n    if($b >= $e)\n    {\n        $i = $b - $e;\n        $j = floor($i / 2);\n        if($c >= $f)\n        {\n            print \"Yes\";\n        }\n        else\n        {\n            if(($h + $j + ($f - $c)) >= $f)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    else\n    {\n        if($c >= $f)\n        {\n            $k = $c - $f;\n            $l = floor($k / 2);\n            if(($h + $l + ($e - $b)) >= $e)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            if(($h + ($e - $b) + ($f - $c)) >= ($e + $f))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n}\nelse\n{\n    if($b >= $e)\n    {\n        $i = $b - $e;\n        $j = floor($i / 2);\n        if($c >= $f)\n        {\n            $m = $c - $f;\n            $n = floor($m / 2);\n            if((($d - $a) + $j + $n) >= $d)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            if((($d - $a) + $j + ($f - $c)) >= ($d + $f))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    else\n    {\n        if($c >= $f)\n        {\n            $m = $c - $f;\n            $n = floor($m / 2);\n            if($n >= (($d - $a) + ($e - $b)))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            print \"No\";\n        }\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e, $f) = explode(\" \", trim(fgets(STDIN)));\nif($a > $d)\n{\n    $g = $a - $d;\n    $h = floor($g / 2);\n    if($b > $e)\n    {\n        $i = $b - $e;\n        $j = floor($i / 2);\n        if($c > $f)\n        {\n            print \"Yes\";\n        }\n        elseif($c < $f)\n        {\n            if(($h + $j + $c) >= $f)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    else\n    {\n        if($c > $f)\n        {\n            $k = $c - $f;\n            $l = floor($k / 2);\n            if(($h + $b + $l) >= $e)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            $m = $e - $b;\n            $n = $f - $c;\n            if($h >= ($m + $n))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n}\nelseif($a < $d)\n{\n    if($b > $e)\n    {\n        $o = $b - $e;\n        $p = floor($o / 2);\n        if($c > $f)\n        {\n            $r = $c - $f;\n            $s = floor($r / 2);\n            $t = $d - $a;\n            if(($p + $s) >= $t)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            $t = $d - $a;\n            $u = $f - $c;\n            $v = $t + $u;\n            if($s >= $v)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    elseif($b < $e)\n    {\n        if($c > $f)\n        {\n            $w = $c - $f;\n            $x = floor($w / 2);\n            $t = $d - $a;\n            $y = $e - $b;\n            if($x >= ($t + $y))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            print \"No\";\n        }\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e, $f) = explode(\" \", trim(fgets(STDIN)));\nif($a > $d)\n{\n    $g = $a - $d;\n    $h = floor($g / 2);\n    if($b > $e)\n    {\n        $i = $b - $e;\n        $j = floor($i / 2);\n        if($c > $f)\n        {\n            print \"Yes\";\n        }\n        else\n        {\n            if(($h + $j + $c) >= $f)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    else\n    {\n        if($c > $f)\n        {\n            $k = $c - $f;\n            $l = floor($k / 2);\n            if(($h + $b + $l) >= $e)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            $m = $e - $b;\n            $n = $f - $c;\n            if($h >= ($m + $n))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n}\nelse\n{\n    if($b > $e)\n    {\n        $o = $b - $e;\n        $p = floor($o / 2);\n        if($c > $f)\n        {\n            $r = $c - $f;\n            $s = floor($r / 2);\n            $t = $d - $a;\n            if(($p + $s) >= $t)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            $t = $d - $a;\n            $u = $f - $c;\n            $v = $t + $u;\n            if($s >= $v)\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n    }\n    else\n    {\n        if($c > $f)\n        {\n            $w = $c - $f;\n            $x = floor($w / 2);\n            $t = $d - $a;\n            $y = $e - $b;\n            if($x >= ($t + $y))\n            {\n                print \"Yes\";\n            }\n            else\n            {\n                print \"No\";\n            }\n        }\n        else\n        {\n            print \"No\";\n        }\n    }\n}\n?>"}, {"source_code": "<?php \n\n$handle = fopen(\"php://stdin\", \"r\");\nfscanf($handle, \"%d %d %d %d %d %d\", $a, $b, $c, $x, $y, $z);\necho $a, $b, $c;\necho $x, $y, $z;\n\n?>"}, {"source_code": "<?php \n\n$handle = fopen(\"php://stdin\", \"r\");\nfscanf($handle, \"%d %d %d\", $a, $b, $c);\nfscanf($handle, \"%d %d %d\", $x, $y, $z);\n\n//echo $a . \" \" . $b . \" \" . $c . \"\\n\";\n//echo $x . \" \" . $y . \" \" . $z . \"\\n\";\n\n$d_a = ($x - $a);\n$d_b = ($y - $b);\n$d_c = ($z - $c);\n\n$m_a = $d_a > 0 ? $d_a : 0;\n$m_b = $d_b > 0 ? $d_b : 0;\n$m_c = $d_c > 0 ? $d_c : 0;\n$m = $m_a + $m_b + $m_c;\n\n//echo $m_a . \" \" . $m_b . \" \" . $m_c . \"\\n\";\n\n$e_a = -$d_a > 0 ? -$d_a / 2: 0;\n$e_b = -$d_b > 0 ? -$d_b / 2: 0;\n$e_c = -$d_c > 0 ? -$d_c / 2: 0;\n$e = $e_a + $e_b + $e_c;\n\necho $e >= $m ? \"Yes\\n\" : \"No\\n\"\n\n?>"}, {"source_code": "<?php \n\n$handle = fopen(\"php://stdin\", \"r\");\nfscanf($handle, \"%d %d %d\", $a, $b, $c);\nfscanf($handle, \"%d %d %d\", $x, $y, $z);\n\n//echo $a . \" \" . $b . \" \" . $c . \"\\n\";\n//echo $x . \" \" . $y . \" \" . $z . \"\\n\";\n\n$d_a = ($x - $a);\n$d_b = ($y - $b);\n$d_c = ($z - $c);\n\n$m_a = $d_a > 0 ? $d_a : 0;\n$m_b = $d_b > 0 ? $d_b : 0;\n$m_c = $d_c > 0 ? $d_c : 0;\n$m = $m_a + $m_b + $m_c;\n\n//echo $m_a . \" \" . $m_b . \" \" . $m_c . \"\\n\";\n\n$e_a = -$d_a > 0 ? -$d_a / 2: 0;\n$e_b = -$d_b > 0 ? -$d_b / 2: 0;\n$e_c = -$d_c > 0 ? -$d_c / 2: 0;\n$e = $e_a + $e_b + $e_c;\n\necho $e > $m ? \"Yes\\n\" : \"No\\n\"\n\n?>"}, {"source_code": "<?php \n\n$dir = fopen(\"php://stdin\", \"r\");\necho stream_get_contents($dir);\n\n?>"}, {"source_code": "<?php\n\n    function gao($a, $b) {\n        if($a > $b) return intdiv($a-$b, 2);\n        else return $b-$a;\n    }\n\n    fscanf(STDIN, \"%d%d%d\", $a, $b, $c);\n    fscanf(STDIN, \"%d%d%d\", $x, $y, $z);\n    $ans = 0;\n    $ans += gao(a, x);\n    $ans += gao(b, y);\n    $ans += gao(c, z);\n    echo $ans >= 0 ? \"Yes\" : \"No\";\n\n?>"}, {"source_code": "<?php\n\n    function gao($a, $b) {\n        if($a > $b) return ($a-$b-$a%$b)/2;\n        else \n            return $a-$b;\n    }\n\n    fscanf(STDIN, \"%d%d%d\", $a, $b, $c);\n    fscanf(STDIN, \"%d%d%d\", $x, $y, $z);\n    //echo $a, $b, $c;\n    //echo $x, $y, $z;\n    $ans = 0;\n    $ans = $ans + gao($a, $x);\n    $ans += gao($b, $y);\n    $ans += gao($c, $z);\n    echo $ans >= 0 ? \"Yes\" : \"No\";\n\n?>"}], "src_uid": "1db4ba9dc1000e26532bb73336cf12c3"}
{"nl": {"description": "A group of university students wants to get to the top of a mountain to have a picnic there. For that they decided to use a cableway.A cableway is represented by some cablecars, hanged onto some cable stations by a cable. A cable is scrolled cyclically between the first and the last cable stations (the first of them is located at the bottom of the mountain and the last one is located at the top). As the cable moves, the cablecar attached to it move as well.The number of cablecars is divisible by three and they are painted three colors: red, green and blue, in such manner that after each red cablecar goes a green one, after each green cablecar goes a blue one and after each blue cablecar goes a red one. Each cablecar can transport no more than two people, the cablecars arrive with the periodicity of one minute (i. e. every minute) and it takes exactly 30 minutes for a cablecar to get to the top.All students are divided into three groups: r of them like to ascend only in the red cablecars, g of them prefer only the green ones and b of them prefer only the blue ones. A student never gets on a cablecar painted a color that he doesn't like,The first cablecar to arrive (at the moment of time 0) is painted red. Determine the least time it will take all students to ascend to the mountain top.", "input_spec": "The first line contains three integers r, g and b (0\u2009\u2264\u2009r,\u2009g,\u2009b\u2009\u2264\u2009100). It is guaranteed that r\u2009+\u2009g\u2009+\u2009b\u2009&gt;\u20090, it means that the group consists of at least one student. ", "output_spec": "Print a single number \u2014 the minimal time the students need for the whole group to ascend to the top of the mountain.", "sample_inputs": ["1 3 2", "3 2 1"], "sample_outputs": ["34", "33"], "notes": "NoteLet's analyze the first sample.At the moment of time 0 a red cablecar comes and one student from the r group get on it and ascends to the top at the moment of time 30.At the moment of time 1 a green cablecar arrives and two students from the g group get on it; they get to the top at the moment of time 31.At the moment of time 2 comes the blue cablecar and two students from the b group get on it. They ascend to the top at the moment of time 32.At the moment of time 3 a red cablecar arrives but the only student who is left doesn't like red and the cablecar leaves empty.At the moment of time 4 a green cablecar arrives and one student from the g group gets on it. He ascends to top at the moment of time 34.Thus, all the students are on the top, overall the ascension took exactly 34 minutes."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = 0;\n$e = 0;\nwhile(TRUE)\n{\n     if(($a <= 0) && ($b <= 0) && ($c <= 0))\n     {\n          break;\n     }\n     else\n     {\n          if($a > 0)\n          {\n               $a -= 2;\n               if($e == 0)\n               {\n                    $d += 30;\n                    $e = 1;\n               }\n               else\n               {\n                    $d += 1;\n               }\n               if(($a <= 0) && ($b <= 0) && ($c <= 0))\n               {\n                    break;\n               }\n          }\n          else\n          {\n               $d += 1;\n          }\n          if($b > 0)\n          {\n               $b -= 2;\n               if($e == 0)\n               {\n                    $d += 30;\n                    $e = 1;\n               }\n               else\n               {\n                    $d += 1;\n               }\n               if(($a <= 0) && ($b <= 0) && ($c <= 0))\n               {\n                    break;\n               }\n          }\n          else\n          {\n               $d += 1;\n          }\n          if($c > 0)\n          {\n               $c -= 2;\n               if($e == 0)\n               {\n                    $d += 30;\n                    $e = 1;\n               }\n               else\n               {\n                    $d += 1;\n               }\n               if(($a <= 0) && ($b <= 0) && ($c <= 0))\n               {\n                    break;\n               }\n          }\n          else\n          {\n               $d += 1;\n          }\n     }\n}\nprint $d;\n?>"}, {"source_code": "<?\n$arr=explode(' ',trim(fgets(STDIN)));\nforeach ($arr as $val){\n    $newarr[]=ceil($val/2);\n}\n$max=max($newarr);\n$res=30+($max*3-1);\nfor($i=2;$i>0;$i--){\n    if($newarr[$i]==$max) {\n        $pos=$i;\n        break;\n    }\n}\nswitch($pos){\n    case 2: $minus=0; break;\n    case 1: $minus=1; break;\n    case 0: $minus=2; break;\n}\necho $res-$minus;\n?>"}, {"source_code": "<?\n$n=explode(\" \",trim(fgets(STDIN)));\n$y=0;\nforeach($n as $k => $v){\n    $x = ((ceil($v/2)-1)*3)+$k;\n    if($x>$y)$y=$x;\n}\necho $y+30;\n?>"}], "negative_code": [{"source_code": "<?\n$n=explode(\" \",trim(fgets(STDIN)));\nforeach($n as $k => $v){\n    $x = ((ceil($v/2)-1)*3)+$k;\n    if($x>$y)$y=$x;\n}\necho $y+30;\n?>"}], "src_uid": "a45daac108076102da54e07e1e2a37d7"}
{"nl": {"description": "Luke Skywalker gave Chewbacca an integer number x. Chewbacca isn't good at numbers but he loves inverting digits in them. Inverting digit t means replacing it with digit 9\u2009-\u2009t. Help Chewbacca to transform the initial number x to the minimum possible positive number by inverting some (possibly, zero) digits. The decimal representation of the final number shouldn't start with a zero.", "input_spec": "The first line contains a single integer x (1\u2009\u2264\u2009x\u2009\u2264\u20091018) \u2014 the number that Luke Skywalker gave to Chewbacca.", "output_spec": "Print the minimum possible positive number that Chewbacca can obtain after inverting some digits. The number shouldn't contain leading zeroes.", "sample_inputs": ["27", "4545"], "sample_outputs": ["22", "4444"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\n$c = 0;\nfor($x = 0; $x < count($b); $x++)\n{\n    $d = 9 - $b[$x];\n    if(($b[$x] == 9) && ($c == 0))\n    {\n        $c = 1;\n    }\n    elseif(($b[$x] != 9) && ($b[$x] > $d))\n    {\n        $c = 1;\n        $b[$x] = $d;\n    }\n    elseif(($b[$x] != 9) && ($b[$x] < $d))\n    {\n        $c = 1;\n    }\n    elseif($b[$x] == 9)\n    {\n        $b[$x] = $d;\n    }\n}\nprint implode(\"\", $b);\n?>"}, {"source_code": "<?php\n$s = trim(fgets(STDIN));\n\n$res = '';\n\nforeach (str_split($s) as $i => $ch) {\n  $ch = (int)$ch;\n  if ($ch >= 5) {\n    if ($i != 0 || $ch != 9) {\n      $ch = 9 - $ch;\n    }\n  }\n  $res .= $ch;\n}\n\necho \"$res\\n\";\n"}, {"source_code": "<?php\n\n$f = fopen('php://stdin', 'r');\n//$f = fopen('test.txt', 'r');\n\n$s = trim(fgets($f));\n\n$result = '';\n\n\nfor($i=0;$i<strlen($s);$i++){\n\n    if ($i==0 && $s[$i]=='9'){\n        $result.=$s[$i];\n        continue;\n    }\n\n    if ($s[$i]>4){\n        $t = (9 - $s[$i]);\n        $result=$result.$t;\n    } else $result.=$s[$i];\n}\n\nif ($result=='0') exit($s);\n\necho $result;"}, {"source_code": "<?php\n// 514A     \u0427\u0443\u0431\u0430\u043a\u043a\u0430 \u0438 \u0447\u0438\u0441\u043b\u043e    \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n//$n = (int) $input_line;\n\n//list($x1, $y1, $x2, $y2) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$str = substr($input_line, 0, strlen($input_line)-2);\n$len = strlen($str);\n\nfor ($i=0; $i < $len; $i++) { \n    if ($str[$i] > '4') {\n        $str[$i] = (string) (9 - (int) $str[$i]);\n    }\n}\n\nfor ($i=0; $i < $len; $i++) { \n    if ($str[$i] !== '0') {\n        break;\n    } else {\n        $str[$i] = '9';\n        break;\n    }\n}\n\necho $str;\n\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\nfor($x = 0; $x < count($b); $x++)\n{\n    $c = 9 - $b[$x];\n    if($b[$x] > $c)\n    {\n        $b[$x] = $c;\n    }\n}\n$d = implode(\"\", $b);\n$e = intval($d);\nif($e == 0)\n{\n    print $a;\n}\nelse\n{\n    print $e;\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\nfor($x = 0; $x < count($b); $x++)\n{\n    $c = 9 - $b[$x];\n    if($b[$x] > $c)\n    {\n        $b[$x] = $c;\n    }\n}\nprint implode(\"\", $b);\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\n$c = 0;\nfor($x = 0; $x < count($b); $x++)\n{\n    $d = 9 - $b[$x];\n    if(($b[$x] == 9) && ($c == 0))\n    {\n        continue;\n    }\n    elseif(($b[$x] != 9) && ($b[$x] > $d))\n    {\n        $c = 1;\n        $b[$x] = $d;\n    }\n    elseif($b[$x] == 9)\n    {\n        $b[$x] = $d;\n    }\n}\nprint implode(\"\", $b);\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\nfor($x = 0; $x < count($b); $x++)\n{\n    $c = 9 - $b[$x];\n    if($b[$x] > $c)\n    {\n        $b[$x] = $c;\n    }\n}\n$d = implode(\"\", $b);\n$e = intval($d);\nprint $e;\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\n$c = 0;\nfor($x = 0; $x < count($b); $x++)\n{\n    $d = 9 - $b[$x];\n    if(($b[$x] == 9) && ($c == 0))\n    {\n        continue;\n    }\n    elseif(($b[$x] != 9) && ($b[$x] > $d))\n    {\n        $c = 1;\n        $b[$x] = $d;\n    }\n    elseif(($b[$x] != 9) && ($b[$x] < $d))\n    {\n        $c = 1;\n    }\n    elseif($b[$x] == 9)\n    {\n        $b[$x] = $d;\n    }\n}\nprint implode(\"\", $b);\n?>"}, {"source_code": "<?php\n// 514A     \u0427\u0443\u0431\u0430\u043a\u043a\u0430 \u0438 \u0447\u0438\u0441\u043b\u043e    \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n//$n = (int) $input_line;\n\n//list($x1, $y1, $x2, $y2) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$str = substr($input_line, 0, strlen($input_line)-2);\n$len = strlen($str);\n\nfor ($i=0; $i < $len; $i++) { \n    if ($str[$i] > '4') {\n        $str[$i] = (string) (9 - (int) $str[$i]);\n    }\n}\n\nfor ($i=0; $i < $len; $i++) { \n    if ($str[$i] !== '0') break;\n}\n\nif ($i == $len) {\n    echo \"0\";\n} else {\n    echo substr($str, $i);\n}\n\n?>"}, {"source_code": "<?php\n// 514A     \u0427\u0443\u0431\u0430\u043a\u043a\u0430 \u0438 \u0447\u0438\u0441\u043b\u043e    \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n//$n = (int) $input_line;\n\n//list($x1, $y1, $x2, $y2) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$str = substr($input_line, 0, strlen($input_line)-2);\n$strold = $str;\n$len = strlen($str);\n\nfor ($i=0; $i < $len; $i++) { \n    if ($str[$i] > '4') {\n        $str[$i] = (string) (9 - (int) $str[$i]);\n    }\n}\n\nfor ($i=0; $i < $len; $i++) { \n    if ($str[$i] !== '0') break;\n}\n\nif ($i == $len) {\n    echo $strold;\n} else {\n    echo substr($str, $i);\n}\n\n?>"}, {"source_code": "<?php\n// 514A     \u0427\u0443\u0431\u0430\u043a\u043a\u0430 \u0438 \u0447\u0438\u0441\u043b\u043e    \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n//$n = (int) $input_line;\n\n//list($x1, $y1, $x2, $y2) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$str = substr($input_line, 0, strlen($input_line)-2);\n$len = strlen($str);\n\nfor ($i=0; $i < $len; $i++) { \n    if ($str[$i] > '4') {\n        $str[$i] = (string) (9 - (int) $str[$i]);\n    }\n}\n\nfor ($i=0; $i < $len; $i++) { \n    if ($str[$i] !== '0') {\n        break;\n    } else {\n        $str[$i] = '9';\n    }\n}\n\necho $str;\n\n?>"}, {"source_code": "<?php\n// 514A     \u0427\u0443\u0431\u0430\u043a\u043a\u0430 \u0438 \u0447\u0438\u0441\u043b\u043e    \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n//$n = (int) $input_line;\n\n//list($x1, $y1, $x2, $y2) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$str = substr($input_line, 0, strlen($input_line)-2);\n$len = strlen($input_line);\n\nfor ($i=0; $i < $len; $i++) { \n    if ($str[$i] > '4') {\n        $str[$i] = (string) (9 - (int) $str[$i]);\n    }\n}\n\nfor ($i=0; $i < $len; $i++) { \n    if ($str[$i] !== '0') break;\n}\n\nif ($i == $len) {\n    echo \"0\";\n} else {\n    echo substr($str, $i);\n}\n\n?>"}, {"source_code": "<?php\n// 514A     \u0427\u0443\u0431\u0430\u043a\u043a\u0430 \u0438 \u0447\u0438\u0441\u043b\u043e    \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n//$n = (int) $input_line;\n\n//list($x1, $y1, $x2, $y2) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$str = substr($input_line, 0, strlen($input_line)-2);\n$len = strlen($input_line);\n\nfor ($i=0; $i < $len; $i++) { \n    if ($str[$i] > '4') {\n        $str[$i] = (string) (9 - (int) $str[$i]);\n    }\n}\n\nfor ($i=0; $i < $len; $i++) { \n    if ($str[$i] !== '0') break;\n}\n\nif ($i == $len) {\n    echo \"0\";\n} else {\n    echo substr($str, $i - 1);\n}\n\n?>"}], "src_uid": "d5de5052b4e9bbdb5359ac6e05a18b61"}
{"nl": {"description": "Consider an array $$$a$$$ of length $$$n$$$ with elements numbered from $$$1$$$ to $$$n$$$. It is possible to remove the $$$i$$$-th element of $$$a$$$ if $$$gcd(a_i, i) = 1$$$, where $$$gcd$$$ denotes the greatest common divisor. After an element is removed, the elements to the right are shifted to the left by one position.An array $$$b$$$ with $$$n$$$ integers such that $$$1 \\le b_i \\le n - i + 1$$$ is a removal sequence for the array $$$a$$$ if it is possible to remove all elements of $$$a$$$, if you remove the $$$b_1$$$-th element, then the $$$b_2$$$-th, ..., then the $$$b_n$$$-th element. For example, let $$$a = [42, 314]$$$:  $$$[1, 1]$$$ is a removal sequence: when you remove the $$$1$$$-st element of the array, the condition $$$gcd(42, 1) = 1$$$ holds, and the array becomes $$$[314]$$$; when you remove the $$$1$$$-st element again, the condition $$$gcd(314, 1) = 1$$$ holds, and the array becomes empty.  $$$[2, 1]$$$ is not a removal sequence: when you try to remove the $$$2$$$-nd element, the condition $$$gcd(314, 2) = 1$$$ is false. An array is ambiguous if it has at least two removal sequences. For example, the array $$$[1, 2, 5]$$$ is ambiguous: it has removal sequences $$$[3, 1, 1]$$$ and $$$[1, 2, 1]$$$. The array $$$[42, 314]$$$ is not ambiguous: the only removal sequence it has is $$$[1, 1]$$$.You are given two integers $$$n$$$ and $$$m$$$. You have to calculate the number of ambiguous arrays $$$a$$$ such that the length of $$$a$$$ is from $$$1$$$ to $$$n$$$ and each $$$a_i$$$ is an integer from $$$1$$$ to $$$m$$$.", "input_spec": "The only line of the input contains two integers $$$n$$$ and $$$m$$$ ($$$2 \\le n \\le 3 \\cdot 10^5$$$; $$$1 \\le m \\le 10^{12}$$$).", "output_spec": "Print one integer \u2014 the number of ambiguous arrays $$$a$$$ such that the length of $$$a$$$ is from $$$1$$$ to $$$n$$$ and each $$$a_i$$$ is an integer from $$$1$$$ to $$$m$$$. Since the answer can be very large, print it modulo $$$998244353$$$.", "sample_inputs": ["2 3", "4 2", "4 6", "1337 424242424242"], "sample_outputs": ["6", "26", "1494", "119112628"], "notes": null}, "positive_code": [{"source_code": "<?php\r\n$mod = 998244353;\r\n      $inp = preg_split('#\\s+#', trim(file_get_contents(\"php://stdin\")));\r\n      $p = 0;\r\n\r\n      {\r\n        $n = intval($inp[$p++]);\r\n        $m = intval($inp[$p++]);\r\n\r\n        $pr = array();\r\n        $cnts = array();\r\n        $Q = $m;\r\n        $Q = 10000;\r\n        for($i=1;$i<=$Q;$i++) $pr[$i] = true;\r\n        $C = $m;\r\n        for($i=2;$i<=$Q;$i++)\r\n        {\r\n          if (!$pr[$i]) continue;\r\n          $C--;\r\n          for($j=2*$i;$j<=$Q;$j+=$i)\r\n          {\r\n            if (!$pr[$j]) continue;\r\n            $pr[$j] = false;\r\n            $C--;\r\n          }\r\n          $cnts[$i] = $C;\r\n//echo \"[i] {$i} {$C}\\n\";\r\n        }\r\n        $cnts[1] = 0;\r\n  \r\n\t$ans = 0;\r\n\t$all = 1;\r\n        $ok = 1;\r\n        $fac = 1;\r\n        for($i=1;$i<=$n;$i++)\r\n\t{\r\n\r\n          if ($fac <= $m)\r\n            if ($pr[$i]) { $fac *= $i; }\r\n\r\n          $all = bcmod(bcmul($all, $m), $mod);\r\n\r\n\t  $ans = bcmod(bcadd($ans, $all), $mod);\r\n\r\n          $ok = bcmod(bcmul($ok, intdiv($m, $fac)), $mod);\r\n\r\n\t  $ans = bcmod($ans+$mod-$ok, $mod);\r\n\r\n\t}\r\n        echo $ans.\"\\n\";\r\n      }\r\n"}], "negative_code": [], "src_uid": "0fdd91ed33431848614075ebe9d2ee68"}
{"nl": {"description": "Vasya plays the sleuth with his friends. The rules of the game are as follows: those who play for the first time, that is Vasya is the sleuth, he should investigate a \"crime\" and find out what is happening. He can ask any questions whatsoever that can be answered with \"Yes\" or \"No\". All the rest agree beforehand to answer the questions like that: if the question\u2019s last letter is a vowel, they answer \"Yes\" and if the last letter is a consonant, they answer \"No\". Of course, the sleuth knows nothing about it and his task is to understand that.Unfortunately, Vasya is not very smart. After 5 hours of endless stupid questions everybody except Vasya got bored. That\u2019s why Vasya\u2019s friends ask you to write a program that would give answers instead of them.The English alphabet vowels are: A, E, I, O, U, YThe English alphabet consonants are: B, C, D, F, G, H, J, K, L, M, N, P, Q, R, S, T, V, W, X, Z", "input_spec": "The single line contains a question represented by a non-empty line consisting of large and small Latin letters, spaces and a question mark. The line length does not exceed 100. It is guaranteed that the question mark occurs exactly once in the line \u2014 as the last symbol and that the line contains at least one letter.", "output_spec": "Print answer for the question in a single line: YES if the answer is \"Yes\", NO if the answer is \"No\". Remember that in the reply to the question the last letter, not the last character counts. I. e. the spaces and the question mark do not count as letters.", "sample_inputs": ["Is it a melon?", "Is it an apple?", "Is     it a banana ?", "Is   it an apple  and a  banana   simultaneouSLY?"], "sample_outputs": ["NO", "YES", "YES", "YES"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\n$c = count($b);\nfor($x = 0; $x < $c; $x++)\n{\n    if($b[$x] == \" \")\n    {\n        unset($b[$x]);\n    }\n}\n$i = $b;\nsort($i);\n$j = array_keys($i);\n$k = array_combine($j, $b);\n$d = strtoupper($k[count($k) - 2]);\n$e = array(\" \", \"A\", \"E\", \"I\", \"O\", \"U\", \"Y\");\nunset($e[0]);\n$f = array(\" \", \"B\", \"C\", \"D\", \"F\", \"G\", \"H\", \"J\", \"K\", \"L\", \"M\", \"N\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"V\", \"W\", \"X\", \"Z\");\nunset($f[0]);\n$g = array_search($d, $e);\n$h = array_search($d, $f);\nif($g > 0)\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\n    $input = readline();\n    $input = str_replace(' ', '', $input);\n    $input = strtolower($input);\n    $inputArray = str_split($input);\n    $sizeArray = count($inputArray);\n    $array = array(\"a\", \"e\", \"i\", \"o\", \"u\", \"y\");\n    $ban = false;\n    foreach ($array as $key=>$valor) {\n        if ($valor == $inputArray[$sizeArray-2]) {\n            $ban = true;\n            break;\n        }\n    }\n    if ($ban) {\n        echo \"YES\";\n    }else{\n        echo \"NO\";\n    }\n?>"}, {"source_code": "<?\n$g=array('A', 'E', 'I', 'O', 'U', 'Y');\n$str=trim(fgets(STDIN));\n$str=strtoupper(preg_replace('/(\\s+)|\\?/','',$str));\n$len=strlen($str)-1;\nfor($i=0,$n=sizeof($g);$i<$n;$i++){\n    if($g[$i]==$str[$len]) {\n        $res=\"YES\";\n        break;\n    }\n}\nif($res==\"\") $res=\"NO\";\necho $res;\n?>"}, {"source_code": "<?\n$fp=fopen('php://stdin', 'r');\n$lines=stream_get_contents($fp);\n\n$lines=trim($lines);\n\n\n$lines=rtrim($lines, \"?\");\n$lines=trim($lines);\n$n=strlen($lines)-1;\n\nif (in_array(strtolower($lines{$n}), array(\"a\", \"e\", \"i\", \"o\", \"u\", \"y\")))\n    echo 'YES';\nelse\n    echo 'NO';\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\n$c = $b;\nfor($x = 0; $x < count($c); $x++)\n{\n    if($b[$x] == \" \")\n    {\n        array_splice($b, $x, 1);\n    }\n}\n$d = strtoupper($b[count($b) - 2]);\n$e = array(\" \", \"A\", \"E\", \"I\", \"O\", \"U\", \"Y\");\nunset($e[0]);\n$f = array(\" \", \"B\", \"C\", \"D\", \"F\", \"G\", \"H\", \"J\", \"K\", \"L\", \"M\", \"N\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"V\", \"W\", \"X\", \"Z\");\nunset($f[0]);\n$g = array_search($d, $e);\n$h = array_search($d, $f);\nif($g > 0)\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\n    $input = fgets(STDIN);\n    $input = str_replace(' ', '', $input);\n    $input = strtolower($input);\n    $inputArray = str_split($input);\n    $sizeArray = count($inputArray);\n    $array = array(\"a\", \"e\", \"i\", \"o\", \"u\", \"y\");\n    $ban = false;\n    foreach ($array as $key=>$valor) {\n        if ($valor == $inputArray[$sizeArray-2]) {\n            $ban = true;\n            break;\n        }\n    }\n    if ($ban) {\n        echo \"YES\";\n    }else{\n        echo \"NO\";\n    }\n?>"}, {"source_code": "<?php\n    $input = fgets(STDIN); \n    $input = str_replace(' ', '', $input);\n    $input = strtolower($input);\n    $inputArray = str_split($input);\n    $sizeArray = count($inputArray);\n    $array = array(\"a\", \"e\", \"i\", \"o\", \"u\", \"y\");\n    $ban = false;\n    foreach ($array as $key=>$valor) {\n        if ($valor == $inputArray[$sizeArray-2]) {\n            $ban = true;\n            break;\n        }\n    }\n    if ($ban) {\n        echo \"YES\";\n    }else{\n        echo \"NO\";\n    }\n?>"}, {"source_code": "<?php\n    $input = trim(fgets(STDIN)); \n    $input = strtolower($input);\n    $inputArray = str_split($input);\n    $sizeArray = count($inputArray);\n    $array = array(\"a\", \"e\", \"i\", \"o\", \"u\", \"y\");\n    $ban = false;\n    foreach ($array as $key=>$valor) {\n        if ($valor == $inputArray[$sizeArray-2]) {\n            $ban = true;\n            break;\n        }\n    }\n    if ($ban) {\n        echo \"YES\";\n    }else{\n        echo \"NO\";\n    }\n?>"}, {"source_code": "<?php\n    $input = str_replace(' ', '', fgets(STDIN));\n    $input = strtolower($input);\n    $inputArray = str_split($input);\n    $sizeArray = count($inputArray);\n    $array = array(\"a\", \"e\", \"i\", \"o\", \"u\", \"y\");\n    $ban = false;\n    foreach ($array as $key=>$valor) {\n        if ($valor == $inputArray[$sizeArray-2]) {\n            $ban = true;\n            break;\n        }\n    }\n    if ($ban) {\n        echo \"YES\";\n    }else{\n        echo \"NO\";\n    }\n?>"}], "src_uid": "dea7eb04e086a4c1b3924eff255b9648"}
{"nl": {"description": "One rainy gloomy evening when all modules hid in the nearby cafes to drink hot energetic cocktails, the Hexadecimal virus decided to fly over the Mainframe to look for a Great Idea. And she has found one!Why not make her own Codeforces, with blackjack and other really cool stuff? Many people will surely be willing to visit this splendid shrine of high culture.In Mainframe a standard pack of 52 cards is used to play blackjack. The pack contains cards of 13 values: 2, 3, 4, 5, 6, 7, 8, 9, 10, jacks, queens, kings and aces. Each value also exists in one of four suits: hearts, diamonds, clubs and spades. Also, each card earns some value in points assigned to it: cards with value from two to ten earn from 2 to 10 points, correspondingly. An ace can either earn 1 or 11, whatever the player wishes. The picture cards (king, queen and jack) earn 10 points. The number of points a card earns does not depend on the suit. The rules of the game are very simple. The player gets two cards, if the sum of points of those cards equals n, then the player wins, otherwise the player loses.The player has already got the first card, it's the queen of spades. To evaluate chances for victory, you should determine how many ways there are to get the second card so that the sum of points exactly equals n.", "input_spec": "The only line contains n (1\u2009\u2264\u2009n\u2009\u2264\u200925) \u2014 the required sum of points.", "output_spec": "Print the numbers of ways to get the second card in the required way if the first card is the queen of spades.", "sample_inputs": ["12", "20", "10"], "sample_outputs": ["4", "15", "0"], "notes": "NoteIn the first sample only four two's of different suits can earn the required sum of points.In the second sample we can use all tens, jacks, queens and kings; overall it's 15 cards, as the queen of spades (as any other card) is only present once in the pack of cards and it's already in use.In the third sample there is no card, that would add a zero to the current ten points."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = array(\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"10\", \"10\", \"10\", \"10\", \"11\");\n$d = 0;\nif($a <= 10)\n{\n    print \"0\";\n}\nelse\n{\n    $c = $a - 10;\n    for($x = 0; $x < count($b); $x++)\n    {\n        if($c == $b[$x])\n        {\n            $d++;\n        }\n    }\n    if($d < 1)\n    {\n        print \"0\";\n    }\n    elseif($d == 1)\n    {\n        print \"4\";\n    }\n    elseif($d > 1)\n    {\n        print \"15\";\n    }\n}\n?>"}, {"source_code": "<?php\n$points= (int) fgets(STDIN);\nif ($points < 11 || $points > 21) {\n    echo 0;\n} else {\n    $accessPoints = array(1 => 4,\n                          2 => 4,\n                          3 => 4,\n                          4 => 4,\n                          5 => 4,\n                          6 => 4,\n                          7 => 4,\n                          8 => 4,\n                          9 => 4,\n                          10 => 15,\n                          11 => 4\n                         );\n    $key = $points - 10;\n    echo $accessPoints[$key];\n}\n?>"}, {"source_code": "<?php\n\n$src = 'php://stdin';\n//$src = 'input.txt';\n\n$num = ((int) file_get_contents($src)) - 10;\n\n$map = array(\n\t1 => 4,\n\t2 => 4,\n\t3 => 4,\n\t4 => 4,\n\t5 => 4,\n\t6 => 4,\n\t7 => 4,\n\t8 => 4,\n\t9 => 4,\n\t10 => 15,\n\t11 => 4,\n);\n\nif (isset($map[$num])) {\n\techo $map[$num];\n} else {\n\techo 0;\n}\n"}, {"source_code": "<?\n$n=trim(fgets(STDIN));\nif($n>0 && $n<=10) echo \"0\";\nif($n>=11 && $n<=19) echo \"4\";\nif($n==20) echo \"15\";\nif($n==21) echo \"4\";\nif($n>=22 && $n<=25) echo \"0\";\n?>\n"}, {"source_code": "<?php \n$IN = STDIN;\nfscanf($IN, \"%d\", $n);\n$needval = $n-10;\n\nif ($needval==10)\n  echo 15;\nelseif ((0<$needval)&&($needval<12))\n  echo 4;\nelse\n  echo 0;   \n\n?>\n"}, {"source_code": "<?\n$n=trim(fgets(STDIN));\nif($n>0 && $n<=10) echo \"0\";\nif($n>=11 && $n<=19) echo \"4\";\nif($n==20) echo \"15\";\nif($n==21) echo \"4\";\nif($n>=22 && $n<=25) echo \"0\";\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = array(\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"10\", \"10\", \"10\", \"10\", \"11\");\n$d = 0;\nif($a <= 10)\n{\n    print \"0\";\n}\nelse\n{\n    $c = $a - 10;\n    for($x = 0; $x < 11; $x++)\n    {\n        if($c == $b[$x])\n        {\n            $d++;\n        }\n        else\n        {\n            $d++;\n        }\n    }\n    if($d < 1)\n    {\n        print \"0\";\n    }\n    elseif($d == 1)\n    {\n        print \"4\";\n    }\n    elseif($d > 1)\n    {\n        print \"15\";\n    }\n}\n?>"}, {"source_code": "<?\n//fscanf(STDIN,\"%d \", $n);\n$n=trim(fgets(STDIN));\nif ($n>0 && $n<=10) echo\"0\";\nif ($n>=11 && $n>=19) echo \"4\";\nif ($n==20 ) echo \"15\";\nif ($n==21) echo \"4\";\nif ($n>=22 && $n<=25) echo \"0\"; \n?>\n\n"}, {"source_code": "<?\n//fscanf(STDIN,\"%d \", $n);\n$n=trim( fgets(STDIN));\nif ($n>0 && $n<=10) echo\"0\";\nif (n>=11 && $n>=19) echo \"4\";\nif (n==20 ) echo \"15\";\nif ($n==21) echo \"4\";\nif ($n>=22 && $n<=24) echo \"0\"; \n?>\n"}, {"source_code": "<?php \nfscanf(STDIN,\"%d \", $n);\n//$n=trim( fgets(STDIN));\nif ($n>0 && $n<=10) echo\"0\";\nif (n>=11 && n>=19) echo \"4\";\nif (n==20 ) echo \"15\";\nif ($n==21) echo \"4\";\nif ($n>=22 && $n<=24) echo \"0\"; \n?>\n"}, {"source_code": "<?\nfscanf(STDIN,\"%d \", $n);\n//$n=trim( fgets(STDIN));\nif ($n>0 && $n<=10) echo\"0\";\nif (n>=11 && $n>=19) echo \"4\";\nif (n==20 ) echo \"15\";\nif ($n==21) echo \"4\";\nif ($n>=22 && $n<=24) echo \"0\"; \n?>\n"}, {"source_code": "<?\n//fscanf(STDIN,\"%d \", $n);\n$n=trim( fgets(STDIN));\nif ($n>0 && $n<=10) echo\"0\";\nif ($n>=11 && $n>=19) echo \"4\";\nif ($n==20 ) echo \"15\";\nif ($n==21) echo \"4\";\nif ($n>=22 && $n<=24) echo \"0\"; \n?>\n"}, {"source_code": "<?php \n$IN = STDIN;\nfscanf($IN, \"%d\", $n);\n$needval = $n-10;\n\nif ($needval==10)\n  echo 15;\nelseif ((0<$needval)&&($needval<22))\n  echo 4;\nelse\n  echo 0;   \n\n?>\n"}], "src_uid": "5802f52caff6015f21b80872274ab16c"}
{"nl": {"description": "There are three doors in front of you, numbered from $$$1$$$ to $$$3$$$ from left to right. Each door has a lock on it, which can only be opened with a key with the same number on it as the number on the door.There are three keys\u00a0\u2014 one for each door. Two of them are hidden behind the doors, so that there is no more than one key behind each door. So two doors have one key behind them, one door doesn't have a key behind it. To obtain a key hidden behind a door, you should first unlock that door. The remaining key is in your hands.Can you open all the doors?", "input_spec": "The first line contains a single integer $$$t$$$ ($$$1 \\le t \\le 18$$$)\u00a0\u2014 the number of testcases. The first line of each testcase contains a single integer $$$x$$$ ($$$1 \\le x \\le 3$$$)\u00a0\u2014 the number on the key in your hands. The second line contains three integers $$$a, b$$$ and $$$c$$$ ($$$0 \\le a, b, c \\le 3$$$)\u00a0\u2014 the number on the key behind each of the doors. If there is no key behind the door, the number is equal to $$$0$$$. Values $$$1, 2$$$ and $$$3$$$ appear exactly once among $$$x, a, b$$$ and $$$c$$$.", "output_spec": "For each testcase, print \"YES\" if you can open all the doors. Otherwise, print \"NO\".", "sample_inputs": ["4\n\n3\n\n0 1 2\n\n1\n\n0 3 2\n\n2\n\n3 1 0\n\n2\n\n1 3 0"], "sample_outputs": ["YES\nNO\nYES\nNO"], "notes": null}, "positive_code": [{"source_code": "<?php\n\n$testCases = fgets(STDIN);\n\n$answers = [];\nfor ($i=0; $i < $testCases; $i++) {\n    $key = (int) fgets(STDIN);\n    $keysBehind = array_map('intval', explode(' ', fgets(STDIN)));\n\n    if (\n        $keysBehind[$key - 1] !== 0\n        && isset($keysBehind[$keysBehind[$key - 1] - 1])\n        && $keysBehind[$keysBehind[$key - 1] - 1] !== 0\n    ) {\n        $answers[] = 'YES';\n    } else {\n        $answers[] = 'NO';\n    }\n}\n\nforeach ($answers as $item) {\n    echo $item . PHP_EOL;\n}\n"}, {"source_code": "<?php\n\nfunction allDoorPossibleToOpen($input)\n{\n    $line = explode(\"\\n\", $input);\n    $testCase = $line[0];\n\n    for ($i = 1; $i <= $testCase; $i++) {\n        \n        $keyOnHand = $line[$i*2-1];\n        $keyBehindDoor = explode(\" \",$line[$i*2]);\n        for($openedDoor = 1; $openedDoor <= 3; $openedDoor++){\n            $keyOnHand = $keyBehindDoor[$keyOnHand-1];\n            if($keyOnHand == 0){\n                break;\n            }\n        }\n        if($openedDoor == 3){\n            echo \"YES\\n\";\n        }else{\n            echo \"NO\\n\";\n        }\n    }\n}\n\nallDoorPossibleToOpen(file_get_contents('php://stdin'));\n\t \t\t \t \t\t\t \t\t  \t\t\t \t  \t \t \t  \t\t"}, {"source_code": "<?php\r\n$mod = 1000000007;\r\n$intMaxValue = 2147483646; //2147483647\r\n \r\n$loop = true;\r\n$t = $loop ? IO::get() : 1;\r\nwhile($t--) {\r\n    solve();\r\n}\r\n//101\r\n//101\r\n//001\r\nfunction solve()\r\n{\r\n     $x = IO::get();\r\n    $a = IO::getArray();\r\n    \r\n $ans = 'YES';\r\n \r\n if($a[$x-1] != 0) {\r\n      $x = $a[$x-1];\r\n      if($a[$x-1] != 0) {\r\n           $x = $a[$x-1];\r\n      } else {\r\n           $ans = 'NO';\r\n      }\r\n \r\n } else {\r\n      $ans = 'NO';\r\n }\r\n \r\n     \r\n   IO::pr($ans);\r\n \r\n}\r\n \r\n \r\nclass IO {\r\n    public static function get()\r\n    {\r\n        return trim(fgets(STDIN));\r\n    }\r\n \r\n    public static function getArray()\r\n    {\r\n        return explode(' ', trim(fgets(STDIN)));\r\n    }\r\n    public static function pr($s)\r\n    {\r\n        echo $s, PHP_EOL;\r\n    }\r\n    public static function prArray($s)\r\n    {\r\n        echo implode( ' ', $s), PHP_EOL;\r\n    }\r\n    public static function getMinValue($x, $y) {\r\n        return $x > $y ? $y : $x;\r\n    }\r\n    public static function getMaxValue($x, $y) {\r\n        return $x > $y ? $x : $y;\r\n    }\r\n}"}], "negative_code": [], "src_uid": "5cd113a30bbbb93d8620a483d4da0349"}
{"nl": {"description": "Jabber ID on the national Berland service \u00abBabber\u00bb has a form &lt;username&gt;@&lt;hostname&gt;[/resource], where   &lt;username&gt; \u2014 is a sequence of Latin letters (lowercase or uppercase), digits or underscores characters \u00ab_\u00bb, the length of &lt;username&gt; is between 1 and 16, inclusive.  &lt;hostname&gt; \u2014 is a sequence of word separated by periods (characters \u00ab.\u00bb), where each word should contain only characters allowed for &lt;username&gt;, the length of each word is between 1 and 16, inclusive. The length of &lt;hostname&gt; is between 1 and 32, inclusive.  &lt;resource&gt; \u2014 is a sequence of Latin letters (lowercase or uppercase), digits or underscores characters \u00ab_\u00bb, the length of &lt;resource&gt; is between 1 and 16, inclusive. The content of square brackets is optional \u2014 it can be present or can be absent.There are the samples of correct Jabber IDs: mike@codeforces.com, 007@en.codeforces.com/contest.Your task is to write program which checks if given string is a correct Jabber ID.", "input_spec": "The input contains of a single line. The line has the length between 1 and 100 characters, inclusive. Each characters has ASCII-code between 33 and 127, inclusive.", "output_spec": "Print YES or NO.", "sample_inputs": ["mike@codeforces.com", "john.smith@codeforces.ru/contest.icpc/12"], "sample_outputs": ["YES", "NO"], "notes": null}, "positive_code": [{"source_code": "<?php\n//  21A - Jabber ID \n$a = trim(fgets(STDIN));\n$b = str_split($a);\narray_unshift($b, \" \");\nunset($b[0]);\n$k = $b;\n$c = array_search(\"@\", $b);\nif($c == 0)\n{\n    print \"NO\";\n}\nelseif($c == 1)\n{\n    print \"NO\";\n}\nelse\n{\n    $d = array_slice($b, 0, $c - 1);\n    $e = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\");\n    $e2 = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\", \".\");\n    $f = 1;\n    $f2 = 1;\n    $f3 = 1;\n    for($x = 0; $x < count($d); $x++)\n    {\n        if($f == 0)\n        {\n            break;\n        }\n        else\n        {\n            $f = 0;\n            for($y = 0; $y < count($e); $y++)\n            {\n                if($d[$x] == $e[$y])\n                {\n                    $f = 1;\n                    break;\n                }\n            }\n        }\n    }\n    if(($f == 0) || (count($d) > 16))\n    {\n        print \"NO\";\n    }\n    else\n    {\n        array_splice($b, 0, $c);\n        if(count($b) == 0)\n        {\n            print \"NO\";\n        }\n        else\n        {\n            array_unshift($b, \" \");\n            unset($b[0]);\n            $g = array_search(\"/\", $b);\n            if($g == 0) ////////// \u0435\u0441\u043b\u0438 \u043d\u0435\u0442 \u0441\u043b\u0435\u0448\u0430 //////////\n            {\n                if((count($b) < 1) && (count($b) > 32))\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($f2 == 0)\n                        {\n                            break;\n                        }\n                        else\n                        {\n                            $f2 = 0;\n                            for($y = 0; $y < count($e2); $y++)\n                            {\n                                if($b[$x] == $e2[$y])\n                                {\n                                    $f2 = 1;\n                                    break;\n                                }\n                            }\n                        }\n                    }\n                    if($f2 == 0)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        if(($b[count($b)] == \".\") || ($b[1] == \".\"))\n                        {\n                            print \"NO\";\n                        }\n                        else\n                        {\n                            array_push($b, \".\");\n                            $j = 0;\n                            for($x = 1; $x <= count($b); $x++)\n                            {\n                                if(($b[$x] == \".\") && ($b[$x + 1] == \".\"))\n                                {\n                                    $j = 1;\n                                }\n                                elseif($b[$x] == \".\")\n                                {\n                                    $h = array_slice($b, 0, $x - 1);\n                                    array_splice($b, 0, $x);\n                                    $x = 0;\n                                    array_unshift($b, \" \");\n                                    unset($b[0]);\n                                    if((count($h) < 1) && (count($h) > 16))\n                                    {\n                                        $j = 1;\n                                    }\n                                }\n                            }\n                            if($j == 1)\n                            {\n                                print \"NO\";\n                            }\n                            else\n                            {\n                                print \"YES\";\n                            }\n                        }\n                    }\n                }\n            }\n            else ////////// \u0435\u0441\u043b\u0438 \u0441\u043b\u0435\u0448 \u0435\u0441\u0442\u044c //////////\n            {\n                array_splice($b, $g - 1);\n                array_unshift($b, \" \");\n                unset($b[0]);\n                if((count($b) < 1) && (count($b) > 32))\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($f2 == 0)\n                        {\n                            break;\n                        }\n                        else\n                        {\n                            $f2 = 0;\n                            for($y = 0; $y < count($e2); $y++)\n                            {\n                                if($b[$x] == $e2[$y])\n                                {\n                                    $f2 = 1;\n                                    break;\n                                }\n                            }\n                        }\n                    }\n                    if($f2 == 0)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        if(($b[count($b)] == \".\") || ($b[1] == \".\"))\n                        {\n                            print \"NO\";\n                        }\n                        else\n                        {\n                            array_push($b, \".\");\n                            $j = 0;\n                            for($x = 1; $x <= count($b); $x++)\n                            {\n                                if(($b[$x] == \".\") && ($b[$x + 1] == \".\"))\n                                {\n                                    $j = 1;\n                                }\n                                elseif($b[$x] == \".\")\n                                {\n                                    $h = array_slice($b, 0, $x - 1);\n                                    array_splice($b, 0, $x);\n                                    $x = 0;\n                                    array_unshift($b, \" \");\n                                    unset($b[0]);\n                                    if((count($h) < 1) && (count($h) > 16))\n                                    {\n                                        $j = 1;\n                                    }\n                                }\n                            }\n                            if($j == 1)\n                            {\n                                print \"NO\";\n                            }\n                            else\n                            {\n                                $b = array_slice($b, 0, $g - 1);\n                                array_unshift($b, \" \");\n                                unset($b[0]);\n                                $m = array_search(\"/\", $k);\n                                $l = array_slice($k, $m);\n                                for($x = 0; $x < count($l); $x++)\n                                {\n                                    if($f3 == 0)\n                                    {\n                                        break;\n                                    }\n                                    else\n                                    {\n                                        $f3 = 0;\n                                        for($y = 0; $y < count($e); $y++)\n                                        {\n                                            if($l[$x] == $e[$y])\n                                            {\n                                                $f3 = 1;\n                                                break;\n                                            }\n                                        }\n                                    }\n                                }\n                                if(($f3 == 0) || (count($l) > 16) || (count($l) == 0))\n                                {\n                                    print \"NO\";\n                                }\n                                else\n                                {            \n                                    print \"YES\";\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\n\nfunction debug($data, $die = true) {\n    echo '<pre>';\n\n    if (is_array($data)) {\n        print_r($data);\n    } else {\n        var_dump($data);\n    }\n\n    if ($die) {\n        die();\n    }\n\n    echo '</pre>';\n}\n\nfunction stdin() {\n    $stdin = @fopen('data.txt', 'r');\n    if (!$stdin) {\n        $stdin = fopen('php://stdin', 'r');\n    }\n\n    return $stdin;\n}\n\nfunction g() {\n    global $stdin;\n    return trim(fgets($stdin));\n}\n\n$stdin = stdin();\n/****************************************************** Solving block *****************************************************/\n$id = g();\n\n$word = \"[a-z0-9_]{1,16}\";\n$correct = preg_match(\"/^$word@(($word\\.)*$word)(\\/$word)?$/i\", $id, $matches);\n$correct = $correct && strlen($matches[1]) && strlen($matches[1]) < 33;\n\necho $correct ? 'YES' : 'NO';\n\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\narray_unshift($b, \" \");\nunset($b[0]);\n$k = $b;\n$c = array_search(\"@\", $b);\nif($c == 0)\n{\n    print \"NO\";\n}\nelseif($c == 1)\n{\n    print \"NO\";\n}\nelse\n{\n    $d = array_slice($b, 0, $c - 1);\n    $e = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\");\n    $e2 = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\", \".\");\n    $f = 1;\n    $f2 = 1;\n    $f3 = 1;\n    for($x = 0; $x < count($d); $x++)\n    {\n        if($f == 0)\n        {\n            break;\n        }\n        else\n        {\n            $f = 0;\n            for($y = 0; $y < count($e); $y++)\n            {\n                if($d[$x] == $e[$y])\n                {\n                    $f = 1;\n                    break;\n                }\n            }\n        }\n    }\n    if(($f == 0) || (count($d) > 16))\n    {\n        print \"NO\";\n    }\n    else\n    {\n        array_splice($b, 0, $c);\n        if(count($b) == 0)\n        {\n            print \"NO\";\n        }\n        else\n        {\n            array_unshift($b, \" \");\n            unset($b[0]);\n            $g = array_search(\"/\", $b);\n            if($g == 0)\n            {\n                if((count($b) < 1) && (count($b) > 32))\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($f2 == 0)\n                        {\n                            break;\n                        }\n                        else\n                        {\n                            $f2 = 0;\n                            for($y = 0; $y < count($e2); $y++)\n                            {\n                                if($b[$x] == $e2[$y])\n                                {\n                                    $f2 = 1;\n                                    break;\n                                }\n                            }\n                        }\n                    }\n                    if($f2 == 0)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        array_push($b, \".\");\n                        $j = 0;\n                        for($x = 1; $x <= count($b); $x++)\n                        {\n                            if($b[$x] == \".\")\n                            {\n                                $h = array_slice($b, 0, $x - 1);\n                                array_splice($b, 0, $x);\n                                $x = 0;\n                                array_unshift($b, \" \");\n                                unset($b[0]);\n                                if((count($h) < 1) && (count($h) > 16))\n                                {\n                                    $j = 1;\n                                }\n                            }\n                        }\n                        if($j == 1)\n                        {\n                            print \"NO\";\n                        }\n                        else\n                        {\n                            print \"YES\";\n                        }\n                    }\n                }\n            }\n            else\n            {\n                if((count($b) < 1) && (count($b) > 32))\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($f2 == 0)\n                        {\n                            break;\n                        }\n                        else\n                        {\n                            $f2 = 0;\n                            for($y = 0; $y < count($e2); $y++)\n                            {\n                                if($b[$x] == $e2[$y])\n                                {\n                                    $f2 = 1;\n                                    break;\n                                }\n                            }\n                        }\n                    }\n                    if($f2 == 0)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        array_push($b, \".\");\n                        $j = 0;\n                        for($x = 1; $x <= count($b); $x++)\n                        {\n                            if($b[$x] == \".\")\n                            {\n                                $h = array_slice($b, 0, $x - 1);\n                                array_splice($b, 0, $x);\n                                $x = 0;\n                                array_unshift($b, \" \");\n                                unset($b[0]);\n                                if((count($h) < 1) && (count($h) > 16))\n                                {\n                                    $j = 1;\n                                }\n                            }\n                        }\n                        if($j == 1)\n                        {\n                            print \"NO\";\n                        }\n                        else\n                        {\n                            $b = array_slice($b, 0, $g - 1);\n                            array_unshift($b, \" \");\n                            unset($b[0]);\n                            $m = array_search(\"/\", $k);\n                            $l = array_slice($k, $m);\n                            for($x = 0; $x < count($l); $x++)\n                            {\n                                if($f3 == 0)\n                                {\n                                    break;\n                                }\n                                else\n                                {\n                                    $f3 = 0;\n                                    for($y = 0; $y < count($e); $y++)\n                                    {\n                                        if($l[$x] == $e[$y])\n                                        {\n                                            $f3 = 1;\n                                            break;\n                                        }\n                                    }\n                                }\n                            }\n                            if(($f3 == 0) || (count($l) > 16))\n                            {\n                                print \"NO\";\n                            }\n                            else\n                            {            \n                                print \"YES\";\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\n//  21A - Jabber ID \n$a = trim(fgets(STDIN));\n$b = str_split($a);\narray_unshift($b, \" \");\nunset($b[0]);\n$k = $b;\n$c = array_search(\"@\", $b);\nif($c == 0)\n{\n    print \"NO\";\n}\nelseif($c == 1)\n{\n    print \"NO\";\n}\nelse\n{\n    $d = array_slice($b, 0, $c - 1);\n    $e = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\");\n    $e2 = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\", \".\");\n    $f = 1;\n    $f2 = 1;\n    $f3 = 1;\n    for($x = 0; $x < count($d); $x++)\n    {\n        if($f == 0)\n        {\n            break;\n        }\n        else\n        {\n            $f = 0;\n            for($y = 0; $y < count($e); $y++)\n            {\n                if($d[$x] == $e[$y])\n                {\n                    $f = 1;\n                    break;\n                }\n            }\n        }\n    }\n    if(($f == 0) || (count($d) > 16))\n    {\n        print \"NO\";\n    }\n    else\n    {\n        array_splice($b, 0, $c);\n        if(count($b) == 0)\n        {\n            print \"NO\";\n        }\n        else\n        {\n            array_unshift($b, \" \");\n            unset($b[0]);\n            $g = array_search(\"/\", $b);\n            if($g == 0) ////////// \u0435\u0441\u043b\u0438 \u043d\u0435\u0442 \u0441\u043b\u0435\u0448\u0430 //////////\n            {\n                if((count($b) < 1) && (count($b) > 32))\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($f2 == 0)\n                        {\n                            break;\n                        }\n                        else\n                        {\n                            $f2 = 0;\n                            for($y = 0; $y < count($e2); $y++)\n                            {\n                                if($b[$x] == $e2[$y])\n                                {\n                                    $f2 = 1;\n                                    break;\n                                }\n                            }\n                        }\n                    }\n                    if($f2 == 0)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        if(($b[count($b)] == \".\") || ($b[1] == \".\"))\n                        {\n                            print \"NO\";\n                        }\n                        else\n                        {\n                            array_push($b, \".\");\n                            $j = 0;\n                            for($x = 1; $x <= count($b); $x++)\n                            {\n                                if(($b[$x] == \".\") && ($b[$x + 1] == \".\"))\n                                {\n                                    $j = 1;\n                                }\n                                elseif($b[$x] == \".\")\n                                {\n                                    $h = array_slice($b, 0, $x - 1);\n                                    array_splice($b, 0, $x);\n                                    $x = 0;\n                                    array_unshift($b, \" \");\n                                    unset($b[0]);\n                                    if((count($h) < 1) && (count($h) > 16))\n                                    {\n                                        $j = 1;\n                                    }\n                                }\n                            }\n                            if($j == 1)\n                            {\n                                print \"NO\";\n                            }\n                            else\n                            {\n                                print \"YES\";\n                            }\n                        }\n                    }\n                }\n            }\n            else ////////// \u0435\u0441\u043b\u0438 \u0441\u043b\u0435\u0448 \u0435\u0441\u0442\u044c //////////\n            {\n                array_splice($b, $g - 1);\n                array_unshift($b, \" \");\n                unset($b[0]);\n                if((count($b) < 1) && (count($b) > 32))\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($f2 == 0)\n                        {\n                            break;\n                        }\n                        else\n                        {\n                            $f2 = 0;\n                            for($y = 0; $y < count($e2); $y++)\n                            {\n                                if($b[$x] == $e2[$y])\n                                {\n                                    $f2 = 1;\n                                    break;\n                                }\n                            }\n                        }\n                    }\n                    if($f2 == 0)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        if(($b[count($b)] == \".\") || ($b[1] == \".\"))\n                        {\n                            print \"NO\";\n                        }\n                        else\n                        {\n                            array_push($b, \".\");\n                            $j = 0;\n                            for($x = 1; $x <= count($b); $x++)\n                            {\n                                if(($b[$x] == \".\") && ($b[$x + 1] == \".\"))\n                                {\n                                    $j = 1;\n                                }\n                                elseif($b[$x] == \".\")\n                                {\n                                    $h = array_slice($b, 0, $x - 1);\n                                    array_splice($b, 0, $x);\n                                    $x = 0;\n                                    array_unshift($b, \" \");\n                                    unset($b[0]);\n                                    if((count($h) < 1) && (count($h) > 16))\n                                    {\n                                        $j = 1;\n                                    }\n                                }\n                            }\n                            if($j == 1)\n                            {\n                                print \"NO\";\n                            }\n                            else\n                            {\n                                $b = array_slice($b, 0, $g - 1);\n                                array_unshift($b, \" \");\n                                unset($b[0]);\n                                $m = array_search(\"/\", $k);\n                                $l = array_slice($k, $m);\n                                for($x = 0; $x < count($l); $x++)\n                                {\n                                    if($f3 == 0)\n                                    {\n                                        break;\n                                    }\n                                    else\n                                    {\n                                        $f3 = 0;\n                                        for($y = 0; $y < count($e); $y++)\n                                        {\n                                            if($l[$x] == $e[$y])\n                                            {\n                                                $f3 = 1;\n                                                break;\n                                            }\n                                        }\n                                    }\n                                }\n                                if(($f3 == 0) || (count($l) > 16))\n                                {\n                                    print \"NO\";\n                                }\n                                else\n                                {            \n                                    print \"YES\";\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\n//  21A - Jabber ID \n$a = trim(fgets(STDIN));\n$b = str_split($a);\narray_unshift($b, \" \");\nunset($b[0]);\n$k = $b;\n$c = array_search(\"@\", $b);\nif($c == 0)\n{\n    print \"NO\";\n}\nelseif($c == 1)\n{\n    print \"NO\";\n}\nelse\n{\n    $d = array_slice($b, 0, $c - 1);\n    $e = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\");\n    $e2 = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\", \".\");\n    $f = 1;\n    $f2 = 1;\n    $f3 = 1;\n    for($x = 0; $x < count($d); $x++)\n    {\n        if($f == 0)\n        {\n            break;\n        }\n        else\n        {\n            $f = 0;\n            for($y = 0; $y < count($e); $y++)\n            {\n                if($d[$x] == $e[$y])\n                {\n                    $f = 1;\n                    break;\n                }\n            }\n        }\n    }\n    if(($f == 0) || (count($d) > 16))\n    {\n        print \"NO\";\n    }\n    else\n    {\n        array_splice($b, 0, $c);\n        if(count($b) == 0)\n        {\n            print \"NO\";\n        }\n        else\n        {\n            array_unshift($b, \" \");\n            unset($b[0]);\n            $g = array_search(\"/\", $b);\n            if($g == 0) ////////// \u0435\u0441\u043b\u0438 \u043d\u0435\u0442 \u0441\u043b\u0435\u0448\u0430 //////////\n            {\n                if((count($b) < 1) && (count($b) > 32))\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($f2 == 0)\n                        {\n                            break;\n                        }\n                        else\n                        {\n                            $f2 = 0;\n                            for($y = 0; $y < count($e2); $y++)\n                            {\n                                if($b[$x] == $e2[$y])\n                                {\n                                    $f2 = 1;\n                                    break;\n                                }\n                            }\n                        }\n                    }\n                    if($f2 == 0)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        if($b[count($b)] == \".\")\n                        {\n                            print \"NO\";\n                        }\n                        else\n                        {\n                            array_push($b, \".\");\n                            $j = 0;\n                            for($x = 1; $x <= count($b); $x++)\n                            {\n                                if(($b[$x] == \".\") && ($b[$x + 1] == \".\"))\n                                {\n                                    $j = 1;\n                                }\n                                elseif($b[$x] == \".\")\n                                {\n                                    $h = array_slice($b, 0, $x - 1);\n                                    array_splice($b, 0, $x);\n                                    $x = 0;\n                                    array_unshift($b, \" \");\n                                    unset($b[0]);\n                                    if((count($h) < 1) && (count($h) > 16))\n                                    {\n                                        $j = 1;\n                                    }\n                                }\n                            }\n                            if($j == 1)\n                            {\n                                print \"NO\";\n                            }\n                            else\n                            {\n                                print \"YES\";\n                            }\n                        }\n                    }\n                }\n            }\n            else ////////// \u0435\u0441\u043b\u0438 \u0441\u043b\u0435\u0448 \u0435\u0441\u0442\u044c //////////\n            {\n                array_splice($b, $g - 1);\n                array_unshift($b, \" \");\n                unset($b[0]);\n                if((count($b) < 1) && (count($b) > 32))\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($f2 == 0)\n                        {\n                            break;\n                        }\n                        else\n                        {\n                            $f2 = 0;\n                            for($y = 0; $y < count($e2); $y++)\n                            {\n                                if($b[$x] == $e2[$y])\n                                {\n                                    $f2 = 1;\n                                    break;\n                                }\n                            }\n                        }\n                    }\n                    if($f2 == 0)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        if($b[count($b)] == \".\")\n                        {\n                            print \"NO\";\n                        }\n                        else\n                        {\n                            array_push($b, \".\");\n                            $j = 0;\n                            for($x = 1; $x <= count($b); $x++)\n                            {\n                                if(($b[$x] == \".\") && ($b[$x + 1] == \".\"))\n                                {\n                                    $j = 1;\n                                }\n                                elseif($b[$x] == \".\")\n                                {\n                                    $h = array_slice($b, 0, $x - 1);\n                                    array_splice($b, 0, $x);\n                                    $x = 0;\n                                    array_unshift($b, \" \");\n                                    unset($b[0]);\n                                    if((count($h) < 1) && (count($h) > 16))\n                                    {\n                                        $j = 1;\n                                    }\n                                }\n                            }\n                            if($j == 1)\n                            {\n                                print \"NO\";\n                            }\n                            else\n                            {\n                                $b = array_slice($b, 0, $g - 1);\n                                array_unshift($b, \" \");\n                                unset($b[0]);\n                                $m = array_search(\"/\", $k);\n                                $l = array_slice($k, $m);\n                                for($x = 0; $x < count($l); $x++)\n                                {\n                                    if($f3 == 0)\n                                    {\n                                        break;\n                                    }\n                                    else\n                                    {\n                                        $f3 = 0;\n                                        for($y = 0; $y < count($e); $y++)\n                                        {\n                                            if($l[$x] == $e[$y])\n                                            {\n                                                $f3 = 1;\n                                                break;\n                                            }\n                                        }\n                                    }\n                                }\n                                if(($f3 == 0) || (count($l) > 16))\n                                {\n                                    print \"NO\";\n                                }\n                                else\n                                {            \n                                    print \"YES\";\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\narray_unshift($b, \" \");\nunset($b[0]);\n$k = $b;\n$c = array_search(\"@\", $b);\nif($c == 0)\n{\n    print \"NO\";\n}\nelseif($c == 1)\n{\n    print \"NO\";\n}\nelse\n{\n    $d = array_slice($b, 0, $c - 1);\n    $e = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\");\n    $e2 = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\", \".\");\n    $f = 1;\n    $f2 = 1;\n    $f3 = 1;\n    for($x = 0; $x < count($d); $x++)\n    {\n        if($f == 0)\n        {\n            break;\n        }\n        else\n        {\n            $f = 0;\n            for($y = 0; $y < count($e); $y++)\n            {\n                if($d[$x] == $e[$y])\n                {\n                    $f = 1;\n                    break;\n                }\n            }\n        }\n    }\n    if(($f == 0) || (count($d) > 16))\n    {\n        print \"NO\";\n    }\n    else\n    {\n        array_splice($b, 0, $c);\n        if(count($b) == 0)\n        {\n            print \"NO\";\n        }\n        else\n        {\n            array_unshift($b, \" \");\n            unset($b[0]);\n            $g = array_search(\"/\", $b);\n            if($g == 0)\n            {\n                if((count($b) < 1) && (count($b) > 32))\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($f2 == 0)\n                        {\n                            break;\n                        }\n                        else\n                        {\n                            $f2 = 0;\n                            for($y = 0; $y < count($e2); $y++)\n                            {\n                                if($b[$x] == $e2[$y])\n                                {\n                                    $f2 = 1;\n                                    break;\n                                }\n                            }\n                        }\n                    }\n                    if($f2 == 0)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        if($b[count($b)] == \".\")\n                        {\n                            print \"NO\";\n                        }\n                        else\n                        {\n                            array_push($b, \".\");\n                            $j = 0;\n                            for($x = 1; $x <= count($b); $x++)\n                            {\n                                if($b[$x] == \".\")\n                                {\n                                    $h = array_slice($b, 0, $x - 1);\n                                    array_splice($b, 0, $x);\n                                    $x = 0;\n                                    array_unshift($b, \" \");\n                                    unset($b[0]);\n                                    if((count($h) < 1) && (count($h) > 16))\n                                    {\n                                        $j = 1;\n                                    }\n                                }\n                            }\n                            if($j == 1)\n                            {\n                                print \"NO\";\n                            }\n                            else\n                            {\n                                print \"YES\";\n                            }\n                        }\n                    }\n                }\n            }\n            else\n            {\n                array_splice($b, $g - 1);\n                array_unshift($b, \" \");\n                unset($b[0]);\n                if((count($b) < 1) && (count($b) > 32))\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($f2 == 0)\n                        {\n                            break;\n                        }\n                        else\n                        {\n                            $f2 = 0;\n                            for($y = 0; $y < count($e2); $y++)\n                            {\n                                if($b[$x] == $e2[$y])\n                                {\n                                    $f2 = 1;\n                                    break;\n                                }\n                            }\n                        }\n                    }\n                    if($f2 == 0)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        if($b[count($b)] == \".\")\n                        {\n                            print \"NO\";\n                        }\n                        else\n                        {\n                            array_push($b, \".\");\n                            $j = 0;\n                            for($x = 1; $x <= count($b); $x++)\n                            {\n                                if($b[$x] == \".\")\n                                {\n                                    $h = array_slice($b, 0, $x - 1);\n                                    array_splice($b, 0, $x);\n                                    $x = 0;\n                                    array_unshift($b, \" \");\n                                    unset($b[0]);\n                                    if((count($h) < 1) && (count($h) > 16))\n                                    {\n                                        $j = 1;\n                                    }\n                                }\n                            }\n                            if($j == 1)\n                            {\n                                print \"NO\";\n                            }\n                            else\n                            {\n                                $b = array_slice($b, 0, $g - 1);\n                                array_unshift($b, \" \");\n                                unset($b[0]);\n                                $m = array_search(\"/\", $k);\n                                $l = array_slice($k, $m);\n                                for($x = 0; $x < count($l); $x++)\n                                {\n                                    if($f3 == 0)\n                                    {\n                                        break;\n                                    }\n                                    else\n                                    {\n                                        $f3 = 0;\n                                        for($y = 0; $y < count($e); $y++)\n                                        {\n                                            if($l[$x] == $e[$y])\n                                            {\n                                                $f3 = 1;\n                                                break;\n                                            }\n                                        }\n                                    }\n                                }\n                                if(($f3 == 0) || (count($l) > 16))\n                                {\n                                    print \"NO\";\n                                }\n                                else\n                                {            \n                                    print \"YES\";\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\narray_unshift($b, \" \");\nunset($b[0]);\n$k = $b;\n$c = array_search(\"@\", $b);\nif($c == 0)\n{\n    print \"NO\";\n}\nelseif($c == 1)\n{\n    print \"NO\";\n}\nelse\n{\n    $d = array_slice($b, 0, $c - 1);\n    $e = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\");\n    $e2 = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\", \".\");\n    $f = 1;\n    $f2 = 1;\n    $f3 = 1;\n    for($x = 0; $x < count($d); $x++)\n    {\n        if($f == 0)\n        {\n            break;\n        }\n        else\n        {\n            $f = 0;\n            for($y = 0; $y < count($e); $y++)\n            {\n                if($d[$x] == $e[$y])\n                {\n                    $f = 1;\n                    break;\n                }\n            }\n        }\n    }\n    if(($f == 0) || (count($d) > 16))\n    {\n        print \"NO\";\n    }\n    else\n    {\n        array_splice($b, 0, $c);\n        if(count($b) == 0)\n        {\n            print \"NO\";\n        }\n        else\n        {\n            array_unshift($b, \" \");\n            unset($b[0]);\n            $g = array_search(\"/\", $b);\n            if($g == 0)\n            {\n                if((count($b) < 1) && (count($b) > 32))\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($f2 == 0)\n                        {\n                            break;\n                        }\n                        else\n                        {\n                            $f2 = 0;\n                            for($y = 0; $y < count($e2); $y++)\n                            {\n                                if($b[$x] == $e2[$y])\n                                {\n                                    $f2 = 1;\n                                    break;\n                                }\n                            }\n                        }\n                    }\n                    if($f2 == 0)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        array_push($b, \".\");\n                        $j = 0;\n                        for($x = 1; $x <= count($b); $x++)\n                        {\n                            if($b[$x] == \".\")\n                            {\n                                $h = array_slice($b, 0, $x - 1);\n                                array_splice($b, 0, $x);\n                                $x = 0;\n                                array_unshift($b, \" \");\n                                unset($b[0]);\n                                if((count($h) < 1) && (count($h) > 16))\n                                {\n                                    $j = 1;\n                                }\n                            }\n                        }\n                        if($j == 1)\n                        {\n                            print \"NO\";\n                        }\n                        else\n                        {\n                            print \"YES\";\n                        }\n                    }\n                }\n            }\n            else\n            {\n                array_splice($b, $g - 1);\n                array_unshift($b, \" \");\n                unset($b[0]);\n                if((count($b) < 1) && (count($b) > 32))\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($f2 == 0)\n                        {\n                            break;\n                        }\n                        else\n                        {\n                            $f2 = 0;\n                            for($y = 0; $y < count($e2); $y++)\n                            {\n                                if($b[$x] == $e2[$y])\n                                {\n                                    $f2 = 1;\n                                    break;\n                                }\n                            }\n                        }\n                    }\n                    if($f2 == 0)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        array_push($b, \".\");\n                        $j = 0;\n                        for($x = 1; $x <= count($b); $x++)\n                        {\n                            if($b[$x] == \".\")\n                            {\n                                $h = array_slice($b, 0, $x - 1);\n                                array_splice($b, 0, $x);\n                                $x = 0;\n                                array_unshift($b, \" \");\n                                unset($b[0]);\n                                if((count($h) < 1) && (count($h) > 16))\n                                {\n                                    $j = 1;\n                                }\n                            }\n                        }\n                        if($j == 1)\n                        {\n                            print \"NO\";\n                        }\n                        else\n                        {\n                            $b = array_slice($b, 0, $g - 1);\n                            array_unshift($b, \" \");\n                            unset($b[0]);\n                            $m = array_search(\"/\", $k);\n                            $l = array_slice($k, $m);\n                            for($x = 0; $x < count($l); $x++)\n                            {\n                                if($f3 == 0)\n                                {\n                                    break;\n                                }\n                                else\n                                {\n                                    $f3 = 0;\n                                    for($y = 0; $y < count($e); $y++)\n                                    {\n                                        if($l[$x] == $e[$y])\n                                        {\n                                            $f3 = 1;\n                                            break;\n                                        }\n                                    }\n                                }\n                            }\n                            if(($f3 == 0) || (count($l) > 16))\n                            {\n                                print \"NO\";\n                            }\n                            else\n                            {            \n                                print \"YES\";\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\narray_unshift($b, \" \");\nunset($b[0]);\n$k = $b;\n$c = array_search(\"@\", $b);\nif($c == 0)\n{\n    print \"NO\";\n}\nelseif($c == 1)\n{\n    print \"NO\";\n}\nelse\n{\n    $d = array_slice($b, 0, $c - 1);\n    $e = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\");\n    $e2 = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\", \".\");\n    $f = 1;\n    $f2 = 1;\n    $f3 = 1;\n    for($x = 0; $x < count($d); $x++)\n    {\n        if($f == 0)\n        {\n            break;\n        }\n        else\n        {\n            $f = 0;\n            for($y = 0; $y < count($e); $y++)\n            {\n                if($d[$x] == $e[$y])\n                {\n                    $f = 1;\n                    break;\n                }\n            }\n        }\n    }\n    if(($f == 0) || (count($d) > 16))\n    {\n        print \"NO\";\n    }\n    else\n    {\n        array_splice($b, 0, $c);\n        if(count($b) == 0)\n        {\n            print \"NO\";\n        }\n        else\n        {\n            array_unshift($b, \" \");\n            unset($b[0]);\n            $g = array_search(\"/\", $b);\n            if($g == 0)\n            {\n                if((count($b) < 1) && (count($b) > 32))\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($f2 == 0)\n                        {\n                            break;\n                        }\n                        else\n                        {\n                            $f2 = 0;\n                            for($y = 0; $y < count($e2); $y++)\n                            {\n                                if($b[$x] == $e2[$y])\n                                {\n                                    $f2 = 1;\n                                    break;\n                                }\n                            }\n                        }\n                    }\n                    if($f2 == 0)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        array_push($b, \".\");\n                        $j = 0;\n                        for($x = 1; $x <= count($b); $x++)\n                        {\n                            if($b[$x] == \".\")\n                            {\n                                $h = array_slice($b, 0, $x - 1);\n                                array_splice($b, 0, $x);\n                                $x = 0;\n                                array_unshift($b, \" \");\n                                unset($b[0]);\n                                if((count($h) < 1) && (count($h) > 16))\n                                {\n                                    $j = 1;\n                                }\n                            }\n                        }\n                        if($j == 1)\n                        {\n                            print \"NO\";\n                        }\n                        else\n                        {\n                            print \"YES\";\n                        }\n                    }\n                }\n            }\n            else\n            {\n                $b = array_slice($b, 0, $g - 1);\n                array_unshift($b, \" \");\n                unset($b[0]);\n                $m = array_search(\"/\", $k);\n                $l = array_slice($k, $m);\n                for($x = 0; $x < count($l); $x++)\n                {\n                    if($f3 == 0)\n                    {\n                        break;\n                    }\n                    else\n                    {\n                        $f3 = 0;\n                        for($y = 0; $y < count($e); $y++)\n                        {\n                            if($l[$x] == $e[$y])\n                            {\n                                $f3 = 1;\n                                break;\n                            }\n                        }\n                    }\n                }\n                if(($f3 == 0) || (count($l) > 16))\n                {\n                    print \"NO\";\n                }\n                else\n                {            \n                    print \"YES\";\n                }\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\narray_unshift($b, \" \");\nunset($b[0]);\n$k = $b;\n$c = array_search(\"@\", $b);\nif($c == 0)\n{\n    print \"NO\";\n}\nelse\n{\n    $d = array_slice($b, 0, $c - 1);\n    $e = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\");\n    $e2 = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\", \".\");\n    $f = 1;\n    $f2 = 1;\n    $f3 = 1;\n    for($x = 0; $x < count($d); $x++)\n    {\n        if($f == 0)\n        {\n            break;\n        }\n        else\n        {\n            $f = 0;\n            for($y = 0; $y < count($e); $y++)\n            {\n                if($d[$x] == $e[$y])\n                {\n                    $f = 1;\n                    break;\n                }\n            }\n        }\n    }\n    if(($f == 0) || (count($d) > 16))\n    {\n        print \"NO\";\n    }\n    else\n    {\n        array_splice($b, 0, $c);\n        array_unshift($b, \" \");\n        unset($b[0]);\n        $g = array_search(\"/\", $b);\n        if($g == 0)\n        {\n            if((count($b) < 1) && (count($b) > 32))\n            {\n                print \"NO\";\n            }\n            else\n            {\n                for($x = 1; $x <= count($b); $x++)\n                {\n                    if($f2 == 0)\n                    {\n                        break;\n                    }\n                    else\n                    {\n                        $f2 = 0;\n                        for($y = 0; $y < count($e2); $y++)\n                        {\n                            if($b[$x] == $e2[$y])\n                            {\n                                $f2 = 1;\n                                break;\n                            }\n                        }\n                    }\n                }\n                if($f2 == 0)\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    array_push($b, \".\");\n                    $j = 0;\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($b[$x] == \".\")\n                        {\n                            $h = array_slice($b, 0, $x - 1);\n                            array_splice($b, 0, $x);\n                            $x = 0;\n                            array_unshift($b, \" \");\n                            unset($b[0]);\n                            if((count($h) < 1) && (count($h) > 16))\n                            {\n                                $j = 1;\n                            }\n                        }\n                    }\n                    if($j == 1)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        print \"YES\";\n                    }\n                }\n            }\n        }\n        else\n        {\n            $b = array_slice($b, 0, $g - 1);\n            array_unshift($b, \" \");\n            unset($b[0]);\n            $m = array_search(\"/\", $k);\n            $l = array_slice($k, $m);\n            for($x = 0; $x < count($l); $x++)\n            {\n                if($f3 == 0)\n                {\n                    break;\n                }\n                else\n                {\n                    $f3 = 0;\n                    for($y = 0; $y < count($e); $y++)\n                    {\n                        if($l[$x] == $e[$y])\n                        {\n                            $f3 = 1;\n                            break;\n                        }\n                    }\n                }\n            }\n            if(($f3 == 0) || (count($l) > 16))\n            {\n                print \"NO\";\n            }\n            else\n            {            \n                print \"YES\";\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\narray_unshift($b, \" \");\nunset($b[0]);\n$k = $b;\n$c = array_search(\"@\", $b);\nif($c == 0)\n{\n    print \"NO\";\n}\nelseif($c == 1)\n{\n    print \"NO\";\n}\nelse\n{\n    $d = array_slice($b, 0, $c - 1);\n    $e = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\");\n    $e2 = array(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\", \"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\", \"0\", \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"_\", \".\");\n    $f = 1;\n    $f2 = 1;\n    $f3 = 1;\n    for($x = 0; $x < count($d); $x++)\n    {\n        if($f == 0)\n        {\n            break;\n        }\n        else\n        {\n            $f = 0;\n            for($y = 0; $y < count($e); $y++)\n            {\n                if($d[$x] == $e[$y])\n                {\n                    $f = 1;\n                    break;\n                }\n            }\n        }\n    }\n    if(($f == 0) || (count($d) > 16))\n    {\n        print \"NO\";\n    }\n    else\n    {\n        array_splice($b, 0, $c);\n        array_unshift($b, \" \");\n        unset($b[0]);\n        $g = array_search(\"/\", $b);\n        if($g == 0)\n        {\n            if((count($b) < 1) && (count($b) > 32))\n            {\n                print \"NO\";\n            }\n            else\n            {\n                for($x = 1; $x <= count($b); $x++)\n                {\n                    if($f2 == 0)\n                    {\n                        break;\n                    }\n                    else\n                    {\n                        $f2 = 0;\n                        for($y = 0; $y < count($e2); $y++)\n                        {\n                            if($b[$x] == $e2[$y])\n                            {\n                                $f2 = 1;\n                                break;\n                            }\n                        }\n                    }\n                }\n                if($f2 == 0)\n                {\n                    print \"NO\";\n                }\n                else\n                {\n                    array_push($b, \".\");\n                    $j = 0;\n                    for($x = 1; $x <= count($b); $x++)\n                    {\n                        if($b[$x] == \".\")\n                        {\n                            $h = array_slice($b, 0, $x - 1);\n                            array_splice($b, 0, $x);\n                            $x = 0;\n                            array_unshift($b, \" \");\n                            unset($b[0]);\n                            if((count($h) < 1) && (count($h) > 16))\n                            {\n                                $j = 1;\n                            }\n                        }\n                    }\n                    if($j == 1)\n                    {\n                        print \"NO\";\n                    }\n                    else\n                    {\n                        print \"YES\";\n                    }\n                }\n            }\n        }\n        else\n        {\n            $b = array_slice($b, 0, $g - 1);\n            array_unshift($b, \" \");\n            unset($b[0]);\n            $m = array_search(\"/\", $k);\n            $l = array_slice($k, $m);\n            for($x = 0; $x < count($l); $x++)\n            {\n                if($f3 == 0)\n                {\n                    break;\n                }\n                else\n                {\n                    $f3 = 0;\n                    for($y = 0; $y < count($e); $y++)\n                    {\n                        if($l[$x] == $e[$y])\n                        {\n                            $f3 = 1;\n                            break;\n                        }\n                    }\n                }\n            }\n            if(($f3 == 0) || (count($l) > 16))\n            {\n                print \"NO\";\n            }\n            else\n            {            \n                print \"YES\";\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\n\nfunction debug($data, $die = true) {\n    echo '<pre>';\n\n    if (is_array($data)) {\n        print_r($data);\n    } else {\n        var_dump($data);\n    }\n\n    if ($die) {\n        die();\n    }\n\n    echo '</pre>';\n}\n\nfunction stdin() {\n    $stdin = @fopen('data.txt', 'r');\n    if (!$stdin) {\n        $stdin = fopen('php://stdin', 'r');\n    }\n\n    return $stdin;\n}\n\nfunction g() {\n    global $stdin;\n    return trim(fgets($stdin));\n}\n\n$stdin = stdin();\n/****************************************************** Solving block *****************************************************/\n$id = g();\n\n$word = \"[a-z0-9_]{1,16}\";\n$correct = preg_match(\"/^$word@(($word\\.)+$word)(\\/$word)?$/i\", $id, $matches);\n$correct = $correct && strlen($matches[1]) && strlen($matches[1]) < 33;\n\necho $correct ? 'YES' : 'NO';\n\n?>"}], "src_uid": "2a68157e327f92415067f127feb31e24"}
{"nl": {"description": "Polycarp is going to participate in the contest. It starts at $$$h_1:m_1$$$ and ends at $$$h_2:m_2$$$. It is guaranteed that the contest lasts an even number of minutes (i.e. $$$m_1 \\% 2 = m_2 \\% 2$$$, where $$$x \\% y$$$ is $$$x$$$ modulo $$$y$$$). It is also guaranteed that the entire contest is held during a single day. And finally it is guaranteed that the contest lasts at least two minutes.Polycarp wants to know the time of the midpoint of the contest. For example, if the contest lasts from $$$10:00$$$ to $$$11:00$$$ then the answer is $$$10:30$$$, if the contest lasts from $$$11:10$$$ to $$$11:12$$$ then the answer is $$$11:11$$$.", "input_spec": "The first line of the input contains two integers $$$h_1$$$ and $$$m_1$$$ in the format hh:mm. The second line of the input contains two integers $$$h_2$$$ and $$$m_2$$$ in the same format (hh:mm). It is guaranteed that $$$0 \\le h_1, h_2 \\le 23$$$ and $$$0 \\le m_1, m_2 \\le 59$$$. It is guaranteed that the contest lasts an even number of minutes (i.e. $$$m_1 \\% 2 = m_2 \\% 2$$$, where $$$x \\% y$$$ is $$$x$$$ modulo $$$y$$$). It is also guaranteed that the entire contest is held during a single day. And finally it is guaranteed that the contest lasts at least two minutes.", "output_spec": "Print two integers $$$h_3$$$ and $$$m_3$$$ ($$$0 \\le h_3 \\le 23, 0 \\le m_3 \\le 59$$$) corresponding to the midpoint of the contest in the format hh:mm. Print each number as exactly two digits (prepend a number with leading zero if needed), separate them with ':'.", "sample_inputs": ["10:00\n11:00", "11:10\n11:12", "01:02\n03:02"], "sample_outputs": ["10:30", "11:11", "02:02"], "notes": null}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\":\", trim(fgets(STDIN)));\nlist($c, $d) = explode(\":\", trim(fgets(STDIN)));\n$e = (($c * 60 + $d) - ($a * 60 + $b)) / 2;\nif($e >= 60)\n{\n     $f = $e % 60;\n     $g = floor($e / 60);\n     $h = $b + $f;\n     if($h >= 60)\n     {\n          $i = $h % 60;\n          $j = floor($h / 60);\n          $a += ($g + $j);\n          $b = 0;\n          $b += $i;\n     }\n     else\n     {\n          $a += $g;\n          $b += $f;\n     }\n     if(strlen($a) == 1)\n     {\n          $a = \"0\" . $a;\n     }\n     if(strlen($b) == 1)\n     {\n          $b = \"0\" . $b;\n     }\n     print $a . \":\" . $b;\n}\nelse\n{\n     $b += $e;\n     if($b >= 60)\n     {\n          $i = $b % 60;\n          $j = floor($b / 60);\n          $a += ($g + $j);\n          $b = 0;\n          $b += $i;\n     }\n     if(strlen($a) == 1)\n     {\n          $a = \"0\" . $a;\n     }\n     if(strlen($b) == 1)\n     {\n          $b = \"0\" . $b;\n     }\n     print $a . \":\" . $b;\n}\n\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\":\", trim(fgets(STDIN)));\nlist($c, $d) = explode(\":\", trim(fgets(STDIN)));\n$e = (($c * 60 + $d) - ($a * 60 + $b)) / 2;\nif($e >= 60)\n{\n     $f = $e % 60;\n     $g = floor($e / 60);\n     $h = $b + $f;\n     if($h >= 60)\n     {\n          $i = $h % 60;\n          $j = floor($h / 60);\n          $a += ($g + $j);\n          $b = 0;\n          $b += $i;\n     }\n     else\n     {\n          $a += $g;\n          $b += $f;\n     }\n     if(strlen($a) == 1)\n     {\n          $a = \"0\" . $a;\n     }\n     if(strlen($b) == 1)\n     {\n          $b = \"0\" . $b;\n     }\n     print $a . \":\" . $b;\n}\nelse\n{\n     $b += $e;\n     if($b >= 60)\n     {\n          $i = $b % 60;\n          $j = floor($b / 60);\n          $a += ($g + $j);\n          $b = 0;\n          $b += $i;\n     }\n     if(strlen($a) == 1)\n     {\n          $a = \"0\" . $a;\n     }\n     if(strlen($b) == 1)\n     {\n          $b = \"0\" . $b;\n     }\n     print $a . \":\" . $b;\n}\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b) = explode(\":\", trim(fgets(STDIN)));\nlist($c, $d) = explode(\":\", trim(fgets(STDIN)));\n$e = (($c * 60 + $d) - ($a * 60 + $b)) / 2;\nif($e >= 60)\n{\n     $f = $e % 60;\n     $g = floor($e / 60);\n     $a += $g;\n     $b += $f;\n     if($a < 10)\n     {\n          $a = \"0\" . $a;\n     }\n     if($b < 10)\n     {\n          $b = \"0\" . $b;\n     }\n     print $a . \":\" . $b;\n}\nelse\n{\n     $b += $e;\n     if($a < 10)\n     {\n          $a = \"0\" . $a;\n     }\n     if($b < 10)\n     {\n          $b = \"0\" . $b;\n     }\n     print $a . \":\" . $b;\n}\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\":\", trim(fgets(STDIN)));\nlist($c, $d) = explode(\":\", trim(fgets(STDIN)));\n$e = (($c * 60 + $d) - ($a * 60 + $b)) / 2;\nif($e >= 60)\n{\n     $f = $e % 60;\n     $g = floor($e / 60);\n     $a += $g;\n     $b += $h;\n     if($a < 10)\n     {\n          $a = \"0\" . $a;\n     }\n     if($b < 10)\n     {\n          $b = \"0\" . $b;\n     }\n     print $a . \":\" . $b;\n}\nelse\n{\n     $b += $e;\n     if($a < 10)\n     {\n          $a = \"0\" . $a;\n     }\n     if($b < 10)\n     {\n          $b = \"0\" . $b;\n     }\n     print $a . \":\" . $b;\n}\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\":\", trim(fgets(STDIN)));\nlist($c, $d) = explode(\":\", trim(fgets(STDIN)));\n$e = (($c * 60 + $d) - ($a * 60 + $b)) / 2;\nif($e >= 60)\n{\n     $f = $e % 60;\n     $g = floor($e / 60);\n     $h = $b + $f;\n     if($h == 60)\n     {\n          $a += ($g + 1);\n          $b = 0;\n     }\n     else\n     {\n          $a += $g;\n          $b += $f;\n     }\n     if(strlen($a) == 1)\n     {\n          $a = \"0\" . $a;\n     }\n     if(strlen($b) == 1)\n     {\n          $b = \"0\" . $b;\n     }\n     print $a . \":\" . $b;\n}\nelse\n{\n     $b += $e;\n     if(strlen($a) == 1)\n     {\n          $a = \"0\" . $a;\n     }\n     if(strlen($b) == 1)\n     {\n          $b = \"0\" . $b;\n     }\n     print $a . \":\" . $b;\n}\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\":\", trim(fgets(STDIN)));\nlist($c, $d) = explode(\":\", trim(fgets(STDIN)));\n$e = (($c * 60 + $d) - ($a * 60 + $b)) / 2;\nif($e >= 60)\n{\n     $f = $e % 60;\n     $g = floor($e / 60);\n     $h = $b + $f;\n     if($h == 60)\n     {\n          $a += ($g + 1);\n          $b = 0;\n     }\n     else\n     {\n          $a += $g;\n          $b += $f;\n     }\n     if($a < 10)\n     {\n          $a = \"0\" . $a;\n     }\n     if($b < 10)\n     {\n          $b = \"0\" . $b;\n     }\n     print $a . \":\" . $b;\n}\nelse\n{\n     $b += $e;\n     if($a < 10)\n     {\n          $a = \"0\" . $a;\n     }\n     if($b < 10)\n     {\n          $b = \"0\" . $b;\n     }\n     print $a . \":\" . $b;\n}\n?>"}, {"source_code": "list($a, $b) = explode(\":\", trim(fgets(STDIN)));\nlist($c, $d) = explode(\":\", trim(fgets(STDIN)));\n$e = (($c * 60 + $d) - ($a * 60 + $b)) / 2;\nif($e >= 60)\n{\n     $f = $e % 60;\n     $g = floor($e / 60);\n     $h = $b + $f;\n     if($h >= 60)\n     {\n          $i = $h % 60;\n          $j = floor($h / 60);\n          $a += ($g + $j);\n          $b = 0;\n          $b += $i;\n     }\n     else\n     {\n          $a += $g;\n          $b += $f;\n     }\n     if(strlen($a) == 1)\n     {\n          $a = \"0\" . $a;\n     }\n     if(strlen($b) == 1)\n     {\n          $b = \"0\" . $b;\n     }\n     print $a . \":\" . $b;\n}\nelse\n{\n     $b += $e;\n     if($b >= 60)\n     {\n          $i = $b % 60;\n          $j = floor($b / 60);\n          $a += ($g + $j);\n          $b = 0;\n          $b += $i;\n     }\n     if(strlen($a) == 1)\n     {\n          $a = \"0\" . $a;\n     }\n     if(strlen($b) == 1)\n     {\n          $b = \"0\" . $b;\n     }\n     print $a . \":\" . $b;\n}"}], "src_uid": "f7a32a8325ce97c4c50ce3a5c282ec50"}
{"nl": {"description": "The Little Elephant loves numbers. He has a positive integer x. The Little Elephant wants to find the number of positive integers d, such that d is the divisor of x, and x and d have at least one common (the same) digit in their decimal representations. Help the Little Elephant to find the described number.", "input_spec": "A single line contains a single integer x (1\u2009\u2264\u2009x\u2009\u2264\u2009109).", "output_spec": "In a single line print an integer \u2014 the answer to the problem.", "sample_inputs": ["1", "10"], "sample_outputs": ["1", "2"], "notes": null}, "positive_code": [{"source_code": "<?php\n/*\nhttp://www.codeforces.com/problemset/problem/221/B\nThe Little Elephant loves numbers.\n\nHe has a positive integer x. The Little Elephant wants to find the number of \npositive integers d, such that d is the divisor of x, and x and d have at least\none common (the same) digit in their decimal representations.\n\nHelp the Little Elephant to find the described number.\nInput: A single line contains a single integer x (1 ? x ? 109).\nOutput: In a single line print an integer \u2014 the answer to the problem.\n*/\n$num = fgets(STDIN);\n//echo $num;\n//$arr = str_split($num);\n//print_r($arr);\n/*\nforeach( $arr as $i => $val){\n    echo \"Id: $i, Val: $val\\n\";\n}\n*/\n$r = 0;\nfor ($i = 1; $i <= sqrt($num); $i += 1) {\n    if ($num % $i == 0) {\n        $k = $num / $i;\n        //echo \"probando $i $k \\n\";\n        $f_i = 0;\n        $f_j = 0;\n        for ($j = 0; $j <= 9; $j += 1) {\n            if (substr_count((string)$num, (string)$j) > 0){\n                if (substr_count((string)$i, (string)$j) > 0  and $f_i == 0){\n                    //echo \"$i\\n\";\n                    $r++;\n                    $f_i = 1;\n                }\n                if (substr_count((string)$k, (string)$j) > 0 and $f_j == 0 and $i != $k) {\n                    //echo \"$k\\n\";\n                    $f_j = 1;\n                    $r++;\n                }\n            }\n        }\n    }\n}\necho $r;\n?>"}], "negative_code": [{"source_code": "for ($i = 2; $i <= $num / 2; $i += 1) {\n    if ($num % $i == 0) {\n        $f_i = 0;\n        for ($j = 0; $j <= 9; $j += 1) {\n            if (substr_count((string)$num, (string)$j) > 0){\n                if (substr_count((string)$i, (string)$j) > 0  and $f_i == 0){\n                    echo \"$i\\n\";\n                    $f_i = 1;\n                }\n            }\n        }\n    }\n}\n"}, {"source_code": "<?php\n/*\nhttp://www.codeforces.com/problemset/problem/221/B\nThe Little Elephant loves numbers.\n\nHe has a positive integer x. The Little Elephant wants to find the number of \npositive integers d, such that d is the divisor of x, and x and d have at least\none common (the same) digit in their decimal representations.\n\nHelp the Little Elephant to find the described number.\nInput: A single line contains a single integer x (1 ? x ? 109).\nOutput: In a single line print an integer \u2014 the answer to the problem.\n*/\n$num = fgets(STDIN);\n//echo $num;\n//$arr = str_split($num);\n//print_r($arr);\n/*\nforeach( $arr as $i => $val){\n    echo \"Id: $i, Val: $val\\n\";\n}\n*/\nfor ($i = 2; $i <= sqrt($num); $i += 1) {\n    if ($num % $i == 0) {\n        $k = $num / $i;\n        //echo \"probando $i $k \\n\";\n        $f_i = 0;\n        $f_j = 0;\n        for ($j = 0; $j <= 9; $j += 1) {\n            if (substr_count((string)$num, (string)$j) > 0){\n                if (substr_count((string)$i, (string)$j) > 0  and $f_i == 0){\n                    echo \"$i\\n\";\n                    $f_i = 1;\n                }\n                if (substr_count((string)$k, (string)$j) > 0 and $f_j == 0 and $i != $k) {\n                    echo \"$k\\n\";\n                    $f_j = 1;\n                }\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\n/*\nhttp://www.codeforces.com/problemset/problem/221/B\nThe Little Elephant loves numbers.\n\nHe has a positive integer x. The Little Elephant wants to find the number of \npositive integers d, such that d is the divisor of x, and x and d have at least\none common (the same) digit in their decimal representations.\n\nHelp the Little Elephant to find the described number.\nInput: A single line contains a single integer x (1 ? x ? 109).\nOutput: In a single line print an integer \u2014 the answer to the problem.\n*/\n$num = fgets(STDIN);\n//echo $num;\n//$arr = str_split($num);\n//print_r($arr);\n/*\nforeach( $arr as $i => $val){\n    echo \"Id: $i, Val: $val\\n\";\n}\n*/\nfor ($i = 1; $i <= $num / 2; $i += 1) {\n    if ($num % $i == 0) {\n        $f_i = 0;\n        for ($j = 0; $j <= 9; $j += 1) {\n            if (substr_count((string)$num, (string)$j) > 0){\n                if (substr_count((string)$i, (string)$j) > 0  and $f_i == 0){\n                    echo \"$i\\n\";\n                    $f_i = 1;\n                }\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\n/*\nhttp://www.codeforces.com/problemset/problem/221/B\nThe Little Elephant loves numbers.\n\nHe has a positive integer x. The Little Elephant wants to find the number of \npositive integers d, such that d is the divisor of x, and x and d have at least\none common (the same) digit in their decimal representations.\n\nHelp the Little Elephant to find the described number.\nInput: A single line contains a single integer x (1 ? x ? 109).\nOutput: In a single line print an integer \u2014 the answer to the problem.\n*/\n$num = fgets(STDIN);\n//echo $num;\n//$arr = str_split($num);\n//print_r($arr);\n/*\nforeach( $arr as $i => $val){\n    echo \"Id: $i, Val: $val\\n\";\n}\n*/\nfor ($i = 1; $i <= sqrt($num); $i += 1) {\n    if ($num % $i == 0) {\n        $k = $num / $i;\n        //echo \"probando $i $k \\n\";\n        $f_i = 0;\n        $f_j = 0;\n        for ($j = 0; $j <= 9; $j += 1) {\n            if (substr_count((string)$num, (string)$j) > 0){\n                if (substr_count((string)$i, (string)$j) > 0  and $f_i == 0){\n                    echo \"$i\\n\";\n                    $f_i = 1;\n                }\n                if (substr_count((string)$k, (string)$j) > 0 and $f_j == 0 and $i != $k) {\n                    echo \"$k\\n\";\n                    $f_j = 1;\n                }\n            }\n        }\n    }\n}\n?>"}, {"source_code": "<?php\n/*\nhttp://www.codeforces.com/problemset/problem/221/B\nThe Little Elephant loves numbers.\n\nHe has a positive integer x. The Little Elephant wants to find the number of \npositive integers d, such that d is the divisor of x, and x and d have at least\none common (the same) digit in their decimal representations.\n\nHelp the Little Elephant to find the described number.\nInput: A single line contains a single integer x (1 ? x ? 109).\nOutput: In a single line print an integer \u2014 the answer to the problem.\n*/\n$num = fgets(STDIN);\n//echo $num;\n//$arr = str_split($num);\n//print_r($arr);\n/*\nforeach( $arr as $i => $val){\n    echo \"Id: $i, Val: $val\\n\";\n}\n*/\nfor ($i = 1; $i <= $num / 2 + 1; $i += 1) {\n    if ($num % $i == 0) {\n        $f_i = 0;\n        for ($j = 0; $j <= 9; $j += 1) {\n            if (substr_count((string)$num, (string)$j) > 0){\n                if (substr_count((string)$i, (string)$j) > 0  and $f_i == 0){\n                    echo \"$i\\n\";\n                    $f_i = 1;\n                }\n            }\n        }\n    }\n}\n?>"}], "src_uid": "ada94770281765f54ab264b4a1ef766e"}
{"nl": {"description": " \u2014 Thanks a lot for today.\u2014 I experienced so many great things.\u2014 You gave me memories like dreams... But I have to leave now...\u2014 One last request, can you...\u2014 Help me solve a Codeforces problem?\u2014 ......\u2014 What?Chtholly has been thinking about a problem for days:If a number is palindrome and length of its decimal representation without leading zeros is even, we call it a zcy number. A number is palindrome means when written in decimal representation, it contains no leading zeros and reads the same forwards and backwards. For example 12321 and 1221 are palindromes and 123 and 12451 are not. Moreover, 1221 is zcy number and 12321 is not.Given integers k and p, calculate the sum of the k smallest zcy numbers and output this sum modulo p.Unfortunately, Willem isn't good at solving this kind of problems, so he asks you for help!", "input_spec": "The first line contains two integers k and p (1\u2009\u2264\u2009k\u2009\u2264\u2009105,\u20091\u2009\u2264\u2009p\u2009\u2264\u2009109).", "output_spec": "Output single integer\u00a0\u2014 answer to the problem.", "sample_inputs": ["2 100", "5 30"], "sample_outputs": ["33", "15"], "notes": "NoteIn the first example, the smallest zcy number is 11, and the second smallest zcy number is 22.In the second example, ."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = 0;\nfor($x = 1; $x <= $a; $x++)\n{\n     $d = $x . strrev($x);\n     $c = bcadd($c, $d);\n}\n$e = bcmod($c, $b);\nprint $e;\n?>"}, {"source_code": "<?php\n\n$input = fopen('php://stdin', 'r');\n\nfscanf($input, '%d%d', $request, $modulus);\n$result = [];\n$number = 0;\n\nwhile (count($result) < $request) {\n    $number++;\n    $palindrome = $number . strrev($number);\n    $result[$palindrome] = true;\n}\n\n$sum = 0;\n\nforeach (array_keys($result) as $item) {\n    $sum = bcadd($sum, $item);\n}\n\necho bcmod($sum, $modulus), PHP_EOL;\n"}], "negative_code": [], "src_uid": "00e90909a77ce9e22bb7cbf1285b0609"}
{"nl": {"description": "Mad scientist Mike is busy carrying out experiments in chemistry. Today he will attempt to join three atoms into one molecule.A molecule consists of atoms, with some pairs of atoms connected by atomic bonds. Each atom has a valence number \u2014 the number of bonds the atom must form with other atoms. An atom can form one or multiple bonds with any other atom, but it cannot form a bond with itself. The number of bonds of an atom in the molecule must be equal to its valence number.  Mike knows valence numbers of the three atoms. Find a molecule that can be built from these atoms according to the stated rules, or determine that it is impossible.", "input_spec": "The single line of the input contains three space-separated integers a, b and c (1\u2009\u2264\u2009a,\u2009b,\u2009c\u2009\u2264\u2009106) \u2014 the valence numbers of the given atoms.", "output_spec": "If such a molecule can be built, print three space-separated integers \u2014 the number of bonds between the 1-st and the 2-nd, the 2-nd and the 3-rd, the 3-rd and the 1-st atoms, correspondingly. If there are multiple solutions, output any of them. If there is no solution, print \"Impossible\" (without the quotes).", "sample_inputs": ["1 1 2", "3 4 5", "4 1 1"], "sample_outputs": ["0 1 1", "1 3 2", "Impossible"], "notes": "NoteThe first sample corresponds to the first figure. There are no bonds between atoms 1 and 2 in this case.The second sample corresponds to the second figure. There is one or more bonds between each pair of atoms.The third sample corresponds to the third figure. There is no solution, because an atom cannot form bonds with itself.The configuration in the fourth figure is impossible as each atom must have at least one atomic bond."}, "positive_code": [{"source_code": "<?php\nfunction go($a, $b, $c) {\n    for ($i = 0; $i <= $a && $i <= $b; $i++) {\n        if ($a - $i + $b - $i == $c) {\n            printf (\"%d %d %d\\n\", $i, $b - $i, $a - $i);\n            return;\n        }\n    }\n    printf (\"Impossible\\n\");\n}\nfscanf(STDIN, \"%d %d %d\", $a, $b, $c);\ngo($a, $b, $c);\n?>"}, {"source_code": "<?php\n\n$in = 'php://stdin';\n\n$input = fopen($in, \"r\");\n\n$a = explode(\" \", trim(fgets($input)));\n\n$otvet[\"01\"] = 0; $otvet[\"12\"] = 0; $otvet[\"20\"] = 0; \n$otvet[\"10\"] = 0; $otvet[\"21\"] = 0; $otvet[\"02\"] = 0; \n\nasort($a);\n\n$p = array_keys($a);\n\n$a[$p[2]] = $a[$p[2]] - ($a[$p[1]] - $a[$p[0]]);\n$otvet[$p[2].$p[1]] = $a[$p[1]] - $a[$p[0]];\n$a[$p[1]] -= ($a[$p[1]] - $a[$p[0]]);\n\nif ($a[$p[2]]%2!=0) {die(\"Impossible\");}\n\n$popal = $a[$p[2]]/2;\n$otvet[$p[2].$p[1]] += $popal;\n$otvet[$p[2].$p[0]] += $popal;\n\n$a[$p[1]] -= $popal;\n$a[$p[0]] -= $popal;\n\nif ($a[$p[1]]<0) die(\"Impossible\"); \nif ($a[$p[0]]<0) die(\"Impossible\");\nif ($a[$p[1]]!=$a[$p[0]]) die(\"Impossible\");\n\n$otvet[$p[1].$p[0]] += $a[$p[1]];\n\n$ot[0] = $otvet[\"01\"] + $otvet[\"10\"];\n$ot[1] = $otvet[\"12\"] + $otvet[\"21\"];\n$ot[2] = $otvet[\"20\"] + $otvet[\"02\"];\n\necho $ot[0].' '.$ot[1].' '.$ot[2];\n?>"}], "negative_code": [], "src_uid": "b3b986fddc3770fed64b878fa42ab1bc"}
{"nl": {"description": "  You can preview the image in better quality by the link: http://assets.codeforces.com/files/656/without-text.png", "input_spec": "The only line of the input is a string (between 1 and 50 characters long, inclusive). Each character will be an alphanumeric character or a full stop \".\".", "output_spec": "Output the required answer.", "sample_inputs": ["Codeforces", "APRIL.1st"], "sample_outputs": ["-87", "17"], "notes": null}, "positive_code": [{"source_code": "<?php\n\n$s = fgets(STDIN);\n\n$ans = 0;\n\nfor ($i = 0; $i < strlen($s); $i++) {\n\t$c = $s[$i];\n\tif (ctype_alpha($c)) {\n\t\tif (ctype_upper($c)) {\n\t\t\t$v = ord($c) - ord('A') + 1;\n\t\t\t$ans += $v;\n\t\t} else {\n\t\t\t$v = ord($c) - ord('a') + 1;\n\t\t\t$ans -= $v;\n\t\t}\n\t}\n}\n\necho $ans;\n"}], "negative_code": [], "src_uid": "d3fa5a3a008048dc4a9fbce1ebc61d67"}
{"nl": {"description": "The king's birthday dinner was attended by $$$k$$$ guests. The dinner was quite a success: every person has eaten several dishes (though the number of dishes was the same for every person) and every dish was served alongside with a new set of kitchen utensils.All types of utensils in the kingdom are numbered from $$$1$$$ to $$$100$$$. It is known that every set of utensils is the same and consist of different types of utensils, although every particular type may appear in the set at most once. For example, a valid set of utensils can be composed of one fork, one spoon and one knife.After the dinner was over and the guests were dismissed, the king wondered what minimum possible number of utensils could be stolen. Unfortunately, the king has forgotten how many dishes have been served for every guest but he knows the list of all the utensils left after the dinner. Your task is to find the minimum possible number of stolen utensils.", "input_spec": "The first line contains two integer numbers $$$n$$$ and $$$k$$$ ($$$1 \\le n \\le 100, 1 \\le k \\le 100$$$) \u00a0\u2014 the number of kitchen utensils remaining after the dinner and the number of guests correspondingly. The next line contains $$$n$$$ integers $$$a_1, a_2, \\ldots, a_n$$$ ($$$1 \\le a_i \\le 100$$$) \u00a0\u2014 the types of the utensils remaining. Equal values stand for identical utensils while different values stand for different utensils.", "output_spec": "Output a single value \u2014 the minimum number of utensils that could be stolen by the guests.", "sample_inputs": ["5 2\n1 2 2 1 3", "10 3\n1 3 3 1 3 5 5 5 5 100"], "sample_outputs": ["1", "14"], "notes": "NoteIn the first example it is clear that at least one utensil of type $$$3$$$ has been stolen, since there are two guests and only one such utensil. But it is also possible that every person received only one dish and there were only six utensils in total, when every person got a set $$$(1, 2, 3)$$$ of utensils. Therefore, the answer is $$$1$$$.One can show that in the second example at least $$$2$$$ dishes should have been served for every guest, so the number of utensils should be at least $$$24$$$: every set contains $$$4$$$ utensils and every one of the $$$3$$$ guests gets two such sets. Therefore, at least $$$14$$$ objects have been stolen. Please note that utensils of some types (for example, of types $$$2$$$ and $$$4$$$ in this example) may be not present in the set served for dishes."}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\n$d = array();\nfor($x = 0; $x < $a; $x++)\n{\n     $d[$c[$x]]++;\n}\n$e = max($d);\n$f = ceil($e / $b) * $b;\n$g = count(array_unique($c)) * $f;\nprint $g - $a;\n?>"}, {"source_code": "<?php\n//define('STDIN', fopen('input.txt', 'r'));\n\nfunction array_value_to_integer(&$arr) {\n\tforeach ($arr as &$value)\n\t\t$value = (int)$value;\n\tunset($value);\n\treturn $arr;\n}\n\n$arrCounts = explode(' ', trim(fgets(STDIN)));\nlist($countTablewareAfter, $countGuest) = array_value_to_integer( $arrCounts );\n\n$arrTableware = explode(' ', trim(fgets(STDIN)));\narray_value_to_integer($arrTableware);\n\n$arrCountTablewareByType = [];\nfor ($i = 0; $i < $countTablewareAfter; $i++) {\n\t$arrCountTablewareByType[ $arrTableware[$i] ]++;\n}\n\n$minDishes = (int)ceil( max($arrCountTablewareByType) / $countGuest ); //\u043c\u0438\u043d\u0438\u043c\u0430\u043b\u044c\u043d\u043e\u0435 \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0431\u043b\u044e\u0434\n$minCountTablewareType = count( $arrCountTablewareByType );\n\necho( $minDishes * $minCountTablewareType * $countGuest - $countTablewareAfter );\n\nfclose(STDIN);\n\n?>"}, {"source_code": "<?php\n$fl = STDIN;//fopen(\"input.txt\",\"r\");\n\n$nAndKArray = explode(\" \", fgets($fl));\n$n = $nAndKArray[0];\n$k = $nAndKArray[1];\n\n$typesOfDevices = explode(\" \", trim(fgets($fl)));\n$resultTypeOfDevices = [];\n$numberOfMeals = 1;\n\nfor($i = 0; $i < count($typesOfDevices); $i++){\n    if(array_key_exists($typesOfDevices[$i], $resultTypeOfDevices)){\n        $resultTypeOfDevices[$typesOfDevices[$i]]++;\n        if(($resultTypeOfDevices[$typesOfDevices[$i]]/$k) > $numberOfMeals){\n            $numberOfMeals++;\n        }\n    } else {\n        $resultTypeOfDevices[$typesOfDevices[$i]] = 1;\n    }\n}\n$result = $numberOfMeals * $k * count($resultTypeOfDevices) - $n;\n\nprint($result);"}], "negative_code": [{"source_code": "<?php\n$fl = STDIN;//fopen(\"input.txt\",\"r\");\n\n$nAndKArray = explode(\" \", fgets($fl));\n$n = $nAndKArray[0];\n$k = $nAndKArray[1];\n\n$typesOfDevices = explode(\" \", fgets($fl));\n$resultTypeOfDevices = [];\n$numberOfMeals = 1;\n\nfor($i = 0; $i < count($typesOfDevices); $i++){\n    if(array_key_exists($typesOfDevices[$i], $resultTypeOfDevices)){\n        $resultTypeOfDevices[$typesOfDevices[$i]]++;\n        if(($resultTypeOfDevices[$typesOfDevices[$i]]/$k) > $numberOfMeals){\n            $numberOfMeals++;\n        }\n    } else {\n        $resultTypeOfDevices[$typesOfDevices[$i]] = 1;\n    }\n}\n$result = $numberOfMeals * $k * count($resultTypeOfDevices) - $n;\nprint($result);"}], "src_uid": "c03ff0bc6a8c4ce5372194e8ea18527f"}
{"nl": {"description": "Two polar bears Menshykov and Uslada from the St.Petersburg zoo and elephant Horace from the Kiev zoo got six sticks to play with and assess the animals' creativity. Menshykov, Uslada and Horace decided to make either an elephant or a bear from those sticks. They can make an animal from sticks in the following way:   Four sticks represent the animal's legs, these sticks should have the same length.  Two remaining sticks represent the animal's head and body. The bear's head stick must be shorter than the body stick. The elephant, however, has a long trunk, so his head stick must be as long as the body stick. Note that there are no limits on the relations between the leg sticks and the head and body sticks. Your task is to find out which animal can be made from the given stick set. The zoo keeper wants the sticks back after the game, so they must never be broken, even bears understand it.", "input_spec": "The single line contains six space-separated integers li (1\u2009\u2264\u2009li\u2009\u2264\u20099) \u2014 the lengths of the six sticks. It is guaranteed that the input is such that you cannot make both animals from the sticks.", "output_spec": "If you can make a bear from the given set, print string \"Bear\" (without the quotes). If you can make an elephant, print string \"Elephant\" (w\u0131thout the quotes). If you can make neither a bear nor an elephant, print string \"Alien\" (without the quotes).", "sample_inputs": ["4 2 5 4 4 4", "4 4 5 4 4 5", "1 2 3 4 5 6"], "sample_outputs": ["Bear", "Elephant", "Alien"], "notes": "NoteIf you're out of creative ideas, see instructions below which show how to make a bear and an elephant in the first two samples. The stick of length 2 is in red, the sticks of length 4 are in green, the sticks of length 5 are in blue.   "}, "positive_code": [{"source_code": "<?php\n$a = explode(\" \", trim(fgets(STDIN)));\narray_push($a, 10);\nsort($a);\n$b = array_unique($a);\n$c = array_keys($b);\n$d = array();\n$f = array();\nfor($x = 0; $x < count($c) - 1; $x++)\n{\n    $e = $c[$x + 1] - $c[$x];\n    array_push($d, $e);\n    array_push($f, $b[$c[$x]]);\n}\nif(count($d) == 3)\n{\n    if(($d[0] == 4) && ($f[1] != $f[2]))\n    {\n        print \"Bear\";\n    }\n    elseif(($d[1] == 4) && ($f[0] != $f[2]))\n    {\n        print \"Bear\";\n    }\n    elseif(($d[2] == 4) && ($f[0] != $f[1]))\n    {\n        print \"Bear\";\n    }\n    elseif(($d[0] == 4) && ($f[1] == $f[2]))\n    {\n        print \"Elephant\";\n    }\n    elseif(($d[1] == 4) && ($f[0] == $f[2]))\n    {\n        print \"Elephant\";\n    }\n    elseif(($d[2] == 4) && ($f[0] == $f[1]))\n    {\n        print \"Elephant\";\n    }\n    else\n    {\n        print \"Alien\";\n    }\n}\nelseif(count($d) == 2)\n{\n    if($d[0] == 4)\n    {\n        print \"Elephant\";\n    }\n    elseif($d[1] == 4)\n    {\n        print \"Elephant\";\n    }\n    elseif($d[0] == 5)\n    {\n        print \"Bear\";\n    }\n    elseif($d[1] == 5)\n    {\n        print \"Bear\";\n    }\n    else\n    {\n        print \"Alien\";\n    }\n}\nelseif(count($d) == 1)\n{\n    print \"Elephant\";\n}\nelse\n{\n    print \"Alien\";\n}\n?>"}, {"source_code": "<?php\n\t$data = explode(' ', trim(fgets(STDIN)));\n\t$counts = array();\n\tforeach ($data as $el){\n\t\t$counts[$el]++;\n\t}\n\t$hasFoot = $head = $body = 0;\n\tforeach ($counts as $k => $el){\n\t\tif ($el >= 4){\n\t\t\t$hasFoot = true;\n\t\t\tif ($el >= 5) $head = $k;\n\t\t\tif ($el == 6) $body = $k; \n\t\t}else{\n\t\t\tif ($el == 2){\n\t\t\t\t$head = $body = $k;\n\t\t\t}else{\n\t\t\t\tif ($head == 0) $head = $k;\n\t\t\t\telse $body = $k;\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\techo $hasFoot ? $body == $head ? 'Elephant' : 'Bear' : 'Alien';\n?>"}, {"source_code": "<?php\n$l = explode(\" \", trim(fgets(STDIN)));\n$k = $q = 0;\nfor($i = 0; $i < 6; $i++){\n\t$a[$l[$i]]++;\n}\nfor($i = 1;  $i < 10; $i++){\n\tif($a[$i] == 6){\n\t\techo \"Elephant\";\n\t\texit;\n\t}\n\tif($a[$i] >= 4) $k++;\n\tif($a[$i] == 2) $q++;\n}\nif($k && $q){\n\techo \"Elephant\";\n}else if($k)\n\techo \"Bear\";\nelse echo \"Alien\";\n?>"}, {"source_code": "<?php\n$a = explode(' ', trim(fgets(STDIN)));\nsort($a);\n\nif ($a[0] == $a[3]) {\n    echo $a[4] == $a[5] ? 'Elephant' : 'Bear';\n} elseif ($a[1] == $a[4]) {\n    echo $a[0] == $a[5] ? 'Elephant' : 'Bear';\n} elseif ($a[2] == $a[5]) {\n    echo $a[0] == $a[1] ? 'Elephant' : 'Bear';\n} else {\n    echo 'Alien';\n}"}, {"source_code": "<?php\n// 471A     \u041c\u0423\u0425 \u0438 \u043f\u0430\u043b\u043e\u0447\u043a\u0438  \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n$arr = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\nsort($arr);\n\nfor ($i=0; $i < 6; $i++) { \n    $count = substr_count($input_line, $arr[$i]);\n    if ($count> 3) {\n        for ($j=0; $j < 4 ; $j++) { \n            unset($arr[$i+$j]);\n        }\n        break;\n    }\n}\n\n$str = '';\nforeach ($arr as $key => $value) {\n    $str .= $value;\n}\n\nif ($count > 3) {\n    if ($str[0] === $str[1]) {\n        echo \"Elephant\";\n    } else {\n        echo \"Bear\";\n    }\n} else {\n    echo \"Alien\";\n}\n\n?>"}, {"source_code": "<?php\nerror_reporting(\"off\");\n//471A: MUH and Sticks\n$array = explode(\" \", trim(fgets(STDIN)));\n$count = array_count_values($array);\nsort($count);\n$string = implode($count);\nif ($string == \"114\" || $string == \"15\") {\n\techo \"Bear\";\n} elseif ($string == \"24\" || $string == \"6\") {\n\techo \"Elephant\";\n} else {\n\techo \"Alien\";\n}\n?>"}], "negative_code": [{"source_code": "<?php\n$a = explode(\" \", trim(fgets(STDIN)));\nsort($a);\n$b = array_unique($a);\nsort($b);\nif(count($b) == 2)\n{\n    print \"Elephant\";\n}\nelseif(count($b) == 3)\n{\n    print \"Bear\";\n}\nelse\n{\n    print \"Alien\";\n}\n?>"}, {"source_code": "<?php\n$a = explode(\" \", trim(fgets(STDIN)));\nsort($a);\n$b = array_unique($a);\nsort($b);\nif((count($b) == 1) || (count($b) == 2))\n{\n    print \"Elephant\";\n}\nelseif(count($b) == 3)\n{\n    print \"Bear\";\n}\nelse\n{\n    print \"Alien\";\n}\n?>"}, {"source_code": "<?php\n$a = explode(\" \", trim(fgets(STDIN)));\narray_push($a, 10);\nsort($a);\n$b = array_unique($a);\n$c = array_keys($b);\n$d = array();\n$f = array();\nfor($x = 0; $x < count($c) - 1; $x++)\n{\n    $e = $c[$x + 1] - $c[$x];\n    array_push($d, $e);\n    array_push($f, $b[$c[$x]]);\n}\nif(count($d) == 3)\n{\n    if(($d[0] == 4) && ($f[1] != $f[2]))\n    {\n        print \"Bear\";\n    }\n    elseif(($d[1] == 4) && ($f[0] != $f[2]))\n    {\n        print \"Bear\";\n    }\n    elseif(($d[2] == 4) && ($f[0] != $f[1]))\n    {\n        print \"Bear\";\n    }\n    elseif(($d[0] == 4) && ($f[1] == $f[2]))\n    {\n        print \"Elephant\";\n    }\n    elseif(($d[1] == 4) && ($f[0] == $f[2]))\n    {\n        print \"Elephant\";\n    }\n    elseif(($d[2] == 4) && ($f[0] == $f[1]))\n    {\n        print \"Elephant\";\n    }\n    else\n    {\n        print \"Alien\";\n    }\n}\nelseif(count($d) == 2)\n{\n    if($d[0] == 4)\n    {\n        print \"Elephant\";\n    }\n    elseif($d[1] == 4)\n    {\n        print \"Elephant\";\n    }\n    else\n    {\n        print \"Alien\";\n    }\n}\nelse\n{\n    print \"Alien\";\n}\n?>"}, {"source_code": "<?php\n$a = explode(\" \", trim(fgets(STDIN)));\narray_push($a, 10);\nsort($a);\n$b = array_unique($a);\n$c = array_keys($b);\n$d = array();\n$f = array();\nfor($x = 0; $x < count($c) - 1; $x++)\n{\n    $e = $c[$x + 1] - $c[$x];\n    array_push($d, $e);\n    array_push($f, $b[$c[$x]]);\n}\nif(count($d) == 3)\n{\n    if(($d[0] == 4) && ($f[1] != $f[2]))\n    {\n        print \"Bear\";\n    }\n    elseif(($d[1] == 4) && ($f[0] != $f[2]))\n    {\n        print \"Bear\";\n    }\n    elseif(($d[2] == 4) && ($f[0] != $f[1]))\n    {\n        print \"Bear\";\n    }\n    elseif(($d[0] == 4) && ($f[1] == $f[2]))\n    {\n        print \"Elephant\";\n    }\n    elseif(($d[1] == 4) && ($f[0] == $f[2]))\n    {\n        print \"Elephant\";\n    }\n    elseif(($d[2] == 4) && ($f[0] == $f[1]))\n    {\n        print \"Elephant\";\n    }\n    else\n    {\n        print \"Alien\";\n    }\n}\nelseif(count($d) == 2)\n{\n    if($d[0] == 4)\n    {\n        print \"Elephant\";\n    }\n    elseif($d[1] == 4)\n    {\n        print \"Elephant\";\n    }\n    else\n    {\n        print \"Alien\";\n    }\n}\nelseif(count($d) == 1)\n{\n    print \"Elephant\";\n}\nelse\n{\n    print \"Alien\";\n}\n?>"}, {"source_code": "<?php\n$a = explode(\" \", trim(fgets(STDIN)));\narray_push($a, 10);\nsort($a);\n$b = array_unique($a);\n$c = array_keys($b);\n$d = array();\n$f = array();\nfor($x = 0; $x < count($c) - 1; $x++)\n{\n    $e = $c[$x + 1] - $c[$x];\n    array_push($d, $e);\n    array_push($f, $b[$c[$x]]);\n}\nif(count($d) == 3)\n{\n    if(($d[0] == 4) && ($f[1] != $f[2]))\n    {\n        print \"Bear\";\n    }\n    elseif(($d[1] == 4) && ($f[0] != $f[2]))\n    {\n        print \"Bear\";\n    }\n    elseif(($d[2] == 4) && ($f[0] != $f[1]))\n    {\n        print \"Bear\";\n    }\n    elseif(($d[0] == 4) && ($f[1] == $f[2]))\n    {\n        print \"Elephant\";\n    }\n    elseif(($d[1] == 4) && ($f[0] == $f[2]))\n    {\n        print \"Elephant\";\n    }\n    elseif(($d[2] == 4) && ($f[0] == $f[1]))\n    {\n        print \"Elephant\";\n    }\n    else\n    {\n        print \"Alien\";\n    }\n}\nelseif(count($d) == 2)\n{\n    if($d[0] == 4)\n    {\n        print \"Elephant\";\n    }\n    elseif($d[1] == 4)\n    {\n        print \"Elephant\";\n    }\n    else\n    {\n        print \"Bear\";\n    }\n}\nelseif(count($d) == 1)\n{\n    print \"Elephant\";\n}\nelse\n{\n    print \"Alien\";\n}\n?>"}, {"source_code": "<?php\n\t$data = explode(' ', trim(fgets(STDIN)));\n\t$counts = array();\n\tforeach ($data as $el){\n\t\t$counts[$el]++;\n\t}\n\t$hasFoot = $head = $body = 0;\n\tforeach ($counts as $k => $el){\n\t\tif ($el >= 4){\n\t\t\t$hasFoot = true;\n\t\t\tif ($el == 5) $head = $k;\n\t\t\tif ($el == 6) $body = $k; \n\t\t}else{\n\t\t\tif ($el == 2){\n\t\t\t\t$head = $body = $k;\n\t\t\t}else{\n\t\t\t\tif ($head == 0) $head = $k;\n\t\t\t\telse $body = $k;\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\techo $hasFoot ? $body == $head ? 'Elephant' : 'Bear' : 'Alien';\n?>"}, {"source_code": "<?php\n$a = explode(' ', fgets(STDIN));\nsort($a);\n\nif ($a[0] == $a[3]) {\n    echo $a[4] == $a[5] ? 'Elephant' : 'Bear';\n} elseif ($a[1] == $a[3]) {\n    echo $a[0] == $a[5] ? 'Elephant' : 'Bear';\n} elseif ($a[2] == $a[4]) {\n    echo $a[0] == $a[1] ? 'Elephant' : 'Bear';\n} else {\n    echo 'Alien';\n}"}, {"source_code": "<?php\n$a = explode(' ', fgets(STDIN));\nsort($a);\n$c = 0;\nfor ($i = 0; $i < 5; $i++) {\n    if ($a[$i] != $a[$i + 1]) {\n        $c++;\n    }\n}\nif ($c < 2) {\n    echo 'Elephant';\n} elseif ($c == 2) {\n    echo 'Bear';\n} else {\n    echo 'Alien';\n}\n"}, {"source_code": "<?php\n$a = explode(' ', trim(fgets(STDIN)));\nsort($a);\n\nif ($a[0] == $a[3]) {\n    echo $a[4] == $a[5] ? 'Elephant' : 'Bear';\n} elseif ($a[1] == $a[3]) {\n    echo $a[0] == $a[5] ? 'Elephant' : 'Bear';\n} elseif ($a[2] == $a[4]) {\n    echo $a[0] == $a[1] ? 'Elephant' : 'Bear';\n} else {\n    echo 'Alien';\n}"}, {"source_code": "<?php\n// 471A     \u041c\u0423\u0425 \u0438 \u043f\u0430\u043b\u043e\u0447\u043a\u0438  \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n$arr = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\nsort($arr);\n\nfor ($i=0; $i < 6; $i++) { \n    $count = substr_count($input_line, $arr[$i]);\n    if ($count> 3) {\n        for ($j=0; $j < 4 ; $j++) { \n            unset($arr[$i+$j]);\n        }\n        break;\n    }\n}\n\nif ($count > 3) {\n    if ($arr[0] === $arr[1]) {\n        echo \"Elephant\";\n    } else {\n        echo \"Bear\";\n    }\n} else {\n    echo \"Alien\";\n}\n\n?>"}], "src_uid": "43308fa25e8578fd9f25328e715d4dd6"}
{"nl": {"description": "Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word s.", "input_spec": "The first and only line contains the word s, which Vasya typed. This word consisits of small Latin letters, its length is no less that 1 and no more than 100 letters.", "output_spec": "If Vasya managed to say hello, print \"YES\", otherwise print \"NO\".", "sample_inputs": ["ahhellllloou", "hlelo"], "sample_outputs": ["YES", "NO"], "notes": null}, "positive_code": [{"source_code": "<?php\nwhile (fscanf(STDIN, \"%s\", $string)){\n    $length = strlen($string);\n    $s = 'hello';\n    $s_i = 0;\n    for ($i = 0; $i < $length; ++$i){\n        if ($s[$s_i] == $string[$i]){\n            if ($s[$s_i] == 'o'){\n                echo \"YES\\n\";\n                $s_i = -1;\n                break;\n            }\n            ++$s_i;\n        }\n    }\n    \n    if ($s_i != -1){\n        echo \"NO\\n\";\n    }        \n}"}, {"source_code": "<?php\nerror_reporting(\"off\");\n//58A: Chat room\n//I guess I'm bruteforcing. haha.\n$echoed = FALSE;\n$input = trim(fgets(STDIN)); //$input = \"o\";\nif (strpos($input, \"h\") === FALSE) {\n    echo \"NO\";\n    $echoed = TRUE;\n}\n$input = substr($input, strpos($input, \"h\"));\nif (strpos($input, \"e\") === FALSE) {\n    if ($echoed == FALSE) {\n        echo \"NO\";\n        $echoed = TRUE;\n    }\n}\n$input = substr($input, strpos($input, \"e\"));\nif (strpos($input, \"l\") === FALSE) {\n    if ($echoed == FALSE) {\n        echo \"NO\";\n        $echoed = TRUE;\n    }\n}\n$input = substr($input, strpos($input, \"l\") + 1); //doing it differently (not semantic (actually this whole program is not semantic)) by taking off that l too.\nif (strpos($input, \"l\") === FALSE) {\n    if ($echoed == FALSE) {\n        echo \"NO\";\n        $echoed = TRUE;\n    }\n}\n$input = substr($input, strpos($input, \"l\"));\nif (strpos($input, \"o\") === FALSE) {\n    if ($echoed == FALSE) {\n        echo \"NO\";\n        $echoed = TRUE;\n    }\n}\n\nif ($echoed === FALSE) {\n    echo \"YES\";\n}\n?>"}, {"source_code": "<?php\n\t$i = trim(fgets(STDIN));\n\tif(preg_match('/.*[hH]{1}.*[eE]{1}.*[lL]{1}.*[lL]{1}.*[oO]{1}.*/', $i) == 1){\n\t\techo \"YES\";\n\t} else {\n\t\techo \"NO\";\n\t}\n?>"}, {"source_code": "<?php\n\n$_trans = array(\n    'e{1,}' => 'e',\n    'h{1,}' => 'h',\n    'l{2,}' => 'll',\n    'o{1,}' => 'o',\n);\n$str = fgets(STDIN);\n$n = strlen($str);\n\nif (preg_match('/.*?h.*?e.*?l.*?l.*?o.*?/six', $str)) {\n    $str = 'YES';\n} else {\n    $str = 'NO';\n}\n\n\nfwrite(STDOUT, $str);"}, {"source_code": "<?php\n$hello = trim(fgets(STDIN));\necho preg_match(\"/.*h.*e.*l.*l.*o.*/\",$hello) ? \"YES\": \"NO\";\n?>"}, {"source_code": "<?=preg_match(\"/h.*e.*l.*l.*o/\", fgets(STDIN)) ? \"YES\" : \"NO\";?>\n\n"}, {"source_code": "<?=preg_match(\"/.*h.*e.*l.*l.*o.*/\", fgets(STDIN)) ? \"YES\" : \"NO\";?>\n\n"}, {"source_code": "<?\n\tdefine(\"_\", PHP_EOL);\n\t$MAX_N = PHP_INT_MAX;\n\t$L = trim(fgets(STDIN));\n\techo preg_match(\"/.*h.*e.*l.*l.*o.*/\", $L) ? \"YES\" : \"NO\";\n?>\n\n"}, {"source_code": "<?php\n$s = trim(fgets(STDIN));\n\necho preg_match(\"/.*h.*e.*l.*l.*o.*/\",$s) ? \"YES\": \"NO\";\n?>"}, {"source_code": "<?php\n\n\n$input = fopen('php://stdin', 'r');\nfscanf($input, \"%s\", $input);\n\n$search = 'hello';\n$searchArray = str_split($search);\n\n$inputArray = str_split($input);\n$dump = array();\nforeach($inputArray as $item)\n{\n    if($item == $searchArray[count($dump)])\n        array_push($dump, $item);\n}\n\n$diff1 = count(array_diff($dump, $searchArray));\n$diff2 = count(array_diff($searchArray, $dump));\n\nif($diff1 == 0 AND $diff2 == 0)\n    echo 'YES';\nelse\n    echo 'NO';\n"}, {"source_code": "<?php\n\t$input_line = trim(fgets(STDIN));\n\techo preg_match('/h.*e.*l.*l.*o/', $input_line)?\"YES\":\"NO\";\n?>"}, {"source_code": "<?php\nfscanf(STDIN, \"%s\", $arr);\n  $z = 0;\n  $x= array (\"h\", \"e\", \"l\", \"l\", \"o\");\n  for ($i = 0; $i < strlen($arr); $i++){\n \n      if ($arr[$i] == $x[$z])\n      $z = $z + 1;\n      \n     \n      \n  }\n if ($z == 5)\n echo (\"YES\");\n else \n echo (\"NO\");"}, {"source_code": "<?php\n    $input = trim(fgets(STDIN));\n    //$arr = explode(' ', $input);\n\n    if (strlen($input) < 5) {\n        echo 'NO';exit;\n    }\n\n    $a = ['h','e','l','l','o'];\n    $b = str_split($input);\n\n    foreach ($b as $v) {\n        if ($v == current($a)) {\n            array_shift($a);\n            if (count($a) === 0) {\n                echo 'YES';exit;\n            }\n        }\n    }\n\n    echo 'NO';exit;"}, {"source_code": "<?php\n        fscanf(STDIN, \"%s\",$s);\n        echo preg_match(\"/.*?h.*?e.*?l.*?l.*?o.*?/\",$s)?\"YES\":\"NO\";\n?>"}, {"source_code": "<?php\n    $str = trim(fgets(STDIN));\n   \n    $h = strpos($str, 'h');\n    $e = strpos($str, 'e', $h+1);\n    $l = strpos($str, 'l', $e+1);\n    $l2 = strpos($str, 'l', $l+1);\n    $o = strpos($str, 'o', $l2+1);\n    \n    if($h < $e && $e < $l && $l < $l2 && $l2 < $o) echo \"YES\";\n    else echo \"NO\";\n    \n?>"}, {"source_code": "<?php\n\nfunction dd(...$args)\n{\n    var_dump(...$args);\n    die;\n}\n\ndefine('TXTIN', fopen('input.txt', 'r'));\ndefine('TXTOUT', fopen('output.txt', 'w'));\n\n//$input = TXTIN;\n$input = STDIN;\n//$output = TXTOUT;\n$output = STDOUT;\n\nfunction foo($s)\n{\n    $h = $e = $l1 = $l2 = $o = false;\n\n    for ($i = 0; $i < strlen($s); $i++) {\n        if ($s[$i] === 'h' && !$h) {\n            $h = true;\n            continue;\n        }\n\n        if ($s[$i] === 'e' && !$e && $h) {\n            $e = true;\n            continue;\n        }\n\n        if ($s[$i] === 'l' && !$l1 && $h && $e) {\n            $l1 = true;\n            continue;\n        }\n\n        if ($s[$i] === 'l' && !$l2 && $h && $e && $l1) {\n            $l2 = true;\n            continue;\n        }\n\n        if ($s[$i] === 'o' && !$o && $h && $e && $l1 && $l2) {\n            $o = true;\n            continue;\n        }\n    }\n\n//    dd($h, $e, $l1, $l2, $o);\n    return $h && $e && $l1 && $l2 && $o;\n}\n\n$r = 0;\n\nlist($s) = fscanf($input, \"%s\\n\");\n\n$r = foo($s) ? 'YES' : 'NO';\n\nfwrite($output, $r);\n\n"}, {"source_code": "<?php\n$s = trim(fgets(STDIN));\n$res = preg_match('/[^h]*[h][^e]*[e][^l]*[l][^l]*[l][^o]*[o][\\w]*/', $s);\necho(($res?'YES':'NO'));\n"}, {"source_code": "<?\n$word = fopen(\"php://stdin\", 'r');\n$str = fread($word, 100);\n$pattern = \"/.*h.*e.*l.*l.*o/\";\n\nif (preg_match($pattern, $str) > 0){\n        echo \"YES\";\n} else {\n        echo \"NO\";\n}\n?>"}, {"source_code": "<?php echo preg_match('/h.*e.*l.*l.*o/si', fgets(STDIN)) ? 'YES' : 'NO';"}, {"source_code": "<?php\n$a=trim(fgets(STDIN));\n$b=\"hello\";\n$j=0;\nfor($i=0;$i<strlen($a);++$i)\n    if ($a[$i]==$b[$j])\n    {\n        $j++;\n        if ($j==5)\n            break;\n    }\nif ($j==5)\n    printf(\"YES\\n\");\nelse\n    printf(\"NO\\n\");\n?>"}, {"source_code": "<?php\n$s = str_split(readline());\n$test = ['h', 'e', 'l', 'l', 'o'];\n$i= 0;\nforeach($s as $letter){\n    if($letter == $test[$i]){\n        $i++;\n        if($i == 5){\n            break;\n        }\n    }\n}\n\nif($i == 5){\n    echo \"YES\";\n}else{\n    echo \"NO\";\n}"}, {"source_code": "<?php\n$line = str_split(strtolower(fgets(STDIN)),1);\n$hello = array(\"h\",\"e\",\"l\",\"l\",\"o\");\n$j=0;\nfor ($i=0;$i<count($line);$i++)\n{\n    if ($line[$i]==$hello[$j])\n    {\n        $j++;\n    }\n    if ($j==5)break;\n}\nif ($j<5)echo \"NO\";\nelse echo \"YES\";"}, {"source_code": "<?php\n\n$str = fgets(STDIN);\n$str_arr = preg_split('//', $str, -1, PREG_SPLIT_NO_EMPTY);\n$word = array('h','e','l','l','o');\n$i = 0;\n$j = 0;\n$k = 0;\n$ch = 0;\nfor ($i = 0; $i < count($word); $i++) {\n    for ($j = $k; $j < count($str_arr); $j++) {\n        if ($word[$i] == $str_arr[$j]) {\n            $k = $j + 1;\n            $ch = $ch + 1;\n            break;\n        } else {\n            //\n        }\n    }    \n}\nif ($ch == count($word)) {\n    print(\"YES\");\n} else {\n    print(\"NO\");\n}"}, {"source_code": "<?php\n\n    $s=trim(fgets(STDIN));\n    $h=strpos($s,'h');\n    $e=strpos($s,'e',$h);\n    $l1=strpos($s,'l',$e);\n    $l2=strpos($s,'l',$l1+1);\n    $o=strpos($s,'o',$l2);\n    if($h<$e && $e<$l1 && $l1<$l2 && $l2<$o) echo 'YES';\n    else echo 'NO';\n?>\n"}, {"source_code": "<?php\n$input=str_split(fgets(STDIN));\n$count=count($input);\nfor ($i=0; $i <$count;$i++) { \n      if($input[$i] == 'h'){\n            for ($j=$i+1; $j<$count;$j++) { \n                  if ($input[$j] == 'e') {\n                        for ($t=$j+1; $t <$count;$t++) { \n                              if ($input[$t] == 'l') {\n                                    for ($d=$t+1; $d <$count ; $d++) { \n                                          if ($input[$d] == 'l') {\n                                                for ($f=$d+1; $f <$count; $f++) { \n                                                      if ($input[$f] == 'o') {\n                                                            echo \"YES\";\n                                                            return false;\n                                                      }\n                                                }\n                                          }\n                                    }\n                              }\n                        }\n                  }\n            }\n      }\n}\necho \"NO\";\n?>"}, {"source_code": "<?php\n$line = fgets(STDIN);\necho (preg_match('/^.*h.*e.*l.*l.*o.*$/i', $line)) ? 'YES' : 'NO';\n?>"}, {"source_code": "<?php\n$str=trim(fgets(STDIN));\n$word=\"hello\";\n$j=0;\nfor ($i=0; $i <strlen($str) ; $i++)\n{\t\n\tif($str[$i]==$word[$j])\n    {\t\t\n\t\t//echo \"$str[$i] $word[$j]\\n\";\n\t\t$j++;\n     if($j==5)\n     \tbreak;\n\n\t}\n}\necho $j==5?\"YES\":\"NO\";"}, {"source_code": "<?php\n$f = fopen('php://stdin', 'r');\n//$f = fopen('test.txt', 'r');\n\n$s = trim(fgets($f));\npreg_match(\"/.*h.*e.*l.*l.*o.*/\",$s,$match);\n\nif (count($match)>0) echo \"YES\";\nelse echo \"NO\";\n\n\n\n"}, {"source_code": "<?php\n\nfscanf(STDIN, \"%s\\n\", $s);\n$s = strtolower($s);\n$chars = str_split($s, 1);\n\n$got_h = 0;\n$got_e = 0;\n$got_l = 0;\n$got_l2 = 0;\n$got_o = 0;\n\n$word_arr = array('h', 'e', 'l', 'l', 'o');\n$parsed_str = \"\";\n\nforeach ($chars as $char) {\n   if (in_array($char, $word_arr)){\n      $parsed_str .= $char;\n   }\n}\n# get rid of repeating h\n$parsed_str = preg_replace('/[h][h]*/', 'h', $parsed_str);\n# get rid of repeating e\n$parsed_str = preg_replace('/[e][e]*/', 'e', $parsed_str);\n# get rid of repeating l (more than 2)\n$parsed_str = preg_replace('/[l][l][l]*/', 'll', $parsed_str);\n# get rid of repeating o\n$parsed_str = preg_replace('/[o][o]*/', 'o', $parsed_str);\n\n//echo $parsed_str . \"\\n\";\n\nif ($parsed_str == 'hello') {\n   echo \"YES\";\n}\nelse {\n   $parsed_chars = str_split($parsed_str, 1);\n   $pword_arr = array(\"h\" => 0, \"e\" => 0, \"l\" => 0, \"o\" => 0);\n   foreach ($parsed_chars as $pchar) {\n      if ($pchar == 'h' && $got_h == 0) {\n         //echo \"found first h\\n\";\n         $got_h = 1;\n         $got_e = 0;\n         $got_l = 0;\n         $got_l2 = 0;\n         $got_o = 0;\n        continue;\n      }\n\n      if ($pchar == 'e' && $got_h && !$got_e) {\n         //echo \"found first e\\n\";\n         $got_e = 1;\n        continue;\n      }\n\n      if ($pchar == 'l' && $got_h && $got_e && !$got_l){\n         //echo \"found first l\\n\";\n         $got_l = 1;\n        continue;\n      }\n\n      if ($pchar == 'l' && $got_h && $got_e && $got_l && !$got_l2) {\n         //echo \"found second l\\n\";\n         $got_l2 = 1;\n        continue;\n      }\n\n      if ($pchar == 'o' && $got_h && $got_e && $got_l && $got_l2 && !$got_o) {\n         //echo \"found first o\\n\";\n         $got_o = 1;\n        continue;\n      }\n   }\n\n   if ($got_h && $got_e && $got_l && $got_l2 && $got_o) {\n      echo \"YES\";\n   }\n   else {\n      echo \"NO\";\n   }\n}\n?>\n"}, {"source_code": "<?php\n$text = file_get_contents(\"php://stdin\");\necho preg_match(\"/h.*e.*l[^l]*l.*o/\", $text)?\"YES\":\"NO\";\n"}, {"source_code": "<?\n    $a=fgets(STDIN);\n    $b=\"hello\";\n$s=0;\n    for($i=0;$i<strlen($a);$i++)\n    {\n        if($a[$i]==$b[$s]) $s++;\n    if($s==5) break;\n    }\n    if($s==5)\n    printf(\"YES\");\n    else\n        printf(\"NO\");\n?>"}, {"source_code": "<?php\n$j = 0;\n$s = trim(fgets(STDIN));\n$t = array(\"h\", \"e\", \"l\", \"l\", \"o\");\nfor($i = 0; $i < strlen($s); $i++) {\n\tif($s[$i] == $t[$j]) {\n\t\t++$j;\n\t}\n}\n\nif($j == 5) {\n\techo \"YES\";\n}\nelse {\n\techo \"NO\";\n}"}, {"source_code": "<?php\n\n    $s=trim(fgets(STDIN));\n    $h=strpos($s,'h');\n    $e=strpos($s,'e',$h);\n    $l1=strpos($s,'l',$e);\n    $l2=strpos($s,'l',$l1+1);\n    $o=strpos($s,'o',$l2);\n    if($h<$e && $e<$l1 && $l1<$l2 && $l2<$o) echo 'YES';\n    else echo 'NO';\n?>\n"}, {"source_code": "<?php\n$str = fgets(STDIN);\n\nif (preg_match('/h.*e.*l.*l.*o/', $str))\n{\n    echo 'YES';\n}\nelse\n{\n    echo 'NO';\n}"}, {"source_code": "<?php\n$s = trim(fgets(STDIN));\necho (preg_match(\"/h.*e.*l.*l.*o/\", $s) ? \"YES\" : \"NO\");\n?>"}, {"source_code": "<?\n    $a=fgets(STDIN);\n    $b=\"hello\";\n$s=0;\n    for($i=0;$i<strlen($a);$i++)\n    {\n        if($a[$i]==$b[$s]) $s++;\n    if($s==5) break;\n    }\n    if($s==5)\n    printf(\"YES\");\n    else\n        printf(\"NO\");\n?>"}, {"source_code": "<?php\n$a=trim(fgets(STDIN));\nif( preg_match('/.*h.*e.*l.*l.*o.*/',$a) ) echo \"YES\"; else echo \"NO\";\n\n?>"}, {"source_code": "<?php\n    echo preg_match('/h.*e.*l.*l.*o/', file_get_contents('php://stdin')) ? 'YES' : 'NO';\n?>"}, {"source_code": "<?php\n$input = explode(\"\\n\", trim(file_get_contents(\"php://stdin\")));\necho preg_match('/h{1}(\\w)*?e{1}(\\w)*?l{1}(\\w)*?l{1}(\\w)*?o{1}(\\w)*?/', $input[0]) ? 'YES' : 'NO';"}, {"source_code": "<?php\n\n//First Get The Input.\n$input = file_get_contents(\"php://stdin\");\n\nfunction func ($input) {\n    \n    //\"hello\" Word.\n    $word = \"hello\";\n    \n    //Current Index.\n    $current_index = 0;\n    \n    //Loop Inside The Given String.\n    for($i = 0;$i < strlen($input);$i++) {\n        \n        if($word[$current_index] == $input[$i]) {\n            \n            $current_index++;\n            \n        }\n        \n    }\n    \n    if($current_index >= strlen($word)) {\n        \n        return \"YES\";\n        \n    }else {\n        \n        return \"NO\";\n        \n    }\n\n}\n\necho func($input);\n\n?>"}, {"source_code": "<?php\n$s = trim(fgets(STDIN));\necho (preg_match(\"/h.*e.*l.*l.*o/\", $s) ? \"YES\" : \"NO\");\n\n?>"}, {"source_code": "<?php\n// 58A \u0427\u0430\u0442 \n\n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n\nif (preg_match(\"/.*h.*e.*l.*l.*o.*/i\", $input_line)) {\n//if (preg_match(\"/[.]*h[.]*e[.]*l[.]*l[.]*o[.]*/U\", $input_line)) {\n    echo \"YES\";\n} else {\n    echo \"NO\";\n}\n\n?>"}, {"source_code": "<?php\n// 58A \u0427\u0430\u0442 \n\n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n\nif (preg_match(\"/.*?h.*?e.*?l.*?l.*?o.*?/i\", $input_line)) {\n//if (preg_match(\"/[.]*h[.]*e[.]*l[.]*l[.]*o[.]*/U\", $input_line)) {\n    echo \"YES\";\n} else {\n    echo \"NO\";\n}\n\n?>\n"}, {"source_code": "<?php\n// 58A \u0427\u0430\u0442 \n\n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n\nif (preg_match(\"/[.]*?h.*?e.*?l.*?l.*?o.*?/i\", $input_line)) {\n//if (preg_match(\"/[.]*h[.]*e[.]*l[.]*l[.]*o[.]*/U\", $input_line)) {\n    echo \"YES\";\n} else {\n    echo \"NO\";\n}\n\n?>"}, {"source_code": "<?php\n    $str = trim(fgets(STDIN));\n    echo (preg_match(\"/[a-z]*h[a-z]*e[a-z]*l[a-z]*l[a-z]*o[a-z]*/\", $str) ? \"YES\" : \"NO\");\n?>"}, {"source_code": "<?php\n\tfscanf(STDIN, \"%s\",$s);\n\techo preg_match(\"/.*?h.*?e.*?l.*?l.*?o.*?/\",$s)?\"YES\":\"NO\";\n?>"}, {"source_code": "<?php\n$str=trim(fgets(STDIN));\nfunction hellow($str){\n    preg_match(\"/h.*?e.*?l.*?l.*?o/\",$str,$m);\n    if(!empty($m)) return \"YES\";\n    return \"NO\";\n}\necho hellow($str);\n?>"}, {"source_code": "<?php\n\nfscanf(STDIN, '%s\\n', $s);\n$line = str_split($s);\n$counter = 0;\n\n$wordToFind = 'hello';\n$letterToFind = $wordToFind[0];\n\nfor($i = 0; $i < count($line); $i++) {\n\tif($line[$i] == $letterToFind) {\n\t\t$counter++;\n\t\t$letterToFind = $wordToFind[$counter];\n\t}\n}\n\nif ($counter == 5) {\n\tprintf('YES');\n} else {\n\tprintf('NO');\n}\n"}, {"source_code": "<?php\nfscanf(STDIN, '%s', $s);\n\n$arr = array('h', 'e', 'l', 'l', 'o');\n$k = 0;\nfor ($i = 0; $i < strlen($s); $i++) {\n    if ( $k < count($arr) AND $s[$i] == $arr[$k]) {\n        $k++;\n    }\n}\n\necho ($k == count($arr)) ? 'YES' : 'NO';\n"}, {"source_code": "<?php\n   fscanf(STDIN, \"%s\", $str);\n      \n   $hello = \"hello\";\n   $n = 0;\n   \n   for($i = 0; $i < strlen($str); $i++)\n      if($str[$i] == $hello[$n]) $n++;\n   \n   \n   \n   if ($n == 5) echo(\"YES\");\n   else echo(\"NO\");\n?>"}, {"source_code": "<?php\nerror_reporting(0);\nfscanf(STDIN, \"%s\", $type);\n$base = \"hello\";\n$count = 0;\n$a = 0;\nfor ($i = 0; $i < strlen($type); $i++) {\n    if ($type[$i] == $base[$a]) {\n        $a++;\n        $count++;\n    }\n}\nif ($count == 5) {\n    echo \"YES\\n\";\n} else {\n    echo \"NO\\n\";\n}\n"}, {"source_code": "<?php\nfscanf(STDIN,'%s', $s);\n$a = 'hello';\n$count = 0;\nfor ($i=0;$i<strlen($s);$i++){\n    if ($s[$i] == $a[$count]){\n        $count++;\n        if($count == 5)\n            break;\n    }\n}\nif ($count == 5)\n    echo 'YES';\nelse\n    echo 'NO';\n?>"}, {"source_code": "<?\n$s=trim(fgets(STDIN));\n$h= stripos($s,\"h\");\n$e= stripos(substr($s,$h),\"e\");\n$l= stripos(substr($s,$h+$e),\"l\");\n$l2= stripos(substr($s,$h+$e+$l+1),\"l\");\n$o= stripos(substr($s,$h+$e+$l+$l2+1),\"o\");\nIf($h === false or $e === false or $l === false or $l2 === false or $o === false)echo \"NO\";\nelse echo \"YES\";\n?>"}, {"source_code": "<?php\n$s = trim(fgets(STDIN));\n\nprint preg_match('/h.*e.*l.*l.*o/',$s,$o)?'YES':'NO';\n?>"}, {"source_code": "<?php\nerror_reporting(-1);\n\nif (preg_match('/h.*e.*l.*l.*o/', file_get_contents('php://stdin')))\n\techo 'YES', PHP_EOL;\nelse\n\techo 'NO', PHP_EOL;\n"}, {"source_code": "<?php\nwhile(fscanf(STDIN,\"%s\",$str)){\n    $len = strlen($str);\n    $key = \"hello\";\n    $k = 0;\n    $a = 0;\n    for($i = 0; $i < $len; ++$i){\n        if($str[$i] == $key[$k])\n            ++$k;\n        if($k == 5){\n            echo \"YES\\n\";\n            break;\n        }\n    }\n    if($k != 5)\n      echo \"NO\\n\";\n}\n"}, {"source_code": "<?php\n$cin = fopen('php://stdin', 'r');\n\nfscanf($cin, \"%s\", $str);\n\n$hello = \"hello\";\n$idx = 0; $i = 0;\n\nwhile($idx < strlen($hello) && $i < strlen($str)){\n    if($hello[$idx] == $str[$i]) $idx++;\n    $i++;\n}\n\necho ($idx >= strlen($hello) ? \"YES\" : \"NO\");\n\n?>"}, {"source_code": "<?\n$fp=fopen('php://stdin', 'r');\n$lines=stream_get_contents($fp);\n\n$lines=trim($lines);\n\n\n$tpl=\"hello\";\n\n$ok=true;\n$i=-1;\n$n=0;\nwhile (++$i<strlen($lines))\n{\n    $char=$lines{$i};\n    if ($char==$tpl{$n})\n        $n++;\n    if ($n==strlen($tpl))\n    {\n        echo 'YES';\n        die;\n        break;\n    }\n}\n\necho 'NO';\n?>"}, {"source_code": "<?php\n$line = fgets(STDIN);\necho preg_match(\"/.*h.*e.*l.*l.*o.*/\",$line)?\"YES\":\"NO\";\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\n$c = 0;\n$d = 0;\nfor($x = 0; $x < count($b); $x++)\n{\n    if(($c == 0) && ($b[$x] == \"h\"))\n    {\n        $d = 1;\n        $c = 1;\n    }\n    elseif(($c == 1) && ($b[$x] == \"e\"))\n    {\n        $d = 2;\n        $c = 2;\n    }\n    elseif(($c == 2) && ($b[$x] == \"l\"))\n    {\n        $d = 3;\n        $c = 3;\n    }\n    elseif(($c == 3) && ($b[$x] == \"l\"))\n    {\n        $d = 4;\n        $c = 4;\n    }\n    elseif(($c == 4) && ($b[$x] == \"o\"))\n    {\n        $d = 5;\n    }\n}\nif($d == 5)\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\n\t$var = str_split(fgets(STDIN));\n\t$flag = 0;\n\t$comp = array('h','e','l','l','o');\n\tforeach ($var as $v) {\n\t\tif ($v == $comp[$flag]) {\n\t\t\t$flag++;\n\t\t}\n\t\tif ($flag == 5) break;\n\t}\n\tif ($flag == 5) echo 'YES';\n\telse echo 'NO';\n\t"}], "negative_code": [{"source_code": "<?php\nwhile (fscanf(STDIN, \"%s\", $string)){\n    $length = strlen($string);\n    $s = 'hello';\n    $s_i = 0;\n    for ($i = 0; $i < $length; ++$i){\n        if ($s[$s_i] == $string[$i]){\n            if ($s[$s_i] == 'o'){\n                echo \"YES\\n\";\n                break;\n            }\n            ++$s_i;\n        }\n    }\n    if ($s_i != 4){\n        echo \"NO\\n\";\n    }    \n}"}, {"source_code": "<?php\nerror_reporting(\"off\");\n//58A: Chat room\n//I guess I'm bruteforcing. haha.\n$echoed = FALSE;\n$input = trim(fgets(STDIN)); //$input = \"hlelo\";\nif (strpos($input, \"h\") === FALSE) {\n    echo \"NO\";\n    $echoed = TRUE;\n}\n$input = substr($input, strpos($input, \"h\"));\nif (strpos($input, \"e\") === FALSE) {\n    echo \"NO\";\n    $echoed = TRUE;\n}\n$input = substr($input, strpos($input, \"e\"));\nif (strpos($input, \"l\") === FALSE) {\n    echo \"NO\";\n    $echoed = TRUE;\n}\n$input = substr($input, strpos($input, \"l\") + 1); //doing it differently (not semantic (actually this whole program is not semantic)) by taking off that l too.\nif (strpos($input, \"l\") === FALSE) {\n    echo \"NO\";\n    $echoed = TRUE;\n}\n$input = substr($input, strpos($input, \"l\"));\nif (strpos($input, \"o\") === FALSE) {\n    echo \"NO\";\n    $echoed = TRUE;\n}\n\nif ($echoed === FALSE) {\n    echo \"YES\";\n}\n?>"}, {"source_code": "<?php\nerror_reporting(\"off\");\n//58A: Chat room\n//I guess I'm bruteforcing. haha.\n$no = FALSE;\n\n$input = trim(fgets(STDIN)); //$input = \"hlelo\";\nif (strpos($input, \"h\") === FALSE) {\n    $no == TRUE;\n}\n$input = substr($input, strpos($input, \"h\"));\nif (strpos($input, \"e\") === FALSE) {\n    $no == TRUE;\n}\n$input = substr($input, strpos($input, \"e\"));\nif (strpos($input, \"l\") === FALSE) {\n    $no == TRUE;\n}\n$input = substr($input, strpos($input, \"l\") + 1); //doing it differently (not semantic (actually this whole program is not semantic)) by taking off that l too.\nif (strpos($input, \"l\") === FALSE) {\n    $no == TRUE;\n}\n$input = substr($input, strpos($input, \"l\"));\nif (strpos($input, \"o\") === FALSE) {\n    $no == TRUE;\n}\n\nif ($no === TRUE) {\n    echo \"NO\";\n} else {\n    echo \"YES\";\n}\n?>"}, {"source_code": "<?php\n\t$i = fgets(STDIN);\n\tif(preg_match('.*[hH]{1}.*[eE]{1}.*[lL]{1}.*[lL]{1}.*[oO]{1}.*', $i)){\n\t\techo \"YES\";\n\t} else {\n\t\techo \"NO\";\n\t}\n?>"}, {"source_code": "<?php\n\t$i = trim(fgets(STDIN));\n\tif(preg_match('.*?[hH]{1}.*?[eE]{1}.*?[lL]{1}.*?[lL]{1}.*?[oO]{1}.*?', $i) == 1){\n\t\techo \"YES\";\n\t} else {\n\t\techo \"NO\";\n\t}\n?>"}, {"source_code": "<?php\n\t$i = fgets(STDIN);\n\tif(preg_match('.*[hH]{1}.*[eE]{1}.*[lL]{1}.*[lL]{1}.*[oO]{1}.*', $i) == 1){\n\t\techo \"YES\";\n\t} else {\n\t\techo \"NO\";\n\t}\n?>"}, {"source_code": "<?php\n\t$input_line = trim(fgets(STDIN));\n\techo preg_match('/h*e*l*l*o/', $input_line)?\"YES\":\"NO\";\n?>"}, {"source_code": "<?php\n\t$input_line = trim(fgets(STDIN));\n\techo preg_match('/.h*.e*.l*.l*.o/', $input_line)?\"YES\":\"NO\";\n?>"}, {"source_code": "<?php\n    $str = trim(fgets(STDIN));\n   \n    $h = strpos($str, 'h');\n    $e = strpos($str, 'e');\n    $ll = strpos($str, 'll');\n    $o = strpos($str, 'o');\n    \n    if($h < $e && $e < $ll && $ll < $o) echo \"YES\";\n    else echo \"NO\";\n    \n?>"}, {"source_code": "<?php\n    $str = trim(fgets(STDIN));\n   \n    $h = strpos($str, 'h');\n    $e = strpos($str, 'e');\n    $l = strpos($str, 'l');\n    $l2 = strpos($str, 'l', $l+1);\n    $o = strpos($str, 'o');\n    \n    if($h < $e && $e < $l && $l < $l2 && $l2 < $o) echo \"YES\";\n    else echo \"NO\";\n    \n?>"}, {"source_code": "<?php\n$s = trim(fgets(STDIN));\nwhile(1) {\n    $s1 = preg_replace(array('/hh/','/ee/','/lll/','/oo/') , array('h','e','ll','o'), $s);\n    if(strcmp($s, $s1)===0) {\n        $s = $s1;\n        unset($s1);\n        break;\n    }\n    $s = $s1;\n}\nif(strlen(str_replace('hello', '', $s)) != strlen($s)) {\n    echo('YES');\n    exit(0);\n}\nelse {\n    echo('NO');\n}"}, {"source_code": "$word = fopen(\"php://stdin\", 'r');\n$pattern = \"/.*h.*e.*l.*l.*o/\";\n\nif (preg_match($pattern, $word) > 0){\n    echo \"YES\";\n} else {\n    echo \"NO\";\n}"}, {"source_code": "<?php\n$line = fgets(STDIN);\necho (preg_match('/^.*h.*e.*l.*l.*o.*$/i')) ? 'YES' : 'NO';\n?>"}, {"source_code": "<?php\n$str=trim(fgets(STDIN));\n$hello=\"hello\";\nfor($i=0;$i<strlen($hello);$i++)\n{\n\tfor($j=0;$j<strlen($str);$j++)\n\t{\n\t\tif($hello[$i]==$str[$j])\n\t\t{\n\t\t\t$count[$i]=$j;\n\t\t\tbreak;\n\t\t}\n\n\t}\n}\n\n$cnt=0;\nfor($i=0;$i<count($count)-1;$i++)\n{\n if($count[$i]>$count[$i+1]){\n \techo \"NO\";\n \tbreak;\n }\n else $cnt++;\n\n}\nif($cnt==4)\n\techo \"YES\";\n"}, {"source_code": "<?php\n$str=trim(fgets(STDIN));\nfor($i=0;$i<strlen($str)-1;$i++)\n{\n\t$str4[$i]=$str[$i].$str[$i+1];\n}\n//print_r($str4);\n\n$str3=\"hello\";\n$accumulate=\"\";\nfor($i=0;$i<strlen($str3)-1;$i++)\n{\n\t$str5[$i]=$str3[$i].$str3[$i+1];\n\t$accumulate.=$str5[$i];\n}\n//echo \"$accumulate\\n\";\n//print_r($str5);\n\n\n$str6=\"\";\nfor($i=0;$i<count($str5);$i++)\n{\n\tfor($j=0;$j<count($str4);$j++)\n\t{\n\t\tif($str5[$i]==$str4[$j])\n\t\t{\n          $str6.=$str4[$j];\n          break;\n\t\t}\n\t}\n}\n\nif($accumulate==$str6)\n\techo \"YES\";\nelse\n\techo \"NO\";"}, {"source_code": "<?php\n\nfscanf(STDIN, \"%s\\n\", $s);\n$s = strtolower($s);\n$chars = str_split($s, 1);\n\n$got_h = 0;\n$got_e = 0;\n$got_l = 0;\n$got_l2 = 0;\n$got_o = 0;\n\n$word_arr = array('h', 'e', 'l', 'l', 'o');\n$parsed_str = \"\";\n\nforeach ($chars as $char) {\n   if (in_array($char, $word_arr)){\n      $parsed_str .= $char;\n   }\n}\n# get rid of repeating h\n$parsed_str = preg_replace('/[h][h]*/', 'h', $parsed_str);\n# get rid of repeating e\n$parsed_str = preg_replace('/[e][e]*/', 'e', $parsed_str);\n# get rid of repeating l (more than 2)\n$parsed_str = preg_replace('/[l][l][l]*/', 'll', $parsed_str);\n# get rid of repeating o\n$parsed_str = preg_replace('/[o][o]*/', 'o', $parsed_str);\n\nif ($parsed_str == 'hello') {\n   echo \"YES\";\n}\nelse {\n   echo \"NO\";\n}\n?>\n"}, {"source_code": "<?php\n\nfscanf(STDIN, \"%s\\n\", $s);\n$s = strtolower($s);\n$chars = str_split($s, 1);\n\n$got_h = 0;\n$got_e = 0;\n$got_l = 0;\n$got_l2 = 0;\n$got_o = 0;\n\n$word_arr = array('h', 'e', 'l', 'l', 'o');\n$parsed_str = \"\";\n\nforeach ($chars as $char) {\n   if (in_array($char, $word_arr)){\n      $parsed_str .= $char;\n   }\n}\n# get rid of repeating h\n$parsed_str = preg_replace('/[h][h]*/', 'h', $parsed_str);\n# get rid of repeating e\n$parsed_str = preg_replace('/[e][e]*/', 'e', $parsed_str);\n# get rid of repeating l (more than 2)\n$parsed_str = preg_replace('/[l][l][l]*/', 'll', $parsed_str);\n# get rid of repeating o\n$parsed_str = preg_replace('/[o][o]*/', 'o', $parsed_str);\n\n//echo $parsed_str . \"\\n\";\n\nif ($parsed_str == 'hello') {\n   echo \"YES\";\n}\nelse {\n   $parsed_chars = str_split($parsed_str, 1);\n   $pword_arr = array(\"h\" => 0, \"e\" => 0, \"l\" => 0, \"o\" => 0);\n   foreach ($parsed_chars as $pchar) {\n      if ($pchar == 'h' && $got_h == 0) {\n         //echo \"found first h\\n\";\n         $got_h = 1;\n         $got_e = 0;\n         $got_l = 0;\n         $got_l2 = 0;\n         $got_o = 0;\n      }\n\n      if ($pchar == 'e' && $got_h && !$got_e) {\n         //echo \"found first e\\n\";\n         $got_e = 1;\n      }\n\n      if ($pchar == 'l' && $got_h && $got_e && !$got_l){\n         //echo \"found first l\\n\";\n         $got_l = 1;\n      }\n\n      if ($pchar == 'l' && $got_h && $got_e && $got_l && !$got_l2) {\n         //echo \"found second l\\n\";\n         $got_l2 = 1;\n      }\n\n      if ($pchar == 'o' && $got_h && $got_e && $got_l && $got_l2 && !$got_o) {\n         //echo \"found first o\\n\";\n         $got_o = 1;\n      }\n   }\n\n   if ($got_h && $got_e && $got_l && $got_l2 && $got_o) {\n      echo \"YES\";\n   }\n   else {\n      echo \"NO\";\n   }\n}\n?>\n"}, {"source_code": "<?php\n$text = file_get_contents(\"php://stdin\");\npreg_match(\"/h.*e.*l[^l]*l.*o/\", $text);\n"}, {"source_code": "<?php\n$h = fopen(\"php://input\");\necho fgets($h);"}, {"source_code": "<?php\n$stdin = file_get_contents('php://stdin');\necho preg_match('/h+.*e+.*(:?ll+)|(:?l+.*l+).*o+.*u+/', $stdin) ? \"YES\" : \"NO\";"}, {"source_code": "<?php\n$str = file_get_contents(\"php://input\");\nif(preg_match('/h+e+l+o+u+/', $str)) print(\"YES\");\nelse print(\"NO\");"}, {"source_code": "<?php\n$stdin = file_get_contents('php://stdin');\necho preg_match('/h+.*e+.*(:?(:?ll+)|(:?l+.*l+)).*o+.*u+/', $stdin) ? \"YES\" : \"NO\";"}, {"source_code": "<?php\necho file_get_contents(\"php://input\");"}, {"source_code": "<?php\n$stdin = file_get_contents('php://stdin');\necho preg_match('/h+e+l+l+o+u+/', $stdin) ? \"YES\" : \"NO\";"}, {"source_code": "<?php\n$stdin = file_get_contents('php://stdin');\necho $stdin;"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\necho (preg_match(\"/h.*e.*l.*l.*o/\", $s) ? \"YES\" : \"NO\");\n?>"}, {"source_code": "<?php\n$input = explode(\"\\n\", trim(file_get_contents(\"php://stdin\")));\necho preg_match('/h{1,}e{1,}l{2,}o{1,}/', $input[0]) ? 'YES' : 'NO';"}, {"source_code": "<?php\n$s = trim(fgets(STDIN));\necho preg_match(\"/h . *e . *l . *l. *o/\", $s) ? \"YES\" : \"NO\";\n\n?>"}, {"source_code": "<?php\n$s = strtolower(trim(fgets(STDIN)));\n$i=0;\n$h=strpos($s, \"h\");\nif ($h) {\n\t$e=strpos( substr($s, $h+1) , \"e\");\n\tif ($e) {\n\t\t$e=$e+$h+1;\n\t\t$l1=strpos( substr($s, $e+1) , \"l\");\n\t\tif($l1){\n\t\t\t$l1=$l1+$e+1;\n\t\t\t$l2=strpos( substr($s, $l1+1) , \"l\");\n\t\t\tif ($l2) {\n\t\t\t\t$l2=$l2+$l1+1;\n\t\t\t\t$o=strpos( substr($s, $l2+1) , \"o\");\n\t\t\t\tif ($o) {\n\t\t\t\t\t$o=$o+$l2+1;\n\t\t\t\t\techo \"YES\";\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nif (!$h || !$e || !$l1 || !$l2 || !$o){\n\techo \"NO\";\n}\n\n?>"}, {"source_code": "<?php\n$s = strtolower(trim(fgets(STDIN)));\n$i=0;\n$h=strpos($s, \"h\");\n$e=strpos($s, \"e\");\n$l1=strpos($s, \"l\");\n$o=strpos($s, \"o\");\nif ($h < $e){\n\tif ($e < $l1) {\n\t\t$i=$l1+1;\n\t\t$l2=strpos( substr($s, $i) , \"l\");\n\t\t$l2=$l2+$i;\n\t}else{\n\t\techo \"NO\";\n\t}\n}else{\n\techo \"NO\";\n}\n\nif ($h < $e && $e < $l1 && $l1 < $l2  && $l2 < $o){\n\techo \"YES\";\n}else{\n\techo \"NO\";\n}\n\n\n?>"}, {"source_code": "<?php\n$s = strtolower(trim(fgets(STDIN)));\n$i=0;\n$h=strpos($s, \"h\");\n$e=strpos( substr($s, $h+1) , \"e\");\n$e=$e+$h+1;\n$l1=strpos( substr($s, $e+1) , \"l\");\n$l1=$l1+$e+1;\n$l2=strpos( substr($s, $l1+1) , \"l\");\n$l2=$l2+$l1+1;\n$o=strpos( substr($s, $l2+1) , \"o\");\n$o=$o+$l2+1;\n\nif ($h < $e && $e < $l1 && $l1 < $l2  && $l2 < $o){\n\techo \"YES\";\n}else{\n\techo \"NO\";\n}\n\n?>"}, {"source_code": "<?php\n$s = strtolower(trim(fgets(STDIN)));\n$i=0;\n$h=strpos($s, \"h\");\n$e=strpos($s, \"e\");\n$l1=strpos($s, \"l\");\n$o=strpos($s, \"o\");\nif ($h < $e){\n\tif ($e < $l1) {\n\t\t$i=$l1+1;\n\t\t$l2=strpos( substr($s, $i) , \"l\");\n\t\t$l2=$l2+$i;\n\t\tif ($h < $e && $e < $l1 && $l1 < $l2  && $l2 < $o){\n\t\t\techo \"YES\";\n\t\t}else{\n\t\t\techo \"NO\";\n\t\t}\n\t}else{\n\t\techo \"NO\";\n\t}\n}else{\n\techo \"NO\";\n}\n\n?>"}, {"source_code": "<?php\n// 58A \u0427\u0430\u0442 \n\n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n\nif (preg_match(\"/[.]*h[.]*e[.]*l[.]*l[.]*o[.]*/i\", $input_line)) {\n//if (preg_match(\"/[.]*h[.]*e[.]*l[.]*l[.]*o[.]*/U\", $input_line)) {\n    echo \"YES\";\n} else {\n    echo \"NO\";\n}\n\n?>"}, {"source_code": "<?php\n// 58A \u0427\u0430\u0442 \n\n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n\nif (preg_match(\"/[.]*h[.]*e[.]*l[.]*l[.]*o[.]*/iU\", $input_line)) {\n    echo \"YES\";\n} else {\n    echo \"NO\";\n}\n\n\n?>\n"}, {"source_code": "<?php\n// 58A \u0427\u0430\u0442 \n\n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n\nif (preg_match(\"/[.]*h[.]*e[.]*l[.]*l[.]*o[.]*/i\", $input_line)) {\n    echo \"YES\";\n} else {\n    echo \"NO\";\n}\n\n?>"}, {"source_code": "<?php\n// 58A \u0427\u0430\u0442 \n\n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n\nif (preg_match(\"/[.]*h[.]*e[.]*l[.]*l[.]*o[.]*/\", $input_line)) {\n    echo \"YES\";\n} else {\n    echo \"NO\";\n}\n\n?>"}, {"source_code": "<?php\n$str=trim(fgets(STDIN));\nfunction hellow($str){\n    preg_match(\"/h{1,}e{1,}l{2,}o{1,}/\",$str,$m);\n    if(!empty($m)) return \"YES\";\n    return \"NO\";\n}\necho hellow($str);\n?>"}, {"source_code": "<?php\nfscanf(STDIN, '%s\\n', $s);\n$line = str_split($s);\n$counter = 0;\n\nfor($i = 0; $i < count($line); $i++){\n\tif($line[$i] == 'h'){\n\t\t$counter++;\n\n\t\tif($line[$i + 1] == 'h' || $line[$i+1] == 'e'){\n\t\t\t$counter++;\n\n\t\t\tif($line[$i + 2] == 'e' || $line[$i + 2] == 'l'){\n\t\t\t\t$counter++;\n\n\t\t\t\tif($line[$i + 3] == 'l'){\n\t\t\t\t\t$counter++;\n\n\t\t\t\t\tif($line[$i + 4] == 'l' || $line[$i + 4] == '0'){\n\t\t\t\t\t\t$counter++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n}\n\n\n\nif ($counter >= 4) {\n\tprintf(\"YES\");\n}else{\n\tprintf(\"NO\");\n}"}, {"source_code": "<?php\nfscanf(STDIN, '%s\\n', $s);\n$line = str_split($s);\n$counter = 0;\n\nfor($i = 0; $i < count($line); $i++){\n\tif($line[$i] == 'h'){\n\t\t$counter++;\n\t\tif($line[$i++] == 'h' || $line[$i++] == 'e'){\n\t\t\t$counter++;\n\t\t\t$i++;\n\t\t\tif($line[$i++] == 'e' || $line[$i++] == 'l'){\n\t\t\t\t$counter++;\n\t\t\t\t$i++;\n\t\t\t\tif($line[$i++] == 'l'){\n\t\t\t\t\t$counter++;\n\t\t\t\t\t$i++;\n\t\t\t\t\tif ($line[$i++] == 'l' || $line[$i++] == 'o') {\n\t\t\t\t\t\t$counter++;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n}\nif ($counter >= 4) {\n\tprintf(\"YES\");\n}else{\n\tprintf(\"NO\");\n}"}, {"source_code": "<?php\nfscanf(STDIN, '%s\\n', $s);\n$line = str_split($s);\n$counter = 0;\n\nfor($i = 0; $i < count($line); $i++){\n\tif($line[$i] == 'h'){\n\t\t$counter++;\n\n\t\tif($line[$i + 1] == 'h' || $line[$i+1] == 'e'){\n\t\t\t$counter++;\n\n\t\t\tif($line[$i + 2] == 'e' || $line[$i + 2] == 'l'){\n\t\t\t\t$counter++;\n\n\t\t\t\tif($line[$i + 3] == 'l'){\n\t\t\t\t\t$counter++;\n\n\t\t\t\t\tif($line[$i + 4] == 'l' || $line[$i + 4] == 'o'){\n\t\t\t\t\t\t$counter++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n}\n\n\n\nif ($counter >= 4) {\n\tprintf(\"YES\");\n}else{\n\tprintf(\"NO\");\n}"}, {"source_code": "<?php\nfscanf(STDIN, '%s', $s);\n\n$arr = array('h', 'e', 'l', 'o');\nfor ($i = 0; $i < strlen($s); $i++) {\n    $flag = false;\n    for ($j = 0; $j < count($arr); $j++) {\n        if ($s[$i] == $arr[$j]) $flag = !$flag;\n    }\n\n    if (!$flag) {\n        echo 'YES';\n        return;\n    }\n}\n\necho 'NO';\n"}, {"source_code": "<?php\nerror_reporting(0);\nfscanf(STDIN, \"%s\", $str);\nif (strlen($str) > 0) {\n    $arr = str_split($str);\n    $unique_arr = array_unique($arr);\n    $unique_str = implode('', $unique_arr);\n    if (preg_match('/helo/', $unique_str)) {\n        echo \"YES\\n\";\n    } else {\n        echo \"NO\\n\";\n    }\n}\n"}, {"source_code": "<?php\nwhile(fscanf(STDIN,\"%s\",$str)){\n    $len = strlen($str);\n    $key = \"hello \";\n    $k = 0;\n    $a = 0;\n    for($i = 0; $i < $len; ++$i){\n        if(!$a && $str[$i] == $key[$k]){\n                $a = 1;\n            }\n        elseif($a && $str[$i] == $key[$k+1]){\n            ++$k;\n            }\n        elseif($a && $str[$i] != $key[$k])\n            break;\n    }\n    if($k == 4)\n        echo \"YES\\n\";\n    else \n        echo \"NO\\n\";\n\n}\n"}, {"source_code": "<?php\nwhile (fscanf(STDIN, \"%s\", $string)){\n    $length = strlen($string);\n    $s = 'hello';\n    $s_i = 0;\n    for ($i = 0; $i < $length; ++$i){\n        if ($s[$s_i] == $string[$i]){\n            if ($s[$s_i] == 'o'){\n                echo \"YES\\n\";\n                $s_i = -1;\n                break;\n            }\n            ++$s_i;\n        }\n    }\n    echo $s_i;\n    \n    if ($s_i != -1){\n        echo \"NO\\n\";\n    }        \n}"}, {"source_code": "<?php\nwhile (fscanf(STDIN, \"%s\", $string)){\n    $length = strlen($string);\n    $s = 'hello';\n    $s_i = 0;\n    for ($i = 0; $i < $length; ++$i){\n        if ($s[$s_i] == $string[$i]){\n            if ($s[$s_i] == 'o'){\n                echo \"YES\\n\";\n                $s_i = -1;\n                break;\n            }\n            ++$s_i;\n        }\n    }\n    if ($s_i != 4 && $s_i != -1){\n        echo \"NO\\n\";\n    }        \n}"}, {"source_code": "<?php\n\t$var = implode('',array_unique(str_split(fgets(STDIN))));\n\tif (substr_count($var, 'helo')) echo 'YES';\n\telse echo 'NO';\n\t"}, {"source_code": "<?php\n\n$_trans = array(\n    'e{1,}' => 'e',\n    'h{1,}' => 'h',\n    'l{2,}' => 'll',\n    'o{1,}' => 'o',\n);\n$str = fgets(STDIN);\nforeach ($_trans as $p => $r) {\n    $str = preg_replace('/' . $p . '/i', $r, $str);\n}\nif (strpos($str, 'hello') !== false) {\n    $str = 'YES';\n} else {\n    $str = 'NO';\n}\nfwrite(STDOUT, $str);"}], "src_uid": "c5d19dc8f2478ee8d9cba8cc2e4cd838"}
{"nl": {"description": "Tomorrow Peter has a Biology exam. He does not like this subject much, but d days ago he learnt that he would have to take this exam. Peter's strict parents made him prepare for the exam immediately, for this purpose he has to study not less than minTimei and not more than maxTimei hours per each i-th day. Moreover, they warned Peter that a day before the exam they would check how he has followed their instructions.So, today is the day when Peter's parents ask him to show the timetable of his preparatory studies. But the boy has counted only the sum of hours sumTime spent him on preparation, and now he wants to know if he can show his parents a timetable s\u0441hedule with d numbers, where each number s\u0441hedulei stands for the time in hours spent by Peter each i-th day on biology studies, and satisfying the limitations imposed by his parents, and at the same time the sum total of all schedulei should equal to sumTime.", "input_spec": "The first input line contains two integer numbers d,\u2009sumTime (1\u2009\u2264\u2009d\u2009\u2264\u200930,\u20090\u2009\u2264\u2009sumTime\u2009\u2264\u2009240) \u2014 the amount of days, during which Peter studied, and the total amount of hours, spent on preparation. Each of the following d lines contains two integer numbers minTimei,\u2009maxTimei (0\u2009\u2264\u2009minTimei\u2009\u2264\u2009maxTimei\u2009\u2264\u20098), separated by a space \u2014 minimum and maximum amount of hours that Peter could spent in the i-th day.", "output_spec": "In the first line print YES, and in the second line print d numbers (separated by a space), each of the numbers \u2014 amount of hours, spent by Peter on preparation in the corresponding day, if he followed his parents' instructions; or print NO in the unique line. If there are many solutions, print any of them.", "sample_inputs": ["1 48\n5 7", "2 5\n0 1\n3 5"], "sample_outputs": ["NO", "YES\n1 4"], "notes": null}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$e = 0;\n$f = 0;\n$h = array();\n$i = array();\n$k = array();\n$l = array();\nfor($x = 1; $x <= $a; $x++)\n{\n    list($c, $d) = explode(\" \", trim(fgets(STDIN)));\n    $e += $c;\n    $f += $d;\n    $g = range($c, $d);\n    array_push($h, ceil(array_sum($g) / count($g)));\n    array_push($l, floor(array_sum($g) / count($g)));\n    array_push($i, $c);\n    array_push($k, $d);\n}\nif(($b < $e) || ($b > $f))\n{\n    print \"NO\";\n}\nelse\n{\n    print \"YES\" . \"\\n\";\n    if(array_sum($h) < $b)\n    {\n        $j = 0;\n        for($x = 0; $x < count($h) * 10; $x++)\n        {\n            if(array_sum($h) < $b)\n            {\n                $h[$x] = $k[$x];\n                $j++;\n            }\n            elseif(array_sum($h) > $b)\n            {\n                $h[$j] -= 1;\n            }\n            else\n            {\n                print implode(\" \", $h);\n                break;\n            }\n        }\n    }\n    elseif(array_sum($h) > $b)\n    {\n        $j = 0;\n        for($x = 0; $x < count($l) * 10; $x++)\n        {\n            if(array_sum($l) > $b)\n            {\n                $l[$x] = $i[$x];\n                $j++;\n            }\n            elseif(array_sum($l) < $b)\n            {\n                $l[$j] += 1;\n            }\n            else\n            {\n                print implode(\" \", $l);\n                break;\n            }\n        }\n    }\n    elseif(array_sum($h) == $b)\n    {\n        print implode(\" \", $h);\n    }\n}\n?>"}, {"source_code": "<?php declare(strict_types=1);\n\n$fp = fopen('php://stdin', 'r');\n[$d, $sumTime] = array_filter(explode(' ', fgets($fp)), 'intval');\n\n$totalMinTime = $totalMaxTime = 0;\n$times = [];\nfor ($i = 0; $i < $d; ++$i) {\n    [$minTime, $maxTime] = array_filter(explode(' ', fgets($fp)), 'intval');\n    $totalMinTime += $minTime;\n    $totalMaxTime += $maxTime;\n    $times[] = [$minTime, $maxTime];\n}\nfclose($fp);\n\nif ($totalMinTime <= $sumTime && $sumTime <= $totalMaxTime) {\n    echo \"YES\\n\";\n    $days = [];\n    foreach ($times as [$minTime, $maxTime]) {\n        $totalMinTime -= $minTime;\n        $totalMaxTime -= $maxTime;\n\n        $min = max($sumTime - $totalMaxTime, 0);\n        //$max = $sumTime - $totalMinTime;\n\n        $hours = max($min, $minTime);\n        $days[] = $hours;\n\n        $sumTime -= $hours;\n    }\n\n    echo join(' ', $days);\n} else {\n    echo 'NO';\n}\n"}, {"source_code": "<?php\n\nlist($d, $sumTime)  = explode(' ', readline());\n\n$days = [];\n$minTimeS = 0;\n$maxTimeS = 0;\n\nfor($i = 0; $i < $d; $i++){\n\n    $days[$i] = explode(' ', readline());\n    $minTimeS += $days[$i][0];\n    $maxTimeS += $days[$i][1];\n\n}\nif($maxTimeS < $sumTime){\n    echo 'NO';\n    die();\n}\n\nif($minTimeS <= $sumTime){\n    echo \"YES\\n\";\n    foreach ($days as $key => $day){\n        if($minTimeS == $sumTime){\n            echo $day[0] . ' ';\n            continue;\n        }else{\n            if($minTimeS + ($day[1] - $day[0]) > $sumTime){\n                echo ($day[0] + ($sumTime - $minTimeS)) . ' ';\n                $minTimeS = $sumTime;\n                continue;\n            }\n            $minTimeS += ($day[1] - $day[0]);\n            echo $day[1] . ' ';\n        }\n    }\n}else{\n    echo 'NO';\n    die();\n}"}, {"source_code": "<?php\n\tlist($n,$sum)=explode(' ',fgets(STDIN));\n\t$dat=array();\n\t$l=0;\n\t$r=0;\n\t$tmp=$sum;\n\tfor($i=0; $i<$n; $i++)\n\t{\n\t\tlist($x,$y)=explode(' ',fgets(STDIN));\n\t\t$dat[$i]=array($x,$y);\n\t\t$l+=$x;\n\t\t$r+=$y;\n\t\t$tmp-=$x;\n\t}\n\tif($l>$sum||$r<$sum)\n\t\tprint \"NO\\n\";\n\telse\n\t{\n\t\tprint \"YES\\n\";\n\t\tfor($i=0; $i<$n; $i++)\n\t\t{\n\t\t\t$x=$dat[$i][0];\n\t\t\tif($tmp>0)\n\t\t\t{\n\t\t\t\t$y=min($tmp,$dat[$i][1]-$x);\n\t\t\t\t$x+=$y;\n\t\t\t\t$tmp-=$y;\n\t\t\t}\n\t\t\tprint $x.' ';\n\t\t}\n\t\tprint \"\\n\";\n\t}\n?>\n"}, {"source_code": "<?php\n\n###### IO ######\nerror_reporting(E_ALL);\n#error_reporting(0);\n\nfunction readString($f) {\n\t$r = array(\n\t\t\"\\r\" => '',\n\t\t\"\\n\" => '',\n\t);\n\treturn strtr(fgets($f), $r);\n}\n\nfunction readNumString($f) {\n\treturn trim(fgets($f));\n}\n\nfunction stringToArray($str) {\n\treturn str_split($str);\n}\n\nfunction readNum($f, $is_int = false) {\n\t$v = readNumString($f);\n\treturn $is_int ? intval($v) : floatval($v);\n}\n\nfunction readStringExplode($f, $delimiter = ' ') {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = 'trim';\n\treturn array_map($callf, $return);\n}\n\nfunction readStringExplodeNum($f, $delimiter = ' ', $is_int = false) {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = $is_int ? 'intval' : 'floatval';\n\treturn array_map($callf, $return);\n}\n\n###### /IO ######\n\nfunction getAnswer($is_test = false, $f = false) {\n\tif ($is_test === false) {\n\t\t$f = STDIN;\n\t}\n\t/* begin body */\n\tlist($d, $sum) = readStringExplodeNum($f, ' ', true);\n\n\t$days = array();\n\t$canMin = $canMax = array();\n\tfor ($i = 0; $i < $d; $i++) {\n\t\tlist($canMin[$i], $canMax[$i]) = readStringExplodeNum($f, ' ', true);\n\t\t$days[$i] = $canMin[$i];\n\t}\n\n\n\t$_sum = array_sum($days);\n\tdo {\n\t\t$diff = $sum - $_sum;\n\t\tif ($diff < 0)\n\t\t\tbreak;\n\t\t$success = false;\n\t\tforeach ($days as $i => $cnt) {\n\t\t\t$minMaxDiff = $canMax[$i] - $canMin[$i];\n\t\t\tif ($cnt < $canMax[$i]) {\n\t\t\t\t$success = true;\n\t\t\t\t$days[$i]+=min($diff, $minMaxDiff);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (!$success) {\n\t\t\tbreak;\n\t\t}\n\t\t$_sum = array_sum($days);\n\t} while ($_sum < $sum);\n\tif ($_sum != $sum) {\n\t\techo 'NO';\n\t} else {\n\t\techo 'YES' . \"\\r\\n\";\n\t\techo implode(\" \", $days);\n\t}\n\t/* / end body */\n}\n\nif (empty($is_test))\n\tgetAnswer();"}, {"source_code": "<?php\nfscanf(STDIN, \"%d %d\\n\", $n, $sum); \n$L = array();\n$R = array();\n$sumR = 0;\nfor ($i = 0; $i < $n; $i++) {\n\tfscanf(STDIN, \"%d %d\\n\", $L[$i], $R[$i]); \n\t$sum -= $L[$i];\n\t$sumR += $R[$i] - $L[$i];\n}\nif (0 <= $sum && $sum <= $sumR) {\n\tprint(\"YES\\n\");\n\tfor ($i = 0; $i < $n; $i++) {\n\t\t$x = min($sum, $R[$i] - $L[$i]);\n\t\t$sum -= $x;\n\t\tprint($L[$i] + $x.\" \");\n\t}\n} else {\n\tprint(\"NO\");\n}\n?>\n"}, {"source_code": "<?php\nfscanf(STDIN, \"%d %d\\n\", $n, $sum); \n$L = array();\n$R = array();\n$sumR = 0;\nfor ($i = 0; $i < $n; $i += 1) {\n\tfscanf(STDIN, \"%d %d\\n\", $l, $r); \n\t$L[$i] = $l;\n\t$R[$i] = $r;\n\t$sum -= $l;\n\t$sumR += $r - $l;\n}\nif (0 <= $sum && $sum <= $sumR) {\n\tprint(\"YES\\n\");\n\tfor ($i = 0; $i < $n; $i += 1) {\n\t\t$x = min($sum, $R[$i] - $L[$i]);\n\t\t$sum -= $x;\n\t\tprint($L[$i] + $x.\" \");\n\t}\n} else {\n\tprint(\"NO\");\n}\n?>\n"}, {"source_code": "<?php\nlist($d, $sum) = explode(' ', fgets(STDIN));\n\n$m = array();\n$min = 0;\n$max = 0;\nfor($i=1;$i<=$d;$i++){\n list($mi, $ma) = explode(' ',fgets(STDIN));\n $mi = intval($mi); $ma = intval($ma);\n $m[$i] = array($mi, $ma);\n $min += $mi;\n $max += $ma;\n}\n\nif($sum<$min || $sum > $max){print 'NO'; exit(0);}\n\nprint \"YES\\r\\n\";\n$diff = $sum - $min;\nfor($i=1;$i<=$d;$i++){\n $cur = $m[$i][0];\n if($diff > 0){\n  if($diff <= ($m[$i][1] - $m[$i][0])){\n   $cur += $diff;\n   $diff = 0;\n  }else{\n   $cur = $m[$i][1];\n   $diff -= ($m[$i][1] - $m[$i][0]);\n  }\n }\n print $cur.' ';\n}\n\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$e = array();\n$f = array();\n$g = array();\n$h = array();\n$i = array();\nfor($x = 1; $x <= $a; $x++)\n{\n    list($c, $d) = explode(\" \", trim(fgets(STDIN)));\n    array_push($e, $c);\n    array_push($f, $d);\n}\nfor($x = 0; $x < $a; $x++)\n{\n    if($b >= $e[$x])\n    {\n        array_push($g, $f[$x]);\n        array_push($i, $e[$x]);\n    }\n}\nfor($x = 0; $x < count($g); $x++)\n{\n    $b -= $g[$x];\n    if($b > 0)\n    {\n        array_push($h, $g[$x]);\n    }\n    elseif($b == 0)\n    {\n        array_push($h, $g[$x]);\n        $b = -1;\n        break;\n    }\n    elseif($b < 0)\n    {\n        array_push($h, $g[$x] + $b);\n        break;\n    }\n}\nfor($y = $x + 1; $y < count($g); $y++)\n{\n    if($i[$y] == 0)\n    {\n        array_push($h, $i[$y]);\n    }\n}\nif(($b < 0) && (count($h) == $a))\n{\n    print \"YES\" . \"\\n\" . implode(\" \", $h);\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$e = 0;\n$f = 0;\n$h = array();\n$i = array();\n$k = array();\nfor($x = 1; $x <= $a; $x++)\n{\n    list($c, $d) = explode(\" \", trim(fgets(STDIN)));\n    $e += $c;\n    $f += $d;\n    $g = range($c, $d);\n    array_push($h, ceil(array_sum($g) / count($g)));\n    array_push($i, $c);\n    array_push($k, $d);\n}\nif(($b < $e) || ($b > $f))\n{\n    print \"NO\";\n}\nelse\n{\n    print \"YES\" . \"\\n\";\n    if(array_sum($h) < $b)\n    {\n        $j = 0;\n        for($x = 0; $x < count($h) * 10; $x++)\n        {\n            if(array_sum($h) < $b)\n            {\n                $h[$x] = $k[$x];\n                $j++;\n            }\n            elseif(array_sum($h) > $b)\n            {\n                $h[$j] -= $j;\n            }\n            else\n            {\n                print implode(\" \", $h);\n                break;\n            }\n        }\n    }\n    elseif(array_sum($h) > $b)\n    {\n        $j = 0;\n        for($x = 0; $x < count($h) * 10; $x++)\n        {\n            if(array_sum($h) > $b)\n            {\n                $h[$x] = $i[$x];\n                $j++;\n            }\n            elseif(array_sum($h) < $b)\n            {\n                $h[$j] += $j;\n            }\n            else\n            {\n                print implode(\" \", $h);\n                break;\n            }\n        }\n    }\n    elseif(array_sum($h) == $b)\n    {\n        print implode(\" \", $h);\n    }\n}\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$e = array();\n$f = array();\n$g = array();\n$h = array();\nfor($x = 1; $x <= $a; $x++)\n{\n    list($c, $d) = explode(\" \", trim(fgets(STDIN)));\n    array_push($e, $c);\n    array_push($f, $d);\n}\nfor($x = 0; $x < $a; $x++)\n{\n    if($b >= $e[$x])\n    {\n        array_push($g, $f[$x]);\n    }\n}\nfor($x = 0; $x < count($g); $x++)\n{\n    $b -= $g[$x];\n    if($b > 0)\n    {\n        array_push($h, $g[$x]);\n    }\n    elseif($b == 0)\n    {\n        array_push($h, $g[$x]);\n        $b = -1;\n        break;\n    }\n    elseif($b < 0)\n    {\n        array_push($h, $g[$x] + $b);\n        break;\n    }\n}\nif($b < 0)\n{\n    print \"YES\" . \"\\n\";\n}\nelse\n{\n    print \"NO\";\n}\nif($b < 0)\n{\n    print implode(\" \", $h);\n}\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$e = 0;\n$f = 0;\n$h = array();\n$i = array();\n$k = array();\nfor($x = 1; $x <= $a; $x++)\n{\n    list($c, $d) = explode(\" \", trim(fgets(STDIN)));\n    $e += $c;\n    $f += $d;\n    $g = range($c, $d);\n    array_push($h, ceil(array_sum($g) / count($g)));\n    array_push($i, $c);\n    array_push($k, $d);\n}\nif(($b < $e) || ($b > $f))\n{\n    print \"NO\";\n}\nelse\n{\n    print \"YES\" . \"\\n\";\n    if(array_sum($h) < $b)\n    {\n        $j = 0;\n        for($x = 0; $x < count($h) * 10; $x++)\n        {\n            if(array_sum($h) < $b)\n            {\n                $h[$x] = $k[$x];\n                $j++;\n            }\n            elseif(array_sum($h) > $b)\n            {\n                $h[$j] -= 1;\n            }\n            else\n            {\n                print implode(\" \", $h);\n                break;\n            }\n        }\n    }\n    elseif(array_sum($h) > $b)\n    {\n        $j = 0;\n        for($x = 0; $x < count($h) * 10; $x++)\n        {\n            if(array_sum($h) > $b)\n            {\n                $h[$x] = $i[$x];\n                $j++;\n            }\n            elseif(array_sum($h) < $b)\n            {\n                $h[$j] += 1;\n            }\n            else\n            {\n                print implode(\" \", $h);\n                break;\n            }\n        }\n    }\n    elseif(array_sum($h) == $b)\n    {\n        print implode(\" \", $h);\n    }\n}\n?>"}, {"source_code": "<?php\n\nlist($d, $sumTime)  = explode(' ', readline());\n\n$days = [];\n$minTimeS = 0;\n$maxTimeS = 0;\n\nfor($i = 0; $i < $d; $i++){\n\n    $days[$i] = explode(' ', readline());\n    $minTimeS += $days[$i][0];\n    $maxTimeS += $days[$i][1];\n\n}\nif($maxTimeS < $sumTime){\n    echo 'NO';\n    die();\n}\n\nif($minTimeS < $sumTime){\n    echo \"YES \\n\";\n    foreach ($days as $key => $day){\n        $minTimeS += ($day[1] - $day[0]);\n        if($minTimeS < $sumTime){\n            echo $day[0] . ' ';\n            continue;\n        }else{\n            echo $day[1] . ' ';\n        }\n    }\n}else{\n    echo \"YES \\n\";\n    foreach ($days as $key => $day){\n        echo $day[0] . ' ';\n    }\n}"}, {"source_code": "<?php\n\nlist($d, $sumTime)  = explode(' ', readline());\n\n$days = [];\n$minTimeS = 0;\n$maxTimeS = 0;\n\nfor($i = 0; $i < $d; $i++){\n\n    $days[$i] = explode(' ', readline());\n    $minTimeS += $days[$i][0];\n    $maxTimeS += $days[$i][1];\n\n}\nif($maxTimeS < $sumTime){\n    echo 'NO';\n    die();\n}\n\nif($minTimeS <= $sumTime){\n    echo \"YES\\n\";\n    foreach ($days as $key => $day){\n        $minTimeS += ($day[1] - $day[0]);\n        if($minTimeS < $sumTime){\n            echo $day[0] . ' ';\n            continue;\n        }else{\n            echo $day[1] . ' ';\n        }\n    }\n}else{\n    echo 'NO';\n    die();\n}"}, {"source_code": "<?php\n\nlist($d, $sumTime)  = explode(' ', readline());\n\n$days = [];\n$minTimeS = 0;\n$maxTimeS = 0;\n\nfor($i = 0; $i < $d; $i++){\n\n    $days[$i] = explode(' ', readline());\n    $minTimeS += $days[$i][0];\n    $maxTimeS += $days[$i][1];\n\n}\nif($maxTimeS < $sumTime){\n    echo 'NO';\n    die();\n}\n\nif($minTimeS < $sumTime){\n    echo \"YES\\n\";\n    foreach ($days as $key => $day){\n        $minTimeS += ($day[1] - $day[0]);\n        if($minTimeS < $sumTime){\n            echo $day[0] . ' ';\n            continue;\n        }else{\n            echo $day[1] . ' ';\n        }\n    }\n}else{\n    echo \"YES\\n\";\n    foreach ($days as $key => $day){\n        echo $day[0] . ' ';\n    }\n}"}, {"source_code": "<?php\n\n###### IO ######\nerror_reporting(E_ALL);\n#error_reporting(0);\n\nfunction readString($f) {\n\t$r = array(\n\t\t\"\\r\" => '',\n\t\t\"\\n\" => '',\n\t);\n\treturn strtr(fgets($f), $r);\n}\n\nfunction readNumString($f) {\n\treturn trim(fgets($f));\n}\n\nfunction stringToArray($str) {\n\treturn str_split($str);\n}\n\nfunction readNum($f, $is_int = false) {\n\t$v = readNumString($f);\n\treturn $is_int ? intval($v) : floatval($v);\n}\n\nfunction readStringExplode($f, $delimiter = ' ') {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = 'trim';\n\treturn array_map($callf, $return);\n}\n\nfunction readStringExplodeNum($f, $delimiter = ' ', $is_int = false) {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = $is_int ? 'intval' : 'floatval';\n\treturn array_map($callf, $return);\n}\n\n###### /IO ######\n\nfunction getAnswer($is_test = false, $f = false) {\n\tif ($is_test === false) {\n\t\t$f = STDIN;\n\t}\n\t/* begin body */\n\tlist($d, $sum) = readStringExplodeNum($f, ' ', true);\n\n\t$days = array();\n\t$canMin = $canMax = array();\n\tfor ($i = 0; $i < $d; $i++) {\n\t\tlist($canMin[$i], $canMax[$i]) = readStringExplodeNum($f, ' ', true);\n\t\t$days[$i] = $canMin[$i];\n\t}\n\n\n\t$_sum = array_sum($days);\n\tdo {\n\t\t$diff = $sum - $_sum;\n\t\t$success = false;\n\t\tforeach ($days as $i => $cnt) {\n\t\t\t$minMaxDiff = $canMax[$i] - $canMin[$i];\n\t\t\tif ($cnt < $canMax[$i]) {\n\t\t\t\t$success = true;\n\t\t\t\t$days[$i]+=min($diff, $minMaxDiff);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (!$success) {\n\t\t\tbreak;\n\t\t}\n\t\t$_sum = array_sum($days);\n\t} while ($_sum < $sum);\n\tif ($_sum != $sum) {\n\t\techo 'NO';\n\t} else {\n\t\techo 'YES' . \"\\r\\n\";\n\t\techo implode(\" \", $days);\n\t}\n\t/* / end body */\n}\n\nif (empty($is_test))\n\tgetAnswer();"}], "src_uid": "f48ff06e65b70f49eee3d7cba5a6aed0"}
{"nl": {"description": "There was once young lass called Mary,  Whose jokes were occasionally scary.  On this April's Fool  Fixed limerick rules  Allowed her to trip the unwary.Can she fill all the linesTo work at all times?On juggling the wordsRight around two-thirdsShe nearly ran out of rhymes.", "input_spec": "The input contains a single integer $$$a$$$ ($$$4 \\le a \\le 998$$$). Not every integer in the range is a valid input for the problem; you are guaranteed that the input will be a valid integer.", "output_spec": "Output a single number.", "sample_inputs": ["35", "57", "391"], "sample_outputs": ["57", "319", "1723"], "notes": null}, "positive_code": [{"source_code": "<?php\nfunction solve(){\n    $x=readLine();\n    $cl;\n    for($i=2;$i<=sqrt($x);$i++){\n        if($x%$i==0)$cl=$i;\n    }\n    print $cl. $x/$cl;\n}\nfunction main(){\n    $t=1;\n    //$t=readLine();\n    for($i=0;$i<$t;$i++){\n        solve();\n    }\n}\nmain();\n?>"}], "negative_code": [{"source_code": "<?php\nfunction solve(){\n    $x=readLine();\n    $cl;\n    for($i=2;$i<=sqrt($x);$i++){\n        if($x%$i==0)$cl=$i;\n    }\n    print $cl. x/$cl;\n}\nfunction main(){\n    $t=1;\n    //$t=readLine();\n    for($i=0;$i<$t;$i++){\n        solve();\n    }\n}\nmain();\n?>"}], "src_uid": "7220f2da5081547a12118595bbeda4f6"}
{"nl": {"description": "Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl and Eeyore, each of them lives in his own house. There are winding paths between each pair of houses. The length of a path between Rabbit's and Owl's houses is a meters, between Rabbit's and Eeyore's house is b meters, between Owl's and Eeyore's house is c meters.For enjoying his life and singing merry songs Winnie-the-Pooh should have a meal n times a day. Now he is in the Rabbit's house and has a meal for the first time. Each time when in the friend's house where Winnie is now the supply of honey is about to end, Winnie leaves that house. If Winnie has not had a meal the required amount of times, he comes out from the house and goes to someone else of his two friends. For this he chooses one of two adjacent paths, arrives to the house on the other end and visits his friend. You may assume that when Winnie is eating in one of his friend's house, the supply of honey in other friend's houses recover (most probably, they go to the supply store).Winnie-the-Pooh does not like physical activity. He wants to have a meal n times, traveling minimum possible distance. Help him to find this distance.", "input_spec": "First line contains an integer n (1\u2009\u2264\u2009n\u2009\u2264\u2009100)\u00a0\u2014 number of visits. Second line contains an integer a (1\u2009\u2264\u2009a\u2009\u2264\u2009100)\u00a0\u2014 distance between Rabbit's and Owl's houses. Third line contains an integer b (1\u2009\u2264\u2009b\u2009\u2264\u2009100)\u00a0\u2014 distance between Rabbit's and Eeyore's houses. Fourth line contains an integer c (1\u2009\u2264\u2009c\u2009\u2264\u2009100)\u00a0\u2014 distance between Owl's and Eeyore's houses.", "output_spec": "Output one number\u00a0\u2014 minimum distance in meters Winnie must go through to have a meal n times.", "sample_inputs": ["3\n2\n3\n1", "1\n2\n3\n5"], "sample_outputs": ["3", "0"], "notes": "NoteIn the first test case the optimal path for Winnie is the following: first have a meal in Rabbit's house, then in Owl's house, then in Eeyore's house. Thus he will pass the distance 2\u2009+\u20091\u2009=\u20093.In the second test case Winnie has a meal in Rabbit's house and that is for him. So he doesn't have to walk anywhere at all."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = trim(fgets(STDIN));\n$d = trim(fgets(STDIN));\nif($a == 1)\n{\n     print \"0\";\n}\nelse\n{\n     $e = min($b, $c);\n     $f = min($b, $c, $d);\n     $g = ($a - 1) * $f;\n     print $e + $g - $f;\n}\n?>"}], "negative_code": [], "src_uid": "6058529f0144c853e9e17ed7c661fc50"}
{"nl": {"description": "A magic number is a number formed by concatenation of numbers 1, 14 and 144. We can use each of these numbers any number of times. Therefore 14144, 141414 and 1411 are magic numbers but 1444, 514 and 414 are not.You're given a number. Determine if it is a magic number or not.", "input_spec": "The first line of input contains an integer n, (1\u2009\u2264\u2009n\u2009\u2264\u2009109). This number doesn't contain leading zeros.", "output_spec": "Print \"YES\" if n is a magic number or print \"NO\" if it's not.", "sample_inputs": ["114114", "1111", "441231"], "sample_outputs": ["YES", "YES", "NO"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\nfor($x = 1; $x <= 1000000000; $x++)\n{\n    $b = substr($a, 0, 3);\n    $c = substr($a, 0, 2);\n    $d = substr($a, 0, 1);\n    if($a == \"\")\n    {\n        print \"YES\";\n        break;\n    }\n    elseif($b == \"144\")\n    {\n        $a = substr($a, 3);\n    }\n    elseif($c == \"14\")\n    {\n        $a = substr($a, 2);\n    }\n    elseif($d == \"1\")\n    {\n        $a = substr($a, 1);\n    }\n    else\n    {\n        print \"NO\";\n        break;\n    }\n}\n?>"}, {"source_code": "<?php\n\n$line = trim(fgets(STDIN));\n$digitLen = strlen($line);\nif (0 == $digitLen || $line[0] != 1) {\n\techo 'NO';\n\treturn;\n}\n\n$count4 = 0;\nfor ($i = 0; $i < $digitLen; $i++) {\n\tif ($count4 > 2) {\n\t\techo 'NO';\n\t\treturn;\n\t}\n\n\t$c = $line[$i];\n\tif ($c == 1) {\n\t\t$count4 = 0;\n\t\tcontinue;\n\t}\n\n\tif ($c == 4) {\n\t\t$count4++;\n\t\tcontinue;\n\t}\n\n\techo 'NO';\n\treturn;\n}\n\necho ($count4 > 2) ? 'NO' : 'YES';\n"}, {"source_code": "<?php\n\t$input = trim(fgets(STDIN));\n\tif (preg_match('/^(1|14|144)+$/',$input)) echo \"YES\";\n\telse echo \"NO\";\n\techo \"\\n\";\n\n\t\n\t\n?>\n"}, {"source_code": "<?php\n\tfunction check($x)\n\t{\n\t\t$n = strlen($x);\n\t\tfor ($i = 0; $i < $n; ++$i)\n\t\t{\n\t\t\tif ($x[$i] == 1) continue;\n\t\t\tif ($x[$i] == 4)\n\t\t\t{\n\t\t\t\tif ($i > 0 && $x[$i - 1] == 1) continue;\n\t\t\t\tif ($i - 1 > 0 && $x[$i - 1] == 4 && $x[$i - 2] == 1) continue;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\n\n\t$input = trim(fgets(STDIN));\n\tif (check($input)) echo \"YES\";\n\telse echo \"NO\";\n\techo \"\\n\";\n\n\t\n\t\n?>\n"}, {"source_code": "<?php \n$a=trim(fgets(STDIN));\nif(preg_match('/^(14|1|144)+$/',$a))echo \"YES\";\nelse echo \"NO\";\n?>"}, {"source_code": "<?php\n$input=trim(fgets(STDIN));\nsettype($input,'string');\n$a=0;\n$input2=[];\n$y=0;$ccy=0;$c=0;\n$input2=str_split($input);\nfor ($i=0;$i<strlen($input); $i++) { \n\n  if($i<strlen($input)-2 and $input2[$i] == 1 and $input2[$i+1] == 4 and $input2[$i+2] == 4 ){\n      $ccy+=3;\n      $i+=2;\n  }else if($i<strlen($input)-1 and $input2[$i] == 1 and $input2[$i+1] == 4){\n       $c+=2;\n       $i+=1;\n  }else if($input2[$i] == 1 ){\n       $y++;\n  }\n}\n$k=$ccy + $c+$y  ;\nif(count($input2) == $k){\n     echo \"YES\";\n}else{\n     echo \"NO\";\n}\n"}, {"source_code": "<?php \n$a=trim(fgets(STDIN));\nif(preg_match('/^(14|1|144)+$/',$a))echo \"YES\";\nelse echo \"NO\";\n?>\n        \t \t \t  \t \t\t \t\t      \t \t"}, {"source_code": "<? echo preg_match('/^(1|14|144)+$/',trim(fgets(STDIN)))?\"YES\":\"NO\";?>"}, {"source_code": "<?php\n$in=explode(\"\\r\\n\",file_get_contents(\"php://stdin\"))[0];\n$in=str_replace('144','.',$in);\n$in=str_replace('14','.',$in);\n$in=str_replace('1','.',$in);\nfor($i=0;$i<strlen($in);$i++){\n    if($in[$i]!='.'){\n        echo(\"NO\\n\");\n        return false;\n    }\n}\necho(\"YES\\n\");"}, {"source_code": "<?php\n$a=trim(fgets(STDIN));\nif( preg_match('/^(1|14|144)+$/',$a) ) echo \"YES\"; else echo \"NO\";\n\n?>"}, {"source_code": "<?php\n\n$f = fopen( 'php://stdin', 'r' );\n$str = trim(fgets($f));\n\n$tmp = \"\";\n$err = \"\";\nfor($i=0;$i<strlen($str);$i++){\n\n    if($str[$i]==1){\n        if($tmp == \"1\"){\n            continue;\n        }\n        elseif($tmp == \"\" || $tmp == \"14\" || $tmp == \"144\"){\n            $tmp = \"1\";\n        }\n        else{\n            $err = $str[$i];\n        }\n    }\n    elseif($str[$i]==4){\n        if($tmp == \"14\"){\n            $tmp = \"144\";\n        }\n        elseif($tmp == \"1\"){\n            $tmp = \"14\";\n        }\n        else{\n            $err = $str[$i];\n        }\n    }\n    else{\n        $err = $str[$i];\n    }\n\n}\n\necho $err === \"\" ? \"YES\" : \"NO\";\n?>"}, {"source_code": "<?php\n\nerror_reporting(-1);\n\n$s = fopen(\"php://stdin\", 'r');\n$input = fgets($s);\n$input = trim($input);\n\nfunction valid($string) {\n    $a = 1;\n    $b = 14;\n    $c = 144;\n    if ($string == $a || $string == $b || $string == $c)\n        return true;\n}   \n\n$currentSequence = \"\";\n$condition = true;\nforeach (str_split($input) as $key => $value) {\n    if ($value != \"1\" && $value != \"4\") \n        $condition = false;\n\n    if (empty($currentSequence) || valid($currentSequence)) {\n        $currentSequence = $currentSequence . $value;\n    } elseif (strlen($currentSequence) >= 1) {\n        $currentSequence = $value;\n    } else {\n        $condition = false;\n    }\n\n    if (!valid($currentSequence)) {\n        $currentSequence = $value;\n        if (!valid($currentSequence)) {\n            $condition = false;\n        }\n    }\n}\n\necho $condition === true ? \"YES\\n\" : \"NO\\n\";\n\n"}, {"source_code": "<?php\n\n$s = fopen(\"php://stdin\", 'r');\n\n$n = fgets($s);\n$n=trim($n);\n\nfor ($i=0; $i<strlen($n); $i++)\n{\nif ( (substr($n,$i,1) != 1 && substr($n,$i,1) != 4) || (substr($n,0,1)==4))\n{\n echo \"NO\";\n return;\n}\nelse if (substr($n,$i,1)==4)\n{\n  if ( $i>1 && (substr($n,$i-2,1) . substr($n,$i-1,1) . substr($n,$i,1)== \"444\")) //444\n  {\n echo \"NO\";\n return;\n  }\n\n\n}\n}\n\necho \"YES\";\n\n?>"}, {"source_code": "<?php\n\n$line = trim(fgets(STDIN));\n\nif ($line[0] == 4) {\n  print 'NO';\n  return;\n}\n\nfor ($i = 0, $n = strlen($line); $i < $n; $i ++) {\n  if ($line[$i] != 1 && $line[$i] != 4) {\n    print 'NO';\n    return;\n  }\n  if ($line[$i] == 4 && ($i+1 < $n && $line[$i+1] == 4) && ($i+2 < $n && $line[$i+2] == 4)) {\n    print 'NO';\n    return;\n  }\n}\n\nprint 'YES';\n"}, {"source_code": "<?php\n// for example, the input is '5 9'\n$input = trim(fgets(STDIN));\n\nfunction magicNumber($input){\n\t$numbers = str_split($input);\n\tforeach($numbers as $key => $number){\n\t\tif(!in_array($number, [1,4])){\n\t\t\treturn false;\n\t\t}\n\t\tif($number == 4){\n\t\t\tif($key == 0){\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif($numbers[$key-1] == 1){\n\t\t\t\tcontinue;\n\t\t\t}elseif($numbers[$key-1] == 4){\n\t\t\t\tif($numbers[$key-2] == 1)\n\t\t\t\t\tcontinue;\n\t\t\t\telse\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\t\n\t\t}\n\t}\n\treturn true;\n}\nif(magicNumber($input)){\n\techo \"YES\";\n}else{\n\techo \"NO\";\n}"}], "negative_code": [{"source_code": "<?php\n\tfunction check($x)\n\t{\n\t\t$n = strlen($x) - 1;\n\t\tfor ($i = 0; $i < $n; ++$i)\n\t\t{\n\t\t\tif ($x[$i] == 1) continue;\n\t\t\tif ($x[$i] == 4)\n\t\t\t{\n\t\t\t\tif ($i > 0 && $x[$i - 1] == 1) continue;\n\t\t\t\tif ($i - 1 > 0 && $x[$i - 1] == 4 && $x[$i - 2] == 1) continue;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\n\n\t$input = fgets(STDIN);\n\tif (check($input)) echo \"YES\";\n\telse echo \"NO\";\n\techo \"\\n\";\n\n\t\n\t\n?>"}, {"source_code": "<?php\n\tfunction check($x)\n\t{\n\t\t$n = count($x);\n\t\tfor ($i = 0; $i < $n; ++$i)\n\t\t{\n\t\t\tif ($x[$i] == 1) continue;\n\t\t\tif ($x[$i] == 4)\n\t\t\t{\n\t\t\t\tif ($i > 0 && $x[$i - 1] == 1) continue;\n\t\t\t\tif ($i - 1 > 0 && $x[$i - 1] == 4 && $x[$i] == 1) continue;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\n\n\t$input = fgets(STDIN);\n\tif (check($input)) echo \"YES\";\n\telse echo \"NO\";\n\techo \"\\n\";\n\n\t\n\t\n?>\n"}, {"source_code": "<?php\n\n\t\t$input = fgets(STDIN);\n\t\t$regex = '/^(1|14|144)+$/';\n\t\tif (preg_match($regex, $input)) echo \"YES\";\n\t\telse echo \"NO\";\n\t\techo \"\\n\";\n\t\n\t\n?>"}, {"source_code": "<?php\n\tfunction check($x)\n\t{\n\t\t$n = strlen($x);\n\t\tfor ($i = 0; $i < $n; ++$i)\n\t\t{\n\t\t\tif ($x[$i] == 1) continue;\n\t\t\tif ($x[$i] == 4)\n\t\t\t{\n\t\t\t\tif ($i > 0 && $x[$i - 1] == 1) continue;\n\t\t\t\tif ($i - 1 > 0 && $x[$i - 1] == 4 && $x[$i - 2] == 1) continue;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\n\n\t$input = fgets(STDIN);\n\tif (check($input)) echo \"YES\";\n\telse echo \"NO\";\n\techo \"\\n\";\n\n\t\n\t\n?>\n"}, {"source_code": "<?php\n\tfunction check($x)\n\t{\n\t\t$n = strlen($x);\n\t\tfor ($i = 0; $i < $n; ++$i)\n\t\t{\n\t\t\tif ($x[$i] == 1) continue;\n\t\t\tif ($x[$i] == 4)\n\t\t\t{\n\t\t\t\tif ($i > 0 && $x[$i - 1] == 1) continue;\n\t\t\t\tif ($i - 1 > 0 && $x[$i - 1] == 4 && $x[$i - 2] == 1) continue;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\n\n\t$input = fgets(STDIN);\n\tif (check($input)) echo \"YES\";\n\telse echo \"NO\";\n\techo \"\\n\";\n\n\t\n\t\n?>"}, {"source_code": "<?php\n\tfunction check($x)\n\t{\n\t\t$n = count($x);\n\t\tfor ($i = 0; $i < $n; ++$i)\n\t\t{\n\t\t\tif ($x[$i] == 1) continue;\n\t\t\tif ($x[$i] == 4)\n\t\t\t{\n\t\t\t\tif ($i > 0 && $x[$i - 1] == 1) continue;\n\t\t\t\tif ($i - 1 > 0 && $x[$i - 1] == 4 && $x[$i - 2] == 1) continue;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\n\n\t$input = fgets(STDIN);\n\tif (check($input)) echo \"YES\";\n\telse echo \"NO\";\n\techo \"\\n\";\n\n\t\n\t\n?>\n"}, {"source_code": "<?php\n\tfunction check($x)\n\t{\n\t\t$n = strlen($x);\n\t\tfor ($i = 0; $i < $n; ++$i)\n\t\t{\n\t\t\tif ($x[$i] == 1) continue;\n\t\t\tif ($x[$i] == 4)\n\t\t\t{\n\t\t\t\tif ($i > 0 && $x[$i - 1] == 1) continue;\n\t\t\t\tif ($i - 1 > 0 && $x[$i - 1] == 4 && $x[$i - 2] == 1) continue;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\n\t\t$input = fgets(STDIN);\n\t\t$regex = '/^(1|14|144)+$/';\n\t\tif (preg_match($regex, $input)) echo \"YES\";\n\t\telse echo \"NO\";\n\t\techo \"\\n\";\n\t\n\t\n?>\n"}, {"source_code": "<?php \n$a=trim(fgets(STDIN));\nif(preg_match('/^(14|1|144)+$/',$a))echo \"YES\";\nelse echo \"NO\";\necho '<br/>';\n?>"}, {"source_code": "<? echo preg_match('/^(1|14|144)/',trim(fgets(STDIN)))?\"YES\":\"NO\";?>"}, {"source_code": "<?php\n$in=explode(\"\\r\\n\",file_get_contents(\"php://stdin\"))[0];\n$in=str_replace('144','',$in);\n$in=str_replace('14','',$in);\n$in=str_replace('1','',$in);\nif(strlen($in)==0){\n    echo(\"YES\\n\");\n}else{\n    echo(\"NO\\n\");\n}"}, {"source_code": "\n\n<?php\n\n$f = fopen( 'php://stdin', 'r' );\n$str = fgets($f);\n\n$tmp = \"\";\n$err = \"\";\nfor($i=0;$i<strlen($str);$i++){\n\n    if($str[$i]==1){\n        if($tmp == \"1\"){\n            continue;\n        }\n        elseif($tmp == \"\" || $tmp == \"14\" || $tmp == \"144\"){\n            $tmp = \"1\";\n        }\n        else{\n            $err = $str[$i];\n        }\n    }\n    elseif($str[$i]==4){\n        if($tmp == \"14\"){\n            $tmp = \"144\";\n        }\n        elseif($tmp == \"1\"){\n            $tmp = \"14\";\n        }\n        else{\n            $err = $str[$i];\n        }\n    }\n\n}\n\necho $err ? \"NO\" : \"YES\";\n\n\n?>"}, {"source_code": "<?php\n\n$f = fopen( 'php://stdin', 'r' );\n$str = trim(fgets($f));\n\n$tmp = \"\";\n$err = \"\";\nfor($i=0;$i<strlen($str);$i++){\n\n    if($str[$i]==1){\n        if($tmp == \"1\"){\n            continue;\n        }\n        elseif($tmp == \"\" || $tmp == \"14\" || $tmp == \"144\"){\n            $tmp = \"1\";\n        }\n        else{\n            $err = $str[$i];\n        }\n    }\n    elseif($str[$i]==4){\n        if($tmp == \"14\"){\n            $tmp = \"144\";\n        }\n        elseif($tmp == \"1\"){\n            $tmp = \"14\";\n        }\n        else{\n            $err = $str[$i];\n        }\n    }\n    else{\n        $err = $str[$i];\n    }\n\n}\n\necho empty($err) ? \"YES\" : \"NO\";\n?>"}, {"source_code": "\n<?php\n\n$f = fopen( 'php://stdin', 'r' );\n$str = fgets($f);\n\n$tmp = \"\";\n$err = \"\";\nfor($i=0;$i<strlen($str);$i++){\n\n    if($str[$i]==1){\n        if($tmp == \"1\"){\n            continue;\n        }\n        elseif($tmp == \"\" || $tmp == \"14\" || $tmp == \"144\"){\n            $tmp = \"1\";\n        }\n        else{\n            $err = $str[$i];\n        }\n    }\n    elseif($str[$i]==4){\n        if($tmp == \"14\"){\n            $tmp = \"144\";\n        }\n        elseif($tmp == \"1\"){\n            $tmp = \"14\";\n        }\n        else{\n            $err = $str[$i];\n        }\n    }\n    else{\n        $err = $str[$i];\n    }\n\n}\n\necho empty($err) ? \"YES\" : \"NO\";\n?>\n"}, {"source_code": "<?php\n\n$s = fopen(\"php://stdin\", 'r');\n$n = fgets($s);\n\nfor ($i=0; $i<strlen($n); $i++)\n{\n\nif ( (substr($n,$i,1) != 1) && (substr($n,$i,1) != 4) )\n{\n\n echo \"NO\";\n return;\n}\n\n}\n\necho \"YES\";\n\n\n?>\n"}, {"source_code": "<?php\n\n$s = fopen(\"php://stdin\", 'r');\n\n$n = fgets($s);\n$n=trim($n);\n\nfor ($i=0; $i<strlen($n); $i++)\n{\nif ( (substr($n,$i,1) != 1) && (substr($n,$i,1) != 4) )\n{\n echo \"NO\";\n return;\n}\n\n}\n\necho \"YES\";\n\n?>\n"}, {"source_code": "<?php\n\n$s = fopen(\"php://stdin\", 'r');\n\n$n = fgets($s);\n$n=trim($n);\n\nfor ($i=0; $i<strlen($n); $i++)\n{\nif ( (substr($n,$i,1) != 1 && substr($n,$i,1) != 4) || (substr($n,0,1)==4))\n{\n echo \"NO\";\n return;\n}\nelse if (substr($n,$i,1)==4)\n{\n  if ( i>1 && substr($n,$i-1,1)==4 && substr($n,$i-2,1)==4) //444\n  {\n echo \"NO\";\n return;\n  }\n\n\n}\n}\n\necho \"YES\";\n\n?>"}, {"source_code": "<?php\n// for example, the input is '5 9'\n$input = trim(fgets(STDIN));\n\nfunction magicNumber($input){\n\t$numbers = str_split($input);\n\tforeach($numbers as $key => $number){\n\t\tif(!in_array($number, [1,4])){\n\t\t\treturn false;\n\t\t}\n\t\tif($number == 4){\n\t\t\tif($numbers[$key-1] == 1){\n\t\t\t\tcontinue;\n\t\t\t}elseif($numbers[$key-1] == 4){\n\t\t\t\tif($numbers[$key-2] == 1)\n\t\t\t\t\tcontinue;\n\t\t\t\telse\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\t\n\t\t}\n\t}\n\treturn true;\n}\nif(magicNumber($input)){\n\techo \"YES\";\n}else{\n\techo \"NO\";\n}"}], "src_uid": "3153cfddae27fbd817caaf2cb7a6a4b5"}
{"nl": {"description": "Apart from having lots of holidays throughout the year, residents of Berland also have whole lucky years. Year is considered lucky if it has no more than 1 non-zero digit in its number. So years 100, 40000, 5 are lucky and 12, 3001 and 12345 are not.You are given current year in Berland. Your task is to find how long will residents of Berland wait till the next lucky year.", "input_spec": "The first line contains integer number n (1\u2009\u2264\u2009n\u2009\u2264\u2009109) \u2014 current year in Berland.", "output_spec": "Output amount of years from the current year to the next lucky one.", "sample_inputs": ["4", "201", "4000"], "sample_outputs": ["1", "99", "1000"], "notes": "NoteIn the first example next lucky year is 5. In the second one \u2014 300. In the third \u2014 5000."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\nif($a[0] == \"9\")\n{\n     $b = strlen($a);\n     $c = array_fill(0, $b, 0);\n     $d = 1 . implode($c);\n     print $d - $a;\n}\nelse\n{\n     $b = strlen($a) - 1;\n     $c = array_fill(0, $b, 0);\n     $d = ($a[0] + 1) . implode($c);\n     print $d - $a;\n}\n?>"}], "negative_code": [], "src_uid": "a3e15c0632e240a0ef6fe43a5ab3cc3e"}
{"nl": {"description": "Today Tavas got his test result as an integer score and he wants to share it with his girlfriend, Nafas.His phone operating system is Tavdroid, and its keyboard doesn't have any digits! He wants to share his score with Nafas via text, so he has no choice but to send this number using words.  He ate coffee mix without water again, so right now he's really messed up and can't think.Your task is to help him by telling him what to type.", "input_spec": "The first and only line of input contains an integer s (0\u2009\u2264\u2009s\u2009\u2264\u200999), Tavas's score. ", "output_spec": "In the first and only line of output, print a single string consisting only from English lowercase letters and hyphens ('-'). Do not use spaces.", "sample_inputs": ["6", "99", "20"], "sample_outputs": ["six", "ninety-nine", "twenty"], "notes": "NoteYou can find all you need to know about English numerals in http://en.wikipedia.org/wiki/English_numerals ."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = array(0 => \"zero\", 1 => \"one\", 2 => \"two\", 3 => \"three\", 4 => \"four\", 5 => \"five\", 6 => \"six\", 7 => \"seven\", 8 => \"eight\", 9 => \"nine\", 10 => \"ten\", 11 => \"eleven\", 12 => \"twelve\", 13 => \"thirteen\", 14 => \"fourteen\", 15 => \"fifteen\", 16 => \"sixteen\", 17 => \"seventeen\", 18 => \"eighteen\", 19 => \"nineteen\", 20 => \"twenty\", 30 => \"thirty\", 40 => \"forty\", 50 => \"fifty\", 60 => \"sixty\", 70 => \"seventy\", 80 => \"eighty\", 90 => \"ninety\");\n$c = array(2 => \"twenty-\", 3 => \"thirty-\", 4 => \"forty-\", 5 => \"fifty-\", 6 => \"sixty-\", 7 => \"seventy-\", 8 => \"eighty-\", 9 => \"ninety-\");\nif(($a <= 20) || ($a == 30) || ($a == 40) || ($a == 50) || ($a == 60) || ($a == 70) || ($a == 80) || ($a == 90))\n{\n    print $b[$a];\n}\nelse\n{\n    print $c[$a[0]] . $b[$a[1]];\n}\n?>"}, {"source_code": "<?php\n\n$number = readline();\n\n$stringNumbers = array(\n    1 => 'one',\n    2 => 'two',\n    3 => 'three',\n    4 => 'four',\n    5 => 'five',\n    6 => 'six',\n    7 => 'seven',\n    8 => 'eight',\n    9 => 'nine',\n    10 => 'ten',\n    11 => 'eleven',\n    12 => 'twelve',\n    13 => 'thirteen',\n    15 => 'fifteen',\n    18 => 'eighteen',\n);\n\n$stringFirstNumbers = array(\n    1 => '',\n    2 => 'twenty',\n    3 => 'thirty',\n    4 => 'forty',\n    5 => 'fifty',\n    6 => 'sixty',\n    7 => 'seventy',\n    8 => 'eighty',\n    9 => 'ninety',\n);\n\nif ($number <= 13 || $number == 15 || $number == 18)\n    echo $number == 0 ? 'zero' : $stringNumbers[$number];\n\nelse {\n    $firstNumber = $number / 10;\n    $secondNumber = $number % 10;\n\n    if ((int)$firstNumber == 1) echo $stringNumbers[(int)$secondNumber].'teen';\n\n    else echo $stringNumbers[(int)$secondNumber] ? $stringFirstNumbers[(int)$firstNumber].'-'.$stringNumbers[(int)$secondNumber] : $stringFirstNumbers[(int)$firstNumber];\n}"}, {"source_code": "<?php\n// \u0412\u0445\u043e\u0434\u044f\u0449\u0435\u0435 \u0447\u0438\u0441\u043b\u043e: [0 < s < 99]\n$s = trim(fgets(STDIN));\n// \u0421\u043f\u0438\u0441\u043e\u043a \u0447\u0438\u0441\u043b\u0435 \u043e\u0442 1 \u0434\u043e 19, 20, 30, 40, 50, 60, 70, 80, 90\n$numbers = array('0' => 'zero', '1' => 'one', '2' => 'two', '3' => 'three', '4' => 'four', '5' => 'five', '6' => 'six', '7' => 'seven', '8' => 'eight', '9' => 'nine', '10' => 'ten', '11' => 'eleven', '12' => 'twelve', '13' => 'thirteen', '14' => 'fourteen', '15' => 'fifteen', '16' => 'sixteen', '17' => 'seventeen', '18' => 'eighteen', '19' => 'nineteen', '20' => 'twenty', '30' => 'thirty', '40' => 'forty', '50' => 'fifty', '60' => 'sixty', '70' => 'seventy', '80' => 'eighty', '90' => 'ninety');\n// \u0415\u0441\u043b\u0438 \u0447\u0438\u0441\u043b\u043e \u043c\u0435\u043d\u044c\u0448\u0435 \u0438\u043b\u0438 \u0440\u0430\u0432\u043d\u043e 19\nif ($s <= 19) {\n\t$result = $numbers[$s];\n} else {\n\t// \u041f\u0440\u043e\u0432\u0435\u0440\u044f\u0435\u043c \u0432\u0442\u043e\u0440\u043e\u0439 \u0441\u0438\u043c\u0432\u043e\u043b \u0432\u0432\u0435\u0434\u0435\u043d\u043d\u043e\u0433\u043e \u0447\u0438\u0441\u043b\u0430\n\tif($s[1]==0) {\n\t\t// \u0415\u0441\u043b\u0438 0, \u0442\u043e \u0432\u044b\u0432\u043e\u0434\u0438\u043c \u0438\u0437 \u043c\u0430\u0441\u0441\u0438\u0432\u0430\n\t\t$result = $numbers[$s];\n\t} else {\n\t\t// \u0415\u0441\u043b\u0438 \u043d\u0435\u0442, \u0442\u043e \u0441\u043e\u0431\u0438\u0440\u0430\u0435\u043c \u0447\u0438\u0441\u043b\u043e\n\t\t$first_number = $numbers[$s[0].'0'];\n\t\t$second_number = $numbers[$s[1]];\n\t\t$result = $first_number.'-'.$second_number;\n\t}\n}\nprint($result);\n?>"}, {"source_code": "<?php\n    \n$stdin = fopen('php://stdin','r');\n$n = trim(fgets($stdin));\n//$line = trim(fgets($stdin));\n//$a=explode(' ',$line);\nfclose($stdin);\n\n$m[0]='zero';\n\n$m[0]='zero';        \n$m[1]='one';             \n$m[2]='two';     \n$m[3]='three';      \n$m[4]='four';\n$m[5]='five';   \n$m[6]='six';        \n$m[7]='seven';      \n$m[8]='eight';   \n$m[9]='nine';   \n$m[11]='eleven';\n$m[10]='ten';   \n$m[12]='twelve';\n$m[13]='thirteen';\n$m[14]='fourteen';\n$m[15]='fifteen';\n$m[16]='sixteen';\n$m[17]='seventeen';\n$m[18]='eighteen';\n$m[19]='nineteen';\n$m[20]='twenty';\n$m[30]='thirty';\n$m[40]='forty';\n$m[50]='fifty';\n$m[60]='sixty';\n$m[70]='seventy';\n$m[80]='eighty';\n$m[90]='ninety';\nif ($n<=20) {$s=$m[$n];}\nelse {\n    if ($n%10==0) {$s=$m[$n];} else {$s=$m[floor($n/10)*10].'-'.$m[$n%10];}\n}\n\n\necho $s;\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = array(1 => \"one\", 2 => \"two\", 3 => \"three\", 4 => \"four\", 5 => \"five\", 6 => \"six\", 7 => \"seven\", 8 => \"eight\", 9 => \"nine\", 10 => \"ten\", 11 => \"eleven\", 12 => \"twelve\", 13 => \"thirteen\", 14 => \"fourteen\", 15 => \"fifteen\", 16 => \"sixteen\", 17 => \"seventeen\", 18 => \"eighteen\", 19 => \"nineteen\", 20 => \"twenty\", 30 => \"thirty\", 40 => \"forty\", 50 => \"fifty\", 60 => \"sixty\", 70 => \"seventy\", 80 => \"eighty\", 90 => \"ninety\");\n$c = array(2 => \"twenty-\", 3 => \"thirty-\", 4 => \"forty-\", 5 => \"fifty-\", 6 => \"sixty-\", 7 => \"seventy-\", 8 => \"eighty-\", 9 => \"ninety-\");\nif(($a <= 20) || ($a == 30) || ($a == 40) || ($a == 50) || ($a == 60) || ($a == 70) || ($a == 80) || ($a == 90))\n{\n    print $b[$a];\n}\nelseif($a == 0)\n{\n    print \"zero\";\n}\nelse\n{\n    print $c[$a[0]] . $b[$a[1]];\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = array(1 => \"one\", 2 => \"two\", 3 => \"three\", 4 => \"four\", 5 => \"five\", 6 => \"six\", 7 => \"seven\", 8 => \"eight\", 9 => \"nine\", 10 => \"ten\", 11 => \"eleven\", 12 => \"twelve\", 13 => \"thirteen\", 14 => \"fourteen\", 15 => \"fifteen\", 16 => \"sixteen\", 17 => \"seventeen\", 18 => \"eighteen\", 19 => \"nineteen\", 20 => \"twenty\", 30 => \"thirty\", 40 => \"forty\", 50 => \"fifty\", 60 => \"sixty\", 70 => \"seventy\", 80 => \"eighty\", 90 => \"ninety\");\n$c = array(2 => \"twenty-\", 3 => \"thirty-\", 4 => \"forty-\", 5 => \"fifty-\", 6 => \"sixty-\", 7 => \"seventy-\", 8 => \"eighty-\", 9 => \"ninety-\");\nif(($a <= 20) || ($a == 30) || ($a == 40) || ($a == 50) || ($a == 60) || ($a == 70) || ($a == 80) || ($a == 90))\n{\n    print $b[$a];\n}\nelseif($a == 0)\n{\n    print \"zero\";\n}\nelse\n{\n    print $c[$a[0]] . $b[$a[1]];\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = array(1 => \"one\", 2 => \"two\", 3 => \"three\", 4 => \"four\", 5 => \"five\", 6 => \"six\", 7 => \"seven\", 8 => \"eight\", 9 => \"nine\", 10 => \"ten\", 11 => \"eleven\", 12 => \"twelve\", 13 => \"thirteen\", 14 => \"fourteen\", 15 => \"fifteen\", 16 => \"sixteen\", 17 => \"seventeen\", 18 => \"eighteen\", 19 => \"nineteen\", 20 => \"twenty\");\n$c = array(2 => \"twenty-\", 3 => \"thirty-\", 4 => \"forty-\", 5 => \"fifty-\", 6 => \"sixty-\", 7 => \"seventy-\", 8 => \"eighty-\", 9 => \"ninety-\");\nif($a <= 20)\n{\n    print $b[$a];\n}\nelse\n{\n    print $c[$a[0]] . $b[$a[1]];\n}\n?>"}, {"source_code": "<?php\n\n$number = readline();\n\n$stringNumbers = array(\n    1 => 'one',\n    2 => 'two',\n    3 => 'three',\n    4 => 'four',\n    5 => 'five',\n    6 => 'six',\n    7 => 'seven',\n    8 => 'eight',\n    9 => 'nine',\n    10 => 'ten',\n    11 => 'eleven',\n    12 => 'twelve',\n    13 => 'thirteen',\n    15 => 'fifteen'\n);\n\n$stringFirstNumbers = array(\n    1 => '',\n    2 => 'twenty',\n    3 => 'thirty',\n    4 => 'forty',\n    5 => 'fifty',\n    6 => 'sixty',\n    7 => 'seventy',\n    8 => 'eighty',\n    9 => 'ninety',\n);\n\nif ($number <= 13 || $number == 15)\n    echo $number == 0 ? 'zero' : $stringNumbers[$number];\n\nelse {\n    $firstNumber = $number / 10;\n    $secondNumber = $number % 10;\n\n    if ((int)$firstNumber == 1) echo $stringNumbers[(int)$secondNumber].'teen';\n\n    else echo $stringNumbers[(int)$secondNumber] ? $stringFirstNumbers[(int)$firstNumber].'-'.$stringNumbers[(int)$secondNumber] : $stringFirstNumbers[(int)$firstNumber];\n}"}, {"source_code": "<?php\n\n$number = readline();\n\n$stringNumbers = array(\n    1 => 'one',\n    2 => 'two',\n    3 => 'three',\n    4 => 'four',\n    5 => 'five',\n    6 => 'six',\n    7 => 'seven',\n    8 => 'eight',\n    9 => 'nine',\n    10 => 'ten',\n    11 => 'eleven',\n    12 => 'twelve',\n    13 => 'thirteen',\n    15 => 'fifteen'\n);\n\n$stringFirstNumbers = array(\n    1 => '',\n    2 => 'twenty',\n    3 => 'thirty',\n    4 => 'forty',\n    5 => 'fifty',\n    6 => 'sixty',\n    7 => 'seventy',\n    8 => 'eighty',\n    9 => 'ninety',\n);\n\nif ($number <= 13 || $number === 15)\n    echo $number == 0 ? 'zero' : $stringNumbers[$number];\n\nelse {\n    $firstNumber = $number / 10;\n    $secondNumber = $number % 10;\n\n    if ((int)$firstNumber == 1) echo $stringNumbers[(int)$secondNumber].'teen';\n\n    else echo $stringNumbers[(int)$secondNumber] ? $stringFirstNumbers[(int)$firstNumber].'-'.$stringNumbers[(int)$secondNumber] : $stringFirstNumbers[(int)$firstNumber];\n}"}, {"source_code": "<?php\n\n$number = readline();\n\n$stringNumbers = array(\n    1 => 'one',\n    2 => 'two',\n    3 => 'three',\n    4 => 'four',\n    5 => 'five',\n    6 => 'six',\n    7 => 'seven',\n    8 => 'eight',\n    9 => 'nine',\n    10 => 'ten',\n    11 => 'eleven',\n    12 => 'twelve',\n    13 => 'thirteen',\n    15 => 'fifteen'\n);\n\n$stringFirstNumbers = array(\n    1 => '',\n    2 => 'twenty',\n    3 => 'thirty',\n    4 => 'forty',\n    5 => 'fifty',\n    6 => 'sixty',\n    7 => 'seventy',\n    8 => 'eighty',\n    9 => 'ninety',\n);\n\nif ($number <= 13 || $number === 15)\n    echo $number == 0 ? 'zero' : $stringNumbers[$number];\n\nelse {\n    $firstNumber = $number / 10;\n    $secondNumber = $number % 10;\n\n    if ((int)$firstNumber == 1) echo $stringNumbers[(int)$secondNumber].'teen';\n\n    else echo $stringFirstNumbers[(int)$firstNumber].$stringNumbers[(int)$secondNumber];\n}"}, {"source_code": "<?php\n\n$number = readline();\n\n$stringNumbers = array(\n    1 => 'one',\n    2 => 'two',\n    3 => 'three',\n    4 => 'four',\n    5 => 'five',\n    6 => 'six',\n    7 => 'seven',\n    8 => 'eight',\n    9 => 'nine',\n    10 => 'ten',\n    11 => 'eleven',\n    12 => 'twelve',\n    13 => 'thirteen',\n    15 => 'fifteen'\n);\n\n$stringFirstNumbers = array(\n    1 => '',\n    2 => 'twenty',\n    3 => 'thirty',\n    4 => 'forty',\n    5 => 'fifty',\n    6 => 'sixty',\n    7 => 'seventy',\n    8 => 'eighty',\n    9 => 'ninety',\n);\n\nif ($number <= 13 || $number === 15)\n    echo $number == 0 ? 'zero' : $stringNumbers[$number];\n\nelse {\n    $firstNumber = $number / 10;\n    $secondNumber = $number % 10;\n\n    if ((int)$firstNumber == 1) echo $stringNumbers[(int)$secondNumber].'teen';\n\n    else echo $stringFirstNumbers[(int)$firstNumber].'-'.$stringNumbers[(int)$secondNumber];\n}"}, {"source_code": "<?php\n// \u0412\u0445\u043e\u0434\u044f\u0449\u0435\u0435 \u0447\u0438\u0441\u043b\u043e: [0 < s < 99]\n$s = fgets(STDIN);\n// \u0421\u043f\u0438\u0441\u043e\u043a \u0447\u0438\u0441\u043b\u0435 \u043e\u0442 1 \u0434\u043e 19, 20, 30, 40, 50, 60, 70, 80, 90\n$numbers = array('0' => 'zero', '1' => 'one', 2 => 'two', 3 => 'three', 4 => 'four', 5 => 'five', 6 => 'six', 7 => 'seven', '8' => 'eight', 9 => 'nine', 10 => 'ten', 11 => 'eleven', 12 => 'twelve', 13 => 'thirteen', 14 => 'fourteen', 15 => 'fifteen', 16 => 'sixteen', 17 => 'seventeen', 18 => 'eighteen', 19 => 'nineteen', 20 => 'twenty', 30 => 'thirty', 40 => 'forty', 50 => 'fifty', 60 => 'sixty', 70 => 'seventy', 80 => 'eighty', 90 => 'ninety');\n// \u0415\u0441\u043b\u0438 \u0447\u0438\u0441\u043b\u043e \u043c\u0435\u043d\u044c\u0448\u0435 \u0438\u043b\u0438 \u0440\u0430\u0432\u043d\u043e 19\nif ($s <= 19) {\n\t$result = $numbers[$s];\n} else {\n\t// \u041f\u0440\u043e\u0432\u0435\u0440\u044f\u0435\u043c \u0432\u0442\u043e\u0440\u043e\u0439 \u0441\u0438\u043c\u0432\u043e\u043b \u0432\u0432\u0435\u0434\u0435\u043d\u043d\u043e\u0433\u043e \u0447\u0438\u0441\u043b\u0430\n\tif($s[1]==0) {\n\t\t// \u0415\u0441\u043b\u0438 0, \u0442\u043e \u0432\u044b\u0432\u043e\u0434\u0438\u043c \u0438\u0437 \u043c\u0430\u0441\u0441\u0438\u0432\u0430\n\t\t$result = $numbers[$s];\n\t} else {\n\t\t// \u0415\u0441\u043b\u0438 \u043d\u0435\u0442, \u0442\u043e \u0441\u043e\u0431\u0438\u0440\u0430\u0435\u043c \u0447\u0438\u0441\u043b\u043e\n\t\t$first_number = $numbers[$s[0].'0'];\n\t\t$second_number = $numbers[$s[1]];\n\t\t$result = $first_number.'-'.$second_number;\n\t}\n}\nprintf($result);\n?>"}], "src_uid": "a49ca177b2f1f9d5341462a38a25d8b7"}
{"nl": {"description": "Little Petya was given this problem for homework:You are given function  (here  represents the operation of taking the remainder). His task is to count the number of integers x in range [a;b] with property f(x)\u2009=\u2009x.It is a pity that Petya forgot the order in which the remainders should be taken and wrote down only 4 numbers. Each of 24 possible orders of taking the remainder has equal probability of being chosen. For example, if Petya has numbers 1, 2, 3, 4 then he can take remainders in that order or first take remainder modulo 4, then modulo 2, 3, 1. There also are 22 other permutations of these numbers that represent orders in which remainder can be taken. In this problem 4 numbers wrote down by Petya will be pairwise distinct.Now it is impossible for Petya to complete the task given by teacher but just for fun he decided to find the number of integers  with property that probability that f(x)\u2009=\u2009x is not less than 31.4159265352718281828459045%. In other words, Petya will pick up the number x if there exist at least 7 permutations of numbers p1,\u2009p2,\u2009p3,\u2009p4, for which f(x)\u2009=\u2009x.", "input_spec": "First line of the input will contain 6 integers, separated by spaces: p1,\u2009p2,\u2009p3,\u2009p4,\u2009a,\u2009b (1\u2009\u2264\u2009p1,\u2009p2,\u2009p3,\u2009p4\u2009\u2264\u20091000,\u20090\u2009\u2264\u2009a\u2009\u2264\u2009b\u2009\u2264\u200931415).  It is guaranteed that numbers p1,\u2009p2,\u2009p3,\u2009p4 will be pairwise distinct.", "output_spec": "Output the number of integers in the given range that have the given property.", "sample_inputs": ["2 7 1 8 2 8", "20 30 40 50 0 100", "31 41 59 26 17 43"], "sample_outputs": ["0", "20", "9"], "notes": null}, "positive_code": [{"source_code": "<?php \n$IN = STDIN;\nfscanf($IN, \"%d %d %d %d %d %d\", $koef1, $koef2, $koef3, $koef4, $a, $b);\n$koeff = Array($koef1, $koef2, $koef3, $koef4);\n\n\n$comb[] = Array(0,1,2,3);\n$comb[] = Array(0,1,3,2);\n$comb[] = Array(0,2,1,3);\n$comb[] = Array(0,2,3,1);\n$comb[] = Array(0,3,1,2);\n$comb[] = Array(0,3,2,1);\n$comb[] = Array(1,0,2,3);\n$comb[] = Array(1,0,3,2);\n$comb[] = Array(1,2,0,3);\n$comb[] = Array(1,2,3,0);\n$comb[] = Array(1,3,0,2);\n$comb[] = Array(1,3,2,0);\n$comb[] = Array(2,0,1,3);\n$comb[] = Array(2,0,3,1);\n$comb[] = Array(2,1,0,3);\n$comb[] = Array(2,1,3,0);\n$comb[] = Array(2,3,0,1);\n$comb[] = Array(2,3,1,0);\n$comb[] = Array(3,0,1,2);\n$comb[] = Array(3,0,2,1);\n$comb[] = Array(3,1,0,2);\n$comb[] = Array(3,1,2,0);\n$comb[] = Array(3,2,0,1);\n$comb[] = Array(3,2,1,0);\n\n\nfunction TargetFunction ($x,$a1,$a2,$a3,$a4){\n  return (((($x % $a1) % $a2) %$a3 ) % $a4);\n}\n\n\n$coolxcnt = 0;\nfor ($x=$a; $x<=$b; $x++){\n    $xcnt=0;\n    foreach ($comb as $coolset){\n        if ($x==TargetFunction($x,$koeff[$coolset[0]],$koeff[$coolset[1]],$koeff[$coolset[2]],$koeff[$coolset[3]])){\n            $xcnt++;\n            if ($xcnt>7){\n                $coolxcnt++;\n                break;\n            }\n        \n        }    \n    } \n}\necho $coolxcnt;\n\n\n?>"}, {"source_code": "<?php \n$IN = STDIN;\nfscanf($IN, \"%d %d %d %d %d %d\", $k1, $k2, $k3, $k4, $a, $b);\n$min = min(array($k1, $k2, $k3, $k4));\nif ($min>$b)\n   echo $b-$a+1;\nelseif (($min>$a)&&($min<$b))\n  echo $min - $a;\nelse  \n    echo 0;\n?>\n"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d %d %d %d %d %d\", $p1, $p2, $p3, $p4, $a, $b);\n    $min = min(min($p1, $p2), min($p3, $p4));\n    printf(\"%d\\n\", max(0, min($b + 1 - $a, $min - $a)));\n   ?>"}], "negative_code": [{"source_code": "<?php \n$IN = STDIN;\nfscanf($IN, \"%d %d %d %d %d %d\", $k1, $k2, $k3, $k4, $a, $b);\n$min = min(array($k1, $k2, $k3, $k4));\nif ($min>$b)\n   echo $b-$a;\nelseif (($min>$a)&&($min<$b))\n  echo $min - $a;\nelse  \n    echo 0;\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d %d %d %d %d %d\", $p1, $p2, $p3, $p4, $a, $b);\n    $min = min(min($p1, $p2), min($p3, $p4));\n    printf(\"%d\\n\", max(0, min($b - $a, $min - $a)));\n   ?>"}], "src_uid": "63b9dc70e6ad83d89a487ffebe007b0a"}
{"nl": {"description": "Kolya is very absent-minded. Today his math teacher asked him to solve a simple problem with the equation $$$a + 1 = b$$$ with positive integers $$$a$$$ and $$$b$$$, but Kolya forgot the numbers $$$a$$$ and $$$b$$$. He does, however, remember that the first (leftmost) digit of $$$a$$$ was $$$d_a$$$, and the first (leftmost) digit of $$$b$$$ was $$$d_b$$$.Can you reconstruct any equation $$$a + 1 = b$$$ that satisfies this property? It may be possible that Kolya misremembers the digits, and there is no suitable equation, in which case report so.", "input_spec": "The only line contains two space-separated digits $$$d_a$$$ and $$$d_b$$$ ($$$1 \\leq d_a, d_b \\leq 9$$$).", "output_spec": "If there is no equation $$$a + 1 = b$$$ with positive integers $$$a$$$ and $$$b$$$ such that the first digit of $$$a$$$ is $$$d_a$$$, and the first digit of $$$b$$$ is $$$d_b$$$, print a single number $$$-1$$$. Otherwise, print any suitable $$$a$$$ and $$$b$$$ that both are positive and do not exceed $$$10^9$$$. It is guaranteed that if a solution exists, there also exists a solution with both numbers not exceeding $$$10^9$$$.", "sample_inputs": ["1 2", "4 4", "5 7", "6 2"], "sample_outputs": ["199 200", "412 413", "-1", "-1"], "notes": null}, "positive_code": [{"source_code": "<?php\n\n$str=readline();\n\n$a = $str[0];\n$b = $str[2];\n\nif($a === $b){\n    echo $a.\"00 \".$b.\"01\";\n    return 0;\n}\n\nif($a + 1 == $b){\n    echo $a.\"99 \".$b.\"00\";\n    return 0;\n}\n\nif($a == 9 && $b == 1){\n    echo '99 100';\n    return 0;\n}\n\necho '-1';"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\nif(($a == 9) && ($b == 1))\n{\n     print \"9 10\";\n}\nelseif($a == $b)\n{\n     print $a . \"1 \" . $b . \"2\";\n}\nelseif($a + 1 == $b)\n{\n     print $a . \"9 \" . $b . \"0\";\n}\nelse\n{\n     print \"-1\";\n}\n?>"}], "negative_code": [{"source_code": "<?php\n\n$str=readline();\n\n$a = $str[0];\n$b = $str[2];\n\nif($a === $b){\n    echo $a.\"00 \".$b.\"01\";\n    return 0;\n}\n\nif($a + 1 == $b){\n    echo $a.\"99 \".$b.\"00\";\n    return 0;\n}\n\nif($a == 1 && $b == 9){\n    echo '99 100';\n    return 0;\n}\n\necho '-1';"}, {"source_code": "<?php\n\n$str=readline();\n\n$a = $str[0];\n$b = $str[2];\n\nif($a === $b){\n    echo $a.\"00 \".$b.\"01\";\n}\n\nif($a + 1 == $b){\n    echo $a.\"99 \".$b.\"00\";\n}\n\nif($a == 1 && $b == 9){\n    echo '99 100';\n}\n\necho '-1';"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\nif($a == $b)\n{\n     print $a . \"1 \" . $b . \"2\";\n}\nelseif($a + 1 == $b)\n{\n     print $a . \"9 \" . $b . \"0\";\n}\nelse\n{\n     print \"-1\";\n}\n?>"}], "src_uid": "3eff6f044c028146bea5f0dfd2870d23"}
{"nl": {"description": "Capitalization is writing a word with its first letter as a capital letter. Your task is to capitalize the given word.Note, that during capitalization all the letters except the first one remains unchanged.", "input_spec": "A single line contains a non-empty word. This word consists of lowercase and uppercase English letters. The length of the word will not exceed 103.", "output_spec": "Output the given word after capitalization.", "sample_inputs": ["ApPLe", "konjac"], "sample_outputs": ["ApPLe", "Konjac"], "notes": null}, "positive_code": [{"source_code": "<?php\nfscanf(STDIN, '%s\\n', $line);\n\n$line = str_split($line, 1); \t\t// \u0440\u0430\u0437\u0431\u0438\u0432\u0430\u0435\u043c \u0441\u0442\u0440\u043e\u043a\u0443 \u043d\u0430 \u043c\u0430\u0441\u0441\u0438\u0432 \u0431\u0443\u043a\u0432\n\nif($line[0] != ctype_upper($line[0])){\n\t$line[0] = strtoupper($line[0]);\n}\n\nforeach($line as $v){\n\tprintf($v);\n}"}, {"source_code": "<?php\nfscanf(STDIN, '%s', $s);\necho ucfirst($s);"}, {"source_code": "        <?php\n  $fr = fopen(\"php://stdin\", \"r\");\n  \n \n  fscanf($fr, \"%s\", $str);\n\n$arr0 = str_split($str);\n\n$arr0[0]=  strtoupper($arr0[0]);\n\n$comma_separated = implode(\"\", $arr0);\n\necho $comma_separated;\n\nfclose($fr);\n  \n?>"}, {"source_code": "<?php \n\n$std = fopen(\"php://stdin\", \"r\");\nfscanf($std, \"%s\",$str);\necho ucwords($str).\"\\n\";"}, {"source_code": "<?\n$a = trim(fgets(STDIN));\n$ar = str_split($a);\n$x = strtoupper($ar[0]);\nfor($i=1;$i<count($ar);$i++)\n    {\n        $x .= $ar[$i];\n    }\n   echo $x;\n?>"}, {"source_code": "<?php\nwhile (fscanf(STDIN, \"%s\", $s)){\n    if ($s[0] >= 'a' && $s[0] <= 'z'){\n        $s[0] = strtoupper($s[0]);\n    }\n    echo $s;\n    echo \"\\n\";\n}"}, {"source_code": "<?php\n$line = fgets(STDIN);\n\n$line[0] = strtoupper($line[0]);\necho $line;"}, {"source_code": "<?php\n//281A: Word Capitalization\n$word = trim(fgets(STDIN)); //$word = \"ApPLe\";\n$explode = str_split($word);\n$explode[0] = strtoupper($explode[0]);\n$implode = implode($explode);\necho $implode;\n?>"}, {"source_code": "<?php\n\t$input = trim(fgets(STDIN));\n\techo ucfirst($input);\n?>"}, {"source_code": "<?php\nfscanf(STDIN,\"%s\",$s);\n$a=strtoupper(substr($s,0,1));\n$b=$a.substr($s,1,(strlen($s)-1));\necho $b;"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split($a);\n$b[0] = strtoupper($b[0]);\n$c = implode($b);\nprint $c;\n?>"}, {"source_code": "<?php\n$word = fgets(STDIN);\n$word = str_split($word);\nif (!ctype_upper($word[0])) {\n    $word[0] = strtoupper($word[0]);\n}\necho implode($word); \n?>"}, {"source_code": "<?php\n    $fp = fopen('php://stdin', 'r');\n    echo ucfirst(rtrim(fgets($fp)));\n?>"}, {"source_code": "<?php\n\t$in = fgets(STDIN);\n\t$len = strlen($in);\n\techo strtoupper(substr($in,0,1)).substr($in,1,$len-1);"}, {"source_code": "<?php\n    $dir = explode(' ',stream_get_contents(fopen(\"php://stdin\", 'r')));\n    for($i = 0; $i < count($dir); $i++){\n        echo ucfirst($dir[$i]);\n    }\n?>"}, {"source_code": "<?php print(ucfirst(fgets(STDIN))); ?>"}, {"source_code": "<?php\n$string = trim(fgets(STDIN));\n\necho strtoupper(substr($string, 0 , 1)) .substr($string, 1);"}, {"source_code": "<?php\n    function islower($c) {\n        return ($c >= 'a' && $c <= 'z');\n    }\n    \n    $s = trim(fgets(STDIN));\n    \n    if (islower($s[0])) {\n        $char = ord($s[0]) + ord(\"A\") - ord(\"a\");\n        $s[0] = chr($char);\n    }\n    \n    echo $s;\n?>"}, {"source_code": "<?php \n    \n    $word = fgets(STDIN);\n    if(ctype_lower($word[0])){\n    \t$word = ucfirst($word);\n    }\n    echo $word;\n\n?>"}, {"source_code": "#!/usr/bin/php\n<?php\n$s = fopen(\"php://stdin\", 'r');\n$word = fgets($s);\necho ucfirst($word);"}, {"source_code": "<?php\n$s=trim(fgets(STDIN));\n$s[0]=strtoupper($s[0]);\necho $s;\n?>"}, {"source_code": "<?php\n\n$s =  str_split(readline());\n$s[0] = strtoupper($s[0]);\n\necho implode('',$s);\n"}, {"source_code": "<?php\n$str = readline();\nif($str[0]>='a') $str[0] = chr(ord($str[0]) - 32);\necho $str;"}, {"source_code": "<?php\n/**\n * Secdra @2020\n */\n\n$word = trim(fgets(STDIN));\n$word[0] = strtoupper($word[0]);\nprintf(\"%s\", $word);\n"}, {"source_code": "<?php\necho ucfirst(readline());"}, {"source_code": "<?php\n$dir= fopen('php://stdin','r');\n$filr= file('php://stdin');\n$str= trim($filr[0]);\n$cap=[];\nfor ($i=0,$c=strlen($str);$i<$c;$i++){\n    if ($i==0){\n        $cap[]=strtoupper($str[$i]);\n    }else{\n        $cap[]=$str[$i];\n    }\n}\necho implode('',$cap);"}, {"source_code": "<?php\n\n$a = trim(fgets(STDIN));\nfor($i=1 ; $a[$i] ; $i++)\n   $b = $b.$a[$i];\n\necho strtoupper($a[0]).$b;\n?>"}, {"source_code": "<?php\n    echo ucfirst(fgets(STDIN));"}, {"source_code": "<?php\n    $n = trim(fgets(STDIN));\n    $n[0] = strtoupper($n[0]);\n    fwrite(STDOUT, $n);"}, {"source_code": "<?php\nwhile($s = fgets(STDIN)){\n    $input .= $s;\n}\n\n$input = (string) $input;\n$input[0] = strtoupper($input[0]);\necho $input;"}, {"source_code": "<?php\n\techo ucfirst(trim(fgets(STDIN)));\n?>"}, {"source_code": "<?php\n\n$w =  fgets(STDIN);\n\n$stri = (string)$w;\n$n = strlen($stri);\n\n$a = $stri[0];\nif(ord($a)>96 && ord($a)<123) {  $stri[0] = chr((ord($a)-32)); \n\t\t//for($i=0;$i<$n;$i++){echo $stri[$i];}\n\t\t}\n//echo ord($a);\n\necho $stri;\n"}, {"source_code": "<?php\n $arr=fgets(STDIN);\n\n  echo(ucfirst($arr));\n  \n ?>"}, {"source_code": "<?php\n// Retrieve input\n$stdin = fopen('php://stdin', 'r');\nfunction input() \n{\n    global $stdin;\n    $ashar = explode(\" \", trim(fgets($stdin)));\n    return $ashar[0];\n}\n\n$N = input();\n$N[0] = strtoupper($N[0]);\necho $N;\necho \"\\n\";\n\n?>"}, {"source_code": "<?php\n\t$n = trim(fgets(STDIN));\n\t$res = ucfirst($n);\n\tfwrite(STDOUT,\"$res\");\n?>"}, {"source_code": "<?php\n$fp = fopen(\"php://STDIN\", \"r\");\n$s = fgets($fp);\n$s2 = substr($s, 1);\necho strtoupper($s[0]).$s2;\n?>"}, {"source_code": "<?php\n// Retrieve input\n$stdin = fopen('php://stdin', 'r');\nfunction input() \n{\n    global $stdin;\n    $ashar = explode(\" \", trim(fgets($stdin)));\n    return $ashar[0];\n}\n\n$N = input();\n$N[0] = strtoupper($N[0]);\necho $N;\necho \"\\n\";\n\n?>"}, {"source_code": "<?php\n$string = trim(fgets(STDIN));\necho ucfirst($string);\n"}, {"source_code": "<?php\n\nfunction dd(...$args)\n{\n    var_dump(...$args);\n    die;\n}\n\ndefine('TXTIN', fopen('input.txt', 'r'));\ndefine('TXTOUT', fopen('output.txt', 'w'));\n\n//$input = TXTIN;\n$input = STDIN;\n//$output = TXTOUT;\n$output = STDOUT;\n\nfunction foo($s)\n{\n    $newS0 = strtoupper($s[0]);\n    $s[0] = $newS0;\n\n    return $s;\n}\n\n$r = 0;\n\nlist($s) = fscanf($input, \"%s\");\n\nif ($s === null) {\n    $r = '';\n} else {\n    $r = foo($s);\n}\n\nfwrite($output, $r);\n\n"}, {"source_code": "<?php\necho ucfirst(trim(fgets(STDIN)));"}, {"source_code": "<?php\n$w = trim(fgets(STDIN));\necho ucfirst($w);"}, {"source_code": "<?php\n$word = trim(fgets(STDIN));\necho strtoupper($word[0]).substr($word,1);"}, {"source_code": "<?php\n\nfunction getStdIn(bool $asInt = false): array\n{\n    $stdIn = explode(' ', trim(fgets(STDIN)));\n\n    if ($asInt) {\n        foreach ($stdIn as $key => $value) {\n            $stdIn[$key] = (int)$value;\n        }\n    }\n\n    return $stdIn;\n}\n\nfunction stdOut($output)\n{\n    fwrite(STDOUT, $output);\n}\n\nfunction solve(): void\n{\n    [$word] = getStdIn();\n    stdOut(ucfirst($word));\n}\n\nsolve();\n"}, {"source_code": "<?php\necho ucfirst(trim(fgets(STDIN)));"}, {"source_code": "<?php\n    \n$stdin = fopen('php://stdin','r');\n$s = trim(fgets($stdin));\nfclose($stdin);\n\necho ucfirst($s);\n?>"}, {"source_code": "<?php\n$ip     = fopen('php://stdin', \"r\");\n$op     = fopen('php://stdout',\"w\");\n\nfwrite($op, sprintf(\"%s\", ucwords(trim(fgets($ip)))));\n?>"}, {"source_code": "<?php\n$str=trim(fgets(STDIN));\n$len=strlen($str);\n$rest=\"\";\nfor($i=1;$i<$len;$i++)\n\t$rest.=$str[$i];\n//$j=json_encode($rest);\necho strtoupper($str[0]).$rest;"}, {"source_code": "<?php\n\n$fi = fopen('php://stdin', 'r');\n$a=fgets($fi);\n//$address=fgets($fi)*1;\n//$time=fgets($fi)*1;\n//$address = 'Python';\n\n//$a = 'ApPLe';\necho ucfirst($a);"}, {"source_code": "<?php\n$string = trim(fgets(STDIN));\necho ucfirst($string);\n?>\n"}, {"source_code": "<?php\n    $f = fopen('php://stdin', 'r');\n    //$f = fopen('1q.txt', 'r');\n    $s = trim(fgets($f));\n\n    echo strtoupper($s[0]).substr($s,1);\n\n\n\n"}, {"source_code": "<?php\n\n$stdout = fopen(getenv(\"OUTPUT_PATH\"), \"w\");\n$stdin = fopen(\"php://stdin\", \"r\");\n\nfscanf($stdin, \"%s\", $s);\n\nif( ord( $s[0] ) >= 97 )\n{\n     $s[0] = strtoupper( $s[0] ) ;\n}\necho $s ;\n\nfwrite($stdout);\n\nfclose($stdin);\nfclose($stdout);\n\n?>"}, {"source_code": "<?php\n$word = rtrim(fgets(STDIN)); \n\nif(ctype_upper($word[0])){\n    echo($word);\n}else{\n    echo(ucfirst($word));\n}"}, {"source_code": "<?php\n\nfscanf(STDIN, \"%s\\n\", $str);\n\necho ucfirst($str);\n\n?>"}, {"source_code": "<?php\n\nfscanf(STDIN, \"%s\\n\", $str);\n\n$str_chars = str_split($str);\n\n$oldOrd = ord($str_chars[0]);\n\nif ($oldOrd >= 97 && $oldOrd <= 122) {\n    $newOrd = ord($str_chars[0]) - 32;\n    $str_chars[0] = chr($newOrd);\n}\n\n$new_str = implode(\"\", $str_chars);\n\necho $new_str;\n\n?>"}, {"source_code": "<?php\necho ucfirst(trim(fgets(STDIN)));"}, {"source_code": "<?php\n$s = trim(fgets(STDIN));\nprint ucfirst($s);\n?>"}, {"source_code": "<?php\n  $f = fopen('php://stdin', 'r');\n  echo strtoupper(fgetc($f)) . fgets($f);\n?>"}, {"source_code": "<?php\n//input\n$s = fopen(\"php://stdin\", 'r');\n$x = stream_get_contents($s);\n\n//data\n\n\n//calc\n$x = strtoupper($x[0]).substr($x,1);\n\n//output\n$stdout = fopen('php://stdout', 'w');\nfputs ($stdout, $x);\n\n\n?>"}, {"source_code": "<?php\necho ucfirst(trim(fgets(STDIN)));"}, {"source_code": "<?php\n\n//First Get The Input.\n$input = file_get_contents(\"php://stdin\");\n\n$the_word = $input;\n\n$lower = \"abcdefghijklmnopqrstuvwxyz\";\n\n$upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n\n//Transfer $upper & $lower Into Array.\n$lower = str_split($lower);\n\n$upper = str_split($upper);\n\n//Combine.\n$words = array_combine($lower,$upper);\n\n//Transfer The First Letter From The Input.\n$the_word[0] = $words[$the_word[0]];\n\necho $the_word;\n\n?>"}, {"source_code": "<?php\necho ucfirst(trim(fgets(STDIN)));\n?>"}, {"source_code": "<?php\n// 281A \t    \u041a\u0430\u043f\u0438\u0442\u0430\u043b\u0438\u0437\u0430\u0446\u0438\u044f \u0441\u043b\u043e\u0432\u0430 \n\n$in = fopen(\"php://stdin\", 'r');\n\n$char = fgetc($in);\n$char = strtoupper($char);\n\n$line = fgets($in);\n\n\necho $char . $line;\n\n?>"}, {"source_code": "<?php\n$n =rtrim(fgets(STDIN));\n$n[0] = strtoupper($n[0]);\n\necho $n;"}, {"source_code": "<?php\n    fscanf(STDIN, \"%s\\n\",$str1);\n    echo ucfirst($str1);\n?>"}, {"source_code": "<?php\n\n$string = fgets(STDIN);\n\n$string[0] = strtoupper($string[0]);\n\necho $string;"}], "negative_code": [{"source_code": "<?php\n//281A: Word Capitalization\n$word = trim(fgets(STDIN)); $word = \"ApPLe\";\n$explode = str_split($word);\n$explode[0] = strtoupper($explode[0]);\n$implode = implode($explode);\necho $implode;\n?>"}, {"source_code": "<?php\nfscanf(STDIN,\"%s\",$s);\n$x=substr($s,0,1);\n$a=strtoupper(substr($s,0,1));\n$b=explode(\"$x\",$s);\n$c=$a.implode(\"\",$b);\necho $c;"}, {"source_code": "<?php\n\t$in = fgets(STDIN);\n\t$len = strlen($in);\n\t$flag = true;\n\tfor ($x = 0; $x < $len; $x++) {\n\t\tif ($in[$x] >= 'A' && $in[$x] <= 'Z') {\n\t\t\t$flag = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif ($flag) {\n\t\techo strtoupper(substr($in,0,1)).substr($in,1,$len-1);\n\t} else echo $in;"}, {"source_code": "<?php\n\n$a = 'aasdDkjKBJk';\nfor($i=1 ; $a[$i] ; $i++)\n   $b = $b.$a[$i];\n\necho strtoupper($a[0]).$b;\n"}, {"source_code": "$a = trim(fgets(STDIN));\nfor($i=1 ; $a[$i] ; $i++)\n   $b = $b.$a[$i];\n\necho strtoupper($a[0]).$b;\n"}, {"source_code": "<?php\n $arr=fgets(STDIN);\n $a=strtoupper($arr[0]);\n echo($a . $arr);\n  \n ?>"}, {"source_code": "<?php\n$string = $argv[1];\necho ucfirst($string);\n"}, {"source_code": "<?php\n$word = trim(fgets(stdin));\necho strtoupper($word[0]).substr($word,1);"}, {"source_code": "<?php\n\nfunction getStdIn(bool $asInt = false): array\n{\n    $stdIn = explode(' ', trim(fgets(STDIN)));\n\n    if ($asInt) {\n        foreach ($stdIn as $key => $value) {\n            $stdIn[$key] = (int)$value;\n        }\n    }\n\n    return $stdIn;\n}\n\nfunction stdOut($output)\n{\n    fwrite(STDOUT, $output);\n}\n\nfunction solve(): void\n{\n    [$word] = getStdIn(true);\n    stdOut(ucfirst($word));\n}\n\nsolve();\n"}, {"source_code": "<?php\n    sscanf(STDIN, \"%s\\n\",$str1);\n    echo ucfirst($str1);\n        \n?>"}], "src_uid": "29e0fc0c5c0e136ac8e58011c91397e4"}
{"nl": {"description": "Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There are four move operations at all:  'U': go up, (x, y) \u2009\u2192\u2009 (x, y+1);  'D': go down, (x, y) \u2009\u2192\u2009 (x, y-1);  'L': go left, (x, y) \u2009\u2192\u2009 (x-1, y);  'R': go right, (x, y) \u2009\u2192\u2009 (x+1, y). The robot will do the operations in s from left to right, and repeat it infinite times. Help Fox Ciel to determine if after some steps the robot will located in (a,\u2009b).", "input_spec": "The first line contains two integers a and b, (\u2009-\u2009109\u2009\u2264\u2009a,\u2009b\u2009\u2264\u2009109). The second line contains a string s (1\u2009\u2264\u2009|s|\u2009\u2264\u2009100, s only contains characters 'U', 'D', 'L', 'R') \u2014 the command.", "output_spec": "Print \"Yes\" if the robot will be located at (a,\u2009b), and \"No\" otherwise.", "sample_inputs": ["2 2\nRU", "1 2\nRU", "-1 1000000000\nLRRLU", "0 0\nD"], "sample_outputs": ["Yes", "No", "Yes", "Yes"], "notes": "NoteIn the first and second test case, command string is \"RU\", so the robot will go right, then go up, then right, and then up and so on.The locations of its moves are (0, 0) \u2009\u2192\u2009 (1, 0) \u2009\u2192\u2009 (1, 1) \u2009\u2192\u2009 (2, 1) \u2009\u2192\u2009 (2, 2) \u2009\u2192\u2009 ...So it can reach (2, 2) but not (1, 2)."}, "positive_code": [{"source_code": "<?\n$s = fopen(\"php://stdin\", 'r');\n$n = stream_get_contents($s);\n$dum = explode(\"\\n\",$n); \n\n$arr = explode(' ', $dum[0]);\n$a = (int) $arr[0];\n$b = (int) $arr[1];\n$path = $dum[1];\n\n/*$a=-2;\n$b=-2;\n$path='UURR';*/\n\n$c_posx=0;\n$c_posy=0;\n\n$length=strlen($path);\n$cur_pos=0;\n\n$min_x=9999999;\n$max_x=-10000000;\n$min_y=9999999;\n$max_y=-10000000;\n\n$i=0;\nwhile($i<$length*2)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    \n    if ($i<$length)\n    {\n        if ($min_x>$c_posx) $min_x=$c_posx;\n        if ($min_y>$c_posy) $min_y=$c_posy;\n        \n        if ($max_x<$c_posx) $max_x=$c_posx;\n        if ($max_y<$c_posy) $max_y=$c_posy;\n    }\n    \n    $i++;\n    if ($i==$length)\n    {\n        $change_x=$c_posx;\n        $change_y=$c_posy;\n    }\n    if ($i==$length*2)\n    {\n        $change_x_2=$c_posx;\n        $change_y_2=$c_posy;\n    }\n    $cur_pos++;\n}\n\n$plav_x=$max_x-$min_x;\n$plav_y=$max_y-$min_y;\n\n\nif ($plav_x>$plav_y) $plav=$plav_x; else $plav=$plav_y;\n\n\n$itog_x=$change_x_2-$change_x;\n$itog_y=$change_y_2-$change_y;\n\n$num_x_cycles=abs($a)/abs($itog_x);\n$num_y_cycles=abs($b)/abs($itog_y);\n\nif ($num_x_cycles>$num_y_cycles) $num_cycles=$num_x_cycles; else $num_cycles=$num_y_cycles;\n\n$go_iterations=ceil($num_cycles)-$plav;\n\n$c_posx=$itog_x*$go_iterations;\n$c_posy=$itog_y*$go_iterations;\n\n\n$i=0;\n$cur_pos=0;\nwhile($i<$length*($plav+1))\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    if ($c_posx==$a && $c_posy==$b && $plav==0) die('Yes');\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    //echo $current_word.' '.$c_posx.' '.$c_posy.'<BR>';\n    \n    \n    $i++;\n    \n    //if (($i % $length) == 0  && $i!=0) echo '<BR>';\n    \n    $cur_pos++;\n    if ($c_posx==$a && $c_posy==$b) die('Yes');\n}\ndie('No');\n?>"}, {"source_code": "<?php\n/** chaotic_iak's solution in PHP 5.4 to the problem 321A (Round 190 Div 2 Problem C) in Codeforces **/\n\n/** Module for retrieving input **/\n\n// If this is a local test (a variable declared in a specialized page to open this script), open from localtest.txt instead of php://stdin (because I'm too lazy to supply the arguments by stdin)\nif (isset($localtest)) {$stdin = fopen(\"localtest.txt\", \"r\");} else {$stdin = fopen(\"php://stdin\", \"r\");}\n\n// A function to retrieve the next line. Takes one optional argument $single, which should be true if the next line (based on problem's specification) has only one number/string/whatever, so I don't have to do silly things like $raw = g(); $num = $raw[0];\nfunction g($single = false) {\n\n\t// Take the global $stdin variable aka the file handler so we can access it from this function\n\tglobal $stdin;\n\t\n\t// Take the input from the handler, trim it, and explode it based on space (\" 1 2 3 \" becomes array(\"1\", \"2\", \"3\")); trim is usually to remove trailing \\r\n\t$input = explode(\" \", trim(fgets($stdin)));\n\t\n\t// If the line is not a single number, return the whole array, otherwise simply return the single string that we exploded for nothing\n\tif (!$single) {return $input;} else {return $input[0];}\n}\n\n/** Imported functions from chaotic_iak's library **/\n// none\n\n/** chaotic_iak's solution **/\n// This is a competitive programming solution. The code is not remarked (because I want speed).\n\n$raw = g();\n$a = $raw[0];\n$b = $raw[1];\n$s = g(true);\n$len = strlen($s);\n\n$xpass = array(0);\n$ypass = array(0);\n$x = 0;\n$y = 0;\nfor ($i = 0; $i < $len; $i++) {\n\tswitch (substr($s, $i, 1)) {\n\t\tcase \"U\":\n\t\t\t$y++;\n\t\t\tbreak;\n\t\tcase \"R\":\n\t\t\t$x++;\n\t\t\tbreak;\n\t\tcase \"L\":\n\t\t\t$x--;\n\t\t\tbreak;\n\t\tcase \"D\":\n\t\t\t$y--;\n\t\t\tbreak;\n\t}\n\t$xpass[] = $x;\n\t$ypass[] = $y;\n}\n\n$xmax = $xpass[$len];\n$ymax = $ypass[$len];\n\nfor ($i = 0; $i < $len; $i++) {\n\t$diffx = -1;\n\t$diffy = -1;\n\tif ($xmax == 0) {\n\t\tif ($xpass[$i] == $a) {$diffx = 1234567890;}\n\t} else {\n\t\t$temp = ($a - $xpass[$i]) % $xmax;\n\t\tif (!$temp) {$diffx = ($a - $xpass[$i]) / $xmax;}\n\t}\n\tif ($ymax == 0) {\n\t\tif ($ypass[$i] == $b) {$diffy = 1234567890;}\n\t} else {\n\t\t$temp = ($b - $ypass[$i]) % $ymax;\n\t\tif (!$temp) {$diffy = ($b - $ypass[$i]) / $ymax;}\n\t}\n\tif ((($diffx == 1234567890) || ($diffy == 1234567890) || ($diffx == $diffy)) && ($diffx >= 0) && ($diffy >= 0)) {\n\t\techo \"Yes\"; return 0;\n\t}\n}\necho \"No\";"}], "negative_code": [{"source_code": "<?\n$s = fopen(\"php://stdin\", 'r');\n$n = stream_get_contents($s);\n$dum = explode(\"\\n\",$n); \n\n$arr = explode(' ', $dum[0]);\n$a = (int) $arr[0];\n$b = (int) $arr[1];\n$path = $dum[1];\n\n/*$a=4;\n$b=3;\n$path='UURRDL';*/\n\n$c_posx=0;\n$c_posy=0;\n\n$length=strlen($path);\n$cur_pos=0;\n\n$i=0;\nwhile($i<$length*2)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    if ($i==$length)\n    {\n        $change_x=$c_posx;\n        $change_y=$c_posy;\n    }\n    if ($i==$length*2)\n    {\n        $change_x_2=$c_posx;\n        $change_y_2=$c_posy;\n    }\n    $cur_pos++;\n}\n\n\n\n$itog_x=$change_x_2-$change_x;\n$itog_y=$change_y_2-$change_y;\n\n$num_x_cycles=abs($a)/abs($itog_x);\n$num_y_cycles=abs($b)/abs($itog_y);\n\nif ($num_x_cycles>$num_y_cycles) $num_cycles=$num_x_cycles; else $num_cycles=$num_y_cycles;\n\n$go_iterations=$num_cycles-2;\n\n\n\n$c_posx=$itog_x*$go_iterations;\n$c_posy=$itog_y*$go_iterations;\n\n$i=0;\n$cur_pos=0;\nwhile($i<$length*3)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    $cur_pos++;\n    if ($c_posx==$a && $c_posy==$b) die('Yes');\n}\ndie('No');\n?>"}, {"source_code": "<?\n$s = fopen(\"php://stdin\", 'r');\n$n = stream_get_contents($s);\n$dum = explode(\"\\n\",$n); \n\n$arr = explode(' ', $dum[0]);\n$a = (int) $arr[0];\n$b = (int) $arr[1];\n$path = $dum[1];\n\n/*$a=-1;\n$b=-1;\n$path='UR';*/\n\n$c_posx=0;\n$c_posy=0;\n\n$length=strlen($path);\n$cur_pos=0;\n\n$i=0;\nwhile($i<$length*2)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    if ($i==$length)\n    {\n        $change_x=$c_posx;\n        $change_y=$c_posy;\n    }\n    if ($i==$length*2)\n    {\n        $change_x_2=$c_posx;\n        $change_y_2=$c_posy;\n    }\n    $cur_pos++;\n}\n\n\n\n$itog_x=$change_x_2-$change_x;\n$itog_y=$change_y_2-$change_y;\n\n$num_x_cycles=$a/$itog_x;\n$num_y_cycles=$b/$itog_y;\n\nif ($num_x_cycles>$num_y_cycles) $num_cycles=$num_x_cycles; else $num_cycles=$num_y_cycles;\n\n$go_iterations=$num_cycles-2;\n\n$c_posx=$itog_x*abs($go_iterations);\n$c_posy=$itog_y*abs($go_iterations);\n\n$i=0;\n$cur_pos=0;\nwhile($i<$length*3)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    $cur_pos++;\n    if ($c_posx==$a && $c_posy==$b) die('Yes');\n}\ndie('No');\n?>"}, {"source_code": "<?\n$s = fopen(\"php://stdin\", 'r');\n$n = stream_get_contents($s);\n$dum = explode(\"\\n\",$n); \n\n$arr = explode(' ', $dum[0]);\n$a = (int) $arr[0];\n$b = (int) $arr[1];\n$path = $dum[1];\n\n/*$a=2;\n$b=2;\n$path='RU';*/\n\n$c_posx=0;\n$c_posy=0;\n\n$length=strlen($path);\n$cur_pos=0;\n\n$i=0;\nwhile($i<$length*2)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    if ($i==$length)\n    {\n        $change_x=$c_posx;\n        $change_y=$c_posy;\n    }\n    if ($i==$length*2)\n    {\n        $change_x_2=$c_posx;\n        $change_y_2=$c_posy;\n    }\n    $cur_pos++;\n}\n\n\n\n$itog_x=$change_x_2-$change_x;\n$itog_y=$change_y_2-$change_y;\n\n$num_x_cycles=abs($a)/abs($itog_x);\n$num_y_cycles=abs($b)/abs($itog_y);\n\nif ($num_x_cycles>$num_y_cycles) $num_cycles=$num_x_cycles; else $num_cycles=$num_y_cycles;\n\n$go_iterations=ceil($num_cycles)-5;\n\n$c_posx=$itog_x*$go_iterations;\n$c_posy=$itog_y*$go_iterations;\n\n\n$i=0;\n$cur_pos=0;\nwhile($i<$length*7)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n\n    $i++;\n    \n\n    $cur_pos++;\n    if ($c_posx==$a && $c_posy==$b) die('Yes');\n}\ndie('No');\n?>"}, {"source_code": "<?\n$s = fopen(\"php://stdin\", 'r');\n$n = stream_get_contents($s);\n$dum = explode(\"\\n\",$n); \n\n$arr = explode(' ', $dum[0]);\n$a = (int) $arr[0];\n$b = (int) $arr[1];\n$path = $dum[1];\n\n/*$a=-1;\n$b=1000000000;\n$path='LRRLU';*/\n\n$c_posx=0;\n$c_posy=0;\n\n$length=strlen($path);\n$cur_pos=0;\n\n$min_x=9999999;\n$max_x=-10000000;\n$min_y=9999999;\n$max_y=-10000000;\n\n$i=0;\nwhile($i<$length*2)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    \n    if ($i<$length)\n    {\n        if ($min_x>$c_posx) $min_x=$c_posx;\n        if ($min_y>$c_posy) $min_y=$c_posy;\n        \n        if ($max_x<$c_posx) $max_x=$c_posx;\n        if ($max_y<$c_posy) $max_y=$c_posy;\n    }\n    \n    $i++;\n    if ($i==$length)\n    {\n        $change_x=$c_posx;\n        $change_y=$c_posy;\n    }\n    if ($i==$length*2)\n    {\n        $change_x_2=$c_posx;\n        $change_y_2=$c_posy;\n    }\n    $cur_pos++;\n}\n\n$plav_x=$max_x-$min_x;\n$plav_y=$max_y-$min_y;\n\n\nif ($plav_x>$plav_y) $plav=$plav_x; else $plav=$plav_y;\n\n\n$itog_x=$change_x_2-$change_x;\n$itog_y=$change_y_2-$change_y;\n\n$num_x_cycles=abs($a)/abs($itog_x);\n$num_y_cycles=abs($b)/abs($itog_y);\n\nif ($num_x_cycles>$num_y_cycles) $num_cycles=$num_x_cycles; else $num_cycles=$num_y_cycles;\n\n$go_iterations=ceil($num_cycles)-$plav;\n\n$c_posx=$itog_x*$go_iterations;\n$c_posy=$itog_y*$go_iterations;\n\n\n$i=0;\n$cur_pos=0;\nwhile($i<$length*($plav+1))\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    if ($c_posx==$a && $c_posy==$b) die('Yes');\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    //echo $current_word.' '.$c_posx.' '.$c_posy.'<BR>';\n    \n    \n    $i++;\n    \n    //if (($i % $length) == 0  && $i!=0) echo '<BR>';\n    \n    $cur_pos++;\n    if ($c_posx==$a && $c_posy==$b) die('Yes');\n}\ndie('No');\n?>"}, {"source_code": "<?\n$s = fopen(\"php://stdin\", 'r');\n$n = stream_get_contents($s);\n$dum = explode(\"\\n\",$n); \n\n$arr = explode(' ', $dum[0]);\n$a = (int) $arr[0];\n$b = (int) $arr[1];\n$path = $dum[1];\n\n/*$a=0;\n$b=0;\n$path='D';*/\n\n$c_posx=0;\n$c_posy=0;\n\n$length=strlen($path);\n$cur_pos=0;\n\n$max_x=$a-105;\n$max_y=$b+105;\n\n$i=0;\nwhile($i<$length*2)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    if ($c_posx==$a && $c_posy==$b) die('Yes');\n    if ($c_posx<$max_x || $c_posx>$max_y || $c_posy>$max_y || $c_posy<$max_x)   die('No');\n\n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    if ($i==$length)\n    {\n        $change_x=$c_posx;\n        $change_y=$c_posy;\n    }\n    if ($i==$length*2)\n    {\n        $change_x_2=$c_posx;\n        $change_y_2=$c_posy;\n    }\n    $cur_pos++;\n}\n\n\n\n$itog_x=$change_x_2-$change_x;\n$itog_y=$change_y_2-$change_y;\n\n$num_x_cycles=$a/$itog_x;\n$num_y_cycles=$b/$itog_y;\n\nif ($num_x_cycles>$num_y_cycles) $num_cycles=$num_x_cycles; else $num_cycles=$num_y_cycles;\n\n$go_iterations=$num_cycles-1;\n\n$c_posx=$itog_x*$go_iterations;\n$c_posy=$itog_y*$go_iterations;\n\n\n$i=0;\n$cur_pos=0;\nwhile($i<$length*2)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    $cur_pos++;\n    if ($c_posx==$a && $c_posy==$b) die('Yes');\n}\ndie('No');\n?>"}, {"source_code": "<?\n$s = fopen(\"php://stdin\", 'r');\n$n = stream_get_contents($s);\n$dum = explode(\"\\n\",$n); \n\n$arr = explode(' ', $dum[0]);\n$a = (int) $arr[0];\n$b = (int) $arr[1];\n$path = $dum[1];\n\n/*$a=0;\n$b=0;\n$path='D';*/\n\n$c_posx=0;\n$c_posy=0;\n\n$length=strlen($path);\n$cur_pos=0;\n\n$max_x=$a-105;\n$max_y=$b+105;\n\n$i=0;\nwhile($i<$length*2)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    if ($i==$length)\n    {\n        $change_x=$c_posx;\n        $change_y=$c_posy;\n    }\n    if ($i==$length*2)\n    {\n        $change_x_2=$c_posx;\n        $change_y_2=$c_posy;\n    }\n    $cur_pos++;\n}\n\n\n\n$itog_x=$change_x_2-$change_x;\n$itog_y=$change_y_2-$change_y;\n\n$num_x_cycles=$a/$itog_x;\n$num_y_cycles=$b/$itog_y;\n\nif ($num_x_cycles>$num_y_cycles) $num_cycles=$num_x_cycles; else $num_cycles=$num_y_cycles;\n\n$go_iterations=$num_cycles-1;\n\n$c_posx=$itog_x*$go_iterations;\n$c_posy=$itog_y*$go_iterations;\n\n\n$i=0;\n$cur_pos=0;\nwhile($i<$length*2)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    $cur_pos++;\n    if ($c_posx==$a && $c_posy==$b) die('Yes');\n}\ndie('No');\n?>"}, {"source_code": "<?\n$s = fopen(\"php://stdin\", 'r');\n$n = stream_get_contents($s);\n$dum = explode(\"\\n\",$n); \n\n$arr = explode(' ', $dum[0]);\n$a = (int) $arr[0];\n$b = (int) $arr[1];\n$path = $dum[1];\n\n/*$a=4;\n$b=3;\n$path='UURRDL';*/\n\n$c_posx=0;\n$c_posy=0;\n\n$length=strlen($path);\n$cur_pos=0;\n\n$max_x=$a-105;\n$max_y=$b+105;\n\n$i=0;\nwhile($i<$length*2)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    if ($i==$length)\n    {\n        $change_x=$c_posx;\n        $change_y=$c_posy;\n    }\n    if ($i==$length*2)\n    {\n        $change_x_2=$c_posx;\n        $change_y_2=$c_posy;\n    }\n    $cur_pos++;\n}\n\n\n\n$itog_x=$change_x_2-$change_x;\n$itog_y=$change_y_2-$change_y;\n\n$num_x_cycles=$a/$itog_x;\n$num_y_cycles=$b/$itog_y;\n\nif ($num_x_cycles>$num_y_cycles) $num_cycles=$num_x_cycles; else $num_cycles=$num_y_cycles;\n\n$go_iterations=$num_cycles-2;\n\n$c_posx=$itog_x*$go_iterations;\n$c_posy=$itog_y*$go_iterations;\n\n$i=0;\n$cur_pos=0;\nwhile($i<$length*3)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    $cur_pos++;\n    if ($c_posx==$a && $c_posy==$b) die('Yes');\n}\ndie('No');\n?>"}, {"source_code": "<?\n$s = fopen(\"php://stdin\", 'r');\n$n = stream_get_contents($s);\n$dum = explode(\"\\n\",$n); \n\n$arr = explode(' ', $dum[0]);\n$a = (int) $arr[0];\n$b = (int) $arr[1];\n$path = $dum[1];\n\n/*$a=1000000000;\n$b=1000000000;\n$path='UURRDL';*/\n\n$c_posx=0;\n$c_posy=0;\n\n$length=strlen($path);\n$cur_pos=0;\n\n$i=0;\nwhile($i<$length*2)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    if ($i==$length)\n    {\n        $change_x=$c_posx;\n        $change_y=$c_posy;\n    }\n    if ($i==$length*2)\n    {\n        $change_x_2=$c_posx;\n        $change_y_2=$c_posy;\n    }\n    $cur_pos++;\n}\n\n\n\n$itog_x=$change_x_2-$change_x;\n$itog_y=$change_y_2-$change_y;\n\n$num_x_cycles=$a/$itog_x;\n$num_y_cycles=$b/$itog_y;\n\nif ($num_x_cycles>$num_y_cycles) $num_cycles=$num_x_cycles; else $num_cycles=$num_y_cycles;\n\n$go_iterations=$num_cycles-2;\nif ($go_iterations<0) $go_iterations=1;\n\n\n$c_posx=$itog_x*$go_iterations;\n$c_posy=$itog_y*$go_iterations;\n\n$i=0;\n$cur_pos=0;\nwhile($i<$length*3)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    $cur_pos++;\n    if ($c_posx==$a && $c_posy==$b) die('Yes');\n}\ndie('No');\n?>"}, {"source_code": "<?\n$s = fopen(\"php://stdin\", 'r');\n$n = stream_get_contents($s);\n$dum = explode(\"\\n\",$n); \n\n$arr = explode(' ', $dum[0]);\n$a = (int) $arr[0];\n$b = (int) $arr[1];\n$path = $dum[1];\n\n/*$a=2;\n$b=6;\n$path='RUUUURLDDDL';*/\n\n$c_posx=0;\n$c_posy=0;\n\n$length=strlen($path);\n$cur_pos=0;\n\n$i=0;\nwhile($i<$length*2)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    if ($i==$length)\n    {\n        $change_x=$c_posx;\n        $change_y=$c_posy;\n    }\n    if ($i==$length*2)\n    {\n        $change_x_2=$c_posx;\n        $change_y_2=$c_posy;\n    }\n    $cur_pos++;\n}\n\n\n\n$itog_x=$change_x_2-$change_x;\n$itog_y=$change_y_2-$change_y;\n\n$num_x_cycles=abs($a)/abs($itog_x);\n$num_y_cycles=abs($b)/abs($itog_y);\n\nif ($num_x_cycles>$num_y_cycles) $num_cycles=$num_x_cycles; else $num_cycles=$num_y_cycles;\n\n$go_iterations=ceil($num_cycles)-5;\n\n$c_posx=$itog_x*$go_iterations;\n$c_posy=$itog_y*$go_iterations;\n\n$i=0;\n$cur_pos=0;\nwhile($i<$length*3)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    \n    $i++;\n    \n    $cur_pos++;\n    if ($c_posx==$a && $c_posy==$b) die('Yes');\n}\ndie('No');\n?>"}, {"source_code": "<?\n$s = fopen(\"php://stdin\", 'r');\n$n = stream_get_contents($s);\n$dum = explode(\"\\n\",$n); \n\n$arr = explode(' ', $dum[0]);\n$a = (int) $arr[0];\n$b = (int) $arr[1];\n$path = $dum[1];\n/*\n$a=2;\n$b=2;\n$path='RU';*/\n\n$c_posx=0;\n$c_posy=0;\n\n$length=strlen($path);\n$cur_pos=0;\n\n$min_x=9999999;\n$max_x=-10000000;\n$min_y=9999999;\n$max_y=-10000000;\n\n$i=0;\nwhile($i<$length*2)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    \n    if ($i<$length)\n    {\n        if ($min_x>$c_posx) $min_x=$c_posx;\n        if ($min_y>$c_posy) $min_y=$c_posy;\n        \n        if ($max_x<$c_posx) $max_x=$c_posx;\n        if ($max_y<$c_posy) $max_y=$c_posy;\n    }\n    \n    $i++;\n    if ($i==$length)\n    {\n        $change_x=$c_posx;\n        $change_y=$c_posy;\n    }\n    if ($i==$length*2)\n    {\n        $change_x_2=$c_posx;\n        $change_y_2=$c_posy;\n    }\n    $cur_pos++;\n}\n\n$plav_x=$max_x-$min_x;\n$plav_y=$max_y-$min_y;\n\nif ($plav_x>$plav_y) $plav=$plav_x; else $plav=$plav_y;\n\n\n$itog_x=$change_x_2-$change_x;\n$itog_y=$change_y_2-$change_y;\n\n$num_x_cycles=abs($a)/abs($itog_x);\n$num_y_cycles=abs($b)/abs($itog_y);\n\nif ($num_x_cycles>$num_y_cycles) $num_cycles=$num_x_cycles; else $num_cycles=$num_y_cycles;\n\n$go_iterations=ceil($num_cycles)-$plav;\n\n$c_posx=$itog_x*$go_iterations;\n$c_posy=$itog_y*$go_iterations;\n\n//echo $num_cycles.' '.$itog_x.' '.$itog_y.'<BR>';\n\n$i=0;\n$cur_pos=0;\nwhile($i<$length*($plav+1))\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    //echo $current_word.' '.$c_posx.' '.$c_posy.'<BR>';\n    \n    \n    $i++;\n    \n    //if (($i % $length) == 0  && $i!=0) echo '<BR>';\n    \n    $cur_pos++;\n    if ($c_posx==$a && $c_posy==$b) die('Yes');\n}\ndie('No');\n?>"}, {"source_code": "<?\n$s = fopen(\"php://stdin\", 'r');\n$n = stream_get_contents($s);\n$dum = explode(\"\\n\",$n); \n\n$arr = explode(' ', $dum[0]);\n$a = (int) $arr[0];\n$b = (int) $arr[1];\n$path = $dum[1];\n/*\n$a=-261597957;\n$b=418556728;\n$path='LLLDLUDUULLRDDULLRRUDRDLULRLRLLRRUUDRRLRUDLRRLUDRDLLUUDUULRURLDLULUUULDDUURLRUDURRL';*/\n\n$c_posx=0;\n$c_posy=0;\n\n$length=strlen($path);\n$cur_pos=0;\n\n$i=0;\nwhile($i<$length*2)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    if ($i==$length)\n    {\n        $change_x=$c_posx;\n        $change_y=$c_posy;\n    }\n    if ($i==$length*2)\n    {\n        $change_x_2=$c_posx;\n        $change_y_2=$c_posy;\n    }\n    $cur_pos++;\n}\n\n\n\n$itog_x=$change_x_2-$change_x;\n$itog_y=$change_y_2-$change_y;\n\n$num_x_cycles=abs($a)/abs($itog_x);\n$num_y_cycles=abs($b)/abs($itog_y);\n\nif ($num_x_cycles>$num_y_cycles) $num_cycles=$num_x_cycles; else $num_cycles=$num_y_cycles;\n\n$go_iterations=ceil($num_cycles)-2;\n\n$c_posx=$itog_x*$go_iterations;\n$c_posy=$itog_y*$go_iterations;\n\n$i=0;\n$cur_pos=0;\nwhile($i<$length*3)\n{\n    if ($cur_pos>=$length) $cur_pos=0;\n    $current_word=$path[$cur_pos];\n    \n    switch ($current_word)\n    {\n        case 'U':\n        $c_posy=$c_posy+1;\n        break;\n        case 'D':\n        $c_posy=$c_posy-1;\n        break;\n        case 'L':\n        $c_posx=$c_posx-1;\n        break;\n        case 'R':\n        $c_posx=$c_posx+1;\n        break;\n    }\n    $i++;\n    $cur_pos++;\n    if ($c_posx==$a && $c_posy==$b) die('Yes');\n}\ndie('No');\n?>"}], "src_uid": "5d6212e28c7942e9ff4d096938b782bf"}
{"nl": {"description": "Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes, each such pipe should be connected to the water supply. A pipe can be connected to the water supply if there's water flowing out of it. Initially Vova has only one pipe with flowing water. Besides, Vova has several splitters.A splitter is a construction that consists of one input (it can be connected to a water pipe) and x output pipes. When a splitter is connected to a water pipe, water flows from each output pipe. You can assume that the output pipes are ordinary pipes. For example, you can connect water supply to such pipe if there's water flowing out from it. At most one splitter can be connected to any water pipe.  The figure shows a 4-output splitter Vova has one splitter of each kind: with 2, 3, 4, ..., k outputs. Help Vova use the minimum number of splitters to build the required pipeline or otherwise state that it's impossible.Vova needs the pipeline to have exactly n pipes with flowing out water. Note that some of those pipes can be the output pipes of the splitters.", "input_spec": "The first line contains two space-separated integers n and k (1\u2009\u2264\u2009n\u2009\u2264\u20091018, 2\u2009\u2264\u2009k\u2009\u2264\u2009109). Please, do not use the %lld specifier to read or write 64-bit integers in \u0421++. It is preferred to use the cin, cout streams or the %I64d specifier.", "output_spec": "Print a single integer \u2014 the minimum number of splitters needed to build the pipeline. If it is impossible to build a pipeline with the given splitters, print -1.", "sample_inputs": ["4 3", "5 5", "8 4"], "sample_outputs": ["2", "1", "-1"], "notes": null}, "positive_code": [{"source_code": "<?php\n// Retrieve input\n$stdin = fopen('php://stdin', 'r');\nfunction g() {\n\tglobal $stdin;\n\treturn explode(\" \", trim(fgets($stdin)));\n}\n\n// Codeforces Contest 176 Div 2 Problem B\n$raw = g();\n$n = bcsub($raw[0], 1);\n$k = bcsub($raw[1], 1);\n\n$c = bcsub(bcmul($k,$k+1), bcmul(2,$n));\nif (bccomp(0, $c) == 1) {echo \"-1\"; exit;}\n\n$sqrt = bcsqrt(bcmul(4,$c), 10);\n$raw = explode(\".\", $sqrt);\n$trunc = $raw[0];\n\nif (bcmod($trunc, 2) == 0) {$trunc = bcsub($trunc, 1);}\n\n$m = bcdiv(bcadd($trunc, 1), 2);\n\nif (bcadd(bcmul(4,$c),1) == bcpow(bcadd(bcmul(2,$m),1),2)) {echo bcsub($k, $m);} else {echo bcsub(bcadd($k,1), $m);}\n\n// End of submission file\n// Submission by chaotic_iak\n?>"}, {"source_code": "<?php\n\n$stdin = fopen('php://stdin', 'r');\n$input = explode(\" \", trim(fgets($stdin)));\n$n = $input[0];\n$k = $input[1];\n\n$t = bcsub(bcmul(bcmul(4, $k, 15), $k, 15), bcmul(4, $k, 15), 15);\n$t = bcsub($t, bcmul(8, $n, 15), 15);\n$t = bcadd($t, 9, 15);\n\nif ($t < 0) {\n    echo -1;\n} else {\n    $r = ceil($k - 0.5 * (bcsqrt($t) + 1));\n    echo $r;\n}"}, {"source_code": "<?php\n$s = explode(' ',trim(fgets(STDIN)));\n$t = 1;\n$n = $s[0];\n$k = $s[1] -1;\n$l = 1;\n$r = $k;\n\nif($n == \"499999999500000002\") $r = -1;\nelseif($n == \"499999999500000001\") $r = 999999999;\nelseif($n == \"499999999500000000\") $r = 999999998;\nelseif($n > ($k+1)/2 * $k+1) {$r = -1; }\n    else \n    {\n        while(($l-$r)<0)\n        {\n            $mid = floor(($l + $r ) / 2);  \n            //$Mmid = (($mid*($mid+1)/2)-$mid +1) ;  \n           $Mmid = ($k+$k -$mid +1)/2 *$mid ;  \n              if ($n <= $Mmid)\n                {\n                $r = $mid;  \n                }\n                else\n                {\n                 $l =  $mid+1;  \n                }           \n         }       \n    }\n    if($n==$k+1) $r = 1;\n    if($n==1) $r = 0;\n   // echo $l.PHP_EOL.$r.PHP_EOL;\n\n\n\n\n\n\n       echo $r;\n       "}], "negative_code": [{"source_code": "<?php\n// Retrieve input\n$stdin = fopen('php://stdin', 'r');\nfunction g() {\n\tglobal $stdin;\n\treturn explode(\" \", trim(fgets($stdin)));\n}\n\n// Codeforces Contest 176 Div 2 Problem B\n$raw = g();\n$n = $raw[0] - 1;\n$k = $raw[1] - 1;\n\n$c = bcsub(bcmul($k,$k+1), bcmul(2,$n));\nif (bccomp(0, $c) == 1) {echo \"-1\"; exit;}\nif (bccomp(0, $c) == 0) {echo $k; exit;}\n\n$min = -1;\n$max = bcsub(bcpow(2,30), 1);\n\nwhile ( (!((bccomp(0, t()) == -1) && (bccomp(t(), bcmul(2,m())) != 1)))\n\t&& (bccomp(bcsub($max, $min), 1) == 1)) {\n\tif (bccomp(0, t()) == -1) {\n\t\t$min = m();\n\t} else {\n\t\t$max = m();\n\t}\n}\n\nif (bccomp($c, bcmul(m(), bcadd(m(), 1))) == 0) {echo bcsub($k, m());} else {echo bcsub(bcadd($k,1), m());}\n\nfunction t() {\n\tglobal $c, $min, $max;\n\t$m = m();\n\treturn bcsub($c, bcmul($m, $m-1));\n}\n\nfunction m() {\n\tglobal $min, $max;\n\treturn bcdiv(bcadd($min, $max), 2, 0);\n}\n\n// End of submission file\n// Submission by chaotic_iak\n?>"}, {"source_code": "<?php\n// Retrieve input\n$stdin = fopen('php://stdin', 'r');\nfunction g() {\n\tglobal $stdin;\n\treturn explode(\" \", trim(fgets($stdin)));\n}\n\n// Codeforces Contest 176 Div 2 Problem B\n$raw = g();\n$n = $raw[0] - 1;\n$k = $raw[1] - 1;\n\n$c = bcsub(bcmul($k,$k+1), bcmul(2,$n));\nif (bccomp(0, $c) == 1) {echo \"-1\"; exit;}\n\n$sqrt = bcsqrt(bcmul(4,$c), 10);\n$raw = explode(\".\", $sqrt);\n$trunc = $raw[0];\n\nif (bcmod($trunc, 2) == 0) {$trunc = bcsub($trunc, 1);}\n\n$m = bcdiv(bcadd($trunc, 1), 2);\n\nif (bcadd(bcmul(4,$c),1) == bcpow(bcadd(bcmul(2,$m),1),2)) {echo bcsub($k, $m);} else {echo bcsub(bcadd($k,1), $m);}\n\n// End of submission file\n// Submission by chaotic_iak\n?>"}, {"source_code": "<?php\n$s = explode(' ',trim(fgets(STDIN)));\n$t = 1;\n$n = $s[0];\n$k = $s[1] -1;\n$l = 1;\n$r = $k;\n\n   if($n > ($k+1)/2 * $k+1) {$r = -1; }\n    else \n    {\n        while(($l-$r)<0)\n        {\n            $mid = floor(($l + $r ) / 2);  \n            //$Mmid = (($mid*($mid+1)/2)-$mid +1) ;  \n           $Mmid = ($k+$k -$mid +1)/2 *$mid ;  \n              if ($n <= $Mmid)\n                {\n                $r = $mid;  \n                }\n                else\n                {\n                 $l =  $mid+1;  \n                }           \n         }       \n    }\n    if($n==$k+1) $r = 1;\n   // echo $l.PHP_EOL.$r.PHP_EOL;\n\nif($n == 499999999500000000) $r = 999999998;\n       echo $r;"}, {"source_code": "<?php\n$s = explode(' ',trim(fgets(STDIN)));\n\nif($s[1]<= $s[0]) {$t = $s[0] - $s[1] +1; if($t >= $s[1])echo \"-1\"; else echo $t;}\nelse \n{\n    echo \"1\";\n}\n"}, {"source_code": "<?php\n$s = explode(' ',trim(fgets(STDIN)));\n$t = 1;\n$n = $s[0];\n$k = $s[1] -1;\n$l = 1;\n$r = $k;\nif($n == \"499999999500000002\") $r = -1;\nelseif($n == \"499999999500000001\") $r = 999999999;\nelseif($n == \"499999999500000000)\") $r = 999999998;\nelseif($n > ($k+1)/2 * $k+1) {$r = -1; }\n    else \n    {\n        while(($l-$r)<0)\n        {\n            $mid = floor(($l + $r ) / 2);  \n            //$Mmid = (($mid*($mid+1)/2)-$mid +1) ;  \n           $Mmid = ($k+$k -$mid +1)/2 *$mid ;  \n              if ($n <= $Mmid)\n                {\n                $r = $mid;  \n                }\n                else\n                {\n                 $l =  $mid+1;  \n                }           \n         }       \n    }\n    if($n==$k+1) $r = 1;\n   // echo $l.PHP_EOL.$r.PHP_EOL;\n\n\n\n\n\n\n       echo $r;\n       "}, {"source_code": "<?php\n$s = explode(' ',trim(fgets(STDIN)));\n$t = 1;\n$n = $s[0];\n$k = $s[1];\n$l = 0;\n$r = $k -1;\n\n    if($n > (($k*($k+1)/2)-$k +1)) {$r = -1;}\n    \n    else \n    {\n        while($l<$r)\n        {\n            $mid = $l + ($r - $l) / 2;\n              if ($n <= $mid)\n                {\n                $r = $mid;\n                }\n                else\n                {\n                 $l = $mid + 1;\n                }\n         }\n            \n    }\n    if($n==$k) $r = 1;\n  echo $r;"}, {"source_code": "<?php\n$s = explode(' ',trim(fgets(STDIN)));\n$t = 1;\n$n = $s[0];\n$k = $s[1];\n$l = 0;\n$r = $k -1;\n\n    if($n > ceil(($k*($k+1)/2)-$k +1)) {$r = -1;}\n    \n    else \n    {\n        while($l<$r)\n        {\n            $mid = ceil($l + ($r - $l) / 2);\n              if ($n <= $mid)\n                {\n                $r = $mid;\n                }\n                else\n                {\n                 $l = $mid + 1;\n                }\n         }\n            \n    }\n    if($n==$k) $r = 1;\n    if($n == 499999998500000001 )$r = 999955279;\n\n  echo $r;"}, {"source_code": "<?php\n$s = explode(' ',trim(fgets(STDIN)));\n$t = 1;\n$n = $s[0];\n$k = $s[1] -1;\n$l = 1;\n$r = $k;\n\n   if($n > ($k+1)/2 * $k+1) {$r = -1; }\n    else \n    {\n        while(($l-$r)<0)\n        {\n            $mid = floor(($l + $r ) / 2);  \n            //$Mmid = (($mid*($mid+1)/2)-$mid +1) ;  \n           $Mmid = ($k+$k -$mid +1)/2 *$mid ;  \n              if ($n <= $Mmid)\n                {\n                $r = $mid;  \n                }\n                else\n                {\n                 $l =  $mid +1;  \n                }           \n         }       \n    }\n    if($n==$k+1) $r = 1;\n\n       echo $r;"}, {"source_code": "<?php\n$s = explode(' ',trim(fgets(STDIN)));\n$t = 1;\n$n = $s[0];\n$k = $s[1] -1;\n$l = 1;\n$r = $k;\n\n   if($n > ($k+$k +1)/2 *$k ) {$r = -1;}\n    else \n    {\n        while(($l-$r)<0)\n        {\n            $mid = floor(($l + $r ) / 2);  \n            //$Mmid = (($mid*($mid+1)/2)-$mid +1) ;  \n           $Mmid = ($k+$k -$mid +1)/2 *$mid ;  \n              if ($n <= $Mmid)\n                {\n                $r = $mid;  \n                }\n                else\n                {\n                 $l =  $mid +1;  \n                }           \n         }       \n    }\n    if($n==$k+1) $r = 1;\n\n       echo $r;"}, {"source_code": "<?php\n$s = explode(' ',trim(fgets(STDIN)));\n$t = 1;\n$n = $s[0];\n$k = $s[1] -1;\n$l = 1;\n$r = $k;\n\nif($n == \"499999999500000002\") $r = -1;\nelseif($n == \"499999999500000001\") $r = 999999999;\nelseif($n == \"499999999500000000\") $r = 999999998;\nelseif($n > ($k+1)/2 * $k+1) {$r = -1; }\n    else \n    {\n        while(($l-$r)<0)\n        {\n            $mid = floor(($l + $r ) / 2);  \n            //$Mmid = (($mid*($mid+1)/2)-$mid +1) ;  \n           $Mmid = ($k+$k -$mid +1)/2 *$mid ;  \n              if ($n <= $Mmid)\n                {\n                $r = $mid;  \n                }\n                else\n                {\n                 $l =  $mid+1;  \n                }           \n         }       \n    }\n    if($n==$k+1) $r = 1;\n   // echo $l.PHP_EOL.$r.PHP_EOL;\n\n\n\n\n\n\n       echo $r;\n       "}, {"source_code": "<?php\n$s = explode(' ',trim(fgets(STDIN)));\n$t = 1;\n$n = $s[0];\n$k = $s[1] -1;\n$l = 1;\n$r = $k;\n\n   if($n > ($k+1)/2 * $k+1) {$r = -1; }\n    else \n    {\n        while(($l-$r)<0)\n        {\n            $mid = floor(($l + $r ) / 2);  \n            //$Mmid = (($mid*($mid+1)/2)-$mid +1) ;  \n           $Mmid = ($k+$k -$mid +1)/2 *$mid ;  \n              if ($n <= $Mmid)\n                {\n                $r = $mid;  \n                }\n                else\n                {\n                 $l =  $mid+1;  \n                }           \n         }       \n    }\n    if($n==$k+1) $r = 1;\n   // echo $l.PHP_EOL.$r.PHP_EOL;\n\n\n\n\nif($n == 499999999500000002) $r = -1;\nif($n == 499999999500000001) $r = 999999999;\nif($n == 499999999500000000) $r = 999999998;\n\n       echo $r;\n       "}, {"source_code": "<?php\n$s = explode(' ',trim(fgets(STDIN)));\n$t = 1;\n$n = $s[0];\n$k = $s[1] -1;\n$l = 1;\n$r = $k -1;\n\n   if($n > ceil(($k*($k+1)/2)-$k +1)) {$r = -1;}\n    else \n    {\n        while(($l-$r)<0)\n        {\n            $mid = floor(($l + $r ) / 2);  \n            //$Mmid = (($mid*($mid+1)/2)-$mid +1) ;  \n           $Mmid = ($k+$k -$mid +1)/2 *$mid ;  \n              if ($n <= $Mmid)\n                {\n                $r = $mid;  \n                }\n                else\n                {\n                 $l =  $mid +1;  \n                }           \n         }       \n    }\n    if($n==$k) $r = 1;\n    \n       echo $r;"}], "src_uid": "83bcfe32db302fbae18e8a95d89cf411"}
{"nl": {"description": "One day Vasya was sitting on a not so interesting Maths lesson and making an origami from a rectangular a mm \u2009\u00d7\u2009 b mm sheet of paper (a\u2009&gt;\u2009b). Usually the first step in making an origami is making a square piece of paper from the rectangular sheet by folding the sheet along the bisector of the right angle, and cutting the excess part.  After making a paper ship from the square piece, Vasya looked on the remaining (a\u2009-\u2009b) mm \u2009\u00d7\u2009 b mm strip of paper. He got the idea to use this strip of paper in the same way to make an origami, and then use the remainder (if it exists) and so on. At the moment when he is left with a square piece of paper, he will make the last ship from it and stop.Can you determine how many ships Vasya will make during the lesson?", "input_spec": "The first line of the input contains two integers a, b (1\u2009\u2264\u2009b\u2009&lt;\u2009a\u2009\u2264\u20091012) \u2014 the sizes of the original sheet of paper.", "output_spec": "Print a single integer \u2014 the number of ships that Vasya will make.", "sample_inputs": ["2 1", "10 7", "1000000000000 1"], "sample_outputs": ["2", "6", "1000000000000"], "notes": "NotePictures to the first and second sample test.  "}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = 0;\nfor($x = 1; $x <= 100000; $x++)\n{\n    $d = max($a, $b);\n    $e = min($a, $b);\n    $f = bcmod($d, $e);\n    $g = floor(bcdiv($d, $e));\n    $c += $g;\n    if($f == 0)\n    {\n        break;\n    } \n    else\n    {\n        if($a > $b)\n        {\n            $a -= bcmul($b, $g);\n        }\n        else\n        {\n            $b -= bcmul($a, $g);\n        }\n    } \n}\nprint $c;\n?>"}, {"source_code": "<?php\n// 527A     \u0418\u0433\u0440\u0430 \u0441 \u0431\u0443\u043c\u0430\u0433\u043e\u0439       \n$in = fopen(\"php://stdin\", 'r');\n\n//$input_line = fgets($in);\n//$n = (int) $input_line;\n\n$input_line = fgets($in);\nlist($a, $b) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$col = '0';\nwhile ((bccomp($a, $b) === 1) and ($b !== '0')) {\n    $n = bcdiv($a, $b);\n    $col = bcadd($col, $n); \n    $a = bcsub($a, bcmul($b, $n));\n    if (bccomp($a, $b) === -1) {\n        $tmp = $a;\n        $a = $b;\n        $b = $tmp;\n    }\n}\n\necho \"$col\";\n\n?>"}], "negative_code": [], "src_uid": "ce698a0eb3f5b82de58feb177ce43b83"}
{"nl": {"description": "Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn't change throughout the game. Simon receives number a and Antisimon receives number b. They also have a heap of n stones. The players take turns to make a move and Simon starts. During a move a player should take from the heap the number of stones equal to the greatest common divisor of the fixed number he has received and the number of stones left in the heap. A player loses when he cannot take the required number of stones (i. e. the heap has strictly less stones left than one needs to take). Your task is to determine by the given a, b and n who wins the game.", "input_spec": "The only string contains space-separated integers a, b and n (1\u2009\u2264\u2009a,\u2009b,\u2009n\u2009\u2264\u2009100) \u2014 the fixed numbers Simon and Antisimon have received correspondingly and the initial number of stones in the pile.", "output_spec": "If Simon wins, print \"0\" (without the quotes), otherwise print \"1\" (without the quotes).", "sample_inputs": ["3 5 9", "1 1 100"], "sample_outputs": ["0", "1"], "notes": "NoteThe greatest common divisor of two non-negative integers a and b is such maximum positive integer k, that a is divisible by k without remainder and similarly, b is divisible by k without remainder. Let gcd(a,\u2009b) represent the operation of calculating the greatest common divisor of numbers a and b. Specifically, gcd(x,\u20090)\u2009=\u2009gcd(0,\u2009x)\u2009=\u2009x.In the first sample the game will go like that: Simon should take gcd(3,\u20099)\u2009=\u20093 stones from the heap. After his move the heap has 6 stones left. Antisimon should take gcd(5,\u20096)\u2009=\u20091 stone from the heap. After his move the heap has 5 stones left. Simon should take gcd(3,\u20095)\u2009=\u20091 stone from the heap. After his move the heap has 4 stones left. Antisimon should take gcd(5,\u20094)\u2009=\u20091 stone from the heap. After his move the heap has 3 stones left. Simon should take gcd(3,\u20093)\u2009=\u20093 stones from the heap. After his move the heap has 0 stones left. Antisimon should take gcd(5,\u20090)\u2009=\u20095 stones from the heap. As 0\u2009&lt;\u20095, it is impossible and Antisimon loses.In the second sample each player during each move takes one stone from the heap. As n is even, Antisimon takes the last stone and Simon can't make a move after that."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$f = 0;\n$g = $c;\nfor($x = 1; $x <= $g; $x++)\n{\n    $d = min($a, $c);\n    $e = min($b, $c);\n    $h = $d;\n    $i = $e;\n    if(($x % 2) != 0)\n    {\n        for($y = 1; $y <= $h; $y++)\n        {\n            if((($c % $d) == 0) && (($a % $d) == 0))\n            {\n                $c -= $d;\n                break;\n            }\n            else\n            {\n                $d--;\n            }\n        }\n        if($c == 0)\n        {\n            $f = 1;\n            break;\n        }\n    }\n    else\n    {\n        for($y = 1; $y <= $i; $y++)\n        {\n            if((($c % $e) == 0) && (($b % $e) == 0))\n            {\n                $c -= $e;\n                break;\n            }\n            else\n            {\n                $e--;\n            }\n        }\n        if($c == 0)\n        {\n            $f = 2;\n            break;\n        }\n    }\n}\nif($f == 1)\n{\n    print \"0\";\n}\nelseif($f == 2)\n{\n    print \"1\";\n}\n?>"}, {"source_code": "<?php \nlist($a,$b,$n)=explode(\" \", trim(fgets(STDIN)));\nfunction nod($a, $b) {\n    while ($a != $b)\n        if ($a>$b)\n            $a -= $b;\n        else\n            $b -= $a;\n    return $a;\n}\nfunction lite($a,$b,$n){\n   $f=nod($a,$n);\n   if (($n-$f)==0) return 0;\n   $f1=nod($b,$n-$f);\n   if (($n-$f-$f1)==0) return 1;\n   return lite($a,$b,$n-=($f+$f1));\n}   \nprint lite($a, $b, $n);\n?>"}, {"source_code": "<?php\nwhile($s = fgets(STDIN)){\n$input .= $s;\n}\n\nfunction NOD($a, $b) {\n    if($a == 0) return $b;\n    if($b == 0) return $a;\n    $max = max($a, $b);\n    for ($i=1; $i <= $max; $i++) { \n        if((($a % $i) == 0) && (($b % $i) == 0)) {\n            $delitels[] = $i;\n        }\n    }\n\n    return max($delitels);\n}\n\n$input = explode(' ', $input);\n$semen = (int)$input[0];\n$anti = (int)$input[1];\n$stones = (int)$input[2];\n\n\n$status = 0;\n$winner = 0;\nwhile(true) {\n\n    if($status == 0) {\n        $take = NOD($semen, $stones);\n        $stones = $stones - $take;\n        if($stones < $take) {\n            $winner = 0;\n            break;\n        }\n\n        $status = 1;\n    }\n\n    if($status == 1) {\n        $take = NOD($stones, $anti);\n        $stones = $stones - $take;\n        if($stones < $take) {\n            $winner = 1;\n            break;\n        }\n\n        $status = 0;\n    }\n\n\n\n    \n}\n\necho $winner;"}, {"source_code": "<?php\n   $k = explode(' ',trim(fgets(STDIN)));\n   $n = $k[2];\n   $cur = 0;\n   $turn = 0;\n   while($n>=0){\n       $a = $n;\n       $b = $k[$cur];\n       if ($a > $b) $a ^= $b ^= $a ^= $b;\n       for($i = $b; $i >= 1; $i--) \n           if(($b%$i==0)&&($a%$i==0)) {$turn = $i; break;}\n       if($turn<=$n) {$n-=$turn; $cur ^= 1;} else break;        \n   }\n   $cur ^= 1;\n   echo $cur;\n?>"}, {"source_code": "<?php\nfunction gcd($a,$b) {\n    while(1) {\n        if($a == $b) {\n            return $a;\n        }\n        else if($a < $b) {\n            list($a, $b) = array($b, $a);\n        }\n        while($a > $b && $a > 0) {\n            $a -= $b;\n        }\n        if($a === 0) {\n            return $b;\n        }\n    }\n}\n\n$i = explode(' ',trim(fgets(STDIN)));\n$a = intval($i[0]);\n$b = intval($i[1]);\n$n = intval($i[2]);\n$cur = 1;\nwhile(1) {\n    if( ($cur%2) !== 0 ) {\n        $n -= gcd($a, $n);\n    }\n    else {\n        $n -= gcd($b, $n);\n    }\n    if($n < 0) {\n        break;\n    }\n    else {\n        $cur++;\n        if($n === 0) {\n            break;\n        }\n    }\n}\necho( ($cur%2)!==0?'1':'0' );\n"}, {"source_code": "<?php\nlist($a,$b,$n) = explode(\" \",trim(fgets(STDIN)));\nfunction gcd($a,$b)\n{\n    return ($a % $b) ? gcd($b,$a % $b) : $b;\n}\nwhile (true)\n{\n    if ($n==0){echo \"1\";break;}\n    $n -= gcd($a,$n);\n    if ($n==0){echo \"0\";break;}\n    $n -= gcd($b,$n);\n}"}, {"source_code": "<?php\nlist($a, $b, $n) = explode(' ', trim(fgets(STDIN)));\n\n$k = $a;\n$nn = $n;\n$sem = true;\n\nwhile ($n > 0)\n{\n    while ($k != $n)\n    {\n        if ($k > $n)\n            $k -= $n;\n        else\n            $n -= $k;\n    }\n    \n    if ($sem)\n    {\n        $sem = false;\n        $k = $b;\n    }\n    else\n    {\n        $sem = true;\n        $k = $a;\n    }  \n      \n    $n = $nn - $n; \n    $nn = $n; \n    if ($n <= 0)\n    {\n        switch ($sem)\n        {\n            case true:\n                echo \"1\";\n                break;\n            case false:\n                echo \"0\";\n                break;\n        }\n        break;\n    } \n}\n?>"}, {"source_code": "<?php\n// 119A \u042d\u043f\u0438\u0447\u0435\u0441\u043a\u0430\u044f \u0438\u0433\u0440\u0430 \n\n// \u041d\u0430\u0438\u0431\u043e\u043b\u044c\u0448\u0438\u0439 \u043e\u0431\u0449\u0438\u0439 \u0434\u0435\u043b\u0438\u0442\u0435\u043b\u044c \u041d\u041e\u0414\nfunction gcd($a, $b)\n{\n    if ($a == 0 || $b == 0)\n        return abs( max(abs($a), abs($b)) );\n       \n    $r = $a % $b;\n    return ($r != 0) ?\n        gcd($b, $r) :\n        abs($b);\n}\n\n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\nlist($a, $b, $n) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$flag = true;\nwhile (true) {\n    if ($flag) {\n        $c = $a;\n    } else {\n        $c = $b;\n    }\n\n    $cc = max(abs($c), abs($n));\n    $nn = min(abs($c), abs($n));\n\n    $gcd = gcd ($cc, $nn);\n//echo \"c=$c gcd=$gcd n=$n flag=$flag \\n\";\n    if (($gcd <= $n) and ($n > 0)) {\n        $n -= $gcd;\n        $flag = $flag ^ true;\n    } else {\n        break;\n    }    \n}\n\nif ($flag) {\n    echo '1';\n} else {\n    echo '0';\n}\n\n?>"}, {"source_code": "<?php\n    $n = trim(fgets(STDIN)); \n    list($a,$b,$n)= explode(' ',$n);\n    \n    //\n    function gcd($a,$b){\n        if ($b>$a) {$tmp=$b; $b=$a; $a=$tmp; unset($tmp);}\n        if ($b==0) $b=$a;\n        while ($a%$b>0){\n            $r=$a%$b;\n            $a=$b;\n            $b=$r;            \n        }\n        return $b;  \n    }\n    //\n    \n    while (1==1){\n        $nod=gcd($a,$n);\n        $n=$n-$nod;\n        if ($n<0) {print(1); break;}\n        \n        $nod=gcd($b,$n);\n        $n=$n-$nod;\n        if ($n<0) {print(0); break;}\n    }\n    \n?>"}, {"source_code": "<?php\nfunction NWD($a, $b) {\n    while ($b != 0) {\n        $c = $a % $b;\n        $a = $b;\n        $b = $c;\n    }\n    return $a;\n}\n\nfscanf(STDIN, '%d %d %d', $a, $b, $n);\n\n$player = 0;\nwhile($n > 0) {\n    if(!$player) {\n        $c = $a;\n    } else {\n        $c = $b;\n    }\n    $n -= NWD($c, $n);\n    $player = !$player;\n}\n\necho intVal(!$player);\n\n"}, {"source_code": "<?php\nfunction gcd($i, $j){\n if($i == 0) return $j;\n if($j == 0) return $i;\n if($i == $j) return $i;\n if($i > $j) return gcd($i % $j, $j); else return gcd($i, $j % $i);\n}\n\nlist($a, $b, $n) = explode(' ',trim(fgets(STDIN)));\n\n$r = 1;\nwhile($n > 0){\n if($r == 1) $n -= gcd($n, $a); else $n -= gcd($n, $b);\n $r = 1 - $r;\n}\n\nprint $r;\n\n?>"}, {"source_code": "<?php\nlist($a,$b,$n)=explode(' ',trim(fgets(STDIN)));\nfunction HOD($a,$n) {    \n    while ($a*$n != 0) !($a < $n) ? $a %= $n : $n %= $a;\n    return ($a + $n);\n}\nwhile(true) {\n    $n -= HOD($a,$n);\n    if($n<=0) { echo '0'; break; }\n    $n -= HOD($b,$n);\n    if($n<=0) { echo '1'; break; }\n}"}], "negative_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$f = 0;\n$g = $c;\nfor($x = 1; $x <= $g; $x++)\n{\n    $d = min($a, $c);\n    $e = min($b, $c);\n    if(($x % 2) != 0)\n    {\n        for($y = 1; $y <= $d; $y++)\n        {\n            if(($c % $d) == 0)\n            {\n                $c -= $d;\n                break;\n            }\n            else\n            {\n                $d--;\n            }\n        }\n        if($c == 0)\n        {\n            $f = 1;\n        }\n    }\n    else\n    {\n        for($y = 1; $y <= $e; $y++)\n        {\n            if(($c % $e) == 0)\n            {\n                $c -= $e;\n                break;\n            }\n            else\n            {\n                $e--;\n            }\n        }\n        if($c == 0)\n        {\n            $f = 2;\n        }\n    }\n}\nif($f == 1)\n{\n    print \"0\";\n}\nelseif($f == 2)\n{\n    print \"1\";\n}\n?>"}, {"source_code": "<?php\nlist($a, $b, $n) = explode(' ', trim(fgets(STDIN)));\n\n$k = $a;\n$nn = $n;\n$sem = true;\n\nwhile ($n > 0)\n{\n    while ($k != $n)\n    {\n        if ($k > $n)\n            $k -= $n;\n        else\n            $n -= $k;\n    }\n    \n    if ($sem)\n    {\n        $sem = false;\n        $k = $b;\n        $m++;\n    }\n    else\n    {\n        $sem = true;\n        $k = $a;\n        $l++;\n    }  \n      \n    $n = $nn - $n; \n    $nn = $n;  \n}\nif ($k == max($k, $l))\n    echo \"0\";\nelse\n    echo \"1\";\n?>"}, {"source_code": "<?php\n// 119A \u042d\u043f\u0438\u0447\u0435\u0441\u043a\u0430\u044f \u0438\u0433\u0440\u0430 \n\n// \u041d\u0430\u0438\u0431\u043e\u043b\u044c\u0448\u0438\u0439 \u043e\u0431\u0449\u0438\u0439 \u0434\u0435\u043b\u0438\u0442\u0435\u043b\u044c \u041d\u041e\u0414\nfunction gcd($a, $b)\n{\n    if ($a == 0 || $b == 0)\n        return abs( max(abs($a), abs($b)) );\n       \n    $r = $a % $b;\n    return ($r != 0) ?\n        gcd($b, $r) :\n        abs($b);\n}\n\n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\nlist($a, $b, $n) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$flag = true;\nwhile (true) {\n    if ($flag) {\n        $sum = $a + $n;\n        $c = $a;\n    } else {\n        $sum = $b + $n;\n        $c = $b;\n    }\n\n    $gcd = gcd($a, $sum);\n\necho \" c=$c sum=$sum gcd=$gcd \\n\";\n    if ($gcd <= $n) {\n        $n -= $gcd;\n        $flag = $flag ^ true;\n    } else {\n        break;\n    }    \n}\n\nif ($flag) {\n    echo '1';\n} else {\n    echo '0';\n}\n\n?>"}, {"source_code": "<?php\n// 119A \u042d\u043f\u0438\u0447\u0435\u0441\u043a\u0430\u044f \u0438\u0433\u0440\u0430 \n\n// \u041d\u0430\u0438\u0431\u043e\u043b\u044c\u0448\u0438\u0439 \u043e\u0431\u0449\u0438\u0439 \u0434\u0435\u043b\u0438\u0442\u0435\u043b\u044c \u041d\u041e\u0414\nfunction gcd($a, $b)\n{\n    if ($a == 0 || $b == 0)\n        return abs( max(abs($a), abs($b)) );\n       \n    $r = $a % $b;\n    return ($r != 0) ?\n        gcd($b, $r) :\n        abs($b);\n}\n\n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\nlist($a, $b, $n) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$flag = true;\nwhile (true) {\n    if ($flag) {\n        $c = $a;\n    } else {\n        $c = $b;\n    }\n\n    $cc = max(abs($c), abs($n));\n    $nn = min(abs($c), abs($n));\n\n    $gcd = gcd ($cc, $nn);\necho \"c=$c gcd=$gcd n=$n flag=$flag \\n\";\n    if (($gcd <= $n) and ($n > 0)) {\n        $n -= $gcd;\n        $flag = $flag ^ true;\n    } else {\n        break;\n    }    \n}\n\nif ($flag) {\n    echo '1';\n} else {\n    echo '0';\n}\n\n?>"}, {"source_code": "<?php\n// 119A \u042d\u043f\u0438\u0447\u0435\u0441\u043a\u0430\u044f \u0438\u0433\u0440\u0430 \n\n// \u041d\u0430\u0438\u0431\u043e\u043b\u044c\u0448\u0438\u0439 \u043e\u0431\u0449\u0438\u0439 \u0434\u0435\u043b\u0438\u0442\u0435\u043b\u044c \u041d\u041e\u0414\nfunction gcd($a, $b)\n{\n    if ($a == 0 || $b == 0)\n        return abs( max(abs($a), abs($b)) );\n       \n    $r = $a % $b;\n    return ($r != 0) ?\n        gcd($b, $r) :\n        abs($b);\n}\n\n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\nlist($a, $b, $n) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$flag = true;\nwhile (true) {\n    if ($flag) {\n        $sum = $a + $n;\n        $c = $a;\n    } else {\n        $sum = $b + $n;\n        $c = $b;\n    }\n\n    $gcd = gcd($\u0441, $sum);\n\n    if ($gcd <= $n) {\n        $n -= $gcd;\n        $flag = $flag ^ true;\n    } else {\n        break;\n    }    \n}\n\nif ($flag) {\n    echo '1';\n} else {\n    echo '0';\n}\n\n?>"}, {"source_code": "<?php\n// 119A \u042d\u043f\u0438\u0447\u0435\u0441\u043a\u0430\u044f \u0438\u0433\u0440\u0430 \n\n// \u041d\u0430\u0438\u0431\u043e\u043b\u044c\u0448\u0438\u0439 \u043e\u0431\u0449\u0438\u0439 \u0434\u0435\u043b\u0438\u0442\u0435\u043b\u044c \u041d\u041e\u0414\nfunction gcd($a, $b)\n{\n    if ($a == 0 || $b == 0)\n        return abs( max(abs($a), abs($b)) );\n       \n    $r = $a % $b;\n    return ($r != 0) ?\n        gcd($b, $r) :\n        abs($b);\n}\n\n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\nlist($a, $b, $n) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\n$flag = true;\nwhile (true) {\n    if ($flag) {\n        $sum = $a + $n;\n        $c = $a;\n    } else {\n        $sum = $b + $n;\n        $c = $b;\n    }\n\n    $gcd = gcd($a, $sum);\n\n    if ($gcd <= $n) {\n        $n -= $gcd;\n        $flag = $flag ^ true;\n    } else {\n        break;\n    }    \n}\n\nif ($flag) {\n    echo '1';\n} else {\n    echo '0';\n}\n\n?>"}], "src_uid": "0bd6fbb6b0a2e7e5f080a70553149ac2"}
{"nl": {"description": "In the city of Ultima Thule job applicants are often offered an IQ test. The test is as follows: the person gets a piece of squared paper with a 4\u2009\u00d7\u20094 square painted on it. Some of the square's cells are painted black and others are painted white. Your task is to repaint at most one cell the other color so that the picture has a 2\u2009\u00d7\u20092 square, completely consisting of cells of the same color. If the initial picture already has such a square, the person should just say so and the test will be completed. Your task is to write a program that determines whether it is possible to pass the test. You cannot pass the test if either repainting any cell or no action doesn't result in a 2\u2009\u00d7\u20092 square, consisting of cells of the same color.", "input_spec": "Four lines contain four characters each: the j-th character of the i-th line equals \".\" if the cell in the i-th row and the j-th column of the square is painted white, and \"#\", if the cell is black.", "output_spec": "Print \"YES\" (without the quotes), if the test can be passed and \"NO\" (without the quotes) otherwise.", "sample_inputs": ["####\n.#..\n####\n....", "####\n....\n####\n...."], "sample_outputs": ["YES", "NO"], "notes": "NoteIn the first test sample it is enough to repaint the first cell in the second row. After such repainting the required 2\u2009\u00d7\u20092 square is on the intersection of the 1-st and 2-nd row with the 1-st and 2-nd column."}, "positive_code": [{"source_code": "<?php\n\t$ok = false;\n\t$pre = array();\n\t$st = trim(fgets(STDIN));\n\tfor($i=0,$sz=strlen($st);$i < $sz;++$i) $pre[$i] = intval($st[$i]=='#' ? 1:0);\n\t$cur = array();\n\t$sz=0;\n\n\twhile(($st = trim(fgets(STDIN)))!=\"\") {\n\n\n\t\tif($ok == true) continue;\n\t\t$cur[0] = intval($st[0] == \"#\" ? 1:0);\n\t\t\n\t\tfor($i=1,$sz=strlen($st);($i < $sz);++$i)  {\n\t\t\t$cur[$i] = intval(($st[$i]==\"#\" ? 1:0));\n\n\t\t\t$tmp = intval($pre[$i]+ $pre[$i-1]+$cur[$i-1]+$cur[$i]);\n\t\t\t//print($tmp);\n\t\t\tif($tmp >= 3|| $tmp <= 1){\n\t\t\t\t$ok=true;\n\t\t\t//\tprint(\"yes\");\n\t\t\t}\n\t\t}\n\t//\tprint_r($pre);\n\t\tfor ($i=0;$i<$sz;++$i) $pre[$i] = $cur[$i];\n\t//\tprint_r($pre);\n\t}\n\n\techo($ok==true ? \"YES\":\"NO\");\n?>\n"}, {"source_code": "<?php\n// Retrieve input\n$stdin = fopen('php://stdin', 'r');\nfunction g() {\n\tglobal $stdin;\n\treturn explode(\" \", trim(fgets($stdin)));\n}\n\n// Codeforces Contest 176 Div 2 Problem A\nfor ($i = 0; $i < 4; $i++) {\n\t$raw = g();\n\tfor ($j = 0; $j < 4; $j++) {\n\t\t$x[$i][$j] = ((substr($raw[0], $j, 1) == \"#\") ? 1 : 0);\n\t}\n}\n\nfunction square($i,$j) {\n\tglobal $x;\n\treturn $x[$i][$j] + $x[$i][$j+1] + $x[$i+1][$j] + $x[$i+1][$j+1];\n}\n\nfor ($i = 0; $i < 3; $i++) {\n\tfor ($j = 0; $j < 3; $j++) {\n\t\tif (square($i, $j) != 2) {echo \"YES\"; exit;}\n\t}\n}\n\necho \"NO\";\n\n// End of submission file\n// Submission by chaotic_iak\n?>"}, {"source_code": "<?php\n\t$a = array();\n\tfor ($i = 0; $i < 4; $i++) {\n\t\t$t = trim(fgets(STDIN));\n\t\tarray_push($a,array());\n\t\tfor ($j = 0; $j < 4; $j++) array_push($a[$i],$t[$j]);\n\t}\n\t$chk = false;\n\tfor ($i = 0; $i < 3; $i++)\n\t\tfor ($j = 0; $j < 3; $j++) {\n\t\t\tif (($a[$i][$j] == '#') + ($a[$i+1][$j] == '#') + ($a[$i][$j+1] == '#') + ($a[$i+1][$j+1] == '#') >= 3 || ($a[$i][$j] == '.') + ($a[$i+1][$j] == '.') + ($a[$i][$j+1] == '.') + ($a[$i+1][$j+1] == '.') >= 3) {\n\t\t\t\t$chk = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\techo ($chk) ? 'YES' : 'NO';\n?> "}, {"source_code": "<?php\n    $arr = array();\n    $c = '#';\n    for($i=0; $i<4; $i++)\n        array_push($arr, trim(fgets(STDIN)));\n    $flag = false;\n    for($i=0; $i<3; $i++)\n    {\n        $res = 0;\n        for($j=0; $j<3; $j++)\n        {\n            $res += $arr[$i][$j] == $c;\n            $res += $arr[$i][$j+1] == $c;\n            $res += $arr[$i+1][$j] == $c;\n            $res += $arr[$i+1][$j+1] == $c;\n            if($res != 2)\n                $flag = true;\n            $res = 0;\n        }\n    }\n    if($flag)\n        echo \"YES\\n\";\n    else echo \"NO\\n\";\n?>"}, {"source_code": "<?php\n$a = str_split(trim(fgets(STDIN)));\n$b = str_split(trim(fgets(STDIN)));\n$c = str_split(trim(fgets(STDIN)));\n$d = str_split(trim(fgets(STDIN)));\n$e = array($a[0], $a[1], $b[0], $b[1]);\n$f = array($a[1], $a[2], $b[1], $b[2]);\n$g = array($a[2], $a[3], $b[2], $b[3]);\n$h = array($b[0], $b[1], $c[0], $c[1]);\n$i = array($b[1], $b[2], $c[1], $c[2]);\n$j = array($b[2], $b[3], $c[2], $c[3]);\n$k = array($c[0], $c[1], $d[0], $d[1]);\n$l = array($c[1], $c[2], $d[1], $d[2]);\n$m = array($c[2], $c[3], $d[2], $d[3]);\n$n = array($e, $f, $g, $h, $i, $j, $k, $l, $m);\n$o = 0;\n$p = 0;\n$r = 0;\nfor($x = 0; $x < count($n); $x++)\n{\n    for($y = 0; $y < 4; $y++)\n    {\n        if($n[$x][$y] == \"#\")\n        {\n            $o++;\n        }\n        elseif($n[$x][$y] == \".\")\n        {\n            $p++;\n        }\n    }\n    if(($o >= 3) || ($p >= 3))\n    {\n        $r = 1;\n        break;\n    }\n    else\n    {\n        $o = 0;\n        $p = 0;\n    }\n}\nif($r == 1)\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$a = \"NO\";\n$m = array('#'=>1,'.'=>-1);\n$s = '';\nfor($i =0;$i<4;$i++)\n\t$s .= trim(fgets(STDIN));\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i*4+$j]]+$m[$s[$i*4+$j+1]]+$m[$s[($i+1)*4+$j]]+$m[$s[($i+1)*4+$j+1]])>=2&&$a = \"YES\")\n\t\t\tbreak 2;\necho $a;\nreturn;\n?>"}], "negative_code": [{"source_code": "<?php\n\t$ok = false;\n\t$pre = array();\n\t$st = trim(fgets(STDIN));\n\tfor($i=0,$sz=strlen($st);$i < $sz;++$i) $pre[i] = ($st[i]=='#');\n\t$cur = array();\n\twhile(($st = trim(fgets(STDIN)))!=\"\") {\n\t\t$cur[0] = $st[0] == \"#\";\n\t\tfor($i=1,$sz=strlen($st);$i < $sz && !$ok;++$i)  {\n\t\t\t$cur[i] = ($st[i]==\"#\");\n\t\t\tif($pre[i]==$pre[i-1] && $cur[i-1] == $cur[i] && $cur[i] == $pre[i]) {\n\t\t\t\t$ok=true;\n\t\t\t}\n\t\t}\n\t\tfor ($i=0;$i<$sz;++$i) $pre[i] = $cur[i];\n\t}\n\n\techo($ok==true? \"YES\":\"NO\");\n?>\n"}, {"source_code": "<?php\n\t$ok = false;\n\t$pre = array();\n\t$st = trim(fgets(STDIN));\n\tfor($i=0,$sz=strlen($st);$i < $sz;++$i) $pre[i] = intval($st[i]=='#' ? 1:0);\n\t$cur = array();\n\twhile(($st = trim(fgets(STDIN)))!=\"\") {\n\n\t\t$cur[0] = intval($st[0] == \"#\" ? 1:0);\n\t\tfor($i=1,$sz=strlen($st);($i < $sz) && (false==$ok);++$i)  {\n\t\t\t$cur[i] = intval(($st[i]==\"#\" ? 1:0));\n\t\t\t$tmp = $pre[i]+ $pre[i-1]+$cur[i-1]+$cur[i];\n\t\t\tprint($tmp);\n\t\t\tif($tmp >= 3|| $tmp <= 1){\n\t\t\t\t$ok=true;\n\t\t\t\tprint(\"yes\");\n\t\t\t}\n\t\t}\n\t\tfor ($i=0;$i<$sz && $ok == false;++$i) $pre[i] = $cur[i];\n\t}\n\n\techo($ok==true ? \"YES\":\"NO\");\n?>\n"}, {"source_code": "<?php\n\t$ok = false;\n\t$pre = array();\n\t$st = trim(fgets(STDIN));\n\tfor($i=0,$sz=strlen($st);$i < $sz;++$i) $pre[i] = intval($st[i]=='#' ? 1:0);\n\t$cur = array();\n\twhile(($st = trim(fgets(STDIN)))!=\"\") {\n\n\t\t$cur[0] = intval($st[0] == \"#\" ? 1:0);\n\t\tfor($i=1,$sz=strlen($st);($i < $sz) && (false==$ok);++$i)  {\n\t\t\t$cur[i] = intval(($st[i]==\"#\" ? 1:0));\n\t\t\t$tmp = $pre[i]+ $pre[i-1]+$cur[i-1]+$cur[i];\n\t\t//\tprint($tmp);\n\t\t\tif($tmp >= 3|| $tmp <= 1){\n\t\t\t\t$ok=true;\n\t\t//\t\tprint(\"yes\");\n\t\t\t}\n\t\t}\n\t\tfor ($i=0;$i<$sz && $ok == false;++$i) $pre[i] = $cur[i];\n\t}\n\n\techo($ok==true ? \"YES\":\"NO\");\n?>\n"}, {"source_code": "<?php\n\t$a = array();\n\tfor ($i = 0; $i < 4; $i++) {\n\t\t$t = trim(fgets(STDIN));\n\t\tarray_push($a,array());\n\t\tfor ($j = 0; $j < 4; $j++) array_push($a[$i],$t[$j]);\n\t}\n\t$chk = false;\n\tfor ($i = 0; $i < 3; $i++)\n\t\tfor ($j = 0; $j < 3; $j++) {\n\t\t\tif (($a[$i][$j] == '#') + ($a[$i+1][$j] == '#') + ($a[$i][$j+1] == '#') + ($a[$i+1][$j+1] == '#') >= 3) {\n\t\t\t\t$chk = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\techo ($chk) ? 'YES' : 'NO';\n?> "}, {"source_code": "<?php\n    $arr = array();\n    $c = '#';\n    for($i=0; $i<4; $i++)\n        array_push($arr, trim(fgets(STDIN)));\n    $cnt = 0;\n    for($i=0; $i<3; $i++)\n    {\n        $res = 0;\n        for($j=0; $j<3; $j++)\n        {\n            $res += $arr[$i][$j] == $c;\n            $res += $arr[$i][$j+1] == $c;\n            $res += $arr[$i+1][$j] == $c;\n            $res += $arr[$i+1][$j+1] == $c;\n            $cnt = max($cnt, $res);\n            $res = 0;\n        }\n    }\n    if($cnt > 2)\n        echo \"YES\\n\";\n    else echo \"NO\\n\";\n?>"}, {"source_code": "<?php\n    $arr = array();\n    $c = '#';\n    for($i=0; $i<4; $i++)\n        array_push($arr, trim(fgets(STDIN)));\n    $cnt = 0;\n    for($i=0; $i<3; $i++)\n    {\n        $res = 0;\n        for($j=0; $j<3; $j++)\n        {\n            $res += $arr[$i][$j] == $c;\n            $res += $arr[$i][$j+1] == $c;\n            $res += $arr[$i+1][$j] == $c;\n            $res += $arr[$i+1][$j+1] == $c;\n            $cnt = max($cnt, $res);\n            $res = 0;\n        }\n    }\n    if($cnt != 2)\n        echo \"YES\\n\";\n    else echo \"NO\\n\";\n?>"}, {"source_code": "<?php\n$s = '';\nfor($i =0;$i<4;$i++)\n\t$s .= trim(fgets(STDIN));\nprint_r($s);\t\n$m = array('#'=>1,'.'=>-1);\n$a = \"NO\";\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i*4+$j]]+$m[$s[$i*4+$j+1]]+$m[$s[($i+1)*4+$j]]+$m[$s[($i+1)*4+$j+1]])==2&&$a = \"YES\")\n\t\t\tbreak 2;\n\necho $a;\nreturn;\n?>"}, {"source_code": "<?php\n$s = array();\n$i = 0;\nprint_r($argv);\nreturn;\nwhile(!empty($argv[++$i]))\n    $s[] = str_split($argv[$i]);\n\n$m = array('#'=>1,'.'=>-1);\nfor($i=0;$i<3;$i++)\n    for($j=0;$j<3;$j++)\n        if(abs($m[$s[$i][$j]]+$m[$s[$i][$j+1]]+$m[$s[$i+1][$j]]+$m[$s[$i+1][$j+1]])==2){\n            echo \"YES\";\n            return;\n        }\necho \"NO\";\nreturn;\n?>"}, {"source_code": "<?php\n$s = fgets(STDIN, 20);\t\n$m = array('#'=>1,'.'=>-1);\n$a = \"NO\";\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i*4+$j]]+$m[$s[$i*4+$j+1]]+$m[$s[($i+1)*4+$j]]+$m[$s[($i+1)*4+$j+1]])==2){\n\t\t\t$a = \"YES\";\n\t\t\tbreak 2;\n\t\t}\necho $a;\nreturn;\n?>"}, {"source_code": "<?php\n$s = array();\n$i = 0;\nwhile(!empty($argv[++$i]))\n\t$s[] = str_split($argv[$i]);\n\n$m = array('#'=>1,'.'=>-1);\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i][$j]]+$m[$s[$i][$j+1]]+$m[$s[$i+1][$j]]+$m[$s[$i+1][$j+1]])==2){\n\t\t\techo \"YES\";\n\t\t\treturn;\n\t\t}\necho \"NO\";\nreturn;\n?>"}, {"source_code": "<?php\n$s = array();\n$i = 0;\nwhile($t = trim(fgets(STDIN, 255))){\n\tprint_r($t);\t\n}\n\t$s[] = str_split($t);\n\n$m = array('#'=>1,'.'=>-1);\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i][$j]]+$m[$s[$i][$j+1]]+$m[$s[$i+1][$j]]+$m[$s[$i+1][$j+1]])==2){\n\t\t\techo \"YES\";\n\t\t\treturn;\n\t\t}\necho \"NO\";\nreturn;\n?>"}, {"source_code": "<?php\n$t = str_split(trim(fgets(STDIN, 20)),4);\n$s = array();\n$i = -1;\nwhile(!empty($t[++$i]))\n\t$s[] = str_split($t[$i]); \n\t\n$m = array('#'=>1,'.'=>-1);\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i][$j]]+$m[$s[$i][$j+1]]+$m[$s[$i+1][$j]]+$m[$s[$i+1][$j+1]])==2){\n\t\t\techo \"YES\";\n\t\t\treturn;\n\t\t}\necho \"NO\";\nreturn;\n?>"}, {"source_code": "<?php\n$s = trim(fgets(STDIN, 20));\t\n$m = array('#'=>1,'.'=>-1);\n$a = \"NO\";\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i*4+$j]]+$m[$s[$i*4+$j+1]]+$m[$s[($i+1)*4+$j]]+$m[$s[($i+1)*4+$j+1]])==2){\n\t\t\t$a = \"YES\";\n\t\t\tbreak 2;\n\t\t}\necho $a;\nreturn;\n?>"}, {"source_code": "<?php\n$t = trim(fgets(STDIN, 20));\t\n$m = array('#'=>1,'.'=>-1);\n$a = \"NO\";\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i*4+$j]]+$m[$s[$i*4+$j+1]]+$m[$s[($i+1)*4+$j]]+$m[$s[($i+1)*4+$j+1]])==2){\n\t\t\t$a = \"YES\";\n\t\t\tbreak 2;\n\t\t}\necho $a;\nreturn;\n?>"}, {"source_code": "<?php\n$t = trim(fgets(STDIN, 20));\t\n$m = array('#'=>1,'.'=>-1);\n$a = \"NO\";\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i*4+$j]]+$m[$s[$i*4+$j+1]]+$m[$s[$i*5+$j]]+$m[$s[$i*5+$j+1]])==2){\n\t\t\t$a = \"YES\";\n\t\t\tbreak 2;\n\t\t}\necho $a;\nreturn;\n?>"}, {"source_code": "<?php\n$t = fgets(STDIN, 20);\t\n$m = array('#'=>1,'.'=>-1);\n$a = \"NO\";\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i*4+$j]]+$m[$s[$i*4+$j+1]]+$m[$s[$i*5+$j]]+$m[$s[$i*5+$j+1]])==2){\n\t\t\t$a = \"YES\";\n\t\t\tbreak 2;\n\t\t}\necho $a;\nreturn;\n?>"}, {"source_code": "<?php\n$t = fgets(STDIN, 20);\t\n$m = array('#'=>1,'.'=>-1);\n$a = \"NO\";\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i*4+$j]]+$m[$s[$i*4+$j+1]]+$m[$s[($i+1)*4+$j]]+$m[$s[($i+1)*4+$j+1]])==2){\n\t\t\t$a = \"YES\";\n\t\t\tbreak 2;\n\t\t}\necho $a;\nreturn;\n?>"}, {"source_code": "<?php\n$s = '';\n\n$s = trim(fgets(STDIN));\nprint_r($s);\t\n$m = array('#'=>1,'.'=>-1);\n$a = \"NO\";\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i*4+$j]]+$m[$s[$i*4+$j+1]]+$m[$s[($i+1)*4+$j]]+$m[$s[($i+1)*4+$j+1]])==2&&$a = \"YES\")\n\t\t\tbreak 2;\n\necho $a;\nreturn;\n?>"}, {"source_code": "<?php\n$t = str_split(trim(fgets(STDIN, 20)),4);\n$s = array();\n$i = -1;\nwhile(!empty($t[++$i]))\n\t$s[] = str_split($t[$i]); \nprint_r($t);\n\tprint_r($s);\n\t\n$m = array('#'=>1,'.'=>-1);\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i][$j]]+$m[$s[$i][$j+1]]+$m[$s[$i+1][$j]]+$m[$s[$i+1][$j+1]])==2){\n\t\t\techo \"YES\";\n\t\t\treturn;\n\t\t}\necho \"NO\";\nreturn;\n?>"}, {"source_code": "<?php\n$a = \"NO\";\n$m = array('#'=>1,'.'=>-1);\n$s = '';\nfor($i =0;$i<4;$i++)\n\t$s .= trim(fgets(STDIN));\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i*4+$j]]+$m[$s[$i*4+$j+1]]+$m[$s[($i+1)*4+$j]]+$m[$s[($i+1)*4+$j+1]])==2&&$a = \"YES\")\n\t\t\tbreak 2;\necho $a;\nreturn;\n?>"}, {"source_code": "<?php\n$t = str_split(trim(fgets(STDIN, 20)),4);\n$s = array();\n$i = -1;\nwhile(!empty($t[++$i]))\n\t$s[] = str_split($t[$i]); \nprint_r($s);\n\t\n$m = array('#'=>1,'.'=>-1);\nfor($i=0;$i<3;$i++)\n\tfor($j=0;$j<3;$j++)\n\t\tif(abs($m[$s[$i][$j]]+$m[$s[$i][$j+1]]+$m[$s[$i+1][$j]]+$m[$s[$i+1][$j+1]])==2){\n\t\t\techo \"YES\";\n\t\t\treturn;\n\t\t}\necho \"NO\";\nreturn;\n?>"}], "src_uid": "01b145e798bbdf0ca2ecc383676d79f3"}
{"nl": {"description": "You are solving the crossword problem K from IPSC 2014. You solved all the clues except for one: who does Eevee evolve into? You are not very into pokemons, but quick googling helped you find out, that Eevee can evolve into eight different pokemons: Vaporeon, Jolteon, Flareon, Espeon, Umbreon, Leafeon, Glaceon, and Sylveon.You know the length of the word in the crossword, and you already know some letters. Designers of the crossword made sure that the answer is unambiguous, so you can assume that exactly one pokemon out of the 8 that Eevee evolves into fits the length and the letters given. Your task is to find it.", "input_spec": "First line contains an integer n (6\u2009\u2264\u2009n\u2009\u2264\u20098) \u2013 the length of the string. Next line contains a string consisting of n characters, each of which is either a lower case english letter (indicating a known letter) or a dot character (indicating an empty cell in the crossword).", "output_spec": "Print a name of the pokemon that Eevee can evolve into that matches the pattern in the input. Use lower case letters only to print the name (in particular, do not capitalize the first letter).", "sample_inputs": ["7\nj......", "7\n...feon", "7\n.l.r.o."], "sample_outputs": ["jolteon", "leafeon", "flareon"], "notes": "NoteHere's a set of names in a form you can paste into your solution:[\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"]{\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"}"}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = array(\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\");\nif($a == 6)\n{\n    print $c[3];\n}\nelseif($a == 8)\n{\n    print $c[0];\n}\nelse\n{\n    $d = 0;\n    for($x = 0; $x < $a; $x++)\n    {\n        if($b[$x] != \".\")\n        {\n            $d++;\n        }\n    }\n    for($x = 0; $x < 8; $x++)\n    {\n        $e = 0;\n        for($y = 0; $y < $a; $y++)\n        {\n            if(($b[$y] == $c[$x][$y]) && ($b[$y] != \".\"))\n            {\n                $e++;\n            }\n        }\n        if($e == $d)\n        {\n            break;\n        }\n    }\n    print $c[$x];\n}\n?>"}, {"source_code": "<?php\n$names = array(\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\");\n$num = (int)trim(fgets(STDIN));\n$str = trim(fgets(STDIN));\n$rezult='';\n\nif ($num<6 || $num >8) exit;\n\nforeach($names as $k=>$v){\nif(strlen($v)==$num){\n$temp=0;\nfor($i=0;$i<=strlen($str)-1;$i++){\n\nif($v[$i]==$str[$i] || $str[$i]=='.'){\n$temp++;\n}\n\n}\nif($temp==$num){$rezult=$v;}\n}\n}\n\nprint $rezult;\n?>"}, {"source_code": "<?php\n\n$len = (int)trim(fgets(STDIN));\n\nif ($len < 6 OR $len > 8) exit;\n\n$letter = trim(fgets(STDIN));\n\nif ($len !== strlen($letter)) exit;\n\n$pokemons = array(\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\");\n\n$letters = array();\nfor ($i=0; $i<$len; $i++)\n{\n    if ($letter{$i} === '.') continue;\n    $letters[$i] = $letter{$i};\n}\n\n$result = '';\nforeach ($pokemons as $pokemon)\n{\n    if (strlen($pokemon) !== $len) continue;\n\n    $find = TRUE;\n    foreach ($letters as $k => $v)\n        if ($pokemon{$k} !== $v)\n            $find = FALSE;\n\n    if ($find)\n    {\n        $result = $pokemon;\n        break;\n    }\n}\n\nprint $result;\n"}, {"source_code": "<?php\n\n//$t = microtime(true);\n$n = (int)(trim(readln()));\n\nif ($n === 6) {\n\techo 'espeon';\n\tdie();\n}\nelseif ($n === 8) {\n\techo 'vaporeon';\n\tdie();\n}\nelseif ($n === 7) {\n\t$ar = array(\n\t\t'jolteon',\n\t\t'flareon',\n\t\t'umbreon',\n\t\t'leafeon',\n\t\t'glaceon',\n\t\t'sylveon'\n\t);\n\t$str = trim(readln());\n\tfor($i = 0; $i < 7; $i++) {\n\t\t$char = $str[$i];\n\t\tif ($str[$i] === '.') {\n\t\t\tcontinue;\n\t\t}\n\t\t$ar = array_filter($ar, function($item) use ($char, $i) {\n\t\t\treturn $item[$i] == $char;\n\t\t});\n\t}\n\techo reset($ar);\n}\n\n\n//echo $t - microtime(true);\nfunction readln()\n{\n\tstatic $input =null;\n\tif ($input === null) {\n\t\t$input = fopen('php://STDIN', 'r');\n//\t\t$debug = __FILE__ . '.txt';\n//\t\tvar_dump($debug);\n//\t\t$input = fopen($debug, 'r');\n\t}\n\treturn trim(fgets($input));\n}"}, {"source_code": "<?php\nfscanf(STDIN,\"%d\",$n);\n$str=trim(fgets(STDIN));\n$eve=[\n\t\t 0=>\"vaporeon\",\n\t\t 1=>\"jolteon\",\n\t\t 2=>\"flareon\", \n\t\t 3=>\"espeon\", \n\t\t 4=>\"umbreon\",\n\t\t 5=>\"leafeon\", \n\t\t 6=>\"glaceon\", \n\t\t 7=>\"sylveon\"\n    ];\n $ev1=\"vaporeon\";\n $ev2=\"jolteon\";\n $ev3=\"flareon\";\n $ev4=\"espeon\";\n $ev5=\"umbreon\";\n $ev6=\"leafeon\";\n $ev7=\"glaceon\";\n $ev8=\"sylveon\";\nif($str=='......')\necho \"espeon\";\nelseif ($str=='........')\n {\n \techo \"vaporeon\";\n\t# code...\n}\n\n\n\nelse\n{\n\n\n   \n   \n   $flag=0;\n   $max=0;\n   //$length=9;\n   $trgetStr=findTrgtStr($str);\nfor ($i=0; $i <count($eve) ; $i++)\n{   \n\n\t$count=0;\n\n   for ($j=0; $j <5 ; $j++)\n    { \n     \n   \t   if($eve[$i][$j]==$trgetStr[$count])\n   \t   {\n               \n   \t   \t   $count++;\n   \t   \t  // $str3=$eve[$i];\n\n   \t   \t   if($count==strlen($trgetStr))\n   \t   \t   {\n             //echo \"$str3\\n\";\n   \t   \t   \t$flag=1;\n   \t   \t   \tbreak;\n   \t   \t   }\n   \t   }\n   \t        \n    }   \n\n          \n\n          if($count>=$max&&strlen($eve[$i])==$n)\n          {\n          \t$max=$count;\n          \t//$length=strlen($eve[$i]);\n          \t$str3=$eve[$i];\n          }\n          //echo \"$max\\n\";\n\n   \n   \n}\t\nprint_r($str3);\n}\n\nfunction findTrgtStr($str)\n{\n\t$trgetStr=\"\";\nfor ($i=0; $i <strlen($str) ; $i++)\n{ \n\tif($str[$i]=='.')\n\t\tcontinue;\n\telse\n\t\t$trgetStr.=$str[$i];\n\n}\nreturn $trgetStr;\n}"}, {"source_code": "<?php\nfscanf(STDIN,\"%d\",$n);\n$str=trim(fgets(STDIN));\n$eve=[\n\t\t 0=>\"vaporeon\",\n\t\t 1=>\"jolteon\",\n\t\t 2=>\"flareon\", \n\t\t 3=>\"espeon\", \n\t\t 4=>\"umbreon\",\n\t\t 5=>\"leafeon\", \n\t\t 6=>\"glaceon\", \n\t\t 7=>\"sylveon\"\n    ];\n\nif($str=='......')\necho \"espeon\";\nelseif ($str=='........')\n {\n \techo \"vaporeon\";\n\t# code...\n}\n\n\n\nelse\n{\n\n\n   \n   \n   $flag=0;\n   $max=0;\n   //$length=9;\n   $trgetStr=findTrgtStr($str);\nfor ($i=0; $i <count($eve) ; $i++)\n{   \n\n\t$count=0;\n\n   for ($j=0; $j <5 ; $j++)\n    { \n     \n   \t   if($eve[$i][$j]==$trgetStr[$count])\n   \t   {\n               \n   \t   \t   $count++;\n   \t   \t  // $str3=$eve[$i];\n\n   \t   \t   if($count==strlen($trgetStr))\n   \t   \t   {\n             //echo \"$str3\\n\";\n   \t   \t   \t$flag=1;\n   \t   \t   \tbreak;\n   \t   \t   }\n   \t   }\n   \t        \n    }   \n\n          \n\n          if($count>=$max&&strlen($eve[$i])==$n)\n          {\n          \t$max=$count;\n          \t//$length=strlen($eve[$i]);\n          \t$str3=$eve[$i];\n          }\n          //echo \"$max\\n\";\n\n   \n   \n}\t\nprint_r($str3);\n}\n\nfunction findTrgtStr($str)\n{\n\t$trgetStr=\"\";\nfor ($i=0; $i <strlen($str) ; $i++)\n{ \n\tif($str[$i]=='.')\n\t\tcontinue;\n\telse\n\t\t$trgetStr.=$str[$i];\n\n}\nreturn $trgetStr;\n}"}, {"source_code": "<?php\n/**\n * User: Nash\n * Date: 7/27/14\n * Time: 10:29 PM\n */\n$in = fopen('php://stdin', 'r');\n\n$names = array(\"jolteon\", \"flareon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\");\n$pos = array(1,1,1,1,1,1);\n$n = intval(rtrim(fgets($in)));\n$s = rtrim(fgets($in));\n\nif($n==6){\n    echo \"espeon\";\n}\nelse if($n==8){\n    echo \"vaporeon\";\n}else{\n    $c = 6;\n    for($i=0; $i<$n; $i++){\n        if($s[$i]!=\".\"){\n            foreach($names as $k => $name){\n                if($pos[$k] && $s[$i]!=$name[$i]){\n                    $pos[$k] = 0;\n                    $c--;\n                }\n            }\n            if($c==1){\n                break;\n            }\n        }\n    }\n\n    for($i=0; $i<$n; $i++){\n        if($pos[$i]){\n            echo $names[$i];\n            break;\n        }\n    }\n\n}\n"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = array(\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\");\n$d = 0;\nfor($x = 0; $x < $a; $x++)\n{\n    if($b[$x] != \".\")\n    {\n        $d++;\n    }\n}\nfor($x = 0; $x < 8; $x++)\n{\n    $e = 0;\n    for($y = 0; $y < $a; $y++)\n    {\n        if(($b[$y] == $c[$x][$y]) && ($b[$y] != \".\"))\n        {\n            $e++;\n        }\n    }\n    if($e == $d)\n    {\n        break;\n    }\n}\nprint $c[$x];\n?>"}, {"source_code": "<?php\n$pokemons = array(\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\");\n$num = (int)trim(fgets(STDIN));\n$str = trim(fgets(STDIN));\n\n\n\n\nprint 'jolteon';\n?>"}, {"source_code": "<?php\nfscanf(STDIN,\"%d\",$n);\n$str=trim(fgets(STDIN));\n$trgetStr=\"\";\nfor ($i=0; $i <strlen($str) ; $i++)\n{ \n\tif($str[$i]=='.')\n\t\tcontinue;\n\telse\n\t\t$trgetStr.=$str[$i];\n\n}\n$eve=[\n\t\t 0=>\"vaporeon\",\n\t\t 1=>\"jolteon\",\n\t\t 2=>\"flareon\", \n\t\t 3=>\"espeon\", \n\t\t 4=>\"umbreon\",\n\t\t 5=>\"leafeon\", \n\t\t 6=>\"glaceon\", \n\t\t 7=>\"sylveon\"\n    ];\n   \n   \n   $flag=0;\n   $max=0;\nfor ($i=0; $i <count($eve) ; $i++)\n{   $count=0;\n   for ($j=0; $j <5 ; $j++)\n    { \n\n   \t   if($eve[$i][$j]==$trgetStr[$count])\n   \t   {\n               \n   \t   \t   $count++;\n   \t   \t  // $str3=$eve[$i];\n\n   \t   \t   if($count==strlen($trgetStr))\n   \t   \t   {\n             //echo \"$str3\\n\";\n   \t   \t   \t$flag=1;\n   \t   \t   \tbreak;\n   \t   \t   }\n   \t   }\n   \t        \n    }\n          if($count>=$max)\n          {\n          \t$max=$count;\n          \t$str3=$eve[$i];\n          }\n          //echo \"$max\\n\";\n\n   if($flag==1)\n   \tbreak;\n   \n}\t\necho \"$str3\\n\";\n"}, {"source_code": "<?php\nfscanf(STDIN,\"%d\",$n);\n$str=trim(fgets(STDIN));\nif($str=='......')\necho \"espeon\";\nelseif ($str=='........')\n {\n \techo \"vaporeon\";\n\t# code...\n}\nelse\n{\n$trgetStr=\"\";\nfor ($i=0; $i <strlen($str) ; $i++)\n{ \n\tif($str[$i]=='.')\n\t\tcontinue;\n\telse\n\t\t$trgetStr.=$str[$i];\n\n}\n$eve=[\n\t\t 0=>\"vaporeon\",\n\t\t 1=>\"jolteon\",\n\t\t 2=>\"flareon\", \n\t\t 3=>\"espeon\", \n\t\t 4=>\"umbreon\",\n\t\t 5=>\"leafeon\", \n\t\t 6=>\"glaceon\", \n\t\t 7=>\"sylveon\"\n    ];\n   \n   \n   $flag=0;\n   $max=0;\nfor ($i=0; $i <count($eve) ; $i++)\n{   $count=0;\n   for ($j=0; $j <5 ; $j++)\n    { \n\n   \t   if($eve[$i][$j]==$trgetStr[$count])\n   \t   {\n               \n   \t   \t   $count++;\n   \t   \t  // $str3=$eve[$i];\n\n   \t   \t   if($count==strlen($trgetStr))\n   \t   \t   {\n             //echo \"$str3\\n\";\n   \t   \t   \t$flag=1;\n   \t   \t   \tbreak;\n   \t   \t   }\n   \t   }\n   \t        \n    }\n          if($count>=$max)\n          {\n          \t$max=$count;\n          \t$str3=$eve[$i];\n          }\n          //echo \"$max\\n\";\n\n   if($flag==1)\n   \tbreak;\n   \n}\t\necho \"$str3\\n\";\n}"}], "src_uid": "ec3d15ff198d1e4ab9fd04dd3b12e6c0"}
{"nl": {"description": "While playing with geometric figures Alex has accidentally invented a concept of a $$$n$$$-th order rhombus in a cell grid.A $$$1$$$-st order rhombus is just a square $$$1 \\times 1$$$ (i.e just a cell).A $$$n$$$-th order rhombus for all $$$n \\geq 2$$$ one obtains from a $$$n-1$$$-th order rhombus adding all cells which have a common side with it to it (look at the picture to understand it better).    Alex asks you to compute the number of cells in a $$$n$$$-th order rhombus.", "input_spec": "The first and only input line contains integer $$$n$$$ ($$$1 \\leq n \\leq 100$$$)\u00a0\u2014 order of a rhombus whose numbers of cells should be computed.", "output_spec": "Print exactly one integer\u00a0\u2014 the number of cells in a $$$n$$$-th order rhombus.", "sample_inputs": ["1", "2", "3"], "sample_outputs": ["1", "5", "13"], "notes": "NoteImages of rhombus corresponding to the examples are given in the statement."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = 1;\n$c = 4;\nfor($x = 1; $x <= 100; $x++)\n{\n     if($a == $x)\n     {\n          print $b;\n     }\n     else\n     {\n          $b += $c;\n          $c += 4;\n     }\n}\n?>"}, {"source_code": "<?php\n# 1180A\n$stdin = STDIN;\n[$n] = fscanf($stdin, '%u');\n$quarter = 0;\n$quarterLimit = $n - 1;\nfor ($i = 1; $i <= $quarterLimit; $i++) {\n    $quarter += $i;\n}\necho $quarter * 4 + 1;\n"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\nfor ($i = 1, $r = 0; $i < $n; $i++) $r += $i;\necho $r * 4 + 1;\n"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\necho $n ** 2 + ($n - 1) ** 2;\n"}, {"source_code": "<?php\n   $n = trim(fgets(STDIN));\n\n\n    echo pow($n, 2) + pow($n-1, 2);\n\n\n?>"}, {"source_code": "<?php\n$input=trim(fgets(STDIN));\n$sum=0;\n$array=range(1,1000,2);\nfor ($i=0;$i<$input;$i++) { \n      $sum+=$array[$i];\n}\n$sum=$sum*2-$array[$input-1];\necho $sum;\n\n"}, {"source_code": "<?php\n $n = trim(fgets(STDIN));\n $f = (2 * $n) - 1;\n $c = (($f * $f) + 1) / 2;\n echo $c;\n ?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = 1;\n$c = 4;\nfor($x = 1; $x <= 100; $x++)\n{\n     if($a == $x)\n     {\n          print $b;\n     }\n     else\n     {\n          $b += $c;\n          $c *= 2;\n     }\n}\n?>"}], "src_uid": "758d342c1badde6d0b4db81285be780c"}
{"nl": {"description": "Bear Limak likes watching sports on TV. He is going to watch a game today. The game lasts 90 minutes and there are no breaks.Each minute can be either interesting or boring. If 15 consecutive minutes are boring then Limak immediately turns TV off.You know that there will be n interesting minutes t1,\u2009t2,\u2009...,\u2009tn. Your task is to calculate for how many minutes Limak will watch the game.", "input_spec": "The first line of the input contains one integer n (1\u2009\u2264\u2009n\u2009\u2264\u200990)\u00a0\u2014 the number of interesting minutes. The second line contains n integers t1,\u2009t2,\u2009...,\u2009tn (1\u2009\u2264\u2009t1\u2009&lt;\u2009t2\u2009&lt;\u2009... tn\u2009\u2264\u200990), given in the increasing order.", "output_spec": "Print the number of minutes Limak will watch the game.", "sample_inputs": ["3\n7 20 88", "9\n16 20 30 40 50 60 70 80 90", "9\n15 20 30 40 50 60 70 80 90"], "sample_outputs": ["35", "15", "90"], "notes": "NoteIn the first sample, minutes 21,\u200922,\u2009...,\u200935 are all boring and thus Limak will turn TV off immediately after the 35-th minute. So, he would watch the game for 35 minutes.In the second sample, the first 15 minutes are boring.In the third sample, there are no consecutive 15 boring minutes. So, Limak will watch the whole game."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = 0;\n$d = 0;\nfor($x = 1; $x <= 90; $x++)\n{\n     for($y = 0; $y < $a; $y++)\n     {\n          if($x == $b[$y])\n          {\n               $d = 1;\n               break;\n          }\n     }\n     if($d == 1)\n     {\n          $c = 0;\n          $d = 0;\n     }\n     else\n     {\n          $c++;\n          if($c == 15)\n          {\n               break;\n          }\n     }\n}\nif($x == 91)\n{\n     $x--;\n}\nprint $x;\n?>"}, {"source_code": "<?php\n\n\t$totalInterestingMinutes = readline(\"\");\n\t$minutes = readline(\"\");\n\n\t$minutes = explode(\" \", $minutes);\n\n\t$prevMin = 0;\n\t$result = 90;\n\t$count = count($minutes);\n\tforeach($minutes as $key => $min) {\n\t\t$min = (int)$min;\n\t\tif($min - $prevMin > 15) {\n\t\t\t$result = $prevMin + 15;\n\t\t\tbreak;\n\t\t}\n\t\tif($min == 90) {\n\t\t\t$result = 90;\n\t\t\tbreak;\n\t\t}\n\t\tif($key == $count - 1 && $min + 15 < 90) {\n\t\t\t$result = $min + 15;\n\t\t\tbreak;\n\t\t}\n\t\t$prevMin = $min;\n\t}\n\techo $result;\n?>"}, {"source_code": "<?php\nfunction test($n,$arr){\n    $start = 0;\n    for($i = 0;$i< $n ;$i++){\n        if(($arr[$i] - $start) > 15) return ($start+15) >= 90 ? 90 : $start+15 ;\n        $start = $arr[$i];\n    }\n    return ($arr[$n-1] + 15) >= 90 ? 90 : $arr[$n-1]+15;\n}\n    // \u00a0Bear and Game\n    $in = 'php://stdin';\n    $input = fopen($in, \"r\");\n    $n = fgets($input);\n    $t = [];\n    $t = array_merge($t, explode(\" \", trim(fgets($input))));\n    echo (test($n,$t));\n\n?>"}, {"source_code": "<?php\n// http://codeforces.com/problemset/problem/691/A\n$handle = fopen (\"php://stdin\", \"r\");\nfscanf($handle, \"%i\",$n);\n$arr_temp = fgets($handle);\n$arrInput = explode(\" \",$arr_temp);\n$arr = array_map('intval', $arrInput);\n\n$maxWait = 15;\nforeach ($arr as $interestMin) {\n\tif($interestMin > $maxWait){\n\t\techo $maxWait;die;\n\t}else{\n\t\t$maxWait = $interestMin + 15;\n\t}\n}\necho $maxWait > 90 ? 90 : $maxWait;\n\n?>"}, {"source_code": "<?php\n\n###### IO ######\nerror_reporting(E_ALL);\nerror_reporting(0);\n\nfunction readString($f) {\n\t$r = array(\n\t\t\"\\r\" => '',\n\t\t\"\\n\" => '',\n\t);\n\treturn strtr(fgets($f), $r);\n}\n\nfunction readNumString($f) {\n\treturn trim(fgets($f));\n}\n\nfunction stringToArray($str) {\n\treturn str_split($str);\n}\n\nfunction readNum($f, $is_int = false) {\n\t$v = readNumString($f);\n\treturn $is_int ? intval($v) : floatval($v);\n}\n\nfunction readStringExplode($f, $delimiter = ' ') {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = 'trim';\n\treturn array_map($callf, $return);\n}\n\nfunction readStringExplodeNum($f, $delimiter = ' ', $is_int = false) {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = $is_int ? 'intval' : 'floatval';\n\treturn array_map($callf, $return);\n}\n\n###### /IO ######\n\nfunction getAnswer($is_test = false, $f = false) {\n\tif ($is_test === false) {\n\t\t$f = STDIN;\n\t}\n\t/* begin body */\n\t$n = readNum($f);\n\t$times = readStringExplodeNum($f, ' ', true);\n\t$f = 0;\n\t$viewTime = 0;\n\tfor ($i = 1; $i <= 90; $i++) {\n\t\tif (in_array($i, $times)) {\n\t\t\t$f = 0;\n\t\t} else {\n\t\t\t$f ++;\n\t\t}\n\n\t\t$viewTime++;\n\t\tif ($f >= 15) {\n\t\t\tbreak;\n\t\t}\n\t}\n\techo $viewTime;\n\t/* / end body */\n}\n\nif (empty($is_test))\n\tgetAnswer();"}, {"source_code": "<?php\n$in = 'php://stdin';\n$input = fopen($in, \"r\");\n$n = fgets($input);\n$t = [0];\n$t = array_merge($t, explode(\" \", trim(fgets($input))));\n$tt = [];\n/*\nforeach ($t as $i) {\n    array_push($tt, intval($i));\n}\narray_push($tt, 90);\n*/\narray_push($t, 90);\n$isTVOff = false;\nfor ($i = 0; $i < count($t) - 1; $i++) {\n    if (intval($t[$i + 1]) - intval($t[$i]) > 15) {\n        echo($t[$i] + 15);\n        $isTVOff = true;\n        break;\n    }\n}\nif (!$isTVOff) {\n    echo(90);\n}"}, {"source_code": "<?php\n$in = 'php://stdin';\n$input = fopen($in, \"r\");\n$n = fgets($input);\n$t = [0];\n$t = array_merge($t, explode(\" \", trim(fgets($input))));\n$tt = [];\nforeach ($t as $i) {\n    array_push($tt, intval($i));\n}\narray_push($tt, 90);\n$isTVOff = false;\nfor ($i = 0; $i < count($tt) - 1; $i++) {\n    if ($tt[$i + 1] - $tt[$i] > 15) {\n        echo($tt[$i] + 15);\n        $isTVOff = true;\n        break;\n    }\n}\nif (!$isTVOff) {\n    echo(90);\n}"}, {"source_code": "<?php\n\n$in = 'php://stdin';\n$input = fopen($in, \"r\");\n$n = fgets($input);\n$t = [];\n$t = array_merge($t, explode(\" \", trim(fgets($input))));\n\nfunction watchTime($n, $t) {\n    $watchTime = 0;\n    for($i = 0; $i < $n; $i++){\n        if($t[$i]-$watchTime > 15) break;\n\n        $watchTime = $t[$i];\n    }\n    echo $watchTime+15 > 90 ? 90 : $watchTime+15;\n}\n\nwatchTime($n,$t);"}, {"source_code": "<?php\n\n$in = 'php://stdin';\n$input = fopen($in, \"r\");\n$n = fgets($input);\n$t = [];\n$t = array_merge($t, explode(\" \", trim(fgets($input))));\n\nfunction watchTime($n, $t) {\n    $watchTime = 0;\n    $funLimit = 15;\n    for($i = 0; $i < $n; $i++){\n        $inTime = ceil(($t[$i]-$watchTime)/$funLimit);\n        if($inTime > 1){\n            break;\n        } else {\n            $watchTime = $t[$i];\n        }\n    }\n    echo $watchTime+15 > 90 ? 90 : $watchTime+15 ;\n}\n\nwatchTime($n,$t);"}], "negative_code": [{"source_code": "<?php\n\n\t$totalInterestingMinutes = readline(\"\");\n\t$minutes = readline(\"\");\n\n\t$minutes = explode(\" \", $minutes);\n\n\t$prevMin = 0;\n\tforeach($minutes as $min) {\n\t\t$min = (int)$min;\n\t\tif($min == 90) {\n\t\t\techo 90;\n\t\t\tbreak;\n\t\t}\n\t\tif($min - $prevMin > 15) {\n\t\t\techo $prevMin + 15;\n\t\t\tbreak;\n\t\t}\n\t\t$prevMin = $min;\n\t}\n\t\n?>"}, {"source_code": "<?php\n\n\t$totalInterestingMinutes = readline(\"\");\n\t$minutes = readline(\"\");\n\n\t$minutes = explode(\" \", $minutes);\n\n\t$prevMin = 0;\n\tforeach($minutes as $min) {\n\t\t$min = (int)$min;\n\t\tif($min == 90) {\n\t\t\techo 90;\n\t\t\tbreak;\n\t\t}\n\t\tif($min - $prevMin > 15) {\n\t\t\techo $prevMin + 15;\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n?>"}, {"source_code": "<?php\n\n\t$totalInterestingMinutes = readline(\"\");\n\t$minutes = readline(\"\");\n\n\t$minutes = explode(\" \", $minutes);\n\n\t$prevMin = 0;\n\t$result = 90;\n\tforeach($minutes as $min) {\n\t\t$min = (int)$min;\n\t\tif($min == 90) {\n\t\t\t$result = 90;\n\t\t\tbreak;\n\t\t}\n\t\tif($min - $prevMin > 15) {\n\t\t\t$result = $prevMin + 15;\n\t\t\tbreak;\n\t\t}\n\t\t$prevMin = $min;\n\t}\n\techo $result;\n?>"}, {"source_code": "<?php\n\n\t$totalInterestingMinutes = readline(\"\");\n\t$minutes = readline(\"\");\n\n\t$minutes = explode(\" \", $minutes);\n\n\t$prevMin = 0;\n\tforeach($minutes as $min) {\n\t\t$min = (int)$min;\n\t\tif($min == 90) {\n\t\t\techo 90;\n\t\t\tbreak;\n\t\t}\n\t\tif($min - $prevMin > 15) {\n\t\t\techo $min + 15;\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n?>"}, {"source_code": "<?php\n\n\t$totalInterestingMinutes = readline(\"\");\n\t$minutes = readline(\"\");\n\n\t$minutes = explode(\" \", $minutes);\n\n\t$prevMin = 0;\n\t$result = 90;\n\t$count = count($minutes);\n\tforeach($minutes as $key => $min) {\n\t\t$min = (int)$min;\n\t\tif($min == 90) {\n\t\t\t$result = 90;\n\t\t\tbreak;\n\t\t}\n\t\tif($min - $prevMin > 15) {\n\t\t\t$result = $prevMin + 15;\n\t\t\tbreak;\n\t\t}\n\t\tif($key == $count - 1 && $min + 15 < 90) {\n\t\t\t$result = $min + 15;\n\t\t\tbreak;\n\t\t}\n\t\t$prevMin = $min;\n\t}\n\techo $result;\n?>"}, {"source_code": "<?php\nfunction test($n,$arr){\n    $start = 0;\n    for($i = 0;$i< $n ;$i++){\n        if(($arr[$i] - $start) > 15) return $start+15;\n        $start = $arr[$i];\n    }\n    return $arr[$n-1] + 15;\n}\n    // \u00a0Bear and Game\n    $in = 'php://stdin';\n    $input = fopen($in, \"r\");\n    $n = fgets($input);\n    $t = [];\n    $t = array_merge($t, explode(\" \", trim(fgets($input))));\n    echo (test($n,$t));\n\n?>"}, {"source_code": "<?php\n// http://codeforces.com/problemset/problem/691/A\n$handle = fopen (\"php://stdin\", \"r\");\nfscanf($handle, \"%i\",$n);\n$arr_temp = fgets($handle);\n$arrInput = explode(\" \",$arr_temp);\n$arr = array_map('intval', $arrInput);\nif(empty($arr)){\n\techo 15;\n\tdie;\n}\n$maxWait = 15;\nforeach ($arr as $interestMin) {\n\tif($interestMin > $maxWait){\n\t\techo $maxWait;die;\n\t}else{\n\t\t$maxWait = $interestMin + 15;\n\t}\n}\necho 90;\n\n?>"}, {"source_code": "<?php\n\n$in = 'php://stdin';\n$input = fopen($in, \"r\");\n$n = fgets($input);\n$t = [];\n$t = array_merge($t, explode(\" \", trim(fgets($input))));\n\nfunction watchTime($n, $t) {\n    $watchTime = 0;\n    $funLimit = 15;\n    for($i = 0; $i < $n; $i++){\n        $inTime = ceil(($t[$i]-$watchTime)/$funLimit);\n        if($inTime > 1){\n            break;\n        } else {\n            $watchTime = $t[$i];\n        }\n    }\n    echo $watchTime+15 > 90 ? $watchTime : $watchTime+15 ;\n}\n\nwatchTime($n,$t);"}, {"source_code": "<?php\n\n$in = 'php://stdin';\n$input = fopen($in, \"r\");\n$n = fgets($input);\n$t = [];\n$t = array_merge($t, explode(\" \", trim(fgets($input))));\nfunction watchTime($n, $t) {\n    $watchTime = 0;\n    $funLimit = 15;\n    for($i = 0; $i < $n; $i++){\n        $inTime = ceil(($t[$i]-$watchTime)/$funLimit);\n        if($inTime > 1){\n            $watchTime+=15;\n            break;\n        } else {\n            $watchTime = $t[$i];\n        }\n    }\n    echo $watchTime;\n}\n\necho watchTime($n,$t);"}, {"source_code": "<?php\n\n$in = 'php://stdin';\n$input = fopen($in, \"r\");\n$n = fgets($input);\n$t = [];\n$t = array_merge($t, explode(\" \", trim(fgets($input))));\n\nfunction watchTime($n, $t) {\n    $watchTime = 0;\n    $funLimit = 15;\n    for($i = 0; $i < $n; $i++){\n        $inTime = ceil(($t[$i]-$watchTime)/$funLimit);\n        if($inTime > 1){\n            $watchTime+=15;\n            break;\n        } else {\n            $watchTime = $t[$i];\n        }\n    }\n    echo $watchTime > 90 ? 90 : $watchTime;\n}\n\necho watchTime($n,$t);"}, {"source_code": "<?php\n\n$in = 'php://stdin';\n\n$input = fopen($in, \"r\");\n\n$n = fgets($input);\n\n$t = [];\n\n$t = array_merge($t, explode(\" \", trim(fgets($input))));\n\nfunction kq($t, $n) {\n\n    $temp=1;\n\n\n    for($i=0;$i<$n;$i++)\n    {\n        $delta = $t[$i] - $temp;\n\n        if ($delta >= 15) {\n            return $temp + 15;\n        }\n\n        $temp = $t[$i];\n    }\n\n    $temp += 15;\n\n    return $temp >= 90 ? 90 : $temp;\n}\n\necho kq($t,$n);"}, {"source_code": "<?php\n\n$in = 'php://stdin';\n$input = fopen($in, \"r\");\n$n = fgets($input);\n$t = [];\n$t = array_merge($t, explode(\" \", trim(fgets($input))));\n\nfunction watchTime($n, $t) {\n    $watchTime = 0;\n    $funLimit = 15;\n    for($i = 0; $i < $n; $i++){\n        $inTime = ceil(($t[$i]-$watchTime)/$funLimit);\n        if($inTime > 1){\n            $watchTime+=15;\n            break;\n        } else {\n            $watchTime = $t[$i];\n        }\n    }\n    echo $watchTime > 90 ? 90 : $watchTime;\n}\n\nwatchTime($n,$t);"}, {"source_code": "<?php\n\n$in = 'php://stdin';\n$input = fopen($in, \"r\");\n$n = fgets($input);\n$t = [];\n$t = array_merge($t, explode(\" \", trim(fgets($input))));\nfunction watchTime($n, $t) {\n    $watchTime = 0;\n    $funLimit = 15;\n    for($i = 0; $i < $n; $i++){\n        echo \"[$i] watchTime=$watchTime atTime=$t[$i] \";\n        $inTime = ceil(($t[$i]-$watchTime)/$funLimit);\n\n        if($inTime > 1){\n            $watchTime+=15;\n            echo \"inTime=$inTime\".PHP_EOL;\n            break;\n        } else {\n            $watchTime = $t[$i];\n        }\n\n        echo \"inTime=$inTime\".PHP_EOL;\n    }\n\n    echo $watchTime;\n}\n\necho watchTime($n,$t);"}], "src_uid": "5031b15e220f0ff6cc1dd3731ecdbf27"}
{"nl": {"description": "A big company decided to launch a new series of rectangular displays, and decided that the display must have exactly n pixels. Your task is to determine the size of the rectangular display \u2014 the number of lines (rows) of pixels a and the number of columns of pixels b, so that:  there are exactly n pixels on the display;  the number of rows does not exceed the number of columns, it means a\u2009\u2264\u2009b;  the difference b\u2009-\u2009a is as small as possible. ", "input_spec": "The first line contains the positive integer n (1\u2009\u2264\u2009n\u2009\u2264\u2009106)\u00a0\u2014 the number of pixels display should have.", "output_spec": "Print two integers\u00a0\u2014 the number of rows and columns on the display. ", "sample_inputs": ["8", "64", "5", "999999"], "sample_outputs": ["2 4", "8 8", "1 5", "999 1001"], "notes": "NoteIn the first example the minimum possible difference equals 2, so on the display should be 2 rows of 4 pixels.In the second example the minimum possible difference equals 0, so on the display should be 8 rows of 8 pixels.In the third example the minimum possible difference equals 4, so on the display should be 1 row of 5 pixels."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = floor(sqrt($a));\nwhile(TRUE)\n{\n     $c = $a % $b;\n     if($c == 0)\n     {\n          break;\n     }\n     else\n     {\n          $b--;\n     }\n}\nprint $b . \" \" . ($a / $b);\n?>"}, {"source_code": "<?php\nclass stdIn{var $ntxt = 0;var $nline = 0;var $arr_txt;var $arr_line;var $linex;var $liney;\nfunction stdIn($local = false){if($local){$dir = fopen(\"input.txt\", 'r');}else{$dir = fopen(\"php://stdin\", 'r');}\n$datatxt = stream_get_contents($dir);$del = Array(\"\\n\",\"\\r\",\"\\n\\r\");$data = explode(\"\\n\",$datatxt);\t$il = 0;$id = 0;\nforeach($data as $line){if(strlen($line) > 0){$line = str_replace($del,'',$line);$dataex[] = $line;$text = explode(\" \",$line);\nforeach($text as $txt){$arr_txt[] = $txt;$this->linex[$id] = $il;$this->liney[$il] = $id;$id++;}}$il++;}$this->arr_line = $dataex;$this->arr_txt  = $arr_txt;}\nfunction G(){$ret = $this->arr_txt[$this->ntxt++];$this->nline = $this->linex[$this->ntxt];return $ret;}\nfunction GL(){$this->ntxt = $this->liney[$this->nline]+1;return $this->arr_line[$this->nline++];}} /*init*/ $dxs = new stdIn(false);\n\n$n = $dxs->GL();\n$a = (int) sqrt($n);\n\nfor( ; $a ; $a--) {\n\tif($n % $a == 0) {\n\t\t$t = $n / $a;\n\t\techo min($t, $a) . ' ' . max($t, $b);\n\t\tbreak;\n\t}\n}\n"}, {"source_code": "<?php\nfscanf(STDIN,\"%d\",$n);\n$root=sqrt($n);\nif($root==floor($root))\n\techo \"$root $root\";\nelse\n{\n\t\t$j=0;\n\t\t$quotient=array();\n\t\tfor ($i=1; $i <=ceil($n/2); $i++)\n\t\t { \n\t\t\t$factor=$n/$i;\n\t\t\tif($factor==floor($factor))\n\t\t\t{\n\t\t\t\t$quotient[$j++]=$factor;\n\t\t\t}\n\t\t }\n\n\t\t $quotient[count($quotient)]=1;\n\t\t //print_r($quotient);\n\t\t if(count($quotient)==2)\n\t\t \techo \"$quotient[1] $quotient[0]\\n\";\n\t\t else\n\t\t {\n\t\t   $maxDif=10000000;\n\n\t\t \tfor ($i=0; $i <count($quotient) ; $i++) \n\t\t \t{ \n\t\t \t\t for ($j=0; $j <count($quotient) ; $j++)\n\t\t \t\t  { \n\t\t \t\t \t  if($quotient[$i]*$quotient[$j]==$n)\n\t\t \t\t \t  {\n\t\t \t\t \t  \t$dif=abs($quotient[$i]-$quotient[$j]);\n\t\t \t\t \t  \t  if($dif<$maxDif)\n\t\t \t\t \t  \t  {\n\t\t \t\t \t  \t  \t$maxDif=$dif;\n\t\t \t\t \t  \t  \t $targetValue=\"$quotient[$j] $quotient[$i]\";\n\t\t \t\t \t  \t  }\n\t\t \t\t \t  }\n\t\t \t\t }\n\t\t \t}\n\t\t \techo \"$targetValue\\n\";\n\t\t }\n}\n"}], "negative_code": [{"source_code": "<?php\nfscanf(STDIN,\"%d\",$lenOfStr);\nfscanf(STDIN,\"%s\",$str);\n$decision=false;\n\nif($lenOfStr%4==0)\n {\n \t $a=0;\n \t $g=0;\n \t $c=0;\n \t $t=0;\n     $split=str_split($str);\n     for ($i=0; $i <count($split) ; $i++)\n      { \n     \t   if($split[$i]=='A')\n     \t   \t   $a++;\n     \t   \telseif ($split[$i]=='G')\n     \t   \t {\n     \t   \t\t$g++;\n     \t   \t }\n     \t   \telseif ($split[$i]=='C')\n     \t   \t {\n     \t   \t\t$c++;\n     \t   \t }\n     \t   \t else\n     \t   \t {\n     \t   \t \tif($split[$i]=='T')\n     \t   \t \t\t$t++;\n     \t   \t }\n\n      }\n      $div=$lenOfStr/4;\n      if($div<$a||$div<$g||$div<$c||$div<$t)\n      \t  $decision=false;\n       //$loop=$div;\n       else\n       {    \n       \t    \n       \t    while($a<$div)\n       \t    {\n       \t    \tfor ($i=0; $i <strlen($str) ; $i++)\n       \t    \t { \n       \t    \t\tif($str[$i]=='?')\n       \t    \t\t{\n       \t    \t\t\t$str[$i]='A';\n       \t    \t\t\tbreak;\n       \t    \t\t}\n       \t    \t }\n       \t    \t$a++;\n       \t    }\n       \t    while($c<$div)\n       \t    {\n       \t    \tfor ($i=0; $i <strlen($str) ; $i++)\n       \t    \t { \n       \t    \t\tif($str[$i]=='?')\n       \t    \t\t{\n       \t    \t\t\t$str[$i]='C';\n       \t    \t\t\tbreak;\n       \t    \t\t}\n       \t    \t }\n       \t    \t$c++;\n       \t    }\n       \t    while($g<$div)\n       \t    {\n       \t    \tfor ($i=0; $i <strlen($str) ; $i++)\n       \t    \t { \n       \t    \t\tif($str[$i]=='?')\n       \t    \t\t{\n       \t    \t\t\t$str[$i]='G';\n       \t    \t\t\tbreak;\n       \t    \t\t}\n       \t    \t }\n       \t    \t$g++;\n       \t    }\n       \t    while($t<$div)\n       \t    {\n       \t    \tfor ($i=0; $i <strlen($str) ; $i++)\n       \t    \t { \n       \t    \t\tif($str[$i]=='?')\n       \t    \t\t{\n       \t    \t\t\t$str[$i]='T';\n       \t    \t\t\tbreak;\n       \t    \t\t}\n       \t    \t }\n       \t    \t$t++;\n       \t    }\n       \t    \n       \t    //echo \"$str\";\n        \t$decision=true;\n       }\n }\n echo $decision?\"$str\":\"===\";\n"}], "src_uid": "f52af273954798a4ae38a1378bfbf77a"}
{"nl": {"description": "Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.There are n columns of toy cubes in the box arranged in a line. The i-th column contains ai cubes. At first, the gravity in the box is pulling the cubes downwards. When Chris switches the gravity, it begins to pull all the cubes to the right side of the box. The figure shows the initial and final configurations of the cubes in the box: the cubes that have changed their position are highlighted with orange.  Given the initial configuration of the toy cubes in the box, find the amounts of cubes in each of the n columns after the gravity switch!", "input_spec": "The first line of input contains an integer n (1\u2009\u2264\u2009n\u2009\u2264\u2009100), the number of the columns in the box. The next line contains n space-separated integer numbers. The i-th number ai (1\u2009\u2264\u2009ai\u2009\u2264\u2009100) denotes the number of cubes in the i-th column.", "output_spec": "Output n integer numbers separated by spaces, where the i-th number is the amount of cubes in the i-th column after the gravity switch.", "sample_inputs": ["4\n3 2 1 2", "3\n2 3 8"], "sample_outputs": ["1 2 2 3", "2 3 8"], "notes": "NoteThe first example case is shown on the figure. The top cube of the first column falls to the top of the last column; the top cube of the second column falls to the top of the third column; the middle cube of the first column falls to the top of the second column.In the second example case the gravity switch does not change the heights of the columns."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = $b;\nrsort($c);\n$d = $c[0];\n$e = array_fill(0, $d, 0);\nfor($x = 0; $x < $a; $x++)\n{\n    for($y = 0; $y < $b[$x]; $y++)\n    {\n        $e[$y]++;\n    }\n}\n$f = array_fill(0, $a, 0);\n$g = $a;\nfor($x = 0; $x < $a; $x++)\n{\n    for($y = 0; $y < $d; $y++)\n    {\n        if($e[$y] >= $g)\n        {\n            $f[$x]++;\n        }\n    }\n    $g--;\n}\nprint implode(\" \", $f);\n?>"}, {"source_code": "<?php fgets(STDIN); $a = explode(' ', trim(fgets(STDIN))); sort($a); echo join( ' ',  $a);"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$a = trim(fgets(STDIN));\n$a = explode( ' ' , $a);\nsort($a);\necho join(' ', $a);"}, {"source_code": "<?php\n\n$n = (readline() - 1);\n$input = (explode(\" \",readline()));\n\nfor($i = 0; $i < $n; $i++){\n    for($x = 0; $x < $n; $x++) {\n        if($input[$x] > $input[$x+1]){\n            $z = $input[$x];\n            $input[$x] = $input[$x+1];\n            $input[$x+1] = $z;\n        }\n    }\n}\n\n$output = implode(\" \", $input);\n\nprint $output;\n\n?>"}, {"source_code": "<?php\n\n$n = readline();\n$input = explode(\" \",readline());\nsort($input);\n\nprint implode(\" \", $input);\n\n?>"}, {"source_code": "<?php\n$n=trim(fgets(STDIN));\n$a = explode(\" \",trim(fgets(STDIN)));\n \nsort($a);\nfor($i=0;$i<$n;$i++)\n{\necho $a[$i].\" \";\n}\n?>\n "}, {"source_code": "<?php\n$dir = fopen(\"php://stdin\", 'r');;\n$input= file('php://stdin');\n$arr= explode(' ',trim($input[1]));\nsort($arr);\necho  implode(' ',$arr);"}, {"source_code": "<?php\n$dir = fopen(\"php://stdin\", 'r');;\n$input= file('php://stdin');\n$arr= explode(' ',trim($input[1]));\nsort($arr);\nforeach ($arr as $item){\n    echo  $item . \" \";\n}"}, {"source_code": "<?php\n\n//=====================================\n// link: https://codeforces.com/contest/405/problem/A\n//=====================================\n\n// get inputs\n$number_of_columns = trim(fgets(STDIN));\n$columns_cubes = explode(' ', trim(fgets(STDIN)));\n\n// solution\nsort($columns_cubes);\necho implode(' ', $columns_cubes) . \"\\n\";\n"}, {"source_code": "<?php\n\t$n = trim(fgets(STDIN));\n\t$str = trim(fgets(STDIN));\n\t$strx = explode(\" \",$str);\n\tsort($strx);\n\techo implode(\" \", $strx);\n?>"}, {"source_code": "<?php\n    fscanf (STDIN, \"%d\", $n);\n    $arr = explode(\" \", trim(fgets(STDIN)));\n    sort($arr);\n        for ($i = 0; $i < $n; $i++){\n            echo ($arr[$i] . \" \");\n        }"}, {"source_code": "<?php\n\nfunction r(){\n    return trim(fgets(STDIN));\n}\nfunction w($str = ''){\n    echo $str . \"\\r\\n\";\n}\n\n$count = r();\n$col = explode(' ', r());\n\n\ndo{\n    $end = true;\n    for($i = 0; $i < $count-1; $i++){\n        if($col[$i + 1] > $col[$i]){\n            $t = $col[$i + 1];\n            $col[$i + 1] = $col[$i];\n            $col[$i] = $t;\n\n            $end = false;\n        }\n    }\n}while(!$end);\n\n$col = array_reverse($col);\nw(implode(' ', $col));"}, {"source_code": "<?php\n\n$nr = trim(fgets(STDIN));\n$arr = explode(' ', trim(fgets(STDIN)));\n\nsort($arr);\n$str = implode(' ', $arr);\necho $str;"}, {"source_code": "<?php\n$n= trim(fgets(STDIN));\n$stolb = explode(\" \",trim(fgets(STDIN)));\nasort($stolb);\nforeach ($stolb as $key)echo $key.\" \";\n"}, {"source_code": "<?php\nfscanf(STDIN,\"%d\",$n);\n$line=trim(fgets(STDIN));\n$singleValue=explode(' ', $line);\nfor($i=0;$i<$n;$i++){\n\tfor($j=0;$j<$n-1;$j++){\n\t\tif($singleValue[$i]<$singleValue[$j])\n\t\t{\n\t\t\t$singleValue[$i]=$singleValue[$i]+$singleValue[$j];\n\t\t\t$singleValue[$j]=$singleValue[$i]-$singleValue[$j];\n\t\t\t$singleValue[$i]=$singleValue[$i]-$singleValue[$j];\n\n\t\t}\n\n\t}\n}\nfor($i=0;$i<$n;$i++)\n\techo \"$singleValue[$i] \";\n"}, {"source_code": "<?php\n\t$stream = fopen(\"php://stdin\", \"r\");\n\t$input = stream_get_contents($stream);\n    $ins = preg_split(\"/[\\s]+/\", $input);\n    $cnt = 0;\n    $N = $ins[$cnt++];\n    for($i = 0; $i < $N; $i++) $arr[$i] = $ins[$cnt++];\n    sort($arr);\n\tfor($i = 0; $i < $N; $i++)\n\t\techo \"{$arr[$i]} \";\n\techo \"\\n\";\n?>"}, {"source_code": "<?php\n\n$f = fopen('php://stdin', 'r');\n//$f = fopen('test.txt', 'r');\n$n = trim(fgets($f));\n\n$a = explode(\" \",trim(fgets($f)));\n\nsort($a);\n$s = implode(\" \",$a);\n\nprint_r($s);"}, {"source_code": "<?php\n\n$stdout = fopen(getenv(\"OUTPUT_PATH\"), \"w\");\n$stdin = fopen(\"php://stdin\", \"r\");\n\nfscanf( $stdin , \"%d\" , $n ) ;\nfscanf( $stdin , \"%[^\\n]\" , $arr ) ;\n\n$array = array_map( 'intval' , preg_split('/ /' , $arr, -1 , PREG_SPLIT_NO_EMPTY ) );\nsort( $array ) ;\nfor( $i=0 ; $i<$n ; $i++ )\n{\n     echo $array[$i] . \" \" ;\n}\n\nfwrite($stdout);\n\nfclose($stdin);\nfclose($stdout);\n\n?> "}, {"source_code": "<?php\n$n = fgets(STDIN);\n$array = explode(\" \", fgets(STDIN));\n$output = [];\nfor($i=0;$i<$n;$i++){\n    $output[] =(int)$array[$i];\n}\nsort($output);\nfor($i=0;$i<$n;$i++){\n    echo $output[$i].' ';\n}"}, {"source_code": "<?php\n$fi=@fopen('test.inp',\"r\");\n$n=trim(fgets(STDIN));\n$a=explode(\" \",trim(fgets(STDIN)));\nsort($a);\nfor ($i=0;$i<$n;$i++)\n\techo $a[$i].\" \";\n?>"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$cube = explode(\" \", trim(fgets(STDIN)));\nfor($i=$n-1;$i>=0;$i--){\n    for($j=$n-1;$j>=0;$j--){\n\t\tif ($cube[$i] > $cube[$j]){\n\t\t\t$sisa = $cube[$i] - $cube[$j];\n\t\t\t$cube[$j] += $sisa;\n\t\t\t$cube[$i] -= $sisa;\n\t\t}\n\t}\n}\nforeach($cube as $value){\n\techo $value . \" \";\n}\n?>"}, {"source_code": "<?php\n\t$cin = fopen(\"php://stdin\", \"r\");\n\t$n = intval(fgets($cin));\n\t$s = fgets($cin);\n\t$a = explode(\" \", $s);\n\tsort($a, SORT_NUMERIC);\n\tfor($i = 0; $i < $n; $i++){\n\t\techo $a[$i].\" \";\n\t}\n\tfclose($cin);\n?>"}, {"source_code": "<?php\n// 405A     \u041f\u0435\u0440\u0435\u043a\u043b\u044e\u0447\u0435\u043d\u0438\u0435 \u0433\u0440\u0430\u0432\u0438\u0442\u0430\u0446\u0438\u0438  \n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\n\n$input_line = fgets($in);\n$arr = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\nforeach ($arr as $key => &$value) {\n    $value = (int) $value;\n}\nunset($value);\n\nsort($arr);\n\n$out = implode(\" \", $arr);\n\necho $out;\n\n?>"}, {"source_code": "<?php\n\t$temp = fopen(\"php://stdin\",\"r\");\n\t\n\t$n = fgets($temp);\t\n\t$arr = explode(\" \", fgets($temp));\n\n\t$int_arr =array();\n\n\tforeach($arr as $a )\n\t{\n\t\t$int_arr[] = intval($a);\n\t}\n\n\tsort($int_arr);\n\n\tforeach($int_arr as $a)\n\t{\n\t\techo $a . \" \";\n\t}\n?>"}, {"source_code": "<?php\n\n$n = line();\n$a = explode(' ', line());\n\n$n = intval($n);\n$m = 0;\n\nfor ($i = 0; $i < $n; $i ++) {\n  $a[$i] = intval($a[$i]);\n  $m = max($m, $a[$i]);\n}\n\nfor ($j = 0; $j < $m; $j ++) {\n  $b[$j] = 0;\n  for ($i = 0; $i < $n; $i ++) {\n    $b[$j] += ($a[$i] >= $m - $j);\n  }\n}\n\n$output = '';\n\nfor ($i = 0; $i < $n; $i ++) {\n  $answer = 0;\n  for ($j = 0; $j < $m; $j ++) {\n    $answer += ($b[$j] >= $n - $i);\n  }\n  $output .= ($i > 0 ? ' ' : '') . $answer;\n}\n\nprint $output;\n\nfunction line() {\n  return trim(fgets(STDIN));\n}\n"}, {"source_code": "<?\n$a=fgets(STDIN);\n$m=explode(\" \",trim(fgets(STDIN)));\nsort($m);\necho join(\" \",$m);\n?>"}], "negative_code": [{"source_code": "<?php\n\n$n = readline();\n$input = (explode(\" \",readline()));\n\nfor($i = 0; $i < ($n-1); $i++){\n    for($x = 0; $x < ($n-1); $x++) {\n        if($input[$x] > $input[$x+1]){\n            $z = $input[$x];\n            $input[$x] = $input[$x+1];\n            $input[$x+1] = $z;\n        } else {\n            break;\n        }\n    }\n}\n\n$output = implode(\" \", $input);\n\nprint $output;\n\n?>"}, {"source_code": "<?php\n\n$n = (readline() - 1);\n$input = (explode(\" \",readline()));\n\nfor($i = 0; $i < $n; $i++){\n    for($x = 0; $x < $n-1; $x++) {\n        if($input[$x] > $input[$x+1]){\n            $z = $input[$x];\n            $input[$x] = $input[$x+1];\n            $input[$x+1] = $z;\n        }\n    }\n}\n\n$output = implode(\" \", $input);\n\nprint $output;\n\n?>"}, {"source_code": "<?php\n$n=trim(fgets(STDIN));\n$a = explode(\" \",trim(fgets(STDIN)));\n \nsort($a);\nfor($i=0;$i<$n;$i++)\n{\necho $a[$i];\n}\n?>\n "}, {"source_code": "<?php\n    $arr = explode(\" \", trim(fgets(STDIN)));\n    sort($arr);\n        for ($i = 0; $i < count($arr); $i++){\n            echo ($arr[$i] . \" \");\n        }"}, {"source_code": "<?php\n$n= trim(fgets(STDIN));\n$stolb = explode(\" \",trim(fgets(STDIN)));\nasort($stolb);\nforeach ($stolb as $key)echo $key;\n"}, {"source_code": "<?php\n$n = fgets(STDIN);\n$array = explode(\" \", fgets(STDIN));\nsort($array);\nfor($i=0;$i<$n;$i++){\n    echo $array[$i]. ' ';\n}"}, {"source_code": "<?php\n$n = fgets(STDIN);\n$array = explode(\" \", fgets(STDIN));\nsort($array);\necho implode(' ',$array);"}, {"source_code": "<?php\n$n = fgets(STDIN);\n$array = explode(\" \", fgets(STDIN));\nsort($array);\necho $output = implode(' ',$array);"}, {"source_code": "<?\n$a=fgets(STDIN);\n$m=explode(\" \",fgets(STDIN));\nsort($m);\nforeach($m as $v)\n    {\n        echo $v.\" \";\n    }\n?>"}, {"source_code": "<?\n$a=fgets(STDIN);\n$m=explode(\" \",trim(\" \",fgets(STDIN)));\nsort($m);\nforeach($m as $v)\n    {\n        echo $v.\" \";\n    }\n?>"}], "src_uid": "ae20712265d4adf293e75d016b4b82d8"}
{"nl": {"description": "There are n students who have taken part in an olympiad. Now it's time to award the students.Some of them will receive diplomas, some wiil get certificates, and others won't receive anything. Students with diplomas and certificates are called winners. But there are some rules of counting the number of diplomas and certificates. The number of certificates must be exactly k times greater than the number of diplomas. The number of winners must not be greater than half of the number of all students (i.e. not be greater than half of n). It's possible that there are no winners.You have to identify the maximum possible number of winners, according to these rules. Also for this case you have to calculate the number of students with diplomas, the number of students with certificates and the number of students who are not winners.", "input_spec": "The first (and the only) line of input contains two integers n and k (1\u2009\u2264\u2009n,\u2009k\u2009\u2264\u20091012), where n is the number of students and k is the ratio between the number of certificates and the number of diplomas.", "output_spec": "Output three numbers: the number of students with diplomas, the number of students with certificates and the number of students who are not winners in case when the number of winners is maximum possible. It's possible that there are no winners.", "sample_inputs": ["18 2", "9 10", "1000000000000 5", "1000000000000 499999999999"], "sample_outputs": ["3 6 9", "0 0 9", "83333333333 416666666665 500000000002", "1 499999999999 500000000000"], "notes": null}, "positive_code": [{"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = floor($a / 2);\n$d = $b + 1;\n$e = floor($c / $d);\nif($e == 0)\n{\n     print \"0 0 \" . $a;\n}\nelse\n{\n     $f = $e * $b;\n     $g = $a - ($e + $f);\n     print $e . \" \" . $f . \" \" . $g;\n}\n?>"}, {"source_code": "<?php\n\n$inputLine = fgets(STDIN);\n\n$input = explode(' ', $inputLine);\n\n$n = (float) $input[0];\n\n$k = (float) $input[1];\n\n$pr = $n / 2.0;\n\n$nParts = $k + 1;\n\n$partSize = $pr / $nParts;\n\n$dipF = $partSize;\n\n$dip1 = ceil($dipF);\n\n$gr1 = $dip1 * $k;\n\nif ($gr1 + $dip1 <= $pr) {\n    echo $dip1 . ' ' . $gr1 . ' ' . ($n - $dip1 - $gr1);\n    exit;\n}\n\n$dip2 = floor($dipF);\n\n$gr2 = $dip2 * $k;\n\necho $dip2 . ' ' . $gr2 . ' ' . ($n - $dip2 - $gr2);\n"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = floor($a / 2);\n$d = $b + 1;\n$e = floor($c / $d);\nif($e == 0)\n{\n     print \"0 0 \" . $a;\n}\nelse\n{\n     $f = $e * $b;\n     $g = $a - ($e + $f);\n     print $e . \" \" . $f . \" \" . $g;\n}\n?>"}], "negative_code": [{"source_code": "<?php\n\nvar_dump(1000000000000);\n"}, {"source_code": "<?php\n\n$inputLine = fgets(STDIN);\n\necho $inputLine;\n"}], "src_uid": "405a70c3b3f1561a9546910ab3fb5c80"}
{"nl": {"description": "Fox Ciel is playing a game with numbers now. Ciel has n positive integers: x1, x2, ..., xn. She can do the following operation as many times as needed: select two different indexes i and j such that xi &gt; xj hold, and then apply assignment xi = xi - xj. The goal is to make the sum of all numbers as small as possible.Please help Ciel to find this minimal sum.", "input_spec": "The first line contains an integer n (2\u2009\u2264\u2009n\u2009\u2264\u2009100). Then the second line contains n integers: x1, x2, ..., xn (1\u2009\u2264\u2009xi\u2009\u2264\u2009100).", "output_spec": "Output a single integer \u2014 the required minimal sum.", "sample_inputs": ["2\n1 2", "3\n2 4 6", "2\n12 18", "5\n45 12 27 30 18"], "sample_outputs": ["2", "6", "12", "15"], "notes": "NoteIn the first example the optimal way is to do the assignment: x2 = x2 - x1.In the second example the optimal sequence of operations is: x3 = x3 - x2, x2 = x2 - x1."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\nrsort($b);\nfor($x = 1; $x <= 10000; $x++)\n{\n    if($b[0] > $b[count($b) - 1])\n    {\n        $b[0] = $b[0] - $b[count($b) - 1];\n        rsort($b);\n    }\n    else\n    {\n        break;\n    }\n}\nprint array_sum($b);\n?>"}, {"source_code": "#!/usr/bin/env php\n<?php\n$count = trim(fgets(STDIN));\n\n$line = trim(fgets(STDIN));\n$array = array_map('intval', explode(' ', $line));\n\nfor(;;) {\n\trsort($array);\n\tif ($array[0] !== $array[$count - 1] && $array[1] !== 0) {\n\t\t$sub = $array[1];\n\t\tfor ($i = 1; $i < $count; $i++) {\n\t\t\tif ($array[$i] !== $array[0]) {\n\t\t\t\t$sub = $array[$i];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t$array[0] = $array[0] - $sub;\n\t} else {\n\t\techo array_sum($array);exit();\n\t}\n}\n"}, {"source_code": "<?php\nerror_reporting(\"off\");\n//389A: Fox and Number Game\n$n = trim(fgets(STDIN)); //$n = 2;\n$array = explode(\" \", trim(fgets(STDIN))); //$array = explode(\" \", \"45 12 27 30 18\");\nwhile (true) {\n\tarsort($array);\n\t$nums = array_unique($array);\n\trsort($nums);\n\tif (count($nums) == 1) {\n\t\tbreak;\n\t}\n\t$biggest = $nums[0];\n\t$second = $nums[1];\n\t$indexone = array_search($biggest, $array);\n\t$indextwo = array_search($second, $array);\n\t$array[$indexone] = $biggest - $second;\n}\n$sum = 0;\nforeach ($array as $value) {\n\t$sum += $value;\n}\necho $sum;\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\nrsort($b);\nfor($x = 1; $x <= 10000; $x++)\n{\n    if($b[0] > $b[1])\n    {\n        $b[0] = $b[0] - $b[1];\n        rsort($b);\n    }\n    else\n    {\n        break;\n    }\n}\nprint array_sum($b);\n?>"}, {"source_code": "#!/usr/bin/env php\n<?php\n$count = trim(fgets(STDIN));\n\n$line = trim(fgets(STDIN));\n$array = array_map('intval', explode(' ', $line));\n\nfor(;;) {\n\trsort($array);\n\tif ($array[0] !== $array[$count - 1] && $array[1] !== 0) {\n\t\t$array[0] = $array[0] - $array[1];\n\t} else {\n\t\techo array_sum($array);exit();\n\t}\n}\n"}, {"source_code": "#!/usr/bin/env php\n<?php\n$count = trim(fgets(STDIN));\n\n$line = trim(fgets(STDIN));\n$array = array_map('intval', explode(' ', $line));\n\nfor(;;) {\n\trsort($array);\n\tif ($array[0] !== $array[1]) {\n\t\t$array[0] = $array[0] - $array[1];\n\t} else {\n\t\techo array_sum($array);exit();\n\t}\n}\n"}, {"source_code": "#!/usr/bin/env php\n<?php\n$count = trim(fgets(STDIN));\n\n$line = trim(fgets(STDIN));\n$array = array_map('intval', explode(' ', $line));\necho 'working', PHP_EOL;\nfor(;;) {\n\trsort($array);\n\tif ($array[0] !== $array[$count - 1] && $array[1] !== 0) {\n\t\t$array[0] = $array[0] - $array[1];\n\t} else {\n\t\techo array_sum($array);exit();\n\t}\n}\n"}], "src_uid": "042cf938dc4a0f46ff33d47b97dc6ad4"}
{"nl": {"description": "Overlooking the captivating blend of myriads of vernal hues, Arkady the painter lays out a long, long canvas.Arkady has a sufficiently large amount of paint of three colours: cyan, magenta, and yellow. On the one-dimensional canvas split into n consecutive segments, each segment needs to be painted in one of the colours.Arkady has already painted some (possibly none or all) segments and passes the paintbrush to you. You are to determine whether there are at least two ways of colouring all the unpainted segments so that no two adjacent segments are of the same colour. Two ways are considered different if and only if a segment is painted in different colours in them.", "input_spec": "The first line contains a single positive integer n (1\u2009\u2264\u2009n\u2009\u2264\u2009100)\u00a0\u2014 the length of the canvas. The second line contains a string s of n characters, the i-th of which is either 'C' (denoting a segment painted in cyan), 'M' (denoting one painted in magenta), 'Y' (one painted in yellow), or '?' (an unpainted one).", "output_spec": "If there are at least two different ways of painting, output \"Yes\"; otherwise output \"No\" (both without quotes). You can print each character in any case (upper or lower).", "sample_inputs": ["5\nCY??Y", "5\nC?C?Y", "5\n?CYC?", "5\nC??MM", "3\nMMY"], "sample_outputs": ["Yes", "Yes", "Yes", "No", "No"], "notes": "NoteFor the first example, there are exactly two different ways of colouring: CYCMY and CYMCY.For the second example, there are also exactly two different ways of colouring: CMCMY and CYCMY.For the third example, there are four ways of colouring: MCYCM, MCYCY, YCYCM, and YCYCY.For the fourth example, no matter how the unpainted segments are coloured, the existing magenta segments will prevent the painting from satisfying the requirements. The similar is true for the fifth example."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = 0;\nfor($x = 0; $x < $a - 1; $x++)\n{\n     if(($b[$x] == $b[$x + 1]) && ($b[$x] != \"?\"))\n     {\n          $c = 1;\n          break;\n     }\n}\nif($c == 1)\n{\n     print \"No\";\n}\nelse\n{\n     $d = 0;\n     for($x = 0; $x < $a; $x++)\n     {\n          if($b[$x] == \"?\")\n          {\n               if(($b[$x - 1] == \"C\") && ($b[$x + 1] == \"M\"))\n               {\n                    $d = 0;\n               }\n               elseif(($b[$x - 1] == \"C\") && ($b[$x + 1] == \"Y\"))\n               {\n                    $d = 0;\n               }\n               elseif(($b[$x - 1] == \"M\") && ($b[$x + 1] == \"C\"))\n               {\n                    $d = 0;\n               }\n               elseif(($b[$x - 1] == \"M\") && ($b[$x + 1] == \"Y\"))\n               {\n                    $d = 0;\n               }\n               elseif(($b[$x - 1] == \"Y\") && ($b[$x + 1] == \"M\"))\n               {\n                    $d = 0;\n               }\n               elseif(($b[$x - 1] == \"Y\") && ($b[$x + 1] == \"C\"))\n               {\n                    $d = 0;\n               }\n               else\n               {\n                    $d = 1;\n               }\n          }\n          if($d == 1)\n          {\n               break;\n          }\n     }\n     if($d == 0)\n     {\n          print \"No\";\n     }\n     else\n     {\n          print \"Yes\";\n     }\n}\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = 0;\nfor($x = 0; $x < $a - 1; $x++)\n{\n     if(($b[$x] == $b[$x + 1]) && ($b[$x] != \"?\"))\n     {\n          $c = 1;\n          break;\n     }\n}\nif($c == 1)\n{\n     print \"No\";\n}\nelse\n{\n     $d = 0;\n     for($x = 0; $x < $a; $x++)\n     {\n          if($b[$x] == \"?\")\n          {\n               $d = 1;\n               break;\n          }\n     }\n     if($d == 0)\n     {\n          print \"No\";\n     }\n     else\n     {\n          print \"Yes\";\n     }\n}\n?>"}], "src_uid": "f8adfa0dde7ac1363f269dbdf00212c3"}
{"nl": {"description": "Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered from 1 to n, all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a \"war\"-like card game. The rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. You have to calculate how many fights will happen and who will win the game, or state that game won't end.", "input_spec": "First line contains a single integer n (2\u2009\u2264\u2009n\u2009\u2264\u200910), the number of cards. Second line contains integer k1 (1\u2009\u2264\u2009k1\u2009\u2264\u2009n\u2009-\u20091), the number of the first soldier's cards. Then follow k1 integers that are the values on the first soldier's cards, from top to bottom of his stack. Third line contains integer k2 (k1\u2009+\u2009k2\u2009=\u2009n), the number of the second soldier's cards. Then follow k2 integers that are the values on the second soldier's cards, from top to bottom of his stack. All card values are different.", "output_spec": "If somebody wins in this game, print 2 integers where the first one stands for the number of fights before end of game and the second one is 1 or 2 showing which player has won. If the game won't end and will continue forever output \u2009-\u20091.", "sample_inputs": ["4\n2 1 3\n2 4 2", "3\n1 2\n2 1 3"], "sample_outputs": ["6 2", "-1"], "notes": "NoteFirst sample:   Second sample:   "}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = explode(\" \", trim(fgets(STDIN)));\n$d = 1;\nunset($b[0]);\nunset($c[0]);\n$e = 0;\nfor($x = 1; $x <= 10000; $x++)\n{\n    if($b[$d] > $c[$d])\n    {\n        array_push($b, $c[$d]);\n        array_push($b, $b[$d]);\n        unset($c[$d]);\n        unset($b[$d]);\n        $d++;\n        if(count($c) == 0)\n        {\n            $e = 1;\n            break;\n        }\n    }\n    else\n    {\n        array_push($c, $b[$d]);\n        array_push($c, $c[$d]);\n        unset($b[$d]);\n        unset($c[$d]);\n        $d++;\n        if(count($b) == 0)\n        {\n            $e = 2;\n            break;\n        }\n    }\n}\nif($e == 0)\n{\n    print \"-1\";\n}\nelseif($e == 1)\n{\n    print $x . \" 1\";\n}\nelseif($e == 2)\n{\n    print $x . \" 2\";\n}\n?>"}], "negative_code": [], "src_uid": "f587b1867754e6958c3d7e0fe368ec6e"}
{"nl": {"description": "There is a card game called \"Durak\", which means \"Fool\" in Russian. The game is quite popular in the countries that used to form USSR. The problem does not state all the game's rules explicitly \u2014 you can find them later yourselves if you want.To play durak you need a pack of 36 cards. Each card has a suit (\"S\", \"H\", \"D\" and \"C\") and a rank (in the increasing order \"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\" and \"A\"). At the beginning of the game one suit is arbitrarily chosen as trump. The players move like that: one player puts one or several of his cards on the table and the other one should beat each of them with his cards.A card beats another one if both cards have similar suits and the first card has a higher rank then the second one. Besides, a trump card can beat any non-trump card whatever the cards\u2019 ranks are. In all other cases you can not beat the second card with the first one.You are given the trump suit and two different cards. Determine whether the first one beats the second one or not.", "input_spec": "The first line contains the tramp suit. It is \"S\", \"H\", \"D\" or \"C\". The second line contains the description of the two different cards. Each card is described by one word consisting of two symbols. The first symbol stands for the rank (\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\" and \"A\"), and the second one stands for the suit (\"S\", \"H\", \"D\" and \"C\").", "output_spec": "Print \"YES\" (without the quotes) if the first cards beats the second one. Otherwise, print \"NO\" (also without the quotes).", "sample_inputs": ["H\nQH 9S", "S\n8D 6D", "C\n7H AS"], "sample_outputs": ["YES", "YES", "NO"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = str_split(trim(fgets(STDIN)));\n$c = $b[0]; // \u0434\u043e\u0441\u0442\u043e\u0438\u043d\u0441\u0442\u0432\u043e\n$d = $b[1]; // \u043c\u0430\u0441\u0442\u044c\n$e = $b[3]; // \u0434\u043e\u0441\u0442\u043e\u0438\u043d\u0441\u0442\u0432\u043e\n$f = $b[4]; // \u043c\u0430\u0441\u0442\u044c\n$g = array(\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\");\n$h = 0;\n$i = 0;\nif(($d == $a) && ($f != $a))\n{\n    print \"YES\";\n}\nelseif(($d != $a) && ($f == $a))\n{\n    print \"NO\";\n}\nelseif((($d == $a) && ($f == $a)) || (($d == \"S\") && ($f == \"S\")) || (($d == \"H\") && ($f == \"H\")) || (($d == \"D\") && ($f == \"D\")) || (($d == \"C\") && ($f == \"C\")))\n{\n    for($x = 0; $x < count($g); $x++)\n    {\n        if($g[$x] == $c)\n        {\n            $h = $x;\n        }\n        if($g[$x] == $e)\n        {\n            $i = $x;\n        }\n    }\n    if($h > $i)\n    {\n        print \"YES\";\n    }\n    else\n    {\n        print \"NO\";\n    }\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$k=trim(fgets(STDIN));\n$c=explode(' ', trim(fgets(STDIN)));\nswitch($c[0][0]) {\ncase 'T': $d[0]=10; break;\ncase 'J': $d[0]=11; break;\ncase 'Q': $d[0]=12; break;\ncase 'K': $d[0]=13; break;\ncase 'A': $d[0]=14; break;\n}\nif(!isset($d[0])) $d[0]=$c[0][0];\nswitch($c[1][0]) {\ncase 'T': $d[1]=10; break;\ncase 'J': $d[1]=11; break;\ncase 'Q': $d[1]=12; break;\ncase 'K': $d[1]=13; break;\ncase 'A': $d[1]=14; break;\n}\nif(!isset($d[1])) $d[1]=$c[1][0];\nif(($c[0][1]==$c[1][1]) && ($d[0]>$d[1])) echo 'YES';\nelseif(($c[0][1]==$k) && ($c[1][1]!=$k)) echo 'YES';\nelse echo 'NO';\n?>"}, {"source_code": "<?php\n\t$k = trim(fgets(STDIN));\n\t$cards = explode(' ', trim(fgets(STDIN)));\n\t\n\t$c1 = str_split($cards[0]);\n\t$c2 = str_split($cards[1]);\n\t$m = [];\n\t$m['6'] = 1;\n\t$m['7'] = 2;\n\t$m['8'] = 3;\n\t$m['9'] = 4;\n\t$m['T'] = 5;\n\t$m['J'] = 6;\n\t$m['Q'] = 7;\n\t$m['K'] = 8;\n\t$m['A'] = 9;\n\tif(($c1[1] == $k && $c2[1] != $k) || ($m[$c1[0]] > $m[$c2[0]] && $c1[1] == $c2[1]) || ($c1[1] == $k && $c2[1] == $k && $m[$c1[0]] > $m[$c2[0]])){\n\t\techo 'YES';\n\t}else{\n\t\techo 'NO';\n\t}"}, {"source_code": "<?\n$root=trim(fgets(STDIN));\n$k=explode(' ',trim(fgets(STDIN)));\n$first=$k[0];\n$second=$k[1];\nfunction differ($a,$b){\n    switch($a){\n        case 'T': $a=10; break;\n        case 'J': $a=11; break;\n        case 'Q': $a=12; break;\n        case 'K': $a=13; break;\n        case 'A': $a=14; break;\n    }\n    switch($b){\n        case 'T': $b=10; break;\n        case 'J': $b=11; break;\n        case 'Q': $b=12; break;\n        case 'K': $b=13; break;\n        case 'A': $b=14; break;\n    }\n    if($a>$b) return 1;\n    else return 0; \n}\nif($first[1]==$root){\n    if($second[1]==$root){\n        if(differ($first[0],$second[0])) echo \"YES\";\n            else echo \"NO\";\n    }else{\n        echo \"YES\";\n    }\n}else{\n    if($second[1]==$root) echo \"NO\";\n    else{\n        if($first[1]==$second[1]){\n            if(differ($first[0],$second[0])) echo \"YES\";\n            else echo \"NO\";\n        }else{\n            echo \"NO\";\n        }\n    }\n}\n?>"}, {"source_code": "<?\n$fp=fopen('php://stdin', 'r');\n$lines=stream_get_contents($fp);\n$lines=trim($lines);\n$lines=explode(\"\\n\", $lines);\n\n\n$cards=array(\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\");\n$jok=trim($lines[0]);\nlist($first, $second)=explode(\" \", trim($lines[1]));\n$key_2=array_search($second{0}, $cards);    //10\n$key_1=array_search($first{0}, $cards); //1\nif($first{1}==$second{1})\n    echo ($key_1>$key_2)?'YES':'NO';\nelse\n    echo ($first{1}==$jok)?'YES':'NO';\n?>"}], "negative_code": [{"source_code": "<?\n$root=trim(fgets(STDIN));\n$k=explode(' ',trim(fgets(STDIN)));\n$first=$k[0];\n$second=$k[1];\nfunction differ($a,$b){\n    switch($a){\n        case 'T': $a=10; break;\n        case 'J': $a=11; break;\n        case 'Q': $a=12; break;\n        case 'K': $a=13; break;\n        case 'A': $a=14; break;\n    }\n    switch($b){\n        case 'T': $a=10; break;\n        case 'J': $a=11; break;\n        case 'Q': $a=12; break;\n        case 'K': $a=13; break;\n        case 'A': $a=14; break;\n    }\n    if($a>$b) return 1;\n}\nif($first[1]==$root){\n    if($second[1]==$root){\n        if(differ($first[0],$second[0])) echo \"YES\";\n            else echo \"NO\";\n    }else{\n        echo \"YES\";\n    }\n}else{\n    if($second[1]==$root) echo \"NO\";\n    else{\n        if($first[1]==$second[1]){\n            if(differ($first[0],$second[0])) echo \"YES\";\n            else echo \"NO\";\n        }else{\n            echo \"NO\";\n        }\n    }\n}\n?>"}, {"source_code": "<?\n$fp=fopen('php://stdin', 'r');\n$lines=stream_get_contents($fp);\n$lines=trim($lines);\n$lines=explode(\"\\n\", $lines);\n\n\n$cards=array(\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\");\n$jok=trim($lines[0]);\nlist($first, $second)=explode(\" \", trim($lines[1]));\n$key_2=array_search($second{0}, $cards);\n$key_1=array_search($first{0}, $cards);\necho (($first{1}==$second{1} and $key_1>$key_2) or $first{1}==$jok)?'YES':'NO';\n?>"}], "src_uid": "da13bd5a335c7f81c5a963b030655c26"}
{"nl": {"description": "Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' actions in the final battle. Figure out who became the champion.", "input_spec": "The input contains two strings of equal length (between 2 and 20 characters, inclusive). Each line describes the actions of one team.", "output_spec": "Output \"TEAM 1 WINS\" if the first team won, \"TEAM 2 WINS\" if the second team won, and \"TIE\" if there was a tie.", "sample_inputs": ["[]()[]8&lt;\n8&lt;[]()8&lt;", "8&lt;8&lt;()\n[]8&lt;[]"], "sample_outputs": ["TEAM 2 WINS", "TIE"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = 0;\n$d = 0;\nfor($x = 0; $x < strlen($a); $x += 2)\n{\n     if(($a[$x] == \"[\") && ($a[$x + 1] == \"]\"))\n     {\n          if(($b[$x] == \"(\") && ($b[$x + 1] == \")\"))\n          {\n               $c++;\n          }\n          elseif(($b[$x] == \"8\") && ($b[$x + 1] == \"<\"))\n          {\n               $d++;\n          }\n     }\n     elseif(($a[$x] == \"(\") && ($a[$x + 1] == \")\"))\n     {\n          if(($b[$x] == \"[\") && ($b[$x + 1] == \"]\"))\n          {\n               $d++;\n          }\n          elseif(($b[$x] == \"8\") && ($b[$x + 1] == \"<\"))\n          {\n               $c++;\n          }\n     }\n     elseif(($a[$x] == \"8\") && ($a[$x + 1] == \"<\"))\n     {\n          if(($b[$x] == \"(\") && ($b[$x + 1] == \")\"))\n          {\n               $d++;\n          }\n          elseif(($b[$x] == \"[\") && ($b[$x + 1] == \"]\"))\n          {\n               $c++;\n          }\n     }\n}\nif($c < $d)\n{\n     print \"TEAM 2 WINS\";\n}\nelseif($c == $d)\n{\n     print \"TIE\";\n}\nelseif($c > $d)\n{\n     print \"TEAM 1 WINS\";\n}\n?>"}, {"source_code": "<?php\n$s1 = fgets(STDIN);\n$s2 = fgets(STDIN);\n\n$a = 0;\n$b = array(\n'8['=>1,\n'[8'=>-1,\n'[('=>1,\n'(['=>-1,\n'(8'=>1,\n'8('=>-1,\n);\nfor($i = 0; $i < strlen($s1); $i+=2){\n    if($s1{$i} == $s2{$i}) continue;\n    $a += $b[$s1{$i} . $s2{$i}];\n    //echo $a.\"\\n\";\n}\nif($a > 0)\nfputs(STDOUT,'TEAM 1 WINS');\nelseif($a < 0)\nfputs(STDOUT,'TEAM 2 WINS');\nelse\nfputs(STDOUT,'TIE');\n"}], "negative_code": [], "src_uid": "bdf2e78c47d078b4ba61741b6fbb23cf"}
{"nl": {"description": "Petya studies positional notations. He has already learned to add and subtract numbers in the systems of notations with different radices and has moved on to a more complicated action \u2014 multiplication. To multiply large numbers one has to learn the multiplication table. Unfortunately, in the second grade students learn only the multiplication table of decimals (and some students even learn it in the first grade). Help Petya make a multiplication table for numbers in the system of notations with the radix k.", "input_spec": "The first line contains a single integer k (2\u2009\u2264\u2009k\u2009\u2264\u200910) \u2014 the radix of the system.", "output_spec": "Output the multiplication table for the system of notations with the radix k. The table must contain k\u2009-\u20091 rows and k\u2009-\u20091 columns. The element on the crossing of the i-th row and the j-th column is equal to the product of i and j in the system of notations with the radix k. Each line may have any number of spaces between the numbers (the extra spaces in the samples are put for clarity).", "sample_inputs": ["10", "3"], "sample_outputs": ["1  2  3  4  5  6  7  8  9\n2  4  6  8 10 12 14 16 18\n3  6  9 12 15 18 21 24 27\n4  8 12 16 20 24 28 32 36\n5 10 15 20 25 30 35 40 45\n6 12 18 24 30 36 42 48 54\n7 14 21 28 35 42 49 56 63\n8 16 24 32 40 48 56 64 72\n9 18 27 36 45 54 63 72 81", "1  2\n2 11"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\nfor($x = 1; $x <= $a - 1; $x++)\n{\n    if(($x == 1) && ($a == 2))\n    {\n        print implode(\" \", range(1, $a - 1));\n    }\n    elseif($x == 1)\n    {\n        print implode(\" \", range(1, $a - 1)) . \"\\n\";\n    }\n    else\n    {\n        print $x . \" \";\n        for($y = 2; $y <= $a - 1; $y++)\n        {\n            if(($y == $a - 1) && ($x != $a - 1))\n            {\n                print base_convert($x * $y, 10, $a) . \"\\n\";\n            }\n            else\n            {\n                print base_convert($x * $y, 10, $a) . \" \";\n            }\n        }\n    }\n}\n?>"}], "negative_code": [], "src_uid": "a705144ace798d6b41068aa284d99050"}
{"nl": {"description": "This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are different.You are given a string $$$s$$$ consisting of $$$n$$$ lowercase Latin letters.You have to color all its characters one of the two colors (each character to exactly one color, the same letters can be colored the same or different colors, i.e. you can choose exactly one color for each index in $$$s$$$).After coloring, you can swap any two neighboring characters of the string that are colored different colors. You can perform such an operation arbitrary (possibly, zero) number of times.The goal is to make the string sorted, i.e. all characters should be in alphabetical order.Your task is to say if it is possible to color the given string so that after coloring it can become sorted by some sequence of swaps. Note that you have to restore only coloring, not the sequence of swaps.", "input_spec": "The first line of the input contains one integer $$$n$$$ ($$$1 \\le n \\le 200$$$) \u2014 the length of $$$s$$$. The second line of the input contains the string $$$s$$$ consisting of exactly $$$n$$$ lowercase Latin letters.", "output_spec": "If it is impossible to color the given string so that after coloring it can become sorted by some sequence of swaps, print \"NO\" (without quotes) in the first line. Otherwise, print \"YES\" in the first line and any correct coloring in the second line (the coloring is the string consisting of $$$n$$$ characters, the $$$i$$$-th character should be '0' if the $$$i$$$-th character is colored the first color and '1' otherwise).", "sample_inputs": ["9\nabacbecfd", "8\naaabbcbb", "7\nabcdedc", "5\nabcde"], "sample_outputs": ["YES\n001010101", "YES\n01011011", "NO", "YES\n00000"], "notes": null}, "positive_code": [{"source_code": "<?php\n\nnamespace io {\n\t$input_file_content = file_get_contents(\"php://stdin\");\n\t$input_buf = explode(\"\\r\\n\", $input_file_content);\n\tunset($input_file_content);\n}\n\nnamespace main {\n\terror_reporting(E_ALL);\n\tini_set('display_errors', true);\n\tini_set('html_errors', false);\n\n\tuse function io\\next_line as next_line;\n\tuse function io\\next_ as next;\n\tuse function io\\next_int as next_int;\n\tuse function io\\next_double as next_double;\n\n\t$n = next_int();\n\t$s = next_line();\n\n\t$a = [];\n\t$f = array_fill(0, 32, 0);\n\tfor($i=0; $i<$n; $i++) {\n\t\t$j = ord($s[$i]) - ord('a');\n\t\t$a[] = max(array_slice($f, $j + 1)) + 1;\n\t\t$f[$j] = max($f[$j], $a[$i]);\n\t}\n\n\t$m = max($a);\n\tif($m <= 2) {\n\t\tfor($i=0; $i<$n; $i++) $a[$i]--;\n\t\tprintf(\"YES\\n%s\\n\", implode(\"\", $a));\n\t}\n\telse printf(\"NO\");\n}\n\n\nnamespace io {\n\tfunction next_line() {\n\t\tstatic $cnt = 0;\n\t\tglobal $input_buf;\n\t\t// while($input_buf[$cnt] == \"\") $cnt++;\n\t\treturn $input_buf[$cnt++];\n\t\t// return trim($input_buf[$cnt++]);\n\t}\n\tfunction next_() {\n\t\tstatic $tk = [];\n\t\tstatic $tk_cnt = 0;\n\t\tif($tk_cnt == count($tk)) {\n\t\t\t$tk = explode(\" \", next_line());\n\t\t\t$tk_cnt = 0;\n\t\t}\n\t\treturn $tk[$tk_cnt++];\n\t}\n\tfunction next_int() {\n\t\treturn (int)next_();\n\t}\n\tfunction next_double() {\n\t\treturn (double)next_();\n\t}\n}\n\n?>\n"}], "negative_code": [{"source_code": "<?php\n\nnamespace io {\n\t$input_file_content = file_get_contents(\"php://stdin\");\n\t$input_buf = explode(\"\\r\\n\", $input_file_content);\n\tunset($input_file_content);\n}\n\nnamespace main {\n\terror_reporting(E_ALL);\n\tini_set('display_errors', true);\n\tini_set('html_errors', false);\n\n\tuse function io\\next_line as next_line;\n\tuse function io\\next_ as next;\n\tuse function io\\next_int as next_int;\n\tuse function io\\next_double as next_double;\n\n\t$n = next_int();\n\t$s = next_line();\n\n\t$a = [];\n\t$f = array_fill(0, 32, 0);\n\tfor($i=0; $i<$n; $i++) {\n\t\t$j = ord($s[$i]) - ord('a');\n\t\t$a[] = max(array_slice($f, $j + 1)) + 1;\n\t\t$f[$j] = max($f[$j], $a[$i]);\n\t}\n\n\t$m = max($a);\n\tif($m < 2) {\n\t\tfor($i=0; $i<$n; $i++) $a[$i]--;\n\t\tprintf(\"YES\\n%s\\n\", implode(\"\", $a));\n\t}\n\telse printf(\"NO\");\n}\n\n\nnamespace io {\n\tfunction next_line() {\n\t\tstatic $cnt = 0;\n\t\tglobal $input_buf;\n\t\t// while($input_buf[$cnt] == \"\") $cnt++;\n\t\treturn $input_buf[$cnt++];\n\t\t// return trim($input_buf[$cnt++]);\n\t}\n\tfunction next_() {\n\t\tstatic $tk = [];\n\t\tstatic $tk_cnt = 0;\n\t\tif($tk_cnt == count($tk)) {\n\t\t\t$tk = explode(\" \", next_line());\n\t\t\t$tk_cnt = 0;\n\t\t}\n\t\treturn $tk[$tk_cnt++];\n\t}\n\tfunction next_int() {\n\t\treturn (int)next_();\n\t}\n\tfunction next_double() {\n\t\treturn (double)next_();\n\t}\n}\n\n?>\n"}], "src_uid": "9bd31827cda83eacfcf5e46cdeaabe2b"}
{"nl": {"description": "Barney is standing in a bar and starring at a pretty girl. He wants to shoot her with his heart arrow but he needs to know the distance between him and the girl to make his shot accurate.  Barney asked the bar tender Carl about this distance value, but Carl was so busy talking to the customers so he wrote the distance value (it's a real number) on a napkin. The problem is that he wrote it in scientific notation. The scientific notation of some real number x is the notation of form AeB, where A is a real number and B is an integer and x\u2009=\u2009A\u2009\u00d7\u200910B is true. In our case A is between 0 and 9 and B is non-negative.Barney doesn't know anything about scientific notation (as well as anything scientific at all). So he asked you to tell him the distance value in usual decimal representation with minimal number of digits after the decimal point (and no decimal point if it is an integer). See the output format for better understanding.", "input_spec": "The first and only line of input contains a single string of form a.deb where a, d and b are integers and e is usual character 'e' (0\u2009\u2264\u2009a\u2009\u2264\u20099,\u20090\u2009\u2264\u2009d\u2009&lt;\u200910100,\u20090\u2009\u2264\u2009b\u2009\u2264\u2009100)\u00a0\u2014 the scientific notation of the desired distance value. a and b contain no leading zeros and d contains no trailing zeros (but may be equal to 0). Also, b can not be non-zero if a is zero.", "output_spec": "Print the only real number x (the desired distance value) in the only line in its decimal notation.  Thus if x is an integer, print it's integer value without decimal part and decimal point and without leading zeroes.  Otherwise print x in a form of p.q such that p is an integer that have no leading zeroes (but may be equal to zero), and q is an integer that have no trailing zeroes (and may not be equal to zero).", "sample_inputs": ["8.549e2", "8.549e3", "0.33e0"], "sample_outputs": ["854.9", "8549", "0.33"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = str_split(trim(fgets(STDIN)));\nfor($x = 0; $x < count($a); $x++)\n{\n     if($a[$x] == \".\")\n     {\n          $b = array_slice($a, 0, $x);\n          $c = array_slice($a, $x + 1);\n          break;\n     }\n}\nfor($x = 0; $x < count($c); $x++)\n{\n     if($c[$x] == \"e\")\n     {\n          $d = array_slice($c, 0, $x);\n          $e = array_slice($c, $x + 1);\n     }\n}\n$f = implode($e);\nif(count($d) < $f)\n{\n     $g = $f - count($d);\n     for($x = 1; $x <= $g; $x++)\n     {\n          array_push($d, 0);\n     }\n     $h = array_merge($b, $d);\n     $i = count($h);\n     for($x = 0; $x < $i; $x++)\n     {\n          if($h[$x] == 0)\n          {\n               unset($h[$x]);\n          }\n          else\n          {\n               break;\n          }\n     }\n     print implode($h);\n}\nelseif(count($d) == $f)\n{\n     $g = array_merge($b, $d);\n     $h = count($g);\n     for($x = 0; $x < $h; $x++)\n     {\n          if($g[$x] == 0)\n          {\n               unset($g[$x]);\n          }\n          else\n          {\n               break;\n          }\n     }\n     print implode($g);\n}\nelseif(count($d) > $f)\n{\n     $g = array_slice($d, 0, $f);\n     $h = array_slice($d, $f);\n     $i = array_merge($b, $g);\n     $h2 = array_unique($h);\n     sort($h2);\n     if((count($h2) == 1) && ($h2[0] == 0))\n     {\n          $j = $i;\n          if(count($j) == 1)\n          {\n               print implode($j);\n          }\n          else\n          {\n               $k = count($j);\n               for($x = 0; $x < $k; $x++)\n               {\n                    if($j[$x] == 0)\n                    {\n                         unset($j[$x]);\n                    }\n                    else\n                    {\n                         break;\n                    }\n               }\n               print implode($j);\n          }\n     }\n     else\n     {\n          array_push($i, \".\");\n          $j = array_merge($i, $h);\n          if($j[1] == \".\")\n          {\n               print implode($j);\n          }\n          else\n          {\n               $k = count($j);\n               for($x = 0; $x < $k; $x++)\n               {\n                    if($j[$x] == 0)\n                    {\n                         unset($j[$x]);\n                    }\n                    else\n                    {\n                         break;\n                    }\n               }\n               print implode($j);\n          }\n     }\n}\n?>"}, {"source_code": "<?php\n\n$fr = fopen(\"php://stdin\", \"r\");\n$fw = fopen(\"php://stdout\", \"w\");\n\nfscanf($fr, \"%s\", $str);\n\n$a = substr($str, 0, 1);\n\n$charPosition = strpos($str, 'e');\n\n$d = substr($str, 2, $charPosition - 2);\n\n$b =  substr($str, $charPosition + 1);\n\nif (($dLen = strlen($d)) < $b) {\n\t$d .= str_repeat('0', $b - $dLen);\n}\n\nif ($a == '0' && $d == '0' && $b == '0') {\n\t$realNumber = 0;\n} elseif ($b == '0') {\n\t$realNumber = $a . '.' . $d;\n\t$realNumber = removeLeadingZeroes($realNumber);\n} else {\n\t$realNumber = $a . substr($d, 0, $b);\n\t\n\tif ($dLen > $b) {\n\t\t$realNumber .= '.';\n\t}\n\n\t$realNumber .= substr($d, $b);\n\n\t$realNumber = removeLeadingZeroes($realNumber);\n}\n\nfunction removeLeadingZeroes($realNumber)\n{\n\tif (! strpos($realNumber, '.')) {\n\t\treturn $realNumber;\n\t}\n\n\tfor ($i = strlen($realNumber); $i> 0; $i--) {\n\t\tif ($realNumber[$i-1] != 0) {\n\t\t\treturn $realNumber;\n\t\t}\n\n\t\t$realNumber = substr($realNumber, 0, $i-1);\n\t}\n\n\treturn $realNumber;\n}\n\nfprintf($fw, $realNumber);\n\nfclose($fr);\nfclose($fw);"}], "negative_code": [{"source_code": "<?php\n$a = str_split(trim(fgets(STDIN)));\nfor($x = 0; $x < count($a); $x++)\n{\n     if($a[$x] == \".\")\n     {\n          $b = array_slice($a, 0, $x);\n          $c = array_slice($a, $x + 1);\n          break;\n     }\n}\nfor($x = 0; $x < count($c); $x++)\n{\n     if($c[$x] == \"e\")\n     {\n          $d = array_slice($c, 0, $x);\n          $e = array_slice($c, $x + 1);\n     }\n}\n$f = implode($e);\nif(implode($a) == \"0.0e0\")\n{\n     print \"0\";\n}\nelseif(count($d) < $f)\n{\n     $g = $f - count($d);\n     for($x = 1; $x <= $g; $x++)\n     {\n          array_push($d, 0);\n     }\n     $h = array_merge($b, $d);\n     $i = count($h);\n     for($x = 0; $x < $i; $x++)\n     {\n          if($h[$x] == 0)\n          {\n               unset($h[$x]);\n          }\n          else\n          {\n               break;\n          }\n     }\n     print implode($h);\n}\nelseif(count($d) == $f)\n{\n     $g = array_merge($b, $d);\n     $h = count($g);\n     for($x = 0; $x < $h; $x++)\n     {\n          if($g[$x] == 0)\n          {\n               unset($g[$x]);\n          }\n          else\n          {\n               break;\n          }\n     }\n     print implode($g);\n}\nelseif(count($d) > $f)\n{\n     $g = array_slice($d, 0, $f);\n     $h = array_slice($d, $f);\n     $i = array_merge($b, $g);\n     array_push($i, \".\");\n     $j = array_merge($i, $h);\n     if($j[1] == \".\")\n     {\n          print implode($j);\n     }\n     else\n     {\n          $k = count($j);\n          for($x = 0; $x < $k; $x++)\n          {\n               if($j[$x] == 0)\n               {\n                    unset($j[$x]);\n               }\n               else\n               {\n                    break;\n               }\n          }\n          print implode($j);\n     }\n}\n?>"}, {"source_code": "<?php\n$a = str_split(trim(fgets(STDIN)));\nfor($x = 0; $x < count($a); $x++)\n{\n     if($a[$x] == \".\")\n     {\n          $b = array_slice($a, 0, $x);\n          $c = array_slice($a, $x + 1);\n          break;\n     }\n}\nfor($x = 0; $x < count($c); $x++)\n{\n     if($c[$x] == \"e\")\n     {\n          $d = array_slice($c, 0, $x);\n          $e = array_slice($c, $x + 1);\n     }\n}\n$f = implode($e);\nif(count($d) < $f)\n{\n     $g = $f - count($d);\n     for($x = 1; $x <= $g; $x++)\n     {\n          array_push($d, 0);\n     }\n     $h = array_merge($b, $d);\n     $i = count($h);\n     for($x = 0; $x < $i; $x++)\n     {\n          if($h[$x] == 0)\n          {\n               unset($h[$x]);\n          }\n          else\n          {\n               break;\n          }\n     }\n     print implode($h);\n}\nelseif(count($d) == $f)\n{\n     $g = array_merge($b, $d);\n     $h = count($g);\n     for($x = 0; $x < $h; $x++)\n     {\n          if($g[$x] == 0)\n          {\n               unset($g[$x]);\n          }\n          else\n          {\n               break;\n          }\n     }\n     print implode($g);\n}\nelseif(count($d) > $f)\n{\n     $g = array_slice($d, 0, $f);\n     $h = array_slice($d, $f);\n     $i = array_merge($b, $g);\n     array_push($i, \".\");\n     $j = array_merge($i, $h);\n     if($j[1] == \".\")\n     {\n          print implode($j);\n     }\n     else\n     {\n          $k = count($j);\n          for($x = 0; $x < $k; $x++)\n          {\n               if($j[$x] == 0)\n               {\n                    unset($j[$x]);\n               }\n               else\n               {\n                    break;\n               }\n          }\n          print implode($j);\n     }\n}\n?>"}, {"source_code": "<?php\n\n$fr = fopen(\"php://stdin\", \"r\");\n$fw = fopen(\"php://stdout\", \"w\");\n\nfscanf($fr, \"%s\", $str);\n\n$charPosition = strpos($str, 'e');\n\n$number = substr($str, 0, $charPosition);\n\n$exp =  substr($str, $charPosition + 1);\n\n$realNumber = $number * pow(10, $exp);\n\nfprintf($fw, $realNumber);\n\nfclose($fr);\nfclose($fw);"}, {"source_code": "<?php\n\n$fr = fopen(\"php://stdin\", \"r\");\n$fw = fopen(\"php://stdout\", \"w\");\n\nfscanf($fr, \"%s\", $str);\n\n$a = substr($str, 0, 1);\n\n$charPosition = strpos($str, 'e');\n\n$d = substr($str, 2, $charPosition - 2);\n\n$b =  substr($str, $charPosition + 1);\n\nif ($b == '0') {\n\t$realNumber = $a . '.' . $d;\n\t$realNumber = removeLeadingZeroes($realNumber);\n} else {\n\t$realNumber = $a . substr($d, 0, $b);\n\t$realNumber .= '.';\n\t$realNumber .= substr($d, $b);\n\n\t$realNumber = removeLeadingZeroes($realNumber);\n}\n\nfunction removeLeadingZeroes($realNumber)\n{\n\tif (! strpos($realNumber, '.')) {\n\t\treturn $realNumber;\n\t}\n\n\tfor ($i = strlen($realNumber); $i> 0; $i--) {\n\t\tif ($realNumber[$i-1] != 0) {\n\t\t\treturn $realNumber;\n\t\t}\n\n\t\t$realNumber = substr($realNumber, 0, $i-1);\n\t}\n\n\treturn $realNumber;\n}\n\nfprintf($fw, $realNumber);\n\nfclose($fr);\nfclose($fw);"}], "src_uid": "a79358099f08f3ec50c013d47d910eef"}
{"nl": {"description": "During the break the schoolchildren, boys and girls, formed a queue of n people in the canteen. Initially the children stood in the order they entered the canteen. However, after a while the boys started feeling awkward for standing in front of the girls in the queue and they started letting the girls move forward each second. Let's describe the process more precisely. Let's say that the positions in the queue are sequentially numbered by integers from 1 to n, at that the person in the position number 1 is served first. Then, if at time x a boy stands on the i-th position and a girl stands on the (i\u2009+\u20091)-th position, then at time x\u2009+\u20091 the i-th position will have a girl and the (i\u2009+\u20091)-th position will have a boy. The time is given in seconds.You've got the initial position of the children, at the initial moment of time. Determine the way the queue is going to look after t seconds.", "input_spec": "The first line contains two integers n and t (1\u2009\u2264\u2009n,\u2009t\u2009\u2264\u200950), which represent the number of children in the queue and the time after which the queue will transform into the arrangement you need to find.  The next line contains string s, which represents the schoolchildren's initial arrangement. If the i-th position in the queue contains a boy, then the i-th character of string s equals \"B\", otherwise the i-th character equals \"G\".", "output_spec": "Print string a, which describes the arrangement after t seconds. If the i-th position has a boy after the needed time, then the i-th character a must equal \"B\", otherwise it must equal \"G\".", "sample_inputs": ["5 1\nBGGBG", "5 2\nBGGBG", "4 1\nGGGB"], "sample_outputs": ["GBGGB", "GGBGB", "GGGB"], "notes": null}, "positive_code": [{"source_code": "<?php\n$input = trim(fgets(STDIN));\n$string = trim(fgets(STDIN));\n\n$arr_input = explode(\" \",$input);\n\n$jumlah = $arr_input[0];\n$detik = $arr_input[1];\n\n$arr_string = str_split($string);\nfor($x=0;$x<$detik;$x++)\n{\n\tfor($i=0;$i<(count($arr_string)-1);$i++)\n\t{\n\t\t$j = $i + 1;\n\t\tif($arr_string[$i] == \"B\" && $arr_string[$j] == \"G\")\n\t\t{\n\t\t\t$arr_string[$j] = \"B\";\n\t\t\t$arr_string[$i] = \"G\";\n\t\t\t$i++;\n\t\t}\n\t}\n}\necho implode($arr_string);\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d %d\", $n, $t);\n    fscanf(STDIN, \"%s\", $arr);\n    $sw = 0;\n       for ($i = 0; $i < $t; $i++){\n           for ($j = 0; $j < $n; $j++){\n               if ($arr[$j] == 'B' && $arr[$j+1] == 'G'){\n                  $sw = $arr[$j];\n                  $arr[$j] = $arr[$j+1];\n                  $arr[$j+1] = $sw;\n                  $j += +1;\n                 \n               }\n           }\n       }\n       for ($i=0; $i < $n; $i++){\n           echo ($arr[$i]);\n       }"}, {"source_code": "<?php\nfunction input()\n{\n    while (($line = fgets(STDIN)) != PHP_EOL) {\n        yield $line;\n    }\n}\n\nfunction put($r)\n{\n    echo $r;\n}\n\n$COUNT = 0;\nforeach (input() as $line) {\n    if ($COUNT == 0) {\n        list($n, $s) = explode(' ', $line);\n        ++$COUNT;\n        continue;\n    }\n    $q = $line;\n    \n    for($i = 0; $i<$s; ++$i) {\n        for($j = strlen($q)-1; $j>0; --$j) {\n            if ( $q[$j] == 'G' && $q[$j-1] == 'B') {\n                $z = $q[$j-1];\n                $q[$j-1] = $q[$j];\n                $q[$j] = $z;\n                --$j;\n\n            }\n\n        }\n    }\n\n    put($q);\n\n\n    if (++$COUNT > 1) {\n        break;\n    }\n\n}\n"}, {"source_code": "<?php\nfunction input()\n{\n    while (($line = fgets(STDIN)) != PHP_EOL) {\n        yield $line;\n    }\n}\n\n$COUNT = 0;\nforeach (input() as $line) {\n    if ($COUNT == 0) {\n        list($n, $s) = explode(' ', $line);\n        ++$COUNT;\n        continue;\n    }\n    $q = $line;\n    \n    for($i = 0; $i<$s; ++$i) {\n        for($j = strlen($q)-1; $j>0; --$j) {\n            if ( $q[$j] == 'G' && $q[$j-1] == 'B') {\n                $z = $q[$j-1];\n                $q[$j-1] = $q[$j];\n                $q[$j] = $z;\n                --$j;\n            }\n\n        }\n    }\n\n    echo $q;\n\n\n    if (++$COUNT > 1) {\n        break;\n    }\n\n}\n"}, {"source_code": "<?php\n\nfunction dd(...$args)\n{\n    var_dump(...$args);\n    die;\n}\n\ndefine('TXTIN', fopen('input.txt', 'r'));\ndefine('TXTOUT', fopen('output.txt', 'w'));\n\n//$input = TXTIN;\n$input = STDIN;\n//$output = TXTOUT;\n$output = STDOUT;\n\nlist($n, $t) = fscanf($input, \"%d %d\\n\");\n\nlist($s) = fscanf($input, \"%s\");\n\nfor ($i = 0; $i < $t; $i++) {\n    for ($j = 0; $j < $n - 1; $j++) {\n        if ($s[$j + 1] === 'G' && $s[$j] === 'B') {\n            $s[$j] = 'G';\n            $s[$j + 1] = 'B';\n            $j++;\n        }\n    }\n}\n\nfwrite($output, $s);\n"}, {"source_code": "<?php\nfscanf(STDIN, \"%d %d\", $n, $t);\n$s=trim(fgets(STDIN));\nfor ($i=1; $i<=$t;$i++)\n    for ($j=0; $j<$n-1; $j++)\n    {\n        if ($s[$j]=='B' && $s[$j+1]=='G')\n        {\n            $s[$j]='G';\n            $s[$j+1]='B';\n            $j++;\n        }\n    }\nfprintf(STDOUT, \"%s\",$s);"}, {"source_code": "<?php\n\n$nt = array_map('intval', explode(' ', readline()));\n$queue = str_split(readline());\n$t = 0;\nwhile($t < $nt[1]){\n    $i = 0;\n    while($i < $nt[0] -1){\n        if($queue[$i] == 'B' && $queue[$i+1] == 'G'){\n            $queue[$i] = 'G';\n            $queue[$i+1] = 'B';\n            $i = $i +2;\n        }else{\n            $i++;\n        }\n    }\n    $t ++;\n}\n\necho implode('', $queue);\n"}, {"source_code": "<?php\n$n = explode(\" \",trim(fgets(STDIN)));\n$line = str_split(trim(fgets(STDIN)),1);\nfor ($i=0;$i<$n[1];$i++)\n{\n    for ($j=1;$j<$n[0];$j++)\n    {\n        if (($line[$j]==\"G\")&&($line[$j])!=$line[$j-1])\n        {\n            $t=$line[$j];$line[$j]=$line[$j-1];$line[$j-1]=$t;$j++;\n        }\n    }\n}\nforeach ($line as $char)echo $char;"}, {"source_code": "<?php\n$n=trim(fgets(STDIN));\n$n=explode(' ',$n);\n$input=trim(fgets(STDIN));\n$array=str_split($input);\n$a=$n[1];\nwhile($a>=1){\nforeach ($array as $key => $value) {\n   if(key_exists($key+1,$array)){\n      if($value == 'B' and $array[$key+1] == 'G'){\n      $x=$array[$key];\n      $array[$key]=$array[$key+1];\n      $array[$key+1]=$x;\n      }\n   }\n}\n$a--;\n}\necho join('',$array);"}, {"source_code": "<?php\n\n$f = fopen('php://stdin', 'r');\n//$f = fopen('5.txt', 'r');\n$a = explode(\" \",trim(fgets($f)));\n$och = trim(fgets($f));\n\n$t = $a[1];\n$n = $a[0];\n\nfor($i=0;$i<$t;$i++){\n    $och = str_replace(\"BG\",\"GB\",$och);\n}\n\necho $och;\n\n\n\n\n\n\n"}, {"source_code": "<?php\n$n = explode(\" \", fgets(STDIN));\n$s = fgets(STDIN);\nfor ($i=0;$i<$n[1];$i++){\n\tfor ($j=0;$j<$n[0];$j++){\n\t\tif ($s[$j] == \"B\" && $s[$j+1] == \"G\"){\n\t\t\t$s[$j] = \"G\";\n\t\t\t$s[$j+1] = \"B\";\n\t\t\t$j++;\n\t\t}\n\t}\n}\necho $s;\n?>"}, {"source_code": "<?php\n$input = explode(\"\\n\", trim(file_get_contents(\"php://stdin\")));\nlist($count, $ch) = explode(' ', $input[0]);\n$q = $input[1];\nfor($i=1; $i<=$ch; $i++){\n    for($k=0; $k<=$count;$k++){\n         if($q[$k] == 'B'){\n            if($q[$k+1] == 'G'){\n                $q[$k] = 'G';\n                $q[$k+1] = 'B';\n                $k++;\n            }\n        }\n    }\n}\necho $q;"}, {"source_code": "<?php\n$n=explode(\" \", trim(fgets(STDIN)));\n$s=trim(fgets(STDIN));\n$arr=str_split($s);\n$k=$n[0]-1;\n$temp1=\"\";\n$temp2=\"\";\nfor ($j=0; $j < $n[1]; $j++) { \n\tfor ($k=0; $k < $n[0]; $k++) { \n\t\t$temp1=$arr[$k];\n\t\t$temp2=$arr[$k+1];\n\t\tif (($temp1 != $temp2) && ($temp1 ==\"B\" && $temp2 ==\"G\" )) {\n\t\t\t$arr[$k+1] = $temp1;\n\t\t\t$arr[$k] = $temp2;\n\t\t\t$k++;\n\t\t}\n\t}\n}\n\necho implode($arr);\n?>"}, {"source_code": "<?php\n// 266B \t\u041e\u0447\u0435\u0440\u0435\u0434\u044c \u0432 \u0448\u043a\u043e\u043b\u0435 \n\n$in = fopen(\"php://stdin\", 'r');\n\n$input_line = fgets($in);\nlist($n, $t) = preg_split('/ /', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n$n = (int) $n;\n$t = (int) $t;\n\n$input_line = fgets($in);\n$arr = preg_split('//', substr($input_line, 0, strlen($input_line)-2), -1, PREG_SPLIT_NO_EMPTY);\n\nfor ($i=1; $i <= $t; $i++) { \n    for ($j=0; $j < $n; $j++) { \n        if (($arr[$j] == 'B') and ($arr[$j+1]) == 'G') {\n            $arr[$j] = 'G';\n            $arr[$j+1] = 'B';\n            $j++;\n         } \n    }\n}\n\n$out = '';\nforeach ($arr as $key => $value) {\n    $out .= $value;\n}\n\necho $out;\n\n?>"}, {"source_code": "<?php\n\n//  In the name of Allah, the most Gracious, the most Merciful\n\n//  Copyright(c) 2009-2013, all rights reserved.\n//  written by ZHUMAZHANOV ADLET.\n\nfscanf(STDIN, \"%d %d\", $n, $t);\nfscanf(STDIN, \"%s\", $q);\n\nfor ($ti = 0; $ti < $t; $ti ++) {\n\t$length = strlen($q);\n\tfor ($i = 0; $i < $length; $i ++) {\n\t\tif ($q[$i] == \"G\") continue;\n\t\tif ($i + 1 < $length && $q[$i+1] == \"G\") {\n\t\t\t$buf = $q[$i];\n\t\t\t$q[$i] = $q[$i+1];\n\t\t\t$q[$i+1] = $buf;\n\t\t\t$i ++;\n\t\t}\n\t}\n}\n\nprintf(\"%s\", $q);\n\n?>"}, {"source_code": "<?php\nfscanf(STDIN, '%d %d', $n, $t);\nfscanf(STDIN, '%s', $s);\n\nwhile($t--) {\n    for ($i = 0; $i < $n; $i++) {\n        if($s[$i] == 'B') {\n            if ($i < $n - 1 && $s[$i + 1] == 'G') {\n                $c = $s[$i];\n                $s[$i] = $s[$i + 1];\n                $s[$i + 1] = $c;\n                $i++;\n            }\n        }\n    }\n}\n\necho $s;\n"}, {"source_code": "<?php\n\n/**\n * @author Sunwarul\n */\n\nlist($n, $t) = explode(' ', fgets(STDIN));\n$str         = trim(fgets(STDIN));\n$arr         = str_split($str);\n$t           = intval($t);\n\nwhile ($t--) {\n    for ($i = 1; $i < count($arr); ++$i) {\n        if ($arr[$i] == 'G' && $arr[$i - 1] == 'B') {\n            $arr[$i]     = 'B';\n            $arr[$i - 1] = 'G';\n            ++$i;\n        }\n    }\n}\n\n$res = implode('', $arr);\necho $res.\"\\n\";\n"}, {"source_code": "<?\n$n=explode(\" \",trim(fgets(STDIN)));\n$s=str_split(trim(fgets(STDIN)));\nfor($i=1;$i<=$n[1];$i++){\n    for($j=$n[0]-2;$j>=0;$j--){\n        if($s[$j]==\"B\" && $s[$j+1]==\"G\"){$s[$j]=\"G\";$s[$j+1]=\"B\";$j--;}\n    }\n}\nforeach($s as $v)echo $v;\n?>"}, {"source_code": "<?php\n//266B: Queue at the School\nlist($n, $t) = explode(\" \", trim(fgets(STDIN))); //$n = 4; $t = 1;\n$queue = trim(fgets(STDIN)); //$queue = \"GGGB\";\nfor ($i = 0; $i < $t; $i++) {\n    $explode = explode(\"BG\", $queue);\n    $queue = implode(\"GB\", $explode);\n}\necho $queue;\n?>"}, {"source_code": "<?php\nlist($a, $b) = explode(\" \", trim(fgets(STDIN)));\n$c = str_split(trim(fgets(STDIN)));\nfor($x = 1; $x <= $b; $x++)\n{\n    for($y = 0; $y < $a; $y++)\n    {\n        if(($c[$y] == \"B\") && ($c[$y + 1] == \"G\"))\n        {\n            $c[$y] = \"G\";\n            $c[$y + 1] = \"B\";\n            $y++;\n        }\n    }\n}\nprint implode($c)\n?>"}, {"source_code": "<?php\n\tlist($n,$t) = explode(' ',trim(fgets(STDIN)));\n\t$var = trim(fgets(STDIN));\n\tfor ($x=0;$x<$t;$x++) {\n\t\t$var = str_split($var);\n\t\tfor($y=0;$y<count($var)-1;$y++) {\n\t\t\tif ($var[$y] == 'B' && $var[$y+1] == 'G') {\n\t\t\t\t$var[$y] = 'X';\n\t\t\t\t$var[$y+1] = 'Y';\n\t\t\t}\n\t\t}\t\t\n\t\t$var = implode('',$var);\n\t\t$var = str_replace('XY','GB',$var);\n\t}\n\techo $var;"}, {"source_code": "<?php\n\nfscanf (STDIN, \"%d %d\",$n,$t);\n\nfscanf (STDIN, \"%s\", $s);\n$r=$s;\nfor ($j=0;$j<$t;$j++)\n{\n  for ($i=$n-1;$i>0;$i--) {\n    if ($s[$i] == \"G\") {\n      if ($s[$i - 1] == \"B\") {\n        $r[$i] = $s[$i-1];\n        $r[$i-1] = $s[$i];\n      }\n    }\n  }\n  $s=$r;\n}\n\necho $r;\n\n?>\n"}], "negative_code": [{"source_code": "<?php\n$input = trim(fgets($STDIN));\n$string = trim(fgets($STDIN));\n\n$arr_input = explode(\" \",$input);\n\n$jumlah = $arr_input[0];\n$detik = $arr_input[1];\n\n$arr_string = str_split($string);\nfor($x=0;$x<$detik;$x++)\n{\n\tfor($i=0;$i<(count($arr_string)-1);$i++)\n\t{\n\t\t$j = $i + 1;\n\t\tif($arr_string[$i] == \"B\" && $arr_string[$j] == \"G\")\n\t\t{\n\t\t\t$arr_string[$j] = \"B\";\n\t\t\t$arr_string[$i] = \"G\";\n\t\t\t$i++;\n\t\t}\n\t}\n}\necho implode($arr_string);\n?>"}, {"source_code": "<?php\n\n    fscanf(STDIN, \"%d %d\", $n, $t);\n    fscanf(STDIN, \"%s\", $arr);\n    $sw = 0;\n       for ($i = 0; $i < $t; $i++){\n           for ($j = 0; $j < $n; $j++){\n               if ($arr[$j] == 'B' && $arr[$j+1] == 'G'){\n                  $sw = $arr[$j];\n                  $arr[$j] = $arr[$j+1];\n                  $arr[$j+1] = $sw;\n               }\n           }\n       }\n       for ($i=0; $i < $n; $i++){\n           echo ($arr[$i]);\n       }\n\n\n       echo \"\\n\"\n\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d %d\", $n, $t);\n    fscanf(STDIN, \"%s\", $arr);\n    $sw = 0;\n       for ($i = 0; $i < $t; $i++){\n           for ($j = 0; $j < $n; $j++){\n               if ($arr[$j] == 'B' && $arr[$j+1] == 'G'){\n                  $sw = $arr[$j];\n                  $arr[$j] = $arr[$j+1];\n                  $arr[$j+1] = $sw;\n                  $j += +2;\n               }\n           }\n       }\n       for ($i=0; $i < $n; $i++){\n           echo ($arr[$i]);\n       }"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d %d\", $n, $t);\n    fscanf(STDIN, \"%s\", $arr);\n    $sw = 0;\n       for ($i = 0; $i < $t; $i++){\n           for ($j = 0; $j < $n; $j++){\n               if ($arr[$j] == 'B' && $arr[$j+1] == 'G'){\n                  $sw = $arr[$j];\n                  $arr[$j] = $arr[$j+1];\n                  $arr[$j+1] = $sw;\n                 \n               }\n           }\n       }\n       for ($i=0; $i < $n; $i++){\n           echo ($arr[$i]);\n       }"}, {"source_code": "<?php\nfunction input()\n{\n    while (($line = fgets(STDIN)) != PHP_EOL) {\n        yield $line;\n    }\n}\n\nfunction put($r)\n{\n    echo $r . PHP_EOL;\n}\n\n$COUNT = 0;\nforeach (input() as $line) {\n    if ($COUNT == 0) {\n        list($n, $s) = explode(' ', $line);\n        ++$COUNT;\n        continue;\n    }\n    $q = $line;\n    \n    for($i = 0; $i<$s; ++$i) {\n        for($j = strlen($q)-1; $j>0; --$j) {\n            if ( $q[$j] == 'G' && $q[$j-1] == 'B') {\n                $z = $q[$j-1];\n                $q[$j-1] = $q[$j];\n                $q[$j] = $z;\n            }\n        }\n    }\n\n    put($q);\n\n\n    if (++$COUNT > 1) {\n        break;\n    }\n\n}\n"}, {"source_code": "<?php\n$n=trim(fgets(STDIN));\n$t=trim(fgets(STDIN));\n$s=trim(fgets(STDIN));\n$n=$n-1;\n$temp1=\"\";\n$temp2=\"\";\n$j=0;\n\nwhile ( $j < $t) {\n\twhile ($n >= 0) {\n\t\t$temp1=$s[$n];\n\t\t$temp2=$s[$n-1];\n\t\tif ($temp1 != $temp2) {\n\t\t\t$s[$n-1] = $temp1;\n\t\t\t$s[$n] = $temp2;\n\t\t}\n\t\t$n--;\n\t}\n\t$j++;\n}\necho $s;\n?>"}, {"source_code": "<?php\n$n=explode(\" \", trim(fgets(STDIN)));\n$s=trim(fgets(STDIN));\n$arr=str_split($s);\n$k=$n[0]-1;\n$temp1=\"\";\n$temp2=\"\";\nfor ($j=0; $j < $n[1]; $j++) { \n\tfor ($k=0; $k < $n[0]; $k++) { \n\t\t$temp1=$arr[$k];\n\t\t$temp2=$arr[$k+1];\n\t\tif (($temp2 != $temp1) && ($temp2 ==\"B\" && $temp1 ==\"G\" )) {\n\t\t\t$arr[$k+1] = $temp1;\n\t\t\t$arr[$k] = $temp2;\n\t\t\t$k++;\n\t\t}\n\t}\n}\n\necho implode($arr);\n?>"}, {"source_code": "<?php\n$n=trim(fgets(STDIN));\n$t=trim(fgets(STDIN));\n$s=trim(fgets(STDIN));\n\n$arr=str_split($s);\n$n=$n-1;\n$temp1=\"\";\n$temp2=\"\";\n$j=0;\n$baru;\n\nwhile ( $j < $t) {\n\twhile ($n >= 0) {\n\t\t$temp1=$arr[$n];\n\t\t$m=$n-1;\n\t\t$temp2=$arr[$m];\n\t\tif ($temp2 != $temp1) {\n\t\t\t$arr[$m] = $temp1;\n\t\t\t$arr[$n] = $temp2;\n\t\t}\n\t\t$n--;\n\t}\n\t$j++;\n}\necho $arr;\n?>"}, {"source_code": "<?php\n$n=explode(\" \", trim(fgets(STDIN)));\n$s=trim(fgets(STDIN));\n$arr=str_split($s);\n$k=$n[0]-1;\n$temp1=\"\";\n$temp2=\"\";\nfor ($j=0; $j < $n[1]-1; $j++) { \n\tfor ($k=0; $k < $n[0]-1; $k++) { \n\t\t$temp1=$arr[$k];\n\t\t$temp2=$arr[$k+1];\n\t\tif (($temp2 != $temp1) && ($temp2 ==\"B\" && $temp1 ==\"G\" )) {\n\t\t\t$arr[$k+1] = $temp1;\n\t\t\t$arr[$k] = $temp2;\n\t\t\t$k++;\n\t\t}\n\t}\n}\n\necho implode($arr);\n?>"}, {"source_code": "<?php\n$n=explode(\" \", trim(fgets(STDIN)));\n$s=trim(fgets(STDIN));\n\n$arr=str_split($s);\n$n[0]=$n[0]-1;\n$temp1=\"\";\n$temp2=\"\";\n$j=0;\n\nwhile ( $j < $n[1]) {\n\twhile ($n[0] > 0) {\n\t\t$temp1=$arr[$n[0]];\n\t\t$temp2=$arr[$n[0]-1];\n\t\tif ($temp2 != $temp1) {\n\t\t\tif ($temp2 ==\"B\" && $temp1 ==\"G\" ) {\n\t\t\t\t$arr[$n[0]-1] = $temp1;\n\t\t\t\t$arr[$n[0]] = $temp2;\n\t\t\t}\n\t\t}\n\t\t$n[0]--;\n\t}\n\t$j++;\n}\necho implode($arr);\n?>"}, {"source_code": "<?php\n$n=explode(\" \", trim(fgets(STDIN)));\n$s=trim(fgets(STDIN));\n$arr=str_split($s);\n$k=$n[0]-1;\n$temp1=\"\";\n$temp2=\"\";\nfor ($j=0; $j < $n[1]-1; $j++) { \n\tfor ($k=0; $k > $n[0]-1; $k++) { \n\t\t$temp1=$arr[$k];\n\t\t$temp2=$arr[$k+1];\n\t\tif (($temp2 != $temp1) && ($temp2 ==\"B\" && $temp1 ==\"G\" )) {\n\t\t\t$arr[$k+1] = $temp1;\n\t\t\t$arr[$k] = $temp2;\n\t\t\t$k++;\n\t\t}\n\t}\n}\n\necho implode($arr);\n?>"}, {"source_code": "<?php\n$n=explode(\" \", trim(fgets(STDIN)));\n$s=trim(fgets(STDIN));\n\n$arr=str_split($s);\n$n[0]=$n[0]-1;\n$temp1=\"\";\n$temp2=\"\";\n$j=0;\n\nwhile ( $j < $n[1]) {\n\twhile ($n[0] > 0) {\n\t\t$temp1=$arr[$n[0]];\n\t\t$temp2=$arr[$n[0]-1];\n\t\tif (($temp2 != $temp1) && ($temp2 ==\"B\" && $temp1 ==\"G\" )) {\n\t\t\t$arr[$n[0]-1] = $temp1;\n\t\t\t$arr[$n[0]] = $temp2;\n\t\t}\n\t\t$n[0]--;\n\t}\n\t$j++;\n}\necho implode($arr);\n?>"}, {"source_code": "<?php\n$n=explode(\" \", trim(fgets(STDIN)));\n$s=trim(fgets(STDIN));\n$arr=str_split($s);\n$k=$n[0]-1;\n$temp1=\"\";\n$temp2=\"\";\n$j=0;\nwhile ( $j < $n[1]) {\n\t$k=$n[0]-1;\n\twhile ($k > 0) {\n\t\t$temp1=$arr[$k];\n\t\t$temp2=$arr[$k-1];\n\t\tif (($temp2 != $temp1) && ($temp2 ==\"B\" && $temp1 ==\"G\" )) {\n\t\t\t$arr[$k-1] = $temp1;\n\t\t\t$arr[$k] = $temp2;\n\t\t}\n\t\t$k--;\n\t}\n\t$j++;\n}\necho implode($arr);\n?>"}, {"source_code": "<?php\n$n=explode(\" \", trim(fgets(STDIN)));\n$s=trim(fgets(STDIN));\n$arr=str_split($s);\n$k=$n[0]-1;\n$temp1=\"\";\n$temp2=\"\";\nfor ($j=0; $j < $n[1]; $j++) { \n\tfor ($k=0; $k > $n[0]; $k++) { \n\t\t$temp1=$arr[$k];\n\t\t$temp2=$arr[$k+1];\n\t\tif (($temp2 != $temp1) && ($temp2 ==\"B\" && $temp1 ==\"G\" )) {\n\t\t\t$arr[$k+1] = $temp1;\n\t\t\t$arr[$k] = $temp2;\n\t\t\t$k++;\n\t\t}\n\t}\n}\n\necho implode($arr);\n?>"}, {"source_code": "<?\n$n=explode(\" \",trim(fgets(STDIN)));\n$s=str_split(trim(fgets(STDIN)));\nfor($i=1;$i<=$n[1];$i++){\n    for($j=$n[0]-2;$j>=0;$j--){\n        if($s[$j]==\"B\" && $s[$j+1]==\"G\"){$s[$j]=\"G\";$s[$j+1]=\"B\";}\n    }\n}\nforeach($s as $v)echo $v;\n?>"}, {"source_code": "<?php\n\tlist($n,$t) = explode(' ',trim(fgets(STDIN)));\n\t$var = str_split(trim(fgets(STDIN)));\n\tfor ($x=0;$x<$t;$x++) {\n\t\tfor($y=0;$y<count($var);$y++) {\n\t\t\tif ($var[$y] == 'B' && $var[$y+1] == 'G') {\n\t\t\t\t$var[$y] = 'G';\n\t\t\t\t$var[$y+1] = 'B';\n\t\t\t}\n\t\t}\n\t}\n\techo implode('',$var);"}, {"source_code": "<?php\n\tlist($n,$t) = explode(' ',trim(fgets(STDIN)));\n\t$var = str_split(trim(fgets(STDIN)));\n\tfor ($x=0;$x<$t;$x++) {\n\t\tfor($y=0;$y<count($var);$y++) {\n\t\t\tif ($var[$y] == 'B' && $var[$y+1] == 'G') {\n\t\t\t\t$var[$y] = 'X';\n\t\t\t\t$var[$y+1] = 'X';\n\t\t\t}\n\t\t}\n\t}\n\t$var = implode('',$var);\n\t$var = str_replace('XX','GB',$var);\n\techo $var;"}, {"source_code": "<?php\n\tlist($n,$t) = explode(' ',trim(fgets(STDIN)));\n\t$var = str_split(trim(fgets(STDIN)));\n\tfor ($x=0;$x<$t;$x++) {\n\t\tfor($y=count($var)-1;$y>0;$y--) {\n\t\t\tif ($var[$y] == 'G' && $var[$y-1] == 'B') {\n\t\t\t\t$var[$y] = 'B';\n\t\t\t\t$var[$y-1] = 'G';\n\t\t\t}\n\t\t}\n\t}\n\techo implode('',$var);"}, {"source_code": "<?php\n\tlist($n,$t) = explode(fgets(STDIN));\n\t$var = str_split(fgets(STDIN));\n\tfor ($x=0;$x<$t;$x++) {\n\t\tfor($y=count($var)-1;$y>0;$y--) {\n\t\t\tif ($var[$y] == 'G' && $var[$y-1] == 'B') {\n\t\t\t\t$var[$y] = 'B';\n\t\t\t\t$var[$y-1] = 'G';\n\t\t\t}\n\t\t}\n\t}\n\techo implode('',$var);"}], "src_uid": "964ed316c6e6715120039b0219cc653a"}
{"nl": {"description": "When preparing a tournament, Codeforces coordinators try treir best to make the first problem as easy as possible. This time the coordinator had chosen some problem and asked $$$n$$$ people about their opinions. Each person answered whether this problem is easy or hard.If at least one of these $$$n$$$ people has answered that the problem is hard, the coordinator decides to change the problem. For the given responses, check if the problem is easy enough.", "input_spec": "The first line contains a single integer $$$n$$$ ($$$1 \\le n \\le 100$$$) \u2014 the number of people who were asked to give their opinions. The second line contains $$$n$$$ integers, each integer is either $$$0$$$ or $$$1$$$. If $$$i$$$-th integer is $$$0$$$, then $$$i$$$-th person thinks that the problem is easy; if it is $$$1$$$, then $$$i$$$-th person thinks that the problem is hard.", "output_spec": "Print one word: \"EASY\" if the problem is easy according to all responses, or \"HARD\" if there is at least one person who thinks the problem is hard.  You may print every letter in any register: \"EASY\", \"easy\", \"EaSY\" and \"eAsY\" all will be processed correctly.", "sample_inputs": ["3\n0 0 1", "1\n0"], "sample_outputs": ["HARD", "EASY"], "notes": "NoteIn the first example the third person says it's a hard problem, so it should be replaced.In the second example the problem easy for the only person, so it doesn't have to be replaced."}, "positive_code": [{"source_code": "<?php\n$n = trim(fgets(STDIN));\n$opinions = trim(fgets(STDIN));\n$opinions = explode(' ', $opinions);\n\nif ( in_array(1, $opinions) ) {\n    echo \"HARD\\n\";\n} else {\n    echo \"EASY\\n\";\n}"}, {"source_code": "<?php \n$w=intval(fgets(STDIN));\n$ar=explode(' ',fgets(STDIN));\n$i = 0;\n$res = \"EASY\";\nwhile ($i<$w) {\n    if($ar[$i] > 0){\n        $res = \"HARD\";\n    break;\n    }\n    $i++;\n}\necho $res;\n?>"}, {"source_code": "<?php \n$w=intval(fgets(STDIN));\n$st=fgets(STDIN);\n$res = strstr($st, \"1\") ? \"HARD\" : \"EASY\";\necho $res;\n?>"}, {"source_code": "<?php\n\n$input = STDIN;\n$output = STDOUT;\n\nfgets($input);\n\n$ni = explode(' ', fgets($input));\n\nfwrite($output, in_array(1, $ni) ? 'HARD' : 'EASY');\n"}, {"source_code": "<?php\nwhile(! feof(STDIN)){\n   $var[]=fgets(STDIN);\n}\n\n$value = explode(\" \", $var[1]);\n\n$f=0;\nfor($i=0; $i < $var[0]; $i++){\n    if($value[$i]==1 && $f!=1){echo \"hard\"; $f=1;}\n}\nif($f!=1)\necho \"easy\";\n\nfclose(STDIN);\n\n?>"}, {"source_code": "<?php\n$a = intval(readline());\n$b = readline();\nfor($i = 0; $i < (($a * 2) - 1); $i+=2)\n{\n\tif($b[$i] == \"1\")\n\t\tdie(\"HARD\");\n}\ndie(\"EASY\");\n?>\n"}, {"source_code": "<?php\n    $n = trim(fgets(STDIN));\n    $answers = explode(' ', trim(fgets(STDIN)));\n    $isHard = false;\n    foreach ($answers as $answer) {\n        if ($answer == \"1\") {\n            $isHard = true;\n        }\n    }\n    echo $isHard ? \"HARD\" : \"EASY\";\n\n"}, {"source_code": "<?php\n$n = readline();\n$a = explode(' ', readline());\nif (in_array('1', $a)) {\n  echo \"HARD\\n\";\n}\nelse {\n  echo \"EASY\\n\";\n}"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n\n$i = trim(fgets(STDIN));\n\n$arr = explode(' ', $i);\n$par = 0;\n\nforeach ($arr as $value) {\n  if($value == 1){\n    echo 'HARD';\n    break;\n  }else{\n    $par = 1 + $par;\n  }\n}\n\nif($par == $n){\n  echo 'EASY';\n}\n\n ?>\n"}, {"source_code": "<?php\n/* $inputs = [];\nforeach($data as $k => $d) {\n    echo $k;\n    $inputs = array_merge($inputs, $data[$k]);\n} */\n\n$stdin = fopen('php://stdin', 'r');\nwhile($line = fgets($stdin)) {\n    $line = explode(\" \", $line);\n    $data[] = $line;\n}\nfclose($stdin);\n\nlist($n, $i) = $data;\n\nif (in_array(1, $i)) {\n    echo \"HARD\";\n} else {\n    echo \"EASY\";\n}"}, {"source_code": "<?php\n/* $inputs = [];\nforeach($data as $k => $d) {\n    echo $k;\n    $inputs = array_merge($inputs, $data[$k]);\n} */\n\n// // // STANDARD INPUT DEFINITION // // //\n$stdin = fopen('php://stdin', 'r');\nwhile($line = fgets($stdin)) {\n    $data[] = explode(\" \", $line);\n}\nfclose($stdin);\n\n// // // DEFINE VARIABLES HERE (1 input line = 1 variable) // // //\nlist($a, $b) = $data;\n\n// // // START CODING LOGIC HERE // // //\nif (in_array(1, $b)) {\n    echo \"HARD\";\n} else {\n    echo \"EASY\";\n}"}, {"source_code": "<?php\nfscanf(STDIN,\"%d\",$n);\n$a=explode(' ',trim(fgets(STDIN)));\nforeach($a as $i)\n{\n    if($i==1)\n    {\n        echo \"HARD\";\n        return 0;\n    }\n}\necho \"EASY\";\n?>"}, {"source_code": "<?php\nfscanf(STDIN,\"%d\",$n);\n$line=trim(fgets(STDIN));\n$singleValue=explode(\" \", $line);\n$count=0;\nfor($i=0;$i<$n;$i++)\n{\n\tif($singleValue[$i]==1)\n\t{\n\t\techo \"HARD\";\n\t\t$count=1;\n\t\tbreak;\n\t\t\n\t}\n\t\n}\nif($count==0)\necho \"EASY\";\n"}, {"source_code": "<?php\n\n$n = trim(fgets(STDIN));\n\n$responses = explode(\" \", trim(fgets(STDIN)));\n\nforeach($responses as $resp){\n    if($resp==1){\n        print(\"HARD\");\n        return;\n    }\n}\n\nprint(\"EASY\");\n"}, {"source_code": "<?php\n    $n=trim(fgets(STDIN));\n    $a=explode(' ',trim(fgets(STDIN)));\n    for($i=0;$i<$n;$i++){\n        $s+=$a[$i];\n    }\n    if($s>0) echo 'HARD';\n    else echo 'EASY';"}, {"source_code": "<?php\nerror_reporting(0);\n$handle = fopen(\"php://stdin\", \"r\");\n$data = explode(\"\\n\", stream_get_contents(fopen(\"php://stdin\", \"r\")));\n$input = [];\n\nforeach ($data as $index => $line) {\n    if (strlen($line) > 0) {\n        $input[$index] = explode(\" \", trim($line));\n    }\n}\n\necho in_array(\"1\", $input[1], false) ? 'HARD': 'EASY';\n"}, {"source_code": "<?php\nfscanf(STDIN, \"%d\", $n);\n$a = explode(\" \", trim(fgets(STDIN)));\nif (in_array(1, $a))\n    echo \"HARD\";\nelse\n    echo \"EASY\";\n?>"}, {"source_code": "<?php\nerror_reporting(0);\n$n=readline();\n$k=explode(' ',readline());\nif(in_array('1',$k))\n{\n    echo 'HARD';   \n}\nelse\n{\n    echo 'EASY';\n}\n?>"}, {"source_code": "<?php\n$n = fgets(STDIN);\n$input = explode(\" \", fgets(STDIN));\n\nfor ($i = 0; $i < $n; $i++) {\n  if ($input[$i] == 1) {\n    echo \"hard\";\n    exit();\n  }\n}\n\necho \"easy\";\n\n?>\n"}, {"source_code": "<?php\n\t$n = readline();\n\t$answers = explode(' ', readline());\n\t$check = 1;\n\t\n\tfor ($i = 0; $i < $n; $i++) {\n\t    if ($answers[$i] == 0) {\n\t        $check *= 1;\n\t    } else {\n\t        $check *= 0;\n\t    }\n\t}\n\t\n\tif ($check) {\n\t    echo 'easy';\n\t} else {\n\t    echo 'hard';\n\t}\n?>"}, {"source_code": "<?php\n\n$a = trim(fgets(STDIN));\n$b = explode(\" \",  trim(fgets(STDIN)));\n$c = \"easy\";\n\nforeach ($b as $value) {\n\tif ($value == 1) {\n\t\t$c = \"HARD\";\n\t\tbreak;\n\t}\n}\necho $c;"}, {"source_code": "<?php\n/**\n * Created by PhpStorm.\n * User: Vitaly\n * Date: 22.01.2019\n * Time: 0:00\n */\n\n\nclass stdIn{var $ntxt = 0;var $nline = 0;var $arr_txt;var $arr_line;var $linex;var $liney;\n    function stdIn($local = false){if($local){$dir = fopen(\"input.txt\", 'r');}else{$dir = fopen(\"php://stdin\", 'r');}\n        $datatxt = stream_get_contents($dir);$del = Array(\"\\n\",\"\\r\",\"\\n\\r\");$data = explode(\"\\n\",$datatxt);\t$il = 0;$id = 0;\n        foreach($data as $line){if(strlen($line) > 0){$line = str_replace($del,'',$line);$dataex[] = $line;$text = explode(\" \",$line);\n            foreach($text as $txt){$arr_txt[] = $txt;$this->linex[$id] = $il;$this->liney[$il] = $id;$id++;}}$il++;}$this->arr_line = $dataex;$this->arr_txt  = $arr_txt;}\n    function G(){$ret = $this->arr_txt[$this->ntxt++];$this->nline = $this->linex[$this->ntxt];return $ret;}\n    function GL(){$this->ntxt = $this->liney[$this->nline]+1;return $this->arr_line[$this->nline++];}} /*init*/\n\n$inp = new stdIn(false);\n$n = $inp->arr_line[0];\n$a = explode(' ',$inp->arr_line[1]);\n$bool = \"easy\";\nfor($i=0;$i<$n;$i++){\n    if(strval($a[$i])==\"1\"){\n        $bool = \"hard\";\n    }\n}\necho $bool;"}, {"source_code": "<?php\nerror_reporting(0);\n$a = readline();\n$b=explode(\" \",readline());\n$one =array_count_values($b);\nif ($one[1] != 0)\n{\n\techo \"Hard\";\n}\nelse\n{\n\techo \"Easy\";\n}\n?>\n"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array_sum($b);\nif($c == 0)\n{\n     print \"EASY\";\n}\nelse\n{\n     print \"HARD\";\n}\n?>"}, {"source_code": "<?php\nini_set('error_reporting', E_ALL & ~E_NOTICE);\n\nfscanf(STDIN, \"%d\", $n);\n$a = explode(\" \", trim(fgets(STDIN)));\n\necho array_sum($a) > 0 ? \"HARD\" : \"EASY\";\n"}, {"source_code": "<?php\n    fgets(STDIN);\n    $a = explode(\" \", trim(fgets(STDIN)));\n    print(in_array(\"1\",$a)?\"HARD\":\"EASY\");\n?>"}, {"source_code": "<?php\n$n=(int)readline();\n$s=readline();\n$arr=explode(' ',$s);\n$i=0;\n$r=0;\nwhile($i!=$n){\n    if($arr[$i]==1){\n        $r=1;\n        break;\n    }\n    else{\n        $i++;\n    }\n}\nif($r==1)\necho \"HARD\";\nelse{\n    echo \"EASY\";\n}"}, {"source_code": "<?php\n    function getData () {\n        return file('php://stdin', FILE_IGNORE_NEW_LINES);\n    }\n    $result = 'EASY';\n    $data = getData();\n    $person = $data[0];\n    $personAns = explode(' ', $data[1]);\n    foreach ($personAns as $value) {\n        if ((int)$value === 1) {\n            $result = 'HARD';\n            break;\n        }\n    }\n    echo $result;\n?>"}, {"source_code": "<?php\n\n$n = readline();\n$a = explode(' ',readline());\n$e = 0;\n$h = 0;\nfor ($i=0; $i<$n; $i++) {\n  if ($a[$i]==0) {\n    $e++;\n  }\n  else {\n    $h++;\n  }\n}\nif ($h!=0) {\n  echo ('HARD');\n}\nelse {\n  echo ('EASY');\n}\n\n"}, {"source_code": "<?php\n\n$count = trim(fgets(STDIN));\n$array = explode(' ', trim(fgets(STDIN)));\n\nfor ($i = 0; $i < $count; $i++) {\n    if ($array[$i] != 0) {\n        echo \"HARD\";die();\n    }\n}\necho \"EASY\";"}, {"source_code": "<?php\n\n   $p = fgets(STDIN);\n   $o = explode(' ', fgets(STDIN));\n\n   fwrite(STDOUT, array_sum($o) > 0 ? 'HARD' : 'EASY');\n"}, {"source_code": "<?php \n\nfunction search($str) {\n  // code goes here\n  return (strpos(\"0\".$str, '1')) ? 'HARD' : 'EASY' ; \n}\n   \n// keep this function call here\n$file = fopen('php://stdin', 'r');\n// $file = fopen('input.txt', 'r');\n$num = fgets($file);\n$str = fgets($file);\necho search($str); \n?>"}, {"source_code": "<?php\n$x = readline();\n$y = readline();\nfor($i=0; $i < strlen($y); $i++)\n\tif($y[$i] == '1')\n    \tdie(\"HARD\\n\");\ndie(\"EASY\\n\");"}, {"source_code": "<?php\n$x = readline();\n$y = readline();\n$cndtn = 1;\nfor($i=0; $i < strlen($y); $i++)\n\tif($y[$i] == '1')\n\t{\n\t\techo \"HARD\\n\";\n\t\t$cndtn = 0;\n\t\tbreak;\n\t}\nif($cndtn == 1)\n\techo \"EASY\\n\";"}, {"source_code": "<?php\nfscanf(STDIN, \"%d\", $n);\n$str = \"\";\nfor ($j=0; $j<$n; $j++) {\n    $str .= \"%d \";\n}\n$i = fscanf(STDIN, $str);\n\nfor ($k=0; $k<count($i); $k++) {\n    if ($i[$k] === 1) {\n        echo \"HARD\";\n        exit;\n    }\n}\necho \"EASY\";\n?>"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d\", $n);\n    $k = 0;\n    $arr = explode(\" \", trim(fgets(STDIN)));\n        for ($i = 0; $i < $n; $i++){\n            if ($arr[$i] == 1){\n                $k++;\n            }\n        }\n        if ($k > 0){\n            echo 'HARD';\n        }\n        else echo 'EASY';"}], "negative_code": [{"source_code": "<?php\n    fscanf(STDIN, \"%d\", $n);\n    $k = 0;\n    $arr = explode(\" \", trim(fgets(STDIN)));\n        for ($i = 0; $i < $n; $i++){\n            if ($arr[$i] == 1){\n                $k++;\n            }\n        }\n        if ($k > 0){\n            echo 'HARD';\n        }\n        else echo 'YASY';"}, {"source_code": "<?php \n$w=intval(fgets(STDIN));\n$st=fgets(STDIN);\n$res = strpos($st, \"1\") ? \"HARD\" : \"EASY\";\necho $res;\n?>"}, {"source_code": "<?php \n$w=intval(fgets(STDIN));\n$st=fgets(STDIN);\nif(strstr('1', $st)){\n    $res = \"HARD\";\n}else{\n    $res = \"EASY\";\n}\necho $res;\n?>"}, {"source_code": "<?php \n$w=intval(fgets(STDIN));\n$st=fgets(STDIN);\n$res = strpos($st, \"1\") ? \"HARD\" : \"EASY\";\necho $res;\ndie;\n?>"}, {"source_code": "<?php \n$w=intval(fgets(STDIN));\n$ar=explode(' ',fgets(STDIN));\n$i = 0;\n$res = \"EAZY\";\nwhile ($i<$w) {\n    if($ar[$i] > 0){\n        $res = \"HARD\";\n    break;\n    }\n    $i++;\n}\necho $res;\n?>"}, {"source_code": "<?php\nwhile(! feof(STDIN)){\n   $var[]=fgets(STDIN);\n}\n\n$value = explode(\" \", $var[1]);\n\n$f=0;\nfor($i=0; $i < $var[0]; $i++){\n    if($value[$i]==1){echo \"hard\"; $f=1;}\n}\nif($f!=1)\necho \"easy\";\n\nfclose(STDIN);\n\n?>"}, {"source_code": "n = int(input())\na = sum(map(int, input().split()))\nif a > 0:\n    print('HARD')\nelse:\n    print('EASY')"}, {"source_code": "<?php\n/* $inputs = [];\nforeach($data as $k => $d) {\n    echo $k;\n    $inputs = array_merge($inputs, $data[$k]);\n} */\n\n$stdin = fopen(STDIN, 'r');\nwhile($line = fgets($stdin)) {\n    $line = explode(\" \", $line);\n    $data[] = $line;\n}\nfclose($stdin);\n\nprint_r($data);\n\nlist($n, $i) = $data;\n\nif (in_array(1, $i)) {\n    echo \"HARD\";\n} else {\n    echo \"EASY\";\n}"}, {"source_code": "<?php\n/* $inputs = [];\nforeach($data as $k => $d) {\n    echo $k;\n    $inputs = array_merge($inputs, $data[$k]);\n} */\n\n$stdin = fopen('php://stdin', 'r');\nwhile($line = fgets($stdin)) {\n    $line = explode(\" \", $line);\n    $data[] = $line;\n}\nfclose($stdin);\n\nprint_r($data);\n\nlist($n, $i) = $data;\n\nif (in_array(1, $i)) {\n    echo \"HARD\";\n} else {\n    echo \"EASY\";\n}"}, {"source_code": "<?php\n\n// $stdin = fopen(\"data/file.txt\", 'r');\n$stdin = file(STDIN);\n// $stdin = file(\"data/file.txt\");\n\nforeach($stdin as $line) {\n    $data[] = explode(\" \", trim($line));\n}\n\nprint_r($data);\nlist($n, $i) = $data;\n\nif (in_array(\"1\", $i)) {\n    echo \"HARD\";\n} else {\n    echo \"EASY\";\n}"}, {"source_code": "<?php\n    $n=trim(fgets(STDIN));\n    for($i=0;$i<$n;$i++)$s+=(fgets(STDIN));\n    if($s>0) echo 'HARD';\n    else echo 'EASY';"}, {"source_code": "<?php\n    $a=trim(fgets(STDIN));\n    $b=trim(fgets(STDIN));\n    $c=trim(fgets(STDIN));\n    if($a+$b+$c>0) echo 'HARD';\n    else echo 'EASY';"}, {"source_code": "<?php\n    $n=trim(fgets(STDIN));\n    for($i=0;$i<$n;$i++){\n        $s+=fgets(STDIN);\n    }\n    if($s>0) echo 'HARD';\n    else echo 'EASY';"}, {"source_code": "<?php\n    $n=trim(fgets(STDIN));\n    for($i=0;$i<$n;$i++){\n        $s+=trim(fgets(STDIN));\n    }\n    if($s>0) echo 'HARD';\n    else echo 'EASY';"}, {"source_code": "<?php\n$handle = fopen (\"php://stdin\", \"r\");\n// $line = explode(\" \", trim(fgets($handle)));\n$line = trim(fgets($handle));\nfclose($handle);\n\n$handle = fopen (\"php://stdin\", \"r\");\n$line2 = explode(\" \", trim(fgets($handle)));\nfclose($handle);\n\necho in_array(\"1\", $line2) ? 'HARD': 'EASY';\n"}, {"source_code": "<?php\n$handle = fopen (\"php://stdin\", \"r\");\n// $line = explode(\" \", trim(fgets($handle)));\n$line = trim(fgets($handle));\nfclose($handle);\n\n$handle = fopen (\"php://stdin\", \"r\");\n$line2 = explode(\" \", trim(fgets($handle)));\nfclose($handle);\n\necho in_array(\"1\", $line2, false) ? 'HARD': 'EASY';\n"}, {"source_code": "<?php\n\t$n = readline();\n\t$answers = explode(' ', readline());\n\t$check = 1;\n\t\n\tfor ($i = 0; $i < $n; $i++) {\n\t    if ($answers[$i] == 0) {\n\t        $check *= 1;\n\t    } else {\n\t        $check *= 0;\n\t    }\n\t}\n\t\n\tif ($check) {\n\t    echo 'ease';\n\t} else {\n\t    echo 'hard';\n\t}\n?>"}, {"source_code": "<?php\n\n$a = trim(fgets(STDIN));\n$b = explode(\" \",  trim(fgets(STDIN)));\n$c = \"easy\";\n\nforeach ($variable as $value) {\n\tif ($value == 1) {\n\t\t$c = \"HARD\";\n\t\tbreak;\n\t}\n}\necho $c;"}, {"source_code": "<?php\n\n$a = trim(fgets(STDIN));\n$b = explode(\" \",  trim(fgets(STDIN)));\n$c = \"HARD\";\n\nforeach ($variable as $value) {\n\tif ($value == 0) {\n\t\t$c = \"easy\";\n\t\tbreak;\n\t}\n}\necho $c;"}, {"source_code": "<?php\n/**\n * Created by PhpStorm.\n * User: Vitaly\n * Date: 22.01.2019\n * Time: 0:00\n */\n\n$str =trim(fgets(STDIN));\nvar_dump($_POST);\n$n = substr($str,0,1);\n$a = explode(' ', substr($str,2));\n$bool = \"easy\";\nfor($i=0;$i<$n;$i++){\n    if(strval($a[$i])==\"1\"){\n        $bool = \"hard\";\n    }\n}\necho $bool;"}, {"source_code": "<?php\n/**\n * Created by PhpStorm.\n * User: Vitaly\n * Date: 22.01.2019\n * Time: 0:00\n */\n\n$str =fgets(\"php://input\");\necho $str;\n$n = substr($str,0,1);\n$a = explode(' ', substr($str,2));\n$bool = \"easy\";\nfor($i=0;$i<$n;$i++){\n    if(strval($a[$i])==\"1\"){\n        $bool = \"hard\";\n    }\n}\necho $bool;"}, {"source_code": "<?php\n/**\n * Created by PhpStorm.\n * User: Vitaly\n * Date: 22.01.2019\n * Time: 0:00\n */\n\n$str =file_get_contents(\"php://input\");\necho $str;\n$n = substr($str,0,1);\n$a = explode(' ', substr($str,2));\n$bool = \"easy\";\nfor($i=0;$i<$n;$i++){\n    if(strval($a[$i])==\"1\"){\n        $bool = \"hard\";\n    }\n}\necho $bool;"}, {"source_code": "<?php\n/**\n * Created by PhpStorm.\n * User: Vitaly\n * Date: 22.01.2019\n * Time: 0:00\n */\n\n$str =trim(fgets(STDIN));\necho $str;\n$n = substr($str,0,1);\n$a = explode(' ', substr($str,2));\n$bool = \"easy\";\nfor($i=0;$i<$n;$i++){\n    if(strval($a[$i])==\"1\"){\n        $bool = \"hard\";\n    }\n}\necho $bool;"}, {"source_code": "<?php\n/**\n * Created by PhpStorm.\n * User: Vitaly\n * Date: 22.01.2019\n * Time: 0:00\n */\n\n$str =trim(fgets(STDIN));\n$n = substr($str,0,1);\n$a = explode(' ', substr($str,2));\n$bool = \"easy\";\nfor($i=0;$i<$n;$i++){\n    if(strval($a[$i])==\"1\"){\n        $bool = \"hard\";\n    }\n}\necho $bool;"}, {"source_code": "<?php\n/**\n * Created by PhpStorm.\n * User: Vitaly\n * Date: 22.01.2019\n * Time: 0:00\n */\n\n$str =trim(fgets(STDIN));\n$n = substr($str,0,1);\n$a = explode(' ', substr($str,2));\nfor($i=0;$i<$n;$i++){\n    if(strval($a[$i])==\"1\"){\n        echo \"HARD\";\n        die;\n    }\n}\necho \"EASY\";"}, {"source_code": "<?php\n/**\n * Created by PhpStorm.\n * User: Vitaly\n * Date: 22.01.2019\n * Time: 0:00\n */\n\n$str =fopen(\"php://stdin\", 'r');\n$n = substr($str,0,1);\n$a = explode(' ', substr($str,2));\n$bool = \"easy\";\nfor($i=0;$i<$n;$i++){\n    if(strval($a[$i])==\"1\"){\n        $bool = \"hard\";\n    }\n}\necho $bool;"}, {"source_code": "<?php\n/**\n * Created by PhpStorm.\n * User: Vitaly\n * Date: 22.01.2019\n * Time: 0:00\n */\n\n$str =STDIN;\necho $str;\n$n = substr($str,0,1);\n$a = explode(' ', substr($str,2));\n$bool = \"easy\";\nfor($i=0;$i<$n;$i++){\n    if(strval($a[$i])==\"1\"){\n        $bool = \"hard\";\n    }\n}\necho $bool;"}, {"source_code": "<?php\n/**\n * Created by PhpStorm.\n * User: Vitaly\n * Date: 22.01.2019\n * Time: 0:00\n */\n$str = fopen( 'php://stdin', 'r' );\n// =trim(fgets(STDIN));\necho $str;\n$n = substr($str,0,1);\n$a = explode(' ', substr($str,2));\n$bool = \"easy\";\nfor($i=0;$i<$n;$i++){\n    if(strval($a[$i])==\"1\"){\n        $bool = \"hard\";\n    }\n}\necho $bool;"}, {"source_code": "<?php\n/**\n * Created by PhpStorm.\n * User: Vitaly\n * Date: 22.01.2019\n * Time: 0:00\n */\n\n//$str =trim(fgets(STDIN));\n$str = \"3 \n0 0 1\";\n$n = substr($str,0,1);\n$a = explode(' ', substr($str,2));\n$bool = \"easy\";\nfor($i=0;$i<$n;$i++){\n    if(strval($a[$i])==\"1\"){\n        $bool = \"hard\";\n    }\n}\necho $bool;"}, {"source_code": "<?php\n/**\n * Created by PhpStorm.\n * User: Vitaly\n * Date: 22.01.2019\n * Time: 0:00\n */\nlist($n, $k) = explode(' ', trim(fgets(STDIN)));\n// =trim(fgets(STDIN));\necho $k;\n$n = substr($str,0,1);\n$a = explode(' ', substr($str,2));\n$bool = \"easy\";\nfor($i=0;$i<$n;$i++){\n    if(strval($a[$i])==\"1\"){\n        $bool = \"hard\";\n    }\n}\necho $bool;"}, {"source_code": "<?php\n/**\n * Created by PhpStorm.\n * User: Vitaly\n * Date: 22.01.2019\n * Time: 0:00\n */\n\n$str =trim(file_get_contents (STDIN));\necho $str;\n$n = substr($str,0,1);\n$a = explode(' ', substr($str,2));\n$bool = \"easy\";\nfor($i=0;$i<$n;$i++){\n    if(strval($a[$i])==\"1\"){\n        $bool = \"hard\";\n    }\n}\necho $bool;"}, {"source_code": "<?php\n/**\n * Created by PhpStorm.\n * User: Vitaly\n * Date: 22.01.2019\n * Time: 0:00\n */\n\n$str =fopen(\"php://stdin\", 'r');\necho $str;\n$n = substr($str,0,1);\n$a = explode(' ', substr($str,2));\n$bool = \"easy\";\nfor($i=0;$i<$n;$i++){\n    if(strval($a[$i])==\"1\"){\n        $bool = \"hard\";\n    }\n}\necho $bool;"}, {"source_code": "<?php\n    function getData () {\n        return file(__DIR__ . '/input.txt', FILE_IGNORE_NEW_LINES);\n    }\n    $result = 'EASY';\n    $data = getData();\n    $person = $data[0];\n    $personAns = explode(' ', $data[1]);\n    foreach ($personAns as $value) {\n        if ($value == 1) {\n            $result = 'HARD';\n            break;\n        }\n    }\n    echo '<br/>' . $result;\n?>"}, {"source_code": "<?php\n    function getData () {\n        return file(__DIR__ . '/input.txt', FILE_IGNORE_NEW_LINES);\n    }\n    $result = 'EASY';\n    $data = getData();\n    $person = $data[0];\n    $personAns = explode(' ', $data[1]);\n    foreach ($personAns as $value) {\n        if ($value == 1) {\n            $result = 'HARD';\n            break;\n        }\n    }\n    echo $result;\n?>"}, {"source_code": "<?php\n    function getCountPersons () {\n        return fgets(STDIN);\n    }\n    function getPersonAnwers () {\n        return explode(' ', fgets(STDIN));\n    }\n    $result = 'EASY';\n    $person = getCountPersons();\n    $personAns = getPersonAnwers();\n    foreach ($personAns as $value) {\n        if ($value === 1) {\n            $result = 'HARD';\n            print $result;\n            break;\n        }\n    }"}, {"source_code": "<?php\n    function getData () {\n        return file_get_contents('php://stdin', FILE_IGNORE_NEW_LINES);\n    }\n    $result = 'EASY';\n    $data = getData();\n    $person = $data[0];\n    $personAns = explode(' ', $data[1]);\n    foreach ($personAns as $value) {\n        if ($value == 1) {\n            $result = 'HARD';\n            break;\n        }\n    }\n    echo $result;\n?>"}, {"source_code": "<?php\n    function getData () {\n        return file_get_contents('php://stdin', FILE_IGNORE_NEW_LINES);\n    }\n    $result = 'EASY';\n    $data = getData();\n    $person = $data[0];\n    $personAns = explode(' ', $data[1]);\n    foreach ($personAns as $value) {\n        if ($value === 1) {\n            $result = 'HARD';\n            break;\n        }\n    }\n    echo $result;\n?>"}, {"source_code": "<?php\n    function getData () {\n        return file('php://stdin', FILE_IGNORE_NEW_LINES);\n    }\n    $result = 'EASY';\n    $data = getData();\n    $person = $data[0];\n    $personAns = explode(' ', $data[1]);\n    var_dump($personAns);\n    foreach ($personAns as $value) {\n        if ((int)$value === 1) {\n            $result = 'HARD';\n            break;\n        }\n    }\n    echo $result;\n?>"}, {"source_code": "<?php\n\n$n = readline();\n$a = explode(' ',readline());\n$e = 0;\n$h = 0;\nfor ($i=0; $i<$n; $i++) {\n  if ($a[i]==0) {\n    $e++;\n  }\n  else {\n    $h++;\n  }\n}\nif ($e>$h) {\n  echo ('easy');\n}\nelse if ($h>$e) {\n  echo ('hard');\n}\nelse {\n  echo ('unknown');\n}"}, {"source_code": "<?php\n\n$n = readline();\n$a = explode(' ',readline());\n$e = 0;\n$h = 0;\nfor ($i=0; $i<$n; $i++) {\n  if ($a[i]==0) {\n    $e++;\n  }\n  else {\n    $h++;\n  }\n}\nif ($h!=0) {\n  echo ('HARD');\n}\nelse {\n  echo ('EASY');\n}"}, {"source_code": "<?php\n\n$count = trim(fgets(STDIN));\n$array = explode(' ', trim(fgets(STDIN)));\n\nfor ($i = 0; $i < $count; $i++) {\n    if ($array[$i] !== 0) {\n        echo \"HARD\";die();\n    }\n}\necho \"EASY\";"}, {"source_code": "<?php \n\nfunction search($str) {\n  // code goes here\n  return (strpos($str, '1')) ? 'HARD' : 'EASY' ; \n}\n   \n// keep this function call here\n$file = fopen('php://stdin', 'r');\n// $file = fopen('input.txt', 'r');\n$num = fgets($file);\n$str = fgets($file);\necho search($str); \n?>"}], "src_uid": "060406cd57739d929f54b4518a7ba83e"}
{"nl": {"description": "You are given names of two days of the week.Please, determine whether it is possible that during some non-leap year the first day of some month was equal to the first day of the week you are given, while the first day of the next month was equal to the second day of the week you are given. Both months should belong to one year.In this problem, we consider the Gregorian calendar to be used. The number of months in this calendar is equal to 12. The number of days in months during any non-leap year is: 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31.Names of the days of the week are given with lowercase English letters: \"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\".", "input_spec": "The input consists of two lines, each of them containing the name of exactly one day of the week. It's guaranteed that each string in the input is from the set \"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\".", "output_spec": "Print \"YES\" (without quotes) if such situation is possible during some non-leap year. Otherwise, print \"NO\" (without quotes).", "sample_inputs": ["monday\ntuesday", "sunday\nsunday", "saturday\ntuesday"], "sample_outputs": ["NO", "YES", "YES"], "notes": "NoteIn the second sample, one can consider February 1 and March 1 of year 2015. Both these days were Sundays.In the third sample, one can consider July 1 and August 1 of year 2017. First of these two days is Saturday, while the second one is Tuesday."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = array(\"monday\" => 1, \"tuesday\" => 2, \"wednesday\" => 3, \"thursday\" => 4, \"friday\" => 5, \"saturday\" => 6, \"sunday\" => 7);\n$d = $c[$a];\n$e = $c[$b];\nif($e >= $d)\n{\n     $f = $e - $d;\n}\nelse\n{\n     $f = 7 - $d + $e;\n}\nif(($f == 0) || ($f == 2) || ($f == 3))\n{\n     print \"YES\";\n}\nelse\n{\n     print \"NO\";\n}\n?>"}, {"source_code": "<?php\n\n###### IO ######\nerror_reporting(E_ALL);\n#error_reporting(0);\n\nfunction readString($f) {\n\t$r = array(\n\t\t\"\\r\" => '',\n\t\t\"\\n\" => '',\n\t);\n\treturn strtr(fgets($f), $r);\n}\n\nfunction readNumString($f) {\n\treturn trim(fgets($f));\n}\n\nfunction stringToArray($str) {\n\treturn str_split($str);\n}\n\nfunction readNum($f, $is_int = false) {\n\t$v = readNumString($f);\n\treturn $is_int ? intval($v) : floatval($v);\n}\n\nfunction readStringExplode($f, $delimiter = ' ') {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = 'trim';\n\treturn array_map($callf, $return);\n}\n\nfunction readStringExplodeNum($f, $delimiter = ' ', $is_int = false) {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = $is_int ? 'intval' : 'floatval';\n\treturn array_map($callf, $return);\n}\n\nfunction readNumArray($f) {\n\treturn readStringExplodeNum($f, ' ', true);\n}\n\nfunction readArray($f) {\n\treturn readStringExplodeNum($f, ' ');\n}\n\nfunction readTrimString($f) {\n\treturn trim(readString($f));\n}\n\n###### /IO ######\n# for($i=0;$i<$n;$i++)\n\nfunction getAnswer($is_test = false, $f = false) {\n\tif ($is_test === false) {\n\t\t$f = STDIN;\n\t}\n\t/* begin body */\n\t$first = readString($f);\n\t$second = readString($f);\n\t\n\t$dayCount = array(31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31);\n\t$days = array('monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday');\n\t$firstIndex = array_search($first, $days);\n\tfor ($m = 0; $m < 11; $m++) {\n\t\t$diff = $dayCount[$m] % 7;\n\t\t$next = ($firstIndex + $diff) % 7;\n\t\tif ($second == $days[$next]) {\n\t\t\techo 'YES';\n\t\t\treturn;\n\t\t}\n\t}\n\techo 'NO';\n\t/* / end body */\n}\n\nif (empty($is_test))\n\tgetAnswer();"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\nif((($a == \"monday\") && ($b == \"tuesday\")) || (($a == \"tuesday\") && ($b == \"wednesday\")) || (($a == \"wednesday\") && ($b == \"thursday\")) || (($a == \"thursday\") && ($b == \"friday\")) || (($a == \"friday\") && ($b == \"saturday\")) || (($a == \"saturday\") && ($b == \"sunday\")) || (($a == \"sunday\") && ($b == \"monday\")))\n{\n     print \"NO\";\n}\nelse\n{\n     print \"YES\";\n}\n?>"}], "src_uid": "2a75f68a7374b90b80bb362c6ead9a35"}
{"nl": {"description": "A flea is sitting at one of the n hassocks, arranged in a circle, at the moment. After minute number k the flea jumps through k\u2009-\u20091 hasso\u0441ks (clockwise). For example, after the first minute the flea jumps to the neighboring hassock. You should answer: will the flea visit all the hassocks or not. We assume that flea has infinitely much time for this jumping.", "input_spec": "The only line contains single integer: 1\u2009\u2264\u2009n\u2009\u2264\u20091000 \u2014 number of hassocks.", "output_spec": "Output \"YES\" if all the hassocks will be visited and \"NO\" otherwise.", "sample_inputs": ["1", "3"], "sample_outputs": ["YES", "NO"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = range(1, $a);\n$b = array_merge($b, $b);\n$b = array_merge($b, $b);\n$c = array();\n$d = array();\n$e = 0;\nfor($x = 1; $x <= 64; $x++)\n{\n    $c = array_merge($c, $b);\n}\nfor($x = 0; $x < count($c); $x++)\n{\n    $e += $x;\n    if($c[$e] == \"\")\n    {\n        break;\n    }\n    else\n    {\n        $d[$x] = $c[$e];\n    }\n}\n$f = array_unique($d);\nif(count($f) == $a)\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\n\tfscanf(STDIN, \"%d\",$n);\n\tfor($i=0;$i<$n;$i++)\n\t\t$points[$i*($i+1)/2 % $n]=1;\n\techo $n==count($points)?\"YES\":\"NO\";\n\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = range(1, $a);\n$c = array();\n$d = array();\n$e = 0;\nfor($x = 1; $x <= 120; $x++)\n{\n    $c = array_merge($c, $b);\n}\nfor($x = 0; $x < count($c); $x++)\n{\n    $e += $x;\n    if($c[$e] == \"\")\n    {\n        break;\n    }\n    else\n    {\n        array_push($d, $c[$e]); \n    }\n}\n$f = array_unique($d);\nif(count($f) == $a)\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = range(1, $a);\n$b = array_merge($b, $b);\n$c = array();\n$d = array();\n$e = 0;\nfor($x = 1; $x <= 64; $x++)\n{\n    $c = array_merge($c, $b);\n}\nfor($x = 0; $x < count($c); $x++)\n{\n    $e += $x;\n    if($c[$e] == \"\")\n    {\n        break;\n    }\n    else\n    {\n        $d[$x] = $c[$e];\n    }\n}\n$f = array_unique($d);\nif(count($f) == $a)\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = range(1, $a);\n$c = array();\n$d = array();\n$e = 0;\nfor($x = 1; $x <= 100; $x++)\n{\n    $c = array_merge($c, $b);\n}\nfor($x = 0; $x < count($c); $x++)\n{\n    $e += $x;\n    if($c[$e] == \"\")\n    {\n        break;\n    }\n    else\n    {\n        array_push($d, $c[$e]); \n    }\n}\n$f = array_unique($d);\nif(count($f) == $a)\n{\n    print \"YES\";\n}\nelse\n{\n    print \"NO\";\n}\n?>"}], "src_uid": "4bd174a997707ed3a368bd0f2424590f"}
{"nl": {"description": "You're given a row with $$$n$$$ chairs. We call a seating of people \"maximal\" if the two following conditions hold:  There are no neighbors adjacent to anyone seated.  It's impossible to seat one more person without violating the first rule. The seating is given as a string consisting of zeros and ones ($$$0$$$ means that the corresponding seat is empty, $$$1$$$ \u2014 occupied). The goal is to determine whether this seating is \"maximal\".Note that the first and last seats are not adjacent (if $$$n \\ne 2$$$).", "input_spec": "The first line contains a single integer $$$n$$$ ($$$1 \\leq n \\leq 1000$$$)\u00a0\u2014 the number of chairs. The next line contains a string of $$$n$$$ characters, each of them is either zero or one, describing the seating.", "output_spec": "Output \"Yes\" (without quotation marks) if the seating is \"maximal\". Otherwise print \"No\". You are allowed to print letters in whatever case you'd like (uppercase or lowercase).", "sample_inputs": ["3\n101", "4\n1011", "5\n10001"], "sample_outputs": ["Yes", "No", "No"], "notes": "NoteIn sample case one the given seating is maximal.In sample case two the person at chair three has a neighbour to the right.In sample case three it is possible to seat yet another person into chair three."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = 0;\nfor($x = 0; $x < $a; $x++)\n{\n    if($b[$x] == 0)\n    {\n         $c++;\n    }\n    else\n    {\n         break;\n    }\n}\n$d = 0;\nfor($x = $a - 1; $x >= 0; $x--)\n{\n     if($b[$x] == 0)\n     {\n          $d++;\n     }\n     else\n     {\n          break;\n     }\n}\n$e = 0;\n$f = 0;\n$g = 0;\n$h = 0;\nfor($x = $c; $x <= $a - $d; $x++)\n{\n     if($b[$x] == 0)\n     {\n          $g = max($g, $h);\n          $h = 0;\n          $f++;\n     }\n     elseif($b[$x] == 1)\n     {\n          $e = max($e, $f);\n          $f = 0;\n          $h++;\n     }\n}\n$e = max($e, $f);\n$f = 0;\n$g = max($g, $h);\n$h = 0;\nif(($a == 1) && ($b[0] == 0))\n{\n     print \"No\";\n}\nelseif(($c >= 2) || ($d >= 2) || ($g >= 2) || ($e >= 3))\n{\n     print \"No\";\n}\nelse\n{\n     print \"Yes\";\n}\n?>"}, {"source_code": "<?php\n\n\n$n = fgets(STDIN);\n$str = fgets(STDIN);\n\n$str = trim($str);\n\nif ($n == 1 && $str[0] == '0') {\n    fprintf(STDOUT, \"No\");\n    return;\n}\n\nif ($n == 1 && $str[0] == '1') {\n    fprintf(STDOUT, \"Yes\");\n    return;\n}\n\nif ($str[strlen($str) - 1] == $str[strlen($str) - 2] && $str[strlen($str) - 1] == 0) {\n    fprintf(STDOUT, \"No\");\n    return;\n}\n\nif ($str[0] == $str[1] && $str[1] == 0) {\n    fprintf(STDOUT, \"No\");\n    return;\n}\n\nfor($i=0;$i<strlen($str) - 1;$i++) {\n    if ($str[$i] == $str[$i+1] && $str[$i] == 1) {\n        fprintf(STDOUT, \"No\");\n        return;\n    }\n}\n\nfor($i=0;$i<strlen($str) - 2;$i++) {\n    if ($str[$i] == $str[$i+1] && $str[$i+1] == $str[$i+2] && $str[$i] == 0) {\n        fprintf(STDOUT, \"No\");\n        return;\n    }\n}\n\nfprintf(STDOUT, \"Yes\");\n"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\nif(($a == 1) && ($b[0] == 0))\n{\n     print \"No\";\n}\nelseif(($a == 1) && ($b[0] == 1))\n{\n     print \"Yes\";\n}\nelseif($b[0] == 0)\n{\n     $c = 0;\n     $d = 0;\n     for($x = 0; $x < $a; $x++)\n     {\n          $e = $d % 2;\n          $d++;\n          if(($e == 0) && ($b[$x] == 1))\n          {\n               $c = 1;\n               break;\n          }\n          elseif(($e == 1) && ($b[$x] == 0))\n          {\n               $c = 1;\n               break;\n          }\n     }\n     if($c == 0)\n     {\n          print \"Yes\";\n     }\n     else\n     {\n          print \"No\";\n     }\n}\nelseif($b[0] == 1)\n{\n     $c = 0;\n     $d = 0;\n     for($x = 0; $x < $a; $x++)\n     {\n          $e = $d % 2;\n          $d++;\n          if(($e == 0) && ($b[$x] == 0))\n          {\n               $c = 1;\n               break;\n          }\n          elseif(($e == 1) && ($b[$x] == 1))\n          {\n               $c = 1;\n               break;\n          }\n     }\n     if($c == 0)\n     {\n          print \"Yes\";\n     }\n     else\n     {\n          print \"No\";\n     }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\nif($a == 1)\n{\n     print \"Yes\";\n}\nelseif($b[0] == 0)\n{\n     $c = 0;\n     $d = 0;\n     for($x = 0; $x < $a; $x++)\n     {\n          $e = $d % 2;\n          $d++;\n          if(($e == 0) && ($b[$x] == 1))\n          {\n               $c = 1;\n               break;\n          }\n          elseif(($e == 1) && ($b[$x] == 0))\n          {\n               $c = 1;\n               break;\n          }\n     }\n     if($c == 0)\n     {\n          print \"Yes\";\n     }\n     else\n     {\n          print \"No\";\n     }\n}\nelseif($b[0] == 1)\n{\n     $c = 0;\n     $d = 0;\n     for($x = 0; $x < $a; $x++)\n     {\n          $e = $d % 2;\n          $d++;\n          if(($e == 0) && ($b[$x] == 0))\n          {\n               $c = 1;\n               break;\n          }\n          elseif(($e == 1) && ($b[$x] == 1))\n          {\n               $c = 1;\n               break;\n          }\n     }\n     if($c == 0)\n     {\n          print \"Yes\";\n     }\n     else\n     {\n          print \"No\";\n     }\n}\n?>"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = 0;\nfor($x = 0; $x < $a; $x++)\n{\n    if($b[$x] == 0)\n    {\n         $c++;\n    }\n    else\n    {\n         break;\n    }\n}\n$d = 0;\nfor($x = $a - 1; $x >= 0; $x--)\n{\n     if($b[$x] == 0)\n     {\n          $d++;\n     }\n     else\n     {\n          break;\n     }\n}\n$e = 0;\n$f = 0;\nfor($x = $c; $x <= $a - $d; $x++)\n{\n     if($b[$x] == 0)\n     {\n          $f++;\n     }\n     else\n     {\n          $e = max($e, $f);\n          $f = 0;\n     }\n}\n$e = max($e, $f);\n$f = 0;\nif(($a == 1) && ($b[0] == 0))\n{\n     print \"No\";\n}\nelseif(($c >= 2) || ($d >= 2) || ($e >= 3))\n{\n     print \"No\";\n}\nelse\n{\n     print \"Yes\";\n}\n?>"}, {"source_code": "<?php\n\n\n$n = fgets(STDIN);\n$str = fgets(STDIN);\n\nif ($n == 1 && $str[0] == '0') {\n    fprintf(STDOUT, \"No\");\n    return;\n}\n\nif ($n == 1 && $str[0] == '1') {\n    fprintf(STDOUT, \"Yes\");\n    return;\n}\n\n\nif ($str[strlen($str) - 1] == $str[strlen($str) - 2] && $str[strlen($str) - 1] == 0) {\n    fprintf(STDOUT, \"No\");\n    return;\n}\n\nif ($str[0] == $str[1] && $str[1] == 0) {\n    fprintf(STDOUT, \"No\");\n    return;\n}\n\n$t = 0;\n\nfor($i=0;$i<strlen($str) - 1;$i++) {\n    if ($str[$i] == $str[$i+1] && $str[$i] == 1) {\n        fprintf(STDOUT, \"No\");\n        $t = 1;\n        break;\n    }\n}\n\nfor($i=0;$i<strlen($str) - 2;$i++) {\n    if ($str[$i] == $str[$i+1] && $str[$i+1] == $str[$i+2] && $str[$i] == 0) {\n        fprintf(STDOUT, \"No\");\n        $t = 1;\n        break;\n    }\n}\n\nif ($t == 0) {\n    fprintf(STDOUT, \"Yes\");\n}"}, {"source_code": "<?php\n\n\n$n = fgets(STDIN);\n$str = fgets(STDIN);\n\n$str = trim($str);\n\nif ($n == 1 && $str[0] == '0') {\n    fprintf(STDOUT, \"No\");\n    return;\n}\n\nif ($n == 1 && $str[0] == '1') {\n    fprintf(STDOUT, \"Yes\");\n    return;\n}\n\nif ($str[strlen($str) - 1] == $str[strlen($str) - 2] && $str[strlen($str) - 1] == 0) {\n    fprintf(STDOUT, \"No\");\n    return;\n}\n\nif ($str[0] == $str[1] && $str[1] == 0) {\n    fprintf(STDOUT, \"No\");\n    return;\n}\n\n$t = 0;\n\nfor($i=0;$i<strlen($str) - 1;$i++) {\n    if ($str[$i] == $str[$i+1] && $str[$i] == 1) {\n        fprintf(STDOUT, \"No\");\n        $t = 1;\n        break;\n    }\n}\n\nfor($i=0;$i<strlen($str) - 2;$i++) {\n    if ($str[$i] == $str[$i+1] && $str[$i+1] == $str[$i+2] && $str[$i] == 0) {\n        fprintf(STDOUT, \"No\");\n        $t = 1;\n        break;\n    }\n}\n\nif ($t == 0) {\n    fprintf(STDOUT, \"Yes\");\n}"}, {"source_code": "<?php\n\n\n$n = fgets(STDIN);\n$str = fgets(STDIN);\n\nif ($n == 1 && $str[0] == '0') {\n    fprintf(STDOUT, \"No\");\n    return;\n}\n\nif ($n == 1 && $str[0] == '1') {\n    fprintf(STDOUT, \"Yes\");\n    return;\n}\n\nif ($str[strlen($str) - 1] == $str[strlen($str) - 2] && $str[strlen($str) - 1] == 0) {\n    fprintf(STDOUT, \"No\");\n    return;\n}\n\nif ($str[0] == $str[1] && $str[1] == 0) {\n    fprintf(STDOUT, \"No\");\n    return;\n}\n\n$t = 0;\n\nfor($i=0;$i<strlen($str) - 1;$i++) {\n    if ($str[$i] == $str[$i+1] && $str[$i] == 1) {\n        fprintf(STDOUT, \"No\");\n        $t = 1;\n        break;\n    }\n}\n\nfor($i=0;$i<strlen($str) - 2;$i++) {\n    if ($str[$i] == $str[$i+1] && $str[$i+1] == $str[$i+2] && $str[$i] == 0) {\n        fprintf(STDOUT, \"No\");\n        $t = 1;\n        break;\n    }\n}\n\nif ($t == 0) {\n    fprintf(STDOUT, \"Yes\");\n}"}, {"source_code": "<?php\n\n\n$n = fgets(STDIN);\n$str = fgets(STDIN);\n\nif ($n == 1 && $str[0] == '0') {\n    fprintf(STDOUT, \"No\");\n    return;\n}\n\n$t = 0;\n\nfor($i=0;$i<strlen($str) - 1;$i++) {\n    if ($str[$i] == $str[$i+1]) {\n        fprintf(STDOUT, \"No\");\n        $t = 1;\n        break;\n    }\n}\n\nif ($t == 0) {\n    fprintf(STDOUT, \"Yes\");\n}"}], "src_uid": "c14d255785b1f668d04b0bf6dcadf32d"}
{"nl": {"description": "Last week, Hamed learned about a new type of equations in his math class called Modular Equations. Lets define i modulo j as the remainder of division of i by j and denote it by . A Modular Equation, as Hamed's teacher described, is an equation of the form  in which a and b are two non-negative integers and x is a variable. We call a positive integer x for which  a solution of our equation.Hamed didn't pay much attention to the class since he was watching a movie. He only managed to understand the definitions of these equations.Now he wants to write his math exercises but since he has no idea how to do that, he asked you for help. He has told you all he knows about Modular Equations and asked you to write a program which given two numbers a and b determines how many answers the Modular Equation  has.", "input_spec": "In the only line of the input two space-separated integers a and b (0\u2009\u2264\u2009a,\u2009b\u2009\u2264\u2009109) are given.", "output_spec": "If there is an infinite number of answers to our equation, print \"infinity\" (without the quotes). Otherwise print the number of solutions of the Modular Equation .", "sample_inputs": ["21 5", "9435152 272", "10 10"], "sample_outputs": ["2", "282", "infinity"], "notes": "NoteIn the first sample the answers of the Modular Equation are 8 and 16 since "}, "positive_code": [{"source_code": "<?PHP\n$fileIN = fopen(\"php://stdin\", \"r\");\n$fileOUT = fopen(\"php://stdout\", \"w\");\n\n$dataIN = explode(\" \", trim(fgets($fileIN)));\n\nif ($dataIN[0] == $dataIN[1]) {\n    fprintf($fileOUT, \"infinity \\n\");\n} else if ($dataIN[0] < $dataIN[1]) {\n    fprintf($fileOUT, \"0 \\n\");\n} else {\n    $rs = 0;\n    $a = $dataIN[0];\n    $b = $dataIN[1];\n    $d = $a - $b;\n    for ($i = 1; $i * $i <= $d; ++$i) {\n        if ($d % $i == 0) {\n            $j = floor($d / $i);\n            if ($a % $i == $b) {\n                $rs++;\n            }\n            if ($a % $j == $b) {\n                $rs++;\n            }\n            if ($i == $j && $i > $b) {\n                $rs--;\n            }\n        }\n    }\n    fprintf($fileOUT, $rs);\n    //echo $rs;\n}\n\nfclose($fileIN);\nfclose($fileOUT);\n?>\n"}, {"source_code": "<?php\nlist ($a, $b) = explode(\" \", trim(fgets(STDIN)));\n\nfunction all_divisors($n) {\n  $divs = array();\n  for ($i = 2; $i <= sqrt($n); ) {\n    if ($n % $i == 0) {\n      @$divs[$i]++;\n      $n /= $i;\n    } else {\n      $i++;\n    }\n  }\n  if ($n != 1 || empty($divs)) {\n    @$divs[$n]++;\n  }\n  return $divs;\n}\n\nfunction next_comb(&$comb, $orders, $pos = 0) {\n  if ($pos >= count($comb)) {\n    return false;\n  }\n  $comb[$pos]++;\n  if ($comb[$pos] > $orders[$pos]) {\n    $comb[$pos] = 0;\n    return next_comb($comb, $orders, $pos + 1);\n  }\n  return true;\n}\n\nif ($a == $b) {\n  echo \"infinity\\n\";\n} elseif ($b > $a) {\n  echo \"0\\n\";\n} elseif ($a == 1 && $b == 0) {\n  echo \"1\\n\"; // fuck :) too lazy to actually fix\n} else {\n  $divs = all_divisors($a - $b);\n  $divisors = array_keys($divs);\n  $orders = array_values($divs);\n  $comb = array_fill(0, count($divs), 0);\n  $ok = 0;\n  do {\n    $tryN = 1;\n    foreach ($comb as $i => $count) {\n      $tryN *= pow($divisors[$i], $count);\n    }\n    if ($tryN > $b) {\n      $ok++;\n    }\n  } while (next_comb($comb, $orders));\n  echo \"$ok\\n\";\n}\n\n"}, {"source_code": "<?php\n$input = explode(\" \", trim(fgets(STDIN)));\n$a = $input[0];\n$b = $input[1];\nif ($a == $b) {\n    echo \"infinity\";\n} else {\n    $c = $a-$b;\n    $k = 0;\n    for ($i=1; $i*$i<=$c; $i++) {\n        if ($c%$i == 0) {\n            $k += ($i*$i == $c) ? ($i>$b) : ($i>$b)+(($c/$i)>$b);\n        }\n    }\n    echo $k;\n}\n?>"}, {"source_code": "<?php\nlist($a,$b) = explode(\" \", trim(fgets(STDIN)));\nif ($a == $b) {\n    echo \"infinity\";\n} else {\n    $a -= $b;\n    for ($i=1; $i*$i<=$a; $i++) {\n        if (!($a%$i)) {\n            if ($i*$i == $a) {\n                $o += ($i>$b);\n            } else {\n                $o += ($i>$b)+((int)($a/$i)>$b);\n            }\n        }\n    }\n    printf(\"%d\\n\",$o);\n}\n?>"}, {"source_code": "<?php\n\tlist($a,$b) = explode(\" \", trim(fgets(STDIN)));\n    if($a==$b){\n        printf(\"infinity\\n\");\n        exit;\n    }\n    $a-=$b;\n    for($i=1;$i*$i<=$a;$i++)\n\t\tif(!($a%$i)){\n\t\t\tif($i*$i==$a)\n\t\t\t\t$ans+=($i>$b);\n\t\t\telse\n\t\t\t\t$ans+=($i>$b)+((int)($a/$i)>$b);\n\t\t}\n    printf(\"%d\\n\",$ans);\n?>"}], "negative_code": [{"source_code": "<?PHP\n$fileIN = fopen(\"php://stdin\", \"r\");\n$fileOUT = fopen(\"php://stdout\", \"w\");\n\n$dataIN = explode(\" \", trim(fgets($fileIN)));\n\n$rs = 0;\n\nif ($dataIN[0] == $dataIN[1]) {\n    fprintf($fileOUT, \"infinity \\n\");\n} else if ($data[0] < $data[1]) {\n    fprintf($fileOUT, \"0 \\n\");\n} else {\n    $d = $a - $b;\n    for ($i = 1; $i * $i <= $d; ++$i) {\n        if ($d % $i == 0) {\n            $j = $d / $i;\n            if ($a % $i == $b) {\n                $rs++;\n            }\n            if ($a % $j == $b) {\n                $rs++;\n            }\n            if ($i == $j && $i > $b) {\n                $rs--;\n            }\n        }\n    }\n}\n\nfprintf($fileOUT, $rs);\n\nfclose($fileIN);\nfclose($fileOUT);\n?>\n"}, {"source_code": "<?PHP\n$fileIN = fopen(\"php://stdin\", \"r\");\n$fileOUT = fopen(\"php://stdout\", \"w\");\n\n$dataIN = explode(\" \", trim(fgets($fileIN)));\n\n$rs = 0;\n\nif ($dataIN[0] == $dataIN[1]) {\n    fprintf($fileOUT, \"infinity \\n\");\n} else if ($data[0] < $data[1]) {\n    fprintf($fileOUT, \"0 \\n\");\n} else {\n    $a = $data[0];\n    $b = $data[1];\n    $d = $a - $b;\n    for ($i = 1; $i * $i <= $d; ++$i) {\n        if ($d % $i == 0) {\n            $j = floor($d / $i);\n            if ($a % $i == $b) {\n                $rs++;\n            }\n            if ($a % $j == $b) {\n                $rs++;\n            }\n            if ($i == $j && $i > $b) {\n                $rs--;\n            }\n        }\n    }\n    fprintf($fileOUT, $rs);\n}\n\nfclose($fileIN);\nfclose($fileOUT);\n?>\n"}, {"source_code": "<?PHP\n$fileIN = fopen(\"in.txt\", \"r\");\n$fileOUT = fopen(\"out.txt\", \"w\");\n\n$dataIN = explode(\" \", trim(fgets($fileIN)));\n\nif ($dataIN[0] == $dataIN[1]) {\n    fprintf($fileOUT, \"infinity \\n\");\n} else if ($dataIN[0] < $dataIN[1]) {\n    fprintf($fileOUT, \"0 \\n\");\n} else {\n    $rs = 0;\n    $a = $dataIN[0];\n    $b = $dataIN[1];\n    $d = $a - $b;\n    for ($i = 1; $i * $i <= $d; ++$i) {\n        if ($d % $i == 0) {\n            $j = floor($d / $i);\n            if ($a % $i == $b) {\n                $rs++;\n            }\n            if ($a % $j == $b) {\n                $rs++;\n            }\n            if ($i == $j && $i > $b) {\n                $rs--;\n            }\n        }\n    }\n    fprintf($fileOUT, $rs);\n    //echo $rs;\n}\n\nfclose($fileIN);\nfclose($fileOUT);\n?>\n"}, {"source_code": "<?PHP\n$fileIN = fopen(\"php://stdin\", \"r\");\n$fileOUT = fopen(\"php://stdout\", \"w\");\n\n$dataIN = explode(\" \", trim(fgets($fileIN)));\n\n$rs = 0;\n\nif ($dataIN[0] == $dataIN[1]) {\n    fprintf($fileOUT, \"infinity \\n\");\n} else if ($data[0] < $data[1]) {\n    fprintf($fileOUT, \"0 \\n\");\n} else {\n    $a = $data[0];\n    $b = $data[1];\n    $d = $a - $b;\n    for ($i = 1; $i * $i <= $d; ++$i) {\n        if ($d % $i == 0) {\n            $j = $d / $i;\n            if ($a % $i == $b) {\n                $rs++;\n            }\n            if ($a % $j == $b) {\n                $rs++;\n            }\n            if ($i == $j && $i > $b) {\n                $rs--;\n            }\n        }\n    }\n}\n\nfprintf($fileOUT, $rs);\n\nfclose($fileIN);\nfclose($fileOUT);\n?>\n"}, {"source_code": "<?php\nlist ($a, $b) = explode(\" \", trim(fgets(STDIN)));\n\nfunction all_divisors($n) {\n  $divs = array();\n  for ($i = 2; $i <= sqrt($n); ) {\n    if ($n % $i == 0) {\n      @$divs[$i]++;\n      $n /= $i;\n    } else {\n      $i++;\n    }\n  }\n  if ($n != 1 || empty($divs)) {\n    @$divs[$n]++;\n  }\n  return $divs;\n}\n\nfunction next_comb(&$comb, $orders, $pos = 0) {\n  if ($pos >= count($comb)) {\n    return false;\n  }\n  $comb[$pos]++;\n  if ($comb[$pos] > $orders[$pos]) {\n    $comb[$pos] = 0;\n    return next_comb($comb, $orders, $pos + 1);\n  }\n  return true;\n}\n\nif ($a == $b) {\n  echo \"infinity\\n\";\n} elseif ($b > $a) {\n  echo \"0\\n\";\n} else {\n  $divs = all_divisors($a - $b);\n  $divisors = array_keys($divs);\n  $orders = array_values($divs);\n  $comb = array_fill(0, count($divs), 0);\n  $ok = 0;\n  do {\n    $tryN = 1;\n    foreach ($comb as $i => $count) {\n      $tryN *= pow($divisors[$i], $count);\n    }\n    if ($tryN > $b) {\n      $ok++;\n    }\n  } while (next_comb($comb, $orders));\n  echo \"$ok\\n\";\n}\n\n"}, {"source_code": "<?php\nlist($a,$b) = explode(\" \", trim(fgets(STDIN)));\nif ($a == $b) {\n    echo \"infinity\";\n} else {\n    $a -= $b;\n    for ($i=1; $i*$i<=$a; $i++) {\n        if (!($a % $i)) {\n            if($i*$i==$a) {\n                $ans+=($i>$b);\n            } else {\n                $ans += ($i>$b)+((int)($a/$i)>$b);\n            }\n        }\n    }\n    echo $ans;\n}\n?>"}, {"source_code": "<?php\nlist($a,$b) = explode(\" \", trim(fgets(STDIN)));\nif ($a == $b) {\n    echo \"infinity\";\n    exit;\n}\n    $a -= $b;\n    for ($i=1; $i*$i<=$a; $i++) {\n        if (!($a % $i)) {\n            if ($i*$i == $a) {\n                $ans += ($i>$b);\n            } else {\n                $ans += ($i>$b)+((int)($a/$i)>$b);\n            }\n        }\n    }\n    echo $ans;\n?>"}], "src_uid": "6e0715f9239787e085b294139abb2475"}
{"nl": {"description": "Every year, hundreds of people come to summer camps, they learn new algorithms and solve hard problems.This is your first year at summer camp, and you are asked to solve the following problem. All integers starting with 1 are written in one line. The prefix of these line is \"123456789101112131415...\". Your task is to print the n-th digit of this string (digits are numbered starting with 1.", "input_spec": "The only line of the input contains a single integer n (1\u2009\u2264\u2009n\u2009\u2264\u20091000)\u00a0\u2014 the position of the digit you need to print.", "output_spec": "Print the n-th digit of the line.", "sample_inputs": ["3", "11"], "sample_outputs": ["3", "0"], "notes": "NoteIn the first sample the digit at position 3 is '3', as both integers 1 and 2 consist on one digit.In the second sample, the digit at position 11 is '0', it belongs to the integer 10."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = 0;\nfor($x = 1; $x <= 1000; $x++)\n{\n     $b .= $x;\n}\nprint $b[$a];\n?>"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$num = \"12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871\";\n$n = $n - 1;\nprint substr($num, $n, 1);\n?>\n"}, {"source_code": "<?php\n\n###### IO ######\nerror_reporting(E_ALL);\nerror_reporting(0);\n\nfunction readString($f) {\n\t$r = array(\n\t\t\"\\r\" => '',\n\t\t\"\\n\" => '',\n\t);\n\treturn strtr(fgets($f), $r);\n}\n\nfunction readNumString($f) {\n\treturn trim(fgets($f));\n}\n\nfunction stringToArray($str) {\n\treturn str_split($str);\n}\n\nfunction readNum($f, $is_int = false) {\n\t$v = readNumString($f);\n\treturn $is_int ? intval($v) : floatval($v);\n}\n\nfunction readStringExplode($f, $delimiter = ' ') {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = 'trim';\n\treturn array_map($callf, $return);\n}\n\nfunction readStringExplodeNum($f, $delimiter = ' ', $is_int = false) {\n\t$v = readNumString($f);\n\tif ($delimiter == '') {\n\t\t$return = stringToArray($v);\n\t} else {\n\t\t$return = explode($delimiter, $v);\n\t}\n\t$callf = $is_int ? 'intval' : 'floatval';\n\treturn array_map($callf, $return);\n}\n\n###### /IO ######\n\nfunction getAnswer($is_test = false, $f = false) {\n\tif ($is_test === false) {\n\t\t$f = STDIN;\n\t}\n\t/* begin body */\n\t$n = readNum($f);\n\t$str = '';\n\tfor ($i = 1; $i <= 1001; $i++) {\n\t\t$str.=$i;\n\t}\n\techo $str[$n-1];\n\t/* / end body */\n}\n\nif (empty($is_test))\n\tgetAnswer();"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\nfor ($i=1;$i<=$a;$i+=1) $b.=(string)$i;\necho $b[$a-1]; \n?>"}, {"source_code": "<?php\n    $s = \"1\";\n    for($i=2;strlen($s)<1000;$i++) {\n        $s = $s . $i;\n    }\n    $n = trim(fgets(STDIN));\n    print($s[$n-1]);\n?>\n"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$cad = \"\";\nfor($i=1; $i<=1000;$i++)\n  $cad .= $i;\nprintf(\"%s\",$cad[$n - 1]);\n?>"}], "negative_code": [], "src_uid": "2d46e34839261eda822f0c23c6e19121"}
{"nl": {"description": "An elephant decided to visit his friend. It turned out that the elephant's house is located at point 0 and his friend's house is located at point x(x\u2009&gt;\u20090) of the coordinate line. In one step the elephant can move 1, 2, 3, 4 or 5 positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house.", "input_spec": "The first line of the input contains an integer x (1\u2009\u2264\u2009x\u2009\u2264\u20091\u2009000\u2009000)\u00a0\u2014 The coordinate of the friend's house.", "output_spec": "Print the minimum number of steps that elephant needs to make to get from point 0 to point x.", "sample_inputs": ["5", "12"], "sample_outputs": ["1", "3"], "notes": "NoteIn the first sample the elephant needs to make one step of length 5 to reach the point x.In the second sample the elephant can get to point x if he moves by 3, 5 and 4. There are other ways to get the optimal answer but the elephant cannot reach x in less than three moves."}, "positive_code": [{"source_code": "<?php\n$n=(int)readline();\nwhile($n%5!=0){\n    $n++;\n}\n$a=$n/5;\necho $a;\n"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = ceil($a / 5);\nprint $b;\n?>"}, {"source_code": "<?php\n\n$main = new MainClass;\n\nfscanf(STDIN, \"%d\", $n);\n\necho $main->solution($n);\n// End of interface\n\n\nclass MainClass {\n\t//617-A. Elephant\n\t//public $problemLink = 'https://codeforces.com/problemset/problem/617/A';\n\t//public $submissionLink = '';\n\n\tpublic function solution($n){\n\t\t$res = 0;\n\t\tfor ($i = 5; $i>0; $i--){\n\t\t\t$quotient = $n/$i;\n\t\t\t$intQuotient = (int) $quotient;\n\t\t\t$currentReminder = $n % $i;\n\t\t\tif ($intQuotient > 0){\n\t\t\t\t$res = $res + $intQuotient;\n\t\t\t};\n\t\t\tif ($currentReminder === 0){\n\t\t\t\tbreak;\n\t\t\t};\n\t\t\tif ($currentReminder > 0){\n\t\t\t\t$n = $currentReminder;\n\t\t\t};\n\t\t}\n\t\treturn $res;\n\t}\n}\n"}, {"source_code": "<?php\n$main = new MainClass;\n\nfscanf(STDIN, \"%d\", $n);\n\necho $main->solution($n);\n// End of interface\n\n\nclass MainClass {\n\t//617-A. Elephant\n\t//public $problemLink = 'https://codeforces.com/problemset/problem/617/A';\n\t//public $submissionLink = '';\n\n\tpublic function solution($n){\n\t\t$res = 0;\n\t\tfor ($i = 5; $i>0; $i--){\n\t\t\t$intQuotient = (int)($n/$i);\n\t\t\t$currentReminder = $n % $i;\n\t\t\tif ($intQuotient > 0){\n\t\t\t\t$res = $res + $intQuotient;\n\t\t\t};\n\t\t\tif ($currentReminder === 0){\n\t\t\t\tbreak;\n\t\t\t};\n\t\t\tif ($currentReminder > 0){\n\t\t\t\t$n = $currentReminder;\n\t\t\t};\n\t\t}\n\t\treturn $res;\n\t}\n}\n"}, {"source_code": "<?php\necho ceil(readline() / 5);"}, {"source_code": "<?php\n$length = (int) trim(fgets(STDIN));\n$steps = [5, 4, 3, 2, 1];\n\n$total = 0;\nforeach ($steps as $step) {\n    if ($length < $step) continue;\n    $temp = $length % $step;\n    $total = $total + ($length - $temp)/$step;\n    $length = $temp;\n}\necho $total;"}, {"source_code": "<?php\necho ceil(readline()/5);\n?>"}, {"source_code": "<?php\n\n$elphnt = intval(readline());\n\n$ans = 0;\n\nfor($i=5; $i>0; $i--)\n{\n\t$ans +=  intval($elphnt / $i);\n\t$elphnt %= $i;\n}\n\necho $ans.\"\\n\";"}, {"source_code": "<?php\n\n$elphnt = intval(readline());\necho ceil($elphnt/5).\"\\n\";"}, {"source_code": "<?php \n\n$n = (int) fgets(STDIN);\necho (int) ($n / 5) + (($n % 5) ? 1 : 0);"}, {"source_code": "<?php\n/*\n * Secdra @2020\n */\nfunction move($x)\n{\n    if ($x == 0) return 0;\n    if ($x >= 5) {\n        $x -= 5;\n        return move($x) + 1;\n    } else {\n        return 1;\n    }\n}\n\nfscanf(STDIN, \"%d\", $x);\nprintf(\"%d\", move($x));\n"}, {"source_code": "<?php\n/*\n * Secdra @2020\n */\nfscanf(STDIN, \"%d\", $x);\n$ans = (int)($x / 5);\nprintf(\"%d\", $ans + ((($x % 5) != 0) ? 1 : 0));\n"}, {"source_code": "<?php\n\nfunction _Fil_Dir($n){\n\t$num = 0;\n\t\n\tif($num += floor($n / 5))\n\t\t$n = $n % 5;\n\t\n\tif($num += floor($n / 4))\n\t\t$n = $n % 4;\n\t\n\tif($num += floor($n / 3))\n\t\t$n = $n % 3;\n\t\n\tif($num += floor($n / 2))\n\t\t$n = $n % 2;\n\t\n\tif($num += floor($n / 1))\n\t\t$n = $n % 1;\n\t\n\treturn $num;\n}\n\n$dir = fopen(\"php://stdin\", 'r');\necho _Fil_Dir(stream_get_contents($dir));\n\n?>"}, {"source_code": "<?php\n\techo ceil(trim(fgets(STDIN))/5);\n?>"}, {"source_code": "<?php\n\n$w = fgets(STDIN);\n\nif($w%5 == 0){$w=$w/5;}\nelse $w  = (int)(($w/5)+1);\n\n\techo $w.\"\\n\";"}, {"source_code": "<?php\n    fscanf(STDIN, \"%d\", $n);\n    $k = 1;\n       while ($n > 5){ \n        $n += - 5;\n        $k += + 1;\n       }\n       echo $k;"}, {"source_code": "<?php\n$x = trim(fgets(STDIN));\n$s = 0;\nfor ($i = 5; $i != 0; $i--) {\n    while ($x >= $i) {\n        $x -= $i;\n        $s += 1;\n    }\n}\necho $s;\n?>"}, {"source_code": "<?php\n$x = trim(fgets(STDIN));\n$s = 0;\nwhile ($x >= 5) {\n    $x -= 5;\n    $s += 1;\n}\nwhile ($x >= 4) {\n    $x -= 4;\n    $s += 1;\n}\nwhile ($x >= 3) {\n    $x -= 3;\n    $s += 1;\n}\nwhile ($x >= 2) {\n    $x -= 2;\n    $s += 1;\n}\nwhile ($x >= 1) {\n    $x -= 1;\n    $s += 1;\n}\necho $s;\n?>"}, {"source_code": "<?php\nfunction input()\n{\n    while (($line = trim(fgets(STDIN))) != PHP_EOL) {\n        yield $line;\n    }\n}\n\nfunction put($r)\n{\n    echo $r . PHP_EOL;\n}\n\n$count = 1;\nforeach (input() as $line) {\n    $dis = $line;\n    $w = 0;\n    function walk($dis,$w) {\n       if ($dis == 0) {\n           put($w);\n           die();\n       }\n\n       $i = 0;\n       if ($dis > 4) $i=5;\n       elseif ($dis > 3) $i=4;\n       elseif ($dis > 2) $i=3;\n       elseif ($dis > 1) $i=2;\n       else $i=1;\n\n       walk($dis-$i, $w+1);\n    }\n    walk($dis,$w);\n\n\n    if ((--$count) == 0) {\n        break;\n    }\n}\n"}, {"source_code": "<?php\nfunction input()\n{\n    while (($line = trim(fgets(STDIN))) != PHP_EOL) {\n        yield $line;\n    }\n}\n\nfunction put($r)\n{\n    echo $r . PHP_EOL;\n}\n\n$count = 1;\nforeach (input() as $line) {\n    $dis = $line;\n    $w = 0;\n    function walk($dis,$w) {\n       if ($dis == 0) {\n           return $w;\n       }\n\n       $i = 0;\n       if ($dis > 4) $i=5;\n       elseif ($dis > 3) $i=4;\n       elseif ($dis > 2) $i=3;\n       elseif ($dis > 1) $i=2;\n       else $i=1;\n\n       return walk($dis-$i, $w+1);\n    }\n    put(walk($dis,$w));\n\n\n    if ((--$count) == 0) {\n        break;\n    }\n}\n"}, {"source_code": "<?php\n\n$nr = trim(fgets(STDIN));\n$walk = 0;\nfor ($i = 5; $i >= 1; $i--) {\n    $walk += floor($nr / $i);\n    $nr = $nr % $i;\n}\n\necho $walk;"}, {"source_code": "<?php\necho ceil(readline() / 5);"}, {"source_code": "<?php\necho floor((readline() + 4) / 5);"}, {"source_code": "<?php\n$x = intval(fgets(STDIN));\nprint ceil($x / 5);"}, {"source_code": "<?php\n$path = trim(fgets(STDIN));\nif ($path%5==0)echo $path/5;\nelse echo (intval($path/5)+1);"}, {"source_code": "<?php\n$input=fgets(STDIN);\n$ghadam=0;\nwhile($input>=5){\n      $ghadam++;\n     @$input-=5;\n}\nwhile($input>=4){\n      $ghadam++;\n      @$input-=4;\n}\nwhile($input>=3){\n      $ghadam++;\n      @$input-=3;\n}\nwhile($input>=2){\n      $ghadam++;\n     @$input-=2;\n}\nwhile($input>=1){\n      $ghadam++;\n      @$input-=1;\n}\necho $ghadam;\n?>"}, {"source_code": "<?php\nfscanf(STDIN,\"%d\",$x);\n$res=ceil($x/5);\necho \"$res\";"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = ceil($a / 5);\nprint $b;"}, {"source_code": "<?php $a= fgets(STDIN); if($a <= 5){ echo 1;}else{$value=floor($a/5);if($value<=3){echo 3;}elseif($a%5==0){echo $value;}else{echo $value+1;}}"}, {"source_code": "<?php\n$x = trim(fgets(STDIN));\nfor($m = 1; $m <= 5; ++$m) {\n\t$move[] = ceil($x/$m);\n}\necho min($move);"}, {"source_code": "<?php\n    $n = trim(fgets(STDIN));\n    $res = ($n + 4)/5;\n    echo(floor($res));\n    \n?>"}, {"source_code": "<?php\nerror_reporting(0);\n$handle = fopen(\"php://stdin\", \"r\");\n$data = explode(\"\\n\", stream_get_contents(fopen(\"php://stdin\", \"r\")));\n$input = [];\n\nforeach ($data as $index => $line) {\n    $input[$index] = explode(\" \", trim($line));\n}\n\n// Solve past this line\n$friend = $input[0][0];\n$output = (int)($friend / 5);\n\necho $output >= 1 ? $output+($friend%5 ? 1: 0): 1;\n "}, {"source_code": "<?php\nerror_reporting(0);\n$handle = fopen(\"php://stdin\", \"r\");\n$data = explode(\"\\n\", stream_get_contents(fopen(\"php://stdin\", \"r\")));\n$input = [];\n\nforeach ($data as $index => $line) {\n    $input[$index] = explode(\" \", trim($line));\n}\n\n// Solve past this line\necho (int)(($input[0][0] + 4) / 5);\n "}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$a = floor($n / 5);\nif ($n % 5 == 0)\n    echo $a;\nelse\n    echo $a + 1;\n?>"}, {"source_code": "<?php\n\n//First Get The Input.\n$input = file_get_contents(\"php://stdin\");\n\n$our_number = 0;\n$steps = 0;\n\n//1 -> 5.\nfor($i = 5;$i >= 1;$i--) {\n    \n    while(($our_number + $i) <= $input) {\n        \n        $steps++;\n        $our_number += $i;\n        \n    }\n    \n    if($our_number == $input) {\n        \n        break;\n        \n    }\n    \n}\n\necho $steps;"}, {"source_code": "<?php\n$x=trim(fgets(STDIN));\n$hasil=$x/5;\necho ceil($hasil);\n\n?>"}, {"source_code": "<?php\n/**\n * Author: \u4e03\u67f3\u5148\u68ee\n * Date: 2016/1/25  10:45\n */\n\nfscanf(STDIN,\"%d\",$d);\n$steps = [5,4,3,2,1];\n$result = 0 ;\n\nwhile($d != 0){\n    for($i = 0 ; $i < count($steps) ; $i++){\n        $st = (int)($d/$steps[$i]);\n        $result += $st;\n        $d -= $st*$steps[$i];\n    }\n}\nfprintf(STDOUT,\"%d\",$result);"}, {"source_code": "<?php\n\nfscanf(STDIN, '%d', $x);\n$div = (int) ($x / 5);\n$mod = $x % 5;\nprintf('%d' . PHP_EOL, $div + ($mod ? 1 : 0));"}, {"source_code": "<?php\n\n$n = (int)fgets(STDIN);\n\n$answer = intval($n / 5);\n$n %= 5;\n\n$answer += intval($n / 4);\n$n %= 4;\n\n$answer += intval($n / 3);\n$n %= 3;\n\n$answer += intval($n / 2);\n$n %= 2;\n\n$answer += intval($n / 1);\n\nprint($answer);\n"}, {"source_code": "<?php\n$f = fopen( 'php://stdin', 'r' );\n$moves = 0;\nwhile( $line = fgets( $f ) ) {\n  $moves = $line;\n}\n\nfclose( $f );\n\nif ($moves < 6) {\n    echo 1;\n    die();\n}\n$rest = 0;\n$counter = 0;\nwhile($moves > 5) {\n    $moves = $moves - 5;\n    $counter ++;\n}\necho $counter + 1;\n?>"}, {"source_code": "<?php\n\n$number = (int)fgets(STDIN);\nprint_r(intdiv($number, 5) + ($number % 5 == 0 ? 0 : 1));\n"}, {"source_code": "<?php \n$x = (int) fgets(STDIN);\necho (int) ($x / 5) + (($x % 5) ? 1 : 0);"}, {"source_code": "<?php\n\tfscanf(STDIN, \"%d\", $x);\n\techo intval(($x+4)/5);\n?>"}, {"source_code": "<?php\n\n$intrare = (int)readline();\n$rez = 0;\n\nif($intrare % 5 == 0 ){\n\t$rez = (int) ($intrare/5);\n}else{\n\t$rez = (int)( $intrare/5+1);\n}\necho $rez;"}, {"source_code": "<?php\n\n$point = (int)readline();\n\n\n$array = array(5 , 4 , 3 , 2 , 1);\n\nforeach($array as $number) {\n    echo ceil((($point - ($point%$number))/$number) + ($point%$number/($number-1)));\nbreak;\n}"}], "negative_code": [{"source_code": "<?php\n$n = readline();\necho floor($n / 5) +\n     floor($n % 5 / 4) +\n     floor($n % 4 / 3) +\n     floor($n % 3 / 2) +\n     $n % 1;"}, {"source_code": "<?php \n$n = (int) fgets(STDIN);\n$step = $n / 5;\nif($n % 5 ) {\n    $step = $ste + 1;\n}\n\necho $step;"}, {"source_code": "<?php \n\n$n = (int) fgets(STDIN);\necho ($n / 5) + (($n % 5) ? 1 : 0);"}, {"source_code": "<?php\n\nfunction _Fil_Dir($n){\n\t$num = 0;\n\t\n\tif($num += floor($n / 5))\n\t\t$n = $n % 5;\n\t\n\tif($num += floor($n / 4))\n\t\t$n = $n % 4;\n\t\n\tif($num += floor($n / 3))\n\t\t$n = $n % 3;\n\t\n\tif($num += floor($n / 2))\n\t\t$n = $n % 2;\n\t\n\tif($num += floor($n / 1))\n\t\t$n = $n % 1;\n\t\n\treturn $num;\n}\n\n$dir = fopen(\"php://stdin\", 'r');\necho stream_get_contents(_Fil_Dir($dir));\n\n?>"}, {"source_code": "<?php\n\nfunction _Fil_Dir($n){\n\t$num = 0;\n\t\n\tif($num += floor($n / 5))\n\t\t$n = $n % 5;\n\t\n\tif($num += floor($n / 4))\n\t\t$n = $n % 4;\n\t\n\tif($num += floor($n / 3))\n\t\t$n = $n % 3;\n\t\n\tif($num += floor($n / 2))\n\t\t$n = $n % 2;\n\t\n\tif($num += floor($n / 1))\n\t\t$n = $n % 1;\n\t\n\treturn $num;\n}\n\n$dir = fopen(\"php://stdin\", 'r');\necho _Fil_Dir($dir);\n\n?>"}, {"source_code": "<?php\n$x = trim(fgets(STDIN));\n$s = 0;\nwhile ($x > 0) {\n    if (($x - 5) >= 0) {\n        $x -= 5;\n        $s++;\n    }\n}\nwhile ($x > 0) {\n    if (($x - 4) >= 0) {\n        $x -= 4;\n        $s++;\n    }\n}\nwhile ($x > 0) {\n    if (($x - 3) >= 0) {\n        $x -= 3;\n        $s++;\n    }\n}\nwhile ($x > 0) {\n    if (($x - 2) >= 0) {\n        $x -= 2;\n        $s++;\n    }\n}\nwhile ($x > 0) {\n    if (($x - 1) >= 0) {\n        $x -= 1;\n        $s++;\n    }\n}\n?>"}, {"source_code": "<?php\n$x = $_POST['x'];\nprint ceil($x / 5);"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$x = 0;\n$y= 0;\nwhile($x<=$a){\n    $x=$x+5;\n    $y++;\n}\n\necho $y;"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$x = 0;\n$y= 0;\nwhile($x<=$a){\n    $x=$x+5;\n    $y=$y+1;\n}\necho $y;"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$x = 0;\n$y= 0;\nwhile($x<=$a){\n    $x=$x+5;\n    $y++;\n}\necho $y;"}, {"source_code": "<?php\n$a = trim(fgets(STDIN));\n$x = 0;\n$y= 0;\ndo{\n    $x=$x+5;\n    $y++;\n}while($x<=$a);\necho $y;"}, {"source_code": "<?php $a=fgets(STDIN); if($a <= 5){return 1;}else{$value=floor($a/5);if($value<=3){return 3;}else{return $value+1;}}"}, {"source_code": "<?php $a=fgets(STDIN); if($a<=5){return 1;}"}, {"source_code": "<?php $a=fgets(STDIN); if($a <= 5){return 1;}else{$value=floor($a/5);if($value<=3){return 3;}else{return $value+1;}}"}, {"source_code": "<?php $a=fgets(STDIN); echo floor($a/5)+1;"}, {"source_code": "<?php\n$n = trim(fgets(STDIN));\n$a = floor($n / 5);\n$b = $n - ($a * 5);\necho $b + $a;\n?>"}, {"source_code": "<?php\n\n//First Get The Input.\n$input = file_get_contents(\"php://stdin\");\n\n$our_number = 0;\n$steps = 0;\n\n//1 -> 5.\nfor($i = 5;$i >= 1;$i--) {\n    \n    while(($our_number + $i) < $input) {\n        \n        $steps++;\n        $our_number += $i;\n        \n    }\n    \n    if($our_number == $input) {\n        \n        break;\n        \n    }\n    \n}\n\necho $steps;"}, {"source_code": "<?php\n$x=trim(fgets(STDIN));\n$hasil=$x/5;\necho $hasil;\n\n?>"}, {"source_code": "<?php\n$number = fgets(STDIN);\n\nif($number % 5 == 0) {\n\t$result = $number / 5;\n} elseif($number % 4 == 0) {\n\t$result = $number / 4;\n} elseif($number % 3 == 0) {\n\t$result = $number / 3;\n} elseif($number % 2 == 0) {\n\t$result = $number / 2;\n} elseif($number % 1 == 0){\n\t$result = $number / 1;\n}\n\nprint_r($result);"}, {"source_code": "<?php\n\n$point = (int)readline();\n\n\n$array = array(5 , 4 , 3 , 2 , 1);\n\nforeach($array as $number) {\n    echo (($point - ($point%$number))/$number) + ($point%$number/($number-1));\nbreak;\n}\n"}, {"source_code": "<?php\n\n$point = (int)readline();\n\n\n$array = array(5 , 4 , 3 , 2 , 1);\n\n\nforeach($array as $number) {\n\n    \n\n    if($point % $number == 0) { \n        echo $point/$number;\n        break;\n    } \n    \n}"}], "src_uid": "4b3d65b1b593829e92c852be213922b6"}
{"nl": {"description": "Yet another Armageddon is coming! This time the culprit is the Julya tribe calendar. The beavers in this tribe knew math very well. Smart Beaver, an archaeologist, got a sacred plate with a magic integer on it. The translation from Old Beaverish is as follows: \"May the Great Beaver bless you! May your chacres open and may your third eye never turn blind from beholding the Truth! Take the magic number, subtract a digit from it (the digit must occur in the number) and get a new magic number. Repeat this operation until a magic number equals zero. The Earth will stand on Three Beavers for the time, equal to the number of subtractions you perform!\"Distinct subtraction sequences can obviously get you different number of operations. But the Smart Beaver is ready to face the worst and is asking you to count the minimum number of operations he needs to reduce the magic number to zero.", "input_spec": "The single line contains the magic integer n, 0\u2009\u2264\u2009n.   to get 20 points, you need to solve the problem with constraints: n\u2009\u2264\u2009106 (subproblem C1);  to get 40 points, you need to solve the problem with constraints: n\u2009\u2264\u20091012 (subproblems C1+C2);  to get 100 points, you need to solve the problem with constraints: n\u2009\u2264\u20091018 (subproblems C1+C2+C3). ", "output_spec": "Print a single integer \u2014 the minimum number of subtractions that turns the magic number to a zero.", "sample_inputs": ["24"], "sample_outputs": ["5"], "notes": "NoteIn the first test sample the minimum number of operations can be reached by the following sequence of subtractions:  24\u2009\u2192\u200920\u2009\u2192\u200918\u2009\u2192\u200910\u2009\u2192\u20099\u2009\u2192\u20090 "}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$c = 0;\nif(($a < 10) && ($a != 0))\n{\n    print \"1\";\n}\nelseif($a == 0)\n{\n    print \"0\";\n}\nelse\n{\n    for($x = 1; $x <= 1000000; $x++)\n    {\n        $b = str_split($a);\n        rsort($b);\n        $a -= $b[0];\n        if($a < 10)\n        {\n            $c += 2;\n            break;\n        }\n        else\n        {\n            $c++;\n        }\n    }\n    print $c;\n}\n?>"}], "negative_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$c = 0;\nif($a < 10)\n{\n    print \"1\";\n}\nelse\n{\n    for($x = 1; $x <= 1000000; $x++)\n    {\n        $b = str_split($a);\n        rsort($b);\n        $a -= $b[0];\n        if($a < 10)\n        {\n            $c += 2;\n            break;\n        }\n        else\n        {\n            $c++;\n        }\n    }\n    print $c;\n}\n?>"}], "src_uid": "fc5765b9bd18dc7555fa76e91530c036"}
{"nl": {"description": "The protection of a popular program developed by one of IT City companies is organized the following way. After installation it outputs a random five digit number which should be sent in SMS to a particular phone number. In response an SMS activation code arrives.A young hacker Vasya disassembled the program and found the algorithm that transforms the shown number into the activation code. Note: it is clear that Vasya is a law-abiding hacker, and made it for a noble purpose \u2014 to show the developer the imperfection of their protection.The found algorithm looks the following way. At first the digits of the number are shuffled in the following order &lt;first digit&gt;&lt;third digit&gt;&lt;fifth digit&gt;&lt;fourth digit&gt;&lt;second digit&gt;. For example the shuffle of 12345 should lead to 13542. On the second stage the number is raised to the fifth power. The result of the shuffle and exponentiation of the number 12345 is 455\u00a0422\u00a0043\u00a0125\u00a0550\u00a0171\u00a0232. The answer is the 5 last digits of this result. For the number 12345 the answer should be 71232.Vasya is going to write a keygen program implementing this algorithm. Can you do the same?", "input_spec": "The only line of the input contains a positive integer five digit number for which the activation code should be found.", "output_spec": "Output exactly 5 digits without spaces between them \u2014 the found activation code of the program.", "sample_inputs": ["12345"], "sample_outputs": ["71232"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = $a[0];\n$c = $a[1];\n$d = $a[2];\n$e = $a[3];\n$f = $a[4];\n$g = $b . $d . $f . $e . $c;\n$h = bcpow($g, 5);\n$i = substr($h, -5);\nprint $i;\n?>"}], "negative_code": [], "src_uid": "51b1c216948663fff721c28d131bf18f"}
{"nl": {"description": "The cows have just learned what a primitive root is! Given a prime p, a primitive root  is an integer x (1\u2009\u2264\u2009x\u2009&lt;\u2009p) such that none of integers x\u2009-\u20091,\u2009x2\u2009-\u20091,\u2009...,\u2009xp\u2009-\u20092\u2009-\u20091 are divisible by p, but xp\u2009-\u20091\u2009-\u20091 is. Unfortunately, computing primitive roots can be time consuming, so the cows need your help. Given a prime p, help the cows find the number of primitive roots .", "input_spec": "The input contains a single line containing an integer p (2\u2009\u2264\u2009p\u2009&lt;\u20092000). It is guaranteed that p is a prime.", "output_spec": "Output on a single line the number of primitive roots .", "sample_inputs": ["3", "5"], "sample_outputs": ["1", "2"], "notes": "NoteThe only primitive root  is 2.The primitive roots  are 2 and 3."}, "positive_code": [{"source_code": "<?php\n    $n = trim(fgets(STDIN));\n    $rs = 0;\n    for ($i=1; $i<$n; $i++)\n    {\n        $x=$i;\n        $k=0;\n        for ($j=1; $j<$n-1 && $k==0; $j++)\n        {\n            if ((($x+$n-1) % $n) == 0)\n                $k=1;\n            $x=($x*$i) % $n;\n        }\n        if ($k==0) $rs++;\n    }\n    echo $rs;\n\n?>\n"}], "negative_code": [{"source_code": "<?php\n    $n = trim(fgets(STDIN));\n    $rs = 0;\n    for ($i=1; $i<$n; $i++)\n    {\n        $x=$i;\n        $k=0;\n        for ($j=1; $j<$n-1; $j++)\n        {\n            if ((($x+$n-1) % $n) == 0)\n                $k=1;\n            $x=($x*i) % $n;\n        }\n        if ($k==0) $rs++;\n    }\n    echo $rs;\n\n?>\n"}, {"source_code": "<?php\n    $n = trim(fgets(STDIN));\n    $rs = 0;\n    for ($i=1; $i<$n; $i++)\n    {\n        $x=$i;\n        $k=0;\n        for ($j=1; $j<$n-1; $j++)\n        {\n            if (($x+$n-1) % n == 0)\n                $k=1;\n            $x=($x*i) % n;\n        }\n        if ($k==0) $rs++;\n    }\n    echo $rs;\n?>\n"}], "src_uid": "3bed682b6813f1ddb54410218c233cff"}
{"nl": {"description": "IT City company developing computer games invented a new way to reward its employees. After a new game release users start buying it actively, and the company tracks the number of sales with precision to each transaction. Every time when the next number of sales is divisible by all numbers from 2 to 10 every developer of this game gets a small bonus.A game designer Petya knows that the company is just about to release a new game that was partly developed by him. On the basis of his experience he predicts that n people will buy the game during the first month. Now Petya wants to determine how many times he will get the bonus. Help him to know it.", "input_spec": "The only line of the input contains one integer n (1\u2009\u2264\u2009n\u2009\u2264\u20091018) \u2014 the prediction on the number of people who will buy the game.", "output_spec": "Output one integer showing how many numbers from 1 to n are divisible by all numbers from 2 to 10.", "sample_inputs": ["3000"], "sample_outputs": ["1"], "notes": null}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = bcdiv($a, 2520);\nprint $b;\n?>"}], "negative_code": [], "src_uid": "8551308e5ff435e0fc507b89a912408a"}
{"nl": {"description": "Vasya came up with his own weather forecasting method. He knows the information about the average air temperature for each of the last n days. Assume that the average air temperature for each day is integral.Vasya believes that if the average temperatures over the last n days form an arithmetic progression, where the first term equals to the average temperature on the first day, the second term equals to the average temperature on the second day and so on, then the average temperature of the next (n\u2009+\u20091)-th day will be equal to the next term of the arithmetic progression. Otherwise, according to Vasya's method, the temperature of the (n\u2009+\u20091)-th day will be equal to the temperature of the n-th day.Your task is to help Vasya predict the average temperature for tomorrow, i. e. for the (n\u2009+\u20091)-th day.", "input_spec": "The first line contains a single integer n (2\u2009\u2264\u2009n\u2009\u2264\u2009100) \u2014 the number of days for which the average air temperature is known. The second line contains a sequence of integers t1,\u2009t2,\u2009...,\u2009tn (\u2009-\u20091000\u2009\u2264\u2009ti\u2009\u2264\u20091000)\u00a0\u2014 where ti is the average temperature in the i-th day.", "output_spec": "Print the average air temperature in the (n\u2009+\u20091)-th day, which Vasya predicts according to his method. Note that the absolute value of the predicted temperature can exceed 1000.", "sample_inputs": ["5\n10 5 0 -5 -10", "4\n1 1 1 1", "3\n5 1 -5", "2\n900 1000"], "sample_outputs": ["-15", "1", "-5", "1100"], "notes": "NoteIn the first example the sequence of the average temperatures is an arithmetic progression where the first term is 10 and each following terms decreases by 5. So the predicted average temperature for the sixth day is \u2009-\u200910\u2009-\u20095\u2009=\u2009\u2009-\u200915.In the second example the sequence of the average temperatures is an arithmetic progression where the first term is 1 and each following terms equals to the previous one. So the predicted average temperature in the fifth day is 1.In the third example the average temperatures do not form an arithmetic progression, so the average temperature of the fourth day equals to the temperature of the third day and equals to \u2009-\u20095.In the fourth example the sequence of the average temperatures is an arithmetic progression where the first term is 900 and each the following terms increase by 100. So predicted average temperature in the third day is 1000\u2009+\u2009100\u2009=\u20091100."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = explode(\" \", trim(fgets(STDIN)));\n$c = array();\nfor($x = $a - 1; $x > 0; $x--)\n{\n     $d = $b[$x] - $b[$x - 1];\n     $c[count($c)] = $d;\n}\n$e = array_unique($c);\nif(count($e) == 1)\n{\n     print $b[$a - 1] + $d;\n}\nelse\n{\n     print $b[$a - 1];\n}\n?>"}], "negative_code": [], "src_uid": "d04fa4322a1b300bdf4a56f09681b17f"}
{"nl": {"description": "Catherine has a deck of n cards, each of which is either red, green, or blue. As long as there are at least two cards left, she can do one of two actions:   take any two (not necessarily adjacent) cards with different colors and exchange them for a new card of the third color;  take any two (not necessarily adjacent) cards with the same color and exchange them for a new card with that color. She repeats this process until there is only one card left. What are the possible colors for the final card?", "input_spec": "The first line of the input contains a single integer n (1\u2009\u2264\u2009n\u2009\u2264\u2009200)\u00a0\u2014 the total number of cards. The next line contains a string s of length n \u2014 the colors of the cards. s contains only the characters 'B', 'G', and 'R', representing blue, green, and red, respectively.", "output_spec": "Print a single string of up to three characters\u00a0\u2014 the possible colors of the final card (using the same symbols as the input) in alphabetical order.", "sample_inputs": ["2\nRB", "3\nGRG", "5\nBBBBB"], "sample_outputs": ["G", "BR", "B"], "notes": "NoteIn the first sample, Catherine has one red card and one blue card, which she must exchange for a green card.In the second sample, Catherine has two green cards and one red card. She has two options: she can exchange the two green cards for a green card, then exchange the new green card and the red card for a blue card. Alternatively, she can exchange a green and a red card for a blue card, then exchange the blue card and remaining green card for a red card.In the third sample, Catherine only has blue cards, so she can only exchange them for more blue cards."}, "positive_code": [{"source_code": "<?php\n$a = trim(fgets(STDIN));\n$b = trim(fgets(STDIN));\n$c = 0;\n$d = 0;\n$e = 0;\nfor($x = 0; $x < $a; $x++)\n{\n     switch($b[$x])\n     {\n          case \"B\":\n          $c++;\n          break;\n          case \"G\":\n          $d++;\n          break;\n          case \"R\":\n          $e++;\n          break;\n     }\n}\nif(($c > 0) && ($d > 0) && ($e > 0))\n{\n     print \"BGR\";\n}\nelseif(($c > 1) && ($d == 1) && ($e == 0))\n{\n     print \"GR\";\n}\nelseif(($c > 1) && ($d == 0) && ($e == 1))\n{\n     print \"GR\";\n}\nelseif(($c == 0) && ($d > 1) && ($e == 1))\n{\n     print \"BR\";\n}\nelseif(($c == 1) && ($d > 1) && ($e == 0))\n{\n     print \"BR\";\n}\nelseif(($c == 0) && ($d == 1) && ($e > 1))\n{\n     print \"BG\";\n}\nelseif(($c == 1) && ($d == 0) && ($e > 1))\n{\n     print \"BG\";\n}\nelseif(($c > 1) && ($d > 1))\n{\n     print \"BGR\";\n}\nelseif(($d > 1) && ($e > 1))\n{\n     print \"BGR\";\n}\nelseif(($c > 1) && ($e > 1))\n{\n     print \"BGR\";\n}\nelseif(($c > 0) && ($d == 0) && ($e == 0))\n{\n     print \"B\";\n}\nelseif(($c == 0) && ($d > 0) && ($e == 0))\n{\n     print \"G\";\n}\nelseif(($c == 0) && ($d == 0) && ($e > 0))\n{\n     print \"R\";\n}\nelseif(($c > 0) && ($d > 0) && ($e == 0))\n{\n     print \"R\";\n}\nelseif(($c > 0) && ($d == 0) && ($e > 0))\n{\n     print \"G\";\n}\nelseif(($c == 0) && ($d > 0) && ($e > 0))\n{\n     print \"B\";\n}\n?>"}], "negative_code": [], "src_uid": "4cedd3b70d793bc8ed4a93fc5a827f8f"}
{"nl": {"description": "Ujan has been lazy lately, but now has decided to bring his yard to good shape. First, he decided to paint the path from his house to the gate.The path consists of $$$n$$$ consecutive tiles, numbered from $$$1$$$ to $$$n$$$. Ujan will paint each tile in some color. He will consider the path aesthetic if for any two different tiles with numbers $$$i$$$ and $$$j$$$, such that $$$|j - i|$$$ is a divisor of $$$n$$$ greater than $$$1$$$, they have the same color. Formally, the colors of two tiles with numbers $$$i$$$ and $$$j$$$ should be the same if $$$|i-j| &gt; 1$$$ and $$$n \\bmod |i-j| = 0$$$ (where $$$x \\bmod y$$$ is the remainder when dividing $$$x$$$ by $$$y$$$).Ujan wants to brighten up space. What is the maximum number of different colors that Ujan can use, so that the path is aesthetic?", "input_spec": "The first line of input contains a single integer $$$n$$$ ($$$1 \\leq n \\leq 10^{12}$$$), the length of the path.", "output_spec": "Output a single integer, the maximum possible number of colors that the path can be painted in.", "sample_inputs": ["4", "5"], "sample_outputs": ["2", "5"], "notes": "NoteIn the first sample, two colors is the maximum number. Tiles $$$1$$$ and $$$3$$$ should have the same color since $$$4 \\bmod |3-1| = 0$$$. Also, tiles $$$2$$$ and $$$4$$$ should have the same color since $$$4 \\bmod |4-2| = 0$$$.In the second sample, all five colors can be used.  "}, "positive_code": [{"source_code": "<?php\n// STDIN = fopen('input.txt', 'r');\n\n$n = trim(fgets(STDIN)) + 0;\necho calc($n);\n\n\nfunction calc($n){\n\tif($n == 1){\n\t\treturn 1;\n\t} else {\n\n\t\t$check = function($div){\n\t\t\t$s = floor(sqrt($div));\n\t\t\tfor($j = 2; $j <= $s; $j++){\n\t\t\t\tif(fmod($div, $j) == 0){\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t};\n\t\t$primeDivs = [];\n\n\t\t$s = floor(sqrt($n));\n\t\tfor($div = 2; $div <= $s; $div++){\n\t\t\tif(fmod($n, $div) == 0) {\n\t\t\t\tif ($check($div)){\n\t\t\t\t\t$primeDivs[] = $div;\n\t\t\t\t\tif(count($primeDivs) == 2) {break;}\n\t\t\t\t}\n\t\t\t\t$div2 = $n / $div;\n\t\t\t\tif ($div2 != $div && $check($div2)){\n\t\t\t\t\t$primeDivs[] = $div2;\n\t\t\t\t\tif(count($primeDivs) == 2) {break;}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// echo \"\\n\".$n.' ['.implode(' ', $primeDivs).'] ';\n\t}\n\tif(count($primeDivs) == 0){\n\t\treturn $n;\n\t} else if(count($primeDivs) == 1){\n\t\treturn $primeDivs[0];\n\t} else {\n\t\treturn 1;\n\t}\n}"}], "negative_code": [{"source_code": "<?php\n// STDIN = fopen('input.txt', 'r');\n\n$n = trim(fgets(STDIN));\necho calc($n).\"\\n\";\n\n\nfunction calc($n){\n\tif($n == 1){\n\t\treturn 1;\n\t} else {\n\n\t\t$check = function($n, $div){\n\t\t\t$s = floor(sqrt($div));\n\t\t\tfor($j = 2; $j <= $s; $j++){\n\t\t\t\tif($div % $j == 0){\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t};\n\t\t$primeDivs = [];\n\n\t\t$s = floor(sqrt($n));\n\t\tfor($div = 2; $div <= $s; $div++){\n\t\t\tif($n % $div == 0) {\n\t\t\t\tif ($check($n, $div)){\n\t\t\t\t\t$primeDivs[] = $div;\n\t\t\t\t\tif(count($primeDivs) == 2) {break;}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// echo $n.' ['.implode(' ', $primeDivs).'] ';\n\t}\n\tif(count($primeDivs) == 0){\n\t\treturn $n;\n\t} else if(count($primeDivs) == 1){\n\t\treturn $primeDivs[0];\n\t} else {\n\t\treturn 1;\n\t}\n}"}, {"source_code": "<?php\n// STDIN = fopen('input.txt', 'r');\n\n$n = trim(fgets(STDIN));\necho calc($n).\"\\n\";\n\n\nfunction calc($n){\n\n\tif($n == 1){\n\t\techo 1;\n\t} else {\n\t\t$primeDivs = [];\n\t\tfor($i = 2; $i <= floor($n / 2); $i++){\n\t\t\tif($n % $i == 0 ){\n\t\t\t\t$isPrime = true;\n\t\t\t\tfor($j = 2; $j<=floor($i / 2); $j++){\n\t\t\t\t\tif($i % $j == 0){\n\t\t\t\t\t\t$isPrime = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif($isPrime){\n\t\t\t\t\t$primeDivs[] = $i;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif(count($primeDivs) == 0){\n\t\treturn $n;\n\t} else if(count($primeDivs) == 1){\n\t\treturn $primeDivs[0];\n\t} else {\n\t\treturn 1;\n\t}\n}"}, {"source_code": "<?php\n// STDIN = fopen('input.txt', 'r');\n\n$n = trim(fgets(STDIN));\necho calc($n);\n\n\nfunction calc($n){\n\tif($n == 1){\n\t\treturn 1;\n\t} else {\n\n\t\t$check = function($div){\n\t\t\t$s = floor(sqrt($div));\n\t\t\tfor($j = 2; $j <= $s; $j++){\n\t\t\t\tif($div % $j == 0){\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t};\n\t\t$primeDivs = [];\n\n\t\t$s = floor(sqrt($n));\n\t\tfor($div = 2; $div <= $s; $div++){\n\t\t\tif($n % $div == 0) {\n\t\t\t\tif ($check($div)){\n\t\t\t\t\t$primeDivs[] = $div;\n\t\t\t\t\tif(count($primeDivs) == 2) {break;}\n\t\t\t\t}\n\t\t\t\t$div2 = $n / $div;\n\t\t\t\tif ($div2 != $div && $check($div2)){\n\t\t\t\t\t$primeDivs[] = $div2;\n\t\t\t\t\tif(count($primeDivs) == 2) {break;}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// echo \"\\n\".$n.' ['.implode(' ', $primeDivs).'] ';\n\t}\n\tif(count($primeDivs) == 0){\n\t\treturn $n;\n\t} else if(count($primeDivs) == 1){\n\t\treturn $primeDivs[0];\n\t} else {\n\t\treturn 1;\n\t}\n}"}, {"source_code": "<?php\n// STDIN = fopen('input.txt', 'r');\n\n$n = trim(fgets(STDIN));\necho calc($n).\"\\n\";\n\n\nfunction calc($n){\n\tif($n == 1){\n\t\treturn 1;\n\t} else {\n\n\t\t$check = function($n, $div){\n\t\t\tfor($j = 2; $j<=floor(sqrt($div)); $j++){\n\t\t\t\tif($div % $j == 0){\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t};\n\t\t$primeDivs = [];\n\n\t\tfor($div = 2; $div <= floor(sqrt($n)); $div++){\n\t\t\tif($n % $div == 0) {\n\t\t\t\tif ($check($n, $div)){\n\t\t\t\t\t$primeDivs[] = $div;\n\t\t\t\t\tif(count($primeDivs) == 2) {break;}\n\t\t\t\t}\n\t\t\t\t$div2 = $n / $div;\n\t\t\t\tif ($div2 != $div && $check($n, $div2)){\n\t\t\t\t\t$primeDivs[] = $div2;\n\t\t\t\t\tif(count($primeDivs) == 2) {break;}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// echo $n.' ['.implode(' ', $primeDivs).'] ';\n\t}\n\tif(count($primeDivs) == 0){\n\t\treturn $n;\n\t} else if(count($primeDivs) == 1){\n\t\treturn $primeDivs[0];\n\t} else {\n\t\treturn 1;\n\t}\n}"}, {"source_code": "<?php\n// STDIN = fopen('input.txt', 'r');\n\n$n = trim(fgets(STDIN));\necho calc($n);\n\n\nfunction calc($n){\n\tif($n == 1){\n\t\treturn 1;\n\t} else {\n\n\t\t$check = function($div){\n\t\t\tfor($j = 2; $j * $j <= $div; $j++){\n\t\t\t\tif($div % $j == 0){\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t};\n\t\t$primeDivs = [];\n\n\t\tfor($div = 2; $div * $div <= $n; $div++){\n\t\t\tif($n % $div == 0) {\n\t\t\t\tif ($check($div)){\n\t\t\t\t\t$primeDivs[] = $div;\n\t\t\t\t\tif(count($primeDivs) == 2) {break;}\n\t\t\t\t}\n\t\t\t\t$div2 = $n / $div;\n\t\t\t\tif ($div2 != $div && $check($div2)){\n\t\t\t\t\t$primeDivs[] = $div2;\n\t\t\t\t\tif(count($primeDivs) == 2) {break;}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// echo \"\\n\".$n.' ['.implode(' ', $primeDivs).'] ';\n\t}\n\tif(count($primeDivs) == 0){\n\t\treturn $n;\n\t} else if(count($primeDivs) == 1){\n\t\treturn $primeDivs[0];\n\t} else {\n\t\treturn 1;\n\t}\n}"}, {"source_code": "<?php\n// STDIN = fopen('input.txt', 'r');\n\n$n = trim(fgets(STDIN));\necho calc($n);\n\n\nfunction calc($n){\n\tif($n == 1){\n\t\treturn 1;\n\t} else if($n == 1000000000000){\n\t\treturn 1; // \u041a\u0430\u043f\u0435\u0446!\n\t} else {\n\n\t\t$check = function($div){\n\t\t\tfor($j = 2; $j * $j <= $div; $j++){\n\t\t\t\tif($div % $j == 0){\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t};\n\t\t$primeDivs = [];\n\n\t\tfor($div = 2; $div * $div <= $n; $div++){\n\t\t\tif($n % $div == 0) {\n\t\t\t\tif ($check($div)){\n\t\t\t\t\t$primeDivs[] = $div;\n\t\t\t\t\tif(count($primeDivs) == 2) {break;}\n\t\t\t\t}\n\t\t\t\t$div2 = $n / $div;\n\t\t\t\tif ($div2 != $div && $check($div2)){\n\t\t\t\t\t$primeDivs[] = $div2;\n\t\t\t\t\tif(count($primeDivs) == 2) {break;}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// echo \"\\n\".$n.' ['.implode(' ', $primeDivs).'] ';\n\t}\n\tif(count($primeDivs) == 0){\n\t\treturn $n;\n\t} else if(count($primeDivs) == 1){\n\t\treturn $primeDivs[0];\n\t} else {\n\t\treturn 1;\n\t}\n}"}, {"source_code": "<?php\n// STDIN = fopen('input.txt', 'r');\n\n$n = trim(fgets(STDIN));\necho calc($n).\"\\n\";\n\n\nfunction calc($n){\n\tif($n == 1){\n\t\treturn 1;\n\t} else {\n\t\t$primeDivs = [];\n\t\tfor($i = 2; $i <= floor(sqrt($n)); $i++){\n\t\t\tif($n % $i == 0){\n\t\t\t\t$isPrime = true;\n\t\t\t\tfor($j = 2; $j<=floor(sqrt($i)); $j++){\n\t\t\t\t\tif($i % $j == 0){\n\t\t\t\t\t\t$isPrime = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif($isPrime){\n\t\t\t\t\t$primeDivs[] = $i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count($primeDivs) == 2) break;\n\t\t}\n\t\techo $n.' ['.implode(' ', $primeDivs).'] ';\n\t}\n\tif(count($primeDivs) == 0){\n\t\treturn $n;\n\t} else if(count($primeDivs) == 1){\n\t\treturn $primeDivs[0];\n\t} else {\n\t\treturn 1;\n\t}\n}"}, {"source_code": "<?php\n// STDIN = fopen('input.txt', 'r');\n\n$n = 0 + trim(fgets(STDIN));\necho calc($n);\n\n\nfunction calc($n){\n\tif($n == 1){\n\t\treturn 1;\n\t} else {\n\n\t\t$check = function($div){\n\t\t\tfor($j = 2; $j * $j <= $div; $j++){\n\t\t\t\tif($div % $j == 0){\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t};\n\t\t$primeDivs = [];\n\n\t\tfor($div = 2; $div * $div <= $n; $div++){\n\t\t\tif($n % $div == 0) {\n\t\t\t\tif ($check($div)){\n\t\t\t\t\t$primeDivs[] = $div;\n\t\t\t\t\tif(count($primeDivs) == 2) {break;}\n\t\t\t\t}\n\t\t\t\t$div2 = $n / $div;\n\t\t\t\tif ($div2 != $div && $check($div2)){\n\t\t\t\t\t$primeDivs[] = $div2;\n\t\t\t\t\tif(count($primeDivs) == 2) {break;}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// echo \"\\n\".$n.' ['.implode(' ', $primeDivs).'] ';\n\t}\n\tif(count($primeDivs) == 0){\n\t\treturn $n;\n\t} else if(count($primeDivs) == 1){\n\t\treturn $primeDivs[0];\n\t} else {\n\t\treturn 1;\n\t}\n}"}, {"source_code": "<?php\n// STDIN = fopen('input.txt', 'r');\n\n$n = trim(fgets(STDIN));\necho calc($n).\"\\n\";\n\n\nfunction calc($n){\n\tif($n == 1){\n\t\treturn 1;\n\t} else {\n\t\t$primeDivs = [];\n\t\tfor($i = 2; $i <= floor(sqrt($n)); $i++) {\n\t\t\tif ($n % $i == 0) {\n\t\t\t\t$isPrime = true;\n\t\t\t\tfor ($j = 2; $j <= floor(sqrt($i)); $j++) {\n\t\t\t\t\tif ($i % $j == 0) {\n\t\t\t\t\t\t$isPrime = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif ($isPrime) {\n\t\t\t\t\t$primeDivs[] = $i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (count($primeDivs) == 2) break;\n\t\t}\n\t}\n\tif(count($primeDivs) == 0){\n\t\treturn $n;\n\t} else if(count($primeDivs) == 1){\n\t\treturn $primeDivs[0];\n\t} else {\n\t\treturn 1;\n\t}\n}"}], "src_uid": "f553e89e267c223fd5acf0dd2bc1706b"}
{"nl": {"description": "The tram in Berland goes along a straight line from the point 0 to the point s and back, passing 1 meter per t1 seconds in both directions. It means that the tram is always in the state of uniform rectilinear motion, instantly turning around at points x\u2009=\u20090 and x\u2009=\u2009s.Igor is at the point x1. He should reach the point x2. Igor passes 1 meter per t2 seconds. Your task is to determine the minimum time Igor needs to get from the point x1 to the point x2, if it is known where the tram is and in what direction it goes at the moment Igor comes to the point x1.Igor can enter the tram unlimited number of times at any moment when his and the tram's positions coincide. It is not obligatory that points in which Igor enter and exit the tram are integers. Assume that any boarding and unboarding happens instantly. Igor can move arbitrary along the line (but not faster than 1 meter per t2 seconds). He can also stand at some point for some time.", "input_spec": "The first line contains three integers s, x1 and x2 (2\u2009\u2264\u2009s\u2009\u2264\u20091000, 0\u2009\u2264\u2009x1,\u2009x2\u2009\u2264\u2009s, x1\u2009\u2260\u2009x2)\u00a0\u2014 the maximum coordinate of the point to which the tram goes, the point Igor is at, and the point he should come to. The second line contains two integers t1 and t2 (1\u2009\u2264\u2009t1,\u2009t2\u2009\u2264\u20091000)\u00a0\u2014 the time in seconds in which the tram passes 1 meter and the time in seconds in which Igor passes 1 meter. The third line contains two integers p and d (1\u2009\u2264\u2009p\u2009\u2264\u2009s\u2009-\u20091, d is either 1 or )\u00a0\u2014 the position of the tram in the moment Igor came to the point x1 and the direction of the tram at this moment. If , the tram goes in the direction from the point s to the point 0. If d\u2009=\u20091, the tram goes in the direction from the point 0 to the point s.", "output_spec": "Print the minimum time in seconds which Igor needs to get from the point x1 to the point x2.", "sample_inputs": ["4 2 4\n3 4\n1 1", "5 4 0\n1 2\n3 1"], "sample_outputs": ["8", "7"], "notes": "NoteIn the first example it is profitable for Igor to go by foot and not to wait the tram. Thus, he has to pass 2 meters and it takes 8 seconds in total, because he passes 1 meter per 4 seconds. In the second example Igor can, for example, go towards the point x2 and get to the point 1 in 6 seconds (because he has to pass 3 meters, but he passes 1 meters per 2 seconds). At that moment the tram will be at the point 1, so Igor can enter the tram and pass 1 meter in 1 second. Thus, Igor will reach the point x2 in 7 seconds in total."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e) = explode(\" \", trim(fgets(STDIN)));\nlist($f, $g) = explode(\" \", trim(fgets(STDIN)));\n$h = (max($b, $c) - min($b, $c)) * $e;\nif($g == 1)\n{\n     if($b < $c)\n     {\n          if($f <= $b)\n          {\n               $i = ($c - $f) * $d;\n          }\n          else\n          {\n               $i = (($a - $f) + $a + $c) * $d;\n          }\n     }\n     elseif($b > $c)\n     {\n          if($f < $b)\n          {\n               $i = (($a - $f) + ($a - $c)) * $d;\n          }\n          else\n          {\n               $i = (($a - $f) + ($a - $c)) * $d;\n          }\n     }\n}\nelseif($g == -1)\n{\n     if($b < $c)\n     {\n          if($f <= $b)\n          {\n               $i = ($f + $c) * $d;\n          }\n          else\n          {\n               $i = ($f + $c) * $d;\n          }\n     }\n     elseif($b > $c)\n     {\n          if($f < $b)\n          {\n               $i = ($f + $a + ($a - $c)) * $d;\n          }\n          else\n          {\n               $i = ($f - $c) * $d;\n          }\n     }\n}\nprint min($h, $i);\n?>"}], "negative_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e) = explode(\" \", trim(fgets(STDIN)));\nlist($f, $g) = explode(\" \", trim(fgets(STDIN)));\n$h = (max($b, $c) - min($b, $c)) * $e;\nif($g == 1)\n{\n     if($b < $c)\n     {\n          if($f <= $b)\n          {\n               $i = ($c - $f) * $d;\n          }\n          else\n          {\n               $i = (($a - $f) + $a + $c) * $d;\n          }\n     }\n     elseif($b > $c)\n     {\n          if($f < $b)\n          {\n               $i = (($a - $f) + ($a - $c)) * $d;\n          }\n          elseif($f >= $b)\n          {\n               $i = (($a - $f) + ($a - $c)) * $d;\n          }\n     }\n}\nelseif($g == -1)\n{\n     if($b < $c)\n     {\n          if($f < $b)\n          {\n               $i = (($a - $f) + ($a - $c)) * $d;\n          }\n          elseif($f >= $b)\n          {\n               $i = (($a - $f) + ($a - $c)) * $d;\n          }\n     }\n     elseif($b > $c)\n     {\n          if($f <= $b)\n          {\n               $i = ($c - $f) * $d;\n          }\n          else\n          {\n               $i = (($a - $f) + $a + $c) * $d;\n          }\n     }\n}\nprint min($h, $i);\n?>"}, {"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\nlist($d, $e) = explode(\" \", trim(fgets(STDIN)));\nlist($f, $g) = explode(\" \", trim(fgets(STDIN)));\n$h = (max($b, $c) - min($b, $c)) * $e;\nif($g == 1)\n{\n     if($b < $c)\n     {\n          if($f <= $b)\n          {\n               $i = ($c - $f) * $d;\n          }\n          else\n          {\n               $i = (($a - $f) + $a + $c) * $d;\n          }\n     }\n     elseif($b > $c)\n     {\n          if($f < $b)\n          {\n               $i = (($a - $f) + ($a - $c)) * $d;\n          }\n          else\n          {\n               $i = (($a - $f) + ($a - $c)) * $d;\n          }\n     }\n}\nelseif($g == -1)\n{\n     if($b < $c)\n     {\n          if($f <= $b)\n          {\n               $i = ($f + $c) * $d;\n          }\n          else\n          {\n               $i = ($f + $c) * $d;\n          }\n     }\n     elseif($b > $c)\n     {\n          if($f < $b)\n          {\n               $i = ($f + $a + ($a - $c)) * $d;\n          }\n          else\n          {\n               $i = $f * $d;\n          }\n     }\n}\nprint min($h, $i);\n?>"}], "src_uid": "fb3aca6eba3a952e9d5736c5d8566821"}
{"nl": {"description": "Vasya has got many devices that work on electricity. He's got n supply-line filters to plug the devices, the i-th supply-line filter has ai sockets.Overall Vasya has got m devices and k electrical sockets in his flat, he can plug the devices or supply-line filters directly. Of course, he can plug the supply-line filter to any other supply-line filter. The device (or the supply-line filter) is considered plugged to electricity if it is either plugged to one of k electrical sockets, or if it is plugged to some supply-line filter that is in turn plugged to electricity. What minimum number of supply-line filters from the given set will Vasya need to plug all the devices he has to electricity? Note that all devices and supply-line filters take one socket for plugging and that he can use one socket to plug either one device or one supply-line filter.", "input_spec": "The first line contains three integers n, m, k (1\u2009\u2264\u2009n,\u2009m,\u2009k\u2009\u2264\u200950) \u2014 the number of supply-line filters, the number of devices and the number of sockets that he can plug to directly, correspondingly. The second line contains n space-separated integers a1,\u2009a2,\u2009...,\u2009an (1\u2009\u2264\u2009ai\u2009\u2264\u200950) \u2014 number ai stands for the number of sockets on the i-th supply-line filter.", "output_spec": "Print a single number \u2014 the minimum number of supply-line filters that is needed to plug all the devices to electricity. If it is impossible to plug all the devices even using all the supply-line filters, print -1.", "sample_inputs": ["3 5 3\n3 1 2", "4 7 2\n3 3 2 4", "5 5 1\n1 3 1 2 1"], "sample_outputs": ["1", "2", "-1"], "notes": "NoteIn the first test case he can plug the first supply-line filter directly to electricity. After he plug it, he get 5 (3 on the supply-line filter and 2 remaining sockets for direct plugging) available sockets to plug. Thus, one filter is enough to plug 5 devices.One of the optimal ways in the second test sample is to plug the second supply-line filter directly and plug the fourth supply-line filter to one of the sockets in the second supply-line filter. Thus, he gets exactly 7 sockets, available to plug: one to plug to the electricity directly, 2 on the second supply-line filter, 4 on the fourth supply-line filter. There's no way he can plug 7 devices if he use one supply-line filter."}, "positive_code": [{"source_code": "<?php\nlist($a, $b, $c) = explode(\" \", trim(fgets(STDIN)));\n$d = explode(\" \", trim(fgets(STDIN)));\nrsort($d);\n$e = 0;\n$f = 0;\nfor($x = 0; $x <= $a; $x++)\n{\n    if(($b > $c) && ($x == $a))\n    {\n        $f = 1;\n        break;\n    }\n    elseif($b > $c)\n    {\n        $c += $d[$e] - 1;\n        $e++;\n    }\n    else\n    {\n        break;\n    }\n}\nif($f == 1)\n{\n    print \"-1\";\n}\nelse\n{\n    print $e;\n}\n?>"}, {"source_code": "<?php\n$f = file('php://stdin');\n$f_out = fopen('php://stdout', 'w+');\n// $f = file('input.txt');\n// $f_out = fopen('output.txt', 'w+');\n$a = explode(' ', $f[0]);\n$b = explode(' ', $f[1]);\n$n = $a[0] + 0;\n$m = $a[1] + 0;\n$k = $a[2] + 0;\nforeach ($b as $key => $value) {\n\t$b[$key] += 0;\n}\nsort($b);\n$count = 0;\nfor ($i=$n-1; $i >= 0; $i--) { \n\tif ($m <= $k) break;\n\tif ($k != 0) {\n\t\t$count++;\n\t\t$k += $b[$i] - 1;\n\t} else {\n\t\tbreak;\n\t}\n}\nif ($m > $k) $count = -1;\nfwrite($f_out, $count);\nfclose($f_out);"}], "negative_code": [{"source_code": "<?php\n$f = file('php://stdin');\n$f_out = fopen('php://stdout', 'w+');\n// $f = file('input.txt');\n// $f_out = fopen('output.txt', 'w+');\n$a = explode(' ', $f[0]);\n$b = explode(' ', $f[1]);\n$n = $a[0] + 0;\n$m = $a[1] + 0;\n$k = $a[2] + 0;\nforeach ($b as $key => $value) {\n\t$b[$key] += 0;\n}\narsort($b);\n$count = 0;\nfor ($i=0; $i < $n; $i++) { \n\tif ($m <= $k) break;\n\tif ($k != 0) {\n\t\t$count++;\n\t\t$k += $b[$i] - 1;\n\t} else {\n\t\tbreak;\n\t}\n}\nif ($m > $k) $count = -1;\nfwrite($f_out, $count);\nfclose($f_out);"}, {"source_code": "<?php\n$f = file('php://stdin');\n$f_out = fopen('php://stdout', 'w+');\n// $f = file('input.txt');\n// $f_out = fopen('output.txt', 'w+');\n$a = explode(' ', $f[0]);\n$b = explode(' ', $f[1]);\n$n = $a[0] + 0;\n$m = $a[1] + 0;\n$k = $a[2] + 0;\nforeach ($b as $key => $value) {\n\t$b[$key] += 0;\n}\narsort($b);\n$count = 0;\nfor ($i=0; $i < $n; $i++) { \n\tif ($m <= $k) break;\n\tif ($k != 0) {\n\t\t$count++;\n\t\t$k += $b[$i] - 1;\n\t} else {\n\t\t$count = -1;\n\t\tbreak;\n\t}\n}\nif ($m > $k) $count = -1;\nfwrite($f_out, $count);\nfclose($f_out);"}], "src_uid": "b32ab27503ee3c4196d6f0d0f133d13c"}