code stringlengths 4 1.01M | language stringclasses 2
values |
|---|---|
import std.stdio;
import std.string;
import std.conv;
void main(){
int x = readln().chomp().to!int();
writeln(x * x * x);
} | D |
unittest
{
assert( [ "erasedream" ].parse.expand.solve == "YES" );
assert( [ "dreameraser" ].parse.expand.solve == "YES" );
assert( [ "dreamerer" ].parse.expand.solve == "NO" );
}
import std.conv;
import std.range;
import std.stdio;
import std.typecons;
void main()
{
stdin.byLineCopy.parse.expand.solve.writeln;... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric, std.bigint;
void main()
{
auto N = readln.chomp.to!int;
int r, b;
foreach (c; readln.chomp.to!(char[])) {
if (c == 'R') {
++r;
} else if (c == 'B') {
++b;
}... | D |
module main;
import std.stdio;
int main(string[] argv)
{
int n,k;
scanf("%d", &n);
int [] a = new int[1005];
int [] b = new int[1005];
int [] c = new int[1005];
for(int i = 1; i<=n; i++)
scanf("%d:%d", &a[i],&b[i]);
for(int i=1;i<=n;i++)
{
c[i]=a[i]*60+b[i];//printf("%d ",c[i]);
}
for(int i=1;i<=n;i++)... | 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.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 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 main()
{
int a, b; readV(a, b);
writeln(a... | D |
void main()
{
long n, k;
rdVals(n, k);
long total = 1;
foreach (i; k .. n+1)
{
long l = (i * (i - 1)) >> 1;
long r = i * n - l;
total = (total + r - l + 1) % mod;
}
total.writeln;
}
enum long mod = 10^^9 + 7;
enum long inf = 1L << 60;
enum double eps = 1.0e-9;
T r... | D |
void main() {
int[] tmp = readln.split.to!(int[]);
int h = tmp[0], w = tmp[1];
int cnt;
string[] s = new string[h];
foreach (i; 0 .. h) {
s[i] = readln.chomp;
cnt += s[i].count('.');
}
int[] dy = [-1, 0, 1, 0], dx = [0, 1, 0, -1];
int[][] dist = new int[][](h, w);
... | D |
void main()
{
long n, q;
rdVals(n, q);
auto st = SegTree!("a < b ? a : b", long, (1L<<31)-1)(n);
foreach (i; 0 .. q)
{
long com, x, y;
rdVals(com, x, y);
if (com) st.query(x, y+1).writeln;
else st.update(x, y);
}
}
struct SegTree(alias pred, T, T init)
{
i... | 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 |
void main() {
auto S = rs;
int i = S[0..2].to!int;
int j = S[2..$].to!int;
bool YYMM = j <= 12 && 1 <= j;
bool MMYY = i <= 12 && 1 <= i;
if(YYMM && MMYY) writeln("AMBIGUOUS");
else if(YYMM) writeln("YYMM");
else if(MMYY) writeln("MMYY");
else writeln("NA");
}
// ===================================
import st... | D |
import std.stdio,std.conv, std.algorithm, std.container,std.array,std.range,std.string,std.typecons;
const dx = [1,0,-1,0], dy = [0,1,0,-1];
const readMixin = q{
auto line = readln().split();
if (line.length < args.length) return;
foreach(i,ref arg; args) arg = line[i].to!(typeof(arg));
};
void read(T...) (auto re... | D |
module AOJ_Volume0028;
import std.stdio,std.string,std.conv;
int main()
{
int[101] count;
int max;
string s;
while((s = readln.chomp).length != 0)
{
int value = s.to!int;
count[value]++;
}
max = count[0];
foreach(i;0..100)
{
if(max < count[i]) max = count[i];
}
foreach(i;0..100)
{
if(max == count... | D |
import std.stdio, std.conv, std.string, std.range, std.algorithm, std.array,
std.functional, std.container, std.typecons;
void main() {
int N = readln.split[0].to!int;
int[] a = readln.split.to!(int[]);
int[] ans = new int[N];
foreach_reverse(i, c; a) {
ulong n = i + 1;
ans[i] = c ^ iota(i, N, n).ma... | D |
import std.stdio, std.string, std.conv;
void main() {
int[] tmp = readln.split.to!(int[]);
int n = tmp[0], x = tmp[1];
int[] l = readln.split.to!(int[]);
int d, cnt = 1;
foreach (i; 0 .. n) {
d += l[i];
if (d > x) break;
++cnt;
}
cnt.writeln;
} | D |
void main()
{
int[] tmp = readln.split.to!(int[]);
int n = tmp[0], h = tmp[1], w = tmp[2];
int cnt;
foreach (i; 0 .. n)
{
int[] ab = readln.split.to!(int[]);
int a = ab[0], b = ab[1];
if (a >= h && b >= w) ++cnt;
}
cnt.writeln;
}
import std.stdio;
import std.string... | 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() {
string s, t;
scan(s);
scan(t);
auto... | 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.stdio;
import std.algorithm;
import std.string;
import std.functional;
import std.array;
import std.conv;
import std.math;
import std.typecons;
import std.regex;
import std.range;
int[] dx = [-2,-2,-2,-1,-1,0,0,1,1,2,2,2];
int[] dy = [1,0,-1,2,-2,2,-2,2,-2,1,0,-1];
int[] spx,spy;
int tl;
bool saiki(int x,in... | D |
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
alias Edge = Tuple!(int, "to", int, "c", int, "rev");
void main() {
int n, m;
scan(n, m);
auto adj = new Edge[][](n, 0);
foreach (i ; 0 .. m) {
int ui, vi, c... | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto rd = readln.split.map!(to!int), a = rd[0], b = rd[1], c = rd[2];
auto r = iota(a, b+1).count!(i => c % i == 0);
writeln(r);
} | D |
import std.algorithm;
import std.array;
import std.ascii;
import std.bigint;
import std.complex;
import std.container;
import std.conv;
import std.functional;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
auto readInts() {
return array(map!(to!int)(readln().strip().split... | 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_007;
void main() {
int n;
scan(n);
auto p = readln.split.to!... | D |
void main(){
string s = readln().chomp();
if( s[2] == s[3] && s[4] == s[5])writeln("Yes");
else writeln("No");
}
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;
forea... | 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.stdio, std.string, std.conv;
import std.algorithm, std.array;
auto solve(string S) {
immutable N = S.length.to!int();
immutable s = S.map!(c=>(c-'0').to!long()).array();
auto v = new long[][](N,N);
v[0][]=s;
foreach(i;1..N)
foreach(j;0..N-i)
v[i][j]=v[i-1][j]*10+s[i+... | 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 calc(string s, int... | D |
import std.stdio,std.string,std.conv,std.array;
void main(){
loop:for(;;){
auto rcs = readln().chomp().split();
auto a = to!int(rcs[0]);
auto b = to!int(rcs[2]);
final switch(rcs[1]){
case "+":writeln(a+b);break;
case "-":writeln(a-b);break;
case "*":writeln(a*b);break;
case "/":writeln(a/b);break;
c... | D |
void main() {
int s = readln.chomp.to!int;
bool[] a = new bool[1000001];
int cnt = 1;
while (!a[s]) {
a[s] = true;
++cnt;
if (s % 2) s = 3 * s + 1;
else s /= 2;
}
cnt.writeln;
}
import std.stdio;
import std.string;
import std.array;
import std.conv;
import std.al... | 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 = 998_244_353, INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias lread(T = long) = () ... | 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.algorithm, std.range, std.conv;
void main()
{
// ①入力
auto N = readln.chomp.to!int;
auto A = readln.chomp.to!int;
// ②処理
int res = N^^2-A;
// ③出力
writeln(res);
} | D |
import std.stdio;
import std.string;
import std.conv;
import std.math;
int main()
{
string s;
while((s=readln.chomp).length != 0)
{
double value = s.to!double;
double min_t = value/9.8;
double just = 4.9*min_t*min_t;
int number = cast(int)((just+10)/5.0);
writeln(number);
}
return 0;
} | 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.math, std.stdio, std.conv, std.string, std.range, std.algorithm;
struct C{ double x, y, r; }
void main()
{
foreach(unused;0..readln.chomp.to!int)
{
auto s = readln.split.map!(to!double);
isOverlap(C(s[0], s[1], s[2]), C(s[3], s[4], s[5])).writeln;
}
}
int isOverlap(C a, C b)
{
... | 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;
void main()
{
auto S = readln.strip;
long res;
foreach(long l;0..S.length)
{
foreach(long r;l..S.length)
{
... | 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(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;
void main(){
for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
writeln(i,"x",j,"=",i*j);
}
}
} | D |
void main()
{
long x = rdElem;
long result;
result += x / 500 * 1000;
x %= 500;
result += x / 5 * 5;
result.writeln;
}
enum long mod = 10^^9 + 7;
enum long inf = 1L << 60;
T rdElem(T = long)()
if (!is(T == struct))
{
return readln.chomp.to!T;
}
alias rdStr = rdElem!string;
alias rdDchar... | 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() {
long x, y;
scan(x, y);
writeln(abs(x - y)... | D |
import std.stdio;
import std.conv;
import std.array;
void main() {
string[] inputs = split(stdin.readln());
auto a = to!(int)(inputs[0]),
op = to!(char)(inputs[1]),
b = to!(int)(inputs[2]);
writeln((op == '+') ? (a + b) : (a - b));
}
| D |
import std.stdio, std.conv, std.string, std.bigint;
import std.math, std.random, std.datetime;
import std.array, std.range, std.algorithm, std.container, std.format;
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
/*
まず0の耳がない場合を考える
その場合は、端から... | 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.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, 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, 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.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 N = s[0];
auto A = s[1];
auto B = s[2];
int ans = 0;
int x;
... | D |
import std.stdio, std.string, std.conv;
import std.typecons;
import std.algorithm;
void main(){
auto nk = readln.chomp.split.map!(to!int);
int n = nk[0];
int k = nk[1];
int l = 1;
int r = n*n - n*(n-k+1) + 1;
int sum = 0;
for(int x = r; x <= n*n; x += n-k+1){
sum += x;
}
w... | 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.algorithm, std.conv, std.range, std.stdio, std.string;
int main(string[] argv)
{
int n, p1, m;
scanf("%d %d %d", &n, &p1, &m);
long p = p1;
long [] d = new long[n + 1];
long [] t = new long[n + 1];
for(int i = 0; i < n; i++) {
scanf("%lld %lld", &t[i], &d[i]);
}
d[n] = 1152921504606846976L;
t[n] ... | 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, core.stdc.stdlib;
bool solve() {
auto N = readln.chomp.to!int;
int pa = 0, pb = 0;
bool ok = true;
while (N--) {
a... | D |
import std.stdio, std.string, std.conv, std.range, std.algorithm, std.regex;
void main() {
auto HW = readln.chomp.split.map!(to!int);
auto H = HW[0];
foreach (_; 0 .. H) {
auto C = readln;
C.write;
C.write;
}
}
| 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()
{
auto r = lread();
writeln(r ^^ 2);
}
void scan(L...)(ref L A)
{
auto l = readln.split;
foreach (i, T; L)
{
A... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto S = readln.chomp;
foreach (i; 0..S.length-1) if (S[i..i+2] == "AC") {
writeln("Yes");
return;
}
writeln("No");
} | 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.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;
}
bool isPrime(int n) {
if (n < 2)
return ... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.typecons;
import std.numeric, std.math;
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_rd[0]; s_rd.popFront; re... | 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 |
void main() {
string[] tmp = readln.split;
string x = tmp[0], y = tmp[1];
if (x < y) {
'<'.writeln;
} else if (x > y) {
'>'.writeln;
} else {
'='.writeln;
}
}
import std.stdio;
import std.string;
import std.array;
import std.conv;
import std.algorithm;
import std.range;
... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.range;
import std.container;
import std.bigint;
import std.math;
void main()
{
auto nm = readln.split.map!(to!int);
auto co = readln.split.map!(to!int);
auto dp = new int[](nm[0] + 1);
dp[] = int.max;
foreach (c; co) {
if (c ... | 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 |
import std.algorithm;
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);
}
long modPow(long mod)(long x, long n) {
if (n == 0) return 1;
if (... | 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 bignu... | 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 readA(T)(size_t n,ref T[]t){t=new T[](n);auto ... | 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;
import std.typecons;
auto readInts() {
return array(map!(to!int)(readln().strip().split()));
}
void main() {
... | 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;
bool DEBUG = 0; void log(A ...)(lazy A a){ if(DEBUG) print(a); }
void main(string[] args){ args ~= ["", ""]; string cmd = args[1]; if(cmd == "-debug") DEBUG = 1;... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.typecons;
import std.numeric, std.math;
import core.bitop;
string FMT_F = "%.10f";
T RD(T = long)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.t... | 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;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;
void main() {
int d, g;
scan(d, g);
auto p = new int[](d);
auto c = new int[](d);
foreach (i ; 0 .. d) {
scan(p[i], c[i]);
}
... | D |
void main() {
auto D = ri;
switch(D) {
case 25: writeln("Christmas"); break;
case 24: writeln("Christmas Eve"); break;
case 23: writeln("Christmas Eve Eve"); break;
case 22: writeln("Christmas Eve Eve Eve"); break;
default: break;
}
}
// ===================================
import std.stdio;
import std.st... | 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.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto N = readln.chomp.to!int;
long[] as = [0];
foreach (i, a; readln.split.to!(long[])) as ~= a + as[i];
auto pq = new int[](N+1);
auto rs = new int[](N+1);
int i = 2, j = 1;
... | D |
void main() {
int[] tmp = readln.split.to!(int[]);
int a = tmp[0], b = tmp[1];
string s = readln.chomp;
bool ok = true;
foreach (i, x; s) {
if (i == a) {
if (x != '-') {
ok = false;
}
} else {
if (!x.isNumber) {
ok =... | 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.conv, std.string, std.range, std.algorithm, std.range;
void main()
{
auto N = readln.split[0].to!int;
auto H = readln.split.to!(int[]);
for(int i = N - 1; i > 0; i--) {
if(H[i-1] > H[i]) H[i-1]--;
}
for (int i = 1; i < N; i++)
{
if (H[i - 1] > H[i])
{
writeln("No")... | D |
import std.stdio;
import std.string; // chomp????????????????????????(?????????????????????)
import std.conv; // to????????????????????????
void main() {
int x = to!int(chomp(readln()));
writeln(x ^^ 3);
} | D |
void main()
{
string s = rdStr;
bool[] alpha = new bool[26];
if (s.length == 26)
{
alpha[s[$-1]-'a'] = true;
foreach_reverse (i; 0 .. 25)
{
if (s[i] < s[i+1])
{
s[0..i].write;
long idx;
foreach (j; s[i]-'a'+... | D |
import std.stdio, std.string, std.conv;
import std.math;
auto solve(string s_)
{
immutable n = s_.to!long();
immutable s = readln.chomp.to!long();
if(s==n) return s+1;
immutable m = sqrt(n.to!real()).to!long+1;
foreach(i;2..m)
{
long v=n, c=0;
while(v) c+=v%i, v/=i;
if(... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
class Card{
private:
string _name;
string _mark;
int _value;
public:
@property{
string name() const { return _name; }
int value() const { return _value; }
}
this(string name){
_name = name;
_mark = name[0..1];
_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, core.bitop;
enum inf = 1<<30;
enum mod = 10L^^9 + 7;
void main() {
int n, a;
scan(n, a);
auto x = readln.split.to!(int[]);
x[] -= a;
immutable ofs = n * 5... | 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;
int calc(int k, string ... | 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.array;
import std.algorithm;
import std.conv;
int gcd (int x, int y) {
if(x < y) swap(x, y);
if(y == 0) return x;
return gcd(y, x % y);
}
void main () {
int a, b;
while(true) {
string[] input = split(readln());
if(input.length == 0) break;
a = t... | 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 a, b;
scan(a, b);
int ans = max(2*a - 1... | D |
/* imports all std modules {{{*/
import
std.algorithm,
std.array,
std.ascii,
std.base64,
std.bigint,
std.bitmanip,
std.compiler,
std.complex,
std.concurrency,
std.container,
std.conv,
std.csv,
std.datetime,
std.demangle,
std.encoding,
std.exception,
std.file,
std.format,
std.functi... | 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 Q = readln.chomp.to!int;
long ans;
while (Q--) {
auto n = readln.chomp.to!long;
if (n % 4 == ... | 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;
void main()
{
readln.replace("peach", "~").replace("apple", "peach").replace("~", "apple").write;
} | 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 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.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto N = readln.chomp.to!int;
auto AS = readln.split.to!(long[]);
if (N == 0) {
writeln(AS[0] == 1 ? 1 : -1);
return;
}
long r, c = 1;
long[] BS;
foreach (a... | D |
import std.stdio;
import std.string;
import std.conv;
import std.range;
import std.array;
import std.algorithm;
void main(){
auto a=readln.chomp.to!int;
writeln(a/3);
} | 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;
int calc(string a, stri... | 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 (_t; 0..T) {
auto N = readln.chomp.to!long;
if (N == 1) {
writeln("FastestFinger");
continue;
}
if (... | 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 N = readln.chomp.to!int;
auto A = readln.split.map!(to!long).array;
long ans = A.map!(a => abs(a)).sum;
... | D |
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
immutable mod = 10^^9 + 7;
void main() {
int n, k;
scan(n, k);
auto x = new int[](n), y = new int[](n);
foreach (i ; 0 .. n) {
scan(x[i], y[i]);
}
l... | D |
void main()
{
long[] a = readln.split.to!(long[]);
writeln(a.sum >= 22 ? "bust" : "win");
}
import std.stdio;
import std.string;
import std.array;
import std.conv;
import std.algorithm;
import std.range;
import std.math;
import std.numeric;
import std.container;
import std.typecons;
import std.ascii;
import s... | D |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.