Deprecated: Return type of Dotenv\Repository\AbstractRepository::offsetExists($offset) should either be compatible with ArrayAccess::offsetExists(mixed $offset): bool, or the #[\ReturnTypeWillChange] attribute should be used to temporarily suppress the notice in /home/forthrig/public_html/wp-content/plugins/anycomment/vendor/vlucas/phpdotenv/src/Repository/AbstractRepository.php on line 147

Deprecated: Return type of Dotenv\Repository\AbstractRepository::offsetGet($offset) should either be compatible with ArrayAccess::offsetGet(mixed $offset): mixed, or the #[\ReturnTypeWillChange] attribute should be used to temporarily suppress the notice in /home/forthrig/public_html/wp-content/plugins/anycomment/vendor/vlucas/phpdotenv/src/Repository/AbstractRepository.php on line 155

Deprecated: Return type of Dotenv\Repository\AbstractRepository::offsetSet($offset, $value) should either be compatible with ArrayAccess::offsetSet(mixed $offset, mixed $value): void, or the #[\ReturnTypeWillChange] attribute should be used to temporarily suppress the notice in /home/forthrig/public_html/wp-content/plugins/anycomment/vendor/vlucas/phpdotenv/src/Repository/AbstractRepository.php on line 163

Deprecated: Return type of Dotenv\Repository\AbstractRepository::offsetUnset($offset) should either be compatible with ArrayAccess::offsetUnset(mixed $offset): void, or the #[\ReturnTypeWillChange] attribute should be used to temporarily suppress the notice in /home/forthrig/public_html/wp-content/plugins/anycomment/vendor/vlucas/phpdotenv/src/Repository/AbstractRepository.php on line 171

Deprecated: Return type of PhpOption\Some::getIterator() should either be compatible with IteratorAggregate::getIterator(): Traversable, or the #[\ReturnTypeWillChange] attribute should be used to temporarily suppress the notice in /home/forthrig/public_html/wp-content/plugins/anycomment/vendor/phpoption/phpoption/src/PhpOption/Some.php on line 151

Deprecated: Return type of PhpOption\None::getIterator() should either be compatible with IteratorAggregate::getIterator(): Traversable, or the #[\ReturnTypeWillChange] attribute should be used to temporarily suppress the notice in /home/forthrig/public_html/wp-content/plugins/anycomment/vendor/phpoption/phpoption/src/PhpOption/None.php on line 118
editorial Archives | forthright48 https://forthright48.com/tag/editorial/ learning never ends Thu, 22 Nov 2018 17:23:38 +0000 en-US hourly 1 https://wordpress.org/?v=6.5.8 SPOJ ASCDFIB – Ascending Fibonacci Numbers https://forthright48.com/spoj-ascdfib-ascending-fibonacci-numbers/?utm_source=rss&utm_medium=rss&utm_campaign=spoj-ascdfib-ascending-fibonacci-numbers https://forthright48.com/spoj-ascdfib-ascending-fibonacci-numbers/#respond Thu, 22 Nov 2018 14:51:40 +0000 https://forthright48.com/?p=422 SPOJ ASCDFIB – Ascending Fibonacci Numbers is one of the earliest problems I created. This problem was used in one of the internal contests of Daffodil University. I was aiming for an easy, but a tricky problem and thus the following problem was created. Problem Read the complete description of the problem from SPOJ ASCDFIB …

The post SPOJ ASCDFIB – Ascending Fibonacci Numbers appeared first on forthright48.

]]> https://forthright48.com/spoj-ascdfib-ascending-fibonacci-numbers/feed/ 0 SPOJ LCMSUM – LCM Sum https://forthright48.com/spoj-lcmsum-lcm-sum/?utm_source=rss&utm_medium=rss&utm_campaign=spoj-lcmsum-lcm-sum https://forthright48.com/spoj-lcmsum-lcm-sum/#comments Thu, 27 Aug 2015 06:46:00 +0000 Problem Problem Link – SPOJ LCMSUM Given $n$, calculate the sum $LCM(1,n) + LCM(2,n) + … + LCM(n,n)$, where $LCM(i,n)$ denotes the Least Common Multiple of the integers $i$ and $n$. Solution I recently solved this problem and found the solution really interesting. You can find the formula that solves this problem on OEIS. I …

The post SPOJ LCMSUM – LCM Sum appeared first on forthright48.

]]> https://forthright48.com/spoj-lcmsum-lcm-sum/feed/ 12 Contest Analysis: BUET Inter-University Programming Contest – 2011, UVa 12424 – 12432 https://forthright48.com/contest-analysis-buet-inter-university-programming-contest-2011-uva-12424-12432/?utm_source=rss&utm_medium=rss&utm_campaign=contest-analysis-buet-inter-university-programming-contest-2011-uva-12424-12432 https://forthright48.com/contest-analysis-buet-inter-university-programming-contest-2011-uva-12424-12432/#comments Tue, 25 Aug 2015 16:51:00 +0000 Last week (2015-08-21) we practiced with this set. Some of the problems didn’t have proper constraints, which caused some headaches. This contest originally followed Google Code Jam format with two subproblems ( small and large ) for each problem. Each of the sub-problems had a different constraint on them. But when they uploaded it online, …

The post Contest Analysis: BUET Inter-University Programming Contest – 2011, UVa 12424 – 12432 appeared first on forthright48.

]]> https://forthright48.com/contest-analysis-buet-inter-university-programming-contest-2011-uva-12424-12432/feed/ 2 Contest Analysis: IUT 6th National ICT Fest 2014, UVa 12830 – 12839 https://forthright48.com/contest-analysis-uva-12830-12839/?utm_source=rss&utm_medium=rss&utm_campaign=contest-analysis-uva-12830-12839 https://forthright48.com/contest-analysis-uva-12830-12839/#respond Thu, 20 Aug 2015 16:44:00 +0000 I participated in this contest last year. Our team “NSU Shinobis” managed to solve 5 and placed in the top 10 ( failed to find the rank list ). The IUT 7th ICT National Fest 2015 is going to be held next month, so I thought I would try to up solve the remaining problems. …

The post Contest Analysis: IUT 6th National ICT Fest 2014, UVa 12830 – 12839 appeared first on forthright48.

]]> https://forthright48.com/contest-analysis-uva-12830-12839/feed/ 0 UVa 10407 – Simple division https://forthright48.com/uva-10407-simple-division/?utm_source=rss&utm_medium=rss&utm_campaign=uva-10407-simple-division https://forthright48.com/uva-10407-simple-division/#comments Tue, 04 Aug 2015 16:05:00 +0000 https://forthright48.com/2015/08/04/uva-10407-simple-division/ Problem Problem Link – UVa 10407 – Simple division Given an array of numbers, find the largest number $d$ such that, when elements of the array are divided by $d$, they leave the same remainder Solution We will be using our knowledge about Congruence Relation and GCD to solve this problem. But first, we need …

The post UVa 10407 – Simple division appeared first on forthright48.

]]> https://forthright48.com/uva-10407-simple-division/feed/ 3 UVa 11388 – GCD LCM https://forthright48.com/uva-11388-gcd-lcm/?utm_source=rss&utm_medium=rss&utm_campaign=uva-11388-gcd-lcm https://forthright48.com/uva-11388-gcd-lcm/#comments Mon, 03 Aug 2015 10:00:00 +0000 https://forthright48.com/2015/08/03/uva-11388-gcd-lcm/ Problem Problem Link – UVa 11388 – GCD LCM Given two positive integers $(G, L)$, we have to find a pair of integers $(a,b)$ such that $gcd(a, b)=G$ and $\text{lcm}(a, b)=L$. If there are multiple such pairs, we have to find the pair where $a$ is minimum. Also, both $a$ and $b$ needs to be …

The post UVa 11388 – GCD LCM appeared first on forthright48.

]]> https://forthright48.com/uva-11388-gcd-lcm/feed/ 4