質問
問題名 | ユーザ名 | 質問 | 回答 | 全体公開 | 投稿日時 | 最終更新日時 |
---|---|---|---|---|---|---|
F - Phutball |
![]() |
............... ............... ............... ............... ............... ............... ............... ............... ............... ............... ............... ............... ............... ............... ............... ............... ............... ............... ...............P Is the point P considered as a goal point? |
No. that point is not goal. |
Yes | ||
F - Phutball |
![]() ![]() |
> ゴール地点というのは碁盤の下端か、その下側を指す。(下図を参照せよ。) Is the point next to the leftmost corner of the board a goal? |
No, that point is not goal. |
Yes | ||
L - 京都旅行 |
![]() |
Can I submit a solution for L now? |
Yes, you can. Thank you for waiting. |
Yes | ||
![]() |
Where is printpage? |
sorry here http://acm-icpc.aitea.net/tools/print.html |
Yes | |||
C - Wave Attack |
![]() |
3つ目のサンプル入力がw = 2なのですが,制約の 3 <= w <= 10^8 と矛盾するのではないでしょうか. |
Thank you. Problem is fixed. 2 <= w, h <= 10^8. (Clarification must be English.) |
Yes | ||
L - 京都旅行 |
![]() |
問題 L 「京都旅行」には不備があるので、まだ提出しないでください。また、印刷されている問題集とは問題の順序がいれかわっています。ご不便をおかけしてもうしわけございません。 |
Yes | |||
G - Unordered Operators |
![]() ![]() |
> 64bit整数型 Signed? i.e. will it always fit in [-2^63, 2^63 - 1] ? |
Yes it fit in "("-2^63, 2^63")" |
Yes | ||
B - Minus One |
![]() |
What is definition of shortest distance? |
The miniumum of the number of edges of a path that goes from s to t. |
Yes | ||
A - Invest Master |
![]() |
d and n seems to be confused. |
Thank you. Problem statement is fixed. |
Yes |