code stringlengths 4 1.01M | language stringclasses 2
values |
|---|---|
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.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.string;
void main ()
{
auto tests = readln.strip.to !(int);
foreach (test; 0..tests)
{
auto n = readln.strip.to !(int);
auto a = readln.splitter.map !(to !(int)).array;
auto x = readln.strip.to !(int);
auto f = new int [4... | D |
//prewritten code: https://github.com/antma/algo
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.traits;
final class InputReader {
private:
ubyte[] p, buffer;
bool eof;
bool rawRead () {
if (eof) {
return fals... | D |
/+ 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) sc.read!true;
string s;
sc.read(s);
string err = "aeiou13579";
int an... | 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 |
void solve(string[] s){
foreach(elm; s){
writeln(elm);
writeln(elm);
}
}
void main(){
int[] hw = inln();
string[] s;
foreach(_; 0..hw[0])s ~= readln().chomp();
solve(s);
}
import std.stdio, std.conv, std.algorithm, std.numeric, std.string, std.math, std.range;
const long mod = 10^^9+7;
// 1要素のみの入力... | D |
import std.stdio,std.conv,std.string,std.algorithm;
void main(){
for( int i;;++i ){
auto arg = readln().chomp().split;
auto a = arg[0].to!int , b = arg[1].to!int;
if( !a && !b ) break;
if( a<b ){
writeln( a," ",b );
}else{
writeln( b," ",a );
}
}
} | D |
void main(){
int r = _scan();
( r^^2 ).writeln();
}
import std.stdio, std.conv, std.algorithm, std.numeric, std.string, std.math;
// 1要素のみの入力
T _scan(T= int)(){
return to!(T)( readln().chomp() );
}
// 1行に同一型の複数入力
T[] _scanln(T = int)(){
T[] ln;
foreach(string elm; readln().chomp().split()){
ln ~= elm.to!T();
... | 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.algorithm;
import std.conv;
void main() {
int[3] coins;
int x, ans;
for (int i = 0; i < 3; i++) {
coins[i] = readln.chomp.to!int + 1;
}
x = readln.chomp.to!int;
foreach (i; 0..coins[0]) {
foreach (j; 0..coins[1]) {
foreach (k; 0..coins[2]) {
... | 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.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;
}
string calc(Vec2 p0, Vec2 p1, Vec2 p2) {
auto p0... | D |
// Vicfred
// https://atcoder.jp/contests/abc156/tasks/abc156_c
// brute force
import std.algorithm;
import std.array;
import std.conv;
import std.stdio;
import std.string;
void main() {
int n = readln.chomp.to!int;
int[] x = readln.split.map!(to!int).array;
long minima = 1<<30;
foreach(p; 1..101) {
... | D |
/+ dub.sdl:
name "A"
dependency "dcomp" version=">=0.6.0"
+/
import std.stdio, std.algorithm, std.range, std.conv;
import std.typecons;
// import dcomp.foundation, dcomp.scanner;
// import dcomp.array;
// import dcomp.ldc.inline;
int[] primeList(int n) {
bool[] used = new bool[n+1];
FastAppender!(int... | 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() {
long H;
scan(H);
long[long] memo;
lon... | 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.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
struct UFTree(T)
{
struct Node
{
T parent;
T rank = 1;
}
///
T min_size, max_size;
///
this(T n)
{
nodes.length = n;
sizes.length = n;
foreach... | 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;
foreach (_; 0..N) as ~= readln.chomp.to!long;
long min_p = 1;
long r;
foreach (a; as) {
if (min_p == a) {
min_p += 1... | D |
void main()
{
long[] tmp = readln.split.to!(long[]);
long n = tmp[0], k = tmp[1];
long[] lists = new long[10^^5+1];
foreach (i; 0 .. n)
{
tmp = readln.split.to!(long[]);
long a = tmp[0], b = tmp[1];
lists[a] += b;
}
long num = 1;
foreach (i, x; lists)
{
... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto nab = readln.split.to!(int[]);
auto N = nab[0];
auto A = nab[1];
auto B = nab[2];
writeln(min(N*A, B));
} | 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 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[]);
(buf[0].c2 + buf[1].c2).writeln;
}
auto c2(in int n)
{
return n * (n - 1) / 2;
}
| D |
import std.stdio, std.conv, std.string, std.array, std.math, std.regex, std.range, std.ascii;
import std.typecons, std.functional, std.traits;
import std.algorithm, std.container;
import core.stdc.stdlib;
void main()
{
auto N = scanElem;
auto vList = scanArray;
auto cList = scanArray;
long res;
for... | 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 INF = 1L << 59;
void main() {
auto s = readln.split.map!(to!int);
auto D = s[0];
auto G = s[1].to!... | D |
import std.stdio, std.math, std.algorithm, std.array, std.string, std.conv, std.container, std.range;
T[] Reads(T)() { return readln.split.to!(T[]); }
alias reads = Reads!int;
void scan(Args...)(ref Args args) {
string[] ss = readln.split;
foreach (i, ref arg ; args) arg = ss[i].parse!int;
}
void main() {
... | D |
void main(){
import std.stdio, std.string, std.conv, std.algorithm;
int n; rd(n);
int id;
int s12, s23, s31;
int l, r;
while(n--){
auto args=readln.split.to!(int[]);
auto w=args[0], as=args[1..$];
int[] p=[1, 2, 3];
foreach(a; as){
if(a==0) swap(p[0], p[1]);
else swap(p[1], p[... | 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 = 10L^^18;
enum mod = 10L ^^ 9 + 7;
void main() {
int n;
scan(n);
auto a = readln.split.to!(long[]);
auto as = new long[](n + 1);
for... | 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.exception : enforce;
int n, p;
int[] a;
void main() {
scan(n, p);
a = readln.split.to!(int[]);
if (a... | 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 t
{
int parent, left, right;
this()
{
parent = left = right = -1;
}
int... | 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.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto N = readln.chomp.to!int;
auto HS = readln.split.to!(int[]);
int[] cs = [HS[0]-1, HS[0]];
foreach (h; HS[1..$]) {
if (cs.length == 1) {
auto c = cs[0];
... | D |
import std.algorithm;
import std.conv;
import std.numeric;
import std.stdio;
import std.string;
void main()
{
int n = to!int(readln().chomp());
if (n % 2 == 0)
{
writeln(n);
}
else
{
writeln(n * 2);
}
}
| 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 max_a;
foreach (a; readln.split.to!(int[])) {
if (a == max_a + 1) {
max_a = a;
}
}
writeln(max_a == 0 ? -1 : (N - max_a)... | D |
import std.stdio, std.conv, std.string;
void main(){
writeln(readln.chomp.to!int ^^3);
} | 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;
import core.bitop : popcnt;
alias Generator ... | D |
import std.stdio, std.string, std.array, std.conv, std.algorithm, std.typecons, std.range, std.container, std.math, std.algorithm.searching, std.functional,std.mathspecial, std.numeric;
void main(){
auto abc=readln.split.map!(to!int).array;
((abc[0]<=abc[2]&&abc[2]<=abc[1])?"Yes":"No").writeln;
} | D |
import std.stdio;
import std.conv;
import std.string;
void main()
{
string s;
while ((s=readln()).length != 0) {
int cnt = 0;
int n = to!(int)(chomp(s));
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 10; k++) {
for (int l = 0; l < 10; l++) {
... | 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 std;
alias sread = () => readln.chomp();
alias lread = () => readln.chomp.to!long();
alias aryread(T = long) = () => readln.split.to!(T[]);
void main()
{
long a, b, c;
scan(a, b, c);
foreach (i; 1 .. 10 ^^ 3)
{
if ((a * i) % b == c)
{
writeln("YES");
retu... | D |
import std;
void main() {
auto SW = readln.split.to!(int[]);
auto S = SW[1], W = SW[0];
writeln(W <= S ? "unsafe" : "safe");
}
| 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 input = readln.chomp.split().map!(to!long);
long n = input[0];
long k = input[1];
if (n % k == 0)
{
w... | 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.to!(dchar[]).sort();
b... | D |
void main(){
import std.stdio, std.string, std.conv, std.algorithm;
int n; rd(n);
auto m=new int[](n), d=new int[](n);
auto v=new int[](n), s=new int[](n);
foreach(i; 0..n) rd(m[i], d[i], v[i], s[i]);
int f(int v){
return (v-1)%360+1;
}
auto days=new int[](361);
foreach(i; 0..n){
int ... | D |
// cheese-cracker [2022-02-12]
void solve(){
int n = scan!int;
auto arr = scanArray;
long summ = 0;
bool f = 0;
for(int i = 1; i < n-1; ++i){
if(arr[i] >= 2){
f = 1;
}
summ += arr[i]/2 + (arr[i] % 2 != 0);
}
if(f && !(n == 3 && arr[1] % 2 != 0) ){
... | 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 = 1L << 50;
enum mod = 10L^^9 + 7;
void main() {
int n;
scan(n);
auto h = readln.split.to!(int[]);
auto a = readln.split.to!(int[]);
... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto S = readln.chomp;
for (;;) {
if (S.empty) break;
if (S.length >= 2 && S[0..2] == "hi") {
S = S[2..$];
} else {
writeln("No");
ret... | D |
import std.stdio ,std.conv , std.string;
void main(){
auto input = readln();
foreach( i,c ; input ){
if(i%2==1){continue;}
write(c);
}
writeln("");
}
unittest{
}
T[] readLine( T = size_t )(){
T[] ret;
foreach( val ; readln().chomp().split() ){
ret ~= to!T(val);
}
return ret;
}
| D |
void main() {
problem();
}
void problem() {
const N = scan!long;
const An = scan!long(cast(int)(N-1));
void solve() {
long[long] members;
foreach(i; 1..N+1) members[i] = 0;
foreach(a; An) {
members[a]++;
}
foreach(i; 1..N+1) writeln(members[i]);
}
solve();
}
// -------------... | 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);}
auto g = [0, 2, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0];
vo... | 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.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, i; readV(n, i);
writeln(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, std.bitmanip;
void main() {
auto s = readln.split.map!(to!long);
auto N = s[0].to!int;
auto C = s[1];
auto X = new long[](N)... | D |
import std.algorithm;
import std.container;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.traits;
class UnionFind(T) if (isIntegral!T) {
private:
T[] rank;
T[] par;
T size;
public:
this(T size) {
rank = repeat(0.to!T).take(size).array;
par = iota(... | D |
import std.stdio, std.conv, std.string, std.array, std.math, std.regex, std.range, std.ascii;
import std.typecons, std.functional, std.traits;
import std.algorithm, std.container;
import core.stdc.stdlib;
void main()
{
auto S = readln.strip;
long res;
foreach(c;S)res+=c=='+'?1:-1;
writeln(res);
}
cla... | D |
// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=(... | D |
import std.stdio;
import std.string;
import std.array;
import std.range;
import std.algorithm;
import std.conv;
import std.typecons;
string disp(bool result){
if(result){
return "Yay!";
}else{
return ":(";
}
}
bool solve(int a, int b){
if(a <= 8 && b <= 8){
return true;
}el... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto S = readln.chomp;
while (!S.empty) {
if (S.length >= 5 && S[$-5..$] == "dream") {
S = S[0..$-5];
} else if (S.length >= 7 && S[$-7..$] == "dreamer") {
... | D |
import std.array;
import std.range;
import std.stdio;
import std.conv;
import std.string;
import std.algorithm;
int bsearch(int[] a, int b) {
size_t lo=0,hi=a.length-1;
while(hi>=lo) {
size_t mi = (hi+lo)/2;
if(a[mi] > b) hi = mi - 1;
else lo = mi + 1;
}
return a[hi];
}
int[] uniq(int[] a)
{
... | D |
/+ dub.sdl:
name "B"
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);
int n;
sc.read(n);
long[long] mp;
foreach (i; 0..n) {
long a, b;
sc.r... | D |
/+ dub.sdl:
name "B"
dependency "dcomp" version=">=0.6.0"
+/
import std.stdio, std.algorithm, std.range, std.conv;
// import dcomp.foundation, dcomp.scanner, dcomp.algorithm;
int main() {
auto sc = new Scanner(stdin);
int n, m;
sc.read(n, m);
int[][] g = new int[][](n, m);
foreach (i; 0..n... | D |
import std.algorithm.comparison;
import std.conv;
import std.stdio;
import std.string;
void main()
{
auto x = readln.strip.to!int;
auto result = 1;
foreach( int b; 1 .. x )
{
foreach( int p; 2 .. x )
{
auto bp = b ^^ p;
if( x < bp ) break;
result = max( result, bp );
}
}
writeln( result )... | D |
import std.stdio;
import std.conv;
import std.algorithm;
import std.string;
import std.array;
void main() {
bool[] state = new bool[](3);
state[0] = true; state[1] = false; state[2] = false;
while(true) {
string line = readln.chomp;
if (stdin.eof) break;
auto data = line.split(",").map!((x) => to!(u... | D |
import std.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.string;
void main ()
{
auto tests = readln.strip.to !(int);
foreach (test; 0..tests)
{
auto s = readln.strip.dup;
auto n = s.length.to !(int);
string res;
foreach (i; 0..n + 1)
{
if (i < n)
{
s[i] ^= 3;
}
... | D |
import std.stdio;
import std.string;
size_t lb(int[10][] arr, int n, int key) {
long left = -1;
long right = arr.length;
while(right - left > 1) {
long mid = left + (right - left) / 2;
if (arr[mid][n] >= key) right = mid;
else left = mid;
}
return right;
}
void main() {
int n;
scanf("%d\n", &n);
auto 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.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
writeln(readln[5..7].to!int > 4 ? "TBD" : "Heisei");
} | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;
void main() {
int n;
scan(n);
writeln(n*(n + 1) / 2);
}
void scan(T...)(ref T args) {
import std.stdio : readln;
import std.algorithm : splitter;
import std.conv : to;
import std.range.primitives;
a... | 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() {
readi... | D |
void main() {
import std.stdio, std.string, std.conv, std.algorithm;
int a, b, c, d;
rd(a, b, c, d);
writeln(max(0, min(b, d) - max(a, c)));
}
void rd(T...)(ref T x) {
import std.stdio : readln;
import std.string : split;
import std.conv : to;
auto l = readln.split;
assert(l.length == x.length);
... | 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 main() {
readln.chomp.pipe!(s => w... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.math;
import std.array;
import std.range;
import std.regex;
void main(){
auto a=readln.chomp.to!int;
if(a<1200)writeln("ABC");
else if(a>=1200&&a<2800)writeln("ARC");
else if(a>=2800)writeln("AGC");
} | D |
import std.stdio;
import std.conv;
import std.algorithm;
import std.string;
import std.file;
import std.math;
int main() {
string l;
l = readln().split("\n")[0];
string res = "";
foreach(char x; l) res = x ~ res;
write(res ~ "\n");
return 0;
} | D |
void main() {
import std.stdio, std.string, std.conv, std.algorithm;
int t;
rd(t);
while (t--) {
long n, v, l, r;
rd(n, v, l, r);
auto num = (l - 1) / v;
num += n / v - r / v;
writeln(num);
}
}
void rd(T...)(ref T x) {
import std.stdio : readln;
import std.string : split;
import st... | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto s = readln.chomp;
foreach (i, c; s) {
if (i >= 1 && s[i-1] == c) {
writeln(i, " ", i+1);
return;
}
if (i >= 2 && s[i-2] == c) {
writeln(i-1, " ", i+1);
return;
}
}
writeln("-1 -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;
import core.bitop : popcnt;
alias Generator ... | 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[] lreads(T = long)(long n){ret... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(... | D |
import std.stdio, std.string, std.conv;
import std.array, std.algorithm, std.range;
bool prime(int n)
{
for(int i=2; i*i<=n; ++i)
if(n%i==0) return false;
return true;
}
void main()
{
int[] ns;
int m=0;
for(int n; 0!=(n=readln().chomp().to!int()); ) m=max(m,n),ns~=n;
auto a = new long[... | D |
void main()
{
long a, b, c, d;
rdVals(a, b, c, d);
if (abs(c- a) <= d) "Yes".writeln;
else if (abs(b - a) <= d && abs(c - b) <= d) "Yes".writeln;
else "No".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;
}
... | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
int readint() {
return readln.chomp.to!int;
}
int[] readints() {
return readln.split.map!(to!int).array;
}
void main() {
auto s = readln.chomp;
writeln... | D |
void main()
{
long[] tmp = rdRow;
long n = tmp[0], k = tmp[1], s = tmp[2];
long t;
if (n - k)
{
if (s == 10L ^^ 9) t = 1;
else t = 10L ^^ 9;
}
foreach (i; 0 .. n)
{
if (i < k) s.write;
else t.write;
if (i == n - 1) writeln;
else " ".write... | D |
import std.stdio, std.string, std.array, std.conv, std.algorithm;
char[10^^5] SS;
char conv(char who, char what, char whom)
{
switch (who) {
case 'S':
switch (what) {
case 'o':
switch (whom) {
case 'S':
ret... | 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 |
void main(){
import std.stdio, std.conv, std.string, std.algorithm;
long n, a, b, k; rd(n, a, b, k);
const long mod=998244353;
const int M=1_000_00*4;
static fact=new long[](M);
static inv_fact=new long[](M);
{ // init
fact[0]=fact[1]=1;
foreach(i; 2..M) fact[i]=i*fact[i-1]%mod;
long powmod(... | D |
import std.stdio, std.conv, std.string, std.range, std.array, std.algorithm;
import std.bigint;
const char[] c = ['I', 'V', 'X', 'L', 'C', 'D', 'M'];
const int[] a = [1, 5, 10, 50, 100, 500, 1000];
void main()
{
while (true){
string s = readln().chomp();
if (s == "") break;
int sum, l;
for (int i = ... | D |
import std.stdio, std.conv, std.array, std.string;
import std.algorithm;
import std.container;
import std.range;
import core.stdc.stdlib;
import std.math;
import std.typecons;
void main() {
auto N = readln.chomp.to!int;
auto An = readln.split.to!(long[]);
auto total = An.sum;
long current_length_twice;
long... | 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 main() {
readln.chomp.to!int.recur... | D |
void main(){
import std.stdio, std.string, std.conv, std.algorithm;
auto s=readln.chomp.to!(char[]);
writeln(s[0..($-8)]);
}
void rd(T...)(ref T x){
import std.stdio, std.string, std.conv;
auto l=readln.split;
foreach(i, ref e; x){
e=l[i].to!(typeof(e));
}
} | D |
import std.stdio;
import std.conv;
import std.string;
import std.format;
void main()
{
string s = chomp(readln());
int a = to!int(s.split(" ")[0]);
int b = to!int(s.split(" ")[1]);
int c = to!int(s.split(" ")[2]);
if ( a < b && b < c ) {
writeln("Yes");
} else {
writeln("No");
}
} | 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 |
void main() {
int[] tmp = readln.split.to!(int[]);
int n = tmp[0], m = tmp[1];
writeln((n - 1) * (m - 1));
}
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... | 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[8] map;
for(int i=0;i<8;i++) map[i] = readln().chomp();
writeln(90);
for(int j=0;j<8;j++){
... | 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 infl = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;
int[] di = [1, 0, -1, 0];
int[] dj = [0, 1, 0, -1];
void main() {
... | D |
import std.stdio, std.string, std.conv;
void main() {
string s = readln.chomp;
long mod = 1_000_000_007;
long[][] dp = new long[][](100001, 13);
dp[0][0] = 1;
foreach (i, x; s) {
if (x == '?') {
foreach (j; 0 .. 13) {
foreach (k; 0 .. 10) {
dp... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.range;
import std.array;
import std.math;
void main(){
auto n=readln.chomp.to!int;
auto a=readln.chomp.to!int;
if(n%500<=a)writeln("Yes");
else writeln("No");
}
| 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 Q = readln.chomp.to!int;
foreach(int i; 0..Q) {
int... | D |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.