code stringlengths 4 1.01M | language stringclasses 2
values |
|---|---|
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 s = sread();
auto t = sread();
// writeln(s);
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 d = readln.chomp.split.to!(int[]);
int res;
foreach (_; 0..2) {
if (d[0]... | D |
import std.stdio;
import std.conv;
import std.string;
import std.algorithm;
void main()
{
string s;
while( (s=readln.strip) != "0 0") {
auto n = map!(to!int)(s.strip.split);
for(int i=0;i<n[0];i++) {
for(int j=0;j<n[1];j++) {
write("#");
}
wri... | D |
import std.stdio, std.conv, std.string, std.array, std.math, std.regex, std.range, std.ascii, std.numeric, std.random;
import std.typecons, std.functional, std.traits,std.concurrency;
import std.algorithm, std.container;
import core.bitop, core.time, core.memory;
import std.bitmanip;
import std.regex;
enum INF = long.... | 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;
import std.numeric;
void main()
{
auto ab = readln.split.to!(long[]);
(ab[0] - ab[1] + 1).writeln;
}
| 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(s.canFind('7'));
}
void scan(T..... | 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 = 1<<30;
void main() {
int n, k;
scan(n);
scan(k);
int ans = inf;
void dfs(int i, int val) {
if (i == n) {
ans = min(ans, val);... | 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.string;
import std.array;
import std.range;
import std.random;
import std.algorithm;
import std.conv;
void main(){
auto input = readln().chomp();
solve(input).writeln();
}
int solve(string input){
auto result = 0;
foreach(s; input){
if(s == '+'){
result... | D |
import std;
auto input()
{
return readln().chomp();
}
alias sread = () => readln.chomp();
alias aryread(T = long) = () => readln.split.to!(T[]);
void main()
{
long a, b;
scan(a, b);
foreach (i; 0 .. 1001)
{
if (((i * 8) / 100 == a) && ((i * 10) / 100 == b))
{
writeln(... | 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;
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
void main(){
int a = read.to!int;
int ... | D |
import std.stdio;
import std.math;
import std.algorithm;
import std.conv;
long bisect(T)(T[] arr, T p) {
long u, t = arr.length-1;
long i = (u + t) / 2;
while(i != 0 && i != arr.length - 1 && (arr[i] > p || arr[i+1] <= p)) {
if (arr[i] > p) {
t = i;
}
else {
if (u == i)
u = i + 1;
else
u = i;... | D |
import std.stdio,std.string,std.conv,std.array;
void main(){
for(;;){
auto rcs = readln().chomp().split();
auto n = to!int(rcs[0]);
auto x = to!int(rcs[1]);
if( n==0 && x==0 ){ break; }
int hit=0;
for( int a=1;a <= n-2; a++ ){
for( int b=a+1;b <= n-1; b++ ){
for( int c=b+1;c <= n; c++ ){
if(... | D |
import std.stdio, std.conv, std.array, std.string;
import std.algorithm;
void main() {
string s = readln.chomp;
string prev;
uint count = 0;
auto n = s.length;
for(uint i=0; i<n; i++) {
if (s[i..i+1] == prev) {
if (i+1 == n) break;
prev = s[i..i+2];
count++;
i++;
continue;
... | 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, std.conv, std.array, std.string;
import std.algorithm.iteration, std.algorithm.mutation, std.algorithm.searching, std.algorithm.sorting;
void main()
{
int N = readln().strip.to!int;
if(N==1)
{
writeln("Hello World");
}else{
auto r = readln().strip.to!int +
read... | D |
import std.stdio;
import std.string, std.conv, std.array, std.algorithm;
import std.uni, std.math, std.container;
import core.bitop, std.datetime;
void main(){
auto N = readln.chomp.to!int;
int ans = N * (N + 1) / 2;
ans.writeln;
} | 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; }
void main(){
auto n = read.... | D |
import std.stdio, std.string, std.conv, std.bigint, std.typecons, std.algorithm, std.array, std.math, std.range, std.functional;
void main() {
auto tmp = readln.split.to!(int[]);
writeln(max(0, min(tmp[3], tmp[1]) - max(tmp[2], tmp[0])));
} | 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.string, std.array, std.conv, std.algorithm;
long solve(long n, long m)
{
if (2*n > m)
return m / 2;
auto ret = n;
m -= n*2;
ret += m/4;
return ret;
}
void main()
{
auto nm = readln.split.to!(long[]);
writeln(solve(nm[0], nm[1]));
} | D |
import std.conv;
import std.stdio;
import std.string;
void main()
{
auto r = readln.strip.to!int;
writeln( solve( r ) );
}
auto solve( in int r )
{
if( r < 1200 ) return "ABC";
if( r < 2800 ) return "ARC";
return "AGC";
}
| 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;
void main(){
auto cin = new Cin();
auto S = cin.line!string()[0];
bool succeed = false;
foreach( i ; 0..S.length-1 ){
if( S[i]==S[i+1] ){
writeln( i+1," ",i+2 );
return;
}
}
foreach( i ; 0..S.length-2 ){
if( S[i]==S[i+2] ){
writeln( i+1," ",i+3 );
return;
}
}
write... | D |
import std.stdio,std.conv,std.string,std.algorithm,std.array,std.math;
void main(){
auto s=readln().chomp().split().map!(to!int);
int a,b,c,d;
a=s[0];
b=s[1];
c=s[2];
d=s[3];
if(abs(c-a)<=d)
writeln("Yes");
else if(abs(b-a)<=d && abs(c-b)<=d)
writeln("Yes");
else
writeln("No");
} | 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()
{
auto n = readln.chomp.to!int;
foreach (i; 0..n) {
auto as = readln.split.map!(to!int);
int l ,r;
b... | 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.split;
writeln(s[1] ~ s[0]);
}
| D |
void main()
{
string s = rdStr;
long n = s.length;
bool ok = true;
foreach (i; 0 .. n/2)
{
if (s[i] != s[n-i-1]) ok = false;
}
long m = (n - 1) / 2;
foreach (i; 0 .. m)
{
if (s[i] != s[m-i-1]) ok = false;
if (s[m+i+1] != s[n-i-1]) ok = false;
}
writ... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.math;
import std.regex;
import std.range;
import core.exception;
void main() {
auto N = readln.chomp.to!int;
auto a = new int[](N);
foreach(i; 0..N) {
a[i] = readln.chomp.to!int;
}
bool[int] b;
foreach(i; 0..N+1) b[i] = fals... | D |
import std.stdio, std.conv, std.string, std.math;
void main(){
((a, b, h) => (a + b) * h / 2)(r, r, r).writeln;
}
int r() { return readln.chomp.to!int; } | 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;
immutable long MOD = 998244353;
void main() {
auto s = readln.split.map!(to!long);
auto N = s[0].to!int;
auto A ... | 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.array, std.math, std.regex, std.range, std.ascii, std.numeric, std.random;
import std.typecons, std.functional, std.traits,std.concurrency;
import std.algorithm, std.container;
import core.bitop, core.time, core.memory;
import std.bitmanip;
import std.regex;
enum INF = long.... | 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 N = readln.chomp.to!int;
int[] AS, cs;
foreach (_; 0..N) AS ~= readln.chomp.to!int;
foreach (a; AS) {
if (cs.empty || cs[$-1] >= a) {
cs ~= a;
} else if ... | 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 S = readln.chomp.to!(char[]);
auto DP = new long[][](S.length, 13);
foreach (i, c; S) {
foreach (n; 0..10) {
if (c == '?' || n == c-'0') {
... | D |
import std.stdio;
import std.string;
import std.conv;
void main() {
auto n = to!int(readln.chomp());
auto a = to!int(readln.chomp());
writeln((n % 500) <= a ? "Yes" : "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;
alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", ... | D |
import std.stdio;
import std.string;
import std.array;
import std.algorithm;
import std.conv;
import std.range;
import std.functional;
import std.bigint;
import std.typecons;
void main(string[] args) {
readln;
string s = readln.chomp;
enum Transit {
StoS,
StoW,
WtoS,
WtoW,... | 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;
int[27] ss, ts;
foreach (i; 0..S.length) {
int s = S[i] - 'a' + 1;
int t = T[i] - 'a' + 1;
if (ts[s] == 0 || ts[s] =... | D |
import std.stdio, std.range, std.conv, std.string, std.array, std.functional;
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()
{
string S;
// scanf("%s", &S);
... | D |
import core.bitop, std.bitmanip;
import core.checkedint;
import std.algorithm, std.functional;
import std.array, std.container;
import std.bigint;
import std.conv;
import std.math, std.numeric;
import std.range, std.range.interfaces;
import std.stdio, std.string;
import std.typecons;
void main()
{
auto s = readln.... | 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.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto N = readln.chomp.to!int;
int[] r;
int n;
foreach (int i; 1..5000) {
n += i;
r ~= i;
if (n >= N) break;
}
if (n > N) {
r[n-N-1] = 0;
}
... | D |
import std.stdio, std.string, std.conv, std.bigint, std.typecons, std.algorithm, std.array, std.math, std.range, std.functional;
void main() {
auto N = readln.chomp;
writeln(N.retro.retro.array == N.retro.array ? "Yes" : "No");
} | D |
void main()
{
int[] tmp = readln.split.to!(int[]);
int n = tmp[0], k = tmp[1];
writeln(k == 1 ? 0 : n - k);
}
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;
impo... | D |
import std.stdio, std.string, std.conv;
void main()
{
while(true)
{
int n=readln.chomp.to!int;
if(n==0) break;
if(n==1)
{
"deficient number".writeln;
continue;
}
int s=1;
for(int i=2; i*i <= n; ++i)
{
if(n/i*i==n... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;
void main() {
int n, k;
scan(n, k);
auto dp = new long[](2*n + 1);
foreach (b ; 1 .. n + 1) {
if (b <= k) continue;
for (int r = b; r <= 2*n; r += b) {
dp[r - (b - k)]++;
dp[r]... | D |
void main(){
int[] ab = _scanln();
(ab[0]*ab[1]&1)?writeln("Odd"):writeln("Even");
}
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... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.container;
import std.array;
import std.math;
import std.range;
import std.typecons;
import std.ascii;
void main()
{
int n = readln.chomp.to!int;
int l = int.max;
int r = int.min;
foreach (v; readln.chomp.split.map!(to!int))... | 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 |
/+ dub.sdl:
name "B"
dependency "dcomp" version=">=0.6.0"
+/
import std.stdio, std.algorithm, std.range, std.conv;
// import dcomp.scanner;
// import dcomp.graph.dijkstra;
struct State {
int tm;
int col;
int opCmp(State r) {
if (tm < r.tm) return -1;
if (tm > r.tm) return 1;
... | 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;
// 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;
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 kt = readln.chomp.split.map!(to!int);
auto a = readln.chomp.split.map!(to!int).... | 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.algorithm, std.array, std.container, std.range, std.bitmanip;
import std.numeric, std.math, std.bigint, std.random, core.bitop;
import std.string, std.conv, std.stdio, std.typecons;
void main()
{
auto s = readln.chomp.to!int;
writeln(s / (60 * 60), ":", s % (60 * 60) / 60, ":", s % 60);
} | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto A = readln.chomp.to!(char[]);
long N = A.length;
long[char] CNT;
foreach (a; A) {
if (a !in CNT) CNT[a] = 0;
++CNT[a];
}
long r = N * (N-1) / 2 + 1;
for... | 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, std.conv, std.range, std.stdio, std.string;
import std.math;
void main()
{
auto n = readln.chomp.to!size_t;
auto r = 0;
loop: foreach (_; 0..n) {
auto a = readln.chomp.to!int;
if (a == 2) {
++r;
continue;
}
if (a % 2 == 0)
continue;
foreach (i; iota(... | D |
void main() {
int[] tmp = readln.split.to!(int[]);
int n = tmp[0], m = tmp[1], c = tmp[2];
int[] b = readln.split.to!(int[]);
int cnt;
foreach (i; 0 .. n) {
int[] a = readln.split.to!(int[]);
int src = c;
foreach (j; 0 .. m) {
src += a[j] * b[j];
}
... | D |
import core.stdc.stdio;
import std.algorithm;
import std.math;
import std.conv;
void main(){
int n,a,b;
scanf("%d%d%d",&n,&a,&b);
int[] cs = new int[n];
int kc;
scanf("%d",&kc);
for(int i=0;i<n;i++){
scanf("%d",&cs[i]);
}
cs.sort!"a>b";
double ans = kc.to!double/a;
int csum = kc;
for(int i=0;i<n;i++){
... | 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,std.string,std.conv;
void main(){
int sum;
while( 1 ){
auto rd = readln().chomp();
if( !rd ){ break; }
sum=0;
int d = to!int(rd);
for( int i=d; i<600; i+=d ){
sum += i*i*d;
}
writeln(sum);
}
} | D |
import std.stdio, std.conv, std.string, std.array, std.math, std.regex, std.range, std.ascii, std.numeric, std.random;
import std.typecons, std.functional, std.traits,std.concurrency;
import std.algorithm, std.container;
import core.bitop, core.time, core.memory;
import std.bitmanip;
import std.regex;
enum INF = long.... | 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 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.string, std.conv;
import std.algorithm, std.array;
import std.math;
auto solve(string s_)
{
auto NA = s_.split.map!(to!int)();
immutable N=NA[0], A=NA[1];
immutable xs=readln.split.map!(to!int).array();
immutable M=N*A+1;
auto dp = new long[][](N+1,M); dp[0][0]=1;
foreach... | 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 rgb = readln.chomp.split.map!(to!int);
writeln((rgb[0]*100+rgb[1]*10+rgb[2])%4... | 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.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() {
auto N = readln.chomp.map!(i => (i - '0'... | 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 calc(int[] ds, int[] ts) {
int[int] map;
... | D |
import std.stdio, std.conv, std.string, std.algorithm;
void main()
{
auto s = readln.strip;
writeln(700 + s.count('o') * 100);
}
| D |
import std.stdio;
import std.regex;
void main(){
auto io = new IO();
auto w = io.line!string()[0];
foreach( a ; alphaB ){
if( w.count(a) % 2 != 0 ){
writeln( "No" );
return;
}
}
writeln("Yes");
return;
}
import std.stdio,std.conv,std.string;
import std.algorithm,std.array,std.math;
immutable PR... | 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 string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_r... | D |
void main()
{
string n = readln.chomp;
long total;
foreach (x; n)
{
total += x - '0';
}
max(total, (n[0] - '1') + 9 * (n.length - 1)).writeln;
}
import std.stdio;
import std.string;
import std.array;
import std.conv;
import std.algorithm;
import std.range;
import std.math;
import ... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto S = readln.chomp;
int a, b;
foreach (i, c; S) {
if ((i%2 == 0 && c == '1') || (i%2 == 1 && c == '0')) ++a;
if ((i%2 == 0 && c == '0') || (i%2 == 1 && c == '1')) ++b;
... | 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, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
long P = 10^^9 + 7;
int[2*10^^5+1] CS;
long[2*10^^5+1] MEMO;
void main()
{
auto N = readln.chomp.to!int;
foreach (i; 0..N) {
CS[i] = readln.chomp.to!int;
}
int[2*10^^5+1] acc, right;
fo... | 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 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();
alias Point... | D |
import std.stdio;
import std.array;
import std.string;
import std.conv;
int main()
{
import std.stdio;
auto input = split(chomp(readln()));
int a = to!int(input[0]);
int b = to!int(input[1]);
if (a <= b)
writeln(a);
else
writeln(a - 1);
return 0;
} | D |
void main() {
problem();
}
void problem() {
auto A = scan!int;
auto B = scan!int;
auto C = scan!int;
auto K = scan!int;
int solve() {
int answer;
if (K <= A) return K;
if (K <= A+B) return A;
auto nokori = K - A - B;
return A - nokori;
}
solve().writeln;
}
// ------------------... | 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()
{
auto N = scanElem;
foreach(i;0..N)
{
if(scanElem%2==1){
writeln("first");
return;
}
... | D |
import std.stdio, std.string, std.conv;
import std.typecons;
import std.algorithm, std.array, std.range, std.container;
import std.math;
void main() {
auto N = readln.split[0].to!long;
auto A = readln.split[0].to!long;
auto B = readln.split[0].to!long;
auto C = readln.split[0].to!long;
auto D = readln.split[0].t... | D |
import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
std.typecons, std.container, std.format;
// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.c... | D |
module app;
import core.bitop;
import std.algorithm;
import std.array;
import std.bigint;
import std.conv;
import std.stdio;
import std.string;
struct Input
{
int n;
string s, t;
}
void parseInput(T)(out Input input, T file)
{
with (file) with (input)
{
n = readln().strip().to!int;
auto array = readln().str... | 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 s = readln.split.map!(to!int);
auto n = s[0];
auto q = s[1];
auto st = new SegmentTree!(int... | 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.conv, std.string, std.math, std.regex, std.range, std.ascii, std.algorithm;
void main(){
auto ip = readln.split.to!(int[]), A=ip[0], B=ip[1];
if(A<6) writeln(0);
else if(A<13) writeln(B/2);
else writeln(B);
} | D |
void main() {
string[] s = readln.split;
writeln(s[0][0], s[1][0], s[2][0]);
}
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 std.uni; | 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.string, std.conv;
import std.range, std.algorithm, std.array;
void main() {
int a, b;
scan(a, b);
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a < b) {
writeln("Bob");
}
else if (a > b ) {
writeln("Alice");
}
else {
writeln("Draw");
... | D |
import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
std.typecons, std.container, std.format;
// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.c... | D |
import core.bitop;
import std.algorithm;
import std.array;
import std.ascii;
import std.container;
import std.conv;
import std.format;
import std.math;
import std.random;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
int generate()
{
Mt19937 gen;
string str = __DATE__ ~ __TIME__;
ui... | D |
import std.string;
import std.stdio;
import std.algorithm;
import std.conv;
import std.typecons;
void main() {
long[Tuple!(immutable(char), size_t)] dp;
long[char] checks;
auto s = readln.chomp;
auto t = readln.chomp;
foreach(c; s) {
checks[c] = 0;
}
bool check = true;
foreach(c; t) {
if (c !in checks) {
... | 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;
import std.typecons;
T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readint = read!int;
alias readints = reads!int;
void main() {
auto ... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math;
bool solve(int s, int g, int[] ns) {
auto N = ns.length;
auto DP = new bool[][](N+1, 8000*2+1);
void sv(int i, int n) {
if (!DP[i][n]) {
DP[i][n] = true;
if (i == N) return;
sv(i+1, n+ns[... | D |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.