question_id stringlengths 6 6 | content stringlengths 1 27.2k |
|---|---|
p01331 |
<h1><font color="#000">Problem K:</font> ã¯ãŒãããŒã«</h1>
<p>20XX幎ãé ãé¢ããå Žæã«å¯Ÿããå¹ççãªç©è³ªè»¢éæ¹åŒã確ç«ããã人é¡ã®å®å®ãžã®é²åºã¯ãŸããŸãå éãããããšã«ãªã£ãããã®è»¢éæ¹åŒã¯ãããé ãã«ç©è³ªã転éããããšãããšãååçã«ãã倧ããªç©è³ªã®è»¢éãå¯èœã«ãªãç¹ã§é©æ°çã§ãã£ãã転éæ¹åŒã®è©³çŽ°ã次ã«èšãã</p>
<p>ãŸã転é察象ãšãªãç©è³ªã¯ãã¹ã¿ãŒã座æš(1, 1)ã«ãŠåäœè³ªéæ¯ã®ããŒãã£ã¯ã«ã«åå²ããããåããŒãã£ã¯ã«ã«ã¯ãåã
ç°ãªãæ³¢åãšãã«ã®ãŒãäžããããªããã°ãªããªããæ³¢åãšãã«ã®ãŒã¯ã<i>V</i>ãš<i>H</i>ãããªãä»»æã®é·ãã®æååã§è¡šçŸã... |
p01624 |
<script src="./IMAGE/varmath.js" charset="UTF-8"></script>
<!--
<h3><u>Ononokomachi's Edit War</u></h3>
-->
<!-- end en only -->
<!-- begin ja only -->
<h1><u>å°éå°çºã®ç·šéåæŠ</u></h1>
<!-- end ja only -->
<!-- begin en only -->
<!--
<p>
English text is not available in this practice contest.
</p>
-->
<!-- end en only -->... |
p03619 | <span class="lang-en">
<p>Score : <var>900</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>In the city of Nevermore, there are <var>10^8</var> streets and <var>10^8</var> avenues, both numbered from <var>0</var> to <var>10^8-1</var>.
All streets run straight from west to east, and all avenues... |
p00936 |
<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
Squeeze the Cylinder... |
p01274 |
<H1><font color="#000">Problem B:</font> Magic Slayer</H1>
<p>
You are in a fantasy monster-ridden world. You are a slayer fighting against the monsters with magic
spells.
</p>
<p>
The monsters have <i>hit points</i> for each, which represent their vitality. You can decrease their hit points
by your magic spells: ea... |
p03249 | <span class="lang-en">
<p>Score : <var>900</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You are given a sequence <var>D_1, D_2, ..., D_N</var> of length <var>N</var>.
<strong>The values of <var>D_i</var> are all distinct.</strong>
Does a tree with <var>N</var> vertices that satisfies the f... |
p02008 | <h1>Problem E. Magic Triangles</h1>
<!--
Time Limit: 2 sec
Memory Limit: 512 MB
-->
<p>
Fallen angel Yohane plans to draw a magic symbol composed of triangles on the earth. By casting some magic spell on the symbol, she will obtain magic power; this is the purpose for which she will draw a magic symbol. The magic ... |
p00035 |
<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>
å¹³é¢äžã®ç°ãªã 4 ç¹ã$A (x_a, y_a)$, $... |
p02458 | <h1>Multi-Set</h1>
<p>
For a set $S$ of integers, perform a sequence of the following operations. Note that <u>multiple elements can have equivalent values in $S$</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 numbe... |
p00465 |
<H1> èªèšŒã¬ãã« </H1>
<h2>åé¡</h2>
<p>
ããªã㯠Just Odd Inventions 瀟ãç¥ã£ãŠããã ããã? ãã®äŒç€Ÿã®æ¥åã¯ããã å¥åŠãªçºæ (just odd inventions)ããããããšã§ãã.ããã§ã¯ç¥ã㊠JOI 瀟ãšåŒã¶.
</p>
<p>
JOI 瀟ã«ã¯ 2 ã€ã®äºåæããã,ããããåã倧ããã®æ£æ¹åœ¢ã®éšå±ããã¹ç®ç¶ã«äžŠãã§ã§ããŠãã.蟺ã§æ¥ããŠãããã¹ãŠã®éšå±ã®éã«,身å蚌ã«ããèªèšŒæ©èœã®ä»ããæããã.JOI 瀟ã§ã¯æ§ã
ãªã¬ãã«ã®æ©å¯æ
å ±ãæ±ã£ãŠãããã,éšå±ããšã«æ©å¯ã¬ãã«ãšããæ£ã®æŽæ°ãèšå®ãããŠãã,身å蚌ã®äºåæããšã«å®ããããéè² æŽæ°ã®èªèšŒã¬ãã«ã,æ©å¯... |
p01960 |
<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... |
p00672 |
<h1>Problem D: Dimensional Analysis</h1>
<p>
éã®æ¬¡å
ãšã¯ãçžç°ãªãéã®éã®é¢ä¿åŒããå
·äœçæ°å€ãç¡èŠããŠéã®çš®é¡ãšãã®ã¹ãä¹ã ãã«çç®ããæŠå¿µã§ãããå
·äœçã«ã¯å®æ°ä¿æ°ãç¡èŠããçåŒãšããŠã次å
ã®é¢ä¿åŒãè¡šããããªãã¡ãé q ã®æ¬¡å
ã[ q ]ãšè¡šãã°ã以äžã®ãããªããã€ãã®æ¬¡å
ã®é¢ä¿åŒãäŸç€ºã§ããã</p>
<ul>
<li>[é¢ç©] = [é·ã]<sup>2</sup></li>
<li>[äœç©] = [é·ã]<sup>3</sup></li>
<li>[éã] = [é·ã][æé]<sup>-1</sup></li>
<li>[å é床] = [é·ã][æé]<sup>-2</... |
p00388 | <h1>Design of a Mansion</h1>
<p>
Our master carpenter is designing a condominium called Bange Hills Mansion. The condominium is constructed by stacking up floors of the same height. The height of each floor is designed so that the total height of the stacked floors coincides with the predetermined height of the condo... |
p00222 |
<H1>åã€åçŽ æ°</H1>
<p>
(<var>a, a+2, a+6, a+8</var>) ã®ããã«äžŠãã 4 ã€ã®çŽ æ°ã®çµãåã€åçŽ æ°ãšãããŸããåã€åçŽ æ°ãæ§æããåã€ã®çŽ æ°ã®ãã¡ãæ倧ã®æ°ããã®åã€åçŽ æ°ã®å€§ãããšåŒã³ãŸããäŸãã°ãæãå°ãã倧ããã®åã€åçŽ æ°ã¯ã(5, 7, 11, 13) ã®çµã§ããããã®å€§ãã㯠13 ã§ãã次ã«å€§ããåã€åçŽ æ°ã¯ã(11, 13, 17, 19) ã®çµã§ããã®å€§ãã㯠19 ã§ãã
</p>
<p>
æŽæ° <var>n</var> (13 ≤ <var>n</var> ≤ 10,000,000) ãå
¥åãšãã倧ããã <var>n</var> 以äžã«ãª... |
p01063 |
<h1>Rubik Dungeon</h1>
<h2>Problem</h2>
<p>
ããªãã¯<var>n</var> à <var>n</var> à <var>n</var>ã®ç«æ¹äœã®ã«ãŒããã¯ãã¥ãŒãåã®ãã³ãžã§ã³ã«ãã£ãŠããã<br>
ããªãã¯çŸåš(<var>x<sub>1</sub></var>,<var>y<sub>1</sub></var>,<var>z<sub>1</sub></var>)ã®éšå±ã«ããã<br>
ç®æšã®å®ã¯(<var>x<sub>2</sub></var>,<var>y<sub>2</sub></var>,<var>z<sub>2</sub></var>)ã®éšå±ã«ããã<br>
ããªãã¯é£æ¥... |
p01599 |
<h2>Problem I: Train King</h2>
<p>Roland has been given a mission of dangerous material transfer by Train
King. The material is stored in the station A and subject to being transferred
to the station B. He will bring it by direct trains between A and B, one (or
zero) unit per ride.</p>
<p>Your task is to write a pro... |
p01433 |
<script type="text/javascript" src="./varmath.js" charset="UTF-8"></script>
<h2>åé¡æ</h2>
<p>
人éã®é女 KLARISSA ã¯ã³ã³ãµãŒãããŒã«ã®äžã§åšããæ¥ã®æåã倢èŠã€ã¥ããŠããïŒåœŒå¥³ã®éåœã®è»èŒªã¯å
·çŸåãïŒã³ã³ãµãŒãããŒã«ã®äžã§è»¢ããç¶ããŠããïŒ
</p>
<p>
<i>äœåæå</i>ã¯ãã®éåœã®è»èŒªãåã§ã¯ãªãã«ã©ãã«ãªæ£æ¹åœ¢ã§ããããšã«æ°ãã€ããïŒéåœã®è»èŒªã¯ã³ã³ãµãŒãããŒã«ã®è¥¿ããæ±ãžè»¢ããããšããŠããïŒ<i>äœåæå</i>ã¯éåœã®è»èŒªãããæãŸã§è»¢ãã£ããšãã«ãã®äžã«é£ã³ç§»ãããšã«ããïŒããã§é£ã³ç§»ãã¹ãé¢ã®è²ãç¥ãïŒé£ã³... |
p01126 |
<h1>Amida, the City of Miracle</h1>
<p>
å¥è·¡ã®éœåžã¢ããïŒAmida, the City of MiracleïŒã®åžé·ã¯ä»ã®åžã®ããã«éžæã§éžã¶ã®ã§ã¯ãªãïŒãã€ãŠé·ãæ¿æš©éäºãšå€©å€å°ç°ã«ããç²åŒãããã®éœåžã¯ïŒåè£è
å
šå¡ãå
¬å¹³ã«éžã³ïŒãã€å¹žéã®æã®äžã«çãŸããè
ãåžé·ã«ããããã«ïŒåè£è
å
šå¡ã®éåœãããã«ãã ããããšã«ããã®ã§ããïŒåŸã«ãã¿ã ãããšåŒã°ããããã§ããïŒ
</p>
<p>
éžæã¯ä»¥äžã®ããã«è¡ãããïŒåè£è
æ°ãšåæ°ã®é·ã瞊ç·ãåŒããïŒããã«ããã€ãã®æšªç·ãããã«åŒãããïŒæšªç·ã¯é£æ¥ãã瞊ç·ã®éäžå士ãçµã¶ããã«åŒãããïŒããããã®çžŠç·ã®äžã«ã¯ãåœéžããšæžãããŠããïŒã©ã®çžŠ... |
p01576 |
<H1><font color="#000">Problem F:</font> Exciting Bicycle</H1>
<p>
You happened to get a special bicycle. You can run with it incredibly fast because it has a turbo engine. You can't wait to try it off road to enjoy the power.
</p>
<p>
You planned to go straight. The ground is very rough with ups and downs, and can ... |
p03818 | <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... |
p01825 |
<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 H:
Laser Cutter
</h2>... |
p00737 |
<h1><font color="#000000">Problem D:</font> Twirling Robot </h1>
<!-- end en only -->
<!-- begin en only -->
<p>
Let's play a game using a robot on a rectangular board
covered with a square mesh (Figure D-1).
The robot is initially set at the start square in the northwest corner
facing the east direction.
The goal... |
p00367 | <!--<H1>Breakfast, Lunch and Supper</H1>-->
<h1>Three Meals</h1>
<p>
You are running a restaurant that serves dishes only three times a day. Each of your customer has his/her own separate time zones for eating breakfast, lunch and supper. Thus, your customer enjoys your dish only when he/she visits your restaurant to ... |
p03398 | <span class="lang-en">
<p>Score : <var>1600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Let <var>X = 10^{100}</var>. Inaba has <var>N</var> checker pieces on the number line, where the <var>i</var>-th checker piece is at coordinate <var>X^{i}</var> for all <var>1 \leq i \leq N</var>.</p>
... |
p03662 | <span class="lang-en">
<p>Score : <var>400</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Fennec and Snuke are playing a board game.</p>
<p>On the board, there are <var>N</var> cells numbered <var>1</var> through <var>N</var>, and <var>N-1</var> roads, each connecting two cells. Cell <var>a_... |
p02970 | <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> apple trees in a row. People say that one of them will bear golden apples.</p>
<p>We want to deploy some number of inspectors so that each of these trees will be inspected.</p>
<p... |
p03232 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There are <var>N</var> blocks arranged in a row, numbered <var>1</var> to <var>N</var> from left to right.
Each block has a weight, and the weight of Block <var>i</var> is <var>A_i</var>.
Snuke will per... |
p02589 | <span class="lang-en">
<p>Score : <var>700</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Limak can repeatedly remove one of the first two characters of a string,
for example <var>abcxyx \rightarrow acxyx \rightarrow cxyx \rightarrow cyx</var>.</p>
<p>You are given <var>N</var> different... |
p02073 | <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: ... |
p02423 | <h1>Bit Operation I</h1>
<p>
Given a non-negative decimal integer $x$, convert it to binary representation $b$ of 32 bits. Then, print the result of the following operations to $b$ respecitvely.
</p>
<ul>
<li>Inversion: change the state of each bit to the opposite state</li>
<li>Logical left shift: shift left by 1</... |
p02136 | <h1>Problem M: Manhattan Bomb</h1>
<h2>Problem</h2>
<p>
2次å
å¹³é¢äžã«$n$åã®ç匟ããããç匟ã«ã¯ãããã1ãã$n$ãŸã§ã®çªå·ãå²ãæ¯ãããŠããã$i$çªç®ã®ç匟ã¯åº§æš$(x_i,y_i)$ã«ååšããŠããã<br>
ãªããã©ã®ç匟ãåç¹ããã®ãã³ããã¿ã³è·é¢ãçããããšãåãã£ãŠããã<br>
$i$çªç®ã®ç匟ãççºãããšãã座æš$(x_i,y_i)$ããã®ãã³ããã¿ã³è·é¢ã$r_i$以å
ã®åº§æšã«ååšããŠããç匟ãé£éçã«ççºããã<br>
$n$åã®ç匟ããããã«ã€ããŠããã®ç匟ã®ã¿ã«çç«ããå Žåã«ãççºããã«æ®ãç匟ã®åæ°ãæ±ããã
</p>
<h2... |
p02566 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>You are given a string of length <var>N</var>. Calculate the number of distinct substrings of <var>S</var>.</p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 \leq N ... |
p03727 | <span class="lang-en">
<p>Score : <var>1400</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There is a tree with <var>N</var> vertices numbered <var>1</var> through <var>N</var>.
The <var>i</var>-th of the <var>N-1</var> edges connects vertices <var>a_i</var> and <var>b_i</var>.</p>
<p>Initia... |
p02835 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Given are three integers <var>A_1</var>, <var>A_2</var>, and <var>A_3</var>.</p>
<p>If <var>A_1+A_2+A_3</var> is greater than or equal to <var>22</var>, print <code>bust</code>; otherwise, print <code>w... |
p00808 |
<H1><font color="#000">Problem F:</font> Young, Poor and Busy</H1>
<p>
Ken and Keiko are young, poor and busy. Short explanation: they are students, and ridden with part-time jobs. To make things worse, Ken lives in Hakodate and Keiko in Tokyo. They want to meet, but since they have neither time nor money, they have ... |
p03377 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There are a total of <var>A + B</var> cats and dogs.
Among them, <var>A</var> are known to be cats, but the remaining <var>B</var> are not known to be either cats or dogs.</p>
<p>Determine if it is poss... |
p03459 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>AtCoDeer the deer is going on a trip in a two-dimensional plane.
In his plan, he will depart from point <var>(0, 0)</var> at time <var>0</var>, then for each <var>i</var> between <var>1</var> and <var>N... |
p01464 |
<H1>Sunny Graph</H1>
<p>
The Sun is a great heavenly body.
The Sun is worshiped by various religions.
Bob loves the Sun and loves any object that is similar to the Sun.
He noticed that he can find the shape of the Sun in certain graphs.
He calls such graphs "Sunny".
</p>
<p>
We define the property "Su... |
p03009 | <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> squares arranged in a row, numbered <var>1</var> to <var>N</var> from left to right. Takahashi will stack building blocks on these squares, on which there are no blocks yet.</p>
<... |
p01034 | <h1>Problem H: Yu-kun Likes a Directed Graph</h1>
<h2>Background</h2>
<p>
äŒæŽ¥å€§åŠä»å±å¹Œçšåã¯ããã°ã©ãã³ã°ã倧奜ããªåäŸãéãŸã幌çšåã§ãããåå
ã®äžäººã§ããããåã¯ãããã°ã©ãã³ã°ãšåãããããçµµæãã倧奜ãã ã
ãããŸã§ããåã¯ãäžžãšç¢å°ã§æ²¢å±±çµµãæžããŠãããç¢å°ã¯å¿
ãäžžãšäžžãçµã¶ããã«ããŠæããŠãããããæ¥ããåã¯ãããã®çµµãã°ã©ãã§ããããšãç¥ãã
</p>
<p>
äžžã¯é ç¹ãšåŒã°ããç¢å°ã¯èŸºãšåŒã°ããŠããããããæŽã«ããåã¯ãç¢å°ãæãéã«ãå¿
ããã®äžã«ïŒã€æ£ã®æŽæ°ãæžããŠããããã®ããã«ã蟺ã«éã¿ãããæåãªèŸºãããªãã°ã©ãã¯éã¿ä»ãæåã°ã©ã... |
p00275 |
<H1>åäž»ãããã®çµæ«</H1>
<p>
çŸäººäžéŠã®æã䜿ã£ãéæ¯ã®ïŒã€ã«ããåäž»ãããããšãããã®ããããŸããçµµæã ãã䜿ãç°¡åãªéæ¯ãªã®ã§åºã楜ããŸããŠããŸããããŸãã«ã¯æ§ã
ãªæŽŸçåããããŸãããããã§èããåäž»ãããã¯N人ã®åå è
ã§ã以äžã®ãããªã«ãŒã«ã§è¡ããŸãã
</p>
<ul>
<li> ïŒïŒæã®ãç·ããïŒïŒæã®ãåäž»ããïŒïŒæã®ã姫ããèšïŒïŒïŒæã®æã䜿ãã</li>
<li> çµµãèŠããªãããã«æãè£ãããã«ããŠããæ··ãããæå±±ããã€ããã</li>
<li> åå è
ã®äžäººç®ããé çªã«ïŒæãã€æå±±ã®æãåŒããN人ç®ã®æ¬¡ã¯ããŸãäžäººç®ããç¹°ãè¿ãã
<ul>
<li> åŒããæãç·ãªããåŒã... |
p02248 |
<H1>String Search</H1>
<p>
Find places where a string <var>P</var> is found within a text <var>T</var>.
Print all indices of <var>T</var> where <var>P</var> found. The indices of <var>T</var> start with 0.
</p>
<H2>Input</H2>
<p>
In the first line, a text <var>T</var> is given. In the second line, a string ... |
p01937 |
<!-- - - - - - 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>
<h... |
p00625 |
<H1><font color="#000000">Problem E:</font> Frisbee Dogs</H1>
<p>
ã¯ã¬ã€ã³ã¯, 圌女ã®æç¬ã§ãã Jack ãããªã¹ããŒããã°å€§äŒã«åºå ŽãããããšããŠãã. ããã, 圌女㯠Jack ãããæ瞟ãåãããèªä¿¡ãç¡ã. 圌女ã®ããã«, 倧äŒãã·ãã¥ã¬ãŒãã㊠Jack ã®æ瞟ãèŠç©ããããã°ã©ã ãäœæããŠã»ãã.
</p>
<p>
ãã®å€§äŒã¯, 2次å
å¹³é¢äžã«ãã N å¹ã®ç¬ã«ãã£ãŠè¡ããã. 倧äŒã®éå§æç¹ã«ãããŠ, <i>i</i> çªç®ã®ç¬ã¯ (<i>D<sub>i</sub>x</i>, <i>D<sub>i</sub>y</i>) ã®äœçœ®ã«ãã. <... |
p02618 | <span class="lang-en">
<div class="part">
<section>
<h3>Problem Statement</h3><p>AtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For conven... |
p00330 |
<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>
ã³ã³ãã¥ãŒã¿ã§æ±ãããããŒã¿ã®æå°åäœãããã(bit... |
p01872 |
<h2>A: ãã€ãã³ã㌠- My Number -</h2>
<h3>åé¡</h3>
<p>ãã£ããªãŒãïŒé
å»é
å»ïŒ</p>
<p>ãã£ïŒç§ãä»æ¥ããæ§ãã®ãã®äŒç€Ÿã§åãããšã«ãªã£ããã ïŒ</p>
<p>ãããªã®ã«ãåæ¥ããå¯åã ãªããŠâŠïŒïŒ</p>
<p>ä»æ¥ã¯äŒç€Ÿã«ãã€ãã³ããŒãæããªããã°ãªããªã倧åãªæ¥ãªã®ã«âŠïŒ</p>
<p>ã¿ããªç¥ã£ãŠãããšæãããã©ãäžå¿ãã€ãã³ããŒã®èª¬æããããïŒ</p>
<p>ãã€ãã³ããŒã¯è¡æ¿æç¶ãã«ãããå人ãèå¥ããããã«çšãããã <var>12</var> æ¡ãããªãæ°åå (<var>P_{11} P_{10} P_{9}</var> ... <var>P_{1... |
p00760 |
<h1>Millennium</h1>
<p>
A wise king declared a new calendar. "Tomorrow shall be the first day of the calendar, that is, the day 1 of the month 1 of the year 1. Each year consists of 10 months, from month 1 through month 10, and starts from a <i>big month</i>. A common year shall start with a big month, followed by... |
p01521 |
<h1>B - ç°¡æãªã»ã</h1>
<h2>åé¡æ</h2>
<p>
Båã¯ãªã»ãã倧奜ãã§ãã (ãªã»ãã®ã«ãŒã«ã«ã€ããŠã¯<a href="http://ja.wikipedia.org/wiki/%E3%82%AA%E3%82%BB%E3%83%AD_(%E9%81%8A%E6%88%AF)">Wikipediaã®ãªã»ãã®ããŒãž</a>ãåç
§ããïŒããã¹ãã«ã€ããŠã Wikipedia ã«æžãããŠãããšããïŒé§ãæã€ããšãã§ããªãå Žåã®ã¿ãã¹ã§ãããã®ãšãïŒãã¹ã®åæ°ã«å¶éã¯ç¡ããã®ãšããïŒ)
Båã¯é§ã®åæé
眮ã«ãã£ãŠã²ãŒã ã®çµæãã©ã®ããã«å€ããã®ãã«èå³ãããïŒ
ããããããªã 2 次å
ã®ç€é¢ã§èããã®ã¯é£ãã... |
p01171 |
<H1><font color="#000">Problem A:</font> Everlasting...?</H1>
<p>
Everlasting Sa-Ga, a new, hot and very popular role-playing game, is out on October 19, 2008.
Fans have been looking forward to a new title of Everlasting Sa-Ga.
</p>
<p>
Little Jimmy is in trouble. He is a seven-year-old boy, and he obtained the Everl... |
p02474 | <h2>Multiplication of Big Integers</h2>
<p>
Given two integers $A$ and $B$, compute the product, $A \times B$.
</p>
<h3>Input</h3>
<p>
Two integers $A$ and $B$ separated by a space character are given in a line.
</p>
<h3>Output</h3>
<p>
Print the product in a line.
</p>
<h3>Constraints</h3>
<ul>
<li>$-1 ... |
p00449 |
<H1>è¹æ
</H1>
<h2>åé¡</h2>
<p>
JOIåœã«ã¯ïŒn 島ã®å³¶ãããïŒå島ã«ã¯ 1 ãã n ãŸã§ã®çªå·ãä»ããããŠããïŒçŸåšïŒJOIåœã§ã¯å島ã®éãçµã¶èªè·¯ç¶²ã®æŽåãé²ãã§ããïŒ
</p>
<p>
ããªãã¯ïŒè¹è¶ã®å笊ãæ±ã£ãŠãããã±ããã»ã³ã¿ãŒã«å€åããŠããïŒJOIåœã«ã¯è¹è¶ã䜿ã£ãŠïŒã§ããéãå®äŸ¡ã«ïŒå³¶ãšå³¶ã®éãæ
è¡ããããšèããŠãã人ã沢山ããïŒåœŒãã¯ïŒåºçºå°ãšç®çå°ã泚æ祚ã«èšå
¥ããŠïŒããªãã®ãšããã«éã£ãŠããïŒ
</p>
<p>
ããªãã®ä»äºã¯ïŒå®¢ãã泚æ祚ãåãåã£ããããã«ïŒããã€ãã®è¹è¶ãä¹ãç¶ãã§ïŒåºçºå°ãšç®çå°ãçµã¶èªè·¯ã®äžã§ïŒãã£ãšãå®äŸ¡ãªéè³ãèšç®ãïŒå®¢ã«äŒããããšã§ããïŒ
ã... |
p02024 | <h2>J: éœ (City)</h2>
<p>ãµã³ã¿ã¯ããéœã«ãã¬ãŒã³ããå±ããããšã«ããã</p>
<p>ãã®éœã¯åå $H$ åºç» à æ±è¥¿ $W$ åºç»ã«åããããé·æ¹åœ¢ã®åœ¢ãããŠãããååºç»ã«ãã¬ãŒã³ããå±ãã家ã 1 ã€ãã€ããã</p>
<p>åããæ°ã㊠$X$ çªç®ã西ããæ°ã㊠$Y$ çªç®ã®åºç»ã $(X, Y)$ ã§è¡šãã</p>
<p>ãµã³ã¿ã¯æ¬¡ã®æ¡ä»¶ã§ç§»åããã</p>
<ul>
<li>ã¯ããã«åºç» $(S, T)$ ã«éãããã®å Žæããã¹ã¿ãŒãããã</li>
<li>1 åã®ç§»åã§æ±è¥¿ååã«é£ãåãåºç»ã«ç§»åã§ããè¡ã®å€ã«ã¯ç§»åã§ããªãã</li>
<li>1 床蚪ããåºç»ã«ã¯ã2 床ãšå
¥ã... |
p00019 |
<H1>Factorial</H1>
<p>
Write a program which reads an integer <var>n</var> and prints the factorial of <var>n</var>. You can assume that <var>n</var> ≤ 20.
</p>
<H2>Input</H2>
<p>
An integer <var>n</var> (1 ≤ <var>n</var> ≤ 20) in a line.
</p>
<H2>Output</H2>
<p>
Print the factorial of <var>n</var> in a ... |
p01258 |
<H1><font color="#000">Problem I:</font> Memory Match</H1>
<p>
Memory match is a single-player game which employs a set of 2<i>M</i> cards. Each card is labeled with a
number between 1 and <i>M</i> on its face. For each number <i>i</i> (1 ≤ <i>i</i> ≤ <i>M</i>), there are exactly two cards which
have the number... |
p03265 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There is a square in the <var>xy</var>-plane. The coordinates of its four vertices are <var>(x_1,y_1),(x_2,y_2),(x_3,y_3)</var> and <var>(x_4,y_4)</var> in counter-clockwise order.
(Assume that the posi... |
p01608 |
<h2>1</h2>
<h2>Problem Statement</h2>
<p>é·ã<var>n</var>ã®ãããåãããïŒ</p>
<p>å·Šãã<var>i</var>çªç®ã®ãããã1ã®ãšãïŒã¹ã³ã¢ã<var>a_i</var>ç¹åŸãããïŒ<br />
å·Šãã<var>i</var>çªç®ã®ããããäžå¿ã«è·é¢<var>w</var>以å
ã«ãã1ã®åæ°(<var>=|\{j \in \{1,...,n\}â©\{i-w,...,i+w\} | å·Šãã</var>j<var>çªç®ã®ãããã1\}|</var>)ãå¥æ°ã®ãšãïŒã¹ã³ã¢ã<var>b_i</var>ç¹åŸãããïŒ</p>
<p>ã¹ã³ã¢ãæãå€ãåŸããããããªããã... |
p03635 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>In <em>K-city</em>, there are <var>n</var> streets running east-west, and <var>m</var> streets running north-south. Each street running east-west and each street running north-south cross each other. We... |
p02927 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Today is August <var>24</var>, one of the five Product Days in a year.</p>
<p>A date <var>m</var>-<var>d</var> (<var>m</var> is the month, <var>d</var> is the date) is called a Product Day when <var>d</... |
p03320 | <span class="lang-en">
<p>Score : <var>500</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Let <var>S(n)</var> denote the sum of the digits in the decimal notation of <var>n</var>.
For example, <var>S(123) = 1 + 2 + 3 = 6</var>.</p>
<p>We will call an integer <var>n</var> a <strong>Snuke numb... |
p03770 | <span class="lang-en">
<p>Score : <var>1000</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke arranged <var>N</var> colorful balls in a row.
The <var>i</var>-th ball from the left has color <var>c_i</var> and weight <var>w_i</var>.</p>
<p>He can rearrange the balls by performing the follo... |
p02862 | <span class="lang-en">
<p>Score : <var>400</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There is a knight - the chess piece - at the origin <var>(0, 0)</var> of a two-dimensional grid.</p>
<p>When the knight is at the square <var>(i, j)</var>, it can be moved to either <var>(i+1,j+2)</var>... |
p02161 | <h1>Problem M: 1333</h1>
<h2>Problem</h2>
<p>
é·ã$N$ã®æåå$S$ãäžããããã
以äžã®ã¯ãšãªã$Q$ååŠçããã<br>
<br>ã¯ãšãª<br>
$S[L: R]$ã$S$ã®$L$æåç®ãã$R$æåç®ãŸã§ïŒäž¡ç«¯ãå«ãïŒãããªãæååãšããã<br>
$ S[L: R] $ãé©åœãªæåå$A,B,C,X$ãçšããŠ$AXBXCX(1 \leq |A|,|B|,|C|,|X|)$ ãšè¡šãããšãèãããã®ãããª$X$ã®äžã§æé·ã®ãã®ã®é·ããåºåããã<br>
ãã ãããã®ãããª$X$ãååšããªãå Žåã¯ä»£ããã«0ãåºåããã<br>
</p>
<h2>I... |
p00633 |
<H1><font color="#000000">Problem 07:</font> Crop Circle</H1>
<p>
ã¢ã«ãŒã³ãã³ã®åºå€§ãªèŸ²å°ã«çªåŠãã¹ããªãŒãµãŒã¯ã«ãåºæ²¡ããããã¹ããªãŒãµãŒã¯ã«ã¯éãªã£ãŠãããã®ãããã³ãšãããã®ã倧ãããã®ãå°ãããã®ãšåèš <i>n</i> å確èªãããã
</p>
<p>
ãããã¹ããªãŒãã³ã¿ãŒã空äžãããã¹ããªãŒãµãŒã¯ã«ã®å
šäœåãæ®åœ±ããããšè©Šã¿ããšãããååã®èŒªéãã¯ã£ããããŠããªãã£ããããæ åã«ãã®çŸããæš¡æ§ãæ ãåºãããšãé£ããããšãåãã£ãã
</p>
<p>
ããã§ããã®ãã¹ããªãŒãã³ã¿ãŒã¯èŒªéã«æ²¿ã£ãŠç¹æ®çŽ æã®çŽãèšçœ®ãã茪éã匷調ããææ¡ãããã
<... |
p01921 |
<link rel="stylesheet" href="css/description.css" type="text/css" />
<script language="JavaScript" type="text/javascript" src="js/varmath2017.js" charset="UTF-8"></script>
<h2>F: æšãé ãã®ãªã森ã®äž</h2>
<h3>ç©èª</h3>
<p>
ãæšã¯ããã§ãã
å«è¶åºãã¿ãŒãã«ããŠã¹ããçµå¶ãããã³ã¡ããã¯ãæšã«äžŠã
ãªãã¬ææ
ãæã£ãŠããããªãã§ããæšã®äžåã®ããæ¹ã«å¿ãæŽããããããããããããªãã³ã¡ããã®æšãžã®ææ
ã確ããããããåãå«è¶åºã§... |
p00263 |
<H1>éåã®å</H1>
<p>
以äžã®ããã«ãå³ãã 7 ãããåãå°æ°éšãç¶ã24 ãããåãæŽæ°éšã§ãäžçªå·Šã® 1 ãããåã笊å·éšãšãã 32 ãããå®æ°åãèãã(b<sub>1</sub>, ... , b<sub>32</sub> 㯠0 ã1 ãè¡šãïŒã
</p>
<center>
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE2_kongoType1" width="780">
</center><br/>
<p>
ãã®åœ¢åŒãã人ãç解ãããã 10 é²æ°è¡šçŸã«çŽããšãã¯ã以äžã®ããã«è§£éããã<br/>
&n... |
p00799 |
<H1><font color="#000">Problem D:</font> Pump up Batteries</H1>
<p>
Bill is a boss of security guards. He has pride in that his men put on wearable computers on their
duty. At the same time, it is his headache that capacities of commercially available batteries are
far too small to support those computers all day lon... |
p01022 | <h1>Problem G: Yu-kun Likes Building Block</h1>
<h2>Background</h2>
<p>
äŒæŽ¥å€§åŠä»å±å¹Œçšåã¯ããã°ã©ãã³ã°ã倧奜ããªåäŸãéãŸã幌çšåã§ãããåå
ã®äžäººã§ããããåã¯ããã°ã©ãã³ã°ãšåããããé·æ¹åœ¢ã®ç©ã¿æšã倧奜ãã ã
ãããªããåã¯ãæè¿ç©ã¿æšã§å±±ãäœãéã³ã«ç±äžããŠããã
</p>
<p>
ä»æ¥ãããåã¯å±±ãäœã£ãŠéãã§ããã®ã ããæã£ãŠããç©ã¿æšã§æ²¢å±±ã®å±±ãäœãäºã¯ç°¡åãªã®ã§ãä»æ¥ã¯å
šãŠã®ç©ã¿æšã䜿ã£ãŠåºæ¥ãå±±ã®æ°ãæå°åããããšèããã
ããã§ããåã¯ãå®éã«å
šãŠã®ç©ã¿æšã䜿ã£ãŠå±±ãäœã£ãåŸãæ¬åœã«ãã®å±±ã®æ°ãæå°ã«ãªã£ãŠããã®ãã©ããã確ããããã... |
p01472 |
<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... |
p01188 |
<H1><font color="#000">Problem H:</font> Slippy Floors</H1>
<p>
The princess of the Fancy Kingdom has been loved by many people for her lovely face. However the
witch of the Snow World has been jealous of the princess being loved. For her jealousy, the witch has
shut the princess into the Ice Tower built by the witch... |
p01167 |
<H1><font color="#000">Problem E:</font> Alice in Foxland</H1>
<p>
<i>
- The world is made of foxes; people with watchful eyes will find foxes in every
fragment of the world.
</i>
</p>
<p>
</i>Defoxyrenardnucleic Acids</i> (or DNAs for short) and <i>Renardnucleic Acids</i> (or RNAs) are similar
organic molecules con... |
p01537 |
<h1> Code Art Online</h1>
<h2> G: ã³ãŒãã¢ãŒããªã³ã©ã€ã³</h2>
<p>
ã³ãŒãã¢ãŒããªã³ã©ã€ã³ïŒCAOïŒã¯ïŒæ§ã
ãªåé¡ãããã°ã©ãã³ã°ã«ãã£ãŠè§£ãããšã«ããïŒåéºãé²ããŠè¡ããªã³ã©ã€ã³RPGã§ããïŒ
CAOã¯ïŒäžçåã®ããŒãã£ã«ãªã¢ãªãã£ç©ºéãå®çŸããã²ãŒã ã§ãã£ãããšãããïŒå€§äººæ°ã®å
ã«å®å£²ãïŒã²ãŒã ã賌å
¥ãããŠãŒã¶éã¯ãã®äžçã楜ããã¯ãã§ãã£ãïŒ
ãããïŒã²ãŒã ã«ãã€ããããã¬ã€ã€ãŒéã¯ïŒã²ãŒã ãã¹ã¿ãŒããæãã¹ãèšå®£ãèããããïŒ
</p>
<p>
ãåãã¡ãã¬ã€ã€ãŒã®å
ã®èª°ããïŒã©ã¹ããã³ãžã§ã³ã®ã©ã¹ããããã¬ã ã解ããªãéãïŒãã®ä»®æ³ç©ºéããæãåºãããšã¯ã§ããªãïŒãããŠïŒãã®äž... |
p00776 |
<h3>Encryption System</h3>
<p>
A programmer developed a new encryption system.
However, his system has an issue that
two or more distinct strings are `encrypted' to the same string.
</p>
<p>
We have a string encrypted by his system.
To decode the original string, we want to enumerate all the candidates of the stri... |
p01864 |
<!--<script language="JavaScript" type="text/javascript" src="js/varmath.js" charset="UTF-8"></script>-->
<h2>G: æ
è²»æ¯çµŠ - Travel Support -</h2>
<h3>ç©èª</h3>
<p>ç§ïŒéŠåç©ä¹æ16æ³ïŒåŠçã¢ã€ãã«ããã£ãŠããŸãïŒïŒ</p>
<p>åŠçã¢ã€ãã«ã®è¯ããã¿ããªã«äŒããããã®ã©ã€ããããããšïŒããããã®åŠçã¢ã€ãã«ã®äººãã¡ãåŒãã§ã¢ããã¹ã¿ãžã¢ã ã§ã©ã€ããããŸãïŒ</p>
<p>ã ãã©ïŒé ãããæ¥ãã©ã€ãåå è
ãããŠãšã£ãŠãé»è»è³ããããã®ïŒã ããuâsã®ã¡ã³ããŒã§ãã€ããããŠ... |
p03859 | <span class="lang-en">
<p>Score : <var>900</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There is a string <var>S</var> of length <var>N</var> consisting of characters <code>0</code> and <code>1</code>. You will perform the following operation for each <var>i = 1, 2, ..., m</var>:</p>
<ul>
... |
p00326 |
<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>
ããªãã¯ãŠããŒã¯ãªãªãã¬ãŒãã£ã³ã°ã·ã¹ãã ããŠã³... |
p02931 | <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> cards placed on a grid with <var>H</var> rows and <var>W</var> columns of squares.</p>
<p>The <var>i</var>-th card has an integer <var>A_i</var> written on it, and it is placed on... |
p03623 | <span class="lang-en">
<p>Score : <var>100</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke lives at position <var>x</var> on a number line.
On this line, there are two stores <var>A</var> and <var>B</var>, respectively at position <var>a</var> and <var>b</var>, that offer food for deliv... |
p03789 | <span class="lang-en">
<p>Score : <var>1300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>We will call a non-negative integer <em>increasing</em> if, for any two adjacent digits in its decimal representation, the digit to the right is greater than or equal to the digit to the left.
For exam... |
p03273 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>There is a grid of squares with <var>H</var> horizontal rows and <var>W</var> vertical columns.
The square at the <var>i</var>-th row from the top and the <var>j</var>-th column from the left is represe... |
p02032 | <h2>C: çŽæ°ã²ãŒã / Divisor Game</h2>
<h3>åé¡</h3>
<p>tsutaj ããã¯çŽæ°ã²ãŒã ã§éãŒããšããŠããŸãã</p>
<p>çŽæ°ã²ãŒã ã§ã¯ããŸã <var>2</var> 以äžã®èªç¶æ° <var>N</var> ãäžãããããã®åŸã¯ä»¥äžã®æé ã§ã²ãŒã ãé²ãã§ãããŸãã</p>
<ul>
<li> <var>N</var> 以å€ã® <var>N</var> ã®çŽæ°ã®äžãããæŽæ°ã <var>1</var> ã€å®£èšããããã ããã®ãšããæ¢ã«å®£èšããããšãããæŽæ°ã®çŽæ°ã«ãªããã®ã¯å®£èšã§ããªãã</li>
<li> 宣èšã§ããæŽæ°ãããéããããç¹°ãè¿ãã宣èšã§ãããã®ããªããã°ã²ãŒã ã¯çµäºã... |
p02198 | <h2>ã¢ã«ã猶ã®äžã«ãããã«ã³ (Oranges on Cans)</h2>
<p>square1001 åã¯ãããŒãã«ã«ã¢ã«ã猶ã $N$ 猶眮ããŸããã</p>
<p>E869120 åã¯ãããŒãã«äžã®ããããã®ã¢ã«ã猶ã®äžã« $M$ åãã€ãã«ã³ãä¹ããŸããã</p>
<p>ã¢ã«ã猶ã®äžã«ä¹ã£ãŠãããã«ã³ã¯å
šéšã§äœåãããŸããïŒ</p>
<h3>å
¥å</h3>
<p>å
¥åã¯ä»¥äžã®åœ¢åŒã§æšæºå
¥åããäžããããã</p>
<pre>
$N$ $M$
</pre>
<h3>åºå</h3>
<p>ã¢ã«ã猶ã®äžã«ä¹ã£ãŠãããã«ã³ã®æ°ã 1 è¡ã§åºåããŠãã ããã</p>
<p>ãã ããæåŸã«ã¯æ¹è¡ãå
¥ããããšã</p>
<h3>å¶çŽ<... |
p02462 | <h1>Multi-Map</h1>
<p>
For a dictionary $M$ that stores elements formed by a pair of a string key and an integer value, perform a sequence of the following operations. Note that <u>multiple elements can have equivalent keys</u>.
</p>
<ul>
<li>insert($key$, $x$): Insert an element formed by a pair of $key$ and $x$ ... |
p02177 | <h1>C: åå€åœé¡</h1>
<h2>åé¡</h2>
<p>
$N$ åã®åœé¡ããã, ãããã $1, 2, \cdots,N$ ãšããååãã€ããŠãã. </br>
ãŸã, åœé¡ã«é¢ããæ
å ±ã $M$ åäžãããã. $i$ çªç®ã®æ
å ±ã¯ã$a_i$ $b_i$ããšãã圢åŒã§äžããã, ãã㯠$a_i$ ãªãã° $b_i$ ã§ããããšãè¡šã.ïŒããªãã°ãã¯è«çå
å«ã§ãããæšç§»åŸãæãç«ã€ïŒ</br>
ååœé¡ $i$ ã«å¯Ÿã㊠$i$ ãšåå€ãªåœé¡ãå
šãŠæé ã«åºåãã.</br>
ãã ãåœé¡ $i$ ãšåœé¡ $i$ ã¯åžžã«åå€ã§ãã.</br>
åœé¡ $X$ ãšåœé¡ $Y$ ãåå€ãšã¯,ã$X$ ... |
p00849 |
<H1><font color="#000">Problem E:</font> Manhattan Wiring</H1>
<p>
There is a rectangular area containing <i>n</i> × <i>m</i> cells. Two cells are marked with "2", and another two with "3". Some cells are occupied by obstacles. You should connect the two "2"s and also the two "3"s with non-intersecting lines. L... |
p02874 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p><var>10^9</var> contestants, numbered <var>1</var> to <var>10^9</var>, will compete in a competition.
There will be two contests in this competition.</p>
<p>The organizer prepared <var>N</var> problems,... |
p03766 | <span class="lang-en">
<p>Score : <var>1000</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>How many infinite sequences <var>a_1, a_2, ...</var> consisting of {<var>{1, ... ,n}</var>} satisfy the following conditions?</p>
<ul>
<li>The <var>n</var>-th and subsequent elements are all equal. Tha... |
p03336 | <span class="lang-en">
<p>Score : <var>2400</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Takahashi and Aoki love calculating things, so they will play with numbers now.</p>
<p>First, they came up with one positive integer each. Takahashi came up with <var>X</var>, and Aoki came up with <va... |
p01425 |
<H1>White Bird</H1>
<p>
Angry Birds is a mobile game of a big craze all over the world.
You were convinced that it was a waste of time to play the game, so you decided to create an automatic solver.
</p>
<center>
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE_2308-bird-3">
</center>
<p>
You are ... |
p03418 | <span class="lang-en">
<p>Score : <var>400</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Takahashi had a pair of two positive integers not exceeding <var>N</var>, <var>(a,b)</var>, which he has forgotten.
He remembers that the remainder of <var>a</var> divided by <var>b</var> was greater th... |
p01075 |
<h1>Problem D: One-Time Path</h1>
<h2>Problem</h2>
<p>
<var>N</var>åã®å³¶ãš<var>M</var>æ¬ã®æ©ãããã
<var>N</var>åã®å³¶ã«ã¯ãããã1ãã<var>N</var>ãŸã§ã®çªå·ãå²ãæ¯ãããŠããã
<var>M</var>æ¬ã®æ©ã«ããããã1ãã<var>M</var>ãŸã§ã®çªå·ãå²ãæ¯ãããŠããã
</p>
<p>
ãã£ã¡ãåã¯çŸåš(æå»0ã®æç¹ã§)ã1çªç®ã®å³¶ã«ããã
ãã£ã¡ãåã¯<var>i</var>çªç®ã®æ©ãå©çšããããšã«ããã<var>a<sub>i</sub></var>çªç®ã®å³¶ãã<var>b<sub>i</sub></... |
p03048 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:</p>
<ul>
<li>Red boxes, each containing <var>R</var> red balls</li>
<li>Green boxes, each... |
p02209 | <h2>ã«ãŒãã¯ããã€ã«å
¥ããŸããïŒ(Are Cards Snacks?)</h2>
<p>square1001å㯠$N$ æã®ã«ãŒããæã£ãŠããŸãã</p>
<p>ãããã®ã«ãŒãã«ã¯ããããæŽæ°ãæžãããŠããã$i$ æç®ã®ã«ãŒãã«æžãããŠããæŽæ°ã¯ $A_i$ ã§ãã</p>
<p>square1001åã®ä»æ¥ã®ä¹±æ°ã¯ $K$ ã§ããsquare1001åã¯ãããã® $N$ æã®ã«ãŒãã®äžããäœæãã®ã«ãŒããéžã³ãåèšã $K$ ãšãªãããã«ãããã§ãã</p>
<p>ãã®æ§åãèŠãŠããE869120åã¯ããããé»æ¢ããããšèããŸããã</p>
<p>å
·äœçã«ã¯ãäºåã«äœæãã®ã«ãŒããé£ã¹ãããšã§ãsquare1001 åãã©... |
p00234 |
<H1>äŒæŽ¥ã®åèµé</H1>
<p>
äŒæŽ¥ã«ã¯å€ãããäŒããåèµéã®äŒèª¬ããããŸããããªãã¯ãéã«åèµéãåãŸã£ãŠããå Žæãçªãæ¢ããŸãããåèµéãåãŸã£ãŠããæ·±ããæãé²ããå°å±€ã®ç¶æ
ãåãã£ãŠããã®ã§ã綿å¯ã«èšç»ãç«ãŠãã°æå°è²»çšã§åèµéãŸã§å°éããããšãã§ããŸããããã§ããªãã¯ãå°å±€ã®ç¶æ
ãèªã¿åã£ãŠåèµéã®åãŸã£ãŠããæ·±ããŸã§æå°è²»çšã§å°éããã«ãŒããç®åºããããã°ã©ã ãäœæããããšã«ããŸããã
</p>
<p>å°å±€ã®ç¶æ
㯠2 次å
æ Œåç¶ã«é
眮ãããã»ã«ã§è¡šããããåã»ã«ã®äœçœ®ã¯åº§æš (x,y) ã§è¡šãããŸããå·Šäžã (1,1) ãšããx 座æšã¯å³ã«è¡ãã«ã€ããŠå€§ãããªããy 座æšã¯äžã«æ·±ããªãã«ã€ããŠå€§ãã... |
p02659 | <span class="lang-en">
<p>Score : <var>300</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Compute <var>A \times B</var>, truncate its fractional part, and print the result as an integer.</p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>0 \leq A \leq 10^{15... |
p00664 |
<H1>Problem F: Cosmic Market</H1>
<p>
Cosmic market(ã³ãºããã¯ã»ããŒã±ãã)ãé称ã³ãºãã±ãã¯å
šå®å®æ倧èŠæš¡ã®å人å³å£²äŒã ã
ã³ãºãã±ã«ã¯ãããããžã£ã³ã«ã®å人æ奜家éãéãã
è¿å¹Žãã³ãºãã±ãžã®æ¥å Žè
ã¯å¢å åŸåã«ããã
æåããå
šãŠã®äººãå
¥å Žã§ãããšå€§å€æ··éããŠå±éºãªã®ã§ãéå ŽçŽåŸã¯å
¥å ŽèŠå¶ãè¡ã£ãŠããã
ããäžå®äººæ°ã®äººã ããéå Žãšåæã«å
¥å Žããããšãåºæ¥ãã®ã ã
ãã以å€ã®äººãã¡ã¯ãã°ããåŸ
ã£ãŠããã®å
¥å Žãšãªã£ãŠããã
</p>
<p>
ãããå
çé ã«äŒå Žã«å
¥ãããšã«ãããšã培å€ã§åæ¥ãã䞊ã¶äººãåºãŠããŸãã
ã³ãºãã±ã®åå è
ã«ã¯æªæ幎ãå€ããæ²»å®äžã®åé¡ãããã®ã§å
... |
p01976 | <h1>C: äžèŽ</h1>
<h2>åé¡</h2>
<p>
é·ã $N$ ã®æ°å $a_i$ ãäžããããã
次ã®æ¡ä»¶ãæºããæŽæ° $K (1 \le K \le N)$ ãå
šãŠåºåããã
</p>
<p>
æ¡ä»¶:
$a_1, \cdots, a_K$ ãããŸã䞊ã³æ¿ãããš $a_{N-K+1}, \cdots, a_N$ ãšäžèŽããã
</p>
<h2>å¶çŽ</h2>
<ul>
<li>$1 \le N \le 10^5$</li>
<li>$1 \le a_i \le 10^9$</li>
<li>å
¥åã¯å
šãŠæŽæ°</li>
</ul>
<h2>å
¥å:</h2>
<p>
$N$<br>
$a_1 \cdots a_N$... |
p00371 | <H1>Lottery Box</H1>
<p>
A lottery is being held in a corner of the venue of the Aizu festival. Several types of balls are inside the lottery box and each type has its unique integer printed on the surfaces of the balls. An integer <var>T</var> is printed on the lottery box.
</p>
<p>
In the lottery, you first declare... |
p01999 | <h1>D: éé£</h1>
<h2>åé¡</h2>
<p>
$H * W$ ã®ã°ãªããã§è¡šãããå°å³ãäžããããã
åãã¹ã¯ '#' ã '.' ã§ãããåè
ã¯éžå°ã§ããããšããåŸè
ã¯æµ·ã§ããããšã瀺ããŠããã
</p>
<p>
以äžã®ããã«äžäžå·Šå³ã«é£æ¥ããŠããéžå°ã®éåã島ãšåŒã¶ã
</p>
<pre>
.....
.###.
..##.
..#..
.....
</pre>
<p>éžå° $6$ ãã¹ã®å³¶ã</p>
<pre>
......
.##.#.
....#.
......
</pre>
<p>éžå° $2$ ãã¹ã®å³¶ã $2$ ã€ã</p>
<p>
äžããããå°å³ã¯ã以äžã®æ¡ä»¶ãæºããã
... |
p00721 |
<h1><font color="#000">Problem F:</font> Cleaning Robot</h1>
<p>
Here, we want to solve path planning for a mobile robot cleaning a
rectangular room floor with furniture.
</p>
<p>
Consider the room floor paved with square tiles whose size fits
the cleaning robot (1 × 1).
There are 'clean tiles' and 'dirty til... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.