question_id stringlengths 6 6 | content stringlengths 1 27.2k |
|---|---|
p01190 |
<H1><font color="#000"></font>Reading Brackets in English</H1>
<!-- Problem B-->
<p>
Shun and his professor are studying Lisp and S-expressions. Shun is in Tokyo in order to make a presen-
tation of their research. His professor cannot go with him because of another work today.
</p>
<p>
He was making final checks for ... |
p02616 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Given are <var>N</var> integers <var>A_1,\ldots,A_N</var>.</p>
<p>We will choose exactly <var>K</var> of these elements. Find the maximum possible product of the chosen elements.</p>
<p>Then, print the ... |
p03904 | <span class="lang-en">
<p>Score : <var>1000</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You are given a string <var>S</var> consisting of digits between <code>1</code> and <code>9</code>, inclusive.
You will insert at most <var>K</var> commas (<code>,</code>) into this string to separate ... |
p01939 |
<h2>BïŒ ãã³ã¡ãããšæ°å - Ebi-chan and Integer Sequences -</h2>
<h3>åé¡</h3>
<p>
ãã³ã¡ããã¯æ°åã奜ãã§ããäžã§ãçå·®æ°åãç¹ã«å¥œãã§ãã
ä»åã¯ä»¥äžã®æ¡ä»¶ãæºããæ°åãäœãããšã«ããŸããã
</p>
<ul>
<li> é·ã <var>n</var> ã®çå·®æ°åã§ãã</li>
<li> æ°åã® <var>i</var> çªç®ã®èŠçŽ ã <var>s_i</var> ãšå®ããæãå
šãŠã® <var>s_i (1 \leq i \leq n)</var> ã <var>0 \leq s_i \leq m</var> ãæºããæŽæ°ã§ãã</li>
</ul>
... |
p02246 |
<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>15 Puzzle</H1>
<p>
The ... |
p00781 |
<H1><font color="#000">Problem B:</font> Lattice Practices</H1>
<p>
Once upon a time, there was a king who loved beautiful costumes very much. The king had a special cocoon bed to make excellent cloth of silk. The cocoon bed had 16 small square rooms, forming a 4 × 4 lattice, for 16 silkworms. The cocoon bed ca... |
p01893 |
<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>C: 倱ãããã°ã©ã / Lost Graph</h1>
<h2>åé¡æ</h2>
<p>
ããªããš AOR ã€ã«... |
p00851 |
<H1><font color="#000">Problem G:</font> Polygons on the Grid</H1>
<p>
The ultimate Tantra is said to have been kept in the most distinguished temple deep in the
sacred forest somewhere in Japan. Paleographers finally identified its location, surprisingly a
small temple in Hiyoshi, after years of eager research. The ... |
p01743 |
<p>
<var>m</var> é ç¹ã®å®å
šã°ã©ããããïŒæåïŒå®å
šã°ã©ãã®èŸºã«ã¯è²ã¯å¡ãããŠããªãïŒãã¬ãåã¯ïŒå <var>i</var>(1 ≤ <var>i</var> ≤ <var>n</var>) ã«ã€ããŠæ¬¡ã®æäœãè¡ã£ã: å®å
šã°ã©ããã <var>a<sub>i</sub></var> åã®é ç¹ãéžã³ïŒéžã°ããé ç¹å士ãçµã¶èŸºãã¹ãŠãè² <var>i</var> ã§ã¬ãïŒè€æ°åã®è²ãå¡ããã蟺ã¯ãªãã£ãïŒ<var>m</var> ãšããŠèããããæå°å€ãæ±ããïŒ
</p>
<h2>Constraints</h2>
<ul>
<li> 1 ≤ <var>n</var> ≤ 5</li>... |
p03284 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Takahashi has decided to distribute <var>N</var> AtCoder Crackers to <var>K</var> users of as evenly as possible.
When all the crackers are distributed, find the minimum possible (absolute) difference b... |
p01313 |
<h1><font color="#000">Problem K:</font> Cat Numbers!</h1>
<p>
ããã®ã¢ãªã¹ããã¬ã¹ã¯æ°åŠã®åé¡ãèããã®ã趣å³ã«ããŠãããä»åœŒãèããŠããåé¡ã¯ä»¥äžã®ãããªãã®ã§ããã
</p>
<p>
1以äžã®èªç¶æ° <var>A</var>, <var>B</var> (<var>A</var> < <var>B</var>) ã«å¯ŸããŠã<var>A</var> ãã <var>B</var> ãŸã§ã®èªç¶æ°ã®åã <var>C</var>ã<var>A</var> ãš <var>B</var> ãåé²è¡šèšã㊠<var>A</var>, <var>B</var> ã®... |
p00152 |
<H1>ããŠãªã³ã°</H1>
<p>
ã¯ã©ã¹ã®ã¬ã¯ãªãšãŒã·ã§ã³ãšããŠããŠãªã³ã°ãè¡ãããšã«ãªããŸãããåå è
ããšã®æçæ
å ±ãå
¥åãšããåŸç¹ã®é«ãé ã«æ瞟æ
å ±ãåºåããããã°ã©ã ãäœæããŠãã ããããªããåç¹ã®å Žåã¯åŠç±çªå·ã®è¥ãé ã«åºåããŠãã ããããã ãåå è
㯠3 åä»¥äž 40 å以äžãšãã1人åœãã1ã²ãŒã ãã€æçããŠãããã®ãšããŸãã
</p>
<p>
ããŠãªã³ã°ãšã¯ããã¬ã€ã€ãŒã«å¯ŸããŠé ç¹ãåããŠæ£äžè§åœ¢ã«äžŠã¹ãããã10 æ¬ã®ãã³ãããããŠããŒã«ã転ããããã³ãåãã¹ããŒãã§ãã 1 åç®ã®æçã§ãã¹ãŠè»¢åããå Žåãã¹ãã©ã€ã¯ãšèšãããã®æçã®ã¿ã§æ¬¡ã®ãã¬ãŒã ã«é²ã¿ãŸããã¹ãã©ã€ã¯ã§ãªãå Žåã¯ãæ®ã£ããã³ããã®... |
p00502 |
<H1>æãæ¥ã
(Hot days) </H1>
<br/>
<h2> åé¡</h2>
<p>
æ¥æ¬ãå¬ã§ãããã®ææïŒååçã«ãããªãŒã¹ãã©ãªã¢ã§ã¯æãæ¥ãç¶ããŠããïŒãªãŒã¹ãã©ãªã¢ã«äœã IOI åã¯ïŒãã D æ¥éã®å€©æ°äºå ±ãããšã«ïŒçãæã®èšç»ãç«ãŠãããšã«ããïŒi æ¥ç® (1 ⊠i ⊠D) ã®æé«æ°æž©ã¯ T<sub>i</sub> 床ã§ãããšäºå ±ãããŠããïŒ
</p>
<p>
IOI å㯠N çš®é¡ã®æãæã£ãŠããïŒãããã«ã¯ 1 ãã N ãŸã§ã®çªå·ãã€ããŠããïŒæ j (1 ⊠j ⊠N) ã¯æé«æ°æž©ã A<sub>j</sub> åºŠä»¥äž B<sub>j</sub> 床以äžã®æ¥ã«çãã®ã«é©ããŠããïŒ... |
p00017 |
<H1>Caesar Cipher</H1>
<p>
In cryptography, Caesar cipher is one of the simplest and most widely known encryption method. Caesar cipher is a type of substitution cipher in which each letter in the text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, 'a' would ... |
p02180 | <h1>F: åéæ¢ã</h1>
<h2>åé¡</h2>
<p>
$1$ ãã $N$ ãŸã§ã®çªå·ãä»ãããã $N$ 人ã®äººã«å¯ŸããŠïŒããéšå±ã®å
¥é宀èšé²ã $M$ åäžããããïŒ <br>
$i$ çªç®ã®å
¥é宀èšé²ã¯ $A_i\ B_i\ C_i$ ã® $3$ ã€ã®æŽæ°ãããªãïŒããã¯ä»¥äžã瀺ããŠããïŒ<br>
<ul>
<li>$C_i = 1$ ã®ãšãïŒæå» $A_i$ ã« $B_i$ ãããéšå±ã«å
¥å®€ããããšãè¡šã.</li>
<li>$C_i = 0$ ã®ãšãïŒæå» $A_i$ ã« $B_i$ ãããéšå±ããé宀ããããšãè¡šã.</li>
</ul>
</p>
... |
p00447 |
<H1>æ座æ¢ã </H1>
<h2>åé¡</h2>
<p>
ããªãã¯æ空ã®åçã®äžããæ座ãæ¢ããŠããïŒåçã«ã¯å¿
ãïŒæ¢ãããæ座ãšåã圢ã»åãã»å€§ããã®å³åœ¢ãã¡ããã©äžã€å«ãŸããŠããïŒãã ãïŒåçã®äžã«ã¯æ座ãæ§æããæ以å€ã«äœåãªæãåã£ãŠããå¯èœæ§ãããïŒ
</p>
<p>
äŸãã°ïŒå³ 1 ã®æ座ã¯å³ 2 ã®åçã«å«ãŸããŠããïŒäžžã§å²ãã§ç€ºããïŒïŒäžããããæ座ã®æã®åº§æšã x æ¹åã« 2ïŒ y æ¹åã« â3 ã ãå¹³è¡ç§»åãããšåçã®äžã®äœçœ®ã«ãªãïŒ
</p>
<p>
æ¢ãããæ座ã®åœ¢ãšåçã«åã£ãŠããæã®äœçœ®ãäžãããããšãïŒæ座ã®åº§æšãåçã®äžã®åº§æšã«å€æããããã«å¹³è¡ç§»åããã¹ãéãçããããã°ã©ã ãæžãïŒ ... |
p02929 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There are <var>2N</var> squares arranged from left to right. You are given a string of length <var>2N</var> representing the color of each of the squares.</p>
<p>The color of the <var>i</var>-th square ... |
p00914 |
<H1><font color="#000">Problem A: </font>Equal Sum Sets</H1>
<p>
Let us consider sets of positive integers less than or equal to <var>n</var>. Note that all elements of a set are different. Also note that the order of elements doesn't matter, that is, both {3, 5, 9} and {5, 9, 3} mean the same set.
</p>
<p>
Specifyi... |
p01606 |
<h2>Sliding GCD</h2>
<h2>Problem Statement</h2>
<p>èªç¶æ°ã®éå <var>S</var> ã«å¯ŸããŠïŒéå <var>\{ GCD(T) | T â S, T ã¯ç©ºã§ãªã \}</var> ã®èŠçŽ æ°ã <var>f(S)</var> ãšããïŒ</p>
<p>ããã§ïŒ<var>GCD(T)</var> 㯠<var>T</var> ã«å«ãŸãããã¹ãŠã®æ°ãå²ãåããããªæ倧ã®æŽæ°ã§ããïŒ<br />
ç¹ã«ïŒ<var>T</var> ãäžã€ã®æŽæ° <var>a</var> ã®ã¿ãããªããšã㯠<var>GCD(\{a\}) = a</var> ã§ããããšã«æ³šæããïŒ</p>
<... |
p02883 | <span class="lang-en">
<p>Score: <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3>
<p>Takahashi will take part in an eating contest. Teams of <var>N</var> members will compete in this contest, and Takahashi's team consists of <var>N</var> players numbered <var>1</var> through <var>N</var... |
p03791 | <span class="lang-en">
<p>Score : <var>900</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You are developing frog-shaped robots, and decided to race them against each other.</p>
<p>First, you placed <var>N</var> robots onto a number line.
These robots are numbered <var>1</var> through <var>N... |
p01256 |
<H1><font color="#000">Problem G:</font> Time Trial</H1>
<p>
Some people like finishing computer games in an extremely short time. Terry A. Smith is one of such
and prefers role playing games particularly.
</p>
<p>
He is now trying to find a shorter play for one of the key events in a role playing game. In this event... |
p03545 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Sitting in a station waiting room, Joisino is gazing at her train ticket.</p>
<p>The ticket is numbered with four digits <var>A</var>, <var>B</var>, <var>C</var> and <var>D</var> in this order, each bet... |
p01578 |
<H1><font color="#000">Problem I:</font> Sort by Hand</H1>
<p>
It's time to arrange the books on your bookshelf. There are <i>n</i> books in the shelf and each book has a unique number; you want to sort the books according to the numbers. You know that the quick sort and the merge sort are fast sorting methods, but i... |
p01082 |
<h1>Problem K: Escape of Lappin the Phantom Thief</h1>
<h2>Problem</h2>
<p>
æªçã©ããã³ã¯å®ç³ãçã¿ã«ãã£ãŠãããç°¡åã«å®ç³ãæã«ããããšãã§ããããå®ç³ã«ã¯ã»ã³ãµãŒãä»èŸŒãŸããŠãããèŠåããããã«å²ãŸããŠããŸã£ãã
</p>
<p>
èŠåããããã¯å®ç³ã«åãã£ãŠç§»åããããã«ä»çµãŸããŠãããã»ã³ãµãŒã¯ç°¡åã«å€ãããã«ãªãã£ãã®ã§ãå®ç³ã眮ããŠéèµ°ããããšã«ãããå®ç³ãã§ããã ãèŠåããããããé ãã«çœ®ããŠãéããããã®æé皌ããããããšã«ããã
</p>
<p>
æ·å°ã¯<var>n</var> × <var>m</var>ã®ãã¹ãããª... |
p03115 | <span class="lang-en">
<p>Score : <var>1000</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There is an infinitely large triangular grid, as shown below.
Each point with integer coordinates contains a lamp.</p>
<p><img alt="" src="https://img.atcoder.jp/wtf19/f617c94527a62ed72fe7db12b6d1f6b0.... |
p01128 |
<h1>Railroad Conflict</h1>
<p>
Nate U. Smith ã¯å€§éœåžåã®ééäŒç€Ÿãçµå¶ããŠããïŒãã®å€§éœåžåã«ã¯ïŒåœŒã®ééäŒç€Ÿä»¥å€ã«ã©ã€ãã«ã®ééäŒç€ŸãããïŒ2 瀟ã¯äºãã«ç«¶åé¢ä¿ã«ããïŒ
</p>
<p>
ãã®å€§éœåžåã§ã¯ïŒåè»ã®éè¡ã容æã«ããããïŒå
šãŠã®è·¯ç·ã¯äž¡ç«¯ã®é§
ãçµãã ç·åãçµè·¯ãšããŠããïŒãŸãïŒèžåçã®èšçœ®ããããããïŒå
šãŠã®è·¯ç·ã¯é«æ¶ãŸãã¯å°äžã«æ·èšãããŠããïŒæ¢åè·¯ç·ã¯ïŒå
šç·ã«ããã£ãŠé«æ¶ãèµ°ããïŒãŸãã¯å
šç·ã«ããã£ãŠå°äžãèµ°ããã®ããããã§ããïŒ
</p>
<p>
ãšããã§ïŒæè¿ïŒãã®å€§éœåžåã«ãã 2 ã€ã®è¡åº AïŒB ããããã«éçºãããŠããããšããïŒNate ã®äŒç€Ÿ... |
p00369 | <H1>Paper Fortune</H1>
<p>
If you visit Aizu Akabeko shrine, you will find a unique paper fortune on which a number with more than one digit is written.
</p>
<p>
Each digit ranges from 1 to 9 (zero is avoided because it is considered a bad omen in this shrine). Using this string of numeric values, you can predict ho... |
p02354 |
<script type="text/x-mathjax-config">
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});
</script>
<script type="text/javascript" src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-MML-AM_CHTML">
</script>
<H1>The Smallest Window I</H1>
<p>
For a giv... |
p00693 |
<h1>
Cyber Guardian
</h1>
<p>In the good old days, the Internet was free from fears and
terrorism. People did not have to worry about any cyber criminals or mad
computer scientists. Today, however, you are facing atrocious crackers
wherever you are, unless being disconnected. You have to protect
yourselves against ... |
p01981 | <h3>æ¹å
</h3>
<p>å¹³æ31幎4æ30æ¥ããã£ãŠçŸè¡ã®å
å·ã§ããå¹³æãçµäºãïŒãã®ç¿æ¥ããæ°ããå
å·ãå§ãŸãããšã«ãªã£ãïŒå¹³ææåŸã®æ¥ã®ç¿æ¥ã¯æ°å
å·å
幎5æ1æ¥ã«ãªãïŒ</p>
<p>ACM-ICPC OB/OGã®äŒ (Japanese Alumni Group; JAG) ãéçºããã·ã¹ãã ã§ã¯ïŒæ¥ä»ãåæŠïŒå
å·ãšããã«ç¶ã幎æ°ã«ãã£ãŠå¹Žãè¡šçŸããæ¥æ¬ã®æŠïŒãçšã㊠"å¹³æ <i>y</i> 幎 <i>m</i> æ <i>d</i> æ¥" ãšãã圢åŒã§ããŒã¿ããŒã¹ã«ä¿åãããŠããïŒãã®ä¿å圢åŒã¯å€æŽããããšãã§ããªãããïŒJAGã¯å
å·ãå€æŽãããªããšä»®å®ããŠåæŠã§è¡šããæ¥ä»ãããŒã¿ããŒã¹ã«ä¿åãïŒåºåã®éã«æ¥ä»ãæ£ã... |
p00739 |
<h1><font color="#000000">Problem F:</font> ICPC: Intelligent Congruent Partition of Chocolate</h1>
<!-- end en only -->
<!-- <img src="https://judgeapi.u-aizu.ac.jp/resources/images/A-1" width=300 align=left> -->
<!-- begin en only -->
<p>
The twins named Tatsuya and Kazuya love chocolate.
They have found a bar o... |
p02704 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Given are an integer <var>N</var> and arrays <var>S</var>, <var>T</var>, <var>U</var>, and <var>V</var>, each of length <var>N</var>.
Construct an <var>NÃN</var> matrix <var>a</var> that satisfy the fol... |
p03816 | <span class="lang-en">
<p>Score : <var>400</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke has decided to play a game using cards.
He has a deck consisting of <var>N</var> cards. On the <var>i</var>-th card from the top, an integer <var>A_i</var> is written.</p>
<p>He will perform the o... |
p02211 | <h2>ãããã ããŒããã</h2>
<p>square1001åãšE869120åã¯çžŠ $H$ è¡ã暪 $W$ åã®ã°ãªããã®äžçã«è¿·ã蟌ãã§ããŸããŸãã!</p>
<p>ãã®äžçã®ç¥ã¯èšããŸããã</p>
<p>ããªã³ãŽã $K$ åéããŠäºäººãåºäŒã£ããšãããããã°å
ã®äžçã«åž°ããã§ããããã</p>
<p>ãã®èšèãèããsquare1001åã¯ããªã³ãŽã $K$ å以äžéããŠE869120åããããã¹ãžåããããšã«ããŸããã</p>
<br>
<p>ããã§ãã°ãªããã®åãã¹ã¯æ¬¡ã®ããã«è¡šãããŸãã</p>
<p>'s'ïŒsquare1001åããããã¹ã§ãã</p>
<p>'e'ïŒE869120åããããã¹ã§ãã</p>
... |
p00386 | <h1>Meeting in a City</h1>
ã<p>
You are a teacher at Iazu High School is the Zuia Kingdom. There are $N$ cities and $N-1$ roads connecting them that allow you to move from one city to another by way of more than one road. Each of the roads allows bidirectional traffic and has a known length.
</p>
<p>
As a part of ... |
p02641 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Given are an integer <var>X</var> and an integer sequence of length <var>N</var>: <var>p_1, \ldots, p_N</var>.</p>
<p>Among the integers not contained in the sequence <var>p_1, \ldots, p_N</var> (not ne... |
p03953 | <span class="lang-en">
<p>Score : <var>800</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There are <var>N</var> rabbits on a number line.
The rabbits are conveniently numbered <var>1</var> through <var>N</var>.
The coordinate of the initial position of rabbit <var>i</var> is <var>x_i</var>.... |
p03400 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Some number of chocolate pieces were prepared for a training camp.
The camp had <var>N</var> participants and lasted for <var>D</var> days.
The <var>i</var>-th participant (<var>1 \leq i \leq N</var>) a... |
p01597 |
<H2>Problem G: Nezumi's Treasure</h2>
<p>There were a mouse and a cat living in a field. The mouse stole a dried
fish the cat had loved. The theft was found soon later. The mouse started
running as chased by the cat for the dried fish.</p>
<p>There were a number of rectangular obstacles in the field. The mouse
alway... |
p03050 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke received a positive integer <var>N</var> from Takahashi.
A positive integer <var>m</var> is called a <em>favorite number</em> when the following condition is satisfied:</p>
<ul>
<li>The quotient a... |
p02092 |
<h2>E: Red Black Balloons</h2>
<h3>Story</h3>
<p>Homura-chan's dream comes true. It means ICPC Asia regional contest 20xx will be held in Sapporo! Homura-chan has been working hard for the preparation. And finally, it's the previous day of the contest. Homura-chan started to stock balloons to be delivered to contestan... |
p02568 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You are given an array <var>a_0, a_1, ..., a_{N-1}</var> of length <var>N</var>. Process <var>Q</var> queries of the following types.</p>
<ul>
<li><code>0 l r b c</code>: For each <var>i = l, l+1, \dots... |
p00555 |
<h1>äŒæ©ã¹ããŒã¹ (Refreshment Area)</h1>
<h2>åé¡</h2>
<p>
äžççãªããã°ã©ãã³ã°ã³ã³ãã¹ããæ¥æ¬ã§éå¬ãããããšã«ãªãïŒçŸåšäŒå Žã®èšå¶ãè¡ãããŠããïŒãã®äŒå Žã¯ååæ¹åã« N ãã¹ïŒæ±è¥¿æ¹åã« M ãã¹ã®ãã¹ç®ç¶ã«åºåãããŠããïŒããã€ãã®ãã¹ã«ã¯ç«¶æçšã®æ©æã眮ãããŠããïŒ
</p>
<p>
ãã®ã³ã³ãã¹ãã§ã¯ïŒéžæã競æäžã«äŒæ©ããããã«ïŒè»œé£ã飲ã¿ç©ãªã©ã眮ããäŒæ©ã¹ããŒã¹ã 1 ç®æäŒå Žå
ã«èšããããšã«ãªã£ãïŒäŒæ©ã¹ããŒã¹ã¯ååæ¹åãŸãã¯æ±è¥¿æ¹åã«é£ç¶ãã D ãã¹ã§ãªããã°ãªããªãïŒãã ãïŒæ©æã®çœ®ããããã¹ç®ã«äŒæ©ã¹ããŒã¹ãèšããããšã¯ã§ããªãïŒ
</p>
<p>... |
p02138 | <h1>Problem B: U&U</h1>
<h2>Problem</h2>
<p>
$2$ã€ã®ããŒã ãããŒã UKUãšããŒã ããããããæåãããŒã UKUã«ã¯$N$人ãããŒã ããã«ã¯$M$人ã®äººãããã
ããŒã UKUãšããŒã ããã¯ãU&Uããšããã²ãŒã ãè¡ãããšã«ããããU&Uãã¯$2$ã€ã®ããŒã ã§å
±éã®ã¹ã³ã¢ãæã£ãŠãããäºãã«ååãããå
±éã®ã¹ã³ã¢ãæå°åããããšãç®çã§ããããU&Uãã¯æåããã¹ãŠã®äººã®äœåã$2$ã§ãå
±éã®ã¹ã³ã¢ã¯$0$ã®ç¶æ
ã§ä»¥äžã®ãããªæé ã§é²ããããã
</p>
<ol>
<li>ããŒã UKUã®äººã¯1人ãã€ãããŒã ããã®èª°ã$1$人ã«å¯ŸããŠã¡ã... |
p00105 |
<H1>Book Index</H1>
<p>
Books are indexed. Write a program which reads a list of pairs of a word and a page number, and prints the word and a list of the corresponding page numbers.
</p>
<p>
You can assume that a word consists of at most 30 characters, and the page number is less than or equal to 1000. The number of... |
p02991 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Ken loves <em>ken-ken-pa</em> (Japanese version of hopscotch). Today, he will play it on a directed graph <var>G</var>.
<var>G</var> consists of <var>N</var> vertices numbered <var>1</var> to <var>N</va... |
p03683 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke has <var>N</var> dogs and <var>M</var> monkeys. He wants them to line up in a row.</p>
<p>As a Japanese saying goes, these dogs and monkeys are on bad terms. <em>("ken'en no naka", literally "the ... |
p01344 |
<H1><font color="#000">Problem F: </font> Bouldering</H1>
<p>
Bouldering is a style of rock climbing. Boulderers are to climb up the rock with bare hands without supporting ropes. Your friend supposed that it should be interesting and exciting, so he decided to come to bouldering gymnasium to practice bouldering. Sin... |
p03379 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>When <var>l</var> is an odd number, the median of <var>l</var> numbers <var>a_1, a_2, ..., a_l</var> is the <var>(\frac{l+1}{2})</var>-th largest value among <var>a_1, a_2, ..., a_l</var>.</p>
<p>You ar... |
p00806 |
<H1><font color="#000">Problem D:</font> 77377</H1>
<p>
At the risk of its future, International Cellular Phones Corporation (ICPC) invests its resources in developing new mobile phones, which are planned to be equipped with Web browser, mailer, instant messenger, and many other advanced communication tools. Unless m... |
p01714 |
<h1>åé¡ C : Apples </h1>
<h2>åé¡æ</h2>
<p>
ãããšããã«éã®è
ã«èªä¿¡ããã€çåž«ãããŸããïŒ
çåž«ã¯ããæ¥ïŒããŠã£ãªã¢ã ãã«ãšããã¹ã€ã¹äººãïŒæ¯åã®é ã«ããããä¹ããŠé ãããç¢ã§æã¡èœãšãããã©ãŒãã³ã¹ã§æåã«ãªã£ãããšããã話ãèããŸããïŒ
ãããèããŠ"èªåã®ã»ãããã£ãšåã!!"ãšæã£ãçåž«ã¯åããŠãã人ã®äžã«ããããä¹ããŠæã¡ã¬ãããã©ãŒãã³ã¹ãèãã€ããŸããïŒ
</p>
<p>
çåž«ã¯åºå Žã« <var>N</var> 人ã®äººãéãïŒããããã®äººã®äžã«ããããä¹ããŸããïŒ
<var>i</var> çªç®ã®äººã¯æå» <var>t=0</var> ã®ãšãïŒåº§æš <var>(x_i, &t... |
p03729 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You are given three strings <var>A</var>, <var>B</var> and <var>C</var>. Check whether they form a <em>word chain</em>.</p>
<p>More formally, determine whether both of the following are true:</p>
<ul>
<... |
p01201 |
<H1><font color="#000"></font>Exact Arithmetic</H1>
<!-- Problem H -->
<p>
Let <i>X</i> be a set of all rational numbers and all numbers of form <i>q</i>√<i>r</i>, where <i>q</i> is a non-zero rational number and <i>r</i>
is an integer greater tha... |
p04003 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke's town has a subway system, consisting of <var>N</var> stations and <var>M</var> railway lines. The stations are numbered <var>1</var> through <var>N</var>. Each line is operated by a company. Eac... |
p00943 |
<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 I
Routing a Marathon R... |
p01651 |
<h2>Problem Statement</h2>
<p>
Let <var>b_i(x)</var> be the <var>i</var>-th least significant bit of <var>x</var>, i.e. the <var>i</var>-th least significant digit of <var>x</var> in base 2 (<var>i \geq 1</var>).
For example, since <var>6 = (110)_2</var>, <var>b_1(6) = 0</var>, <var>b_2(6) = 1</var>, <var>b_3(6) = 1<... |
p03396 | <span class="lang-en">
<p>Score : <var>1600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Yui loves shopping. She lives in Yamaboshi City and there is a train service in the city. The city can be modelled as a very long number line. Yui's house is at coordinate <var>0</var>.</p>
<p>There ar... |
p00410 | <h1>ãã³ãžã§ã³ïŒ</h1>
ã
<p>
ããªãã¯æåãªåéºå®¶ã§ããããã§ã«ïŒã€ã®ãã³ãžã§ã³ãå¶èŠãããããªãã¯ããã€ãã®éè·¯ãšå®ç©åº«ãèšãããæ°ããªãã³ãžã§ã³ã®å°å³ãå
¥æãããå°å³ã«ã¯ããããã®å®ç©åº«ã«ãã財å®ã®äŸ¡å€ãæžãããŠããã
</p>
<p>
ããªãã¯ãä»»æã®å®ç©åº«ãããã³ãžã§ã³ã«äŸµå
¥ããä»»æã®å®ç©åº«ãããã³ãžã§ã³ãè±åºããããšãã§ããã䟵å
¥ããè±åºãŸã§ã®éã«ãéè·¯ãéã£ãŠå®ç©åº«ã®éãäœåºŠã移åããŠã蚪ããå®ç©åº«ã®è²¡å®ãæã«å
¥ããããšãã§ãããå°å³ã«ããã°ãåéè·¯ã¯åæ¹åã«éãããšãã§ããã©ã®å®ç©åº«ããã©ã®å®ç©åº«ã«ãïŒæ¬ä»¥äžã®éè·¯ãçµç±ããŠãã©ãã€ãããšãã§ãããããããéè·¯ã¯äžåºŠéããšäºåºŠç®ä»¥éã¯äžåºŠç®ãšåãåãã«ã... |
p00040 |
<script type="text/x-mathjax-config">
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});
</script>
<script type="text/javascript" src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-MML-AM_CHTML">
</script>
<H1>ã¢ãã£ã³æå·</H1>
<p>
ç°¡åãªæå·æ³ã®äžã€ã«ãã¢ãã£ã³æå·ãšãããã®ããã... |
p02587 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>We have <var>N</var> strings of lowercase English letters: <var>S_1, S_2, \cdots, S_N</var>.</p>
<p>Takahashi wants to make a string that is a palindrome by choosing one or more of these strings - the s... |
p02790 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Given are <var>1</var>-digit positive integers <var>a</var> and <var>b</var>. Consider these two strings: the concatenation of <var>b</var> copies of the digit <var>a</var>, and the concatenation of <va... |
p03882 | <span class="lang-en">
<p>Score : <var>1000</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><style>
#nck {
width: 30px;
height: auto;
}
</style>
<p>There are <var>N</var> cities in a two-dimensional plane.
The coordinates of the <var>i</var>-th city is <var>(x_i, y_i)</var>.
In... |
p00257 |
<H1>ãããããäœã</H1>
<p>
倪éåã¯ãåäŸäŒã®å¬ãã§ã¿ããªã§éã¹ãããã«ãããããäœããŸãããã²ãŒã ããããããããããã«ãããµãã ãããšããããã以å€ã®ããããã®ãã¹ã®ããã€ãã«ãïŒã€é²ããããïŒã€æ»ããã®ããã«æ瀺ãæžã蟌ãã§ãããŸãããã«ãŒã¬ãããåããŠåºãæ°ã ãé²ã¿ãæ¢ãŸã£ããã¹ã«æ瀺ãæžã蟌ãã§ããã°ããã®æ瀺ã«åŸã£ãŠç§»åããŸãããã ããæ瀺ã«åŸã£ãŠé²ãã å
ã®ãã¹ã®æ瀺ã«ã¯åŸããŸããã
</p>
<p>
ã«ãŒã¬ããã¯ïŒããããæ°ãŸã§ã®éã®æ°ãç確çã§åºãããšãã§ãããã®ãšããŸãããŸãããããããã«éãããã倧ããªæ°ãåºããšãããæ瀺ã«åŸããšãããããããå
ã«é²ãã§ããŸããšãã¯ãããããã«ç§»åããŸãã... |
p00607 |
<H1><font color="#000000">Problem C:</font> Emacs-like Editor</H1>
<p>
Emacs is a text editor which is widely used by many programmers.
</p>
<p>
The advantage of Emacs is that we can move a cursor without arrow keys and the mice. For example, the cursor can be moved right, left, down, and up by pushing <span>f</span>... |
p03928 | <span class="lang-en">
<p>Score : <var>2100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke has a board with an <var>N \times N</var> grid, and <var>N \times N</var> tiles.</p>
<p>Each side of a square that is part of the perimeter of the grid is attached with a socket.
That is, each si... |
p01915 |
<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>K: AOR ã€ã«ã¡ããã®æ瞟</h1>
<h2>åé¡</h2>
<p>
AOR ã€ã«ã¡ãã㯠$N$ åã®ã¬ããŒã... |
p03181 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There is a tree with <var>N</var> vertices, numbered <var>1, 2, \ldots, N</var>.
For each <var>i</var> (<var>1 \leq i \leq N - 1</var>), the <var>i</var>-th edge connects Vertex <var>x_i</var> and <var>... |
p01446 |
<H1><font color="#000">Problem J:</font> Blue Forest</H1>
<p>
John is playing a famous console game named 'Tales of Algorithmers.' Now he is facing the last dungeon called 'Blue Forest.' To find out the fastest path to run through the very complicated dungeon, he tried to draw up the dungeon map.
</p>
<p>
The dungeo... |
p01016 | <h1>Problem A: Password</h1>
<p>
倪éåã¯ãèªåã®ããœã³ã³ãæã£ãŠããŠããã°ã€ã³æã®ãã¹ã¯ãŒããèšå®ããŠãããããããäžæ³šæã«ã倪éåã¯ãã®ãã¹ã¯ãŒããå¿ããŠããŸã£ããããã§ããã¹ã¯ãŒããã¡ã¢ããçŽãããããšãæãåºããçŽãèŠã€ãã倪éåã¯ãããèŠãŠé©ããããªããšçŽã¯åããŠããŠæçããååšããããšããã©ããã«æ±ãããããèªããªããªã£ãŠããã®ã ã倪éåã¯ãã®ã¡ã¢ãåèã«ãã¹ã¯ãŒããæšæž¬ããããšã«ããã
</p>
<h2>Problem</h2>
<p>
äºã€ã®æååA, BãäžãããããæååAã®äžã«æååBãå«ãŸããŠãããã©ãããå€å®ããå«ãŸããŠããå Žåã¯"Yes"ããããã§ãªããã°"No"ãåºå... |
p01503 |
<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 I:
Tampopo Machine
</h2... |
p01153 |
<H1><font color="#000">Problem G:</font> Gather on the Clock</H1>
<p>
There is a self-playing game called <i>Gather on the Clock</i>.
</p>
<p>
At the beginning of a game, a number of cards are placed on a ring. Each card is labeled by a
value.
</p>
<p>
In each step of a game, you pick up any one of the cards on the r... |
p03494 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There are <var>N</var> positive integers written on a blackboard: <var>A_1, ..., A_N</var>.</p>
<p>Snuke can perform the following operation when all integers on the blackboard are even:</p>
<ul>
<li>Re... |
p00312 |
<script type="text/x-mathjax-config">
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});
</script>
<script type="text/javascript" src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-MML-AM_CHTML">
</script>
<H1>ã«ãšã«ã¯ãŸã£ããåž°ã</H1>
<p>
äžå¹ã®ã«ãšã«ã巣穎ã«åž°ãããšããŠããŸãã... |
p00742 |
<h1><font color="#000000">Problem C:</font> Verbal Arithmetic</h1>
<p>
Let's think about <i>verbal arithmetic.</i>
</p>
<p>
The material of this puzzle is a summation
of non-negative integers represented in a decimal format,
for example, as follows.
</p>
<pre>
905 + 125 = 1030
</pre>
<p>
In verbal arithmetic... |
p01850 |
<script type="text/x-mathjax-config">
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});
</script>
<script type="text/javascript" src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS_HTML">
</script>
<h3>çŸäººäžéŠ</h3>
<p>çŸäººäžéŠã¯æ¥æ¬ã®äŒçµ±çãªã²ãŒã ã§ããïŒ ãã®ã²ãŒã ã§ã¯ <i>N... |
p02285 | <H1>Binary Search Tree III</H1>
<p>
Write a program which performs the following operations to a binary search tree $T$ by adding delete operation to B: Binary Search Tree II.
</p>
<ul>
<li><span>insert </span> $k$: Insert a node containing $k$ as key into $T$.</li>
<li><span>find </span>$k$: Report whether $T$ h... |
p03247 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke is introducing a <strong>robot arm</strong> with the following properties to his factory:</p>
<ul>
<li>The robot arm consists of <var>m</var> <strong>sections</strong> and <var>m+1</var> <strong>j... |
p00892 |
<H1><font color="#000">Problem I:</font> Intersection of Two Prisms</H1>
<p>
Suppose that <i>P</i><sub>1</sub> is an infinite-height prism whose axis is parallel to the <i>z</i>-axis, and <i>P</i><sub>2</sub> is also an infinite-height prism whose axis is parallel to the <i>y</i>-axis. <i>P</i><sub>1</sub> is defined... |
p01780 |
<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>A - Breadth-First Search by Fo... |
p02905 | <span class="lang-en">
<p>Score : <var>700</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>We have an integer sequence of length <var>N</var>: <var>A_0,A_1,\cdots,A_{N-1}</var>.</p>
<p>Find the following sum (<var>\mathrm{lcm}(a, b)</var> denotes the least common multiple of <var>a</var> and ... |
p00938 |
<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 D
Wall Clocks</h2>
<p... |
p03617 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You've come to your favorite store Infinitesco to buy some ice tea.</p>
<p>The store sells ice tea in bottles of different volumes at different costs.
Specifically, a <var>0.25</var>-liter bottle costs ... |
p02456 | <h1>Set: Delete</h1>
<p>
For a set $S$ of integers, perform a sequence of the following operations. Note that <u>each value in $S$ must be unique</u>.
</p>
<ul>
<li>insert($x$): Insert $x$ to $S$ and report the number of elements in $S$ after the operation.</li>
<li>find($x$): Report the number of $x$ in $S$ (... |
p00191 |
<H1>èæš</H1>
<p>
æ€ç©åŠè
ã®ãµããŒå士ã¯èæšçšã®ç¹æ®è¥æãäœçš®é¡ãçºæããŸããããã®è¥æãèæšã«äžãããšãç¬ãéã«èæšã®å€§ãããå€ãããŸãã
äœããè¥æã«ä»¥äžã®ããã«å¯äœçšãããããšãå€æããŸããã
</p>
<ul>
<li>1 åç®ã«äžããè¥æã ãã§ã¯ãèæšã®å€§ãããå€ãããŸããã</li>
<li>2 åç®ä»¥éã¯ããã®åã«äžããè¥æãšããã®çŽåã«äžããè¥æãšã®çµã¿åããã«ãã£ãŠèæšã«åœ±é¿ãäžããŸããè¯ã圱é¿ãäžãããšèæšã䌞ã³ãæªã圱é¿ãäžãããšèæšãçž®ãã§ããŸãããšããããŸãã</li>
</ul>
<p>
è©Šãã«ããµããŒå士㯠3 çš®é¡ã®è¥æ (è¥æ 1ã2ã3) ã«å¯Ÿããããæç¹ã§äžããè¥æ... |
p02006 | <h1>Problem C. Santa's Gift</h1>
<!--
Time Limit: 2 sec
Memory Limit: 512 MB
-->
<p>
Santa is going to pack gifts into a bag for a family. There are $N$ kinds of gifts. The size and the price of the $i$-th gift ($1 \leq i \leq N$) are $s_i$ and $p_i$, respectively. The size of the bag is $C$, thus Santa can pack g... |
p00484 |
<H1>å€æ¬å±(Books) </H1>
<p>
ããªãã®çºã«ã¯JOI å€æ¬åºãšããèèã®å€æ¬å±ãããïŒããªãã¯JOI å€æ¬åºãããå©çšããŠããïŒããããã®æ¬ã«ã¯åºæºäŸ¡æ Œãå®ãŸã£ãŠããïŒJOI å€æ¬åºã«è¡ãã°ãã®äŸ¡æ Œã§è²·ãåã£ãŠããããïŒ
</p>
<p>
JOI å€æ¬åºã§ã¯ïŒæ¬ãå°èª¬,挫ç»,éèªãªã©10 çš®é¡ã®ãžã£ã³ã«ã«åé¡ããŠæ±ã£ãŠããïŒãžã£ã³ã«ã«ã¯1ãã10 ãŸã§ã®çªå·ãä»ããããŠããïŒJOI å€æ¬åºã«ã¯ïŒåããžã£ã³ã«ã®æ¬ããŸãšããŠè²·ãåã£ãŠããããšé«å€ã§è²·ãåã£ãŠããããšãããµãŒãã¹ãããïŒå
·äœçã«ã¯ïŒåããžã£ã³ã«ã®æ¬ããŸãšããŠT åè²·ãåã£ãŠãããå ŽåïŒãã®ãžã£ã³ã«ã®æ¬ã®äžåãããã®è²·åäŸ¡æ ŒãåºæºäŸ¡æ ŒããT ... |
p02143 | <h1>Problem G: Painting</h1>
<h2>Problem</h2>
<p>é·ã$N$ã®æ°å$X$ãäžãããããåæç¶æ
ã§ã¯$X$ã®èŠçŽ ã¯å
šãŠ$0$ã§ãããå ããŠã$M$åã®æŽæ°ã®ãã¢$(A_i, B_i)$ãäžãããããåãã¢ã«å¯Ÿã以äžã®æäœãè¡ããæçµçãªæ°å$X$ãåºåããã</p>
<li>æŽæ°$j$ $(1 \le j \le N)$ã«å¯Ÿãã$(A_i+j)$ã$B_i$ã§å²ã£ãäœãã$X_j$ã«å ããã</li>
<h2>Input</h2>
<p>å
¥åã¯ä»¥äžã®åœ¢åŒã§äžããããã</p>
<pre>
$N$ $M$
$A_1$ $B_1$
$A_2$ $B_2$
:
$A_M$ $B_M$
<... |
p03302 | <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>.
Determine if <var>a+b=15</var> or <var>a\times b=15</var> or neither holds.</p>
<p>Note that <var>a+b=15</var> and <var>a\times b=15</var> do no... |
p01295 |
<H1><font color="#000">Problem C:</font>Champernowne Constant</H1>
<p>
Champernown constant is an irrational number represented in decimal by "<span>0.</span>" followed by
concatenation of all positive integers in the increasing order. The first few digits of this constant
are: 0.123456789101112...
</p>
<p>
Your task... |
p02840 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>We have an integer sequence <var>A</var> of length <var>N</var>, where <var>A_1 = X, A_{i+1} = A_i + D (1 \leq i < N )</var> holds.</p>
<p>Takahashi will take some (possibly all or none) of the elem... |
p03752 | <span class="lang-en lang-child hidden-lang">
<div id="task-statement">
Max Score: <var>350</var> Points <br/>
<section>
<h3>Problem Statement</h3>
There are <var>N</var> buildings along the line. The <var>i</var>-th building from the left is colored in color <var>i</var>, and its height is currently <var>a_i<... |
p01041 |
<h1>Problem E: Distinct Dictionary</h1>
<h2>Background</h2>
<p>
èŸæžããããªãæããè
ãããã圌ãã¯èªåã ãã®èŸæžãäœãããšã倧奜ãã§ããã
ããã§ããªãã¯åœŒãã®èŸæžã«ãèªç±ã«ã«ã¹ã¿ãã€ãºããæ©èœãä»ãå ããŠãããããšã«ããã
</p>
<h2>Problem</h2>
<p>
åãã«ãäœã®åèªãå
¥ã£ãŠããªã空ã®èŸæžãååšããã
<var>N</var>åã®æåå<var>S<sub>id</sub></var>ãš<var>Q</var>åã®ã¯ãšãªãäžããããã
åã¯ãšãªã¯ã¯ãšãªã®çš®é¡<var>k</var>ãšæååãæã<var>id</var>ã§äžããããã
ã¯... |
p03586 | <span class="lang-en">
<p>Score : <var>1400</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Process the <var>Q</var> queries below.</p>
<ul>
<li>You are given two integers <var>A_i</var> and <var>M_i</var>. Determine whether there exists a positive integer <var>K_i</var> not exceeding <var>2 ... |
p01411 |
<H1>E: Entangled with Lottery</H1>
<p>
ICPC ã§è¯ãæ瞟ãåããã«ã¯ä¿®è¡ãæ¬ ãããªãïŒããã㯠ICPC ã§åã¡ããã®ã§ïŒä»æ¥ãä¿®è¡ãããããšã«ããïŒ
</p>
<p>
ä»æ¥ã®ä¿®è¡ã¯ïŒãã¿ã ãããå©çšããŠïŒæªæ¥ãèªãåãã€ããŠéæ°ãé«ããããšãããã®ã§ããïŒãã¡ããçŽæã«é Œãã ãã§ãªãïŒç¶¿å¯ãªç¢ºçèšç®ãæ¬ ãããªãïŒ
</p>
<p>
ä»åèãããã¿ã ããã¯ïŒé·ã <i>H</i> + 1 ã»ã³ãã¡ãŒãã«ã®çžŠæ£ <i>N</i> æ¬ãããªãïŒãããã¯æ£ã®äžéšãèŠãŠïŒ<i>N</i> æ¬ã®ãã¡ 1 æ¬ãéžã¶ããšã«ãªãïŒæ£ã®äžéšã«ã¯ïŒå·Šãã <i>P</i> æ¬ç®ã®æ£ã®å Žæã«ã®ã¿ãåœããããš... |
p00650 |
<H1>Problem D: The House of Huge Family</H1>
<p>
Mr. Dango's family has an extremely huge number of members.
Once it had about 100 members, and now it has as many as population of a city.
It is jokingly guessed that the member might fill this planet in the near future.
</p>
<p>
Mr. Dango's family, the huge family, is... |
p01942 |
<h2>EïŒ ããçŒããã¹ã¿ãŒãšé£ã¹çã - Taiyaki-Master and Eater</h2>
<h3>ç©èª</h3>
<p>ã€ãããã¯ããçŒããäœãã®ããšãŠãäžæãããã³ã¡ããã¯ãããªã€ããããäœãããçŒãã倧奜ãã ãã<var>2</var> 人ã¯æ¯é±ããçŒããäœã£ãŠé£ã¹ãŠå¹žãã«éãããŠããããããçŒããäœã£ãŠãããã°ã§é£ã¹çãã®ãã³ã¡ããã«ã€ãŸã¿é£ãããããŠããŸãã®ãã€ãããã®æè¿ã®æ©ã¿ã ã</p>
<p>åŠæ ¡ç¥ã§ããçŒããäœãããšã«ãªã£ãã€ãããã¯ããã€ãã®ããã«ãã³ã¡ããã«ã€ãŸã¿é£ããããŠããã売äžãå¿é
ãªã®ã§ãèªåã泚ç®ããŠããç¯å²ã®ããçŒãã®æ§åãç¥ãããšãã§ããã°ãããªãšæã£ããåŠæ ¡ç¥ãæåã... |
p02397 |
<H1>Swapping Two Numbers</H1>
<p>
Write a program which reads two integers <var>x</var> and <var>y</var>, and prints them in ascending order.
</p>
<H2>Input</H2>
<p>
The input consists of multiple datasets. Each dataset consists of two integers <var>x</var> and <var>y</var> separated by a single space.
</p>
<p... |
p00200 |
<h1>éæ¥ã®çéå笊</h1>
<p>
倪éåã¯å€äŒã¿ã«é»è»ã§é·æ
ãããèšç»ãç«ãŠãŠããŸãããããé«æ ¡çã®èº«ã§ãã倪éåãäžãµæãããªãå€äŒã¿ã§å¯èœãªéãé ãã«æ
ãããã«ã¯ãåºæ¥ãã ãå®ãè¡ãæ¹ãšåºæ¥ãã ãæ©ãè¡ãæ¹ãããããèŠã€ããªããã°ããŸãèšç»ãç«ãŠãããŸããã倪éåãçŽ æµãªæ
ãæºå«ã§ããããã«ã倪éåã®èšç»ã®å©ãã«ãªãããã°ã©ã ãäœã£ãŠãããŸãããã
</p>
<br>
<center>
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE2_trip">
</center>
<br><br>
<p>
ç·è·¯ã®æ
å ±ãé§
ã®æ°ãå
¥åãšããåãåã... |
p00715 |
<H1>
<font color="#000">Problem F:</font> Name the Crossing
</H1>
<P>
The city of Kyoto is well-known for its Chinese plan: streets are
either North-South or East-West. Some streets are numbered, but most
of them have real names.
<br>
Crossings are named after the two streets crossing there,
e.g. Kawaramachi-Sanjo i... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.