code stringlengths 4 1.01M | language stringclasses 2
values |
|---|---|
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.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;
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.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.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, 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;
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 |
// 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 |
/+ 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 |
// 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;
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.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.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 |
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.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.stdio, std.string, std.range, std.conv, std.array, std.algorithm, std.math, std.typecons, std.datetime;
void main() {
const S = readln.chomp;
auto d = Date.fromISOString(S.replace("/", ""));
if (d <= Date(2019, 4, 30)) {
writeln("Heisei");
} else {
writeln("TBD");
}
}
| D |
import std.stdio;
import std.conv;
import std.array;
import std.algorithm;
import std.range;
import std.string;
alias println = writeln;
alias print = write;
int readint() {
return readln.chomp.to!int;
}
void main() {
if (readint() == 1) {
println("Hello World");
} else {
println(readint() + readint());... | D |
import std.stdio;
import std.conv;
import std.algorithm;
import std.range;
import std.string;
void main() {
while (true) {
auto input = readln.chomp.split.map!(to!int);
if (input.array == [0, 0]) break;
int h = input[0];
int w = input[1];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w... | D |
//prewritten code: https://github.com/antma/algo
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.traits;
final class InputReader {
private:
ubyte[] p, buffer;
bool eof;
bool rawRead () {
if (eof) {
return fals... | 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.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 |
// 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;
string s;
void main() {
scan(s);
writeln(s[0] ~ (s.length.to!int - 2).to!string ~ s[$-1]);
}
void scan(T...)(ref ... | D |
import std.stdio, std.conv, std.string;
void main() {
auto ip = readln.split.to!(int[]);
if(ip[0] + ip[1] <= ip[1] + ip[2] && ip[0] + ip[1] <= ip[2] + ip[0]){
writeln(ip[0] + ip[1]);
} else if(ip[1] + ip[2] <= ip[0] + ip[1] && ip[1] + ip[2] <= ip[2] + ip[0]){
writeln(ip[1] + ip[2]);
} else {
writeln(ip[2] + ... | D |
void main() {
auto N = ri;
if(N < 1200) {
writeln("ABC");
} else if(N < 2800) {
writeln("ARC");
} else writeln("AGC");
}
// ===================================
import std.stdio;
import std.string;
import std.functional;
import std.conv;
import std.algorithm;
import std.range;
import std.traits;
import std.mat... | D |
import std.stdio;
void main(){
string s;
int[2] score;
while ((s = readln()) != "0\n") {
score = 0;
foreach (ch; s[1..$-1]) score[ch - 'A']++;
int t = score[0] > score[1] ? 0 : 1;
score[t]++;
writeln(score[0], " ", score[1]);
}
} | D |
import std.stdio;
import std.conv;
import std.string;
import std.algorithm;
import std.range;
import std.functional;
import std.math;
import core.bitop;
void main()
{
/// ABC089_D
string s = readln.chomp;
writeln((s.canFind('a') && s.canFind('b') && s.canFind('c')) ? "Yes" : "No");
}
| D |
void main(){
int k = _scan();
writeln((k/2)*((k+1)/2));
}
import std.stdio, std.conv, std.algorithm, std.numeric, std.string, std.math;
// 1要素のみの入力
T _scan(T= int)(){
return to!(T)( readln().chomp() );
}
// 1行に同一型の複数入力
T[] _scanln(T = int)(){
T[] ln;
foreach(string elm; readln().chomp().split()){
ln ~= elm.to... | 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.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
void main() {
auto s = readln.splitter;
auto a = s.front;
s.popFront();
auto b = s.front;
writeln(b, a);
}
| 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;
// }}}
// nep.scanner {{{
class Scanner
{
import std.stdio : File, stdin;
import std.conv : to;
import std.array : split;
import ... | 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 times(alias fun)(int n) {
foreach(i... | D |
import std.stdio, std.string, std.conv, std.range, std.algorithm;
void main() {
auto a = readln.chomp.to!int;
auto b = readln.chomp.to!int;
auto h = readln.chomp.to!int;
((a + b) * h / 2).writeln;
}
| D |
import std.stdio, std.range, std.conv, std.string, std.array, std.functional, std.math;
import std.algorithm.comparison, std.algorithm.iteration, std.algorithm.mutation, std.algorithm.searching, std.algorithm.setops, std.algorithm.sorting;
import std.container.binaryheap;
void main()
{
auto N = readln().strip.to!(... | 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;
// }}}
// nep.scanner {{{
class Scanner
{
import std.stdio : File, stdin;
import std.conv : to;
import std.array : split;
import ... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto ii = readln.split.to!(long[]);
auto A = ii[0];
auto B = ii[1];
auto C = ii[2];
auto X = ii[3];
auto Y = ii[4];
writeln(min(
A*X + B*Y,
C*X*2 + max(0, (Y... | D |
import std.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.string;
bool solve (string s)
{
if (s.length % 2 != 0)
{
return false;
}
if (s.front == ')' || s.back == '(')
{
return false;
}
return true;
}
void main ()
{
auto tests = readln.strip.to !(int);
foreach (test; 0..tests)... | D |
import std.stdio, std.conv, std.string, std.math;
void main(){
auto ip = readln.chomp.to!int;
writeln(800 * ip - 200 * (ip / 15));
} | D |
// Cheese-Cracker: cheese-cracker.github.io
void theCode(){
int k = scan!int;
int j = 0;
for(int i = 1; i <= 3*k; ++i){
if(i % 3 == 0 || i % 10 == 3) continue;
++j;
if(j == k){
writeln(i);
}
}
}
void main(){
long tests = scan; // Toggle!
while... | D |
// cheese-cracker [2022-01-31]
void solve(){
long n = scan;
long ten = (n/10) % 10;
long d = n % 7;
long u = 7 - d;
long down = n - d;
long up = n + u;
long tend = (down / 10) % 10;
long tenu = (up / 10) % 10;
if(tend == ten){
writeln(down);
}else{
writeln(up);
... | D |
import core.stdc.stdio;
import std.algorithm;
static immutable int unSet=-114514;
struct Data{
int a,l,r,m;
}
Data Comb(const ref Data a,const ref Data b){
Data r;
r.a=a.a+b.a;
r.l=max(a.l,a.a+b.l);
r.r=max(a.r+b.a,b.r);
r.m=max(a.m,b.m,a.r+b.l);
return r;
}
struct Node{
Node* l,r,p;
int delay=unSet,size,v;... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, 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() {
long a, b;
scan(a, b);
auto d =... | D |
import std.stdio;
import std.string;
import std.conv;
import std.math;
int main() {
string buf = strip(readln());
while ((buf = strip(readln())) != null) {
writeln(is_right_triangle(buf));
}
return 0;
}
string is_right_triangle(string data_set) {
string[] sides = split(data_set);
int... | D |
void main() {
auto S = readln.to!(char[]);
S[3] = '8';
S.writeln;
}
// ===================================
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.range;
import std.traits;
import std.math;
import std.container;
import std.bigint;
import std.numeric;
import std.conv;
... | 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 K = readln.chomp.to!long;
long r = 1, k;
foreach (_; 0..10^^7+1) {
k = (k*10+7) % K;
if (k == 0) {
writeln(r);
return;
... | D |
import std.stdio, std.string, std.conv;
void main()
{
auto ip = readln.split, A = ip[0], B = ip[1], C = ip[2];
if(A == B){
writeln(C);
}
if(B == C){
writeln(A);
}
if(C == A){
writeln(B);
}
} | D |
import std;
alias sread = () => readln.chomp();
alias lread = () => readln.chomp.to!long();
alias aryread(T = long) = () => readln.split.to!(T[]);
void main()
{
string s;
scan(s);
// writeln(s);
foreach (i; 2 .. s.length)
{
// writeln(s[0 .. $ - i]);
auto ss = s[0 .. $ - i];
... | D |
import std.stdio, std.conv, std.string, std.array, std.math, std.regex, std.range, std.ascii;
import std.typecons, std.functional, std.traits;
import std.algorithm, std.container;
import core.stdc.stdlib;
void main()
{
auto N = scanElem;
auto K = scanElem;
char[] S = readln.strip.to!(char[]);
for(int i=0;... | D |
import std.stdio, std.string, std.range, std.conv, std.array, std.algorithm, std.math, std.typecons;
void main() {
const tmp = readln.split.to!(long[]);
const N = tmp[0], K = tmp[1];
writeln(2 * K - 1 <= N ? "YES" : "NO");
}
| 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 |
// 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;
string n;
void main() {
int n;
scan(n);
if (n / 100 == n % 10) {
writeln("Yes");
}
else {
... | 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 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 std.stdio,std.conv,std.string,std.algorithm;
void main(){
auto ab=readln().chomp().split().map!(to!int);
int a=ab[0],b=ab[1];
if(a%2==0 || b%2==0) writeln("Even");
else writeln("Odd");
} | D |
import std.stdio, std.conv, std.string, std.algorithm, std.range;
void main() {
auto a = readln.split[0].to!int;
auto s = readln.split[0];
if(a >= 3200) s.writeln; else "red".writeln;
} | D |
void main(){
import std.stdio, std.string, std.conv, std.algorithm;
long k, a, b; rd(k, a, b);
if(a>=k){writeln(1); return;}
auto d=a-b;
if(d<=0){writeln(-1); return;}
auto tmp=(k-a+d-1)/d;
writeln(tmp*2+1);
}
void rd(T...)(ref T x){
import std.stdio, std.string, std.conv;
auto l=readln.split;
as... | 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 K = readln.chomp.to!(char[]);
auto D = readln.chomp.to!long;
auto DP1 = new long[][](2, D);
auto DP2 = new long[][](2, D);
foreach (i, c; K) {
if (i... | D |
import std.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.string;
void main ()
{
foreach (test; 0..readln.strip.to !(int))
{
auto s = readln.strip;
auto x = readln.strip.to !(int);
auto n = s.length.to !(int);
auto w = new char [n];
w[] = '1';
foreach (i; 0..n)
{
if (s[i]... | D |
// AtCoder My Practice
// author: Leonardone @ NEETSDKASU
import std.stdio : readln, writeln;
import std.string : chomp;
import std.conv : to;
void main() {
auto n = readln.chomp.to!uint;
auto s1 = readln.chomp;
auto s2 = readln.chomp;
long ans, md = 1_000_000_007;
uint i, pat;
i... | 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 a = "AKIHABARA";
int i;
auto f = ... | 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 n = readint();
bool[strin... | D |
void main()
{
string s = rdStr;
long len = s.length;
long[] lists = new long[len];
auto g = s.group.array;
long cnt;
foreach (x; g)
{
long n = x[1].to!long;
cnt += n;
if (x[0] == 'R')
{
lists[cnt-1] += (n >> 1) + (n & 1);
lists[cnt] +=... | D |
void main() {
auto X = ri;
if(X == 7 || X == 5 || X == 3) {
writeln("YES");
} else writeln("NO");
}
// ===================================
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.bigin... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric, std.container, std.range;
void get(Args...)(ref Args args)
{
import std.traits, std.meta, std.typecons;
static if (Args.length == 1) {
alias Arg = Args[0];
static if (isArray!Arg) {
... | 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 ab = readln.chomp.split.to!(int[]);
auto d = ab[1] - ab[0];
int sum;
forea... | D |
import std.stdio, std.string, std.range, std.conv, std.array, std.algorithm, std.math, std.typecons;
void main() {
auto S = readln.chomp;
iota(S.length-2).map!(i => S[i..i+3]).map!(s => abs(753-s.to!int)).reduce!min.writeln;
}
| 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;
void main(){
auto ip1 = readln.chomp;
auto ip2 = readln.chomp;
a... | D |
void main()
{
long[] tmp = readln.split.to!(long[]);
long n = tmp[0], k = tmp[1];
long[] a = readln.split.to!(long[]);
long mod = 10 ^^ 9 + 7;
long[] l = new long[n], r = new long[n];
foreach (i; 0 .. n)
{
foreach (j; 0 .. n)
{
if (a[i] > a[j])
{
... | D |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.