code stringlengths 4 1.01M | language stringclasses 2
values |
|---|---|
import std.stdio, std.string, std.range, std.conv, std.array, std.algorithm, std.math, std.typecons, std.datetime;
void main() {
const S = readln.chomp;
auto d = Date.fromISOString(S.replace("/", ""));
if (d <= Date(2019, 4, 30)) {
writeln("Heisei");
} else {
writeln("TBD");
}
}
| D |
import std.stdio;
import std.conv;
import std.array;
import std.algorithm;
import std.range;
import std.string;
alias println = writeln;
alias print = write;
int readint() {
return readln.chomp.to!int;
}
void main() {
if (readint() == 1) {
println("Hello World");
} else {
println(readint() + readint());... | 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.stdio;
import std.conv;
import std.algorithm;
import std.range;
import std.string;
void main() {
while (true) {
auto input = readln.chomp.split.map!(to!int);
if (input.array == [0, 0]) break;
int h = input[0];
int w = input[1];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w... | 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 |
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.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 |
// 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;
string s;
void main() {
scan(s);
writeln(s[0] ~ (s.length.to!int - 2).to!string ~ s[$-1]);
}
void scan(T...)(ref ... | D |
import std.stdio, std.conv, std.string;
void main() {
auto ip = readln.split.to!(int[]);
if(ip[0] + ip[1] <= ip[1] + ip[2] && ip[0] + ip[1] <= ip[2] + ip[0]){
writeln(ip[0] + ip[1]);
} else if(ip[1] + ip[2] <= ip[0] + ip[1] && ip[1] + ip[2] <= ip[2] + ip[0]){
writeln(ip[1] + ip[2]);
} else {
writeln(ip[2] + ... | D |
void main() {
auto N = ri;
if(N < 1200) {
writeln("ABC");
} else if(N < 2800) {
writeln("ARC");
} else writeln("AGC");
}
// ===================================
import std.stdio;
import std.string;
import std.functional;
import std.conv;
import std.algorithm;
import std.range;
import std.traits;
import std.mat... | D |
import std.stdio;
void main(){
string s;
int[2] score;
while ((s = readln()) != "0\n") {
score = 0;
foreach (ch; s[1..$-1]) score[ch - 'A']++;
int t = score[0] > score[1] ? 0 : 1;
score[t]++;
writeln(score[0], " ", score[1]);
}
} | D |
import std.stdio;
import std.conv;
import std.string;
import std.algorithm;
import std.range;
import std.functional;
import std.math;
import core.bitop;
void main()
{
/// ABC089_D
string s = readln.chomp;
writeln((s.canFind('a') && s.canFind('b') && s.canFind('c')) ? "Yes" : "No");
}
| D |
void main(){
int k = _scan();
writeln((k/2)*((k+1)/2));
}
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... | D |
import core.thread;
import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex;
// Input
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { tokens = readln.split; if (stdin.eo... | 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.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
void main() {
auto s = readln.splitter;
auto a = s.front;
s.popFront();
auto b = s.front;
writeln(b, a);
}
| D |
// import chie template :) {{{
import std.stdio, std.algorithm, std.array, std.string, std.math, std.conv,
std.range, std.container, std.bigint, std.ascii, std.typecons;
// }}}
// nep.scanner {{{
class Scanner
{
import std.stdio : File, stdin;
import std.conv : to;
import std.array : split;
import ... | 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 |
import std.stdio, std.string, std.conv, std.range, std.algorithm;
void main() {
auto a = readln.chomp.to!int;
auto b = readln.chomp.to!int;
auto h = readln.chomp.to!int;
((a + b) * h / 2).writeln;
}
| D |
import std.stdio, std.range, std.conv, std.string, std.array, std.functional, std.math;
import std.algorithm.comparison, std.algorithm.iteration, std.algorithm.mutation, std.algorithm.searching, std.algorithm.setops, std.algorithm.sorting;
import std.container.binaryheap;
void main()
{
auto N = readln().strip.to!(... | D |
// import chie template :) {{{
import std.stdio, std.algorithm, std.array, std.string, std.math, std.conv,
std.range, std.container, std.bigint, std.ascii, std.typecons;
// }}}
// nep.scanner {{{
class Scanner
{
import std.stdio : File, stdin;
import std.conv : to;
import std.array : split;
import ... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto ii = readln.split.to!(long[]);
auto A = ii[0];
auto B = ii[1];
auto C = ii[2];
auto X = ii[3];
auto Y = ii[4];
writeln(min(
A*X + B*Y,
C*X*2 + max(0, (Y... | D |
import std.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.string;
bool solve (string s)
{
if (s.length % 2 != 0)
{
return false;
}
if (s.front == ')' || s.back == '(')
{
return false;
}
return true;
}
void main ()
{
auto tests = readln.strip.to !(int);
foreach (test; 0..tests)... | D |
import std.stdio, std.conv, std.string, std.math;
void main(){
auto ip = readln.chomp.to!int;
writeln(800 * ip - 200 * (ip / 15));
} | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.math;
bool isOk(long[] arr, size_t idx, long key) {
if (arr[idx] >= key) return true;
return false;
}
size_t binsearch(long[] arr, long key) {
long left = -1;
long right = arr.length;
while(right - left > 1) {
long mid = le... | 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!(int[]);
auto BS = readln.split.to!(int[]);
foreach (i; 1..N) {
AS[i] += AS[i-1];
BS[i] += BS[i-1];
}
int ... | 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 int INF = 1 << 29;
int[][] adj;
void main() {
auto N = readln.chomp.to!int;
int E = 0;
auto uf = n... | D |
// Cheese-Cracker: cheese-cracker.github.io
void theCode(){
int k = scan!int;
int j = 0;
for(int i = 1; i <= 3*k; ++i){
if(i % 3 == 0 || i % 10 == 3) continue;
++j;
if(j == k){
writeln(i);
}
}
}
void main(){
long tests = scan; // Toggle!
while... | D |
// cheese-cracker [2022-01-31]
void solve(){
long n = scan;
long ten = (n/10) % 10;
long d = n % 7;
long u = 7 - d;
long down = n - d;
long up = n + u;
long tend = (down / 10) % 10;
long tenu = (up / 10) % 10;
if(tend == ten){
writeln(down);
}else{
writeln(up);
... | D |
import core.stdc.stdio;
import std.algorithm;
static immutable int unSet=-114514;
struct Data{
int a,l,r,m;
}
Data Comb(const ref Data a,const ref Data b){
Data r;
r.a=a.a+b.a;
r.l=max(a.l,a.a+b.l);
r.r=max(a.r+b.a,b.r);
r.m=max(a.m,b.m,a.r+b.l);
return r;
}
struct Node{
Node* l,r,p;
int delay=unSet,size,v;... | 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 a, b;
scan(a, b);
auto d =... | D |
import std.stdio;
import std.string;
import std.conv;
import std.math;
int main() {
string buf = strip(readln());
while ((buf = strip(readln())) != null) {
writeln(is_right_triangle(buf));
}
return 0;
}
string is_right_triangle(string data_set) {
string[] sides = split(data_set);
int... | 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.conv, std.string;
import std.algorithm, std.array, std.container, std.typecons;
import std.numeric, std.math;
import core.bitop;
T RD(T = long)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.to!T; }
string RDR()() { return readln.cho... | D |
void main() {
auto S = readln.to!(char[]);
S[3] = '8';
S.writeln;
}
// ===================================
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.range;
import std.traits;
import std.math;
import std.container;
import std.bigint;
import std.numeric;
import std.conv;
... | D |
import std.stdio, std.string, std.conv, std.array, std.algorithm;
void main() {
int[][] field;
int[][] dp;
string line;
while (true) {
line = readln.chomp;
if (stdin.eof) break;
field ~= line.split(",").map!(to!(int)).array;
}
foreach(int i, f; field) dp ~= new int[](f.length);
int half = (f... | 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 K = readln.chomp.to!long;
long r = 1, k;
foreach (_; 0..10^^7+1) {
k = (k*10+7) % K;
if (k == 0) {
writeln(r);
return;
... | D |
import std.stdio, std.string, std.conv;
void main()
{
auto ip = readln.split, A = ip[0], B = ip[1], C = ip[2];
if(A == B){
writeln(C);
}
if(B == C){
writeln(A);
}
if(C == A){
writeln(B);
}
} | D |
import std;
alias sread = () => readln.chomp();
alias lread = () => readln.chomp.to!long();
alias aryread(T = long) = () => readln.split.to!(T[]);
void main()
{
string s;
scan(s);
// writeln(s);
foreach (i; 2 .. s.length)
{
// writeln(s[0 .. $ - i]);
auto ss = s[0 .. $ - i];
... | 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 K = scanElem;
char[] S = readln.strip.to!(char[]);
for(int i=0;... | D |
import std.stdio, std.string, std.range, std.conv, std.array, std.algorithm, std.math, std.typecons;
void main() {
const tmp = readln.split.to!(long[]);
const N = tmp[0], K = tmp[1];
writeln(2 * K - 1 <= N ? "YES" : "NO");
}
| D |
import std.stdio, std.string, std.conv, std.algorithm;
void main() {
int n = readln.chomp.to!int;
long[] a = readln.split.to!(long[]);
long[] b = readln.split.to!(long[]);
long monster;
foreach (i; 0 .. n) {
if (a[i] < b[i]) {
long c = min(a[i+1], b[i]-a[i]);
a[i+1] ... | 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.conv, std.array, std.string, std.math, std.typecons, std.numeric, std.container;
long P = 10^^9+7;
long[10^^5*5+50] F, RF;
long pow(long x, long n) {
long y = 1;
while (n) {
if (n%2 == 1) y = (y * x) % P;
x = x^^2 % P;
n /= 2;
}
return y;
}
... | 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 |
// 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;
string n;
void main() {
int n;
scan(n);
if (n / 100 == n % 10) {
writeln("Yes");
}
else {
... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_r... | D |
import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", ... | D |
import std.stdio,std.conv,std.string,std.algorithm;
void main(){
auto ab=readln().chomp().split().map!(to!int);
int a=ab[0],b=ab[1];
if(a%2==0 || b%2==0) writeln("Even");
else writeln("Odd");
} | 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.algorithm, std.range;
void main() {
auto a = readln.split[0].to!int;
auto s = readln.split[0];
if(a >= 3200) s.writeln; else "red".writeln;
} | D |
void main(){
import std.stdio, std.string, std.conv, std.algorithm;
long k, a, b; rd(k, a, b);
if(a>=k){writeln(1); return;}
auto d=a-b;
if(d<=0){writeln(-1); return;}
auto tmp=(k-a+d-1)/d;
writeln(tmp*2+1);
}
void rd(T...)(ref T x){
import std.stdio, std.string, std.conv;
auto l=readln.split;
as... | D |
/+ dub.sdl:
name "C"
dependency "dunkelheit" version="1.0.1"
+/
import std.stdio, std.algorithm, std.range, std.conv;
// import dkh.foundation, dkh.scanner, dkh.datastructure.segtree;
void solve(Scanner sc) {
int n, m;
sc.read(n, m);
int[] edges;
int[] used = new int[3 * n];
foreach (i; ... | 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 K = readln.chomp.to!(char[]);
auto D = readln.chomp.to!long;
auto DP1 = new long[][](2, D);
auto DP2 = new long[][](2, D);
foreach (i, c; K) {
if (i... | D |
import std.stdio, std.conv, std.string, std.algorithm, std.range;
void main()
{
while(true)
{
auto a = readln.split.map!(to!int), b = readln.split.map!(to!int);
if(a.length != 4) break;
auto hit = iota(4).map!(i => a[i] == b[i] ? 1 : 0).reduce!"a + b",
blow = a.map!(n => co... | D |
import std.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.string;
void main ()
{
foreach (test; 0..readln.strip.to !(int))
{
auto s = readln.strip;
auto x = readln.strip.to !(int);
auto n = s.length.to !(int);
auto w = new char [n];
w[] = '1';
foreach (i; 0..n)
{
if (s[i]... | D |
// AtCoder My Practice
// author: Leonardone @ NEETSDKASU
import std.stdio : readln, writeln;
import std.string : chomp;
import std.conv : to;
void main() {
auto n = readln.chomp.to!uint;
auto s1 = readln.chomp;
auto s2 = readln.chomp;
long ans, md = 1_000_000_007;
uint i, pat;
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()
{
auto s = readln.chomp;
auto a = "AKIHABARA";
int i;
auto f = ... | 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;
void main() {
int n = to!int(readln().strip());
int m = to!int(readln().strip());
int[20][20] g;
foreach(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;
int readint() {
return readln.chomp.to!int;
}
int[] readints() {
return readln.split.map!(to!int).array;
}
void main() {
int n = readint();
bool[strin... | D |
void main()
{
string s = rdStr;
long len = s.length;
long[] lists = new long[len];
auto g = s.group.array;
long cnt;
foreach (x; g)
{
long n = x[1].to!long;
cnt += n;
if (x[0] == 'R')
{
lists[cnt-1] += (n >> 1) + (n & 1);
lists[cnt] +=... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric, std.container, std.range;
long P = 10^^9+7;
long[10^^6*2+50] F, RF;
long pow(long x, long n) {
long y = 1;
while (n) {
if (n%2 == 1) y = (y * x) % P;
x = x^^2 % P;
n /= 2;
}
r... | 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;
enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;
void main() {
int H, N;
scan(H, N);
auto a = new int[](N);
auto b = n... | 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;
long calc(long a, long b, long[] h) {
// m 回で全ての魔物を倒せるか
bool check(long m) {
long k = 0;
foreach (e; h)... | D |
void main() {
auto X = ri;
if(X == 7 || X == 5 || X == 3) {
writeln("YES");
} else writeln("NO");
}
// ===================================
import std.stdio;
import std.string;
import std.functional;
import std.algorithm;
import std.range;
import std.traits;
import std.math;
import std.container;
import std.bigin... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric, std.container, std.range;
void get(Args...)(ref Args args)
{
import std.traits, std.meta, std.typecons;
static if (Args.length == 1) {
alias Arg = Args[0];
static if (isArray!Arg) {
... | 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 ab = readln.chomp.split.to!(int[]);
auto d = ab[1] - ab[0];
int sum;
forea... | D |
import std.stdio, std.string, std.range, std.conv, std.array, std.algorithm, std.math, std.typecons;
void main() {
auto S = readln.chomp;
iota(S.length-2).map!(i => S[i..i+3]).map!(s => abs(753-s.to!int)).reduce!min.writeln;
}
| 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 ip1 = readln.chomp;
auto ip2 = readln.chomp;
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;
long calc(int a, int[] ... | D |
void main()
{
long[] tmp = readln.split.to!(long[]);
long n = tmp[0], k = tmp[1];
long[] a = readln.split.to!(long[]);
long mod = 10 ^^ 9 + 7;
long[] l = new long[n], r = new long[n];
foreach (i; 0 .. n)
{
foreach (j; 0 .. n)
{
if (a[i] > a[j])
{
... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.math;
void main() {
int n, m;
scan(n, m);
auto cnt = new int[](n);
auto red = new bool[](n);
cnt[] = 1;
red[0] = 1;
foreach (i ; 0 .. m) {
int xi, yi;
scan(xi, yi);
xi--, yi--;
... | D |
import std.stdio;
import std.conv;
import std.algorithm;
import std.range;
import std.string;
void main() {
bool[][string] cards;
string[] suits = [ "S", "H", "C", "D" ];
foreach (suit; suits) {
cards[suit] = new bool[13];
}
readln;
foreach (string line; stdin.lines) {
auto card = line.chomp.spl... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons;
void main()
{
auto N = readln.chomp.to!int;
auto dx = readln.split.to!(int[]);
auto D = dx[0];
auto X = dx[1];
int[] AS;
AS.length = N;
foreach (i; 0..N) AS[i] = readln.chomp.to!int;
foreach (d; 0.... | D |
import std.algorithm;
import std.range;
import std.stdio;
import std.string;
immutable string vowels = "aeiou";
void main ()
{
string s;
while ((s = readln.strip) != "")
{
string [] res;
main_loop:
while (!s.empty)
{
foreach (i; 2..s.length)
{
if (!vowels.canFind (s[i - 2]) &&
!vowels.canFi... | D |
import std.stdio, std.string, std.array, std.conv;
void main() {
int n = readln.chomp.to!int;
int[] a = readln.chomp.split.to!(int[]);
a[] -= 1;
int[] b = readln.chomp.split.to!(int[]);
int[] c = readln.chomp.split.to!(int[]);
int prev = int.min, sum;
foreach (x; a) {
sum += b[x];
... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
for (;;) {
auto wh = readln.split.to!(int[]);
auto w = wh[0];
auto h = wh[1];
if (w == 0 && h == 0) return;
auto MAP = new int[][](h, w);
foreach (i;... | 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 |
void main()
{
long n, m;
rdVals(n, m);
long[] h = rdRow;
long[][] edge = new long[][](n);
foreach (i; 0 .. m)
{
long a, b;
rdVals(a, b);
--a, --b;
edge[a] ~= b, edge[b] ~= a;
}
long result;
foreach (i; 0 .. n)
{
bool ok = true;
fo... | D |
import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
import std.container;
alias sread = () => readln.chomp();
alias Point... | D |
import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); }
void log()(){ writeln(""); } void log(T, A ...)(T t, lazy A a){ if(DE... | D |
import std.stdio, std.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 = "%.15f";
static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_r... | D |
void main() {
problem();
}
void problem() {
auto X = scan!char;
string solve() {
return 'A' <= X && X <= 'Z' ? "A" : "a";
}
solve().writeln;
}
// ----------------------------------------------
import std.stdio, std.conv, std.array, std.string, std.algorithm, std.container, std.range, core.stdc.stdlib... | D |
import std.stdio, std.string, std.conv;
import std.array, std.algorithm, std.range;
import std.numeric;
void solve()
{
char['z'+1] t; t[' ']=' ';
auto s = readln().chomp();
foreach(a;1..26)
if(gcd(a,26)!=1) continue;
else
foreach(b;0..26)
{
foreach(i,... | 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 chie template :) {{{
import std.stdio, std.algorithm, std.array, std.string, std.math, std.conv,
std.range, std.container, std.bigint, std.ascii, std.typecons, std.format, std.bitmanip;
// }}}
// nep.scanner {{{
class Scanner {
import std.stdio : File, stdin;
import std.conv : to;
import std.array : ... | 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.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 calc(long[] a) {
long[long] freq;
foreach (x; a) freq[x]++;
long sum = 0;
foreach (v; freq.values) {
... | D |
import std.stdio, std.string, std.conv, std.algorithm;
void main() {
int[] tmp = readln.split.to!(int[]);
int p = tmp[0], q = tmp[1], r = tmp[2];
writeln(min(p+q, q+r, r+p));
} | D |
import std.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.string;
int solve (string s)
{
s = s.strip ('1');
if (s.empty)
{
return 0;
}
if (s.all !(q{a == '0'}))
{
return 1;
}
return 2;
}
void main ()
{
auto tests = readln.strip.to !(int);
foreach (test; 0..tests)
{
readln.... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(... | D |
import std.stdio, 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,std.algorithm;
void main(){
int inte;
int[] ins;
ins ~= to!int(chomp(readln()));
ins ~= to!int(chomp(readln()));
ins ~= to!int(chomp(readln()));
ins ~= to!int(chomp(readln()));
ins ~= to!int(chomp(readln()));
ins ~= to!int(chomp(readln()));
ins ~= to!int(chomp(readln()));... | D |
import std.stdio, std.conv, std.string, std.algorithm;
void main(){
auto a = readln.split.map!(to!int);
writeln(a[0]*a[1], " ", (a[0]+a[1])*2);
} | 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.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.string, std.range, std.conv, std.array, std.algorithm, std.math, std.typecons;
void main() {
auto N = readln.chomp.to!long;
auto a = readln.split.to!(long[]);
foreach (i; 1..N) {
a[i] += a[i-1];
}
auto s = a.back;
a[0..$-1].map!(a => abs(a * 2 - s)).reduce!mi... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.array;
void main(){
auto Q=readln.split.to!(int[]),A=Q[0],B=Q[1],C=Q[2],D=Q[3];
if(A*B>C*D)writeln(A*B);
else writeln(C*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.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.math;
void main() {
int n, q;
scan(n, q);
auto sd = SqrtDecomp(n);
foreach (_ ; 0 .. q) {
auto line = readln.split.to!(int[]);
if (line[0] == 0) {
sd.add(line[1] - 1, line[2]);
... | D |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.