code stringlengths 4 1.01M | language stringclasses 2
values |
|---|---|
import std.algorithm, std.array, std.container, std.range;
import std.string, std.uni, std.regex;
import std.stdio, std.conv, std.typecons;
void main()
{
for (;;) {
auto s = readln.chomp;
if (s == "-") break;
auto m = readln.chomp.to!size_t;
auto hi = iota(m).map!(_ => readln.chomp.to!int);
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;
alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", ... | D |
import std.stdio, std.algorithm, std.range, std.conv, std.string;
import core.stdc.stdio;
// foreach, foreach_reverse, writeln
void main() {
int n;
scanf("%d", &n);
int[] x = new int[n*2];
int[] c = new int[n*2];
foreach (color; 0..2) {
foreach (i; 0..n) {
int a, b;
scanf("%d%d", &a, &b);
x[b] = a; c[b... | 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() {
int n;
scan(n);
foreach (i ; 0 .. n) {
string s;
scan(s);
solve(s);
}
}
void solve(string s) {
auto a = [".,!?... | D |
import std.stdio;
import std.conv;
import std.string;
void main() {
int n = readln.chomp.to!int;
if (n % 2) (n/2 +1).writeln;
else (n/2).writeln;
} | 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.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 |
// 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;
long m, b;
void main() {
scan(m, b);
long ans = -1;
foreach (long a ; 0L .. m * b + 1) {
long ya = (m*... | 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 es = new int[](N);
auto ws = new int[](N);
foreach (i; 0..N) {
if (i > 0) ws[i] += ws[i-1];
if (S[i] == 'W')... | D |
import std.stdio;
import std.array;
import std.conv;
int gcd(int x, int y) {
if(x < y) {
int t = x;
x = y;
y = t;
}
if(y == 0) {
return x;
}
return gcd(y, x % y);
}
void main() {
int a, b;
while(true) {
string[] input = split(readln());
if(in... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto ns = readln.split;
foreach (a; ns) {
foreach (b; ns) {
foreach (c; ns) {
foreach (d; ns) {
if (a~b~c~d == "1974") {
... | 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 S = readln.chomp;
auto T = readln.chomp;
int r = 1000;
foreach (i; 0..S.length - T.length + 1) {
int rr;
foreach (j, t; T) if (S[i+j] != t)... | D |
void main() {
problem();
}
void problem() {
auto a = scan!long;
string solve() {
return a >= 30 ? "Yes" : "No";
}
solve().writeln;
}
// ----------------------------------------------
import std.stdio, std.conv, std.array, std.string, std.algorithm, std.container, std.range, core.stdc.stdlib, std.math... | 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()
{
foreach (i, c; readln.chomp) {
if (i % 2 == 1) {
continue;
}
... | D |
import std.algorithm;
import std.conv;
import std.exception;
import std.stdio;
import std.string;
import std.typecons;
struct Queue(T){
T[900] content;
size_t head;
size_t tail;
T front(){
enforce(head != tail);
return content[head];
}
void popFront(){
enforce(head !=... | 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;
ulong MOD = 1_000_000_007;
ulong INF = 1_000_00... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons;
void main()
{
writeln(readln.chomp.to!int / 3);
} | D |
import std.algorithm;
import std.array;
import std.conv;
import std.stdio;
void main()
{
string n;
n = readln;
if (
n[0..1] == "7"
|| n[1..2] == "7"
|| n[2..3] == "7"
) {
writeln("Yes");
} else {
writeln("No");
}
}
| 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;
void main(){
string s = readln.chomp;
int n = s.length.to!int;
int ans = 0;
foreach(i; 0 .. n){
if(i % 2){ // 自分はp
if(s[i] == 'p') ans += 0; // pp
else ans += ... | 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 n = readln();
while(true){
char[5][8] s;
for(int i=0;i<5;i++){
s[0][i] = '*';
s[1][i] =... | D |
void main()
{
long n = readln.chomp.to!long;
long[] a = readln.split.to!(long[]);
writeln(a.count!"a % 2 == 1" % 2 == 0 ? "YES" : "NO");
}
import std.stdio;
import std.string;
import std.array;
import std.conv;
import std.algorithm;
import std.range;
import std.math;
import std.numeric;
import std.contain... | 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 A = s[0];
auto B = s[1];
auto C = s[2];
auto X = s... | D |
void main(){
import std.stdio, std.string, std.conv, std.algorithm;
int n; rd(n);
int sum=0;
for(int div=1; n/div>0; div*=10){
sum+=(n/div)%10;
}
assert(sum>0);
if(n%sum==0) writeln("Yes");
else writeln("No");
}
void rd(T...)(ref T x){
import std.stdio, std.string, std.conv;
auto l=readln.spli... | D |
import std.stdio, std.string, std.array, std.conv;
void main() {
int[] tmp = readln.chomp.split.to!(int[]);
int a = tmp[0] - 1, b = tmp[1] - 1;
writeln((a + b - 1) / a);
} | 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.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 |
void main() {
int[] tmp = readln.split.to!(int[]);
int a = tmp[0], b = tmp[1], x = tmp[2];
writeln(a <= x && x <= a + b ? "YES" : "NO");
}
import std.stdio;
import std.string;
import std.array;
import std.conv;
import std.algorithm;
import std.range;
import std.math;
import std.numeric;
import std.containe... | 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[] e;
e.length = N+1;
foreach (i; 2..N+1) {
auto cur = i;
foreach (j; 2..i+1) {
while (cur % j == 0) {
++e[j... | 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, std.datetime;
bool is_p(string s) {
int n = s.length.to!int;
foreach (i; 0..n/2) if (s[i] != s[n-i-1]) return false;
... | D |
//dlang template---{{{
import std.stdio;
import std.conv;
import std.string;
import std.array;
import std.algorithm;
import std.typecons;
import std.math;
import std.range;
// MIT-License https://github.com/kurokoji/nephele
class Scanner
{
import std.stdio : File, stdin;
import std.conv : to;
import std.array : ... | D |
import std.conv;
import std.stdio;
import std.string;
void main()
{
auto nk = readln.split.to!( int[] );
auto as = readln.split.to!( int[] );
writeln( solve( nk[ 1 ], as ) );
}
auto solve( in int k, in int[] as )
{
auto as_r = as.length - k;
auto k_r = k - 1;
auto c = 1 + as_r / k_r;
auto re = ( as_r % k_r == ... | 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;
import std.string;
import std.conv;
import std.math;
int main()
{
double x=0.0,y=0.0,angle=90;
while(true)
{
string[] s = readln.chomp.split(",");
if(s[0] == "0" && s[1] == "0") break;
int value = s[0].to!int;
int value_2 = s[1].to!int;
x += cos(angle*PI/180)*value;
y += sin(angle*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, std.random, 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 N;
scan(N);
long ans = in... | D |
void main() {
problem();
}
void problem() {
auto X = scan!long;
long solve() {
return 8 - (X - 400) / 200;
}
solve().writeln;
}
// ----------------------------------------------
import std.stdio, std.conv, std.array, std.string, std.algorithm, std.container, std.range, core.stdc.stdlib, std.math, std... | D |
import std.stdio;
void main() {
int x;
scanf("%d", &x);
if ((x % 100 + 4) / 5 <= x / 100) {
1.write;
}
else {
0.write;
}
}
| D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
void main() {
while(true) {
auto NM = readln().split();
int N = to!int(NM[0]);
int M = to!int(NM[1]);
if(N == 0)
break;
const int INF = 200*1000*1000*2;
int[200][200] ldist;
int[200][200] sdist;
for(int i; i < N; ++i){
f... | D |
import std.stdio,
std.array,
std.conv,
std.string,
std.algorithm;
void main(){
int kane = 100000;
string s;
for(;;){
s=readln();
if(stdin.eof()) break;
int weeks = to!int(chomp(s));
for(int i = 0;i < weeks; ++i){
kane = kane + cast(int)(kane/100)*5;
if(kane > cast(int)... | D |
void main(){
import std.stdio, std.string, std.conv, std.algorithm;
int x; rd(x);
auto ushi="ai1333".to!(char[]);
while(x){
ushi~='3';
x-=100;
}
writeln(ushi);
}
void rd(T...)(ref T x){
import std.stdio, std.string, std.conv;
auto l=readln.split;
assert(l.length==x.length);
foreach(i, r... | D |
void main() {
import std.stdio, std.string, std.conv, std.algorithm;
long n, m;
rd(n, m);
auto s = readln.chomp.to!(char[]);
auto t = readln.chomp.to!(char[]);
import std.numeric : gcd;
auto l = n * m / gcd(n, m);
char[long] ch;
foreach (i; 0 .. n) {
auto j = i * (l / n);
ch[j] = s[i];
}
... | D |
import std.algorithm, std.stdio, std.string;
void main() {
auto s = readln.chomp;
(cast(ubyte[])s).sort;
writeln(s == "abc" ? "Yes" : "No");
} | D |
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,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;
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 |
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 |
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, 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.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.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.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.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 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.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 |
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 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 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;
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.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 |
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.range,
std.algorithm;
void main(){
readln();
readln().split().retro().join(" ").writeln();
} | 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 |
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 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;
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 |
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 |
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 |
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;
void main() {
string s;
scan(s);
auto n = s.length.to!in... | D |
import std.stdio, std.string, std.range, std.conv, std.array, std.algorithm, std.math, std.typecons;
void main() {
const N = readln.chomp.to!long;
const xs = 5.iota.map!(_ => readln.chomp.to!long).array;
writeln(4 + cast(long)ceil(cast(double)N / xs.reduce!min));
}
| D |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.