code stringlengths 4 1.01M | language stringclasses 2
values |
|---|---|
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 n; readV(n);
if (n == 1) {
... | 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;
alias sread = () => readln.chomp();
alias lread = () => readln.chomp.to!long();
alias aryread(T = long) = () => readln.split.to!(T[]);
//aryread!string();
void main()
{
auto x = lread();
if ((400 <= x) && (x <= 599))
{
writeln(8);
}
else if ((600 <= x) && (x <= 799))
{
... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto X = readln.chomp.to!int;
auto DP = new int[][](6, 10^^5+1);
int solve(int i, int x) {
if (i == 6) return x == 0 ? 1 : -1;
if (DP[i][x] != 0) return DP[i][x];
int... | D |
import std.stdio,std.string,std.conv;
int main()
{
string s;
int count_1 = 0,count_2 = 0;
while((s = readln.chomp).length != 0)
{
string[] _s = s.split(",");
int len1 = _s[0].to!int;
int len2 = _s[1].to!int;
int len3 = _s[2].to!int;
if(len3*len3 == len1*len1 + len2*len2) count_1++;
if(len1 == len2) co... | 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.stdio,std.conv,std.string,std.math;
void main(){
double money = 100000;
while(true){
char[] buf;
stdin.readln(buf);
double x = buf.chomp().to!double();
if(0 <= x && x <= 100){
for(int i = 0;i < x;i++){
money *= 1.05;
if(mone... | 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;
void scan(T...)(ref T args) {
import std.stdio : readln;
import std.algorithm : splitter;
import std.conv : to;
import std.range.primiti... | D |
void main() {
problem();
}
void problem() {
auto H = scan!int;
auto W = scan!int;
auto K = scan!int;
auto MAP = H.iota.map!(x => scan).array;
long solve() {
long ans;
foreach(wx; 0..2^^(W)) {
auto w = (W+1).iota.map!(b => wx >> b & 1).array;
foreach(hx; 0..2^^(H)) {
auto h = (... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
int[10^^5] AS;
void main()
{
auto N = readln.chomp.to!int;
auto as = readln.split.to!(int[]);
auto x = as[0];
foreach (a; as) {
x = gcd(x, a);
}
writeln(x);
} | D |
import std.stdio, std.string,std.range, std.conv, std.array, std.algorithm, std.math, std.typecons, std.functional, std.bigint, std.random;
void main() {
auto S = readln.chomp;
if (S[0] == S[1]) {
writeln("1 2");
return;
}
foreach (i; 0..S.length-2) {
if (S[i] == S[i+1] || S[i+1] == S[i+2] || S[i+2... | 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.stdio, std.conv, std.string, std.algorithm, std.range, std.math;
void main() {
auto po = readln.split.to!(int[]);
auto H = po[0], W = po[1];
string[] lines;
foreach (i; 0..H) {
lines ~= readln.chomp;
}
foreach (i; 0..W+2) {
write("#");
}
writeln;
foreach (line; lines) {
write("... | 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 |
unittest
{
assert( [ "apple" ].solve == "apples" );
assert( [ "bus" ].solve == "buses" );
assert( [ "box" ].solve == "boxs" );
}
import std.conv;
import std.range;
import std.stdio;
void main()
{
stdin.byLineCopy.solve.writeln;
}
auto solve( Range )( Range input )
if( isInputRange!Range && is( ElementType!Rang... | 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;
void main() {
int N, tk, ao;
scan(N, tk, ao);
... | D |
import std.stdio, std.string, std.conv;
enum N = 110000;
enum M = 10000;
immutable hurui = {
bool[N + 1] table;
table[] = true;
table[0 .. 2] = false;
for(int i = 2; i * i <= N; ++i)
{
if(table[i])
{
for(int j = 2; i * j <= N; j++)
{
table[i *... | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.stdio;
import std.string;
import std.range;
int readint() {
return readln.chomp.to!int;
}
int[] readints() {
return readln.split.map!(to!int).array;
}
void main() {
const int N = 1_000_000;
auto tab = new bool[N];
... | D |
import std.stdio;
import std.string;
import std.conv;
void main()
{
auto N = chomp(readln());
writeln((N[0] == '9' || N[1] == '9') ? "Yes" : "No");
} | D |
import std.stdio;
import std.string;
import std.conv;
import std.math;
int main()
{
//int n = to!(int)(chomp(readln()));
int n = readln.chomp.to!int;
foreach(int i;0..n)
{
string s = chomp(readln());
string[] _s = s.split(" ");
double x1 = to!double(_s[0]);
double y1 = to!double(_s[1]);
double x2 = t... | D |
import std.stdio,std.string,std.array,std.algorithm,std.range,std.conv;
int main(){
auto s=readln.chomp;
auto n=s.length;
if(s==s.rev){
auto s1=s.dup[0..(n-1)/2];
if(s1==s1.rev){
auto s2=s.dup[(n+3)/2-1..$];
if(s2==s2.rev){
"Yes".writeln;
... | D |
import std.stdio, std.algorithm, std.string, std.conv, std.array, std.range, std.math;
int read() { return readln.chomp.to!int; }
int[] reads() { return readln.split.to!(int[]); }
void main() {
int n = read();
int[] a = reads();
int ans;
foreach (i; 1..n) {
if (a[i-1] == a[i]) {
a[... | 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 mod = 998244353;
void main() {
long n, a, b, k;
scan(n, a, b, k);
auto fact = new long[](n + 1);
fact[0] = 1;
foreach (i ; 1 .. n + 1) {
... | 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;
s = chomp(s);
int ans = 0;
for(int i=0;i<s.length;i++){
char c = s[i];
int n1,n2;
if(c == 'I') n1 = 1;
else if (c=='V') n1 = 5;
... | 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.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto n = readln.chomp.to!int;
writeln(0.bitSet(n.bsr));
}
pragma(inline) {
pure bool bitTest(T)(T n, size_t i) { return (n & (T(1) << i)) != 0; }
pure T bitSet(T)(T n, size_t i) { return n | (T(1) << i); }
pure T bitReset(T)(T n... | 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.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.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;
void main() {
int maxN = 10^^6;
int[] f, f_odd;
for(int n=1; ;n++) {
... | D |
import std.stdio, std.string, std.algorithm, std.conv;
void main(){
auto a = readln.split.map!(to!int);
writeln(a[0]<a[1]&&a[1]<a[2] ? "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 |
void main() {
problem();
}
void problem() {
const K = scan!int;
const N = scan!int;
const A = scan!(int)(N);
int solve() {
auto delta = new int[N];
foreach(i; 0..N-1) {
delta[i] = A[i+1] - A[i];
}
delta[N-1] = K - A[N-1] + A[0];
int max;
foreach(d; delta){
if (max < d) ... | D |
import std.stdio,
std.string,
std.conv,
std.algorithm;
void main(){
int count = readln().chomp.to!int;
string[] lines;
foreach(i; 0..count){
lines.length++;
lines[i] = readln().chomp;
}
foreach(line; lines){
auto num = line.split.map!(to!int);
int d;
foreach(n1; num... | 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() {
auto s = readln.chomp;
int n = s.length.to!i... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math;
void main()
{
auto N = readln.chomp.to!int;
auto A = readln.chomp.to!int;
writeln(N % 500 <= A ? "Yes" : "No");
} | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto s = readln.chomp;
writeln(s.length/2 - s.count('p'));
}
| D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto S = readln.chomp;
auto T = readln.chomp;
writeln(T[0..S.length] == S ? "Yes" : "No");
} | D |
void main() {
import std.stdio, std.string, std.conv, std.algorithm;
auto s = readln.chomp.to!(char[]);
auto t = readln.chomp.to!(char[]);
int[char] f1, f2;
foreach (c; s) {
if (c in f1)
f1[c]++;
else
f1[c] = 1;
}
foreach (c; t) {
if (c in f2)
f2[c]++;
else
f2[c] ... | 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;
static import std.ascii;
// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] aryread(T = long)(){return r... | D |
/+ dub.sdl:
name "sol_ysp"
dependency "dunkelheit" version="1.0.1"
+/
import std.stdio, std.algorithm, std.range, std.conv;
// import dkh.foundation, dkh.scanner;
int main() {
Scanner sc = new Scanner(stdin);
scope(exit) assert(!sc.hasNext);
string s;
sc.read(s);
s ~= "A";
long ans, ... | 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.string;
string S;
string T;
int compare(int i) {
// -1 : docchimo
// 0 : T < S
// 1 : S < T
if (i >= S.length ... | 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;
static import std.ascii;
// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] aryread(T = long)(){return r... | D |
import std.stdio;
import std.conv;
import std.algorithm;
import std.range;
import std.string;
import std.typecons;
import std.math;
import std.random;
import std.range;
import std.functional;
import std.container;
class bt(T)
{
t!T root;
void insert(T key)
{
t!T y = null;
auto x = root;
... | 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.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;
void main()
{
auto line = readln.chomp;
auto enil = line.dup;
reverse(enil);
writeln(line == enil ? "Yes" : "No");
} | D |
import std.stdio, std.conv, std.string, std.range, std.algorithm, std.range;
void main() {
auto input = readln.split.to!(int[]);
auto K = input[0];
auto X = input[1];
auto m = max(-100_0000, X - (K - 1));
auto M = min(X + (K - 1), 100_0000);
for(int i = m; i <= M; i++) {
write(i, " ");
}
}
| D |
import std.stdio;
import std.conv;
import std.algorithm;
import std.range;
import std.string;
import std.typecons;
import std.math;
import std.random;
import std.range;
import std.functional;
import std.container;
class bt(T)
{
t!T root;
bool containsKey(T key)
{
return root && root.containsKey(key)... | D |
import std.stdio, std.string, std.conv, std.algorithm;
void main()
{
while(1){
auto n = readln.chomp.to!int;
if(n==0) break;
int s=1;
int max=50000001;
for(int i=2;i<n/2;++i){
if(n%i==0){
if(i<max){
s+=(i+n/i);
max = n/i;
if(i==max)
s -= i;
}else break;
... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;
import std.math;
void main() {
auto cnt = new int[](5);
int n;
scan(n);
foreach (i ; 0 .. n) {
string s;
scan(s);
switch (s[0]) {
case 'M':
cnt[0]++;
break;
... | 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;
long calc(int a, int b,... | D |
import std.stdio, std.algorithm, std.array, std.string, std.conv;
void main()
{
int t;
scanf("%d", &t);
foreach(_; 0..t)
{
int str_len;
scanf("%d", &str_len);
getchar();
auto str = readln.strip();
// writeln(str);
uint[] arr = new uint[str_len];
... | 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(){
long n = rea... | D |
void main()
{
long n, a, b;
rdVals(n, a, b);
long result = modPow(2, n) - 1;
long fa = 1, fb = 1;
foreach (i; 0 .. b)
{
if(i < a) fa = fa * (n - i) % mod;
fb = fb * (n - i) % mod;
}
long[] finv = new long[b+1];
long[] inv = new long[b+1];
finv[0] = 1, finv[1] =... | 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.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
void main() {
auto s = readln.chomp.to!(char[]);
long ans;
while (!s.empty) {
if (s.length == 1) break;
if (s.front == s.back) {
s.popFront()... | D |
module bbb;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 s = readln.split.map!(to!int);
auto Ga = s[0];
auto Sa = s[1];
... | D |
void main()
{
long[] tmp = readln.split.to!(long[]);
long n = tmp[0], p = tmp[1];
long[long] lists;
lists[2] = 0;
while (p % 2 == 0)
{
++lists[2];
p /= 2;
}
for (long i = 3; i * i <= p; i += 2)
{
if (p % i == 0)
{
lists[i] = 0;
... | D |
void main() {
auto N = ri;
auto S = rs;
ulong res;
foreach(i; 0..S.length - 2) {
if(S[i..i+3] == "ABC") res++;
}
res.writeln;
}
// ===================================
import std.stdio;
import std.string;
import std.functional;
import std.algorithm;
import std.range;
import std.traits;
import std.math;
import ... | 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;
immutable long INF = 1L << 59;
void main() {
auto N = readln.chomp.to!int;
auto A = readln.split.map!(to!long).array;
auto... | D |
import std.stdio; // ??\????????????????????????
import std.string; // chomp????????????????????????(?????????????????????)
import std.conv; // to????????????????????????
import std.array; // split?????????????????????
import std.algorithm; // map?????????????????????
void main() {
auto input = readln.split.map!(... | 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.container;
void main()
{
foreach (line; stdin.byLine) {
auto x = line.chomp.to!int;
if (!x) break;
int sum;
foreach (i; 0..x/4) {
sum += re... | 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.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.array;
foreach (ref e; s) ... | D |
import std.stdio, std.string, std.range, std.conv, std.array, std.algorithm, std.math, std.typecons;
void main() {
auto N = readln.chomp.to!int;
auto a = readln.split.to!(int[]);
auto y = a.filter!"a%2==0&&a%4".walkLength;
auto z = a.filter!"a%4==0".walkLength;
auto x = N-y-z;
writeln(() {
... | D |
import std.stdio;
import std.algorithm;
import std.math;
import std.conv;
import std.string;
T readNum(T)(){
return readStr.to!T;
}
T[] readNums(T)(){
return readStr.split.to!(T[]);
}
string readStr(){
return readln.chomp;
}
void main(){
auto t = readStr;
auto s = t.replace("?", "D");
writeln(s);
}
| D |
void main() {
int x = readln.chomp.to!int;
writeln(x == 7 || x == 5 || x == 3 ? "YES" : "NO");
}
import std.stdio;
import std.string;
import std.array;
import std.conv;
import std.algorithm;
import std.range;
import std.math;
import std.container;
import std.typecons; | 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() {
while (true) {
int n, a, b;
scan(n,a,b);
if (!n) return;
auto p = iota(n).map!(i => readln.chomp.to!int).array;
s... | D |
void main() {
import std.stdio, std.string, std.conv, std.algorithm;
int n;
rd(n);
auto s = readln.split
.to!(int[])
.reduce!((res, a) => (res + a - 1));
writeln(s - 1);
}
void rd(T...)(ref T x) {
import std.stdio : readln;
import std.string : split;
import std.conv : to;
auto l = readln.s... | D |
import std.stdio, std.conv, std.string, std.array, std.math, std.regex, std.range, std.ascii;
import std.typecons, std.functional;
import std.algorithm, std.container;
void main()
{
int N = scanElem!int;
int M = scanElem!int;
int[] nList;
nList.length = N + 1;
foreach(i;0..M)
{
int s = ... | D |
import std.stdio, std.string, std.conv, std.algorithm, std.range;
void main() {
auto tmp = readln.split.to!(int[]);
auto K = tmp[0], S = tmp[1];
iota(K+1).map!(x => max(0, min(S-x, K) - max(0, S - K - x) + 1)).sum.writeln;
} | D |
void main() {
long[] tmp = readln.split.to!(long[]);
long x = tmp[0], y = tmp[1];
long mod = 10 ^^ 9 + 7;
long ans;
if ((x + y) % 3 == 0) {
long n = (2 * y - x) / 3, m = (2 * x - y) / 3;
if (n >= 0 && m >= 0) {
long l = n+m;
long[] fac = new long[l+1];
... | D |
void main(){
char[] val = inln!char();
writeln( (val[0]=='H')^(val[1]=='H')?'D':'H');
}
import std.stdio, std.conv, std.algorithm, std.numeric, std.string, std.math, std.range;
const long mod = 10^^9+7;
// 1要素のみの入力
T inelm(T= int)(){
return to!(T)( readln().chomp() );
}
// 1行に同一型の複数入力
T[] inln(T = ... | D |
void main(){
import std.stdio, std.string, std.conv, std.algorithm;
// int n=6, m=10;
// auto c=new int[][](n, m);
// auto dir=[[-1, -1], [-1, 0], [-1, 1], [0, 1], [1, 1], [1, 0], [1, -1], [0, -1]];
// foreach(i; 0..n)foreach(j; 0..m){
// c[i][j]^=1;
// foreach(d; dir){
// auto ni=i+d[0], nj=j+... | 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()));
}
auto readInt() ... | 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[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, std.conv, std.algorithm, std.range, std.array, std.string, std.uni;
void main() {
readln.split.map!(a => a.capitalize[0]).array.writeln;
} | D |
import std.stdio, std.array, std.string, std.conv, std.algorithm;
int H, W;
auto dy = [0, 0, 1, -1], dx = [1, -1, 0, 0];
char[][] board;
void main(){
for(;init;){
writeln(solve);
}
}
bool init(){
auto input = map!(to!int)(readln.chomp.split);
H = input[0];
W = input[1];
board = new char[][](H);
foreach(re... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.range;
import std.math;
void main() {
readln;
(readln.split.sort().uniq.array.length == 3 ? "Three" : "Four").writeln;
} | D |
// Vicfred
// https://atcoder.jp/contests/abc165/tasks/abc165_b
// simulation
import std.conv;
import std.stdio;
import std.string;
void main() {
long x = readln.chomp.to!long;
long current = 100;
long answer = 0;
while(current < x) {
current += current/100;
answer += 1;
}
an... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;
void main() {
readln.chomp.count!"a == '1'".writeln;
}
void scan(T...)(ref T args) {
import std.stdio : readln;
import std.algorithm : splitter;
import std.conv : to;
import std.range.primitives;
auto line ... | 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.math, std.regex, std.range, std.ascii, std.algorithm;
void main(){
auto ip = readln.split.to!(int[]), N=ip[0], M=ip[1];
int L = 0;
int R = N;
foreach(i; 0..M){
auto LR = readln.split.to!(int[]);
L = max(L, LR[0]);
R = min(R, LR[1]);
}
if(L<=R) writeln(R-L... | 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 |
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 |
// Vicfred
// https://atcoder.jp/contests/abc155/tasks/abc155_b
// simulation
import std.algorithm;
import std.array;
import std.conv;
import std.stdio;
import std.string;
void main() {
int n = readln.chomp.to!int;
int[] a = readln.split.map!(to!int).array;
foreach(item; a) {
if(item%2 == 0 && ite... | 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;
void scan(T...)(ref T args) {
import std.stdio : readln;
import std.algorithm : splitter;
import std.conv : to;
import std.range.primiti... | 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;
int[char] cnt;
foreach (e; s) {
cnt[e]++;
}
if (s... | 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 = "0" ~ readln.chomp;
auto N = S.length.to!int;
auto dp = new int[][](N+1, 2);
foreach (i; 0..N+1) dp[... | 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.strip.splitter;
immutable int n = s.front.to!int;s.popFront;
immutable int m = s.front.to!int;
int problems, penalty;
int[int] c;
bool[int] d;
for... | 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.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 nk = readln.chomp.split.map!(to!int);
auto num = 1;
foreach (i; 0..nk[0]) {... | 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.algorithm,
std.string,
std.range,
std.stdio,
std.conv;
void main() {
int[char] dic;
foreach (c; readln.chomp) {
if (c !in dic) {
dic[c] = 1;
} else {
dic[c]++;
}
}
writeln(dic.values.all!(n => n % 2 == 0) ? "Yes" : "No");
} | D |
import std.algorithm;
import std.array;
import std.container;
import std.conv;
import std.range;
import std.stdio;
import std.string;
bool solve(int[] p, int t) {
if (p.empty) return t == 0;
if (t == 0) return true;
if (t < 0) return false;
int n = p.front;
p.popFront;
if (solve(p, t-n)) return true;
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;
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;
long calc(int[] xs) {
... | D |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.