Submission #2249674


Source Code Expand

import std.stdio : readln, writeln;
import std.conv : to;
import std.string : chomp;
import std.range : iota;
import std.algorithm : map, count, cartesianProduct;
import std.functional : pipe;

void main() {
    (() => 0.iota(readln.chomp.to!long + 1)).pipe!(
        f => cartesianProduct(f(), f(), f())
    ).map!(
        as => 500*as[0] + 100*as[1] + 50*as[2]
    ).count(readln.chomp.to!long).writeln;
}

Submission Info

Submission Time
Task ABC087B - Coins
User arkark
Language D (LDC 0.17.0)
Score 200
Code Size 423 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 13
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, sample01.txt, sample02.txt, sample03.txt
Case Name Status Exec Time Memory
01.txt AC 1 ms 256 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
sample01.txt AC 1 ms 256 KB
sample02.txt AC 1 ms 256 KB
sample03.txt AC 1 ms 256 KB