question_id stringlengths 6 6 | content stringlengths 1 27.2k |
|---|---|
p02478 | <a href="https://onlinejudge.u-aizu.ac.jp/resources/icpcooc2018/practice/C.pdf" target='_blank'>Problem is available from here.</a> |
p00150 |
<H1>Twin Prime</H1>
<p>
Prime numbers are widely applied for cryptographic and communication technology.
A twin prime is a prime number that differs from another prime number by 2.
For example, (5, 7) and (11, 13) are twin prime pairs.
</p>
<p>
In this problem, we call the greater number of a twin prime "size of the... |
p00500 |
<H1>æ°åœãŠã²ãŒã (Unique number) </H1>
<br/>
<h2> åé¡</h2>
<p>
JOI åã¯åéãšã²ãŒã ãããããšã«ããïŒãã®ã²ãŒã ã«ã¯ N 人ã®ãã¬ã€ã€ãŒãåå ããïŒ1 åã®ã²ãŒã ã®ã«ãŒã«ã¯æ¬¡ã®ãããªãã®ã§ããïŒ
</p>
<p>
ããããã®ãã¬ã€ã€ãŒã¯ 1 ä»¥äž 100 以äžã®å¥œããªæŽæ°ãã«ãŒãã«æžããŠæåºããïŒåãã¬ã€ã€ãŒã¯ïŒèªåãšåãæ°ãæžãã人ãä»ã«ããªãã£ãå ŽåïŒèªåã®æžããæ°ãšåãåŸç¹ãåŸãïŒèªåãšåãæ°ãæžãã人ãä»ã«ããå Žåã¯åŸç¹ãåŸãããªãïŒ
</p>
<p>
JOI åãã¡ã¯ãã®ã²ãŒã ã 3 åè¡ã£ãïŒåãã¬ã€ã€ãŒã 3 åã®ã²ãŒã ã«ãããŠæžããæ°ãäžãããããšã... |
p01741 |
<p>
ãã³ããã¿ã³ã§ã¯ïŒéè·¯ãx 座æšãŸãã¯y 座æšãæŽæ°ã®ãšããã«éã£ãŠããïŒãã¬ãåã®å®¶ãšãããåã®å®¶ã¯ã©ã¡ããéè·¯äžã«ããïŒçŽç·è·é¢(ãŠãŒã¯ãªããè·é¢) ã¯ã¡ããã© <var>d</var> ã§ããïŒãã¬ãåã®å®¶ãããããåã®å®¶ãŸã§éè·¯ã«æ²¿ã£ãŠç§»åãããšãã®æçè·é¢ãšããŠèããããæ倧å€ãæ±ããïŒ
</p>
<h2>Constraints</h2>
<ul>
<li> 0 < <var>d</var> ≤ 10</li>
<li><var>d</var> ã¯å°æ°ç¹ä»¥äžã¡ããã©äžæ¡ãŸã§äžãããã</li>
</ul>
<h2>Input</h2>
<pre>
<var>d</var>
</p... |
p00853 |
<H1><font color="#000">Problem I:</font> Enjoyable Commutation</H1>
<p>
Isaac is tired of his daily trip to his ofice, using the same shortest route everyday. Although this saves his time, he must see the same scenery again and again. He cannot stand such a boring commutation any more.
</p>
<p>
One day, he decided to... |
p03286 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Given an integer <var>N</var>, find the base <var>-2</var> representation of <var>N</var>.</p>
<p>Here, <var>S</var> is the base <var>-2</var> representation of <var>N</var> when the following are all s... |
p01311 |
<h1><font color="#000">Problem I:</font> å€ãžã®æ</h1>
<p>ãªã€ãã¯å€§ã®ãã奜ãã§ããããªã€ãã®å®¶ã§ã¯ãã£ãšããã飌ã£ãŠãããããã奜ããªãªã€ãã¯ãã€ãéè¯ãããšéãã§ãããããããä»åãªã€ãã¯æ±ºå¿ããèªåã®å®¶ã§ãããäžå¹é£Œãããšã«ããããªã€ãã¯ããã家ã«è¿ããã¬ãã³ãšåä»ããŠãããããå§ããã</p>
<p>ãªã€ãã®å®¶ã¯ããããã®éšå±ãšãããããã€ãªãããããã®æãããªã£ãŠãããæã¯æ¬¡ã®2çš®é¡ãããã</p>
<dl>
<dt>人éçšã®æ®éã®æ</dt>
<dd>ãªã€ãã¯éããããšãã§ããããã¬ãã³ãèªåã§éããããšã¯ã§ããªãããªã€ããšã¬ãã³ã®äž¡æ¹ãéãã... |
p03906 | <span class="lang-en">
<p>Score : <var>1500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>The currency used in Takahashi Kingdom is <em>Myon</em>.
There are <var>1</var>-, <var>10</var>-, <var>100</var>-, <var>1000</var>- and <var>10000</var>-Myon coins, and so forth. Formally, there are <v... |
p02614 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>We have a grid of <var>H</var> rows and <var>W</var> columns of squares. The color of the square at the <var>i</var>-th row from the top and the <var>j</var>-th column from the left <var>(1 \leq i \leq ... |
p00629 |
<H1><font color="#000000">Problem 03:</font> Selecting Teams Advanced to Regional</H1>
<p>
æ¥æ¬ã§æ¯å¹Žéå¬ãããåœé倧åŠå¯Ÿæããã°ã©ãã³ã°ã³ã³ãã¹ãã®ã¢ãžã¢å°åºäºéžã«åºå Žããããã«ã¯ãå³ããåœå
äºéžãçªç Žããªããã°ãªããŸããã
</p>
<p>
倧åŠå¯Ÿæãšã¯èšã£ãŠããïŒã€ã®åŠæ ¡ããè€æ°ã®ããŒã ãåæŠããŸããããã§ãã§ããã ãå€ãã®åŠæ ¡ãã¢ãžã¢å°åºäºéžã«åºå Žã§ããããã«ãçªç ŽããŒã ã®éžæã«ã¯ä»¥äžã®éžæã«ãŒã«ãé©çšãããŸãïŒ
</p>
<p>
該åœããŒã ã <i>A</i> ãšããæ瞟ã®åªç§ãªé çªã«æ¬¡ã®ã«ãŒã«ãé©çšããŸãïŒ
</p>
<... |
p02244 |
<script type="text/x-mathjax-config">
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});
</script>
<script language="JavaScript" type="text/javascript" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS_HTML">
</script>
<H1>8 Queens Problem</H1>
<p>... |
p00279 |
<H1>ããããŒãšã³ãåé¡</H1>
<p>
ãããããŒãšã³ãåé¡ããšåŒã°ããæ°åŠã®æªè§£æ±ºåé¡ã«é¢é£ããããã°ã©ã ãæžããŠã¿ãŸããããå¹³é¢äžã«äžãããã<var>N</var>åã®ç¹ãããã¡ããã©<var>k</var>åã®ç¹ãçµãã§ã§ããåžå€è§åœ¢ã®ãã¡ãæãé¢ç©ã®å°ãããã®ãèŠã€ããããã°ã©ã ãäœæããŠãã ããããã ããNåã®ç¹ã®åº§æšãäžããããåŸã質åãšããŠåžå€è§åœ¢ã®è§ã®åæ°<var>k</var>ãããã€ãäžããããŸãã
</p>
<p>
ïŒè£è¶³ïŒããããŒãšã³ãåé¡ã«ã€ããŠïŒ<br/>
å¹³é¢äžã«ã©ã®ïŒç¹ãåãçŽç·äžã«ä¹ããªãããã«<var>N</var>åã®ç¹ã眮ããŸãããã®ãšããã©ã®ããã«ç¹ã眮ããŠããkåã®ç¹ãã... |
p01891 |
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {inlineMath: [['$','$'], ['\\(','\\)']]}
});
</script>
<script type="text/javascript" async
src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-MML-AM_CHTML">
</script>
<h1>A: ãã£ãã / Cabbage</h1>
<h2>åé¡æ</h2>
<p>
AOR ã€ã«ã¡ããã¯èã $N$ æã... |
p00783 |
<H1><font color="#000">Problem D:</font> Napoleon's Grumble</H1>
<p>
Legend has it that, after being defeated in Waterloo, Napoleon Bonaparte, in retrospect of his days of glory, talked to himself "Able was I ere I saw Elba." Although, it is quite doubtful that he should have said this in English, this phrase is wide... |
p01038 |
<h1>Problem B: Mountain Climbing</h1>
<h2>Problem</h2>
<p>
ãªãããåã¯å±±ç»ãã®èšç»ãç«ãŠãŠããŸããèšç»ã¯ãšãŠã倧åã§ããé«åã»çå°ãå€ãã®ããå³°ã»çªªå°ãå€ãã®ããå±±è
¹ãããã®ããç¶æ³ã«ãã£ãŠçšæããè·ç©ãå€ãã£ãŠããŸãã
</p>
<p>
ãªãããåãæã£ãŠããç»å±±ã¬ã€ãããã¯ã«ã¯ãä»åç»å±±ã«å©çšããéã®äžå®ã®è·é¢æ¯ã®æšé«ãã¹ã¿ãŒãå°ç¹ãããŽãŒã«å°ç¹ãŸã§é ã«æžãããŠããŸãã
</p>
<p>
ã¬ã€ãããã¯ã«æžãããŠããæšé«ãã¹ã¿ãŒãå°ç¹ãããŽãŒã«å°ç¹ãŸã§é ã«
<var>a<sub>1</sub></var>, <var>a<sub>2</sub></var>, <va... |
p03005 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Takahashi is distributing <var>N</var> balls to <var>K</var> persons.</p>
<p>If each person has to receive at least one ball, what is the maximum possible difference in the number of balls received betw... |
p01468 |
<script type="text/x-mathjax-config">
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], skipTags: ["script","noscript","style","textarea","code"], processEscapes: true }});
</script>
<script language="JavaScript" type="text/javascript" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?con... |
p03455 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>AtCoDeer the deer found two positive integers, <var>a</var> and <var>b</var>.
Determine whether the product of <var>a</var> and <var>b</var> is even or odd.</p>
</section>
</div>
<div class="part">
<sec... |
p01192 |
<H1><font color="#000"></font>Greedy, Greedy.</H1>
<!-- Problem D-->
<p>
Once upon a time, there lived a dumb king. He always messes things up based on his whimsical ideas.
This time, he decided to renew the kingdomâs coin system. Currently the kingdom has three types of
coins of values 1, 5, and 25. He is thinking of... |
p01487 |
<script type="text/x-mathjax-config">
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});
</script>
<script type='text/javascript' src='http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML'></script>
</script>
<h2>Problem B:
RabbitWalking
</h2... |
p03140 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You are given three strings <var>A, B</var> and <var>C</var>. Each of these is a string of length <var>N</var> consisting of lowercase English letters.</p>
<p>Our objective is to make all these three st... |
p03510 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>In a long narrow forest stretching east-west, there are <var>N</var> beasts. Below, we will call the point that is <var>p</var> meters from the west end Point <var>p</var>. The <var>i</var>-th beast fro... |
p00296 |
<h1>ããã³ãªã¬ãŒã²ãŒã </h1>
<p>
ã¢ã«ãé«æ ¡ã§ã¯ãæ¯å¹Žå
šæ ¡çåŸãåå ããã²ãŒã ãè¡ã£ãŠããŸãããŸããæ ¡åºã« <var>N</var> 人ã®å
šæ ¡çåŸãå圢ã«äžŠã³ãŸããå³ã®ããã«ãåçåŸã¯ 0 ãã <var>N</var>-1 ãŸã§ã®çªå·ãæžããããŒãã±ã³ãä»ããŠããŸãã
</p>
<center>
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE2_PCK2014_button" width="280">
</center>
<br>
<p>
ã²ãŒã ã§ã¯ããã³ãïŒæ¬äœ¿ããæåã¯ãŒãã±ã³ 0 çªã®çåŸãããã³ãæã£ãŠããŸããããããã以... |
p03843 | <span class="lang-en">
<p>Score : <var>1900</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There is a tree with <var>N</var> vertices.
The vertices are numbered <var>1</var> through <var>N</var>.
For each <var>1 †i †N - 1</var>, the <var>i</var>-th edge connects vertices <var>a_i</var> and... |
p02751 | <span class="lang-en">
<p>Score : <var>900</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3>
<p>We have a grid with <var>(2^N - 1)</var> rows and <var>(2^M-1)</var> columns.
You are asked to write <var>0</var> or <var>1</var> in each of these squares.
Let <var>a_{i,j}</var> be the number written ... |
p02301 |
<H1>Diameter of a Convex Polygon</H1>
<br/>
<p>
Find the diameter of a convex polygon <var>g</var>. In other words, find a pair of points that have maximum distance between them.
</p>
<H2>Input</H2>
<pre>
<var>n</var>
<var>x<sub>1</sub></var> <var>y<sub>1</sub></var>
<var>x<sub>2</sub></var> <var>y<sub>2</sub></va... |
p00453 |
<H1> ãŽãããŽããå·æž¡ã </H1>
<h2>åé¡</h2>
<p>
ããå·ã§,äžæ¹ã®å²žããç³ã®äžã次ã
ãšé£ã³ç§»ã£ãŠå察åŽã®å²žãŸã§è¡ããšããå°ã
å±éºãªã²ãŒã ãã¯ãã£ãŠãã.
</p>
<br>
<center>
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_hyonhyon1">
</center>
<br>
<p>
ä»,å³ 4-1 ã®ããã«,ç³ã¯ãã¹ç®ã®äžã«ååšãããšèãã.è¡ã®æ°ã¯ n ã§ãã. å³ 4-1 ã§ã¯ n = 5 ã§ãã.
</p>
<p>
ãã®ã²ãŒã ã§ã¯,äžæ¹ã®å²žããå§ããŠ,éåžžã®ãžã£ã³ããŸã㯠m å以äžã®äžè¡... |
p02194 | <h2>Zero AND Subsets</h2>
<p>éè² æŽæ°ã®å€ééå<var>a_1,a_2,..,a_N</var>ãäžããããŸãã</p>
<p>ãã®éåã®ç©ºã§ãªãéšåéåã§ãã£ãŠãå€ã®bitwiseANDã<var>0</var>ã«ãªããã®ã¯ããã€ãããŸããã</p>
<p>çãã<var>10^9+7</var>ã§å²ã£ãäœããæ±ããŠãã ããã</p>
<h3>å
¥å</h3>
<pre>
<var>N</var>
<var>a_1 a_2...a_N</var>
</pre>
<h3>åºå</h3>
<p>çãã<var>10^9+7</var>ã§å²ã£ãäœããåºåããã</p>
<h3>å¶çŽ</h3>
<ul>
... |
p00003 |
<H1>Is it a Right Triangle?</H1>
<p>
Write a program which judges wheather given length of three side form a right triangle. Print "<span>YES</span>" if the given sides (integers) form a right triangle, "<span>NO</span>" if not so.
</p>
<H2>Input</H2>
<p>
Input consists of several data sets. In the first line, the ... |
p01242 |
<H1><font color="#000">Problem I:</font> Revenge of Voronoi</H1>
<p>
A discrete Voronoi diagram is a derivation of a Voronoi diagram. It is represented as a set of pixels. Each of the
generatrices lies on the center of some pixel. Each pixel belongs to the generatrix nearest from the center of the
pixel in the sense ... |
p02897 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Given is an integer <var>N</var>.</p>
<p>Takahashi chooses an integer <var>a</var> from the positive integers not greater than <var>N</var> with equal probability.</p>
<p>Find the probability that <var>... |
p03785 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Every day, <var>N</var> passengers arrive at Takahashi Airport.
The <var>i</var>-th passenger arrives at time <var>T_i</var>.</p>
<p>Every passenger arrived at Takahashi airport travels to the city by b... |
p04040 | <span class="lang-en">
<p>Score : <var>400</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>We have a large square grid with <var>H</var> rows and <var>W</var> columns.
Iroha is now standing in the top-left cell.
She will repeat going right or down to the adjacent cell, until she reaches the b... |
p00900 |
<H1><font color="#000">Problem G: </font>Captain Q′s Treasure</H1>
<p>
You got an old map, which turned out to be drawn by the infamous pirate “Captain Q”. It shows the locations of a lot of treasure chests buried in an island.
</p>
<p>
The map is divided into square sections, each of which has a d... |
p01612 |
<h2>瀟å¡æ
è¡</h2>
<h2>Problem Statement</h2>
<p>ããªãã®äŒç€Ÿã«ã¯<var>n</var>人ã®ç€Ÿå¡ãååšããïŒ<var>m</var>åã®ç€Ÿå¡<var>(a_i,b_i)</var>ã®çµã«ã€ããŠïŒ<var>a_i</var>ã¯<var>b_i</var>ã®äžåžã§ããïŒ</p>
<p>瀟å¡<var>x</var>ã瀟å¡<var>y</var>ã®å®è³ªçãªäžåžã§ãããšã¯ïŒæ¬¡ã®ãã¡å°ãªããšãäžæ¹ãæãç«ã€ããšãããïŒ<br /></p>
<ul class="list1" style="padding-left:16px;margin-left:16px"><li><var>x</var>ã... |
p01307 |
<h1><font color="#000">Problem E:</font> 足ãç®ã²ãŒã </h1>
<p>
ããã®ãã¡ãŒãã«ã¯è¶³ãç®ãçšããç°¡åãªã²ãŒã ãæãã€ããåããããã§åéã®ãªãŒããªãŒãšäžç·ã«ãã£ãŠã¿ãããšã«ããã
</p>
<p>
ã²ãŒã ã®ã«ãŒã«ã¯æ¬¡ã®ãããªãã®ã§ããããŸãæåã«ãé©åœãªæ£ã®æŽæ°ãéžã³ãããããã¹ã¿ãŒããããåãã¬ãŒã€ãŒã¯ããã®æ°ã®ãã¡é£ãåã2ã€ã®æ¡ãéžæããŠåãèšç®ããããšã®2ã€ã®æ°åãšçœ®ãæãããããšãã°ãã1234ãã®åã®äœãšçŸã®äœãéžã¶ãšã次ã®æ°ã¯ã154ããšãªããã5555ãã®åã®äœãšçŸã®äœãéžãã å Žåã¯ã5105ããšãªãããã®ãããªæäœãæ°ã1æ¡ã«ãªããŸã§äº€äºã«ç¹°ãè¿ããæäœã... |
p03290 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>A programming competition site <em>AtCode</em> provides algorithmic problems.
Each problem is allocated a score based on its difficulty.
Currently, for each integer <var>i</var> between <var>1</var> and... |
p02878 | <span class="lang-en">
<p>Score : <var>2200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>We have two indistinguishable pieces placed on a number line.
Both pieces are initially at coordinate <var>0</var>. (They can occupy the same position.)</p>
<p>We can do the following two kinds of oper... |
p00845 | <H1><font color="#000">Problem A:</font> How I Wonder What You Are!</H1>
<p>
One of the questions children often ask is "How many stars are there in the sky?" Under ideal conditions, even with the naked eye, nearly eight thousands are observable in the northern hemisphere. With a decent telescope, you may find many mo... |
p01757 |
<p>
ä»å¹ŽãïŒå
šåœããã°ã©ãã³ã°éžæ暩倧äŒã®ææããã£ãŠããïŒå
šåœå€§äŒã®åå æš©ãè³ããå°åºå€§äŒã¯ïŒ <var>2<sup>n</sup></var> ããŒã ã1 察1 ã®åã¡æ®ãåŒããŒãã¡ã³ãæ¹åŒã§å¯Ÿæ±ºããïŒ
</p>
<p>
ããŒãã¡ã³ãè¡šã«ã¯ããŒã çªå· <var>0, . . . 2<sup>n</sup> − 1</var> ãå²ãæ¯ãããŠããïŒ1 åæŠãã <var>n</var> åæŠãŸã§ã®å¯Ÿæ±ºæé ã¯æ¬¡ã®éãã§ããïŒ
</p>
<ol>
<li> 1 åæŠã§ã¯ïŒïŒããŒã çªå·ã <var>l</var> ã®ããŒã ïŒãšïŒããŒã çªå·ã <var>l</var> + 1 ã®ããŒã ïŒã察決ããïŒ(<var>l... |
p00516 |
<H1>åé¡ 2: ãæ祚 (Vote)
</H1>
<br/>
<h2>åé¡</h2>
<p>
20XX幎ã«æ±äº¬ã§äžççãªã¹ããŒã倧äŒãéãããããšã«ãªã£ãïŒããã°ã©ãã³ã°ã³ã³ãã¹ãã¯ã¹ããŒããšããŠäžçã§æ¥œããŸããŠããïŒç«¶æãšããŠæ¡çšãããå¯èœæ§ãããïŒæ¡çšããã競æã決ãã審æ»å§å¡äŒã«ã€ããŠèª¿ã¹ããšããïŒæ¬¡ã®ãããªããšãåãã£ãïŒ
</p>
<ul>
<li>
審æ»å§å¡äŒã®ããã«ïŒåè£ãšãªã N åã®ç«¶æãé¢çœãæ¹ããé çªã«äžŠã¹ããªã¹ããäœæãããïŒãªã¹ãã®äžãã i çªç®ã«ã¯ i çªç®ã«é¢çœã競æãæžãããŠããïŒããã競æ i ãšããïŒããã«ç«¶æ i ã®éå¬ã«å¿
èŠãªè²»çš A<sub>i</sub> ãæžãããŠããïŒ... |
p00146 |
<H1>ã«ãã³åäž</H1>
<p>
æªçãã«ãã³åäžãã¯äŒæŽ¥è©å£«ãæ«è£ãšããçŸå¥³ãå¯å£«å³°åããããäŒæŽ¥è¥æŸåžã«äŒæŽ¥è©ãæ®ããè»è³éãç ã£ãŠããããšãèãããããã«ãã³ã®é·å¹Žã®ä»²éã§ãããç³å·è¶ã§éãã®å ±åã«ããã°ãè»è³éã¯åäž¡ç®±ã«åãããããã€ãã®èµã«ä¿ç®¡ãããŠãããèµã«èŠåŒµãã¯ããªããå³éã«æœé ãããŠãããããããè¶ã§éã¯åœŒãç¶ããäŒæãããç§äŒãéŒéæ¬ããã®æãç¹°ãåºãã°ç¬æã«èµãç Žãããšããã
</p>
<center>
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_lupin">
</center>
<br/>
<p>
æ®ã£ãåé¡... |
p01184 |
<H1><font color="#000">Problem D:</font> International Party</H1>
<p>
Isaac H. Ives is attending an international student party (maybe for girl-hunting). Students there enjoy
talking in groups with excellent foods and drinks. However, since students come to the party from all
over the world, groups may not have a lan... |
p03443 | <span class="lang-en">
<p>Score : <var>2000</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There is a bridge that connects the left and right banks of a river.
There are <var>2 N</var> doors placed at different positions on this bridge, painted in some colors.
The colors of the doors are rep... |
p03013 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There is a staircase with <var>N</var> steps. Takahashi is now standing at the foot of the stairs, that is, on the <var>0</var>-th step.
He can climb up one or two steps at a time.</p>
<p>However, the t... |
p00795 |
<H1><font color="#000">Problem H:</font> Co-occurrence Search</H1>
<p>
A huge amount of information is being heaped on WWW. Albeit it is not well-organized, users can browse WWW as an unbounded source of up-to-date information, instead of consulting established but a little out-of-date encyclopedia. However, you can ... |
p01887 |
<script type="text/x-mathjax-config">
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});
</script>
<script type='text/javascript' src='http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML'></script>
</script>
<h2>Pipe Fitter and the Fierce Dog... |
p02252 | <h1>Fractional Knapsack Problem</h1>
<p>You have $N$ items that you want to put them into a knapsack of capacity $W$. Item $i$ ($1 \le i \le N$) has weight $w_i$ and value $v_i$ for the weight.</p>
<p>When you put some items into the knapsack, the following conditions must be satisfied:</p>
<ul>
<li>The total value... |
p02602 | <span class="lang-en">
<p>Score: <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3>
<p>M-kun is a student in Aoki High School, where a year is divided into <var>N</var> terms.<br/>
There is an exam at the end of each term. According to the scores in those exams, a student is given a grade... |
p03910 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>The problem set at <em>CODE FESTIVAL 20XX Finals</em> consists of <var>N</var> problems.</p>
<p>The score allocated to the <var>i</var>-th <var>(1âŠiâŠN)</var> problem is <var>i</var> points.</p>
<p>Takah... |
p02317 |
<H1>Longest Increasing Subsequence</H1>
<br/>
<p>
For a given sequence <var>A = {a<sub>0</sub>, a<sub>1</sub>, ... , a<sub>n-1</sub>}</var>, find the length of the longest increasing subsequnece (LIS) in <var>A</var>.
</p>
<p>
An increasing subsequence of <var>A</var> is defined by a subsequence <var>{a<sub>i<sub>0<... |
p02747 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3>
<p>A Hitachi string is a concatenation of one or more copies of the string <code>hi</code>.</p>
<p>For example, <code>hi</code> and <code>hihi</code> are Hitachi strings, while <code>ha</code> and <code>h... |
p03855 | <span class="lang-en">
<p>Score : <var>400</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There are <var>N</var> cities. There are also <var>K</var> roads and <var>L</var> railways, extending between the cities.
The <var>i</var>-th road bidirectionally connects the <var>p_i</var>-th and <var... |
p01868 |
<!-- - - - - - begin nicebody - - - - - -->
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {inlineMath: [['$','$'], ['\\(','\\)']]}
});
</script>
<script type="text/javascript" async
src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-MML-AM_CHTML">
</script>
<h1>D: ã¹ãã£... |
p00280 |
<h1>ããã¹</h1>
<p>
ãžã§ãŠåãšã€ãšããã¯æŒäŒã¿ã«ããã¹ãããŸãããã ããæŒäŒã¿ã¯æéãéãããŠããã®ã§ãçãæéã§çµããããã«ãåŸç¹ã«ã€ããŠä»¥äžã®ïŒã€ã®ã«ãŒã«ã§è¡ããŸãã
</p>
<ul>
<li> çžæãïŒç¹ä»¥äžã®ãšãã«å
ã«ïŒç¹ãšãã°åã¡ã</li>
<li> ïŒå¯ŸïŒã®åç¹ã«ãªã£ããšãã¯ããã®çŽåŸã«é£ç¶ããŠïŒç¹ãšã£ãæ¹ãåã¡ã</li>
<li> ïŒå¯ŸïŒã®åŸã«åæ¹ãïŒç¹ãã€ãšã£ããšãã¯åŒãåãã</li>
</ul>
<center>
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE2_PCK2013_tennis" width=... |
p03506 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You are given an integer <var>N</var>. Consider an infinite <var>N</var>-ary tree as shown below:</p>
<div style="text-align: center;">
<img src="https://img.atcoder.jp/relay2/c76baa50b0acf2806268859772... |
p03156 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You have written <var>N</var> problems to hold programming contests.
The <var>i</var>-th problem will have a score of <var>P_i</var> points if used in a contest.</p>
<p>With these problems, you would li... |
p01491 |
<script type="text/x-mathjax-config">
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});
</script>
<script type='text/javascript' src='http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML'></script>
</script>
<h2>Problem F:
RabbitLunch
</h2>
... |
p03382 | <span class="lang-en">
<p>Score : <var>400</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Let <var>{\rm comb}(n,r)</var> be the number of ways to choose <var>r</var> objects from among <var>n</var> objects, disregarding order.
From <var>n</var> non-negative integers <var>a_1, a_2, ..., a_n</... |
p00957 |
<script type="text/x-mathjax-config">
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], skipTags: ["script","noscript","style","textarea","code"], processEscapes: true }});
</script>
<script type="text/javascript" async src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config... |
p01645 |
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: { inlineMath: [['\\(','\\)']] }
});
</script>
<script type='text/javascript' src='http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML'></script>
<h1 class="ndoc-heading1">Problem L: The Return of FizzBuzz</h1>
<p c... |
p03678 | <span class="lang-en">
<p>Score : <var>1100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>We will call a string that can be obtained by concatenating two equal strings an <em>even</em> string.
For example, <code>xyzxyz</code> and <code>aaaaaa</code> are even, while <code>ababab</code> and <... |
p04017 | <span class="lang-en">
<p>Score : <var>700</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p><var>N</var> hotels are located on a straight line. The coordinate of the <var>i</var>-th hotel <var>(1 \leq i \leq N)</var> is <var>x_i</var>.</p>
<p>Tak the traveler has the following two personal pri... |
p01215 |
<H1><font color="#000">Problem I:</font> Pythagoraslope</H1>
<p>
Alice, your girlfriend, is a student at an art school. She is in the final year, and now working
hard to build a facture for fulfilling the requirement to graduate. Her work is a large pinball
with many straight slopes. Before starting to build, she has... |
p03228 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>In the beginning, Takahashi has <var>A</var> cookies, and Aoki has <var>B</var> cookies.
They will perform the following operation alternately, starting from Takahashi:</p>
<ul>
<li>If the number of coo... |
p02593 | <span class="lang-en">
<p>Score : <var>2200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You are given positions <var>(X_i, Y_i)</var> of <var>N</var> enemy rooks on an infinite chessboard.
No two rooks attack each other (at most one rook per row or column).</p>
<p>You're going to replace ... |
p02069 | <style type="text/css">
blockquote {
font-family: Menlo, Monaco, "Courier New", monospace;
display: block;
margin: 10px 0 10px 30px;
font-size: 16px;
line-height: 18px;
white-space: pre;
white-space: pre-wrap;
word-break: break-all;
word-wrap: ... |
p00054 |
<H1>å°æ°äœã®å</H1>
<p>
<var>a</var>, <var>b</var>, <var>n</var> ã¯ãããããæ£ã®æŽæ°ã§ãããšããŸããåæ° <var>a</var> / <var>b</var> ã®å°æ°ç¬¬ <var>i</var> äœã®æ°ã <var>f(i)</var> ãšããŸã (0 ≤ <var>f(i)</var> ≤ 9)ããã®ãšãã<var>i = 1</var> ãã <var>n</var> ãŸã§ã® <var>f(i)</var> ã®åã <var>s</var> ãšããŸãã<br/>
<br/>
<var>s = f(1) + f(2) +</var> ... <var>+... |
p02439 | <h1>Min-Max</h1>
<p>
For given three integers $a, b, c$, print the minimum value and the maximum value.
</p>
<h2>Input</h2>
<p>
The input is given in the following format.
</p>
<pre>
$a \; b \; c\;$
</pre>
<p>
Three integers $a, b, c$ are given in a line.
</p>
<h2>Output</h2>
<p>
Print the minimum and max... |
p00404 | <h1>åº</h1>
ã
<p>
ãããšå士ã®å®¶ã®åºã«ã¯æ£æ¹åœ¢ã®ã¿ã€ã«ãæ·ãã€ããããŠããŸããèžè¡ã«é è©£ãæ·±ããããšå士ã¯ãèµ€ãé»ãéã®å¡æã䜿ã£ãŠã¿ã€ã«ã«è²ãå¡ãããšã«ããŸãããã¯ããã«éšå±ã®é©åœãªã¿ã€ã«ãã²ãšã€éžã³ã以äžã®æ¹æ³ã§è²ãå¡ã£ãŠãããŸãã
</p>
<ul>
<li>ã¿ã€ã«ãå¡ãè²ããèµ€ïŒå³ã®çªå·ïŒïŒãé»ïŒå³ã®çªå·ïŒïŒãéïŒå³ã®çªå·ïŒïŒã®é ã«å€ããŠãããéã®æ¬¡ã¯ãŸãèµ€ããå§ããã</li>
<li>ãã§ã«è²ãå¡ã£ãé åã®é£ã«æ£æ¹åœ¢ãè¿œå ããããã«è²ãå¡ããããããåãããé åãé·æ¹åœ¢ã«ãªãããã«ãããæ£æ¹åœ¢ãè¿œå ããæ¹åã¯ãæ±ãåã西ãåã®é ã«å€ããŠãããåã®æ¬¡ã¯ãŸãæ±ããå§ããïŒå³ã§ã¯ãäžæ¹åãåãå³æ¹åãæ±ã§... |
p00111 |
<H1>å士ã®æå·</H1>
<p>
å 士 : ?D-C'KOPUA
</p>
<p>
ããŒã¿ãŒ : ã©ããããã§ãããããããå士? ããã®ããããªãããšãå«ã¶ã®ã«ã¯ããæ
£ããŸãããã
ä»æ¥ã¯æç« ã«ãããªã£ãŠããŸãããã
</p>
<p>
å 士 : ã»ãã
</p>
<center>
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_memorableCodes1">
</center>
<br/>
<p>
ããŒã¿ãŒ : ãªãã§ãã? ãã®è¡šã¯......ãããäºéžã®åé¡ã«ãããªã®ããããŸãããè¡šã䜿ã£ãŠæåã眮ãæã... |
p00541 |
<h2>åå£ (Rampart)</h2>
<p>
æŽå²åŠè
ã§ãã JOI ææã¯ïŒãã€ãŠååšãã IOI çåœã«ã€ããŠç 究ããŠããïŒ
</p>
<p>
éå»ã®èª¿æ»ã«ãããšïŒIOI çåœã¯çžŠ <var>H</var> è¡ïŒæšª <var>W</var> åã®ãã¹ã«åºåãããé·æ¹åœ¢ã®åœ¢ãããŠããïŒIOI çåœã®éŠéœã¯ïŒé²è¡ã®ããã«åå£ã§å²ãããŠããïŒ
</p>
<p>
IOI çåœã®éŠéœãå²ãåå£ã¯æ¬¡ã®ãããªåœ¢ãããŠããïŒåå£ã«ã¯å€§ãããšåŒã°ããå€ãå®ãŸã£ãŠããïŒå€§ãã <var>s</var> (<var>s</var> ≥ 3) ã®åå£ãšã¯ïŒ<var>s</var> × <var>s</var> ã®æ£æ¹åœ¢... |
p02086 |
<h1>I: Palindrome Compliment</h1>
<h2>åé¡æ</h2>
<p>å°æ± ããã¯ããŒã ã¡ã€ããããè€ããŸãã
圌ã¯ããŒã ã¡ã€ãã§ããæŸåŽãããæåå $S$ ã§è€ããŸãããã®åœ¢åŒã¯ä»¥äžã®æ¡ä»¶ãæºãããŸãã</p>
<ul>
<li>$Hoge, Zaki, O$ ã¯å°æåã¢ã«ãã¡ãããã®ã¿ãããªãæåå</li>
<li>$S = Hoge + Zaki + Hoge + O$ ($+$ ã¯æååã®çµåãè¡šã)</li>
<li>$S$ ã¯åæ</li>
</ul>
<p>å°æ± ããã¯$Hoge$ã®é·ãã$N$ãšãããšãã«ãæŸåŽããã®è€ãæ¹ãäœéãããã®ãæ°ã«ãªããŸããã
3人ç®ã®ããŒã ã¡ã³ããŒã«ããŠr... |
p00812 | <H1><font color="#000">Problem B:</font> Equals are Equals</H1>
<p>
Mr. Simpson got up with a slight feeling of tiredness. It was the start of another day of hard work. A bunch of papers were waiting for his inspection on his desk in his office. The papers contained his students' answers to questions in his Math class... |
p01700 |
<script type="text/x-mathjax-config">
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});
</script>
<script language="JavaScript" type="text/javascript" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS_HTML"></script>
<!-- begin en only -->
<!--<... |
p01350 |
<H1>Problem B: Carrot Tour </H1>
<p>
ããããããåœãæ
è¡ããŠãã. ãã®åœã«ã¯1 ãã<i>n</i> ã®çªå·ãã€ãã<i>n</i> åã®éœåžããã, ãããã¯ä»éœåž1ã«ãã. éœåž<i>i</i> ã¯åº§æšå¹³é¢äžã®1 ç¹(<i>x<sub>i</sub></i>, <i>y<sub>i</sub></i>) ãšã¿ãªã.
</p>
<p>
ãããã¯ä»¥äžã®æ¡ä»¶ãã¿ããããã«æ
ããã.
</p>
<ul>
<li> 移åçµè·¯ã¯æãç·ã§ãã, ãã®åéšåã¯ç°ãªã2 éœåžãçµã¶ç·åã§ãªããã°ãªããªã.</li>
<li> 移åçµè·¯ã®å
šé·ã¯<i>r</i> 以äžã§ãªããã°ãªããªã. çµè·¯ã®ãã¡é... |
p02985 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You are given a tree with <var>N</var> vertices and <var>N-1</var> edges. The vertices are numbered <var>1</var> to <var>N</var>, and the <var>i</var>-th edge connects Vertex <var>a_i</var> and <var>b_i... |
p03697 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You are given two integers <var>A</var> and <var>B</var> as the input. Output the value of <var>A + B</var>.</p>
<p>However, if <var>A + B</var> is <var>10</var> or greater, output <code>error</code> in... |
p00668 |
<H1>Problem J: The Incubator</H1>
<p>
ãµã©ãªãŒãã³ã®æã¯æ©ãããšãªãŒãã³ãŒã¹ãé²ã¿äžæµäŒæ¥ã«å
¥ç€ŸããŠæ°äººãšããè©æžããããåæ¥ããé ãåã«äžã£ãèŸä»€ã¯æªéã®ææã«ãããå¶æ¥æŽ»åã ã£ãã蟺éãªåå°ã§ã®äžäŸ¿ãªç掻ã匷ããããŠããããäžå¿ã¯å·Šé·ã§ãªãæ 転ã§ããããã®èšŒæ ã«çµŠæããããšäžãã£ãŠãã - ãããªå Žæã§ã¯éãªããŠäœ¿ãããããªãã®ã ãã©ãè¿å¹Žåãã¡ãçŽé¢ããŠããå®å®èŠæš¡ã®ãšãã«ã®ãŒäžè¶³ã«å¯Ÿå¿ãããããç¹å®ã®çç©çš®ã®åäœããè«å€§ãªãšãã«ã®ãŒãçæãããã¯ãããžãŒãéçºãããããã®ç¹å®ã®çç©çš®ãšããã®ãããã®èŸºéãªææã®åºæçš®ãªã®ã ããã®çç©ã絶æ»
ããªãããã«ä¿è·ãã€ã€ãé©åºŠã«ãšãã«ã®ãŒã... |
p02655 | <span class="lang-en">
<p>Score : <var>1200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>We have <var>N</var> boxes numbered <var>1</var> to <var>N</var>, and <var>M</var> balls numbered <var>1</var> to <var>M</var>.
Currently, Ball <var>i</var> is in Box <var>A_i</var>.</p>
<p>You can do ... |
p03947 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Two foxes Jiro and Saburo are playing a game called <em>1D Reversi</em>. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a ... |
p00392 | <h1>Common-Prime Sort</h1>
<p>
You are now examining a unique method to sort a sequence of numbers in increasing order. The method only allows swapping of two numbers that have a common prime factor. For example, a sequence [6, 4, 2, 3, 7] can be sorted using the following steps.
<br/>
<span>Step 0: 6 4 2 3 7</span> ... |
p00238 |
<!--
<p>
äžåºŠã®é£¯ããã²ãŒã 奜ãã®ã ããåã¯æããããã°ã²ãŒã ã°ããããŠããŸãããã§ãããã ããåãé«æ ¡ïŒå¹Žçãã¯ã©ã¹ã¯ããåéšã¢ãŒãã«å
¥ã£ãŠããŸããåéšå匷ãããããã«ã¯ãåœç¶ã²ãŒã ã§éã¹ãæéãçããªã£ãŠããŸããŸãããŸãã¯1æ¥ã«å匷ãããæéã決ããŠãæ®ã£ãæéãã²ãŒã ãªã©ã«äœ¿ãããšã«ããŸããããã ããåã¯ä»ãŸã§èšç»ãå®ãããããããããŸããã§ãããèŠãããããªãã¯ãã ããåã®å匷æéã管çããããã°ã©ã ãæžãããšã«ããŸããã
</p>
1æ¥ã«ãããªããã°ãªããªãå匷ã®ç®æšæéãtãå匷ãéå§ããæå»ãsãçµäºããæå»ãfãšãããŸãã
-->
<p>
å匷ãéå§ããæå»ãšçµäºããæå»ã®æ
å ±ãåºã«ã1æ¥ã§å匷ãã... |
p02205 | <h2>ããããã²ããã (Calculation Training)</h2>
<p>square1001 å㯠E869120 åã«ãèªçæ¥ãã¬ãŒã³ããšããŠäºã€ã®æ°å $A$ ãš $B$ ããã¬ãŒã³ãããŸããã</p>
<p>E869120 åã¯ãã®äºã€ã®æ°åã䜿ã£ãŠãèšç®ãã¬ãŒãã³ã°ãããããšã«ããŸããã</p>
<p>å
·äœçã«ã¯ãE869120åã¯æ¬¡ã®æäœãã¡ããã© $N$ åãããã®æ°ã«è¡ããŸãã</p>
<ul>
<li>å¥æ°åç®ã®æäœã®ãšãã$A$ ã $A-B$ ã§çœ®ãæãã</li>
<li>å¶æ°åç®ã®æäœã®ãšãã$B$ ã $A+B$ ã§çœ®ãæãã</li>
</ul>
<br>
<p>E8691... |
p03044 | <span class="lang-en">
<p>Score : <var>400</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>We have a tree with <var>N</var> vertices numbered <var>1</var> to <var>N</var>.
The <var>i</var>-th edge in the tree connects Vertex <var>u_i</var> and Vertex <var>v_i</var>, and its length is <var>w_i... |
p01079 |
<h1>Problem H: Hogemon Get</h1>
<h2>Problem</h2>
<p>
ãã£ã¡ãåã¯äººæ°ã®ã²ãŒã Hogemon Getã«ç±äžããŠããããã£ã¡ãåãäœãã§ããäŒæŽ¥åœã¯ãããã1ãã<var>N</var>ã®çªå·ãã€ããŠãã<var>N</var>åã®çºãããªãããŸããäŒæŽ¥åœã«ã¯<var>M</var>æ¬ã®éãããããã¹ãŠã®éã¯ç°ãªã2ã€ã®çºãçµãã§ããããã£ã¡ãåã¯éãåæ¹åã«ç§»åããããšãã§ããããé以å€ãéã£ãŠãããçºããå¥ã®çºã«è¡ãããšã¯ã§ããªãã</p>
<p>
Hogemon Getã§ã¯ãçº<var>i</var>ã§ããŒã«ã<var>d<sub>i</sub></var>åå
¥æãã... |
p01583 |
<H1><font color="#000">Problem C:</font> Craftsman</H1>
<p>
Takeshi, a famous craftsman, accepts many offers from all over Japan. However, the tools which he is using now has become already too old. So he is planning to buy new tools and to replace the old ones before next use of the tools. Some offers may incur him ... |
p03414 | <span class="lang-en">
<p>Score : <var>1100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You are given a directed graph with <var>N</var> vertices and <var>M</var> edges.
The vertices are numbered <var>1, 2, ..., N</var>, and the edges are numbered <var>1, 2, ..., M</var>.
Edge <var>i</var... |
p01429 |
<script type="text/javascript" src="./varmath.js" charset="UTF-8"></script>
<h2>åé¡æ</h2>
<p>
äžã®äžã®å°å¥³ãã¡ã¯ãã¥ã¥ã¹ããšå¥çŽãé¡ããå¶ããŠãããïŒãããšã²ãããã«éæ³å°å¥³ãšãªãïŒäœ¿ãéæ³ã®åœ¢ã»å¹æã¯é¡ãã«åŒ·ã圱é¿ãåããïŒéæ³å°å¥³<i>ããã</i>ã¡ããã¯æè¿ãã¥ã¥ã¹ããšå¥çŽããæ°ç±³éæ³å°å¥³ã§ããïŒ<i>ããã</i>ã®é¡ãã¯ãäºæ
ã®ããæãåããªããªãïŒé³æ¥œãæŒå¥ããã®ãè«ŠããŠããç·ã®åãå©ããããšãã§ãã£ãã®ã§ïŒäœãéæ¹é£ã¯é³ç¬Šã茪ã®äžã«äžŠãã 圢ãããŠããïŒ
</p>
<p><i>ããã</i>㯠<var>N</var> å... |
p03101 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There are <var>H</var> rows and <var>W</var> columns of white square cells.</p>
<p>You will choose <var>h</var> of the rows and <var>w</var> of the columns, and paint all of the cells contained in those... |
p01096 |
<h3>Daruma Otoshi</h3>
<p>
You are playing a variant of a game called "Daruma Otoshi (Dharma Block Striking)".
</p>
<p>
At the start of a game, several wooden blocks of the same size but with varying weights
are stacked on top of each other, forming a tower.
Another block symbolizing Dharma is placed atop.
You have ... |
p03551 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Takahashi is now competing in a programming contest, but he received TLE in a problem where the answer is <code>YES</code> or <code>NO</code>.</p>
<p>When he checked the detailed status of the submissio... |
p02710 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3>
<p>We have a tree with <var>N</var> vertices numbered <var>1</var> to <var>N</var>. The <var>i</var>-th edge in this tree connects Vertex <var>a_i</var> and <var>b_i</var>.
Additionally, each vertex is pa... |
p03802 | <span class="lang-en">
<p>Score : <var>1200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke loves flags.</p>
<p>Snuke is placing <var>N</var> flags on a line.</p>
<p>The <var>i</var>-th flag can be placed at either coordinate <var>x_i</var> or coordinate <var>y_i</var>.</p>
<p>Snuke thi... |
p00687 |
<H1>
Unable Count</H1>
<BLOCKQUOTE>
<P><I>I would, if I could,<BR>
If I couldn't how could I?<BR>
I couldn't, without I could, could I?<BR>
Could you, without you could, could ye?<BR>
Could ye? could ye?<BR>
Could you, without you could, could ye?</I></P></BLOCKQUOTE>
<P>It is true, as this old rhyme say... |
p01995 | <h2>G: åæéšåå (Palindromic Subsequences)</h2>
<h3>åé¡</h3>
<p>è±å°æåã®ã¿ãããªãæåå <var>S</var> ãäžããããã®ã§ããã®æåå <var>S</var> ã®<b>é£ç¶ãšã¯éããªã</b>éšååã§ãã£ãŠãåæã§ãããã®ã¯äœçš®é¡ããããæ±ããŠãã ããã</p>
<p>ããã§ã<var>S</var> ã®é£ç¶ãšã¯éããªãéšååãšã¯ãå
ã®æåå <var>S</var> ãã <b><var>1</var> æå以äž</b> <var>|S|</var> æå以äžãä»»æã«éžæã (éžæããããããã®æåã®äœçœ®ã¯éé£ç¶ã§ãè¯ã)ãããããå
ã®é çªéãã«é£çµãããŠ... |
p02340 | <!--<h1>åå12çž ãã®10:ããŒã«ã«åºå¥ãªãã»ç®±ã«åºå¥ãªãã»å
¥ãæ¹ã«å¶éãªã</h1>-->
<h1>Balls and Boxes 10</h1>
<table border="">
<tr><th>Balls</th><th>Boxes</th><th>Any way</th><th>At most one ball</th><th>At least one ball</th></tr>
<tr><th>Distinguishable</th><th>Distinguishable</th><td>1</td><td>2</td><td>3</td></tr>
<tr><th>Indistinguisha... |
p03223 | <span class="lang-en">
<p>Score : <var>400</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You are given <var>N</var> integers; the <var>i</var>-th of them is <var>A_i</var>.
Find the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers... |
p03389 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You are given three integers <var>A</var>, <var>B</var> and <var>C</var>. Find the minimum number of operations required to make <var>A</var>, <var>B</var> and <var>C</var> all equal by repeatedly perfo... |
p02961 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Jumbo Takahashi will play golf on an infinite two-dimensional grid.</p>
<p>The ball is initially at the origin <var>(0, 0)</var>, and the goal is a grid point (a point with integer coordinates) <var>(X,... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.