Submission #244906
Source Code Expand
import std.stdio, std.conv, std.string, std.typecons; import std.algorithm, std.array, std.range, std.math; import std.container, std.datetime; void main() { auto top = 1; auto left = 1; int r; auto res = new int[][](100, 2); foreach_reverse(i; 1..101) { if (left == 1) r = i; if (left + i * 2 < 1500) { res[i - 1][0] = left + i; res[i - 1][1] = top + i; left += i * 2 + 1; } else { top += r * 2 + 1; left = 1; res[i - 1][0] = left + i; res[i - 1][1] = top + i; left += i * 2 + 1; } } foreach (i; 0..100) { writeln(res[i][0], " " ,res[i][1]); } }
Submission Info
Submission Time | |
---|---|
Task | F - 100個の円 |
User | Fuh |
Language | D (DMD 2.060) |
Score | 100 |
Code Size | 618 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 928 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | test.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
test.txt | AC | 27 ms | 928 KB |