Recently Added DCS OJ Problemshttps://oj.dcs.upd.edu.ph/The latest problems added on the DCS Online Judge websiteen-usTue, 23 Jul 2024 06:00:00 +0000RE3: Number of Intersectionshttps://oj.dcs.upd.edu.ph/problem/cs11202301re3<h3>Problem Statement (40 points)</h3>
<p>Important: You are not allowed to look at the internet, consult any source (or anyone except for the instructor) regarding this question. After receiving a AC, please upload your source code using the following link: <a href="https://forms.gle/hBdQ8qqt88W2aMnN6">https://forms.gle/hBdQ8qqt88W2aMnN6</a>. The source code must be named as follows: <student number>RE2.py (i.e. 202312345RE2.py) Failure to do so may invalidate this item.</p>
<p>Given a l...Tue, 23 Jul 2024 06:00:00 +0000https://oj.dcs.upd.edu.ph/problem/cs11202301re3RE2: Pointing to the Circlehttps://oj.dcs.upd.edu.ph/problem/cs11202301re2<h3>Problem Statement (30 points)</h3>
<p>Important: You are not allowed to look at the internet, consult any source (or anyone except for the instructor) regarding this question. After receiving a AC, please upload your source code using the following link: <a href="https://forms.gle/hBdQ8qqt88W2aMnN6">https://forms.gle/hBdQ8qqt88W2aMnN6</a>. The source code must be named as follows: <student number>RE2.py (i.e. 202312345RE2.py) Failure to do so may invalidate this item.</p>
<p>Given a l...Tue, 23 Jul 2024 06:00:00 +0000https://oj.dcs.upd.edu.ph/problem/cs11202301re2RE1: Cut the circlehttps://oj.dcs.upd.edu.ph/problem/cs11202301re1<h3>Problem Statement (30 points)</h3>
<p>Important: You are not allowed to look at the internet, consult any source (or anyone except for the instructor) regarding this question. After receiving a AC, please upload your source code using the following link: <a href="https://forms.gle/hBdQ8qqt88W2aMnN6">https://forms.gle/hBdQ8qqt88W2aMnN6</a>. The source code must be named as follows: <student number>RE1.py (i.e. 202312345RE1.py) Failure to do so may invalidate this item.</p>
<p>Given a l...Tue, 23 Jul 2024 06:00:00 +0000https://oj.dcs.upd.edu.ph/problem/cs11202301re1CS 153 ME 3: Elliptic Curve Calculatorhttps://oj.dcs.upd.edu.ph/problem/cs15320242me3<h3>Problem Statement (10 points)</h3>
<h3>Input</h3>
<p>The first line in the input pertains to the Elliptic Curve parameters: a, b, N (pertaining to y^2 = x^3 + ax + b in Z*_n). The next line pertains to the number of calculations to be done. The next lines pertain to the calculations: m x y, m pertains to the scalar and x y pertains to the point in the curve. All calculations are scalar multiplication.</p>
<h3>Output</h3>
<p>The output will be the result of the calculations</p>
<h4>Sample In...Sun, 05 May 2024 08:00:00 +0000https://oj.dcs.upd.edu.ph/problem/cs15320242me3CS 153 ME 2: Scaled Down Version of DEShttps://oj.dcs.upd.edu.ph/problem/cs15320242me2<h3>Problem Statement (10 points)</h3>
<p><a href="https://docs.google.com/document/d/1PyUjUO99M2e_LyPpA4MeVb2FnvD1Y_707VQmHza6iNk/edit?usp=sharing">https://docs.google.com/document/d/1PyUjUO99M2e_LyPpA4MeVb2FnvD1Y_707VQmHza6iNk/edit?usp=sharing</a></p>
<h3>Input</h3>
<p>The first line of input pertains to the number of test cases, the subsequent lines pertain to the plaintext (8 bits) and key (10 bits) to be used.</p>
<h3>Output</h3>
<p>The output will be the resulting 8 bit ciphertext</p>
<h4>...Sun, 05 May 2024 08:00:00 +0000https://oj.dcs.upd.edu.ph/problem/cs15320242me2CS 153 ME 1: Valid RSA Parametershttps://oj.dcs.upd.edu.ph/problem/cs15320242me1<h3>Problem Statement (10 points)</h3>
<p>Note: All submissions will be subject to source code similarity tests. Source code submitted with high similarity with other submissions will be subject to a more thorough investigation.</p>
<p>Create a program that will determine whether a given set of RSA parameters forms a valid set of RSA parameters. There will be three parameters that will be provided: N = the RSA modulus, should be a semiprime, e = the RSA encryption key, must be a valid RSA encryp...Sun, 05 May 2024 08:00:00 +0000https://oj.dcs.upd.edu.ph/problem/cs15320242me1LE 6: Rotating Arrayshttps://oj.dcs.upd.edu.ph/problem/cs11202301le6<h3>Problem Statement (60 points)</h3>
<p>Important: You are not allowed to look at the internet, consult any source (or anyone except for the instructor) regarding this question. After receiving a AC, please upload your source code using the following link: <a href="https://forms.gle/hBdQ8qqt88W2aMnN6">https://forms.gle/hBdQ8qqt88W2aMnN6</a>. The source code must be named as follows: <student number>LE6.py (i.e. 202312345LE6.py) Failure to do so may invalidate this item. You are not allo...Sat, 20 Jan 2024 08:00:00 +0000https://oj.dcs.upd.edu.ph/problem/cs11202301le6LE 5: Intersecting Circleshttps://oj.dcs.upd.edu.ph/problem/cs11202301le5<h3>Problem Statement (40 points)</h3>
<p>Important: You are not allowed to look at the internet, consult any source (or anyone except for the instructor) regarding this question. After receiving a AC, please upload your source code using the following link: <a href="https://forms.gle/hBdQ8qqt88W2aMnN6">https://forms.gle/hBdQ8qqt88W2aMnN6</a>. The source code must be named as follows: <student number>LE5.py (i.e. 202312345LE5.py) Failure to do so may invalidate this item.</p>
<p>Create a ...Sat, 20 Jan 2024 08:00:00 +0000https://oj.dcs.upd.edu.ph/problem/cs11202301le5LE 4: Smallest Multiplehttps://oj.dcs.upd.edu.ph/problem/cs11202301le4<h3>Problem Statement (20 points)</h3>
<p>Important: You are not allowed to look at the internet, consult any source (or anyone except for the instructor) regarding this question. After receiving a AC, please upload your source code using the following link: <a href="https://forms.gle/hBdQ8qqt88W2aMnN6">https://forms.gle/hBdQ8qqt88W2aMnN6</a>. The source code must be named as follows: <student number>LE4.py (i.e. 202312345LE4.py) Failure to do so may invalidate this item.</p>
<p>Create a ...Sat, 20 Jan 2024 08:00:00 +0000https://oj.dcs.upd.edu.ph/problem/cs11202301le4LE 2: Counting Distinct "Two Digits"https://oj.dcs.upd.edu.ph/problem/cs11202301le3<h3>Problem Statement (40 points)</h3>
<p>Important: You are not allowed to look at the internet, or consult any source (or anyone except for the instructor) regarding this question. After receiving an AC, please upload your source code using the following link: <a href="https://forms.gle/hBdQ8qqt88W2aMnN6">https://forms.gle/hBdQ8qqt88W2aMnN6</a>. The source code must be named as follows: <student number>LE2.py (i.e.,202312345LE2.py). Failure to do so may invalidate this item.</p>
<p>Note...Sat, 11 Nov 2023 08:00:00 +0000https://oj.dcs.upd.edu.ph/problem/cs11202301le3LE 3: Overlapping Rectangleshttps://oj.dcs.upd.edu.ph/problem/cs11202301le1<h3>Problem Statement (60 points)</h3>
<p>Important: You are not allowed to look at the internet, consult any source (or anyone except for the instructor) regarding this question. After receiving a AC, please upload your source code using the following link: <a href="https://forms.gle/hBdQ8qqt88W2aMnN6">https://forms.gle/hBdQ8qqt88W2aMnN6</a>. The source code must be named as follows: <student number>LE3.py (i.e. 202312345LE3.py). Failure to do so may invalidate this item.</p>
<p>In this ...Sat, 11 Nov 2023 08:00:00 +0000https://oj.dcs.upd.edu.ph/problem/cs11202301le1LE 1: Sum of repeating digitshttps://oj.dcs.upd.edu.ph/problem/cs11202301le2<h3>Problem Statement (20 points)</h3>
<p>Important: You are not allowed to look at the internet, consult any source (or anyone except for the instructor) regarding this question. After receiving a AC, please upload your source code using the following link: <a href="https://forms.gle/hBdQ8qqt88W2aMnN6">https://forms.gle/hBdQ8qqt88W2aMnN6</a>. The source code must be named as follows: <student number>LE1.py (i.e. 202312345LE1.py) Failure to do so may invalidate this item.</p>
<p>Create a ...Sat, 11 Nov 2023 08:00:00 +0000https://oj.dcs.upd.edu.ph/problem/cs11202301le2[CS 12 23.2] Practice 4e - Snooping Stackhttps://oj.dcs.upd.edu.ph/problem/cs12232prac04e
<blockquote><p><strong>Note:</strong> The judge is not yet set up to take submissions for this problem.</p>
</blockquote>
<p>Scooby Doo has implement a generic class called <code>Stack</code>. An instance of this class represents a "last-in, first-out" data structure. Its constructor takes no arguments and calling it returns an instance representing an "empty" stack. Assuming its contents are of a generic type <code>T</code>, it has the following methods (assuming <code>s: Stack[T]</code>):</p...https://oj.dcs.upd.edu.ph/problem/cs12232prac04ePyright Test Problemhttps://oj.dcs.upd.edu.ph/problem/pyright<h4>Overview</h4>
<p>This problem is set up to walk you through submitting code through OJ that is expected to pass Pyright checking. You will be submitting code that is working as intended, but either does not pass strict Pyright checking or has Pyright warnings.</p>
<p>For this problem, you are expected to submit a function <code>repeat</code> that takes in two parameters \(s\) (<code>str</code>) and \(n\) (<code>int</code>).</p>
<p>The <code>repeat</code> function should return a <code>str</c...https://oj.dcs.upd.edu.ph/problem/pyright[CS 12 21.2] Pyret Function Practicehttps://oj.dcs.upd.edu.ph/problem/cs12212practice01<h4>Problem Statement</h4>
<p>Create a <strong>Pyret function</strong> <code>retain-above-average(pokedex :: Table) -> Table</code> that retains Pokemon rows with a "stat average" that is above average as defined in the lecture slides. Ensure that the table it returns does <strong>not</strong> have extra columns.</p>
<p><em>This problem is <strong>ungraded</strong> and is given simply for you to practice how to submit Pyret code via OJ.</em></p>
<h4>Sample Argument</h4>
<div class="codehilite...https://oj.dcs.upd.edu.ph/problem/cs12212practice01CS 150 Recursion Diagnostic Problemhttps://oj.dcs.upd.edu.ph/problem/cs150201diagnostic<h4>Problem Statement</h4>
<p>In an imaginary world not afflicted with COVID-19, you have \(A\) absences remaining in one of your classes before you are <em>forced to drop</em> from it. In the said class, having \(L\) lates is equivalent to \(1\) absence. Unfortunately, your previous class (from which you cannot leave early) is on the opposite end of the campus, so <strong>you will never arrive on time</strong>.</p>
<p>If \(L=2\), the \(21\) possible ways to reach \(A = 3\) absences are as follo...https://oj.dcs.upd.edu.ph/problem/cs150201diagnosticPractice 1 - Ask for N Inputshttps://oj.dcs.upd.edu.ph/problem/pythonpractice01<h3>Problem Statement</h3>
<p>Given an integer \(N\) followed by \(N\) integers \(A_1\) up to \(A_N\), output the sum of the \(N\) integers.</p>
<h3>Input</h3>
<p>Input starts with a number \(N\) and is followed by \(N\) integers.</p>
<h3>Output</h3>
<p>Output is a single line containing the sum of the \(N\) integers. Do not output any newline characters.</p>
<h3>Limits</h3>
<p>\(1 < N < 20\)</p>
<p>\(-1000 \le A_i \le 1000\)</p>
<h3>Notes</h3>
<p>Problems will have test cases that are not...https://oj.dcs.upd.edu.ph/problem/pythonpractice01