Submission #3260465
Source Code Expand
n, k = gets.split.map(&:to_i) count1, count2, count3 = 0, 0, 0 if k.odd? 1.upto(n) do |i| if i % k == 0 count1 += 1 end end puts count1 ** 3 else 1.upto(n) do |i| if i % k == k / 2 count2 += 1 elsif i % k == 0 count3 += 1 end end puts count2 ** 3 + count3 ** 3 end
Submission Info
Submission Time | |
---|---|
Task | C - Triangular Relationship |
User | SSK |
Language | Ruby (2.3.3) |
Score | 300 |
Code Size | 309 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 1788 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt, s4.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, s1.txt, s2.txt, s3.txt, s4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 22 ms | 1788 KB |
02.txt | AC | 28 ms | 1788 KB |
03.txt | AC | 20 ms | 1788 KB |
04.txt | AC | 28 ms | 1788 KB |
05.txt | AC | 12 ms | 1788 KB |
06.txt | AC | 13 ms | 1788 KB |
07.txt | AC | 18 ms | 1788 KB |
08.txt | AC | 7 ms | 1788 KB |
09.txt | AC | 7 ms | 1788 KB |
10.txt | AC | 18 ms | 1788 KB |
11.txt | AC | 8 ms | 1788 KB |
12.txt | AC | 13 ms | 1788 KB |
13.txt | AC | 17 ms | 1788 KB |
14.txt | AC | 15 ms | 1788 KB |
s1.txt | AC | 7 ms | 1788 KB |
s2.txt | AC | 7 ms | 1788 KB |
s3.txt | AC | 9 ms | 1788 KB |
s4.txt | AC | 11 ms | 1788 KB |