├── 71A.php
├── lightoj1002.php
├── 1462C.php
├── 580c.php
└── 1141D.php


/71A.php:
--------------------------------------------------------------------------------
 1 | <?php
 2 | 
 3 | $n = intval(trim(fgets(STDIN)));
 4 | 
 5 | for ($i = 0; $i < $n; $i++) {
 6 |     $word = trim(fgets(STDIN));
 7 | 
 8 |     if (strlen($word) > 10) {
 9 |         $abbreviation = $word[0] . (strlen($word) - 2) . $word[strlen($word) - 1];
10 |         echo $abbreviation . PHP_EOL;
11 |     } else {
12 |         echo $word . PHP_EOL;
13 |     }
14 | }
15 | 
16 | ?>
17 | 


--------------------------------------------------------------------------------
/lightoj1002.php:
--------------------------------------------------------------------------------
 1 | <?php
 2 | 
 3 | $testCases = intval(trim(fgets(STDIN)));
 4 | 
 5 | for ($t = 1; $t <= $testCases; $t++) {
 6 |     $r = floatval(trim(fgets(STDIN))); // radius of the circle
 7 | 
 8 |     // Calculate the area of the square
 9 |     $area_square = pow(2 * $r, 2);
10 | 
11 |     // Calculate the area of the circle
12 |     $area_circle = M_PI * pow($r, 2);
13 | 
14 |     // Calculate the area of the shaded region
15 |     $shaded_area = $area_square - $area_circle;
16 | 
17 |     // Add a small value to avoid precision problems
18 |     $shaded_area += 1e-9;
19 | 
20 |     // Use printf to format the output with 2 decimal places
21 |     printf("Case %d: %.2f\n", $t, $shaded_area);
22 | }
23 | 
24 | ?>
25 | 


--------------------------------------------------------------------------------
/1462C.php:
--------------------------------------------------------------------------------
 1 | <?php
 2 | 
 3 | function find_smallest_number($x) {
 4 |     // If x is greater than 45, it's not possible to create a distinct digit number
 5 |     if ($x > 45) {
 6 |         return -1;
 7 |     }
 8 | 
 9 |     $number = '';
10 |     $digit = 9;
11 | 
12 |     while ($x > 0) {
13 |         // If x is less than the current digit, append it to the number
14 |         if ($x <= $digit) {
15 |             $number .= $x;
16 |             $x = 0;
17 |         } else {
18 |             // Otherwise, append the current digit to the number
19 |             $number .= $digit;
20 |             $x -= $digit;
21 |             $digit--;
22 |         }
23 |     }
24 | 
25 |     // Reverse the string to get the smallest number
26 |     $number = strrev($number);
27 | 
28 |     return $number;
29 | }
30 | 
31 | $testCases = intval(trim(fgets(STDIN)));
32 | 
33 | for ($t = 0; $t < $testCases; $t++) {
34 |     $x = intval(trim(fgets(STDIN)));
35 |     $result = find_smallest_number($x);
36 |     echo $result . "\n";
37 | }
38 | 
39 | ?>
40 | 


--------------------------------------------------------------------------------
/580c.php:
--------------------------------------------------------------------------------
 1 | <?php
 2 | //$file = fopen('input.in', 'r');
 3 | $file = STDIN;
 4 | list($n, $m) = explode(" ", trim(fgets($file)));
 5 | $cArray = explode(" ", trim(fgets($file)));
 6 | array_unshift($cArray, "T");
 7 | unset($cArray[0]);
 8 | $map = array();
 9 | for ($i = 1; $i < $n; $i++) {
10 |     list($x, $y) = explode(" ", trim(fgets($file)));
11 |     $map[$x][] = $y;
12 |     $map[$y][] = $x;
13 | }
14 | $result = 0;
15 | function solve($dest, $cur, $cN)
16 | {
17 |     global $result, $map, $m, $cArray;
18 |     $c = count($map[$cur]);
19 |     if ($cArray[$cur]) {
20 |         $cN++;
21 |         if ($cN>$m) {
22 |             return;
23 |         }
24 |     }else{
25 |         $cN = 0;
26 |     }
27 |     if ($c == 1 && $map[$cur][0] == $dest) {
28 |         $result++;
29 |         return;
30 |     }
31 |  
32 |     for ($i = 0; $i < $c; $i++) {
33 |         if ($map[$cur][$i] == $dest) {
34 |             continue;
35 |         }
36 |         solve($cur, $map[$cur][$i], $cN);
37 |     }
38 |  
39 | }
40 |  
41 | solve(0, 1, 0);
42 | echo $result;


--------------------------------------------------------------------------------
/1141D.php:
--------------------------------------------------------------------------------
 1 | <?php
 2 | declare(strict_types=1);
 3 | # 1141D
 4 | $start = microtime(true);
 5 | [$itemsCount] = fscanf(STDIN, '%u');
 6 |  
 7 | $pairs = [];
 8 | $result = 0;
 9 | $leftItems = $rightItems = [
10 |     'a' => [],'b' => [],'c' => [],'d' => [],'e' => [],'f' => [],'g' => [],'h' => [],'i' => [],'j' => [],'k' => [],
11 |     'l' => [],'m' => [],'n' => [],'o' => [],'p' => [],'q' => [],'r' => [],'s' => [],'t' => [],'u' => [],'v' => [],
12 |     'w' => [],'x' => [],'y' => [],'z' => [], '?' => [],
13 | ];
14 | $keys = array_keys($leftItems);
15 |  
16 | $left = fgets(STDIN);
17 | $right = fgets(STDIN);
18 | for ($i = 0, $j = 1; $i < $itemsCount; $i++, $j++) {
19 |     $leftItems[$left[$i]][] = $j;
20 |     $rightItems[$right[$i]][] = $j;
21 | }
22 | unset($left, $right);
23 |  
24 | foreach ($keys as $key) {
25 |     while ($leftItems[$key] !== [] && $rightItems[$key] !== []) {
26 |         $result++;
27 |         $pairs[] = array_pop($leftItems[$key]) . ' ' . array_pop($rightItems[$key]);
28 |     }
29 |     while ($leftItems[$key] !== [] && $rightItems['?'] !== []) {
30 |         $result++;
31 |         $pairs[] = array_pop($leftItems[$key]) . ' ' . array_pop($rightItems['?']);
32 |     }
33 |     while ($leftItems['?'] !== [] && $rightItems[$key] !== []) {
34 |         $result++;
35 |         $pairs[] = array_pop($leftItems['?']) . ' ' . array_pop($rightItems[$key]);
36 |     }
37 | }
38 | print $result . PHP_EOL . implode(PHP_EOL, $pairs);


--------------------------------------------------------------------------------