code stringlengths 4 1.01M | language stringclasses 2
values |
|---|---|
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto abc = readln.split.to!(int[]);
auto AB = abc[0];
auto BC = abc[1];
writeln(AB * BC / 2);
} | 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[] arr;
if (times == 0 && len == 0) break;
f... | D |
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
immutable inf = 10^^9 + 7;
alias Edge = Tuple!(int, "to", int, "cost", int, "rev");
void main() {
int n, m;
scan(n, m);
auto adj = new Edge[][](n, 0);
foreach (i ; ... | D |
import std.stdio, std.string, std.conv;
void main() {
auto input = getStdin!(string[])[0];
auto num = input.split(" ").to!(int[]);
int a = num[0];
int b = num[1];
int c = num[2];
int count = 0;
for (int i = a; i <= b; i++) {
if (c % i == 0) {
count++;
}
}
co... | 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, 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() {
string s;
scan(s);
yes(check(s));
}
bool check(string s) ... | D |
import std.stdio;
import std.ascii;
import std.conv;
import std.string;
import std.algorithm;
import std.range;
import std.functional;
import std.math;
import core.bitop;
void main()
{
auto a = readln.chomp.split().to!(long[]);
auto f = (long a, long b, long c) => abs(a - b) + abs(b - c);
min(f(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;
int readint() {
return readln.chomp.to!int;
}
int[] readints() {
return readln.split.map!(to!int).array;
}
void main() {
int r = readint;
int g = readi... | D |
import std.conv;
import std.string;
import std.algorithm;
import std.array;
import std.stdio;
void main() {
auto s = readln.chomp;
auto t = readln.chomp;
uint a;
foreach (i;0..s.length) {
if (s[i] != t[i]) {
++a;
}
}
a.writeln;
}
| D |
import std.stdio,std.array,std.conv,std.string,std.algorithm;
void main(){
string[] inputStr = readln().split;
int n = to!int(inputStr[0]);
int k = to!int(inputStr[1]);
string[] d = readln().split;
int count = 0;
while(true){
count = 0;
for(int j=0;j<to!string(n).length;j++){
... | D |
import std.stdio;
import std.string;
import std.array;
import std.conv;
import std.algorithm;
void main()
{
int n = to!int(chomp(readln()));
int k = to!int(chomp(readln()));
int x = to!int(chomp(readln()));
int y = to!int(chomp(readln()));
int cost = 0;
if(n > k)
{
cost = k*x+(n-k)*y;
}
else
{
cost = n *... | D |
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 N, A;
scan(N);
scan(A);
writeln(N^^2 - A);
}
void scan(T...)(ref T args) {
string[] line = readln.split;
foreach (ref arg; args) {
... | 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.algorithm;
import std.string;
import std.conv;
import std.math;
void main(){
while(true){
auto s = readln();
if(stdin.eof()) break;
auto s1 = split(s);
real[] inp;
for(int i=0;i<s1.length;i++){
inp ~= to!real(s1[i]);
}
if(inp[0]<=inp[6]&&inp[1]<=inp[7]&&inp[4]<=inp[2]&&inp[... | D |
/+ dub.sdl:
name "A"
dependency "dcomp" version=">=0.6.0"
+/
import std.stdio, std.algorithm, std.range, std.conv;
import std.typecons;
import std.bigint;
// import dcomp.foundation, dcomp.scanner;
// import dcomp.container.deque;
int main() {
auto sc = new Scanner(stdin);
int n, m, k;
sc.read(... | D |
import std.stdio;
void main(){
for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
printf("%dx%d=%d\n",i,j,i*j);
}
}
} | D |
// import chie template :) {{{
import std.stdio, std.algorithm, std.array, std.string, std.math, std.conv,
std.range, std.container, std.bigint, std.ascii, std.typecons, std.format, std.bitmanip;
// }}}
// nep.scanner {{{
class Scanner {
import std.stdio : File, stdin;
import std.conv : to;
import std.array : ... | D |
void main() {
auto D = ri;
iota(D).map!(v => v % 26 + 1).each!writeln;
}
// ===================================
import std.stdio;
import std.string;
import std.functional;
import std.algorithm;
import std.range;
import std.traits;
import std.math;
import std.container;
import std.bigint;
import std.numeric;
import ... | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto rd = readln.split, a = rd[0].to!int, op = rd[1], b = rd[2].to!int;
writeln(op == "+" ? a+b : a-b);
}
| 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 r, g, b, n;
scan(r, g, b, n);
// writeln(r, g, b, n);
long cnt;
foreach (i; 0 .. 3001)
{
foreach (j; ... | 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 |
/+ dub.sdl:
name "A"
dependency "dcomp" version=">=0.9.0"
+/
import std.stdio, std.algorithm, std.range, std.conv;
// import dcomp.foundation, dcomp.scanner;
import std.typecons;
int main() {
Scanner sc = new Scanner(stdin);
int h; int[] a;
sc.read(h, a); h++;
int[] as = new int[h+1];
fo... | 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.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, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto T = readln.chomp.to!int;
foreach (_; 0..T) {
auto S = readln.chomp;
auto len = S.length;
auto l1 = new size_t[](len);
auto r1 = new size_t[](len);
au... | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.traits;
import std.random;
void main() {
int nt = readln.strip.to!int;
foreach (tid; 0 .. nt) {
int n = readln.strip.to!int;
auto s = readln.take (n).array;
auto r... | D |
void main(){
import std.stdio, std.string, std.conv, std.algorithm;
import std.exception;
int n; rd(n);
auto a=readln.split.to!(int[]);
auto mn=reduce!(min)(a);
int[] ids;
foreach(int i; 0..n){
if(a[i]==mn) ids~=i;
}
int dist=n;
foreach(i; 0..(ids.length-1)){
dist=min(dist, ids[i+1]-ids[i]... | 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 |
void main() {
import std.stdio, std.string, std.conv, std.algorithm;
int n, k;
rd(n, k);
auto a = readln.split.to!(int[]);
auto all = reduce!((res, val) => (res && val == a[0]))(true, a);
if (all) {
writeln(0);
return;
}
auto freq = new int[](3 * 10 ^^ 5);
foreach (val; a)
freq[val]++;
... | 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, std.bitmanip;
void main() {
auto N = readln.chomp.to!int;
auto S = readln.chomp;
int i = 0;
for (; i < N - 1; ++i) {
... | 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 n = readln.strip.to !(int);
int [] [] a;
foreach (row; 0..n)
{
a ~= readln.splitter.map !(to !(int)).array;
}
auto m = n /... | 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, 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 File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(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()
{
long h, w;
scan(h, w);
auto c = new string[][](h);
forea... | D |
import std;
// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i]... | 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;
void main() {
auto s = readln.split.map!(to!int);
auto H = s[0];
auto W = s[1];
auto K = s[2];
foreach (i; 0..H+1) {
... | D |
import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); } bool DEBUG = 0;
void log(A ...)(lazy A a){ if(DEBUG) print(a); }
voi... | 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.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;
enum inf = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;
void main() {
int n, m;
scan(n, m);
auto ng = new bool[]... | D |
import std.stdio, std.string, std.conv;
void main(){
for(int i;;++i){
auto a = readln.chomp.to!int;
if(!a) break;
writeln("Case ",i+1,": ",a);
}
} | 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() {
int q... | 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, x;
scan(N, x);
auto a = readln.split.to!(int[]);
... | D |
import std.stdio;
import std.conv;
import std.string;
import core.bitop;
void main() {
auto maxCoin500 = readln.chomp.to!uint;
auto maxCoin100 = readln.chomp.to!uint;
auto maxCoin50 = readln.chomp.to!uint;
auto total = readln.chomp.to!uint;
auto count = 0U;
foreach (c5h;0..maxCoin500 + 1) {
if (c5h * ... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.array;
import std.range;
import std.math;
void main(){
auto n=readln.chomp.to!int;
if(n<=999)writeln("ABC");
else writeln("ABD");
} | D |
import std.stdio, std.conv, std.array, std.string, std.algorithm, std.container, std.range, core.stdc.stdlib, std.math, std.typecons;
T[][] combinations(T)(T[] s, in int m) { if (!m) return [[]]; if (s.empty) return []; return s[1 .. $].combinations(m - 1).map!(x => s[0] ~ x).array ~ s[1 .. $].combinations(m); }
... | 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() {
long h, w;
scan(h, w);
if (h == 1 || w == 1) {
wri... | D |
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;
void main() {
long K = readln.chomp.to!... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string;
void main()
{
readln;
auto ts = readln.split.to!(long[]);
auto m = readln.chomp.to!int;
long d;
long sum = ts.sum;
foreach (_; 0..m) {
auto px = readln.split;
auto p = px[0].to!int;
auto x = px[1].to!lon... | D |
import std.stdio, std.string, std.conv, std.algorithm;
void main() {
int[] tmp = readln.split.to!(int[]);
int a = tmp[0], b = tmp[1], c = tmp[2];
writeln(max(c-a+b, 0));
} | D |
import std.array : split;
import std.conv : to;
import std.stdio;
import std.string : strip;
void main() {
auto temp = split(strip(stdin.readln()));
int n = to!int(temp[0]),
t = to!int(temp[1]);
string start_queue = strip(stdin.readln());
char[] queue = start_queue.dup;
foreach (tick; 0 .. t) {
int i = 0;... | D |
import std.stdio;
import std.string;
import std.algorithm;
import std.conv;
import std.array;
import std.math;
import std.range;
void main()
{
while(1)
{
auto mfr = readln.chomp.split.map!(to!int).array;
if(mfr == [-1, -1, -1]) return;
if(mfr[0 .. 2].count(-1)) writeln("F");
el... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
long P = 10^^9+7;
long[10^^5*2+50] F, RF;
long pow(long x, long n) {
long y = 1;
while (n) {
if (n%2 == 1) y = (y * x) % P;
x = x^^2 % P;
n /= 2;
}
return y;
}
long inv(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 x = lread();
if (x == 1)
{
writeln(0);
}
... | 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 = 1_000_100, MOD = 1_000_000_007, INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias lread(T = long) = (... | D |
import std.algorithm;
import std.array;
import std.container;
import std.conv;
import std.math;
import std.numeric;
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 read... | 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.algorithm, std.conv, std.range;
void main() {
int n = readln.chomp.to!int;
string minWord = readln.chomp;
for (int i = 0; i < n - 1; i++) {
string comp = readln.chomp;
if (comp < minWord) {
minWord = comp;
}
}
minWord.writeln;
} | 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;
void main() {
auto N = readln.chomp.to!int;
auto A = readln.split;
auto dp = new long[][](N, 3);
dp[0][0]... | D |
/+ dub.sdl:
name "A"
dependency "dcomp" version=">=0.6.0"
+/
import std.stdio, std.algorithm, std.range, std.conv;
// import dcomp.foundation, dcomp.scanner;
// import dcomp.modint;
int main() {
auto sc = new Scanner(stdin);
int n, p; int[] a;
sc.read(n, p, a);
long[2] dp = [1, 0];
foreach... | D |
import std.stdio;
import std.algorithm;
import std.string;
import std.range;
import std.array;
import std.conv;
import std.complex;
import std.math;
import std.ascii;
import std.bigint;
import std.container;
void main() {
int n = to!int(readln().strip());
int[][string] d = ["N": [0,1], "E": [1,0], "S": [0,-1], "W":... | D |
import std.stdio, std.string, std.range, std.conv, std.array, std.algorithm, std.math, std.typecons;
void main() {
const N = readln.chomp.to!long;
auto Hs = readln.split.to!(long[]);
foreach_reverse(i; 0..N-1) {
if (Hs[i] > Hs[i+1]+1) {
writeln("No");
return;
} else ... | 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;
void main() {
auto N = readln.chomp.to!int;
auto A = readln.split.map!(to!int).array;
int cnt = 1;
foreach... | D |
import std.stdio, std.string, std.conv, std.math;
void main() {
readln.chomp.to!int.pow(3).writeln;
} | D |
import std.stdio;
import std.array;
import std.conv;
void main(){
string[] d=split(readln());
if(to!int(d[0])<=to!int(d[2])&&to!int(d[2])<=to!int(d[1])){
writeln("Yes");
}else{
writeln("No");
}
} | D |
import std.stdio;
import std.string;
import std.conv;
int main()
{
string s;
while((s = readln()).length != 0)
{
int count = 0;
int number = to!(int)(chomp(s));
foreach(int i;0..10)
{
foreach(int j;0..10)
{
foreach(int k;0..10)
{
foreach(int l;0..10)
{
if(i+k+j+l == number) co... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto S = readln.chomp.to!(wchar[]);
int i;
long r;
foreach (j, s; S) {
if (s == 'W') {
r += j - i;
++i;
}
}
writeln(r);
} | D |
import std.stdio, std.string, std.range, std.algorithm, std.math, std.typecons, std.conv;
void main() {
auto a = readln.split.to!(int[]);
auto A = a[0], B = a[1], C = a[2];
foreach (i; 0.. B) {
if (A * (i+1) % B == C) {
writeln("YES");
return;
}
}
writeln("NO");
}
| 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;
import std.container;
enum MAX = 1_000_100;
ulong MOD = 1_000_000_007... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
alias E = Tuple!(int, "from", int, "to", long, "c");
E[5000] T;
long[2500] CS;
void main()
{
auto nmp = readln.split.to!(int[]);
auto N = nmp[0];
auto M = nmp[1];
auto P = nmp[2].to!long;
forea... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
long[] ns;
foreach (k; 3..10) {
foreach (x; 0..3^^k) {
int a, b, c;
long n;
foreach (_; 0..k) {
n *= 10;
if (x%3 == 0)... | D |
import std.stdio, std.string, std.array, std.conv, std.array, std.algorithm, std.numeric;
void main(){
while (true){
auto a = readln.strip.split.map!(to!long).array;
if (a.length == 0) break;
auto g = gcd(a[0], a[1]);
writeln(g, " ", a[0] / g * a[1]);
}
} | 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;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;
enum inf3 = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;
void main() {
int n, m;
scan(n, m);
auto c = new int[][]... | D |
import std.stdio;
import std.string;
void main() {
char[] line = cast(char[]) readln.chomp;
for(int i = 0; i < line.length - 4; i++) {
char[] str = line[i..(i + 5)];
if (str == "apple") line[i..(i + 5)] = cast(char[])"peach";
else if (str == "peach") line[i..(i + 5)] = cast(char[])"apple";
}
write... | 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 s = readln.chomp;
char[]... | D |
// import chie template :) {{{
static if (__VERSION__ < 2090) {
import std.stdio, std.algorithm, std.array, std.string, std.math, std.conv,
std.range, std.container, std.bigint, std.ascii, std.typecons, std.format,
std.bitmanip, std.numeric;
} else {
import std;
}
// }}}
// nep.scanner {{{
class Scanner {
... | 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.algorithm, std.conv, std.array, std.string;
int[] LONGM = [1,3,5,7,8,10,12];
int[] SHORTM = [4,6,9,11];
void main()
{
auto xy = readln.split.to!(int[]);
writeln(
xy.all!(i => LONGM.canFind(i)) || xy.all!(i => SHORTM.canFind(i)) ? "Yes" : "No"
);
} | D |
import std.stdio, std.string, std.conv;
void main() {
auto input = getStdin!(string[]);
foreach (line; input) {
auto num = line.split(" ");
int w = num[0].to!(int);
int h = num[1].to!(int);
if (w == 0 && h == 0) {
break;
}
for (int i_w = 0; i_w < w; i_w++) {
for (int j_h = 0; j_h < h; j_h++) {
... | 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;
int[] dist, prev;
void main() {
int N;
scan(N);
... | D |
import std.stdio, std.string, std.conv;
import std.algorithm, std.array, std.range;
auto solve(string S_) {
immutable N=S_.chomp.to!int();
immutable A=readln.chomp();
immutable B=readln.chomp();
immutable C=readln.chomp();
int k=0;
foreach(i;0..N) {
if(A[i]!=B[i]) {
++k;
... | D |
import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;
auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}
void readC(T...)(size_t n,ref T t){foreach(ref v;t)... | 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;
import std.container;
alias sread = () => readln.chomp();
ulong MOD =... | D |
import std.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.string;
immutable long mod = 998_244_353;
immutable int limit = 100_005;
long powMod (long a, int p)
{
long res = 1;
for ( ; p != 0; p >>= 1)
{
if (p & 1)
{
res = (res * 1L * a) % mod;
}
a = (a * 1L * a) % mod;
... | 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 std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;
void main() {
int a, b;
scan(a, b);
writeln((a + b + 1) / 2);
}
void scan(T...)(ref T args) {
import std.stdio : readln;
import std.algorithm : splitter;
import std.conv : to;
import std.range.primitives... | 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;
import std.ascii;
import std.conv;
import std.string;
import std.algorithm;
import std.range;
import std.functional;
import std.math;
import core.bitop;
void main()
{
string s = readln.chomp;
long k = readln.chomp.to!long;
long firstone = -1;
foreach (size_t i, char c; s)
if (... | D |
import std.stdio,std.string,std.conv,std.algorithm;
import std.algorithm:rev=reverse;
void main(){
auto input=readln.chomp.split.to!(ulong[]);
auto n=input[0];
auto a=input[1];
auto b=input[2];
auto ans=n/(a+b)*a;
ans+=min(a,n%(a+b));
ans.writeln;
} | D |
import std.stdio, std.algorithm, std.range, std.conv, std.string, std.math, std.typecons;
import core.stdc.stdio;
// foreach, foreach_reverse, writeln
alias Tuple!(int, int) Pair;
void main() {
int n;
scanf("%d", &n);
int[][] graph = new int[][n];
foreach (i; 0..n-1) {
int v, w;
scanf("%d%d", &v, &w);
v--; ... | D |
import std.stdio;
import std.conv;
import std.string;
import std.algorithm;
import std.range;
void main()
{
auto input = readln.split.to!(int[]);
auto X = input[0];
auto Y = input[1];
auto Z = input[2];
auto ans = X / (Y + Z);
(ans * (Y + Z) + Z > X ? ans - 1 : ans ).writeln;
} | 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 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 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.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.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.algorithm, std.conv, std.array, std.string, std.math, std.typecons;
long[3] DR = [1, 100, 10000];
void main()
{
auto dn = readln.split.to!(long[]);
auto D = dn[0];
auto N = dn[1];
if (N == 100) ++N;
writeln(N * DR[D]);
} | 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;
enum inf = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;
void main() {
auto L = readln.chomp.map!(c => c == '1').array;
... | 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 calc(int[][] g) {
... | 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;
void main() {
auto s = readln.split.map!(to!int);
auto H = s[0];
auto W = s[1];
auto K = s[2];
auto A =... | D |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.