code stringlengths 4 1.01M | language stringclasses 2
values |
|---|---|
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 x = readln.chomp.split.to!(int[]);
if (x[0] > 8 || x[1] > 8) {
writeln(":(... | 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 s = readln.chomp;
auto p = ["dreamer", "dream", "eraser", ... | D |
void main()
{
string s = rdStr;
string now;
string bef;
long cnt;
foreach (x; s)
{
now ~= x;
if (now != bef)
{
bef = now;
now = "";
++cnt;
}
}
cnt.writeln;
}
T rdElem(T = long)()
{
//import std.stdio : readln;
... | 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;
int r;
foreach (i; 0..1000) {
auto a = i/100;
auto b = (i/10)%10;
auto c = i%10;
int d;
fore... | D |
import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;
void scan(T...)(ref T args) {
import std.stdio : readln;
import std.algorithm : splitter;
import std.conv : to;
import std.range.primiti... | D |
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; readV(n);
if (n == 1) {
... | D |
import std;
alias sread = () => readln.chomp();
alias lread = () => readln.chomp.to!long();
alias aryread(T = long) = () => readln.split.to!(T[]);
//aryread!string();
void main()
{
auto x = lread();
if ((400 <= x) && (x <= 599))
{
writeln(8);
}
else if ((600 <= x) && (x <= 799))
{
... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto X = readln.chomp.to!int;
auto DP = new int[][](6, 10^^5+1);
int solve(int i, int x) {
if (i == 6) return x == 0 ? 1 : -1;
if (DP[i][x] != 0) return DP[i][x];
int... | D |
import std.stdio,std.string,std.conv;
int main()
{
string s;
int count_1 = 0,count_2 = 0;
while((s = readln.chomp).length != 0)
{
string[] _s = s.split(",");
int len1 = _s[0].to!int;
int len2 = _s[1].to!int;
int len3 = _s[2].to!int;
if(len3*len3 == len1*len1 + len2*len2) count_1++;
if(len1 == len2) co... | 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 readC(T...)(size_t n,ref T t){foreach(ref v;t)v=new typeof(v)(n);foreach(i;0..n){auto r=readln.splitter;... | D |
import std.stdio,std.conv,std.string,std.math;
void main(){
double money = 100000;
while(true){
char[] buf;
stdin.readln(buf);
double x = buf.chomp().to!double();
if(0 <= x && x <= 100){
for(int i = 0;i < x;i++){
money *= 1.05;
if(mone... | D |
import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;
void scan(T...)(ref T args) {
import std.stdio : readln;
import std.algorithm : splitter;
import std.conv : to;
import std.range.primiti... | D |
import std.stdio, std.string,std.range, std.conv, std.array, std.algorithm, std.math, std.typecons, std.functional, std.bigint, std.random;
void main() {
auto S = readln.chomp;
if (S[0] == S[1]) {
writeln("1 2");
return;
}
foreach (i; 0..S.length-2) {
if (S[i] == S[i+1] || S[i+1] == S[i+2] || S[i+2... | D |
import std.algorithm, std.conv, std.range, 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!(ElementType!T);r.popFront;}}
void readM(T...)(size_... | 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;
enum mod = 1_000_000_007L;
void main() {
int N, tk, ao;
scan(N, tk, ao);
... | D |
import std.stdio, std.string, std.conv;
enum N = 110000;
enum M = 10000;
immutable hurui = {
bool[N + 1] table;
table[] = true;
table[0 .. 2] = false;
for(int i = 2; i * i <= N; ++i)
{
if(table[i])
{
for(int j = 2; i * j <= N; j++)
{
table[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() {
const int N = 1_000_000;
auto tab = new bool[N];
... | D |
import std.stdio;
import std.string;
import std.conv;
void main()
{
auto N = chomp(readln());
writeln((N[0] == '9' || N[1] == '9') ? "Yes" : "No");
} | D |
import std.stdio,std.string,std.array,std.algorithm,std.range,std.conv;
int main(){
auto s=readln.chomp;
auto n=s.length;
if(s==s.rev){
auto s1=s.dup[0..(n-1)/2];
if(s1==s1.rev){
auto s2=s.dup[(n+3)/2-1..$];
if(s2==s2.rev){
"Yes".writeln;
... | 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 mod = 998244353;
void main() {
long n, a, b, k;
scan(n, a, b, k);
auto fact = new long[](n + 1);
fact[0] = 1;
foreach (i ; 1 .. n + 1) {
... | D |
import std.stdio;
import std.algorithm;
import std.string;
import std.conv;
import std.math;
void main(){
while(true){
auto s = readln();
if(stdin.eof()) break;
s = chomp(s);
int ans = 0;
for(int i=0;i<s.length;i++){
char c = s[i];
int n1,n2;
if(c == 'I') n1 = 1;
else if (c=='V') n1 = 5;
... | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto n = readln.chomp.to!int;
writeln(0.bitSet(n.bsr));
}
pragma(inline) {
pure bool bitTest(T)(T n, size_t i) { return (n & (T(1) << i)) != 0; }
pure T bitSet(T)(T n, size_t i) { return n | (T(1) << i); }
pure T bitReset(T)(T n... | D |
import std.stdio;
import std.string;
import std.conv;
import std.typecons;
import std.algorithm;
import std.functional;
import std.bigint;
import std.numeric;
import std.array;
import std.math;
import std.range;
import std.container;
void main() {
int maxN = 10^^6;
int[] f, f_odd;
for(int n=1; ;n++) {
... | D |
import std.stdio, std.string, std.algorithm, std.conv;
void main(){
auto a = readln.split.map!(to!int);
writeln(a[0]<a[1]&&a[1]<a[2] ? "Yes" : "No");
} | 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,
std.algorithm;
void main(){
int count = readln().chomp.to!int;
string[] lines;
foreach(i; 0..count){
lines.length++;
lines[i] = readln().chomp;
}
foreach(line; lines){
auto num = line.split.map!(to!int);
int d;
foreach(n1; num... | D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math;
void main()
{
auto N = readln.chomp.to!int;
auto A = readln.chomp.to!int;
writeln(N % 500 <= A ? "Yes" : "No");
} | D |
import std.algorithm, std.conv, std.range, std.stdio, std.string;
void main()
{
auto s = readln.chomp;
writeln(s.length/2 - s.count('p'));
}
| D |
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;
void main()
{
auto S = readln.chomp;
auto T = readln.chomp;
writeln(T[0..S.length] == S ? "Yes" : "No");
} | D |
void main() {
import std.stdio, std.string, std.conv, std.algorithm;
auto s = readln.chomp.to!(char[]);
auto t = readln.chomp.to!(char[]);
int[char] f1, f2;
foreach (c; s) {
if (c in f1)
f1[c]++;
else
f1[c] = 1;
}
foreach (c; t) {
if (c in f2)
f2[c]++;
else
f2[c] ... | 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;
static import std.ascii;
// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] aryread(T = long)(){return r... | D |
/+ dub.sdl:
name "sol_ysp"
dependency "dunkelheit" version="1.0.1"
+/
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);
string s;
sc.read(s);
s ~= "A";
long ans, ... | 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;
static import std.ascii;
// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] aryread(T = long)(){return r... | 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 |
// 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.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.algorithm, std.conv, std.array, std.string;
void main()
{
auto line = readln.chomp;
auto enil = line.dup;
reverse(enil);
writeln(line == enil ? "Yes" : "No");
} | D |
import std.stdio, std.string, std.conv, std.algorithm;
void main()
{
while(1){
auto n = readln.chomp.to!int;
if(n==0) break;
int s=1;
int max=50000001;
for(int i=2;i<n/2;++i){
if(n%i==0){
if(i<max){
s+=(i+n/i);
max = n/i;
if(i==max)
s -= i;
}else break;
... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;
import std.math;
void main() {
auto cnt = new int[](5);
int n;
scan(n);
foreach (i ; 0 .. n) {
string s;
scan(s);
switch (s[0]) {
case 'M':
cnt[0]++;
break;
... | D |
import std.stdio, std.algorithm, std.array, std.string, std.conv;
void main()
{
int t;
scanf("%d", &t);
foreach(_; 0..t)
{
int str_len;
scanf("%d", &str_len);
getchar();
auto str = readln.strip();
// writeln(str);
uint[] arr = new uint[str_len];
... | 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(){
long n = rea... | 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() {
auto s = readln.chomp.to!(char[]);
long ans;
while (!s.empty) {
if (s.length == 1) break;
if (s.front == s.back) {
s.popFront()... | D |
module bbb;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 s = readln.split.map!(to!int);
auto Ga = s[0];
auto Sa = s[1];
... | D |
void main() {
auto N = ri;
auto S = rs;
ulong res;
foreach(i; 0..S.length - 2) {
if(S[i..i+3] == "ABC") res++;
}
res.writeln;
}
// ===================================
import std.stdio;
import std.string;
import std.functional;
import std.algorithm;
import std.range;
import std.traits;
import std.math;
import ... | 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.string; // chomp????????????????????????(?????????????????????)
import std.conv; // to????????????????????????
import std.array; // split?????????????????????
import std.algorithm; // map?????????????????????
void main() {
auto input = readln.split.map!(... | 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.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 n = readln.chomp.to!int;
auto s = readln.chomp.array;
foreach (ref e; s) ... | D |
import std.stdio;
import std.algorithm;
import std.math;
import std.conv;
import std.string;
T readNum(T)(){
return readStr.to!T;
}
T[] readNums(T)(){
return readStr.split.to!(T[]);
}
string readStr(){
return readln.chomp;
}
void main(){
auto t = readStr;
auto s = t.replace("?", "D");
writeln(s);
}
| D |
void main() {
int x = readln.chomp.to!int;
writeln(x == 7 || x == 5 || x == 3 ? "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.container;
import std.typecons; | 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 (true) {
int n, a, b;
scan(n,a,b);
if (!n) return;
auto p = iota(n).map!(i => readln.chomp.to!int).array;
s... | D |
import std.stdio, std.conv, std.string, std.array, std.math, std.regex, std.range, std.ascii;
import std.typecons, std.functional;
import std.algorithm, std.container;
void main()
{
int N = scanElem!int;
int M = scanElem!int;
int[] nList;
nList.length = N + 1;
foreach(i;0..M)
{
int s = ... | D |
void main(){
char[] val = inln!char();
writeln( (val[0]=='H')^(val[1]=='H')?'D':'H');
}
import std.stdio, std.conv, std.algorithm, std.numeric, std.string, std.math, std.range;
const long mod = 10^^9+7;
// 1要素のみの入力
T inelm(T= int)(){
return to!(T)( readln().chomp() );
}
// 1行に同一型の複数入力
T[] inln(T = ... | D |
void main(){
import std.stdio, std.string, std.conv, std.algorithm;
// int n=6, m=10;
// auto c=new int[][](n, m);
// auto dir=[[-1, -1], [-1, 0], [-1, 1], [0, 1], [1, 1], [1, 0], [1, -1], [0, -1]];
// foreach(i; 0..n)foreach(j; 0..m){
// c[i][j]^=1;
// foreach(d; dir){
// auto ni=i+d[0], nj=j+... | D |
import std.stdio, std.array, std.string, std.conv, std.algorithm;
int H, W;
auto dy = [0, 0, 1, -1], dx = [1, -1, 0, 0];
char[][] board;
void main(){
for(;init;){
writeln(solve);
}
}
bool init(){
auto input = map!(to!int)(readln.chomp.split);
H = input[0];
W = input[1];
board = new char[][](H);
foreach(re... | D |
// Vicfred
// https://atcoder.jp/contests/abc165/tasks/abc165_b
// simulation
import std.conv;
import std.stdio;
import std.string;
void main() {
long x = readln.chomp.to!long;
long current = 100;
long answer = 0;
while(current < x) {
current += current/100;
answer += 1;
}
an... | D |
import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;
void main() {
readln.chomp.count!"a == '1'".writeln;
}
void scan(T...)(ref T args) {
import std.stdio : readln;
import std.algorithm : splitter;
import std.conv : to;
import std.range.primitives;
auto line ... | 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.math, std.regex, std.range, std.ascii, std.algorithm;
void main(){
auto ip = readln.split.to!(int[]), N=ip[0], M=ip[1];
int L = 0;
int R = N;
foreach(i; 0..M){
auto LR = readln.split.to!(int[]);
L = max(L, LR[0]);
R = min(R, LR[1]);
}
if(L<=R) writeln(R-L... | 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 |
// Vicfred
// https://atcoder.jp/contests/abc155/tasks/abc155_b
// simulation
import std.algorithm;
import std.array;
import std.conv;
import std.stdio;
import std.string;
void main() {
int n = readln.chomp.to!int;
int[] a = readln.split.map!(to!int).array;
foreach(item; a) {
if(item%2 == 0 && ite... | D |
import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;
void scan(T...)(ref T args) {
import std.stdio : readln;
import std.algorithm : splitter;
import std.conv : to;
import std.range.primiti... | D |
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[char] cnt;
foreach (e; s) {
cnt[e]++;
}
if (s... | 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 S = "0" ~ readln.chomp;
auto N = S.length.to!int;
auto dp = new int[][](N+1, 2);
foreach (i; 0..N+1) dp[... | 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.strip.splitter;
immutable int n = s.front.to!int;s.popFront;
immutable int m = s.front.to!int;
int problems, penalty;
int[int] c;
bool[int] d;
for... | 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 nk = readln.chomp.split.map!(to!int);
auto num = 1;
foreach (i; 0..nk[0]) {... | 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 File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() ... | D |
import std.algorithm,
std.string,
std.range,
std.stdio,
std.conv;
void main() {
int[char] dic;
foreach (c; readln.chomp) {
if (c !in dic) {
dic[c] = 1;
} else {
dic[c]++;
}
}
writeln(dic.values.all!(n => n % 2 == 0) ? "Yes" : "No");
} | D |
import std.algorithm;
import std.array;
import std.container;
import std.conv;
import std.range;
import std.stdio;
import std.string;
bool solve(int[] p, int t) {
if (p.empty) return t == 0;
if (t == 0) return true;
if (t < 0) return false;
int n = p.front;
p.popFront;
if (solve(p, t-n)) return true;
if ... | 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;
void main()
{
while (1) {
auto n = readln.chomp.to!int;
if (n == -1) break;
n.to!string(4).writeln;
}
} | 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 lrd = readln.split.to!(int[]);
auto L = lrd[0];
auto R = lrd[1];
auto d = lrd[2];
int c;
foreach (i; L..R+1) if (i%d == 0) ++c;
writeln(c);
} | D |
import std.stdio, std.array, std.conv, std.typecons, std.algorithm;
T diff(T)(const ref T a, const ref T b) { return a > b ? a - b : b - a; }
void main() {
immutable i = readln.split.to!(long[]);
writeln(i[0]+1-i[1]);
}
| D |
import std.algorithm;
import std.array;
import std.stdio;
import std.conv;
import std.string;
import std.range;
void main(){
size_t w, h, sx, sy;
char[][] data = new char[][](20, 20);
while(true){
auto input = readln.split;
w = input[0].to!int;
h = input[1].to!int;
if(!(w | ... | 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 n = readln.chomp.to!int;
int cx, cy, ct;
auto f = false;
foreach (_; 0..n)... | D |
void main() {
auto N = ri;
auto s = rs;
if(s.count!"a == 'R'" > s.count!"a == 'B'") 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.contai... | D |
import std.stdio, std.algorithm, std.string, std.conv, std.array, std.range, std.math, core.stdc.stdio;
int readint() { return readln.chomp.to!int; }
int[] readints() { return readln.split.to!(int[]); }
void main() {
int a,b,c;
scanf("%d%d%d", &a,&b,&c);
writeln(a+b >= c ? "Yes" : "No");
auto _ = read... | D |
void main() {
problem();
}
void problem() {
auto K = scan!int;
auto A = scan!int;
auto B = scan!int;
bool solve() {
foreach(i; A..B+1) {
if (i % K == 0) return true;
}
return false;
}
writeln(solve() ? "OK" : "NG");
}
// ----------------------------------------------
import std.std... | D |
import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;
string FMT_F = "%.10f";
static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_r... | D |
import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop, std.bitmanip;
immutable long MOD = 10^^9 + 7;
void main() {
auto s = readln.split.map!(to!int);
auto N = s[0];
auto K = s[1];
... | 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 std.string... | D |
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.bigint;
import std.numeric;
import std.conv;
import std.typecons;
import std.uni;
import std.ascii;
import std.bitmanip;
import core.bitop;
// void ma... | D |
/+ dub.sdl:
name "A"
dependency "dcomp" version=">=0.6.0"
+/
import std.stdio, std.algorithm, std.range, std.conv, std.typecons, std.math;
import std.functional;
// import dcomp.foundation, dcomp.scanner;
// import dcomp.graph.maxflow;
long f(int le, int p, long d) {
int q = le-1-p;
long up = 0;
... | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
void main() {
size_t n;
scanf("%ld\n", &n);
size_t[ubyte[]] map;
foreach(i; 0..n) {
auto l = readln.chomp.representation.dup;
l.sort!"a<b";
immutable key = l.dup;
if (key in map) {
++map[key];
}
else {
map[key] = 1;
}
... | D |
import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;
void scan(T...)(ref T args) {
import std.stdio : readln;
import std.algorithm : splitter;
import std.conv : to;
import std.range.primiti... | D |
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.strip;
int t;
for (size_t i = 0, j = s.length - 1; i < j; i++,j--) {
if (s[i] != s[j]) ++t;
}
writeln (t);
}
| D |
import std.stdio, std.string, std.conv;
void main()
{
while(true)
{
int n=readln.chomp.to!int;
if(!n)break;
int num;
for(int i=1; i<n; ++i)
{
int sum;
for(int j=i; j<n; ++j)
{
sum+=j;
if(sum == n) ++num... | 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.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 main()
{
string s; readV(s);
string t; readV(t);
auto ns = s.length.to!int, nt = t.length.to!int... | D |
//
import std.stdio,std.array,std.conv;
void main(){
auto sr=readln.split;
int r=to!int(sr[0]);
auto sg=readln.split;
int g=to!int(sg[0]);
writeln(g*2-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 |
import std.stdio, std.conv, std.array, std.string;
import std.algorithm;
import std.container;
import std.range;
import core.stdc.stdlib;
import std.math;
void main() {
auto N = readln.chomp.to!int;
auto S = readln;
int total = 0;
foreach(i; 0..N) {
if (i == 0) {
total++;
continue;
}
... | D |
void main() {
int x = readln.chomp.to!int;
int a = readln.chomp.to!int;
int b = readln.chomp.to!int;
writeln((x - a) % b);
}
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;
import ... | 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 s = readln.chomp;
auto t = readln.chomp;
foreach (i; 0 .. s.length)
{
bool flag = true;
foreach... | 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 c;
foreach (i; 1..N+1) {
if (i < 10 || (100 <= i && i < 1000) || (10000 <= i && i < 100000)) ++c;
}
writeln(c);
} | D |
import std.stdio;
void main() {
for(int i = 1; i < 10; i++)
for(int j = 1; j < 10; j++)
writeln(i,"x",j,"=",i*j);
} | D |
import std.stdio;
void main(){
foreach(e1; 1..10){ foreach(e2; 1..10){ writeln(e1, "x", e2, "=", e1*e2); } }
} | D |
import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.range;
void main()
{
auto n = readln().chomp().to!int;
int cnt4, cnt2, cnt1;
foreach(e; readln().chomp().splitter(' ').map!(to!int)){
if(e % 4 == 0){
++cnt4;
}else if(e % 2 != 0){
... | 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 |
import std.stdio, std.conv, std.string, std.regex, std.math, std.array, std.algorithm;
void main(){
auto ip = readln.split;
int A = ip[0].to!int;
int B = ip[2].to!int;
char op = ip[1].to!char;
if(op == '+'){
writeln(A + B);
} else if(op == '-'){
writeln(A - B);
}
} | D |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.