code stringlengths 4 1.01M | language stringclasses 2
values |
|---|---|
// Vicfred
// https://atcoder.jp/contests/dp/tasks/dp_a
// dynamic programming
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.stdio;
import std.string;
void main() {
const long n = readln.chomp.to!long;
const long[] h = 0~readln.split.map!(to!long).array;
long[] dp = ... | D |
import std.stdio;
import std.conv;
import std.string;
void main()
{
char[] buf;
int a;
stdin.readln(buf);
a = to!(int)(chomp(buf));
a = a * a * a;
writeln(a);
} | D |
import std.stdio, std.conv, std.string, std.array, std.math, std.regex, std.range, std.ascii, std.numeric, std.random;
import std.typecons, std.functional, std.traits,std.concurrency;
import std.algorithm, std.container;
import core.bitop, core.time, core.memory;
import std.bitmanip;
import std.regex;
enum INF = long.... | D |
import std.algorithm, std.array, std.conv, std.range, std.stdio, std.string;
void main()
{
auto x = readln.chomp.to!int;
while (x.notPrime)
x += 1;
x.writeln;
}
bool notPrime(int x)
{
if (x < 4)
return x < 2;
int d = 2;
while (d*d <= x)
{
if (!(x % d)) return true;
... | D |
import std.stdio;
import std.string;
import std.array; // split
import std.conv; // to
import std.math;
void main()
{
string[] input = split(readln());
int x = to!int(input[0]);
int a = to!int(input[1]);
int b = to!int(input[2]);
if(abs(x - a) < abs(x - b)){
writeln("A");
} else {
... | D |
//dlang template---{{{
import std.stdio;
import std.conv;
import std.string;
import std.array;
import std.algorithm;
// MIT-License https://github.com/kurokoji/nephele
class Scanner
{
import std.stdio : File, stdin;
import std.conv : to;
import std.array : split;
import std.string;
import std.traits : isSome... | D |
/+ dub.sdl:
name "D"
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);
int n, m;
sc.read(n, m);
int[] perm;
sc.read(pe... | 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.array, std.range, std.string, std.conv, std.uni;
void main() {
auto s = readln.strip;
auto yy = s[0..2].to!int;
auto mm = s[2..$].to!int;
if (1 <= mm && mm <= 12) {
if (1 <= yy && yy <= 12) {
writeln("AMBIGUOUS");
} else {
w... | D |
import std.stdio, std.string, std.conv;
int main(string[] argv)
{
auto s = split(readln());
int x = to!int(s[0]), y = to!int(s[1]);
writeln(x * y, ' ', (x + y) * 2);
return 0;
} | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
import std.math;
void main()
{
auto s = readln.chomp;
auto hi = new int[](s.length + 1);
foreach (i, c; s)
hi[i + 1] = hi[i] + c.predSwitch('\\', -1, '_', 0, '/', 1);
auto maxH = hi.reduce!(max);
auto fs1 = hi.findSplitBefore([maxH]), hi... | D |
import std.stdio, std.string, std.conv;
void main()
{
auto n = readln.chomp;
if((n[0] == n[1] && n[1] == n[2])||(n[1] == n[2] && n[2] == n[3])){
writeln("Yes");
} else {
writeln("No");
}
} | 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;
alias Pair = Tuple!(int, "a", int, "b");
void main() {
... | D |
import std.stdio;
import std.conv;
import std.string;
import std.typecons;
import std.algorithm;
import std.array;
import std.range;
import std.math;
import std.regex : regex;
import std.container;
import std.bigint;
void main()
{
auto s = readln.chomp;
int a, z;
foreach (i, e; s) {
if (e == 'A') {
a ... | 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) {
int yi, mi, di;
scan(yi, mi, di);
writeln(mill(yi, mi, di));
}
}
int mill(i... | D |
import std.stdio;
import std.range;
import std.string;
import std.algorithm;
import std.conv;
void main() {
ulong x = readln.chomp.to!ulong;
(x/11*2 + (x%11 <= 6 ? 1 : 2) + (x%11 == 0 ? -1 : 0)).writeln;
} | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto q = readln.chomp.to!size_t;
foreach (_; q.iota) {
auto x = readln.chomp, xl = x.length;
auto y = readln.chomp, yl = y.length;
auto memo = new int[][](xl + 1, yl + 1);
foreach (i; 1..xl+1)
foreach (j; 1..yl+... | D |
import std.algorithm,
std.string,
std.range,
std.stdio,
std.conv;
bool chmin(T)(ref T a, T b) {
if (b < a) {
a = b;
return true;
} else {
return false;
}
}
void chChar(ref string base, size_t idx, char c) {
char[] tmp = base.to!(char[]);
tmp[idx] = c;
base = cast(st... | 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);
int cnt;
foreach (i ; 0 .. n) {
string s = readln.chomp;
if (s == "A") cnt++;
else {
i... | D |
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
void main() {
string s = readln.chomp;
writeln(s.startsWith("YAKI") ? "Yes" : "No");
}
void scan(T...)(ref T args) {
string[] line = readln.split;
foreach (ref arg;... | 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 |
void main(){
int[] input;
foreach(i; 0..3)input ~= _scan();
( (input[0]-input[1])%input[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(stri... | 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.conv, std.stdio;
import std.algorithm, std.array, std.range, std.string;
void main()
{
auto buf = readln.chomp.split.to!(ulong[]);
buf[0].solve(buf[1]).writeln;
}
ulong solve(in ulong a, in ulong b)
{
assert (a <= b);
if (a == b)
return a;
if (a.even && b.odd)
return (~(b... | 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 ab = readln.chomp.split().to!(long[]);
long a = ab[0];
long b = ab[1];
writeln(a * b - (a + b - 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() {
while (1) {
int n;
scan(n);
if (!n) return;
auto ans = cntp(n);
writeln(ans);
}
}
int cntp(int n) {
a... | 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 x = readln.chomp.split;
auto a = x[0].to!int;
auto b = x[2... | 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.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 S = readln.chomp;
auto cnt = ne... | D |
import std.stdio;
import std.uni;
import std.conv;
import std.container;
import std.functional;
import std.algorithm;
import std.array;
import std.typecons;
import std.range;
import std.numeric;
import std.traits;
void main(string[] args)
{
auto t = next!int;
foreach(tc; 0 .. t)
{
auto a = next!long;
... | D |
// Cheese-Cracker: cheese-cracker.github.io
void solve(){
long n = scan;
for(int i = 2; i < 2 + n; ++i){
write(i, " ");
}
writeln;
}
void main(){
long tests = scan; // Toggle!
while(tests--) solve;
}
/************** ***** That's All Folks! ***** **************/
impo... | 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 |
//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;
void main() {
auto n = readln.strip.to!int;
auto s = readln.strip[0 .. n];
auto psteps = (n - 11) >> 1;
auto t = s... | D |
import std.stdio;
import std.ascii;
import std.algorithm;
import core.stdc.stdio;
int main()
{
int t = readInt!int;
while (t--)
{
int n = readInt!int;
auto a = new int[](2 * n);
foreach(ref ai; a)
ai = readInt!int;
sort(a);
debug writeln(a);
auto ... | 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.array;
import std.conv;
import std.stdio;
import std.math;
void main() { readln.split[0].to!int.pow(2).writeln; }
| D |
void main(){
import std.stdio, std.string, std.conv, std.algorithm;
auto s=readln.chomp.to!(char[]);
if(s.count("AC")) writeln("Yes");
else writeln("No");
}
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, std.string, std.conv;
import std.range, std.algorithm;
import std.math :abs;
void main() {
int n;
scan(n);
int x, y, t;
foreach (i ; 0 .. n) {
int ti, xi, yi;
scan(ti, xi, yi);
int d = abs(xi - x) + abs(yi - y);
int e = ((x + y) % 2) ^ ((xi + yi) % ... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_r... | D |
import std.stdio, std.string, std.conv;
void main() {
writeln(3 * readln.chomp.to!int ^^ 2);
} | D |
import std.stdio, std.algorithm, std.string, std.range, std.array,std.conv;
void main() {
const tmp = readln.split.map!(to!int).array;
writeln(tmp[0] < tmp[1] ? 0:10);
} | D |
import std.stdio;
import std.conv;
import std.string;
import std.range;
void main(){
// input
int[] input;
input.length = 4;
foreach(ref i; input) {
i = to!int(readln().chomp());
}
immutable int five_hund = input[0];
immutable int hund = input[1];
immutable int fifty = input[2];
immutable int sum_num = in... | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readint = read!int;
alias readints = reads!int;
void main() {
auto ... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto abc = readln.split.to!(int[]);
auto A = abc[0];
auto B = abc[1];
auto C = abc[2];
writeln(max(0, C - A + B));
} | D |
import std.stdio, std.string, std.conv;
void main()
{
while(1){
auto n = readln.chomp.to!int;
int cnt;
if(n==0) break;
while(n!=1){
if(n%2==0)
n/=2;
else
n = n*3+1;
cnt++;
}
cnt.writeln;
}
} | D |
import std.stdio;
import std.string;
import std.conv;
int main()
{
int i = 0;
string str;
while ((str = readln().chomp()) != "0") {
i++;
writeln("Case ", i, ": ", str);
}
return 0;
} | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.numeric;
import std.stdio;
import std.string;
void main()
{
int n = to!int(readln().chomp());
int[] a = readln().split().map!(a => to!int(a)).array;
int m = int.min;
for (int l = 0; l < a.length; ++l)
{
for... | D |
import std;
void main(){
long a = readln.chomp.to!long - 1;
char[] ans;
while(a >= 0){
ans ~= 'a' + (a % 26);
a /= 26, a -= 1;
}
ans.reverse.writeln;
} | 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 S = readln.chomp;
auto whiteCount = new long[N+1];
auto blackCount = new long[N+1];
foreach (i; 0..N) {
whiteCount[i+1] = S[i] == '.' ? ... | 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 p = iota(n).map!(i =>... | 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 core.bitop;
import std.algorithm;
import std.array;
import std.conv;
import std.range;
import std.stdio;
import std.string;
immutable int mod = 10 ^^ 9 + 7;
immutable int limit = 1003;
void add (ref int a, int b)
{
a = (a + b) % mod;
}
void main ()
{
auto h = new int [limit];
h[1] = 0;
foreach (i; 2..limi... | 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 |
//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;
import std.random;
import std.datetime.systime : Clock;
class InputReader {
private:
ubyte[] p;
ubyte[] buffer;
si... | D |
import std.stdio;
import std.conv;
import std.string;
import std.algorithm;
void main() {
int n;
scanf("%d\n", &n);
auto hs = readln.chomp.split.to!(int[]);
int m = hs[0];
foreach(h; hs){
if (m - h > 1) {
write("No");
return;
}
m = max(m, h);
}
write("Yes");
}
| D |
import std.stdio;
import std.conv;
import std.string;
void main()
{
string s = readln().chomp;
int n = s.to!(int);
if (s[$ - 1] == '0' ||
s[$ - 1] == '2' ||
s[$ - 1] == '4' ||
s[$ - 1] == '6' ||
s[$ - 1] == '8' ) {
writeln(s);
} else {
writeln(n*2);
... | D |
import std.stdio, std.conv, std.string, std.math;
void main(){
auto ip = readln.split.to!(int[]);
if(ip[2] >= ip[0] && ip[2] <= ip[1]){
writeln("Yes");
} else {
writeln("No");
}
} | D |
import std.algorithm;
import std.array;
import std.conv;
import std.stdio;
import std.string;
import std.numeric;
void main(){
foreach(string line; lines(stdin))
writeln(patternN(line.parse!int));
}
int patternN(int N = 1)(int n){
static if(N == 4){
if(n >= 0 && n < 10)
return 1;
... | 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.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;
void times(alias pred)(int n) {
foreach(i; 0..n) pred();
}
auto ... | D |
import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); } bool DEBUG = 0;
void log(A ...)(lazy A a){ if(DEBUG) print(a); }
voi... | D |
void main(){
if(inelm() >= 30){
writeln("Yes");
}else{
writeln("No");
}
}
import std.stdio, std.conv, std.algorithm, std.numeric, std.string, std.math, std.range;
// 1要素のみの入力
T inelm(T= int)(){
return to!(T)( readln().chomp() );
}
// 1行に同一型の複数入力
T[] inln(T = int)(){
T[] ln;
foreach(string el... | 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 k = readln.chomp.to!int;
long sum;
foreach (int i; 1..k+... | D |
void main() {
import std.stdio, std.string, std.conv, std.algorithm;
int n;
rd(n);
for (int i = 0; i <= 100; i++) {
for (int j = 0; j <= 100; j++) {
if (i * 4 + j * 7 == n) {
writeln("Yes");
return;
}
}
}
writeln("No");
}
void rd(T...)(ref T x) {
import std.stdio : r... | D |
import std.stdio;
import std.string;
/+
const int LEFT = 0;
const int RIGHT = 1;
const int UP = 2;
const int DOWN = 3;
+/
enum {
LEFT,
RIGHT,
UP,
DOWN
}
void main()
{
string[9] kabe;
int x, y;
int direction;
foreach (i; 0..9) {
kabe[i] = readln().chomp;
kabe[i].l... | 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(){
int n = read... | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readint = read!int;
alias readints = reads!int;
void main() {
auto ... | D |
import std;
// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i]... | D |
import std.stdio, std.string, std.conv;
void main()
{
auto n = readln.split.to!(int[]), a = n[0], b = n[1];
int m;
if((a + b) % 2 == 0){
m = 0;
} else {
m = 1;
}
writeln((a + b) / 2 + m);
} | D |
import std.stdio, std.string, std.algorithm, std.conv;
int[] a;
void main(){
string[] s;
while (1) {
s = split(readln());
a = [];
foreach (i; s) a ~= to!int(i);
if (a[0] == 0) break;
writeln(solve(0, 0));
}
}
int solve(int p, int n){
if (n > 21) return 0;
if (p >= a.length) return n;
if (a[p] == 1) ... | D |
void main()
{
dchar[] c = rdDchar;
dchar[] d = rdDchar;
dchar[] e = c.dup;
dchar[] f = d.dup;
reverse(e);
reverse(f);
writeln(c == f && d == e ? "YES" : "NO");
}
enum long mod = 10L^^9 + 7;
enum long inf = 1L << 60;
enum double eps = 1.0e-9;
T rdElem(T = long)()
if (!is(T == struct))
{
... | 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() {
long m = readln.chomp.to!long;
long x, y;
foreach (i; 0 .. m) {
long[] tmp = readln.split.to!(long[]);
long d = tmp[0], c = tmp[1];
x += c, y += d * c;
}
writeln(x - 1 + (y - 1) / 9);
}
import std.stdio;
import std.string;
import std.array;
import std.conv;
i... | 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.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;
void main()
{
auto ip = readln.split.to!(int[]);
if(ip[1] == 100... | 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 b = readln.chomp;
if (b == "A") {
writeln("T");
} else... | 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;
if (N == 0) {
writeln(0);
return;
}
char[] r;
foreach (i; 0..40) {
if (N == 0) break;
if (abs(N) & (1<<i)) {
... | 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 times(alias fun)(int n) {
foreach(i... | 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() {
auto N = readln.chomp.to!int;
((1 + N) * N / 2).writeln;
}
| D |
import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv,
std.functional, std.math, std.numeric, std.range, std.stdio, std.string,
std.random, std.typecons, std.container;
ulong MAX = 1_000_100, MOD = 1_000_000_007, INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias lread(T = long) = (... | D |
import std.stdio,
std.range,
std.string,
std.conv,
std.math,
std.algorithm;
void main(){
int base = 100000;
real p = 1.05;
int n = readln.chomp.to!int;
n.iota.each!((e){
base *= p;
base += (base % 1000) ? 1000 - base % 1000 : 0;
});
writeln(base);
} | D |
void main()
{
long[] tmp = readln.split.to!(long[]);
long a = tmp[0], b = tmp[1];
if (a * b <= 0)
{
"Zero".writeln;
}
else if (a < 0 && b < 0 && (b - a) % 2 == 0)
{
"Negative".writeln;
}
else
{
"Positive".writeln;
}
}
import std.stdio;
import std.str... | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto str = readln.chomp.dup;
auto q = readln.chomp.to!size_t;
foreach (_; 0..q) {
auto rd = readln.split, cmd = rd[0];
auto a = rd[1].to!int, b = rd[2].to!int;
switch (cmd) {
case "print":
writeln(str[a..b+1])... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto ad = readln.split.to!(int[]);
auto a = ad[0];
auto b = ad[1];
auto c = ad[2];
auto d = ad[3];
writeln(abs(a-c) <= d || (abs(a-b) <= d && abs(b-c) <= d) ? "Yes" : "No");
} | D |
import std.stdio,
std.array,
std.conv,
std.string,
std.algorithm,
std.math;
void main(){
string s;
for(;;){
s=readln();
if(stdin.eof()) break;
int num = to!int(chomp(s));
int result = 0;
int[] nums = new int[num];
for(int i=0;i < num;++i) nums[i] = 1;
nums[0] = 0;
... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons;
void main()
{
auto N = readln.to!(wchar[]);
writeln(N[0] == '9' || N[1] == '9' ? "Yes" : "No");
} | D |
import std.stdio;
import std.string;
bool isK(C)(C[] a) {
if (a.length <= 1) return true;
size_t l = 0, r = a.length - 1;
while (l < r) {
if (a[l] != a[r]) {
return false;
}
++l;
--r;
}
return true;
}
void main() {
auto s = readln.chomp;
if (s.isK && s[0.. $ / 2].isK && s[$ / 2 + 1..$].isK) {
... | D |
import std.stdio, std.conv, std.array,std.string,std.algorithm;
void main()
{
auto n=readln.chomp.to!int;
long ans=1;
for(int i=1;i<=n;i++){
ans*=i;
ans%=1000000000+7;
}
writeln(ans);
} | 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 xs = readints;
long q = x... | D |
void main() {
int a = readln.chomp.to!int;
int b = readln.chomp.to!int;
int h = readln.chomp.to!int;
writeln((a + b) * h / 2);
}
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;
imp... | 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!int).array;
int ans = 0;
for (int i... | D |
import std.stdio, std.conv;
import std.array, std.algorithm, std.range;
void main()
{
immutable int[dchar] L = ['I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000];
foreach(w;stdin.byLine())
{
int s=0,t=0,c=0;
foreach(n;w.map!(a=>L[a])())
{
if(n==c) t+=c;
if(... | D |
import std.stdio, std.string, std.range, std.conv, std.array, std.algorithm, std.math, std.typecons;
void main() {
writeln(2^^cast(int)readln.chomp.to!int.log2);
}
| D |
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
void main() {
string s;
scan(s);
writeln(s[0 .. $ - 8]);
}
void scan(T...)(ref T args) {
string[] line = readln.split;
foreach (ref arg; args) {
arg = l... | 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 maxN = 10^^6;
int[] f, f_odd;
for(int n=1; ;n++) {
... | D |
import std.functional,
std.algorithm,
std.container,
std.typetuple,
std.typecons,
std.bigint,
std.string,
std.traits,
std.array,
std.range,
std.stdio,
std.conv;
void main()
{
auto ip = readln.split.to!(int[]);
if(ip[0] < ip[1] && ip[1] < ip[2... | 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, m; readV(n, m);
writeln((... | D |
import core.bitop, std.bitmanip;
import core.checkedint;
import std.algorithm, std.functional;
import std.array, std.container;
import std.bigint;
import std.conv;
import std.math, std.numeric;
import std.range, std.range.interfaces;
import std.stdio, std.string;
import std.typecons;
void main()
{
immutable int MD... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;
void main() {
int n, a;
scan(n);
scan(a);
if (n % 500 <= a) {
writeln("Yes");
}
else {
writeln("No");
}
}
void scan(T...)(ref T args) {
import std.stdio : readln;
import std.algo... | D |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.