code stringlengths 4 1.01M | language stringclasses 2
values |
|---|---|
import std.stdio, std.algorithm, std.array, std.conv, std.string;
bool[3000] leap_table;
void init_leap_table() {
foreach(i, ref x; leap_table) {
if (((i % 4) == 0) && (((i % 100) != 0) || ((i % 400) == 0))) x = true;
}
}
void main() {
init_leap_table;
bool first = true;
while(true) {
int[] date =... | D |
void main() {
auto N = rs;
auto K = ri;
while(N.length < 100) N = '0' ~ N;
auto S = '0'.repeat(100).array;
ulong res;
foreach(i; 0..100) {
for(S[i] = '1'; S[i] <= '9'; S[i]++) {
if(K == 1 && S <= N) res++;
foreach(j; 0..i) {
for(S[j] = '1'; S[j] <= '9'; S[j]++) {
if(K == 2 && S <= N) res++;
... | 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;
auto B = new long[](N+1);
foreach (i;... | D |
void main()
{
long n = rdElem;
if (n == 1)
{
0.writeln;
return;
}
long[long] cnt;
for (long i = 2; i * i <= n; ++i)
{
while (!(n % i))
{
++cnt[i];
n /= i;
}
}
if (n > 1) ++cnt[n];
long m = cnt.byValue.reduce!max;
... | D |
import std.stdio, std.conv, std.string;
void main() {
(readln.chomp.to!int < 1200 ? "ABC" : "ARC").writeln;
} | 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 w = sread();
// writeln(w);
long[char] ary;
foreach... | 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 |
/+ dub.sdl:
name "A"
dependency "dunkelheit" version=">=0.9.0"
+/
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);
int n = s.length.to!int;
... | D |
import std.stdio, std.conv, std.string, std.algorithm, std.math, std.array, std.container;
int n;
void solve(int max_i, string prefix) {
if(prefix.length == n) {
writeln(prefix);
return;
}
for(int i=0; i<max_i+1; i++) solve(max(i+1, max_i), prefix~('a'+i).to!char);
}
void main() {
n = readln.chomp.to... | D |
import std.stdio;
import std.string;
import std.algorithm;
import std.conv;
void main() {
auto N = readln.chomp.to!int;
auto A = readln.split.to!(int[]);
auto q = readln.chomp.to!int;
auto m = readln.split.to!(int[]);
bool solve(int i, int j) {
if(j < 0) return false;
if(j == 0) return true;
if(i == N) retu... | 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, std.bitmanip;
void main() {
auto N = readln.chomp.to!int;
auto A = readln.split.map!(to!long).array;
auto B = new long[](N+1);
... | 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 |
module aoj;
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
int main(){
int[] array = new int[10];
for(int i = 0; i < 10; i++) {
array[i] = to!int(chomp(readln()));
}
sort!((int e1, int e2){ return e1 > e2; })(array);
for(int i = 0; i < 3; i++) {
writeln(array[i]);
}
return... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(... | D |
import std.stdio, std.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;
import std.container;
alias sread = () => readln.chomp();
alias Point... | 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;
void main(){
auto cin = new Cin();
auto S = cin.rect!(char[],"")()[0];
//writeln(S);
char[] c;
foreach( s ; S ){
switch( s ){
case "0":
c ~= "0";
break;
case "1":
c ~= "1";
break;
case "B":
c.length = 0<c.length ? c.length-1 : 0 ;
break;
default:break;
}
... | 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 G = new int[][](N);
foreach (i; 0..N-1) {
auto s = rea... | 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.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.numeric;
void main()
{
auto n = readln.chomp.to!int;
auto h = readln.chomp.split.to!(i... | D |
import std.stdio;
import std.string;
import std.array;
import std.range;
import std.algorithm;
import std.conv;
import std.typecons;
long byTwoCount(long a){
long result = 0;
while(a % 2 == 0){
result++;
a /= 2;
}
return result;
}
long solve(long[] as){
return as.map!(byTwoCount).s... | D |
import std.conv, std.stdio;
import std.algorithm, std.array, std.string, std.range;
void main()
{
auto
buf = readln.chomp.split.to!(int[]),
n = buf[0], x = buf[1] - 1, y = buf[2] - 1,
d = new int[][](n, n);
foreach (i; 0..n)
foreach (j; i..n)
d[i][j] = j - i;
int... | D |
import std.stdio, std.string, std.conv, std.bigint, std.typecons, std.algorithm, std.array, std.math, std.range, std.functional;
void main() {
readln.split.to!(long[]).pipe!(tmp => max(tmp[0] - tmp[1], 0)).writeln;
} | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.array;
import std.range;
void main(){
auto A=readln.split.to!(int[]),a=A[0],b=A[1],c=A[2];
if(a+b>=c)writeln("Yes");
else writeln("No");
} | D |
void main(){
long x, a, b;
scanf("%ld %ld %ld", &x, &a, &b);
if(abs(x-a)>abs(x-b))writeln("B");
else writeln("A");
}
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() );
}
... | 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 |
void main() {
auto s = rs;
auto p = rs;
writeln((s ~ s).canFind(p) ? "Yes" : "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.bigint;
import std.nu... | 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!(char[]);
foreach (i, c; S) {
if (i%2 == 0) {
if (c == 'L') {
writeln("No");
return;
}
} else {
... | D |
void main(){
int k,a,b;
k = _scan();
scanf("%d %d", &a, &b);
if( a<= b/k*k ) writeln("OK");
else writeln("NG");
}
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;
f... | 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 |
/* 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.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto hw = readln.split.to!(int[]);
auto H = hw[0];
auto W = hw[1];
char[][] P;
P.length = H;
foreach (i; 0..H) P[i] = readln.chomp.to!(char[]);
foreach (i; 0..H) {
f... | 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.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons;
int[51][51] GF;
int[51] NS;
void main()
{
auto nm = readln.split.to!(int[]);
auto N = nm[0];
auto M = nm[1];
foreach (i; 1..M+1) {
auto ab = readln.split.to!(int[]);
auto A = ab[0];
auto ... | D |
import std.stdio, std.algorithm, std.string, std.conv, std.array, std.range, std.math;
int[] readints() { return readln.split.to!(int[]); }
void main() {
auto a = readints();
auto q = new Queue!(int[]);
q.push(a ~ 0);
int ans = 0;
while (1) {
auto t = q.front();
if (t[0] == t[1] &... | D |
import std.stdio,std.string,std.conv;
int main()
{
string s;
while((s = readln.chomp).length != 0)
{
auto _s = s.split(" ");
int a = _s[0].to!int;
int b = _s[1].to!int;
int c = _s[2].to!int;
int n = a * 10000 + b * 100 + c;
if(n < 18680908)
{
writeln("pre-meiji");
}
else if(18680908 <= n && n ... | D |
import std.stdio;
import std.algorithm;
import std.range;
import std.array;
import std.string;
void main(){
auto num_str = readln.chop;
auto check_tri = (string target){
return target[0] == target[1] && target[1] == target[2];
};
auto answer = check_tri(num_str[0..3]) || check_tri(num_str[1..4]) ? "Yes" : "No";
... | 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 |
void main() {
auto A = ri, B = ri, C = ri, D = ri, E = ri;
auto arr = [A, B, C, D, E];
int res = int.max;
do {
int tmp;
foreach(i, v; arr) {
if(i == 4) tmp += v;
else tmp = (tmp + v + 9) / 10 * 10;
}
res = min(res, tmp);
} while(nextPermutation(arr));
res.writeln;
}
// =====... | 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.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto n = readln.chomp.to!size_t;
auto a = readln.split.to!(int[]);
auto c = new int[](9);
foreach (ai; a) ++c[min(8, ai/400)];
auto r = c[0..8].count!"a>0";
if (r == 0)
writeln(1, " ", c[8]);
else
writeln(r, " ", r ... | D |
void main()
{
string s = readln.chomp;
writeln(s[0..4], " ", s[4..$]);
}
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 std.stdio;
import std.range;
import std.string;
import std.algorithm;
import std.conv;
void main() {
writeln(readln.find("A").retro.find("Z").source.length);
} | 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 ps = readln.split.to!(int[]);
int d;
foreach (i, p; ps) {
if (i.to!int+1 != p) ++d;
}
writeln(d <= 2 ? "YES" : "NO");
} | 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;
void main(){
string list = "abcdefghijklmnopqrstuvwxyz.?! ";
while(true){
string s = readln();
if(stdin.eof()) break;... | 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;
/*
A = 1, B = 2, C = 100, D = 100みたいなケースもある
*/
void main() {
int t;
scan(t);
while (t--) {
long ai, bi, ci, di;
scan(ai, bi, ci, di);
... | D |
import std.stdio, std.string, std.conv, std.algorithm;
void main()
{
foreach(_; 0..readln.chomp.to!int)
{
readln;
int up, down;
auto inp=readln.split.map!(to!int);
for(int i; i < inp.length-1; ++i)
{
up=max(inp[i+1]-inp[i],up);
down=min(inp[i+1]-... | D |
import std.stdio;
import std.conv;
import std.string;
void main() {
int R, G;
R = readln().chomp().to!(int);
G = readln().chomp().to!(int);
writeln(R+(G-R)*2);
}
| D |
import std.stdio, std.string, std.conv, std.range, std.algorithm;
void main() {
auto abc = readln.chomp.split.map!(to!int);
if (count(abc, 5) == 2 && count(abc, 7) == 1) {
"YES".writeln;
} else {
"NO".writeln;
}
}
| D |
// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=(... | D |
import std.stdio, std.string, std.conv, std.range, std.algorithm;
void main() {
iota(2, readln.chomp.to!long+1).reduce!"a*b".writeln;
} | 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;
immutable mod = 10^^9 + 7;
void main() {
int n;
auto s = new string[](2);
scan(n);
iota(2).each!(i => s[i] ... | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto n = readln.chomp.to!int;
auto k = readln.chomp.to!int;
auto x = readln.chomp.to!int;
auto y = readln.chomp.to!int;
if (n < k)
writeln(x * n);
else
writeln(x * k + y * (n - k));
}
| 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 n... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_r... | D |
import 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;
/// return [P の数, 長さ]
l... | D |
/+ dub.sdl:
name "A"
dependency "dcomp" version=">=0.6.0"
+/
import std.stdio, std.algorithm, std.range, std.conv;
import std.typecons;
import std.bigint;
// import dcomp.foundation, dcomp.scanner;
// import dcomp.container.deque;
int main() {
auto sc = new Scanner(stdin);
int n, m, k;
sc.read(... | D |
import std.stdio;
int main(){
for(int i=1;i<10;i++)for(int j=1;j<10;j++)printf("%dx%d=%d\n",i,j,i*j);
return 0;
} | 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 N = readln.chomp.to!int;
if (N == 3) {
writeln("2 5 63");
return;
}
int[] ths;
foreach (i; 1..30001) {
if (i%2 != 0 && i%3 == ... | 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() {
string s, t;
scan(s);
scan(t);
iota(3).m... | 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.string, std.conv;
long [100] L;
long foo(int n) {
if(L[n]==0) {
L[n]= foo(n-1) + foo(n-2);
}
return L[n];
}
void main() {
int N = readln().chomp().to!(int);
L[0]=2;L[1]=1;
writeln(foo(N));
} | D |
ulong[] A;
ulong cost(ulong i, ulong j) {
switch(j) {
case 0, 4: // never visit there
return A[i];
case 1, 3: // even(x > 0)
return A[i] == 0 ? 2 : A[i] % 2;
case 2: // odd
return (A[i] + 1) % 2;
default: return 0;
}
}
// dp[i][j]
// i: point
// j: current mode(details on editorial)
// allowed to ... | 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;
import std.datetime, std.bigint;
int n, m;
char[][] flag;
void main() {
scan(n, m);
if (n % 3 && m % 3) {
w... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
void main() {
int n = readln.chomp.to!int;
int price = 0;
int[][] apList;
for (int i = 0; i < n; i++) {
auto ap = readln.chomp.split.map!(to!int);
int a = ap[0];
int p = ap[1];
apList ~= [a, p];
... | D |
void main(){
import std.stdio, std.string, std.conv, std.algorithm;
long n, m; rd(n); rd(m);
auto k=2L, p=1L;
while(k<=m) k*=2, p++;
if(p<=n){writeln(m); return;}
auto npow2=1L;
while(n--) npow2*=2;
writeln(m%npow2);
}
void rd(T...)(ref T x){
import std.stdio, std.string, std.conv;
auto l=readln.... | 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.range;
import std.array;
import std.string;
import std.conv;
import std.typecons;
import std.algorithm;
import std.container;
import std.typecons;
import std.random;
import std.csv;
import std.regex;
import std.math;
import core.time;
import std.ascii;
import std.digest.sha;
import std.outb... | 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 M = s[1];
auto S = readln.chomp;
aut... | 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.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 |
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;
alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", ... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
bool[100000] prime;
void initPrime() {
prime[0] = false;
prime[1] = false;
for (int i = 3; i < 100000; i++) {
for (int j = 2; j * j <= i; j++) {
if (i % j == 0) {
prime[i] = false;
... | 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 |
void main()
{
long n, k;
rdVals(n, k);
long[] a = rdRow;
Edge[long] list;
long pos;
long l;
long rem = k;
if (k <= n)
{
foreach (i; 0 .. k)
{
pos = a[pos] - 1;
}
}
else
{
foreach (i; 0 .. k)
{
if (pos in l... | 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()
{
int x;
for (auto i = 1; ; ++i) {
x = readln.chomp.to!int;
if (x == 0) break;
writeln("Case ", i,... | D |
import std.stdio;
import std.ascii;
import std.conv;
import std.string;
import std.algorithm;
import std.range;
import std.functional;
import std.math;
import core.bitop;
void main()
{
auto s = readln.chomp;
auto abc = "ABC";
auto mod = 10 ^^ 9 + 7;
long[][4] dp;
foreach (ref row; dp)
row ... | D |
import std.stdio;
import std.array;
import std.conv;
import std.algorithm;
struct gom{
int x = -1;
int depth=-1;
this(int a,int b){
x = a;
depth = b;
}
}
gom[][5000] kugi;
void main(){
string[] fi = readln().split();
int n = to!int(fi[0]);
int m = to!int(fi[1]);
for(int i = 0;i < m;++i){
string[] inpu... | 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.to!(int[]); }
bool calc(long[] as, long[] bs) {
auto asum = as.sum;
auto bs... | 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;
immutable mod = 10^^9 + 7;
immutable inf = 10^^9 + 7;
void main() {
int n;
int[] a;
scan(n);
a = readln.spli... | D |
import std.stdio, std.conv, std.string, std.math, std.regex, std.range, std.ascii, std.algorithm;
void main(){
auto N = readln.chomp.to!int;
if(N <= 999) writeln("ABC");
else writeln("ABD");
} | D |
import std.stdio;
void main() {
auto s = readln;
auto r = (s[0] == s[1] && s[0] == s[2]) ? "No" : "Yes";
writeln(r);
}
| D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
long P = 10^^9 + 7;
void main()
{
auto nk = readln.split.to!(int[]);
auto N = nk[0];
auto K = nk[1];
auto as = readln.split.to!(int[]);
long[][] DP;
DP.length = N;
foreach_reverse (i, r... | D |
// Vicfred
// https://atcoder.jp/contests/abc045/tasks/abc045_b
import std.array;
import std.stdio;
import std.string;
import std.range.primitives;
void main() {
string a = readln.strip;
string b = readln.strip;
string c = readln.strip;
char[] A;
foreach(ch; a)
A ~= ch;
char[] B;
... | D |
import std.stdio;
import std.string;
import std.conv;
void main() {
int[] buf = readln.chomp.split.to!(int[]);
int a = buf[0], p = buf[1];
writeln((a * 3 + p) / 2);
}
| D |
import std.stdio;
import std.array;
import std.conv;
import std.algorithm;
import std.math;
void main() {
string s;
while( (s=readln()).length != 0 ){
string[] input = split(s);
int a = to!int(input[0]);
int x= 0;
for(int i=0;i<10;i++){
if(a%2==1){
if(x!=0) write(" ");
write(pow(2,i));
x++;
... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;
enum inf3 = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;
void main() {
int n; string s;
scan(n);
scan(s);
aut... | D |
import std.stdio;
import std.string;
void main()
{
string input;
int count = 0;
for (int i = 1; ; i++) {
input = chomp(readln());
if (input == "0") break;
writeln("Case ", i, ": ", input);
}
} | D |
import std.stdio;
import std.string;
import std.algorithm;
import std.range;
import std.conv;
import std.math;
void main() {
int n;
scanf("%d\n", &n);
auto arr = readln.split.to!(int[]);
int max = int.min;
int min = int.max;
foreach(x; arr) {
max = x > max ? x : max;
min = x < min ? x : min;
}
writeln(max-... | D |
import std.stdio;
import std.string;
import std.conv;
import std.array;
void main()
{
ulong N = readln.split[0].to!ulong;
string S = readln.chomp;
S = "." ~ S ~ "#";
int switch_i = 0;
while (S[switch_i] == '.') switch_i++;
int cnt = 0;
foreach (i; switch_i..(N + 2)) if (S[i] == '.') cnt++... | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
import std.math;
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 ... | 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(); }
void log()(){ writeln(""); } void log(T, A ...)(T t, lazy A a){ if(DE... | 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;
long MOD = 10^^9 + 7;
void main() {
auto N = readln.chomp;
auto K = readln.chomp.to!int;
auto dp = new int[](1001);
dp[1] =... | D |
void main() {
import std.stdio, std.string, std.conv, std.algorithm;
int n;
rd(n);
auto a = readln.split.to!(int[]);
if (reduce!"a+b"(a) > 0) {
writeln("HARD");
} else {
writeln("EASY");
}
}
void rd(T...)(ref T x) {
import std.stdio, std.string, std.conv;
auto l = readln.split;
assert(l.... | D |
import std.algorithm;
import std.array;
import std.bigint;
import std.bitmanip;
import std.conv;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
// 差の絶対値
@nogc @safe pure T diff(T)(const ref T a, const ref T b) { return a > b ? a - b : b - a; }
// 切り上げ除算
@nogc @safe pur... | D |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.