code stringlengths 4 1.01M | language stringclasses 2
values |
|---|---|
import std.functional,
std.algorithm,
std.typecons,
std.bigint,
std.string,
std.traits,
std.array,
std.range,
std.stdio,
std.conv;
void main() {
int[] NQ = readln.chomp.split.to!(int[]);
int N = NQ[0],
Q = NQ[1];
string s = readln.chomp;
ali... | D |
void main() {
auto A = ri, B = ri, C = ri, D = ri;
(min(A, B) + min(C, D)).writeln;
}
// ===================================
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.range;
import std.traits;
import std.math;
import std.bigint;
import std.numeric;
import std.conv;
impor... | D |
import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;
void main() {
int n;
scan(n);
auto a = readln.split.to!(int[]);
auto dp = new long[][](n + 1, n + 1);
fillAll(dp, -1);
// 先手は X - Y の最大化
... | D |
import std.stdio;
import std.conv;
import std.string;
import std.typecons;
import std.algorithm;
import std.array;
import std.range;
import std.math;
import std.regex : regex;
import std.container;
import std.bigint;
void main()
{
auto n = readln.chomp.to!int;
auto s = readln.chomp;
int cnt;
foreach (i; 0..n)... | D |
import std.stdio;
import std.range;
import std.array;
import std.string;
import std.conv;
import std.typecons;
import std.algorithm;
import std.container;
import std.typecons;
import std.random;
import std.csv;
import std.regex;
import std.math;
import core.time;
import std.ascii;
import std.digest.sha;
import std.outb... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto T = readln.chomp.to!int;
auto cs = new long[](25820);
cs[1] = 2;
foreach (i; 2..25820) {
cs[i] = cs[i-1] + (i-1) * 3 + 2;
}
foreach (_; 0..T) {
auto N = rea... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;
void main() {
long x, y;
scan(x, y);
if (x < y || x % y) {
writeln(x);
}
else {
writeln(-1);
}
}
void scan(T...)(ref T args) {
import std.stdio : readln;
import std.algorithm : splitt... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(... | D |
import std;
alias sread = () => readln.chomp();
alias lread = () => readln.chomp.to!long();
alias aryread(T = long) = () => readln.split.to!(T[]);
void main()
{
auto n = lread();
auto a = aryread();
long[long] ary;
foreach (i; 0 .. n)
{
ary[a[i]] = ary.get(a[i], 0) + 1;
}
foreach (... | D |
import std.stdio, std.conv, std.string;
import std.algorithm, std.array, std.container;
import std.numeric, std.math;
import core.bitop;
T RD(T = string)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
long ... | D |
void main()
{
string t = rdStr;
string s;
foreach (x; t)
{
if (x == 'P' || x == 'D') s ~= x;
else s ~= 'D';
}
s.writeln;
}
enum long mod = 10L^^9 + 7;
enum long inf = 1L << 60;
enum double eps = 1.0e-9;
T rdElem(T = long)()
if (!is(T == struct))
{
return readln.chomp.to!T... | D |
import std.stdio;
import std.conv;
import std.string;
import std.typecons;
import std.algorithm;
import std.array;
import std.range;
import std.math;
import std.regex : regex;
import std.container;
import std.bigint;
import std.ascii;
void main()
{
auto x = readln.chomp.to!int;
if (x == 7 || x == 5 || x == 3) {
... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
import std.container : DList;
int[2][10^^5] GP;
bool[10^^5] MS;
alias S = Tuple!(int, "i", int, "c");
void main()
{
auto K = readln.chomp.to!int;
foreach (i; 1..K) {
GP[i][0] = (i*10)%K;
GP... | D |
import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.format;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
alias sread = () => readln.chomp();
alias Point2 =... | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readint = read!int;
alias readints = reads!int;
T gcd(T)(T a, T b) {
... | D |
import std.stdio, std.string, std.conv;
import std.array, std.algorithm, std.range;
void main()
{
int[] b;
foreach(s;stdin.byLine())
{
immutable n = s.chomp().to!int;
if(n) b~=n;
else writeln(b.back),b.popBack();
}
} | D |
import std.stdio, std.string, std.conv;
import std.array, std.algorithm, std.range;
void main()
{
for(int n; 0<(n=readln().chomp().to!int()); )
{
auto a = iota(n).map!(_=>readln().split().array()).array();
long[string] t;
foreach(v;a)
{
immutable s = v[1..$].map!(to!... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto c = readln.chomp[0];
writeln(cast(string)[c+1]);
} | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readint = read!int;
alias readints = reads!int;
void main() {
auto ... | D |
// Vicfred
// https://atcoder.jp/contests/abc166/tasks/abc166_e
import std.algorithm;
import std.array;
import std.conv;
import std.stdio;
import std.string;
void main() {
long n = readln.chomp.to!long;
long[] a = readln.split.map!(to!long).array;
long[long] y;
foreach(idx; 0..n) {
long x = ... | D |
import std.stdio,
std.string,
std.conv,
std.algorithm;
void main() {
int N = readln.chomp.to!(int);
int[string] s;
for (int i = 0; i < N; i++) {
s[readln.chomp]++;
}
int M = readln.chomp.to!(int);
for (int i = 0; i < M; i++) {
s[readln.chomp]--;
}
int ans = s.values.reduce... | D |
import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop, core.stdc.stdio;
immutable long MOD = 10^^9 + 7;
immutable int M = 62;
void main() {
auto N = readln.chomp.to!int;
auto A = readln.... | D |
import std.stdio;
import std.conv, std.array, std.algorithm, std.string;
import std.math, std.random, std.range, std.datetime;
import std.bigint;
import std.container;
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
void main(){
char[] s = r... | D |
import std.stdio, std.algorithm, std.string, std.conv, std.array;
void main() {
int calc(int base, int rate) {
return base * (100 + rate) / 100;
}
for(;;) {
auto input = readln.chomp.split(" ").map!(to!int).array;
if ( input == [0, 0, 0] ) break;
immutable x = input[0], y =... | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto n = readln.chomp.to!int;
auto c = new int[](n-1), s = new int[](n-1), f = new int[](n-1);
foreach (i; 0..n-1) {
auto rd = readln.split.to!(int[]);
c[i] = rd[0];
s[i] = rd[1];
f[i] = rd[2];
}
int calc(int i, ... | D |
void main()
{
long[] tmp = rdRow;
long h = tmp[0], n = tmp[1];
long[] a = rdRow;
writeln(a.sum >= h ? "Yes" : "No");
}
T rdElem(T = long)()
if (!is(T == struct))
{
return readln.chomp.to!T;
}
alias rdStr = rdElem!string;
alias rdDchar = rdElem!(dchar[]);
T rdElem(T)()
if (is(T == struct))
{
... | D |
// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=(... | D |
import std.stdio, std.string, std.conv, std.algorithm, std.numeric;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
void main() {
int n;
scan(n);
auto a = readln.split.to!(int[]);
int o, t;
foreach (ai ; a) {
if (ai == 1) o++;
else t++;
}
in... | D |
void main()
{
int n = readln.chomp.to!int;
int[] a = readln.split.to!(int[]);
a[] -= 1;
int cnt;
foreach (i; 0 .. n)
{
if (i == a[a[i]]) ++cnt;
}
writeln(cnt / 2);
}
import std.stdio;
import std.string;
import std.array;
import std.conv;
import std.algorithm;
import std.range;... | D |
import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;
enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;
void main() {
int H, W;
scan(H, W);
auto s = iota(H).map!(i => readln.c... | D |
void main() {
problem();
}
void problem() {
const N = scan!long;
void solve() {
bool[string] items;
foreach(_; 0..N) {
const item = scan;
items[item] = true;
}
writeln(items.keys.length);
}
solve();
}
// ----------------------------------------------
import std.stdio, std.co... | D |
import std.stdio;
import std.conv;
import std.string;
void main()
{
readln();
auto s = readln();
foreach (c; s)
{
if (c == 'Y'){
writeln("Four");
return;
}
}
writeln("Three");
}
| D |
import std;
import core.bitop;
// dfmt off
ulong MAX = 100_100, MOD = 1_000_000_007, INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias lread(T = long) = () => readln.chomp.to!(T);
alias aryread(T = long) = () => readln.split.to!(T[]);
void aryWrite(T = long)(T[] ary){ ary.map!(x => x.text()).join(' ')... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto N = readln.chomp.to!int;
auto hs = readln.split.to!(int[]);
auto max_h = hs[0];
int r;
foreach (h; hs) {
if (h >= max_h) {
++r;
max_h = h;
... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math;
void main()
{
auto N = readln.chomp.to!int;
auto S = readln.chomp.to!(wchar[]);
long[immutable(wchar[])][18] omemo;
long solve(int i, wchar[] rs_, wchar[] bs_) {
if (i == N) {
auto rs = rs_.dup;
... | D |
import std;
alias sread = () => readln.chomp();
alias lread = () => readln.chomp.to!long();
alias aryread(T = long) = () => readln.split.to!(T[]);
//aryread!string();
void main()
{
long a, b, c;
scan(a, b, c);
auto n = lread();
while (a >= b)
{
b *= 2;
n -= 1;
}
// writeln(a... | D |
import std.stdio;
import std.conv;
import std.string;
import std.typecons;
import std.algorithm;
import std.array;
import std.range;
import std.math;
import std.regex : regex;
import std.container;
import std.bigint;
void main()
{
auto s = readln.chomp;
bool f;
if (s[0] != 'A') {
f = true;
}
if (!(s[1] ... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string;
int[50] CITY;
void main()
{
auto nm = readln.chomp.split(" ").map!(to!int);
auto n = nm[0];
auto m = nm[1];
auto city = CITY[0..n];
foreach (_i; 0..m) {
auto ab = readln.chomp.split(" ").map!(to!int);
++city[ab[0]-1... | D |
import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
std.typecons, std.container, std.format;
// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
... | D |
import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv,
std.functional, std.math, std.numeric, std.range, std.stdio, std.string,
std.random, std.typecons, std.container;
ulong MAX = 100_100, MOD = 1_000_000_007, INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias lread(T = long) = () ... | D |
import std;
alias sread = () => readln.chomp();
alias lread = () => readln.chomp.to!long();
alias aryread(T = long) = () => readln.split.to!(T[]);
//aryread!string();
//auto PS = new Tuple!(long,string)[](M);
//x[]=1;でlong[]全要素1に初期化
void main()
{
auto N = lread();
auto S = new long[](N);
foreach (i; 0 .. N... | D |
import std.stdio;
import std.conv;
import std.string;
import std.typecons;
import std.algorithm;
import std.array;
import std.range;
import std.math;
import std.regex : regex;
import std.container;
import std.bigint;
import std.ascii;
void main()
{
auto s = readln.chomp;
auto cnt = new int[](3);
foreach (e; s) ... | D |
import std.stdio;
import std.string;
import std.conv;
void main()
{
auto line = chomp(readln()).split(" ");
int H = to!int(line[0]),
W = to!int(line[1]);
while(H || W)
{
foreach(int i; 0 .. H)
{
writeln(repeat("#", W));
}
writeln();
line = cho... | D |
import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;
enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;
void main() {
int N, K;
scan(N, K);
int ans = K;
foreach (i ; 0 .. N... | D |
import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
stri... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto abt = readln.split.to!(int[]);
auto A = abt[0];
auto B = abt[1];
auto T = abt[2];
writeln(B * (T / A));
} | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric, std.container, std.range;
void main()
{
auto N = readln.chomp.to!int;
auto AS = readln.split.to!(int[]);
auto ps = new int[](10^^6+1);
foreach (a; AS) {
for (int i = 2; i^^2 <= a; ++i) {
... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto xn = readln.split.to!(int[]);
auto X = xn[0];
auto N = xn[1];
bool[101] ps;
foreach (p; readln.split.to!(int[])) ps[p] = true;
foreach (d; 0..100) {
auto x = X-d;
... | D |
import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;
enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;
alias Edge = Tuple!(int, "to", int, "idx");
void main() {... | D |
import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;
enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;
void main() {
auto a = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric, std.container, std.range;
void main()
{
auto S = readln.chomp;
writeln((S[0] == S[$-1] && S.length%2 == 0) || (S[0] != S[$-1] && S.length%2 == 1) ? "First" : "Second");
} | D |
import std.algorithm;
import std.functional;
import std.range;
import std.ascii;
import std.array;
import std.container;
import std.conv;
import std.numeric;
import std.stdio;
import std.string;
import std.typecons;
void log(A...)(A arg) {
stderr.writeln(arg);
}
int size(T)(in T s) {
return cast(int)s.length;
... | D |
import std.stdio;
import std.conv;
import std.string;
import std.typecons;
import std.algorithm;
import std.array;
import std.range;
import std.math;
import std.regex : regex;
import std.container;
import std.bigint;
import std.ascii;
void main()
{
auto n = readln.chomp.to!int;
writeln((n-2) * 180);
};
| D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_r... | D |
import std.stdio;
import std.conv;
import std.string;
int main(string[] argv)
{
immutable MAX_HIGHT = 10000;
immutable INPUT = 10;
int[] hill;
int count = 0;
while(count < 10){
int temp = readln().chomp().to!int();
if(0 <= temp && temp <= MAX_HIGHT){
hill ~= temp;
count++;
}
}
int temp;
for(i... | D |
// tested by Hightail - https://github.com/dj3500/hightail
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
void main() {
int x, a, b;
scan(x, a, b);
if (b - a <= 0) {
writeln("delicious");
}
else if (b -... | D |
import std.stdio,std.array,std.conv,std.algorithm;
void main(){
auto a=readln().split().map!(to!int);
writeln(a[0]-(a[0]>a[1]));
} | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
void scan(T...)(ref T a) {
string[] ss = readln.split;
foreach (i, t; T) a[i] = ss[i].to!t;
}
T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return r... | D |
import std.stdio;
import std.string;
import std.format;
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.concurrency;
import std.traits;
import std.uni;
import c... | D |
import std.stdio;
import std.string;
import std.algorithm;
import std.array;
import std.conv;
int solve(int[] list) {
while (list.length > 1) {
int[] res = new int[](list.length - 1);
for(int i = 0; i < list.length - 1; i++) {
res[i] = (list[i] + list[i + 1]) % 10;
}
list = res;
}
return l... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
enum P = 10L^^9+7;
void main()
{
auto N = readln.chomp.to!int;
int[][] RS;
RS.length = N;
foreach (i; 0..N) RS[i] = readln.split.to!(int[]);
auto DP = new long[][](N, 2^^N);
foreach (ref dp;... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.range;
import std.traits;
import std.math;
import std.conv;
void main() {
auto s = readln.chomp;
string res;
foreach(i; s) {
switch(i) {
case '0', '1':
res ~= i;
break;
case 'B':
if(res.length != 0) res.popBac... | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
void main() {
auto n = readln.strip.to!int;
auto s = readln.strip.splitter;
auto a = s.front; s.popFront;
auto b = s.front;
foreach (i; 0 .. n) {
write (a[i], b[i]);
}
writ... | D |
import std.stdio, std.conv, std.string;
import std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
int DEBUG_LEVEL = 0;
void pr... | D |
import std.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.string;
void main ()
{
auto tests = readln.strip.to !(int);
foreach (test; 0..tests)
{
auto a = readln.splitter.map !(to !(int)).array;
auto total = sum (a);
bool ok = (total % 9 == 0);
total /= 9;
ok &= (a.minElement >=... | D |
void main()
{
int n = readln.chomp.to!int;
int[] h = readln.split.to!(int[]);
int hi;
int[] cnt = [0];
foreach (x; h)
{
if (x > hi)
{
cnt[$-1] = x;
}
else if (x < hi)
{
cnt[$-1] = hi - x;
cnt ~= x;
}
hi... | D |
import std.stdio,
std.string,
std.conv,
std.algorithm;
int abs(int x) {
return (x >= 0) ? x : -x;
}
void main() {
int N = readln.chomp.to!(int);
int[][] a;
for (int i = 0; i < N; i++) {
a ~= readln.chomp.split.to!(int[]);
}
bool f = true;
int t = 0, x = 0, y = 0;
for (int i =... | D |
import std.stdio;
import std.algorithm;
import std.conv;
import std.string;
import std.array;
import std.math;
int factnum(int n){
int i = 0;
while(n%2 == 0){
n /= 2;
i++;
}
return i;
}
void main(string[] args) {
readln();
auto input = readln().chomp.split.map!(to!int);
input.map!factnum.s... | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
void main() {
immutable n = readln.strip.to!long;
ulong res;
void check (long x) {
--x;
if (n / x == n % x) res += x;
}
for (int i = 2; i.to!long * i <= n; ++i) {
check... | D |
import std.stdio;
import std.algorithm;
import std.string;
import std.array;
import std.functional;
import std.conv;
import std.math;
void main(){
while(true){
auto s = readln();
if(stdin.eof()) break;
int n = to!int(s.chomp());
int[4001] arr;
for(int i=0;i<=1000;i++){
for(int j=0;j<=1000;j++){
arr[i+j... | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
int readint() {
return readln.chomp.to!int;
}
int[] readints() {
return readln.split.map!(to!int).array;
}
void main() {
auto xt = readints;
int x = xt... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.math;
void main() {
((ushort[] ip) => ip[0] + ip[1] >= ip[2] ? "Yes" : "No")(readln.split.to!(ushort[])).writeln;
} | D |
void main() {
int[] tmp = readln.split.to!(int[]);
int a = tmp[0], b = tmp[1];
writeln(a >= 13 ? b : a >= 6 ? b / 2 : 0);
}
import std.stdio;
import std.string;
import std.array;
import std.conv;
import std.algorithm;
import std.range;
import std.typecons; | D |
import std;
enum inf(T)()if(__traits(isArithmetic,T)){return T.max/4;}
T scan(T=long)(){return readln.chomp.to!T;}
void scan(T...)(ref T args){auto input=readln.chomp.split;foreach(i,t;T)args[i]=input[i].to!t;}
T[] scanarr(T=long)(){return readln.chomp.split.to!(T[]);}
alias Queue=DList;auto enq(T)(ref Queue!T q,T e){q... | D |
import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", ... | D |
import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
std.typecons, std.container, std.format;
// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.c... | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readint = read!int;
alias readints = reads!int;
bool f(int n) {
ret... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons;
void main()
{
auto hw = readln.split.to!(int[]);
auto H = hw[0];
auto W = hw[1];
wchar[][] PIC;
PIC.length = H;
foreach (ref line; PIC) {
line = readln.chomp.to!(wchar[]);
}
foreach (i, l... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(... | D |
import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop;
long N, cnt;
bool ask(long n) {
writeln("? ", n);
stdout.flush;
cnt += 1;
debug {
string sn = n.to!string;
... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(... | D |
import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;
void readV(T...)(ref T t){auto r=readln.splitter;foreach(ref v;t){v=r.front.to!(typeof(v));r.popFront;}}
void readC(T...)(size_t n,ref T t){foreach(ref v;t)v=new typeof(v)(n);foreach(i;0..n){auto r=readln.splitter;... | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void readV(T...)(ref T t){auto r=readln.splitter;foreach(ref v;t){v=r.front.to!(typeof(v));r.popFront;}}
void readA(T)(size_t n,ref T t){t=new T(n);auto r=readln.splitter;foreach(ref v;t){v=r.front.to!(ElementType!T);r.popFront;}}
void readM(T...)(size_... | D |
import std.algorithm,
std.string,
std.range,
std.stdio,
std.conv,
std.math;
long f(long b, long n) {
return (n < b)
? n
: f(b, n/b) + n % b;
}
long solve(long N, long S) {
if (N < S) {
return -1;
}
if (N == S) {
return N + 1;
}
foreach (i; 2... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
size_t[][26] D;
void main()
{
auto s = readln.chomp.to!(char[]);
auto t = readln.chomp.to!(char[]);
foreach (i, c; s) {
D[c - 'a'] ~= i;
}
ulong cnt;
size_t p;
bool first = true... | D |
void main()
{
long n, w;
rdVals(n, w);
Pair[] pair = n.rdCol!Pair;
long[][] dp = new long[][](n+1, w+1);
foreach (i, p; pair)
{
foreach (j; 0 .. w+1)
{
dp[i+1][j] = dp[i][j];
if (j - p.a < 0) continue;
dp[i+1][j] = max(dp[i+1][j], dp[i][j-p.a]... | D |
import std.stdio, std.string, std.conv, std.algorithm, std.numeric;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
void main() {
long x, y;
scan(x, y);
int ans = 1;
while (2*x <= y) {
x *= 2;
ans++;
}
writeln(ans);
}
void scan(T...)(ref T ar... | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readint = read!int;
alias readints = reads!int;
void main() {
auto ... | D |
import std.stdio, std.algorithm, std.string, std.conv, std.array;
int read_num() {return readln.chomp.to!(int);}
void main() {
while(true) {
int[] line = readln.chomp.split(" ").map!(to!(int)).array;
int times = line[0];
int len = line[1];
int[100000] arr;
if (times == 0 && len == 0) break;
... | D |
import std.stdio, std.string, std.conv, std.algorithm, std.numeric;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
import std.random;
immutable inf = 10L^^16;
alias Edge = Tuple!(int, "from", int, "to", long, "cap", int, "rev");
void main() {
int n, m;
scan(n, m);
auto ad... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;
import std.typecons : Tuple;
void main() {
int n;
scan(n);
auto a = readln.split.to!(int[]);
auto b = readln.split.to!(int[]);
int ue = a[0], sita = b.sum();
int ans = ue + sita;
foreach (i ; 1 .. n) {
... | D |
import core.bitop, std.bitmanip;
import core.checkedint;
import std.algorithm, std.functional, std.meta;
import std.array, std.container;
import std.bigint;
import std.conv;
import std.math, std.numeric;
import std.range, std.range.interfaces;
import std.stdio, std.string;
import std.typecons;
void main()
{
auto s... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(... | D |
import std.stdio;
import std.conv;
import std.string;
import std.typecons;
import std.algorithm;
import std.array;
import std.range;
import std.math;
import std.regex : regex;
import std.container;
import std.bigint;
import std.ascii;
void main()
{
auto s = readln.chomp;
if (s[2] == s[3] && s[4] == s[5]) {
wr... | D |
// unihernandez22
// https://atcoder.jp/contests/abc076/tasks/abc076_c
// string manipulation
import std.stdio;
import std.string;
void main() {
string s = readln.chomp;
string t = readln.chomp;
long idx = -1;
bool matched;
for(long i = (s.count-t.count); i >= 0; i--) {
if (s[i] == '?' || s[i] == t[0]) {
mat... | D |
import std.stdio;
import std.ascii;
void main() {
int sum = 0;
foreach (string input; stdin.lines) {
auto num = 0;
foreach (c; input) {
if (c.isDigit) {
num = (num * 10) + (c - '0');
} else {
sum += num;
num = 0;
... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
void main() {
string[] inputs = split(readln());
int a, b;
foreach(v; inputs) {
switch(v) {
case "5":
a++;
break;
case "7":
b++;
break;
default:
break;
}
}
if(a == 2 && b == 1) "YES".writeln;
else "NO".wr... | D |
import std.stdio, std.string, std.conv, std.algorithm, std.numeric;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
alias Pair = Tuple!(long, "p", int, "r");
void main() {
int n;
scan(n);
auto x = new long[](n + 1);
auto s = new int[](n + 1);
foreach (i ; 1 .. n ... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric, std.container, std.range;
void main()
{
auto N = readln.chomp.to!int;
auto cs = readln.chomp.to!(char[]);
int c;
int i, j = N-1;
while (i < j) {
while (i < N && cs[i] != 'W') ++i;
... | D |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.