code stringlengths 4 1.01M | language stringclasses 2
values |
|---|---|
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.array;
void main(){
auto M=readln.chomp.to!int;
writeln(24+(24-M));
} | D |
import std.string,
std.stdio,
std.conv,
std.math,
std.range,
std.algorithm;
void main(){
auto ps = readln.chomp.split.map!(to!double);
printf("%.8lf\r\n", sqrt(pow(ps[2]-ps[0], 2) + pow(ps[3]-ps[1], 2)));
} | 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;
scan(n);
auto x = new int[](n);
... | 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 N = readln.chomp.to!int;
int[][] ary = new int[][](3, N);
... | 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;
import std.datetime;
void main() {
auto N = readln.chomp.to!int;
auto A = readln.split.map!(to!long).array;
aut... | D |
import std.stdio,std.string,std.conv;
int[] value;
string dfs(int left,int right,int i)
{
if(i == 10) return "YES";
if(left < value[i])
{
return dfs(value[i],right,i+1);
}
if(right < value[i])
{
return dfs(left,value[i],i+1);
}
return "NO";
}
int main()
{
value.length = 10;
int n = readln.chomp.to!int... | 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;
alias Generator = std.concurrency.Generator;... | 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;
import std.bigint;
void main()
{
auto inp = readln.split.map!(to!int).array;
int cnt;
auto num = [1, 1, 2, 7, 4];
while (1) {
... | 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;
auto f = true;
foreach (i; 0..s.length/... | D |
import std.stdio;
import std.conv;
import std.string;
void main()
{
auto a = readln.chomp.to!int;
auto b = readln.chomp.to!int;
auto h = readln.chomp.to!int;
writeln ((a + b ) * h / 2);
} | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric, std.bigint;
long P = 998244353L;
long[10^^5*3+50] F, RF;
void init()
{
F[0] = F[1] = 1;
foreach (i, ref x; F[2..$]) x = (F[i+1] * (i+2)) % P;
{
RF[$-1] = 1;
auto x = F[$-1];
aut... | 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;
import std.container;
void main()
{
int[char] pat;
pat['I'] = 1;
pat['V'] = 5;
pat['X'] = 10;
pat['L'] = 50;
pat['C'] = 100;
pat['D'] = 500;
pa... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.math;
import std.regex;
void main() {
auto N = readln.chomp.to!int;
foreach(i;1..10) {
if(pow(2, i) > N) {
pow(2, i-1).writeln;
break;
}
}
} | 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 h;
int a;
}
void parseInput(T)(out Input input, T file)
{
with (file) with (input)
{
auto array = readln().strip().split();
h = array[0].to!int;
... | D |
import std.stdio;
import std.algorithm;
import std.string;
import std.functional;
import std.array;
import std.conv;
import std.math;
import std.typecons;
import std.regex;
import std.range;
int a;
int[] p = [1,4,10,20,35];
int[] dp,odp;
void main(){
for(int i=6;i<300;i++){
p ~= i * (i+1) * (i+2) / 6;
}
... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math;
void main()
{
auto N = readln.chomp.to!int;
auto A1 = readln.split.to!(int[]);
auto A2 = readln.split.to!(int[]);
A2[0] += A1[0];
foreach (j; 1..N) {
A1[j] += A1[j-1];
A2[j] += A1[j] > A2[j-1] ? A1[j] : A2[... | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
alias graph = Graph!(long, size_t, 10L ^^ 18);
alias edge = graph.Edge;
void main()
{
auto rd1 = readln.split.to!(size_t[]), n = rd1[0], m = rd1[1];
auto g = new edge[][](n);
foreach (_; 0..m){
auto rd2 = readln.split, a = rd2[0].to!size_t-1... | D |
import std.stdio, std.string, std.range, std.conv, std.array, std.algorithm, std.math, std.typecons, std.functional;
enum K = 1_000_000_007;
void main() {
const tmp = readln.split.to!(long[]);
const N = tmp[0], M = tmp[1];
if (M == 1) {
writeln(1);
return;
}
const primes = prime... | D |
void main() {
int[] ab = readln.split.to!(int[]);
ab ~= ab[0] + ab[1];
writeln(ab.any!"a % 3 == 0" ? "Possible" : "Impossible");
}
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;
impor... | D |
import std.stdio;
import std.range;
import std.array;
import std.algorithm;
import std.string;
import std.conv;
import std.typecons;
import std.math;
import std.numeric;
void main() {
int[] input;
foreach (i; 0 .. 5) {
input ~= readln().chomp().to!int;
}
immutable k = readln().chomp().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.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(){
int n, a;
n = _scan();
a = _scan();
writeln(n%500 <= a?"Yes":"No");
}
import std.stdio, std.conv, std.algorithm, std.numeric, std.string, std.math;
// 1要素のみの入力
T _scan(T= int)(){
return to!(T)( readln().chomp() );
}
// 1行に同一型の複数入力
T[] _scanln(T = int)(){
T[] ln;
foreach(string elm; readln().chomp... | 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 N = readln.chomp.to!long;
auto S = readln.chomp;
long x, r = 1;
foreach (c; S) {
if (c == 'B') {
if (x%2 == 0) {
x += 1;
... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.math;
void main() {
auto S = readln.chomp.to!(dchar[]);
S[3] = '8';
writeln(S);
}
| D |
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
immutable mod = 10^^9 + 7;
void main() {
int a, b, c;
scan(a, b, c);
writeln(a ^ b ^ c);
}
void scan(T...)(ref T args) {
string[] line = readln.split;
foreach (... | D |
import std.stdio;
import std.string, std.conv, std.array, std.algorithm;
import std.uni, std.math, std.container, std.typecons;
import core.bitop, std.datetime, std.range;
void main(){
auto rd = readln.split.to!(int[]);
auto n = rd[0], q = rd[1];
auto ds = new int[][](n, 1);
auto n2s = iota(n).array;
... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.math;
void main() {
int n;
scan(n);
auto a = iota(n).map!(i => readln.chomp.to!int).array;
long ans;
foreach (i ; 0 .. n) {
ans += a[i] / 2;
a[i] %= 2;
if (i < n - 1 && a[i] && a[i+1])... | D |
import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.... | D |
void main(){
import std.stdio, std.string, std.conv, std.algorithm;
int n, q; rd(n, q);
auto tree=new SquareRootDecomposition(n);
while(q--){
auto args=readln.split.to!(int[]);
if(args[0]==0){
tree.add(args[1], args[2]+1, args[3]);
}else{
writeln(tree.rmin(args[1], args[2]+1));
}
... | D |
import std.algorithm;
import std.array;
import std.container;
import std.conv;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
void scan(T...)(ref T a) {
string[] ss = readln.split;
foreach (i, t; T) a[i] = ss[i].to!t;
}
T read(T)() { return read... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto N = readln.chomp.to!int;
auto AS = readln.split.to!(long[]);
auto BS = readln.split.to!(long[]);
long r;
foreach (i; 0..N) {
auto b = BS[i];
if (AS[i] >= b) {
... | 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, a, b, c;
scan(n, a, b, c);
auto l ... | 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 = 10^^9 + 7;
void main() {
auto N = readln.chomp.to!int;
auto G = new int[][](N);
foreach (i; ... | D |
import std.stdio, std.algorithm, std.string, std.conv, std.array, std.range;
void main() {
auto tmp = readln.split.to!(int[]);
foreach (i; tmp[0]..tmp[1]+1) {
if (i < tmp[0] + tmp[2] || i > tmp[1] - tmp[2]) {
writeln(i);
}
}
}
| D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
void scan(T...)(ref T a) {
string[] ss = readln.split;
foreach (i, t; T) a[i] = ss[i].to!t;
}
T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return r... | 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 s = readln.chomp;
auto t = readln.chomp;
foreach (i; 0..N+1) {
if (s[i..$] == t[0..N-i]) {
writeln(N + i);
return;
... | D |
void main()
{
int[] tmp = readln.split.to!(int[]);
int n = tmp[0], a = tmp[1], b = tmp[2];
writeln((b - a) & 1 ? "Borys" : "Alice");
}
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;
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() {
auto s = readln.chomp;
writeln(s[0] == s[2] ? "Yes"... | 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;
import std.string;
import std.array;
import std.conv;
import std.algorithm;
void main(){
int[] change;
while(true){
int input = readln().chomp().to!int();
if(input != 0){ change ~= 1000 - input; }else{ break; }
}
foreach(int i; change){
int count = 0;
w... | 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 np = readln.split.to!(long[]);
auto N = np[0];
auto P = np[1];
auto S = readln.chomp;
if (P == 2 || P == 5) {
long r;
foreach (i, c; S... | 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.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;
import std.bitmanip;
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[]... | D |
import std.stdio, std.string, std.conv, std.range, std.array, std.algorithm;
import std.uni, std.math, std.container, std.typecons, std.typetuple;
import core.bitop, std.datetime;
immutable long mod = 10^^9 + 7;
void main(){
int n = readln.chomp.to!int;
auto a = readln.split.to!(int[]);
int amax = -1, am... | 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 n, m;
int[][] adj;
bool ok(int now, int depth)
{
if (depth == 2) {... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string;
bool[10^^5+1] PRM = true;
int[10^^5+1] BIT;
void main()
{
PRM[0] = PRM[1] = false;
foreach (i; 3..10^^5+1) {
if (i & 1) {
if (PRM[i]) {
auto n = 2;
auto j = i * n;
while (j < 1... | D |
import std.algorithm;
import std.array;
import std.container;
import std.conv;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
void scan(T...)(ref T a) {
string[] ss = readln.split;
foreach (i, t; T) a[i] = ss[i].to!t;
}
T read(T)() { return read... | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto n = readln.chomp.to!long, ns = n.nsqrt;
foreach_reverse (a; 1..ns+1)
if (n % a == 0) {
writeln((n/a).digits);
break;
}
}
auto digits(long x)
{
foreach (i; 1..11)
if (x / 10L ^^ i == 0) return i;
asser... | D |
import std.algorithm;
import std.array;
import std.ascii;
import std.container;
import std.conv;
import std.format;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
bool is_parindrome(string s)
{
ulong len = s.length;
for (int i = 0; i < len / 2; ++i) {
if (s[i] != s... | 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 data = readln.split.to!(int[]);
auto N = data[0], Q = data[1];
auto S = readln.split[0];
int[] _ACstarts;
auto cnt = 0;
while ( cnt < S.length-1 ) {
if (... | D |
void main() {
import std.stdio, std.string, std.conv, std.algorithm;
int n;
rd(n);
int len = 0;
foreach (i; 0 .. n) {
int x, y;
rd(x, y);
len = max(len, x + y);
}
writeln(len);
}
void rd(T...)(ref T x) {
import std.stdio, std.string, std.conv;
auto l = readln.split;
assert(l.length ==... | 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 arywrite(T=long)(T[] ary){ary.map!(text).join(' ').writeln;}
void scan(TList...)(ref TList Args){auto line =... | 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 |
/+ dub.sdl:
name "B"
dependency "dcomp" version=">=0.6.0"
+/
import std.stdio, std.algorithm, std.range, std.conv;
// import dcomp.foundation, dcomp.scanner;
int main() {
auto sc = new Scanner(stdin);
string s;
sc.read(s);
long[26] cnt;
s.each!(c => cnt[c-'a']++);
long sm = 1;
fore... | D |
import std.stdio, std.algorithm, std.range, std.conv, std.string, std.math;
import core.stdc.stdio;
// foreach, foreach_reverse, writeln
void main() {
int[] a = new int[3];
foreach (i; 0..3) {
scanf("%d", &a[i]);
}
a.sort;
int ans = 0;
foreach (i; 0..3) {
ans += a[2]-a[i];
}
if (ans%2 == 1) ans += 3;
writ... | D |
import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.... | 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.range;
import std.stdio;
import std.string;
import std.typecons;
void main()
{
string str = readln.chomp;
int n = cast(int) str.length;
int[] a = new ... | D |
import std.algorithm;
import std.array;
import std.container;
import std.conv;
import std.exception;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
import core.bitop;
immutable int MED_N = 1_000_006;
immutable int MAX_N = MED_N * ... | D |
import std.stdio, std.string, std.conv, std.range, std.array, std.algorithm;
import std.uni, std.math, std.container, std.typecons, std.typetuple;
import core.bitop, std.datetime;
long ans = 1L<<60;
void main(){
long h, w;
readVars(h, w);
calc(h, w);
calc(w, h);
writeln(ans);
}
void calc(long h, ... | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto n = readln.chomp.to!size_t;
auto k = readln.chomp.to!int;
auto x = readln.split.to!(int[]);
auto ans = 0;
foreach (xi; x)
ans += min(xi, k-xi);
writeln(ans*2);
}
| D |
import std;
void main() {
string s = read;
foreach (c; s) {
if (c == '?') write('D');
else write(c);
}
writeln();
}
void scan(T...)(ref T a) {
string[] ss = readln.split;
foreach (i, t; T) a[i] = ss[i].to!t;
}
T read(T=string)() { return readln.chomp.to!T; }
T[] reads(T)() { re... | 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 = 10^^9 + 7;
void main() {
int n;
scan(n);
auto a = new int[](n);
auto b = new int[](n);
auto c = new int[](n);
foreach (i ; 0 .... | 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.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readint = read!int;
alias readints = reads!int;
int calc(int k, int s) ... | D |
import std.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.string;
immutable string alt = "!@#";
void main ()
{
auto tests = readln.strip.to !(int);
foreach (test; 0..tests)
{
auto s = readln.strip.dup;
auto n = s.length.to !(int);
int res = 0;
foreach (i; 1..n)
{
if (s[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;
import std.ascii;
void main()
{
(readln.chomp[0]+1).to!char.writeln;
}
| 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 s = rdStr;
long n = 2019;
long len = s.length;
long[] dp1 = new long[n];
long[] dp2 = new long[n];
long result;
foreach (x; s)
{
long m = x - '0';
++dp1[m];
foreach (j; 0 .. n)
{
dp1[(10*j+m)%n] += dp2[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;
void main() {
auto table = readln.chomp;
auto cards = readln.split;
foreach (card ; cards) {
if (table[0] == card[0] || table[1] == card[1]) {... | 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() {
auto p1 = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 3... | 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()
{
long h, w;
rdVals(h, w);
string[] s = h.rdCol!string;
long[][] dp = new long[][](h, w);
dp[0][0] = (s[0][0] == '#');
foreach (i; 1 .. h)
{
dp[i][0] = dp[i-1][0];
if (s[i][0] == '#' && s[i-1][0] != '#') ++dp[i][0];
}
foreach (i; 1 .. w)
{
dp[... | 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;
int nReturn(int a, int m){
int ret = 1;
int p = a%m;
while(p > 1){
p = (p*a)%m;
++ret;
}
return ret;
... | D |
import std.stdio,
std.range,
std.algorithm;
void main(){
readln();
readln().split().retro().join(" ").writeln();
} | 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.string, std.algorithm, std.conv, std.array, std.math;
void main()
{
auto wab = readln.chomp.split(" ").map!(to!int);
auto w = wab[0];
auto a = wab[1];
auto b = wab[2];
auto d = a < b ? (b-a-w) : (a-b-w);
writeln(d < 0 ? 0 : d);
} | 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.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;
auto n = s.length.to !(int);
int p = 1;
foreach (i; 1..n)
{
if (s[i - 1] + s[i] > '0' + '9')
{
p = i... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math;
long[2*10^^5] AS, SAS;
void main()
{
auto N = readln.chomp.to!int;
foreach (i, e; readln.split.to!(long[])) {
AS[i] = e;
if (i) {
SAS[i] = SAS[i-1] + e;
} else {
SAS[i] = e;
}
... | 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 ab = readNums!int;
foreach(i; 0 .. max(ab[0], ab[1])){
write(mi... | D |
void main()
{
int[] tmp = readln.split.to!(int[]);
int n = tmp[0], m = tmp[1];
int[][] services = new int[][](n);
foreach (i; 0 .. m)
{
tmp = readln.split.to!(int[]);
int a = tmp[0] - 1, b = tmp[1] - 1;
services[a] ~= b;
services[b] ~= a;
}
bool ok;
fore... | 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.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto nk = readln.split.to!(long[]);
auto N = nk[0];
auto K = nk[1];
writeln(min(N - N/K*K, (N/K+1)*K - N));
} | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;
void main() {
string N = readln.chomp;
int ans;
foreach (ch ; N) {
ans += ch - '0';
}
ans = max(ans, (N[0] - '0' - 1) + 9 * (N.length.to!int - 1));
writeln(ans);
}
void scan(T...)(ref T args) {
... | 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 |
void main() {
auto S = rs;
ulong res = ulong.max;
auto arr = ['0', '1'];
foreach(k; 0..2) {
ulong tmp;
foreach(i; 0..S.length) {
if(S[i] != arr[(k+i)%2]) {
tmp++;
}
}
res = min(res, tmp);
}
res.writeln;
}
// ===================================
import std.stdio;
import std.string;
import std.fu... | 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, core.stdc.string;
immutable long MOD = 10^^9 + 7;
void main() {
auto N = readln.chomp.to!int;
auto A = N.iota.map!(_ => readln.chom... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
int[][10] DtoS;
int[10] SS;
void main()
{
auto nm = readln.split.to!(int[]);
auto N = nm[0];
auto M = nm[1];
foreach (i; 0..M) {
auto kss = readln.split.to!(int[]);
foreach (k; kss[1.... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string;
void main()
{
auto N = readln.chomp.to!int;
auto AS = readln.split.to!(long[]);
long[] cums;
int[long] cnt;
long ret;
cums.length = N;
foreach (i, a; AS) {
if (i == 0) {
cums[i] = a;
} else {
... | D |
import std.stdio, std.string, std.conv, std.algorithm, std.array;
enum VMAX = 15 + 1;
enum INF = 1 << 29;
int[VMAX][VMAX] table;
int[1<<VMAX][VMAX] dp;
int V, E;
int solve(int S, int v) {
if ( dp[v][S] >= 0 ) {
return dp[v][S];
}
if ( S == (1 << V) - 1 && v == 0 ) {
return dp[v][S] = 0;
... | D |
import std.stdio;
import std.algorithm.sorting;
void main()
{
int[10] n;
foreach(i;0..10)
scanf("%d", &n[i]);
sort!("a>b")(n[]);
foreach(i;0..3)
writeln(n[i]);
} | D |
import std.stdio;
void main()
{
int n = 0;
int m = 0;
scanf("%d %d", &n, &m);
printf("%d %d\n", n*m, 2*(n+m));
} | 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.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 |
void main() {
problem();
}
void problem() {
auto S = scan;
string solve() {
return S[0..3];
}
solve().writeln;
}
// ----------------------------------------------
import std.stdio, std.conv, std.array, std.string, std.algorithm, std.container, std.range, core.stdc.stdlib, std.math, std.typecons, std.... | D |
import std.algorithm;
import std.conv;
import std.stdio;
import std.string;
void main()
{
auto ab = readln.split.map!( to!int );
writeln( solve( ab[ 0 ], ab[ 1 ] ) );
}
int solve( in int a, in int b )
{
return ( a <= b ) ? a : a - 1;
}
unittest
{
assert( solve( 5, 5 ) == 5 );
assert( solve( 2, 1 ) == 1 );
a... | D |
void main()
{
long a, b, c, k;
rdVals(a, b, c, k);
long total;
long n = min(a, k);
total += n;
k -= n;
n = min(b, k);
k -= n;
total -= k;
total.writeln;
}
enum long mod = 10^^9 + 7;
enum long inf = 1L << 60;
enum double eps = 1.0e-9;
T rdElem(T = long)()
if (!is(T == struct))... | D |
import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
import std.container;
enum MAX = 1_000_100;
ulong MOD = 1_000_000_007... | D |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.