code stringlengths 4 1.01M | language stringclasses 2
values |
|---|---|
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto S = readln.chomp.to!(char[]);
writeln(S[0] == S[1] || S[1] == S[2] || S[2] == S[3] ? "Bad" : "Good");
} | D |
void main()
{
int[] path = new int[4];
foreach (i; 0 .. 3)
{
int[] tmp = readln.split.to!(int[]);
int a = tmp[0] - 1, b = tmp[1] - 1;
++path[a], ++path[b];
}
writeln(path.all!"a < 3" ? "YES" : "NO");
}
import std.stdio;
import std.string;
import std.array;
import std.conv;... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;
enum inf = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;
void main() {
readln;
readln.chomp.count("ABC").writeln;
}
... | D |
void main(){
long n = _scan!long();
long[] a = _scanln!long();
long[long] dic;
bool fl = true;
foreach(i; 0..n){
if(dic.get(a[i], 0) == 0)dic[a[i]]++;
else{
writeln("NO");
return;
}
}
writeln("YES");
}
import std.stdio, std.conv, std.algorithm, std.numeric, std.string, std.math;
// 1要素のみの入力
T _scan... | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
version(unittest) {} else
void main()
{
string line;
while ((line = readln) !is null) {
auto rd = line.split.to!(int[]), a = rd[0], b = rd[1];
writeln((a + b).numDigits);
}
}
int numDigits(int n)
{
auto r = 1;
for (; n >= 10; n /= 10)... | 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.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(){
char c = _scan!char();
(c+1).to!char.writeln();
}
import std.stdio, std.conv, std.algorithm, std.numeric, std.string, std.math;
// 1要素のみの入力
T _scan(T= int)(){
return to!(T)( readln().chomp() );
}
// 1行に同一型の複数入力
T[] _scanln(T = int)(){
T[] ln;
foreach(string elm; readln().chomp().split()){
ln ~= e... | 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(){
import std.stdio, std.string, std.conv, std.algorithm;
int n; rd(n);
auto a=new int[](1_000_000);
foreach(_; 0..n){
int l, r; rd(l, r);
a[l-1]++; a[r]--;
}
foreach(i; 1..a.length){
a[i]+=a[i-1];
}
int c=0;
foreach(e; a)if(e>0) c++;
writeln(c);
}
void rd(T...)(ref T x){
... | D |
import std.algorithm;
import std.array;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
int[string] h;
void f (int dx) {
int n = readln.strip.to! (int);
foreach (i; 0 .. n) {
string s = readln.strip();
if (s in h) {
h[s] = h[s] + dx;
} else {
h[s] =... | 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;
import std.algorithm;
import std.string;
import std.functional;
import std.array;
import std.conv;
import std.math;
void main(){
while(true){
int n,m;
auto s = split(readln()).to!(int[]);
n = s[0];
m = s[1];
if(n==0&&m==0) break;
int count;
int d;
int i = -1;
bool[1001] al;
for(int j=0;... | D |
import std.stdio;
import std.conv;
import std.string;
void main()
{
auto n =(readln.strip.split);
while( n[1] != "?" ) {
int a = to!int(n[0]),c = to!int(n[2]);
switch(n[1]) {
case "+":
writeln(a+c);
break;
case "-":
writeln(a-c);
... | 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.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()
{
string s; readV(s);
int w; readV... | 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(){
int n = readln.chomp.to!int;
int[] as = readln.chomp.split.map!(to!int).map!(x => x - 1).array;
int count = 0;
foreach(i, a; as){
if(i < a && as[a] ==... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
uint[10^^5] AS;
long[10^^5] BS;
void main()
{
auto nk = readln.split;
auto N = nk[0].to!int;
auto K = nk[1].to!uint;
foreach (i; 0..N) {
auto ab = readln.split;
AS[i] = ab[0].to!uint... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
int[10^^5*2] BS, WS;
void main()
{
auto N = readln.chomp.to!int;
auto S = readln.chomp;
foreach (i, c; S) {
if (i) {
BS[i] = BS[i-1];
WS[i] = WS[i-1];
}
if... | D |
import std.stdio;
import std.conv;
import std.array;
import std.string;
void main()
{
int[] a;
int n = to!(int)(chomp(readln()));
string[] input = split(readln());
a.length = n;
for (int i = 0; i < n; i++) {
a[i] = to!(int)(input[i]);
}
for (int i = n - 1; i >= 0; i--) {
write(a[i]);
if (i ... | D |
import std;
alias sread = () => readln.chomp();
alias lread = () => readln.chomp.to!long();
alias aryread(T = long) = () => readln.split.to!(T[]);
//aryread!string();
//auto PS = new Tuple!(long,string)[](M);
//x[]=1;でlong[]全要素1に初期化
void main()
{
long a, b, c, d;
scan(a, b, c, d);
long lcm = c * d / gcd(c,... | D |
void main(){
import std.stdio, std.string, std.conv, std.algorithm;
auto s=readln.chomp.to!(char[]);
bool[char] map;
foreach(c; s){
if(c in map){
writeln("no");
return;
}else{
map[c]=true;
}
}
writeln("yes");
}
void rd(T...)(ref T x){
import std.stdio, std.string, std.con... | D |
import std.stdio;
import std.conv;
import std.string;
void main()
{
string[] buf;
int a,b;
buf = split(readln());
a = to!(int)(buf[0]);
b = to!(int)(buf[1]);
if(a<b)
writeln("a < b");
else if(a>b)
writeln("a > b");
else
writeln("a == b");
} | 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.conv,std.string,std.algorithm;
void main()
{
int[5000] dp;
while(true)
{
int n=readln.chomp.to!int;
if(!n) break;
int ans=int.min;
foreach(i;0..n)
{
int a=readln.chomp.to!int;
if(!i) dp[i]=a;
else dp[i]=max(dp[... | 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 = N.iota.map!(_ => readln.chomp.to!long).array;
if (A[0] != 0)... | D |
import std.stdio, std.conv, std.string, std.range, std.algorithm, std.array,
std.functional, std.container, std.typecons;
void main() {
int N = readln.split[0].to!int;
int[] A = new int[N];
foreach(ref a; A) {
a = readln.split[0].to!int;
}
int top = A.reduce!max;
int second = 0;
int maxcnt = 0;
... | D |
void main(){
int[] val = _scanln();
foreach(elm; val){
if( count(val, elm)==2 ){
writeln("Yes");
return;
}
}
writeln("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 =... | D |
import std.stdio, std.conv, std.string, std.algorithm;
void main()
{
auto ip = readln.split.to!(int[]);
auto x = 0;
if(ip[0] <= ip[1]){
x += ip[0];
} else {
x += ip[0] - 1;
}
writeln(x);
} | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric, std.bigint;
void main()
{
auto N = readln.chomp.to!int;
writeln(N/2 - (N%2 == 0 ? 1 : 0));
} | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto n = readln.chomp.to!size_t;
auto fi = new int[](45);
fi[0] = fi[1] = 1;
foreach (i; 2..n+1)
fi[i] = fi[i-1] + fi[i-2];
writeln(fi[n]);
} | D |
import std.stdio;
import std.algorithm;
import std.array;
import std.conv;
import std.datetime;
import std.numeric;
import std.math;
import std.string;
string my_readln() { return chomp(readln()); }
void main()
{
//auto tokens = split(my_readln());
string S = my_readln();
string S2 = "keyence";
bool ans = false;... | D |
void main() {
string s = readln.chomp;
string t;
foreach (x; s) {
if (x == 'B') {
if (!t.empty) t.popBack;
} else {
t ~= x;
}
}
t.writeln;
}
import std.stdio;
import std.string;
import std.array;
import std.conv;
import std.algorithm;
import std.range... | 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;
writeln(N-K+1);
}
long gcd(long a, long b)
{
if... | 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;
import std.ascii;
void main() {
int n;
scan(n);
foreach (i ; 0 .. n) {
string s1,s2;
scan(s1, s2);
writeln(i2m(m2i(s1) + m2i(s2)));
... | D |
import std.stdio, std.conv, std.array, std.string, std.algorithm, std.container, std.range, core.stdc.stdlib, std.math, std.typecons;
T[][] combinations(T)(T[] s, in int m) { if (!m) return [[]]; if (s.empty) return []; return s[1 .. $].combinations(m - 1).map!(x => s[0] ~ x).array ~ s[1 .. $].combinations(m); }
... | D |
import std.stdio;
import core.stdc.stdio;
import std.algorithm;
struct cube{
int x1;
int x2;
int y1;
int y2;
int z1;
int z2;
}
int find(int[] d,int t){
for(int i=0;i<d.length;i++)
if(d[i] == t)
return i;
return -1;
}
void main(){
int n,k;
int[] xs,ys,zs;
cube[] cs;
scanf("%d%d",&n,&k);
xs = new int... | 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.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric, std.container, std.range;
void main()
{
auto S = readln.chomp;
auto N = S.length;
int k = int.max;
char last;
foreach (i, c; S) {
if (c != last) {
if (i) {
k = ... | 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.string, std.conv, std.algorithm, std.array;
void main(){
auto a = readln.split.map!(to!int);
auto w = a[0];
auto h = a[1];
auto x = a[2];
auto y = a[3];
auto r = a[4];
if(w>=x+r && 0<=x-r && h>=y+r && 0<=y-r)
writeln("Yes");
else
writeln("No");
} | D |
import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;
void readV(T...)(ref T t){auto r=readln.splitter;foreach(ref v;t){v=r.front.to!(typeof(v));r.popFront;}}
void readA(T)(size_t n,ref T[]t){t=new T[](n);auto r=readln.splitter;foreach(ref v;t){v=r.front.to!T;r.popFro... | D |
import std.stdio;
import std.conv;
import std.array;
void main(){
string[] input = readln.split;
int N = input[0].to!int;
int M = input[1].to!int;
if(N == 1){
write(readln.split[0]);
}
else{
int[] A = new int[M];
int K;
int ij;
for(int i = 0;i < N;i++){
input = readln.split;
K = input[0].to!int;... | 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.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 |
/+ dub.sdl:
name "A"
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);
int k;
sc.read(k); k *= 2;
if (k == 0) {
writeln("miku");
return 0;
}
... | D |
void main() {
dchar[] s = readln.chomp.to!(dchar[]);
long a = s.countUntil('A');
reverse(s);
long z = s.countUntil('Z');
writeln(s.length - z - a);
}
import std.stdio;
import std.string;
import std.array;
import std.conv;
import std.algorithm;
import std.range;
import std.math;
import std.numeric;
... | 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;
int n;
void main() {
while (true) {
scan(n);
if (n == 0) break;
writeln(solve(n));
}
}
in... | 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(){
import std.stdio, std.string, std.conv, std.algorithm;
auto s=readln.chomp.to!(char[]);
auto t=readln.chomp.to!(char[]);
if(s.length<t.length){writeln("UNRESTORABLE"); return;}
auto mn=new char[](s.length);
foreach(ref e; mn) e='z';
bool none=true;
for(auto i=0; i<=s.length-t.length; i... | D |
module app;
import std.stdio;
import std.string;
void main()
{
auto abc = readln().strip();
if (abc == "5 5 7" || abc == "5 7 5" || abc == "7 5 5")
write("YES");
else
write("NO");
}
| D |
import std.stdio, std.string;
void main() {
string a = readln.chomp;
if (a[0..4] == "YAKI") { writeln("Yes"); }
else { writeln("No"); }
}
| D |
import std.stdio;
import std.algorithm;
import std.array;
import std.conv;
import std.datetime;
import std.numeric;
import std.math;
import std.string;
string my_readln() { return chomp(readln()); }
void main()
{
auto tokens = my_readln().split();
auto s = tokens[0].to!uint;
auto used = new uint[](1000000);
use... | D |
import std.stdio,std.conv,std.string,std.algorithm,std.array;
void main(){
auto sx=readln().split();
auto sa=readln().split();
auto sb=readln().split();
int x,a,b;
x=to!int(sx[0]);
a=to!int(sa[0]);
b=to!int(sb[0]);
writeln((x-a)%b);
} | 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.string, std.range, std.algorithm, std.array,
std.functional, std.container, std.typecons;
void main() {
auto input = readln.split.to!(int[]);
int A = input[0], B = input[1];
writeln(max(A-B-B, 0));
}
| D |
import std.stdio;
import std.string;
import std.math;
import std.conv;
import std.algorithm;
import std.bigint;
void main(){
while(true){
string input = readln();
if(stdin.eof()) break;
auto s = to!real(chomp(input));
for(int i=1;;i++){
if(s*s < 19.6 * (5*i-5)) {
writeln(i);
break;
}
}
}
} | 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 |
import std.stdio;
import std.conv;
import std.algorithm;
import std.string;
void main(){
while(1){
auto a=map!(to!int)(readln.chomp.split);
int m=a[0],f=a[1],r=a[2];
if(m<0&&f<0&&r<0)break;
if(m<0||f<0)writeln("F");
else if(80<=m+f)writeln("A");
else if(65<=m+f)writeln("B");
else if(50<=m+f)write... | D |
import std.stdio;
import std.conv;
import std.algorithm;
import std.range;
import std.string;
import std.math;
void main() {
int taro, hanako;
readln;
foreach (string line; stdin.lines) {
auto words = line.chomp.split;
if (words[0] > words[1]) {
taro += 3;
} else if (words[0] < words[1]) {
... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.typecons;
import std.numeric, std.math;
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_rd[0]; s_rd.popFront; re... | 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.string, std.conv, std.algorithm, std.numeric;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
int[] di = [1,0,-1,0,1,1,-1,-1], dj = [0,1,0,-1,1,-1,1,-1];
int ans;
void main() {
while (1) {
int n;
scan(n);
if (!n) return;
auto ... | D |
import std.stdio, std.string, std.array, std.conv, std.algorithm.iteration, std.functional;
void main()
{
auto _x = readln;
auto s = readln.chomp;
int x, max;
foreach (c; s) {
switch (c) {
case 'I':
if (++x > max) max = x;
break;
case 'D':... | D |
import std;
alias sread = () => readln.chomp();
alias lread = () => readln.chomp.to!long();
alias aryread(T = long) = () => readln.split.to!(T[]);
void main()
{
long n = lread();
// writeln(n);
auto l = new long[](100);
l[0] = 2;
l[1] = 1;
// writeln(l);
foreach (i; 2 .. n + 1)
{
... | 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];
foreach (i; 1 .. n) {
if (s[i-1] > s[... | D |
import std.algorithm;
import std.array;
import std.bigint;
import std.conv;
import std.exception;
import std.math;
import std.numeric;
import std.random;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
import core.bitop;
immutable int NA = -1;
immutable string A = "ABCDEFGHIJKLMNOPQRSTUVWXY... | D |
// cheese-cracker [2022-02-06]
void solve(){
long n = scan;
long k = scan;
if(k == 1 || (n % 2 == 0)){
writeln("YES");
}else{
writeln("NO");
return;
}
long m = n * k;
long x = 1;
for(int i = 0; i < n; ++i){
for(int j = 0; j < k; ++j){
write(x... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(... | D |
import std.stdio;
import std.algorithm;
void main() {
int n;
scanf("%d", &n);
int a, cnt1, cnt0;
for (int i = 0; i < n; ++i) {
scanf("%d", &a);
if (a & 1) ++cnt1;
else ++cnt0;
}
int ans = min(cnt0, cnt1);
cnt1 -= ans;
ans += cnt1 / 3;
printf("%d", ans);
} | D |
import std.stdio, std.string, std.algorithm;
void main() {
immutable s1 = readln.chomp;
immutable s2 = readln.chomp;
int[][] dp = new int[][](s1.length+1, s2.length+1);
for( int i=0; i<=s1.length; ++i ) dp[i][0] = i;
for( int i=0; i<=s2.length; ++i ) dp[0][i] = i;
for( int i=1; i<=s1.l... | D |
import std.conv,std.stdio,std.math,std.string;void main(){readln.chomp.to!int.pow(2).writeln;} | 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.canFind("AC") ? "Yes" : "No");
}
void scan(T...)(ref T args) {
string[] line = readln.split;
foreach (ref arg; args)... | 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 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 route... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons;
void main()
{
auto x_y = readln.to!(wchar[]);
writeln(x_y[0] > x_y[2] ? ">" : x_y[0] < x_y[2] ? "<" : "=");
} | D |
import std.stdio, std.conv, std.string, std.bigint;
import std.math, std.random, std.datetime;
import std.array, std.range, std.algorithm, std.container, std.format;
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
const long mod = 1_000_000_0... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto H = readln.chomp.to!long;
long d, x = 1;
while (H) {
d += x;
x *= 2;
H /= 2;
}
writeln(d);
} | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
for (;;) {
auto rd = readln.split.map!(to!int), m = rd[0], f = rd[1], r = rd[2];
if (m == -1 && f == -1 && r == -1) break;
if (m == -1 || f == -1)
writeln("F");
else if (m + f >= 80)
writeln("A");
else if... | 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 |
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 a, b;
scan(a, b);
auto ans = a * (a - 1) / 2 + b * (b ... | 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 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(){
import std.stdio, std.string, std.conv, std.algorithm;
import std.typecons;
int n; rd(n);
int m; rd(m);
auto lose=new int[](n), g=new int[][](n);
foreach(i; 0..m){
int a, b; rd(a, b);
g[a-1]~=(b-1);
lose[b-1]++;
}
bool multi=false;
auto used=new bool[](n);
foreach(_; 0..n... | D |
import std.stdio, std.conv, std.string, std.range, std.array, std.algorithm;
void main()
{
int n = readln().chomp().to!int;
string minS = readln().chomp();
for (int i = 0; i < n - 1; i++){
string dic = readln().chomp();
if (dic < minS){
minS = dic;
}
}
writeln(minS);
} | 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;
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;
import std.conv;
import std.string;
void main()
{
string s = readln().chomp;
if (s[$ - 1] == '0' ||
s[$ - 1] == '2' ||
s[$ - 1] == '4' ||
s[$ - 1] == '6' ||
s[$ - 1] == '8' ) {
writeln(s);
} else {
writeln(s.to!(int) * 2);
}
}
| D |
import std.stdio, std.string, std.range, std.algorithm, std.math, std.typecons, std.conv;
void main() {
auto a = readln.split.to!(int[]);
((a[0] <= a[2] && a[2] <= a[1]) ? "Yes" : "No").writeln;
}
| 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.algorithm;
import std.array;
import std.ascii;
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 log(A...)(A arg) { stderr.writeln(arg); }
int size(T)(in T s) { return cast(int)s.length; }
void main() ... | D |
import std.stdio;
import std.conv;
import std.array;
import std.math;
import std.algorithm;
import std.string;
public int gcd(int m, int n)
{
if ((m == 0) || (n == 0)) return 0;
while (m != n)
{
if (m > n) m = m - n;
else n = n - m;
}
return m;
}
public int lcm(int m, int n)
{
if ((m == 0) || (n == 0)) re... | 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
{
string s;
}
void parseInput(T)(out Input input, T file)
{
with (file) with (input)
{
s = readln().strip();
}
}
struct Output
{
}
auto main2(Input* in... | 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() {
string s;
scan(s);
int n = s.length.to!int;
if (n % 2)... | 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() {
string s;
scan(s);
foreach (i ; 0 .. s.length) {
if (i & 1 ^ 1) {
write(s[i]);
}
}
writeln();
}
void scan... | 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.algorithm, std.range, std.conv, std.string, std.math, std.container, std.typecons;
import core.stdc.stdio;
// foreach, foreach_reverse, writeln
void main() {
int L;
scanf("%d", &L);
int n = 20, m = (n-2)*2;
int l = L;
foreach (i; 0..n) {
m += l&1;
if (i == n-1) m += l&1;
l >>= 1;
}
w... | 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;
void main() {
auto N = readln.chomp.to!int;
auto A = N.iota.map!(_ => readln.chomp.to!int).array;
auto dp = new bool[][](N+1, 1... | D |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.