Submission #1735576
Source Code Expand
import std.stdio;
import std.string;
import std.conv;
import std.typecons;
import std.algorithm;
import std.functional;
import std.bigint;
import std.numeric;
import std.array;
import std.math;
import std.range;
import std.container;
import std.ascii;
import std.concurrency;
import core.bitop : popcnt;
alias Generator = std.concurrency.Generator;
void main() {
int N; long Z;
scanln(N, Z);
readln.split.to!(long[]).map!(
a => gcd(a, Z)
).fold!(
(a, b) => a / gcd(a, b) * b
)(1L).writeln;
}
// ----------------------------------------------
void scanln(Args...)(ref Args args) {
foreach(i, ref v; args) {
"%d".readf(&v);
(i==args.length-1 ? "\n" : " ").readf;
}
// ("%d".repeat(args.length).join(" ") ~ "\n").readf(args);
}
void times(alias fun)(int n) {
// n.iota.each!(i => fun());
foreach(i; 0..n) fun();
}
auto rep(alias fun, T = typeof(fun()))(int n) {
// return n.iota.map!(i => fun()).array;
T[] res = new T[n];
foreach(ref e; res) e = fun();
return res;
}
// fold was added in D 2.071.0
static if (__VERSION__ < 2071) {
template fold(fun...) if (fun.length >= 1) {
auto fold(R, S...)(R r, S seed) {
static if (S.length < 2) {
return reduce!fun(seed, r);
} else {
return reduce!fun(tuple(seed), r);
}
}
}
}
// cumulativeFold was added in D 2.072.0
static if (__VERSION__ < 2072) {
template cumulativeFold(fun...)
if (fun.length >= 1)
{
import std.meta : staticMap;
private alias binfuns = staticMap!(binaryFun, fun);
auto cumulativeFold(R)(R range)
if (isInputRange!(Unqual!R))
{
return cumulativeFoldImpl(range);
}
auto cumulativeFold(R, S)(R range, S seed)
if (isInputRange!(Unqual!R))
{
static if (fun.length == 1)
return cumulativeFoldImpl(range, seed);
else
return cumulativeFoldImpl(range, seed.expand);
}
private auto cumulativeFoldImpl(R, Args...)(R range, ref Args args)
{
import std.algorithm.internal : algoFormat;
static assert(Args.length == 0 || Args.length == fun.length,
algoFormat("Seed %s does not have the correct amount of fields (should be %s)",
Args.stringof, fun.length));
static if (args.length)
alias State = staticMap!(Unqual, Args);
else
alias State = staticMap!(ReduceSeedType!(ElementType!R), binfuns);
foreach (i, f; binfuns)
{
static assert(!__traits(compiles, f(args[i], e)) || __traits(compiles,
{ args[i] = f(args[i], e); }()),
algoFormat("Incompatible function/seed/element: %s/%s/%s",
fullyQualifiedName!f, Args[i].stringof, E.stringof));
}
static struct Result
{
private:
R source;
State state;
this(R range, ref Args args)
{
source = range;
if (source.empty)
return;
foreach (i, f; binfuns)
{
static if (args.length)
state[i] = f(args[i], source.front);
else
state[i] = source.front;
}
}
public:
@property bool empty()
{
return source.empty;
}
@property auto front()
{
assert(!empty, "Attempting to fetch the front of an empty cumulativeFold.");
static if (fun.length > 1)
{
import std.typecons : tuple;
return tuple(state);
}
else
{
return state[0];
}
}
void popFront()
{
assert(!empty, "Attempting to popFront an empty cumulativeFold.");
source.popFront;
if (source.empty)
return;
foreach (i, f; binfuns)
state[i] = f(state[i], source.front);
}
static if (isForwardRange!R)
{
@property auto save()
{
auto result = this;
result.source = source.save;
return result;
}
}
static if (hasLength!R)
{
@property size_t length()
{
return source.length;
}
}
}
return Result(range, args);
}
}
}
// minElement/maxElement was added in D 2.072.0
static if (__VERSION__ < 2072) {
auto minElement(alias map, Range)(Range r)
if (isInputRange!Range && !isInfinite!Range)
{
alias mapFun = unaryFun!map;
auto element = r.front;
auto minimum = mapFun(element);
r.popFront;
foreach(a; r) {
auto b = mapFun(a);
if (b < minimum) {
element = a;
minimum = b;
}
}
return element;
}
auto maxElement(alias map, Range)(Range r)
if (isInputRange!Range && !isInfinite!Range)
{
alias mapFun = unaryFun!map;
auto element = r.front;
auto maximum = mapFun(element);
r.popFront;
foreach(a; r) {
auto b = mapFun(a);
if (b > maximum) {
element = a;
maximum = b;
}
}
return element;
}
}
Submission Info
Submission Time |
|
Task |
B - GCDロボット |
User |
arkark |
Language |
D (DMD64 v2.070.1) |
Score |
500 |
Code Size |
6316 Byte |
Status |
AC |
Exec Time |
93 ms |
Memory |
6852 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
500 / 500 |
Status |
|
|
Set Name |
Test Cases |
Sample |
example_0, example_1, example_2 |
All |
example_0, example_1, example_2, many_0, many_1, many_10, many_11, many_2, many_3, many_4, many_5, many_6, many_7, many_8, many_9, rand_0, rand_1, rand_10, rand_11, rand_12, rand_13, rand_14, rand_15, rand_16, rand_17, rand_18, rand_19, rand_2, rand_20, rand_21, rand_22, rand_23, rand_3, rand_4, rand_5, rand_6, rand_7, rand_8, rand_9 |
Case Name |
Status |
Exec Time |
Memory |
example_0 |
AC |
1 ms |
256 KB |
example_1 |
AC |
1 ms |
256 KB |
example_2 |
AC |
1 ms |
256 KB |
many_0 |
AC |
61 ms |
4180 KB |
many_1 |
AC |
31 ms |
3832 KB |
many_10 |
AC |
53 ms |
3764 KB |
many_11 |
AC |
9 ms |
892 KB |
many_2 |
AC |
61 ms |
4348 KB |
many_3 |
AC |
3 ms |
2428 KB |
many_4 |
AC |
62 ms |
4220 KB |
many_5 |
AC |
46 ms |
4092 KB |
many_6 |
AC |
53 ms |
3764 KB |
many_7 |
AC |
43 ms |
3708 KB |
many_8 |
AC |
54 ms |
3892 KB |
many_9 |
AC |
37 ms |
3428 KB |
rand_0 |
AC |
90 ms |
4552 KB |
rand_1 |
AC |
43 ms |
3324 KB |
rand_10 |
AC |
71 ms |
5244 KB |
rand_11 |
AC |
17 ms |
3424 KB |
rand_12 |
AC |
92 ms |
5116 KB |
rand_13 |
AC |
72 ms |
4072 KB |
rand_14 |
AC |
47 ms |
5308 KB |
rand_15 |
AC |
22 ms |
4004 KB |
rand_16 |
AC |
93 ms |
5960 KB |
rand_17 |
AC |
20 ms |
1288 KB |
rand_18 |
AC |
47 ms |
6204 KB |
rand_19 |
AC |
18 ms |
3660 KB |
rand_2 |
AC |
46 ms |
5948 KB |
rand_20 |
AC |
46 ms |
4988 KB |
rand_21 |
AC |
33 ms |
3832 KB |
rand_22 |
AC |
71 ms |
6852 KB |
rand_23 |
AC |
50 ms |
4188 KB |
rand_3 |
AC |
4 ms |
764 KB |
rand_4 |
AC |
93 ms |
6212 KB |
rand_5 |
AC |
85 ms |
5244 KB |
rand_6 |
AC |
45 ms |
4732 KB |
rand_7 |
AC |
29 ms |
4476 KB |
rand_8 |
AC |
46 ms |
6204 KB |
rand_9 |
AC |
7 ms |
1020 KB |