id stringlengths 22 25 | content stringlengths 327 628k | max_stars_repo_path stringlengths 49 49 |
|---|---|---|
condefects-java_data_901 | import java.io.*;
import java.util.*;
public class Main {
static Main2 admin = new Main2();
public static void main(String[] args) {
admin.start();
}
}
class Main2 {
//---------------------------------INPUT READER-----------------------------------------//
public BufferedReader br;
StringTokenizer st = new StringTokenizer("");
String next() {
while (!st.hasMoreTokens()) {
try { st = new StringTokenizer(br.readLine());} catch (IOException e) { e.printStackTrace(); }
}
return st.nextToken();
}
int ni() { return Integer.parseInt(next()); }
long nl() { return Long.parseLong(next()); }
double nd() { return Double.parseDouble(next()); }
String ns() { return next(); }
int[] na(long n) {int[]ret=new int[(int)n]; for(int i=0;i<n;i++) ret[i]=ni(); return ret;}
long[] nal(long n) {long[]ret=new long[(int)n]; for(int i=0;i<n;i++) ret[i]=nl(); return ret;}
Integer[] nA(long n) {Integer[]ret=new Integer[(int)n]; for(int i=0;i<n;i++) ret[i]=ni(); return ret;}
Long[] nAl(long n) {Long[]ret=new Long[(int)n]; for(int i=0;i<n;i++) ret[i]=nl(); return ret;}
//--------------------------------------PRINTER------------------------------------------//
PrintWriter w;
void p(int i) {w.println(i);} void p(long l) {w.println(l);}
void p(double d) {w.println(d);} void p(String s) { w.println(s);}
void pr(int i) {w.print(i);} void pr(long l) {w.print(l);}
void pr(double d) {w.print(d);} void pr(String s) { w.print(s);}
void pl() {w.println();}
//--------------------------------------VARIABLES-----------------------------------------//
long lma = Long.MAX_VALUE, lmi = Long.MIN_VALUE;
int ima = Integer.MAX_VALUE, imi = Integer.MIN_VALUE;
long mod = 1000000007;
{
w = new PrintWriter(System.out);
br = new BufferedReader(new InputStreamReader(System.in));
}
//----------------------START---------------------//
void start() {
//int t = ni(); while(t-- > 0)
solve();
w.close();
}
void solve() {
int n = ni(), m = ni();
List<List<Integer>> graph = new ArrayList<>();
int[] degree = new int[n];
for(int i = 0; i < n; i++) graph.add(new ArrayList<>());
for(int i = 0; i < m; i++) {
int a = ni() - 1, b = ni() - 1;
degree[b]++;
graph.get(a).add(b);
}
PriorityQueue<Integer> pq = new PriorityQueue<>();
for(int i = 0; i < n; i++) {
if(degree[i] == 0) pq.add(i);
}
List<Integer> topo = new ArrayList<>();
while(!pq.isEmpty()) {
int at = pq.poll();
topo.add(at);
for(int j: graph.get(at)) {
degree[j]--;
if(degree[j] == 0) topo.add(j);
}
}
if(topo.size() != n) {
p(-1);
return;
}
for(int i: topo) pr((i+1)+" ");
pl();
}
}
import java.io.*;
import java.util.*;
public class Main {
static Main2 admin = new Main2();
public static void main(String[] args) {
admin.start();
}
}
class Main2 {
//---------------------------------INPUT READER-----------------------------------------//
public BufferedReader br;
StringTokenizer st = new StringTokenizer("");
String next() {
while (!st.hasMoreTokens()) {
try { st = new StringTokenizer(br.readLine());} catch (IOException e) { e.printStackTrace(); }
}
return st.nextToken();
}
int ni() { return Integer.parseInt(next()); }
long nl() { return Long.parseLong(next()); }
double nd() { return Double.parseDouble(next()); }
String ns() { return next(); }
int[] na(long n) {int[]ret=new int[(int)n]; for(int i=0;i<n;i++) ret[i]=ni(); return ret;}
long[] nal(long n) {long[]ret=new long[(int)n]; for(int i=0;i<n;i++) ret[i]=nl(); return ret;}
Integer[] nA(long n) {Integer[]ret=new Integer[(int)n]; for(int i=0;i<n;i++) ret[i]=ni(); return ret;}
Long[] nAl(long n) {Long[]ret=new Long[(int)n]; for(int i=0;i<n;i++) ret[i]=nl(); return ret;}
//--------------------------------------PRINTER------------------------------------------//
PrintWriter w;
void p(int i) {w.println(i);} void p(long l) {w.println(l);}
void p(double d) {w.println(d);} void p(String s) { w.println(s);}
void pr(int i) {w.print(i);} void pr(long l) {w.print(l);}
void pr(double d) {w.print(d);} void pr(String s) { w.print(s);}
void pl() {w.println();}
//--------------------------------------VARIABLES-----------------------------------------//
long lma = Long.MAX_VALUE, lmi = Long.MIN_VALUE;
int ima = Integer.MAX_VALUE, imi = Integer.MIN_VALUE;
long mod = 1000000007;
{
w = new PrintWriter(System.out);
br = new BufferedReader(new InputStreamReader(System.in));
}
//----------------------START---------------------//
void start() {
//int t = ni(); while(t-- > 0)
solve();
w.close();
}
void solve() {
int n = ni(), m = ni();
List<List<Integer>> graph = new ArrayList<>();
int[] degree = new int[n];
for(int i = 0; i < n; i++) graph.add(new ArrayList<>());
for(int i = 0; i < m; i++) {
int a = ni() - 1, b = ni() - 1;
degree[b]++;
graph.get(a).add(b);
}
PriorityQueue<Integer> pq = new PriorityQueue<>();
for(int i = 0; i < n; i++) {
if(degree[i] == 0) pq.add(i);
}
List<Integer> topo = new ArrayList<>();
while(!pq.isEmpty()) {
int at = pq.poll();
topo.add(at);
for(int j: graph.get(at)) {
degree[j]--;
if(degree[j] == 0) pq.add(j);
}
}
if(topo.size() != n) {
p(-1);
return;
}
for(int i: topo) pr((i+1)+" ");
pl();
}
} | ConDefects/ConDefects/Code/abc223_d/Java/36331322 |
condefects-java_data_902 | //package Codeforces;
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main {
public static void main (String[] args) throws java.lang.Exception {
PrintWriter out=new PrintWriter(System.out);
FastReader sc = new FastReader();
int testCases=1;
// testCases=sc.nextInt();
while(testCases-->0) {
int n=sc.nextInt();
int m=sc.nextInt();
ArrayList<Integer> graph[]=new ArrayList[n];
for(int i=0;i<n;i++) graph[i]=new ArrayList<>();
int deg[]=new int[n];
for(int i=0;i<m;i++) {
int u=sc.nextInt()-1;
int v=sc.nextInt()-1;
deg[v]++;
graph[u].add(v);
}
Queue<Integer> q = new ArrayDeque<>();
for(int i=0;i<n;i++) {
if(deg[i]==0) q.add(i);
}
ArrayList<Integer> list= new ArrayList<>();
while(!q.isEmpty()) {
for(int i=q.size();i>0;i--) {
int u=q.poll();
list.add(u+1);
for(int v : graph[u]) {
deg[v]--;
if(deg[v]==0) q.add(v);
}
}
}
if(list.size() != n) out.println(-1);
else {
for(int i : list) out.print(i+" ");
out.println();
}
}
out.close();
}
public static boolean isPallindrome(String a,String b) {
int n = a.length();
for(int i=0;i<n;i++) if(a.charAt(i) != b.charAt(i)) return false;
return true;
}
public static long gcd(long a, long b) {
if(a==0) return b;
return gcd(b%a,a);
}
private static long lcm(long a, long b) {
return (a*b)/gcd(a,b);
}
static class FenWick{
int n;
int tree[];
public FenWick(int n) {
this.n=n;
tree=new int[n];
}
public void add(int idx,int d) {
while(idx<n) {
tree[idx]+=d;
idx+=(idx&(-idx));
}
}
public int sum(int idx) {
int sum=0;
while(idx>0) {
sum+=tree[idx];
idx-=(idx&(-idx));
}
return sum;
}
}
static class DSU{
int parent[];
int rank[];
int size[];
public DSU(int n) {
this.parent = new int[n];
this.rank = new int[n];
size=new int[n];
for(int i=0;i<n;i++) parent[i]=i;
for(int i=0;i<n;i++) size[i]=1;
}
public int find(int x) {
if(parent[x]==x) return x;
return parent[x]=find(parent[x]);
}
public boolean union(int x,int y) {
int px = find(x);
int py = find(y);
if(px == py) return false;
if(rank[px]>rank[py]) {
parent[py]=px;
size[px]+=size[py];
}
else if(rank[py]>rank[px]) {
parent[px]=py;
size[py]+=size[px];
}
else {
rank[px]++;
parent[py]=px;
size[px]+=size[py];
}
return true;
}
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(
new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}
//package Codeforces;
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main {
public static void main (String[] args) throws java.lang.Exception {
PrintWriter out=new PrintWriter(System.out);
FastReader sc = new FastReader();
int testCases=1;
// testCases=sc.nextInt();
while(testCases-->0) {
int n=sc.nextInt();
int m=sc.nextInt();
ArrayList<Integer> graph[]=new ArrayList[n];
for(int i=0;i<n;i++) graph[i]=new ArrayList<>();
int deg[]=new int[n];
for(int i=0;i<m;i++) {
int u=sc.nextInt()-1;
int v=sc.nextInt()-1;
deg[v]++;
graph[u].add(v);
}
PriorityQueue<Integer> q = new PriorityQueue<>();
for(int i=0;i<n;i++) {
if(deg[i]==0) q.add(i);
}
ArrayList<Integer> list= new ArrayList<>();
while(!q.isEmpty()) {
for(int i=q.size();i>0;i--) {
int u=q.poll();
list.add(u+1);
for(int v : graph[u]) {
deg[v]--;
if(deg[v]==0) q.add(v);
}
}
}
if(list.size() != n) out.println(-1);
else {
for(int i : list) out.print(i+" ");
out.println();
}
}
out.close();
}
public static boolean isPallindrome(String a,String b) {
int n = a.length();
for(int i=0;i<n;i++) if(a.charAt(i) != b.charAt(i)) return false;
return true;
}
public static long gcd(long a, long b) {
if(a==0) return b;
return gcd(b%a,a);
}
private static long lcm(long a, long b) {
return (a*b)/gcd(a,b);
}
static class FenWick{
int n;
int tree[];
public FenWick(int n) {
this.n=n;
tree=new int[n];
}
public void add(int idx,int d) {
while(idx<n) {
tree[idx]+=d;
idx+=(idx&(-idx));
}
}
public int sum(int idx) {
int sum=0;
while(idx>0) {
sum+=tree[idx];
idx-=(idx&(-idx));
}
return sum;
}
}
static class DSU{
int parent[];
int rank[];
int size[];
public DSU(int n) {
this.parent = new int[n];
this.rank = new int[n];
size=new int[n];
for(int i=0;i<n;i++) parent[i]=i;
for(int i=0;i<n;i++) size[i]=1;
}
public int find(int x) {
if(parent[x]==x) return x;
return parent[x]=find(parent[x]);
}
public boolean union(int x,int y) {
int px = find(x);
int py = find(y);
if(px == py) return false;
if(rank[px]>rank[py]) {
parent[py]=px;
size[px]+=size[py];
}
else if(rank[py]>rank[px]) {
parent[px]=py;
size[py]+=size[px];
}
else {
rank[px]++;
parent[py]=px;
size[px]+=size[py];
}
return true;
}
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(
new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
} | ConDefects/ConDefects/Code/abc223_d/Java/40450955 |
condefects-java_data_903 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
// Implement this method
void solve() {
int N = nextInt();
long A = nextLong(), B = nextLong();
String S = next();
S += S;
long ans = Math.min(A * N, B * N);
for (int i = 0; i < N; i++) {
long tmp = A * i;
for (int j = 0; j < N / 2; j++) {
int l = i + j;
int r = N - j - 1 + i;
if (S.charAt(l) != S.charAt(r)) tmp += B;
}
ans = Math.min(ans, tmp);
}
println(ans);
}
// Entrypoint - DO NOT EDIT!!
public static void main(String[] args) {
Main main = new Main();
main.solve();
flush();
}
// Stdin
static FastReader fr = new FastReader();
static String next() {
return fr.next();
}
static int nextInt() {
return fr.nextInt();
}
static double nextDouble() {
return fr.nextDouble();
}
static long nextLong() {
return fr.nextLong();
}
static int[] nextInts(int N) {
int[] ret = new int[N];
for (int i = 0; i < N; i++) ret[i] = nextInt();
return ret;
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
// Stdout
static PrintWriter out = new PrintWriter(System.out);
static void println(Object o) {
out.println(o);
}
static void flush() {
out.flush();
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
// Implement this method
void solve() {
int N = nextInt();
long A = nextLong(), B = nextLong();
String S = next();
S += S;
long ans = 1L << 60;
for (int i = 0; i < N; i++) {
long tmp = A * i;
for (int j = 0; j < N / 2; j++) {
int l = i + j;
int r = N - j - 1 + i;
if (S.charAt(l) != S.charAt(r)) tmp += B;
}
ans = Math.min(ans, tmp);
}
println(ans);
}
// Entrypoint - DO NOT EDIT!!
public static void main(String[] args) {
Main main = new Main();
main.solve();
flush();
}
// Stdin
static FastReader fr = new FastReader();
static String next() {
return fr.next();
}
static int nextInt() {
return fr.nextInt();
}
static double nextDouble() {
return fr.nextDouble();
}
static long nextLong() {
return fr.nextLong();
}
static int[] nextInts(int N) {
int[] ret = new int[N];
for (int i = 0; i < N; i++) ret[i] = nextInt();
return ret;
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
// Stdout
static PrintWriter out = new PrintWriter(System.out);
static void println(Object o) {
out.println(o);
}
static void flush() {
out.flush();
}
}
| ConDefects/ConDefects/Code/abc286_c/Java/40913162 |
condefects-java_data_904 | import java.io.IOException;
import java.io.InputStream;
import java.util.*;
public class Main {
private static final long MOD = 998244353L;
public static void main(String[] args) {
FastScanner sc = new FastScanner();
Scanner sn = new Scanner(System.in);
Long n = sc.nextLong();
Long a = sc.nextLong();
Long b = sc.nextLong();
String[] s = sc.next().split("");
ArrayList<String> list = new ArrayList<>(Arrays.asList(s));
Long money = 0L;
for(int k = 0, l = s.length - 1; k < l; k++, l--) {
if(!list.get(k).equals(list.get(l))) {
money += b;
}
}
Long min = money;
for(int i = 0; i < n; i++) {
money = a * (i + 1);
String tmp = list.get(0);
list.remove(0);
list.add(tmp);
for(int k = 0, l = s.length - 1; k < l; k++, l--) {
if(!list.get(k).equals(list.get(l))) {
money += b;
}
}
if(min == 0 || min > money) {
min = money;
}
}
System.out.println(min);
}
private static long solve(int N, int[] A, int[] B) {
long[] pow2 = new long[N + 1];
pow2[0] = 1;
for (int i = 1; i <= N; i++) {
pow2[i] = (pow2[i - 1] * 2) % MOD;
}
long[] dp = new long[N + 1];
dp[0] = 1;
dp[1] = 2;
for (int i = 2; i <= N; i++) {
if (A[i - 1] != B[i - 1]) {
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
} else {
dp[i] = dp[i - 1];
}
}
return (pow2[N] - dp[N] + MOD) % MOD;
}
static int gcd(int a, int b) {
while(a >= 1 && b >= 1) {
if(a >= b) {
a = (a % b);
} else {
b = (b % a);
}
}
if (a != 0) return a;
return b;
}
// 素因数分解を行う関数
static Map<Long, Integer> factorize(long n) {
Map<Long, Integer> factors = new HashMap<>();
for (long i = 2; i * i <= n; i++) {
while (n % i == 0) {
n /= i;
factors.put(i, factors.getOrDefault(i, 0) + 1);
}
}
if (n != 1) {
factors.put(n, 1);
}
return factors;
}
// p^eの約数の個数を求める関数
static long countDivisors(long p, int e) {
long res = 1;
for (int i = 0; i <= e; i++) {
res *= (i + 1);
}
return res;
}
// x^nを求める関数
static long pow(long x, int n) {
long res = 1;
while (n > 0) {
if ((n & 1) == 1) res *= x;
x *= x;
n >>= 1;
}
return res;
}
//入力文字列が一致するかどうかをチェックする再帰的関数
//指定されたワイルドカードパターン
public static boolean isMatch(String word, int n, String pattern, int m,
Map<String, Boolean> lookup) {
//入力の動的要素から一意のマップキーを作成します
String key = n + "|" + m;
//サブ問題が以前に見られた場合
if (lookup.containsKey(key)) {
return lookup.get(key);
}
//サブ問題が初めて見られるので、それを解決して
//結果をマップに保存します
//パターンの終わりに到達しました
if (m == pattern.length()) {
//入力文字列の終わりにも達した場合にのみtrueを返します
lookup.put(key, (n == word.length()));
return n == word.length();
}
//入力文字列が最後に達した場合、
//パターンの残りの文字はすべて'*'です
if (n == word.length()) {
for (int i = m; i < pattern.length(); i++) {
if (pattern.charAt(i) != '*') {
lookup.put(key, false);
return false;
}
}
lookup.put(key, true);
return true;
}
//現在のワイルドカード文字が「?」の場合またはの現在の文字
//パターンは入力文字列の現在の文字と同じです
if (word.charAt(m) == '?' || pattern.charAt(m) == '?' || pattern.charAt(m) == word.charAt(n)) {
//パターンと入力文字列の次の文字に移動します
lookup.put(key, isMatch(word, n + 1, pattern, m + 1, lookup));
}
//現在のワイルドカード文字が「*」の場合
else if (pattern.charAt(m) == '*') {
//入力文字列の次の文字に移動するか
//'*'を無視して、パターン内の次の文字に移動します
lookup.put(key, isMatch(word, n + 1, pattern, m, lookup) ||
isMatch(word, n, pattern, m + 1, lookup));
} else {
//パターン内の現在の文字がそうでないときにここに到達します
//ワイルドカード文字であり、現在の文字と一致しません
//入力文字列の文字
lookup.put(key, false);
}
return lookup.get(key);
}
//文字列が特定のワイルドカードパターンと一致するかどうかを確認します
public static String isMatch(String word, String pattern) {
Map<String, Boolean> lookup = new HashMap<>();
if (isMatch(word, 0, pattern, 0, lookup)) {
return "Yes";
} else {
return "No";
}
}
public static ArrayList<Boolean> es(Long n) {
ArrayList<Boolean> flg = new ArrayList<Boolean>();
flg.add(false);
for (int i = 0; i < n - 1; i++) {
flg.add(true);
}
for (int p = 2; p <= n; p++) {
if (!flg.get(p)) continue;
for (int q = p * 2; q <= n; q += p) {
flg.set(q, false);
}
}
return flg;
}
private static void dfs(int v, boolean[] flg, ArrayList<Integer>[] adjacent) {
flg[v] = true;
for (int i : adjacent[v]) {
if (flg[i]) continue;
dfs(i, flg, adjacent);
}
return;
}
private static long countOccurrences(String str, char ch) {
return str.chars()
.filter(c -> c == ch)
.count();
}
private static long getCommonDivisor(long x, long y) {
long biggerNum = Math.max(x, y);
long smallerNum = Math.min(x, y);
// 大きい方から小さい方を割った余を求める
long surplus = biggerNum % smallerNum;
// 割り切れていれば、それを返す
if (surplus == 0) {
return smallerNum;
}
// 割り切れなければ再帰的に自信を呼び出す
surplus = getCommonDivisor(smallerNum, surplus);
return surplus;
}
public static boolean isPrime(long num) {
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false; // 偶数はあらかじめ除く
double sqrtNum = Math.sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
}
// 組み合わせ
public static long combination(int n, int r) {
long c[][] = new long[n + 5][n + 5];
//パスカルの三角形作成
c[0][0] = 1;
for (int i = 0; i < n + 3; i++) {
for (int j = 0; j < n + 3; j++) {
long tmp = c[i][j];
c[i + 1][j] += tmp;
c[i + 1][j + 1] += tmp;
}
}
return c[n][r];
}
// 文字列比較
public static boolean strCompare(String a, String b) {
boolean result = false;
int mod = 2147483647;
if (a.hashCode() % mod == b.hashCode() % mod) {
result = true;
} else {
result = false;
}
return result;
}
public static Map<Integer, Set<Integer>> addGraph(Map<Integer, Set<Integer>> graph, int a, int b) {
Set<Integer> set = graph.getOrDefault(a, new HashSet<>());
set.add(b);
graph.put(a, set);
return graph;
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++];
else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
private void skipUnprintable() {
while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
}
public boolean hasNext() {
skipUnprintable();
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
}
class UnionFind {
int[] parent;
int[] rank;
public UnionFind(int n) {
// 初期化コンストラクタ
this.parent = new int[n + 1];
this.rank = new int[n + 1];
// 最初はすべてが根
for (int i = 0; i < n; i++) {
parent[i] = i;
rank[i] = 0;
}
}
/**
* 要素の根を返す。
* 経路圧縮付き。（1→3→2となっていて2をfindした際、1→3,2と木の深さを浅くする。）
*
* @param x
* @return 要素xの根
*/
public int find(int x) {
if (x == parent[x]) {
return x;
} else {
// 経路圧縮時はrank変更しない
parent[x] = find(parent[x]);
return parent[x];
}
}
/**
* ２つの要素が同じ集合に属するかどうかを返す。
*
* @param x
* @param y
* @return 同じ集合であればtrue
*/
public boolean same(int x, int y) {
return find(x) == find(y);
}
/**
* 要素xが属する集合と要素yが属する集合を連結する。
* 木の高さ（ランク）を気にして、低い方に高い方をつなげる。（高い方の根を全体の根とする。）
*
* @param x
* @param y
*/
public void unite(int x, int y) {
int xRoot = find(x);
int yRoot = find(y);
if (xRoot == yRoot) {
// 属する集合が同じな場合、何もしない
return;
}
// rankを比較して共通の根を決定する。
// ※find時の経路圧縮はrank考慮しない
if (rank[xRoot] > rank[yRoot]) {
// xRootのrankのほうが大きければ、共通の根をxRootにする
parent[yRoot] = xRoot;
} else if (rank[xRoot] < rank[yRoot]) {
// yRootのrankのほうが大きければ、共通の根をyRootにする
parent[xRoot] = yRoot;
} else {
// rankが同じであれば、どちらかを根として、rankを一つ上げる。
parent[xRoot] = yRoot;
rank[xRoot]++;
}
}
}
import java.io.IOException;
import java.io.InputStream;
import java.util.*;
public class Main {
private static final long MOD = 998244353L;
public static void main(String[] args) {
FastScanner sc = new FastScanner();
Scanner sn = new Scanner(System.in);
Long n = sc.nextLong();
Long a = sc.nextLong();
Long b = sc.nextLong();
String[] s = sc.next().split("");
ArrayList<String> list = new ArrayList<>(Arrays.asList(s));
Long money = 0L;
for(int k = 0, l = s.length - 1; k < l; k++, l--) {
if(!list.get(k).equals(list.get(l))) {
money += b;
}
}
Long min = money;
for(int i = 0; i < n; i++) {
money = a * (i + 1);
String tmp = list.get(0);
list.remove(0);
list.add(tmp);
for(int k = 0, l = s.length - 1; k < l; k++, l--) {
if(!list.get(k).equals(list.get(l))) {
money += b;
}
}
if(min > money) {
min = money;
}
}
System.out.println(min);
}
private static long solve(int N, int[] A, int[] B) {
long[] pow2 = new long[N + 1];
pow2[0] = 1;
for (int i = 1; i <= N; i++) {
pow2[i] = (pow2[i - 1] * 2) % MOD;
}
long[] dp = new long[N + 1];
dp[0] = 1;
dp[1] = 2;
for (int i = 2; i <= N; i++) {
if (A[i - 1] != B[i - 1]) {
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
} else {
dp[i] = dp[i - 1];
}
}
return (pow2[N] - dp[N] + MOD) % MOD;
}
static int gcd(int a, int b) {
while(a >= 1 && b >= 1) {
if(a >= b) {
a = (a % b);
} else {
b = (b % a);
}
}
if (a != 0) return a;
return b;
}
// 素因数分解を行う関数
static Map<Long, Integer> factorize(long n) {
Map<Long, Integer> factors = new HashMap<>();
for (long i = 2; i * i <= n; i++) {
while (n % i == 0) {
n /= i;
factors.put(i, factors.getOrDefault(i, 0) + 1);
}
}
if (n != 1) {
factors.put(n, 1);
}
return factors;
}
// p^eの約数の個数を求める関数
static long countDivisors(long p, int e) {
long res = 1;
for (int i = 0; i <= e; i++) {
res *= (i + 1);
}
return res;
}
// x^nを求める関数
static long pow(long x, int n) {
long res = 1;
while (n > 0) {
if ((n & 1) == 1) res *= x;
x *= x;
n >>= 1;
}
return res;
}
//入力文字列が一致するかどうかをチェックする再帰的関数
//指定されたワイルドカードパターン
public static boolean isMatch(String word, int n, String pattern, int m,
Map<String, Boolean> lookup) {
//入力の動的要素から一意のマップキーを作成します
String key = n + "|" + m;
//サブ問題が以前に見られた場合
if (lookup.containsKey(key)) {
return lookup.get(key);
}
//サブ問題が初めて見られるので、それを解決して
//結果をマップに保存します
//パターンの終わりに到達しました
if (m == pattern.length()) {
//入力文字列の終わりにも達した場合にのみtrueを返します
lookup.put(key, (n == word.length()));
return n == word.length();
}
//入力文字列が最後に達した場合、
//パターンの残りの文字はすべて'*'です
if (n == word.length()) {
for (int i = m; i < pattern.length(); i++) {
if (pattern.charAt(i) != '*') {
lookup.put(key, false);
return false;
}
}
lookup.put(key, true);
return true;
}
//現在のワイルドカード文字が「?」の場合またはの現在の文字
//パターンは入力文字列の現在の文字と同じです
if (word.charAt(m) == '?' || pattern.charAt(m) == '?' || pattern.charAt(m) == word.charAt(n)) {
//パターンと入力文字列の次の文字に移動します
lookup.put(key, isMatch(word, n + 1, pattern, m + 1, lookup));
}
//現在のワイルドカード文字が「*」の場合
else if (pattern.charAt(m) == '*') {
//入力文字列の次の文字に移動するか
//'*'を無視して、パターン内の次の文字に移動します
lookup.put(key, isMatch(word, n + 1, pattern, m, lookup) ||
isMatch(word, n, pattern, m + 1, lookup));
} else {
//パターン内の現在の文字がそうでないときにここに到達します
//ワイルドカード文字であり、現在の文字と一致しません
//入力文字列の文字
lookup.put(key, false);
}
return lookup.get(key);
}
//文字列が特定のワイルドカードパターンと一致するかどうかを確認します
public static String isMatch(String word, String pattern) {
Map<String, Boolean> lookup = new HashMap<>();
if (isMatch(word, 0, pattern, 0, lookup)) {
return "Yes";
} else {
return "No";
}
}
public static ArrayList<Boolean> es(Long n) {
ArrayList<Boolean> flg = new ArrayList<Boolean>();
flg.add(false);
for (int i = 0; i < n - 1; i++) {
flg.add(true);
}
for (int p = 2; p <= n; p++) {
if (!flg.get(p)) continue;
for (int q = p * 2; q <= n; q += p) {
flg.set(q, false);
}
}
return flg;
}
private static void dfs(int v, boolean[] flg, ArrayList<Integer>[] adjacent) {
flg[v] = true;
for (int i : adjacent[v]) {
if (flg[i]) continue;
dfs(i, flg, adjacent);
}
return;
}
private static long countOccurrences(String str, char ch) {
return str.chars()
.filter(c -> c == ch)
.count();
}
private static long getCommonDivisor(long x, long y) {
long biggerNum = Math.max(x, y);
long smallerNum = Math.min(x, y);
// 大きい方から小さい方を割った余を求める
long surplus = biggerNum % smallerNum;
// 割り切れていれば、それを返す
if (surplus == 0) {
return smallerNum;
}
// 割り切れなければ再帰的に自信を呼び出す
surplus = getCommonDivisor(smallerNum, surplus);
return surplus;
}
public static boolean isPrime(long num) {
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false; // 偶数はあらかじめ除く
double sqrtNum = Math.sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
}
// 組み合わせ
public static long combination(int n, int r) {
long c[][] = new long[n + 5][n + 5];
//パスカルの三角形作成
c[0][0] = 1;
for (int i = 0; i < n + 3; i++) {
for (int j = 0; j < n + 3; j++) {
long tmp = c[i][j];
c[i + 1][j] += tmp;
c[i + 1][j + 1] += tmp;
}
}
return c[n][r];
}
// 文字列比較
public static boolean strCompare(String a, String b) {
boolean result = false;
int mod = 2147483647;
if (a.hashCode() % mod == b.hashCode() % mod) {
result = true;
} else {
result = false;
}
return result;
}
public static Map<Integer, Set<Integer>> addGraph(Map<Integer, Set<Integer>> graph, int a, int b) {
Set<Integer> set = graph.getOrDefault(a, new HashSet<>());
set.add(b);
graph.put(a, set);
return graph;
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++];
else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
private void skipUnprintable() {
while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
}
public boolean hasNext() {
skipUnprintable();
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
}
class UnionFind {
int[] parent;
int[] rank;
public UnionFind(int n) {
// 初期化コンストラクタ
this.parent = new int[n + 1];
this.rank = new int[n + 1];
// 最初はすべてが根
for (int i = 0; i < n; i++) {
parent[i] = i;
rank[i] = 0;
}
}
/**
* 要素の根を返す。
* 経路圧縮付き。（1→3→2となっていて2をfindした際、1→3,2と木の深さを浅くする。）
*
* @param x
* @return 要素xの根
*/
public int find(int x) {
if (x == parent[x]) {
return x;
} else {
// 経路圧縮時はrank変更しない
parent[x] = find(parent[x]);
return parent[x];
}
}
/**
* ２つの要素が同じ集合に属するかどうかを返す。
*
* @param x
* @param y
* @return 同じ集合であればtrue
*/
public boolean same(int x, int y) {
return find(x) == find(y);
}
/**
* 要素xが属する集合と要素yが属する集合を連結する。
* 木の高さ（ランク）を気にして、低い方に高い方をつなげる。（高い方の根を全体の根とする。）
*
* @param x
* @param y
*/
public void unite(int x, int y) {
int xRoot = find(x);
int yRoot = find(y);
if (xRoot == yRoot) {
// 属する集合が同じな場合、何もしない
return;
}
// rankを比較して共通の根を決定する。
// ※find時の経路圧縮はrank考慮しない
if (rank[xRoot] > rank[yRoot]) {
// xRootのrankのほうが大きければ、共通の根をxRootにする
parent[yRoot] = xRoot;
} else if (rank[xRoot] < rank[yRoot]) {
// yRootのrankのほうが大きければ、共通の根をyRootにする
parent[xRoot] = yRoot;
} else {
// rankが同じであれば、どちらかを根として、rankを一つ上げる。
parent[xRoot] = yRoot;
rank[xRoot]++;
}
}
} | ConDefects/ConDefects/Code/abc286_c/Java/39974387 |
condefects-java_data_905 | import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int personas = sc.nextInt();
int distanciaLimite = sc.nextInt();
List<Persona> stats = new ArrayList<>();
for(int i = 0; i < personas; i++){
int ejeX = sc.nextInt();
int ejeY = sc.nextInt();
stats.add(new Persona(ejeX, ejeY, false));
}
stats.get(0).infectado = true; //Primera persona infectada
comprobarInfeccion(stats, stats.get(0), distanciaLimite);
for(Persona persona : stats){
System.out.println(persona.infectado ? "YES" : "NO");
}
}
static void comprobarInfeccion(List<Persona> personas, Persona personaInfecciosa, int distancia){
for(Persona p : personas){
if(!p.infectado && personaInfecciosa.dentroDeDistancia(p, distancia)){
//Se infecta a la persona actual
p.infectado = true;
//Comprobamos a quien puede infectar la persona
comprobarInfeccion(personas, p, distancia);
}
}
}
static class Persona{
int ejeX;
int ejeY;
boolean infectado;
public Persona(int ejeX, int ejeY, boolean infectado){
this.ejeX = ejeX;
this.ejeY = ejeY;
this.infectado = infectado;
}
boolean dentroDeDistancia(Persona persona, int distancia){
double distanciaEuclidea = Math.sqrt(
Math.pow(this.ejeX - persona.ejeX, 2) +
Math.pow(this.ejeY - persona.ejeY, 2));
return distancia >= distanciaEuclidea;
}
}
}
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int personas = sc.nextInt();
int distanciaLimite = sc.nextInt();
List<Persona> stats = new ArrayList<>();
for(int i = 0; i < personas; i++){
int ejeX = sc.nextInt();
int ejeY = sc.nextInt();
stats.add(new Persona(ejeX, ejeY, false));
}
stats.get(0).infectado = true; //Primera persona infectada
comprobarInfeccion(stats, stats.get(0), distanciaLimite);
for(Persona persona : stats){
System.out.println(persona.infectado ? "Yes" : "No");
}
}
static void comprobarInfeccion(List<Persona> personas, Persona personaInfecciosa, int distancia){
for(Persona p : personas){
if(!p.infectado && personaInfecciosa.dentroDeDistancia(p, distancia)){
//Se infecta a la persona actual
p.infectado = true;
//Comprobamos a quien puede infectar la persona
comprobarInfeccion(personas, p, distancia);
}
}
}
static class Persona{
int ejeX;
int ejeY;
boolean infectado;
public Persona(int ejeX, int ejeY, boolean infectado){
this.ejeX = ejeX;
this.ejeY = ejeY;
this.infectado = infectado;
}
boolean dentroDeDistancia(Persona persona, int distancia){
double distanciaEuclidea = Math.sqrt(
Math.pow(this.ejeX - persona.ejeX, 2) +
Math.pow(this.ejeY - persona.ejeY, 2));
return distancia >= distanciaEuclidea;
}
}
}
| ConDefects/ConDefects/Code/abc304_c/Java/45502784 |
condefects-java_data_906 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner scan = new Scanner(System.in);
String str = scan.nextLine();
char [] s = new char[101];
String ans="";
int cnt=0;
int pt1,pt2,pt3;
pt1=0;
pt2=0;
pt3=str.length();
s=str.toCharArray();
for (int i=0;i<pt3;i++) {
if ((s[i]=='|')&&cnt==0) {
pt1=i;
cnt=1;
}else {
if ((s[i]=='|')&&cnt==1) {
pt2=i;
cnt=2;
}
}
}
if (pt1!=0) {
ans=str.substring(0, pt1-1);
}
if (pt2!=pt3-1) {
ans=ans+str.substring(pt2+1, pt3);
}
System.out.println(ans);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner scan = new Scanner(System.in);
String str = scan.nextLine();
char [] s = new char[101];
String ans="";
int cnt=0;
int pt1,pt2,pt3;
pt1=0;
pt2=0;
pt3=str.length();
s=str.toCharArray();
for (int i=0;i<pt3;i++) {
if ((s[i]=='|')&&cnt==0) {
pt1=i;
cnt=1;
}else {
if ((s[i]=='|')&&cnt==1) {
pt2=i;
cnt=2;
}
}
}
if (pt1!=0) {
ans=str.substring(0, pt1);
}
if (pt2!=pt3-1) {
ans=ans+str.substring(pt2+1, pt3);
}
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc344_a/Java/51953061 |
condefects-java_data_907 | import java.util.Scanner;
import java.util.HashSet;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println(String.join("",sc.next().split("\\|")));
sc.close();
}
}
import java.util.Scanner;
import java.util.HashSet;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println(String.join("",sc.next().split("\\|.*\\|")));
sc.close();
}
}
| ConDefects/ConDefects/Code/abc344_a/Java/51771365 |
condefects-java_data_908 | import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
int n = sc.nextInt();
int q = sc.nextInt();
int[] x = new int[n];
for (int i = 0; i < n; i++) {
x[i] = sc.nextInt();
}
List<ArrayList<Integer>> g = new ArrayList<>();
for (int i = 0; i < n; i++) {
g.add(new ArrayList<>());
}
for (int i = 0; i < n - 1; i++) {
int a = sc.nextInt() - 1;
int b = sc.nextInt() - 1;
g.get(a).add(b);
g.get(b).add(a);
}
int[] V = new int[q];
int[] K = new int[q];
for (int i = 0; i < q; i++) {
V[i] = sc.nextInt() - 1;
K[i] = sc.nextInt() - 1;
}
sc.close();
List<ArrayList<Integer>> subtree = new ArrayList<>();
for (int i = 0; i < n; i++) {
subtree.add(new ArrayList<>());
}
fnc(g, 0, 0, subtree,x);
for (int i = 0; i < q; i++) {
pw.println(subtree.get(V[i]).get(K[i]));
}
pw.println(g);
pw.println(subtree);
pw.close();
}
public static ArrayList<Integer> fnc(List<ArrayList<Integer>> g, int pos, int n, List<ArrayList<Integer>> subtree, int[] x) {
List<ArrayList<Integer>> st = new ArrayList<>();
for (int node : g.get(n)) {
if(pos != node){
st.add(fnc(g, n, node, subtree, x));
}
}
List<Integer> temp = new ArrayList<>();
ArrayList<Integer> ans = new ArrayList<>();
for (int i = 0; i < st.size(); i++) {
temp.addAll(st.get(i));
}
temp.add(x[n]);
Collections.sort(temp, Collections.reverseOrder());
for (int i = 0; i < Math.min(20, temp.size()); i++) {
ans.add(temp.get(i));
}
subtree.set(n, ans);
return ans;
}
}
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
int n = sc.nextInt();
int q = sc.nextInt();
int[] x = new int[n];
for (int i = 0; i < n; i++) {
x[i] = sc.nextInt();
}
List<ArrayList<Integer>> g = new ArrayList<>();
for (int i = 0; i < n; i++) {
g.add(new ArrayList<>());
}
for (int i = 0; i < n - 1; i++) {
int a = sc.nextInt() - 1;
int b = sc.nextInt() - 1;
g.get(a).add(b);
g.get(b).add(a);
}
int[] V = new int[q];
int[] K = new int[q];
for (int i = 0; i < q; i++) {
V[i] = sc.nextInt() - 1;
K[i] = sc.nextInt() - 1;
}
sc.close();
List<ArrayList<Integer>> subtree = new ArrayList<>();
for (int i = 0; i < n; i++) {
subtree.add(new ArrayList<>());
}
fnc(g, 0, 0, subtree,x);
for (int i = 0; i < q; i++) {
pw.println(subtree.get(V[i]).get(K[i]));
}
pw.close();
}
public static ArrayList<Integer> fnc(List<ArrayList<Integer>> g, int pos, int n, List<ArrayList<Integer>> subtree, int[] x) {
List<ArrayList<Integer>> st = new ArrayList<>();
for (int node : g.get(n)) {
if(pos != node){
st.add(fnc(g, n, node, subtree, x));
}
}
List<Integer> temp = new ArrayList<>();
ArrayList<Integer> ans = new ArrayList<>();
for (int i = 0; i < st.size(); i++) {
temp.addAll(st.get(i));
}
temp.add(x[n]);
Collections.sort(temp, Collections.reverseOrder());
for (int i = 0; i < Math.min(20, temp.size()); i++) {
ans.add(temp.get(i));
}
subtree.set(n, ans);
return ans;
}
} | ConDefects/ConDefects/Code/abc239_e/Java/31612827 |
condefects-java_data_909 | import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
import java.util.ArrayList;
import java.util.concurrent.*;
import java.util.function.*;
public final class Main{
public static void main(String[] args) throws Exception{
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out,false),log = new MyWriter(System.err,true);
int T = Solver.multi ? in.it() : 1;
while (T-- > 0)
Optional.ofNullable(new Solver(in,out,log).solve()).ifPresent(out::println);
out.flush();
}
}
class Solver extends BaseSolver{
public Solver(MyReader in,MyWriter out,MyWriter log){ super(in,out,log); }
public static boolean multi = false;
public Object solve(){
int N = in.it();
int K = in.it();
int[] P = in.idx(N);
int[] Q = new int[N];
for (int i = 0;i < N;i++)
Q[P[i]] = i;
List<int[]> list = new ArrayList<>();
for (int x = 0;x < N;x++) {
Stack<Integer> stk = new Stack<>();
for (int i = 0;i < x;i++)
if (Q[i] -Q[x] >= K)
stk.add(i);
stk.add(x);
int b = stk.pop();
while (!stk.isEmpty()) {
int a = stk.pop();
list.add(new int[]{Q[a] +1, Q[b] +1});
Q[a] ^= Q[b];
Q[b] ^= Q[a];
Q[a] ^= Q[b];
b = a;
}
}
out.println(list.size());
return list;
}
}
class Data extends BaseV{
long lo,lo2,nlo,v;
public Data(long lo,long lo2,long nlo,long v){
this.lo = lo;
this.lo2 = lo2;
this.nlo = nlo;
this.v = v;
}
@Override
public String toString(){ return v +""; }
}
abstract class ReRootingDp<L, D, A> extends Graph<L>{
private D[] dp;
private A[] ans;
public ReRootingDp(int N){
super(N,false);
dp = Util.cast(new Object[2 *N]);
ans = Util.cast(Array.newInstance(ans(0,e()).getClass(),n));
}
protected abstract D e();
protected abstract D agg(D a,D b);
protected abstract D adj(D v,Edge<L> e);
protected abstract A ans(int u,D sum);
protected MyList<D> sur(int u){ return go(u).map(e -> dp[e.id]); }
public A[] calc(){
for (var e:es)
e.re.id += n;
var stk = new MyStack<Edge<L>>();
var se = new Edge<L>(n -1,-1,0,null);
stk.add(se);
while (!stk.isEmpty()) {
var e = stk.pop();
if (dp[e.id] == null) {
dp[e.id] = e();
for (var ee:go(e.v))
if (ee != e.re) {
stk.add(ee);
stk.add(ee);
}
} else {
for (var ee:go(e.v))
if (ee != e.re)
dp[e.id] = agg(dp[e.id],dp[ee.id]);
if (e.u > -1)
dp[e.id] = adj(dp[e.id],e);
}
}
stk.add(se);
while (!stk.isEmpty()) {
var e = stk.pop();
var es = go(e.v);
int n = es.size();
D[] pre = Util.cast(new Object[n +1]),suf = Util.cast(new Object[n +1]);
pre[0] = e();
suf[n] = e();
for (int i = 0;i < n;i++) {
pre[i +1] = agg(pre[i],dp[es.get(i).id]);
suf[n -1 -i] = agg(dp[es.get(n -1 -i).id],suf[n -i]);
}
ans[e.v] = ans(e.v,suf[0]);
for (int i = 0;i < n;i++) {
Edge<L> ee = es.get(i);
if (ee != e.re) {
dp[ee.re.id] = adj(agg(pre[i],suf[i +1]),ee.re);
stk.add(ee);
}
}
}
return ans;
}
public void clear(){
dp[n -1] = null;
for (var e:es) {
dp[e.id] = dp[e.re.id] = null;
go(e.u).clear();
go(e.v).clear();
}
es.clear();
}
}
class HLD extends Graph<Object>{
private int[] p,hp,l,r;
public int[] dpt;
public HLD(int n){
super(n,false);
p = new int[n];
hp = new int[n];
l = new int[n];
r = new int[n];
}
public MyList<int[]> auxiliary(MyList<Integer> lis){
lis = new MyList<>(lis);
lis.add(0);
MyList<int[]> ret = new MyList<>();
lis.sort(Comparator.comparing(i -> l[i]));
for (int i = lis.size() -1;i > 0;i--)
lis.add(lca(lis.get(i -1),lis.get(i)));
lis.sort(Comparator.comparing(i -> l[i]));
MyStack<Integer> stk = new MyStack<>();
stk.add(lis.get(0));
for (var y:lis) {
while (r[stk.peek()] <= l[y])
stk.pop();
if (!stk.peek().equals(y))
ret.add(new int[]{stk.peek(), y});
stk.add(y);
}
return ret;
}
public MyList<int[]> getPath(int u,int v,int incLca){
MyList<int[]> ret = new MyList<>();
while (true) {
if (l[u] > l[v]) {
var t = u;
u = v;
v = t;
}
var h = hp[v];
if (l[h] <= l[u]) {
ret.add(new int[]{l[u] +1 -incLca, l[v] +1});
return ret;
}
ret.add(new int[]{l[h], l[v] +1});
v = p[h];
}
}
public int lca(int u,int v){
while (true) {
if (l[u] > l[v]) {
var t = u;
u = v;
v = t;
}
var h = hp[v];
if (l[h] <= l[u])
return u;
v = p[h];
}
}
public void makeTree(int s){
MyStack<Integer> stk = new MyStack<>();
fill(hp,-1);
p[s] = s;
stk.add(s);
stk.add(s);
while (!stk.isEmpty()) {
var u = stk.pop();
if (r[u] < 1) {
r[u] = 1;
for (var e:go(u)) {
if (e.v == p[u])
continue;
es.set(e.id,e);
p[e.v] = u;
stk.add(e.v);
stk.add(e.v);
}
} else if (u != s)
r[p[u]] += r[u];
}
for (int u = 0;u < n;u++) {
var go = go(u);
for (int i = 1;i < go.size();i++)
if (r[u] < r[go.get(0).v] || r[go.get(0).v] < r[go.get(i).v] && r[go.get(i).v] < r[u])
go.swap(0,i);
}
stk.add(s);
for (int hid = 0;!stk.isEmpty();) {
var u = stk.pop();
r[u] += l[u] = hid++;
if (hp[u] < 0)
hp[u] = u;
var go = go(u);
for (int i = go.size();i-- > 0;) {
var v = go.get(i).v;
if (v == p[u])
continue;
if (i == 0)
hp[v] = hp[u];
stk.add(v);
}
}
}
}
class Edge<L> {
public int id,u,v;
public L val;
public Edge<L> re;
public Edge(int id,int u,int v,L val){
this.id = id;
this.u = u;
this.v = v;
this.val = val;
}
}
class Graph<L> {
public int n;
public MyList<Edge<L>> es;
private MyList<Edge<L>>[] go,bk;
public Graph(int n,boolean dir){
this.n = n;
go = Util.cast(new MyList[n]);
bk = dir ? Util.cast(new MyList[n]) : go;
for (int i = 0;i < n;i++) {
go[i] = new MyList<>();
bk[i] = new MyList<>();
}
es = new MyList<>();
}
protected L inv(L l){ return l; }
public void addEdge(int u,int v){ addEdge(u,v,null); }
public void addEdge(int u,int v,L l){
var e = new Edge<>(es.size(),u,v,l);
var re = new Edge<>(e.id,e.v,e.u,inv(e.val));
es.add(e);
go[u].add(re.re = e);
bk[v].add(e.re = re);
}
public MyList<Edge<L>> go(int u){ return go[u]; }
public MyList<Edge<L>> bk(int u){ return bk[u]; }
}
abstract class BaseV{
public int sz;
public boolean fail;
}
class MyStack<T> extends MyList<T>{
public T pop(){ return remove(size() -1); }
public T peek(){ return get(size() -1); }
}
class MyList<T> implements Iterable<T>{
private T[] arr;
private int sz;
public MyList(){ this(16); }
public MyList(int n){ arr = Util.cast(new Object[max(16,n)]); }
public MyList(MyList<T> org){
this(org.sz);
System.arraycopy(org.arr,0,arr,0,sz = org.sz);
}
public boolean isEmpty(){ return sz == 0; }
public int size(){ return sz; }
public T get(int i){ return arr[i]; }
public void add(T t){ (arr = sz < arr.length ? arr : copyOf(arr,sz *5 >>2))[sz++] = t; }
public T remove(int i){
var ret = arr[i];
sz--;
for (int j = i;j < sz;j++)
arr[j] = arr[j +1];
return ret;
}
public T removeFast(int i){
var ret = arr[i];
arr[i] = arr[--sz];
return ret;
}
public void sort(){ sort(Util.cast(Comparator.naturalOrder())); }
public void sort(Comparator<T> cmp){ Arrays.sort(arr,0,sz,cmp); }
@Override
public Iterator<T> iterator(){
return new Iterator<>(){
int i = 0;
@Override
public boolean hasNext(){ return i < sz; }
@Override
public T next(){ return arr[i++]; }
};
}
public <U> MyList<U> map(Function<T, U> func){
MyList<U> ret = new MyList<>(sz);
forEach(t -> ret.add(func.apply(t)));
return ret;
}
public T[] toArray(){
if (sz == 0)
return Util.cast(new Object[0]);
T[] ret = Util.cast(Array.newInstance(arr[0].getClass(),sz));
for (int i = 0;i < sz;i++)
ret[i] = arr[i];
return ret;
}
public void swap(int i,int j){
var t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
public void set(int i,T t){ arr[i] = t; }
public void clear(){ sz = 0; }
}
class BaseSolver extends Util{
public MyReader in;
public MyWriter out,log;
public BaseSolver(MyReader in,MyWriter out,MyWriter log){
this.in = in;
this.out = out;
this.log = log;
}
protected int[][] addId(int[][] T){
return arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
protected long inv(long x){ return pow(x,mod -2); }
protected long pow(long x,long n){ return pow(x,n,Util.mod); }
protected long pow(long x,long n,long mod){
long ret = 1;
for (x %= mod;0 < n;x = x *x %mod,n >>= 1)
if ((n &1) == 1)
ret = ret *x %mod;
return ret;
}
protected int bSearchI(int o,int n,IntPredicate judge){
if (!judge.test(o))
return o -Integer.signum(n -o);
for (int m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected long bSearchL(long o,long n,LongPredicate judge){
for (long m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected double bSearchD(double o,double n,DoublePredicate judge){
for (double m,c = 0;c < 100;c++)
m = judge.test(m = (o +n) /2) ? (o = m) : (n = m);
return o;
}
protected long gcd(long a,long b){
while (0 < b) {
long t = a;
a = b;
b = t %b;
}
return a;
}
public long lcm(long a,long b){ return b /gcd(a,b) *a; }
protected long ceil(long a,long b){ return (a +b -1) /b; }
}
class Util{
public static String yes = "Yes",no = "No";
public static int infI = (1 <<30) -1;
public static long infL = (1L <<61 |1 <<30) -1,
mod = 998244353;
public static Random rd = ThreadLocalRandom.current();
private long st = System.currentTimeMillis();
protected long elapsed(){ return System.currentTimeMillis() -st; }
protected void reset(){ st = System.currentTimeMillis(); }
public static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
public static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
public static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
public static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
@SuppressWarnings("unchecked")
public static <T> T cast(Object obj){ return (T) obj; }
}
class MyReader{
private byte[] buf = new byte[1 <<16];
private int ptr,tail;
private InputStream in;
public MyReader(InputStream in){ this.in = in; }
private byte read(){
if (ptr == tail)
try {
tail = in.read(buf);
ptr = 0;
} catch (IOException e) {}
return buf[ptr++];
}
private boolean isPrintable(byte c){ return 32 < c && c < 127; }
private byte nextPrintable(){
byte ret = read();
while (!isPrintable(ret))
ret = read();
return ret;
}
public int it(){ return toIntExact(lg()); }
public int[] it(int N){ return Util.arrI(N,i -> it()); }
public int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
public int idx(){ return it() -1; }
public int[] idx(int N){ return Util.arrI(N,i -> idx()); }
public int[][] idx(int H,int W){ return Util.arr(new int[H][],i -> idx(W)); }
public long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
public long[] lg(int N){ return Util.arrL(N,i -> lg()); }
public long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
public double dbl(){ return Double.parseDouble(str()); }
public double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
public double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
public char[] ch(){ return str().toCharArray(); }
public char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
public String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
public String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
public String[] str(int N){ return Util.arr(new String[N],i -> str()); }
public String[][] str(int H,int W){ return Util.arr(new String[H][],i -> str(W)); }
}
class MyWriter{
private OutputStream out;
private byte[] buf = new byte[1 <<16],ibuf = new byte[20];
private int tail;
private boolean autoflush;
public MyWriter(OutputStream out,boolean autoflush){
this.out = out;
this.autoflush = autoflush;
}
public void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
private void ln(){
write((byte) '\n');
if (autoflush)
flush();
}
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
while (i < ibuf.length)
write(ibuf[i++]);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Util.yes : Util.no);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else
print(Objects.toString(obj).toCharArray());
}
public void println(Object obj){
if (obj == null)
obj = "null";
if (obj instanceof Iterable<?>)
for (Object e:(Iterable<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
public void printlns(Object... o){
print(o);
ln();
}
}
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
import java.util.ArrayList;
import java.util.concurrent.*;
import java.util.function.*;
public final class Main{
public static void main(String[] args) throws Exception{
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out,false),log = new MyWriter(System.err,true);
int T = Solver.multi ? in.it() : 1;
while (T-- > 0)
Optional.ofNullable(new Solver(in,out,log).solve()).ifPresent(out::println);
out.flush();
}
}
class Solver extends BaseSolver{
public Solver(MyReader in,MyWriter out,MyWriter log){ super(in,out,log); }
public static boolean multi = false;
public Object solve(){
int N = in.it();
int K = in.it();
int[] P = in.idx(N);
int[] Q = new int[N];
for (int i = 0;i < N;i++)
Q[P[i]] = i;
List<int[]> list = new ArrayList<>();
for (int x = 0;x < N;x++) {
Stack<Integer> stk = new Stack<>();
for (int i = 0;i < x;i++)
if (Q[i] -Q[x] >= K)
stk.add(i);
stk.add(x);
int b = stk.pop();
while (!stk.isEmpty()) {
int a = stk.pop();
list.add(new int[]{Q[b] +1, Q[a] +1});
Q[a] ^= Q[b];
Q[b] ^= Q[a];
Q[a] ^= Q[b];
b = a;
}
}
out.println(list.size());
return list;
}
}
class Data extends BaseV{
long lo,lo2,nlo,v;
public Data(long lo,long lo2,long nlo,long v){
this.lo = lo;
this.lo2 = lo2;
this.nlo = nlo;
this.v = v;
}
@Override
public String toString(){ return v +""; }
}
abstract class ReRootingDp<L, D, A> extends Graph<L>{
private D[] dp;
private A[] ans;
public ReRootingDp(int N){
super(N,false);
dp = Util.cast(new Object[2 *N]);
ans = Util.cast(Array.newInstance(ans(0,e()).getClass(),n));
}
protected abstract D e();
protected abstract D agg(D a,D b);
protected abstract D adj(D v,Edge<L> e);
protected abstract A ans(int u,D sum);
protected MyList<D> sur(int u){ return go(u).map(e -> dp[e.id]); }
public A[] calc(){
for (var e:es)
e.re.id += n;
var stk = new MyStack<Edge<L>>();
var se = new Edge<L>(n -1,-1,0,null);
stk.add(se);
while (!stk.isEmpty()) {
var e = stk.pop();
if (dp[e.id] == null) {
dp[e.id] = e();
for (var ee:go(e.v))
if (ee != e.re) {
stk.add(ee);
stk.add(ee);
}
} else {
for (var ee:go(e.v))
if (ee != e.re)
dp[e.id] = agg(dp[e.id],dp[ee.id]);
if (e.u > -1)
dp[e.id] = adj(dp[e.id],e);
}
}
stk.add(se);
while (!stk.isEmpty()) {
var e = stk.pop();
var es = go(e.v);
int n = es.size();
D[] pre = Util.cast(new Object[n +1]),suf = Util.cast(new Object[n +1]);
pre[0] = e();
suf[n] = e();
for (int i = 0;i < n;i++) {
pre[i +1] = agg(pre[i],dp[es.get(i).id]);
suf[n -1 -i] = agg(dp[es.get(n -1 -i).id],suf[n -i]);
}
ans[e.v] = ans(e.v,suf[0]);
for (int i = 0;i < n;i++) {
Edge<L> ee = es.get(i);
if (ee != e.re) {
dp[ee.re.id] = adj(agg(pre[i],suf[i +1]),ee.re);
stk.add(ee);
}
}
}
return ans;
}
public void clear(){
dp[n -1] = null;
for (var e:es) {
dp[e.id] = dp[e.re.id] = null;
go(e.u).clear();
go(e.v).clear();
}
es.clear();
}
}
class HLD extends Graph<Object>{
private int[] p,hp,l,r;
public int[] dpt;
public HLD(int n){
super(n,false);
p = new int[n];
hp = new int[n];
l = new int[n];
r = new int[n];
}
public MyList<int[]> auxiliary(MyList<Integer> lis){
lis = new MyList<>(lis);
lis.add(0);
MyList<int[]> ret = new MyList<>();
lis.sort(Comparator.comparing(i -> l[i]));
for (int i = lis.size() -1;i > 0;i--)
lis.add(lca(lis.get(i -1),lis.get(i)));
lis.sort(Comparator.comparing(i -> l[i]));
MyStack<Integer> stk = new MyStack<>();
stk.add(lis.get(0));
for (var y:lis) {
while (r[stk.peek()] <= l[y])
stk.pop();
if (!stk.peek().equals(y))
ret.add(new int[]{stk.peek(), y});
stk.add(y);
}
return ret;
}
public MyList<int[]> getPath(int u,int v,int incLca){
MyList<int[]> ret = new MyList<>();
while (true) {
if (l[u] > l[v]) {
var t = u;
u = v;
v = t;
}
var h = hp[v];
if (l[h] <= l[u]) {
ret.add(new int[]{l[u] +1 -incLca, l[v] +1});
return ret;
}
ret.add(new int[]{l[h], l[v] +1});
v = p[h];
}
}
public int lca(int u,int v){
while (true) {
if (l[u] > l[v]) {
var t = u;
u = v;
v = t;
}
var h = hp[v];
if (l[h] <= l[u])
return u;
v = p[h];
}
}
public void makeTree(int s){
MyStack<Integer> stk = new MyStack<>();
fill(hp,-1);
p[s] = s;
stk.add(s);
stk.add(s);
while (!stk.isEmpty()) {
var u = stk.pop();
if (r[u] < 1) {
r[u] = 1;
for (var e:go(u)) {
if (e.v == p[u])
continue;
es.set(e.id,e);
p[e.v] = u;
stk.add(e.v);
stk.add(e.v);
}
} else if (u != s)
r[p[u]] += r[u];
}
for (int u = 0;u < n;u++) {
var go = go(u);
for (int i = 1;i < go.size();i++)
if (r[u] < r[go.get(0).v] || r[go.get(0).v] < r[go.get(i).v] && r[go.get(i).v] < r[u])
go.swap(0,i);
}
stk.add(s);
for (int hid = 0;!stk.isEmpty();) {
var u = stk.pop();
r[u] += l[u] = hid++;
if (hp[u] < 0)
hp[u] = u;
var go = go(u);
for (int i = go.size();i-- > 0;) {
var v = go.get(i).v;
if (v == p[u])
continue;
if (i == 0)
hp[v] = hp[u];
stk.add(v);
}
}
}
}
class Edge<L> {
public int id,u,v;
public L val;
public Edge<L> re;
public Edge(int id,int u,int v,L val){
this.id = id;
this.u = u;
this.v = v;
this.val = val;
}
}
class Graph<L> {
public int n;
public MyList<Edge<L>> es;
private MyList<Edge<L>>[] go,bk;
public Graph(int n,boolean dir){
this.n = n;
go = Util.cast(new MyList[n]);
bk = dir ? Util.cast(new MyList[n]) : go;
for (int i = 0;i < n;i++) {
go[i] = new MyList<>();
bk[i] = new MyList<>();
}
es = new MyList<>();
}
protected L inv(L l){ return l; }
public void addEdge(int u,int v){ addEdge(u,v,null); }
public void addEdge(int u,int v,L l){
var e = new Edge<>(es.size(),u,v,l);
var re = new Edge<>(e.id,e.v,e.u,inv(e.val));
es.add(e);
go[u].add(re.re = e);
bk[v].add(e.re = re);
}
public MyList<Edge<L>> go(int u){ return go[u]; }
public MyList<Edge<L>> bk(int u){ return bk[u]; }
}
abstract class BaseV{
public int sz;
public boolean fail;
}
class MyStack<T> extends MyList<T>{
public T pop(){ return remove(size() -1); }
public T peek(){ return get(size() -1); }
}
class MyList<T> implements Iterable<T>{
private T[] arr;
private int sz;
public MyList(){ this(16); }
public MyList(int n){ arr = Util.cast(new Object[max(16,n)]); }
public MyList(MyList<T> org){
this(org.sz);
System.arraycopy(org.arr,0,arr,0,sz = org.sz);
}
public boolean isEmpty(){ return sz == 0; }
public int size(){ return sz; }
public T get(int i){ return arr[i]; }
public void add(T t){ (arr = sz < arr.length ? arr : copyOf(arr,sz *5 >>2))[sz++] = t; }
public T remove(int i){
var ret = arr[i];
sz--;
for (int j = i;j < sz;j++)
arr[j] = arr[j +1];
return ret;
}
public T removeFast(int i){
var ret = arr[i];
arr[i] = arr[--sz];
return ret;
}
public void sort(){ sort(Util.cast(Comparator.naturalOrder())); }
public void sort(Comparator<T> cmp){ Arrays.sort(arr,0,sz,cmp); }
@Override
public Iterator<T> iterator(){
return new Iterator<>(){
int i = 0;
@Override
public boolean hasNext(){ return i < sz; }
@Override
public T next(){ return arr[i++]; }
};
}
public <U> MyList<U> map(Function<T, U> func){
MyList<U> ret = new MyList<>(sz);
forEach(t -> ret.add(func.apply(t)));
return ret;
}
public T[] toArray(){
if (sz == 0)
return Util.cast(new Object[0]);
T[] ret = Util.cast(Array.newInstance(arr[0].getClass(),sz));
for (int i = 0;i < sz;i++)
ret[i] = arr[i];
return ret;
}
public void swap(int i,int j){
var t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
public void set(int i,T t){ arr[i] = t; }
public void clear(){ sz = 0; }
}
class BaseSolver extends Util{
public MyReader in;
public MyWriter out,log;
public BaseSolver(MyReader in,MyWriter out,MyWriter log){
this.in = in;
this.out = out;
this.log = log;
}
protected int[][] addId(int[][] T){
return arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
protected long inv(long x){ return pow(x,mod -2); }
protected long pow(long x,long n){ return pow(x,n,Util.mod); }
protected long pow(long x,long n,long mod){
long ret = 1;
for (x %= mod;0 < n;x = x *x %mod,n >>= 1)
if ((n &1) == 1)
ret = ret *x %mod;
return ret;
}
protected int bSearchI(int o,int n,IntPredicate judge){
if (!judge.test(o))
return o -Integer.signum(n -o);
for (int m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected long bSearchL(long o,long n,LongPredicate judge){
for (long m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected double bSearchD(double o,double n,DoublePredicate judge){
for (double m,c = 0;c < 100;c++)
m = judge.test(m = (o +n) /2) ? (o = m) : (n = m);
return o;
}
protected long gcd(long a,long b){
while (0 < b) {
long t = a;
a = b;
b = t %b;
}
return a;
}
public long lcm(long a,long b){ return b /gcd(a,b) *a; }
protected long ceil(long a,long b){ return (a +b -1) /b; }
}
class Util{
public static String yes = "Yes",no = "No";
public static int infI = (1 <<30) -1;
public static long infL = (1L <<61 |1 <<30) -1,
mod = 998244353;
public static Random rd = ThreadLocalRandom.current();
private long st = System.currentTimeMillis();
protected long elapsed(){ return System.currentTimeMillis() -st; }
protected void reset(){ st = System.currentTimeMillis(); }
public static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
public static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
public static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
public static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
@SuppressWarnings("unchecked")
public static <T> T cast(Object obj){ return (T) obj; }
}
class MyReader{
private byte[] buf = new byte[1 <<16];
private int ptr,tail;
private InputStream in;
public MyReader(InputStream in){ this.in = in; }
private byte read(){
if (ptr == tail)
try {
tail = in.read(buf);
ptr = 0;
} catch (IOException e) {}
return buf[ptr++];
}
private boolean isPrintable(byte c){ return 32 < c && c < 127; }
private byte nextPrintable(){
byte ret = read();
while (!isPrintable(ret))
ret = read();
return ret;
}
public int it(){ return toIntExact(lg()); }
public int[] it(int N){ return Util.arrI(N,i -> it()); }
public int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
public int idx(){ return it() -1; }
public int[] idx(int N){ return Util.arrI(N,i -> idx()); }
public int[][] idx(int H,int W){ return Util.arr(new int[H][],i -> idx(W)); }
public long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
public long[] lg(int N){ return Util.arrL(N,i -> lg()); }
public long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
public double dbl(){ return Double.parseDouble(str()); }
public double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
public double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
public char[] ch(){ return str().toCharArray(); }
public char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
public String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
public String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
public String[] str(int N){ return Util.arr(new String[N],i -> str()); }
public String[][] str(int H,int W){ return Util.arr(new String[H][],i -> str(W)); }
}
class MyWriter{
private OutputStream out;
private byte[] buf = new byte[1 <<16],ibuf = new byte[20];
private int tail;
private boolean autoflush;
public MyWriter(OutputStream out,boolean autoflush){
this.out = out;
this.autoflush = autoflush;
}
public void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
private void ln(){
write((byte) '\n');
if (autoflush)
flush();
}
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
while (i < ibuf.length)
write(ibuf[i++]);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Util.yes : Util.no);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else
print(Objects.toString(obj).toCharArray());
}
public void println(Object obj){
if (obj == null)
obj = "null";
if (obj instanceof Iterable<?>)
for (Object e:(Iterable<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
public void printlns(Object... o){
print(o);
ln();
}
}
| ConDefects/ConDefects/Code/arc180_b/Java/55037319 |
condefects-java_data_910 | import java.util.*;
import java.io.*;
public class Main {
public static Scanner sc = new Scanner(System.in);
public static PrintWriter pw = new PrintWriter(System.out);
public static void main(String[] args) {
int t = 1;
while( t > 0 ) {
solve();
t--;
}
pw.flush();
}
static void solve() {
int N = sc.nextInt();
Pair[] xy = new Pair[N];
long px = 1;
long py = 0;
long ans = 0;
for( int i = 0; i < N; i++ ) {
long x = sc.nextInt();
long y = sc.nextInt();
xy[i] = new Pair(x,y);
}
Arrays.sort( xy, (p0,p1) -> p0.b*(p1.a-1) > p1.b*(p0.a-1) ? 1 : -1 );
for( int i = 0; i < N; i++ ) {
if( py*xy[i].a <= px*(xy[i].b-1) ) {
ans++;
px = xy[i].a-1;
py = xy[i].b-1;
}
}
pw.println(ans);
}
}
class Pair {
long a,b;
public Pair(long a, long b) {
this.a = a;
this.b = b;
}
}
import java.util.*;
import java.io.*;
public class Main {
public static Scanner sc = new Scanner(System.in);
public static PrintWriter pw = new PrintWriter(System.out);
public static void main(String[] args) {
int t = 1;
while( t > 0 ) {
solve();
t--;
}
pw.flush();
}
static void solve() {
int N = sc.nextInt();
Pair[] xy = new Pair[N];
long px = 1;
long py = 0;
long ans = 0;
for( int i = 0; i < N; i++ ) {
long x = sc.nextInt();
long y = sc.nextInt();
xy[i] = new Pair(x,y);
}
Arrays.sort( xy, (p0,p1) -> p0.b*(p1.a-1) > p1.b*(p0.a-1) ? 1 : -1 );
for( int i = 0; i < N; i++ ) {
if( py*xy[i].a <= px*(xy[i].b-1) ) {
ans++;
px = xy[i].a-1;
py = xy[i].b;
}
}
pw.println(ans);
}
}
class Pair {
long a,b;
public Pair(long a, long b) {
this.a = a;
this.b = b;
}
} | ConDefects/ConDefects/Code/abc225_e/Java/29931120 |
condefects-java_data_911 | // temprate
import java.util.*;
import static java.lang.Math.*;
public class Main{
public static void main(String[] args){
var in = new Scanner(System.in);
// ~~~
int N = in.nextInt();
var A = new HashSet<Integer>();
for ( int i = 0 ; N > i ; i++ ){
A.add( in.nextInt() );
}
int ans = 0;
for ( int i = 0 ; N > i ; i++ ){
if ( !( A.contains( i ) ) ){
ans = i;
break;
}
}
System.out.println( ans );
}
}
// temprate
import java.util.*;
import static java.lang.Math.*;
public class Main{
public static void main(String[] args){
var in = new Scanner(System.in);
// ~~~
int N = in.nextInt();
var A = new HashSet<Integer>();
for ( int i = 0 ; N > i ; i++ ){
A.add( in.nextInt() );
}
int ans = 0;
for ( int i = 0 ; N + 1 > i ; i++ ){
if ( !( A.contains( i ) ) ){
ans = i;
break;
}
}
System.out.println( ans );
}
} | ConDefects/ConDefects/Code/abc245_b/Java/39768975 |
condefects-java_data_912 | import java.util.*;
import java.io.*;
class Main{
public static void main(String[] args) {
FastScanner str=new FastScanner(System.in);
int n=str.nextInt();
List<Integer>list=new ArrayList<>();
for(int i=0;i<n;i++){
int x=str.nextInt();
list.add(x);
}
Collections.sort(list);
int ans=0;
for(int i=0;i<2000;i++){
if(!(list.contains(i))){
ans=i;
break;
}
}
System.out.println(ans);
}
}
class FastScanner implements Closeable {
private final InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
public FastScanner(InputStream in) {
this.in = in;
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
public void close() {
try {
in.close();
} catch (IOException e) {
}
}
}
import java.util.*;
import java.io.*;
class Main{
public static void main(String[] args) {
FastScanner str=new FastScanner(System.in);
int n=str.nextInt();
List<Integer>list=new ArrayList<>();
for(int i=0;i<n;i++){
int x=str.nextInt();
list.add(x);
}
Collections.sort(list);
int ans=0;
for(int i=0;i<=2000;i++){
if(!(list.contains(i))){
ans=i;
break;
}
}
System.out.println(ans);
}
}
class FastScanner implements Closeable {
private final InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
public FastScanner(InputStream in) {
this.in = in;
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
public void close() {
try {
in.close();
} catch (IOException e) {
}
}
}
| ConDefects/ConDefects/Code/abc245_b/Java/35859578 |
condefects-java_data_913 | import javax.crypto.spec.PSource;
import java.util.*;
public class Main {
public static void main(String[]args){
Scanner scan = new Scanner(System.in);
int n=scan.nextInt();
int ar[]=new int[n];
for(int i=0;i<n;i++){
ar[i]=scan.nextInt();
}
Arrays.sort(ar);
for(int i=0;i<2000;i++){
if(Arrays.binarySearch(ar,i)>=0)continue;
else
System.out.println(i);
break;
}
}
}
import javax.crypto.spec.PSource;
import java.util.*;
public class Main {
public static void main(String[]args){
Scanner scan = new Scanner(System.in);
int n=scan.nextInt();
int ar[]=new int[n];
for(int i=0;i<n;i++){
ar[i]=scan.nextInt();
}
Arrays.sort(ar);
for(int i=0;i<=2000;i++){
if(Arrays.binarySearch(ar,i)>=0)continue;
else
System.out.println(i);
break;
}
}
}
| ConDefects/ConDefects/Code/abc245_b/Java/36217434 |
condefects-java_data_914 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
//B - Mex
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] arr = new int[N];
int ans = 0;
for(int i=0; i<N; i++) {
arr[i] = sc.nextInt();
}
for(int i=1; i==i; i++) {
int cnt = 0;
for(int j=0; j<arr.length; j++) {
if(arr[j] == i) cnt++;
}
if(cnt == 0) {
ans = i;
break;
}
}
System.out.println(ans);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
//B - Mex
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] arr = new int[N];
int ans = 0;
for(int i=0; i<N; i++) {
arr[i] = sc.nextInt();
}
for(int i=0; i==i; i++) {
int cnt = 0;
for(int j=0; j<arr.length; j++) {
if(arr[j] == i) cnt++;
}
if(cnt == 0) {
ans = i;
break;
}
}
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc245_b/Java/35823320 |
condefects-java_data_915 | import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.Buffer;
import java.util.StringTokenizer;
/*
* Solution: 1m
* Coding: 4m
* Time: 5m
*
*/
public class Main {
public static void main(String[] args) throws IOException {
//BufferedReader br = new BufferedReader(new FileReader("atcoder_abc/input.in"));
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int[] arr = new int[2001];
StringTokenizer st = new StringTokenizer(br.readLine());
for(int i = 0;i < n;i++){
int cur = Integer.parseInt(st.nextToken());
arr[cur] = 1;
}
br.close();
for(int i = 0;i < 2000;i++){
if(arr[i] == 0){
System.out.println(i);
return;
}
}
System.out.println(2001);
}
}
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.Buffer;
import java.util.StringTokenizer;
/*
* Solution: 1m
* Coding: 4m
* Time: 5m
*
*/
public class Main {
public static void main(String[] args) throws IOException {
//BufferedReader br = new BufferedReader(new FileReader("atcoder_abc/input.in"));
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int[] arr = new int[2001];
StringTokenizer st = new StringTokenizer(br.readLine());
for(int i = 0;i < n;i++){
int cur = Integer.parseInt(st.nextToken());
arr[cur] = 1;
}
br.close();
for(int i = 0;i <= 2000;i++){
if(arr[i] == 0){
System.out.println(i);
return;
}
}
System.out.println(2001);
}
}
| ConDefects/ConDefects/Code/abc245_b/Java/41127680 |
condefects-java_data_916 | import java.util.*;
import java.io.*;
class Main{
void solve(PrintWriter out, In in) {
int n = in.nextInt();
PriorityQueue<Integer> value1 = new PriorityQueue<>();
PriorityQueue<Integer> value2 = new PriorityQueue<>(Comparator.reverseOrder());
int [] A = in.IntArray(n);
int [] ans = new int[n];
for(int i = 0 ; i < n ; i ++ ) {
value1.add(A[i]);
value2.add(A[i]);
}
for(int i = 1 ; i < n ; i += 2 ) {
ans[i] = value2.poll();
}
for(int i = 0 ; i < n ; i += 2 ) {
ans[i] = value1.poll();
}
for(int i = 1 ; i < n ; i += 2 ) {
if(ans[i-1] < ans[i] && ans[i] > ans[i+1]) continue;
out.println(no);
return;
}
out.println(yes);
}
/* Library */
/* ------- */
public static void main(String[] args) {
PrintWriter out = new PrintWriter(System.out);
In in = new In();
new Main().solve(out,in);
out.flush();
}
final long MOD7 = 1000000007; final long MOD9 = 998244353 ;
final int [] X4 = {0,1,0,-1}; final int [] Y4 = {-1,0,1,0};
final int [] X8 = {-1,-1,0,1,1,1,0,-1}; final int [] Y8 = {0,1,1,1,0,-1,-1,-1};
final int Inf = (int)1e9; final long Lnf = (long)1e18;
final String yes = "Yes"; final String no = "No";
}
/* Class */
/* ----- */
class Pair{
private int first ;
private int second;
Pair(int first,int second) {
this.first = first;
this.second = second;
}
int first() { return this.first ; }
int second() { return this.second; }
@Override
public String toString(){ return first()+" = "+second(); }
}
class PairII {
private int first ;
private int second ;
private int third;
PairII(int first, int second, int third) {
this.first = first;
this.second = second;
this.third = third;
}
int first() { return this.first ; }
int second() { return this.second; }
int third() { return this.third ; }
@Override
public String toString(){ return first()+" = "+second()+" = "+third() ; }
}
class In{
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++]; else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) {
ptr++;
}
return hasNextByte();
}
String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
double nextDouble() {
return Double.parseDouble(next());
}
int [] IntArray(int n) {
final int [] Array = new int [n];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = nextInt();
}
return Array;
}
int [][] IntArray(int n , int m) {
final int [][] Array = new int [n][m];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = IntArray(m);
}
return Array;
}
long [] LongArray(int n) {
final long [] Array = new long [n];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = nextLong();
}
return Array;
}
long [][] LongArray(int n , int m) {
final long [][] Array = new long [n][m];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = LongArray(m);
}
return Array;
}
String [] StringArray(int n) {
final String [] Array = new String [n];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = next();
}
return Array;
}
char [] CharArray(int n) {
final char [] Array = new char[n];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = next().charAt(0);
}
return Array;
}
char [][] CharArray(int n , int m) {
final char [][] Array = new char [n][m];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = next().toCharArray();
}
return Array;
}
}
import java.util.*;
import java.io.*;
class Main{
void solve(PrintWriter out, In in) {
int n = in.nextInt();
PriorityQueue<Integer> value1 = new PriorityQueue<>();
PriorityQueue<Integer> value2 = new PriorityQueue<>(Comparator.reverseOrder());
int [] A = in.IntArray(n);
int [] ans = new int[n];
for(int i = 0 ; i < n ; i ++ ) {
value1.add(A[i]);
value2.add(A[i]);
}
for(int i = 1 ; i < n ; i += 2 ) {
ans[i] = value2.poll();
}
for(int i = n - 1 ; i >= 0 ; i -= 2 ) {
ans[i] = value1.poll();
}
for(int i = 1 ; i < n ; i += 2 ) {
if(ans[i-1] < ans[i] && ans[i] > ans[i+1]) continue;
out.println(no);
return;
}
out.println(yes);
}
/* Library */
/* ------- */
public static void main(String[] args) {
PrintWriter out = new PrintWriter(System.out);
In in = new In();
new Main().solve(out,in);
out.flush();
}
final long MOD7 = 1000000007; final long MOD9 = 998244353 ;
final int [] X4 = {0,1,0,-1}; final int [] Y4 = {-1,0,1,0};
final int [] X8 = {-1,-1,0,1,1,1,0,-1}; final int [] Y8 = {0,1,1,1,0,-1,-1,-1};
final int Inf = (int)1e9; final long Lnf = (long)1e18;
final String yes = "Yes"; final String no = "No";
}
/* Class */
/* ----- */
class Pair{
private int first ;
private int second;
Pair(int first,int second) {
this.first = first;
this.second = second;
}
int first() { return this.first ; }
int second() { return this.second; }
@Override
public String toString(){ return first()+" = "+second(); }
}
class PairII {
private int first ;
private int second ;
private int third;
PairII(int first, int second, int third) {
this.first = first;
this.second = second;
this.third = third;
}
int first() { return this.first ; }
int second() { return this.second; }
int third() { return this.third ; }
@Override
public String toString(){ return first()+" = "+second()+" = "+third() ; }
}
class In{
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++]; else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) {
ptr++;
}
return hasNextByte();
}
String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
double nextDouble() {
return Double.parseDouble(next());
}
int [] IntArray(int n) {
final int [] Array = new int [n];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = nextInt();
}
return Array;
}
int [][] IntArray(int n , int m) {
final int [][] Array = new int [n][m];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = IntArray(m);
}
return Array;
}
long [] LongArray(int n) {
final long [] Array = new long [n];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = nextLong();
}
return Array;
}
long [][] LongArray(int n , int m) {
final long [][] Array = new long [n][m];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = LongArray(m);
}
return Array;
}
String [] StringArray(int n) {
final String [] Array = new String [n];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = next();
}
return Array;
}
char [] CharArray(int n) {
final char [] Array = new char[n];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = next().charAt(0);
}
return Array;
}
char [][] CharArray(int n , int m) {
final char [][] Array = new char [n][m];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = next().toCharArray();
}
return Array;
}
}
| ConDefects/ConDefects/Code/arc161_a/Java/41817219 |
condefects-java_data_917 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] array = new int[N];
for(int i = 0; i < N; i++) {
array[i] = sc.nextInt();
}
int max = 0;
for(int i = 0; i < N; i++) {
if(array[i] > max) {
max = array[i];
} else {
break;
}
}
StringBuilder ans = new StringBuilder();
for(int i = 0; i < N; i++) {
if(array[i] != max) {
ans.append(array[i]);
if(i != N - 1) {
ans.append(" ");
}
}
}
System.out.println(ans);
sc.close();
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] array = new int[N];
for(int i = 0; i < N; i++) {
array[i] = sc.nextInt();
}
int max = 0;
for(int i = 0; i < N; i++) {
if(array[i] >= max) {
max = array[i];
} else {
break;
}
}
StringBuilder ans = new StringBuilder();
for(int i = 0; i < N; i++) {
if(array[i] != max) {
ans.append(array[i]);
if(i != N - 1) {
ans.append(" ");
}
}
}
System.out.println(ans);
sc.close();
}
} | ConDefects/ConDefects/Code/arc133_a/Java/33286136 |
condefects-java_data_918 | import java.io.*;
import java.util.*;
public class Main {
static Scanner sc;
static PrintWriter out;
public static void main(String[] args) {
sc = new Scanner(System.in);
out = new PrintWriter(System.out);
new Main().solve();
out.flush();
}
int n;
int[] sub;
List<Integer>[] next ;
public void solve() {
n = sc.nextInt();
sub = new int[n];
sub2 = new int[n];
next = new List[n];
Arrays.setAll(next, i->new ArrayList<>());
for(int i=0; i<n-1; i++) {
int u = sc.nextInt()-1;
int v = sc.nextInt()-1;
next[u].add(v);
next[v].add(u);
}
res = new int[n];
try {
dfs1(0, -1);
} catch (MyException e) {
for (int i=0; i<n; i++) {
if (i>0) out.print(" ");
out.print(res[i]+1);
}
out.println();
return;
}
throw new RuntimeException();
}
void dfs1(int u, int p) {
sub[u] = 1;
int max = 0;
for(int v : next[u]) {
if(v!=p) {
dfs1(v, u);
max = Math.max(max, sub[v]);
}
}
if(p!=-1) {
sub[p] += sub[u];
}
if(n%2==0 && sub[u]==n/2) {
solve2(p, u);
throw new MyException();
}
max = Math.max(max, n-sub[u]);
if(max <= (n-1)/2) {
solve1(u, max);
throw new MyException();
}
}
int[] res;
int[] sub2;
void solve1(int x, int max) {
res[x] = x;
LinkedList<Integer> ll = new LinkedList<>();
int m = next[x].size();
int s = 0;
for(int i=0; i<m; i++) {
dfs10(next[x].get(i), x);
if(sub2[next[x].get(i)]==max) {
s = i;
}
}
for(int i=0; i<m; i++) {
dfs11(next[x].get((i+s)%m), x, ll);
}
for(int i=0; i<m; i++) {
dfs12(next[x].get((i+1+s)%m), x, ll);
}
}
void dfs10(int u, int p) {
sub2[u] = 1;
for(int v: next[u]) {
if(v==p) continue;
dfs10(v, u);
sub2[p] += sub2[u];
}
}
void dfs11(int u, int p, LinkedList<Integer> ll) {
ll.addLast(u);
for(int v: next[u]) {
if(v==p) continue;
dfs11(v, u, ll);
}
}
void dfs12(int u, int p, LinkedList<Integer> ll) {
res[u] = ll.removeFirst();
for(int v: next[u]) {
if(v==p) continue;
dfs12(v, u, ll);
}
}
void solve2(int x, int y) {
LinkedList<Integer> ll = new LinkedList<>();
dfs11(x, y, ll);
dfs11(y, x, ll);
dfs12(y, x, ll);
dfs12(x, y, ll);
}
class MyException extends RuntimeException {
public MyException() {}
}
}
import java.io.*;
import java.util.*;
public class Main {
static Scanner sc;
static PrintWriter out;
public static void main(String[] args) {
sc = new Scanner(System.in);
out = new PrintWriter(System.out);
new Main().solve();
out.flush();
}
int n;
int[] sub;
List<Integer>[] next ;
public void solve() {
n = sc.nextInt();
sub = new int[n];
sub2 = new int[n];
next = new List[n];
Arrays.setAll(next, i->new ArrayList<>());
for(int i=0; i<n-1; i++) {
int u = sc.nextInt()-1;
int v = sc.nextInt()-1;
next[u].add(v);
next[v].add(u);
}
res = new int[n];
try {
dfs1(0, -1);
} catch (MyException e) {
for (int i=0; i<n; i++) {
if (i>0) out.print(" ");
out.print(res[i]+1);
}
out.println();
return;
}
throw new RuntimeException();
}
void dfs1(int u, int p) {
sub[u] = 1;
int max = 0;
for(int v : next[u]) {
if(v!=p) {
dfs1(v, u);
max = Math.max(max, sub[v]);
}
}
if(p!=-1) {
sub[p] += sub[u];
}
if(n%2==0 && sub[u]==n/2) {
solve2(p, u);
throw new MyException();
}
max = Math.max(max, n-sub[u]);
if(max <= (n-1)/2) {
solve1(u, max);
throw new MyException();
}
}
int[] res;
int[] sub2;
void solve1(int x, int max) {
res[x] = x;
LinkedList<Integer> ll = new LinkedList<>();
int m = next[x].size();
int s = 0;
for(int i=0; i<m; i++) {
dfs10(next[x].get(i), x);
if(sub2[next[x].get(i)]==max) {
s = i;
}
}
for(int i=0; i<m; i++) {
dfs11(next[x].get((i+s)%m), x, ll);
}
for(int i=0; i<m; i++) {
dfs12(next[x].get((i+1+s)%m), x, ll);
}
}
void dfs10(int u, int p) {
sub2[u] = 1;
for(int v: next[u]) {
if(v==p) continue;
dfs10(v, u);
}
sub2[p] += sub2[u];
}
void dfs11(int u, int p, LinkedList<Integer> ll) {
ll.addLast(u);
for(int v: next[u]) {
if(v==p) continue;
dfs11(v, u, ll);
}
}
void dfs12(int u, int p, LinkedList<Integer> ll) {
res[u] = ll.removeFirst();
for(int v: next[u]) {
if(v==p) continue;
dfs12(v, u, ll);
}
}
void solve2(int x, int y) {
LinkedList<Integer> ll = new LinkedList<>();
dfs11(x, y, ll);
dfs11(y, x, ll);
dfs12(y, x, ll);
dfs12(x, y, ll);
}
class MyException extends RuntimeException {
public MyException() {}
}
}
| ConDefects/ConDefects/Code/arc156_c/Java/38985476 |
condefects-java_data_919 | import java.util.*;
import java.io.*;
import java.text.*;
public class Main{
//SOLUTION BEGIN
void pre() throws Exception{}
void solve(int TC) throws Exception {
int N = ni();
int[][] mat = new int[N][N];
int val = 1;
for(int s = 0; s <= N+N-2; s++) {
// List<int[]> list = new ArrayList<>();
int cnt = 0;
for(int i = 0; i<= s; i++){
int r = i, c = s-i;
if(Math.min(r, c) >= 0 && Math.max(r, c) < N)cnt++;//list.add()
}
List<Integer> list = new ArrayList<>();
int lo = val+1, hi = val+cnt;
val += cnt;
for(int i = 0; i< cnt; i++){
if(i%2 == 0)list.add(lo++);
else list.add(hi--);
}
for(int i = 0, j = 0; i<= s; i++){
int r = i, c = s-i;
if(Math.min(r, c) >= 0 && Math.max(r, c) < N)mat[r][c] = list.get(j++);
}
}
for(int i = 0; i< N; i++){
for(int j = 0; j< N; j++)p(mat[i][j]);
pn("");
}
}
boolean valid(int[][] mat){
for(int i = 0; i< mat.length; i++){
for(int j = 0; j< mat[i].length; j++){
int sm = 0, lg = 0;
for(int ii = Math.max(0, i-1); ii <= Math.min(mat.length-1, i+1); ii++)
for(int jj = Math.max(0, j-1); jj <= Math.min(mat[i].length-1, j+1); jj++)
if(mat[ii][jj] < mat[i][j])sm++;
else if(mat[ii][jj] > mat[i][j])lg++;
if(sm == lg){
dbg("Chk", i, j);
}
if(sm == lg)return false;
}
}
return true;
}
//SOLUTION END
void hold(boolean b)throws Exception{if(!b)throw new Exception("Hold right there, Sparky!");}
static void dbg(Object... o){System.err.println(Arrays.deepToString(o));}
void exit(boolean b){if(!b)System.exit(0);}
final long IINF = Long.MAX_VALUE/2;
final int INF = Integer.MAX_VALUE/2;
DecimalFormat df = new DecimalFormat("0.000000000");
double PI = 3.141592653589793238462643383279502884197169399, eps = 1e-9;
static boolean multipleTC = false, memory = false, fileIO = false;
FastReader in;PrintWriter out;
void run() throws Exception{
long ct = System.currentTimeMillis();
if (fileIO) {
in = new FastReader("");
out = new PrintWriter("");
} else {
in = new FastReader();
out = new PrintWriter(System.out);
}
//Solution Credits: Taranpreet Singh
int T = multipleTC? ni():1;
pre();
for (int t = 1; t <= T; t++) solve(t);
out.flush();
out.close();
System.err.println("Runtime: " + (System.currentTimeMillis() - ct));
}
public static void main(String[] args) throws Exception{
if(memory)new Thread(null, new Runnable() {public void run(){try{new Main().run();}catch(Exception e){e.printStackTrace();System.exit(1);}}}, "1", 1 << 26).start();
else new Main().run();
}
int[][] make(int n, int e, int[] from, int[] to, boolean f){
int[][] g = new int[n][];int[]cnt = new int[n];
for(int i = 0; i< e; i++){
cnt[from[i]]++;
if(f)cnt[to[i]]++;
}
for(int i = 0; i< n; i++)g[i] = new int[cnt[i]];
for(int i = 0; i< e; i++){
g[from[i]][--cnt[from[i]]] = to[i];
if(f)g[to[i]][--cnt[to[i]]] = from[i];
}
return g;
}
int[][][] makeS(int n, int e, int[] from, int[] to, boolean f){
int[][][] g = new int[n][][];int[]cnt = new int[n];
for(int i = 0; i< e; i++){
cnt[from[i]]++;
if(f)cnt[to[i]]++;
}
for(int i = 0; i< n; i++)g[i] = new int[cnt[i]][];
for(int i = 0; i< e; i++){
g[from[i]][--cnt[from[i]]] = new int[]{to[i], i, 0};
if(f)g[to[i]][--cnt[to[i]]] = new int[]{from[i], i, 1};
}
return g;
}
int[][] make(int n, int[] par, boolean f){
int[][] g = new int[n][];
int[] cnt = new int[n];
for(int x:par)cnt[x]++;
if(f)for(int i = 1; i< n; i++)cnt[i]++;
for(int i = 0; i< n; i++)g[i] = new int[cnt[i]];
for(int i = 1; i< n-1; i++){
g[par[i]][--cnt[par[i]]] = i;
if(f)g[i][--cnt[i]] = par[i];
}
return g;
}
int find(int[] set, int u){return set[u] = (set[u] == u?u:find(set, set[u]));}
int digit(long s){int brute = 0;while(s>0){s/=10;brute++;}return brute;}
long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}
void p(Object... o){for(Object oo:o)out.print(oo+" ");}
void pn(Object... o){
if(o.length == 0)out.println("");
for(int i = 0; i< o.length; i++){
out.print(o[i]);
out.print((i+1 == o.length?"\n":" "));
}
}
void pni(Object... o){for(Object oo:o)out.print(oo+" ");out.println();out.flush();}
String n()throws Exception{return in.next();}
String nln()throws Exception{return in.nextLine();}
int ni()throws Exception{return Integer.parseInt(in.next());}
long nl()throws Exception{return Long.parseLong(in.next());}
double nd()throws Exception{return Double.parseDouble(in.next());}
class FastReader{
BufferedReader br;
StringTokenizer st;
public FastReader(){
br = new BufferedReader(new InputStreamReader(System.in));
}
public FastReader(String s) throws Exception{
br = new BufferedReader(new FileReader(s));
}
String next() throws Exception{
while (st == null || !st.hasMoreElements()){
try{
st = new StringTokenizer(br.readLine());
}catch (IOException e){
throw new Exception(e.toString());
}
}
return st.nextToken();
}
String nextLine() throws Exception{
String str;
try{
str = br.readLine();
}catch (IOException e){
throw new Exception(e.toString());
}
return str;
}
}
}
import java.util.*;
import java.io.*;
import java.text.*;
public class Main{
//SOLUTION BEGIN
void pre() throws Exception{}
void solve(int TC) throws Exception {
int N = ni();
int[][] mat = new int[N][N];
int val = 0;
for(int s = 0; s <= N+N-2; s++) {
// List<int[]> list = new ArrayList<>();
int cnt = 0;
for(int i = 0; i<= s; i++){
int r = i, c = s-i;
if(Math.min(r, c) >= 0 && Math.max(r, c) < N)cnt++;//list.add()
}
List<Integer> list = new ArrayList<>();
int lo = val+1, hi = val+cnt;
val += cnt;
for(int i = 0; i< cnt; i++){
if(i%2 == 0)list.add(lo++);
else list.add(hi--);
}
for(int i = 0, j = 0; i<= s; i++){
int r = i, c = s-i;
if(Math.min(r, c) >= 0 && Math.max(r, c) < N)mat[r][c] = list.get(j++);
}
}
for(int i = 0; i< N; i++){
for(int j = 0; j< N; j++)p(mat[i][j]);
pn("");
}
}
boolean valid(int[][] mat){
for(int i = 0; i< mat.length; i++){
for(int j = 0; j< mat[i].length; j++){
int sm = 0, lg = 0;
for(int ii = Math.max(0, i-1); ii <= Math.min(mat.length-1, i+1); ii++)
for(int jj = Math.max(0, j-1); jj <= Math.min(mat[i].length-1, j+1); jj++)
if(mat[ii][jj] < mat[i][j])sm++;
else if(mat[ii][jj] > mat[i][j])lg++;
if(sm == lg){
dbg("Chk", i, j);
}
if(sm == lg)return false;
}
}
return true;
}
//SOLUTION END
void hold(boolean b)throws Exception{if(!b)throw new Exception("Hold right there, Sparky!");}
static void dbg(Object... o){System.err.println(Arrays.deepToString(o));}
void exit(boolean b){if(!b)System.exit(0);}
final long IINF = Long.MAX_VALUE/2;
final int INF = Integer.MAX_VALUE/2;
DecimalFormat df = new DecimalFormat("0.000000000");
double PI = 3.141592653589793238462643383279502884197169399, eps = 1e-9;
static boolean multipleTC = false, memory = false, fileIO = false;
FastReader in;PrintWriter out;
void run() throws Exception{
long ct = System.currentTimeMillis();
if (fileIO) {
in = new FastReader("");
out = new PrintWriter("");
} else {
in = new FastReader();
out = new PrintWriter(System.out);
}
//Solution Credits: Taranpreet Singh
int T = multipleTC? ni():1;
pre();
for (int t = 1; t <= T; t++) solve(t);
out.flush();
out.close();
System.err.println("Runtime: " + (System.currentTimeMillis() - ct));
}
public static void main(String[] args) throws Exception{
if(memory)new Thread(null, new Runnable() {public void run(){try{new Main().run();}catch(Exception e){e.printStackTrace();System.exit(1);}}}, "1", 1 << 26).start();
else new Main().run();
}
int[][] make(int n, int e, int[] from, int[] to, boolean f){
int[][] g = new int[n][];int[]cnt = new int[n];
for(int i = 0; i< e; i++){
cnt[from[i]]++;
if(f)cnt[to[i]]++;
}
for(int i = 0; i< n; i++)g[i] = new int[cnt[i]];
for(int i = 0; i< e; i++){
g[from[i]][--cnt[from[i]]] = to[i];
if(f)g[to[i]][--cnt[to[i]]] = from[i];
}
return g;
}
int[][][] makeS(int n, int e, int[] from, int[] to, boolean f){
int[][][] g = new int[n][][];int[]cnt = new int[n];
for(int i = 0; i< e; i++){
cnt[from[i]]++;
if(f)cnt[to[i]]++;
}
for(int i = 0; i< n; i++)g[i] = new int[cnt[i]][];
for(int i = 0; i< e; i++){
g[from[i]][--cnt[from[i]]] = new int[]{to[i], i, 0};
if(f)g[to[i]][--cnt[to[i]]] = new int[]{from[i], i, 1};
}
return g;
}
int[][] make(int n, int[] par, boolean f){
int[][] g = new int[n][];
int[] cnt = new int[n];
for(int x:par)cnt[x]++;
if(f)for(int i = 1; i< n; i++)cnt[i]++;
for(int i = 0; i< n; i++)g[i] = new int[cnt[i]];
for(int i = 1; i< n-1; i++){
g[par[i]][--cnt[par[i]]] = i;
if(f)g[i][--cnt[i]] = par[i];
}
return g;
}
int find(int[] set, int u){return set[u] = (set[u] == u?u:find(set, set[u]));}
int digit(long s){int brute = 0;while(s>0){s/=10;brute++;}return brute;}
long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}
void p(Object... o){for(Object oo:o)out.print(oo+" ");}
void pn(Object... o){
if(o.length == 0)out.println("");
for(int i = 0; i< o.length; i++){
out.print(o[i]);
out.print((i+1 == o.length?"\n":" "));
}
}
void pni(Object... o){for(Object oo:o)out.print(oo+" ");out.println();out.flush();}
String n()throws Exception{return in.next();}
String nln()throws Exception{return in.nextLine();}
int ni()throws Exception{return Integer.parseInt(in.next());}
long nl()throws Exception{return Long.parseLong(in.next());}
double nd()throws Exception{return Double.parseDouble(in.next());}
class FastReader{
BufferedReader br;
StringTokenizer st;
public FastReader(){
br = new BufferedReader(new InputStreamReader(System.in));
}
public FastReader(String s) throws Exception{
br = new BufferedReader(new FileReader(s));
}
String next() throws Exception{
while (st == null || !st.hasMoreElements()){
try{
st = new StringTokenizer(br.readLine());
}catch (IOException e){
throw new Exception(e.toString());
}
}
return st.nextToken();
}
String nextLine() throws Exception{
String str;
try{
str = br.readLine();
}catch (IOException e){
throw new Exception(e.toString());
}
return str;
}
}
}
| ConDefects/ConDefects/Code/arc142_b/Java/32595403 |
condefects-java_data_920 | import java.util.*;
import java.math.*;
class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
long X = sc.nextLong();
if(X > 0) {
System.out.print(X / 10 + 1);
} else {
System.out.print(X / 10);
}
}
}
import java.util.*;
import java.math.*;
class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
long X = sc.nextLong();
if(X > 0 && X % 10 != 0) {
System.out.print(X / 10 + 1);
} else {
System.out.print(X / 10);
}
}
} | ConDefects/ConDefects/Code/abc345_b/Java/52796358 |
condefects-java_data_921 | import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
// Your code here!
Scanner scan=new Scanner(System.in);
long input = scan.nextLong();
if(input + 9 < 0 && (input + 9) != 0){
long result = (long)((input + 9) / 10) - 1;
System.out.println(result);
}else{
long result = (long)((input + 9) / 10);
System.out.println(result);
}
//System.out.println(result);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
// Your code here!
Scanner scan=new Scanner(System.in);
long input = scan.nextLong();
if(input + 9 < 0 && (input + 9) % 10 != 0){
long result = (long)((input + 9) / 10) - 1;
System.out.println(result);
}else{
long result = (long)((input + 9) / 10);
System.out.println(result);
}
//System.out.println(result);
}
}
| ConDefects/ConDefects/Code/abc345_b/Java/52713667 |
condefects-java_data_922 | import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
long X = input.nextLong();
BigDecimal x = new BigDecimal(X);
BigDecimal divisor = new BigDecimal("10.0");
BigDecimal div = x.divide(divisor);
System.out.println( div.setScale(0, RoundingMode.UP).toPlainString());
input.close();
}
}
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
long X = input.nextLong();
BigDecimal x = new BigDecimal(X);
BigDecimal divisor = new BigDecimal("10.0");
BigDecimal div = x.divide(divisor);
System.out.println( div.setScale(0, RoundingMode.CEILING).toPlainString());
input.close();
}
} | ConDefects/ConDefects/Code/abc345_b/Java/53684663 |
condefects-java_data_923 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long x = sc.nextLong();
if(x%10==0)System.out.println(x/10);
else System.out.println(x/10+1);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long x = sc.nextLong();
if(x%10==0 || x<0)System.out.println(x/10);
else System.out.println(x/10+1);
}
}
| ConDefects/ConDefects/Code/abc345_b/Java/53405506 |
condefects-java_data_924 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long x = sc.nextLong();
sc.close();
long y = 0;
if (x % 10 == 0) {
y = x / 10;
} else {
y = x / 10 + 1;
}
System.out.println(y);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long x = sc.nextLong();
sc.close();
long y = 0;
if (x % 10 == 0 || x < 0) {
y = x / 10;
} else {
y = x / 10 + 1;
}
System.out.println(y);
}
} | ConDefects/ConDefects/Code/abc345_b/Java/54156028 |
condefects-java_data_925 | // import static org.junit.jupiter.api.Assertions.assertEquals;
// import org.junit.jupiter.api.Test;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long X = sc.nextLong();
long result;
if (X > 0) {
result = ((X-1)/ 10) + 1;
} else {
result = ((X-1)/ 10);
}
System.out.println(result);
// @Test
// void addition() {
// assertEquals(2, 1 + 1);
}
}
// import static org.junit.jupiter.api.Assertions.assertEquals;
// import org.junit.jupiter.api.Test;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long X = sc.nextLong();
long result;
if (X > 0) {
result = ((X-1)/ 10) + 1;
} else {
result = (X/ 10);
}
System.out.println(result);
// @Test
// void addition() {
// assertEquals(2, 1 + 1);
}
} | ConDefects/ConDefects/Code/abc345_b/Java/54661442 |
condefects-java_data_926 | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
double a=scanner.nextDouble();
double b=scanner.nextDouble();
double d=scanner.nextDouble();
double kakudo=Math.toRadians(d);
System.out.print(a*Math.cos(kakudo) - b*Math.sin(kakudo));
System.out.print("");
System.out.print(b*Math.cos(kakudo) + a*Math.sin(kakudo));
}
}
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
double a=scanner.nextDouble();
double b=scanner.nextDouble();
double d=scanner.nextDouble();
double kakudo=Math.toRadians(d);
System.out.print(a*Math.cos(kakudo) - b*Math.sin(kakudo));
System.out.print(" ");
System.out.print(b*Math.cos(kakudo) + a*Math.sin(kakudo));
}
} | ConDefects/ConDefects/Code/abc259_b/Java/42823813 |
condefects-java_data_927 | import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int d = sc.nextInt();
double r = Math.sqrt(a * a + b * b);
double fir = Math.atan((double)b/(double)a);
//System.out.println(fir);
if(a < 0) {
fir += Math.PI;
}
if(a == 0) {
if(b > 0) {
fir = Math.PI/2;
}else {
fir = Math.PI * 3/2;
}
}
double change =(double)d * Math.PI/(double)180;
fir += change;
System.out.println(fir);
double x = r * Math.cos(fir);
double y = r * Math.sin(fir);
System.out.print(x + " " + y);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int d = sc.nextInt();
double r = Math.sqrt(a * a + b * b);
double fir = Math.atan((double)b/(double)a);
//System.out.println(fir);
if(a < 0) {
fir += Math.PI;
}
if(a == 0) {
if(b > 0) {
fir = Math.PI/2;
}else {
fir = Math.PI * 3/2;
}
}
double change =(double)d * Math.PI/(double)180;
fir += change;
//System.out.println(fir);
double x = r * Math.cos(fir);
double y = r * Math.sin(fir);
System.out.print(x + " " + y);
}
} | ConDefects/ConDefects/Code/abc259_b/Java/45526829 |
condefects-java_data_928 | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
int T = Integer.parseInt(br.readLine());
tc: while (T-- > 0) {
StringTokenizer st = new StringTokenizer(br.readLine());
long A = Integer.parseInt(st.nextToken());
long B = Integer.parseInt(st.nextToken());
if (A >= B) {
sb.append((A-B)+"\n");
continue tc;
}
long ans = 1_000_000_000;
for (int C = 1; C*C <= B-1; C++) {
long k = (B-1)/(C+1) + 1;
ans = Math.min(ans, (k+1)*Math.max(C+1-A, 0) + k*A - B);
}
for (int k = 1; k*k <= B; k++) {
ans = Math.min(ans, (k+1)*Math.max((B-1)/k + 1 - A, 0) + k*A - B);
}
sb.append(ans).append("\n");
}
System.out.println(sb.toString());
}
}
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
int T = Integer.parseInt(br.readLine());
tc: while (T-- > 0) {
StringTokenizer st = new StringTokenizer(br.readLine());
long A = Integer.parseInt(st.nextToken());
long B = Integer.parseInt(st.nextToken());
if (A >= B) {
sb.append((A-B)+"\n");
continue tc;
}
long ans = 1_000_000_000;
for (int C = 0; C*C <= B-1; C++) {
long k = (B-1)/(C+1) + 1;
ans = Math.min(ans, (k+1)*Math.max(C+1-A, 0) + k*A - B);
}
for (int k = 1; k*k <= B; k++) {
ans = Math.min(ans, (k+1)*Math.max((B-1)/k + 1 - A, 0) + k*A - B);
}
sb.append(ans).append("\n");
}
System.out.println(sb.toString());
}
} | ConDefects/ConDefects/Code/arc150_b/Java/35586089 |
condefects-java_data_929 |
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int k = scan.nextInt();
List<Integer> a = new ArrayList<>();
long sum = 0;
for (int i = 0; i < n; i++) {
int tmp =scan.nextInt();
a.add(tmp);
sum += tmp;
}
if (k > 0) {
Collections.sort(a, Comparator.naturalOrder());
} else {
if(sum > k) {
Collections.sort(a, Comparator.reverseOrder());
}else{
System.out.println("No");
return;
}
}
System.out.println("Yes");
for (Integer integer : a) {
System.out.print(integer + " ");
}
}
}
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int k = scan.nextInt();
List<Integer> a = new ArrayList<>();
long sum = 0;
for (int i = 0; i < n; i++) {
int tmp =scan.nextInt();
a.add(tmp);
sum += tmp;
}
if (k > 0) {
Collections.sort(a, Comparator.naturalOrder());
} else {
if(sum >= k) {
Collections.sort(a, Comparator.reverseOrder());
}else{
System.out.println("No");
return;
}
}
System.out.println("Yes");
for (Integer integer : a) {
System.out.print(integer + " ");
}
}
}
| ConDefects/ConDefects/Code/arc179_a/Java/54215014 |
condefects-java_data_930 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
long a[] = Arrays.stream(new long[n]).map(e-> sc.nextLong()).sorted().toArray();
// Vector<Long> vecNonNeg = new Vector<>();
// Vector<Long> vecNeg = new Vector<>();
long nonNegSum = 0;
long negSum = 0;
for(int i = 0; i < n; i++) {
if(a[i] >= 0) {
// vecNonNeg.add(a[i]);
nonNegSum += a[i];
}
else {
// vecNeg.add(a[i]);
negSum += a[i];
}
}
if(k < 0 && nonNegSum + negSum < k) {
System.out.println("No");
return;
}
System.out.println("Yes");
for(int i = 0; i < n; i++) {
if(k > 0) {
System.out.print(a[i] + " ");
}
else {
System.out.print(a[n - i - 1] + " ");
}
}
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
long a[] = Arrays.stream(new long[n]).map(e-> sc.nextLong()).sorted().toArray();
// Vector<Long> vecNonNeg = new Vector<>();
// Vector<Long> vecNeg = new Vector<>();
long nonNegSum = 0;
long negSum = 0;
for(int i = 0; i < n; i++) {
if(a[i] >= 0) {
// vecNonNeg.add(a[i]);
nonNegSum += a[i];
}
else {
// vecNeg.add(a[i]);
negSum += a[i];
}
}
if(k <= 0 && nonNegSum + negSum < k) {
System.out.println("No");
return;
}
System.out.println("Yes");
for(int i = 0; i < n; i++) {
if(k > 0) {
System.out.print(a[i] + " ");
}
else {
System.out.print(a[n - i - 1] + " ");
}
}
}
}
| ConDefects/ConDefects/Code/arc179_a/Java/54467484 |
condefects-java_data_931 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
import java.util.InputMismatchException;
public class Main {
static RealFastReader sc = new RealFastReader(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
int t = 1;
while (t-- > 0) {
solve();
}
out.close();
}
public static void solve() {
int n = sc.ni();
int k = sc.ni();
Integer[] g = new Integer[n];
for (int i = 0; i < n; i++) {
g[i] = sc.ni();
}
long s = 0;
if(k>0){
Arrays.sort(g);
}else {
Arrays.sort(g, (a,b)->b-a);
for (int i = 0; i < n; i++) {
s+= g[i];
}
if(s<0){
out.println("No");
return;
}
}
out.println("Yes");
for (int i = 0; i < n; i++) {
out.print(g[i] + " ");
}
}
public static class RealFastReader {
InputStream is;
public RealFastReader(final InputStream is) {
this.is = is;
}
private byte[] inbuf = new byte[8192];
public int lenbuf = 0, ptrbuf = 0;
public int readByte() {
if (lenbuf == -1) {
throw new InputMismatchException();
}
if (ptrbuf >= lenbuf) {
ptrbuf = 0;
try {
lenbuf = is.read(inbuf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (lenbuf <= 0) {
return -1;
}
}
return inbuf[ptrbuf++];
}
private boolean isSpaceChar(int c) {
return !(c >= 33 && c <= 126);
}
private int skip() {
int b;
while ((b = readByte()) != -1 && isSpaceChar(b))
;
return b;
}
public double nd() {
return Double.parseDouble(ns());
}
public char nc() {
return (char) skip();
}
public String ns() {
int b = skip();
StringBuilder sb = new StringBuilder();
while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public char[] ns(int n) {
char[] buf = new char[n];
int b = skip(), p = 0;
while (p < n && !(isSpaceChar(b))) {
buf[p++] = (char) b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
public int[] na(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = ni();
}
return a;
}
public long[] nal(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nl();
}
return a;
}
public char[][] nm(int n, int m) {
char[][] map = new char[n][];
for (int i = 0; i < n; i++) {
map[i] = ns(m);
}
return map;
}
public int[][] nmi(int n, int m) {
int[][] map = new int[n][];
for (int i = 0; i < n; i++) {
map[i] = na(m);
}
return map;
}
public int ni() {
int num = 0;
int b;
boolean minus = false;
while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
;
if (b == '-') {
minus = true;
b = readByte();
}
while (true) {
if (b >= '0' && b <= '9') {
num = num * 10 + (b - '0');
} else {
return minus ? -num : num;
}
b = readByte();
}
}
public long nl() {
long num = 0;
int b;
boolean minus = false;
while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
;
if (b == '-') {
minus = true;
b = readByte();
}
while (true) {
if (b >= '0' && b <= '9') {
num = num * 10 + (b - '0');
} else {
return minus ? -num : num;
}
b = readByte();
}
}
}
}
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
import java.util.InputMismatchException;
public class Main {
static RealFastReader sc = new RealFastReader(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
int t = 1;
while (t-- > 0) {
solve();
}
out.close();
}
public static void solve() {
int n = sc.ni();
int k = sc.ni();
Integer[] g = new Integer[n];
for (int i = 0; i < n; i++) {
g[i] = sc.ni();
}
long s = 0;
if(k>0){
Arrays.sort(g);
}else {
Arrays.sort(g, (a,b)->b-a);
for (int i = 0; i < n; i++) {
s+= g[i];
}
if(s<k){
out.println("No");
return;
}
}
out.println("Yes");
for (int i = 0; i < n; i++) {
out.print(g[i] + " ");
}
}
public static class RealFastReader {
InputStream is;
public RealFastReader(final InputStream is) {
this.is = is;
}
private byte[] inbuf = new byte[8192];
public int lenbuf = 0, ptrbuf = 0;
public int readByte() {
if (lenbuf == -1) {
throw new InputMismatchException();
}
if (ptrbuf >= lenbuf) {
ptrbuf = 0;
try {
lenbuf = is.read(inbuf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (lenbuf <= 0) {
return -1;
}
}
return inbuf[ptrbuf++];
}
private boolean isSpaceChar(int c) {
return !(c >= 33 && c <= 126);
}
private int skip() {
int b;
while ((b = readByte()) != -1 && isSpaceChar(b))
;
return b;
}
public double nd() {
return Double.parseDouble(ns());
}
public char nc() {
return (char) skip();
}
public String ns() {
int b = skip();
StringBuilder sb = new StringBuilder();
while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public char[] ns(int n) {
char[] buf = new char[n];
int b = skip(), p = 0;
while (p < n && !(isSpaceChar(b))) {
buf[p++] = (char) b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
public int[] na(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = ni();
}
return a;
}
public long[] nal(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nl();
}
return a;
}
public char[][] nm(int n, int m) {
char[][] map = new char[n][];
for (int i = 0; i < n; i++) {
map[i] = ns(m);
}
return map;
}
public int[][] nmi(int n, int m) {
int[][] map = new int[n][];
for (int i = 0; i < n; i++) {
map[i] = na(m);
}
return map;
}
public int ni() {
int num = 0;
int b;
boolean minus = false;
while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
;
if (b == '-') {
minus = true;
b = readByte();
}
while (true) {
if (b >= '0' && b <= '9') {
num = num * 10 + (b - '0');
} else {
return minus ? -num : num;
}
b = readByte();
}
}
public long nl() {
long num = 0;
int b;
boolean minus = false;
while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
;
if (b == '-') {
minus = true;
b = readByte();
}
while (true) {
if (b >= '0' && b <= '9') {
num = num * 10 + (b - '0');
} else {
return minus ? -num : num;
}
b = readByte();
}
}
}
}
| ConDefects/ConDefects/Code/arc179_a/Java/54178728 |
condefects-java_data_932 | import java.util.*;
import java.io.*;
import java.util.function.*;
import java.util.stream.*;
class Main {
public static void main(String[] args) {new Main(args);}
final IO io;
Main(String[] args) {io = new IO(); execute(args); io.flush();}
// @SuppressWarnings({"unchecked"})
void execute(String[] args) {
final int N = io.getNextInt();
final int K = io.getNextInt();
final int[] A = io.getIntArray(N);
Arrays.sort(A);
if(K <= 0) {
if(Arrays.stream(A).asLongStream().sum() < K) {
io.println("No");
return;
}
for(int idx = 0; idx <= A.length / 2; idx++) {
int tmp = A[idx];
A[idx] = A[A.length - idx - 1];
A[A.length - idx - 1] = tmp;
}
}
io.println("Yes");
io.println(A);
}
}
class IO {
private BufferedReader reader;
private PrintWriter writer;
private String[] readBuffer;
private int readBufferCursor;
IO() {
reader = new BufferedReader(new InputStreamReader(System.in));
writer = new PrintWriter(System.out);
readBuffer = new String[] {};
readBufferCursor = 0;
// ファイル入力用
// try {
// reader = new BufferedReader(new InputStreamReader(
// new FileInputStream("test.txt")));
// } catch (FileNotFoundException e) {
// e.printStackTrace();
// }
// ファイル出力用
// try {
// writer = new PrintWriter(new File("test.txt"));
// } catch (FileNotFoundException e) {
// e.printStackTrace();
// }
}
String getNextLine() {
try {
return reader.readLine();
} catch (IOException e) {
e.printStackTrace();
return null;
}
}
String getNext() {
if (readBuffer.length == readBufferCursor) {
readBuffer = getNextLine().trim().split("\\s");
readBufferCursor = 0;
}
String ret = readBuffer[readBufferCursor];
readBuffer[readBufferCursor++] = null;
return ret;
}
int getNextInt() {
return Integer.parseInt(getNext());
}
long getNextLong() {
return Long.parseLong(getNext());
}
double getNextDouble() {
return Double.parseDouble(getNext());
}
int[] getIntArray(int length) {
return getIntArray(length, v -> v);
}
int[] getIntArray(int length, IntUnaryOperator mapper) {
return IntStream.generate(() -> getNextInt()).limit(length).map(mapper).toArray();
}
int[] getIntArray(int length, IntUnaryOperator mapper, int headOffset, int tailOffset) {
return IntStream.concat(IntStream.generate(() -> 0).limit(headOffset),
IntStream.concat(IntStream.generate(() -> getNextInt()).limit(length).map(mapper),
IntStream.generate(() -> 0).limit(tailOffset))).toArray();
}
long[] getLongArray(int length) {
return getLongArray(length, v -> v);
}
long[] getLongArray(int length, LongUnaryOperator mapper) {
return LongStream.generate(() -> getNextLong()).limit(length).map(mapper).toArray();
}
long[] getLongArray(int length, LongUnaryOperator mapper, int headOffset, int tailOffset) {
return LongStream.concat(LongStream.generate(() -> 0).limit(headOffset),
LongStream.concat(LongStream.generate(() -> getNextInt()).limit(length).map(mapper),
LongStream.generate(() -> 0).limit(tailOffset))).toArray();
}
double[] getDoubleArray(int length) {
return DoubleStream.generate(() -> getNextDouble()).limit(length).toArray();
}
int[][] get2dIntArray(int rows, int cols) {
return get2dIntArray(rows, cols, v -> v);
}
int[][] get2dIntArray(int rows, int cols, IntUnaryOperator mapper) {
return Stream.generate(() -> getIntArray(cols, mapper)).limit(rows).toArray(int[][]::new);
}
long[][] get2dLongArray(int rows, int cols) {
return get2dLongArray(rows, cols, v -> v);
}
long[][] get2dLongArray(int rows, int cols, LongUnaryOperator mapper) {
return Stream.generate(() -> getLongArray(cols, mapper)).limit(rows).toArray(long[][]::new);
}
int[] getCharIntArray(IntUnaryOperator mapper) {
return getNext().chars().map(mapper).toArray();
}
char[][] get2dCharArray(int rows) {
return Stream.generate(() -> getNext().toCharArray()).limit(rows).toArray(char[][]::new);
}
int[][] get2dCharIntArray(int rows, IntUnaryOperator mapper) {
return Stream.generate(() -> getNext().chars().map(mapper).toArray()).limit(rows).toArray(int[][]::new);
}
void print(int... ary) {
for (int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
void print(long... ary) {
for (int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
void print(char[] ary) {
print(String.valueOf(ary));
}
void print(Collection<?> list) {
for (Iterator<?> itr = list.iterator(); itr.hasNext();) {
print(itr.next() + (itr.hasNext() ? " " : ""));
}
}
void print(Object obj) {
writer.print(obj);
}
void println(int... ary) {
print(ary);
println();
}
void println(int[][] arys) {
Arrays.stream(arys).forEach(ary -> println(ary));
}
void println(long... ary) {
print(ary);
println();
}
void println(long[][] arys) {
Arrays.stream(arys).forEach(ary -> println(ary));
}
void println(char[] ary) {
print(ary);
println();
}
void println(char[][] arys) {
Arrays.stream(arys).forEach(ary -> println(ary));
}
void println(Collection<?> list) {
print(list);
println();
}
void println(Object obj) {
print(obj);
println();
}
void println() {
writer.println();
flush();
}
void printf(String format, Object... args) {
print(String.format(format, args));
flush();
}
void flush() {
writer.flush();
}
}
import java.util.*;
import java.io.*;
import java.util.function.*;
import java.util.stream.*;
class Main {
public static void main(String[] args) {new Main(args);}
final IO io;
Main(String[] args) {io = new IO(); execute(args); io.flush();}
// @SuppressWarnings({"unchecked"})
void execute(String[] args) {
final int N = io.getNextInt();
final int K = io.getNextInt();
final int[] A = io.getIntArray(N);
Arrays.sort(A);
if(K <= 0) {
if(Arrays.stream(A).asLongStream().sum() < K) {
io.println("No");
return;
}
for(int idx = 0; idx < A.length / 2; idx++) {
int tmp = A[idx];
A[idx] = A[A.length - idx - 1];
A[A.length - idx - 1] = tmp;
}
}
io.println("Yes");
io.println(A);
}
}
class IO {
private BufferedReader reader;
private PrintWriter writer;
private String[] readBuffer;
private int readBufferCursor;
IO() {
reader = new BufferedReader(new InputStreamReader(System.in));
writer = new PrintWriter(System.out);
readBuffer = new String[] {};
readBufferCursor = 0;
// ファイル入力用
// try {
// reader = new BufferedReader(new InputStreamReader(
// new FileInputStream("test.txt")));
// } catch (FileNotFoundException e) {
// e.printStackTrace();
// }
// ファイル出力用
// try {
// writer = new PrintWriter(new File("test.txt"));
// } catch (FileNotFoundException e) {
// e.printStackTrace();
// }
}
String getNextLine() {
try {
return reader.readLine();
} catch (IOException e) {
e.printStackTrace();
return null;
}
}
String getNext() {
if (readBuffer.length == readBufferCursor) {
readBuffer = getNextLine().trim().split("\\s");
readBufferCursor = 0;
}
String ret = readBuffer[readBufferCursor];
readBuffer[readBufferCursor++] = null;
return ret;
}
int getNextInt() {
return Integer.parseInt(getNext());
}
long getNextLong() {
return Long.parseLong(getNext());
}
double getNextDouble() {
return Double.parseDouble(getNext());
}
int[] getIntArray(int length) {
return getIntArray(length, v -> v);
}
int[] getIntArray(int length, IntUnaryOperator mapper) {
return IntStream.generate(() -> getNextInt()).limit(length).map(mapper).toArray();
}
int[] getIntArray(int length, IntUnaryOperator mapper, int headOffset, int tailOffset) {
return IntStream.concat(IntStream.generate(() -> 0).limit(headOffset),
IntStream.concat(IntStream.generate(() -> getNextInt()).limit(length).map(mapper),
IntStream.generate(() -> 0).limit(tailOffset))).toArray();
}
long[] getLongArray(int length) {
return getLongArray(length, v -> v);
}
long[] getLongArray(int length, LongUnaryOperator mapper) {
return LongStream.generate(() -> getNextLong()).limit(length).map(mapper).toArray();
}
long[] getLongArray(int length, LongUnaryOperator mapper, int headOffset, int tailOffset) {
return LongStream.concat(LongStream.generate(() -> 0).limit(headOffset),
LongStream.concat(LongStream.generate(() -> getNextInt()).limit(length).map(mapper),
LongStream.generate(() -> 0).limit(tailOffset))).toArray();
}
double[] getDoubleArray(int length) {
return DoubleStream.generate(() -> getNextDouble()).limit(length).toArray();
}
int[][] get2dIntArray(int rows, int cols) {
return get2dIntArray(rows, cols, v -> v);
}
int[][] get2dIntArray(int rows, int cols, IntUnaryOperator mapper) {
return Stream.generate(() -> getIntArray(cols, mapper)).limit(rows).toArray(int[][]::new);
}
long[][] get2dLongArray(int rows, int cols) {
return get2dLongArray(rows, cols, v -> v);
}
long[][] get2dLongArray(int rows, int cols, LongUnaryOperator mapper) {
return Stream.generate(() -> getLongArray(cols, mapper)).limit(rows).toArray(long[][]::new);
}
int[] getCharIntArray(IntUnaryOperator mapper) {
return getNext().chars().map(mapper).toArray();
}
char[][] get2dCharArray(int rows) {
return Stream.generate(() -> getNext().toCharArray()).limit(rows).toArray(char[][]::new);
}
int[][] get2dCharIntArray(int rows, IntUnaryOperator mapper) {
return Stream.generate(() -> getNext().chars().map(mapper).toArray()).limit(rows).toArray(int[][]::new);
}
void print(int... ary) {
for (int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
void print(long... ary) {
for (int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
void print(char[] ary) {
print(String.valueOf(ary));
}
void print(Collection<?> list) {
for (Iterator<?> itr = list.iterator(); itr.hasNext();) {
print(itr.next() + (itr.hasNext() ? " " : ""));
}
}
void print(Object obj) {
writer.print(obj);
}
void println(int... ary) {
print(ary);
println();
}
void println(int[][] arys) {
Arrays.stream(arys).forEach(ary -> println(ary));
}
void println(long... ary) {
print(ary);
println();
}
void println(long[][] arys) {
Arrays.stream(arys).forEach(ary -> println(ary));
}
void println(char[] ary) {
print(ary);
println();
}
void println(char[][] arys) {
Arrays.stream(arys).forEach(ary -> println(ary));
}
void println(Collection<?> list) {
print(list);
println();
}
void println(Object obj) {
print(obj);
println();
}
void println() {
writer.println();
flush();
}
void printf(String format, Object... args) {
print(String.format(format, args));
flush();
}
void flush() {
writer.flush();
}
}
| ConDefects/ConDefects/Code/arc179_a/Java/54703162 |
condefects-java_data_933 | import java.io.*;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] s) {
try {
InputStream inputStream = System.in;
InputReader in = new InputReader(inputStream);
PrintWriter writer = new PrintWriter(System.out);
Task solution = new Task();
solution.solve(in,writer);
writer.close();
inputStream.close();
} catch (IOException e) {
e.printStackTrace();
}
}
}
class Task {
public void solve(InputReader in, PrintWriter out) throws IOException {
int N = in.nextInt();
int K = in.nextInt();
int[] ar = new int[N];
for (int i = 0; i < N; i++) {
ar[i] = in.nextInt();
}
// total sum
int total = 0;
for (int i = 0; i < N; i++) {
total = total + ar[i];
}
if (K > 0) {
out.println("Yes");
Arrays.sort(ar);
printArray(ar, out);
return;
}
if (total < K) {
out.println("No");
return;
}
out.println("Yes");
Arrays.sort(ar);
int s = 0;
int e = ar.length-1;
while (s < e) {
int temp = ar[s];
ar[s] = ar[e];
ar[e] = temp;
s++;
e--;
}
printArray(ar, out);
}
private void printArray(int[] ar, PrintWriter out) {
for (int i = 0; i < ar.length; i++) {
out.printf("%d ", ar[i]);
}
out.println("");
}
}
class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream));
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
}
import java.io.*;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] s) {
try {
InputStream inputStream = System.in;
InputReader in = new InputReader(inputStream);
PrintWriter writer = new PrintWriter(System.out);
Task solution = new Task();
solution.solve(in,writer);
writer.close();
inputStream.close();
} catch (IOException e) {
e.printStackTrace();
}
}
}
class Task {
public void solve(InputReader in, PrintWriter out) throws IOException {
int N = in.nextInt();
int K = in.nextInt();
int[] ar = new int[N];
for (int i = 0; i < N; i++) {
ar[i] = in.nextInt();
}
// total sum
long total = 0;
for (int i = 0; i < N; i++) {
total = total + ar[i];
}
if (K > 0) {
out.println("Yes");
Arrays.sort(ar);
printArray(ar, out);
return;
}
if (total < K) {
out.println("No");
return;
}
out.println("Yes");
Arrays.sort(ar);
int s = 0;
int e = ar.length-1;
while (s < e) {
int temp = ar[s];
ar[s] = ar[e];
ar[e] = temp;
s++;
e--;
}
printArray(ar, out);
}
private void printArray(int[] ar, PrintWriter out) {
for (int i = 0; i < ar.length; i++) {
out.printf("%d ", ar[i]);
}
out.println("");
}
}
class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream));
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
}
| ConDefects/ConDefects/Code/arc179_a/Java/55132750 |
condefects-java_data_934 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
long d = sc.nextLong();
long sqrt = (long) Math.sqrt(d);
long min = Long.MAX_VALUE;
for (long i = 0; i < 2 * sqrt; i++) {
long s = getAbsMaxSqrt(d - i * i);
if (s < min)
min = s;
}
System.out.println(min);
}
}
static long getAbsMaxSqrt(long n) {
long sqrt = (long) Math.sqrt(n);
long min = Long.MAX_VALUE;
for (long i = sqrt / 2; i < sqrt * 3 / 2; i++) {
long s = Math.abs(n - i * i);
if (s < min)
min = s;
}
return min;
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
long d = sc.nextLong();
long sqrt = (long) Math.sqrt(d);
long min = Long.MAX_VALUE;
for (long i = 0; i < 2 * sqrt; i++) {
long s = getAbsMaxSqrt(d - i * i);
if (s < min)
min = s;
}
System.out.println(min);
}
}
static long getAbsMaxSqrt(long n) {
long sqrt = (long) Math.sqrt(n);
long min = Long.MAX_VALUE;
for (long i = sqrt; i < sqrt + 2; i++) {
long s = Math.abs(n - i * i);
if (s < min)
min = s;
}
return min;
}
}
| ConDefects/ConDefects/Code/abc330_c/Java/51717421 |
condefects-java_data_935 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long D = sc.nextLong();
long res = D;
for (int x = 0; x <= 2000000; x++) {
if (x * x > D) {
res = Math.min(res, x * x - D);
break;
} else {
long y = (long) Math.sqrt(Math.abs(x * x - D));
long res1 = Math.min(Math.abs(x * x + y * y - D), Math.abs(x * x + (y + 1) * (y + 1) - D));
res = Math.min(res, res1);
}
}
System.out.println(res);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long D = sc.nextLong();
long res = D;
for (long x = 0; x <= 2000000; x++) {
if (x * x > D) {
res = Math.min(res, x * x - D);
break;
} else {
long y = (long) Math.sqrt(Math.abs(x * x - D));
long res1 = Math.min(Math.abs(x * x + y * y - D), Math.abs(x * x + (y + 1) * (y + 1) - D));
res = Math.min(res, res1);
}
}
System.out.println(res);
}
} | ConDefects/ConDefects/Code/abc330_c/Java/51004896 |
condefects-java_data_936 | import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
long D = sc.nextLong();
long k = (long)Math.sqrt(D);
long re = D;
for(long i =0;i<=k;i++) {
long y = (long) Math.sqrt(D - i * i);
long o = Math.abs(i * i + y * y - D);
re = Math.min(re, o);
}
System.out.print(re);
}
}
import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
long D = sc.nextLong();
long k = (long)Math.sqrt(D);
long re = D;
for(long i =0;i<=k;i++) {
long y = (long) Math.round(Math.sqrt(D - i * i));
long o = Math.abs(i * i + y * y - D);
re = Math.min(re, o);
}
System.out.print(re);
}
}
| ConDefects/ConDefects/Code/abc330_c/Java/54240736 |
condefects-java_data_937 | import java.io.BufferedInputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.StringJoiner;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class Main {
static In in = new In();
static Out out = new Out(false, false);
static final long inf = 0x1fffffffffffffffL;
static final int iinf = 0x3fffffff;
static final double eps = 1e-9;
static long mod = 998244353;
// List<Integer> cor = new ArrayList<>();
void solve() {
int n = in.nextInt();
// for (int i = 0; i < n; i++) {
// cor.add(in.nextInt());
// }
int[] ord = new int[n];
Arrays.setAll(ord, i -> i);
mergeSort(ord, 0, n);
// out.debug(ord);
List<Integer> list = new ArrayList<>();
for (int i = 0; i < n; i++) {
list.add(ord[i]);
}
for (int i = n - 1; i >= 1; i--) {
merge(list.get(0), list.get(i));
int ni = n + n - i - 1;
list.remove(i);
list.remove(0);
int l = -1;
int r = i - 1;
while (r - l > 1) {
int m = (l + r) / 2;
if (ask(ni, list.get(m))) {
r = m;
} else {
l = m;
}
}
list.add(r, ni);
// out.debug(l, r, ni, list);
}
}
void mergeSort(int[] a, int l, int r) {
if (r - l <= 1) {
return;
}
int m = (l + r) / 2;
mergeSort(a, l, m);
mergeSort(a, m, r);
int[] b = new int[r - l];
int j = l;
int k = m;
for (int i = 0; i < r - l; i++) {
if (k == r || j < m && ask(a[j], a[k])) {
b[i] = a[j];
j++;
} else {
b[i] = a[k];
k++;
}
}
for (int i = l; i < r; i++) {
a[i] = b[i - l];
}
}
int merge(int a, int b) {
out.println("+", a + 1, b + 1);
out.flush();
// cor.add(cor.get(a) + cor.get(b));
// return -1;
int r = in.nextInt();
if (r == -1) {
throw new RuntimeException();
}
return r - 1;
}
boolean ask(int a, int b) {
out.println("?", a + 1, b + 1);
out.flush();
// return cor.get(a) < cor.get(b);
int r = in.nextInt();
if (r == -1) {
throw new RuntimeException();
}
return r == 1;
}
public static void main(String... args) {
new Main().solve();
out.flush();
}
}
class In {
private final BufferedInputStream reader = new BufferedInputStream(System.in);
private final byte[] buffer = new byte[0x10000];
private int i = 0;
private int length = 0;
public int read() {
if (i == length) {
i = 0;
try {
length = reader.read(buffer);
} catch (IOException ignored) {
}
if (length == -1) {
return 0;
}
}
if (length <= i) {
throw new RuntimeException();
}
return buffer[i++];
}
public String next() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
while ('!' <= b && b <= '~') {
builder.appendCodePoint(b);
b = read();
}
return builder.toString();
}
public String nextLine() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b != 0 && b != '\r' && b != '\n') {
builder.appendCodePoint(b);
b = read();
}
if (b == '\r') {
read();
}
return builder.toString();
}
public int nextInt() {
long val = nextLong();
if (val < Integer.MIN_VALUE || Integer.MAX_VALUE < val) {
throw new NumberFormatException();
}
return (int)val;
}
public long nextLong() {
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
boolean neg = false;
if (b == '-') {
neg = true;
b = read();
}
long n = 0;
int c = 0;
while ('0' <= b && b <= '9') {
n = n * 10 + b - '0';
b = read();
c++;
}
if (c == 0 || c >= 2 && n == 0) {
throw new NumberFormatException();
}
return neg ? -n : n;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public char[] nextCharArray() {
return next().toCharArray();
}
public String[] nextStringArray(int n) {
String[] s = new String[n];
for (int i = 0; i < n; i++) {
s[i] = next();
}
return s;
}
public char[][] nextCharMatrix(int n, int m) {
char[][] a = new char[n][m];
for (int i = 0; i < n; i++) {
a[i] = next().toCharArray();
}
return a;
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
public int[] nextIntArray(int n, IntUnaryOperator op) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsInt(nextInt());
}
return a;
}
public int[][] nextIntMatrix(int h, int w) {
int[][] a = new int[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextIntArray(w);
}
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
public long[] nextLongArray(int n, LongUnaryOperator op) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsLong(nextLong());
}
return a;
}
public long[][] nextLongMatrix(int h, int w) {
long[][] a = new long[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextLongArray(w);
}
return a;
}
public List<List<Integer>> nextGraph(int n, int m, boolean directed) {
List<List<Integer>> res = new ArrayList<>();
for (int i = 0; i < n; i++) {
res.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
res.get(u).add(v);
if (!directed) {
res.get(v).add(u);
}
}
return res;
}
}
class Out {
private final PrintWriter out = new PrintWriter(System.out);
private final PrintWriter err = new PrintWriter(System.err);
public boolean autoFlush;
public boolean enableDebug;
public Out(boolean autoFlush, boolean enableDebug) {
this.autoFlush = autoFlush;
this.enableDebug = enableDebug;
}
public void debug(Object... args) {
if (!enableDebug) {
return;
}
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
err.println(Arrays.stream(args).map(obj -> format(obj, true)).collect(Collectors.joining(" ")));
err.flush();
}
private String format(Object obj, boolean canMultiline) {
if (obj == null) return "null";
Class<?> clazz = obj.getClass();
if (clazz == Double.class) return String.format("%.10f", obj);
if (clazz == int[].class) return Arrays.toString((int[])obj);
if (clazz == long[].class) return Arrays.toString((long[])obj);
if (clazz == char[].class) return String.valueOf((char[])obj);
if (clazz == boolean[].class) return IntStream.range(0, ((boolean[])obj).length).mapToObj(i -> ((boolean[])obj)[i] ? "1" : "0").collect(Collectors.joining());
if (clazz == double[].class) return Arrays.toString(Arrays.stream((double[])obj).mapToObj(a -> format(a, false)).toArray());
if (canMultiline && clazz.isArray() && clazz.componentType().isArray()) return Arrays.stream((Object[])obj).map(a -> format(a, false)).collect(Collectors.joining("\n"));
if (clazz == Object[].class) return Arrays.toString(Arrays.stream((Object[])obj).map(a -> format(a, false)).toArray());
if (clazz.isArray()) return Arrays.toString((Object[])obj);
return String.valueOf(obj);
}
public void println(Object... args) {
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
out.println(Arrays.stream(args)
.map(obj -> obj instanceof Double ? String.format("%.10f", obj) : String.valueOf(obj))
.collect(Collectors.joining(" ")));
if (autoFlush) {
out.flush();
}
}
public void println(char a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
public void println(int a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
public void println(long a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
public void println(double a) {
out.println(String.format("%.10f", a));
if (autoFlush) {
out.flush();
}
}
public void println(String s) {
out.println(s);
if (autoFlush) {
out.flush();
}
}
public void println(char[] s) {
out.println(String.valueOf(s));
if (autoFlush) {
out.flush();
}
}
public void println(int[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (int i : a) {
joiner.add(Integer.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
public void println(long[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (long i : a) {
joiner.add(Long.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
public void flush() {
err.flush();
out.flush();
}
}
import java.io.BufferedInputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.StringJoiner;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class Main {
static In in = new In();
static Out out = new Out(false, false);
static final long inf = 0x1fffffffffffffffL;
static final int iinf = 0x3fffffff;
static final double eps = 1e-9;
static long mod = 998244353;
// List<Integer> cor = new ArrayList<>();
void solve() {
int n = in.nextInt();
// for (int i = 0; i < n; i++) {
// cor.add(in.nextInt());
// }
int[] ord = new int[n];
Arrays.setAll(ord, i -> i);
mergeSort(ord, 0, n);
// out.debug(ord);
List<Integer> list = new ArrayList<>();
for (int i = 0; i < n; i++) {
list.add(ord[i]);
}
for (int i = n - 1; i >= 1; i--) {
merge(list.get(0), list.get(i));
int ni = n + n - i - 1;
list.remove(i);
list.remove(0);
int l = -1;
int r = i - 1;
while (r - l > 1) {
int m = (l + r) / 2;
if (ask(ni, list.get(m))) {
r = m;
} else {
l = m;
}
}
list.add(r, ni);
// out.debug(l, r, ni, list);
}
out.println("!");
out.flush();
}
void mergeSort(int[] a, int l, int r) {
if (r - l <= 1) {
return;
}
int m = (l + r) / 2;
mergeSort(a, l, m);
mergeSort(a, m, r);
int[] b = new int[r - l];
int j = l;
int k = m;
for (int i = 0; i < r - l; i++) {
if (k == r || j < m && ask(a[j], a[k])) {
b[i] = a[j];
j++;
} else {
b[i] = a[k];
k++;
}
}
for (int i = l; i < r; i++) {
a[i] = b[i - l];
}
}
int merge(int a, int b) {
out.println("+", a + 1, b + 1);
out.flush();
// cor.add(cor.get(a) + cor.get(b));
// return -1;
int r = in.nextInt();
if (r == -1) {
throw new RuntimeException();
}
return r - 1;
}
boolean ask(int a, int b) {
out.println("?", a + 1, b + 1);
out.flush();
// return cor.get(a) < cor.get(b);
int r = in.nextInt();
if (r == -1) {
throw new RuntimeException();
}
return r == 1;
}
public static void main(String... args) {
new Main().solve();
out.flush();
}
}
class In {
private final BufferedInputStream reader = new BufferedInputStream(System.in);
private final byte[] buffer = new byte[0x10000];
private int i = 0;
private int length = 0;
public int read() {
if (i == length) {
i = 0;
try {
length = reader.read(buffer);
} catch (IOException ignored) {
}
if (length == -1) {
return 0;
}
}
if (length <= i) {
throw new RuntimeException();
}
return buffer[i++];
}
public String next() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
while ('!' <= b && b <= '~') {
builder.appendCodePoint(b);
b = read();
}
return builder.toString();
}
public String nextLine() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b != 0 && b != '\r' && b != '\n') {
builder.appendCodePoint(b);
b = read();
}
if (b == '\r') {
read();
}
return builder.toString();
}
public int nextInt() {
long val = nextLong();
if (val < Integer.MIN_VALUE || Integer.MAX_VALUE < val) {
throw new NumberFormatException();
}
return (int)val;
}
public long nextLong() {
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
boolean neg = false;
if (b == '-') {
neg = true;
b = read();
}
long n = 0;
int c = 0;
while ('0' <= b && b <= '9') {
n = n * 10 + b - '0';
b = read();
c++;
}
if (c == 0 || c >= 2 && n == 0) {
throw new NumberFormatException();
}
return neg ? -n : n;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public char[] nextCharArray() {
return next().toCharArray();
}
public String[] nextStringArray(int n) {
String[] s = new String[n];
for (int i = 0; i < n; i++) {
s[i] = next();
}
return s;
}
public char[][] nextCharMatrix(int n, int m) {
char[][] a = new char[n][m];
for (int i = 0; i < n; i++) {
a[i] = next().toCharArray();
}
return a;
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
public int[] nextIntArray(int n, IntUnaryOperator op) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsInt(nextInt());
}
return a;
}
public int[][] nextIntMatrix(int h, int w) {
int[][] a = new int[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextIntArray(w);
}
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
public long[] nextLongArray(int n, LongUnaryOperator op) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsLong(nextLong());
}
return a;
}
public long[][] nextLongMatrix(int h, int w) {
long[][] a = new long[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextLongArray(w);
}
return a;
}
public List<List<Integer>> nextGraph(int n, int m, boolean directed) {
List<List<Integer>> res = new ArrayList<>();
for (int i = 0; i < n; i++) {
res.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
res.get(u).add(v);
if (!directed) {
res.get(v).add(u);
}
}
return res;
}
}
class Out {
private final PrintWriter out = new PrintWriter(System.out);
private final PrintWriter err = new PrintWriter(System.err);
public boolean autoFlush;
public boolean enableDebug;
public Out(boolean autoFlush, boolean enableDebug) {
this.autoFlush = autoFlush;
this.enableDebug = enableDebug;
}
public void debug(Object... args) {
if (!enableDebug) {
return;
}
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
err.println(Arrays.stream(args).map(obj -> format(obj, true)).collect(Collectors.joining(" ")));
err.flush();
}
private String format(Object obj, boolean canMultiline) {
if (obj == null) return "null";
Class<?> clazz = obj.getClass();
if (clazz == Double.class) return String.format("%.10f", obj);
if (clazz == int[].class) return Arrays.toString((int[])obj);
if (clazz == long[].class) return Arrays.toString((long[])obj);
if (clazz == char[].class) return String.valueOf((char[])obj);
if (clazz == boolean[].class) return IntStream.range(0, ((boolean[])obj).length).mapToObj(i -> ((boolean[])obj)[i] ? "1" : "0").collect(Collectors.joining());
if (clazz == double[].class) return Arrays.toString(Arrays.stream((double[])obj).mapToObj(a -> format(a, false)).toArray());
if (canMultiline && clazz.isArray() && clazz.componentType().isArray()) return Arrays.stream((Object[])obj).map(a -> format(a, false)).collect(Collectors.joining("\n"));
if (clazz == Object[].class) return Arrays.toString(Arrays.stream((Object[])obj).map(a -> format(a, false)).toArray());
if (clazz.isArray()) return Arrays.toString((Object[])obj);
return String.valueOf(obj);
}
public void println(Object... args) {
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
out.println(Arrays.stream(args)
.map(obj -> obj instanceof Double ? String.format("%.10f", obj) : String.valueOf(obj))
.collect(Collectors.joining(" ")));
if (autoFlush) {
out.flush();
}
}
public void println(char a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
public void println(int a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
public void println(long a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
public void println(double a) {
out.println(String.format("%.10f", a));
if (autoFlush) {
out.flush();
}
}
public void println(String s) {
out.println(s);
if (autoFlush) {
out.flush();
}
}
public void println(char[] s) {
out.println(String.valueOf(s));
if (autoFlush) {
out.flush();
}
}
public void println(int[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (int i : a) {
joiner.add(Integer.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
public void println(long[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (long i : a) {
joiner.add(Long.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
public void flush() {
err.flush();
out.flush();
}
} | ConDefects/ConDefects/Code/arc179_c/Java/54175168 |
condefects-java_data_938 | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String S = sc.next();
int length = S.length();
Set<String> partString = new HashSet<>();
for(int i=1;i<=length;i++){
for(int j=0;j<length-i;j++){
String temp = S.substring(j,j+i);
partString.add(temp);
}
}
System.out.println(partString.size());
}
}
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String S = sc.next();
int length = S.length();
Set<String> partString = new HashSet<>();
for(int i=1;i<=length;i++){
for(int j=0;j<=length-i;j++){
String temp = S.substring(j,j+i);
partString.add(temp);
}
}
System.out.println(partString.size());
}
} | ConDefects/ConDefects/Code/abc347_b/Java/52190690 |
condefects-java_data_939 |
import java.util.Scanner;
import java.util.ArrayList;
import java.util.List;
class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
String S = s.next();
List<String> Slist = new ArrayList<String>();
int count = 0;
for(int i = 0;i < S.length();i++){
for(int j = i+1;j < S.length();j++){
String newS = S.substring(i,j);
if(!Slist.contains(newS)){
Slist.add(newS);
count++;
}
}
}
System.out.println(count);
s.close();
}
}
import java.util.Scanner;
import java.util.ArrayList;
import java.util.List;
class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
String S = s.next();
List<String> Slist = new ArrayList<String>();
int count = 0;
for(int i = 0;i < S.length();i++){
for(int j = i+1;j <= S.length();j++){
String newS = S.substring(i,j);
if(!Slist.contains(newS)){
Slist.add(newS);
count++;
}
}
}
System.out.println(count);
s.close();
}
} | ConDefects/ConDefects/Code/abc347_b/Java/52199810 |
condefects-java_data_940 | import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
/**
* 2023/7/31
* A - Chord
*/
public class Main {
public static void main( String[] args ) {
// 入力値
Scanner sc = new Scanner( System.in );
List<String> list = Arrays.asList( "ACE", "BDF", "CEG", "DFA", "EGB", "FAC", "GB" );
System.out.println( list.contains( sc.next() ) ? "Yes" : "No" );
sc.close();
}
}
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
/**
* 2023/7/31
* A - Chord
*/
public class Main {
public static void main( String[] args ) {
// 入力値
Scanner sc = new Scanner( System.in );
List<String> list = Arrays.asList( "ACE", "BDF", "CEG", "DFA", "EGB", "FAC", "GBD" );
System.out.println( list.contains( sc.next() ) ? "Yes" : "No" );
sc.close();
}
}
| ConDefects/ConDefects/Code/abc312_a/Java/44126346 |
condefects-java_data_941 | import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
List<String> str = List.of("ACE", "BDF", "CEG", "DFA", "FAC", "GBD");
String s = sc.nextLine();
String ans = "No";
if (str.contains(s)) {
ans = "Yes";
}
System.out.println(ans);
}
}
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
List<String> str = List.of("ACE", "BDF", "CEG", "DFA", "EGB","FAC", "GBD");
String s = sc.nextLine();
String ans = "No";
if (str.contains(s)) {
ans = "Yes";
}
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc312_a/Java/44129020 |
condefects-java_data_942 | import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static void solve()
{
int n = ni();
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
int argmin = 0;
for(int i = 0;i < n;i++){
if(a[i] < a[argmin]){
argmin = i;
}
}
long ans = go(a, argmin);
ans += go(rev(a), n-1-argmin);
ans += a[argmin];
out.println(ans);
}
static long go(long[] a, int argmin)
{
long ans = 0;
int n = a.length;
int[] stack = new int[n];
int sp = 0;
stack[sp++] = argmin;
for (int i = argmin + 1; i < n; i++) {
while (sp > 1 && a[stack[sp - 1]] >= a[i]) {
sp--;
}
while (sp - 2 >= 0) {
int x = stack[sp - 2], y = stack[sp - 1];
int len = i - x;
long ey = a[x] + (a[i] - a[x]) * (y - x) / len;
if (a[y] >= ey) {
sp--;
} else {
break;
}
}
stack[sp++] = i;
}
for (int i = 1; i < sp; i++) {
int len = stack[i] - stack[i-1];
long dv = a[stack[i]] - a[stack[i-1]];
ans += a[stack[i-1]] * len + dv%len * (dv%len+1) / 2 + (long)len*(len+1)/2 * (dv/len);
}
return ans;
}
public static long[] rev(long[] a){long[] b = new long[a.length];for(int i = 0;i < a.length;i++)b[a.length-1-i] = a[i];return b;}
public static void main(String[] args) throws Exception
{
long S = System.currentTimeMillis();
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
solve();
out.flush();
long G = System.currentTimeMillis();
tr(G-S+"ms");
}
private static boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private static byte[] inbuf = new byte[1024];
static int lenbuf = 0, ptrbuf = 0;
private static int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
// private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private static double nd() { return Double.parseDouble(ns()); }
private static char nc() { return (char)skip(); }
private static String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private static char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private static char[][] nm(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private static int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private static int ni()
{
int num = 0, b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static void solve()
{
int n = ni();
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
int argmin = 0;
for(int i = 0;i < n;i++){
if(a[i] < a[argmin]){
argmin = i;
}
}
long ans = go(a, argmin);
ans += go(rev(a), n-1-argmin);
ans += a[argmin];
out.println(ans);
}
static long go(long[] a, int argmin)
{
long ans = 0;
int n = a.length;
int[] stack = new int[n];
int sp = 0;
stack[sp++] = argmin;
for (int i = argmin + 1; i < n; i++) {
while (sp > 1 && a[stack[sp - 1]] >= a[i]) {
sp--;
}
while (sp - 2 >= 0) {
int x = stack[sp - 2], y = stack[sp - 1];
int len = i - x;
long ey = a[x] + (a[i] - a[x]) / len * (y - x) + ((a[i] - a[x]) % len == 0 ? 0 : Math.max(0, y - x - (len - (a[i] - a[x]) % len)));
if (a[y] >= ey) {
sp--;
} else {
break;
}
}
stack[sp++] = i;
}
for (int i = 1; i < sp; i++) {
int len = stack[i] - stack[i-1];
long dv = a[stack[i]] - a[stack[i-1]];
ans += a[stack[i-1]] * len + dv%len * (dv%len+1) / 2 + (long)len*(len+1)/2 * (dv/len);
}
return ans;
}
public static long[] rev(long[] a){long[] b = new long[a.length];for(int i = 0;i < a.length;i++)b[a.length-1-i] = a[i];return b;}
public static void main(String[] args) throws Exception
{
long S = System.currentTimeMillis();
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
solve();
out.flush();
long G = System.currentTimeMillis();
tr(G-S+"ms");
}
private static boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private static byte[] inbuf = new byte[1024];
static int lenbuf = 0, ptrbuf = 0;
private static int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
// private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private static double nd() { return Double.parseDouble(ns()); }
private static char nc() { return (char)skip(); }
private static String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private static char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private static char[][] nm(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private static int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private static int ni()
{
int num = 0, b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
| ConDefects/ConDefects/Code/arc130_f/Java/27575967 |
condefects-java_data_943 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Queue;
class Main {
public static void solve(Read br, Write out) {
int h = br.readI(), w = br.readI();
int a[][] = new int[h][w];
int ban[][] = new int[h][w];
int s[] = new int[2], g[] = new int[2];
for (int i = 0; i < h; i++) {
char c[] = stocs(br.readS());
for (int j = 0; j < w; j++) {
if (c[j] == '#') {
a[i][j] = -1;
} else if (c[j] == 'S') {
s[0] = i;
s[1] = j;
} else if (c[j] == 'G') {
g[0] = i;
g[1] = j;
} else if (c[j] == 'v') {
a[i][j] = 1;
} else if (c[j] == '<') {
a[i][j] = 2;
} else if (c[j] == '^') {
a[i][j] = 3;
} else if (c[j] == '>') {
a[i][j] = 4;
}
}
}
int dx[] = { 0, -1, 0, 1 }, dy[] = { -1, 0, 1, 0 };
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (a[i][j] == -1) {
ban[i][j] = 1;
} else if (a[i][j] != 0) {
int t = a[i][j] - 1;
ban[i][j] = 1;
int nowi = i + dy[t], nowj = j + dx[t];
while (nowi >= 0 && nowi < h && nowj >= 0 && nowj < w && a[nowi][nowj] == 0) {
ban[nowi][nowj] = 1;
nowi += dy[t];
nowj += dx[t];
}
}
}
}
int dp[][] = new int[h][w];
ArrayDeque<int[]> q = new ArrayDeque<>();
q.add(s);
while (q.size() > 0) {
int t[] = q.poll();
int i = t[0], j = t[1];
for (int k = 0; k < 4; k++) {
int ni = i + dy[k], nj = j + dx[k];
if (ni < 0 || ni >= h || nj < 0 || nj >= w || ban[ni][nj] == 1) {
continue;
}
if (dp[ni][nj] == 0) {
dp[ni][nj] = dp[i][j] + 1;
q.add(new int[] { ni, nj });
}
}
}
if (dp[g[0]][g[1]] == 0) {
out.pl(-1);
} else {
out.pl(dp[g[0]][g[1]]);
}
}
public static void main(String args[]) {
Read br = new Read();
Write out = new Write();
solve(br, out);
out.flush();
}
static class KDtree {
Node root;
int k;
public KDtree(int a[][], int k) {
this.k = k;
root = construct(a, 0);
}
private Node construct(int a[][], int depth) {
int axis = depth % k;
sortA(a, axis);
int m = a.length / 2;
Node node = new Node(a[m], axis);
if (m > 0) {
node.left = construct(Arrays.copyOfRange(a, 0, m), depth + 1);
node.left.parent = node;
}
if (m + 1 < a.length) {
node.right = construct(Arrays.copyOfRange(a, m + 1, a.length), depth + 1);
node.right.parent = node;
}
return node;
}
public int[] search(int coord[]) {
Node node = neighborhood(coord, root);
double dist = distance(coord, node.coord);
ArrayList<Node> list = new ArrayList<>();
list.add(node);
while (node.parent != null) {
node = node.parent;
if (Math.abs(coord[node.axis] - node.coord[node.axis]) < dist) {
neighborhood(coord, node);
list.add(node);
}
}
return node.coord;
}
public double distance(int a[], int b[]) {
double d = 0;
for (int i = 0; i < k; i++) {
int t = a[i] - b[i];
d += t * t;
}
return Math.sqrt(d);
}
private Node neighborhood(int coord[], Node n) {
int axis = n.axis;
if (coord[axis] < n.coord[axis]) {
if (n.left != null) {
return neighborhood(coord, n.left);
} else {
return n;
}
} else {
if (n.right != null) {
return neighborhood(coord, n.right);
} else {
return n;
}
}
}
class Node {
int coord[];
int axis;
Node left, right, parent;
public Node(int c[], int axis) {
this.coord = c;
this.axis = axis;
}
}
}
static class Tree {
int n;
int root;
int parent[];
int height[];
int maxh;
ArrayList<ArrayList<Integer>> child;
int lca[][];
public Tree(int nn, int r) {
n = nn;
root = r;
parent = new int[n];
height = new int[n];
child = new ArrayList<>();
for (int i = 0; i < n; i++) {
child.add(new ArrayList<>());
}
}
public Tree(int par[], int r) {
n = par.length;
root = r;
parent = new int[n];
height = new int[n];
child = new ArrayList<>();
for (int i = 0; i < n; i++) {
child.add(new ArrayList<>());
}
for (int i = 0; i < n; i++) {
parent[i] = par[i];
if (parent[i] != -1) {
child.get(parent[i]).add(i);
}
}
ArrayDeque<Integer> q = new ArrayDeque<>();
q.add(root);
while (q.size() > 0) {
int v = q.poll();
for (int u : child.get(v)) {
height[u] = height[v] + 1;
if (height[u] > maxh) {
maxh = height[u];
}
q.add(u);
}
}
}
public Tree(Graph g, int r) {
this(g.n, r);
construct(g);
}
public void construct(Graph g) {
constructdfs(g, root, -1, 0, new boolean[n]);
}
public void constructdfs(Graph g, int now, int before, int h, boolean flg[]) {
flg[now] = true;
parent[now] = before;
height[now] = h;
if (h > maxh) {
maxh = h;
}
for (Graph.Edge e : g.g.get(now)) {
if (e.v != before) {
constructdfs(g, e.v, now, h + 1, flg);
child.get(now).add(e.v);
}
}
}
public void const_lowest_common_ancestor() {
int k = 1;
while ((1 << k) <= maxh) {
k++;
}
lca = new int[k][n];
for (int i = 0; i < n; i++) {
lca[0][i] = parent[i];
if (lca[0][i] == -1) {
lca[0][i] = i;
}
}
for (int i = 1; i < k; i++) {
for (int v = 0; v < n; v++) {
lca[i][v] = lca[i - 1][lca[i - 1][v]];
}
}
}
public int get_anscestor(int u, int d) {
int k = lca.length;
for (int i = 0; i < k; i++) {
if ((d >> i) % 2 > 0) {
u = lca[i][u];
}
}
return u;
}
public int query_lowest_common_ancestor(int u, int v) {
if (height[u] < height[v]) {
return query_lowest_common_ancestor(v, u);
}
int k = lca.length;
u = get_anscestor(u, height[u] - height[v]);
if (u == v) {
return u;
}
for (int i = k - 1; i >= 0; i--) {
if (lca[i][u] != lca[i][v]) {
u = lca[i][u];
v = lca[i][v];
}
}
return lca[0][u];
}
}
public static int comp(long a, long b) {
return a > b ? 1 : a < b ? -1 : 0;
}
public static long fact(int i) {
if (i == 1 || i == 0) {
return 1L;
}
return i * fact(i - 1);
}
public static long gcd(long a, long b) {
if (a < b) {
return gcd(b, a);
}
long c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
public static long lcm(long a, long b) {
return a / gcd(a, b) * b;
}
public static int gcd(int a, int b) {
if (a < b) {
return gcd(b, a);
}
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
public static int lcm(int a, int b) {
return a / gcd(a, b) * b;
}
public static void sortA(int n[]) {
Arrays.sort(n);
}
public static void sortA(long n[]) {
Arrays.sort(n);
}
public static void sortD(int n[]) {
Arrays.sort(n);
rev(n);
}
public static void rev(int n[]) {
int l = n.length;
for (int i = 0; i < l / 2; i++) {
int t = n[i];
n[i] = n[l - i - 1];
n[l - i - 1] = t;
}
}
public static void sortA(ArrayList<Integer> n) {
Collections.sort(n);
}
public static void sortD(ArrayList<Integer> n) {
Collections.sort(n, Collections.reverseOrder());
}
public static void sortA(int n[][], int k) {
Arrays.sort(n, (a, b) -> Integer.compare(a[k], b[k]));
}
public static void sortD(int n[][], int k) {
Arrays.sort(n, (a, b) -> Integer.compare(b[k], a[k]));
}
public static void mysort(int n[][], int k) {
Arrays.sort(n, new Comparator<int[]>() {
public int compare(int[] x, int[] y) {
if (x[k] == y[k]) {
return x[1] - y[1];
}
return x[k] - y[k];
}
});
}
static class ModFunc {
int n;
long mod;
long fact[], invfact[];
public ModFunc(int n, long mod) {
this.n = n;
this.mod = mod;
fact = new long[n + 1];
invfact = new long[n + 1];
modfact();
modinvfact();
}
public static long modfact(int n, long mod) {
long k = 1;
for (int i = 1; i <= n; i++) {
k = k * i % mod;
}
return k;
}
public static long modinvfact(int n, long mod) {
return modinv(modfact(n, mod), mod);
}
public static long modinv(long a, long mod) {
long x1 = 1, x2 = 0;
long p = a, q = mod, t;
while (q != 0) {
t = p / q;
t = x1 - t * x2;
x1 = x2;
x2 = t;
t = p % q;
p = q;
q = t;
}
return x1 < 0 ? x1 + mod : x1;
}
private void modfact() {
fact[0] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = fact[i - 1] * i % mod;
}
}
private void modinvfact() {
invfact[n] = modinv(fact[n], mod);
for (int i = n - 1; i >= 0; i--) {
invfact[i] = invfact[i + 1] * (i + 1) % mod;
}
}
public long modConv(int n, int k) {
return ((fact[n] * invfact[n - k]) % mod) * invfact[k] % mod;
}
public static long modpow(long x, long n, long pow) {
long r = 1;
while (n >= 1) {
if (1 == (n & 1)) {
r = r * x % pow;
}
x = x * x % pow;
n /= 2;
}
return r;
}
}
static class Permu {
int n;
public int a[];
boolean flg;
public Permu(int n) {
this.n = n;
flg = true;
a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = i;
}
}
public Permu(int k[]) {
this.n = k.length;
flg = true;
a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = k[i];
}
}
public boolean next() {
for (int i = n - 2; i >= 0; i--) {
if (a[i] >= a[i + 1]) {
continue;
}
for (int j = n - 1;; j--) {
if (a[i] >= a[j]) {
continue;
}
int temp = a[i];
a[i] = a[j];
a[j] = temp;
i++;
for (j = n - 1; i < j; i++, j--) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
return true;
}
}
flg = false;
return false;
}
public boolean before() {
for (int i = n - 2; i >= 0; i--) {
if (a[i] <= a[i + 1]) {
continue;
}
for (int j = n - 1;; j--) {
if (a[i] <= a[j]) {
continue;
}
int temp = a[i];
a[i] = a[j];
a[j] = temp;
i++;
for (j = n - 1; i < j; i++, j--) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
return true;
}
}
flg = false;
return false;
}
}
static class Compress {
ArrayList<Integer> a;
HashMap<Integer, Integer> map;
public Compress(int[] b) {
HashSet<Integer> temp = new HashSet<>();
for (int i : b) {
temp.add(i);
}
a = new ArrayList<Integer>(temp);
setup();
}
public Compress(ArrayList<Integer> b) {
a = new ArrayList<Integer>(new HashSet<Integer>(b));
setup();
}
private void setup() {
map = new HashMap<>();
sortA(a);
for (int i = 0; i < a.size(); i++) {
map.put(a.get(i), i);
}
}
public int get(int i) {
return map.get(i);
}
}
static class UnionFindTree {
int parent[];
int size;
int vol[];
public UnionFindTree(int s) {
size = s;
parent = new int[size];
vol = new int[size];
for (int i = 0; i < size; i++) {
parent[i] = i;
vol[i] = 1;
}
}
public int root(int n) {
if (parent[n] == n) {
return n;
}
parent[n] = root(parent[n]);
return parent[n];
}
public void unite(int a, int b) {
int ra = root(a), rb = root(b);
if (ra == rb) {
return;
}
if (vol[ra] < vol[rb]) {
a = ra;
ra = rb;
rb = a;
}
parent[rb] = ra;
vol[ra] += vol[rb];
}
public boolean same(int a, int b) {
return root(a) == root(b);
}
}
static class WeightUnionFindTree {
int parent[];
int size;
int vol[];
int diff[];
public WeightUnionFindTree(int s) {
size = s;
parent = new int[size];
vol = new int[size];
diff = new int[size];
for (int i = 0; i < size; i++) {
parent[i] = i;
vol[i] = 1;
diff[i] = 0;
}
}
public int root(int n) {
if (parent[n] == n) {
return n;
}
int r = root(parent[n]);
diff[n] += diff[parent[n]];
parent[n] = r;
return parent[n];
}
public int weight(int n) {
root(n);
return diff[n];
}
public void unite(int a, int b, int w) {
int ra = root(a), rb = root(b);
if (ra == rb) {
return;
}
w += weight(a);
w -= weight(b);
if (vol[ra] < vol[rb]) {
a = ra;
ra = rb;
rb = a;
w = -w;
}
parent[rb] = ra;
vol[ra] += vol[rb];
diff[rb] = w;
}
public int differ(int a, int b) {
return weight(a) - weight(b);
}
public boolean same(int a, int b) {
return root(a) == root(b);
}
}
static abstract class SegmentTree {
int n, leafN;
int ar[];
int lazy[];
int temp;
public SegmentTree(int x, int temp) {
leafN = x;
this.temp = temp;
n = twon(leafN);
ar = new int[2 * n - 1];
lazy = new int[2 * n - 1];
for (int i = 0; i < n * 2 - 1; i++) {
ar[i] = temp;
lazy[i] = temp;
}
}
public abstract int func(int a, int b);
public void eval(int k) {
if (lazy[k] == temp) {
return;
}
if (k < n - 1) {
lazy[k * 2 + 1] = lazy[k];
lazy[k * 2 + 2] = lazy[k];
}
ar[k] = lazy[k];
lazy[k] = temp;
}
public void update(int i, int x) {
int now = i + n - 1;
ar[now] = x;
while (now > 0) {
now = (now - 1) / 2;
ar[now] = func(ar[now * 2 + 1], ar[now * 2 + 2]);
}
}
public void add(int i, int x) {
update(i, ar[i + n - 1] + x);
}
public void update(int a, int b, int x) {
update(a, b, x, 0, 0, n);
}
public void update(int a, int b, int x, int k, int l, int r) {
eval(k);
if (r <= a || b <= l) {
return;
} else if (a <= l && r <= b) {
lazy[k] = x;
eval(k);
}
update(a, b, x, k * 2 + 1, l, (l + r) / 2);
update(a, b, x, k * 2 + 2, (l + r) / 2, r);
ar[k] = func(ar[k * 2 + 1], ar[k * 2 + 2]);
}
public int get(int i) {
return ar[i + n - 1];
}
public int query(int a, int b) {
return query(a, b, 0, 0, n);
}
public int query(int a, int b, int k, int l, int r) {
eval(k);
if (r <= a || b <= l) {
return temp;
} else if (a <= l && r <= b) {
return ar[k];
}
int t1 = query(a, b, k * 2 + 1, l, (l + r) / 2), t2 = query(a, b, k * 2 + 2, (l + r) / 2, r);
return func(t1, t2);
}
private int twon(int x) {
int i = 1;
while (i < x) {
i *= 2;
}
return i;
}
}
static class SegmentTreeE extends SegmentTree {
public SegmentTreeE(int x) {
super(x, 0);
}
public int func(int a, int b) {
return a ^ b;
}
}
static class SegmentTreeMin extends SegmentTree {
public SegmentTreeMin(int x) {
super(x, Integer.MAX_VALUE);
}
public int func(int a, int b) {
return Math.min(a, b);
}
}
static class SegmentTreeMax extends SegmentTree {
public SegmentTreeMax(int x) {
super(x, Integer.MIN_VALUE);
}
public int func(int a, int b) {
return Math.max(a, b);
}
public int leftmax(int a) {
if (ar[0] < a) {
return -1;
}
return leftmax(a, 0);
}
private int leftmax(int a, int i) {
eval(i);
if (i >= n - 1) {
return i - n + 1;
}
int next = i * 2 + 1;
if (ar[next] < a) {
return leftmax(a, next + 1);
}
return leftmax(a, next);
}
}
static class SegmentTreeS extends SegmentTree {
public SegmentTreeS(int x) {
super(x, 0);
}
public int func(int a, int b) {
return a + b;
}
}
static class BIT {
int n;
int ar[];
public BIT(int x) {
n = x + 1;
ar = new int[n];
for (int i = 0; i < n; i++) {
ar[i] = 0;
}
}
public void update(int i, int x) {
i++;
for (int ii = i; ii < n; ii += (ii & -ii)) {
ar[ii] += x;
}
}
public int sum(int i) {
int k = 0;
for (int ii = i; ii > 0; ii -= (ii & -ii)) {
k += ar[ii];
}
return k;
}
}
static class Graph {
int n;
ArrayList<ArrayList<Edge>> g;
public Graph(int nn) {
n = nn;
g = new ArrayList<ArrayList<Edge>>();
for (int i = 0; i < n; i++) {
g.add(new ArrayList<Edge>());
}
}
public void add(int a, int b, int d) {
g.get(a).add(new Edge(b, d));
g.get(b).add(new Edge(a, d));
}
public void addY(int a, int b, int d) {
g.get(a).add(new Edge(b, d));
}
public void add(int a, int b) {
g.get(a).add(new Edge(b, 1));
g.get(b).add(new Edge(a, 1));
}
public void addY(int a, int b) {
g.get(a).add(new Edge(b, 1));
}
public int len(int a) {
return g.get(a).size();
}
public long[][] dijkstra(int s) {
long dist[][] = new long[n][2];
for (int i = 0; i < n; i++) {
dist[i][0] = Long.MAX_VALUE;
dist[i][1] = -1;
}
dist[s][0] = 0;
dist[s][1] = -1;
PriorityQueue<long[]> q = new PriorityQueue<long[]>(new Comparator<long[]>() {
public int compare(long[] x, long[] y) {
return Long.compare(x[1], y[1]);
}
});
q.add(new long[] { s, 0L });
while (q.size() > 0) {
long[] p = q.poll();
if (dist[(int) p[0]][0] != p[1]) {
continue;
}
for (Edge e : g.get((int) p[0])) {
if (dist[e.v][0] > dist[(int) p[0]][0] + e.d) {
dist[e.v][0] = dist[(int) p[0]][0] + e.d;
dist[e.v][1] = (int) p[0];
q.add(new long[] { e.v, dist[e.v][0] });
}
}
}
return dist;
}
public static long[][] floydwarshall(int g[][]) {
int n = g.length;
long dist[][] = new long[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dist[i][j] = g[i][j];
if (dist[i][j] == 0) {
dist[i][j] = Long.MAX_VALUE;
}
}
}
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (dist[i][k] == Long.MAX_VALUE || dist[k][j] == Long.MAX_VALUE) {
continue;
}
dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
return dist;
}
public void dfs(int v) {
ArrayDeque<Integer> q = new ArrayDeque<>();
boolean flg[] = new boolean[n];
q.addLast(v);
flg[v] = true;
while (q.size() > 0) {
int now = q.pollLast();
for (Edge e : g.get(now)) {
if (!flg[e.v]) {
flg[e.v] = true;
q.addLast(e.v);
}
}
}
}
public void bfs(int s) {
boolean flg[] = new boolean[n];
Queue<Integer> q = new ArrayDeque<Integer>();
q.add(s);
while (q.size() > 0) {
int v = q.poll();
flg[v] = true;
for (Edge e : g.get(v)) {
if (!flg[e.v]) {
q.add(e.v);
flg[e.v] = true;
}
}
}
}
public int minspantree() {
PriorityQueue<Edge> q = new PriorityQueue<Edge>(new Comparator<Edge>() {
public int compare(Edge a, Edge b) {
return a.d - b.d;
}
});
boolean flg[] = new boolean[n];
int c = 1, sum = 0;
for (Edge e : g.get(0)) {
q.add(e);
}
flg[0] = true;
while (c < n) {
Edge e = q.poll();
if (flg[e.v]) {
continue;
}
flg[e.v] = true;
sum += e.d;
c++;
for (Edge i : g.get(e.v)) {
if (!flg[i.v]) {
q.add(i);
}
}
}
return sum;
}
public int[] scc1_1() {
Graph g2 = new Graph(n);
for (int i = 0; i < n; i++) {
for (Edge e : g.get(i)) {
g2.addY(e.v, i);
}
}
ArrayList<Integer> list = new ArrayList<Integer>();
boolean flg[] = new boolean[n];
boolean end[] = new boolean[n];
ArrayDeque<Integer> q = new ArrayDeque<>();
for (int i = 0; i < n; i++) {
if (flg[i]) {
continue;
}
q.addLast(-i - 1);
q.addLast(i + 1);
while (q.size() > 0) {
int v = q.pollLast();
if (v < 0) {
v = -v - 1;
if (end[v]) {
continue;
}
end[v] = true;
list.add(v);
continue;
}
v--;
if (flg[v]) {
continue;
}
flg[v] = true;
for (Edge e : g.get(v)) {
if (flg[e.v]) {
continue;
}
q.addLast(-e.v - 1);
q.addLast(e.v + 1);
}
}
}
return g2.scc1_2(list);
}
public int[] scc1_2(ArrayList<Integer> list) {
boolean flg[] = new boolean[n];
int ren[] = new int[n];
ArrayDeque<Integer> q = new ArrayDeque<>();
int num = 0;
for (int i = n - 1; i >= 0; i--) {
int now = list.get(i);
if (flg[now]) {
continue;
}
q.add(now);
flg[now] = true;
while (q.size() > 0) {
int v = q.poll();
ren[v] = num;
for (Edge e : g.get(v)) {
if (flg[e.v]) {
continue;
}
flg[e.v] = true;
q.add(e.v);
}
}
num++;
}
return ren;
}
public int[] scc() {
Graph g2 = new Graph(n);
for (int i = 0; i < n; i++) {
for (Edge e : g.get(i)) {
g2.addY(e.v, i);
}
}
ArrayList<Integer> list = new ArrayList<Integer>();
boolean flg[] = new boolean[n];
for (int i = 0; i < n; i++) {
if (!flg[i]) {
dfs_scc(i, flg, list);
}
}
return g2.scc2(list);
}
public int[] scc2(ArrayList<Integer> list) {
boolean flg[] = new boolean[n];
int ren[] = new int[n];
int num = 0;
for (int i = n - 1; i >= 0; i--) {
int now = list.get(i);
if (!flg[now]) {
dfs_scc2(now, flg, ren, num);
num++;
}
}
return ren;
}
private void dfs_scc(int v, boolean flg[], ArrayList<Integer> list) {
flg[v] = true;
for (Edge e : g.get(v)) {
if (!flg[e.v]) {
dfs_scc(e.v, flg, list);
}
}
list.add(v);
}
private void dfs_scc2(int v, boolean flg[], int num[], int now) {
flg[v] = true;
num[v] = now;
for (Edge e : g.get(v)) {
if (!flg[e.v]) {
dfs_scc2(e.v, flg, num, now);
}
}
}
public ArrayList<ArrayList<Integer>> two_Edge_connected() {
int ord[] = new int[n], low[] = new int[n];
boolean flg[] = new boolean[n];
for (int i = 0; i < n; i++) {
if (!flg[i]) {
tecDfs(i, flg, ord, low, -1);
}
}
flg = new boolean[n];
ArrayList<ArrayList<Integer>> list = new ArrayList<>();
int now = 0;
for (int i = 0; i < n; i++) {
if (!flg[i]) {
list.add(new ArrayList<>());
tecDfs2(i, flg, ord, low, list.get(now));
now++;
}
}
return list;
}
public void tecDfs(int v, boolean flg[], int ord[], int low[], int before) {
flg[v] = true;
if (before != -1) {
ord[v] = ord[before] + 1;
} else {
ord[v] = 0;
}
low[v] = ord[v];
for (Edge e : g.get(v)) {
if (e.v == before) {
before = -1;
continue;
}
if (flg[e.v]) {
low[v] = Math.min(low[v], ord[e.v]);
} else {
tecDfs(e.v, flg, ord, low, v);
low[v] = Math.min(low[v], low[e.v]);
}
}
}
public void tecDfs2(int v, boolean flg[], int ord[], int low[], ArrayList<Integer> list) {
flg[v] = true;
list.add(v);
for (Edge e : g.get(v)) {
if (flg[e.v]) {
continue;
}
if (ord[v] < low[e.v] || ord[e.v] < low[v]) {
continue;
}
tecDfs2(e.v, flg, ord, low, list);
}
}
static class Edge {
int v, d;
public Edge(int v, int d) {
this.v = v;
this.d = d;
}
}
}
static class Read {
BufferedReader br;
public Read() {
br = new BufferedReader(new InputStreamReader(System.in));
}
private boolean canprint(int a) {
return 33 <= a && a <= 126;
}
private int skipread() {
int a = readC();
while (a != -1 && !canprint(a)) {
a = readC();
}
return a;
}
public char readC() {
try {
return (char) br.read();
} catch (IOException e) {
e.printStackTrace();
return (char) -1;
}
}
public String readLine() {
try {
return br.readLine();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public String readS() {
StringBuilder sb = new StringBuilder();
int k = skipread();
while (true) {
if (!canprint(k)) {
break;
}
sb.append((char) k);
k = readC();
}
return sb.toString();
}
public int readI() {
int r = 0;
int k = skipread();
int flg = 1;
if (k == '-') {
flg = -1;
k = readC();
}
while (true) {
if (!canprint(k)) {
break;
}
r = r * 10 + (k - '0');
k = readC();
}
return flg * r;
}
public long readL() {
long r = 0;
int k = skipread();
int flg = 1;
if (k == '-') {
flg = -1;
k = readC();
}
while (true) {
if (!canprint(k)) {
break;
}
r = r * 10 + (k - '0');
k = readC();
}
return flg * r;
}
public String[] readSs(int n) {
String[] a = new String[n];
for (int i = 0; i < n; i++) {
a[i] = readS();
}
return a;
}
public int[] readIs(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = readI();
}
return a;
}
public long[] readLs(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = readL();
}
return a;
}
}
static class Write {
PrintWriter out;
boolean debug;
public Write() {
out = new PrintWriter(System.out);
debug = false;
}
public <T> void pr(T str) {
out.print(str);
}
public <T> void pl(T str) {
out.println(str);
}
public void pr(int[] a) {
int t = a.length;
if (t > 0) {
pr(a[0]);
}
for (int i = 1; i < t; i++) {
pr(" " + a[i]);
}
pl("");
}
public void pr(int[][] a) {
for (int i[] : a) {
pr(i);
}
}
public void pr(long[] a) {
int t = a.length;
if (t > 0) {
pr(a[0]);
}
for (int i = 1; i < t; i++) {
pr(" " + a[i]);
}
pl("");
}
public void pr(long[][] a) {
for (long i[] : a) {
pr(i);
}
}
public void pr(String[] a) {
int t = a.length;
if (t > 0) {
pr(a[0]);
}
for (int i = 1; i < t; i++) {
pr(" " + a[i]);
}
pl("");
}
public void pr(String[][] a) {
for (String i[] : a) {
pr(i);
}
}
public void yes() {
pl("Yes");
}
public void no() {
pl("No");
}
public void yn(boolean flg) {
if (flg) {
yes();
} else {
no();
}
}
public void flush() {
out.flush();
}
public static <T> void prA(T str) {
System.out.print(str);
}
public static <T> void plA(T str) {
System.out.println(str);
}
public static void prA(int[] a) {
int t = a.length;
if (t > 0) {
prA(a[0]);
}
for (int i = 1; i < t; i++) {
prA(" " + a[i]);
}
plA("");
}
public static void prA(int[][] a) {
for (int i[] : a) {
prA(i);
}
}
public static void prA(long[] a) {
int t = a.length;
if (t > 0) {
prA(a[0]);
}
for (int i = 1; i < t; i++) {
prA(" " + a[i]);
}
plA("");
}
public static void prA(long[][] a) {
for (long i[] : a) {
prA(i);
}
}
public static void prA(String[] a) {
int t = a.length;
if (t > 0) {
prA(a[0]);
}
for (int i = 1; i < t; i++) {
prA(" " + a[i]);
}
plA("");
}
public static void prA(String[][] a) {
for (String i[] : a) {
prA(i);
}
}
public <T> void debugP(T str) {
if (debug) {
pl(str);
}
}
}
public static long stol(String s) {
return Long.parseLong(s);
}
public static int stoi(String s) {
return Integer.parseInt(s);
}
public static int[] stoi(String s[]) {
int a[] = new int[s.length];
for (int i = 0; i < s.length; i++) {
a[i] = stoi(s[i]);
}
return a;
}
public static String itos(int i) {
return String.valueOf(i);
}
public static String[] itos(int[] a) {
String s[] = new String[a.length];
for (int i = 0; i < a.length; i++) {
s[i] = itos(a[i]);
}
return s;
}
public static String ctos(char c) {
return String.valueOf(c);
}
public static String cstos(char[] c) {
return new String(c);
}
public static char stoc(String s) {
return s.charAt(0);
}
public static char stoc(String s, int i) {
return s.charAt(i);
}
public static char[] stocs(String s) {
return s.toCharArray();
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Queue;
class Main {
public static void solve(Read br, Write out) {
int h = br.readI(), w = br.readI();
int a[][] = new int[h][w];
int ban[][] = new int[h][w];
int s[] = new int[2], g[] = new int[2];
for (int i = 0; i < h; i++) {
char c[] = stocs(br.readS());
for (int j = 0; j < w; j++) {
if (c[j] == '#') {
a[i][j] = -1;
} else if (c[j] == 'S') {
s[0] = i;
s[1] = j;
} else if (c[j] == 'G') {
g[0] = i;
g[1] = j;
} else if (c[j] == 'v') {
a[i][j] = 1;
} else if (c[j] == '<') {
a[i][j] = 2;
} else if (c[j] == '^') {
a[i][j] = 3;
} else if (c[j] == '>') {
a[i][j] = 4;
}
}
}
int dx[] = { 0, -1, 0, 1 }, dy[] = { 1, 0, -1, 0 };
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (a[i][j] == -1) {
ban[i][j] = 1;
} else if (a[i][j] != 0) {
int t = a[i][j] - 1;
ban[i][j] = 1;
int nowi = i + dy[t], nowj = j + dx[t];
while (nowi >= 0 && nowi < h && nowj >= 0 && nowj < w && a[nowi][nowj] == 0) {
ban[nowi][nowj] = 1;
nowi += dy[t];
nowj += dx[t];
}
}
}
}
int dp[][] = new int[h][w];
ArrayDeque<int[]> q = new ArrayDeque<>();
q.add(s);
while (q.size() > 0) {
int t[] = q.poll();
int i = t[0], j = t[1];
for (int k = 0; k < 4; k++) {
int ni = i + dy[k], nj = j + dx[k];
if (ni < 0 || ni >= h || nj < 0 || nj >= w || ban[ni][nj] == 1) {
continue;
}
if (dp[ni][nj] == 0) {
dp[ni][nj] = dp[i][j] + 1;
q.add(new int[] { ni, nj });
}
}
}
if (dp[g[0]][g[1]] == 0) {
out.pl(-1);
} else {
out.pl(dp[g[0]][g[1]]);
}
}
public static void main(String args[]) {
Read br = new Read();
Write out = new Write();
solve(br, out);
out.flush();
}
static class KDtree {
Node root;
int k;
public KDtree(int a[][], int k) {
this.k = k;
root = construct(a, 0);
}
private Node construct(int a[][], int depth) {
int axis = depth % k;
sortA(a, axis);
int m = a.length / 2;
Node node = new Node(a[m], axis);
if (m > 0) {
node.left = construct(Arrays.copyOfRange(a, 0, m), depth + 1);
node.left.parent = node;
}
if (m + 1 < a.length) {
node.right = construct(Arrays.copyOfRange(a, m + 1, a.length), depth + 1);
node.right.parent = node;
}
return node;
}
public int[] search(int coord[]) {
Node node = neighborhood(coord, root);
double dist = distance(coord, node.coord);
ArrayList<Node> list = new ArrayList<>();
list.add(node);
while (node.parent != null) {
node = node.parent;
if (Math.abs(coord[node.axis] - node.coord[node.axis]) < dist) {
neighborhood(coord, node);
list.add(node);
}
}
return node.coord;
}
public double distance(int a[], int b[]) {
double d = 0;
for (int i = 0; i < k; i++) {
int t = a[i] - b[i];
d += t * t;
}
return Math.sqrt(d);
}
private Node neighborhood(int coord[], Node n) {
int axis = n.axis;
if (coord[axis] < n.coord[axis]) {
if (n.left != null) {
return neighborhood(coord, n.left);
} else {
return n;
}
} else {
if (n.right != null) {
return neighborhood(coord, n.right);
} else {
return n;
}
}
}
class Node {
int coord[];
int axis;
Node left, right, parent;
public Node(int c[], int axis) {
this.coord = c;
this.axis = axis;
}
}
}
static class Tree {
int n;
int root;
int parent[];
int height[];
int maxh;
ArrayList<ArrayList<Integer>> child;
int lca[][];
public Tree(int nn, int r) {
n = nn;
root = r;
parent = new int[n];
height = new int[n];
child = new ArrayList<>();
for (int i = 0; i < n; i++) {
child.add(new ArrayList<>());
}
}
public Tree(int par[], int r) {
n = par.length;
root = r;
parent = new int[n];
height = new int[n];
child = new ArrayList<>();
for (int i = 0; i < n; i++) {
child.add(new ArrayList<>());
}
for (int i = 0; i < n; i++) {
parent[i] = par[i];
if (parent[i] != -1) {
child.get(parent[i]).add(i);
}
}
ArrayDeque<Integer> q = new ArrayDeque<>();
q.add(root);
while (q.size() > 0) {
int v = q.poll();
for (int u : child.get(v)) {
height[u] = height[v] + 1;
if (height[u] > maxh) {
maxh = height[u];
}
q.add(u);
}
}
}
public Tree(Graph g, int r) {
this(g.n, r);
construct(g);
}
public void construct(Graph g) {
constructdfs(g, root, -1, 0, new boolean[n]);
}
public void constructdfs(Graph g, int now, int before, int h, boolean flg[]) {
flg[now] = true;
parent[now] = before;
height[now] = h;
if (h > maxh) {
maxh = h;
}
for (Graph.Edge e : g.g.get(now)) {
if (e.v != before) {
constructdfs(g, e.v, now, h + 1, flg);
child.get(now).add(e.v);
}
}
}
public void const_lowest_common_ancestor() {
int k = 1;
while ((1 << k) <= maxh) {
k++;
}
lca = new int[k][n];
for (int i = 0; i < n; i++) {
lca[0][i] = parent[i];
if (lca[0][i] == -1) {
lca[0][i] = i;
}
}
for (int i = 1; i < k; i++) {
for (int v = 0; v < n; v++) {
lca[i][v] = lca[i - 1][lca[i - 1][v]];
}
}
}
public int get_anscestor(int u, int d) {
int k = lca.length;
for (int i = 0; i < k; i++) {
if ((d >> i) % 2 > 0) {
u = lca[i][u];
}
}
return u;
}
public int query_lowest_common_ancestor(int u, int v) {
if (height[u] < height[v]) {
return query_lowest_common_ancestor(v, u);
}
int k = lca.length;
u = get_anscestor(u, height[u] - height[v]);
if (u == v) {
return u;
}
for (int i = k - 1; i >= 0; i--) {
if (lca[i][u] != lca[i][v]) {
u = lca[i][u];
v = lca[i][v];
}
}
return lca[0][u];
}
}
public static int comp(long a, long b) {
return a > b ? 1 : a < b ? -1 : 0;
}
public static long fact(int i) {
if (i == 1 || i == 0) {
return 1L;
}
return i * fact(i - 1);
}
public static long gcd(long a, long b) {
if (a < b) {
return gcd(b, a);
}
long c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
public static long lcm(long a, long b) {
return a / gcd(a, b) * b;
}
public static int gcd(int a, int b) {
if (a < b) {
return gcd(b, a);
}
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
public static int lcm(int a, int b) {
return a / gcd(a, b) * b;
}
public static void sortA(int n[]) {
Arrays.sort(n);
}
public static void sortA(long n[]) {
Arrays.sort(n);
}
public static void sortD(int n[]) {
Arrays.sort(n);
rev(n);
}
public static void rev(int n[]) {
int l = n.length;
for (int i = 0; i < l / 2; i++) {
int t = n[i];
n[i] = n[l - i - 1];
n[l - i - 1] = t;
}
}
public static void sortA(ArrayList<Integer> n) {
Collections.sort(n);
}
public static void sortD(ArrayList<Integer> n) {
Collections.sort(n, Collections.reverseOrder());
}
public static void sortA(int n[][], int k) {
Arrays.sort(n, (a, b) -> Integer.compare(a[k], b[k]));
}
public static void sortD(int n[][], int k) {
Arrays.sort(n, (a, b) -> Integer.compare(b[k], a[k]));
}
public static void mysort(int n[][], int k) {
Arrays.sort(n, new Comparator<int[]>() {
public int compare(int[] x, int[] y) {
if (x[k] == y[k]) {
return x[1] - y[1];
}
return x[k] - y[k];
}
});
}
static class ModFunc {
int n;
long mod;
long fact[], invfact[];
public ModFunc(int n, long mod) {
this.n = n;
this.mod = mod;
fact = new long[n + 1];
invfact = new long[n + 1];
modfact();
modinvfact();
}
public static long modfact(int n, long mod) {
long k = 1;
for (int i = 1; i <= n; i++) {
k = k * i % mod;
}
return k;
}
public static long modinvfact(int n, long mod) {
return modinv(modfact(n, mod), mod);
}
public static long modinv(long a, long mod) {
long x1 = 1, x2 = 0;
long p = a, q = mod, t;
while (q != 0) {
t = p / q;
t = x1 - t * x2;
x1 = x2;
x2 = t;
t = p % q;
p = q;
q = t;
}
return x1 < 0 ? x1 + mod : x1;
}
private void modfact() {
fact[0] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = fact[i - 1] * i % mod;
}
}
private void modinvfact() {
invfact[n] = modinv(fact[n], mod);
for (int i = n - 1; i >= 0; i--) {
invfact[i] = invfact[i + 1] * (i + 1) % mod;
}
}
public long modConv(int n, int k) {
return ((fact[n] * invfact[n - k]) % mod) * invfact[k] % mod;
}
public static long modpow(long x, long n, long pow) {
long r = 1;
while (n >= 1) {
if (1 == (n & 1)) {
r = r * x % pow;
}
x = x * x % pow;
n /= 2;
}
return r;
}
}
static class Permu {
int n;
public int a[];
boolean flg;
public Permu(int n) {
this.n = n;
flg = true;
a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = i;
}
}
public Permu(int k[]) {
this.n = k.length;
flg = true;
a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = k[i];
}
}
public boolean next() {
for (int i = n - 2; i >= 0; i--) {
if (a[i] >= a[i + 1]) {
continue;
}
for (int j = n - 1;; j--) {
if (a[i] >= a[j]) {
continue;
}
int temp = a[i];
a[i] = a[j];
a[j] = temp;
i++;
for (j = n - 1; i < j; i++, j--) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
return true;
}
}
flg = false;
return false;
}
public boolean before() {
for (int i = n - 2; i >= 0; i--) {
if (a[i] <= a[i + 1]) {
continue;
}
for (int j = n - 1;; j--) {
if (a[i] <= a[j]) {
continue;
}
int temp = a[i];
a[i] = a[j];
a[j] = temp;
i++;
for (j = n - 1; i < j; i++, j--) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
return true;
}
}
flg = false;
return false;
}
}
static class Compress {
ArrayList<Integer> a;
HashMap<Integer, Integer> map;
public Compress(int[] b) {
HashSet<Integer> temp = new HashSet<>();
for (int i : b) {
temp.add(i);
}
a = new ArrayList<Integer>(temp);
setup();
}
public Compress(ArrayList<Integer> b) {
a = new ArrayList<Integer>(new HashSet<Integer>(b));
setup();
}
private void setup() {
map = new HashMap<>();
sortA(a);
for (int i = 0; i < a.size(); i++) {
map.put(a.get(i), i);
}
}
public int get(int i) {
return map.get(i);
}
}
static class UnionFindTree {
int parent[];
int size;
int vol[];
public UnionFindTree(int s) {
size = s;
parent = new int[size];
vol = new int[size];
for (int i = 0; i < size; i++) {
parent[i] = i;
vol[i] = 1;
}
}
public int root(int n) {
if (parent[n] == n) {
return n;
}
parent[n] = root(parent[n]);
return parent[n];
}
public void unite(int a, int b) {
int ra = root(a), rb = root(b);
if (ra == rb) {
return;
}
if (vol[ra] < vol[rb]) {
a = ra;
ra = rb;
rb = a;
}
parent[rb] = ra;
vol[ra] += vol[rb];
}
public boolean same(int a, int b) {
return root(a) == root(b);
}
}
static class WeightUnionFindTree {
int parent[];
int size;
int vol[];
int diff[];
public WeightUnionFindTree(int s) {
size = s;
parent = new int[size];
vol = new int[size];
diff = new int[size];
for (int i = 0; i < size; i++) {
parent[i] = i;
vol[i] = 1;
diff[i] = 0;
}
}
public int root(int n) {
if (parent[n] == n) {
return n;
}
int r = root(parent[n]);
diff[n] += diff[parent[n]];
parent[n] = r;
return parent[n];
}
public int weight(int n) {
root(n);
return diff[n];
}
public void unite(int a, int b, int w) {
int ra = root(a), rb = root(b);
if (ra == rb) {
return;
}
w += weight(a);
w -= weight(b);
if (vol[ra] < vol[rb]) {
a = ra;
ra = rb;
rb = a;
w = -w;
}
parent[rb] = ra;
vol[ra] += vol[rb];
diff[rb] = w;
}
public int differ(int a, int b) {
return weight(a) - weight(b);
}
public boolean same(int a, int b) {
return root(a) == root(b);
}
}
static abstract class SegmentTree {
int n, leafN;
int ar[];
int lazy[];
int temp;
public SegmentTree(int x, int temp) {
leafN = x;
this.temp = temp;
n = twon(leafN);
ar = new int[2 * n - 1];
lazy = new int[2 * n - 1];
for (int i = 0; i < n * 2 - 1; i++) {
ar[i] = temp;
lazy[i] = temp;
}
}
public abstract int func(int a, int b);
public void eval(int k) {
if (lazy[k] == temp) {
return;
}
if (k < n - 1) {
lazy[k * 2 + 1] = lazy[k];
lazy[k * 2 + 2] = lazy[k];
}
ar[k] = lazy[k];
lazy[k] = temp;
}
public void update(int i, int x) {
int now = i + n - 1;
ar[now] = x;
while (now > 0) {
now = (now - 1) / 2;
ar[now] = func(ar[now * 2 + 1], ar[now * 2 + 2]);
}
}
public void add(int i, int x) {
update(i, ar[i + n - 1] + x);
}
public void update(int a, int b, int x) {
update(a, b, x, 0, 0, n);
}
public void update(int a, int b, int x, int k, int l, int r) {
eval(k);
if (r <= a || b <= l) {
return;
} else if (a <= l && r <= b) {
lazy[k] = x;
eval(k);
}
update(a, b, x, k * 2 + 1, l, (l + r) / 2);
update(a, b, x, k * 2 + 2, (l + r) / 2, r);
ar[k] = func(ar[k * 2 + 1], ar[k * 2 + 2]);
}
public int get(int i) {
return ar[i + n - 1];
}
public int query(int a, int b) {
return query(a, b, 0, 0, n);
}
public int query(int a, int b, int k, int l, int r) {
eval(k);
if (r <= a || b <= l) {
return temp;
} else if (a <= l && r <= b) {
return ar[k];
}
int t1 = query(a, b, k * 2 + 1, l, (l + r) / 2), t2 = query(a, b, k * 2 + 2, (l + r) / 2, r);
return func(t1, t2);
}
private int twon(int x) {
int i = 1;
while (i < x) {
i *= 2;
}
return i;
}
}
static class SegmentTreeE extends SegmentTree {
public SegmentTreeE(int x) {
super(x, 0);
}
public int func(int a, int b) {
return a ^ b;
}
}
static class SegmentTreeMin extends SegmentTree {
public SegmentTreeMin(int x) {
super(x, Integer.MAX_VALUE);
}
public int func(int a, int b) {
return Math.min(a, b);
}
}
static class SegmentTreeMax extends SegmentTree {
public SegmentTreeMax(int x) {
super(x, Integer.MIN_VALUE);
}
public int func(int a, int b) {
return Math.max(a, b);
}
public int leftmax(int a) {
if (ar[0] < a) {
return -1;
}
return leftmax(a, 0);
}
private int leftmax(int a, int i) {
eval(i);
if (i >= n - 1) {
return i - n + 1;
}
int next = i * 2 + 1;
if (ar[next] < a) {
return leftmax(a, next + 1);
}
return leftmax(a, next);
}
}
static class SegmentTreeS extends SegmentTree {
public SegmentTreeS(int x) {
super(x, 0);
}
public int func(int a, int b) {
return a + b;
}
}
static class BIT {
int n;
int ar[];
public BIT(int x) {
n = x + 1;
ar = new int[n];
for (int i = 0; i < n; i++) {
ar[i] = 0;
}
}
public void update(int i, int x) {
i++;
for (int ii = i; ii < n; ii += (ii & -ii)) {
ar[ii] += x;
}
}
public int sum(int i) {
int k = 0;
for (int ii = i; ii > 0; ii -= (ii & -ii)) {
k += ar[ii];
}
return k;
}
}
static class Graph {
int n;
ArrayList<ArrayList<Edge>> g;
public Graph(int nn) {
n = nn;
g = new ArrayList<ArrayList<Edge>>();
for (int i = 0; i < n; i++) {
g.add(new ArrayList<Edge>());
}
}
public void add(int a, int b, int d) {
g.get(a).add(new Edge(b, d));
g.get(b).add(new Edge(a, d));
}
public void addY(int a, int b, int d) {
g.get(a).add(new Edge(b, d));
}
public void add(int a, int b) {
g.get(a).add(new Edge(b, 1));
g.get(b).add(new Edge(a, 1));
}
public void addY(int a, int b) {
g.get(a).add(new Edge(b, 1));
}
public int len(int a) {
return g.get(a).size();
}
public long[][] dijkstra(int s) {
long dist[][] = new long[n][2];
for (int i = 0; i < n; i++) {
dist[i][0] = Long.MAX_VALUE;
dist[i][1] = -1;
}
dist[s][0] = 0;
dist[s][1] = -1;
PriorityQueue<long[]> q = new PriorityQueue<long[]>(new Comparator<long[]>() {
public int compare(long[] x, long[] y) {
return Long.compare(x[1], y[1]);
}
});
q.add(new long[] { s, 0L });
while (q.size() > 0) {
long[] p = q.poll();
if (dist[(int) p[0]][0] != p[1]) {
continue;
}
for (Edge e : g.get((int) p[0])) {
if (dist[e.v][0] > dist[(int) p[0]][0] + e.d) {
dist[e.v][0] = dist[(int) p[0]][0] + e.d;
dist[e.v][1] = (int) p[0];
q.add(new long[] { e.v, dist[e.v][0] });
}
}
}
return dist;
}
public static long[][] floydwarshall(int g[][]) {
int n = g.length;
long dist[][] = new long[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dist[i][j] = g[i][j];
if (dist[i][j] == 0) {
dist[i][j] = Long.MAX_VALUE;
}
}
}
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (dist[i][k] == Long.MAX_VALUE || dist[k][j] == Long.MAX_VALUE) {
continue;
}
dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
return dist;
}
public void dfs(int v) {
ArrayDeque<Integer> q = new ArrayDeque<>();
boolean flg[] = new boolean[n];
q.addLast(v);
flg[v] = true;
while (q.size() > 0) {
int now = q.pollLast();
for (Edge e : g.get(now)) {
if (!flg[e.v]) {
flg[e.v] = true;
q.addLast(e.v);
}
}
}
}
public void bfs(int s) {
boolean flg[] = new boolean[n];
Queue<Integer> q = new ArrayDeque<Integer>();
q.add(s);
while (q.size() > 0) {
int v = q.poll();
flg[v] = true;
for (Edge e : g.get(v)) {
if (!flg[e.v]) {
q.add(e.v);
flg[e.v] = true;
}
}
}
}
public int minspantree() {
PriorityQueue<Edge> q = new PriorityQueue<Edge>(new Comparator<Edge>() {
public int compare(Edge a, Edge b) {
return a.d - b.d;
}
});
boolean flg[] = new boolean[n];
int c = 1, sum = 0;
for (Edge e : g.get(0)) {
q.add(e);
}
flg[0] = true;
while (c < n) {
Edge e = q.poll();
if (flg[e.v]) {
continue;
}
flg[e.v] = true;
sum += e.d;
c++;
for (Edge i : g.get(e.v)) {
if (!flg[i.v]) {
q.add(i);
}
}
}
return sum;
}
public int[] scc1_1() {
Graph g2 = new Graph(n);
for (int i = 0; i < n; i++) {
for (Edge e : g.get(i)) {
g2.addY(e.v, i);
}
}
ArrayList<Integer> list = new ArrayList<Integer>();
boolean flg[] = new boolean[n];
boolean end[] = new boolean[n];
ArrayDeque<Integer> q = new ArrayDeque<>();
for (int i = 0; i < n; i++) {
if (flg[i]) {
continue;
}
q.addLast(-i - 1);
q.addLast(i + 1);
while (q.size() > 0) {
int v = q.pollLast();
if (v < 0) {
v = -v - 1;
if (end[v]) {
continue;
}
end[v] = true;
list.add(v);
continue;
}
v--;
if (flg[v]) {
continue;
}
flg[v] = true;
for (Edge e : g.get(v)) {
if (flg[e.v]) {
continue;
}
q.addLast(-e.v - 1);
q.addLast(e.v + 1);
}
}
}
return g2.scc1_2(list);
}
public int[] scc1_2(ArrayList<Integer> list) {
boolean flg[] = new boolean[n];
int ren[] = new int[n];
ArrayDeque<Integer> q = new ArrayDeque<>();
int num = 0;
for (int i = n - 1; i >= 0; i--) {
int now = list.get(i);
if (flg[now]) {
continue;
}
q.add(now);
flg[now] = true;
while (q.size() > 0) {
int v = q.poll();
ren[v] = num;
for (Edge e : g.get(v)) {
if (flg[e.v]) {
continue;
}
flg[e.v] = true;
q.add(e.v);
}
}
num++;
}
return ren;
}
public int[] scc() {
Graph g2 = new Graph(n);
for (int i = 0; i < n; i++) {
for (Edge e : g.get(i)) {
g2.addY(e.v, i);
}
}
ArrayList<Integer> list = new ArrayList<Integer>();
boolean flg[] = new boolean[n];
for (int i = 0; i < n; i++) {
if (!flg[i]) {
dfs_scc(i, flg, list);
}
}
return g2.scc2(list);
}
public int[] scc2(ArrayList<Integer> list) {
boolean flg[] = new boolean[n];
int ren[] = new int[n];
int num = 0;
for (int i = n - 1; i >= 0; i--) {
int now = list.get(i);
if (!flg[now]) {
dfs_scc2(now, flg, ren, num);
num++;
}
}
return ren;
}
private void dfs_scc(int v, boolean flg[], ArrayList<Integer> list) {
flg[v] = true;
for (Edge e : g.get(v)) {
if (!flg[e.v]) {
dfs_scc(e.v, flg, list);
}
}
list.add(v);
}
private void dfs_scc2(int v, boolean flg[], int num[], int now) {
flg[v] = true;
num[v] = now;
for (Edge e : g.get(v)) {
if (!flg[e.v]) {
dfs_scc2(e.v, flg, num, now);
}
}
}
public ArrayList<ArrayList<Integer>> two_Edge_connected() {
int ord[] = new int[n], low[] = new int[n];
boolean flg[] = new boolean[n];
for (int i = 0; i < n; i++) {
if (!flg[i]) {
tecDfs(i, flg, ord, low, -1);
}
}
flg = new boolean[n];
ArrayList<ArrayList<Integer>> list = new ArrayList<>();
int now = 0;
for (int i = 0; i < n; i++) {
if (!flg[i]) {
list.add(new ArrayList<>());
tecDfs2(i, flg, ord, low, list.get(now));
now++;
}
}
return list;
}
public void tecDfs(int v, boolean flg[], int ord[], int low[], int before) {
flg[v] = true;
if (before != -1) {
ord[v] = ord[before] + 1;
} else {
ord[v] = 0;
}
low[v] = ord[v];
for (Edge e : g.get(v)) {
if (e.v == before) {
before = -1;
continue;
}
if (flg[e.v]) {
low[v] = Math.min(low[v], ord[e.v]);
} else {
tecDfs(e.v, flg, ord, low, v);
low[v] = Math.min(low[v], low[e.v]);
}
}
}
public void tecDfs2(int v, boolean flg[], int ord[], int low[], ArrayList<Integer> list) {
flg[v] = true;
list.add(v);
for (Edge e : g.get(v)) {
if (flg[e.v]) {
continue;
}
if (ord[v] < low[e.v] || ord[e.v] < low[v]) {
continue;
}
tecDfs2(e.v, flg, ord, low, list);
}
}
static class Edge {
int v, d;
public Edge(int v, int d) {
this.v = v;
this.d = d;
}
}
}
static class Read {
BufferedReader br;
public Read() {
br = new BufferedReader(new InputStreamReader(System.in));
}
private boolean canprint(int a) {
return 33 <= a && a <= 126;
}
private int skipread() {
int a = readC();
while (a != -1 && !canprint(a)) {
a = readC();
}
return a;
}
public char readC() {
try {
return (char) br.read();
} catch (IOException e) {
e.printStackTrace();
return (char) -1;
}
}
public String readLine() {
try {
return br.readLine();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public String readS() {
StringBuilder sb = new StringBuilder();
int k = skipread();
while (true) {
if (!canprint(k)) {
break;
}
sb.append((char) k);
k = readC();
}
return sb.toString();
}
public int readI() {
int r = 0;
int k = skipread();
int flg = 1;
if (k == '-') {
flg = -1;
k = readC();
}
while (true) {
if (!canprint(k)) {
break;
}
r = r * 10 + (k - '0');
k = readC();
}
return flg * r;
}
public long readL() {
long r = 0;
int k = skipread();
int flg = 1;
if (k == '-') {
flg = -1;
k = readC();
}
while (true) {
if (!canprint(k)) {
break;
}
r = r * 10 + (k - '0');
k = readC();
}
return flg * r;
}
public String[] readSs(int n) {
String[] a = new String[n];
for (int i = 0; i < n; i++) {
a[i] = readS();
}
return a;
}
public int[] readIs(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = readI();
}
return a;
}
public long[] readLs(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = readL();
}
return a;
}
}
static class Write {
PrintWriter out;
boolean debug;
public Write() {
out = new PrintWriter(System.out);
debug = false;
}
public <T> void pr(T str) {
out.print(str);
}
public <T> void pl(T str) {
out.println(str);
}
public void pr(int[] a) {
int t = a.length;
if (t > 0) {
pr(a[0]);
}
for (int i = 1; i < t; i++) {
pr(" " + a[i]);
}
pl("");
}
public void pr(int[][] a) {
for (int i[] : a) {
pr(i);
}
}
public void pr(long[] a) {
int t = a.length;
if (t > 0) {
pr(a[0]);
}
for (int i = 1; i < t; i++) {
pr(" " + a[i]);
}
pl("");
}
public void pr(long[][] a) {
for (long i[] : a) {
pr(i);
}
}
public void pr(String[] a) {
int t = a.length;
if (t > 0) {
pr(a[0]);
}
for (int i = 1; i < t; i++) {
pr(" " + a[i]);
}
pl("");
}
public void pr(String[][] a) {
for (String i[] : a) {
pr(i);
}
}
public void yes() {
pl("Yes");
}
public void no() {
pl("No");
}
public void yn(boolean flg) {
if (flg) {
yes();
} else {
no();
}
}
public void flush() {
out.flush();
}
public static <T> void prA(T str) {
System.out.print(str);
}
public static <T> void plA(T str) {
System.out.println(str);
}
public static void prA(int[] a) {
int t = a.length;
if (t > 0) {
prA(a[0]);
}
for (int i = 1; i < t; i++) {
prA(" " + a[i]);
}
plA("");
}
public static void prA(int[][] a) {
for (int i[] : a) {
prA(i);
}
}
public static void prA(long[] a) {
int t = a.length;
if (t > 0) {
prA(a[0]);
}
for (int i = 1; i < t; i++) {
prA(" " + a[i]);
}
plA("");
}
public static void prA(long[][] a) {
for (long i[] : a) {
prA(i);
}
}
public static void prA(String[] a) {
int t = a.length;
if (t > 0) {
prA(a[0]);
}
for (int i = 1; i < t; i++) {
prA(" " + a[i]);
}
plA("");
}
public static void prA(String[][] a) {
for (String i[] : a) {
prA(i);
}
}
public <T> void debugP(T str) {
if (debug) {
pl(str);
}
}
}
public static long stol(String s) {
return Long.parseLong(s);
}
public static int stoi(String s) {
return Integer.parseInt(s);
}
public static int[] stoi(String s[]) {
int a[] = new int[s.length];
for (int i = 0; i < s.length; i++) {
a[i] = stoi(s[i]);
}
return a;
}
public static String itos(int i) {
return String.valueOf(i);
}
public static String[] itos(int[] a) {
String s[] = new String[a.length];
for (int i = 0; i < a.length; i++) {
s[i] = itos(a[i]);
}
return s;
}
public static String ctos(char c) {
return String.valueOf(c);
}
public static String cstos(char[] c) {
return new String(c);
}
public static char stoc(String s) {
return s.charAt(0);
}
public static char stoc(String s, int i) {
return s.charAt(i);
}
public static char[] stocs(String s) {
return s.toCharArray();
}
}
| ConDefects/ConDefects/Code/abc317_e/Java/46454421 |
condefects-java_data_944 | import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Scanner;
public class Main {
private static int MOD = 998244353;
private static long Inf = (long) 1E15;
public static void main(String[] args) throws Exception {
InputStream inputStream = System.in;
//InputStream inputStream = new FileInputStream(new File("/tmp/input.txt"));
OutputStream outputStream = System.out;
Scanner in = new Scanner(inputStream);
PrintWriter out = new PrintWriter(outputStream);
//int t = in.nextInt();
int t = 1;
for (int i = 0; i < t; i++) {
Task solver = new Task();
solver.solve(in, out);
}
out.close();
}
private static long modularPow(long base, int exp, int mod) {
if (mod == 1) {
return 0L;
}
long res = 1;
base = base % mod;
while (exp > 0) {
if (exp % 2 == 1) {
res = (res * base) % mod;
}
exp = exp >> 1;
base = (base * base) % mod;
}
return res;
}
private static long inv(int a, int mod) {
return modularPow(a, mod-2, mod);
}
static class Task {
public void solve(Scanner in, PrintWriter out) {
int N = in.nextInt();
int M = in.nextInt();
int K = in.nextInt();
long[][] p = new long[K+1][N+1];
p[0][0] = 1;
long invMod = inv(M, MOD);
for (int i = 1; i <= K; i++) {
for (int r = 0; r <= N; r++) {
for (int m = 1; m <= M; m++) {
if (m <= N-r) {
p[i][r+m] += (p[i-1][r] * invMod);
p[i][r+m] %= MOD;
} else {
p[i][N - (m-N+r)] += (p[i-1][r] * invMod);
p[i][N - (m-N+r)] %= MOD;
}
}
}
}
long ans = 0;
for (int i = 1; i <= K; i++) {
ans = (ans + p[i][N]) % MOD;
}
out.println(ans);
}
}
}
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Scanner;
public class Main {
private static int MOD = 998244353;
private static long Inf = (long) 1E15;
public static void main(String[] args) throws Exception {
InputStream inputStream = System.in;
//InputStream inputStream = new FileInputStream(new File("/tmp/input.txt"));
OutputStream outputStream = System.out;
Scanner in = new Scanner(inputStream);
PrintWriter out = new PrintWriter(outputStream);
//int t = in.nextInt();
int t = 1;
for (int i = 0; i < t; i++) {
Task solver = new Task();
solver.solve(in, out);
}
out.close();
}
private static long modularPow(long base, int exp, int mod) {
if (mod == 1) {
return 0L;
}
long res = 1;
base = base % mod;
while (exp > 0) {
if (exp % 2 == 1) {
res = (res * base) % mod;
}
exp = exp >> 1;
base = (base * base) % mod;
}
return res;
}
private static long inv(int a, int mod) {
return modularPow(a, mod-2, mod);
}
static class Task {
public void solve(Scanner in, PrintWriter out) {
int N = in.nextInt();
int M = in.nextInt();
int K = in.nextInt();
long[][] p = new long[K+1][N+1];
p[0][0] = 1;
long invMod = inv(M, MOD);
for (int i = 1; i <= K; i++) {
for (int r = 0; r < N; r++) {
for (int m = 1; m <= M; m++) {
if (m <= N-r) {
p[i][r+m] += (p[i-1][r] * invMod);
p[i][r+m] %= MOD;
} else {
p[i][N - (m-N+r)] += (p[i-1][r] * invMod);
p[i][N - (m-N+r)] %= MOD;
}
}
}
}
long ans = 0;
for (int i = 1; i <= K; i++) {
ans = (ans + p[i][N]) % MOD;
}
out.println(ans);
}
}
}
| ConDefects/ConDefects/Code/abc275_e/Java/38901646 |
condefects-java_data_945 | import java.util.*;
import java.io.*;
class Main{
public static void main(String[] args) {
FastScanner str=new FastScanner(System.in);
int n=str.nextInt();
long x=str.nextLong();
String s=str.next();
Stack<Character>stack=new Stack<>();
for(int i=0;i<n;i++){
stack.push(s.charAt(i));
if(stack.size()>=2&&stack.peek()=='U'){
char u1=stack.peek();
stack.pop();
if(stack.peek()=='R'||stack.peek()=='L'){
stack.pop();
}else{
stack.push(u1);
}
}
}
int a=stack.size();
Stack<Character>stack2=new Stack<>();
for(int i=0;i<a;i++){
char key=stack.pop();
stack2.push(key);
}
int a1=stack2.size();
for(int i=0;i<a1;i++){
char key=stack2.pop();
if(x%2==0){
if(key=='U')x=x/2;
if(key=='R')x=x*2+1;
if(key=='L')x=x*2;
}else{
if(key=='U')x=x/2+1;
if(key=='R')x=x*2+1;
if(key=='L')x=x*2;
}
}
System.out.println(x);
}
}
class FastScanner implements Closeable {
private final InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
public FastScanner(InputStream in) {
this.in = in;
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
public void close() {
try {
in.close();
} catch (IOException e) {
}
}
}
import java.util.*;
import java.io.*;
class Main{
public static void main(String[] args) {
FastScanner str=new FastScanner(System.in);
int n=str.nextInt();
long x=str.nextLong();
String s=str.next();
Stack<Character>stack=new Stack<>();
for(int i=0;i<n;i++){
stack.push(s.charAt(i));
if(stack.size()>=2&&stack.peek()=='U'){
char u1=stack.peek();
stack.pop();
if(stack.peek()=='R'||stack.peek()=='L'){
stack.pop();
}else{
stack.push(u1);
}
}
}
int a=stack.size();
Stack<Character>stack2=new Stack<>();
for(int i=0;i<a;i++){
char key=stack.pop();
stack2.push(key);
}
int a1=stack2.size();
for(int i=0;i<a1;i++){
char key=stack2.pop();
if(x%2==0){
if(key=='U')x=x/2;
if(key=='R')x=x*2+1;
if(key=='L')x=x*2;
}else{
if(key=='U')x=x/2;
if(key=='R')x=x*2+1;
if(key=='L')x=x*2;
}
}
System.out.println(x);
}
}
class FastScanner implements Closeable {
private final InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
public FastScanner(InputStream in) {
this.in = in;
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
public void close() {
try {
in.close();
} catch (IOException e) {
}
}
}
| ConDefects/ConDefects/Code/abc243_d/Java/36188928 |
condefects-java_data_946 | import java.io.PrintWriter;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Collections;
import java.util.Stack;
import java.util.function.BiFunction;
import java.util.function.BinaryOperator;
import java.util.function.Predicate;
public class Main {
public static void main(String[] args) throws Exception {
ContestScanner in = new ContestScanner(System.in);
ContestPrinter out = new ContestPrinter(System.out);
Task solver = new Task();
solver.solve(in, out);
out.flush();
out.close();
}
}
class Task {
long mod = 998244353;
long powmod(long a, long b) {
long ans = 1, d = a;
while (b > 0) {
if (b % 2 == 1) ans = ans * d % mod;
b >>= 1;
d = d * d % mod;
}
return ans;
}
public void solve(ContestScanner in, ContestPrinter out) throws Exception {
int n = in.nextInt();
int m = in.nextInt();
mod = m;
long[] pow = new long[n + 1];
pow[0] = 1;
for (int i = 1; i <= n; i++) {
pow[i] = pow[i - 1] * n % mod;
}
long perm = 1;
long ans = 0;
for (int i = 1; i <= n; i++) {
ans += perm * ((long) i * (i - 1) / 2) % mod * pow[n - i] % mod;
ans %= mod;
perm = perm * (n - i) % mod;
}
out.print(ans * n % mod);
}
}
class Pair<S extends Comparable<S>, T extends Comparable<T>> implements Comparable<Pair<S,T>>{
S first;
T second;
public Pair(S s, T t){
first = s;
second = t;
}
public S getFirst(){return first;}
public T getSecond(){return second;}
public boolean equals(Object another){
if(this==another) return true;
if(!(another instanceof Pair)) return false;
Pair otherPair = (Pair)another;
return this.first.equals(otherPair.first) && this.second.equals(otherPair.second);
}
public int compareTo(Pair<S,T> another){
java.util.Comparator<Pair<S,T>> comp1 = java.util.Comparator.comparing(Pair::getFirst);
java.util.Comparator<Pair<S,T>> comp2 = comp1.thenComparing(Pair::getSecond);
return comp2.compare(this, another);
}
public int hashCode(){
return first.hashCode() * 10007 + second.hashCode();
}
public String toString(){
return String.format("(%s, %s)", first, second);
}
}
class ContestScanner {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private static final long LONG_MAX_TENTHS = 922337203685477580L;
private static final int LONG_MAX_LAST_DIGIT = 7;
private static final int LONG_MIN_LAST_DIGIT = 8;
public ContestScanner(java.io.InputStream in){
this.in = in;
}
public ContestScanner(java.io.File file) throws java.io.FileNotFoundException {
this(new java.io.BufferedInputStream(new java.io.FileInputStream(file)));
}
public ContestScanner(){
this(System.in);
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (java.io.IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++]; else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new java.util.NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new java.util.NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
int digit = b - '0';
if (n >= LONG_MAX_TENTHS) {
if (n == LONG_MAX_TENTHS) {
if (minus) {
if (digit <= LONG_MIN_LAST_DIGIT) {
n = -n * 10 - digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
} else {
if (digit <= LONG_MAX_LAST_DIGIT) {
n = n * 10 + digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
}
}
throw new ArithmeticException(
String.format("%s%d%d... overflows long.", minus ? "-" : "", n, digit)
);
}
n = n * 10 + digit;
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public long[] nextLongArray(int length){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = this.nextLong();
return array;
}
public long[] nextLongArray(int length, java.util.function.LongUnaryOperator map){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = map.applyAsLong(this.nextLong());
return array;
}
public int[] nextIntArray(int length){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = this.nextInt();
return array;
}
public int[] nextIntArray(int length, java.util.function.IntUnaryOperator map){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = map.applyAsInt(this.nextInt());
return array;
}
public double[] nextDoubleArray(int length){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = this.nextDouble();
return array;
}
public double[] nextDoubleArray(int length, java.util.function.DoubleUnaryOperator map){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = map.applyAsDouble(this.nextDouble());
return array;
}
public long[][] nextLongMatrix(int height, int width){
long[][] mat = new long[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextLong();
}
return mat;
}
public int[][] nextIntMatrix(int height, int width){
int[][] mat = new int[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextInt();
}
return mat;
}
public double[][] nextDoubleMatrix(int height, int width){
double[][] mat = new double[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextDouble();
}
return mat;
}
public char[][] nextCharMatrix(int height, int width){
char[][] mat = new char[height][width];
for(int h=0; h<height; h++){
String s = this.next();
for(int w=0; w<width; w++){
mat[h][w] = s.charAt(w);
}
}
return mat;
}
}
class ContestPrinter extends java.io.PrintWriter {
public ContestPrinter(java.io.PrintStream stream) {
super(stream);
}
public ContestPrinter(java.io.File file) throws java.io.FileNotFoundException {
super(new java.io.PrintStream(file));
}
public ContestPrinter() {
super(System.out);
}
private static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if (x < 0) {
sb.append('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
sb.append((long) x);
sb.append(".");
x -= (long) x;
for (int i = 0; i < n; i++) {
x *= 10;
sb.append((int) x);
x -= (int) x;
}
return sb.toString();
}
@Override
public void print(float f) {
super.print(dtos(f, 20));
}
@Override
public void println(float f) {
super.println(dtos(f, 20));
}
@Override
public void print(double d) {
super.print(dtos(d, 20));
}
@Override
public void println(double d) {
super.println(dtos(d, 20));
}
public void printArray(int[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public void printArray(int[] array){
this.printArray(array, " ");
}
public void printArray(int[] array, String separator, java.util.function.IntUnaryOperator map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.applyAsInt(array[i]));
super.print(separator);
}
super.println(map.applyAsInt(array[n-1]));
}
public void printArray(int[] array, java.util.function.IntUnaryOperator map){
this.printArray(array, " ", map);
}
public void printArray(long[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public void printArray(long[] array){
this.printArray(array, " ");
}
public void printArray(long[] array, String separator, java.util.function.LongUnaryOperator map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.applyAsLong(array[i]));
super.print(separator);
}
super.println(map.applyAsLong(array[n-1]));
}
public void printArray(long[] array, java.util.function.LongUnaryOperator map){
this.printArray(array, " ", map);
}
public <T> void printArray(T[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public <T> void printArray(T[] array){
this.printArray(array, " ");
}
public <T> void printArray(T[] array, String separator, java.util.function.UnaryOperator<T> map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.apply(array[i]));
super.print(separator);
}
super.println(map.apply(array[n-1]));
}
public <T> void printArray(T[] array, java.util.function.UnaryOperator<T> map){
this.printArray(array, " ", map);
}
}
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Collections;
import java.util.Stack;
import java.util.function.BiFunction;
import java.util.function.BinaryOperator;
import java.util.function.Predicate;
public class Main {
public static void main(String[] args) throws Exception {
ContestScanner in = new ContestScanner(System.in);
ContestPrinter out = new ContestPrinter(System.out);
Task solver = new Task();
solver.solve(in, out);
out.flush();
out.close();
}
}
class Task {
long mod = 998244353;
long powmod(long a, long b) {
long ans = 1, d = a;
while (b > 0) {
if (b % 2 == 1) ans = ans * d % mod;
b >>= 1;
d = d * d % mod;
}
return ans;
}
public void solve(ContestScanner in, ContestPrinter out) throws Exception {
int n = in.nextInt();
int m = in.nextInt();
mod = m;
long[] pow = new long[n + 1];
pow[0] = 1;
for (int i = 1; i <= n; i++) {
pow[i] = pow[i - 1] * n % mod;
}
long perm = 1;
long ans = 0;
for (int i = 1; i <= n; i++) {
ans += perm * ((long) i * (i - 1) / 2 % mod) % mod * pow[n - i] % mod;
ans %= mod;
perm = perm * (n - i) % mod;
}
out.print(ans * n % mod);
}
}
class Pair<S extends Comparable<S>, T extends Comparable<T>> implements Comparable<Pair<S,T>>{
S first;
T second;
public Pair(S s, T t){
first = s;
second = t;
}
public S getFirst(){return first;}
public T getSecond(){return second;}
public boolean equals(Object another){
if(this==another) return true;
if(!(another instanceof Pair)) return false;
Pair otherPair = (Pair)another;
return this.first.equals(otherPair.first) && this.second.equals(otherPair.second);
}
public int compareTo(Pair<S,T> another){
java.util.Comparator<Pair<S,T>> comp1 = java.util.Comparator.comparing(Pair::getFirst);
java.util.Comparator<Pair<S,T>> comp2 = comp1.thenComparing(Pair::getSecond);
return comp2.compare(this, another);
}
public int hashCode(){
return first.hashCode() * 10007 + second.hashCode();
}
public String toString(){
return String.format("(%s, %s)", first, second);
}
}
class ContestScanner {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private static final long LONG_MAX_TENTHS = 922337203685477580L;
private static final int LONG_MAX_LAST_DIGIT = 7;
private static final int LONG_MIN_LAST_DIGIT = 8;
public ContestScanner(java.io.InputStream in){
this.in = in;
}
public ContestScanner(java.io.File file) throws java.io.FileNotFoundException {
this(new java.io.BufferedInputStream(new java.io.FileInputStream(file)));
}
public ContestScanner(){
this(System.in);
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (java.io.IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++]; else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new java.util.NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new java.util.NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
int digit = b - '0';
if (n >= LONG_MAX_TENTHS) {
if (n == LONG_MAX_TENTHS) {
if (minus) {
if (digit <= LONG_MIN_LAST_DIGIT) {
n = -n * 10 - digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
} else {
if (digit <= LONG_MAX_LAST_DIGIT) {
n = n * 10 + digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
}
}
throw new ArithmeticException(
String.format("%s%d%d... overflows long.", minus ? "-" : "", n, digit)
);
}
n = n * 10 + digit;
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public long[] nextLongArray(int length){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = this.nextLong();
return array;
}
public long[] nextLongArray(int length, java.util.function.LongUnaryOperator map){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = map.applyAsLong(this.nextLong());
return array;
}
public int[] nextIntArray(int length){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = this.nextInt();
return array;
}
public int[] nextIntArray(int length, java.util.function.IntUnaryOperator map){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = map.applyAsInt(this.nextInt());
return array;
}
public double[] nextDoubleArray(int length){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = this.nextDouble();
return array;
}
public double[] nextDoubleArray(int length, java.util.function.DoubleUnaryOperator map){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = map.applyAsDouble(this.nextDouble());
return array;
}
public long[][] nextLongMatrix(int height, int width){
long[][] mat = new long[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextLong();
}
return mat;
}
public int[][] nextIntMatrix(int height, int width){
int[][] mat = new int[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextInt();
}
return mat;
}
public double[][] nextDoubleMatrix(int height, int width){
double[][] mat = new double[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextDouble();
}
return mat;
}
public char[][] nextCharMatrix(int height, int width){
char[][] mat = new char[height][width];
for(int h=0; h<height; h++){
String s = this.next();
for(int w=0; w<width; w++){
mat[h][w] = s.charAt(w);
}
}
return mat;
}
}
class ContestPrinter extends java.io.PrintWriter {
public ContestPrinter(java.io.PrintStream stream) {
super(stream);
}
public ContestPrinter(java.io.File file) throws java.io.FileNotFoundException {
super(new java.io.PrintStream(file));
}
public ContestPrinter() {
super(System.out);
}
private static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if (x < 0) {
sb.append('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
sb.append((long) x);
sb.append(".");
x -= (long) x;
for (int i = 0; i < n; i++) {
x *= 10;
sb.append((int) x);
x -= (int) x;
}
return sb.toString();
}
@Override
public void print(float f) {
super.print(dtos(f, 20));
}
@Override
public void println(float f) {
super.println(dtos(f, 20));
}
@Override
public void print(double d) {
super.print(dtos(d, 20));
}
@Override
public void println(double d) {
super.println(dtos(d, 20));
}
public void printArray(int[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public void printArray(int[] array){
this.printArray(array, " ");
}
public void printArray(int[] array, String separator, java.util.function.IntUnaryOperator map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.applyAsInt(array[i]));
super.print(separator);
}
super.println(map.applyAsInt(array[n-1]));
}
public void printArray(int[] array, java.util.function.IntUnaryOperator map){
this.printArray(array, " ", map);
}
public void printArray(long[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public void printArray(long[] array){
this.printArray(array, " ");
}
public void printArray(long[] array, String separator, java.util.function.LongUnaryOperator map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.applyAsLong(array[i]));
super.print(separator);
}
super.println(map.applyAsLong(array[n-1]));
}
public void printArray(long[] array, java.util.function.LongUnaryOperator map){
this.printArray(array, " ", map);
}
public <T> void printArray(T[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public <T> void printArray(T[] array){
this.printArray(array, " ");
}
public <T> void printArray(T[] array, String separator, java.util.function.UnaryOperator<T> map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.apply(array[i]));
super.print(separator);
}
super.println(map.apply(array[n-1]));
}
public <T> void printArray(T[] array, java.util.function.UnaryOperator<T> map){
this.printArray(array, " ", map);
}
}
| ConDefects/ConDefects/Code/abc284_g/Java/37916081 |
condefects-java_data_947 | import java.util.*;
public class Main {
public Scanner sc = new Scanner(System.in);
public int N;
public int T;
Map<Integer, Integer> rowCntMp = new HashMap<>();
Map<Integer, Integer> columnCntMp = new HashMap<>();
int leftDiagonalCnt = 0;
int rightDiagonalCnt = 0;
void init() {
N = sc.nextInt();
T = sc.nextInt();
for (int i = 0; i < T; i++) {
int t = sc.nextInt();
int I = geti(t);
int J = getj(t);
// System.out.printf("I = %d, J = %d\n", I, J);
if (!rowCntMp.containsKey(I)) {
rowCntMp.put(I, 0);
}
if (!columnCntMp.containsKey(J)) {
columnCntMp.put(J, 0);
}
rowCntMp.put(I, rowCntMp.get(I) + 1);
if (rowCntMp.get(I).equals(N)) {
System.out.println(i + 1);
return;
}
columnCntMp.put(J, columnCntMp.get(J) + 1);
if (columnCntMp.get(J).equals(N)) {
System.out.println(i + 1);
return;
}
if (I == J) {
leftDiagonalCnt += 1;
if (leftDiagonalCnt == N) {
System.out.println(i + 1);
return;
}
}
if (I + J == N) {
rightDiagonalCnt += 1;
if (rightDiagonalCnt == N) {
System.out.println(i + 1);
return;
}
}
}
System.out.println(-1);
}
int geti(int num) {
return (num - 1) / N + 1;
}
int getj(int num) {
return (num - 1) % N + 1;
}
public static void main(String[] args) {
Main obj = new Main();
obj.init();
}
}
import java.util.*;
public class Main {
public Scanner sc = new Scanner(System.in);
public int N;
public int T;
Map<Integer, Integer> rowCntMp = new HashMap<>();
Map<Integer, Integer> columnCntMp = new HashMap<>();
int leftDiagonalCnt = 0;
int rightDiagonalCnt = 0;
void init() {
N = sc.nextInt();
T = sc.nextInt();
for (int i = 0; i < T; i++) {
int t = sc.nextInt();
int I = geti(t);
int J = getj(t);
// System.out.printf("I = %d, J = %d\n", I, J);
if (!rowCntMp.containsKey(I)) {
rowCntMp.put(I, 0);
}
if (!columnCntMp.containsKey(J)) {
columnCntMp.put(J, 0);
}
rowCntMp.put(I, rowCntMp.get(I) + 1);
if (rowCntMp.get(I).equals(N)) {
System.out.println(i + 1);
return;
}
columnCntMp.put(J, columnCntMp.get(J) + 1);
if (columnCntMp.get(J).equals(N)) {
System.out.println(i + 1);
return;
}
if (I == J) {
leftDiagonalCnt += 1;
if (leftDiagonalCnt == N) {
System.out.println(i + 1);
return;
}
}
if (I + J == N + 1) {
rightDiagonalCnt += 1;
if (rightDiagonalCnt == N) {
System.out.println(i + 1);
return;
}
}
}
System.out.println(-1);
}
int geti(int num) {
return (num - 1) / N + 1;
}
int getj(int num) {
return (num - 1) % N + 1;
}
public static void main(String[] args) {
Main obj = new Main();
obj.init();
}
}
| ConDefects/ConDefects/Code/abc355_c/Java/54148910 |
condefects-java_data_948 | import java.util.Scanner;
public class Main{
public static void main(String[] args){
var sc = new Scanner(System.in);
int n = sc.nextInt();
int t = sc.nextInt();
if(n > t){
System.out.println(-1);
sc.close();
System.exit(0);
}
var hori = new int[n];
var vert = new int[n];
int slash = 0;
int backs = 0;
for(int x = 1;x <= t; x++){
int m = sc.nextInt();
hori[(m - 1) / n]++;
vert[(m - 1) % n]++;
if(m % (n + 1) == 1)
backs++;
if(m != 1 && m % (n - 1) == 1 && m / n != n)
slash++;
if(x < n)
continue;
if(hori[(m - 1) / n] == n || vert[(m - 1) % n] == n ||slash == n || backs == n){
System.out.println(x);
System.exit(0);
}
}
System.out.println(-1);
}
}
import java.util.Scanner;
public class Main{
public static void main(String[] args){
var sc = new Scanner(System.in);
int n = sc.nextInt();
int t = sc.nextInt();
if(n > t){
System.out.println(-1);
sc.close();
System.exit(0);
}
var hori = new int[n];
var vert = new int[n];
int slash = 0;
int backs = 0;
for(int x = 1;x <= t; x++){
int m = sc.nextInt();
hori[(m - 1) / n]++;
vert[(m - 1) % n]++;
if(m % (n + 1) == 1)
backs++;
if((n != 2 && (m != 1 && m % (n - 1) == 1 && m / n != n)) || (n == 2 && (m == 2 || m == 3)))
slash++;
if(x < n)
continue;
if(hori[(m - 1) / n] == n || vert[(m - 1) % n] == n ||slash == n || backs == n){
System.out.println(x);
System.exit(0);
}
}
System.out.println(-1);
}
} | ConDefects/ConDefects/Code/abc355_c/Java/54458125 |
condefects-java_data_949 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int t = sc.nextInt();
int[] row = new int[n];
int[] col = new int[n];
int left = 0, right = 0;
for(int i = 0; i < t; i++){
int a = sc.nextInt();
int arow = (a-1) / n;
int acol = (a-1) % n;
row[arow]++;
col[acol]++;
if(arow == acol){
left++;
}
if(arow == n - acol){
right++;
}
if(row[arow] == n || col[acol] == n || left == n || right == n){
System.out.println(i+1);
return ;
}
}
System.out.println(-1);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int t = sc.nextInt();
int[] row = new int[n];
int[] col = new int[n];
int left = 0, right = 0;
for(int i = 0; i < t; i++){
int a = sc.nextInt();
int arow = (a-1) / n;
int acol = (a-1) % n;
row[arow]++;
col[acol]++;
if(arow == acol){
left++;
}
if(arow == n - acol - 1){
right++;
}
if(row[arow] == n || col[acol] == n || left == n || right == n){
System.out.println(i+1);
return ;
}
}
System.out.println(-1);
}
} | ConDefects/ConDefects/Code/abc355_c/Java/54497882 |
condefects-java_data_950 | import java.util.HashSet;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int T = scanner.nextInt();
int sum=0;
boolean v = false;
int columncount[]=new int [N];
int rowcount[]=new int [N];
for(int i=0;i<N;i++) {
columncount[i]=0;
rowcount[i]=0;
}
int diagnolcount[]=new int [2];
diagnolcount[0]=0;
diagnolcount[1]=1;
HashSet<Integer> Bingo = new HashSet<>();
for(int i=0;i<T;i++) {
int num = scanner.nextInt()-1;
sum+=1;
if(!Bingo.contains(num)) {
Bingo.add(num);
rowcount[num/N]++;
if(rowcount[num/N]==N) {
v =true;
//System.out.println("a");
break;
}
columncount[num%N]++;
if(columncount[num%N]==N) {
v =true;
//System.out.println("b");
break;
}
if(num/N==num%N) {
diagnolcount[0]++;
if( diagnolcount[0]==N) {
v =true;
//System.out.println("c");
break;
}
}
if(N-1-num/N==num%N) {
diagnolcount[1]++;
if( diagnolcount[1]==N) {
v =true;
//System.out.println("d");
break;
}
}
}
}
if(v) {
System.out.println(sum);
}else {
System.out.println(-1);
}
scanner.close();
}
}
import java.util.HashSet;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int T = scanner.nextInt();
int sum=0;
boolean v = false;
int columncount[]=new int [N];
int rowcount[]=new int [N];
for(int i=0;i<N;i++) {
columncount[i]=0;
rowcount[i]=0;
}
int diagnolcount[]=new int [2];
diagnolcount[0]=0;
diagnolcount[1]=0;
HashSet<Integer> Bingo = new HashSet<>();
for(int i=0;i<T;i++) {
int num = scanner.nextInt()-1;
sum+=1;
if(!Bingo.contains(num)) {
Bingo.add(num);
rowcount[num/N]++;
if(rowcount[num/N]==N) {
v =true;
//System.out.println("a");
break;
}
columncount[num%N]++;
if(columncount[num%N]==N) {
v =true;
//System.out.println("b");
break;
}
if(num/N==num%N) {
diagnolcount[0]++;
if( diagnolcount[0]==N) {
v =true;
//System.out.println("c");
break;
}
}
if(N-1-num/N==num%N) {
diagnolcount[1]++;
if( diagnolcount[1]==N) {
v =true;
//System.out.println("d");
break;
}
}
}
}
if(v) {
System.out.println(sum);
}else {
System.out.println(-1);
}
scanner.close();
}
}
| ConDefects/ConDefects/Code/abc355_c/Java/54772121 |
condefects-java_data_951 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int t = scan.nextInt();
int[] numbers = new int[t];
for (int i = 0; i < t; i++) {
numbers[i] = scan.nextInt();
}
scan.close();
int[] cols = new int[n];
int[] rows = new int[n];
int[] diag = new int[2];
for (int i = 0; i < t; i++) {
int num = numbers[i] - 1;
cols[num % n]++;
rows[num / n]++;
if (num % (n + 1) == 0) {
diag[0]++;
}
if (num % (n - 1) == 0 && num != n * n - 1) {
diag[1]++;
}
if (i >= n - 1) {
if (diag[0] == n || diag[1] == n) {
System.out.println(i + 1);
return;
}
for (int j = 0; j < n; j++) {
if (cols[j] == n || rows[j] == n) {
System.out.println(i + 1);
return;
}
}
}
}
System.out.println(-1);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int t = scan.nextInt();
int[] numbers = new int[t];
for (int i = 0; i < t; i++) {
numbers[i] = scan.nextInt();
}
scan.close();
int[] cols = new int[n];
int[] rows = new int[n];
int[] diag = new int[2];
for (int i = 0; i < t; i++) {
int num = numbers[i] - 1;
cols[num % n]++;
rows[num / n]++;
if (num % (n + 1) == 0) {
diag[0]++;
}
if (num % (n - 1) == 0 && num != 0 && num != n * n - 1) {
diag[1]++;
}
if (i >= n - 1) {
if (diag[0] == n || diag[1] == n) {
System.out.println(i + 1);
return;
}
for (int j = 0; j < n; j++) {
if (cols[j] == n || rows[j] == n) {
System.out.println(i + 1);
return;
}
}
}
}
System.out.println(-1);
}
}
| ConDefects/ConDefects/Code/abc355_c/Java/54750119 |
condefects-java_data_952 | import java.io.InputStream;
import java.util.*;
public class Main {
public static void main(String[] args) {
InputStream source = System.in;
Scanner sc = new Scanner(source);
int N = sc.nextInt();
int T = sc.nextInt();
int [] yoko = new int[N];
int [] tate = new int[N];
int naname_左上から右下 = 0;
int naname_右上から左下 = 0;
int[][] grid = new int[N][N];
int count = 1;
for (int i=0; i<N; i++) {
for (int j=0; j<N; j++) {
grid[i][j] = count;
yoko[i] += count;
tate[j] += count;
if (i==j) {
naname_左上から右下 += count;
}
count++;
}
}
naname_右上から左下 = naname_左上から右下;
for (int i=0; i<T; i++) {
int t = sc.nextInt();
int x = (t-1) % N;
int y = (t-1) / N;
yoko[y] -= t;
tate[x] -= t;
if (x == y) {
naname_左上から右下 -= t;
}
if (x+y == N+1) {
naname_右上から左下 -= t;
}
for (int j=0; j<N; j++) {
if (yoko[j] == 0) {
System.out.println(i+1);
return;
}
if (tate[j] == 0) {
System.out.println(i+1);
return;
}
if (naname_左上から右下 == 0) {
System.out.println(i+1);
return;
}
if (naname_右上から左下 == 0) {
System.out.println(i+1);
return;
}
}
}
System.out.println("-1");
}
}
import java.io.InputStream;
import java.util.*;
public class Main {
public static void main(String[] args) {
InputStream source = System.in;
Scanner sc = new Scanner(source);
int N = sc.nextInt();
int T = sc.nextInt();
int [] yoko = new int[N];
int [] tate = new int[N];
int naname_左上から右下 = 0;
int naname_右上から左下 = 0;
int[][] grid = new int[N][N];
int count = 1;
for (int i=0; i<N; i++) {
for (int j=0; j<N; j++) {
grid[i][j] = count;
yoko[i] += count;
tate[j] += count;
if (i==j) {
naname_左上から右下 += count;
}
count++;
}
}
naname_右上から左下 = naname_左上から右下;
for (int i=0; i<T; i++) {
int t = sc.nextInt();
int x = (t-1) % N;
int y = (t-1) / N;
yoko[y] -= t;
tate[x] -= t;
if (x == y) {
naname_左上から右下 -= t;
}
if (x+y == N-1) {
naname_右上から左下 -= t;
}
for (int j=0; j<N; j++) {
if (yoko[j] == 0) {
System.out.println(i+1);
return;
}
if (tate[j] == 0) {
System.out.println(i+1);
return;
}
if (naname_左上から右下 == 0) {
System.out.println(i+1);
return;
}
if (naname_右上から左下 == 0) {
System.out.println(i+1);
return;
}
}
}
System.out.println("-1");
}
}
| ConDefects/ConDefects/Code/abc355_c/Java/54784722 |
condefects-java_data_953 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner input = new Scanner(System.in);
int a = input.nextInt() - 1;
int b = input.nextInt() - 1;
int [][] A = new int[2][2];
for(int i = 0; i < 2; i++) {
for(int j = 0; j < 2; j++) {
A[i][j] = input.nextInt();
}
System.out.println(A[a][b]);
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner input = new Scanner(System.in);
int a = input.nextInt() - 1;
int b = input.nextInt() - 1;
int [][] A = new int[2][2];
for(int i = 0; i < 2; i++) {
for(int j = 0; j < 2; j++) {
A[i][j] = input.nextInt();
}
}
System.out.println(A[a][b]);
}
}
| ConDefects/ConDefects/Code/abc255_a/Java/40809724 |
condefects-java_data_954 | //Utilities
import java.io.*;
import java.util.*;
public class Main {
static int n, m, res;
static char[][] ch; static int[][] rowcnt, colcnt; static int[] rowsz, colsz;
public static void main(String[] args) throws IOException {
n = in.iscan(); m = in.iscan(); ch = new char[n][m]; rowsz = new int[n]; colsz = new int[m];
rowcnt = new int[n][26]; colcnt = new int[m][26];
for (int i = 0; i < n; i++) {
ch[i] = in.sscan().toCharArray(); rowsz[i] = m;
for (int j = 0; j < m; j++) rowcnt[i][ch[i][j]-'a']++;
}
for (int j = 0; j < m; j++) {
colsz[j] = n;
for (int i = 0; i < n; i++) colcnt[j][ch[i][j]-'a']++;
}
boolean[] clear_row = new boolean[n], clear_col = new boolean[m];
while (true) {
boolean found = false;
ArrayList<Integer> rowrmv = new ArrayList<Integer>();
ArrayList<Integer> colrmv = new ArrayList<Integer>();
for (int i = 0; i < n; i++) {
if (clear_row[i]) continue;
for (int cc = 0; cc < 26; cc++) {
if (rowcnt[i][cc] > 1 && rowcnt[i][cc] == rowsz[i]) {
clear_row[i] = true; rowrmv.add(cc); found = true;
break;
}
}
}
for (int j = 0; j < m; j++) {
if (clear_col[j]) continue;
for (int cc = 0; cc < 26; cc++) {
if (colcnt[j][cc] > 1 && colcnt[j][cc] == colsz[j]) {
clear_col[j] = true; colrmv.add(cc); found = true;
break;
}
}
}
if (!found) break;
for (int i = 0; i < n; i++) {
if (clear_row[i]) continue;
rowsz[i] -= colrmv.size();
for (int cc : colrmv) rowcnt[i][cc]--;
}
for (int j = 0; j < m; j++) {
if (clear_col[j]) continue;
colsz[j] -= rowrmv.size();
for (int cc : colrmv) colcnt[j][cc]--;
}
}
res = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (!clear_row[i] && !clear_col[j]) res++;
}
}
out.println(res);
out.close();
}
static INPUT in = new INPUT(System.in);
static PrintWriter out = new PrintWriter(System.out);
private static class INPUT {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar, numChars;
public INPUT (InputStream stream) {
this.stream = stream;
}
public INPUT (String file) throws IOException {
this.stream = new FileInputStream (file);
}
public int cscan () throws IOException {
if (curChar >= numChars) {
curChar = 0;
numChars = stream.read (buf);
}
if (numChars == -1)
return numChars;
return buf[curChar++];
}
public int iscan () throws IOException {
int c = cscan (), sgn = 1;
while (space (c))
c = cscan ();
if (c == '-') {
sgn = -1;
c = cscan ();
}
int res = 0;
do {
res = (res << 1) + (res << 3);
res += c - '0';
c = cscan ();
}
while (!space (c));
return res * sgn;
}
public String sscan () throws IOException {
int c = cscan ();
while (space (c))
c = cscan ();
StringBuilder res = new StringBuilder ();
do {
res.appendCodePoint (c);
c = cscan ();
}
while (!space (c));
return res.toString ();
}
public double dscan () throws IOException {
int c = cscan (), sgn = 1;
while (space (c))
c = cscan ();
if (c == '-') {
sgn = -1;
c = cscan ();
}
double res = 0;
while (!space (c) && c != '.') {
if (c == 'e' || c == 'E')
return res * UTILITIES.fast_pow (10, iscan ());
res *= 10;
res += c - '0';
c = cscan ();
}
if (c == '.') {
c = cscan ();
double m = 1;
while (!space (c)) {
if (c == 'e' || c == 'E')
return res * UTILITIES.fast_pow (10, iscan ());
m /= 10;
res += (c - '0') * m;
c = cscan ();
}
}
return res * sgn;
}
public long lscan () throws IOException {
int c = cscan (), sgn = 1;
while (space (c))
c = cscan ();
if (c == '-') {
sgn = -1;
c = cscan ();
}
long res = 0;
do {
res = (res << 1) + (res << 3);
res += c - '0';
c = cscan ();
}
while (!space (c));
return res * sgn;
}
public boolean space (int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
}
public static class UTILITIES {
static final double EPS = 10e-6;
public static void sort(int[] a, boolean increasing) {
ArrayList<Integer> arr = new ArrayList<Integer>();
int n = a.length;
for (int i = 0; i < n; i++) {
arr.add(a[i]);
}
Collections.sort(arr);
for (int i = 0; i < n; i++) {
if (increasing) {
a[i] = arr.get(i);
}
else {
a[i] = arr.get(n-1-i);
}
}
}
public static void sort(long[] a, boolean increasing) {
ArrayList<Long> arr = new ArrayList<Long>();
int n = a.length;
for (int i = 0; i < n; i++) {
arr.add(a[i]);
}
Collections.sort(arr);
for (int i = 0; i < n; i++) {
if (increasing) {
a[i] = arr.get(i);
}
else {
a[i] = arr.get(n-1-i);
}
}
}
public static void sort(double[] a, boolean increasing) {
ArrayList<Double> arr = new ArrayList<Double>();
int n = a.length;
for (int i = 0; i < n; i++) {
arr.add(a[i]);
}
Collections.sort(arr);
for (int i = 0; i < n; i++) {
if (increasing) {
a[i] = arr.get(i);
}
else {
a[i] = arr.get(n-1-i);
}
}
}
public static int lower_bound (int[] arr, int x) {
int low = 0, high = arr.length, mid = -1;
while (low < high) {
mid = (low + high) / 2;
if (arr[mid] >= x)
high = mid;
else
low = mid + 1;
}
return low;
}
public static int upper_bound (int[] arr, int x) {
int low = 0, high = arr.length, mid = -1;
while (low < high) {
mid = (low + high) / 2;
if (arr[mid] > x)
high = mid;
else
low = mid + 1;
}
return low;
}
public static void updateMap(HashMap<Integer, Integer> map, int key, int v) {
if (!map.containsKey(key)) {
map.put(key, v);
}
else {
map.put(key, map.get(key) + v);
}
if (map.get(key) == 0) {
map.remove(key);
}
}
public static long gcd (long a, long b) {
return b == 0 ? a : gcd (b, a % b);
}
public static long lcm (long a, long b) {
return a * b / gcd (a, b);
}
public static long fast_pow_mod (long b, long x, int mod) {
if (x == 0) return 1;
if (x == 1) return b % mod;
if (x % 2 == 0) return fast_pow_mod (b * b % mod, x / 2, mod) % mod;
return b * fast_pow_mod (b * b % mod, x / 2, mod) % mod;
}
public static long fast_pow (long b, long x) {
if (x == 0) return 1;
if (x == 1) return b;
if (x % 2 == 0) return fast_pow (b * b, x / 2);
return b * fast_pow (b * b, x / 2);
}
public static long choose (long n, long k) {
if (k > n || k < 0) {
return 0;
}
k = Math.min (k, n - k);
long val = 1;
for (int i = 0; i < k; ++i)
val = val * (n - i) / (i + 1);
return val;
}
public static long permute (int n, int k) {
if (n < k) return 0;
long val = 1;
for (int i = 0; i < k; ++i)
val = (val * (n - i));
return val;
}
// start of permutation and lower/upper bound template
public static void nextPermutation(int[] nums) {
//find first decreasing digit
int mark = -1;
for (int i = nums.length - 1; i > 0; i--) {
if (nums[i] > nums[i - 1]) {
mark = i - 1;
break;
}
}
if (mark == -1) {
reverse(nums, 0, nums.length - 1);
return;
}
int idx = nums.length-1;
for (int i = nums.length-1; i >= mark+1; i--) {
if (nums[i] > nums[mark]) {
idx = i;
break;
}
}
swap(nums, mark, idx);
reverse(nums, mark + 1, nums.length - 1);
}
public static void swap(int[] nums, int i, int j) {
int t = nums[i];
nums[i] = nums[j];
nums[j] = t;
}
public static void reverse(int[] nums, int i, int j) {
while (i < j) {
swap(nums, i, j);
i++;
j--;
}
}
static int lower_bound (int[] arr, int hi, int cmp) {
int low = 0, high = hi, mid = -1;
while (low < high) {
mid = (low + high) / 2;
if (arr[mid] >= cmp) high = mid;
else low = mid + 1;
}
return low;
}
static int upper_bound (int[] arr, int hi, int cmp) {
int low = 0, high = hi, mid = -1;
while (low < high) {
mid = (low + high) / 2;
if (arr[mid] > cmp) high = mid;
else low = mid + 1;
}
return low;
}
// end of permutation and lower/upper bound template
}
}
//Utilities
import java.io.*;
import java.util.*;
public class Main {
static int n, m, res;
static char[][] ch; static int[][] rowcnt, colcnt; static int[] rowsz, colsz;
public static void main(String[] args) throws IOException {
n = in.iscan(); m = in.iscan(); ch = new char[n][m]; rowsz = new int[n]; colsz = new int[m];
rowcnt = new int[n][26]; colcnt = new int[m][26];
for (int i = 0; i < n; i++) {
ch[i] = in.sscan().toCharArray(); rowsz[i] = m;
for (int j = 0; j < m; j++) rowcnt[i][ch[i][j]-'a']++;
}
for (int j = 0; j < m; j++) {
colsz[j] = n;
for (int i = 0; i < n; i++) colcnt[j][ch[i][j]-'a']++;
}
boolean[] clear_row = new boolean[n], clear_col = new boolean[m];
while (true) {
boolean found = false;
ArrayList<Integer> rowrmv = new ArrayList<Integer>();
ArrayList<Integer> colrmv = new ArrayList<Integer>();
for (int i = 0; i < n; i++) {
if (clear_row[i]) continue;
for (int cc = 0; cc < 26; cc++) {
if (rowcnt[i][cc] > 1 && rowcnt[i][cc] == rowsz[i]) {
clear_row[i] = true; rowrmv.add(cc); found = true;
break;
}
}
}
for (int j = 0; j < m; j++) {
if (clear_col[j]) continue;
for (int cc = 0; cc < 26; cc++) {
if (colcnt[j][cc] > 1 && colcnt[j][cc] == colsz[j]) {
clear_col[j] = true; colrmv.add(cc); found = true;
break;
}
}
}
if (!found) break;
for (int i = 0; i < n; i++) {
if (clear_row[i]) continue;
rowsz[i] -= colrmv.size();
for (int cc : colrmv) rowcnt[i][cc]--;
}
for (int j = 0; j < m; j++) {
if (clear_col[j]) continue;
colsz[j] -= rowrmv.size();
for (int cc : rowrmv) colcnt[j][cc]--;
}
}
res = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (!clear_row[i] && !clear_col[j]) res++;
}
}
out.println(res);
out.close();
}
static INPUT in = new INPUT(System.in);
static PrintWriter out = new PrintWriter(System.out);
private static class INPUT {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar, numChars;
public INPUT (InputStream stream) {
this.stream = stream;
}
public INPUT (String file) throws IOException {
this.stream = new FileInputStream (file);
}
public int cscan () throws IOException {
if (curChar >= numChars) {
curChar = 0;
numChars = stream.read (buf);
}
if (numChars == -1)
return numChars;
return buf[curChar++];
}
public int iscan () throws IOException {
int c = cscan (), sgn = 1;
while (space (c))
c = cscan ();
if (c == '-') {
sgn = -1;
c = cscan ();
}
int res = 0;
do {
res = (res << 1) + (res << 3);
res += c - '0';
c = cscan ();
}
while (!space (c));
return res * sgn;
}
public String sscan () throws IOException {
int c = cscan ();
while (space (c))
c = cscan ();
StringBuilder res = new StringBuilder ();
do {
res.appendCodePoint (c);
c = cscan ();
}
while (!space (c));
return res.toString ();
}
public double dscan () throws IOException {
int c = cscan (), sgn = 1;
while (space (c))
c = cscan ();
if (c == '-') {
sgn = -1;
c = cscan ();
}
double res = 0;
while (!space (c) && c != '.') {
if (c == 'e' || c == 'E')
return res * UTILITIES.fast_pow (10, iscan ());
res *= 10;
res += c - '0';
c = cscan ();
}
if (c == '.') {
c = cscan ();
double m = 1;
while (!space (c)) {
if (c == 'e' || c == 'E')
return res * UTILITIES.fast_pow (10, iscan ());
m /= 10;
res += (c - '0') * m;
c = cscan ();
}
}
return res * sgn;
}
public long lscan () throws IOException {
int c = cscan (), sgn = 1;
while (space (c))
c = cscan ();
if (c == '-') {
sgn = -1;
c = cscan ();
}
long res = 0;
do {
res = (res << 1) + (res << 3);
res += c - '0';
c = cscan ();
}
while (!space (c));
return res * sgn;
}
public boolean space (int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
}
public static class UTILITIES {
static final double EPS = 10e-6;
public static void sort(int[] a, boolean increasing) {
ArrayList<Integer> arr = new ArrayList<Integer>();
int n = a.length;
for (int i = 0; i < n; i++) {
arr.add(a[i]);
}
Collections.sort(arr);
for (int i = 0; i < n; i++) {
if (increasing) {
a[i] = arr.get(i);
}
else {
a[i] = arr.get(n-1-i);
}
}
}
public static void sort(long[] a, boolean increasing) {
ArrayList<Long> arr = new ArrayList<Long>();
int n = a.length;
for (int i = 0; i < n; i++) {
arr.add(a[i]);
}
Collections.sort(arr);
for (int i = 0; i < n; i++) {
if (increasing) {
a[i] = arr.get(i);
}
else {
a[i] = arr.get(n-1-i);
}
}
}
public static void sort(double[] a, boolean increasing) {
ArrayList<Double> arr = new ArrayList<Double>();
int n = a.length;
for (int i = 0; i < n; i++) {
arr.add(a[i]);
}
Collections.sort(arr);
for (int i = 0; i < n; i++) {
if (increasing) {
a[i] = arr.get(i);
}
else {
a[i] = arr.get(n-1-i);
}
}
}
public static int lower_bound (int[] arr, int x) {
int low = 0, high = arr.length, mid = -1;
while (low < high) {
mid = (low + high) / 2;
if (arr[mid] >= x)
high = mid;
else
low = mid + 1;
}
return low;
}
public static int upper_bound (int[] arr, int x) {
int low = 0, high = arr.length, mid = -1;
while (low < high) {
mid = (low + high) / 2;
if (arr[mid] > x)
high = mid;
else
low = mid + 1;
}
return low;
}
public static void updateMap(HashMap<Integer, Integer> map, int key, int v) {
if (!map.containsKey(key)) {
map.put(key, v);
}
else {
map.put(key, map.get(key) + v);
}
if (map.get(key) == 0) {
map.remove(key);
}
}
public static long gcd (long a, long b) {
return b == 0 ? a : gcd (b, a % b);
}
public static long lcm (long a, long b) {
return a * b / gcd (a, b);
}
public static long fast_pow_mod (long b, long x, int mod) {
if (x == 0) return 1;
if (x == 1) return b % mod;
if (x % 2 == 0) return fast_pow_mod (b * b % mod, x / 2, mod) % mod;
return b * fast_pow_mod (b * b % mod, x / 2, mod) % mod;
}
public static long fast_pow (long b, long x) {
if (x == 0) return 1;
if (x == 1) return b;
if (x % 2 == 0) return fast_pow (b * b, x / 2);
return b * fast_pow (b * b, x / 2);
}
public static long choose (long n, long k) {
if (k > n || k < 0) {
return 0;
}
k = Math.min (k, n - k);
long val = 1;
for (int i = 0; i < k; ++i)
val = val * (n - i) / (i + 1);
return val;
}
public static long permute (int n, int k) {
if (n < k) return 0;
long val = 1;
for (int i = 0; i < k; ++i)
val = (val * (n - i));
return val;
}
// start of permutation and lower/upper bound template
public static void nextPermutation(int[] nums) {
//find first decreasing digit
int mark = -1;
for (int i = nums.length - 1; i > 0; i--) {
if (nums[i] > nums[i - 1]) {
mark = i - 1;
break;
}
}
if (mark == -1) {
reverse(nums, 0, nums.length - 1);
return;
}
int idx = nums.length-1;
for (int i = nums.length-1; i >= mark+1; i--) {
if (nums[i] > nums[mark]) {
idx = i;
break;
}
}
swap(nums, mark, idx);
reverse(nums, mark + 1, nums.length - 1);
}
public static void swap(int[] nums, int i, int j) {
int t = nums[i];
nums[i] = nums[j];
nums[j] = t;
}
public static void reverse(int[] nums, int i, int j) {
while (i < j) {
swap(nums, i, j);
i++;
j--;
}
}
static int lower_bound (int[] arr, int hi, int cmp) {
int low = 0, high = hi, mid = -1;
while (low < high) {
mid = (low + high) / 2;
if (arr[mid] >= cmp) high = mid;
else low = mid + 1;
}
return low;
}
static int upper_bound (int[] arr, int hi, int cmp) {
int low = 0, high = hi, mid = -1;
while (low < high) {
mid = (low + high) / 2;
if (arr[mid] > cmp) high = mid;
else low = mid + 1;
}
return low;
}
// end of permutation and lower/upper bound template
}
}
| ConDefects/ConDefects/Code/abc315_d/Java/50512945 |
condefects-java_data_955 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String s = in.next();
int bits = 0; //this is the bitmask, representation of a number using bits
int ans=0;
HashMap<Integer, Integer> map = new HashMap<>();
map.put(bits, 1);
for(int i=0; i<s.length(); i++) {
int digit = Integer.parseInt(s.substring(i, i+1));
bits = bits ^ (1 << digit);
if(map.containsKey(bits)) {
ans += map.get(bits);
map.put(bits, map.get(bits)+1);
}
else {
map.put(bits, 1);
}
}
System.out.println(ans);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String s = in.next();
int bits = 0; //this is the bitmask, representation of a number using bits
long ans=0;
HashMap<Integer, Integer> map = new HashMap<>();
map.put(bits, 1);
for(int i=0; i<s.length(); i++) {
int digit = Integer.parseInt(s.substring(i, i+1));
bits = bits ^ (1 << digit);
if(map.containsKey(bits)) {
ans += map.get(bits);
map.put(bits, map.get(bits)+1);
}
else {
map.put(bits, 1);
}
}
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc295_d/Java/43680205 |
condefects-java_data_956 | import java.util.HashMap;
import java.util.Scanner;
public class Main {
static HashMap<Integer, Integer> map = new HashMap<>();
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
char[] arr=sc.next().toCharArray();
int count=0;
long ans=0;
add(0);
for(int i=0;i<arr.length;i++) {
int t=arr[i]-'0';
count^=(1<<t);
add(count);
}
for(int key:map.keySet()) {
int t=map.get(key);
ans+=t*(t-1)/2;
}
System.out.println(ans);
}
public static void add(Integer key) {
map.put(key, map.containsKey(key) ? map.get(key) + 1 : 1);
}
}
import java.util.HashMap;
import java.util.Scanner;
public class Main {
static HashMap<Integer, Integer> map = new HashMap<>();
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
char[] arr=sc.next().toCharArray();
int count=0;
long ans=0;
add(0);
for(int i=0;i<arr.length;i++) {
int t=arr[i]-'0';
count^=(1<<t);
add(count);
}
for(int key:map.keySet()) {
int t=map.get(key);
ans+=(long)t*(t-1)/2;
}
System.out.println(ans);
}
public static void add(Integer key) {
map.put(key, map.containsKey(key) ? map.get(key) + 1 : 1);
}
} | ConDefects/ConDefects/Code/abc295_d/Java/43206747 |
condefects-java_data_957 | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
var in=new FastInput();
var np=in.getIntArray(2);
long[][][] dp=new long[np[0]-1][np[0]+1][4];
dp[0][0][0]=1;
dp[0][1][0]=4;
dp[0][2][1]=1;
dp[0][2][2]=1;
dp[0][2][3]=1;
for (int i = 1; i < dp.length; i++) {
for (int j = np[0]-1; j >= 0; j--) {
if(j>1){
dp[i][j][0]=dp[i-1][j-1][0]*3+dp[i-1][j][0]+dp[i-1][j][1]+dp[i-1][j][2]+dp[i-1][j][3];
dp[i][j][0]%=np[1];
dp[i][j][1]=dp[i-1][j-1][1];
dp[i][j][2]=dp[i-1][j-1][2]+dp[i-1][j-2][0];
dp[i][j][3]=dp[i-1][j-1][3]+dp[i-1][j-2][0];
}else if(j==1){
dp[i][j][0]=dp[i-1][j-1][0]*3+dp[i-1][j][0]+dp[i-1][j][1]+dp[i-1][j][2]+dp[i-1][j][3];
dp[i][j][0]%=np[1];
dp[i][j][1]=dp[i-1][j-1][1];
dp[i][j][2]=dp[i-1][j-1][2];
dp[i][j][3]=dp[i-1][j-1][3];
}else{
dp[i][j][0]=dp[i-1][j][0];
}
}
}
StringBuffer res=new StringBuffer();
for (int i = 1; i < dp[0].length; i++) {
res.append(dp[dp.length-1][i][0]);
if(i+1!=np[0]){
res.append(' ');
}
}
System.out.println(res);
}
}
class FastInput {
BufferedReader in = null;
public FastInput() {
in = new BufferedReader(new InputStreamReader(System.in));
}
public int[] getIntArray(int len) throws IOException {
int[] res = new int[len];
String[] data = in.readLine().split(" ");
for (int i = 0; i < res.length; i++) {
res[i] = Integer.valueOf(data[i]);
}
return res;
}
public long[] getLongArray(int len) throws IOException {
long[] res = new long[len];
String[] data = in.readLine().split(" ");
for (int i = 0; i < res.length; i++) {
res[i] = Long.valueOf(data[i]);
}
return res;
}
public double[] getDoubleArray(int len) throws IOException {
double[] res = new double[len];
String[] data = in.readLine().split(" ");
for (int i = 0; i < res.length; i++) {
res[i] = Double.valueOf(data[i]);
}
return res;
}
}
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
var in=new FastInput();
var np=in.getIntArray(2);
long[][][] dp=new long[np[0]-1][np[0]+1][4];
dp[0][0][0]=1;
dp[0][1][0]=4;
dp[0][2][1]=1;
dp[0][2][2]=1;
dp[0][2][3]=1;
for (int i = 1; i < dp.length; i++) {
for (int j = np[0]-1; j >= 0; j--) {
if(j>1){
dp[i][j][0]=dp[i-1][j-1][0]*3+dp[i-1][j][0]+dp[i-1][j][1]+dp[i-1][j][2]+dp[i-1][j][3];
dp[i][j][0]%=np[1];
dp[i][j][1]=dp[i-1][j-1][1];
dp[i][j][2]=dp[i-1][j-1][2]+dp[i-1][j-2][0];
dp[i][j][3]=dp[i-1][j-1][3]+dp[i-1][j-2][0];
}else if(j==1){
dp[i][j][0]=dp[i-1][j-1][0]*3+dp[i-1][j][0]+dp[i-1][j][1]+dp[i-1][j][2]+dp[i-1][j][3];
dp[i][j][0]%=np[1];
dp[i][j][1]=dp[i-1][j-1][1];
dp[i][j][2]=dp[i-1][j-1][2];
dp[i][j][3]=dp[i-1][j-1][3];
}else{
dp[i][j][0]=dp[i-1][j][0];
}
}
}
StringBuffer res=new StringBuffer();
for (int i = 1; i < np[0]; i++) {
res.append(dp[dp.length-1][i][0]);
if(i+1!=np[0]){
res.append(' ');
}
}
System.out.println(res);
}
}
class FastInput {
BufferedReader in = null;
public FastInput() {
in = new BufferedReader(new InputStreamReader(System.in));
}
public int[] getIntArray(int len) throws IOException {
int[] res = new int[len];
String[] data = in.readLine().split(" ");
for (int i = 0; i < res.length; i++) {
res[i] = Integer.valueOf(data[i]);
}
return res;
}
public long[] getLongArray(int len) throws IOException {
long[] res = new long[len];
String[] data = in.readLine().split(" ");
for (int i = 0; i < res.length; i++) {
res[i] = Long.valueOf(data[i]);
}
return res;
}
public double[] getDoubleArray(int len) throws IOException {
double[] res = new double[len];
String[] data = in.readLine().split(" ");
for (int i = 0; i < res.length; i++) {
res[i] = Double.valueOf(data[i]);
}
return res;
}
} | ConDefects/ConDefects/Code/abc248_f/Java/33420513 |
condefects-java_data_958 | import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f;
public static int mod = 1000000007;
public static int mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = fReader.nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static void solve(PrintWriter o){
try {
int N = fReader.nextInt(), P = fReader.nextInt();
long[][] dp0 = new long[N][N+10];
long[][] dp1 = new long[N][N+10];
dp0[0][0] = 1;
dp1[0][1] = 1;
for(int i=0;i<N-1;i++){
for(int j=0;j<N;j++){
dp0[i][j] %= P;
dp1[i][j] %= P;
dp0[i+1][j] += dp0[i][j];
dp0[i+1][j] += dp1[i][j];
dp0[i+1][j+1] += dp0[i][j] * 3;
dp1[i+1][j+1] += dp1[i][j];
dp1[i+1][j+2] += dp0[i][j] * 2;
}
}
for(int i=1;i<=N-1;i++) o.print(dp0[N-1][i] + " ");
} catch (Exception e){e.printStackTrace();}
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a%b);
}
public static void reverse(int[] array){
reverse(array, 0 , array.length-1);
}
public static void reverse(int[] array, int left, int right) {
if (array != null) {
int i = left;
for(int j = right; j > i; ++i) {
int tmp = array[j];
array[j] = array[i];
array[i] = tmp;
--j;
}
}
}
public static long qpow(long a, long n){
long ret = 1l;
while(n > 0){
if((n & 1) == 1) ret = ret * a % mod9;
n >>= 1;
a = a * a % mod9;
}
return ret;
}
public static class unionFind {
int[] parent;
int[] size;
int n;
public unionFind(int n){
this.n = n;
parent = new int[n+1];
size = new int[n+1];
for(int i=1;i<=n;i++){
parent[i] = i;
size[i] = 1;
}
}
public int find(int p){
while(p != parent[p]){
parent[p] = parent[parent[p]];
p = parent[p];
}
return p;
}
public void union(int p, int q){
int root_p = find(p);
int root_q = find(q);
if(root_p == root_q) return;
if(size[root_p] >= size[root_q]){
parent[root_q] = root_p;
size[root_p] += size[root_q];
size[root_q] = 0;
}
else{
parent[root_p] = root_q;
size[root_q] += size[root_p];
size[root_p] = 0;
}
n--;
}
public int getCount(){
return n;
}
public int[] getSize(){
return size;
}
}
public static class fReader {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
}
}
import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f;
public static int mod = 1000000007;
public static int mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = fReader.nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static void solve(PrintWriter o){
try {
int N = fReader.nextInt(), P = fReader.nextInt();
long[][] dp0 = new long[N][N+10];
long[][] dp1 = new long[N][N+10];
dp0[0][0] = 1;
dp1[0][1] = 1;
for(int i=0;i<N-1;i++){
for(int j=0;j<N;j++){
dp0[i][j] %= P;
dp1[i][j] %= P;
dp0[i+1][j] += dp0[i][j];
dp0[i+1][j] += dp1[i][j];
dp0[i+1][j+1] += dp0[i][j] * 3;
dp1[i+1][j+1] += dp1[i][j];
dp1[i+1][j+2] += dp0[i][j] * 2;
}
}
for(int i=1;i<=N-1;i++) o.print(dp0[N-1][i] % P + " ");
} catch (Exception e){e.printStackTrace();}
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a%b);
}
public static void reverse(int[] array){
reverse(array, 0 , array.length-1);
}
public static void reverse(int[] array, int left, int right) {
if (array != null) {
int i = left;
for(int j = right; j > i; ++i) {
int tmp = array[j];
array[j] = array[i];
array[i] = tmp;
--j;
}
}
}
public static long qpow(long a, long n){
long ret = 1l;
while(n > 0){
if((n & 1) == 1) ret = ret * a % mod9;
n >>= 1;
a = a * a % mod9;
}
return ret;
}
public static class unionFind {
int[] parent;
int[] size;
int n;
public unionFind(int n){
this.n = n;
parent = new int[n+1];
size = new int[n+1];
for(int i=1;i<=n;i++){
parent[i] = i;
size[i] = 1;
}
}
public int find(int p){
while(p != parent[p]){
parent[p] = parent[parent[p]];
p = parent[p];
}
return p;
}
public void union(int p, int q){
int root_p = find(p);
int root_q = find(q);
if(root_p == root_q) return;
if(size[root_p] >= size[root_q]){
parent[root_q] = root_p;
size[root_p] += size[root_q];
size[root_q] = 0;
}
else{
parent[root_p] = root_q;
size[root_q] += size[root_p];
size[root_p] = 0;
}
n--;
}
public int getCount(){
return n;
}
public int[] getSize(){
return size;
}
}
public static class fReader {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
}
} | ConDefects/ConDefects/Code/abc248_f/Java/31110379 |
condefects-java_data_959 | import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String str = sc.next();
if(str.substring(str.length()-2) == "er") System.out.println("er");
else System.out.println("ist");
}
}
import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String str = sc.next();
if(str.substring(str.length()-2).equals("er")) System.out.println("er");
else System.out.println("ist");
}
} | ConDefects/ConDefects/Code/abc224_a/Java/38289964 |
condefects-java_data_960 | import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String a = sc.next();
a = a.substring(a.length()-2);
if(a == "er"){
System.out.println(a);
}else{
System.out.println("ist");
}
}
}
import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String a = sc.next();
a = a.substring(a.length()-2);
if(a.equals("er")){
System.out.println(a);
}else{
System.out.println("ist");
}
}
} | ConDefects/ConDefects/Code/abc224_a/Java/44389301 |
condefects-java_data_961 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.next();
char[] arr1 = {'e','r'};
char[] arr2 = {'s','t'};
int count = 0;
int j = 0;
int k = 0;
for(int i = str.length()-2; i < str.length(); i++) {
if (str.charAt(i) == arr1[j++]) {
count++;
} else if (str.charAt(i)==arr2[k++]) {
count++;
}
}
if (count == 2) {
System.out.println("er");
} else {
System.out.println("ist");
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.next();
char[] arr1 = {'e','r'};
char[] arr2 = {'s','t'};
int count = 0;
int j = 0;
int k = 0;
for(int i = str.length()-2; i < str.length(); i++) {
if (str.charAt(i) == arr1[j++]) {
count++;
} else if (str.charAt(i)==arr2[k++]) {
count = 3;
}
}
if (count == 2) {
System.out.println("er");
} else {
System.out.println("ist");
}
}
} | ConDefects/ConDefects/Code/abc224_a/Java/35855999 |
condefects-java_data_962 | //make sure to make new file!
import java.io.*;
import java.util.*;
public class Main{
public static long n;
public static int sn;
public static int tn;
public static ArrayList<ArrayList<Integer>> sind;
public static ArrayList<ArrayList<Integer>> tind;
public static long[] sfreq;
public static int[] s;
public static int[] t;
public static void main(String[] args)throws IOException{
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out);
n = Long.parseLong(f.readLine());
String sin = f.readLine();
sn = sin.length();
String tin = f.readLine();
tn = tin.length();
sind = new ArrayList<>(26);
tind = new ArrayList<>(26);
for(int k = 0; k < 26; k++){
sind.add(new ArrayList<Integer>());
tind.add(new ArrayList<Integer>());
}
s = new int[sn];
sfreq = new long[26];
for(int k = 0; k < sn; k++){
s[k] = sin.charAt(k)-'a';
sind.get(s[k]).add(k);
sfreq[s[k]]++;
}
t = new int[tn];
for(int k = 0; k < tn; k++){
t[k] = tin.charAt(k)-'a';
tind.get(t[k]).add(k);
}
long l = 0L;
long r = 100000000000000000L; //10^17
long ans = -1L;
while(l <= r){
long mid = l + (r-l)/2L;
if(check(mid)){
ans = mid;
l = mid+1;
} else {
r = mid-1;
}
}
out.println(ans);
out.close();
}
public static boolean check(long x){
if(x == 0L) return true;
//see how many repetitions of s you need to do each character of t x times
long srep = 0L;
int i = Integer.MAX_VALUE; //index of last used character
for(int k = 0; k < tn; k++){
if(sfreq[t[k]] == 0L) return false;
long currep = x;
//binary search for first point in current repetition that can be used
int l = 0;
int r = (int)sfreq[t[k]]-1;
int ans = -1;
while(l <= r){
int mid = l + (r-l)/2;
if(sind.get(t[k]).get(mid) > i){
ans = mid;
r = mid-1;
} else {
l = mid+1;
}
}
//fill what you can using rest of repetition
if(ans == -1){
srep++;
} else {
long rem = sfreq[t[k]]-1 - ans + 1;
if(currep <= rem){
//can use all in current repetition
i = sind.get(t[k]).get(ans + (int)currep-1);
continue;
} else {
//not enough
currep -= rem;
srep++;
}
}
//currep > 0
srep += currep / sfreq[t[k]] - 1;
if(currep % sfreq[t[k]] == 0L){
i = sind.get(t[k]).get((int)sfreq[t[k]]-1);
} else {
srep++;
i = sind.get(t[k]).get((int)(currep % sfreq[t[k]] - 1L));
}
}
//System.out.println(x + " " + srep);
return srep <= n;
}
}
//make sure to make new file!
import java.io.*;
import java.util.*;
public class Main{
public static long n;
public static int sn;
public static int tn;
public static ArrayList<ArrayList<Integer>> sind;
public static ArrayList<ArrayList<Integer>> tind;
public static long[] sfreq;
public static int[] s;
public static int[] t;
public static void main(String[] args)throws IOException{
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
//BufferedReader f = new BufferedReader(new FileReader("Fgen.txt"));
PrintWriter out = new PrintWriter(System.out);
n = Long.parseLong(f.readLine());
String sin = f.readLine();
sn = sin.length();
String tin = f.readLine();
tn = tin.length();
sind = new ArrayList<>(26);
tind = new ArrayList<>(26);
for(int k = 0; k < 26; k++){
sind.add(new ArrayList<Integer>());
tind.add(new ArrayList<Integer>());
}
s = new int[sn];
sfreq = new long[26];
for(int k = 0; k < sn; k++){
s[k] = sin.charAt(k)-'a';
sind.get(s[k]).add(k);
sfreq[s[k]]++;
}
t = new int[tn];
for(int k = 0; k < tn; k++){
t[k] = tin.charAt(k)-'a';
tind.get(t[k]).add(k);
}
long l = 0L;
long r = 100000000000000000L; //10^17
long ans = -1L;
while(l <= r){
long mid = l + (r-l)/2L;
if(check(mid)){
ans = mid;
l = mid+1;
} else {
r = mid-1;
}
}
out.println(ans);
out.close();
}
public static boolean check(long x){
if(x == 0L) return true;
//see how many repetitions of s you need to do each character of t x times
long srep = 0L;
int i = Integer.MAX_VALUE; //index of last used character
for(int k = 0; k < tn; k++){
if(sfreq[t[k]] == 0L) return false;
long currep = x;
//binary search for first point in current repetition that can be used
int l = 0;
int r = (int)sfreq[t[k]]-1;
int ans = -1;
while(l <= r){
int mid = l + (r-l)/2;
if(sind.get(t[k]).get(mid) > i){
ans = mid;
r = mid-1;
} else {
l = mid+1;
}
}
//fill what you can using rest of repetition
if(ans == -1){
srep++;
} else {
long rem = sfreq[t[k]]-1 - ans + 1;
if(currep <= rem){
//can use all in current repetition
i = sind.get(t[k]).get(ans + (int)currep-1);
continue;
} else {
//not enough
currep -= rem;
srep++;
}
}
//currep > 0
srep += currep / sfreq[t[k]] - 1;
if(currep % sfreq[t[k]] == 0L){
i = sind.get(t[k]).get((int)sfreq[t[k]]-1);
} else {
srep++;
i = sind.get(t[k]).get((int)(currep % sfreq[t[k]] - 1L));
}
if(srep > n) return false;
}
//System.out.println(x + " " + srep);
return srep <= n;
}
} | ConDefects/ConDefects/Code/abc346_f/Java/51601981 |
condefects-java_data_963 | import java.io.*;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
/**
* * @author zhengnaishan
* * @date 2023/1/3 9:10
*/
public class Main {
public static void main(String[] args) {
Kattio io = new Kattio();
int n = io.nextInt();
int k = io.nextInt();
PriorityQueue<Long> queue = new PriorityQueue<Long>(((o1, o2) -> Long.compare(o2,o1)));
int[][] que = new int[n + 1][2];
que[0][0] = 1;
que[0][1] = 0;
for (int i = 1; i <= n; i++) {
que[i][0] = io.nextInt();
que[i][1] = io.nextInt();
}
long sum = 0;
int cnt1 = 0;
long now = 0;
long ans = Integer.MIN_VALUE;
for (int i = que.length - 1; i >= 0; i--) {
long a = que[i][0];
long b = que[i][1];
if (a == 1) {
cnt1++;
sum += b - now;
now = b;
if (k + 1 < cnt1) break;
int v = k - cnt1 + 1;
while (queue.size() > v) {
sum += queue.poll();
}
ans = Math.max(ans, sum);
} else if (b > 0) {
sum += b;
} else {
queue.add(b);
}
}
io.println(ans);
io.flush();
}
public static class Kattio extends PrintWriter {
private BufferedReader r;
private StringTokenizer st;
// 标准 IO
public Kattio() {
this(System.in, System.out);
}
public Kattio(InputStream i, OutputStream o) {
super(o);
r = new BufferedReader(new InputStreamReader(i));
}
// 文件 IO
public Kattio(String intput, String output) throws IOException {
super(output);
r = new BufferedReader(new FileReader(intput));
}
// 在没有其他输入时返回 null
public String next() {
try {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(r.readLine());
return st.nextToken();
} catch (Exception e) {
}
return null;
}
public int nextInt() {
return Integer.parseInt(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public long nextLong() {
return Long.parseLong(next());
}
}
}
import java.io.*;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
/**
* * @author zhengnaishan
* * @date 2023/1/3 9:10
*/
public class Main {
public static void main(String[] args) {
Kattio io = new Kattio();
int n = io.nextInt();
int k = io.nextInt();
PriorityQueue<Long> queue = new PriorityQueue<Long>(((o1, o2) -> Long.compare(o2,o1)));
int[][] que = new int[n + 1][2];
que[0][0] = 1;
que[0][1] = 0;
for (int i = 1; i <= n; i++) {
que[i][0] = io.nextInt();
que[i][1] = io.nextInt();
}
long sum = 0;
int cnt1 = 0;
long now = 0;
long ans = Long.MIN_VALUE;
for (int i = que.length - 1; i >= 0; i--) {
long a = que[i][0];
long b = que[i][1];
if (a == 1) {
cnt1++;
sum += b - now;
now = b;
if (k + 1 < cnt1) break;
int v = k - cnt1 + 1;
while (queue.size() > v) {
sum += queue.poll();
}
ans = Math.max(ans, sum);
} else if (b > 0) {
sum += b;
} else {
queue.add(b);
}
}
io.println(ans);
io.flush();
}
public static class Kattio extends PrintWriter {
private BufferedReader r;
private StringTokenizer st;
// 标准 IO
public Kattio() {
this(System.in, System.out);
}
public Kattio(InputStream i, OutputStream o) {
super(o);
r = new BufferedReader(new InputStreamReader(i));
}
// 文件 IO
public Kattio(String intput, String output) throws IOException {
super(output);
r = new BufferedReader(new FileReader(intput));
}
// 在没有其他输入时返回 null
public String next() {
try {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(r.readLine());
return st.nextToken();
} catch (Exception e) {
}
return null;
}
public int nextInt() {
return Integer.parseInt(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public long nextLong() {
return Long.parseLong(next());
}
}
}
| ConDefects/ConDefects/Code/abc249_f/Java/37704403 |
condefects-java_data_964 | import java.io.*;
import java.text.DecimalFormat;
import java.util.*;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
static StringTokenizer st;
static int MOD = 998244353;
public static void main(String[] args) throws IOException {
/*int t = readInt();
while (t-->0) {
}*/
int n = readInt();
int[] A = new int[n];
for (int i = 0; i < n; i++) A[i] = readInt();
int m = readInt();
Set<Integer> B = new HashSet<>();
for (int i = 0; i < m; i++) B.add(readInt());
int x = readInt();
boolean[] dp = new boolean[x+1];
dp[0] = true;
for (int i = 1; i <= x; i++) {
if (B.contains(i)) continue;
for (int j = 0; j < n; j++) {
if (i - A[j] >= 0) dp[i] |= dp[i - A[j]];
}
}
System.out.println(dp[x] ? "YES": "NO");
}
static int gcd(int a, int b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
static String next() throws IOException {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(br.readLine().trim());
return st.nextToken();
}
static long readLong() throws IOException {
return Long.parseLong(next());
}
static int readInt() throws IOException {
return Integer.parseInt(next());
}
static double readDouble() throws IOException {
return Double.parseDouble(next());
}
static char readCharacter() throws IOException {
return next().charAt(0);
}
static String readLine() throws IOException {
return br.readLine().trim();
}
static int readLongLineInt() throws IOException{
int x = 0, c;
while((c = br.read()) != ' ' && c != '\n')
x = x * 10 + (c - '0');
return x;
}
}
import java.io.*;
import java.text.DecimalFormat;
import java.util.*;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
static StringTokenizer st;
static int MOD = 998244353;
public static void main(String[] args) throws IOException {
/*int t = readInt();
while (t-->0) {
}*/
int n = readInt();
int[] A = new int[n];
for (int i = 0; i < n; i++) A[i] = readInt();
int m = readInt();
Set<Integer> B = new HashSet<>();
for (int i = 0; i < m; i++) B.add(readInt());
int x = readInt();
boolean[] dp = new boolean[x+1];
dp[0] = true;
for (int i = 1; i <= x; i++) {
if (B.contains(i)) continue;
for (int j = 0; j < n; j++) {
if (i - A[j] >= 0) dp[i] |= dp[i - A[j]];
}
}
System.out.println(dp[x] ? "Yes": "No");
}
static int gcd(int a, int b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
static String next() throws IOException {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(br.readLine().trim());
return st.nextToken();
}
static long readLong() throws IOException {
return Long.parseLong(next());
}
static int readInt() throws IOException {
return Integer.parseInt(next());
}
static double readDouble() throws IOException {
return Double.parseDouble(next());
}
static char readCharacter() throws IOException {
return next().charAt(0);
}
static String readLine() throws IOException {
return br.readLine().trim();
}
static int readLongLineInt() throws IOException{
int x = 0, c;
while((c = br.read()) != ' ' && c != '\n')
x = x * 10 + (c - '0');
return x;
}
}
| ConDefects/ConDefects/Code/abc289_d/Java/41236610 |
condefects-java_data_965 | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n=scanner.nextInt();
int m=scanner.nextInt();
int h=scanner.nextInt();
int k=scanner.nextInt();
String s=scanner.next();
Set<String>item=new HashSet<>();
for(int i=0;i<m;i++){
item.add(scanner.nextInt()+" "+scanner.nextInt());
}
int x=0;
int y=0;
for(int i=0;i<n;i++){
if(s.charAt(i)=='R')x++;
if(s.charAt(i)=='L')x--;
if(s.charAt(i)=='U')y++;
if(s.charAt(i)=='D')y--;
h--;
if(h<0){
System.out.println(-1);
return;
}
if(item.contains(x+" "+y) && h<k){
h=k;
item.remove(x+" "+y);
}
}
System.out.println("Yes");
}
}
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n=scanner.nextInt();
int m=scanner.nextInt();
int h=scanner.nextInt();
int k=scanner.nextInt();
String s=scanner.next();
Set<String>item=new HashSet<>();
for(int i=0;i<m;i++){
item.add(scanner.nextInt()+" "+scanner.nextInt());
}
int x=0;
int y=0;
for(int i=0;i<n;i++){
if(s.charAt(i)=='R')x++;
if(s.charAt(i)=='L')x--;
if(s.charAt(i)=='U')y++;
if(s.charAt(i)=='D')y--;
h--;
if(h<0){
System.out.println("No");
return;
}
if(item.contains(x+" "+y) && h<k){
h=k;
item.remove(x+" "+y);
}
}
System.out.println("Yes");
}
} | ConDefects/ConDefects/Code/abc303_c/Java/42059378 |
condefects-java_data_966 | import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
int h = sc.nextInt();
int K = sc.nextInt();
String S = sc.next();
Map<Integer, ArrayList<Integer>> ITEMS = new HashMap<Integer, ArrayList<Integer>>();
ArrayList<Integer> DEFAULT_VALUE = new ArrayList<Integer>();
for (int i = 0; i < M; i++) {
int x = sc.nextInt();
ArrayList<Integer> y = ITEMS.getOrDefault(x, (ArrayList<Integer>) DEFAULT_VALUE.clone());
y.add(sc.nextInt());
ITEMS.put(x, y);
}
sc.close();
int[] pos = {0, 0};
for (int i=0; i<N; i++) {
// 移動
if (S.charAt(i) == 'R') {pos[0]++;}
else if (S.charAt(i) == 'L') {pos[0]--;}
else if (S.charAt(i) == 'U') {pos[1]++;}
else if (S.charAt(i) == 'D') {pos[1]--;}
// 体力計算
h--;
if (h<0) {
System.out.println("No");
return;
} else {
if (ITEMS.getOrDefault(pos[0], DEFAULT_VALUE).contains(pos[1]) && h < K) {
h = K;
}
}
}
System.out.println("Yes");
}
}
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
int h = sc.nextInt();
int K = sc.nextInt();
String S = sc.next();
Map<Integer, ArrayList<Integer>> ITEMS = new HashMap<Integer, ArrayList<Integer>>();
ArrayList<Integer> DEFAULT_VALUE = new ArrayList<Integer>();
for (int i = 0; i < M; i++) {
int x = sc.nextInt();
ArrayList<Integer> y = ITEMS.getOrDefault(x, (ArrayList<Integer>) DEFAULT_VALUE.clone());
y.add(sc.nextInt());
ITEMS.put(x, y);
}
sc.close();
int[] pos = {0, 0};
for (int i=0; i<N; i++) {
// 移動
if (S.charAt(i) == 'R') {pos[0]++;}
else if (S.charAt(i) == 'L') {pos[0]--;}
else if (S.charAt(i) == 'U') {pos[1]++;}
else if (S.charAt(i) == 'D') {pos[1]--;}
// 体力計算
h--;
if (h<0) {
System.out.println("No");
return;
} else {
if (ITEMS.getOrDefault(pos[0], DEFAULT_VALUE).contains(pos[1]) && h < K) {
h = K;
ITEMS.get(pos[0]).remove(ITEMS.get(pos[0]).indexOf(pos[1]));
}
}
}
System.out.println("Yes");
}
}
| ConDefects/ConDefects/Code/abc303_c/Java/43264157 |
condefects-java_data_967 |
import java.awt.Point;
import java.io.Serializable;
import java.math.BigInteger;
import java.util.AbstractList;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.RandomAccess;
import java.util.Set;
import java.util.TreeMap;
import java.util.function.BinaryOperator;
import java.util.function.UnaryOperator;
public class Main implements Runnable {
private void solve(final FastIO io, final String[] args) {
io.setAutoFlush(false);
io.setAutoOutFlush(false);
/*
* author: 31536000
* AtCoder Regular Contest 164 E問題
* 考察メモ
* まずdは明らかで、ceil(log(N))
* 更に、2^d - N個は選ばれても上にできるから、問題名のは残りの2N - 2^d個
* これは選ばれると下を呼ぶので、こういうのを最小化したい
*
* できること
* 2. 最下層ではない葉を1個置く
* 3. 葉を2連続で置く (片方だけ含む区間の個数だけペナルティ2)
*
* 左からi番目まで見て、最下層の葉をj個置いた時のペナルティの最小値を考える
* 予め、各区間についてここにこの操作をするとペナルティ、を計算しておくと行けるか
*
* あー、調査されないなら別に忘れても良いのね
* N=4000, Q=[5, 6)だとする
* すると、次のことをやっていい
* [0, N)
* [0, 6) [6, N)
* [0, 5) [5, 6)
* 残りはさておき、深さは2で抑えられたのか
* つまり座圧してから考えて良いのね
* あれ、座圧すると葉の話って大丈夫？
*
*/
int N = io.nextInt(), Q = io.nextInt();
TreeMap<Integer, Integer> compress = new TreeMap<>();
compress.put(0, -1);
compress.put(N, -1);
int[] L = new int[Q], R = new int[Q];
for (int i = 0;i < Q;++ i) {
L[i] = io.nextInt() - 1;
R[i] = io.nextInt();
compress.put(L[i], -1);
compress.put(R[i], -1);
}
int[] penalty;
int[] penalty2;
{
N = compress.size() - 1;
int val = 0;
for (int key : compress.keySet().toArray(new Integer[0])) compress.put(key, val++);
penalty = new int[N];
for (int i = 0;i < Q;++ i) {
int l = compress.get(L[i]), r = compress.get(R[i]);
if (l != 0) penalty[l - 1] += 2;
penalty[r - 1] += 2;
}
}
int d = 0;
while(1 << d < N) ++ d;
int top = (1 << d) - N;
int[][] dp = new int[N + 2][top + 1]; // dp[i][j]: 左からi番目まで見て、最下層でないものをj個設置したときのペナルティの最小値
for (int[] i : dp) Arrays.fill(i, exponent10(1, 9));
dp[0][0] = 0;
for (int i = 0;i < N;++ i) {
int[] now = dp[i], next = dp[i + 1], next2 = dp[i + 2];
for (int j = 0;j <= top;++ j) {
if (j != top) next[j + 1] = Math.min(next[j + 1], now[j]);// 最下層でない葉を1個
next2[j] = Math.min(next2[j], now[j] + penalty[i]); // 最下層を2個
}
}
if (d == 0) io.println("0 0");
else io.println(d + " " + dp[N][top]);
}
/** デバッグ用コードのお供に */
private static boolean DEBUG = false;
/** 確保するメモリの大きさ(単位: MB) */
private static final long MEMORY = 64;
private final FastIO io;
private final String[] args;
public static void main(final String[] args) {
Thread.setDefaultUncaughtExceptionHandler((t, e) -> {
e.printStackTrace();
System.exit(1);
});
FastIO.setFastStandardOutput(true);
new Thread(null, new Main(args), "", MEMORY * 1048576L).start();
}
public Main(final String[] args) {
this(new FastIO(), args);
}
public Main(final FastIO io, final String... args) {
this.io = io;
this.args = args;
if (DEBUG) io.setAutoFlush(true);
}
@Override
public void run() {
try {
solve(io, args);
} catch (final Throwable e) {
throw e;
} finally {
io.close();
FastIO.setFastStandardOutput(false);
}
}
// 以下、ライブラリ
/**
* 指数表記の値を整数で返します。
*
* @param n 仮数部
* @param e 指数部
* @return n * 10^e
*/
public static int exponent10(final int n, final int e) {
return n * pow(10, e);
}
/**
* 指数表記の値を整数で返します。
*
* @param n 仮数部
* @param e 指数部
* @return n * 10^e
*/
public static long exponent10L(final int n, final int e) {
return n * pow(10L, e);
}
/**
* aのb乗を返します。
*
* @param a 整数
* @param b 整数
* @return aのb乗
*/
public static int pow(final int a, int b) {
int ans = 1;
for (int mul = a; b > 0; b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
return ans;
}
/**
* aのb乗をmodを法として計算したものを返します。
*
* @param a 整数
* @param b 整数
* @param mod 法
* @return aのb乗をmodを法として計算したもの
*/
public static int pow(int a, int b, final int mod) {
a %= mod;
if (a < 0) a += mod;
if (b < 0) {
b %= mod - 1;
b += mod - 1;
}
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul = mul * mul % mod) if ((b & 1) != 0) ans = ans * mul % mod;
return (int) ans;
}
/**
* aのb乗を返します。
*
* @param a 整数
* @param b 整数
* @return aのb乗
*/
public static long pow(final long a, long b) {
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
return ans;
}
/**
* aのb乗をmodを法として計算したものを返します。
*
* @param a 整数
* @param b 整数
* @param mod 法
* @return aのb乗をmodを法として計算したもの
*/
public static int pow(long a, long b, final int mod) {
a %= mod;
if (a < 0) a += mod;
if (b < 0) {
b %= mod - 1;
b += mod - 1;
}
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul = mul * mul % mod) if ((b & 1) != 0) ans = ans * mul % mod;
return (int) ans;
}
public enum BoundType {
CLOSED, OPEN;
}
public static class Range<C> implements Serializable {
private static final long serialVersionUID = -4702828934863023392L;
protected C lower;
protected C upper;
protected BoundType lowerType;
protected BoundType upperType;
private Comparator<? super C> comparator;
protected Range(final C lower, final BoundType lowerType, final C upper, final BoundType upperType) {
this(lower, lowerType, upper, upperType, null);
}
protected Range(final C lower, final BoundType lowerType, final C upper, final BoundType upperType,
final Comparator<? super C> comparator) {
this.lower = lower;
this.upper = upper;
this.lowerType = lowerType;
this.upperType = upperType;
this.comparator = comparator;
}
public static <C extends Comparable<? super C>> Range<C> range(final C lower, final BoundType lowerType,
final C upper, final BoundType upperType) {
if (lower != null && upper != null) {
final int comp = lower.compareTo(upper);
if (comp > 0) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
}
return new Range<>(lower, lowerType, upper, upperType);
}
public static <C> Range<C> range(final C lower, final BoundType lowerType, final C upper,
final BoundType upperType, final Comparator<? super C> comparator) {
if (lower != null && upper != null) {
final int comp = comparator.compare(lower, upper);
if (comp > 0) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
}
return new Range<>(lower, lowerType, upper, upperType, comparator);
}
public static <C extends Comparable<? super C>> Range<C> all() {
return range((C) null, BoundType.OPEN, null, BoundType.OPEN);
}
public static <C> Range<C> all(final Comparator<? super C> comparator) {
return range((C) null, BoundType.OPEN, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> atMost(final C upper) {
return range(null, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static <C> Range<C> atMost(final C upper, final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> lessThan(final C upper) {
return range(null, BoundType.OPEN, upper, BoundType.OPEN);
}
public static <C> Range<C> lessThan(final C upper, final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> downTo(final C upper, final BoundType boundType) {
return range(null, BoundType.OPEN, upper, boundType);
}
public static <C> Range<C> downTo(final C upper, final BoundType boundType,
final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, boundType, comparator);
}
public static <C extends Comparable<? super C>> Range<C> atLeast(final C lower) {
return range(lower, BoundType.CLOSED, null, BoundType.OPEN);
}
public static <C> Range<C> atLeast(final C lower, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> greaterThan(final C lower) {
return range(lower, BoundType.OPEN, null, BoundType.OPEN);
}
public static <C> Range<C> greaterThan(final C lower, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> upTo(final C lower, final BoundType boundType) {
return range(lower, boundType, null, BoundType.OPEN);
}
public static <C> Range<C> upTo(final C lower, final BoundType boundType,
final Comparator<? super C> comparator) {
return range(lower, boundType, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> open(final C lower, final C upper) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN);
}
public static <C> Range<C> open(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> openClosed(final C lower, final C upper) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static <C> Range<C> openClosed(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> closedOpen(final C lower, final C upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static <C> Range<C> closedOpen(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> closed(final C lower, final C upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static <C> Range<C> closed(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> singleton(final C value) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED);
}
public static <C> Range<C> singleton(final C value, final Comparator<? super C> comparator) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> empty() {
return range((C) null, BoundType.CLOSED, null, BoundType.CLOSED);
}
public static <C> Range<C> empty(final Comparator<? super C> comparator) {
return range((C) null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> encloseAll(final Iterable<C> values) {
C lower = values.iterator().next();
C upper = lower;
for (final C i : values) {
if (lower.compareTo(i) > 0) lower = i;
if (upper.compareTo(i) < 0) upper = i;
}
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static <C> Range<C> encloseAll(final Iterable<C> values, final Comparator<? super C> comparator) {
C lower = values.iterator().next();
C upper = lower;
for (final C i : values) {
if (comparator.compare(lower, i) > 0) lower = i;
if (comparator.compare(upper, i) < 0) upper = i;
}
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);
}
protected int compareLower(final C value) {
return compareLower(value, BoundType.CLOSED);
}
protected int compareLower(final C value, final BoundType boundType) {
return compareLower(lower, lowerType, value, boundType);
}
protected int compareLower(final C lower, final BoundType lowerType, final C value) {
return compareLower(lower, lowerType, value, BoundType.CLOSED);
}
protected int compareLower(final C lower, final BoundType lowerType, final C value, final BoundType boundType) {
if (lower == null) return value == null ? 0 : -1;
else if (value == null) return 1;
int compare;
if (comparator == null) {
@SuppressWarnings("unchecked")
final Comparable<C> comp = (Comparable<C>) lower;
compare = comp.compareTo(value);
} else compare = comparator.compare(lower, value);
if (compare == 0) {
if (lowerType == BoundType.CLOSED) --compare;
if (boundType == BoundType.CLOSED) ++compare;
}
return compare;
}
protected int compareUpper(final C value) {
return compareUpper(value, BoundType.CLOSED);
}
protected int compareUpper(final C value, final BoundType boundType) {
return compareUpper(upper, upperType, value, boundType);
}
protected int compareUpper(final C upper, final BoundType upperType, final C value) {
return compareUpper(upper, upperType, value, BoundType.CLOSED);
}
protected int compareUpper(final C upper, final BoundType upperType, final C value, final BoundType boundType) {
if (upper == null) return value == null ? 0 : 1;
if (value == null) return -1;
int compare;
if (comparator == null) {
@SuppressWarnings("unchecked")
final Comparable<C> comp = (Comparable<C>) upper;
compare = comp.compareTo(value);
} else compare = comparator.compare(upper, value);
if (compare == 0) {
if (upperType == BoundType.CLOSED) ++compare;
if (boundType == BoundType.CLOSED) --compare;
}
return compare;
}
public boolean hasLowerBound() {
return lower != null;
}
public C lowerEndpoint() {
if (hasLowerBound()) return lower;
throw new IllegalStateException();
}
public BoundType lowerBoundType() {
if (hasLowerBound()) return lowerType;
throw new IllegalStateException();
}
public boolean hasUpperBound() {
return upper != null;
}
public C upperEndpoint() {
if (hasUpperBound()) return upper;
throw new IllegalStateException();
}
public BoundType upperBoundType() {
if (hasUpperBound()) return upperType;
throw new IllegalStateException();
}
/**
* この区間が空集合か判定します。
*
* @return 空集合ならばtrue
*/
public boolean isEmpty() { return lower == null && upper == null && lowerType == BoundType.CLOSED; }
/**
* 与えられた引数が区間の左側に位置するか判定します。<br>
* 接する場合は区間の左側ではないと判定します。
*
* @param value 調べる引数
* @return 区間の左側に位置するならtrue
*/
public boolean isLess(final C value) {
return isLess(value, BoundType.CLOSED);
}
protected boolean isLess(final C value, final BoundType boundType) {
return compareLower(value, boundType) > 0;
}
/**
* 与えられた引数が区間の右側に位置するか判定します。<br>
* 接する場合は区間の右側ではないと判定します。
*
* @param value 調べる引数
* @return 区間の右側に位置するならtrue
*/
public boolean isGreater(final C value) {
return isGreater(value, BoundType.CLOSED);
}
private boolean isGreater(final C value, final BoundType boundType) {
return compareUpper(value, boundType) < 0;
}
/**
* 与えられた引数が区間内に位置するか判定します。<br>
* 接する場合も区間内に位置すると判定します。
*
* @param value 調べる引数
* @return 区間内に位置するならtrue
*/
public boolean contains(final C value) {
return !isLess(value) && !isGreater(value) && !isEmpty();
}
/**
* 与えられた引数すべてが区間内に位置するか判定します。<br>
* 接する場合も区間内に位置すると判定します。
*
* @param value 調べる要素
* @return 全ての要素が区間内に位置するならtrue
*/
public boolean containsAll(final Iterable<? extends C> values) {
for (final C i : values) if (!contains(i)) return false;
return true;
}
/**
* 与えられた区間がこの区間に内包されるか判定します。<br>
*
* @param other
* @return 与えられた区間がこの区間に内包されるならtrue
*/
public boolean encloses(final Range<C> other) {
return !isLess(other.lower, other.lowerType) && !isGreater(other.upper, other.upperType);
}
/**
* 与えられた区間がこの区間と公差するか判定します。<br>
* 接する場合は公差するものとします。
*
* @param value 調べる引数
* @return 区間が交差するならtrue
*/
public boolean isConnected(final Range<C> other) {
if (this.isEmpty() || other.isEmpty()) return false;
C lower, upper;
BoundType lowerType, upperType;
if (isLess(other.lower, other.lowerType)) {
lower = other.lower;
lowerType = other.lowerType;
} else {
lower = this.lower;
lowerType = this.lowerType;
}
if (isGreater(other.upper, other.upperType)) {
upper = other.upper;
upperType = other.upperType;
} else {
upper = this.upper;
upperType = this.upperType;
}
if (lower == null || upper == null) return true;
final int comp = compareLower(lower, lowerType, upper, upperType);
return comp <= 0;
}
/**
* この区間との積集合を返します。
*
* @param connectedRange 積集合を求める区間
* @return 積集合
*/
public Range<C> intersection(final Range<C> connectedRange) {
if (this.isEmpty() || connectedRange.isEmpty()) {
if (comparator == null) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
return empty(comparator);
}
C lower, upper;
BoundType lowerType, upperType;
if (isLess(connectedRange.lower, connectedRange.lowerType)) {
lower = connectedRange.lower;
lowerType = connectedRange.lowerType;
} else {
lower = this.lower;
lowerType = this.lowerType;
}
if (isGreater(connectedRange.upper, connectedRange.upperType)) {
upper = connectedRange.upper;
upperType = connectedRange.upperType;
} else {
upper = this.upper;
upperType = this.upperType;
}
if (comparator == null) { return new Range<>(lower, lowerType, upper, upperType); }
return range(lower, lowerType, upper, upperType, comparator);
}
/**
* この区間との和集合を返します。
*
* @param other 和集合を求める区間
* @return 和集合
*/
public Range<C> span(final Range<C> other) {
if (other.isEmpty()) return new Range<>(lower, lowerType, upper, upperType);
C lower, upper;
BoundType lowerType, upperType;
if (isLess(other.lower, other.lowerType)) {
lower = this.lower;
lowerType = this.lowerType;
} else {
lower = other.lower;
lowerType = other.lowerType;
}
if (isGreater(other.upper, other.upperType)) {
upper = this.upper;
upperType = this.upperType;
} else {
upper = other.upper;
upperType = other.upperType;
}
return new Range<>(lower, lowerType, upper, upperType, comparator);
}
/**
* 区間スケジューリングを行います。<br>
* 計算量は要素数Nに対してO(NlogN)です。
*
* @param ranges 区間の集合
* @return 区間スケジューリングを行った際の一つの解
*/
public static <C> List<Range<C>> scheduling(final List<Range<C>> ranges) {
final PriorityQueue<Range<C>> pq = new PriorityQueue<>((l, r) -> l.compareUpper(r.upper, r.upperType));
final List<Range<C>> ret = new ArrayList<>();
Range<C> last = pq.poll();
if (pq.isEmpty()) return ret;
ret.add(last);
while (!pq.isEmpty()) {
final Range<C> tmp = pq.poll();
if (tmp.compareLower(last.upper, last.upperType) > 0) {
ret.add(tmp);
last = tmp;
}
}
return ret;
}
@Override
public boolean equals(final Object object) {
if (this == object) return true;
if (object instanceof Range) {
@SuppressWarnings("unchecked")
final Range<C> comp = (Range<C>) object;
return compareLower(comp.lower, comp.lowerType) == 0 && compareUpper(comp.upper, comp.upperType) == 0
&& lowerType == comp.lowerType && upperType == comp.upperType;
}
return false;
}
@Override
public int hashCode() {
if (lower == null && upper == null) return 0;
else if (lower == null) return upper.hashCode();
else if (upper == null) return lower.hashCode();
return lower.hashCode() ^ upper.hashCode();
}
@Override
public String toString() {
if (isEmpty()) return "()";
return (lowerType == BoundType.OPEN ? "(" : "[") + (lower == null ? "" : lower.toString()) + ".."
+ (upper == null ? "" : upper.toString()) + (upperType == BoundType.OPEN ? ")" : "]");
}
}
public static class IterableRange<C> extends Range<C> implements Iterable<C> {
private static final long serialVersionUID = 9065915259748260688L;
protected UnaryOperator<C> func;
protected IterableRange(final C lower, final BoundType lowerType, final C upper, final BoundType upperType,
final UnaryOperator<C> func) {
super(lower, lowerType, upper, upperType);
this.func = func;
}
public static <C extends Comparable<? super C>> IterableRange<C> range(final C lower, final BoundType lowerType,
final C upper, final BoundType upperType, final UnaryOperator<C> func) {
if (lower == null || upper == null)
return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
final int comp = lower.compareTo(upper);
if (comp > 0) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return new IterableRange<>(lower, lowerType, upper, upperType, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> open(final C lower, final C upper,
final UnaryOperator<C> func) {
if (lower == null) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return range(func.apply(lower), BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> openClosed(final C lower, final C upper,
final UnaryOperator<C> func) {
if (lower == null) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return range(func.apply(lower), BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> closedOpen(final C lower, final C upper,
final UnaryOperator<C> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> closed(final C lower, final C upper,
final UnaryOperator<C> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> singleton(final C value,
final UnaryOperator<C> func) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);
}
protected class Iter implements Iterator<C> {
C now;
Iter() {
now = lower;
}
@Override
public final boolean hasNext() {
return !isGreater(now);
}
@Override
public final C next() {
final C ret = now;
now = func.apply(now);
return ret;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
protected class EmptyIter implements Iterator<C> {
@Override
public boolean hasNext() {
return false;
}
@Override
public C next() {
return null;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<C> iterator() {
return lower == null || upper == null ? new EmptyIter() : new Iter();
}
public int getDistance() {
C check = upper;
int ret = 0;
while (lower != check) {
check = func.apply(check);
++ret;
}
return ret;
}
}
public static class IntRange extends IterableRange<Integer> {
private static final long serialVersionUID = 5623995336491967216L;
private final boolean useFastIter;
private static class Next implements UnaryOperator<Integer> {
@Override
public Integer apply(final Integer value) {
return value + 1;
}
}
protected IntRange() {
super(null, BoundType.CLOSED, null, BoundType.CLOSED, new Next());
useFastIter = true;
}
protected IntRange(final UnaryOperator<Integer> func) {
super(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
useFastIter = false;
}
protected IntRange(final int lower, final BoundType lowerType, final int upper, final BoundType upperType) {
super(lower, lowerType, upper, upperType, new Next());
useFastIter = true;
}
protected IntRange(final int lower, final BoundType lowerType, final int upper, final BoundType upperType,
final UnaryOperator<Integer> func) {
super(lower, lowerType, upper, upperType, func);
useFastIter = false;
}
public static IntRange range(int lower, final BoundType lowerType, int upper, final BoundType upperType) {
if (lower > upper) return new IntRange();
if (lowerType == BoundType.OPEN) ++lower;
if (upperType == BoundType.OPEN) --upper;
return new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange range(int lower, final BoundType lowerType, int upper, final BoundType upperType,
final UnaryOperator<Integer> func) {
if (lower > upper) return new IntRange(func);
if (lowerType == BoundType.OPEN) ++lower;
if (upperType == BoundType.OPEN) --upper;
return new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange open(final int lower, final int upper) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN);
}
public static IntRange open(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN, func);
}
public static IntRange open(final int upper) {
return range(0, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static IntRange open(final int upper, final UnaryOperator<Integer> func) {
return range(0, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static IntRange openClosed(final int lower, final int upper) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static IntRange openClosed(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED, func);
}
public static IntRange closedOpen(final int lower, final int upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static IntRange closedOpen(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static IntRange closed(final int lower, final int upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange closed(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange closed(final int upper) {
return range(0, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange closed(final int upper, final UnaryOperator<Integer> func) {
return range(0, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange singleton(final int value) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED);
}
public static IntRange singleton(final int value, final UnaryOperator<Integer> func) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);
}
private class FastIter implements Iterator<Integer> {
int now;
public FastIter() {
now = lower;
}
@Override
public final boolean hasNext() {
return now <= upper;
}
@Override
public final Integer next() {
return now++;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
private class Iter implements Iterator<Integer> {
int now;
public Iter() {
now = lower;
}
@Override
public final boolean hasNext() {
return now <= upper;
}
@Override
public final Integer next() {
final int ret = now;
now = func.apply(now);
return ret;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<Integer> iterator() {
return lower == null || upper == null ? new EmptyIter() : useFastIter ? new FastIter() : new Iter();
}
@Override
public int getDistance() {
int ret = upper - lower;
if (upperType == BoundType.CLOSED) ++ret;
return ret;
}
public int getClosedLower() { return lower; }
public int getOpenLower() { return lower - 1; }
public int getClosedUpper() { return upperType == BoundType.CLOSED ? upper : upper - 1; }
public int getOpenUpper() { return upperType == BoundType.CLOSED ? upper + 1 : upper; }
/**
* 区間スケジューリングを行います。<br>
* 計算量は要素数Nに対してO(NlogN)です。
*
* @param ranges 区間の集合
* @return 区間スケジューリングを行った際の一つの解
*/
public static List<IntRange> intScheduling(final List<IntRange> ranges) {
final PriorityQueue<IntRange> pq = new PriorityQueue<>((l, r) -> l.compareUpper(r.upper, r.upperType));
pq.addAll(ranges);
final List<IntRange> ret = new ArrayList<>();
if (pq.isEmpty()) return ret;
IntRange last = pq.poll();
ret.add(last);
while (!pq.isEmpty()) {
final IntRange tmp = pq.poll();
if (tmp.compareLower(last.upper, last.upperType) > 0) {
ret.add(tmp);
last = tmp;
}
}
return ret;
}
}
/**
* 演算が結合法則を満たすことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Associative<T> extends BinaryOperator<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数、1以上であること
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
public default T hyper(final T element, int repeat) {
if (repeat < 1) throw new IllegalArgumentException("undefined operation");
T ret = element;
--repeat;
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* この演算が逆元を持つことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Inverse<T> extends BinaryOperator<T> {
public T inverse(T element);
}
/**
* 演算が交換法則を満たすことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Commutative<T> extends BinaryOperator<T> {
}
/**
* 演算が単位元を持つことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Identity<T> extends BinaryOperator<T> {
/**
* 単位元を返します。
*
* @return 単位元
*/
public T identity();
}
/**
* 演算が群であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Group<T> extends Monoid<T>, Inverse<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
@Override
public default T hyper(final T element, int repeat) {
T ret = identity();
if (repeat < 0) {
repeat = -repeat;
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return inverse(ret);
}
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* 演算がモノイドであることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Monoid<T> extends Associative<T>, Identity<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数、0以上であること
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
@Override
public default T hyper(final T element, int repeat) {
if (repeat < 0) throw new IllegalArgumentException("undefined operation");
T ret = identity();
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* 演算が可換モノイドであることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface CommutativeMonoid<T> extends Monoid<T>, Commutative<T> {
}
/**
* 演算がアーベル群(可換群)であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Abelian<T> extends Group<T>, CommutativeMonoid<T> {
}
/**
* 演算が半環であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Semiring<T, A extends CommutativeMonoid<T>, M extends Monoid<T>> {
public A getAddition();
public M getMultiplication();
public default T add(final T left, final T right) {
return getAddition().apply(left, right);
}
public default T multiply(final T left, final T right) {
return getMultiplication().apply(left, right);
}
public default T additiveIdentity() {
return getAddition().identity();
}
public default T multipleIdentity() {
return getMultiplication().identity();
}
public default int characteristic() {
return 0;
}
}
/**
* 演算が環であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Ring<T, A extends Abelian<T>, M extends Monoid<T>> extends Semiring<T, A, M> {
}
/**
* 演算が可換環に属することを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface CommutativeRing<T, A extends Abelian<T>, M extends CommutativeMonoid<T>> extends Ring<T, A, M> {
}
/**
* 演算が整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface IntegralDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends CommutativeRing<T, A, M> {
public boolean isDivisible(T left, T right);
public T divide(T left, T right);
}
/**
* 演算が整閉整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface IntegrallyClosedDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends IntegralDomain<T, A, M> {
}
/**
* 演算がGCD整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface GCDDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends IntegrallyClosedDomain<T, A, M> {
public T gcd(T left, T right);
public T lcm(T left, T right);
}
/**
* 素元を提供します。
*
* @author 31536000
*
* @param <T> 演算の型
*/
public static class PrimeElement<T> {
public final T element;
public PrimeElement(final T element) {
this.element = element;
}
}
public interface MultiSet<E> extends Collection<E> {
public int add(E element, int occurrences);
public int count(Object element);
public Set<E> elementSet();
public boolean remove(Object element, int occurrences);
public int setCount(E element, int count);
public boolean setCount(E element, int oldCount, int newCount);
}
/**
* 演算が一意分解整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface UniqueFactorizationDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends GCDDomain<T, A, M> {
public MultiSet<PrimeElement<T>> PrimeFactorization(T x);
}
/**
* 演算が主イデアル整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface PrincipalIdealDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends UniqueFactorizationDomain<T, A, M> {
}
/**
* 演算がユークリッド整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface EuclideanDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends PrincipalIdealDomain<T, A, M> {
public T reminder(T left, T right);
}
/**
* 演算が体であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Field<T, A extends Abelian<T>, M extends Abelian<T>> extends EuclideanDomain<T, A, M> {
@Override
public default boolean isDivisible(final T left, final T right) {
return !right.equals(additiveIdentity());
}
@Override
public default T divide(final T left, final T right) {
if (isDivisible(left, right)) throw new ArithmeticException("divide by Additive Identify");
return multiply(left, getMultiplication().inverse(right));
}
@Override
public default T reminder(final T left, final T right) {
if (isDivisible(left, right)) throw new ArithmeticException("divide by Additive Identify");
return additiveIdentity();
}
@Override
public default T gcd(final T left, final T right) {
return multipleIdentity();
}
@Override
public default T lcm(final T left, final T right) {
return multipleIdentity();
}
@Override
public default MultiSet<PrimeElement<T>> PrimeFactorization(final T x) {
final HashMultiSet<PrimeElement<T>> ret = HashMultiSet.create(1);
ret.add(new PrimeElement<>(x));
return ret;
}
}
public static class HashMultiSet<E> implements MultiSet<E>, Serializable {
private static final long serialVersionUID = -8378919645386251159L;
private final transient HashMap<E, Integer> map;
private transient int size;
private HashMultiSet() {
map = new HashMap<>();
size = 0;
}
private HashMultiSet(final int distinctElements) {
map = new HashMap<>(distinctElements);
size = 0;
}
public static <E> HashMultiSet<E> create() {
return new HashMultiSet<>();
}
public static <E> HashMultiSet<E> create(final int distinctElements) {
return new HashMultiSet<>(distinctElements);
}
public static <E> HashMultiSet<E> create(final Iterable<? extends E> elements) {
final HashMultiSet<E> ret = new HashMultiSet<>();
for (final E i : elements) ret.map.compute(i, (v, e) -> e == null ? 1 : ++e);
return ret;
}
@Override
public int size() {
return size;
}
@Override
public boolean isEmpty() { return size == 0; }
@Override
public boolean contains(final Object o) {
return map.containsKey(o);
}
private class Iter implements Iterator<E> {
private final Iterator<Entry<E, Integer>> iter = map.entrySet().iterator();
private E value;
private int count = 0;
@Override
public boolean hasNext() {
if (count > 0) return true;
if (iter.hasNext()) {
final Entry<E, Integer> entry = iter.next();
value = entry.getKey();
count = entry.getValue();
return true;
}
return false;
}
@Override
public E next() {
--count;
return value;
}
}
@Override
public Iterator<E> iterator() {
return new Iter();
}
@Override
public Object[] toArray() {
final Object[] ret = new Object[size];
int read = 0;
for (final Entry<E, Integer> i : map.entrySet()) Arrays.fill(ret, read, read += i.getValue(), i.getKey());
return ret;
}
@Override
public <T> T[] toArray(final T[] a) {
final Object[] src = toArray();
if (a.length < src.length) {
@SuppressWarnings("unchecked")
final T[] ret = (T[]) Arrays.copyOfRange(src, 0, src.length, a.getClass());
return ret;
}
System.arraycopy(src, 0, a, 0, src.length);
return a;
}
@Override
public boolean add(final E e) {
add(e, 1);
return true;
}
@Override
public boolean remove(final Object o) {
return remove(o, 1);
}
@Override
public boolean containsAll(final Collection<?> c) {
boolean ret = true;
for (final Object i : c) ret |= contains(i);
return ret;
}
@Override
public boolean addAll(final Collection<? extends E> c) {
boolean ret = false;
for (final E i : c) ret |= add(i);
return ret;
}
@Override
public boolean removeAll(final Collection<?> c) {
boolean ret = false;
for (final Object i : c) ret |= remove(i);
return ret;
}
@Override
public boolean retainAll(final Collection<?> c) {
return removeAll(c);
}
@Override
public void clear() {
map.clear();
size = 0;
}
@Override
public int add(final E element, final int occurrences) {
size += occurrences;
return map.compute(element, (k, v) -> v == null ? occurrences : v + occurrences) - occurrences;
}
@Override
public int count(final Object element) {
return map.getOrDefault(element, 0);
}
@Override
public Set<E> elementSet() {
return map.keySet();
}
public Set<Entry<E, Integer>> entrySet() {
return map.entrySet();
}
@Override
public boolean remove(final Object element, final int occurrences) {
try {
@SuppressWarnings("unchecked")
final E put = (E) element;
return map.compute(put, (k, v) -> {
if (v == null) return null;
if (v < occurrences) {
size -= v;
return null;
}
size -= occurrences;
return v - occurrences;
}) != null;
} catch (final ClassCastException E) {
return false;
}
}
@Override
public int setCount(final E element, final int count) {
final Integer ret = map.put(element, count);
final int ret2 = ret == null ? 0 : ret;
size += count - ret2;
return ret2;
}
@Override
public boolean setCount(final E element, final int oldCount, final int newCount) {
final boolean ret = map.replace(element, oldCount, newCount);
if (ret) size += newCount - oldCount;
return ret;
}
}
public static class ModInteger extends Number
implements Field<ModInteger, Abelian<ModInteger>, Abelian<ModInteger>> {
private static final long serialVersionUID = -8595710127161317579L;
private final int mod;
private int num;
private final Addition add;
private final Multiplication mul;
private class Addition implements Abelian<ModInteger> {
@Override
public ModInteger identity() {
return new ModInteger(mod, 0);
}
@Override
public ModInteger inverse(final ModInteger element) {
return new ModInteger(element, element.mod - element.num);
}
@Override
public ModInteger apply(final ModInteger left, final ModInteger right) {
return new ModInteger(left).addEqual(right);
}
}
private class Multiplication implements Abelian<ModInteger> {
@Override
public ModInteger identity() {
return new ModInteger(mod, 1);
}
@Override
public ModInteger apply(final ModInteger left, final ModInteger right) {
return new ModInteger(left).multiplyEqual(right);
}
@Override
public ModInteger inverse(final ModInteger element) {
return new ModInteger(element, element.inverse(element.num));
}
}
@Override
public int characteristic() {
return mod;
}
public ModInteger(final int mod) {
this.mod = mod;
num = 0;
add = new Addition();
mul = new Multiplication();
}
public ModInteger(final int mod, final int num) {
this.mod = mod;
this.num = validNum(num);
add = new Addition();
mul = new Multiplication();
}
public ModInteger(final ModInteger n) {
mod = n.mod;
num = n.num;
add = n.add;
mul = n.mul;
}
private ModInteger(final ModInteger n, final int num) {
mod = n.mod;
this.num = num;
add = n.add;
mul = n.mul;
}
private int validNum(int n) {
n %= mod;
if (n < 0) n += mod;
return n;
}
private int validNum(long n) {
n %= mod;
if (n < 0) n += mod;
return (int) n;
}
protected int inverse(int n) {
int m = mod, u = 0, v = 1, t;
while (n != 0) {
t = m / n;
m -= t * n;
u -= t * v;
if (m != 0) {
t = n / m;
n -= t * m;
v -= t * u;
} else {
v %= mod;
if (v < 0) v += mod;
return v;
}
}
u %= mod;
if (u < 0) u += mod;
return u;
}
public boolean isPrime(final int n) {
if ((n & 1) == 0) return false; // 偶数
for (int i = 3, j = 8, k = 9; k <= n; i += 2, k += j += 8) if (n % i == 0) return false;
return true;
}
@Override
public int intValue() {
return num;
}
@Override
public long longValue() {
return num;
}
@Override
public float floatValue() {
return num;
}
@Override
public double doubleValue() {
return num;
}
protected ModInteger getNewInstance(final ModInteger mod) {
return new ModInteger(mod);
}
public ModInteger add(final int n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger add(final long n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger add(final ModInteger n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger addEqual(final int n) {
num = validNum(num + n);
return this;
}
public ModInteger addEqual(final long n) {
num = validNum(num + n);
return this;
}
public ModInteger addEqual(final ModInteger n) {
if ((num += n.num) >= mod) num -= mod;
return this;
}
public ModInteger subtract(final int n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtract(final long n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtract(final ModInteger n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtractEqual(final int n) {
num = validNum(num - n);
return this;
}
public ModInteger subtractEqual(final long n) {
num = validNum(num - n);
return this;
}
public ModInteger subtractEqual(final ModInteger n) {
if ((num -= n.num) < 0) num += mod;
return this;
}
public ModInteger multiply(final int n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiply(final long n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiply(final ModInteger n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiplyEqual(final int n) {
num = (int) ((long) num * n % mod);
if (num < 0) num += mod;
return this;
}
public ModInteger multiplyEqual(final long n) {
return multiplyEqual((int) (n % mod));
}
public ModInteger multiplyEqual(final ModInteger n) {
num = (int) ((long) num * n.num % mod);
return this;
}
public ModInteger divide(final int n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divide(final long n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divide(final ModInteger n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divideEqual(final int n) {
num = (int) ((long) num * inverse(validNum(n)) % mod);
return this;
}
public ModInteger divideEqual(final long n) {
return divideEqual((int) (n % mod));
}
public ModInteger divideEqual(final ModInteger n) {
num = (int) ((long) num * n.inverse(n.num) % mod);
return this;
}
public ModInteger pow(final int n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger pow(final long n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger pow(final ModInteger n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger powEqual(int n) {
long ans = 1, num = this.num;
if (n < 0) {
n = -n;
while (n != 0) {
if ((n & 1) != 0) ans = ans * num % mod;
n >>>= 1;
num = num * num % mod;
}
this.num = inverse((int) ans);
return this;
}
while (n != 0) {
if ((n & 1) != 0) ans = ans * num % mod;
n >>>= 1;
num = num * num % mod;
}
this.num = (int) ans;
return this;
}
public ModInteger powEqual(final long n) {
return powEqual((int) (n % (mod - 1)));
}
public ModInteger powEqual(final ModInteger n) {
long num = this.num;
this.num = 1;
int mul = n.num;
while (mul != 0) {
if ((mul & 1) != 0) this.num *= num;
mul >>>= 1;
num *= num;
num %= mod;
}
return this;
}
public ModInteger equal(final int n) {
num = validNum(n);
return this;
}
public ModInteger equal(final long n) {
num = validNum(n);
return this;
}
public ModInteger equal(final ModInteger n) {
num = n.num;
return this;
}
public int toInt() {
return num;
}
public int getMod() { return mod; }
@Override
public boolean equals(final Object x) {
if (x instanceof ModInteger) return ((ModInteger) x).num == num && ((ModInteger) x).mod == mod;
return false;
}
@Override
public int hashCode() {
return num ^ mod;
}
@Override
public String toString() {
return String.valueOf(num);
}
@Deprecated
public String debug() {
int min = num, ans = 1;
for (int i = 2; i < min; ++i) {
final int tmp = multiply(i).num;
if (min > tmp) {
min = tmp;
ans = i;
}
}
return min + "/" + ans;
}
@Override
public Addition getAddition() { return add; }
@Override
public Multiplication getMultiplication() { return mul; }
}
/**
* 素数を法とする演算上で、組み合わせの計算を高速に行います。
*
* @author 31536000
*
*/
public static class ModUtility {
private final int mod;
private int[] fact, inv, invfact;
/**
* modを法として、演算を行います。
*
* @param mod 法とする素数
*/
public ModUtility(final Prime mod) {
this(mod, 2);
}
/**
* modを法として、演算を行います。
*
* @param mod 法とする素数
* @param calc 予め前計算しておく大きさ
*/
public ModUtility(final Prime mod, final int calc) {
this.mod = mod.prime;
precalc(calc);
}
/**
* calcの大きさだけ、前計算を行います。
*
* @param calc 前計算をする大きさ
*/
public void precalc(int calc) {
++calc;
if (calc < 2) calc = 2;
if (calc > mod) calc = mod;
fact = new int[calc];
inv = new int[calc];
invfact = new int[calc];
fact[0] = invfact[0] = fact[1] = invfact[1] = inv[1] = 1;
for (int i = 2; i < calc; ++i) {
fact[i] = (int) ((long) fact[i - 1] * i % mod);
inv[i] = (int) (mod - (long) inv[mod % i] * (mod / i) % mod);
invfact[i] = (int) ((long) invfact[i - 1] * inv[i] % mod);
}
}
/**
* modを法とする剰余環上で振舞う整数を返します。
*
* @return modを法とする整数、初期値は0
*/
public ModInteger create() {
return new ModInt();
}
/**
* modを法とする剰余環上で振舞う整数を返します。
*
* @param n 初期値
* @return modを法とする整数
*/
public ModInteger create(final int n) {
return new ModInt(n);
}
private class ModInt extends ModInteger {
private static final long serialVersionUID = -2435281861935422575L;
public ModInt() {
super(mod);
}
public ModInt(final int n) {
super(mod, n);
}
public ModInt(final ModInteger mod) {
super(mod);
}
@Override
protected ModInteger getNewInstance(final ModInteger mod) {
return new ModInt(mod);
}
@Override
protected int inverse(final int n) {
return ModUtility.this.inverse(n);
}
}
/**
* modを法として、nの逆元を返します。<br>
* 計算量はO(log n)です。
*
* @param n 逆元を求めたい値
* @return 逆元
*/
public int inverse(int n) {
try {
if (inv.length > n) return inv[n];
int m = mod, u = 0, v = 1, t;
while (n != 0) {
t = m / n;
m -= t * n;
u -= t * v;
if (m != 0) {
t = n / m;
n -= t * m;
v -= t * u;
} else {
v %= mod;
if (v < 0) v += mod;
return v;
}
}
u %= mod;
if (u < 0) u += mod;
return u;
} catch (final ArrayIndexOutOfBoundsException e) {
throw new IllegalArgumentException();
}
}
/**
* n!を、modを法として求めた値を返します。<br>
* 計算量はO(n)です。
*
* @param n 階乗を求めたい値
* @return nの階乗をmodで割った余り
*/
public int factorial(final int n) {
try {
if (fact.length > n) return fact[n];
long ret = fact[fact.length - 1];
for (int i = fact.length; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
} catch (final ArrayIndexOutOfBoundsException e) {
throw new IllegalArgumentException();
}
}
/**
* nPkをmodで割った余りを求めます。<br>
* 計算量はO(n-k)です。
*
* @param n 左辺
* @param k 右辺
* @return nPkをmodで割った余り
*/
public int permutation(final int n, final int k) {
if (n < 0) throw new IllegalArgumentException();
if (n < k) return 0;
if (fact.length > n) return (int) ((long) fact[n] * invfact[n - k] % mod);
long ret = 1;
for (int i = n - k + 1; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
}
/**
* nCkをmodで割った余りを求めます。<br>
* 計算量はO(min(plogn, n-k))です。
*
* @param n 左辺
* @param k 右辺
* @return nCkをmodで割った余り
*/
public int combination(int n, int k) {
if (n < 0) throw new IllegalArgumentException();
if (n < k) return 0;
if (fact.length > n) return (int) ((long) fact[n] * invfact[k] % mod * invfact[n - k] % mod);
long ret = 1;
if (n >= mod) {
if (mod == 2) return (~n & k) == 0 ? 1 : 0;
while (n > 0) {
ret = ret * combination(n % mod, k % mod) % mod;
n /= mod;
k /= mod;
}
return (int) ret;
}
if (n < 2 * k) k = n - k;
ret = invfact.length > k ? invfact[k] : inverse(factorial(k));
for (int i = n - k + 1; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
}
/**
* 他項係数をmodで割った余りを求めます。<br>
* ] 計算量はO(n)です。
*
* @param n 左辺
* @param k 右辺、合計がn以下である必要がある
* @return 他項係数
*/
public int multinomial(final int n, final int... k) {
int sum = 0;
long ret = factorial(n);
if (fact.length > n) {
for (final int i : k) {
if (i < 0) throw new IllegalArgumentException();
ret = ret * invfact[i] % mod;
sum += i;
}
if (sum > n) return 0;
ret = ret * invfact[n - sum] % mod;
} else {
for (final int i : k) {
if (i < 0) throw new IllegalArgumentException();
if (invfact.length > i) ret = ret * invfact[i] % mod;
else ret = ret * inverse(factorial(i)) % mod;
sum += i;
}
if (sum > n) return 0;
if (invfact.length > n - sum) ret = ret * invfact[n - sum] % mod;
else ret = ret * inverse(factorial(n - sum)) % mod;
}
return (int) ret;
}
/**
* n個からk個を選ぶ重複組み合わせnHkをmodで割った余りを求めます。<br>
* 計算量はO(min(n, k))です。
*
* @param n 左辺
* @param k 右辺
* @return nHkをmodで割った余り
*/
public int multichoose(final int n, final int k) {
return combination(mod(n + k - 1), k);
}
/**
* カタラン数C(n)をmodで割った余りを求めます。<br>
* 計算量はO(n)です。
*
* @param n 求めたいカタラン数の番号
* @return カタラン数
*/
public int catalan(final int n) {
return divide(combination(mod(2 * n), n), mod(n + 1));
}
/**
* 第一種スターリング数S(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(nk)です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 左辺
* @param k 右辺
* @return S(n, k)をmodで割った余り
*/
public int firstStirling(final int n, final int k) {
final int[] stirling = new int[(n + 1) * (k + 1)];
stirling[0] = 1;
final int h = k + 1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < k; ++j) {
final int tmp = stirling[i * h + j] + (int) ((long) i * stirling[i * h + j + 1] % mod);
stirling[(i + 1) * h + j + 1] = tmp >= mod ? tmp - mod : tmp;
}
}
return stirling[stirling.length - 1];
}
/**
* 第二種スターリング数S(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(k)です。
*
* @param n 左辺
* @param k 右辺
* @return S(n, k)をmodで割った余り
*/
public int secondStirling(final int n, final int k) {
if (k == 0) return n == 0 ? 1 : 0;
final int[] sieve = new int[k + 1], prime = new int[k + 1];
int size = 0;
sieve[1] = 1;
for (int i = 2; i <= k; ++i) {
if (sieve[i] == 0) prime[size++] = sieve[i] = i;
for (int j = 0, s; j < size && prime[j] <= sieve[i] && (s = i * prime[j]) <= k; ++j)
sieve[s] = prime[j];
}
long ans = 0;
for (int i = 1, s; i <= k; ++i) {
final long tmp = (long) combination(k, i)
* (prime[i] = (s = sieve[i]) == i ? pow(i, n) : (int) ((long) prime[s] * prime[i / s] % mod))
% mod;
ans += (k - i & 1) != 0 ? -tmp : tmp;
}
return (int) ((long) mod(ans) * invfact[k] % mod);
}
/**
* ベル数B(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(k)です。
*
* @param n 左辺
* @param k 右辺
* @return B(n, k)をmodで割った余り
*/
public int bell(final int n, final int k) {
if (k == 0) return n == 0 ? 1 : 0;
final int[] sieve = new int[k + 1], prime = new int[k + 1];
int size = 0;
sieve[1] = 1;
long sum = 0;
for (int i = 2; i <= k; ++i) {
if (sieve[i] == 0) prime[size++] = sieve[i] = i;
for (int j = 0, s; j < size && prime[j] <= sieve[i] && (s = i * prime[j]) <= k; ++j)
sieve[s] = prime[j];
sum += (i & 1) != 0 ? -invfact[i] : invfact[i];
}
sum = mod(sum);
long ans = 0;
for (int i = 0, s; i <= k; ++i) {
final long tmp = (long) (prime[i] = (s = sieve[i]) == i ? pow(i, n)
: (int) ((long) prime[s] * prime[i / s] % mod)) * invfact[i] % mod;
ans += tmp * sum % mod;
if ((sum -= (k - i & 1) != 0 ? -invfact[k - i] : invfact[k - i]) < 0) sum += mod;
}
return mod(ans);
}
/**
* ベル数B(n)をmodで割った余りを求めます。<br>
* 計算量はO(n)です。
*
* @param n 求めたいベル数の番号
* @return B(n)
*/
public int bell(final int n) {
return bell(n, n);
}
/**
* 分割数P(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(nk)です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 左辺
* @param k 右辺
* @return P(n, k)をmodで割った余り
*/
public int pertition(final int n, final int k) {
final int[] pertition = new int[(n + 1) * (k + 1)];
pertition[0] = 1;
final int h = k + 1;
for (int i = 0; i <= n; ++i) {
for (int j = 1, l = Math.min(i, k); j <= l; ++j)
pertition[i * h + j] = pertition[i * h + j - 1] + pertition[(i - j) * h + j];
for (int j = i; j < k; ++j) pertition[i * h + j + 1] = pertition[i * h + j];
}
return pertition[n * h + k];
}
/**
* 分割数P(n)をmodで割った余りを求めます。<br>
* 計算量はO(n sqrt(n))です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 求めたい分割数の番号
* @return P(n)
*/
public int pertition(final int n) {
final long[] pertition = new long[n + 1];
pertition[0] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = 1, t; (t = i - (j * (3 * j - 1) >> 1)) >= 0; ++j) {
pertition[i] += (j & 1) != 0 ? pertition[t] : -pertition[t];
}
for (int j = 1, t; (t = i - (j * (3 * j + 1) >> 1)) >= 0; ++j) {
pertition[i] += (j & 1) != 0 ? pertition[t] : -pertition[t];
}
pertition[i] %= mod;
}
return (int) pertition[n];
}
/**
* nのm乗をmodで割った余りを求めます。<br>
* 計算量はO(log m)です。
*
* @param n 床
* @param m 冪指数
* @return n^mをmodで割った余り
*/
public int pow(final int n, int m) {
long ans = 1, num = n;
if (m < 0) {
m = -m;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % mod;
m >>>= 1;
num = num * num % mod;
}
return inverse((int) ans);
}
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % mod;
m >>>= 1;
num = num * num % mod;
}
return (int) ans;
}
/**
* nのm乗をmodで割った余りを求めます。<br>
* 計算量はO(log m)です。
*
* @param n 床
* @param m 冪指数
* @return n^mをmodで割った余り
*/
public int pow(final long n, final long m) {
return pow((int) (n % mod), (int) (m % (mod - 1)));
}
/**
* 現在のmod値のトーシェント数を返します。<br>
* なお、これはmod-1に等しいです。
*
* @return トーシェント数
*/
public int totient() {
return mod - 1;
}
/**
* nのトーシェント数を返します。<br>
* 計算量はO(sqrt n)です。
*
* @param n トーシェント数を求めたい値
* @return nのトーシェント数
*/
public static int totient(int n) {
int totient = n;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
totient = totient / i * (i - 1);
while ((n %= i) % i == 0);
}
}
if (n != 1) totient = totient / n * (n - 1);
return totient;
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(int n) {
return (n %= mod) < 0 ? n + mod : n;
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(long n) {
return (int) ((n %= mod) < 0 ? n + mod : n);
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(final PrimeFactor n) {
int ret = 1;
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
ret = multiply(ret, pow(i.getKey().prime, i.getValue()));
return ret;
}
/**
* n+mをmodで割った余りを返します。
*
* @param n 足される値
* @param m 足す値
* @return n+mをmodで割った余り
*/
public int add(final int n, final int m) {
return mod(n + m);
}
/**
* n-mをmodで割った余りを返します。
*
* @param n 引かれる値
* @param m 引く値
* @return n-mをmodで割った余り
*/
public int subtract(final int n, final int m) {
return mod(n - m);
}
/**
* n*mをmodで割った余りを返します。
*
* @param n 掛けられる値
* @param m 掛ける値
* @return n*mをmodで割った余り
*/
public int multiply(final int n, final int m) {
final int ans = (int) ((long) n * m % mod);
return ans < 0 ? ans + mod : ans;
}
/**
* n/mをmodで割った余りを返します。
*
* @param n 割られる値
* @param m 割る値
* @return n/mをmodで割った余り
*/
public int divide(final int n, final int m) {
return multiply(n, inverse(m));
}
/**
* fを通ることが分かっているfの要素数-1次の関数について、xの位置における値をmodで割った余りを返します。<br>
* 計算量はO(f)です。
*
* @param f 関数の形
* @param x 求める位置
* @return 求めたい値をmodで割った余り
*/
public ModInteger lagrangePolynomial(final ModInteger[] f, final int x) {
if (f.length > x) return f[x];
if (x > fact.length) precalc(x);
final ModInteger ret = create(0);
final ModInteger[] dp = new ModInteger[f.length], dp2 = new ModInteger[f.length];
dp[0] = create(1);
dp2[f.length - 1] = create(1);
for (int i = 1; i < f.length; ++i) {
dp[i] = dp[i - 1].multiply(x - i - 1);
dp2[f.length - i - 1] = dp2[f.length - i].multiply(x - f.length + i);
}
for (int i = 0; i < f.length; ++i) {
final ModInteger tmp = f[i].multiply(dp[i]).multiplyEqual(dp2[i]).multiplyEqual(inv[i])
.multiplyEqual(inv[f.length - 1 - i]);
if ((f.length - i & 1) == 0) ret.addEqual(tmp);
else ret.subtractEqual(tmp);
}
return ret;
}
/**
* 与えられた配列に対し、その配列を並び替えることで構成できる配列の集合をSとします。
* このとき、arrayがSを辞書順に並べると何番目かを求めます。
* @complexity N=array.length として O(N log N)
* @param array 辞書順で何番目か求めたい配列
* @return arrayが辞書順で何番目か
*/
public ModInteger permutationNumber(int[] array) {
int[] compress = ArrayUtility.compress(array);
int[] bucket = new int[array.length];
for (int i : compress) ++bucket[i];
int sum = multinomial(array.length, bucket);
int[] bit = new int[array.length + 1];
for (int i = 0; i < array.length; ++i)
for (int j = i + 1, add = bucket[i]; j < bit.length; j += j & -j) bit[j] += add;
int ans = 1;
for (int i = 0; i < array.length; ++i) {
sum = divide(sum, array.length - i);
int comp = compress[i];
int min = 0;
for (int j = comp; j != 0; j -= j & -j) min += bit[j];
ans = add(ans, multiply(sum, min));
sum = multiply(sum, bucket[comp]--);
for (int j = comp + 1; j < bit.length; j += j & -j) --bit[j];
}
return create(ans);
}
}
/**
* 区間における素数を保持する関数です。
*
* @author 31536000
*
*/
public static class SegmentPrime {
private final Prime[] divisor;
private final int offset;
private SegmentPrime(final Prime[] divisor, final int offset) {
this.divisor = divisor;
this.offset = offset;
}
/**
* このクラスが持つ区間の範囲を返します。
*
* @return 素数を保持している区間
*/
public IntRange getRange() { return IntRange.closedOpen(offset, offset + divisor.length); }
/**
* 素数かどうかを判定します。
*
* @param n 素数かどうか判定したい数
* @return 素数ならばtrue
*/
public boolean isPrime(final int n) {
return n <= 1 ? false : divisor[n - offset].prime == n;
}
/**
* 与えられた数を素因数分解します。<br>
* 計算量はO(log n)です。
*
* @param n 素因数分解したい数
* @return 素因数分解した結果
*/
public PrimeFactor getPrimeFactor(int n) {
if (n < 1) throw new IllegalArgumentException("not positive number");
final Map<Prime, Integer> map = new HashMap<>();
while (n > 1) {
final Prime d = divisor[n - offset];
map.compute(d, (k, v) -> v == null ? 1 : v + 1);
n /= d.prime;
}
return new PrimeFactor(map);
}
@Override
public String toString() {
return "SegmentPrime: [" + offset + ", " + (offset + divisor.length) + ")";
}
}
/**
* 整数の素因数分解表現を保持します。
*
* @author 31536000
*
*/
public static class PrimeFactor extends Number {
private static final long serialVersionUID = 1363575672283884773L;
public Map<Prime, Integer> primeFactor;
private PrimeFactor(final Map<Prime, Integer> n) {
primeFactor = n;
}
/**
* 素因数分解のリスト表現を返します。
*
* @return 素因数分解のリスト
*/
public List<Integer> getFactorizationList() {
final List<Integer> ret = new ArrayList<>();
for (final Entry<Prime, Integer> i : primeFactor.entrySet()) {
final int p = i.getKey().prime, n = i.getValue();
for (int j = 0; j < n; ++j) ret.add(p);
}
return ret;
}
/**
* nとgcdを取った値を保持します。
*
* @param n gcdを取りたい値
*/
public void gcd(final PrimeFactor n) {
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
primeFactor.computeIfPresent(i.getKey(), (k, v) -> Math.min(v, i.getValue()));
}
/**
* gcd(n, m)を返します。
*
* @param n gcdを取りたい値
* @param m gcdを取りたい値
* @return gcd(n, m)
*/
public static PrimeFactor gcd(final PrimeFactor n, final PrimeFactor m) {
final Map<Prime, Integer> ret = new HashMap<>(n.primeFactor);
for (final Entry<Prime, Integer> i : m.primeFactor.entrySet())
ret.computeIfPresent(i.getKey(), (k, v) -> Math.min(v, i.getValue()));
return new PrimeFactor(ret);
}
/**
* nとlcmを取った値を保持します。
*
* @param n lcmを取りたい値
*/
public void lcm(final PrimeFactor n) {
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
primeFactor.merge(i.getKey(), i.getValue(), (v1, v2) -> Math.max(v1, v2));
}
/**
* lcm(n, m)を返します。
*
* @param n lcmを取りたい値
* @param m lcmを取りたい値
* @return lcm(n, m)
*/
public static PrimeFactor lcm(final PrimeFactor n, final PrimeFactor m) {
final Map<Prime, Integer> ret = new HashMap<>(n.primeFactor);
for (final Entry<Prime, Integer> i : m.primeFactor.entrySet())
ret.merge(i.getKey(), i.getValue(), (v1, v2) -> Math.max(v1, v2));
return new PrimeFactor(ret);
}
private static int pow(final int p, int n) {
int ans = 1;
for (int mul = p; n > 0; n >>= 1, mul *= mul) if ((n & 1) != 0) ans *= mul;
return ans;
}
private static long pow(final long p, long n) {
long ans = 1;
for (long mul = p; n > 0; n >>= 1, mul *= mul) if ((n & 1) != 0) ans *= mul;
return ans;
}
public BigInteger getValue() {
BigInteger ret = BigInteger.ONE;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret = ret.multiply(new BigInteger(i.getKey().toString()).pow(i.getValue()));
return ret;
}
@Override
public int intValue() {
int ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet()) ret *= pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public long longValue() {
long ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= pow((long) i.getKey().prime, i.getValue());
return ret;
}
@Override
public float floatValue() {
float ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= Math.pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public double doubleValue() {
long ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= Math.pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public boolean equals(final Object o) {
return o instanceof PrimeFactor ? ((PrimeFactor) o).primeFactor.equals(primeFactor) : false;
}
@Override
public int hashCode() {
return primeFactor.hashCode();
}
@Override
public String toString() {
return primeFactor.toString();
}
}
/**
* 素数を渡すためのクラスです。<br>
* 中身が確実に素数であることを保証するときに使ってください。
*
* @author 31536000
*
*/
public static class Prime extends Number {
private static final long serialVersionUID = 8216169308184181643L;
public final int prime;
/**
* 素数を設定します。
*
* @param prime 素数
* @throws IllegalArgumentException 素数以外を渡した時
*/
public Prime(final int prime) {
if (!isPrime(prime)) throw new IllegalArgumentException(prime + " is not prime");
this.prime = prime;
}
private Prime(final int prime, final boolean none) {
this.prime = prime;
}
private static final int bases[] = { 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620,
560, 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028, 2213, 6219, 620,
3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113, 7061, 803, 1269, 3875, 422, 751, 580, 4729,
10239, 746, 2951, 556, 2206, 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,
15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903, 737, 1887, 7447, 1888,
2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41, 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352,
6435, 165, 1169, 3315, 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,
27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524, 3577, 236, 2360, 6146, 2850,
55637, 1753, 4178, 8466, 222, 2579, 2743, 2031, 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159,
1725, 3597, 3366, 14336, 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,
434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183, 8126, 1870, 3296, 7455,
8947, 25017, 541, 19115, 368, 566, 5674, 411, 522, 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007,
35201, 4706, 1152, 1785, 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,
4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816, 5197, 13330, 7054, 2818, 3199,
811, 922, 350, 7514, 4452, 3449, 2663, 4708, 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194 };
private static final byte wheel[] = { 10, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4,
2, 4, 8, 6, 4, 6, 2, 4, 6, 2, 6, 6, 4, 2, 4, 6, 2, 6, 4, 2, 4, 2, 10, 2 };
private static boolean isSPRP(final int n, long a) {
int d = n - 1, s = 0;
while ((d & 1) == 0) {
++s;
d >>= 1;
}
long cur = 1, pw = d;
do {
if ((pw & 1) != 0) cur = cur * a % n;
a = a * a % n;
pw >>= 1;
} while (pw != 0);
if (cur == 1) return true;
for (int r = 0; r < s; ++r) {
if (cur == n - 1) return true;
cur = cur * cur % n;
}
return false;
}
/**
* 与えられた値が素数か否かを判定します。<br>
* この実装はhttp://ceur-ws.org/Vol-1326/020-Forisek.pdfに基づきます。
*
* @param x 判定したい値
* @return xが素数ならtrue
*/
public static boolean isPrime(final int x) {
if (x == 2 || x == 3 || x == 5 || x == 7) return true;
if ((x & 1) == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;
return checkPrime(x);
}
private static boolean checkPrime(final int x) {
if (x < 121) return x > 1;
long h = x;
h = (h >> 16 ^ h) * 0x45d9f3b;
h = (h >> 16 ^ h) * 0x45d9f3b;
h = (h >> 16 ^ h) & 0xFF;
return isSPRP(x, bases[(int) h]);
}
/**
* 区間における素数を列挙します。<br>
* この実装はエラトステネスの篩に基づきます。
*
* @param n 素数を求める範囲
* @return 1以上n以下の素数を保持する区間素数
*/
public static SegmentPrime getSegmentPrime(final int n) {
final Prime[] divisor = new Prime[n - 1];
final int sqrt = (int) Math.sqrt(n) + 1;
for (int i = 0; i < sqrt; ++i) {
if (divisor[i] != null) continue;
final int p = i + 2;
divisor[i] = new Prime(p, true);
for (int j = p * p - 2; j < divisor.length; j += p) divisor[j] = divisor[i];
}
for (int i = sqrt; i < divisor.length; ++i) if (divisor[i] == null) divisor[i] = new Prime(i + 2, true);
return new SegmentPrime(divisor, 2);
}
/**
* 与えられた値を素因数分解した結果を返します。
*
* @param x 素因数分解する値
* @return 素因数分解した結果
*/
public static PrimeFactor getPrimeFactor(int x) {
if (x <= 0) throw new IllegalArgumentException("non positive number: " + x);
final Map<Prime, Integer> ret = new TreeMap<>((l, r) -> Integer.compare(l.prime, r.prime));
int c;
if ((x & 1) == 0) {
c = 1;
for (x >>= 1; (x & 1) == 0; x >>= 1) ++c;
ret.put(new Prime(2, false), c);
}
if (x % 3 == 0) {
c = 1;
for (x /= 3; x % 3 == 0; x /= 3) ++c;
ret.put(new Prime(3, false), c);
}
if (x % 5 == 0) {
c = 1;
for (x /= 5; x % 5 == 0; x /= 5) ++c;
ret.put(new Prime(5, false), c);
}
if (x % 7 == 0) {
c = 1;
for (x /= 7; x % 7 == 0; x /= 7) ++c;
ret.put(new Prime(7, false), c);
}
if (x < 100000000) { // Wheel Factorization
for (int i = 11, j = 0; i * i <= x; i += wheel[++j % wheel.length]) {
while (x % i == 0) {
x /= i;
ret.compute(new Prime(i, false), (k, v) -> v == null ? 1 : v + 1);
}
}
if (x != 1) ret.put(new Prime(x, false), 1);
} else {
int p, count;
while (x != 1) { // 素因数分解が終わってる
for (p = x; !checkPrime(p); p = pollardRho(p, 1));
final Prime prime = new Prime(p, false);
count = 1;
for (x /= p; x % p == 0; x /= p) ++count;
ret.put(prime, count);
}
}
return new PrimeFactor(ret);
}
private static int gcd(int n, int m) {
while (n != 0) if ((m %= n) != 0) n %= m;
else return n;
return m;
}
private static int pollardRho(final int x, int c) {
int n = 2, m = 2, d = 1, next = 4, i = 1;
do {
if (++i == next) {
m = n;
next <<= 1;
}
if ((n = (int) (((long) n * n + c) % x)) == m) return pollardRho(x, ++c); // 失敗したので
} while ((d = gcd(Math.abs(n - m), x)) == 1);// dは約数の一つ
return d;
}
@Override
public int intValue() {
return prime;
}
@Override
public long longValue() {
return prime;
}
@Override
public float floatValue() {
return prime;
}
@Override
public double doubleValue() {
return prime;
}
@Override
public boolean equals(final Object o) {
return o instanceof Prime ? ((Prime) o).prime == prime : false;
}
@Override
public int hashCode() {
return prime;
}
@Override
public String toString() {
return String.valueOf(prime);
}
}
public static class AbstractArray<T> extends AbstractList<T> implements RandomAccess {
private final Object[] array;
public AbstractArray(final int size) {
array = new Object[size];
}
public AbstractArray(final T[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 0, array.length);
}
@Override
public T set(final int index, final T element) {
final T ret = get(index);
array[index] = element;
return ret;
}
@Override
public T get(final int index) {
@SuppressWarnings("unchecked")
final T ret = (T) array[index];
return ret;
}
public Object[] get() {
return array;
}
public T[] get(final T[] array) {
if (array.length < this.array.length) {
@SuppressWarnings("unchecked")
final T[] ret = (T[]) Arrays.copyOfRange(this.array, 0, this.array.length, array.getClass());
return ret;
}
System.arraycopy(this.array, 0, array, 0, this.array.length);
return array;
}
@Override
public int size() {
return array.length;
}
public int length() {
return size();
}
@Override
public int hashCode() {
return Arrays.hashCode(array);
}
private class Iter implements Iterator<T> {
private int index;
private Iter() {
index = 0;
}
@Override
public boolean hasNext() {
return index < array.length;
}
@Override
public T next() {
return get(index++);
}
@Override
public void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<T> iterator() {
return new Iter();
}
}
public static class Array<T> extends AbstractArray<T> implements Serializable {
private static final long serialVersionUID = 2749604433067098063L;
public Array(final int size) {
super(size);
}
public Array(final T[] array) {
super(array);
}
public T front() {
return get(0);
}
public T back() {
return get(size() - 1);
}
}
/**
* 要素とそのindexを管理するクラスです。
*
* @author 31536000
*
* @param <E> 保持する要素
*/
public static class Enumerate<E> {
public final E value;
public final int index;
/**
* 要素とそのindexを渡します。<br>
* indexは必ずしも元の配列またはコレクションのindexと一致する必要はありませんが、一致する値を返すことが推奨されます。
*
* @param value
* @param index
*/
public Enumerate(final E value, final int index) {
this.value = value;
this.index = index;
}
/**
* 要素を返します。
*
* @return 要素
*/
public E getValue() { return value; }
/**
* indexを返します。
*
* @return index
*/
public int getIndex() { return index; }
@Override
public boolean equals(final Object o) {
if (o instanceof Enumerate)
return ((Enumerate<?>) o).getValue().equals(value) && ((Enumerate<?>) o).getIndex() == index;
return false;
}
@Override
public int hashCode() {
return value.hashCode() ^ index;
}
@Override
public String toString() {
return "{" + value.toString() + ", " + index + "}";
}
}
/**
* 要素とそのindexを効率的に取得する関数を提供します。
*
* @author 31536000
*
*/
public static class Enumeration {
private static class IteratorArray<E> implements Iterator<Enumerate<E>> {
private final E[] array;
private final int start;
private int index;
public IteratorArray(final E[] array, final int index) {
this.array = array;
this.start = index;
this.index = 0;
}
@Override
public boolean hasNext() {
return index < array.length;
}
@Override
public Enumerate<E> next() {
final Enumerate<E> ret = new Enumerate<>(array[index], index++ + start);
return ret;
}
}
private static class IteratorCollection<E> implements Iterator<Enumerate<E>> {
private final Iterator<E> iter;
private int start;
public IteratorCollection(final Iterator<E> iter, final int index) {
this.iter = iter;
this.start = index;
}
@Override
public boolean hasNext() {
return iter.hasNext();
}
@Override
public Enumerate<E> next() {
final Enumerate<E> ret = new Enumerate<>(iter.next(), start++);
return ret;
}
}
/**
* 配列の各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> 配列の型
* @param array 配列
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final E[] array) {
return enumerate(array, 0);
}
/**
* 配列の各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> 配列の型
* @param array 配列
* @param start 添字の初期値、この値だけindexが足されたものが返る
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final E[] array, final int start) {
if (array == null) throw new NullPointerException("array is null");
return new IteratorArray<>(array, start);
}
/**
* Iteratorの各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> Iteratorの型
* @param iter Iterator
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final Iterator<E> iter) {
return enumerate(iter, 0);
}
/**
* Iteratorの各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> Iteratorの型
* @param iter Iterator
* @param start 添字の初期値、この値だけindexが足されたものが返る
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final Iterator<E> iter, final int start) {
if (iter == null) throw new NullPointerException("iterator is null");
return new IteratorCollection<>(iter, start);
}
}
/**
* このクラスは配列に対する様々な操作を提供します。
* @author 31536000
*
*/
public static class ArrayUtility {
private ArrayUtility() {
throw new AssertionError();
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static int[] create(int length, java.util.function.IntUnaryOperator init) {
int[] ret = new int[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsInt(i);
return ret;
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static long[] create(int length, java.util.function.LongUnaryOperator init) {
long[] ret = new long[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsLong(i);
return ret;
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static double[] create(int length, java.util.function.DoubleUnaryOperator init) {
double[] ret = new double[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsDouble(i);
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static boolean[] add(boolean[] array, boolean element) {
if (array == null) {
boolean[] ret = { element };
return ret;
}
boolean[] ret = new boolean[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static byte[] add(byte[] array, byte element) {
if (array == null) {
byte[] ret = { element };
return ret;
}
byte[] ret = new byte[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static short[] add(short[] array, short element) {
if (array == null) {
short[] ret = { element };
return ret;
}
short[] ret = new short[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static int[] add(int[] array, int element) {
if (array == null) {
int[] ret = { element };
return ret;
}
int[] ret = new int[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static long[] add(long[] array, long element) {
if (array == null) {
long[] ret = { element };
return ret;
}
long[] ret = new long[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static float[] add(float[] array, float element) {
if (array == null) {
float[] ret = { element };
return ret;
}
float[] ret = new float[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static double[] add(double[] array, double element) {
if (array == null) {
double[] ret = { element };
return ret;
}
double[] ret = new double[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static char[] add(char[] array, char element) {
if (array == null) {
char[] ret = { element };
return ret;
}
char[] ret = new char[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static <T> T[] add(T[] array, T element) {
if (array == null) { return addAll(array, element); }
@SuppressWarnings("unchecked")
T[] ret = (T[]) java.util.Arrays.copyOfRange(array, 0, array.length + 1, array.getClass());
ret[array.length] = element;
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static boolean[] addAll(boolean[] array, boolean... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
boolean[] ret = new boolean[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static byte[] addAll(byte[] array, byte... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
byte[] ret = new byte[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static short[] addAll(short[] array, short... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
short[] ret = new short[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static int[] addAll(int[] array, int... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
int[] ret = new int[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static long[] addAll(long[] array, long... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
long[] ret = new long[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static float[] addAll(float[] array, float... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
float[] ret = new float[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static double[] addAll(double[] array, double... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
double[] ret = new double[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static char[] addAll(char[] array, char... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
char[] ret = new char[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
@SafeVarargs
public static <T> T[] addAll(T[] array, T... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
@SuppressWarnings("unchecked")
T[] ret = (T[]) java.util.Arrays.copyOfRange(array, 0, array.length + array2.length, array.getClass());
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(boolean[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(boolean[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(boolean[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(byte[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(byte[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(byte[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(short[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(short[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(short[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(int[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(int[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(int[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(long[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(long[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(long[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(float[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(float[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(float[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(double[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(double[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(double[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(char[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(char[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(char[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(Object[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(Object[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(Object[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
private static java.util.Random rnd;
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(boolean[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(boolean[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(boolean[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(boolean[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(boolean[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(boolean[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(byte[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(byte[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(byte[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(byte[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(byte[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(byte[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(short[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(short[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(short[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(short[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(short[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(short[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(int[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(int[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(int[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(int[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(int[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(int[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(long[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(long[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(long[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(long[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(long[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(long[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(float[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(float[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(float[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(float[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(float[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(float[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(double[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(double[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(double[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(double[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(double[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(double[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(char[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(char[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(char[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(char[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(char[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(char[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(Object[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(Object[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(Object[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(Object[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(Object[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(Object[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static boolean[] getArray(int size, boolean value) {
boolean[] ret = new boolean[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static byte[] getArray(int size, byte value) {
byte[] ret = new byte[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static short[] getArray(int size, short value) {
short[] ret = new short[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static int[] getArray(int size, int value) {
int[] ret = new int[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static long[] getArray(int size, long value) {
long[] ret = new long[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static float[] getArray(int size, float value) {
float[] ret = new float[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static double[] getArray(int size, double value) {
double[] ret = new double[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static char[] getArray(int size, char value) {
char[] ret = new char[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Boolean[] toObject(boolean[] array) {
if (array == null) return null;
Boolean[] ret = new Boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Byte[] toObject(byte[] array) {
if (array == null) return null;
Byte[] ret = new Byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Short[] toObject(short[] array) {
if (array == null) return null;
Short[] ret = new Short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Integer[] toObject(int[] array) {
if (array == null) return null;
Integer[] ret = new Integer[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Long[] toObject(long[] array) {
if (array == null) return null;
Long[] ret = new Long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Float[] toObject(float[] array) {
if (array == null) return null;
Float[] ret = new Float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Double[] toObject(double[] array) {
if (array == null) return null;
Double[] ret = new Double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Character[] toObject(char[] array) {
if (array == null) return null;
Character[] ret = new Character[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static boolean[] toPrimitive(Boolean[] array) {
if (array == null) return null;
boolean[] ret = new boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static boolean[] toPrimitive(Boolean[] array, boolean valueForNull) {
if (array == null) return null;
boolean[] ret = new boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static byte[] toPrimitive(Byte[] array) {
if (array == null) return null;
byte[] ret = new byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static byte[] toPrimitive(Byte[] array, byte valueForNull) {
if (array == null) return null;
byte[] ret = new byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static short[] toPrimitive(Short[] array) {
if (array == null) return null;
short[] ret = new short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static short[] toPrimitive(Short[] array, short valueForNull) {
if (array == null) return null;
short[] ret = new short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static int[] toPrimitive(Integer[] array) {
if (array == null) return null;
int[] ret = new int[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static int[] toPrimitive(Integer[] array, int valueForNull) {
if (array == null) return null;
int[] ret = new int[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static long[] toPrimitive(Long[] array) {
if (array == null) return null;
long[] ret = new long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static long[] toPrimitive(Long[] array, long valueForNull) {
if (array == null) return null;
long[] ret = new long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static float[] toPrimitive(Float[] array) {
if (array == null) return null;
float[] ret = new float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static float[] toPrimitive(Float[] array, float valueForNull) {
if (array == null) return null;
float[] ret = new float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static double[] toPrimitive(Double[] array) {
if (array == null) return null;
double[] ret = new double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static double[] toPrimitive(Double[] array, double valueForNull) {
if (array == null) return null;
double[] ret = new double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static char[] toPrimitive(Character[] array) {
if (array == null) return null;
char[] ret = new char[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static char[] toPrimitive(Character[] array, char valueForNull) {
if (array == null) return null;
char[] ret = new char[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最小値
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> T min(T[] array, java.util.Comparator<T> comparator) {
if (array == null || array.length == 0) return null;
T min = array[0];
for (int i = 1; i < array.length; ++i) if (comparator.compare(min, array[i]) > 0) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static <T extends Comparable<T>> T min(T[] array) {
return min(array, java.util.Comparator.naturalOrder());
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static byte min(byte[] array) {
byte min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static short min(short[] array) {
short min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static int min(int[] array) {
int min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static long min(long[] array) {
long min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static float min(float[] array) {
float min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static double min(double[] array) {
double min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最小値
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> T max(T[] array, java.util.Comparator<T> comparator) {
if (array == null || array.length == 0) return null;
T max = array[0];
for (int i = 1; i < array.length; ++i) if (comparator.compare(max, array[i]) < 0) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
*/
public static <T extends Comparable<T>> T max(T[] array) {
return max(array, java.util.Comparator.naturalOrder());
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static byte max(byte[] array) {
byte max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static short max(short[] array) {
short max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static int max(int[] array) {
int max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static long max(long[] array) {
long max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static float max(float[] array) {
float max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static double max(double[] array) {
double max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(boolean[] array, int n, int m) {
boolean swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(byte[] array, int n, int m) {
byte swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(short[] array, int n, int m) {
short swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(int[] array, int n, int m) {
int swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(long[] array, int n, int m) {
long swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(float[] array, int n, int m) {
float swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(double[] array, int n, int m) {
double swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(char[] array, int n, int m) {
char swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(Object[] array, int n, int m) {
Object swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static <T extends Comparable<T>> boolean nextPermutation(T[] array) {
return nextPermutation(array, java.util.Comparator.naturalOrder());
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列を書き換えたならばtrue
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> boolean nextPermutation(T[] array, java.util.Comparator<T> comparator) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (comparator.compare(array[change], array[change + 1]) < 0) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0)
if (comparator.compare(array[change], array[mid = min + halfDiff]) < 0) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(byte[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(short[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(int[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(long[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(float[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(double[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(char[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static <T extends Comparable<T>> boolean prevPermutation(T[] array) {
return prevPermutation(array, java.util.Comparator.naturalOrder());
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列を書き換えたならばtrue
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> boolean prevPermutation(T[] array, java.util.Comparator<T> comparator) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (comparator.compare(array[change], array[change + 1]) > 0) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0)
if (comparator.compare(array[change], array[mid = min + halfDiff]) > 0) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(byte[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(short[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(int[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(long[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(float[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(double[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(char[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static <T> T[] map(T[] array, java.util.function.UnaryOperator<T> map) {
T[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.apply(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static int[] map(int[] array, java.util.function.IntUnaryOperator map) {
int[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsInt(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static long[] map(long[] array, java.util.function.LongUnaryOperator map) {
long[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsLong(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static double[] map(double[] array, java.util.function.DoubleUnaryOperator map) {
double[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsDouble(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @param generator 新しい配列を生成するための関数、U::newを引数に取る
* @return 配列の各要素にmapを適用した配列
*/
public static <T, U> U[] map(T[] array, java.util.function.Function<T, U> map,
java.util.function.IntFunction<U[]> generator) {
U[] ret = generator.apply(array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.apply(array[i]);
return ret;
}
/**
* 配列を昇順にソートします。
* @complexity O(array.length)
* @param array 配列
*/
public static void sort(final byte[] array) {
if (array.length < 128) {
for (int i = 0, j; i < array.length; ++i) {
byte tmp = array[i], tmp2;
for (j = i; j > 0 && (tmp2 = array[j - 1]) > tmp; --j) array[j] = tmp2;
array[j] = tmp;
}
return;
}
int[] count = new int[256];
for (byte i : array) ++count[i & 0xff];
for (int i = 0, j = 0; j < count.length; ++j) java.util.Arrays.fill(array, i, i += count[j], (byte) j);
}
/**
* 配列を昇順にソートします。
* @complexity O(toIndex-fromIndex)
* @param array 配列
*/
public static void sort(final byte[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 128) {
for (int i = fromIndex, j; i < toIndex; ++i) {
byte tmp = array[i], tmp2;
for (j = i; j > fromIndex && (tmp2 = array[j - 1]) > tmp; --j) array[j] = tmp2;
array[j] = tmp;
}
return;
}
int[] count = new int[256];
for (int i = fromIndex; i < toIndex; ++i) ++count[array[i] & 0xff];
for (int i = fromIndex, j = 0; j < count.length; ++j)
java.util.Arrays.fill(array, i, i += count[j], (byte) j);
}
/**
* 配列を昇順にソートします。
* @complexity O(range.getDistance())
* @param array 配列
*/
public static void sort(final byte[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final short[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new short[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final short[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new short[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final short[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(short[] a, final int from, final int to, final int l, final short[] bucket) {
final int BUCKET_SIZE = 256;
final int SHORT_RECURSION = 2;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(a[i] >>> shift & MASK) + 1];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = a[i] >>> shift & MASK;
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < SHORT_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final int[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new int[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final int[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new int[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final int[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(int[] a, final int from, final int to, final int l, final int[] bucket) {
final int BUCKET_SIZE = 256;
final int INT_RECURSION = 4;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(a[i] >>> shift & MASK) + 1];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = a[i] >>> shift & MASK;
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < INT_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final long[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new long[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final long[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new long[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final long[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(long[] a, final int from, final int to, final int l, final long[] bucket) {
final int BUCKET_SIZE = 256;
final int LONG_RECURSION = 8;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(int) ((a[i] >>> shift & MASK) + 1)];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = (int) (a[i] >>> shift & MASK);
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < LONG_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static int[] compress(int[] array) {
int[] ret = new int[array.length];
int[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
int comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static int[] compress(long[] array) {
int[] ret = new int[array.length];
long[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
long comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static <T extends Comparable<T>> int[] compress(T[] array) {
int[] ret = new int[array.length];
T[] copy = java.util.Arrays.copyOf(array, array.length);
java.util.Arrays.sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
T comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid].compareTo(comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @param comparator 比較関数
* @return arrayを座標圧縮した配列
*/
public static <T> int[] compress(T[] array, java.util.Comparator<T> comparator) {
int[] ret = new int[array.length];
T[] copy = java.util.Arrays.copyOf(array, array.length);
java.util.Arrays.sort(copy, comparator);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (!copy[len - 1].equals(copy[j])) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
T comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (comparator.compare(copy[mid], comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]<list[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]==list[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nをリスト長として O(N log N)
* @param list 座標圧縮を行うリスト
* @return listを座標圧縮した配列
* @throws NullPointerException listがnullの場合
*/
public static <T extends Comparable<T>> int[] compress(java.util.List<T> list) {
int size = list.size();
int[] ret = new int[size];
java.util.ArrayList<T> copy = new java.util.ArrayList<>(list);
copy.sort(java.util.Comparator.naturalOrder());
int len = 1;
for (int j = 1; j < size; ++j) {
if (!copy.get(len - 1).equals(copy.get(j))) copy.set(len++, copy.get(j));
}
java.util.Iterator<T> iter = list.iterator();
for (int i = 0; i < size; ++i) {
int min = 0, max = len;
T comp = iter.next();
while (max - min > 1) {
int mid = min + max >> 1;
if (copy.get(mid).compareTo(comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]<list[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]==list[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nをリスト長として O(N log N)
* @param list 座標圧縮を行うリスト
* @param comparator 比較関数
* @return listを座標圧縮した配列
*/
public static <T> int[] compress(java.util.List<T> list, java.util.Comparator<T> comparator) {
int[] ret = new int[list.size()];
java.util.ArrayList<T> copy = new java.util.ArrayList<>(list);
copy.sort(comparator);
int[] bit = new int[list.size() + 1];
java.util.Iterator<T> iter = list.iterator();
for (int i = 0; i < list.size(); ++i) {
int min = 0, max = list.size();
T comp = iter.next();
while (max - min > 1) {
int mid = min + max >> 1;
if (comparator.compare(copy.get(mid), comp) <= 0) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ret[i] += bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ret;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(int[] array) {
if (array == null) return 0;
int[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int[] bit = new int[array.length + 1];
long ans = (long) array.length * (array.length - 1) >> 1;
for (int i = 0; i < array.length; ++i) {
int min = 0, max = array.length;
int comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(long[] array) {
if (array == null) return 0;
long[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int[] bit = new int[array.length + 1];
long ans = (long) array.length * (array.length - 1) >> 1;
for (int i = 0; i < array.length; ++i) {
int min = 0, max = array.length;
long comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(char[] array) {
if (array == null) return 0;
int[] a = new int[array.length];
for (int i = 0;i < array.length;++ i) a[i] = array[i];
return inversionNumber(a);
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(String array) {
if (array == null) return 0;
return inversionNumber(array.toCharArray());
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(int[] src, int[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
int[] copySrc = java.util.Arrays.copyOf(src, src.length),
copyDest = java.util.Arrays.copyOf(dest, dest.length);
sort(copySrc);
sort(copyDest);
if (!java.util.Arrays.equals(copySrc, copyDest)) return -1;
int[] key = new int[dest.length];
for (int i = 0; i < dest.length; ++i) {
int min = -1, max = dest.length;
int comp = dest[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copyDest[mid] < comp) min = mid;
else max = mid;
}
key[max] = i;
copyDest[max] = max == 0 ? Integer.MIN_VALUE : copyDest[max - 1];
}
int[] bit = new int[src.length + 1];
long ans = (long) src.length * (src.length - 1) >> 1;
for (int i = 0; i < src.length; ++i) {
int min = -1, max = src.length;
int comp = src[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copySrc[mid] < comp) min = mid;
else max = mid;
}
copySrc[max] = max == 0 ? Integer.MIN_VALUE : copySrc[max - 1];
max = key[max] + 1;
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(long[] src, long[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
long[] copySrc = java.util.Arrays.copyOf(src, src.length),
copyDest = java.util.Arrays.copyOf(dest, dest.length);
sort(copySrc);
sort(copyDest);
if (!java.util.Arrays.equals(copySrc, copyDest)) return -1;
int[] key = new int[dest.length];
for (int i = 0; i < dest.length; ++i) {
int min = -1, max = dest.length;
long comp = dest[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copyDest[mid] < comp) min = mid;
else max = mid;
}
key[max] = i;
copyDest[max] = max == 0 ? Integer.MIN_VALUE : copyDest[max - 1];
}
int[] bit = new int[src.length + 1];
long ans = (long) src.length * (src.length - 1) >> 1;
for (int i = 0; i < src.length; ++i) {
int min = -1, max = src.length;
long comp = src[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copySrc[mid] < comp) min = mid;
else max = mid;
}
copySrc[max] = max == 0 ? Integer.MIN_VALUE : copySrc[max - 1];
max = key[max] + 1;
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(char[] src, char[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
int[] a = new int[src.length];
for (int i = 0;i < src.length;++ i) a[i] = src[i];
int[] b = new int[dest.length];
for (int i = 0;i < dest.length;++ i) b[i] = dest[i];
return inversionDistance(a, b);
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(String src, String dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
return inversionDistance(src.toCharArray(), dest.toCharArray());
}
}
}
class ACL {
public static final class DisjointSetUnion {
private final int[] parent;
private DisjointSetUnion(final int n) {
parent = new int[n];
java.util.Arrays.fill(parent, -1);
}
public static DisjointSetUnion create(final int n) {
return new DisjointSetUnion(n);
}
public int getLeader(int a) {
int p1, p2;
while ((p1 = parent[a]) >= 0) {
if ((p2 = parent[p1]) >= 0) a = parent[a] = p2;
else return p1;
}
return a;
}
public int merge(int a, int b) {
a = getLeader(a);
b = getLeader(b);
if (a == b) return a;
if (parent[a] < parent[b]) {
parent[b] += parent[a];
parent[a] = b;
return b;
}
parent[a] += parent[b];
parent[b] = a;
return a;
}
public boolean isSame(final int a, final int b) {
return getLeader(a) == getLeader(b);
}
public int getSize(final int a) {
return -parent[getLeader(a)];
}
public java.util.ArrayList<java.util.ArrayList<Integer>> getGroups() {
final Object[] group = new Object[parent.length];
final java.util.ArrayList<java.util.ArrayList<Integer>> ret = new java.util.ArrayList<>();
for (int i = 0; i < parent.length; ++i) {
final int leader = getLeader(i);
final Object put = group[leader];
if (put == null) {
final java.util.ArrayList<Integer> list = new java.util.ArrayList<>();
list.add(i);
ret.add(list);
group[leader] = list;
} else {
@SuppressWarnings("unchecked")
final java.util.ArrayList<Integer> list = (java.util.ArrayList<Integer>) put;
list.add(i);
}
}
return ret;
}
@Override
public String toString() {
return getGroups().toString();
}
}
public static final class IntFenwickTree {
private final int[] array;
private IntFenwickTree(final int n) {
array = new int[n + 1];
}
private IntFenwickTree(final int[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 1, array.length);
for (int i = 1; i < this.array.length; ++i)
if (i + (i & -i) < this.array.length) this.array[i + (i & -i)] += this.array[i];
}
public static IntFenwickTree create(final int n) {
return new IntFenwickTree(n);
}
public static IntFenwickTree create(final int[] array) {
return new IntFenwickTree(array);
}
public void add(int index, final int add) {
++index;
while (index < array.length) {
array[index] += add;
index += index & -index;
}
}
private int sum(int index) {
int sum = 0;
while (index > 0) {
sum += array[index];
index -= index & -index;
}
return sum;
}
public int sum(final int l, final int r) {
return sum(r) - sum(l);
}
@Override
public String toString() {
return java.util.stream.IntStream.range(0, array.length - 1)
.mapToObj(i -> String.valueOf(sum(i + 1) - sum(i)))
.collect(java.util.stream.Collectors.joining(", ", "[", "]"));
}
}
public static final class LongFenwickTree {
private final long[] array;
private LongFenwickTree(final int n) {
array = new long[n + 1];
}
private LongFenwickTree(final long[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 1, array.length);
for (int i = 1; i < this.array.length; ++i)
if (i + (i & -i) < this.array.length) this.array[i + (i & -i)] += this.array[i];
}
public static LongFenwickTree create(final int n) {
return new LongFenwickTree(n);
}
public static LongFenwickTree create(final long[] array) {
return new LongFenwickTree(array);
}
public void add(int index, final long add) {
++index;
while (index < array.length) {
array[index] += add;
index += index & -index;
}
}
private long sum(int index) {
long sum = 0;
while (index > 0) {
sum += array[index];
index -= index & -index;
}
return sum;
}
public long sum(final int l, final int r) {
return sum(r) - sum(l);
}
@Override
public String toString() {
return java.util.stream.IntStream.range(0, array.length - 1)
.mapToObj(i -> String.valueOf(sum(i + 1) - sum(i)))
.collect(java.util.stream.Collectors.joining(", ", "[", "]"));
}
}
public static final class MathLib {
public static class Barrett {
private final int mod;
private final long h, l;
private final long MAX = 1L << 62;
private final int MASK = (1 << 31) - 1;
Barrett(final int mod) {
this.mod = mod;
final long t = MAX / mod;
h = t >>> 31;
l = t & MASK;
}
int reduce(final long x) {
final long xh = x >>> 31, xl = x & MASK;
long z = xl * l;
z = xl * h + xh * l + (z >>> 31);
z = xh * h + (z >>> 31);
final int ret = (int) (x - z * mod);
return ret >= mod ? ret - mod : ret;
}
}
public static class BarrettSmall {
private final int mod;
final long t;
BarrettSmall(final int mod) {
this.mod = mod;
t = (1L << 42) / mod;
}
int reduce(long x) {
long q = x * t >> 42;
x -= q * mod;
return (int) (x >= mod ? x - mod : x);
}
}
private static long safe_mod(long x, final long m) {
x %= m;
if (x < 0) x += m;
return x;
}
private static long[] inv_gcd(long a, final long b) {
a = safe_mod(a, b);
if (a == 0) return new long[] { b, 0 };
long s = b, t = a;
long m0 = 0, m1 = 1;
while (t > 0) {
final long u = s / t;
s -= t * u;
m0 -= m1 * u;
long tmp = s;
s = t;
t = tmp;
tmp = m0;
m0 = m1;
m1 = tmp;
}
if (m0 < 0) m0 += b / s;
return new long[] { s, m0 };
}
public static int pow(long n, long m, final int mod) {
assert m >= 0 && mod >= 1;
if (mod == 1) return 0;
return pow(n, m, new Barrett(mod));
}
public static int pow(long n, long m, Barrett mod) {
assert m >= 0;
long ans = 1, num = n % mod.mod;
while (m != 0) {
if ((m & 1) != 0) ans = mod.reduce(ans * num);
m >>>= 1;
num = mod.reduce(num * num);
}
return (int) ans;
}
public static int pow998_244_353(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 998_244_353;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 998_244_353;
m >>>= 1;
num = num * num % 998_244_353;
}
return (int) ans;
}
public static int pow167_772_161(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 167_772_161;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 167_772_161;
m >>>= 1;
num = num * num % 167_772_161;
}
return (int) ans;
}
public static int pow469_762_049(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 469_762_049;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 469_762_049;
m >>>= 1;
num = num * num % 469_762_049;
}
return (int) ans;
}
public static int pow1_000_000_007(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 1_000_000_007;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 1_000_000_007;
m >>>= 1;
num = num * num % 1_000_000_007;
}
return (int) ans;
}
public static int pow(long n, long m, BarrettSmall mod) {
assert m >= 0;
long ans = 1, num = n % mod.mod;
while (m != 0) {
if ((m & 1) != 0) ans = mod.reduce(ans * num);
m >>>= 1;
num = mod.reduce(num * num);
}
return (int) ans;
}
public static long[] crt(final long[] r, final long[] m) {
assert r.length == m.length;
final int n = r.length;
long r0 = 0, m0 = 1;
for (int i = 0; i < n; i++) {
assert 1 <= m[i];
long r1 = safe_mod(r[i], m[i]), m1 = m[i];
if (m0 < m1) {
long tmp = r0;
r0 = r1;
r1 = tmp;
tmp = m0;
m0 = m1;
m1 = tmp;
}
if (m0 % m1 == 0) {
if (r0 % m1 != r1) return new long[] { 0, 0 };
continue;
}
final long[] ig = inv_gcd(m0, m1);
final long g = ig[0], im = ig[1];
final long u1 = m1 / g;
if ((r1 - r0) % g != 0) return new long[] { 0, 0 };
final long x = (r1 - r0) / g % u1 * im % u1;
r0 += x * m0;
m0 *= u1;
if (r0 < 0) r0 += m0;
// System.err.printf("%d %d\n", r0, m0);
}
return new long[] { r0, m0 };
}
public static long floor_sum(final long n, final long m, long a, long b) {
long ans = 0;
if (a >= m) {
ans += (n - 1) * n * (a / m) / 2;
a %= m;
}
if (b >= m) {
ans += n * (b / m);
b %= m;
}
final long y_max = (a * n + b) / m;
final long x_max = y_max * m - b;
if (y_max == 0) return ans;
ans += (n - (x_max + a - 1) / a) * y_max;
ans += floor_sum(y_max, a, m, (a - x_max % a) % a);
return ans;
}
/**
* aとbの最大公約数を返します。
* @param a 整数
* @param b 整数
* @return 最大公約数
*/
public static int gcd(int a, int b) {
while (a != 0) if ((b %= a) != 0) a %= b;
else return a;
return b;
}
/**
* 配列全ての値の最大公約数を返します。
* @param array 配列
* @return 最大公約数
*/
public static int gcd(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = gcd(ret, array[i]);
return ret;
}
/**
* aとbの最大公約数を返します。
* @param a 整数
* @param b 整数
* @return 最大公約数
*/
public static long gcd(long a, long b) {
while (a != 0) if ((b %= a) != 0) a %= b;
else return a;
return b;
}
/**
* 配列全ての値の最大公約数を返します。
* @param array 配列
* @return 最大公約数
*/
public static long gcd(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = gcd(ret, array[i]);
return ret;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param a 整数
* @param b 整数
* @return 最小公倍数
*/
public static long lcm(int a, int b) {
return a / gcd(a, b) * (long) b;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param a 整数
* @param b 整数
* @return 最小公倍数
*/
public static long lcm(long a, long b) {
return a / gcd(a, b) * b;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param array 配列
* @return 最小公倍数
*/
public static long lcm(int... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = lcm(ret, array[i]);
return ret;
}
/**
* aとbのうち、小さい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち小さい方の値
*/
public static int min(int a, int b) {
return a < b ? a : b;
}
/**
* 配列の中で最小の値を返します。
* @param array 配列
* @return 配列の中で最小の値
*/
public static int min(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = min(ret, array[i]);
return ret;
}
/**
* aとbのうち、小さい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち小さい方の値
*/
public static long min(long a, long b) {
return a < b ? a : b;
}
/**
* 配列の中で最小の値を返します。
* @param array 配列
* @return 配列の中で最小の値
*/
public static long min(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = min(ret, array[i]);
return ret;
}
/**
* aとbのうち、大きい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち大きい方の値
*/
public static int max(int a, int b) {
return a > b ? a : b;
}
/**
* 配列の中で最大の値を返します。
* @param array 配列
* @return 配列の中で最大の値
*/
public static int max(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = max(ret, array[i]);
return ret;
}
/**
* aとbのうち、大きい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち大きい方の値
*/
public static long max(long a, long b) {
return a > b ? a : b;
}
/**
* 配列の中で最大の値を返します。
* @param array 配列
* @return 配列の中で最大の値
*/
public static long max(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = max(ret, array[i]);
return ret;
}
/**
* 配列の値の合計を返します。
* @param array 配列
* @return 配列の値の総和
*/
public static long sum(int... array) {
long ret = 0;
for (int i : array) ret += i;
return ret;
}
/**
* 配列の値の合計を返します。
* @param array 配列
* @return 配列の値の総和
*/
public static long sum(long... array) {
long ret = 0;
for (long i : array) ret += i;
return ret;
}
/**
* 二項係数を列挙した配列を返します。
* @param l 左辺
* @param r 右辺
* @return 0≦i≦l及び0≦j≦rを満たす全てのi, jに対してi choose jを求めた配列
*/
public static long[][] combination(int l, int r) {
long[][] pascal = new long[l + 1][r + 1];
pascal[0][0] = 1;
for (int i = 1; i <= l; ++i) {
pascal[i][0] = 1;
for (int j = 1; j <= r; ++j) {
pascal[i][j] = pascal[i - 1][j - 1] + pascal[i - 1][j];
}
}
return pascal;
}
/**
* 二分探索を行い、func(x) != func(x+1)となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+1)となるような数x
*/
public static int binarySearch(int isTrue, int isFalse, java.util.function.IntPredicate func) {
if (isTrue <= isFalse) {
int halfDiff = isFalse - isTrue >> 1, mid = isTrue + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isFalse - isTrue >> 1;
mid = isTrue + halfDiff;
}
return isTrue;
} else {
int halfDiff = isTrue - isFalse >> 1, mid = isFalse + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isTrue - isFalse >> 1;
mid = isFalse + halfDiff;
}
return isFalse;
}
}
/**
* 二分探索を行い、func(x) != func(x+1)となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+1)となるような数x
*/
public static long binarySearch(long isTrue, long isFalse, java.util.function.LongPredicate func) {
if (isTrue <= isFalse) {
long halfDiff = isFalse - isTrue >> 1, mid = isTrue + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isFalse - isTrue >> 1;
mid = isTrue + halfDiff;
}
return isTrue;
} else {
long halfDiff = isTrue - isFalse >> 1, mid = isFalse + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isTrue - isFalse >> 1;
mid = isFalse + halfDiff;
}
return isFalse;
}
}
/**
* 二分探索を行い、func(x) != func(x+Math.nextUp(x))となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+Math.nextUp(x))となるような数x
*/
public static double binarySearch(double isTrue, double isFalse, java.util.function.DoublePredicate func) {
return Double.longBitsToDouble(binarySearch(Double.doubleToRawLongBits(isTrue), Double.doubleToRawLongBits(isFalse), (long i) -> func.test(Double.longBitsToDouble(i))));
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> double find_minimal(double min, double max, int loop, java.util.function.DoubleFunction<T> func) {
return find_minimal(min, max, loop, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> double find_minimal(double min, double max, int loop, java.util.function.DoubleFunction<T> func, java.util.Comparator<T> comparator) {
double phi = (1 + Math.sqrt(5)) / 2;
for (int i = 0;i < loop;++ i) {
double mid_min = (min * phi + max) / (1 + phi), mid_max = (min + max * phi) / (1 + phi);
T mid_min_calc = func.apply(mid_min), mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) max = mid_max;
else min = mid_min;
}
return min;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> double find_maximal(double min, double max, int loop, java.util.function.DoubleFunction<T> func) {
return find_maximal(min, max, loop, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> double find_maximal(double min, double max, int loop, java.util.function.DoubleFunction<T> func, java.util.Comparator<T> comparator) {
if (max <= min) throw new IllegalArgumentException("empty range");
double phi = (1 + Math.sqrt(5)) / 2;
for (int i = 0;i < loop;++ i) {
double mid_min = (min * phi + max) / (1 + phi), mid_max = (min + max * phi) / (1 + phi);
T mid_min_calc = func.apply(mid_min), mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) max = mid_max;
else min = mid_min;
}
return min;
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> int find_minimal(int min, int max, java.util.function.IntFunction<T> func) {
return find_minimal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> int find_minimal(int min, int max, java.util.function.IntFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
int range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
int fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
int mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> int find_maximal(int min, int max, java.util.function.IntFunction<T> func) {
return find_maximal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> int find_maximal(int min, int max, java.util.function.IntFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
int range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
int fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
int mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> long find_minimal(long min, long max, java.util.function.LongFunction<T> func) {
return find_minimal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> long find_minimal(long min, long max, java.util.function.LongFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
long range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
long fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
long mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> long find_maximal(long min, long max, java.util.function.LongFunction<T> func) {
return find_maximal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> long find_maximal(long min, long max, java.util.function.LongFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
long range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
long fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
long mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_d
*/
public static final class MaxFlow {
private static final class InternalCapEdge {
final int to;
final int rev;
long cap;
InternalCapEdge(int to, int rev, long cap) {
this.to = to;
this.rev = rev;
this.cap = cap;
}
}
public static final class CapEdge {
public final int from, to;
public final long cap, flow;
CapEdge(int from, int to, long cap, long flow) {
this.from = from;
this.to = to;
this.cap = cap;
this.flow = flow;
}
@Override
public boolean equals(Object o) {
if (o instanceof CapEdge) {
CapEdge e = (CapEdge) o;
return from == e.from && to == e.to && cap == e.cap && flow == e.flow;
}
return false;
}
}
private static final class IntPair {
final int first, second;
IntPair(int first, int second) {
this.first = first;
this.second = second;
}
}
static final long INF = Long.MAX_VALUE;
private final int n;
private final java.util.ArrayList<IntPair> pos;
private final java.util.ArrayList<InternalCapEdge>[] g;
@SuppressWarnings("unchecked")
public MaxFlow(int n) {
this.n = n;
pos = new java.util.ArrayList<>();
g = new java.util.ArrayList[n];
for (int i = 0; i < n; i++) {
g[i] = new java.util.ArrayList<>();
}
}
public int addEdge(int from, int to, long cap) {
rangeCheck(from, 0, n);
rangeCheck(to, 0, n);
nonNegativeCheck(cap, "Capacity");
int m = pos.size();
pos.add(new IntPair(from, g[from].size()));
int fromId = g[from].size();
int toId = g[to].size();
if (from == to) toId++;
g[from].add(new InternalCapEdge(to, toId, cap));
g[to].add(new InternalCapEdge(from, fromId, 0L));
return m;
}
private InternalCapEdge getInternalEdge(int i) {
return g[pos.get(i).first].get(pos.get(i).second);
}
private InternalCapEdge getInternalEdgeReversed(InternalCapEdge e) {
return g[e.to].get(e.rev);
}
public CapEdge getEdge(int i) {
int m = pos.size();
rangeCheck(i, 0, m);
InternalCapEdge e = getInternalEdge(i);
InternalCapEdge re = getInternalEdgeReversed(e);
return new CapEdge(re.to, e.to, e.cap + re.cap, re.cap);
}
public CapEdge[] getEdges() {
CapEdge[] res = new CapEdge[pos.size()];
java.util.Arrays.setAll(res, this::getEdge);
return res;
}
public void changeEdge(int i, long newCap, long newFlow) {
int m = pos.size();
rangeCheck(i, 0, m);
nonNegativeCheck(newCap, "Capacity");
if (newFlow > newCap) {
throw new IllegalArgumentException(
String.format("Flow %d is greater than the capacity %d.", newCap, newFlow));
}
InternalCapEdge e = getInternalEdge(i);
InternalCapEdge re = getInternalEdgeReversed(e);
e.cap = newCap - newFlow;
re.cap = newFlow;
}
public long maxFlow(int s, int t) {
return flow(s, t, INF);
}
public long flow(int s, int t, long flowLimit) {
rangeCheck(s, 0, n);
rangeCheck(t, 0, n);
long flow = 0L;
int[] level = new int[n];
int[] que = new int[n];
int[] iter = new int[n];
while (flow < flowLimit) {
bfs(s, t, level, que);
if (level[t] < 0) break;
java.util.Arrays.fill(iter, 0);
while (flow < flowLimit) {
long d = dfs(t, s, flowLimit - flow, iter, level);
if (d == 0) break;
flow += d;
}
}
return flow;
}
private void bfs(int s, int t, int[] level, int[] que) {
java.util.Arrays.fill(level, -1);
int hd = 0, tl = 0;
que[tl++] = s;
level[s] = 0;
while (hd < tl) {
int u = que[hd++];
for (InternalCapEdge e : g[u]) {
int v = e.to;
if (e.cap == 0 || level[v] >= 0) continue;
level[v] = level[u] + 1;
if (v == t) return;
que[tl++] = v;
}
}
}
private long dfs(int cur, int s, long flowLimit, int[] iter, int[] level) {
if (cur == s) return flowLimit;
long res = 0;
int curLevel = level[cur];
for (int itMax = g[cur].size(); iter[cur] < itMax; iter[cur]++) {
int i = iter[cur];
InternalCapEdge e = g[cur].get(i);
InternalCapEdge re = getInternalEdgeReversed(e);
if (curLevel <= level[e.to] || re.cap == 0) continue;
long d = dfs(e.to, s, Math.min(flowLimit - res, re.cap), iter, level);
if (d <= 0) continue;
e.cap += d;
re.cap -= d;
res += d;
if (res == flowLimit) break;
}
return res;
}
public boolean[] minCut(int s) {
rangeCheck(s, 0, n);
boolean[] visited = new boolean[n];
int[] stack = new int[n];
int ptr = 0;
stack[ptr++] = s;
visited[s] = true;
while (ptr > 0) {
int u = stack[--ptr];
for (InternalCapEdge e : g[u]) {
int v = e.to;
if (e.cap > 0 && !visited[v]) {
visited[v] = true;
stack[ptr++] = v;
}
}
}
return visited;
}
private void rangeCheck(int i, int minInclusive, int maxExclusive) {
if (i < 0 || i >= maxExclusive) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for length %d", i, maxExclusive));
}
}
private void nonNegativeCheck(long cap, String attribute) {
if (cap < 0) { throw new IllegalArgumentException(String.format("%s %d is negative.", attribute, cap)); }
}
}
/**
* @verified
* - https://atcoder.jp/contests/practice2/tasks/practice2_e
* - http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B
*/
public static final class MinCostFlow {
private static final class InternalWeightedCapEdge {
final int to, rev;
long cap;
final long cost;
InternalWeightedCapEdge(int to, int rev, long cap, long cost) {
this.to = to;
this.rev = rev;
this.cap = cap;
this.cost = cost;
}
}
public static final class WeightedCapEdge {
public final int from, to;
public final long cap, flow, cost;
WeightedCapEdge(int from, int to, long cap, long flow, long cost) {
this.from = from;
this.to = to;
this.cap = cap;
this.flow = flow;
this.cost = cost;
}
@Override
public boolean equals(Object o) {
if (o instanceof WeightedCapEdge) {
WeightedCapEdge e = (WeightedCapEdge) o;
return from == e.from && to == e.to && cap == e.cap && flow == e.flow && cost == e.cost;
}
return false;
}
}
private static final class IntPair {
final int first, second;
IntPair(int first, int second) {
this.first = first;
this.second = second;
}
}
public static final class FlowAndCost {
public final long flow, cost;
FlowAndCost(long flow, long cost) {
this.flow = flow;
this.cost = cost;
}
@Override
public boolean equals(Object o) {
if (o instanceof FlowAndCost) {
FlowAndCost c = (FlowAndCost) o;
return flow == c.flow && cost == c.cost;
}
return false;
}
}
static final long INF = Long.MAX_VALUE;
private final int n;
private final java.util.ArrayList<IntPair> pos;
private final java.util.ArrayList<InternalWeightedCapEdge>[] g;
@SuppressWarnings("unchecked")
public MinCostFlow(int n) {
this.n = n;
pos = new java.util.ArrayList<>();
g = new java.util.ArrayList[n];
for (int i = 0; i < n; i++) {
g[i] = new java.util.ArrayList<>();
}
}
public int addEdge(int from, int to, long cap, long cost) {
rangeCheck(from, 0, n);
rangeCheck(to, 0, n);
nonNegativeCheck(cap, "Capacity");
nonNegativeCheck(cost, "Cost");
int m = pos.size();
pos.add(new IntPair(from, g[from].size()));
int fromId = g[from].size();
int toId = g[to].size();
if (from == to) toId++;
g[from].add(new InternalWeightedCapEdge(to, toId, cap, cost));
g[to].add(new InternalWeightedCapEdge(from, fromId, 0L, -cost));
return m;
}
private InternalWeightedCapEdge getInternalEdge(int i) {
return g[pos.get(i).first].get(pos.get(i).second);
}
private InternalWeightedCapEdge getInternalEdgeReversed(InternalWeightedCapEdge e) {
return g[e.to].get(e.rev);
}
public WeightedCapEdge getEdge(int i) {
int m = pos.size();
rangeCheck(i, 0, m);
InternalWeightedCapEdge e = getInternalEdge(i);
InternalWeightedCapEdge re = getInternalEdgeReversed(e);
return new WeightedCapEdge(re.to, e.to, e.cap + re.cap, re.cap, e.cost);
}
public WeightedCapEdge[] getEdges() {
WeightedCapEdge[] res = new WeightedCapEdge[pos.size()];
java.util.Arrays.setAll(res, this::getEdge);
return res;
}
public FlowAndCost minCostMaxFlow(int s, int t) {
return minCostFlow(s, t, INF);
}
public FlowAndCost minCostFlow(int s, int t, long flowLimit) {
return minCostSlope(s, t, flowLimit).getLast();
}
public java.util.ArrayList<Long> minCostList(int s, int t) {
return minCostList(s, t, INF);
}
public java.util.ArrayList<Long> minCostList(int s, int t, long flowLimit) {
java.util.LinkedList<FlowAndCost> list = minCostSlope(s, t, flowLimit);
FlowAndCost last = list.pollFirst();
java.util.ArrayList<Long> ret = new java.util.ArrayList<>();
ret.add(0L);
while(!list.isEmpty()) {
FlowAndCost now = list.pollFirst();
for (long i = last.flow + 1;i <= now.flow;++ i) {
ret.add(last.cost + (i - last.flow) * (now.cost - last.cost) / (now.flow - last.flow));
}
last = now;
}
return ret;
}
java.util.LinkedList<FlowAndCost> minCostSlope(int s, int t) {
return minCostSlope(s, t, INF);
}
public java.util.LinkedList<FlowAndCost> minCostSlope(int s, int t, long flowLimit) {
rangeCheck(s, 0, n);
rangeCheck(t, 0, n);
if (s == t) { throw new IllegalArgumentException(String.format("%d and %d is the same vertex.", s, t)); }
long[] dual = new long[n];
long[] dist = new long[n];
int[] pv = new int[n];
int[] pe = new int[n];
boolean[] vis = new boolean[n];
long flow = 0;
long cost = 0, prev_cost = -1;
java.util.LinkedList<FlowAndCost> result = new java.util.LinkedList<>();
result.addLast(new FlowAndCost(flow, cost));
while (flow < flowLimit) {
if (!dualRef(s, t, dual, dist, pv, pe, vis)) break;
long c = flowLimit - flow;
for (int v = t; v != s; v = pv[v]) {
c = Math.min(c, g[pv[v]].get(pe[v]).cap);
}
for (int v = t; v != s; v = pv[v]) {
InternalWeightedCapEdge e = g[pv[v]].get(pe[v]);
e.cap -= c;
g[v].get(e.rev).cap += c;
}
long d = -dual[s];
flow += c;
cost += c * d;
if (prev_cost == d) {
result.removeLast();
}
result.addLast(new FlowAndCost(flow, cost));
prev_cost = cost;
}
return result;
}
private boolean dualRef(int s, int t, long[] dual, long[] dist, int[] pv, int[] pe, boolean[] vis) {
java.util.Arrays.fill(dist, INF);
java.util.Arrays.fill(pv, -1);
java.util.Arrays.fill(pe, -1);
java.util.Arrays.fill(vis, false);
class State implements Comparable<State> {
final long key;
final int to;
State(long key, int to) {
this.key = key;
this.to = to;
}
@Override
public int compareTo(State q) {
return key > q.key ? 1 : -1;
}
};
java.util.PriorityQueue<State> pq = new java.util.PriorityQueue<>();
dist[s] = 0;
pq.add(new State(0L, s));
while (pq.size() > 0) {
int v = pq.poll().to;
if (vis[v]) continue;
vis[v] = true;
if (v == t) break;
for (int i = 0, deg = g[v].size(); i < deg; i++) {
InternalWeightedCapEdge e = g[v].get(i);
if (vis[e.to] || e.cap == 0) continue;
long cost = e.cost - dual[e.to] + dual[v];
if (dist[e.to] - dist[v] > cost) {
dist[e.to] = dist[v] + cost;
pv[e.to] = v;
pe[e.to] = i;
pq.add(new State(dist[e.to], e.to));
}
}
}
if (!vis[t]) { return false; }
for (int v = 0; v < n; v++) {
if (!vis[v]) continue;
dual[v] -= dist[t] - dist[v];
}
return true;
}
private void rangeCheck(int i, int minInlusive, int maxExclusive) {
if (i < 0 || i >= maxExclusive) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for length %d", i, maxExclusive));
}
}
private void nonNegativeCheck(long cap, java.lang.String attribute) {
if (cap < 0) { throw new IllegalArgumentException(String.format("%s %d is negative.", attribute, cap)); }
}
}
/**
* @verified
* <ul>
* <li>https://atcoder.jp/contests/arc050/tasks/arc050_c
* <li>https://atcoder.jp/contests/abc129/tasks/abc129_f
* </ul>
*/
public static final class ModIntFactory {
private final ModArithmetic ma;
private final int mod;
public ModIntFactory(final int mod) {
ma = ModArithmetic.of(mod);
this.mod = mod;
}
public ModInt create(long value) {
if ((value %= mod) < 0) value += mod;
if (ma instanceof ModArithmetic.ModArithmeticMontgomery) {
return new ModInt(((ModArithmetic.ModArithmeticMontgomery) ma).generate(value));
}
return new ModInt((int) value);
}
class ModInt {
private int value;
private ModInt(final int value) {
this.value = value;
}
public int mod() {
return mod;
}
public int value() {
if (ma instanceof ModArithmetic.ModArithmeticMontgomery) {
return ((ModArithmetic.ModArithmeticMontgomery) ma).reduce(value);
}
return value;
}
public ModInt add(final ModInt mi) {
return new ModInt(ma.add(value, mi.value));
}
public ModInt add(final ModInt mi1, final ModInt mi2) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2);
}
public ModInt add(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3);
}
public ModInt add(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt add(final ModInt mi1, final ModInt... mis) {
final ModInt mi = add(mi1);
for (final ModInt m : mis) mi.addAsg(m);
return mi;
}
public ModInt add(final long mi) {
return new ModInt(ma.add(value, ma.remainder(mi)));
}
public ModInt sub(final ModInt mi) {
return new ModInt(ma.sub(value, mi.value));
}
public ModInt sub(final long mi) {
return new ModInt(ma.sub(value, ma.remainder(mi)));
}
public ModInt mul(final ModInt mi) {
return new ModInt(ma.mul(value, mi.value));
}
public ModInt mul(final ModInt mi1, final ModInt mi2) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2);
}
public ModInt mul(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mul(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mul(final ModInt mi1, final ModInt... mis) {
final ModInt mi = mul(mi1);
for (final ModInt m : mis) mi.mulAsg(m);
return mi;
}
public ModInt mul(final long mi) {
return new ModInt(ma.mul(value, ma.remainder(mi)));
}
public ModInt div(final ModInt mi) {
return new ModInt(ma.div(value, mi.value));
}
public ModInt div(final long mi) {
return new ModInt(ma.div(value, ma.remainder(mi)));
}
public ModInt inv() {
return new ModInt(ma.inv(value));
}
public ModInt pow(final long b) {
return new ModInt(ma.pow(value, b));
}
public ModInt addAsg(final ModInt mi) {
value = ma.add(value, mi.value);
return this;
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2) {
return addAsg(mi1).addAsg(mi2);
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3);
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt addAsg(final ModInt... mis) {
for (final ModInt m : mis) addAsg(m);
return this;
}
public ModInt addAsg(final long mi) {
value = ma.add(value, ma.remainder(mi));
return this;
}
public ModInt subAsg(final ModInt mi) {
value = ma.sub(value, mi.value);
return this;
}
public ModInt subAsg(final long mi) {
value = ma.sub(value, ma.remainder(mi));
return this;
}
public ModInt mulAsg(final ModInt mi) {
value = ma.mul(value, mi.value);
return this;
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2) {
return mulAsg(mi1).mulAsg(mi2);
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mulAsg(final ModInt... mis) {
for (final ModInt m : mis) mulAsg(m);
return this;
}
public ModInt mulAsg(final long mi) {
value = ma.mul(value, ma.remainder(mi));
return this;
}
public ModInt divAsg(final ModInt mi) {
value = ma.div(value, mi.value);
return this;
}
public ModInt divAsg(final long mi) {
value = ma.div(value, ma.remainder(mi));
return this;
}
@Override
public String toString() {
return String.valueOf(value());
}
@Override
public boolean equals(final Object o) {
if (o instanceof ModInt) {
final ModInt mi = (ModInt) o;
return mod() == mi.mod() && value() == mi.value();
}
return false;
}
@Override
public int hashCode() {
return (1 * 37 + mod()) * 37 + value();
}
}
private interface ModArithmetic {
public int mod();
public int remainder(long value);
public int add(int a, int b);
public int sub(int a, int b);
public int mul(int a, int b);
public default int div(final int a, final int b) {
return mul(a, inv(b));
}
public int inv(int a);
public int pow(int a, long b);
public static ModArithmetic of(final int mod) {
if (mod <= 0) {
throw new IllegalArgumentException();
} else if (mod == 1) {
return new ModArithmetic1();
} else if (mod == 2) {
return new ModArithmetic2();
} else if (mod == 998244353) {
return new ModArithmetic998244353();
} else if (mod == 1000000007) {
return new ModArithmetic1000000007();
} else if ((mod & 1) == 1) {
return new ModArithmeticMontgomery(mod);
} else {
return new ModArithmeticBarrett(mod);
}
}
static final class ModArithmetic1 implements ModArithmetic {
@Override
public int mod() {
return 1;
}
@Override
public int remainder(final long value) {
return 0;
}
@Override
public int add(final int a, final int b) {
return 0;
}
@Override
public int sub(final int a, final int b) {
return 0;
}
@Override
public int mul(final int a, final int b) {
return 0;
}
@Override
public int inv(final int a) {
throw new ArithmeticException("divide by zero");
}
@Override
public int pow(final int a, final long b) {
return 0;
}
}
static final class ModArithmetic2 implements ModArithmetic {
@Override
public int mod() {
return 2;
}
@Override
public int remainder(final long value) {
return (int) (value & 1);
}
@Override
public int add(final int a, final int b) {
return a ^ b;
}
@Override
public int sub(final int a, final int b) {
return a ^ b;
}
@Override
public int mul(final int a, final int b) {
return a & b;
}
@Override
public int inv(final int a) {
if (a == 0) throw new ArithmeticException("divide by zero");
return a;
}
@Override
public int pow(final int a, final long b) {
if (b == 0) return 1;
return a;
}
}
static final class ModArithmetic998244353 implements ModArithmetic {
private final int mod = 998244353;
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int res = a + b;
return res >= mod ? res - mod : res;
}
@Override
public int sub(final int a, final int b) {
final int res = a - b;
return res < 0 ? res + mod : res;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
long res = 1;
long pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = pow2 * pow2 % mod;
}
res = res * pow2 % mod;
b ^= lsb;
}
return (int) res;
}
}
static final class ModArithmetic1000000007 implements ModArithmetic {
private final int mod = 1000000007;
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int res = a + b;
return res >= mod ? res - mod : res;
}
@Override
public int sub(final int a, final int b) {
final int res = a - b;
return res < 0 ? res + mod : res;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int div(final int a, final int b) {
return mul(a, inv(b));
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
long res = 1;
long pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = pow2 * pow2 % mod;
}
res = res * pow2 % mod;
b ^= lsb;
}
return (int) res;
}
}
static final class ModArithmeticMontgomery extends ModArithmeticDynamic {
private final long negInv;
private final long r2, r3;
private ModArithmeticMontgomery(final int mod) {
super(mod);
long inv = 0;
long s = 1, t = 0;
for (int i = 0; i < 32; i++) {
if ((t & 1) == 0) {
t += mod;
inv += s;
}
t >>= 1;
s <<= 1;
}
final long r = (1l << 32) % mod;
negInv = inv;
r2 = r * r % mod;
r3 = r2 * r % mod;
}
private int generate(final long x) {
return reduce(x * r2);
}
private int reduce(long x) {
x = x + (x * negInv & 0xffff_ffffl) * mod >>> 32;
return (int) (x < mod ? x : x - mod);
}
@Override
public int remainder(long value) {
return generate((value %= mod) < 0 ? value + mod : value);
}
@Override
public int mul(final int a, final int b) {
return reduce((long) a * b);
}
@Override
public int inv(int a) {
a = super.inv(a);
return reduce(a * r3);
}
@Override
public int pow(final int a, final long b) {
return generate(super.pow(a, b));
}
}
static final class ModArithmeticBarrett extends ModArithmeticDynamic {
private static final long mask = 0xffff_ffffl;
private final long mh;
private final long ml;
private ModArithmeticBarrett(final int mod) {
super(mod);
/**
* m = floor(2^64/mod) 2^64 = p*mod + q, 2^32 = a*mod + b => (a*mod + b)^2 =
* p*mod + q => p = mod*a^2 + 2ab + floor(b^2/mod)
*/
final long a = (1l << 32) / mod;
final long b = (1l << 32) % mod;
final long m = a * a * mod + 2 * a * b + b * b / mod;
mh = m >>> 32;
ml = m & mask;
}
private int reduce(long x) {
long z = (x & mask) * ml;
z = (x & mask) * mh + (x >>> 32) * ml + (z >>> 32);
z = (x >>> 32) * mh + (z >>> 32);
x -= z * mod;
return (int) (x < mod ? x : x - mod);
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int mul(final int a, final int b) {
return reduce((long) a * b);
}
}
static class ModArithmeticDynamic implements ModArithmetic {
final int mod;
public ModArithmeticDynamic(final int mod) {
this.mod = mod;
}
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int sum = a + b;
return sum >= mod ? sum - mod : sum;
}
@Override
public int sub(final int a, final int b) {
final int sum = a - b;
return sum < 0 ? sum + mod : sum;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
int res = 1;
int pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = mul(pow2, pow2);
}
res = mul(res, pow2);
b ^= lsb;
}
return res;
}
}
}
}
/**
* Convolution.
*
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_f
* @verified https://judge.yosupo.jp/problem/convolution_mod_1000000007
*/
public static final class Convolution {
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
private static void fft(double[] a, double[] b, boolean invert) {
int count = a.length;
for (int i = 1, j = 0; i < count; i++) {
int bit = count >> 1;
for (; j >= bit; bit >>= 1) {
j -= bit;
}
j += bit;
if (i < j) {
double temp = a[i];
a[i] = a[j];
a[j] = temp;
temp = b[i];
b[i] = b[j];
b[j] = temp;
}
}
for (int len = 2; len <= count; len <<= 1) {
int halfLen = len >> 1;
double angle = 2 * Math.PI / len;
if (invert) {
angle = -angle;
}
double wLenA = Math.cos(angle);
double wLenB = Math.sin(angle);
for (int i = 0; i < count; i += len) {
double wA = 1;
double wB = 0;
for (int j = 0; j < halfLen; j++) {
double uA = a[i + j];
double uB = b[i + j];
double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;
double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;
a[i + j] = uA + vA;
b[i + j] = uB + vB;
a[i + j + halfLen] = uA - vA;
b[i + j + halfLen] = uB - vB;
double nextWA = wA * wLenA - wB * wLenB;
wB = wA * wLenB + wB * wLenA;
wA = nextWA;
}
}
}
if (invert) {
for (int i = 0; i < count; i++) {
a[i] /= count;
b[i] /= count;
}
}
}
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
public static long[] convolution(long[] a, long[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = new double[resultSize];
double[] aImaginary = new double[resultSize];
double[] bReal = new double[resultSize];
double[] bImaginary = new double[resultSize];
for (int i = 0; i < a.length; i++) aReal[i] = a[i];
for (int i = 0; i < b.length; i++) bReal[i] = b[i];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
long[] result = new long[a.length + b.length - 1];
for (int i = 0; i < result.length; i++) result[i] = Math.round(aReal[i]);
return result;
}
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
public static int[] convolution(int[] a, int[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = new double[resultSize];
double[] aImaginary = new double[resultSize];
double[] bReal = new double[resultSize];
double[] bImaginary = new double[resultSize];
for (int i = 0; i < a.length; i++) aReal[i] = a[i];
for (int i = 0; i < b.length; i++) bReal[i] = b[i];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
int[] result = new int[a.length + b.length - 1];
for (int i = 0; i < result.length; i++) result[i] = (int) Math.round(aReal[i]);
return result;
}
public static double[] convolution(double[] a, double[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = Arrays.copyOf(a, resultSize);
double[] aImaginary = new double[resultSize];
double[] bReal = Arrays.copyOf(b, resultSize);
double[] bImaginary = new double[resultSize];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
return Arrays.copyOf(aReal, a.length + b.length - 1);
}
/**
* Find a primitive root.
*
* @param m A prime number.
* @return Primitive root.
*/
private static int primitiveRoot(final int m) {
if (m == 2) return 1;
if (m == 167772161) return 3;
if (m == 469762049) return 3;
if (m == 754974721) return 11;
if (m == 998244353) return 3;
final int[] divs = new int[20];
divs[0] = 2;
int cnt = 1;
int x = (m - 1) / 2;
while (x % 2 == 0) x /= 2;
for (int i = 3; (long) i * i <= x; i += 2) {
if (x % i == 0) {
divs[cnt++] = i;
while (x % i == 0) {
x /= i;
}
}
}
if (x > 1) {
divs[cnt++] = x;
}
for (int g = 2;; g++) {
boolean ok = true;
for (int i = 0; i < cnt; i++) {
if (MathLib.pow(g, (m - 1) / divs[i], m) == 1) {
ok = false;
break;
}
}
if (ok) return g;
}
}
/**
* Ceil of power 2.
*
* @param n Value.
* @return Ceil of power 2.
*/
private static int ceilPow2(final int n) {
int x = 0;
while (1L << x < n) x++;
return x;
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static long garner(final long[] c, final int[] mods) {
final int n = c.length + 1;
final long[] cnst = new long[n];
final long[] coef = new long[n];
java.util.Arrays.fill(coef, 1);
for (int i = 0; i < n - 1; i++) {
final int m1 = mods[i];
long v = (c[i] - cnst[i] + m1) % m1;
v = v * MathLib.pow(coef[i], m1 - 2, m1) % m1;
for (int j = i + 1; j < n; j++) {
final long m2 = mods[j];
cnst[j] = (cnst[j] + coef[j] * v) % m2;
coef[j] = coef[j] * m1 % m2;
}
}
return cnst[n - 1];
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static int garner(int c0, int c1, int c2, final MathLib.Barrett[] mods) {
final long[] cnst = new long[4];
final long[] coef = new long[4];
java.util.Arrays.fill(coef, 1);
MathLib.Barrett m1 = mods[0];
long v = m1.reduce(c0 - cnst[0] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[0], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[1];
cnst[1] = m2.reduce(cnst[1] + coef[1] * v);
coef[1] = m2.reduce(coef[1] * m1.mod);
m2 = mods[2];
cnst[2] = m2.reduce(cnst[2] + coef[2] * v);
coef[2] = m2.reduce(coef[2] * m1.mod);
m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
m1 = mods[1];
v = m1.reduce(c1 - cnst[1] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[1], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[2];
cnst[2] = m2.reduce(cnst[2] + coef[2] * v);
coef[2] = m2.reduce(coef[2] * m1.mod);
m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
m1 = mods[2];
v = m1.reduce(c2 - cnst[2] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[2], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
return (int) cnst[3];
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static int garner1_000_000_007(int c0, int c1, int c2) {
final long[] cnst = new long[4];
final long[] coef = new long[4];
java.util.Arrays.fill(coef, 1);
long v = (c0 - cnst[0] + 998_244_353) % 998_244_353;
v = v * MathLib.pow998_244_353(coef[0], 998_244_353 - 2) % 998_244_353;
{
cnst[1] = (cnst[1] + coef[1] * v) % 167_772_161;
coef[1] = coef[1] * 998_244_353 % 167_772_161;
cnst[2] = (cnst[2] + coef[2] * v) % 469_762_049;
coef[2] = coef[2] * 998_244_353 % 469_762_049;
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 998_244_353 % 1_000_000_007;
}
v = (c1 - cnst[1] + 167_772_161) % 167_772_161;
v = v * MathLib.pow167_772_161(coef[1], 167_772_161 - 2) % 167_772_161;
{
cnst[2] = (cnst[2] + coef[2] * v) % 469_762_049;
coef[2] = coef[2] * 167_772_161 % 469_762_049;
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 167_772_161 % 1_000_000_007;
}
v = (c2 - cnst[2] + 469_762_049) % 469_762_049;
v = v * MathLib.pow469_762_049(coef[2], 469_762_049 - 2) % 469_762_049;
{
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 469_762_049 % 1_000_000_007;
}
return (int) cnst[3];
}
/**
* Pre-calculation for NTT.
*
* @param mod NTT Prime.
* @param g Primitive root of mod.
* @return Pre-calculation table.
*/
private static long[] sumE(final int mod, final int g) {
final long[] sum_e = new long[30];
final long[] es = new long[30];
final long[] ies = new long[30];
final int cnt2 = Integer.numberOfTrailingZeros(mod - 1);
long e = MathLib.pow(g, mod - 1 >> cnt2, mod);
long ie = MathLib.pow(e, mod - 2, mod);
for (int i = cnt2; i >= 2; i--) {
es[i - 2] = e;
ies[i - 2] = ie;
e = e * e % mod;
ie = ie * ie % mod;
}
long now = 1;
for (int i = 0; i < cnt2 - 2; i++) {
sum_e[i] = es[i] * now % mod;
now = now * ies[i] % mod;
}
return sum_e;
}
/**
* Pre-calculation for inverse NTT.
*
* @param mod Mod.
* @param g Primitive root of mod.
* @return Pre-calculation table.
*/
private static long[] sumIE(final int mod, final int g) {
final long[] sum_ie = new long[30];
final long[] es = new long[30];
final long[] ies = new long[30];
final int cnt2 = Integer.numberOfTrailingZeros(mod - 1);
long e = MathLib.pow(g, mod - 1 >> cnt2, mod);
long ie = MathLib.pow(e, mod - 2, mod);
for (int i = cnt2; i >= 2; i--) {
es[i - 2] = e;
ies[i - 2] = ie;
e = e * e % mod;
ie = ie * ie % mod;
}
long now = 1;
for (int i = 0; i < cnt2 - 2; i++) {
sum_ie[i] = ies[i] * now % mod;
now = now * es[i] % mod;
}
return sum_ie;
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterflyInv(final long[] a, final long[] sumIE, final int mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (l + r) % mod;
a[i + offset + p] = (mod + l - r) * inow % mod;
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % mod;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly(final long[] a, final long[] sumE, final int mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now % mod;
a[i + offset] = (l + r) % mod;
a[i + offset + p] = (l - r + mod) % mod;
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % mod;
}
}
}
/**
* Inverse NTT used mod 998_244_353.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv998_244_353(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 998_244_353);
a[i + offset + p] = (int) ((998_244_353 + l - r) * inow % 998_244_353);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 998_244_353;
}
}
}
/**
* Inverse NTT used mod 167_772_161.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv167_772_161(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 167_772_161);
a[i + offset + p] = (int) ((167_772_161 + l - r) * inow % 167_772_161);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 167_772_161;
}
}
}
/**
* Inverse NTT used mod 469_762_049.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv469_762_049(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 469_762_049);
a[i + offset + p] = (int) ((469_762_049 + l - r) * inow % 469_762_049);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 469_762_049;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterflyInv(final int[] a, final int[] sumIE, final MathLib.Barrett mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
long sum = l + r;
if (sum >= mod.mod) sum -= mod.mod;
a[i + offset] = (int) sum;
a[i + offset + p] = mod.reduce((mod.mod + l - r) * inow);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = mod.reduce(inow * sumIE[x]);
}
}
}
/**
* Inverse NTT used mod 998_244_353.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly998_244_353(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (998_244_353 - 2) * 998_244_353;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 998_244_353);
a[i + offset + p] = (int) ((l - r + ADD) % 998_244_353);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 998_244_353;
}
}
}
/**
* Inverse NTT used mod 167_772_161.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly167_772_161(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (167_772_161 - 2) * 167_772_161;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 167_772_161);
a[i + offset + p] = (int) ((l - r + ADD) % 167_772_161);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 167_772_161;
}
}
}
/**
* Inverse NTT used mod 469_762_049.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly469_762_049(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (469_762_049 - 2) * 469_762_049;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 469_762_049);
a[i + offset + p] = (int) ((l - r + ADD) % 469_762_049);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 469_762_049;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly(final int[] a, final int[] sumE, final MathLib.Barrett mod) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (mod.mod - 2) * mod.mod;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = mod.reduce(l + r);
a[i + offset + p] = mod.reduce(l - r + ADD);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = mod.reduce(now * sumE[x]);
}
}
}
/**
* Convolution used mod 998_244_353.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution998_244_353(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(998_244_353);
final int[] sume;
{
long[] s = sumE(998_244_353, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(998_244_353, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly998_244_353(a, sume);
butterfly998_244_353(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 998_244_353);
butterflyInv998_244_353(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow998_244_353(z, 998_244_353 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 998_244_353);
return a;
}
/**
* Convolution used mod 167_772_161.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution167_772_161(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(167_772_161);
final int[] sume;
{
long[] s = sumE(167_772_161, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(167_772_161, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly167_772_161(a, sume);
butterfly167_772_161(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 167_772_161);
butterflyInv167_772_161(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow167_772_161(z, 167_772_161 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 167_772_161);
return a;
}
/**
* Convolution used mod 469_762_049.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution469_762_049(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(469_762_049);
final int[] sume;
{
long[] s = sumE(469_762_049, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(469_762_049, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly469_762_049(a, sume);
butterfly469_762_049(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 469_762_049);
butterflyInv469_762_049(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow469_762_049(z, 469_762_049 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 469_762_049);
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod NTT Prime.
* @return Answer.
*/
private static int[] convolutionNTT(int[] a, int[] b, final int mod) {
MathLib.Barrett barrett = new MathLib.Barrett(mod);
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(mod);
final int[] sume;
{
long[] s = sumE(mod, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(mod, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly(a, sume, barrett);
butterfly(b, sume, barrett);
for (int i = 0; i < z; i++) a[i] = barrett.reduce((long) a[i] * b[i]);
butterflyInv(a, sumie, barrett);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow(z, mod - 2, mod);
for (int i = 0; i < n + m - 1; i++) a[i] = barrett.reduce(a[i] * iz);
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod NTT Prime.
* @return Answer.
*/
private static long[] convolutionNTT(long[] a, long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new long[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final long[] na = new long[z];
final long[] nb = new long[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(mod);
final long[] sume = sumE(mod, g);
final long[] sumie = sumIE(mod, g);
butterfly(a, sume, mod);
butterfly(b, sume, mod);
for (int i = 0; i < z; i++) {
a[i] = a[i] * b[i] % mod;
}
butterflyInv(a, sumie, mod);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow(z, mod - 2, mod);
for (int i = 0; i < n + m - 1; i++) a[i] = a[i] * iz % mod;
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static long[] convolution(final long[] a, final long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new long[0];
final int mod1 = 998_244_353;
final int mod2 = 167_772_161;
final int mod3 = 469_762_049;
final long[] c1 = convolutionNTT(a, b, mod1);
final long[] c2 = convolutionNTT(a, b, mod2);
final long[] c3 = convolutionNTT(a, b, mod3);
final int retSize = c1.length;
final long[] ret = new long[retSize];
final int[] mods = { mod1, mod2, mod3, mod };
for (int i = 0; i < retSize; ++i) {
ret[i] = garner(new long[] { c1[i], c2[i], c3[i] }, mods);
}
return ret;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static int[] convolution(final int[] a, final int[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
if (mod == 1_000_000_007) return convolution1_000_000_007(a, b);
if (mod == 998_244_353) return convolution998_244_353(a, b);
int ntt = Integer.lowestOneBit(mod - 1) >> 1;
if (n + m <= ntt) return convolutionNTT(a, b, mod);
final int[] c1 = convolution998_244_353(a, b);
final int[] c2 = convolution167_772_161(a, b);
final int[] c3 = convolution469_762_049(a, b);
final int retSize = c1.length;
final int[] ret = new int[retSize];
final MathLib.Barrett[] mods = { new MathLib.Barrett(998_244_353), new MathLib.Barrett(167_772_161),
new MathLib.Barrett(469_762_049), new MathLib.Barrett(mod) };
for (int i = 0; i < retSize; ++i) ret[i] = garner(c1[i], c2[i], c3[i], mods);
return ret;
}
/**
* Convolution used mod 1_000_000_007.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution1_000_000_007(final int[] a, final int[] b) {
final int[] c1 = convolution998_244_353(a, b);
final int[] c2 = convolution167_772_161(a, b);
final int[] c3 = convolution469_762_049(a, b);
final int retSize = c1.length;
final int[] ret = new int[retSize];
for (int i = 0; i < retSize; ++i) ret[i] = garner1_000_000_007(c1[i], c2[i], c3[i]);
return ret;
}
/**
* Convolution. need: length < 2000
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static int[] convolution2(final int[] a, final int[] b, final int mod) {
if (Math.max(a.length, b.length) < 4000) {
long[] la = new long[a.length], ha = new long[a.length], ma = new long[a.length],
lb = new long[b.length], hb = new long[b.length], mb = new long[b.length];
MathLib.Barrett barrett = new MathLib.Barrett(mod);
for (int i = 0; i < a.length; ++i) {
ha[i] = a[i] >> 15;
la[i] = a[i] & 0x7FFF;
ma[i] = la[i] + ha[i];
}
for (int i = 0; i < b.length; ++i) {
hb[i] = b[i] >> 15;
lb[i] = b[i] & 0x7FFF;
mb[i] = lb[i] + hb[i];
}
long[] l = convolution(la, lb), h = convolution(ha, hb), m = convolution(ma, mb);
int[] ret = new int[m.length];
for (int i = 0; i < m.length; ++i) {
h[i] = barrett.reduce(h[i]);
m[i] = barrett.reduce(m[i] - l[i] - h[i] + (long) m.length * mod);
ret[i] = barrett.reduce((h[i] << 30) + (m[i] << 15) + l[i]);
}
return ret;
}
return convolution(a, b, mod);
}
/**
* Naive convolution. (Complexity is O(N^2)!!)
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Mod.
* @return Answer.
*/
public static long[] convolutionNaive(final long[] a, final long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
final int k = n + m - 1;
final long[] ret = new long[k];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ret[i + j] += a[i] * b[j] % mod;
ret[i + j] %= mod;
}
}
return ret;
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_g
*/
public static final class SCC {
static class Edge {
int from, to;
public Edge(final int from, final int to) {
this.from = from;
this.to = to;
}
}
final int n;
int m;
final java.util.ArrayList<Edge> unorderedEdges;
final int[] start;
final int[] ids;
boolean hasBuilt = false;
public SCC(final int n) {
this.n = n;
unorderedEdges = new java.util.ArrayList<>();
start = new int[n + 1];
ids = new int[n];
}
public void addEdge(final int from, final int to) {
rangeCheck(from);
rangeCheck(to);
unorderedEdges.add(new Edge(from, to));
start[from + 1]++;
m++;
}
public int id(final int i) {
if (!hasBuilt) { throw new UnsupportedOperationException("Graph hasn't been built."); }
rangeCheck(i);
return ids[i];
}
public int[][] build() {
for (int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
final Edge[] orderedEdges = new Edge[m];
final int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for (final Edge e : unorderedEdges) {
orderedEdges[count[e.from]++] = e;
}
int nowOrd = 0;
int groupNum = 0;
int k = 0;
// parent
final int[] par = new int[n];
final int[] vis = new int[n];
final int[] low = new int[n];
final int[] ord = new int[n];
java.util.Arrays.fill(ord, -1);
// u = lower32(stack[i]) : visiting vertex
// j = upper32(stack[i]) : jth child
final long[] stack = new long[n];
// size of stack
int ptr = 0;
// non-recursional DFS
for (int i = 0; i < n; i++) {
if (ord[i] >= 0) continue;
par[i] = -1;
// vertex i, 0th child.
stack[ptr++] = 0l << 32 | i;
// stack is not empty
while (ptr > 0) {
// last element
final long p = stack[--ptr];
// vertex
final int u = (int) (p & 0xffff_ffffl);
// jth child
int j = (int) (p >>> 32);
if (j == 0) { // first visit
low[u] = ord[u] = nowOrd++;
vis[k++] = u;
}
if (start[u] + j < count[u]) { // there are more children
// jth child
final int to = orderedEdges[start[u] + j].to;
// incr children counter
stack[ptr++] += 1l << 32;
if (ord[to] == -1) { // new vertex
stack[ptr++] = 0l << 32 | to;
par[to] = u;
} else { // backward edge
low[u] = Math.min(low[u], ord[to]);
}
} else { // no more children (leaving)
while (j-- > 0) {
final int to = orderedEdges[start[u] + j].to;
// update lowlink
if (par[to] == u) low[u] = Math.min(low[u], low[to]);
}
if (low[u] == ord[u]) { // root of a component
while (true) { // gathering verticies
final int v = vis[--k];
ord[v] = n;
ids[v] = groupNum;
if (v == u) break;
}
groupNum++; // incr the number of components
}
}
}
}
for (int i = 0; i < n; i++) {
ids[i] = groupNum - 1 - ids[i];
}
final int[] counts = new int[groupNum];
for (final int x : ids) counts[x]++;
final int[][] groups = new int[groupNum][];
for (int i = 0; i < groupNum; i++) {
groups[i] = new int[counts[i]];
}
for (int i = 0; i < n; i++) {
final int cmp = ids[i];
groups[cmp][--counts[cmp]] = i;
}
hasBuilt = true;
return groups;
}
private void rangeCheck(final int i) {
if (i < 0 || i >= n) {
throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", i, n));
}
}
}
/**
* @verified https://atcoder.jp/contests/practice2/submissions/16647102
*/
public static final class TwoSAT {
private final int n;
private final InternalSCC scc;
private final boolean[] answer;
private boolean hasCalledSatisfiable = false;
private boolean existsAnswer = false;
public TwoSAT(int n) {
this.n = n;
scc = new InternalSCC(2 * n);
answer = new boolean[n];
}
public void addClause(int x, boolean f, int y, boolean g) {
rangeCheck(x);
rangeCheck(y);
scc.addEdge(x << 1 | (f ? 0 : 1), y << 1 | (g ? 1 : 0));
scc.addEdge(y << 1 | (g ? 0 : 1), x << 1 | (f ? 1 : 0));
}
public void addImplication(int x, boolean f, int y, boolean g) {
addClause(x, !f, y, g);
}
public void addNand(int x, boolean f, int y, boolean g) {
addClause(x, !f, y, !g);
}
public void set(int x, boolean f) {
addClause(x, f, x, f);
}
public boolean satisfiable() {
hasCalledSatisfiable = true;
int[] ids = scc.ids();
for (int i = 0; i < n; i++) {
if (ids[i << 1 | 0] == ids[i << 1 | 1]) return existsAnswer = false;
answer[i] = ids[i << 1 | 0] < ids[i << 1 | 1];
}
return existsAnswer = true;
}
public boolean[] answer() {
if (!hasCalledSatisfiable) {
throw new UnsupportedOperationException("Call TwoSAT#satisfiable at least once before TwoSAT#answer.");
}
if (existsAnswer) return answer;
return null;
}
private void rangeCheck(int x) {
if (x < 0 || x >= n) {
throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", x, n));
}
}
private static final class EdgeList {
long[] a;
int ptr = 0;
EdgeList(int cap) {
a = new long[cap];
}
void add(int upper, int lower) {
if (ptr == a.length) grow();
a[ptr++] = (long) upper << 32 | lower;
}
void grow() {
long[] b = new long[a.length << 1];
System.arraycopy(a, 0, b, 0, a.length);
a = b;
}
}
private static final class InternalSCC {
final int n;
int m;
final EdgeList unorderedEdges;
final int[] start;
InternalSCC(int n) {
this.n = n;
unorderedEdges = new EdgeList(n);
start = new int[n + 1];
}
void addEdge(int from, int to) {
unorderedEdges.add(from, to);
start[from + 1]++;
m++;
}
static final long mask = 0xffff_ffffl;
int[] ids() {
for (int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
int[] orderedEdges = new int[m];
int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for (int i = 0; i < m; i++) {
long e = unorderedEdges.a[i];
orderedEdges[count[(int) (e >>> 32)]++] = (int) (e & mask);
}
int nowOrd = 0;
int groupNum = 0;
int k = 0;
int[] par = new int[n];
int[] vis = new int[n];
int[] low = new int[n];
int[] ord = new int[n];
java.util.Arrays.fill(ord, -1);
int[] ids = new int[n];
long[] stack = new long[n];
int ptr = 0;
for (int i = 0; i < n; i++) {
if (ord[i] >= 0) continue;
par[i] = -1;
stack[ptr++] = i;
while (ptr > 0) {
long p = stack[--ptr];
int u = (int) (p & mask);
int j = (int) (p >>> 32);
if (j == 0) {
low[u] = ord[u] = nowOrd++;
vis[k++] = u;
}
if (start[u] + j < count[u]) {
int to = orderedEdges[start[u] + j];
stack[ptr++] += 1l << 32;
if (ord[to] == -1) {
stack[ptr++] = to;
par[to] = u;
} else {
low[u] = Math.min(low[u], ord[to]);
}
} else {
while (j-- > 0) {
int to = orderedEdges[start[u] + j];
if (par[to] == u) low[u] = Math.min(low[u], low[to]);
}
if (low[u] == ord[u]) {
while (true) {
int v = vis[--k];
ord[v] = n;
ids[v] = groupNum;
if (v == u) break;
}
groupNum++;
}
}
}
}
for (int i = 0; i < n; i++) {
ids[i] = groupNum - 1 - ids[i];
}
return ids;
}
}
}
public static final class StringAlgorithm {
private static int[] saNaive(final int[] s) {
final int n = s.length;
final Integer[] _sa = new Integer[n];
for (int i = 0; i < n; i++) {
_sa[i] = i;
}
java.util.Arrays.sort(_sa, (l, r) -> {
while (l < n && r < n) {
if (s[l] != s[r]) return s[l] - s[r];
l++;
r++;
}
return -(l - r);
});
final int[] sa = new int[n];
for (int i = 0; i < n; i++) {
sa[i] = _sa[i];
}
return sa;
}
private static int[] saDoubling(final int[] s) {
final int n = s.length;
final Integer[] _sa = new Integer[n];
for (int i = 0; i < n; i++) {
_sa[i] = i;
}
int[] rnk = s;
int[] tmp = new int[n];
for (int k = 1; k < n; k *= 2) {
final int _k = k;
final int[] _rnk = rnk;
final java.util.Comparator<Integer> cmp = (x, y) -> {
if (_rnk[x] != _rnk[y]) return _rnk[x] - _rnk[y];
final int rx = x + _k < n ? _rnk[x + _k] : -1;
final int ry = y + _k < n ? _rnk[y + _k] : -1;
return rx - ry;
};
java.util.Arrays.sort(_sa, cmp);
tmp[_sa[0]] = 0;
for (int i = 1; i < n; i++) {
tmp[_sa[i]] = tmp[_sa[i - 1]] + (cmp.compare(_sa[i - 1], _sa[i]) < 0 ? 1 : 0);
}
final int[] buf = tmp;
tmp = rnk;
rnk = buf;
}
final int[] sa = new int[n];
for (int i = 0; i < n; i++) {
sa[i] = _sa[i];
}
return sa;
}
private static final int THRESHOLD_NAIVE = 10;
private static final int THRESHOLD_DOUBLING = 40;
private static int[] sais(final int[] s, final int upper) {
final int n = s.length;
if (n == 0) return new int[0];
if (n == 1) return new int[] { 0 };
if (n == 2) { return s[0] < s[1] ? new int[] { 0, 1 } : new int[] { 1, 0 }; }
if (n < THRESHOLD_NAIVE) { return saNaive(s); }
if (n < THRESHOLD_DOUBLING) { return saDoubling(s); }
final int[] sa = new int[n];
final boolean[] ls = new boolean[n];
for (int i = n - 2; i >= 0; i--) {
ls[i] = s[i] == s[i + 1] ? ls[i + 1] : s[i] < s[i + 1];
}
final int[] sumL = new int[upper + 1];
final int[] sumS = new int[upper + 1];
for (int i = 0; i < n; i++) {
if (ls[i]) {
sumL[s[i] + 1]++;
} else {
sumS[s[i]]++;
}
}
for (int i = 0; i <= upper; i++) {
sumS[i] += sumL[i];
if (i < upper) sumL[i + 1] += sumS[i];
}
final java.util.function.Consumer<int[]> induce = lms -> {
java.util.Arrays.fill(sa, -1);
final int[] buf = new int[upper + 1];
System.arraycopy(sumS, 0, buf, 0, upper + 1);
for (final int d : lms) {
if (d == n) continue;
sa[buf[s[d]]++] = d;
}
System.arraycopy(sumL, 0, buf, 0, upper + 1);
sa[buf[s[n - 1]]++] = n - 1;
for (int i = 0; i < n; i++) {
final int v = sa[i];
if (v >= 1 && !ls[v - 1]) {
sa[buf[s[v - 1]]++] = v - 1;
}
}
System.arraycopy(sumL, 0, buf, 0, upper + 1);
for (int i = n - 1; i >= 0; i--) {
final int v = sa[i];
if (v >= 1 && ls[v - 1]) {
sa[--buf[s[v - 1] + 1]] = v - 1;
}
}
};
final int[] lmsMap = new int[n + 1];
java.util.Arrays.fill(lmsMap, -1);
int m = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lmsMap[i] = m++;
}
}
final int[] lms = new int[m];
{
int p = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lms[p++] = i;
}
}
}
induce.accept(lms);
if (m > 0) {
final int[] sortedLms = new int[m];
{
int p = 0;
for (final int v : sa) {
if (lmsMap[v] != -1) {
sortedLms[p++] = v;
}
}
}
final int[] recS = new int[m];
int recUpper = 0;
recS[lmsMap[sortedLms[0]]] = 0;
for (int i = 1; i < m; i++) {
int l = sortedLms[i - 1], r = sortedLms[i];
final int endL = lmsMap[l] + 1 < m ? lms[lmsMap[l] + 1] : n;
final int endR = lmsMap[r] + 1 < m ? lms[lmsMap[r] + 1] : n;
boolean same = true;
if (endL - l != endR - r) {
same = false;
} else {
while (l < endL && s[l] == s[r]) {
l++;
r++;
}
if (l == n || s[l] != s[r]) same = false;
}
if (!same) {
recUpper++;
}
recS[lmsMap[sortedLms[i]]] = recUpper;
}
final int[] recSA = sais(recS, recUpper);
for (int i = 0; i < m; i++) {
sortedLms[i] = lms[recSA[i]];
}
induce.accept(sortedLms);
}
return sa;
}
public static int[] suffixArray(final int[] s, final int upper) {
assert 0 <= upper;
for (final int d : s) {
assert 0 <= d && d <= upper;
}
return sais(s, upper);
}
public static int[] suffixArray(final int[] s) {
final int n = s.length;
final Integer[] idx = new Integer[n];
for (int i = 0; i < n; i++) {
idx[i] = i;
}
java.util.Arrays.sort(idx, (l, r) -> s[l] - s[r]);
final int[] s2 = new int[n];
int now = 0;
for (int i = 0; i < n; i++) {
if (i > 0 && s[idx[i - 1]] != s[idx[i]]) {
now++;
}
s2[idx[i]] = now;
}
return sais(s2, now);
}
public static int[] suffixArray(final char[] s) {
final int n = s.length;
final int[] s2 = new int[n];
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return sais(s2, 255);
}
public static int[] suffixArray(final java.lang.String s) {
return suffixArray(s.toCharArray());
}
public static int[] lcpArray(final int[] s, final int[] sa) {
final int n = s.length;
assert n >= 1;
final int[] rnk = new int[n];
for (int i = 0; i < n; i++) {
rnk[sa[i]] = i;
}
final int[] lcp = new int[n - 1];
int h = 0;
for (int i = 0; i < n; i++) {
if (h > 0) h--;
if (rnk[i] == 0) {
continue;
}
final int j = sa[rnk[i] - 1];
for (; j + h < n && i + h < n; h++) {
if (s[j + h] != s[i + h]) break;
}
lcp[rnk[i] - 1] = h;
}
return lcp;
}
public static int[] lcpArray(final char[] s, final int[] sa) {
final int n = s.length;
final int[] s2 = new int[n];
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return lcpArray(s2, sa);
}
public static int[] lcpArray(final java.lang.String s, final int[] sa) {
return lcpArray(s.toCharArray(), sa);
}
public static int[] zAlgorithm(final int[] s) {
final int n = s.length;
if (n == 0) return new int[0];
final int[] z = new int[n];
for (int i = 1, j = 0; i < n; i++) {
int k = j + z[j] <= i ? 0 : Math.min(j + z[j] - i, z[i - j]);
while (i + k < n && s[k] == s[i + k]) k++;
z[i] = k;
if (j + z[j] < i + z[i]) j = i;
}
z[0] = n;
return z;
}
public static int[] zAlgorithm(final char[] s) {
final int n = s.length;
if (n == 0) return new int[0];
final int[] z = new int[n];
for (int i = 1, j = 0; i < n; i++) {
int k = j + z[j] <= i ? 0 : Math.min(j + z[j] - i, z[i - j]);
while (i + k < n && s[k] == s[i + k]) k++;
z[i] = k;
if (j + z[j] < i + z[i]) j = i;
}
z[0] = n;
return z;
}
public static int[] zAlgorithm(final String s) {
return zAlgorithm(s.toCharArray());
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_j
*/
public static final class SegTree<S> {
final int MAX;
final int N;
final java.util.function.BinaryOperator<S> op;
final S E;
final S[] data;
@SuppressWarnings("unchecked")
public SegTree(final int n, final java.util.function.BinaryOperator<S> op, final S e) {
this.MAX = n;
int k = 1;
while (k < n) k <<= 1;
this.N = k;
this.E = e;
this.op = op;
this.data = (S[]) new Object[N << 1];
java.util.Arrays.fill(data, E);
}
public SegTree(final S[] dat, final java.util.function.BinaryOperator<S> op, final S e) {
this(dat.length, op, e);
build(dat);
}
private void build(final S[] dat) {
final int l = dat.length;
System.arraycopy(dat, 0, data, N, l);
for (int i = N - 1; i > 0; i--) {
data[i] = op.apply(data[i << 1 | 0], data[i << 1 | 1]);
}
}
public void set(int p, final S x) {
exclusiveRangeCheck(p);
data[p += N] = x;
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public void set(int p, java.util.function.UnaryOperator<S> f) {
exclusiveRangeCheck(p);
data[p += N] = f.apply(data[p]);
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public S get(final int p) {
exclusiveRangeCheck(p);
return data[p + N];
}
public S prod(int l, int r) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
S sumLeft = E;
S sumRight = E;
l += N;
r += N;
while (l < r) {
if ((l & 1) == 1) sumLeft = op.apply(sumLeft, data[l++]);
if ((r & 1) == 1) sumRight = op.apply(data[--r], sumRight);
l >>= 1;
r >>= 1;
}
return op.apply(sumLeft, sumRight);
}
public S allProd() {
return data[1];
}
public int maxRight(int l, final java.util.function.Predicate<S> f) {
inclusiveRangeCheck(l);
if (!f.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (l == MAX) return MAX;
l += N;
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!f.test(op.apply(sum, data[l]))) {
while (l < N) {
l = l << 1;
if (f.test(op.apply(sum, data[l]))) {
sum = op.apply(sum, data[l]);
l++;
}
}
return l - N;
}
sum = op.apply(sum, data[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, final java.util.function.Predicate<S> f) {
inclusiveRangeCheck(r);
if (!f.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (r == 0) return 0;
r += N;
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!f.test(op.apply(data[r], sum))) {
while (r < N) {
r = r << 1 | 1;
if (f.test(op.apply(data[r], sum))) {
sum = op.apply(data[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = op.apply(data[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(final int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(final int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d].", p, 0, MAX));
}
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0;i < N;++ i) {
if (i != 0) sb.append(", ");
sb.append(data[i + N]);
}
sb.append(']');
return sb.toString();
}
}
/**
*
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_k
*/
public static final class LazySegTree<S, F> {
final int MAX;
final int N;
final int Log;
final java.util.function.BinaryOperator<S> Op;
final S E;
final java.util.function.BiFunction<F, S, S> Mapping;
final java.util.function.BinaryOperator<F> Composition;
final F Id;
final S[] Dat;
final F[] Laz;
@SuppressWarnings("unchecked")
public LazySegTree(final int n, final java.util.function.BinaryOperator<S> op, final S e,
final java.util.function.BiFunction<F, S, S> mapping,
final java.util.function.BinaryOperator<F> composition, final F id) {
this.MAX = n;
int k = 1;
while (k < n) k <<= 1;
this.N = k;
this.Log = Integer.numberOfTrailingZeros(N);
this.Op = op;
this.E = e;
this.Mapping = mapping;
this.Composition = composition;
this.Id = id;
this.Dat = (S[]) new Object[N << 1];
this.Laz = (F[]) new Object[N];
java.util.Arrays.fill(Dat, E);
java.util.Arrays.fill(Laz, Id);
}
public LazySegTree(final S[] dat, final java.util.function.BinaryOperator<S> op, final S e,
final java.util.function.BiFunction<F, S, S> mapping,
final java.util.function.BinaryOperator<F> composition, final F id) {
this(dat.length, op, e, mapping, composition, id);
build(dat);
}
private void build(final S[] dat) {
final int l = dat.length;
System.arraycopy(dat, 0, Dat, N, l);
for (int i = N - 1; i > 0; i--) {
Dat[i] = Op.apply(Dat[i << 1 | 0], Dat[i << 1 | 1]);
}
}
private void push(final int k) {
if (Laz[k] == Id) return;
final int lk = k << 1 | 0, rk = k << 1 | 1;
Dat[lk] = Mapping.apply(Laz[k], Dat[lk]);
Dat[rk] = Mapping.apply(Laz[k], Dat[rk]);
if (lk < N) Laz[lk] = Composition.apply(Laz[k], Laz[lk]);
if (rk < N) Laz[rk] = Composition.apply(Laz[k], Laz[rk]);
Laz[k] = Id;
}
private void pushTo(final int k) {
for (int i = Log; i > 0; i--) push(k >> i);
}
private void pushTo(final int lk, final int rk) {
for (int i = Log; i > 0; i--) {
if (lk >> i << i != lk) push(lk >> i);
if (rk >> i << i != rk) push(rk >> i);
}
}
private void updateFrom(int k) {
k >>= 1;
while (k > 0) {
Dat[k] = Op.apply(Dat[k << 1 | 0], Dat[k << 1 | 1]);
k >>= 1;
}
}
private void updateFrom(final int lk, final int rk) {
for (int i = 1; i <= Log; i++) {
if (lk >> i << i != lk) {
final int lki = lk >> i;
Dat[lki] = Op.apply(Dat[lki << 1 | 0], Dat[lki << 1 | 1]);
}
if (rk >> i << i != rk) {
final int rki = rk - 1 >> i;
Dat[rki] = Op.apply(Dat[rki << 1 | 0], Dat[rki << 1 | 1]);
}
}
}
public void set(int p, final S x) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = x;
updateFrom(p);
}
public S get(int p) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
return Dat[p];
}
public S prod(int l, int r) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return E;
l += N;
r += N;
pushTo(l, r);
S sumLeft = E, sumRight = E;
while (l < r) {
if ((l & 1) == 1) sumLeft = Op.apply(sumLeft, Dat[l++]);
if ((r & 1) == 1) sumRight = Op.apply(Dat[--r], sumRight);
l >>= 1;
r >>= 1;
}
return Op.apply(sumLeft, sumRight);
}
public S allProd() {
return Dat[1];
}
public void apply(int p, final F f) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = Mapping.apply(f, Dat[p]);
updateFrom(p);
}
public void apply(int l, int r, final F f) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return;
l += N;
r += N;
pushTo(l, r);
for (int l2 = l, r2 = r; l2 < r2;) {
if ((l2 & 1) == 1) {
Dat[l2] = Mapping.apply(f, Dat[l2]);
if (l2 < N) Laz[l2] = Composition.apply(f, Laz[l2]);
l2++;
}
if ((r2 & 1) == 1) {
r2--;
Dat[r2] = Mapping.apply(f, Dat[r2]);
if (r2 < N) Laz[r2] = Composition.apply(f, Laz[r2]);
}
l2 >>= 1;
r2 >>= 1;
}
updateFrom(l, r);
}
public int maxRight(int l, final java.util.function.Predicate<S> g) {
inclusiveRangeCheck(l);
if (!g.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (l == MAX) return MAX;
l += N;
pushTo(l);
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!g.test(Op.apply(sum, Dat[l]))) {
while (l < N) {
push(l);
l = l << 1;
if (g.test(Op.apply(sum, Dat[l]))) {
sum = Op.apply(sum, Dat[l]);
l++;
}
}
return l - N;
}
sum = Op.apply(sum, Dat[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, final java.util.function.Predicate<S> g) {
inclusiveRangeCheck(r);
if (!g.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (r == 0) return 0;
r += N;
pushTo(r - 1);
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!g.test(Op.apply(Dat[r], sum))) {
while (r < N) {
push(r);
r = r << 1 | 1;
if (g.test(Op.apply(Dat[r], sum))) {
sum = Op.apply(Dat[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = Op.apply(Dat[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(final int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(String.format("Index %d is not in [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(final int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(String.format("Index %d is not in [%d, %d].", p, 0, MAX));
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(final int newIndent) { this.indent = newIndent; }
@Override
public String toString() {
return toString(1, 0);
}
private String toString(final int k, final int sp) {
if (k >= N) return indent(sp) + Dat[k];
String s = "";
s += toString(k << 1 | 1, sp + indent);
s += "\n";
s += indent(sp) + Dat[k] + "/" + Laz[k];
s += "\n";
s += toString(k << 1 | 0, sp + indent);
return s;
}
private static String indent(int n) {
final StringBuilder sb = new StringBuilder();
while (n-- > 0) sb.append(' ');
return sb.toString();
}
}
public static final class MultiSet<T> extends java.util.TreeMap<T, Long> {
private static final long serialVersionUID = 1L;
public MultiSet() {
super();
}
public MultiSet(final java.util.List<T> list) {
super();
for (final T e : list) this.addOne(e);
}
public long count(final Object elm) {
return getOrDefault(elm, 0L);
}
public void add(final T elm, final long amount) {
if (!containsKey(elm)) put(elm, amount);
else replace(elm, get(elm) + amount);
if (this.count(elm) == 0) this.remove(elm);
}
public void addOne(final T elm) {
this.add(elm, 1);
}
public void removeOne(final T elm) {
this.add(elm, -1);
}
public void removeAll(final T elm) {
this.add(elm, -this.count(elm));
}
public static <T> MultiSet<T> merge(final MultiSet<T> a, final MultiSet<T> b) {
final MultiSet<T> c = new MultiSet<>();
for (final T x : a.keySet()) c.add(x, a.count(x));
for (final T y : b.keySet()) c.add(y, b.count(y));
return c;
}
}
}
/**
* 高速な入出力を提供します。
*
* @author 31536000
*
*/
final class FastIO implements AutoCloseable {
private Input in;
private Output out;
private Output err;
private boolean outFlush = false;
private boolean autoOutFlush = true;
public static final java.io.PrintStream DUMMY_OUT = new DummyOut();
public FastIO() {
this(System.in, System.out, System.err);
}
public FastIO(final java.io.InputStream in, final java.io.PrintStream out, final java.io.PrintStream err) {
this.in = in instanceof Input ? (Input) in : new Input(in);
if (out instanceof Output) {
this.out = (Output) out;
} else {
this.out = new Output(out);
this.out.setAutoFlush(false);
}
if (err instanceof Output) {
this.err = (Output) err;
} else {
this.err = new Output(err);
this.err.setAutoFlush(false);
}
}
public static void setFastStandardOutput(final boolean set) {
final java.io.FileOutputStream fdOut = new java.io.FileOutputStream(java.io.FileDescriptor.out);
final java.io.FileOutputStream fdErr = new java.io.FileOutputStream(java.io.FileDescriptor.err);
if (set) {
System.out.flush();
final Output out = new Output(fdOut);
out.setAutoFlush(false);
System.setOut(out);
System.err.flush();
final Output err = new Output(fdErr);
err.setAutoFlush(false);
System.setErr(err);
} else {
System.out.flush();
final java.io.PrintStream out = new java.io.PrintStream(new java.io.BufferedOutputStream(fdOut, 128), true);
System.setOut(out);
System.err.flush();
final java.io.PrintStream err = new java.io.PrintStream(new java.io.BufferedOutputStream(fdErr, 128), true);
System.setErr(err);
}
}
public void setInputStream(final java.io.InputStream in) {
if (this.in == in) return;
this.in.close();
this.in = in instanceof Input ? (Input) in : new Input(in);
}
public void setInputStream(final java.io.File in) {
try {
this.in.close();
final java.io.InputStream input = new java.io.FileInputStream(in);
this.in = new Input(input);
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public Input getInputStream() { return in; }
public void setOutputStream(final java.io.OutputStream out) {
if (this.out == out) {
this.out.flush();
}
final boolean flush = this.out.autoFlush;
this.out.close();
if (out instanceof Output) {
this.out = (Output) out;
this.out.setAutoFlush(flush);
} else {
this.out = new Output(out);
this.out.setAutoFlush(flush);
}
}
public void setOutputStream(final java.io.File out) {
try {
setOutputStream(new java.io.FileOutputStream(out));
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public void setOutputStream(final java.io.FileDescriptor out) {
setOutputStream(new java.io.FileOutputStream(out));
}
public Output getOutputStream() { return out; }
public void setErrorStream(final java.io.OutputStream err) {
if (this.err == err) {
this.err.flush();
}
final boolean flush = this.err.autoFlush;
this.err.close();
if (err instanceof Output) {
this.err = (Output) err;
this.err.setAutoFlush(flush);
} else {
this.err = new Output(err);
this.err.setAutoFlush(flush);
}
}
public void setErrorStream(final java.io.File err) {
try {
setErrorStream(new java.io.FileOutputStream(err));
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public void setErrorStream(final java.io.FileDescriptor err) {
setErrorStream(new java.io.FileOutputStream(err));
}
public Output getErrorStream() { return err; }
public void setAutoFlush(final boolean flush) {
out.setAutoFlush(flush);
err.setAutoFlush(flush);
}
public void setAutoOutFlush(final boolean flush) { autoOutFlush = flush; }
private void autoFlush() {
if (outFlush) {
outFlush = false;
flush();
}
}
public boolean hasNext() {
autoFlush();
return in.hasNext();
}
public boolean nextBoolean() {
autoFlush();
return in.nextBoolean();
}
public boolean[] nextBoolean(final char T) {
final char[] s = nextChars();
final boolean[] ret = new boolean[s.length];
for (int i = 0; i < ret.length; ++i) ret[i] = s[i] == T;
return ret;
}
public boolean[][] nextBoolean(final char T, final int height) {
final boolean[][] ret = new boolean[height][];
for (int i = 0; i < ret.length; ++i) {
final char[] s = nextChars();
ret[i] = new boolean[s.length];
for (int j = 0; j < ret[i].length; ++j) ret[i][j] = s[j] == T;
}
return ret;
}
public byte nextByte() {
autoFlush();
return in.nextByte();
}
public short nextShort() {
autoFlush();
return in.nextShort();
}
public short[] nextShort(final int width) {
final short[] ret = new short[width];
for (int i = 0; i < width; ++i) ret[i] = nextShort();
return ret;
}
public short[][] nextShort(final int width, final int height) {
final short[][] ret = new short[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[i][j] = nextShort();
return ret;
}
public int nextInt() {
autoFlush();
return in.nextInt();
}
public int[] nextInt(final int width) {
final int[] ret = new int[width];
for (int i = 0; i < width; ++i) ret[i] = nextInt();
return ret;
}
public int[][] nextInt(final int width, final int height) {
final int[][] ret = new int[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[i][j] = nextInt();
return ret;
}
public int[] nextInts() {
return nextInts(" ");
}
public int[] nextInts(final String parse) {
final String[] get = nextLine().split(parse);
final int[] ret = new int[get.length];
for (int i = 0; i < ret.length; ++i) ret[i] = Integer.valueOf(get[i]);
return ret;
}
public long nextLong() {
autoFlush();
return in.nextLong();
}
public long[] nextLong(final int width) {
final long[] ret = new long[width];
for (int i = 0; i < width; ++i) ret[i] = nextLong();
return ret;
}
public long[][] nextLong(final int width, final int height) {
final long[][] ret = new long[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[j][i] = nextLong();
return ret;
}
public long[] nextLongs() {
return nextLongs(" ");
}
public long[] nextLongs(final String parse) {
final String[] get = nextLine().split(parse);
final long[] ret = new long[get.length];
for (int i = 0; i < ret.length; ++i) ret[i] = Long.valueOf(get[i]);
return ret;
}
public float nextFloat() {
autoFlush();
return in.nextFloat();
}
public double nextDouble() {
autoFlush();
return in.nextDouble();
}
public char nextChar() {
autoFlush();
return in.nextChar();
}
public char[] nextChars() {
return next().toCharArray();
}
public char[] nextChars(final char around) {
return (around + next() + around).toCharArray();
}
public char[][] nextChars(final int height) {
final char[][] ret = new char[height][];
for (int i = 0; i < ret.length; ++i) ret[i] = nextChars();
return ret;
}
public char[][] nextChars(final int height, final char around) {
final char[][] ret = new char[height + 2][];
for (int i = 1; i <= height; ++i) ret[i] = nextChars(around);
java.util.Arrays.fill(ret[0] = new char[ret[1].length], around);
java.util.Arrays.fill(ret[ret.length - 1] = new char[ret[0].length], around);
return ret;
}
public String next() {
autoFlush();
return in.next();
}
public String nextLine() {
autoFlush();
return in.nextLine();
}
public Point nextPoint() {
return new Point(nextInt(), nextInt());
}
public Point[] nextPoint(final int width) {
final Point[] ret = new Point[width];
for (int i = 0; i < width; ++i) ret[i] = nextPoint();
return ret;
}
public boolean print(final boolean b) {
out.print(b);
outFlush = autoOutFlush;
return b;
}
public byte print(final byte b) {
out.print(b);
outFlush = autoOutFlush;
return b;
}
public short print(final short s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public int print(final int i) {
out.print(i);
outFlush = autoOutFlush;
return i;
}
public long print(final long l) {
out.print(l);
outFlush = autoOutFlush;
return l;
}
public float print(final float f) {
out.print(f);
outFlush = autoOutFlush;
return f;
}
public double print(final double d) {
out.print(d);
outFlush = autoOutFlush;
return d;
}
public double print(final double d, final int length) {
out.print(d, length);
outFlush = autoOutFlush;
return d;
}
public char print(final char c) {
out.print(c);
outFlush = autoOutFlush;
return c;
}
public char[] print(final char[] s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public String print(final String s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public Object print(final Object obj) {
if (obj != null && obj.getClass().isArray()) {
if (obj instanceof boolean[][]) print(obj, "\n", " ");
else if (obj instanceof byte[][]) print(obj, "\n", " ");
else if (obj instanceof short[][]) print(obj, "\n", " ");
else if (obj instanceof int[][]) print(obj, "\n", " ");
else if (obj instanceof long[][]) print(obj, "\n", " ");
else if (obj instanceof float[][]) print(obj, "\n", " ");
else if (obj instanceof double[][]) print(obj, "\n", " ");
else if (obj instanceof char[][]) print(obj, "\n", " ");
else if (obj instanceof Object[][]) print(obj, "\n", " ");
else print(obj, " ");
} else {
out.print(obj);
outFlush = autoOutFlush;
}
return obj;
}
public Object print(final Object array, final String... parse) {
print(array, 0, parse);
return array;
}
private Object print(final Object array, final int check, final String... parse) {
if (check >= parse.length) {
if (array != null && array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
print(array);
return array;
}
final String str = parse[check];
if (array instanceof Object[]) {
final Object[] obj = (Object[]) array;
if (obj.length == 0) return array;
print(obj[0], check + 1, parse);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i], check + 1, parse);
}
return array;
}
if (array instanceof java.util.Collection) {
final java.util.Iterator<?> iter = ((java.util.Collection<?>) array).iterator();
if (!iter.hasNext()) return array;
print(iter.next(), check + 1, parse);
while (iter.hasNext()) {
print(str);
print(iter.next(), check + 1, parse);
}
return array;
}
if (!array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
if (check != parse.length - 1) throw new IllegalArgumentException("not equal dimension");
if (array instanceof boolean[]) {
final boolean[] obj = (boolean[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof byte[]) {
final byte[] obj = (byte[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
return array;
} else if (array instanceof short[]) {
final short[] obj = (short[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof int[]) {
final int[] obj = (int[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof long[]) {
final long[] obj = (long[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof float[]) {
final float[] obj = (float[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof double[]) {
final double[] obj = (double[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof char[]) {
final char[] obj = (char[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else throw new AssertionError();
return array;
}
public Object[] print(final String parse, final Object... args) {
print(args[0]);
for (int i = 1; i < args.length; ++i) {
print(parse);
print(args[i]);
}
return args;
}
public Object[] printf(final String format, final Object... args) {
out.printf(format, args);
outFlush = autoOutFlush;
return args;
}
public Object[] printf(final java.util.Locale l, final String format, final Object... args) {
out.printf(l, format, args);
outFlush = autoOutFlush;
return args;
}
public void println() {
out.println();
outFlush = autoOutFlush;
}
public boolean println(final boolean b) {
out.println(b);
outFlush = autoOutFlush;
return b;
}
public byte println(final byte b) {
out.println(b);
outFlush = autoOutFlush;
return b;
}
public short println(final short s) {
out.println(s);
outFlush = autoOutFlush;
return s;
}
public int println(final int i) {
out.println(i);
outFlush = autoOutFlush;
return i;
}
public long println(final long l) {
out.println(l);
outFlush = autoOutFlush;
return l;
}
public float println(final float f) {
out.println(f);
outFlush = autoOutFlush;
return f;
}
public double println(final double d) {
out.println(d);
outFlush = autoOutFlush;
return d;
}
public double println(final double d, final int length) {
out.println(d, length);
outFlush = autoOutFlush;
return d;
}
public char println(final char c) {
out.println(c);
outFlush = autoOutFlush;
return c;
}
public char[] println(final char[] s) {
out.println(s);
outFlush = autoOutFlush;
return s;
}
public String println(final String s) {
out.println(s);
return s;
}
public Object println(final Object obj) {
print(obj);
println();
return obj;
}
public Object println(final Object array, final String... parse) {
print(array, parse);
println();
return array;
}
public boolean debug(final boolean b) {
err.print(b);
outFlush = autoOutFlush;
return b;
}
public byte debug(final byte b) {
err.print(b);
outFlush = autoOutFlush;
return b;
}
public short debug(final short s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public int debug(final int i) {
err.print(i);
outFlush = autoOutFlush;
return i;
}
public long debug(final long l) {
err.print(l);
outFlush = autoOutFlush;
return l;
}
public float debug(final float f) {
err.print(f);
outFlush = autoOutFlush;
return f;
}
public double debug(final double d) {
err.print(d);
outFlush = autoOutFlush;
return d;
}
public double debug(final double d, final int length) {
err.print(d, length);
outFlush = autoOutFlush;
return d;
}
public char debug(final char c) {
err.print(c);
outFlush = autoOutFlush;
return c;
}
public char[] debug(final char[] s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public String debug(final String s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public Object debug(final Object obj) {
if (obj != null && obj.getClass().isArray()) {
if (obj instanceof boolean[][]) debug(obj, "\n", " ");
else if (obj instanceof byte[][]) debug(obj, "\n", " ");
else if (obj instanceof short[][]) debug(obj, "\n", " ");
else if (obj instanceof int[][]) debug(obj, "\n", " ");
else if (obj instanceof long[][]) debug(obj, "\n", " ");
else if (obj instanceof float[][]) debug(obj, "\n", " ");
else if (obj instanceof double[][]) debug(obj, "\n", " ");
else if (obj instanceof char[][]) debug(obj, "\n", " ");
else if (obj instanceof Object[][]) debug(obj, "\n", " ");
else debug(obj, " ");
} else {
err.print(obj);
outFlush = autoOutFlush;
}
return obj;
}
public Object debug(final Object array, final String... parse) {
debug(array, 0, parse);
return array;
}
private Object debug(final Object array, final int check, final String... parse) {
if (check >= parse.length) {
if (array != null && array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
debug(array);
return array;
}
final String str = parse[check];
if (array instanceof Object[]) {
final Object[] obj = (Object[]) array;
if (obj.length == 0) return array;
debug(obj[0], check + 1, parse);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i], check + 1, parse);
}
return array;
}
if (array instanceof java.util.Collection) {
final java.util.Iterator<?> iter = ((java.util.Collection<?>) array).iterator();
if (!iter.hasNext()) return array;
debug(iter.next(), check + 1, parse);
while (iter.hasNext()) {
debug(str);
debug(iter.next(), check + 1, parse);
}
return array;
}
if (!array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
if (check != parse.length - 1) throw new IllegalArgumentException("not equal dimension");
if (array instanceof boolean[]) {
final boolean[] obj = (boolean[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof byte[]) {
final byte[] obj = (byte[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
return array;
} else if (array instanceof short[]) {
final short[] obj = (short[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof int[]) {
final int[] obj = (int[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof long[]) {
final long[] obj = (long[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof float[]) {
final float[] obj = (float[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof double[]) {
final double[] obj = (double[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof char[]) {
final char[] obj = (char[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else throw new AssertionError();
return array;
}
public Object[] debug(final String parse, final Object... args) {
debug(args[0]);
for (int i = 1; i < args.length; ++i) {
debug(parse);
debug(args[i]);
}
return args;
}
public Object[] debugf(final String format, final Object... args) {
err.printf(format, args);
outFlush = autoOutFlush;
return args;
}
public Object[] debugf(final java.util.Locale l, final String format, final Object... args) {
err.printf(l, format, args);
outFlush = autoOutFlush;
return args;
}
public void debugln() {
err.println();
outFlush = autoOutFlush;
}
public boolean debugln(final boolean b) {
err.println(b);
outFlush = autoOutFlush;
return b;
}
public byte debugln(final byte b) {
err.println(b);
outFlush = autoOutFlush;
return b;
}
public short debugln(final short s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public int debugln(final int i) {
err.println(i);
outFlush = autoOutFlush;
return i;
}
public long debugln(final long l) {
err.println(l);
outFlush = autoOutFlush;
return l;
}
public float debugln(final float f) {
err.println(f);
outFlush = autoOutFlush;
return f;
}
public double debugln(final double d) {
err.println(d);
outFlush = autoOutFlush;
return d;
}
public double debugln(final double d, final int length) {
err.println(d, length);
outFlush = autoOutFlush;
return d;
}
public char debugln(final char c) {
err.println(c);
outFlush = autoOutFlush;
return c;
}
public char[] debugln(final char[] s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public String debugln(final String s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public Object debugln(final Object obj) {
debug(obj);
debugln();
return obj;
}
public Object debugln(final Object array, final String... parse) {
debug(array, parse);
debugln();
return array;
}
public void flush() {
out.flush();
err.flush();
outFlush = false;
}
@Override
public void close() {
out.close();
err.close();
}
public static final class Input extends java.io.InputStream {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1 << 13];
private int read = 0;
private int length = 0;
public Input(final java.io.InputStream in) {
this.in = in;
}
@Override
public int available() {
try {
return in.available();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
return 0;
}
@Override
public void close() {
try {
in.close();
read = length = 0;
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public int read() {
if (hasNextByte()) return nextByte();
return 0;
}
private boolean hasNextByte() {
if (read < length) return true;
read = 0;
try {
length = in.read(buffer);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
return length > 0;
}
private static boolean isPrintableChar(final byte c) {
return 32 < c || c < 0;
}
private static boolean isNumber(final byte c) {
return '0' <= c && c <= '9';
}
private boolean readNewLine() {
if (hasNextByte()) {
if (buffer[read] == '\r') {
++read;
if (hasNextByte() && buffer[read] == '\n') ++read;
return true;
}
if (buffer[read] == '\n') {
++read;
return true;
}
}
return false;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[read])) read++;
return hasNextByte();
}
private byte nextTokenByte() {
while (hasNextByte() && !isPrintableChar(buffer[read])) read++;
return buffer[read++];
}
public boolean nextBoolean() {
return Boolean.valueOf(next());
}
public byte nextByte() {
if (hasNextByte()) return buffer[read++];
throw new java.util.NoSuchElementException();
}
public short nextShort() {
byte b = nextTokenByte();
short n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = (short) (n * 10 + '0' - b);
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = (short) (n * 10 + b - '0'); while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public int nextInt() {
byte b = nextTokenByte();
int n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = n * 10 + '0' - b;
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = n * 10 + b - '0'; while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public long nextLong() {
byte b = nextTokenByte();
long n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = n * 10 + '0' - b;
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = n * 10 + b - '0'; while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public float nextFloat() {
return Float.parseFloat(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public char nextChar() {
final byte b = nextByte();
if ((b & 0x80) == 0) return (char) b;
if ((b & 0x20) == 0) return (char) ((b & 0x1F) << 6 | nextByte() & 0x3F);
return (char) ((b & 0xF) << 12 | (nextByte() & 0x3F) << 6 | nextByte() & 0x3F);
}
public String next() {
if (!hasNext()) throw new java.util.NoSuchElementException();
final StringBuilder sb = new StringBuilder();
do sb.append(nextChar()); while (hasNextByte() && isPrintableChar(buffer[read]));
return sb.toString();
}
public String nextLine() {
final StringBuilder sb = new StringBuilder();
while (!readNewLine()) sb.append(nextChar());
return sb.toString();
}
}
public static final class Output extends java.io.PrintStream {
private final byte[] buffer = new byte[1 << 13];
private int read = 0;
private boolean autoFlush = true;
public Output(final java.io.OutputStream out) {
super(out);
}
public void setAutoFlush(final boolean autoFlush) { this.autoFlush = autoFlush; }
@Override
public void close() {
if (out == System.out || out == System.err || this == System.out || this == System.err) {
flush();
return;
}
try {
flush();
out.close();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public void flush() {
try {
write();
out.flush();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public void write(final byte[] b) {
if (b.length < buffer.length) {
ensureBuffer(b.length);
System.arraycopy(b, 0, buffer, read, b.length);
read += b.length;
} else {
write();
try {
out.write(b);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
}
@Override
public void write(final byte[] b, final int off, final int len) {
if (len < buffer.length) {
ensureBuffer(len);
System.arraycopy(b, off, buffer, read, len);
read += len;
} else {
write();
try {
out.write(b, off, len);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
}
@Override
public void write(final int b) {
print((byte) b);
}
private void write() {
try {
out.write(buffer, 0, read);
read = 0;
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
private void ensureBuffer(final int size) {
if (read + size > buffer.length) {
write();
}
}
@Override
public void print(final boolean b) {
if (b) {
ensureBuffer(4);
buffer[read++] = 't';
buffer[read++] = 'r';
buffer[read++] = 'u';
buffer[read++] = 'e';
} else {
ensureBuffer(5);
buffer[read++] = 'f';
buffer[read++] = 'a';
buffer[read++] = 'l';
buffer[read++] = 's';
buffer[read++] = 'e';
}
}
public void print(final byte b) {
ensureBuffer(1);
buffer[read++] = b;
}
private static int digit(final short s) {
return s >= 100 ? s >= 1000 ? s >= 10000 ? 5 : 4 : 3 : s >= 10 ? 2 : 1;
}
public void print(short s) {
ensureBuffer(6);
if (s < 0) {
if (s == -32768) {
buffer[read++] = '-';
buffer[read++] = '3';
buffer[read++] = '2';
buffer[read++] = '7';
buffer[read++] = '6';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
s = (short) -s;
}
final int digit = digit(s);
int i = read + digit;
while (i-- > read) {
buffer[i] = (byte) (s % 10 + '0');
s /= 10;
}
read += digit;
}
private static int digit(final int i) {
if (i >= 1000000000) return 10;
if (i >= 100000000) return 9;
if (i >= 10000000) return 8;
if (i >= 1000000) return 7;
if (i >= 100000) return 6;
if (i >= 10000) return 5;
if (i >= 1000) return 4;
if (i >= 100) return 3;
if (i >= 10) return 2;
return 1;
}
@Override
public void print(int i) {
ensureBuffer(11);
if (i < 0) {
if (i == -2147483648) {
buffer[read++] = '-';
buffer[read++] = '2';
buffer[read++] = '1';
buffer[read++] = '4';
buffer[read++] = '7';
buffer[read++] = '4';
buffer[read++] = '8';
buffer[read++] = '3';
buffer[read++] = '6';
buffer[read++] = '4';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
i = -i;
}
final int digit = digit(i);
int j = read + digit;
while (j-- > read) {
buffer[j] = (byte) (i % 10 + '0');
i /= 10;
}
read += digit;
}
private static int digit(final long l) {
if (l >= 1000000000000000000L) return 19;
if (l >= 100000000000000000L) return 18;
if (l >= 10000000000000000L) return 17;
if (l >= 1000000000000000L) return 16;
if (l >= 100000000000000L) return 15;
if (l >= 10000000000000L) return 14;
if (l >= 1000000000000L) return 13;
if (l >= 100000000000L) return 12;
if (l >= 10000000000L) return 11;
if (l >= 1000000000L) return 10;
if (l >= 100000000L) return 9;
if (l >= 10000000L) return 8;
if (l >= 1000000L) return 7;
if (l >= 100000L) return 6;
if (l >= 10000L) return 5;
if (l >= 1000L) return 4;
if (l >= 100L) return 3;
if (l >= 10L) return 2;
return 1;
}
@Override
public void print(long l) {
ensureBuffer(20);
if (l < 0) {
if (l == -9223372036854775808L) {
buffer[read++] = '-';
buffer[read++] = '9';
buffer[read++] = '2';
buffer[read++] = '2';
buffer[read++] = '3';
buffer[read++] = '3';
buffer[read++] = '7';
buffer[read++] = '2';
buffer[read++] = '0';
buffer[read++] = '3';
buffer[read++] = '6';
buffer[read++] = '8';
buffer[read++] = '5';
buffer[read++] = '4';
buffer[read++] = '7';
buffer[read++] = '7';
buffer[read++] = '5';
buffer[read++] = '8';
buffer[read++] = '0';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
l = -l;
}
final int digit = digit(l);
int i = read + digit;
while (i-- > read) {
buffer[i] = (byte) (l % 10 + '0');
l /= 10;
}
read += digit;
}
@Override
public void print(final float f) {
print(Float.toString(f));
}
@Override
public void print(final double d) {
print(Double.toString(d));
}
public void print(double d, final int n) {
if (d < 0) {
ensureBuffer(1);
buffer[read++] = '-';
d = -d;
}
d += Math.pow(10, -n) / 2;
final long l = (long) d;
print(l);
ensureBuffer(n + 1);
buffer[read++] = '.';
d -= l;
for (int i = 0; i < n; i++) {
d *= 10;
final int in = (int) d;
buffer[read++] = (byte) (in + '0');
d -= in;
}
}
@Override
public void print(final char c) {
if (c < 0x80) {
ensureBuffer(1);
buffer[read++] = (byte) c;
} else if (c < 0x07FF) {
ensureBuffer(2);
buffer[read++] = (byte) (c >> 6 & 0x3F | 0x80);
buffer[read++] = (byte) (c & 0x3F | 0x80);
} else {
ensureBuffer(3);
buffer[read++] = (byte) (c >> 12 & 0xF | 0xE0);
buffer[read++] = (byte) (c >> 6 & 0x3F | 0x80);
buffer[read++] = (byte) (c & 0x3F | 0x80);
}
}
@Override
public void print(final char[] s) {
for (final char i : s) print(i);
}
@Override
public void print(final String s) {
print(s.toCharArray());
}
@Override
public void print(final Object o) {
print(o.toString());
}
@Override
public Output printf(final java.util.Locale l, final String format, final Object... args) {
print(String.format(l, format, args));
return this;
}
@Override
public Output printf(final String format, final Object... args) {
print(String.format(format, args));
return this;
}
@Override
public void println() {
ensureBuffer(1);
buffer[read++] = '\n';
if (autoFlush) flush();
}
@Override
public void println(final boolean b) {
print(b);
println();
}
public void println(final byte b) {
print(b);
println();
}
public void println(final short s) {
print(s);
println();
}
@Override
public void println(final int i) {
print(i);
println();
}
@Override
public void println(final long l) {
print(l);
println();
}
@Override
public void println(final float f) {
print(f);
println();
}
@Override
public void println(final double d) {
print(d);
println();
}
public void println(final double d, final int n) {
print(d, n);
println();
}
@Override
public void println(final char c) {
print(c);
println();
}
@Override
public void println(final char[] s) {
print(s);
println();
}
@Override
public void println(final String s) {
print(s);
println();
}
@Override
public void println(final Object o) {
print(o);
println();
}
@Override
public Output append(final char c) {
print(c);
return this;
}
@Override
public Output append(CharSequence csq) {
if (csq == null) csq = "null";
print(csq.toString());
return this;
}
@Override
public Output append(CharSequence csq, final int start, final int end) {
if (csq == null) csq = "null";
print(csq.subSequence(start, end).toString());
return this;
}
}
public static final class DummyOut extends java.io.PrintStream {
public DummyOut() {
super(new Dummy());
}
private static class Dummy extends java.io.OutputStream {
@Override
public void close() {
}
@Override
public void flush() {
}
@Override
public void write(final byte[] b) {
}
@Override
public void write(final byte[] b, final int off, final int len) {
}
@Override
public void write(final int b) {
}
}
}
}
import java.awt.Point;
import java.io.Serializable;
import java.math.BigInteger;
import java.util.AbstractList;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.RandomAccess;
import java.util.Set;
import java.util.TreeMap;
import java.util.function.BinaryOperator;
import java.util.function.UnaryOperator;
public class Main implements Runnable {
private void solve(final FastIO io, final String[] args) {
io.setAutoFlush(false);
io.setAutoOutFlush(false);
/*
* author: 31536000
* AtCoder Regular Contest 164 E問題
* 考察メモ
* まずdは明らかで、ceil(log(N))
* 更に、2^d - N個は選ばれても上にできるから、問題名のは残りの2N - 2^d個
* これは選ばれると下を呼ぶので、こういうのを最小化したい
*
* できること
* 2. 最下層ではない葉を1個置く
* 3. 葉を2連続で置く (片方だけ含む区間の個数だけペナルティ2)
*
* 左からi番目まで見て、最下層の葉をj個置いた時のペナルティの最小値を考える
* 予め、各区間についてここにこの操作をするとペナルティ、を計算しておくと行けるか
*
* あー、調査されないなら別に忘れても良いのね
* N=4000, Q=[5, 6)だとする
* すると、次のことをやっていい
* [0, N)
* [0, 6) [6, N)
* [0, 5) [5, 6)
* 残りはさておき、深さは2で抑えられたのか
* つまり座圧してから考えて良いのね
* あれ、座圧すると葉の話って大丈夫？
*
*/
int N = io.nextInt(), Q = io.nextInt();
TreeMap<Integer, Integer> compress = new TreeMap<>();
compress.put(0, -1);
compress.put(N, -1);
int[] L = new int[Q], R = new int[Q];
for (int i = 0;i < Q;++ i) {
L[i] = io.nextInt() - 1;
R[i] = io.nextInt();
compress.put(L[i], -1);
compress.put(R[i], -1);
}
int[] penalty;
int[] penalty2;
{
N = compress.size() - 1;
int val = 0;
for (int key : compress.keySet().toArray(new Integer[0])) compress.put(key, val++);
penalty = new int[N];
for (int i = 0;i < Q;++ i) {
int l = compress.get(L[i]), r = compress.get(R[i]);
if (l != 0) penalty[l - 1] += 2;
penalty[r - 1] += 2;
}
}
int d = 0;
while(1 << d < N) ++ d;
int top = (1 << d) - N;
int[][] dp = new int[N + 2][top + 1]; // dp[i][j]: 左からi番目まで見て、最下層でないものをj個設置したときのペナルティの最小値
for (int[] i : dp) Arrays.fill(i, exponent10(1, 9));
dp[0][0] = 0;
for (int i = 0;i < N;++ i) {
int[] now = dp[i], next = dp[i + 1], next2 = dp[i + 2];
for (int j = 0;j <= top;++ j) {
if (j != top) next[j + 1] = Math.min(next[j + 1], now[j]);// 最下層でない葉を1個
next2[j] = Math.min(next2[j], now[j] + penalty[i]); // 最下層を2個
}
}
if (d == 0) io.println("0 " + Q);
else io.println(d + " " + dp[N][top]);
}
/** デバッグ用コードのお供に */
private static boolean DEBUG = false;
/** 確保するメモリの大きさ(単位: MB) */
private static final long MEMORY = 64;
private final FastIO io;
private final String[] args;
public static void main(final String[] args) {
Thread.setDefaultUncaughtExceptionHandler((t, e) -> {
e.printStackTrace();
System.exit(1);
});
FastIO.setFastStandardOutput(true);
new Thread(null, new Main(args), "", MEMORY * 1048576L).start();
}
public Main(final String[] args) {
this(new FastIO(), args);
}
public Main(final FastIO io, final String... args) {
this.io = io;
this.args = args;
if (DEBUG) io.setAutoFlush(true);
}
@Override
public void run() {
try {
solve(io, args);
} catch (final Throwable e) {
throw e;
} finally {
io.close();
FastIO.setFastStandardOutput(false);
}
}
// 以下、ライブラリ
/**
* 指数表記の値を整数で返します。
*
* @param n 仮数部
* @param e 指数部
* @return n * 10^e
*/
public static int exponent10(final int n, final int e) {
return n * pow(10, e);
}
/**
* 指数表記の値を整数で返します。
*
* @param n 仮数部
* @param e 指数部
* @return n * 10^e
*/
public static long exponent10L(final int n, final int e) {
return n * pow(10L, e);
}
/**
* aのb乗を返します。
*
* @param a 整数
* @param b 整数
* @return aのb乗
*/
public static int pow(final int a, int b) {
int ans = 1;
for (int mul = a; b > 0; b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
return ans;
}
/**
* aのb乗をmodを法として計算したものを返します。
*
* @param a 整数
* @param b 整数
* @param mod 法
* @return aのb乗をmodを法として計算したもの
*/
public static int pow(int a, int b, final int mod) {
a %= mod;
if (a < 0) a += mod;
if (b < 0) {
b %= mod - 1;
b += mod - 1;
}
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul = mul * mul % mod) if ((b & 1) != 0) ans = ans * mul % mod;
return (int) ans;
}
/**
* aのb乗を返します。
*
* @param a 整数
* @param b 整数
* @return aのb乗
*/
public static long pow(final long a, long b) {
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
return ans;
}
/**
* aのb乗をmodを法として計算したものを返します。
*
* @param a 整数
* @param b 整数
* @param mod 法
* @return aのb乗をmodを法として計算したもの
*/
public static int pow(long a, long b, final int mod) {
a %= mod;
if (a < 0) a += mod;
if (b < 0) {
b %= mod - 1;
b += mod - 1;
}
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul = mul * mul % mod) if ((b & 1) != 0) ans = ans * mul % mod;
return (int) ans;
}
public enum BoundType {
CLOSED, OPEN;
}
public static class Range<C> implements Serializable {
private static final long serialVersionUID = -4702828934863023392L;
protected C lower;
protected C upper;
protected BoundType lowerType;
protected BoundType upperType;
private Comparator<? super C> comparator;
protected Range(final C lower, final BoundType lowerType, final C upper, final BoundType upperType) {
this(lower, lowerType, upper, upperType, null);
}
protected Range(final C lower, final BoundType lowerType, final C upper, final BoundType upperType,
final Comparator<? super C> comparator) {
this.lower = lower;
this.upper = upper;
this.lowerType = lowerType;
this.upperType = upperType;
this.comparator = comparator;
}
public static <C extends Comparable<? super C>> Range<C> range(final C lower, final BoundType lowerType,
final C upper, final BoundType upperType) {
if (lower != null && upper != null) {
final int comp = lower.compareTo(upper);
if (comp > 0) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
}
return new Range<>(lower, lowerType, upper, upperType);
}
public static <C> Range<C> range(final C lower, final BoundType lowerType, final C upper,
final BoundType upperType, final Comparator<? super C> comparator) {
if (lower != null && upper != null) {
final int comp = comparator.compare(lower, upper);
if (comp > 0) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
}
return new Range<>(lower, lowerType, upper, upperType, comparator);
}
public static <C extends Comparable<? super C>> Range<C> all() {
return range((C) null, BoundType.OPEN, null, BoundType.OPEN);
}
public static <C> Range<C> all(final Comparator<? super C> comparator) {
return range((C) null, BoundType.OPEN, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> atMost(final C upper) {
return range(null, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static <C> Range<C> atMost(final C upper, final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> lessThan(final C upper) {
return range(null, BoundType.OPEN, upper, BoundType.OPEN);
}
public static <C> Range<C> lessThan(final C upper, final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> downTo(final C upper, final BoundType boundType) {
return range(null, BoundType.OPEN, upper, boundType);
}
public static <C> Range<C> downTo(final C upper, final BoundType boundType,
final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, boundType, comparator);
}
public static <C extends Comparable<? super C>> Range<C> atLeast(final C lower) {
return range(lower, BoundType.CLOSED, null, BoundType.OPEN);
}
public static <C> Range<C> atLeast(final C lower, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> greaterThan(final C lower) {
return range(lower, BoundType.OPEN, null, BoundType.OPEN);
}
public static <C> Range<C> greaterThan(final C lower, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> upTo(final C lower, final BoundType boundType) {
return range(lower, boundType, null, BoundType.OPEN);
}
public static <C> Range<C> upTo(final C lower, final BoundType boundType,
final Comparator<? super C> comparator) {
return range(lower, boundType, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> open(final C lower, final C upper) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN);
}
public static <C> Range<C> open(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> openClosed(final C lower, final C upper) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static <C> Range<C> openClosed(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> closedOpen(final C lower, final C upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static <C> Range<C> closedOpen(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> closed(final C lower, final C upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static <C> Range<C> closed(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> singleton(final C value) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED);
}
public static <C> Range<C> singleton(final C value, final Comparator<? super C> comparator) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> empty() {
return range((C) null, BoundType.CLOSED, null, BoundType.CLOSED);
}
public static <C> Range<C> empty(final Comparator<? super C> comparator) {
return range((C) null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> encloseAll(final Iterable<C> values) {
C lower = values.iterator().next();
C upper = lower;
for (final C i : values) {
if (lower.compareTo(i) > 0) lower = i;
if (upper.compareTo(i) < 0) upper = i;
}
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static <C> Range<C> encloseAll(final Iterable<C> values, final Comparator<? super C> comparator) {
C lower = values.iterator().next();
C upper = lower;
for (final C i : values) {
if (comparator.compare(lower, i) > 0) lower = i;
if (comparator.compare(upper, i) < 0) upper = i;
}
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);
}
protected int compareLower(final C value) {
return compareLower(value, BoundType.CLOSED);
}
protected int compareLower(final C value, final BoundType boundType) {
return compareLower(lower, lowerType, value, boundType);
}
protected int compareLower(final C lower, final BoundType lowerType, final C value) {
return compareLower(lower, lowerType, value, BoundType.CLOSED);
}
protected int compareLower(final C lower, final BoundType lowerType, final C value, final BoundType boundType) {
if (lower == null) return value == null ? 0 : -1;
else if (value == null) return 1;
int compare;
if (comparator == null) {
@SuppressWarnings("unchecked")
final Comparable<C> comp = (Comparable<C>) lower;
compare = comp.compareTo(value);
} else compare = comparator.compare(lower, value);
if (compare == 0) {
if (lowerType == BoundType.CLOSED) --compare;
if (boundType == BoundType.CLOSED) ++compare;
}
return compare;
}
protected int compareUpper(final C value) {
return compareUpper(value, BoundType.CLOSED);
}
protected int compareUpper(final C value, final BoundType boundType) {
return compareUpper(upper, upperType, value, boundType);
}
protected int compareUpper(final C upper, final BoundType upperType, final C value) {
return compareUpper(upper, upperType, value, BoundType.CLOSED);
}
protected int compareUpper(final C upper, final BoundType upperType, final C value, final BoundType boundType) {
if (upper == null) return value == null ? 0 : 1;
if (value == null) return -1;
int compare;
if (comparator == null) {
@SuppressWarnings("unchecked")
final Comparable<C> comp = (Comparable<C>) upper;
compare = comp.compareTo(value);
} else compare = comparator.compare(upper, value);
if (compare == 0) {
if (upperType == BoundType.CLOSED) ++compare;
if (boundType == BoundType.CLOSED) --compare;
}
return compare;
}
public boolean hasLowerBound() {
return lower != null;
}
public C lowerEndpoint() {
if (hasLowerBound()) return lower;
throw new IllegalStateException();
}
public BoundType lowerBoundType() {
if (hasLowerBound()) return lowerType;
throw new IllegalStateException();
}
public boolean hasUpperBound() {
return upper != null;
}
public C upperEndpoint() {
if (hasUpperBound()) return upper;
throw new IllegalStateException();
}
public BoundType upperBoundType() {
if (hasUpperBound()) return upperType;
throw new IllegalStateException();
}
/**
* この区間が空集合か判定します。
*
* @return 空集合ならばtrue
*/
public boolean isEmpty() { return lower == null && upper == null && lowerType == BoundType.CLOSED; }
/**
* 与えられた引数が区間の左側に位置するか判定します。<br>
* 接する場合は区間の左側ではないと判定します。
*
* @param value 調べる引数
* @return 区間の左側に位置するならtrue
*/
public boolean isLess(final C value) {
return isLess(value, BoundType.CLOSED);
}
protected boolean isLess(final C value, final BoundType boundType) {
return compareLower(value, boundType) > 0;
}
/**
* 与えられた引数が区間の右側に位置するか判定します。<br>
* 接する場合は区間の右側ではないと判定します。
*
* @param value 調べる引数
* @return 区間の右側に位置するならtrue
*/
public boolean isGreater(final C value) {
return isGreater(value, BoundType.CLOSED);
}
private boolean isGreater(final C value, final BoundType boundType) {
return compareUpper(value, boundType) < 0;
}
/**
* 与えられた引数が区間内に位置するか判定します。<br>
* 接する場合も区間内に位置すると判定します。
*
* @param value 調べる引数
* @return 区間内に位置するならtrue
*/
public boolean contains(final C value) {
return !isLess(value) && !isGreater(value) && !isEmpty();
}
/**
* 与えられた引数すべてが区間内に位置するか判定します。<br>
* 接する場合も区間内に位置すると判定します。
*
* @param value 調べる要素
* @return 全ての要素が区間内に位置するならtrue
*/
public boolean containsAll(final Iterable<? extends C> values) {
for (final C i : values) if (!contains(i)) return false;
return true;
}
/**
* 与えられた区間がこの区間に内包されるか判定します。<br>
*
* @param other
* @return 与えられた区間がこの区間に内包されるならtrue
*/
public boolean encloses(final Range<C> other) {
return !isLess(other.lower, other.lowerType) && !isGreater(other.upper, other.upperType);
}
/**
* 与えられた区間がこの区間と公差するか判定します。<br>
* 接する場合は公差するものとします。
*
* @param value 調べる引数
* @return 区間が交差するならtrue
*/
public boolean isConnected(final Range<C> other) {
if (this.isEmpty() || other.isEmpty()) return false;
C lower, upper;
BoundType lowerType, upperType;
if (isLess(other.lower, other.lowerType)) {
lower = other.lower;
lowerType = other.lowerType;
} else {
lower = this.lower;
lowerType = this.lowerType;
}
if (isGreater(other.upper, other.upperType)) {
upper = other.upper;
upperType = other.upperType;
} else {
upper = this.upper;
upperType = this.upperType;
}
if (lower == null || upper == null) return true;
final int comp = compareLower(lower, lowerType, upper, upperType);
return comp <= 0;
}
/**
* この区間との積集合を返します。
*
* @param connectedRange 積集合を求める区間
* @return 積集合
*/
public Range<C> intersection(final Range<C> connectedRange) {
if (this.isEmpty() || connectedRange.isEmpty()) {
if (comparator == null) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
return empty(comparator);
}
C lower, upper;
BoundType lowerType, upperType;
if (isLess(connectedRange.lower, connectedRange.lowerType)) {
lower = connectedRange.lower;
lowerType = connectedRange.lowerType;
} else {
lower = this.lower;
lowerType = this.lowerType;
}
if (isGreater(connectedRange.upper, connectedRange.upperType)) {
upper = connectedRange.upper;
upperType = connectedRange.upperType;
} else {
upper = this.upper;
upperType = this.upperType;
}
if (comparator == null) { return new Range<>(lower, lowerType, upper, upperType); }
return range(lower, lowerType, upper, upperType, comparator);
}
/**
* この区間との和集合を返します。
*
* @param other 和集合を求める区間
* @return 和集合
*/
public Range<C> span(final Range<C> other) {
if (other.isEmpty()) return new Range<>(lower, lowerType, upper, upperType);
C lower, upper;
BoundType lowerType, upperType;
if (isLess(other.lower, other.lowerType)) {
lower = this.lower;
lowerType = this.lowerType;
} else {
lower = other.lower;
lowerType = other.lowerType;
}
if (isGreater(other.upper, other.upperType)) {
upper = this.upper;
upperType = this.upperType;
} else {
upper = other.upper;
upperType = other.upperType;
}
return new Range<>(lower, lowerType, upper, upperType, comparator);
}
/**
* 区間スケジューリングを行います。<br>
* 計算量は要素数Nに対してO(NlogN)です。
*
* @param ranges 区間の集合
* @return 区間スケジューリングを行った際の一つの解
*/
public static <C> List<Range<C>> scheduling(final List<Range<C>> ranges) {
final PriorityQueue<Range<C>> pq = new PriorityQueue<>((l, r) -> l.compareUpper(r.upper, r.upperType));
final List<Range<C>> ret = new ArrayList<>();
Range<C> last = pq.poll();
if (pq.isEmpty()) return ret;
ret.add(last);
while (!pq.isEmpty()) {
final Range<C> tmp = pq.poll();
if (tmp.compareLower(last.upper, last.upperType) > 0) {
ret.add(tmp);
last = tmp;
}
}
return ret;
}
@Override
public boolean equals(final Object object) {
if (this == object) return true;
if (object instanceof Range) {
@SuppressWarnings("unchecked")
final Range<C> comp = (Range<C>) object;
return compareLower(comp.lower, comp.lowerType) == 0 && compareUpper(comp.upper, comp.upperType) == 0
&& lowerType == comp.lowerType && upperType == comp.upperType;
}
return false;
}
@Override
public int hashCode() {
if (lower == null && upper == null) return 0;
else if (lower == null) return upper.hashCode();
else if (upper == null) return lower.hashCode();
return lower.hashCode() ^ upper.hashCode();
}
@Override
public String toString() {
if (isEmpty()) return "()";
return (lowerType == BoundType.OPEN ? "(" : "[") + (lower == null ? "" : lower.toString()) + ".."
+ (upper == null ? "" : upper.toString()) + (upperType == BoundType.OPEN ? ")" : "]");
}
}
public static class IterableRange<C> extends Range<C> implements Iterable<C> {
private static final long serialVersionUID = 9065915259748260688L;
protected UnaryOperator<C> func;
protected IterableRange(final C lower, final BoundType lowerType, final C upper, final BoundType upperType,
final UnaryOperator<C> func) {
super(lower, lowerType, upper, upperType);
this.func = func;
}
public static <C extends Comparable<? super C>> IterableRange<C> range(final C lower, final BoundType lowerType,
final C upper, final BoundType upperType, final UnaryOperator<C> func) {
if (lower == null || upper == null)
return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
final int comp = lower.compareTo(upper);
if (comp > 0) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return new IterableRange<>(lower, lowerType, upper, upperType, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> open(final C lower, final C upper,
final UnaryOperator<C> func) {
if (lower == null) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return range(func.apply(lower), BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> openClosed(final C lower, final C upper,
final UnaryOperator<C> func) {
if (lower == null) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return range(func.apply(lower), BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> closedOpen(final C lower, final C upper,
final UnaryOperator<C> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> closed(final C lower, final C upper,
final UnaryOperator<C> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> singleton(final C value,
final UnaryOperator<C> func) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);
}
protected class Iter implements Iterator<C> {
C now;
Iter() {
now = lower;
}
@Override
public final boolean hasNext() {
return !isGreater(now);
}
@Override
public final C next() {
final C ret = now;
now = func.apply(now);
return ret;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
protected class EmptyIter implements Iterator<C> {
@Override
public boolean hasNext() {
return false;
}
@Override
public C next() {
return null;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<C> iterator() {
return lower == null || upper == null ? new EmptyIter() : new Iter();
}
public int getDistance() {
C check = upper;
int ret = 0;
while (lower != check) {
check = func.apply(check);
++ret;
}
return ret;
}
}
public static class IntRange extends IterableRange<Integer> {
private static final long serialVersionUID = 5623995336491967216L;
private final boolean useFastIter;
private static class Next implements UnaryOperator<Integer> {
@Override
public Integer apply(final Integer value) {
return value + 1;
}
}
protected IntRange() {
super(null, BoundType.CLOSED, null, BoundType.CLOSED, new Next());
useFastIter = true;
}
protected IntRange(final UnaryOperator<Integer> func) {
super(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
useFastIter = false;
}
protected IntRange(final int lower, final BoundType lowerType, final int upper, final BoundType upperType) {
super(lower, lowerType, upper, upperType, new Next());
useFastIter = true;
}
protected IntRange(final int lower, final BoundType lowerType, final int upper, final BoundType upperType,
final UnaryOperator<Integer> func) {
super(lower, lowerType, upper, upperType, func);
useFastIter = false;
}
public static IntRange range(int lower, final BoundType lowerType, int upper, final BoundType upperType) {
if (lower > upper) return new IntRange();
if (lowerType == BoundType.OPEN) ++lower;
if (upperType == BoundType.OPEN) --upper;
return new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange range(int lower, final BoundType lowerType, int upper, final BoundType upperType,
final UnaryOperator<Integer> func) {
if (lower > upper) return new IntRange(func);
if (lowerType == BoundType.OPEN) ++lower;
if (upperType == BoundType.OPEN) --upper;
return new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange open(final int lower, final int upper) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN);
}
public static IntRange open(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN, func);
}
public static IntRange open(final int upper) {
return range(0, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static IntRange open(final int upper, final UnaryOperator<Integer> func) {
return range(0, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static IntRange openClosed(final int lower, final int upper) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static IntRange openClosed(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED, func);
}
public static IntRange closedOpen(final int lower, final int upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static IntRange closedOpen(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static IntRange closed(final int lower, final int upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange closed(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange closed(final int upper) {
return range(0, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange closed(final int upper, final UnaryOperator<Integer> func) {
return range(0, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange singleton(final int value) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED);
}
public static IntRange singleton(final int value, final UnaryOperator<Integer> func) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);
}
private class FastIter implements Iterator<Integer> {
int now;
public FastIter() {
now = lower;
}
@Override
public final boolean hasNext() {
return now <= upper;
}
@Override
public final Integer next() {
return now++;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
private class Iter implements Iterator<Integer> {
int now;
public Iter() {
now = lower;
}
@Override
public final boolean hasNext() {
return now <= upper;
}
@Override
public final Integer next() {
final int ret = now;
now = func.apply(now);
return ret;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<Integer> iterator() {
return lower == null || upper == null ? new EmptyIter() : useFastIter ? new FastIter() : new Iter();
}
@Override
public int getDistance() {
int ret = upper - lower;
if (upperType == BoundType.CLOSED) ++ret;
return ret;
}
public int getClosedLower() { return lower; }
public int getOpenLower() { return lower - 1; }
public int getClosedUpper() { return upperType == BoundType.CLOSED ? upper : upper - 1; }
public int getOpenUpper() { return upperType == BoundType.CLOSED ? upper + 1 : upper; }
/**
* 区間スケジューリングを行います。<br>
* 計算量は要素数Nに対してO(NlogN)です。
*
* @param ranges 区間の集合
* @return 区間スケジューリングを行った際の一つの解
*/
public static List<IntRange> intScheduling(final List<IntRange> ranges) {
final PriorityQueue<IntRange> pq = new PriorityQueue<>((l, r) -> l.compareUpper(r.upper, r.upperType));
pq.addAll(ranges);
final List<IntRange> ret = new ArrayList<>();
if (pq.isEmpty()) return ret;
IntRange last = pq.poll();
ret.add(last);
while (!pq.isEmpty()) {
final IntRange tmp = pq.poll();
if (tmp.compareLower(last.upper, last.upperType) > 0) {
ret.add(tmp);
last = tmp;
}
}
return ret;
}
}
/**
* 演算が結合法則を満たすことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Associative<T> extends BinaryOperator<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数、1以上であること
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
public default T hyper(final T element, int repeat) {
if (repeat < 1) throw new IllegalArgumentException("undefined operation");
T ret = element;
--repeat;
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* この演算が逆元を持つことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Inverse<T> extends BinaryOperator<T> {
public T inverse(T element);
}
/**
* 演算が交換法則を満たすことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Commutative<T> extends BinaryOperator<T> {
}
/**
* 演算が単位元を持つことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Identity<T> extends BinaryOperator<T> {
/**
* 単位元を返します。
*
* @return 単位元
*/
public T identity();
}
/**
* 演算が群であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Group<T> extends Monoid<T>, Inverse<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
@Override
public default T hyper(final T element, int repeat) {
T ret = identity();
if (repeat < 0) {
repeat = -repeat;
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return inverse(ret);
}
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* 演算がモノイドであることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Monoid<T> extends Associative<T>, Identity<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数、0以上であること
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
@Override
public default T hyper(final T element, int repeat) {
if (repeat < 0) throw new IllegalArgumentException("undefined operation");
T ret = identity();
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* 演算が可換モノイドであることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface CommutativeMonoid<T> extends Monoid<T>, Commutative<T> {
}
/**
* 演算がアーベル群(可換群)であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Abelian<T> extends Group<T>, CommutativeMonoid<T> {
}
/**
* 演算が半環であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Semiring<T, A extends CommutativeMonoid<T>, M extends Monoid<T>> {
public A getAddition();
public M getMultiplication();
public default T add(final T left, final T right) {
return getAddition().apply(left, right);
}
public default T multiply(final T left, final T right) {
return getMultiplication().apply(left, right);
}
public default T additiveIdentity() {
return getAddition().identity();
}
public default T multipleIdentity() {
return getMultiplication().identity();
}
public default int characteristic() {
return 0;
}
}
/**
* 演算が環であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Ring<T, A extends Abelian<T>, M extends Monoid<T>> extends Semiring<T, A, M> {
}
/**
* 演算が可換環に属することを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface CommutativeRing<T, A extends Abelian<T>, M extends CommutativeMonoid<T>> extends Ring<T, A, M> {
}
/**
* 演算が整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface IntegralDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends CommutativeRing<T, A, M> {
public boolean isDivisible(T left, T right);
public T divide(T left, T right);
}
/**
* 演算が整閉整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface IntegrallyClosedDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends IntegralDomain<T, A, M> {
}
/**
* 演算がGCD整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface GCDDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends IntegrallyClosedDomain<T, A, M> {
public T gcd(T left, T right);
public T lcm(T left, T right);
}
/**
* 素元を提供します。
*
* @author 31536000
*
* @param <T> 演算の型
*/
public static class PrimeElement<T> {
public final T element;
public PrimeElement(final T element) {
this.element = element;
}
}
public interface MultiSet<E> extends Collection<E> {
public int add(E element, int occurrences);
public int count(Object element);
public Set<E> elementSet();
public boolean remove(Object element, int occurrences);
public int setCount(E element, int count);
public boolean setCount(E element, int oldCount, int newCount);
}
/**
* 演算が一意分解整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface UniqueFactorizationDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends GCDDomain<T, A, M> {
public MultiSet<PrimeElement<T>> PrimeFactorization(T x);
}
/**
* 演算が主イデアル整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface PrincipalIdealDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends UniqueFactorizationDomain<T, A, M> {
}
/**
* 演算がユークリッド整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface EuclideanDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends PrincipalIdealDomain<T, A, M> {
public T reminder(T left, T right);
}
/**
* 演算が体であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Field<T, A extends Abelian<T>, M extends Abelian<T>> extends EuclideanDomain<T, A, M> {
@Override
public default boolean isDivisible(final T left, final T right) {
return !right.equals(additiveIdentity());
}
@Override
public default T divide(final T left, final T right) {
if (isDivisible(left, right)) throw new ArithmeticException("divide by Additive Identify");
return multiply(left, getMultiplication().inverse(right));
}
@Override
public default T reminder(final T left, final T right) {
if (isDivisible(left, right)) throw new ArithmeticException("divide by Additive Identify");
return additiveIdentity();
}
@Override
public default T gcd(final T left, final T right) {
return multipleIdentity();
}
@Override
public default T lcm(final T left, final T right) {
return multipleIdentity();
}
@Override
public default MultiSet<PrimeElement<T>> PrimeFactorization(final T x) {
final HashMultiSet<PrimeElement<T>> ret = HashMultiSet.create(1);
ret.add(new PrimeElement<>(x));
return ret;
}
}
public static class HashMultiSet<E> implements MultiSet<E>, Serializable {
private static final long serialVersionUID = -8378919645386251159L;
private final transient HashMap<E, Integer> map;
private transient int size;
private HashMultiSet() {
map = new HashMap<>();
size = 0;
}
private HashMultiSet(final int distinctElements) {
map = new HashMap<>(distinctElements);
size = 0;
}
public static <E> HashMultiSet<E> create() {
return new HashMultiSet<>();
}
public static <E> HashMultiSet<E> create(final int distinctElements) {
return new HashMultiSet<>(distinctElements);
}
public static <E> HashMultiSet<E> create(final Iterable<? extends E> elements) {
final HashMultiSet<E> ret = new HashMultiSet<>();
for (final E i : elements) ret.map.compute(i, (v, e) -> e == null ? 1 : ++e);
return ret;
}
@Override
public int size() {
return size;
}
@Override
public boolean isEmpty() { return size == 0; }
@Override
public boolean contains(final Object o) {
return map.containsKey(o);
}
private class Iter implements Iterator<E> {
private final Iterator<Entry<E, Integer>> iter = map.entrySet().iterator();
private E value;
private int count = 0;
@Override
public boolean hasNext() {
if (count > 0) return true;
if (iter.hasNext()) {
final Entry<E, Integer> entry = iter.next();
value = entry.getKey();
count = entry.getValue();
return true;
}
return false;
}
@Override
public E next() {
--count;
return value;
}
}
@Override
public Iterator<E> iterator() {
return new Iter();
}
@Override
public Object[] toArray() {
final Object[] ret = new Object[size];
int read = 0;
for (final Entry<E, Integer> i : map.entrySet()) Arrays.fill(ret, read, read += i.getValue(), i.getKey());
return ret;
}
@Override
public <T> T[] toArray(final T[] a) {
final Object[] src = toArray();
if (a.length < src.length) {
@SuppressWarnings("unchecked")
final T[] ret = (T[]) Arrays.copyOfRange(src, 0, src.length, a.getClass());
return ret;
}
System.arraycopy(src, 0, a, 0, src.length);
return a;
}
@Override
public boolean add(final E e) {
add(e, 1);
return true;
}
@Override
public boolean remove(final Object o) {
return remove(o, 1);
}
@Override
public boolean containsAll(final Collection<?> c) {
boolean ret = true;
for (final Object i : c) ret |= contains(i);
return ret;
}
@Override
public boolean addAll(final Collection<? extends E> c) {
boolean ret = false;
for (final E i : c) ret |= add(i);
return ret;
}
@Override
public boolean removeAll(final Collection<?> c) {
boolean ret = false;
for (final Object i : c) ret |= remove(i);
return ret;
}
@Override
public boolean retainAll(final Collection<?> c) {
return removeAll(c);
}
@Override
public void clear() {
map.clear();
size = 0;
}
@Override
public int add(final E element, final int occurrences) {
size += occurrences;
return map.compute(element, (k, v) -> v == null ? occurrences : v + occurrences) - occurrences;
}
@Override
public int count(final Object element) {
return map.getOrDefault(element, 0);
}
@Override
public Set<E> elementSet() {
return map.keySet();
}
public Set<Entry<E, Integer>> entrySet() {
return map.entrySet();
}
@Override
public boolean remove(final Object element, final int occurrences) {
try {
@SuppressWarnings("unchecked")
final E put = (E) element;
return map.compute(put, (k, v) -> {
if (v == null) return null;
if (v < occurrences) {
size -= v;
return null;
}
size -= occurrences;
return v - occurrences;
}) != null;
} catch (final ClassCastException E) {
return false;
}
}
@Override
public int setCount(final E element, final int count) {
final Integer ret = map.put(element, count);
final int ret2 = ret == null ? 0 : ret;
size += count - ret2;
return ret2;
}
@Override
public boolean setCount(final E element, final int oldCount, final int newCount) {
final boolean ret = map.replace(element, oldCount, newCount);
if (ret) size += newCount - oldCount;
return ret;
}
}
public static class ModInteger extends Number
implements Field<ModInteger, Abelian<ModInteger>, Abelian<ModInteger>> {
private static final long serialVersionUID = -8595710127161317579L;
private final int mod;
private int num;
private final Addition add;
private final Multiplication mul;
private class Addition implements Abelian<ModInteger> {
@Override
public ModInteger identity() {
return new ModInteger(mod, 0);
}
@Override
public ModInteger inverse(final ModInteger element) {
return new ModInteger(element, element.mod - element.num);
}
@Override
public ModInteger apply(final ModInteger left, final ModInteger right) {
return new ModInteger(left).addEqual(right);
}
}
private class Multiplication implements Abelian<ModInteger> {
@Override
public ModInteger identity() {
return new ModInteger(mod, 1);
}
@Override
public ModInteger apply(final ModInteger left, final ModInteger right) {
return new ModInteger(left).multiplyEqual(right);
}
@Override
public ModInteger inverse(final ModInteger element) {
return new ModInteger(element, element.inverse(element.num));
}
}
@Override
public int characteristic() {
return mod;
}
public ModInteger(final int mod) {
this.mod = mod;
num = 0;
add = new Addition();
mul = new Multiplication();
}
public ModInteger(final int mod, final int num) {
this.mod = mod;
this.num = validNum(num);
add = new Addition();
mul = new Multiplication();
}
public ModInteger(final ModInteger n) {
mod = n.mod;
num = n.num;
add = n.add;
mul = n.mul;
}
private ModInteger(final ModInteger n, final int num) {
mod = n.mod;
this.num = num;
add = n.add;
mul = n.mul;
}
private int validNum(int n) {
n %= mod;
if (n < 0) n += mod;
return n;
}
private int validNum(long n) {
n %= mod;
if (n < 0) n += mod;
return (int) n;
}
protected int inverse(int n) {
int m = mod, u = 0, v = 1, t;
while (n != 0) {
t = m / n;
m -= t * n;
u -= t * v;
if (m != 0) {
t = n / m;
n -= t * m;
v -= t * u;
} else {
v %= mod;
if (v < 0) v += mod;
return v;
}
}
u %= mod;
if (u < 0) u += mod;
return u;
}
public boolean isPrime(final int n) {
if ((n & 1) == 0) return false; // 偶数
for (int i = 3, j = 8, k = 9; k <= n; i += 2, k += j += 8) if (n % i == 0) return false;
return true;
}
@Override
public int intValue() {
return num;
}
@Override
public long longValue() {
return num;
}
@Override
public float floatValue() {
return num;
}
@Override
public double doubleValue() {
return num;
}
protected ModInteger getNewInstance(final ModInteger mod) {
return new ModInteger(mod);
}
public ModInteger add(final int n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger add(final long n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger add(final ModInteger n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger addEqual(final int n) {
num = validNum(num + n);
return this;
}
public ModInteger addEqual(final long n) {
num = validNum(num + n);
return this;
}
public ModInteger addEqual(final ModInteger n) {
if ((num += n.num) >= mod) num -= mod;
return this;
}
public ModInteger subtract(final int n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtract(final long n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtract(final ModInteger n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtractEqual(final int n) {
num = validNum(num - n);
return this;
}
public ModInteger subtractEqual(final long n) {
num = validNum(num - n);
return this;
}
public ModInteger subtractEqual(final ModInteger n) {
if ((num -= n.num) < 0) num += mod;
return this;
}
public ModInteger multiply(final int n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiply(final long n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiply(final ModInteger n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiplyEqual(final int n) {
num = (int) ((long) num * n % mod);
if (num < 0) num += mod;
return this;
}
public ModInteger multiplyEqual(final long n) {
return multiplyEqual((int) (n % mod));
}
public ModInteger multiplyEqual(final ModInteger n) {
num = (int) ((long) num * n.num % mod);
return this;
}
public ModInteger divide(final int n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divide(final long n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divide(final ModInteger n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divideEqual(final int n) {
num = (int) ((long) num * inverse(validNum(n)) % mod);
return this;
}
public ModInteger divideEqual(final long n) {
return divideEqual((int) (n % mod));
}
public ModInteger divideEqual(final ModInteger n) {
num = (int) ((long) num * n.inverse(n.num) % mod);
return this;
}
public ModInteger pow(final int n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger pow(final long n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger pow(final ModInteger n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger powEqual(int n) {
long ans = 1, num = this.num;
if (n < 0) {
n = -n;
while (n != 0) {
if ((n & 1) != 0) ans = ans * num % mod;
n >>>= 1;
num = num * num % mod;
}
this.num = inverse((int) ans);
return this;
}
while (n != 0) {
if ((n & 1) != 0) ans = ans * num % mod;
n >>>= 1;
num = num * num % mod;
}
this.num = (int) ans;
return this;
}
public ModInteger powEqual(final long n) {
return powEqual((int) (n % (mod - 1)));
}
public ModInteger powEqual(final ModInteger n) {
long num = this.num;
this.num = 1;
int mul = n.num;
while (mul != 0) {
if ((mul & 1) != 0) this.num *= num;
mul >>>= 1;
num *= num;
num %= mod;
}
return this;
}
public ModInteger equal(final int n) {
num = validNum(n);
return this;
}
public ModInteger equal(final long n) {
num = validNum(n);
return this;
}
public ModInteger equal(final ModInteger n) {
num = n.num;
return this;
}
public int toInt() {
return num;
}
public int getMod() { return mod; }
@Override
public boolean equals(final Object x) {
if (x instanceof ModInteger) return ((ModInteger) x).num == num && ((ModInteger) x).mod == mod;
return false;
}
@Override
public int hashCode() {
return num ^ mod;
}
@Override
public String toString() {
return String.valueOf(num);
}
@Deprecated
public String debug() {
int min = num, ans = 1;
for (int i = 2; i < min; ++i) {
final int tmp = multiply(i).num;
if (min > tmp) {
min = tmp;
ans = i;
}
}
return min + "/" + ans;
}
@Override
public Addition getAddition() { return add; }
@Override
public Multiplication getMultiplication() { return mul; }
}
/**
* 素数を法とする演算上で、組み合わせの計算を高速に行います。
*
* @author 31536000
*
*/
public static class ModUtility {
private final int mod;
private int[] fact, inv, invfact;
/**
* modを法として、演算を行います。
*
* @param mod 法とする素数
*/
public ModUtility(final Prime mod) {
this(mod, 2);
}
/**
* modを法として、演算を行います。
*
* @param mod 法とする素数
* @param calc 予め前計算しておく大きさ
*/
public ModUtility(final Prime mod, final int calc) {
this.mod = mod.prime;
precalc(calc);
}
/**
* calcの大きさだけ、前計算を行います。
*
* @param calc 前計算をする大きさ
*/
public void precalc(int calc) {
++calc;
if (calc < 2) calc = 2;
if (calc > mod) calc = mod;
fact = new int[calc];
inv = new int[calc];
invfact = new int[calc];
fact[0] = invfact[0] = fact[1] = invfact[1] = inv[1] = 1;
for (int i = 2; i < calc; ++i) {
fact[i] = (int) ((long) fact[i - 1] * i % mod);
inv[i] = (int) (mod - (long) inv[mod % i] * (mod / i) % mod);
invfact[i] = (int) ((long) invfact[i - 1] * inv[i] % mod);
}
}
/**
* modを法とする剰余環上で振舞う整数を返します。
*
* @return modを法とする整数、初期値は0
*/
public ModInteger create() {
return new ModInt();
}
/**
* modを法とする剰余環上で振舞う整数を返します。
*
* @param n 初期値
* @return modを法とする整数
*/
public ModInteger create(final int n) {
return new ModInt(n);
}
private class ModInt extends ModInteger {
private static final long serialVersionUID = -2435281861935422575L;
public ModInt() {
super(mod);
}
public ModInt(final int n) {
super(mod, n);
}
public ModInt(final ModInteger mod) {
super(mod);
}
@Override
protected ModInteger getNewInstance(final ModInteger mod) {
return new ModInt(mod);
}
@Override
protected int inverse(final int n) {
return ModUtility.this.inverse(n);
}
}
/**
* modを法として、nの逆元を返します。<br>
* 計算量はO(log n)です。
*
* @param n 逆元を求めたい値
* @return 逆元
*/
public int inverse(int n) {
try {
if (inv.length > n) return inv[n];
int m = mod, u = 0, v = 1, t;
while (n != 0) {
t = m / n;
m -= t * n;
u -= t * v;
if (m != 0) {
t = n / m;
n -= t * m;
v -= t * u;
} else {
v %= mod;
if (v < 0) v += mod;
return v;
}
}
u %= mod;
if (u < 0) u += mod;
return u;
} catch (final ArrayIndexOutOfBoundsException e) {
throw new IllegalArgumentException();
}
}
/**
* n!を、modを法として求めた値を返します。<br>
* 計算量はO(n)です。
*
* @param n 階乗を求めたい値
* @return nの階乗をmodで割った余り
*/
public int factorial(final int n) {
try {
if (fact.length > n) return fact[n];
long ret = fact[fact.length - 1];
for (int i = fact.length; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
} catch (final ArrayIndexOutOfBoundsException e) {
throw new IllegalArgumentException();
}
}
/**
* nPkをmodで割った余りを求めます。<br>
* 計算量はO(n-k)です。
*
* @param n 左辺
* @param k 右辺
* @return nPkをmodで割った余り
*/
public int permutation(final int n, final int k) {
if (n < 0) throw new IllegalArgumentException();
if (n < k) return 0;
if (fact.length > n) return (int) ((long) fact[n] * invfact[n - k] % mod);
long ret = 1;
for (int i = n - k + 1; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
}
/**
* nCkをmodで割った余りを求めます。<br>
* 計算量はO(min(plogn, n-k))です。
*
* @param n 左辺
* @param k 右辺
* @return nCkをmodで割った余り
*/
public int combination(int n, int k) {
if (n < 0) throw new IllegalArgumentException();
if (n < k) return 0;
if (fact.length > n) return (int) ((long) fact[n] * invfact[k] % mod * invfact[n - k] % mod);
long ret = 1;
if (n >= mod) {
if (mod == 2) return (~n & k) == 0 ? 1 : 0;
while (n > 0) {
ret = ret * combination(n % mod, k % mod) % mod;
n /= mod;
k /= mod;
}
return (int) ret;
}
if (n < 2 * k) k = n - k;
ret = invfact.length > k ? invfact[k] : inverse(factorial(k));
for (int i = n - k + 1; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
}
/**
* 他項係数をmodで割った余りを求めます。<br>
* ] 計算量はO(n)です。
*
* @param n 左辺
* @param k 右辺、合計がn以下である必要がある
* @return 他項係数
*/
public int multinomial(final int n, final int... k) {
int sum = 0;
long ret = factorial(n);
if (fact.length > n) {
for (final int i : k) {
if (i < 0) throw new IllegalArgumentException();
ret = ret * invfact[i] % mod;
sum += i;
}
if (sum > n) return 0;
ret = ret * invfact[n - sum] % mod;
} else {
for (final int i : k) {
if (i < 0) throw new IllegalArgumentException();
if (invfact.length > i) ret = ret * invfact[i] % mod;
else ret = ret * inverse(factorial(i)) % mod;
sum += i;
}
if (sum > n) return 0;
if (invfact.length > n - sum) ret = ret * invfact[n - sum] % mod;
else ret = ret * inverse(factorial(n - sum)) % mod;
}
return (int) ret;
}
/**
* n個からk個を選ぶ重複組み合わせnHkをmodで割った余りを求めます。<br>
* 計算量はO(min(n, k))です。
*
* @param n 左辺
* @param k 右辺
* @return nHkをmodで割った余り
*/
public int multichoose(final int n, final int k) {
return combination(mod(n + k - 1), k);
}
/**
* カタラン数C(n)をmodで割った余りを求めます。<br>
* 計算量はO(n)です。
*
* @param n 求めたいカタラン数の番号
* @return カタラン数
*/
public int catalan(final int n) {
return divide(combination(mod(2 * n), n), mod(n + 1));
}
/**
* 第一種スターリング数S(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(nk)です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 左辺
* @param k 右辺
* @return S(n, k)をmodで割った余り
*/
public int firstStirling(final int n, final int k) {
final int[] stirling = new int[(n + 1) * (k + 1)];
stirling[0] = 1;
final int h = k + 1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < k; ++j) {
final int tmp = stirling[i * h + j] + (int) ((long) i * stirling[i * h + j + 1] % mod);
stirling[(i + 1) * h + j + 1] = tmp >= mod ? tmp - mod : tmp;
}
}
return stirling[stirling.length - 1];
}
/**
* 第二種スターリング数S(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(k)です。
*
* @param n 左辺
* @param k 右辺
* @return S(n, k)をmodで割った余り
*/
public int secondStirling(final int n, final int k) {
if (k == 0) return n == 0 ? 1 : 0;
final int[] sieve = new int[k + 1], prime = new int[k + 1];
int size = 0;
sieve[1] = 1;
for (int i = 2; i <= k; ++i) {
if (sieve[i] == 0) prime[size++] = sieve[i] = i;
for (int j = 0, s; j < size && prime[j] <= sieve[i] && (s = i * prime[j]) <= k; ++j)
sieve[s] = prime[j];
}
long ans = 0;
for (int i = 1, s; i <= k; ++i) {
final long tmp = (long) combination(k, i)
* (prime[i] = (s = sieve[i]) == i ? pow(i, n) : (int) ((long) prime[s] * prime[i / s] % mod))
% mod;
ans += (k - i & 1) != 0 ? -tmp : tmp;
}
return (int) ((long) mod(ans) * invfact[k] % mod);
}
/**
* ベル数B(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(k)です。
*
* @param n 左辺
* @param k 右辺
* @return B(n, k)をmodで割った余り
*/
public int bell(final int n, final int k) {
if (k == 0) return n == 0 ? 1 : 0;
final int[] sieve = new int[k + 1], prime = new int[k + 1];
int size = 0;
sieve[1] = 1;
long sum = 0;
for (int i = 2; i <= k; ++i) {
if (sieve[i] == 0) prime[size++] = sieve[i] = i;
for (int j = 0, s; j < size && prime[j] <= sieve[i] && (s = i * prime[j]) <= k; ++j)
sieve[s] = prime[j];
sum += (i & 1) != 0 ? -invfact[i] : invfact[i];
}
sum = mod(sum);
long ans = 0;
for (int i = 0, s; i <= k; ++i) {
final long tmp = (long) (prime[i] = (s = sieve[i]) == i ? pow(i, n)
: (int) ((long) prime[s] * prime[i / s] % mod)) * invfact[i] % mod;
ans += tmp * sum % mod;
if ((sum -= (k - i & 1) != 0 ? -invfact[k - i] : invfact[k - i]) < 0) sum += mod;
}
return mod(ans);
}
/**
* ベル数B(n)をmodで割った余りを求めます。<br>
* 計算量はO(n)です。
*
* @param n 求めたいベル数の番号
* @return B(n)
*/
public int bell(final int n) {
return bell(n, n);
}
/**
* 分割数P(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(nk)です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 左辺
* @param k 右辺
* @return P(n, k)をmodで割った余り
*/
public int pertition(final int n, final int k) {
final int[] pertition = new int[(n + 1) * (k + 1)];
pertition[0] = 1;
final int h = k + 1;
for (int i = 0; i <= n; ++i) {
for (int j = 1, l = Math.min(i, k); j <= l; ++j)
pertition[i * h + j] = pertition[i * h + j - 1] + pertition[(i - j) * h + j];
for (int j = i; j < k; ++j) pertition[i * h + j + 1] = pertition[i * h + j];
}
return pertition[n * h + k];
}
/**
* 分割数P(n)をmodで割った余りを求めます。<br>
* 計算量はO(n sqrt(n))です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 求めたい分割数の番号
* @return P(n)
*/
public int pertition(final int n) {
final long[] pertition = new long[n + 1];
pertition[0] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = 1, t; (t = i - (j * (3 * j - 1) >> 1)) >= 0; ++j) {
pertition[i] += (j & 1) != 0 ? pertition[t] : -pertition[t];
}
for (int j = 1, t; (t = i - (j * (3 * j + 1) >> 1)) >= 0; ++j) {
pertition[i] += (j & 1) != 0 ? pertition[t] : -pertition[t];
}
pertition[i] %= mod;
}
return (int) pertition[n];
}
/**
* nのm乗をmodで割った余りを求めます。<br>
* 計算量はO(log m)です。
*
* @param n 床
* @param m 冪指数
* @return n^mをmodで割った余り
*/
public int pow(final int n, int m) {
long ans = 1, num = n;
if (m < 0) {
m = -m;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % mod;
m >>>= 1;
num = num * num % mod;
}
return inverse((int) ans);
}
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % mod;
m >>>= 1;
num = num * num % mod;
}
return (int) ans;
}
/**
* nのm乗をmodで割った余りを求めます。<br>
* 計算量はO(log m)です。
*
* @param n 床
* @param m 冪指数
* @return n^mをmodで割った余り
*/
public int pow(final long n, final long m) {
return pow((int) (n % mod), (int) (m % (mod - 1)));
}
/**
* 現在のmod値のトーシェント数を返します。<br>
* なお、これはmod-1に等しいです。
*
* @return トーシェント数
*/
public int totient() {
return mod - 1;
}
/**
* nのトーシェント数を返します。<br>
* 計算量はO(sqrt n)です。
*
* @param n トーシェント数を求めたい値
* @return nのトーシェント数
*/
public static int totient(int n) {
int totient = n;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
totient = totient / i * (i - 1);
while ((n %= i) % i == 0);
}
}
if (n != 1) totient = totient / n * (n - 1);
return totient;
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(int n) {
return (n %= mod) < 0 ? n + mod : n;
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(long n) {
return (int) ((n %= mod) < 0 ? n + mod : n);
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(final PrimeFactor n) {
int ret = 1;
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
ret = multiply(ret, pow(i.getKey().prime, i.getValue()));
return ret;
}
/**
* n+mをmodで割った余りを返します。
*
* @param n 足される値
* @param m 足す値
* @return n+mをmodで割った余り
*/
public int add(final int n, final int m) {
return mod(n + m);
}
/**
* n-mをmodで割った余りを返します。
*
* @param n 引かれる値
* @param m 引く値
* @return n-mをmodで割った余り
*/
public int subtract(final int n, final int m) {
return mod(n - m);
}
/**
* n*mをmodで割った余りを返します。
*
* @param n 掛けられる値
* @param m 掛ける値
* @return n*mをmodで割った余り
*/
public int multiply(final int n, final int m) {
final int ans = (int) ((long) n * m % mod);
return ans < 0 ? ans + mod : ans;
}
/**
* n/mをmodで割った余りを返します。
*
* @param n 割られる値
* @param m 割る値
* @return n/mをmodで割った余り
*/
public int divide(final int n, final int m) {
return multiply(n, inverse(m));
}
/**
* fを通ることが分かっているfの要素数-1次の関数について、xの位置における値をmodで割った余りを返します。<br>
* 計算量はO(f)です。
*
* @param f 関数の形
* @param x 求める位置
* @return 求めたい値をmodで割った余り
*/
public ModInteger lagrangePolynomial(final ModInteger[] f, final int x) {
if (f.length > x) return f[x];
if (x > fact.length) precalc(x);
final ModInteger ret = create(0);
final ModInteger[] dp = new ModInteger[f.length], dp2 = new ModInteger[f.length];
dp[0] = create(1);
dp2[f.length - 1] = create(1);
for (int i = 1; i < f.length; ++i) {
dp[i] = dp[i - 1].multiply(x - i - 1);
dp2[f.length - i - 1] = dp2[f.length - i].multiply(x - f.length + i);
}
for (int i = 0; i < f.length; ++i) {
final ModInteger tmp = f[i].multiply(dp[i]).multiplyEqual(dp2[i]).multiplyEqual(inv[i])
.multiplyEqual(inv[f.length - 1 - i]);
if ((f.length - i & 1) == 0) ret.addEqual(tmp);
else ret.subtractEqual(tmp);
}
return ret;
}
/**
* 与えられた配列に対し、その配列を並び替えることで構成できる配列の集合をSとします。
* このとき、arrayがSを辞書順に並べると何番目かを求めます。
* @complexity N=array.length として O(N log N)
* @param array 辞書順で何番目か求めたい配列
* @return arrayが辞書順で何番目か
*/
public ModInteger permutationNumber(int[] array) {
int[] compress = ArrayUtility.compress(array);
int[] bucket = new int[array.length];
for (int i : compress) ++bucket[i];
int sum = multinomial(array.length, bucket);
int[] bit = new int[array.length + 1];
for (int i = 0; i < array.length; ++i)
for (int j = i + 1, add = bucket[i]; j < bit.length; j += j & -j) bit[j] += add;
int ans = 1;
for (int i = 0; i < array.length; ++i) {
sum = divide(sum, array.length - i);
int comp = compress[i];
int min = 0;
for (int j = comp; j != 0; j -= j & -j) min += bit[j];
ans = add(ans, multiply(sum, min));
sum = multiply(sum, bucket[comp]--);
for (int j = comp + 1; j < bit.length; j += j & -j) --bit[j];
}
return create(ans);
}
}
/**
* 区間における素数を保持する関数です。
*
* @author 31536000
*
*/
public static class SegmentPrime {
private final Prime[] divisor;
private final int offset;
private SegmentPrime(final Prime[] divisor, final int offset) {
this.divisor = divisor;
this.offset = offset;
}
/**
* このクラスが持つ区間の範囲を返します。
*
* @return 素数を保持している区間
*/
public IntRange getRange() { return IntRange.closedOpen(offset, offset + divisor.length); }
/**
* 素数かどうかを判定します。
*
* @param n 素数かどうか判定したい数
* @return 素数ならばtrue
*/
public boolean isPrime(final int n) {
return n <= 1 ? false : divisor[n - offset].prime == n;
}
/**
* 与えられた数を素因数分解します。<br>
* 計算量はO(log n)です。
*
* @param n 素因数分解したい数
* @return 素因数分解した結果
*/
public PrimeFactor getPrimeFactor(int n) {
if (n < 1) throw new IllegalArgumentException("not positive number");
final Map<Prime, Integer> map = new HashMap<>();
while (n > 1) {
final Prime d = divisor[n - offset];
map.compute(d, (k, v) -> v == null ? 1 : v + 1);
n /= d.prime;
}
return new PrimeFactor(map);
}
@Override
public String toString() {
return "SegmentPrime: [" + offset + ", " + (offset + divisor.length) + ")";
}
}
/**
* 整数の素因数分解表現を保持します。
*
* @author 31536000
*
*/
public static class PrimeFactor extends Number {
private static final long serialVersionUID = 1363575672283884773L;
public Map<Prime, Integer> primeFactor;
private PrimeFactor(final Map<Prime, Integer> n) {
primeFactor = n;
}
/**
* 素因数分解のリスト表現を返します。
*
* @return 素因数分解のリスト
*/
public List<Integer> getFactorizationList() {
final List<Integer> ret = new ArrayList<>();
for (final Entry<Prime, Integer> i : primeFactor.entrySet()) {
final int p = i.getKey().prime, n = i.getValue();
for (int j = 0; j < n; ++j) ret.add(p);
}
return ret;
}
/**
* nとgcdを取った値を保持します。
*
* @param n gcdを取りたい値
*/
public void gcd(final PrimeFactor n) {
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
primeFactor.computeIfPresent(i.getKey(), (k, v) -> Math.min(v, i.getValue()));
}
/**
* gcd(n, m)を返します。
*
* @param n gcdを取りたい値
* @param m gcdを取りたい値
* @return gcd(n, m)
*/
public static PrimeFactor gcd(final PrimeFactor n, final PrimeFactor m) {
final Map<Prime, Integer> ret = new HashMap<>(n.primeFactor);
for (final Entry<Prime, Integer> i : m.primeFactor.entrySet())
ret.computeIfPresent(i.getKey(), (k, v) -> Math.min(v, i.getValue()));
return new PrimeFactor(ret);
}
/**
* nとlcmを取った値を保持します。
*
* @param n lcmを取りたい値
*/
public void lcm(final PrimeFactor n) {
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
primeFactor.merge(i.getKey(), i.getValue(), (v1, v2) -> Math.max(v1, v2));
}
/**
* lcm(n, m)を返します。
*
* @param n lcmを取りたい値
* @param m lcmを取りたい値
* @return lcm(n, m)
*/
public static PrimeFactor lcm(final PrimeFactor n, final PrimeFactor m) {
final Map<Prime, Integer> ret = new HashMap<>(n.primeFactor);
for (final Entry<Prime, Integer> i : m.primeFactor.entrySet())
ret.merge(i.getKey(), i.getValue(), (v1, v2) -> Math.max(v1, v2));
return new PrimeFactor(ret);
}
private static int pow(final int p, int n) {
int ans = 1;
for (int mul = p; n > 0; n >>= 1, mul *= mul) if ((n & 1) != 0) ans *= mul;
return ans;
}
private static long pow(final long p, long n) {
long ans = 1;
for (long mul = p; n > 0; n >>= 1, mul *= mul) if ((n & 1) != 0) ans *= mul;
return ans;
}
public BigInteger getValue() {
BigInteger ret = BigInteger.ONE;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret = ret.multiply(new BigInteger(i.getKey().toString()).pow(i.getValue()));
return ret;
}
@Override
public int intValue() {
int ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet()) ret *= pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public long longValue() {
long ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= pow((long) i.getKey().prime, i.getValue());
return ret;
}
@Override
public float floatValue() {
float ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= Math.pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public double doubleValue() {
long ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= Math.pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public boolean equals(final Object o) {
return o instanceof PrimeFactor ? ((PrimeFactor) o).primeFactor.equals(primeFactor) : false;
}
@Override
public int hashCode() {
return primeFactor.hashCode();
}
@Override
public String toString() {
return primeFactor.toString();
}
}
/**
* 素数を渡すためのクラスです。<br>
* 中身が確実に素数であることを保証するときに使ってください。
*
* @author 31536000
*
*/
public static class Prime extends Number {
private static final long serialVersionUID = 8216169308184181643L;
public final int prime;
/**
* 素数を設定します。
*
* @param prime 素数
* @throws IllegalArgumentException 素数以外を渡した時
*/
public Prime(final int prime) {
if (!isPrime(prime)) throw new IllegalArgumentException(prime + " is not prime");
this.prime = prime;
}
private Prime(final int prime, final boolean none) {
this.prime = prime;
}
private static final int bases[] = { 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620,
560, 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028, 2213, 6219, 620,
3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113, 7061, 803, 1269, 3875, 422, 751, 580, 4729,
10239, 746, 2951, 556, 2206, 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,
15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903, 737, 1887, 7447, 1888,
2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41, 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352,
6435, 165, 1169, 3315, 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,
27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524, 3577, 236, 2360, 6146, 2850,
55637, 1753, 4178, 8466, 222, 2579, 2743, 2031, 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159,
1725, 3597, 3366, 14336, 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,
434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183, 8126, 1870, 3296, 7455,
8947, 25017, 541, 19115, 368, 566, 5674, 411, 522, 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007,
35201, 4706, 1152, 1785, 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,
4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816, 5197, 13330, 7054, 2818, 3199,
811, 922, 350, 7514, 4452, 3449, 2663, 4708, 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194 };
private static final byte wheel[] = { 10, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4,
2, 4, 8, 6, 4, 6, 2, 4, 6, 2, 6, 6, 4, 2, 4, 6, 2, 6, 4, 2, 4, 2, 10, 2 };
private static boolean isSPRP(final int n, long a) {
int d = n - 1, s = 0;
while ((d & 1) == 0) {
++s;
d >>= 1;
}
long cur = 1, pw = d;
do {
if ((pw & 1) != 0) cur = cur * a % n;
a = a * a % n;
pw >>= 1;
} while (pw != 0);
if (cur == 1) return true;
for (int r = 0; r < s; ++r) {
if (cur == n - 1) return true;
cur = cur * cur % n;
}
return false;
}
/**
* 与えられた値が素数か否かを判定します。<br>
* この実装はhttp://ceur-ws.org/Vol-1326/020-Forisek.pdfに基づきます。
*
* @param x 判定したい値
* @return xが素数ならtrue
*/
public static boolean isPrime(final int x) {
if (x == 2 || x == 3 || x == 5 || x == 7) return true;
if ((x & 1) == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;
return checkPrime(x);
}
private static boolean checkPrime(final int x) {
if (x < 121) return x > 1;
long h = x;
h = (h >> 16 ^ h) * 0x45d9f3b;
h = (h >> 16 ^ h) * 0x45d9f3b;
h = (h >> 16 ^ h) & 0xFF;
return isSPRP(x, bases[(int) h]);
}
/**
* 区間における素数を列挙します。<br>
* この実装はエラトステネスの篩に基づきます。
*
* @param n 素数を求める範囲
* @return 1以上n以下の素数を保持する区間素数
*/
public static SegmentPrime getSegmentPrime(final int n) {
final Prime[] divisor = new Prime[n - 1];
final int sqrt = (int) Math.sqrt(n) + 1;
for (int i = 0; i < sqrt; ++i) {
if (divisor[i] != null) continue;
final int p = i + 2;
divisor[i] = new Prime(p, true);
for (int j = p * p - 2; j < divisor.length; j += p) divisor[j] = divisor[i];
}
for (int i = sqrt; i < divisor.length; ++i) if (divisor[i] == null) divisor[i] = new Prime(i + 2, true);
return new SegmentPrime(divisor, 2);
}
/**
* 与えられた値を素因数分解した結果を返します。
*
* @param x 素因数分解する値
* @return 素因数分解した結果
*/
public static PrimeFactor getPrimeFactor(int x) {
if (x <= 0) throw new IllegalArgumentException("non positive number: " + x);
final Map<Prime, Integer> ret = new TreeMap<>((l, r) -> Integer.compare(l.prime, r.prime));
int c;
if ((x & 1) == 0) {
c = 1;
for (x >>= 1; (x & 1) == 0; x >>= 1) ++c;
ret.put(new Prime(2, false), c);
}
if (x % 3 == 0) {
c = 1;
for (x /= 3; x % 3 == 0; x /= 3) ++c;
ret.put(new Prime(3, false), c);
}
if (x % 5 == 0) {
c = 1;
for (x /= 5; x % 5 == 0; x /= 5) ++c;
ret.put(new Prime(5, false), c);
}
if (x % 7 == 0) {
c = 1;
for (x /= 7; x % 7 == 0; x /= 7) ++c;
ret.put(new Prime(7, false), c);
}
if (x < 100000000) { // Wheel Factorization
for (int i = 11, j = 0; i * i <= x; i += wheel[++j % wheel.length]) {
while (x % i == 0) {
x /= i;
ret.compute(new Prime(i, false), (k, v) -> v == null ? 1 : v + 1);
}
}
if (x != 1) ret.put(new Prime(x, false), 1);
} else {
int p, count;
while (x != 1) { // 素因数分解が終わってる
for (p = x; !checkPrime(p); p = pollardRho(p, 1));
final Prime prime = new Prime(p, false);
count = 1;
for (x /= p; x % p == 0; x /= p) ++count;
ret.put(prime, count);
}
}
return new PrimeFactor(ret);
}
private static int gcd(int n, int m) {
while (n != 0) if ((m %= n) != 0) n %= m;
else return n;
return m;
}
private static int pollardRho(final int x, int c) {
int n = 2, m = 2, d = 1, next = 4, i = 1;
do {
if (++i == next) {
m = n;
next <<= 1;
}
if ((n = (int) (((long) n * n + c) % x)) == m) return pollardRho(x, ++c); // 失敗したので
} while ((d = gcd(Math.abs(n - m), x)) == 1);// dは約数の一つ
return d;
}
@Override
public int intValue() {
return prime;
}
@Override
public long longValue() {
return prime;
}
@Override
public float floatValue() {
return prime;
}
@Override
public double doubleValue() {
return prime;
}
@Override
public boolean equals(final Object o) {
return o instanceof Prime ? ((Prime) o).prime == prime : false;
}
@Override
public int hashCode() {
return prime;
}
@Override
public String toString() {
return String.valueOf(prime);
}
}
public static class AbstractArray<T> extends AbstractList<T> implements RandomAccess {
private final Object[] array;
public AbstractArray(final int size) {
array = new Object[size];
}
public AbstractArray(final T[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 0, array.length);
}
@Override
public T set(final int index, final T element) {
final T ret = get(index);
array[index] = element;
return ret;
}
@Override
public T get(final int index) {
@SuppressWarnings("unchecked")
final T ret = (T) array[index];
return ret;
}
public Object[] get() {
return array;
}
public T[] get(final T[] array) {
if (array.length < this.array.length) {
@SuppressWarnings("unchecked")
final T[] ret = (T[]) Arrays.copyOfRange(this.array, 0, this.array.length, array.getClass());
return ret;
}
System.arraycopy(this.array, 0, array, 0, this.array.length);
return array;
}
@Override
public int size() {
return array.length;
}
public int length() {
return size();
}
@Override
public int hashCode() {
return Arrays.hashCode(array);
}
private class Iter implements Iterator<T> {
private int index;
private Iter() {
index = 0;
}
@Override
public boolean hasNext() {
return index < array.length;
}
@Override
public T next() {
return get(index++);
}
@Override
public void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<T> iterator() {
return new Iter();
}
}
public static class Array<T> extends AbstractArray<T> implements Serializable {
private static final long serialVersionUID = 2749604433067098063L;
public Array(final int size) {
super(size);
}
public Array(final T[] array) {
super(array);
}
public T front() {
return get(0);
}
public T back() {
return get(size() - 1);
}
}
/**
* 要素とそのindexを管理するクラスです。
*
* @author 31536000
*
* @param <E> 保持する要素
*/
public static class Enumerate<E> {
public final E value;
public final int index;
/**
* 要素とそのindexを渡します。<br>
* indexは必ずしも元の配列またはコレクションのindexと一致する必要はありませんが、一致する値を返すことが推奨されます。
*
* @param value
* @param index
*/
public Enumerate(final E value, final int index) {
this.value = value;
this.index = index;
}
/**
* 要素を返します。
*
* @return 要素
*/
public E getValue() { return value; }
/**
* indexを返します。
*
* @return index
*/
public int getIndex() { return index; }
@Override
public boolean equals(final Object o) {
if (o instanceof Enumerate)
return ((Enumerate<?>) o).getValue().equals(value) && ((Enumerate<?>) o).getIndex() == index;
return false;
}
@Override
public int hashCode() {
return value.hashCode() ^ index;
}
@Override
public String toString() {
return "{" + value.toString() + ", " + index + "}";
}
}
/**
* 要素とそのindexを効率的に取得する関数を提供します。
*
* @author 31536000
*
*/
public static class Enumeration {
private static class IteratorArray<E> implements Iterator<Enumerate<E>> {
private final E[] array;
private final int start;
private int index;
public IteratorArray(final E[] array, final int index) {
this.array = array;
this.start = index;
this.index = 0;
}
@Override
public boolean hasNext() {
return index < array.length;
}
@Override
public Enumerate<E> next() {
final Enumerate<E> ret = new Enumerate<>(array[index], index++ + start);
return ret;
}
}
private static class IteratorCollection<E> implements Iterator<Enumerate<E>> {
private final Iterator<E> iter;
private int start;
public IteratorCollection(final Iterator<E> iter, final int index) {
this.iter = iter;
this.start = index;
}
@Override
public boolean hasNext() {
return iter.hasNext();
}
@Override
public Enumerate<E> next() {
final Enumerate<E> ret = new Enumerate<>(iter.next(), start++);
return ret;
}
}
/**
* 配列の各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> 配列の型
* @param array 配列
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final E[] array) {
return enumerate(array, 0);
}
/**
* 配列の各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> 配列の型
* @param array 配列
* @param start 添字の初期値、この値だけindexが足されたものが返る
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final E[] array, final int start) {
if (array == null) throw new NullPointerException("array is null");
return new IteratorArray<>(array, start);
}
/**
* Iteratorの各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> Iteratorの型
* @param iter Iterator
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final Iterator<E> iter) {
return enumerate(iter, 0);
}
/**
* Iteratorの各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> Iteratorの型
* @param iter Iterator
* @param start 添字の初期値、この値だけindexが足されたものが返る
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final Iterator<E> iter, final int start) {
if (iter == null) throw new NullPointerException("iterator is null");
return new IteratorCollection<>(iter, start);
}
}
/**
* このクラスは配列に対する様々な操作を提供します。
* @author 31536000
*
*/
public static class ArrayUtility {
private ArrayUtility() {
throw new AssertionError();
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static int[] create(int length, java.util.function.IntUnaryOperator init) {
int[] ret = new int[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsInt(i);
return ret;
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static long[] create(int length, java.util.function.LongUnaryOperator init) {
long[] ret = new long[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsLong(i);
return ret;
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static double[] create(int length, java.util.function.DoubleUnaryOperator init) {
double[] ret = new double[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsDouble(i);
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static boolean[] add(boolean[] array, boolean element) {
if (array == null) {
boolean[] ret = { element };
return ret;
}
boolean[] ret = new boolean[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static byte[] add(byte[] array, byte element) {
if (array == null) {
byte[] ret = { element };
return ret;
}
byte[] ret = new byte[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static short[] add(short[] array, short element) {
if (array == null) {
short[] ret = { element };
return ret;
}
short[] ret = new short[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static int[] add(int[] array, int element) {
if (array == null) {
int[] ret = { element };
return ret;
}
int[] ret = new int[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static long[] add(long[] array, long element) {
if (array == null) {
long[] ret = { element };
return ret;
}
long[] ret = new long[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static float[] add(float[] array, float element) {
if (array == null) {
float[] ret = { element };
return ret;
}
float[] ret = new float[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static double[] add(double[] array, double element) {
if (array == null) {
double[] ret = { element };
return ret;
}
double[] ret = new double[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static char[] add(char[] array, char element) {
if (array == null) {
char[] ret = { element };
return ret;
}
char[] ret = new char[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static <T> T[] add(T[] array, T element) {
if (array == null) { return addAll(array, element); }
@SuppressWarnings("unchecked")
T[] ret = (T[]) java.util.Arrays.copyOfRange(array, 0, array.length + 1, array.getClass());
ret[array.length] = element;
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static boolean[] addAll(boolean[] array, boolean... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
boolean[] ret = new boolean[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static byte[] addAll(byte[] array, byte... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
byte[] ret = new byte[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static short[] addAll(short[] array, short... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
short[] ret = new short[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static int[] addAll(int[] array, int... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
int[] ret = new int[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static long[] addAll(long[] array, long... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
long[] ret = new long[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static float[] addAll(float[] array, float... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
float[] ret = new float[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static double[] addAll(double[] array, double... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
double[] ret = new double[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static char[] addAll(char[] array, char... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
char[] ret = new char[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
@SafeVarargs
public static <T> T[] addAll(T[] array, T... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
@SuppressWarnings("unchecked")
T[] ret = (T[]) java.util.Arrays.copyOfRange(array, 0, array.length + array2.length, array.getClass());
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(boolean[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(boolean[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(boolean[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(byte[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(byte[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(byte[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(short[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(short[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(short[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(int[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(int[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(int[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(long[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(long[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(long[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(float[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(float[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(float[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(double[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(double[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(double[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(char[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(char[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(char[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(Object[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(Object[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(Object[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
private static java.util.Random rnd;
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(boolean[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(boolean[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(boolean[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(boolean[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(boolean[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(boolean[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(byte[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(byte[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(byte[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(byte[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(byte[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(byte[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(short[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(short[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(short[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(short[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(short[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(short[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(int[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(int[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(int[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(int[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(int[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(int[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(long[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(long[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(long[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(long[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(long[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(long[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(float[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(float[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(float[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(float[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(float[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(float[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(double[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(double[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(double[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(double[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(double[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(double[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(char[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(char[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(char[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(char[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(char[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(char[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(Object[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(Object[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(Object[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(Object[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(Object[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(Object[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static boolean[] getArray(int size, boolean value) {
boolean[] ret = new boolean[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static byte[] getArray(int size, byte value) {
byte[] ret = new byte[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static short[] getArray(int size, short value) {
short[] ret = new short[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static int[] getArray(int size, int value) {
int[] ret = new int[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static long[] getArray(int size, long value) {
long[] ret = new long[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static float[] getArray(int size, float value) {
float[] ret = new float[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static double[] getArray(int size, double value) {
double[] ret = new double[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static char[] getArray(int size, char value) {
char[] ret = new char[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Boolean[] toObject(boolean[] array) {
if (array == null) return null;
Boolean[] ret = new Boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Byte[] toObject(byte[] array) {
if (array == null) return null;
Byte[] ret = new Byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Short[] toObject(short[] array) {
if (array == null) return null;
Short[] ret = new Short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Integer[] toObject(int[] array) {
if (array == null) return null;
Integer[] ret = new Integer[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Long[] toObject(long[] array) {
if (array == null) return null;
Long[] ret = new Long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Float[] toObject(float[] array) {
if (array == null) return null;
Float[] ret = new Float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Double[] toObject(double[] array) {
if (array == null) return null;
Double[] ret = new Double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Character[] toObject(char[] array) {
if (array == null) return null;
Character[] ret = new Character[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static boolean[] toPrimitive(Boolean[] array) {
if (array == null) return null;
boolean[] ret = new boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static boolean[] toPrimitive(Boolean[] array, boolean valueForNull) {
if (array == null) return null;
boolean[] ret = new boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static byte[] toPrimitive(Byte[] array) {
if (array == null) return null;
byte[] ret = new byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static byte[] toPrimitive(Byte[] array, byte valueForNull) {
if (array == null) return null;
byte[] ret = new byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static short[] toPrimitive(Short[] array) {
if (array == null) return null;
short[] ret = new short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static short[] toPrimitive(Short[] array, short valueForNull) {
if (array == null) return null;
short[] ret = new short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static int[] toPrimitive(Integer[] array) {
if (array == null) return null;
int[] ret = new int[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static int[] toPrimitive(Integer[] array, int valueForNull) {
if (array == null) return null;
int[] ret = new int[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static long[] toPrimitive(Long[] array) {
if (array == null) return null;
long[] ret = new long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static long[] toPrimitive(Long[] array, long valueForNull) {
if (array == null) return null;
long[] ret = new long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static float[] toPrimitive(Float[] array) {
if (array == null) return null;
float[] ret = new float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static float[] toPrimitive(Float[] array, float valueForNull) {
if (array == null) return null;
float[] ret = new float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static double[] toPrimitive(Double[] array) {
if (array == null) return null;
double[] ret = new double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static double[] toPrimitive(Double[] array, double valueForNull) {
if (array == null) return null;
double[] ret = new double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static char[] toPrimitive(Character[] array) {
if (array == null) return null;
char[] ret = new char[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static char[] toPrimitive(Character[] array, char valueForNull) {
if (array == null) return null;
char[] ret = new char[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最小値
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> T min(T[] array, java.util.Comparator<T> comparator) {
if (array == null || array.length == 0) return null;
T min = array[0];
for (int i = 1; i < array.length; ++i) if (comparator.compare(min, array[i]) > 0) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static <T extends Comparable<T>> T min(T[] array) {
return min(array, java.util.Comparator.naturalOrder());
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static byte min(byte[] array) {
byte min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static short min(short[] array) {
short min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static int min(int[] array) {
int min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static long min(long[] array) {
long min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static float min(float[] array) {
float min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static double min(double[] array) {
double min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最小値
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> T max(T[] array, java.util.Comparator<T> comparator) {
if (array == null || array.length == 0) return null;
T max = array[0];
for (int i = 1; i < array.length; ++i) if (comparator.compare(max, array[i]) < 0) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
*/
public static <T extends Comparable<T>> T max(T[] array) {
return max(array, java.util.Comparator.naturalOrder());
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static byte max(byte[] array) {
byte max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static short max(short[] array) {
short max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static int max(int[] array) {
int max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static long max(long[] array) {
long max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static float max(float[] array) {
float max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static double max(double[] array) {
double max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(boolean[] array, int n, int m) {
boolean swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(byte[] array, int n, int m) {
byte swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(short[] array, int n, int m) {
short swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(int[] array, int n, int m) {
int swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(long[] array, int n, int m) {
long swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(float[] array, int n, int m) {
float swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(double[] array, int n, int m) {
double swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(char[] array, int n, int m) {
char swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(Object[] array, int n, int m) {
Object swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static <T extends Comparable<T>> boolean nextPermutation(T[] array) {
return nextPermutation(array, java.util.Comparator.naturalOrder());
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列を書き換えたならばtrue
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> boolean nextPermutation(T[] array, java.util.Comparator<T> comparator) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (comparator.compare(array[change], array[change + 1]) < 0) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0)
if (comparator.compare(array[change], array[mid = min + halfDiff]) < 0) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(byte[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(short[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(int[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(long[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(float[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(double[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(char[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static <T extends Comparable<T>> boolean prevPermutation(T[] array) {
return prevPermutation(array, java.util.Comparator.naturalOrder());
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列を書き換えたならばtrue
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> boolean prevPermutation(T[] array, java.util.Comparator<T> comparator) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (comparator.compare(array[change], array[change + 1]) > 0) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0)
if (comparator.compare(array[change], array[mid = min + halfDiff]) > 0) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(byte[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(short[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(int[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(long[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(float[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(double[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(char[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static <T> T[] map(T[] array, java.util.function.UnaryOperator<T> map) {
T[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.apply(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static int[] map(int[] array, java.util.function.IntUnaryOperator map) {
int[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsInt(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static long[] map(long[] array, java.util.function.LongUnaryOperator map) {
long[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsLong(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static double[] map(double[] array, java.util.function.DoubleUnaryOperator map) {
double[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsDouble(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @param generator 新しい配列を生成するための関数、U::newを引数に取る
* @return 配列の各要素にmapを適用した配列
*/
public static <T, U> U[] map(T[] array, java.util.function.Function<T, U> map,
java.util.function.IntFunction<U[]> generator) {
U[] ret = generator.apply(array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.apply(array[i]);
return ret;
}
/**
* 配列を昇順にソートします。
* @complexity O(array.length)
* @param array 配列
*/
public static void sort(final byte[] array) {
if (array.length < 128) {
for (int i = 0, j; i < array.length; ++i) {
byte tmp = array[i], tmp2;
for (j = i; j > 0 && (tmp2 = array[j - 1]) > tmp; --j) array[j] = tmp2;
array[j] = tmp;
}
return;
}
int[] count = new int[256];
for (byte i : array) ++count[i & 0xff];
for (int i = 0, j = 0; j < count.length; ++j) java.util.Arrays.fill(array, i, i += count[j], (byte) j);
}
/**
* 配列を昇順にソートします。
* @complexity O(toIndex-fromIndex)
* @param array 配列
*/
public static void sort(final byte[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 128) {
for (int i = fromIndex, j; i < toIndex; ++i) {
byte tmp = array[i], tmp2;
for (j = i; j > fromIndex && (tmp2 = array[j - 1]) > tmp; --j) array[j] = tmp2;
array[j] = tmp;
}
return;
}
int[] count = new int[256];
for (int i = fromIndex; i < toIndex; ++i) ++count[array[i] & 0xff];
for (int i = fromIndex, j = 0; j < count.length; ++j)
java.util.Arrays.fill(array, i, i += count[j], (byte) j);
}
/**
* 配列を昇順にソートします。
* @complexity O(range.getDistance())
* @param array 配列
*/
public static void sort(final byte[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final short[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new short[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final short[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new short[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final short[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(short[] a, final int from, final int to, final int l, final short[] bucket) {
final int BUCKET_SIZE = 256;
final int SHORT_RECURSION = 2;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(a[i] >>> shift & MASK) + 1];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = a[i] >>> shift & MASK;
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < SHORT_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final int[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new int[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final int[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new int[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final int[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(int[] a, final int from, final int to, final int l, final int[] bucket) {
final int BUCKET_SIZE = 256;
final int INT_RECURSION = 4;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(a[i] >>> shift & MASK) + 1];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = a[i] >>> shift & MASK;
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < INT_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final long[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new long[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final long[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new long[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final long[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(long[] a, final int from, final int to, final int l, final long[] bucket) {
final int BUCKET_SIZE = 256;
final int LONG_RECURSION = 8;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(int) ((a[i] >>> shift & MASK) + 1)];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = (int) (a[i] >>> shift & MASK);
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < LONG_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static int[] compress(int[] array) {
int[] ret = new int[array.length];
int[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
int comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static int[] compress(long[] array) {
int[] ret = new int[array.length];
long[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
long comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static <T extends Comparable<T>> int[] compress(T[] array) {
int[] ret = new int[array.length];
T[] copy = java.util.Arrays.copyOf(array, array.length);
java.util.Arrays.sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
T comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid].compareTo(comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @param comparator 比較関数
* @return arrayを座標圧縮した配列
*/
public static <T> int[] compress(T[] array, java.util.Comparator<T> comparator) {
int[] ret = new int[array.length];
T[] copy = java.util.Arrays.copyOf(array, array.length);
java.util.Arrays.sort(copy, comparator);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (!copy[len - 1].equals(copy[j])) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
T comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (comparator.compare(copy[mid], comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]<list[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]==list[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nをリスト長として O(N log N)
* @param list 座標圧縮を行うリスト
* @return listを座標圧縮した配列
* @throws NullPointerException listがnullの場合
*/
public static <T extends Comparable<T>> int[] compress(java.util.List<T> list) {
int size = list.size();
int[] ret = new int[size];
java.util.ArrayList<T> copy = new java.util.ArrayList<>(list);
copy.sort(java.util.Comparator.naturalOrder());
int len = 1;
for (int j = 1; j < size; ++j) {
if (!copy.get(len - 1).equals(copy.get(j))) copy.set(len++, copy.get(j));
}
java.util.Iterator<T> iter = list.iterator();
for (int i = 0; i < size; ++i) {
int min = 0, max = len;
T comp = iter.next();
while (max - min > 1) {
int mid = min + max >> 1;
if (copy.get(mid).compareTo(comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]<list[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]==list[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nをリスト長として O(N log N)
* @param list 座標圧縮を行うリスト
* @param comparator 比較関数
* @return listを座標圧縮した配列
*/
public static <T> int[] compress(java.util.List<T> list, java.util.Comparator<T> comparator) {
int[] ret = new int[list.size()];
java.util.ArrayList<T> copy = new java.util.ArrayList<>(list);
copy.sort(comparator);
int[] bit = new int[list.size() + 1];
java.util.Iterator<T> iter = list.iterator();
for (int i = 0; i < list.size(); ++i) {
int min = 0, max = list.size();
T comp = iter.next();
while (max - min > 1) {
int mid = min + max >> 1;
if (comparator.compare(copy.get(mid), comp) <= 0) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ret[i] += bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ret;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(int[] array) {
if (array == null) return 0;
int[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int[] bit = new int[array.length + 1];
long ans = (long) array.length * (array.length - 1) >> 1;
for (int i = 0; i < array.length; ++i) {
int min = 0, max = array.length;
int comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(long[] array) {
if (array == null) return 0;
long[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int[] bit = new int[array.length + 1];
long ans = (long) array.length * (array.length - 1) >> 1;
for (int i = 0; i < array.length; ++i) {
int min = 0, max = array.length;
long comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(char[] array) {
if (array == null) return 0;
int[] a = new int[array.length];
for (int i = 0;i < array.length;++ i) a[i] = array[i];
return inversionNumber(a);
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(String array) {
if (array == null) return 0;
return inversionNumber(array.toCharArray());
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(int[] src, int[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
int[] copySrc = java.util.Arrays.copyOf(src, src.length),
copyDest = java.util.Arrays.copyOf(dest, dest.length);
sort(copySrc);
sort(copyDest);
if (!java.util.Arrays.equals(copySrc, copyDest)) return -1;
int[] key = new int[dest.length];
for (int i = 0; i < dest.length; ++i) {
int min = -1, max = dest.length;
int comp = dest[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copyDest[mid] < comp) min = mid;
else max = mid;
}
key[max] = i;
copyDest[max] = max == 0 ? Integer.MIN_VALUE : copyDest[max - 1];
}
int[] bit = new int[src.length + 1];
long ans = (long) src.length * (src.length - 1) >> 1;
for (int i = 0; i < src.length; ++i) {
int min = -1, max = src.length;
int comp = src[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copySrc[mid] < comp) min = mid;
else max = mid;
}
copySrc[max] = max == 0 ? Integer.MIN_VALUE : copySrc[max - 1];
max = key[max] + 1;
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(long[] src, long[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
long[] copySrc = java.util.Arrays.copyOf(src, src.length),
copyDest = java.util.Arrays.copyOf(dest, dest.length);
sort(copySrc);
sort(copyDest);
if (!java.util.Arrays.equals(copySrc, copyDest)) return -1;
int[] key = new int[dest.length];
for (int i = 0; i < dest.length; ++i) {
int min = -1, max = dest.length;
long comp = dest[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copyDest[mid] < comp) min = mid;
else max = mid;
}
key[max] = i;
copyDest[max] = max == 0 ? Integer.MIN_VALUE : copyDest[max - 1];
}
int[] bit = new int[src.length + 1];
long ans = (long) src.length * (src.length - 1) >> 1;
for (int i = 0; i < src.length; ++i) {
int min = -1, max = src.length;
long comp = src[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copySrc[mid] < comp) min = mid;
else max = mid;
}
copySrc[max] = max == 0 ? Integer.MIN_VALUE : copySrc[max - 1];
max = key[max] + 1;
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(char[] src, char[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
int[] a = new int[src.length];
for (int i = 0;i < src.length;++ i) a[i] = src[i];
int[] b = new int[dest.length];
for (int i = 0;i < dest.length;++ i) b[i] = dest[i];
return inversionDistance(a, b);
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(String src, String dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
return inversionDistance(src.toCharArray(), dest.toCharArray());
}
}
}
class ACL {
public static final class DisjointSetUnion {
private final int[] parent;
private DisjointSetUnion(final int n) {
parent = new int[n];
java.util.Arrays.fill(parent, -1);
}
public static DisjointSetUnion create(final int n) {
return new DisjointSetUnion(n);
}
public int getLeader(int a) {
int p1, p2;
while ((p1 = parent[a]) >= 0) {
if ((p2 = parent[p1]) >= 0) a = parent[a] = p2;
else return p1;
}
return a;
}
public int merge(int a, int b) {
a = getLeader(a);
b = getLeader(b);
if (a == b) return a;
if (parent[a] < parent[b]) {
parent[b] += parent[a];
parent[a] = b;
return b;
}
parent[a] += parent[b];
parent[b] = a;
return a;
}
public boolean isSame(final int a, final int b) {
return getLeader(a) == getLeader(b);
}
public int getSize(final int a) {
return -parent[getLeader(a)];
}
public java.util.ArrayList<java.util.ArrayList<Integer>> getGroups() {
final Object[] group = new Object[parent.length];
final java.util.ArrayList<java.util.ArrayList<Integer>> ret = new java.util.ArrayList<>();
for (int i = 0; i < parent.length; ++i) {
final int leader = getLeader(i);
final Object put = group[leader];
if (put == null) {
final java.util.ArrayList<Integer> list = new java.util.ArrayList<>();
list.add(i);
ret.add(list);
group[leader] = list;
} else {
@SuppressWarnings("unchecked")
final java.util.ArrayList<Integer> list = (java.util.ArrayList<Integer>) put;
list.add(i);
}
}
return ret;
}
@Override
public String toString() {
return getGroups().toString();
}
}
public static final class IntFenwickTree {
private final int[] array;
private IntFenwickTree(final int n) {
array = new int[n + 1];
}
private IntFenwickTree(final int[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 1, array.length);
for (int i = 1; i < this.array.length; ++i)
if (i + (i & -i) < this.array.length) this.array[i + (i & -i)] += this.array[i];
}
public static IntFenwickTree create(final int n) {
return new IntFenwickTree(n);
}
public static IntFenwickTree create(final int[] array) {
return new IntFenwickTree(array);
}
public void add(int index, final int add) {
++index;
while (index < array.length) {
array[index] += add;
index += index & -index;
}
}
private int sum(int index) {
int sum = 0;
while (index > 0) {
sum += array[index];
index -= index & -index;
}
return sum;
}
public int sum(final int l, final int r) {
return sum(r) - sum(l);
}
@Override
public String toString() {
return java.util.stream.IntStream.range(0, array.length - 1)
.mapToObj(i -> String.valueOf(sum(i + 1) - sum(i)))
.collect(java.util.stream.Collectors.joining(", ", "[", "]"));
}
}
public static final class LongFenwickTree {
private final long[] array;
private LongFenwickTree(final int n) {
array = new long[n + 1];
}
private LongFenwickTree(final long[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 1, array.length);
for (int i = 1; i < this.array.length; ++i)
if (i + (i & -i) < this.array.length) this.array[i + (i & -i)] += this.array[i];
}
public static LongFenwickTree create(final int n) {
return new LongFenwickTree(n);
}
public static LongFenwickTree create(final long[] array) {
return new LongFenwickTree(array);
}
public void add(int index, final long add) {
++index;
while (index < array.length) {
array[index] += add;
index += index & -index;
}
}
private long sum(int index) {
long sum = 0;
while (index > 0) {
sum += array[index];
index -= index & -index;
}
return sum;
}
public long sum(final int l, final int r) {
return sum(r) - sum(l);
}
@Override
public String toString() {
return java.util.stream.IntStream.range(0, array.length - 1)
.mapToObj(i -> String.valueOf(sum(i + 1) - sum(i)))
.collect(java.util.stream.Collectors.joining(", ", "[", "]"));
}
}
public static final class MathLib {
public static class Barrett {
private final int mod;
private final long h, l;
private final long MAX = 1L << 62;
private final int MASK = (1 << 31) - 1;
Barrett(final int mod) {
this.mod = mod;
final long t = MAX / mod;
h = t >>> 31;
l = t & MASK;
}
int reduce(final long x) {
final long xh = x >>> 31, xl = x & MASK;
long z = xl * l;
z = xl * h + xh * l + (z >>> 31);
z = xh * h + (z >>> 31);
final int ret = (int) (x - z * mod);
return ret >= mod ? ret - mod : ret;
}
}
public static class BarrettSmall {
private final int mod;
final long t;
BarrettSmall(final int mod) {
this.mod = mod;
t = (1L << 42) / mod;
}
int reduce(long x) {
long q = x * t >> 42;
x -= q * mod;
return (int) (x >= mod ? x - mod : x);
}
}
private static long safe_mod(long x, final long m) {
x %= m;
if (x < 0) x += m;
return x;
}
private static long[] inv_gcd(long a, final long b) {
a = safe_mod(a, b);
if (a == 0) return new long[] { b, 0 };
long s = b, t = a;
long m0 = 0, m1 = 1;
while (t > 0) {
final long u = s / t;
s -= t * u;
m0 -= m1 * u;
long tmp = s;
s = t;
t = tmp;
tmp = m0;
m0 = m1;
m1 = tmp;
}
if (m0 < 0) m0 += b / s;
return new long[] { s, m0 };
}
public static int pow(long n, long m, final int mod) {
assert m >= 0 && mod >= 1;
if (mod == 1) return 0;
return pow(n, m, new Barrett(mod));
}
public static int pow(long n, long m, Barrett mod) {
assert m >= 0;
long ans = 1, num = n % mod.mod;
while (m != 0) {
if ((m & 1) != 0) ans = mod.reduce(ans * num);
m >>>= 1;
num = mod.reduce(num * num);
}
return (int) ans;
}
public static int pow998_244_353(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 998_244_353;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 998_244_353;
m >>>= 1;
num = num * num % 998_244_353;
}
return (int) ans;
}
public static int pow167_772_161(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 167_772_161;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 167_772_161;
m >>>= 1;
num = num * num % 167_772_161;
}
return (int) ans;
}
public static int pow469_762_049(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 469_762_049;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 469_762_049;
m >>>= 1;
num = num * num % 469_762_049;
}
return (int) ans;
}
public static int pow1_000_000_007(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 1_000_000_007;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 1_000_000_007;
m >>>= 1;
num = num * num % 1_000_000_007;
}
return (int) ans;
}
public static int pow(long n, long m, BarrettSmall mod) {
assert m >= 0;
long ans = 1, num = n % mod.mod;
while (m != 0) {
if ((m & 1) != 0) ans = mod.reduce(ans * num);
m >>>= 1;
num = mod.reduce(num * num);
}
return (int) ans;
}
public static long[] crt(final long[] r, final long[] m) {
assert r.length == m.length;
final int n = r.length;
long r0 = 0, m0 = 1;
for (int i = 0; i < n; i++) {
assert 1 <= m[i];
long r1 = safe_mod(r[i], m[i]), m1 = m[i];
if (m0 < m1) {
long tmp = r0;
r0 = r1;
r1 = tmp;
tmp = m0;
m0 = m1;
m1 = tmp;
}
if (m0 % m1 == 0) {
if (r0 % m1 != r1) return new long[] { 0, 0 };
continue;
}
final long[] ig = inv_gcd(m0, m1);
final long g = ig[0], im = ig[1];
final long u1 = m1 / g;
if ((r1 - r0) % g != 0) return new long[] { 0, 0 };
final long x = (r1 - r0) / g % u1 * im % u1;
r0 += x * m0;
m0 *= u1;
if (r0 < 0) r0 += m0;
// System.err.printf("%d %d\n", r0, m0);
}
return new long[] { r0, m0 };
}
public static long floor_sum(final long n, final long m, long a, long b) {
long ans = 0;
if (a >= m) {
ans += (n - 1) * n * (a / m) / 2;
a %= m;
}
if (b >= m) {
ans += n * (b / m);
b %= m;
}
final long y_max = (a * n + b) / m;
final long x_max = y_max * m - b;
if (y_max == 0) return ans;
ans += (n - (x_max + a - 1) / a) * y_max;
ans += floor_sum(y_max, a, m, (a - x_max % a) % a);
return ans;
}
/**
* aとbの最大公約数を返します。
* @param a 整数
* @param b 整数
* @return 最大公約数
*/
public static int gcd(int a, int b) {
while (a != 0) if ((b %= a) != 0) a %= b;
else return a;
return b;
}
/**
* 配列全ての値の最大公約数を返します。
* @param array 配列
* @return 最大公約数
*/
public static int gcd(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = gcd(ret, array[i]);
return ret;
}
/**
* aとbの最大公約数を返します。
* @param a 整数
* @param b 整数
* @return 最大公約数
*/
public static long gcd(long a, long b) {
while (a != 0) if ((b %= a) != 0) a %= b;
else return a;
return b;
}
/**
* 配列全ての値の最大公約数を返します。
* @param array 配列
* @return 最大公約数
*/
public static long gcd(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = gcd(ret, array[i]);
return ret;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param a 整数
* @param b 整数
* @return 最小公倍数
*/
public static long lcm(int a, int b) {
return a / gcd(a, b) * (long) b;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param a 整数
* @param b 整数
* @return 最小公倍数
*/
public static long lcm(long a, long b) {
return a / gcd(a, b) * b;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param array 配列
* @return 最小公倍数
*/
public static long lcm(int... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = lcm(ret, array[i]);
return ret;
}
/**
* aとbのうち、小さい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち小さい方の値
*/
public static int min(int a, int b) {
return a < b ? a : b;
}
/**
* 配列の中で最小の値を返します。
* @param array 配列
* @return 配列の中で最小の値
*/
public static int min(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = min(ret, array[i]);
return ret;
}
/**
* aとbのうち、小さい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち小さい方の値
*/
public static long min(long a, long b) {
return a < b ? a : b;
}
/**
* 配列の中で最小の値を返します。
* @param array 配列
* @return 配列の中で最小の値
*/
public static long min(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = min(ret, array[i]);
return ret;
}
/**
* aとbのうち、大きい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち大きい方の値
*/
public static int max(int a, int b) {
return a > b ? a : b;
}
/**
* 配列の中で最大の値を返します。
* @param array 配列
* @return 配列の中で最大の値
*/
public static int max(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = max(ret, array[i]);
return ret;
}
/**
* aとbのうち、大きい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち大きい方の値
*/
public static long max(long a, long b) {
return a > b ? a : b;
}
/**
* 配列の中で最大の値を返します。
* @param array 配列
* @return 配列の中で最大の値
*/
public static long max(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = max(ret, array[i]);
return ret;
}
/**
* 配列の値の合計を返します。
* @param array 配列
* @return 配列の値の総和
*/
public static long sum(int... array) {
long ret = 0;
for (int i : array) ret += i;
return ret;
}
/**
* 配列の値の合計を返します。
* @param array 配列
* @return 配列の値の総和
*/
public static long sum(long... array) {
long ret = 0;
for (long i : array) ret += i;
return ret;
}
/**
* 二項係数を列挙した配列を返します。
* @param l 左辺
* @param r 右辺
* @return 0≦i≦l及び0≦j≦rを満たす全てのi, jに対してi choose jを求めた配列
*/
public static long[][] combination(int l, int r) {
long[][] pascal = new long[l + 1][r + 1];
pascal[0][0] = 1;
for (int i = 1; i <= l; ++i) {
pascal[i][0] = 1;
for (int j = 1; j <= r; ++j) {
pascal[i][j] = pascal[i - 1][j - 1] + pascal[i - 1][j];
}
}
return pascal;
}
/**
* 二分探索を行い、func(x) != func(x+1)となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+1)となるような数x
*/
public static int binarySearch(int isTrue, int isFalse, java.util.function.IntPredicate func) {
if (isTrue <= isFalse) {
int halfDiff = isFalse - isTrue >> 1, mid = isTrue + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isFalse - isTrue >> 1;
mid = isTrue + halfDiff;
}
return isTrue;
} else {
int halfDiff = isTrue - isFalse >> 1, mid = isFalse + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isTrue - isFalse >> 1;
mid = isFalse + halfDiff;
}
return isFalse;
}
}
/**
* 二分探索を行い、func(x) != func(x+1)となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+1)となるような数x
*/
public static long binarySearch(long isTrue, long isFalse, java.util.function.LongPredicate func) {
if (isTrue <= isFalse) {
long halfDiff = isFalse - isTrue >> 1, mid = isTrue + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isFalse - isTrue >> 1;
mid = isTrue + halfDiff;
}
return isTrue;
} else {
long halfDiff = isTrue - isFalse >> 1, mid = isFalse + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isTrue - isFalse >> 1;
mid = isFalse + halfDiff;
}
return isFalse;
}
}
/**
* 二分探索を行い、func(x) != func(x+Math.nextUp(x))となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+Math.nextUp(x))となるような数x
*/
public static double binarySearch(double isTrue, double isFalse, java.util.function.DoublePredicate func) {
return Double.longBitsToDouble(binarySearch(Double.doubleToRawLongBits(isTrue), Double.doubleToRawLongBits(isFalse), (long i) -> func.test(Double.longBitsToDouble(i))));
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> double find_minimal(double min, double max, int loop, java.util.function.DoubleFunction<T> func) {
return find_minimal(min, max, loop, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> double find_minimal(double min, double max, int loop, java.util.function.DoubleFunction<T> func, java.util.Comparator<T> comparator) {
double phi = (1 + Math.sqrt(5)) / 2;
for (int i = 0;i < loop;++ i) {
double mid_min = (min * phi + max) / (1 + phi), mid_max = (min + max * phi) / (1 + phi);
T mid_min_calc = func.apply(mid_min), mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) max = mid_max;
else min = mid_min;
}
return min;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> double find_maximal(double min, double max, int loop, java.util.function.DoubleFunction<T> func) {
return find_maximal(min, max, loop, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> double find_maximal(double min, double max, int loop, java.util.function.DoubleFunction<T> func, java.util.Comparator<T> comparator) {
if (max <= min) throw new IllegalArgumentException("empty range");
double phi = (1 + Math.sqrt(5)) / 2;
for (int i = 0;i < loop;++ i) {
double mid_min = (min * phi + max) / (1 + phi), mid_max = (min + max * phi) / (1 + phi);
T mid_min_calc = func.apply(mid_min), mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) max = mid_max;
else min = mid_min;
}
return min;
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> int find_minimal(int min, int max, java.util.function.IntFunction<T> func) {
return find_minimal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> int find_minimal(int min, int max, java.util.function.IntFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
int range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
int fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
int mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> int find_maximal(int min, int max, java.util.function.IntFunction<T> func) {
return find_maximal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> int find_maximal(int min, int max, java.util.function.IntFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
int range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
int fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
int mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> long find_minimal(long min, long max, java.util.function.LongFunction<T> func) {
return find_minimal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> long find_minimal(long min, long max, java.util.function.LongFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
long range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
long fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
long mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> long find_maximal(long min, long max, java.util.function.LongFunction<T> func) {
return find_maximal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> long find_maximal(long min, long max, java.util.function.LongFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
long range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
long fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
long mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_d
*/
public static final class MaxFlow {
private static final class InternalCapEdge {
final int to;
final int rev;
long cap;
InternalCapEdge(int to, int rev, long cap) {
this.to = to;
this.rev = rev;
this.cap = cap;
}
}
public static final class CapEdge {
public final int from, to;
public final long cap, flow;
CapEdge(int from, int to, long cap, long flow) {
this.from = from;
this.to = to;
this.cap = cap;
this.flow = flow;
}
@Override
public boolean equals(Object o) {
if (o instanceof CapEdge) {
CapEdge e = (CapEdge) o;
return from == e.from && to == e.to && cap == e.cap && flow == e.flow;
}
return false;
}
}
private static final class IntPair {
final int first, second;
IntPair(int first, int second) {
this.first = first;
this.second = second;
}
}
static final long INF = Long.MAX_VALUE;
private final int n;
private final java.util.ArrayList<IntPair> pos;
private final java.util.ArrayList<InternalCapEdge>[] g;
@SuppressWarnings("unchecked")
public MaxFlow(int n) {
this.n = n;
pos = new java.util.ArrayList<>();
g = new java.util.ArrayList[n];
for (int i = 0; i < n; i++) {
g[i] = new java.util.ArrayList<>();
}
}
public int addEdge(int from, int to, long cap) {
rangeCheck(from, 0, n);
rangeCheck(to, 0, n);
nonNegativeCheck(cap, "Capacity");
int m = pos.size();
pos.add(new IntPair(from, g[from].size()));
int fromId = g[from].size();
int toId = g[to].size();
if (from == to) toId++;
g[from].add(new InternalCapEdge(to, toId, cap));
g[to].add(new InternalCapEdge(from, fromId, 0L));
return m;
}
private InternalCapEdge getInternalEdge(int i) {
return g[pos.get(i).first].get(pos.get(i).second);
}
private InternalCapEdge getInternalEdgeReversed(InternalCapEdge e) {
return g[e.to].get(e.rev);
}
public CapEdge getEdge(int i) {
int m = pos.size();
rangeCheck(i, 0, m);
InternalCapEdge e = getInternalEdge(i);
InternalCapEdge re = getInternalEdgeReversed(e);
return new CapEdge(re.to, e.to, e.cap + re.cap, re.cap);
}
public CapEdge[] getEdges() {
CapEdge[] res = new CapEdge[pos.size()];
java.util.Arrays.setAll(res, this::getEdge);
return res;
}
public void changeEdge(int i, long newCap, long newFlow) {
int m = pos.size();
rangeCheck(i, 0, m);
nonNegativeCheck(newCap, "Capacity");
if (newFlow > newCap) {
throw new IllegalArgumentException(
String.format("Flow %d is greater than the capacity %d.", newCap, newFlow));
}
InternalCapEdge e = getInternalEdge(i);
InternalCapEdge re = getInternalEdgeReversed(e);
e.cap = newCap - newFlow;
re.cap = newFlow;
}
public long maxFlow(int s, int t) {
return flow(s, t, INF);
}
public long flow(int s, int t, long flowLimit) {
rangeCheck(s, 0, n);
rangeCheck(t, 0, n);
long flow = 0L;
int[] level = new int[n];
int[] que = new int[n];
int[] iter = new int[n];
while (flow < flowLimit) {
bfs(s, t, level, que);
if (level[t] < 0) break;
java.util.Arrays.fill(iter, 0);
while (flow < flowLimit) {
long d = dfs(t, s, flowLimit - flow, iter, level);
if (d == 0) break;
flow += d;
}
}
return flow;
}
private void bfs(int s, int t, int[] level, int[] que) {
java.util.Arrays.fill(level, -1);
int hd = 0, tl = 0;
que[tl++] = s;
level[s] = 0;
while (hd < tl) {
int u = que[hd++];
for (InternalCapEdge e : g[u]) {
int v = e.to;
if (e.cap == 0 || level[v] >= 0) continue;
level[v] = level[u] + 1;
if (v == t) return;
que[tl++] = v;
}
}
}
private long dfs(int cur, int s, long flowLimit, int[] iter, int[] level) {
if (cur == s) return flowLimit;
long res = 0;
int curLevel = level[cur];
for (int itMax = g[cur].size(); iter[cur] < itMax; iter[cur]++) {
int i = iter[cur];
InternalCapEdge e = g[cur].get(i);
InternalCapEdge re = getInternalEdgeReversed(e);
if (curLevel <= level[e.to] || re.cap == 0) continue;
long d = dfs(e.to, s, Math.min(flowLimit - res, re.cap), iter, level);
if (d <= 0) continue;
e.cap += d;
re.cap -= d;
res += d;
if (res == flowLimit) break;
}
return res;
}
public boolean[] minCut(int s) {
rangeCheck(s, 0, n);
boolean[] visited = new boolean[n];
int[] stack = new int[n];
int ptr = 0;
stack[ptr++] = s;
visited[s] = true;
while (ptr > 0) {
int u = stack[--ptr];
for (InternalCapEdge e : g[u]) {
int v = e.to;
if (e.cap > 0 && !visited[v]) {
visited[v] = true;
stack[ptr++] = v;
}
}
}
return visited;
}
private void rangeCheck(int i, int minInclusive, int maxExclusive) {
if (i < 0 || i >= maxExclusive) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for length %d", i, maxExclusive));
}
}
private void nonNegativeCheck(long cap, String attribute) {
if (cap < 0) { throw new IllegalArgumentException(String.format("%s %d is negative.", attribute, cap)); }
}
}
/**
* @verified
* - https://atcoder.jp/contests/practice2/tasks/practice2_e
* - http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B
*/
public static final class MinCostFlow {
private static final class InternalWeightedCapEdge {
final int to, rev;
long cap;
final long cost;
InternalWeightedCapEdge(int to, int rev, long cap, long cost) {
this.to = to;
this.rev = rev;
this.cap = cap;
this.cost = cost;
}
}
public static final class WeightedCapEdge {
public final int from, to;
public final long cap, flow, cost;
WeightedCapEdge(int from, int to, long cap, long flow, long cost) {
this.from = from;
this.to = to;
this.cap = cap;
this.flow = flow;
this.cost = cost;
}
@Override
public boolean equals(Object o) {
if (o instanceof WeightedCapEdge) {
WeightedCapEdge e = (WeightedCapEdge) o;
return from == e.from && to == e.to && cap == e.cap && flow == e.flow && cost == e.cost;
}
return false;
}
}
private static final class IntPair {
final int first, second;
IntPair(int first, int second) {
this.first = first;
this.second = second;
}
}
public static final class FlowAndCost {
public final long flow, cost;
FlowAndCost(long flow, long cost) {
this.flow = flow;
this.cost = cost;
}
@Override
public boolean equals(Object o) {
if (o instanceof FlowAndCost) {
FlowAndCost c = (FlowAndCost) o;
return flow == c.flow && cost == c.cost;
}
return false;
}
}
static final long INF = Long.MAX_VALUE;
private final int n;
private final java.util.ArrayList<IntPair> pos;
private final java.util.ArrayList<InternalWeightedCapEdge>[] g;
@SuppressWarnings("unchecked")
public MinCostFlow(int n) {
this.n = n;
pos = new java.util.ArrayList<>();
g = new java.util.ArrayList[n];
for (int i = 0; i < n; i++) {
g[i] = new java.util.ArrayList<>();
}
}
public int addEdge(int from, int to, long cap, long cost) {
rangeCheck(from, 0, n);
rangeCheck(to, 0, n);
nonNegativeCheck(cap, "Capacity");
nonNegativeCheck(cost, "Cost");
int m = pos.size();
pos.add(new IntPair(from, g[from].size()));
int fromId = g[from].size();
int toId = g[to].size();
if (from == to) toId++;
g[from].add(new InternalWeightedCapEdge(to, toId, cap, cost));
g[to].add(new InternalWeightedCapEdge(from, fromId, 0L, -cost));
return m;
}
private InternalWeightedCapEdge getInternalEdge(int i) {
return g[pos.get(i).first].get(pos.get(i).second);
}
private InternalWeightedCapEdge getInternalEdgeReversed(InternalWeightedCapEdge e) {
return g[e.to].get(e.rev);
}
public WeightedCapEdge getEdge(int i) {
int m = pos.size();
rangeCheck(i, 0, m);
InternalWeightedCapEdge e = getInternalEdge(i);
InternalWeightedCapEdge re = getInternalEdgeReversed(e);
return new WeightedCapEdge(re.to, e.to, e.cap + re.cap, re.cap, e.cost);
}
public WeightedCapEdge[] getEdges() {
WeightedCapEdge[] res = new WeightedCapEdge[pos.size()];
java.util.Arrays.setAll(res, this::getEdge);
return res;
}
public FlowAndCost minCostMaxFlow(int s, int t) {
return minCostFlow(s, t, INF);
}
public FlowAndCost minCostFlow(int s, int t, long flowLimit) {
return minCostSlope(s, t, flowLimit).getLast();
}
public java.util.ArrayList<Long> minCostList(int s, int t) {
return minCostList(s, t, INF);
}
public java.util.ArrayList<Long> minCostList(int s, int t, long flowLimit) {
java.util.LinkedList<FlowAndCost> list = minCostSlope(s, t, flowLimit);
FlowAndCost last = list.pollFirst();
java.util.ArrayList<Long> ret = new java.util.ArrayList<>();
ret.add(0L);
while(!list.isEmpty()) {
FlowAndCost now = list.pollFirst();
for (long i = last.flow + 1;i <= now.flow;++ i) {
ret.add(last.cost + (i - last.flow) * (now.cost - last.cost) / (now.flow - last.flow));
}
last = now;
}
return ret;
}
java.util.LinkedList<FlowAndCost> minCostSlope(int s, int t) {
return minCostSlope(s, t, INF);
}
public java.util.LinkedList<FlowAndCost> minCostSlope(int s, int t, long flowLimit) {
rangeCheck(s, 0, n);
rangeCheck(t, 0, n);
if (s == t) { throw new IllegalArgumentException(String.format("%d and %d is the same vertex.", s, t)); }
long[] dual = new long[n];
long[] dist = new long[n];
int[] pv = new int[n];
int[] pe = new int[n];
boolean[] vis = new boolean[n];
long flow = 0;
long cost = 0, prev_cost = -1;
java.util.LinkedList<FlowAndCost> result = new java.util.LinkedList<>();
result.addLast(new FlowAndCost(flow, cost));
while (flow < flowLimit) {
if (!dualRef(s, t, dual, dist, pv, pe, vis)) break;
long c = flowLimit - flow;
for (int v = t; v != s; v = pv[v]) {
c = Math.min(c, g[pv[v]].get(pe[v]).cap);
}
for (int v = t; v != s; v = pv[v]) {
InternalWeightedCapEdge e = g[pv[v]].get(pe[v]);
e.cap -= c;
g[v].get(e.rev).cap += c;
}
long d = -dual[s];
flow += c;
cost += c * d;
if (prev_cost == d) {
result.removeLast();
}
result.addLast(new FlowAndCost(flow, cost));
prev_cost = cost;
}
return result;
}
private boolean dualRef(int s, int t, long[] dual, long[] dist, int[] pv, int[] pe, boolean[] vis) {
java.util.Arrays.fill(dist, INF);
java.util.Arrays.fill(pv, -1);
java.util.Arrays.fill(pe, -1);
java.util.Arrays.fill(vis, false);
class State implements Comparable<State> {
final long key;
final int to;
State(long key, int to) {
this.key = key;
this.to = to;
}
@Override
public int compareTo(State q) {
return key > q.key ? 1 : -1;
}
};
java.util.PriorityQueue<State> pq = new java.util.PriorityQueue<>();
dist[s] = 0;
pq.add(new State(0L, s));
while (pq.size() > 0) {
int v = pq.poll().to;
if (vis[v]) continue;
vis[v] = true;
if (v == t) break;
for (int i = 0, deg = g[v].size(); i < deg; i++) {
InternalWeightedCapEdge e = g[v].get(i);
if (vis[e.to] || e.cap == 0) continue;
long cost = e.cost - dual[e.to] + dual[v];
if (dist[e.to] - dist[v] > cost) {
dist[e.to] = dist[v] + cost;
pv[e.to] = v;
pe[e.to] = i;
pq.add(new State(dist[e.to], e.to));
}
}
}
if (!vis[t]) { return false; }
for (int v = 0; v < n; v++) {
if (!vis[v]) continue;
dual[v] -= dist[t] - dist[v];
}
return true;
}
private void rangeCheck(int i, int minInlusive, int maxExclusive) {
if (i < 0 || i >= maxExclusive) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for length %d", i, maxExclusive));
}
}
private void nonNegativeCheck(long cap, java.lang.String attribute) {
if (cap < 0) { throw new IllegalArgumentException(String.format("%s %d is negative.", attribute, cap)); }
}
}
/**
* @verified
* <ul>
* <li>https://atcoder.jp/contests/arc050/tasks/arc050_c
* <li>https://atcoder.jp/contests/abc129/tasks/abc129_f
* </ul>
*/
public static final class ModIntFactory {
private final ModArithmetic ma;
private final int mod;
public ModIntFactory(final int mod) {
ma = ModArithmetic.of(mod);
this.mod = mod;
}
public ModInt create(long value) {
if ((value %= mod) < 0) value += mod;
if (ma instanceof ModArithmetic.ModArithmeticMontgomery) {
return new ModInt(((ModArithmetic.ModArithmeticMontgomery) ma).generate(value));
}
return new ModInt((int) value);
}
class ModInt {
private int value;
private ModInt(final int value) {
this.value = value;
}
public int mod() {
return mod;
}
public int value() {
if (ma instanceof ModArithmetic.ModArithmeticMontgomery) {
return ((ModArithmetic.ModArithmeticMontgomery) ma).reduce(value);
}
return value;
}
public ModInt add(final ModInt mi) {
return new ModInt(ma.add(value, mi.value));
}
public ModInt add(final ModInt mi1, final ModInt mi2) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2);
}
public ModInt add(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3);
}
public ModInt add(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt add(final ModInt mi1, final ModInt... mis) {
final ModInt mi = add(mi1);
for (final ModInt m : mis) mi.addAsg(m);
return mi;
}
public ModInt add(final long mi) {
return new ModInt(ma.add(value, ma.remainder(mi)));
}
public ModInt sub(final ModInt mi) {
return new ModInt(ma.sub(value, mi.value));
}
public ModInt sub(final long mi) {
return new ModInt(ma.sub(value, ma.remainder(mi)));
}
public ModInt mul(final ModInt mi) {
return new ModInt(ma.mul(value, mi.value));
}
public ModInt mul(final ModInt mi1, final ModInt mi2) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2);
}
public ModInt mul(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mul(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mul(final ModInt mi1, final ModInt... mis) {
final ModInt mi = mul(mi1);
for (final ModInt m : mis) mi.mulAsg(m);
return mi;
}
public ModInt mul(final long mi) {
return new ModInt(ma.mul(value, ma.remainder(mi)));
}
public ModInt div(final ModInt mi) {
return new ModInt(ma.div(value, mi.value));
}
public ModInt div(final long mi) {
return new ModInt(ma.div(value, ma.remainder(mi)));
}
public ModInt inv() {
return new ModInt(ma.inv(value));
}
public ModInt pow(final long b) {
return new ModInt(ma.pow(value, b));
}
public ModInt addAsg(final ModInt mi) {
value = ma.add(value, mi.value);
return this;
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2) {
return addAsg(mi1).addAsg(mi2);
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3);
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt addAsg(final ModInt... mis) {
for (final ModInt m : mis) addAsg(m);
return this;
}
public ModInt addAsg(final long mi) {
value = ma.add(value, ma.remainder(mi));
return this;
}
public ModInt subAsg(final ModInt mi) {
value = ma.sub(value, mi.value);
return this;
}
public ModInt subAsg(final long mi) {
value = ma.sub(value, ma.remainder(mi));
return this;
}
public ModInt mulAsg(final ModInt mi) {
value = ma.mul(value, mi.value);
return this;
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2) {
return mulAsg(mi1).mulAsg(mi2);
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mulAsg(final ModInt... mis) {
for (final ModInt m : mis) mulAsg(m);
return this;
}
public ModInt mulAsg(final long mi) {
value = ma.mul(value, ma.remainder(mi));
return this;
}
public ModInt divAsg(final ModInt mi) {
value = ma.div(value, mi.value);
return this;
}
public ModInt divAsg(final long mi) {
value = ma.div(value, ma.remainder(mi));
return this;
}
@Override
public String toString() {
return String.valueOf(value());
}
@Override
public boolean equals(final Object o) {
if (o instanceof ModInt) {
final ModInt mi = (ModInt) o;
return mod() == mi.mod() && value() == mi.value();
}
return false;
}
@Override
public int hashCode() {
return (1 * 37 + mod()) * 37 + value();
}
}
private interface ModArithmetic {
public int mod();
public int remainder(long value);
public int add(int a, int b);
public int sub(int a, int b);
public int mul(int a, int b);
public default int div(final int a, final int b) {
return mul(a, inv(b));
}
public int inv(int a);
public int pow(int a, long b);
public static ModArithmetic of(final int mod) {
if (mod <= 0) {
throw new IllegalArgumentException();
} else if (mod == 1) {
return new ModArithmetic1();
} else if (mod == 2) {
return new ModArithmetic2();
} else if (mod == 998244353) {
return new ModArithmetic998244353();
} else if (mod == 1000000007) {
return new ModArithmetic1000000007();
} else if ((mod & 1) == 1) {
return new ModArithmeticMontgomery(mod);
} else {
return new ModArithmeticBarrett(mod);
}
}
static final class ModArithmetic1 implements ModArithmetic {
@Override
public int mod() {
return 1;
}
@Override
public int remainder(final long value) {
return 0;
}
@Override
public int add(final int a, final int b) {
return 0;
}
@Override
public int sub(final int a, final int b) {
return 0;
}
@Override
public int mul(final int a, final int b) {
return 0;
}
@Override
public int inv(final int a) {
throw new ArithmeticException("divide by zero");
}
@Override
public int pow(final int a, final long b) {
return 0;
}
}
static final class ModArithmetic2 implements ModArithmetic {
@Override
public int mod() {
return 2;
}
@Override
public int remainder(final long value) {
return (int) (value & 1);
}
@Override
public int add(final int a, final int b) {
return a ^ b;
}
@Override
public int sub(final int a, final int b) {
return a ^ b;
}
@Override
public int mul(final int a, final int b) {
return a & b;
}
@Override
public int inv(final int a) {
if (a == 0) throw new ArithmeticException("divide by zero");
return a;
}
@Override
public int pow(final int a, final long b) {
if (b == 0) return 1;
return a;
}
}
static final class ModArithmetic998244353 implements ModArithmetic {
private final int mod = 998244353;
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int res = a + b;
return res >= mod ? res - mod : res;
}
@Override
public int sub(final int a, final int b) {
final int res = a - b;
return res < 0 ? res + mod : res;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
long res = 1;
long pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = pow2 * pow2 % mod;
}
res = res * pow2 % mod;
b ^= lsb;
}
return (int) res;
}
}
static final class ModArithmetic1000000007 implements ModArithmetic {
private final int mod = 1000000007;
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int res = a + b;
return res >= mod ? res - mod : res;
}
@Override
public int sub(final int a, final int b) {
final int res = a - b;
return res < 0 ? res + mod : res;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int div(final int a, final int b) {
return mul(a, inv(b));
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
long res = 1;
long pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = pow2 * pow2 % mod;
}
res = res * pow2 % mod;
b ^= lsb;
}
return (int) res;
}
}
static final class ModArithmeticMontgomery extends ModArithmeticDynamic {
private final long negInv;
private final long r2, r3;
private ModArithmeticMontgomery(final int mod) {
super(mod);
long inv = 0;
long s = 1, t = 0;
for (int i = 0; i < 32; i++) {
if ((t & 1) == 0) {
t += mod;
inv += s;
}
t >>= 1;
s <<= 1;
}
final long r = (1l << 32) % mod;
negInv = inv;
r2 = r * r % mod;
r3 = r2 * r % mod;
}
private int generate(final long x) {
return reduce(x * r2);
}
private int reduce(long x) {
x = x + (x * negInv & 0xffff_ffffl) * mod >>> 32;
return (int) (x < mod ? x : x - mod);
}
@Override
public int remainder(long value) {
return generate((value %= mod) < 0 ? value + mod : value);
}
@Override
public int mul(final int a, final int b) {
return reduce((long) a * b);
}
@Override
public int inv(int a) {
a = super.inv(a);
return reduce(a * r3);
}
@Override
public int pow(final int a, final long b) {
return generate(super.pow(a, b));
}
}
static final class ModArithmeticBarrett extends ModArithmeticDynamic {
private static final long mask = 0xffff_ffffl;
private final long mh;
private final long ml;
private ModArithmeticBarrett(final int mod) {
super(mod);
/**
* m = floor(2^64/mod) 2^64 = p*mod + q, 2^32 = a*mod + b => (a*mod + b)^2 =
* p*mod + q => p = mod*a^2 + 2ab + floor(b^2/mod)
*/
final long a = (1l << 32) / mod;
final long b = (1l << 32) % mod;
final long m = a * a * mod + 2 * a * b + b * b / mod;
mh = m >>> 32;
ml = m & mask;
}
private int reduce(long x) {
long z = (x & mask) * ml;
z = (x & mask) * mh + (x >>> 32) * ml + (z >>> 32);
z = (x >>> 32) * mh + (z >>> 32);
x -= z * mod;
return (int) (x < mod ? x : x - mod);
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int mul(final int a, final int b) {
return reduce((long) a * b);
}
}
static class ModArithmeticDynamic implements ModArithmetic {
final int mod;
public ModArithmeticDynamic(final int mod) {
this.mod = mod;
}
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int sum = a + b;
return sum >= mod ? sum - mod : sum;
}
@Override
public int sub(final int a, final int b) {
final int sum = a - b;
return sum < 0 ? sum + mod : sum;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
int res = 1;
int pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = mul(pow2, pow2);
}
res = mul(res, pow2);
b ^= lsb;
}
return res;
}
}
}
}
/**
* Convolution.
*
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_f
* @verified https://judge.yosupo.jp/problem/convolution_mod_1000000007
*/
public static final class Convolution {
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
private static void fft(double[] a, double[] b, boolean invert) {
int count = a.length;
for (int i = 1, j = 0; i < count; i++) {
int bit = count >> 1;
for (; j >= bit; bit >>= 1) {
j -= bit;
}
j += bit;
if (i < j) {
double temp = a[i];
a[i] = a[j];
a[j] = temp;
temp = b[i];
b[i] = b[j];
b[j] = temp;
}
}
for (int len = 2; len <= count; len <<= 1) {
int halfLen = len >> 1;
double angle = 2 * Math.PI / len;
if (invert) {
angle = -angle;
}
double wLenA = Math.cos(angle);
double wLenB = Math.sin(angle);
for (int i = 0; i < count; i += len) {
double wA = 1;
double wB = 0;
for (int j = 0; j < halfLen; j++) {
double uA = a[i + j];
double uB = b[i + j];
double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;
double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;
a[i + j] = uA + vA;
b[i + j] = uB + vB;
a[i + j + halfLen] = uA - vA;
b[i + j + halfLen] = uB - vB;
double nextWA = wA * wLenA - wB * wLenB;
wB = wA * wLenB + wB * wLenA;
wA = nextWA;
}
}
}
if (invert) {
for (int i = 0; i < count; i++) {
a[i] /= count;
b[i] /= count;
}
}
}
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
public static long[] convolution(long[] a, long[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = new double[resultSize];
double[] aImaginary = new double[resultSize];
double[] bReal = new double[resultSize];
double[] bImaginary = new double[resultSize];
for (int i = 0; i < a.length; i++) aReal[i] = a[i];
for (int i = 0; i < b.length; i++) bReal[i] = b[i];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
long[] result = new long[a.length + b.length - 1];
for (int i = 0; i < result.length; i++) result[i] = Math.round(aReal[i]);
return result;
}
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
public static int[] convolution(int[] a, int[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = new double[resultSize];
double[] aImaginary = new double[resultSize];
double[] bReal = new double[resultSize];
double[] bImaginary = new double[resultSize];
for (int i = 0; i < a.length; i++) aReal[i] = a[i];
for (int i = 0; i < b.length; i++) bReal[i] = b[i];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
int[] result = new int[a.length + b.length - 1];
for (int i = 0; i < result.length; i++) result[i] = (int) Math.round(aReal[i]);
return result;
}
public static double[] convolution(double[] a, double[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = Arrays.copyOf(a, resultSize);
double[] aImaginary = new double[resultSize];
double[] bReal = Arrays.copyOf(b, resultSize);
double[] bImaginary = new double[resultSize];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
return Arrays.copyOf(aReal, a.length + b.length - 1);
}
/**
* Find a primitive root.
*
* @param m A prime number.
* @return Primitive root.
*/
private static int primitiveRoot(final int m) {
if (m == 2) return 1;
if (m == 167772161) return 3;
if (m == 469762049) return 3;
if (m == 754974721) return 11;
if (m == 998244353) return 3;
final int[] divs = new int[20];
divs[0] = 2;
int cnt = 1;
int x = (m - 1) / 2;
while (x % 2 == 0) x /= 2;
for (int i = 3; (long) i * i <= x; i += 2) {
if (x % i == 0) {
divs[cnt++] = i;
while (x % i == 0) {
x /= i;
}
}
}
if (x > 1) {
divs[cnt++] = x;
}
for (int g = 2;; g++) {
boolean ok = true;
for (int i = 0; i < cnt; i++) {
if (MathLib.pow(g, (m - 1) / divs[i], m) == 1) {
ok = false;
break;
}
}
if (ok) return g;
}
}
/**
* Ceil of power 2.
*
* @param n Value.
* @return Ceil of power 2.
*/
private static int ceilPow2(final int n) {
int x = 0;
while (1L << x < n) x++;
return x;
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static long garner(final long[] c, final int[] mods) {
final int n = c.length + 1;
final long[] cnst = new long[n];
final long[] coef = new long[n];
java.util.Arrays.fill(coef, 1);
for (int i = 0; i < n - 1; i++) {
final int m1 = mods[i];
long v = (c[i] - cnst[i] + m1) % m1;
v = v * MathLib.pow(coef[i], m1 - 2, m1) % m1;
for (int j = i + 1; j < n; j++) {
final long m2 = mods[j];
cnst[j] = (cnst[j] + coef[j] * v) % m2;
coef[j] = coef[j] * m1 % m2;
}
}
return cnst[n - 1];
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static int garner(int c0, int c1, int c2, final MathLib.Barrett[] mods) {
final long[] cnst = new long[4];
final long[] coef = new long[4];
java.util.Arrays.fill(coef, 1);
MathLib.Barrett m1 = mods[0];
long v = m1.reduce(c0 - cnst[0] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[0], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[1];
cnst[1] = m2.reduce(cnst[1] + coef[1] * v);
coef[1] = m2.reduce(coef[1] * m1.mod);
m2 = mods[2];
cnst[2] = m2.reduce(cnst[2] + coef[2] * v);
coef[2] = m2.reduce(coef[2] * m1.mod);
m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
m1 = mods[1];
v = m1.reduce(c1 - cnst[1] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[1], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[2];
cnst[2] = m2.reduce(cnst[2] + coef[2] * v);
coef[2] = m2.reduce(coef[2] * m1.mod);
m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
m1 = mods[2];
v = m1.reduce(c2 - cnst[2] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[2], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
return (int) cnst[3];
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static int garner1_000_000_007(int c0, int c1, int c2) {
final long[] cnst = new long[4];
final long[] coef = new long[4];
java.util.Arrays.fill(coef, 1);
long v = (c0 - cnst[0] + 998_244_353) % 998_244_353;
v = v * MathLib.pow998_244_353(coef[0], 998_244_353 - 2) % 998_244_353;
{
cnst[1] = (cnst[1] + coef[1] * v) % 167_772_161;
coef[1] = coef[1] * 998_244_353 % 167_772_161;
cnst[2] = (cnst[2] + coef[2] * v) % 469_762_049;
coef[2] = coef[2] * 998_244_353 % 469_762_049;
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 998_244_353 % 1_000_000_007;
}
v = (c1 - cnst[1] + 167_772_161) % 167_772_161;
v = v * MathLib.pow167_772_161(coef[1], 167_772_161 - 2) % 167_772_161;
{
cnst[2] = (cnst[2] + coef[2] * v) % 469_762_049;
coef[2] = coef[2] * 167_772_161 % 469_762_049;
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 167_772_161 % 1_000_000_007;
}
v = (c2 - cnst[2] + 469_762_049) % 469_762_049;
v = v * MathLib.pow469_762_049(coef[2], 469_762_049 - 2) % 469_762_049;
{
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 469_762_049 % 1_000_000_007;
}
return (int) cnst[3];
}
/**
* Pre-calculation for NTT.
*
* @param mod NTT Prime.
* @param g Primitive root of mod.
* @return Pre-calculation table.
*/
private static long[] sumE(final int mod, final int g) {
final long[] sum_e = new long[30];
final long[] es = new long[30];
final long[] ies = new long[30];
final int cnt2 = Integer.numberOfTrailingZeros(mod - 1);
long e = MathLib.pow(g, mod - 1 >> cnt2, mod);
long ie = MathLib.pow(e, mod - 2, mod);
for (int i = cnt2; i >= 2; i--) {
es[i - 2] = e;
ies[i - 2] = ie;
e = e * e % mod;
ie = ie * ie % mod;
}
long now = 1;
for (int i = 0; i < cnt2 - 2; i++) {
sum_e[i] = es[i] * now % mod;
now = now * ies[i] % mod;
}
return sum_e;
}
/**
* Pre-calculation for inverse NTT.
*
* @param mod Mod.
* @param g Primitive root of mod.
* @return Pre-calculation table.
*/
private static long[] sumIE(final int mod, final int g) {
final long[] sum_ie = new long[30];
final long[] es = new long[30];
final long[] ies = new long[30];
final int cnt2 = Integer.numberOfTrailingZeros(mod - 1);
long e = MathLib.pow(g, mod - 1 >> cnt2, mod);
long ie = MathLib.pow(e, mod - 2, mod);
for (int i = cnt2; i >= 2; i--) {
es[i - 2] = e;
ies[i - 2] = ie;
e = e * e % mod;
ie = ie * ie % mod;
}
long now = 1;
for (int i = 0; i < cnt2 - 2; i++) {
sum_ie[i] = ies[i] * now % mod;
now = now * es[i] % mod;
}
return sum_ie;
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterflyInv(final long[] a, final long[] sumIE, final int mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (l + r) % mod;
a[i + offset + p] = (mod + l - r) * inow % mod;
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % mod;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly(final long[] a, final long[] sumE, final int mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now % mod;
a[i + offset] = (l + r) % mod;
a[i + offset + p] = (l - r + mod) % mod;
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % mod;
}
}
}
/**
* Inverse NTT used mod 998_244_353.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv998_244_353(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 998_244_353);
a[i + offset + p] = (int) ((998_244_353 + l - r) * inow % 998_244_353);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 998_244_353;
}
}
}
/**
* Inverse NTT used mod 167_772_161.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv167_772_161(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 167_772_161);
a[i + offset + p] = (int) ((167_772_161 + l - r) * inow % 167_772_161);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 167_772_161;
}
}
}
/**
* Inverse NTT used mod 469_762_049.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv469_762_049(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 469_762_049);
a[i + offset + p] = (int) ((469_762_049 + l - r) * inow % 469_762_049);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 469_762_049;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterflyInv(final int[] a, final int[] sumIE, final MathLib.Barrett mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
long sum = l + r;
if (sum >= mod.mod) sum -= mod.mod;
a[i + offset] = (int) sum;
a[i + offset + p] = mod.reduce((mod.mod + l - r) * inow);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = mod.reduce(inow * sumIE[x]);
}
}
}
/**
* Inverse NTT used mod 998_244_353.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly998_244_353(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (998_244_353 - 2) * 998_244_353;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 998_244_353);
a[i + offset + p] = (int) ((l - r + ADD) % 998_244_353);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 998_244_353;
}
}
}
/**
* Inverse NTT used mod 167_772_161.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly167_772_161(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (167_772_161 - 2) * 167_772_161;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 167_772_161);
a[i + offset + p] = (int) ((l - r + ADD) % 167_772_161);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 167_772_161;
}
}
}
/**
* Inverse NTT used mod 469_762_049.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly469_762_049(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (469_762_049 - 2) * 469_762_049;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 469_762_049);
a[i + offset + p] = (int) ((l - r + ADD) % 469_762_049);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 469_762_049;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly(final int[] a, final int[] sumE, final MathLib.Barrett mod) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (mod.mod - 2) * mod.mod;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = mod.reduce(l + r);
a[i + offset + p] = mod.reduce(l - r + ADD);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = mod.reduce(now * sumE[x]);
}
}
}
/**
* Convolution used mod 998_244_353.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution998_244_353(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(998_244_353);
final int[] sume;
{
long[] s = sumE(998_244_353, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(998_244_353, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly998_244_353(a, sume);
butterfly998_244_353(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 998_244_353);
butterflyInv998_244_353(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow998_244_353(z, 998_244_353 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 998_244_353);
return a;
}
/**
* Convolution used mod 167_772_161.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution167_772_161(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(167_772_161);
final int[] sume;
{
long[] s = sumE(167_772_161, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(167_772_161, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly167_772_161(a, sume);
butterfly167_772_161(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 167_772_161);
butterflyInv167_772_161(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow167_772_161(z, 167_772_161 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 167_772_161);
return a;
}
/**
* Convolution used mod 469_762_049.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution469_762_049(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(469_762_049);
final int[] sume;
{
long[] s = sumE(469_762_049, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(469_762_049, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly469_762_049(a, sume);
butterfly469_762_049(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 469_762_049);
butterflyInv469_762_049(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow469_762_049(z, 469_762_049 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 469_762_049);
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod NTT Prime.
* @return Answer.
*/
private static int[] convolutionNTT(int[] a, int[] b, final int mod) {
MathLib.Barrett barrett = new MathLib.Barrett(mod);
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(mod);
final int[] sume;
{
long[] s = sumE(mod, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(mod, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly(a, sume, barrett);
butterfly(b, sume, barrett);
for (int i = 0; i < z; i++) a[i] = barrett.reduce((long) a[i] * b[i]);
butterflyInv(a, sumie, barrett);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow(z, mod - 2, mod);
for (int i = 0; i < n + m - 1; i++) a[i] = barrett.reduce(a[i] * iz);
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod NTT Prime.
* @return Answer.
*/
private static long[] convolutionNTT(long[] a, long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new long[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final long[] na = new long[z];
final long[] nb = new long[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(mod);
final long[] sume = sumE(mod, g);
final long[] sumie = sumIE(mod, g);
butterfly(a, sume, mod);
butterfly(b, sume, mod);
for (int i = 0; i < z; i++) {
a[i] = a[i] * b[i] % mod;
}
butterflyInv(a, sumie, mod);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow(z, mod - 2, mod);
for (int i = 0; i < n + m - 1; i++) a[i] = a[i] * iz % mod;
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static long[] convolution(final long[] a, final long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new long[0];
final int mod1 = 998_244_353;
final int mod2 = 167_772_161;
final int mod3 = 469_762_049;
final long[] c1 = convolutionNTT(a, b, mod1);
final long[] c2 = convolutionNTT(a, b, mod2);
final long[] c3 = convolutionNTT(a, b, mod3);
final int retSize = c1.length;
final long[] ret = new long[retSize];
final int[] mods = { mod1, mod2, mod3, mod };
for (int i = 0; i < retSize; ++i) {
ret[i] = garner(new long[] { c1[i], c2[i], c3[i] }, mods);
}
return ret;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static int[] convolution(final int[] a, final int[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
if (mod == 1_000_000_007) return convolution1_000_000_007(a, b);
if (mod == 998_244_353) return convolution998_244_353(a, b);
int ntt = Integer.lowestOneBit(mod - 1) >> 1;
if (n + m <= ntt) return convolutionNTT(a, b, mod);
final int[] c1 = convolution998_244_353(a, b);
final int[] c2 = convolution167_772_161(a, b);
final int[] c3 = convolution469_762_049(a, b);
final int retSize = c1.length;
final int[] ret = new int[retSize];
final MathLib.Barrett[] mods = { new MathLib.Barrett(998_244_353), new MathLib.Barrett(167_772_161),
new MathLib.Barrett(469_762_049), new MathLib.Barrett(mod) };
for (int i = 0; i < retSize; ++i) ret[i] = garner(c1[i], c2[i], c3[i], mods);
return ret;
}
/**
* Convolution used mod 1_000_000_007.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution1_000_000_007(final int[] a, final int[] b) {
final int[] c1 = convolution998_244_353(a, b);
final int[] c2 = convolution167_772_161(a, b);
final int[] c3 = convolution469_762_049(a, b);
final int retSize = c1.length;
final int[] ret = new int[retSize];
for (int i = 0; i < retSize; ++i) ret[i] = garner1_000_000_007(c1[i], c2[i], c3[i]);
return ret;
}
/**
* Convolution. need: length < 2000
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static int[] convolution2(final int[] a, final int[] b, final int mod) {
if (Math.max(a.length, b.length) < 4000) {
long[] la = new long[a.length], ha = new long[a.length], ma = new long[a.length],
lb = new long[b.length], hb = new long[b.length], mb = new long[b.length];
MathLib.Barrett barrett = new MathLib.Barrett(mod);
for (int i = 0; i < a.length; ++i) {
ha[i] = a[i] >> 15;
la[i] = a[i] & 0x7FFF;
ma[i] = la[i] + ha[i];
}
for (int i = 0; i < b.length; ++i) {
hb[i] = b[i] >> 15;
lb[i] = b[i] & 0x7FFF;
mb[i] = lb[i] + hb[i];
}
long[] l = convolution(la, lb), h = convolution(ha, hb), m = convolution(ma, mb);
int[] ret = new int[m.length];
for (int i = 0; i < m.length; ++i) {
h[i] = barrett.reduce(h[i]);
m[i] = barrett.reduce(m[i] - l[i] - h[i] + (long) m.length * mod);
ret[i] = barrett.reduce((h[i] << 30) + (m[i] << 15) + l[i]);
}
return ret;
}
return convolution(a, b, mod);
}
/**
* Naive convolution. (Complexity is O(N^2)!!)
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Mod.
* @return Answer.
*/
public static long[] convolutionNaive(final long[] a, final long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
final int k = n + m - 1;
final long[] ret = new long[k];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ret[i + j] += a[i] * b[j] % mod;
ret[i + j] %= mod;
}
}
return ret;
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_g
*/
public static final class SCC {
static class Edge {
int from, to;
public Edge(final int from, final int to) {
this.from = from;
this.to = to;
}
}
final int n;
int m;
final java.util.ArrayList<Edge> unorderedEdges;
final int[] start;
final int[] ids;
boolean hasBuilt = false;
public SCC(final int n) {
this.n = n;
unorderedEdges = new java.util.ArrayList<>();
start = new int[n + 1];
ids = new int[n];
}
public void addEdge(final int from, final int to) {
rangeCheck(from);
rangeCheck(to);
unorderedEdges.add(new Edge(from, to));
start[from + 1]++;
m++;
}
public int id(final int i) {
if (!hasBuilt) { throw new UnsupportedOperationException("Graph hasn't been built."); }
rangeCheck(i);
return ids[i];
}
public int[][] build() {
for (int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
final Edge[] orderedEdges = new Edge[m];
final int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for (final Edge e : unorderedEdges) {
orderedEdges[count[e.from]++] = e;
}
int nowOrd = 0;
int groupNum = 0;
int k = 0;
// parent
final int[] par = new int[n];
final int[] vis = new int[n];
final int[] low = new int[n];
final int[] ord = new int[n];
java.util.Arrays.fill(ord, -1);
// u = lower32(stack[i]) : visiting vertex
// j = upper32(stack[i]) : jth child
final long[] stack = new long[n];
// size of stack
int ptr = 0;
// non-recursional DFS
for (int i = 0; i < n; i++) {
if (ord[i] >= 0) continue;
par[i] = -1;
// vertex i, 0th child.
stack[ptr++] = 0l << 32 | i;
// stack is not empty
while (ptr > 0) {
// last element
final long p = stack[--ptr];
// vertex
final int u = (int) (p & 0xffff_ffffl);
// jth child
int j = (int) (p >>> 32);
if (j == 0) { // first visit
low[u] = ord[u] = nowOrd++;
vis[k++] = u;
}
if (start[u] + j < count[u]) { // there are more children
// jth child
final int to = orderedEdges[start[u] + j].to;
// incr children counter
stack[ptr++] += 1l << 32;
if (ord[to] == -1) { // new vertex
stack[ptr++] = 0l << 32 | to;
par[to] = u;
} else { // backward edge
low[u] = Math.min(low[u], ord[to]);
}
} else { // no more children (leaving)
while (j-- > 0) {
final int to = orderedEdges[start[u] + j].to;
// update lowlink
if (par[to] == u) low[u] = Math.min(low[u], low[to]);
}
if (low[u] == ord[u]) { // root of a component
while (true) { // gathering verticies
final int v = vis[--k];
ord[v] = n;
ids[v] = groupNum;
if (v == u) break;
}
groupNum++; // incr the number of components
}
}
}
}
for (int i = 0; i < n; i++) {
ids[i] = groupNum - 1 - ids[i];
}
final int[] counts = new int[groupNum];
for (final int x : ids) counts[x]++;
final int[][] groups = new int[groupNum][];
for (int i = 0; i < groupNum; i++) {
groups[i] = new int[counts[i]];
}
for (int i = 0; i < n; i++) {
final int cmp = ids[i];
groups[cmp][--counts[cmp]] = i;
}
hasBuilt = true;
return groups;
}
private void rangeCheck(final int i) {
if (i < 0 || i >= n) {
throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", i, n));
}
}
}
/**
* @verified https://atcoder.jp/contests/practice2/submissions/16647102
*/
public static final class TwoSAT {
private final int n;
private final InternalSCC scc;
private final boolean[] answer;
private boolean hasCalledSatisfiable = false;
private boolean existsAnswer = false;
public TwoSAT(int n) {
this.n = n;
scc = new InternalSCC(2 * n);
answer = new boolean[n];
}
public void addClause(int x, boolean f, int y, boolean g) {
rangeCheck(x);
rangeCheck(y);
scc.addEdge(x << 1 | (f ? 0 : 1), y << 1 | (g ? 1 : 0));
scc.addEdge(y << 1 | (g ? 0 : 1), x << 1 | (f ? 1 : 0));
}
public void addImplication(int x, boolean f, int y, boolean g) {
addClause(x, !f, y, g);
}
public void addNand(int x, boolean f, int y, boolean g) {
addClause(x, !f, y, !g);
}
public void set(int x, boolean f) {
addClause(x, f, x, f);
}
public boolean satisfiable() {
hasCalledSatisfiable = true;
int[] ids = scc.ids();
for (int i = 0; i < n; i++) {
if (ids[i << 1 | 0] == ids[i << 1 | 1]) return existsAnswer = false;
answer[i] = ids[i << 1 | 0] < ids[i << 1 | 1];
}
return existsAnswer = true;
}
public boolean[] answer() {
if (!hasCalledSatisfiable) {
throw new UnsupportedOperationException("Call TwoSAT#satisfiable at least once before TwoSAT#answer.");
}
if (existsAnswer) return answer;
return null;
}
private void rangeCheck(int x) {
if (x < 0 || x >= n) {
throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", x, n));
}
}
private static final class EdgeList {
long[] a;
int ptr = 0;
EdgeList(int cap) {
a = new long[cap];
}
void add(int upper, int lower) {
if (ptr == a.length) grow();
a[ptr++] = (long) upper << 32 | lower;
}
void grow() {
long[] b = new long[a.length << 1];
System.arraycopy(a, 0, b, 0, a.length);
a = b;
}
}
private static final class InternalSCC {
final int n;
int m;
final EdgeList unorderedEdges;
final int[] start;
InternalSCC(int n) {
this.n = n;
unorderedEdges = new EdgeList(n);
start = new int[n + 1];
}
void addEdge(int from, int to) {
unorderedEdges.add(from, to);
start[from + 1]++;
m++;
}
static final long mask = 0xffff_ffffl;
int[] ids() {
for (int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
int[] orderedEdges = new int[m];
int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for (int i = 0; i < m; i++) {
long e = unorderedEdges.a[i];
orderedEdges[count[(int) (e >>> 32)]++] = (int) (e & mask);
}
int nowOrd = 0;
int groupNum = 0;
int k = 0;
int[] par = new int[n];
int[] vis = new int[n];
int[] low = new int[n];
int[] ord = new int[n];
java.util.Arrays.fill(ord, -1);
int[] ids = new int[n];
long[] stack = new long[n];
int ptr = 0;
for (int i = 0; i < n; i++) {
if (ord[i] >= 0) continue;
par[i] = -1;
stack[ptr++] = i;
while (ptr > 0) {
long p = stack[--ptr];
int u = (int) (p & mask);
int j = (int) (p >>> 32);
if (j == 0) {
low[u] = ord[u] = nowOrd++;
vis[k++] = u;
}
if (start[u] + j < count[u]) {
int to = orderedEdges[start[u] + j];
stack[ptr++] += 1l << 32;
if (ord[to] == -1) {
stack[ptr++] = to;
par[to] = u;
} else {
low[u] = Math.min(low[u], ord[to]);
}
} else {
while (j-- > 0) {
int to = orderedEdges[start[u] + j];
if (par[to] == u) low[u] = Math.min(low[u], low[to]);
}
if (low[u] == ord[u]) {
while (true) {
int v = vis[--k];
ord[v] = n;
ids[v] = groupNum;
if (v == u) break;
}
groupNum++;
}
}
}
}
for (int i = 0; i < n; i++) {
ids[i] = groupNum - 1 - ids[i];
}
return ids;
}
}
}
public static final class StringAlgorithm {
private static int[] saNaive(final int[] s) {
final int n = s.length;
final Integer[] _sa = new Integer[n];
for (int i = 0; i < n; i++) {
_sa[i] = i;
}
java.util.Arrays.sort(_sa, (l, r) -> {
while (l < n && r < n) {
if (s[l] != s[r]) return s[l] - s[r];
l++;
r++;
}
return -(l - r);
});
final int[] sa = new int[n];
for (int i = 0; i < n; i++) {
sa[i] = _sa[i];
}
return sa;
}
private static int[] saDoubling(final int[] s) {
final int n = s.length;
final Integer[] _sa = new Integer[n];
for (int i = 0; i < n; i++) {
_sa[i] = i;
}
int[] rnk = s;
int[] tmp = new int[n];
for (int k = 1; k < n; k *= 2) {
final int _k = k;
final int[] _rnk = rnk;
final java.util.Comparator<Integer> cmp = (x, y) -> {
if (_rnk[x] != _rnk[y]) return _rnk[x] - _rnk[y];
final int rx = x + _k < n ? _rnk[x + _k] : -1;
final int ry = y + _k < n ? _rnk[y + _k] : -1;
return rx - ry;
};
java.util.Arrays.sort(_sa, cmp);
tmp[_sa[0]] = 0;
for (int i = 1; i < n; i++) {
tmp[_sa[i]] = tmp[_sa[i - 1]] + (cmp.compare(_sa[i - 1], _sa[i]) < 0 ? 1 : 0);
}
final int[] buf = tmp;
tmp = rnk;
rnk = buf;
}
final int[] sa = new int[n];
for (int i = 0; i < n; i++) {
sa[i] = _sa[i];
}
return sa;
}
private static final int THRESHOLD_NAIVE = 10;
private static final int THRESHOLD_DOUBLING = 40;
private static int[] sais(final int[] s, final int upper) {
final int n = s.length;
if (n == 0) return new int[0];
if (n == 1) return new int[] { 0 };
if (n == 2) { return s[0] < s[1] ? new int[] { 0, 1 } : new int[] { 1, 0 }; }
if (n < THRESHOLD_NAIVE) { return saNaive(s); }
if (n < THRESHOLD_DOUBLING) { return saDoubling(s); }
final int[] sa = new int[n];
final boolean[] ls = new boolean[n];
for (int i = n - 2; i >= 0; i--) {
ls[i] = s[i] == s[i + 1] ? ls[i + 1] : s[i] < s[i + 1];
}
final int[] sumL = new int[upper + 1];
final int[] sumS = new int[upper + 1];
for (int i = 0; i < n; i++) {
if (ls[i]) {
sumL[s[i] + 1]++;
} else {
sumS[s[i]]++;
}
}
for (int i = 0; i <= upper; i++) {
sumS[i] += sumL[i];
if (i < upper) sumL[i + 1] += sumS[i];
}
final java.util.function.Consumer<int[]> induce = lms -> {
java.util.Arrays.fill(sa, -1);
final int[] buf = new int[upper + 1];
System.arraycopy(sumS, 0, buf, 0, upper + 1);
for (final int d : lms) {
if (d == n) continue;
sa[buf[s[d]]++] = d;
}
System.arraycopy(sumL, 0, buf, 0, upper + 1);
sa[buf[s[n - 1]]++] = n - 1;
for (int i = 0; i < n; i++) {
final int v = sa[i];
if (v >= 1 && !ls[v - 1]) {
sa[buf[s[v - 1]]++] = v - 1;
}
}
System.arraycopy(sumL, 0, buf, 0, upper + 1);
for (int i = n - 1; i >= 0; i--) {
final int v = sa[i];
if (v >= 1 && ls[v - 1]) {
sa[--buf[s[v - 1] + 1]] = v - 1;
}
}
};
final int[] lmsMap = new int[n + 1];
java.util.Arrays.fill(lmsMap, -1);
int m = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lmsMap[i] = m++;
}
}
final int[] lms = new int[m];
{
int p = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lms[p++] = i;
}
}
}
induce.accept(lms);
if (m > 0) {
final int[] sortedLms = new int[m];
{
int p = 0;
for (final int v : sa) {
if (lmsMap[v] != -1) {
sortedLms[p++] = v;
}
}
}
final int[] recS = new int[m];
int recUpper = 0;
recS[lmsMap[sortedLms[0]]] = 0;
for (int i = 1; i < m; i++) {
int l = sortedLms[i - 1], r = sortedLms[i];
final int endL = lmsMap[l] + 1 < m ? lms[lmsMap[l] + 1] : n;
final int endR = lmsMap[r] + 1 < m ? lms[lmsMap[r] + 1] : n;
boolean same = true;
if (endL - l != endR - r) {
same = false;
} else {
while (l < endL && s[l] == s[r]) {
l++;
r++;
}
if (l == n || s[l] != s[r]) same = false;
}
if (!same) {
recUpper++;
}
recS[lmsMap[sortedLms[i]]] = recUpper;
}
final int[] recSA = sais(recS, recUpper);
for (int i = 0; i < m; i++) {
sortedLms[i] = lms[recSA[i]];
}
induce.accept(sortedLms);
}
return sa;
}
public static int[] suffixArray(final int[] s, final int upper) {
assert 0 <= upper;
for (final int d : s) {
assert 0 <= d && d <= upper;
}
return sais(s, upper);
}
public static int[] suffixArray(final int[] s) {
final int n = s.length;
final Integer[] idx = new Integer[n];
for (int i = 0; i < n; i++) {
idx[i] = i;
}
java.util.Arrays.sort(idx, (l, r) -> s[l] - s[r]);
final int[] s2 = new int[n];
int now = 0;
for (int i = 0; i < n; i++) {
if (i > 0 && s[idx[i - 1]] != s[idx[i]]) {
now++;
}
s2[idx[i]] = now;
}
return sais(s2, now);
}
public static int[] suffixArray(final char[] s) {
final int n = s.length;
final int[] s2 = new int[n];
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return sais(s2, 255);
}
public static int[] suffixArray(final java.lang.String s) {
return suffixArray(s.toCharArray());
}
public static int[] lcpArray(final int[] s, final int[] sa) {
final int n = s.length;
assert n >= 1;
final int[] rnk = new int[n];
for (int i = 0; i < n; i++) {
rnk[sa[i]] = i;
}
final int[] lcp = new int[n - 1];
int h = 0;
for (int i = 0; i < n; i++) {
if (h > 0) h--;
if (rnk[i] == 0) {
continue;
}
final int j = sa[rnk[i] - 1];
for (; j + h < n && i + h < n; h++) {
if (s[j + h] != s[i + h]) break;
}
lcp[rnk[i] - 1] = h;
}
return lcp;
}
public static int[] lcpArray(final char[] s, final int[] sa) {
final int n = s.length;
final int[] s2 = new int[n];
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return lcpArray(s2, sa);
}
public static int[] lcpArray(final java.lang.String s, final int[] sa) {
return lcpArray(s.toCharArray(), sa);
}
public static int[] zAlgorithm(final int[] s) {
final int n = s.length;
if (n == 0) return new int[0];
final int[] z = new int[n];
for (int i = 1, j = 0; i < n; i++) {
int k = j + z[j] <= i ? 0 : Math.min(j + z[j] - i, z[i - j]);
while (i + k < n && s[k] == s[i + k]) k++;
z[i] = k;
if (j + z[j] < i + z[i]) j = i;
}
z[0] = n;
return z;
}
public static int[] zAlgorithm(final char[] s) {
final int n = s.length;
if (n == 0) return new int[0];
final int[] z = new int[n];
for (int i = 1, j = 0; i < n; i++) {
int k = j + z[j] <= i ? 0 : Math.min(j + z[j] - i, z[i - j]);
while (i + k < n && s[k] == s[i + k]) k++;
z[i] = k;
if (j + z[j] < i + z[i]) j = i;
}
z[0] = n;
return z;
}
public static int[] zAlgorithm(final String s) {
return zAlgorithm(s.toCharArray());
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_j
*/
public static final class SegTree<S> {
final int MAX;
final int N;
final java.util.function.BinaryOperator<S> op;
final S E;
final S[] data;
@SuppressWarnings("unchecked")
public SegTree(final int n, final java.util.function.BinaryOperator<S> op, final S e) {
this.MAX = n;
int k = 1;
while (k < n) k <<= 1;
this.N = k;
this.E = e;
this.op = op;
this.data = (S[]) new Object[N << 1];
java.util.Arrays.fill(data, E);
}
public SegTree(final S[] dat, final java.util.function.BinaryOperator<S> op, final S e) {
this(dat.length, op, e);
build(dat);
}
private void build(final S[] dat) {
final int l = dat.length;
System.arraycopy(dat, 0, data, N, l);
for (int i = N - 1; i > 0; i--) {
data[i] = op.apply(data[i << 1 | 0], data[i << 1 | 1]);
}
}
public void set(int p, final S x) {
exclusiveRangeCheck(p);
data[p += N] = x;
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public void set(int p, java.util.function.UnaryOperator<S> f) {
exclusiveRangeCheck(p);
data[p += N] = f.apply(data[p]);
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public S get(final int p) {
exclusiveRangeCheck(p);
return data[p + N];
}
public S prod(int l, int r) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
S sumLeft = E;
S sumRight = E;
l += N;
r += N;
while (l < r) {
if ((l & 1) == 1) sumLeft = op.apply(sumLeft, data[l++]);
if ((r & 1) == 1) sumRight = op.apply(data[--r], sumRight);
l >>= 1;
r >>= 1;
}
return op.apply(sumLeft, sumRight);
}
public S allProd() {
return data[1];
}
public int maxRight(int l, final java.util.function.Predicate<S> f) {
inclusiveRangeCheck(l);
if (!f.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (l == MAX) return MAX;
l += N;
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!f.test(op.apply(sum, data[l]))) {
while (l < N) {
l = l << 1;
if (f.test(op.apply(sum, data[l]))) {
sum = op.apply(sum, data[l]);
l++;
}
}
return l - N;
}
sum = op.apply(sum, data[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, final java.util.function.Predicate<S> f) {
inclusiveRangeCheck(r);
if (!f.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (r == 0) return 0;
r += N;
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!f.test(op.apply(data[r], sum))) {
while (r < N) {
r = r << 1 | 1;
if (f.test(op.apply(data[r], sum))) {
sum = op.apply(data[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = op.apply(data[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(final int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(final int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d].", p, 0, MAX));
}
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0;i < N;++ i) {
if (i != 0) sb.append(", ");
sb.append(data[i + N]);
}
sb.append(']');
return sb.toString();
}
}
/**
*
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_k
*/
public static final class LazySegTree<S, F> {
final int MAX;
final int N;
final int Log;
final java.util.function.BinaryOperator<S> Op;
final S E;
final java.util.function.BiFunction<F, S, S> Mapping;
final java.util.function.BinaryOperator<F> Composition;
final F Id;
final S[] Dat;
final F[] Laz;
@SuppressWarnings("unchecked")
public LazySegTree(final int n, final java.util.function.BinaryOperator<S> op, final S e,
final java.util.function.BiFunction<F, S, S> mapping,
final java.util.function.BinaryOperator<F> composition, final F id) {
this.MAX = n;
int k = 1;
while (k < n) k <<= 1;
this.N = k;
this.Log = Integer.numberOfTrailingZeros(N);
this.Op = op;
this.E = e;
this.Mapping = mapping;
this.Composition = composition;
this.Id = id;
this.Dat = (S[]) new Object[N << 1];
this.Laz = (F[]) new Object[N];
java.util.Arrays.fill(Dat, E);
java.util.Arrays.fill(Laz, Id);
}
public LazySegTree(final S[] dat, final java.util.function.BinaryOperator<S> op, final S e,
final java.util.function.BiFunction<F, S, S> mapping,
final java.util.function.BinaryOperator<F> composition, final F id) {
this(dat.length, op, e, mapping, composition, id);
build(dat);
}
private void build(final S[] dat) {
final int l = dat.length;
System.arraycopy(dat, 0, Dat, N, l);
for (int i = N - 1; i > 0; i--) {
Dat[i] = Op.apply(Dat[i << 1 | 0], Dat[i << 1 | 1]);
}
}
private void push(final int k) {
if (Laz[k] == Id) return;
final int lk = k << 1 | 0, rk = k << 1 | 1;
Dat[lk] = Mapping.apply(Laz[k], Dat[lk]);
Dat[rk] = Mapping.apply(Laz[k], Dat[rk]);
if (lk < N) Laz[lk] = Composition.apply(Laz[k], Laz[lk]);
if (rk < N) Laz[rk] = Composition.apply(Laz[k], Laz[rk]);
Laz[k] = Id;
}
private void pushTo(final int k) {
for (int i = Log; i > 0; i--) push(k >> i);
}
private void pushTo(final int lk, final int rk) {
for (int i = Log; i > 0; i--) {
if (lk >> i << i != lk) push(lk >> i);
if (rk >> i << i != rk) push(rk >> i);
}
}
private void updateFrom(int k) {
k >>= 1;
while (k > 0) {
Dat[k] = Op.apply(Dat[k << 1 | 0], Dat[k << 1 | 1]);
k >>= 1;
}
}
private void updateFrom(final int lk, final int rk) {
for (int i = 1; i <= Log; i++) {
if (lk >> i << i != lk) {
final int lki = lk >> i;
Dat[lki] = Op.apply(Dat[lki << 1 | 0], Dat[lki << 1 | 1]);
}
if (rk >> i << i != rk) {
final int rki = rk - 1 >> i;
Dat[rki] = Op.apply(Dat[rki << 1 | 0], Dat[rki << 1 | 1]);
}
}
}
public void set(int p, final S x) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = x;
updateFrom(p);
}
public S get(int p) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
return Dat[p];
}
public S prod(int l, int r) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return E;
l += N;
r += N;
pushTo(l, r);
S sumLeft = E, sumRight = E;
while (l < r) {
if ((l & 1) == 1) sumLeft = Op.apply(sumLeft, Dat[l++]);
if ((r & 1) == 1) sumRight = Op.apply(Dat[--r], sumRight);
l >>= 1;
r >>= 1;
}
return Op.apply(sumLeft, sumRight);
}
public S allProd() {
return Dat[1];
}
public void apply(int p, final F f) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = Mapping.apply(f, Dat[p]);
updateFrom(p);
}
public void apply(int l, int r, final F f) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return;
l += N;
r += N;
pushTo(l, r);
for (int l2 = l, r2 = r; l2 < r2;) {
if ((l2 & 1) == 1) {
Dat[l2] = Mapping.apply(f, Dat[l2]);
if (l2 < N) Laz[l2] = Composition.apply(f, Laz[l2]);
l2++;
}
if ((r2 & 1) == 1) {
r2--;
Dat[r2] = Mapping.apply(f, Dat[r2]);
if (r2 < N) Laz[r2] = Composition.apply(f, Laz[r2]);
}
l2 >>= 1;
r2 >>= 1;
}
updateFrom(l, r);
}
public int maxRight(int l, final java.util.function.Predicate<S> g) {
inclusiveRangeCheck(l);
if (!g.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (l == MAX) return MAX;
l += N;
pushTo(l);
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!g.test(Op.apply(sum, Dat[l]))) {
while (l < N) {
push(l);
l = l << 1;
if (g.test(Op.apply(sum, Dat[l]))) {
sum = Op.apply(sum, Dat[l]);
l++;
}
}
return l - N;
}
sum = Op.apply(sum, Dat[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, final java.util.function.Predicate<S> g) {
inclusiveRangeCheck(r);
if (!g.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (r == 0) return 0;
r += N;
pushTo(r - 1);
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!g.test(Op.apply(Dat[r], sum))) {
while (r < N) {
push(r);
r = r << 1 | 1;
if (g.test(Op.apply(Dat[r], sum))) {
sum = Op.apply(Dat[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = Op.apply(Dat[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(final int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(String.format("Index %d is not in [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(final int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(String.format("Index %d is not in [%d, %d].", p, 0, MAX));
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(final int newIndent) { this.indent = newIndent; }
@Override
public String toString() {
return toString(1, 0);
}
private String toString(final int k, final int sp) {
if (k >= N) return indent(sp) + Dat[k];
String s = "";
s += toString(k << 1 | 1, sp + indent);
s += "\n";
s += indent(sp) + Dat[k] + "/" + Laz[k];
s += "\n";
s += toString(k << 1 | 0, sp + indent);
return s;
}
private static String indent(int n) {
final StringBuilder sb = new StringBuilder();
while (n-- > 0) sb.append(' ');
return sb.toString();
}
}
public static final class MultiSet<T> extends java.util.TreeMap<T, Long> {
private static final long serialVersionUID = 1L;
public MultiSet() {
super();
}
public MultiSet(final java.util.List<T> list) {
super();
for (final T e : list) this.addOne(e);
}
public long count(final Object elm) {
return getOrDefault(elm, 0L);
}
public void add(final T elm, final long amount) {
if (!containsKey(elm)) put(elm, amount);
else replace(elm, get(elm) + amount);
if (this.count(elm) == 0) this.remove(elm);
}
public void addOne(final T elm) {
this.add(elm, 1);
}
public void removeOne(final T elm) {
this.add(elm, -1);
}
public void removeAll(final T elm) {
this.add(elm, -this.count(elm));
}
public static <T> MultiSet<T> merge(final MultiSet<T> a, final MultiSet<T> b) {
final MultiSet<T> c = new MultiSet<>();
for (final T x : a.keySet()) c.add(x, a.count(x));
for (final T y : b.keySet()) c.add(y, b.count(y));
return c;
}
}
}
/**
* 高速な入出力を提供します。
*
* @author 31536000
*
*/
final class FastIO implements AutoCloseable {
private Input in;
private Output out;
private Output err;
private boolean outFlush = false;
private boolean autoOutFlush = true;
public static final java.io.PrintStream DUMMY_OUT = new DummyOut();
public FastIO() {
this(System.in, System.out, System.err);
}
public FastIO(final java.io.InputStream in, final java.io.PrintStream out, final java.io.PrintStream err) {
this.in = in instanceof Input ? (Input) in : new Input(in);
if (out instanceof Output) {
this.out = (Output) out;
} else {
this.out = new Output(out);
this.out.setAutoFlush(false);
}
if (err instanceof Output) {
this.err = (Output) err;
} else {
this.err = new Output(err);
this.err.setAutoFlush(false);
}
}
public static void setFastStandardOutput(final boolean set) {
final java.io.FileOutputStream fdOut = new java.io.FileOutputStream(java.io.FileDescriptor.out);
final java.io.FileOutputStream fdErr = new java.io.FileOutputStream(java.io.FileDescriptor.err);
if (set) {
System.out.flush();
final Output out = new Output(fdOut);
out.setAutoFlush(false);
System.setOut(out);
System.err.flush();
final Output err = new Output(fdErr);
err.setAutoFlush(false);
System.setErr(err);
} else {
System.out.flush();
final java.io.PrintStream out = new java.io.PrintStream(new java.io.BufferedOutputStream(fdOut, 128), true);
System.setOut(out);
System.err.flush();
final java.io.PrintStream err = new java.io.PrintStream(new java.io.BufferedOutputStream(fdErr, 128), true);
System.setErr(err);
}
}
public void setInputStream(final java.io.InputStream in) {
if (this.in == in) return;
this.in.close();
this.in = in instanceof Input ? (Input) in : new Input(in);
}
public void setInputStream(final java.io.File in) {
try {
this.in.close();
final java.io.InputStream input = new java.io.FileInputStream(in);
this.in = new Input(input);
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public Input getInputStream() { return in; }
public void setOutputStream(final java.io.OutputStream out) {
if (this.out == out) {
this.out.flush();
}
final boolean flush = this.out.autoFlush;
this.out.close();
if (out instanceof Output) {
this.out = (Output) out;
this.out.setAutoFlush(flush);
} else {
this.out = new Output(out);
this.out.setAutoFlush(flush);
}
}
public void setOutputStream(final java.io.File out) {
try {
setOutputStream(new java.io.FileOutputStream(out));
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public void setOutputStream(final java.io.FileDescriptor out) {
setOutputStream(new java.io.FileOutputStream(out));
}
public Output getOutputStream() { return out; }
public void setErrorStream(final java.io.OutputStream err) {
if (this.err == err) {
this.err.flush();
}
final boolean flush = this.err.autoFlush;
this.err.close();
if (err instanceof Output) {
this.err = (Output) err;
this.err.setAutoFlush(flush);
} else {
this.err = new Output(err);
this.err.setAutoFlush(flush);
}
}
public void setErrorStream(final java.io.File err) {
try {
setErrorStream(new java.io.FileOutputStream(err));
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public void setErrorStream(final java.io.FileDescriptor err) {
setErrorStream(new java.io.FileOutputStream(err));
}
public Output getErrorStream() { return err; }
public void setAutoFlush(final boolean flush) {
out.setAutoFlush(flush);
err.setAutoFlush(flush);
}
public void setAutoOutFlush(final boolean flush) { autoOutFlush = flush; }
private void autoFlush() {
if (outFlush) {
outFlush = false;
flush();
}
}
public boolean hasNext() {
autoFlush();
return in.hasNext();
}
public boolean nextBoolean() {
autoFlush();
return in.nextBoolean();
}
public boolean[] nextBoolean(final char T) {
final char[] s = nextChars();
final boolean[] ret = new boolean[s.length];
for (int i = 0; i < ret.length; ++i) ret[i] = s[i] == T;
return ret;
}
public boolean[][] nextBoolean(final char T, final int height) {
final boolean[][] ret = new boolean[height][];
for (int i = 0; i < ret.length; ++i) {
final char[] s = nextChars();
ret[i] = new boolean[s.length];
for (int j = 0; j < ret[i].length; ++j) ret[i][j] = s[j] == T;
}
return ret;
}
public byte nextByte() {
autoFlush();
return in.nextByte();
}
public short nextShort() {
autoFlush();
return in.nextShort();
}
public short[] nextShort(final int width) {
final short[] ret = new short[width];
for (int i = 0; i < width; ++i) ret[i] = nextShort();
return ret;
}
public short[][] nextShort(final int width, final int height) {
final short[][] ret = new short[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[i][j] = nextShort();
return ret;
}
public int nextInt() {
autoFlush();
return in.nextInt();
}
public int[] nextInt(final int width) {
final int[] ret = new int[width];
for (int i = 0; i < width; ++i) ret[i] = nextInt();
return ret;
}
public int[][] nextInt(final int width, final int height) {
final int[][] ret = new int[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[i][j] = nextInt();
return ret;
}
public int[] nextInts() {
return nextInts(" ");
}
public int[] nextInts(final String parse) {
final String[] get = nextLine().split(parse);
final int[] ret = new int[get.length];
for (int i = 0; i < ret.length; ++i) ret[i] = Integer.valueOf(get[i]);
return ret;
}
public long nextLong() {
autoFlush();
return in.nextLong();
}
public long[] nextLong(final int width) {
final long[] ret = new long[width];
for (int i = 0; i < width; ++i) ret[i] = nextLong();
return ret;
}
public long[][] nextLong(final int width, final int height) {
final long[][] ret = new long[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[j][i] = nextLong();
return ret;
}
public long[] nextLongs() {
return nextLongs(" ");
}
public long[] nextLongs(final String parse) {
final String[] get = nextLine().split(parse);
final long[] ret = new long[get.length];
for (int i = 0; i < ret.length; ++i) ret[i] = Long.valueOf(get[i]);
return ret;
}
public float nextFloat() {
autoFlush();
return in.nextFloat();
}
public double nextDouble() {
autoFlush();
return in.nextDouble();
}
public char nextChar() {
autoFlush();
return in.nextChar();
}
public char[] nextChars() {
return next().toCharArray();
}
public char[] nextChars(final char around) {
return (around + next() + around).toCharArray();
}
public char[][] nextChars(final int height) {
final char[][] ret = new char[height][];
for (int i = 0; i < ret.length; ++i) ret[i] = nextChars();
return ret;
}
public char[][] nextChars(final int height, final char around) {
final char[][] ret = new char[height + 2][];
for (int i = 1; i <= height; ++i) ret[i] = nextChars(around);
java.util.Arrays.fill(ret[0] = new char[ret[1].length], around);
java.util.Arrays.fill(ret[ret.length - 1] = new char[ret[0].length], around);
return ret;
}
public String next() {
autoFlush();
return in.next();
}
public String nextLine() {
autoFlush();
return in.nextLine();
}
public Point nextPoint() {
return new Point(nextInt(), nextInt());
}
public Point[] nextPoint(final int width) {
final Point[] ret = new Point[width];
for (int i = 0; i < width; ++i) ret[i] = nextPoint();
return ret;
}
public boolean print(final boolean b) {
out.print(b);
outFlush = autoOutFlush;
return b;
}
public byte print(final byte b) {
out.print(b);
outFlush = autoOutFlush;
return b;
}
public short print(final short s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public int print(final int i) {
out.print(i);
outFlush = autoOutFlush;
return i;
}
public long print(final long l) {
out.print(l);
outFlush = autoOutFlush;
return l;
}
public float print(final float f) {
out.print(f);
outFlush = autoOutFlush;
return f;
}
public double print(final double d) {
out.print(d);
outFlush = autoOutFlush;
return d;
}
public double print(final double d, final int length) {
out.print(d, length);
outFlush = autoOutFlush;
return d;
}
public char print(final char c) {
out.print(c);
outFlush = autoOutFlush;
return c;
}
public char[] print(final char[] s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public String print(final String s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public Object print(final Object obj) {
if (obj != null && obj.getClass().isArray()) {
if (obj instanceof boolean[][]) print(obj, "\n", " ");
else if (obj instanceof byte[][]) print(obj, "\n", " ");
else if (obj instanceof short[][]) print(obj, "\n", " ");
else if (obj instanceof int[][]) print(obj, "\n", " ");
else if (obj instanceof long[][]) print(obj, "\n", " ");
else if (obj instanceof float[][]) print(obj, "\n", " ");
else if (obj instanceof double[][]) print(obj, "\n", " ");
else if (obj instanceof char[][]) print(obj, "\n", " ");
else if (obj instanceof Object[][]) print(obj, "\n", " ");
else print(obj, " ");
} else {
out.print(obj);
outFlush = autoOutFlush;
}
return obj;
}
public Object print(final Object array, final String... parse) {
print(array, 0, parse);
return array;
}
private Object print(final Object array, final int check, final String... parse) {
if (check >= parse.length) {
if (array != null && array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
print(array);
return array;
}
final String str = parse[check];
if (array instanceof Object[]) {
final Object[] obj = (Object[]) array;
if (obj.length == 0) return array;
print(obj[0], check + 1, parse);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i], check + 1, parse);
}
return array;
}
if (array instanceof java.util.Collection) {
final java.util.Iterator<?> iter = ((java.util.Collection<?>) array).iterator();
if (!iter.hasNext()) return array;
print(iter.next(), check + 1, parse);
while (iter.hasNext()) {
print(str);
print(iter.next(), check + 1, parse);
}
return array;
}
if (!array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
if (check != parse.length - 1) throw new IllegalArgumentException("not equal dimension");
if (array instanceof boolean[]) {
final boolean[] obj = (boolean[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof byte[]) {
final byte[] obj = (byte[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
return array;
} else if (array instanceof short[]) {
final short[] obj = (short[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof int[]) {
final int[] obj = (int[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof long[]) {
final long[] obj = (long[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof float[]) {
final float[] obj = (float[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof double[]) {
final double[] obj = (double[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof char[]) {
final char[] obj = (char[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else throw new AssertionError();
return array;
}
public Object[] print(final String parse, final Object... args) {
print(args[0]);
for (int i = 1; i < args.length; ++i) {
print(parse);
print(args[i]);
}
return args;
}
public Object[] printf(final String format, final Object... args) {
out.printf(format, args);
outFlush = autoOutFlush;
return args;
}
public Object[] printf(final java.util.Locale l, final String format, final Object... args) {
out.printf(l, format, args);
outFlush = autoOutFlush;
return args;
}
public void println() {
out.println();
outFlush = autoOutFlush;
}
public boolean println(final boolean b) {
out.println(b);
outFlush = autoOutFlush;
return b;
}
public byte println(final byte b) {
out.println(b);
outFlush = autoOutFlush;
return b;
}
public short println(final short s) {
out.println(s);
outFlush = autoOutFlush;
return s;
}
public int println(final int i) {
out.println(i);
outFlush = autoOutFlush;
return i;
}
public long println(final long l) {
out.println(l);
outFlush = autoOutFlush;
return l;
}
public float println(final float f) {
out.println(f);
outFlush = autoOutFlush;
return f;
}
public double println(final double d) {
out.println(d);
outFlush = autoOutFlush;
return d;
}
public double println(final double d, final int length) {
out.println(d, length);
outFlush = autoOutFlush;
return d;
}
public char println(final char c) {
out.println(c);
outFlush = autoOutFlush;
return c;
}
public char[] println(final char[] s) {
out.println(s);
outFlush = autoOutFlush;
return s;
}
public String println(final String s) {
out.println(s);
return s;
}
public Object println(final Object obj) {
print(obj);
println();
return obj;
}
public Object println(final Object array, final String... parse) {
print(array, parse);
println();
return array;
}
public boolean debug(final boolean b) {
err.print(b);
outFlush = autoOutFlush;
return b;
}
public byte debug(final byte b) {
err.print(b);
outFlush = autoOutFlush;
return b;
}
public short debug(final short s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public int debug(final int i) {
err.print(i);
outFlush = autoOutFlush;
return i;
}
public long debug(final long l) {
err.print(l);
outFlush = autoOutFlush;
return l;
}
public float debug(final float f) {
err.print(f);
outFlush = autoOutFlush;
return f;
}
public double debug(final double d) {
err.print(d);
outFlush = autoOutFlush;
return d;
}
public double debug(final double d, final int length) {
err.print(d, length);
outFlush = autoOutFlush;
return d;
}
public char debug(final char c) {
err.print(c);
outFlush = autoOutFlush;
return c;
}
public char[] debug(final char[] s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public String debug(final String s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public Object debug(final Object obj) {
if (obj != null && obj.getClass().isArray()) {
if (obj instanceof boolean[][]) debug(obj, "\n", " ");
else if (obj instanceof byte[][]) debug(obj, "\n", " ");
else if (obj instanceof short[][]) debug(obj, "\n", " ");
else if (obj instanceof int[][]) debug(obj, "\n", " ");
else if (obj instanceof long[][]) debug(obj, "\n", " ");
else if (obj instanceof float[][]) debug(obj, "\n", " ");
else if (obj instanceof double[][]) debug(obj, "\n", " ");
else if (obj instanceof char[][]) debug(obj, "\n", " ");
else if (obj instanceof Object[][]) debug(obj, "\n", " ");
else debug(obj, " ");
} else {
err.print(obj);
outFlush = autoOutFlush;
}
return obj;
}
public Object debug(final Object array, final String... parse) {
debug(array, 0, parse);
return array;
}
private Object debug(final Object array, final int check, final String... parse) {
if (check >= parse.length) {
if (array != null && array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
debug(array);
return array;
}
final String str = parse[check];
if (array instanceof Object[]) {
final Object[] obj = (Object[]) array;
if (obj.length == 0) return array;
debug(obj[0], check + 1, parse);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i], check + 1, parse);
}
return array;
}
if (array instanceof java.util.Collection) {
final java.util.Iterator<?> iter = ((java.util.Collection<?>) array).iterator();
if (!iter.hasNext()) return array;
debug(iter.next(), check + 1, parse);
while (iter.hasNext()) {
debug(str);
debug(iter.next(), check + 1, parse);
}
return array;
}
if (!array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
if (check != parse.length - 1) throw new IllegalArgumentException("not equal dimension");
if (array instanceof boolean[]) {
final boolean[] obj = (boolean[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof byte[]) {
final byte[] obj = (byte[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
return array;
} else if (array instanceof short[]) {
final short[] obj = (short[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof int[]) {
final int[] obj = (int[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof long[]) {
final long[] obj = (long[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof float[]) {
final float[] obj = (float[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof double[]) {
final double[] obj = (double[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof char[]) {
final char[] obj = (char[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else throw new AssertionError();
return array;
}
public Object[] debug(final String parse, final Object... args) {
debug(args[0]);
for (int i = 1; i < args.length; ++i) {
debug(parse);
debug(args[i]);
}
return args;
}
public Object[] debugf(final String format, final Object... args) {
err.printf(format, args);
outFlush = autoOutFlush;
return args;
}
public Object[] debugf(final java.util.Locale l, final String format, final Object... args) {
err.printf(l, format, args);
outFlush = autoOutFlush;
return args;
}
public void debugln() {
err.println();
outFlush = autoOutFlush;
}
public boolean debugln(final boolean b) {
err.println(b);
outFlush = autoOutFlush;
return b;
}
public byte debugln(final byte b) {
err.println(b);
outFlush = autoOutFlush;
return b;
}
public short debugln(final short s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public int debugln(final int i) {
err.println(i);
outFlush = autoOutFlush;
return i;
}
public long debugln(final long l) {
err.println(l);
outFlush = autoOutFlush;
return l;
}
public float debugln(final float f) {
err.println(f);
outFlush = autoOutFlush;
return f;
}
public double debugln(final double d) {
err.println(d);
outFlush = autoOutFlush;
return d;
}
public double debugln(final double d, final int length) {
err.println(d, length);
outFlush = autoOutFlush;
return d;
}
public char debugln(final char c) {
err.println(c);
outFlush = autoOutFlush;
return c;
}
public char[] debugln(final char[] s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public String debugln(final String s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public Object debugln(final Object obj) {
debug(obj);
debugln();
return obj;
}
public Object debugln(final Object array, final String... parse) {
debug(array, parse);
debugln();
return array;
}
public void flush() {
out.flush();
err.flush();
outFlush = false;
}
@Override
public void close() {
out.close();
err.close();
}
public static final class Input extends java.io.InputStream {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1 << 13];
private int read = 0;
private int length = 0;
public Input(final java.io.InputStream in) {
this.in = in;
}
@Override
public int available() {
try {
return in.available();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
return 0;
}
@Override
public void close() {
try {
in.close();
read = length = 0;
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public int read() {
if (hasNextByte()) return nextByte();
return 0;
}
private boolean hasNextByte() {
if (read < length) return true;
read = 0;
try {
length = in.read(buffer);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
return length > 0;
}
private static boolean isPrintableChar(final byte c) {
return 32 < c || c < 0;
}
private static boolean isNumber(final byte c) {
return '0' <= c && c <= '9';
}
private boolean readNewLine() {
if (hasNextByte()) {
if (buffer[read] == '\r') {
++read;
if (hasNextByte() && buffer[read] == '\n') ++read;
return true;
}
if (buffer[read] == '\n') {
++read;
return true;
}
}
return false;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[read])) read++;
return hasNextByte();
}
private byte nextTokenByte() {
while (hasNextByte() && !isPrintableChar(buffer[read])) read++;
return buffer[read++];
}
public boolean nextBoolean() {
return Boolean.valueOf(next());
}
public byte nextByte() {
if (hasNextByte()) return buffer[read++];
throw new java.util.NoSuchElementException();
}
public short nextShort() {
byte b = nextTokenByte();
short n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = (short) (n * 10 + '0' - b);
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = (short) (n * 10 + b - '0'); while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public int nextInt() {
byte b = nextTokenByte();
int n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = n * 10 + '0' - b;
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = n * 10 + b - '0'; while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public long nextLong() {
byte b = nextTokenByte();
long n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = n * 10 + '0' - b;
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = n * 10 + b - '0'; while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public float nextFloat() {
return Float.parseFloat(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public char nextChar() {
final byte b = nextByte();
if ((b & 0x80) == 0) return (char) b;
if ((b & 0x20) == 0) return (char) ((b & 0x1F) << 6 | nextByte() & 0x3F);
return (char) ((b & 0xF) << 12 | (nextByte() & 0x3F) << 6 | nextByte() & 0x3F);
}
public String next() {
if (!hasNext()) throw new java.util.NoSuchElementException();
final StringBuilder sb = new StringBuilder();
do sb.append(nextChar()); while (hasNextByte() && isPrintableChar(buffer[read]));
return sb.toString();
}
public String nextLine() {
final StringBuilder sb = new StringBuilder();
while (!readNewLine()) sb.append(nextChar());
return sb.toString();
}
}
public static final class Output extends java.io.PrintStream {
private final byte[] buffer = new byte[1 << 13];
private int read = 0;
private boolean autoFlush = true;
public Output(final java.io.OutputStream out) {
super(out);
}
public void setAutoFlush(final boolean autoFlush) { this.autoFlush = autoFlush; }
@Override
public void close() {
if (out == System.out || out == System.err || this == System.out || this == System.err) {
flush();
return;
}
try {
flush();
out.close();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public void flush() {
try {
write();
out.flush();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public void write(final byte[] b) {
if (b.length < buffer.length) {
ensureBuffer(b.length);
System.arraycopy(b, 0, buffer, read, b.length);
read += b.length;
} else {
write();
try {
out.write(b);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
}
@Override
public void write(final byte[] b, final int off, final int len) {
if (len < buffer.length) {
ensureBuffer(len);
System.arraycopy(b, off, buffer, read, len);
read += len;
} else {
write();
try {
out.write(b, off, len);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
}
@Override
public void write(final int b) {
print((byte) b);
}
private void write() {
try {
out.write(buffer, 0, read);
read = 0;
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
private void ensureBuffer(final int size) {
if (read + size > buffer.length) {
write();
}
}
@Override
public void print(final boolean b) {
if (b) {
ensureBuffer(4);
buffer[read++] = 't';
buffer[read++] = 'r';
buffer[read++] = 'u';
buffer[read++] = 'e';
} else {
ensureBuffer(5);
buffer[read++] = 'f';
buffer[read++] = 'a';
buffer[read++] = 'l';
buffer[read++] = 's';
buffer[read++] = 'e';
}
}
public void print(final byte b) {
ensureBuffer(1);
buffer[read++] = b;
}
private static int digit(final short s) {
return s >= 100 ? s >= 1000 ? s >= 10000 ? 5 : 4 : 3 : s >= 10 ? 2 : 1;
}
public void print(short s) {
ensureBuffer(6);
if (s < 0) {
if (s == -32768) {
buffer[read++] = '-';
buffer[read++] = '3';
buffer[read++] = '2';
buffer[read++] = '7';
buffer[read++] = '6';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
s = (short) -s;
}
final int digit = digit(s);
int i = read + digit;
while (i-- > read) {
buffer[i] = (byte) (s % 10 + '0');
s /= 10;
}
read += digit;
}
private static int digit(final int i) {
if (i >= 1000000000) return 10;
if (i >= 100000000) return 9;
if (i >= 10000000) return 8;
if (i >= 1000000) return 7;
if (i >= 100000) return 6;
if (i >= 10000) return 5;
if (i >= 1000) return 4;
if (i >= 100) return 3;
if (i >= 10) return 2;
return 1;
}
@Override
public void print(int i) {
ensureBuffer(11);
if (i < 0) {
if (i == -2147483648) {
buffer[read++] = '-';
buffer[read++] = '2';
buffer[read++] = '1';
buffer[read++] = '4';
buffer[read++] = '7';
buffer[read++] = '4';
buffer[read++] = '8';
buffer[read++] = '3';
buffer[read++] = '6';
buffer[read++] = '4';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
i = -i;
}
final int digit = digit(i);
int j = read + digit;
while (j-- > read) {
buffer[j] = (byte) (i % 10 + '0');
i /= 10;
}
read += digit;
}
private static int digit(final long l) {
if (l >= 1000000000000000000L) return 19;
if (l >= 100000000000000000L) return 18;
if (l >= 10000000000000000L) return 17;
if (l >= 1000000000000000L) return 16;
if (l >= 100000000000000L) return 15;
if (l >= 10000000000000L) return 14;
if (l >= 1000000000000L) return 13;
if (l >= 100000000000L) return 12;
if (l >= 10000000000L) return 11;
if (l >= 1000000000L) return 10;
if (l >= 100000000L) return 9;
if (l >= 10000000L) return 8;
if (l >= 1000000L) return 7;
if (l >= 100000L) return 6;
if (l >= 10000L) return 5;
if (l >= 1000L) return 4;
if (l >= 100L) return 3;
if (l >= 10L) return 2;
return 1;
}
@Override
public void print(long l) {
ensureBuffer(20);
if (l < 0) {
if (l == -9223372036854775808L) {
buffer[read++] = '-';
buffer[read++] = '9';
buffer[read++] = '2';
buffer[read++] = '2';
buffer[read++] = '3';
buffer[read++] = '3';
buffer[read++] = '7';
buffer[read++] = '2';
buffer[read++] = '0';
buffer[read++] = '3';
buffer[read++] = '6';
buffer[read++] = '8';
buffer[read++] = '5';
buffer[read++] = '4';
buffer[read++] = '7';
buffer[read++] = '7';
buffer[read++] = '5';
buffer[read++] = '8';
buffer[read++] = '0';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
l = -l;
}
final int digit = digit(l);
int i = read + digit;
while (i-- > read) {
buffer[i] = (byte) (l % 10 + '0');
l /= 10;
}
read += digit;
}
@Override
public void print(final float f) {
print(Float.toString(f));
}
@Override
public void print(final double d) {
print(Double.toString(d));
}
public void print(double d, final int n) {
if (d < 0) {
ensureBuffer(1);
buffer[read++] = '-';
d = -d;
}
d += Math.pow(10, -n) / 2;
final long l = (long) d;
print(l);
ensureBuffer(n + 1);
buffer[read++] = '.';
d -= l;
for (int i = 0; i < n; i++) {
d *= 10;
final int in = (int) d;
buffer[read++] = (byte) (in + '0');
d -= in;
}
}
@Override
public void print(final char c) {
if (c < 0x80) {
ensureBuffer(1);
buffer[read++] = (byte) c;
} else if (c < 0x07FF) {
ensureBuffer(2);
buffer[read++] = (byte) (c >> 6 & 0x3F | 0x80);
buffer[read++] = (byte) (c & 0x3F | 0x80);
} else {
ensureBuffer(3);
buffer[read++] = (byte) (c >> 12 & 0xF | 0xE0);
buffer[read++] = (byte) (c >> 6 & 0x3F | 0x80);
buffer[read++] = (byte) (c & 0x3F | 0x80);
}
}
@Override
public void print(final char[] s) {
for (final char i : s) print(i);
}
@Override
public void print(final String s) {
print(s.toCharArray());
}
@Override
public void print(final Object o) {
print(o.toString());
}
@Override
public Output printf(final java.util.Locale l, final String format, final Object... args) {
print(String.format(l, format, args));
return this;
}
@Override
public Output printf(final String format, final Object... args) {
print(String.format(format, args));
return this;
}
@Override
public void println() {
ensureBuffer(1);
buffer[read++] = '\n';
if (autoFlush) flush();
}
@Override
public void println(final boolean b) {
print(b);
println();
}
public void println(final byte b) {
print(b);
println();
}
public void println(final short s) {
print(s);
println();
}
@Override
public void println(final int i) {
print(i);
println();
}
@Override
public void println(final long l) {
print(l);
println();
}
@Override
public void println(final float f) {
print(f);
println();
}
@Override
public void println(final double d) {
print(d);
println();
}
public void println(final double d, final int n) {
print(d, n);
println();
}
@Override
public void println(final char c) {
print(c);
println();
}
@Override
public void println(final char[] s) {
print(s);
println();
}
@Override
public void println(final String s) {
print(s);
println();
}
@Override
public void println(final Object o) {
print(o);
println();
}
@Override
public Output append(final char c) {
print(c);
return this;
}
@Override
public Output append(CharSequence csq) {
if (csq == null) csq = "null";
print(csq.toString());
return this;
}
@Override
public Output append(CharSequence csq, final int start, final int end) {
if (csq == null) csq = "null";
print(csq.subSequence(start, end).toString());
return this;
}
}
public static final class DummyOut extends java.io.PrintStream {
public DummyOut() {
super(new Dummy());
}
private static class Dummy extends java.io.OutputStream {
@Override
public void close() {
}
@Override
public void flush() {
}
@Override
public void write(final byte[] b) {
}
@Override
public void write(final byte[] b, final int off, final int len) {
}
@Override
public void write(final int b) {
}
}
}
}
| ConDefects/ConDefects/Code/arc164_e/Java/43435702 |
condefects-java_data_968 | import java.util.*;
public class Main {
public static void main(String[] args) {
IOHandler io = new IOHandler();
char[] s = io.nextStr().toCharArray();
io.close();
if (s[0] == '1') {
io.output("No");
return;
}
boolean[] isKeepStand = new boolean[7];
isKeepStand[0] = s[6] == '1';
isKeepStand[1] = s[3] == '1';
isKeepStand[2] = s[1] == '1' || s[7] == '1';
isKeepStand[3] = s[4] == '1';
isKeepStand[4] = s[2] == '1' || s[8] == '1';
isKeepStand[5] = s[5] == '1';
isKeepStand[6] = s[9] == '1';
// 異なる2列を選ぶ
for (int i = 1; i < 7; i++) {
for (int j = 0; j < i; j++) {
// 2列に立っているピンが存在する場合
if (isKeepStand[i] && isKeepStand[j]) {
// 2列の間で、ピンが立っている列
for (int k = j+1; k < i; k++) {
if (!isKeepStand[k]) {
io.output("Yes");
return;
}
}
}
}
}
io.output("No2");
}
private static class IOHandler {
private Scanner sc = new Scanner(System.in);
private void close() {this.sc.close();}
private String nextStr() {return this.sc.next();}
private <T> void output(T result) {System.out.println(result);}
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
IOHandler io = new IOHandler();
char[] s = io.nextStr().toCharArray();
io.close();
if (s[0] == '1') {
io.output("No");
return;
}
boolean[] isKeepStand = new boolean[7];
isKeepStand[0] = s[6] == '1';
isKeepStand[1] = s[3] == '1';
isKeepStand[2] = s[1] == '1' || s[7] == '1';
isKeepStand[3] = s[4] == '1';
isKeepStand[4] = s[2] == '1' || s[8] == '1';
isKeepStand[5] = s[5] == '1';
isKeepStand[6] = s[9] == '1';
// 異なる2列を選ぶ
for (int i = 1; i < 7; i++) {
for (int j = 0; j < i; j++) {
// 2列に立っているピンが存在する場合
if (isKeepStand[i] && isKeepStand[j]) {
// 2列の間で、ピンが立っている列
for (int k = j+1; k < i; k++) {
if (!isKeepStand[k]) {
io.output("Yes");
return;
}
}
}
}
}
io.output("No");
}
private static class IOHandler {
private Scanner sc = new Scanner(System.in);
private void close() {this.sc.close();}
private String nextStr() {return this.sc.next();}
private <T> void output(T result) {System.out.println(result);}
}
} | ConDefects/ConDefects/Code/abc267_b/Java/38577024 |
condefects-java_data_969 | import java.util.*;
public class Main {
public static boolean check(char[] s) {
if(s[0] == 1) return false;
else {
int[] cols = new int[7];
cols[0] = s[6] - '0';
cols[1] = s[3] - '0';
cols[2] = s[1] - '0' + s[7] - '0';
cols[3] = s[0] - '0' + s[4] - '0';
cols[4] = s[2] - '0' + s[8] - '0';
cols[5] = s[5] - '0';
cols[6] = s[9] - '0';
for(int i = 0; i < 6; i++) {
for(int j = i+1; j < 7; j++) {
if(j-i >= 2 && cols[i] + cols[j] >= 2) {
int cnt = 0;
for(int k = i; k <= j; k++) {
cnt += cols[k];
}
if(cnt == cols[i] + cols[j]) return true;
}
}
}
return false;
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
char[] s = sc.next().toCharArray();
System.out.println(check(s) ? "Yes" : "No");
}
}
import java.util.*;
public class Main {
public static boolean check(char[] s) {
if(s[0] == '1') return false;
else {
int[] cols = new int[7];
cols[0] = s[6] - '0';
cols[1] = s[3] - '0';
cols[2] = s[1] - '0' + s[7] - '0';
cols[3] = s[0] - '0' + s[4] - '0';
cols[4] = s[2] - '0' + s[8] - '0';
cols[5] = s[5] - '0';
cols[6] = s[9] - '0';
for(int i = 0; i < 6; i++) {
for(int j = i+1; j < 7; j++) {
if(j-i >= 2 && cols[i] + cols[j] >= 2) {
int cnt = 0;
for(int k = i; k <= j; k++) {
cnt += cols[k];
}
if(cnt == cols[i] + cols[j]) return true;
}
}
}
return false;
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
char[] s = sc.next().toCharArray();
System.out.println(check(s) ? "Yes" : "No");
}
} | ConDefects/ConDefects/Code/abc267_b/Java/39547621 |
condefects-java_data_970 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
HashMap<String, Integer> mp = new HashMap<>();
String line = br.readLine();
if(line.charAt(0)=='1'){
System.out.println("No");
return;
}
boolean[] a= new boolean[7];
a[0]=(line.charAt(6)=='1');
a[1]=(line.charAt(3)=='1');
a[2]=(line.charAt(1)=='1'||line.charAt(7)=='1');
a[3]=(line.charAt(0)=='1'||line.charAt(4)=='1');
a[4]=(line.charAt(2)=='1'||line.charAt(8)=='1');
a[5]=(line.charAt(5)=='1');
a[6]=(line.charAt(9)=='1');
int val=0;
for(int i=0;i<6;i++)
if((val%2==0&&a[i])||(val%2==1&&!a[i]))val++;
if(val>2){
System.out.println("Yes");
}
else {
System.out.println("No");
}
br.close();
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
HashMap<String, Integer> mp = new HashMap<>();
String line = br.readLine();
if(line.charAt(0)=='1'){
System.out.println("No");
return;
}
boolean[] a= new boolean[7];
a[0]=(line.charAt(6)=='1');
a[1]=(line.charAt(3)=='1');
a[2]=(line.charAt(1)=='1'||line.charAt(7)=='1');
a[3]=(line.charAt(0)=='1'||line.charAt(4)=='1');
a[4]=(line.charAt(2)=='1'||line.charAt(8)=='1');
a[5]=(line.charAt(5)=='1');
a[6]=(line.charAt(9)=='1');
int val=0;
for(int i=0;i<7;i++)
if((val%2==0&&a[i])||(val%2==1&&!a[i]))val++;
if(val>2){
System.out.println("Yes");
}
else {
System.out.println("No");
}
br.close();
}
}
| ConDefects/ConDefects/Code/abc267_b/Java/41907905 |
condefects-java_data_971 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long h = sc.nextLong();
long w = sc.nextLong();
int m = sc.nextInt();
int[] t = new int[m];
int[] a = new int[m];
int[] x = new int[m];
for(int i=0; i<m; ++i) {
t[i] = sc.nextInt();
a[i] = sc.nextInt();
x[i] = sc.nextInt();
}
Set<Integer> cols = new TreeSet<>();
Set<Integer> rows = new TreeSet<>();
Map<Integer, Long> ans = new TreeMap<>();
ans.put(0, h * w);
for(int i=m-1; i>=0; --i) {
if(t[i] == 1) {
if(rows.contains(a[i])) continue;
if(w - cols.size() > 0) {
long add = w - cols.size();
long base = ((ans.containsKey(x[i])) ? ans.get(x[i]) : 0);
ans.put(x[i], base + add);
ans.put(0, ans.get(0) - base - add);
}
rows.add(a[i]);
} else if(t[i] == 2) {
if(cols.contains(a[i])) continue;
if(h - rows.size() > 0) {
long add = h - rows.size();
long base = ((ans.containsKey(x[i])) ? ans.get(x[i]) : 0);
ans.put(x[i], base + add);
ans.put(0, ans.get(0) - add);
}
cols.add(a[i]);
}
}
if(ans.get(0) < 1) {
ans.remove(0);
}
System.out.println(ans.size());
for(var e : ans.entrySet()) {
System.out.println(e.getKey() + " " + e.getValue());
}
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long h = sc.nextLong();
long w = sc.nextLong();
int m = sc.nextInt();
int[] t = new int[m];
int[] a = new int[m];
int[] x = new int[m];
for(int i=0; i<m; ++i) {
t[i] = sc.nextInt();
a[i] = sc.nextInt();
x[i] = sc.nextInt();
}
Set<Integer> cols = new TreeSet<>();
Set<Integer> rows = new TreeSet<>();
Map<Integer, Long> ans = new TreeMap<>();
ans.put(0, h * w);
for(int i=m-1; i>=0; --i) {
if(t[i] == 1) {
if(rows.contains(a[i])) continue;
if(w - cols.size() > 0) {
long add = w - cols.size();
long base = ((ans.containsKey(x[i])) ? ans.get(x[i]) : 0);
ans.put(x[i], base + add);
ans.put(0, ans.get(0) - add);
}
rows.add(a[i]);
} else if(t[i] == 2) {
if(cols.contains(a[i])) continue;
if(h - rows.size() > 0) {
long add = h - rows.size();
long base = ((ans.containsKey(x[i])) ? ans.get(x[i]) : 0);
ans.put(x[i], base + add);
ans.put(0, ans.get(0) - add);
}
cols.add(a[i]);
}
}
if(ans.get(0) < 1) {
ans.remove(0);
}
System.out.println(ans.size());
for(var e : ans.entrySet()) {
System.out.println(e.getKey() + " " + e.getValue());
}
}
}
| ConDefects/ConDefects/Code/abc346_e/Java/51619365 |
condefects-java_data_972 | import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.Map.Entry;
import java.util.StringTokenizer;
import java.util.stream.Collectors;
public class Main {
static Reader in = new Reader();
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) throws IOException {
int h = in.nextInt();
int w = in.nextInt();
boolean[] hs = new boolean[h + 1];
boolean[] ws = new boolean[w + 1];
int m = in.nextInt();
int[] ts = new int[m];
int[] as = new int[m];
int[] xs = new int[m];
int i = 0;
while (m-- > 0) {
int t = in.nextInt();
int a = in.nextInt();
int x = in.nextInt();
ts[i] = t;
as[i] = a;
xs[i] = x;
i++;
}
long[] cnt = new long[200001];
for (int j = ts.length - 1; j >= 0; j--) {
if (ts[j] == 1) {
if (!hs[as[j]]) {
cnt[xs[j]] += (long) w;
h--;
hs[as[j]] = true;
}
} else {
if (!ws[as[j]]) {
cnt[xs[j]] += (long) h;
w--;
ws[as[j]] = true;
}
}
}
cnt[0] += (long) h * w;
Map<Integer, Long> map = new HashMap<>();
for (int j = 0; j <= 200000; j++) {
if (cnt[j] > 0) {
map.put(j, cnt[j]);
}
}
out.println(map.size());
Map<Integer, Long> map2 = map.entrySet().stream()
.sorted(Map.Entry.comparingByValue(Comparator.reverseOrder()))
.collect(Collectors.toMap(
Map.Entry::getKey,
Map.Entry::getValue,
(o, n) -> o,
LinkedHashMap::new));
for (Entry<Integer, Long> e : map2.entrySet()) {
out.println(e.getKey() + " " + e.getValue());
}
out.flush();
}
}
class Reader {
BufferedReader br;
StringTokenizer st;
public Reader() {
br = new BufferedReader(new InputStreamReader(System.in));
st = new StringTokenizer("");
}
public String next() throws IOException {
while (!st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return st.nextToken();
}
public int nextInt() throws IOException {
return Integer.parseInt(next());
}
public BigInteger nextBigInteger() throws IOException {
return new BigInteger(next());
}
public long nextLong() throws IOException {
return Long.parseLong(next());
}
}
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.Map.Entry;
import java.util.StringTokenizer;
import java.util.stream.Collectors;
public class Main {
static Reader in = new Reader();
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) throws IOException {
int h = in.nextInt();
int w = in.nextInt();
boolean[] hs = new boolean[h + 1];
boolean[] ws = new boolean[w + 1];
int m = in.nextInt();
int[] ts = new int[m];
int[] as = new int[m];
int[] xs = new int[m];
int i = 0;
while (m-- > 0) {
int t = in.nextInt();
int a = in.nextInt();
int x = in.nextInt();
ts[i] = t;
as[i] = a;
xs[i] = x;
i++;
}
long[] cnt = new long[200001];
for (int j = ts.length - 1; j >= 0; j--) {
if (ts[j] == 1) {
if (!hs[as[j]]) {
cnt[xs[j]] += (long) w;
h--;
hs[as[j]] = true;
}
} else {
if (!ws[as[j]]) {
cnt[xs[j]] += (long) h;
w--;
ws[as[j]] = true;
}
}
}
cnt[0] += (long) h * w;
Map<Integer, Long> map = new HashMap<>();
for (int j = 0; j <= 200000; j++) {
if (cnt[j] > 0) {
map.put(j, cnt[j]);
}
}
out.println(map.size());
Map<Integer, Long> map2 = map.entrySet().stream()
.sorted(Map.Entry.comparingByKey())
.collect(Collectors.toMap(
Map.Entry::getKey,
Map.Entry::getValue,
(o, n) -> o,
LinkedHashMap::new));
for (Entry<Integer, Long> e : map2.entrySet()) {
out.println(e.getKey() + " " + e.getValue());
}
out.flush();
}
}
class Reader {
BufferedReader br;
StringTokenizer st;
public Reader() {
br = new BufferedReader(new InputStreamReader(System.in));
st = new StringTokenizer("");
}
public String next() throws IOException {
while (!st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return st.nextToken();
}
public int nextInt() throws IOException {
return Integer.parseInt(next());
}
public BigInteger nextBigInteger() throws IOException {
return new BigInteger(next());
}
public long nextLong() throws IOException {
return Long.parseLong(next());
}
}
| ConDefects/ConDefects/Code/abc346_e/Java/51784671 |
condefects-java_data_973 | public class Main{
public static void main(String[] args){
var sc=new java.util.Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
int M=sc.nextInt();
int[] T=new int[M],A=new int[M],X=new int[M];
for(int i=0;i<M;i++){
T[i]=sc.nextInt();
A[i]=sc.nextInt()-1;
X[i]=sc.nextInt();
}
var map=new java.util.HashMap<Integer,Long>();
boolean[] hused=new boolean[H],vused=new boolean[W];
for(int i=M-1;i>=0;i--){
int t=T[i];
int a=A[i];
int x=X[i];
if(t==1){
if(!hused[a]){
hused[a]=true;
map.put(x,map.getOrDefault(x,0l)+W);
H--;
}
}else{
if(!vused[a]){
vused[a]=true;
map.put(x,map.getOrDefault(x,0l)+H);
W--;
}
}
}
map.put(0,map.getOrDefault(0,0l)+W*H);
var colors=new java.util.ArrayList<Integer>();
for(var set:map.entrySet()){
if(set.getValue()>0)colors.add(set.getKey());
}
java.util.Collections.sort(colors);
System.out.println(colors.size());
for(int color:colors)System.out.println(color+" "+map.get(color));
}
}
public class Main{
public static void main(String[] args){
var sc=new java.util.Scanner(System.in);
int H=sc.nextInt();
int W=sc.nextInt();
int M=sc.nextInt();
int[] T=new int[M],A=new int[M],X=new int[M];
for(int i=0;i<M;i++){
T[i]=sc.nextInt();
A[i]=sc.nextInt()-1;
X[i]=sc.nextInt();
}
var map=new java.util.HashMap<Integer,Long>();
boolean[] hused=new boolean[H],vused=new boolean[W];
for(int i=M-1;i>=0;i--){
int t=T[i];
int a=A[i];
int x=X[i];
if(t==1){
if(!hused[a]){
hused[a]=true;
map.put(x,map.getOrDefault(x,0l)+W);
H--;
}
}else{
if(!vused[a]){
vused[a]=true;
map.put(x,map.getOrDefault(x,0l)+H);
W--;
}
}
}
map.put(0,map.getOrDefault(0,0l)+(long)W*H);
var colors=new java.util.ArrayList<Integer>();
for(var set:map.entrySet()){
if(set.getValue()>0)colors.add(set.getKey());
}
java.util.Collections.sort(colors);
System.out.println(colors.size());
for(int color:colors)System.out.println(color+" "+map.get(color));
}
} | ConDefects/ConDefects/Code/abc346_e/Java/51779432 |
condefects-java_data_974 | import java.io.*;
import java.lang.reflect.Array;
import java.nio.charset.StandardCharsets;
import java.util.*;
import java.util.function.IntFunction;
import java.util.function.IntToLongFunction;
import java.util.function.IntUnaryOperator;
import java.util.function.Supplier;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public final class Main {
public static void main(String[] args) throws IOException {
run(System.in, new PrintStream(new BufferedOutputStream(System.out), false, StandardCharsets.UTF_8));
}
@SuppressWarnings({"DuplicatedCode", "SameParameterValue"})
static void run(InputStream in, PrintStream out) throws IOException {
FastScanner scanner = new FastScanner(in);
var n = scanner.nextUint();
var m = scanner.nextUint();
var k = scanner.nextUlong();
out.print(solve(n, m, k));
out.flush();
}
static long solve(int n, int m, long k) {
var lcm = ((long) n * m) / gcd(n, m);
var d = lcm / n + lcm / m - 2;
var p = (k - 1) / d;
k = k % d;
var offset = p * lcm;
var search = -1L;
var l = 1L;
var r = lcm - 1;
do {
var mid = l + (r - l) / 2;
var count = mid / n + mid / m;
if (count >= k) {
search = mid;
r = mid - 1;
} else {
l = mid + 1;
}
} while (l <= r);
return offset + search;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static void printIntsLn(PrintStream out, int... ints) {
printIntsLn(out, ints, " ");
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static void printIntsLn(PrintStream out, int[] ints, String separator) {
for (int i = 0; i < ints.length; i++) {
if (i != 0) {
out.print(separator);
}
out.print(ints[i]);
}
out.println();
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static void printLongsLn(PrintStream out, long... longs) {
printLongsLn(out, longs, " ");
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static void printLongsLn(PrintStream out, long[] longs, String separator) {
for (int i = 0; i < longs.length; i++) {
if (i != 0) {
out.print(separator);
}
out.print(longs[i]);
}
out.println();
}
@SuppressWarnings({"DuplicatedCode", "unused"})
@SafeVarargs
static <T> void printObjectsLn(PrintStream out, T... objects) {
printObjectsLn(out, List.of(objects), " ");
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static void printObjectsLn(PrintStream out, Collection<?> objects) {
printObjectsLn(out, objects, " ");
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static void printObjectsLn(PrintStream out, Collection<?> objects, String separator) {
var first = true;
for (Object object : objects) {
if (!first) {
out.print(separator);
}
out.print(object);
first = false;
}
out.println();
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static int minOf(int... is) {
if (is.length == 0) {
throw new IllegalArgumentException();
}
var res = Integer.MAX_VALUE;
for (int i : is) {
res = Math.min(res, i);
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static int maxOf(int... is) {
if (is.length == 0) {
throw new IllegalArgumentException();
}
var res = Integer.MIN_VALUE;
for (int i : is) {
res = Math.max(res, i);
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static long minOf(long... is) {
if (is.length == 0) {
throw new IllegalArgumentException();
}
var res = Long.MAX_VALUE;
for (long i : is) {
res = Math.min(res, i);
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static long maxOf(long... is) {
if (is.length == 0) {
throw new IllegalArgumentException();
}
var res = Long.MIN_VALUE;
for (long i : is) {
res = Math.max(res, i);
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
record MinMax<T>(T min, T max) {
static MinMax<Integer> from(int... is) {
if (is.length == 0) {
throw new IllegalArgumentException();
}
var min = Integer.MAX_VALUE;
var max = Integer.MIN_VALUE;
for (int x : is) {
min = Math.min(min, x);
max = Math.max(max, x);
}
return new MinMax<>(min, max);
}
static MinMax<Long> from(long... is) {
if (is.length == 0) {
throw new IllegalArgumentException();
}
var min = Long.MAX_VALUE;
var max = Long.MIN_VALUE;
for (long x : is) {
min = Math.min(min, x);
max = Math.max(max, x);
}
return new MinMax<>(min, max);
}
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static <T> ArrayList<T> fillList(int n, Supplier<T> supplier) {
return fillList(n, ignore -> supplier.get());
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static <T> ArrayList<T> fillList(int n, IntFunction<T> valueAt) {
var res = new ArrayList<T>(n);
for (int i = 0; i < n; i++) {
res.add(valueAt.apply(i));
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static <T> T[] fillArray(int n, Class<T> clazz, Supplier<T> supplier) {
return fillArray(n, clazz, ignore -> supplier.get());
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static <T> T[] fillArray(int n, Class<T> clazz, IntFunction<T> valueAt) {
@SuppressWarnings("unchecked") var res = (T[]) Array.newInstance(clazz, n);
for (int i = 0; i < n; i++) {
res[i] = valueAt.apply(i);
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused", "SameParameterValue"})
static <T> T[] fillArray(int n, T value) {
@SuppressWarnings("unchecked") var res = (T[]) Array.newInstance(value.getClass(), n);
Arrays.fill(res, value);
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static int[] fillIntArray(int n, IntUnaryOperator valueAt) {
var res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = valueAt.applyAsInt(i);
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static int[] fillIntArray(int n, int value) {
var res = new int[n];
Arrays.fill(res, value);
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static long[] fillLongArray(int n, IntToLongFunction valueAt) {
var res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = valueAt.applyAsLong(i);
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static long[] fillLongArray(int n, long value) {
var res = new long[n];
Arrays.fill(res, value);
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
record BinaryString(BitSet bits, int length) {
public BinaryString {
if (length < 0) throw new IndexOutOfBoundsException("" + length);
}
@Override
public String toString() {
return IntStream.range(0, length)
.mapToObj(i -> bits.get(i) ? "1" : "0")
.collect(Collectors.joining());
}
}
@SuppressWarnings({"DuplicatedCode", "unused"})
record BinaryGrid(BitSet[] bits, int w) {
BinaryGrid {
if (w < 0) throw new IndexOutOfBoundsException("w=" + w);
}
int h() {
return bits.length;
}
BitSet row(int i) {
return bits[i];
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
BinaryGrid that = (BinaryGrid) o;
if (w != that.w) return false;
return Arrays.equals(bits, that.bits);
}
@Override
public int hashCode() {
int result = Arrays.hashCode(bits);
result = 31 * result + w;
return result;
}
@Override
public String toString() {
return Arrays.stream(bits, 0, h())
.map(row -> IntStream.range(0, w).mapToObj(j -> row.get(j) ? "1" : "0").collect(Collectors.joining()))
.collect(Collectors.joining("\n"));
}
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static final class Adj {
static ArrayList<ArrayList<Integer>> undirected(int n, int[][] edges) {
return undirected(n, edges, 1);
}
static ArrayList<ArrayList<Integer>> directed(int n, int[][] edges) {
return directed(n, edges, 1);
}
@SuppressWarnings("SameParameterValue")
static ArrayList<ArrayList<Integer>> undirected(int n, int[][] edges, int offset) {
var res = fillList(n, () -> new ArrayList<Integer>(1));
for (int[] edge : edges) {
res.get(edge[0] - offset).add(edge[1] - offset);
res.get(edge[1] - offset).add(edge[0] - offset);
}
return res;
}
@SuppressWarnings("SameParameterValue")
static ArrayList<ArrayList<Integer>> directed(int n, int[][] edges, int offset) {
var res = fillList(n, () -> new ArrayList<Integer>(1));
for (int[] edge : edges) {
res.get(edge[0] - offset).add(edge[1] - offset);
}
return res;
}
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static long gcd(long a, long b) {
while (b != 0) {
var bb = a % b;
a = b;
b = bb;
}
return a;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static int gcd(int a, int b) {
while (b != 0) {
var bb = a % b;
a = b;
b = bb;
}
return a;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static final class FastScanner {
private final InputStream in;
private final byte[] buf = new byte[4 * 1024];
private int a = 0;
private int b = 0;
FastScanner(InputStream in) {
this.in = in;
}
byte nextByte() throws IOException {
if (a < b) {
byte v = buf[a];
a += 1;
return v;
} else {
b = in.read(buf);
if (b < 0) {
throw new EOFException();
} else {
a = 0;
return nextByte();
}
}
}
boolean hasNext() throws IOException {
if (a < b) return true;
else if (b < 0) return false;
else {
b = in.read(buf);
a = 0;
return hasNext();
}
}
char nextChar() throws IOException {
return (char) nextByte();
}
char nextNonWhitespaceChar() throws IOException {
while (true) {
var c = nextChar();
if (!Character.isWhitespace(c)) {
return c;
}
}
}
long nextLong() throws IOException {
while (true) {
char c = nextChar();
if (c == '-') {
c = nextChar();
if (isAsciiDigit(c)) {
return Math.negateExact(nextUlongImpl(c));
}
} else if (isAsciiDigit(c)) {
return nextUlongImpl(c);
}
}
}
long[] nextLongs(int n) throws IOException {
long[] res = new long[n];
for (int i = 0; i < n; ++i) {
res[i] = nextLong();
}
return res;
}
long[][] nextLongs(int rows, int cols) throws IOException {
long[][] res = new long[rows][cols];
for (int i = 0; i < rows; ++i) {
for (int j = 0; j < cols; ++j) {
res[i][j] = nextLong();
}
}
return res;
}
long nextUlong() throws IOException {
long res = nextLong();
if (res < 0) throw new IllegalArgumentException("Expected a positive number, but got " + res);
return res;
}
long[] nextUlongs(int n) throws IOException {
long[] res = new long[n];
for (int i = 0; i < n; ++i) {
res[i] = nextUlong();
}
return res;
}
long[][] nextUlongs(int rows, int cols) throws IOException {
long[][] res = new long[rows][cols];
for (int i = 0; i < rows; ++i) {
for (int j = 0; j < cols; ++j) {
res[i][j] = nextUlong();
}
}
return res;
}
int nextInt() throws IOException {
return Math.toIntExact(nextLong());
}
int[] nextInts(int n) throws IOException {
int[] res = new int[n];
for (int i = 0; i < n; ++i) {
res[i] = nextInt();
}
return res;
}
int[][] nextInts(int rows, int cols) throws IOException {
int[][] res = new int[rows][cols];
for (int i = 0; i < rows; ++i) {
for (int j = 0; j < cols; ++j) {
res[i][j] = nextInt();
}
}
return res;
}
int nextUint() throws IOException {
return Math.toIntExact(nextUlong());
}
int[] nextUints(int n) throws IOException {
int[] res = new int[n];
for (int i = 0; i < n; ++i) {
res[i] = nextUint();
}
return res;
}
int[][] nextUints(int rows, int cols) throws IOException {
int[][] res = new int[rows][cols];
for (int i = 0; i < rows; ++i) {
for (int j = 0; j < cols; ++j) {
res[i][j] = nextUint();
}
}
return res;
}
<T> T[] nextObjects(int n, Class<T> clazz, IOExceptionThrowingSupplier<T> supplier) throws IOException {
@SuppressWarnings("unchecked") T[] ret = (T[]) Array.newInstance(clazz, n);
for (int i = 0; i < n; i++) {
ret[i] = supplier.get();
}
return ret;
}
String nextLine() throws IOException {
StringBuilder sb = new StringBuilder();
char c = nextChar();
while (c != '\n') {
sb.append(c);
if (!hasNext()) {
break;
} else {
c = nextChar();
}
}
if (!sb.isEmpty() && c == '\n' && sb.charAt(sb.length() - 1) == '\r') {
sb.setLength(sb.length() - 1);
}
return sb.toString();
}
String[] nextLines(int n) throws IOException {
if (n < 0) {
n = nextUint();
skipToNextLine();
}
return nextObjects(n, String.class, this::nextLine);
}
String[] nextLines() throws IOException {
return nextLines(-1);
}
void skipToNextLine() throws IOException {
//noinspection StatementWithEmptyBody
while (nextChar() != '\n') {
// just skip to next character
}
}
BinaryString nextBinaryString() throws IOException {
return nextBinaryString('1');
}
BinaryString nextBinaryString(char cTrue) throws IOException {
return nextBinaryStringImpl(cTrue, -1);
}
BinaryString nextBinaryString(char cTrue, int length) throws IOException {
if (length < 0) throw new IndexOutOfBoundsException("" + length);
return nextBinaryStringImpl(cTrue, length);
}
BinaryGrid nextBinaryGrid(char cTrue) throws IOException {
return nextBinaryGridImpl(cTrue, -1, -1);
}
BinaryGrid nextBinaryGrid(char cTrue, int h, int w) throws IOException {
return nextBinaryGridImpl(cTrue, h, w);
}
private BinaryGrid nextBinaryGridImpl(char cTrue, int h, int w) throws IOException {
if (h < 0) {
h = nextUint();
w = nextUint();
if (h > 0) {
skipToNextLine();
}
}
var bits = new BitSet[h];
for (int i = 0; i < h; i++) {
var row = new BitSet(w);
for (int j = 0; j < w; j++) {
if (nextChar() == cTrue) {
row.set(j);
}
}
bits[i] = row;
if (i != h - 1 || hasNext()) {
skipToNextLine();
}
}
return new BinaryGrid(bits, w);
}
private BinaryString nextBinaryStringImpl(char cTrue, int length) throws IOException {
if (length < 0) {
length = nextUint();
skipToNextLine();
}
BitSet bits = new BitSet(length);
for (int i = 0; i < length; ++i) {
if (nextChar() == cTrue) {
bits.set(i);
}
}
return new BinaryString(bits, length);
}
private long nextUlongImpl(char firstDigit) throws IOException {
long res = 0;
char c = firstDigit;
do {
long res2 = 10 * res + (c - '0');
if (res2 >= res) {
res = res2;
} else {
throw new ArithmeticException("Long overflow");
}
if (hasNext()) {
c = nextChar();
} else {
c = 0;
}
} while (isAsciiDigit(c));
if (c != 0 && !isAsciiDigit(c)) {
a -= 1;
}
return res;
}
private static boolean isAsciiDigit(char c) {
return '0' <= c && c <= '9';
}
}
interface IOExceptionThrowingSupplier<T> {
T get() throws IOException;
}
}
import java.io.*;
import java.lang.reflect.Array;
import java.nio.charset.StandardCharsets;
import java.util.*;
import java.util.function.IntFunction;
import java.util.function.IntToLongFunction;
import java.util.function.IntUnaryOperator;
import java.util.function.Supplier;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public final class Main {
public static void main(String[] args) throws IOException {
run(System.in, new PrintStream(new BufferedOutputStream(System.out), false, StandardCharsets.UTF_8));
}
@SuppressWarnings({"DuplicatedCode", "SameParameterValue"})
static void run(InputStream in, PrintStream out) throws IOException {
FastScanner scanner = new FastScanner(in);
var n = scanner.nextUint();
var m = scanner.nextUint();
var k = scanner.nextUlong();
out.print(solve(n, m, k));
out.flush();
}
static long solve(int n, int m, long k) {
var lcm = ((long) n * m) / gcd(n, m);
var d = lcm / n + lcm / m - 2;
var p = (k - 1) / d;
k = (k - 1) % d + 1;
var offset = p * lcm;
var search = -1L;
var l = 1L;
var r = lcm - 1;
do {
var mid = l + (r - l) / 2;
var count = mid / n + mid / m;
if (count >= k) {
search = mid;
r = mid - 1;
} else {
l = mid + 1;
}
} while (l <= r);
return offset + search;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static void printIntsLn(PrintStream out, int... ints) {
printIntsLn(out, ints, " ");
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static void printIntsLn(PrintStream out, int[] ints, String separator) {
for (int i = 0; i < ints.length; i++) {
if (i != 0) {
out.print(separator);
}
out.print(ints[i]);
}
out.println();
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static void printLongsLn(PrintStream out, long... longs) {
printLongsLn(out, longs, " ");
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static void printLongsLn(PrintStream out, long[] longs, String separator) {
for (int i = 0; i < longs.length; i++) {
if (i != 0) {
out.print(separator);
}
out.print(longs[i]);
}
out.println();
}
@SuppressWarnings({"DuplicatedCode", "unused"})
@SafeVarargs
static <T> void printObjectsLn(PrintStream out, T... objects) {
printObjectsLn(out, List.of(objects), " ");
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static void printObjectsLn(PrintStream out, Collection<?> objects) {
printObjectsLn(out, objects, " ");
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static void printObjectsLn(PrintStream out, Collection<?> objects, String separator) {
var first = true;
for (Object object : objects) {
if (!first) {
out.print(separator);
}
out.print(object);
first = false;
}
out.println();
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static int minOf(int... is) {
if (is.length == 0) {
throw new IllegalArgumentException();
}
var res = Integer.MAX_VALUE;
for (int i : is) {
res = Math.min(res, i);
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static int maxOf(int... is) {
if (is.length == 0) {
throw new IllegalArgumentException();
}
var res = Integer.MIN_VALUE;
for (int i : is) {
res = Math.max(res, i);
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static long minOf(long... is) {
if (is.length == 0) {
throw new IllegalArgumentException();
}
var res = Long.MAX_VALUE;
for (long i : is) {
res = Math.min(res, i);
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static long maxOf(long... is) {
if (is.length == 0) {
throw new IllegalArgumentException();
}
var res = Long.MIN_VALUE;
for (long i : is) {
res = Math.max(res, i);
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
record MinMax<T>(T min, T max) {
static MinMax<Integer> from(int... is) {
if (is.length == 0) {
throw new IllegalArgumentException();
}
var min = Integer.MAX_VALUE;
var max = Integer.MIN_VALUE;
for (int x : is) {
min = Math.min(min, x);
max = Math.max(max, x);
}
return new MinMax<>(min, max);
}
static MinMax<Long> from(long... is) {
if (is.length == 0) {
throw new IllegalArgumentException();
}
var min = Long.MAX_VALUE;
var max = Long.MIN_VALUE;
for (long x : is) {
min = Math.min(min, x);
max = Math.max(max, x);
}
return new MinMax<>(min, max);
}
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static <T> ArrayList<T> fillList(int n, Supplier<T> supplier) {
return fillList(n, ignore -> supplier.get());
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static <T> ArrayList<T> fillList(int n, IntFunction<T> valueAt) {
var res = new ArrayList<T>(n);
for (int i = 0; i < n; i++) {
res.add(valueAt.apply(i));
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static <T> T[] fillArray(int n, Class<T> clazz, Supplier<T> supplier) {
return fillArray(n, clazz, ignore -> supplier.get());
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static <T> T[] fillArray(int n, Class<T> clazz, IntFunction<T> valueAt) {
@SuppressWarnings("unchecked") var res = (T[]) Array.newInstance(clazz, n);
for (int i = 0; i < n; i++) {
res[i] = valueAt.apply(i);
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused", "SameParameterValue"})
static <T> T[] fillArray(int n, T value) {
@SuppressWarnings("unchecked") var res = (T[]) Array.newInstance(value.getClass(), n);
Arrays.fill(res, value);
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static int[] fillIntArray(int n, IntUnaryOperator valueAt) {
var res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = valueAt.applyAsInt(i);
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static int[] fillIntArray(int n, int value) {
var res = new int[n];
Arrays.fill(res, value);
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static long[] fillLongArray(int n, IntToLongFunction valueAt) {
var res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = valueAt.applyAsLong(i);
}
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static long[] fillLongArray(int n, long value) {
var res = new long[n];
Arrays.fill(res, value);
return res;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
record BinaryString(BitSet bits, int length) {
public BinaryString {
if (length < 0) throw new IndexOutOfBoundsException("" + length);
}
@Override
public String toString() {
return IntStream.range(0, length)
.mapToObj(i -> bits.get(i) ? "1" : "0")
.collect(Collectors.joining());
}
}
@SuppressWarnings({"DuplicatedCode", "unused"})
record BinaryGrid(BitSet[] bits, int w) {
BinaryGrid {
if (w < 0) throw new IndexOutOfBoundsException("w=" + w);
}
int h() {
return bits.length;
}
BitSet row(int i) {
return bits[i];
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
BinaryGrid that = (BinaryGrid) o;
if (w != that.w) return false;
return Arrays.equals(bits, that.bits);
}
@Override
public int hashCode() {
int result = Arrays.hashCode(bits);
result = 31 * result + w;
return result;
}
@Override
public String toString() {
return Arrays.stream(bits, 0, h())
.map(row -> IntStream.range(0, w).mapToObj(j -> row.get(j) ? "1" : "0").collect(Collectors.joining()))
.collect(Collectors.joining("\n"));
}
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static final class Adj {
static ArrayList<ArrayList<Integer>> undirected(int n, int[][] edges) {
return undirected(n, edges, 1);
}
static ArrayList<ArrayList<Integer>> directed(int n, int[][] edges) {
return directed(n, edges, 1);
}
@SuppressWarnings("SameParameterValue")
static ArrayList<ArrayList<Integer>> undirected(int n, int[][] edges, int offset) {
var res = fillList(n, () -> new ArrayList<Integer>(1));
for (int[] edge : edges) {
res.get(edge[0] - offset).add(edge[1] - offset);
res.get(edge[1] - offset).add(edge[0] - offset);
}
return res;
}
@SuppressWarnings("SameParameterValue")
static ArrayList<ArrayList<Integer>> directed(int n, int[][] edges, int offset) {
var res = fillList(n, () -> new ArrayList<Integer>(1));
for (int[] edge : edges) {
res.get(edge[0] - offset).add(edge[1] - offset);
}
return res;
}
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static long gcd(long a, long b) {
while (b != 0) {
var bb = a % b;
a = b;
b = bb;
}
return a;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static int gcd(int a, int b) {
while (b != 0) {
var bb = a % b;
a = b;
b = bb;
}
return a;
}
@SuppressWarnings({"DuplicatedCode", "unused"})
static final class FastScanner {
private final InputStream in;
private final byte[] buf = new byte[4 * 1024];
private int a = 0;
private int b = 0;
FastScanner(InputStream in) {
this.in = in;
}
byte nextByte() throws IOException {
if (a < b) {
byte v = buf[a];
a += 1;
return v;
} else {
b = in.read(buf);
if (b < 0) {
throw new EOFException();
} else {
a = 0;
return nextByte();
}
}
}
boolean hasNext() throws IOException {
if (a < b) return true;
else if (b < 0) return false;
else {
b = in.read(buf);
a = 0;
return hasNext();
}
}
char nextChar() throws IOException {
return (char) nextByte();
}
char nextNonWhitespaceChar() throws IOException {
while (true) {
var c = nextChar();
if (!Character.isWhitespace(c)) {
return c;
}
}
}
long nextLong() throws IOException {
while (true) {
char c = nextChar();
if (c == '-') {
c = nextChar();
if (isAsciiDigit(c)) {
return Math.negateExact(nextUlongImpl(c));
}
} else if (isAsciiDigit(c)) {
return nextUlongImpl(c);
}
}
}
long[] nextLongs(int n) throws IOException {
long[] res = new long[n];
for (int i = 0; i < n; ++i) {
res[i] = nextLong();
}
return res;
}
long[][] nextLongs(int rows, int cols) throws IOException {
long[][] res = new long[rows][cols];
for (int i = 0; i < rows; ++i) {
for (int j = 0; j < cols; ++j) {
res[i][j] = nextLong();
}
}
return res;
}
long nextUlong() throws IOException {
long res = nextLong();
if (res < 0) throw new IllegalArgumentException("Expected a positive number, but got " + res);
return res;
}
long[] nextUlongs(int n) throws IOException {
long[] res = new long[n];
for (int i = 0; i < n; ++i) {
res[i] = nextUlong();
}
return res;
}
long[][] nextUlongs(int rows, int cols) throws IOException {
long[][] res = new long[rows][cols];
for (int i = 0; i < rows; ++i) {
for (int j = 0; j < cols; ++j) {
res[i][j] = nextUlong();
}
}
return res;
}
int nextInt() throws IOException {
return Math.toIntExact(nextLong());
}
int[] nextInts(int n) throws IOException {
int[] res = new int[n];
for (int i = 0; i < n; ++i) {
res[i] = nextInt();
}
return res;
}
int[][] nextInts(int rows, int cols) throws IOException {
int[][] res = new int[rows][cols];
for (int i = 0; i < rows; ++i) {
for (int j = 0; j < cols; ++j) {
res[i][j] = nextInt();
}
}
return res;
}
int nextUint() throws IOException {
return Math.toIntExact(nextUlong());
}
int[] nextUints(int n) throws IOException {
int[] res = new int[n];
for (int i = 0; i < n; ++i) {
res[i] = nextUint();
}
return res;
}
int[][] nextUints(int rows, int cols) throws IOException {
int[][] res = new int[rows][cols];
for (int i = 0; i < rows; ++i) {
for (int j = 0; j < cols; ++j) {
res[i][j] = nextUint();
}
}
return res;
}
<T> T[] nextObjects(int n, Class<T> clazz, IOExceptionThrowingSupplier<T> supplier) throws IOException {
@SuppressWarnings("unchecked") T[] ret = (T[]) Array.newInstance(clazz, n);
for (int i = 0; i < n; i++) {
ret[i] = supplier.get();
}
return ret;
}
String nextLine() throws IOException {
StringBuilder sb = new StringBuilder();
char c = nextChar();
while (c != '\n') {
sb.append(c);
if (!hasNext()) {
break;
} else {
c = nextChar();
}
}
if (!sb.isEmpty() && c == '\n' && sb.charAt(sb.length() - 1) == '\r') {
sb.setLength(sb.length() - 1);
}
return sb.toString();
}
String[] nextLines(int n) throws IOException {
if (n < 0) {
n = nextUint();
skipToNextLine();
}
return nextObjects(n, String.class, this::nextLine);
}
String[] nextLines() throws IOException {
return nextLines(-1);
}
void skipToNextLine() throws IOException {
//noinspection StatementWithEmptyBody
while (nextChar() != '\n') {
// just skip to next character
}
}
BinaryString nextBinaryString() throws IOException {
return nextBinaryString('1');
}
BinaryString nextBinaryString(char cTrue) throws IOException {
return nextBinaryStringImpl(cTrue, -1);
}
BinaryString nextBinaryString(char cTrue, int length) throws IOException {
if (length < 0) throw new IndexOutOfBoundsException("" + length);
return nextBinaryStringImpl(cTrue, length);
}
BinaryGrid nextBinaryGrid(char cTrue) throws IOException {
return nextBinaryGridImpl(cTrue, -1, -1);
}
BinaryGrid nextBinaryGrid(char cTrue, int h, int w) throws IOException {
return nextBinaryGridImpl(cTrue, h, w);
}
private BinaryGrid nextBinaryGridImpl(char cTrue, int h, int w) throws IOException {
if (h < 0) {
h = nextUint();
w = nextUint();
if (h > 0) {
skipToNextLine();
}
}
var bits = new BitSet[h];
for (int i = 0; i < h; i++) {
var row = new BitSet(w);
for (int j = 0; j < w; j++) {
if (nextChar() == cTrue) {
row.set(j);
}
}
bits[i] = row;
if (i != h - 1 || hasNext()) {
skipToNextLine();
}
}
return new BinaryGrid(bits, w);
}
private BinaryString nextBinaryStringImpl(char cTrue, int length) throws IOException {
if (length < 0) {
length = nextUint();
skipToNextLine();
}
BitSet bits = new BitSet(length);
for (int i = 0; i < length; ++i) {
if (nextChar() == cTrue) {
bits.set(i);
}
}
return new BinaryString(bits, length);
}
private long nextUlongImpl(char firstDigit) throws IOException {
long res = 0;
char c = firstDigit;
do {
long res2 = 10 * res + (c - '0');
if (res2 >= res) {
res = res2;
} else {
throw new ArithmeticException("Long overflow");
}
if (hasNext()) {
c = nextChar();
} else {
c = 0;
}
} while (isAsciiDigit(c));
if (c != 0 && !isAsciiDigit(c)) {
a -= 1;
}
return res;
}
private static boolean isAsciiDigit(char c) {
return '0' <= c && c <= '9';
}
}
interface IOExceptionThrowingSupplier<T> {
T get() throws IOException;
}
} | ConDefects/ConDefects/Code/abc341_d/Java/53046467 |
condefects-java_data_975 | import java.sql.PreparedStatement;
import java.util.*;
import java.io.*;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
static Scanner sc = new Scanner(System.in);
static void cl() throws Exception{
br.close();
sc.close();
pw.close();
}
static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a % b);
}
public static void main(String[] args) throws Exception{
long x = sc.nextLong();
long y = sc.nextLong();
long k = sc.nextLong();
long c = x / gcd(x, y) * y;
long l = 1, r = (long) 1e10;
while(l < r){
long mid = (l + r) / 2;
if(k <= mid / x + mid / y - 2 * (mid / c)){
r = mid;
}else{
l = mid + 1;
}
}
pw.print(l);
pw.flush();
cl();
}
}
import java.sql.PreparedStatement;
import java.util.*;
import java.io.*;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
static Scanner sc = new Scanner(System.in);
static void cl() throws Exception{
br.close();
sc.close();
pw.close();
}
static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a % b);
}
public static void main(String[] args) throws Exception{
long x = sc.nextLong();
long y = sc.nextLong();
long k = sc.nextLong();
long c = x / gcd(x, y) * y;
long l = 0, r = (long) 2e18;
while(l < r){
long mid = (l + r) / 2;
if(k <= mid / x + mid / y - 2 * (mid / c)){
r = mid;
}else{
l = mid + 1;
}
}
pw.print(l);
pw.flush();
cl();
}
} | ConDefects/ConDefects/Code/abc341_d/Java/51959302 |
condefects-java_data_976 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
class Main {
public static void main(String[] args) {
PrintWriter out = new PrintWriter(System.out);
FastScanner sc = new FastScanner();
long N = sc.nextLong();
long M = sc.nextLong();
long K = sc.nextLong();
long LCM = (N*M) / gcd(N,M);
long ng = 0;//Kに満たない
long ok = 900000000000000000L;//K以上
while (Math.abs(ng - ok) > 1){
long mid = (ok+ng)/2;
if (mid/N + mid/M - 2*(mid/LCM) < K){
ng = mid;
}else {
ok = mid;
}
}
System.out.println(ok);
out.flush();
}
public static long gcd(long a,long b){
long max = Math.max(a,b);
long min = Math.min(a,b);
long remainder = max%min;
if (remainder == 0){
return min;
}else return gcd(min,remainder);
}
private static class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
return buflen > 0;
}
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++];
else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return !hasNextByte();
}
public String next() {
if (hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
}
}
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
class Main {
public static void main(String[] args) {
PrintWriter out = new PrintWriter(System.out);
FastScanner sc = new FastScanner();
long N = sc.nextLong();
long M = sc.nextLong();
long K = sc.nextLong();
long LCM = (N*M) / gcd(N,M);
long ng = 0;//Kに満たない
long ok = 8000000000000000000L;//K以上
while (Math.abs(ng - ok) > 1){
long mid = (ok+ng)/2;
if (mid/N + mid/M - 2*(mid/LCM) < K){
ng = mid;
}else {
ok = mid;
}
}
System.out.println(ok);
out.flush();
}
public static long gcd(long a,long b){
long max = Math.max(a,b);
long min = Math.min(a,b);
long remainder = max%min;
if (remainder == 0){
return min;
}else return gcd(min,remainder);
}
private static class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
return buflen > 0;
}
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++];
else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return !hasNextByte();
}
public String next() {
if (hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
}
} | ConDefects/ConDefects/Code/abc341_d/Java/50412268 |
condefects-java_data_977 | import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static void solve(PrintWriter o) {
try {
int n = nextInt(), m = nextInt();
long k = nextLong();
long l = 1, r = (long)1e18;
while(l < r) {
long mid = (l+r)>>1;
if(!check(n, m, mid, k)) l = mid+1;
else r = mid;
}
o.println(r);
} catch (Exception e) {
e.printStackTrace();
}
}
static boolean check(int x, int y, long num, long k) {
long t1 = num/x;
long t2 = num/y;
long t3 = num/(1l*x*y);
return t1+t2-t3*2>=k;
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a%b);
}
public static long[] extgcd(long a, long b) {
if(b == 0) return new long[]{1, 0};
long[] it = extgcd(b, a%b);
long x = it[1], y = it[0];
y -= a/b*x;
return new long[]{x, y};
}
public static long lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static long qpow(long a, long n, int md){
a %= md;
long ret = 1l;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % md;
}
n >>= 1;
a = a * a % md;
}
return ret;
}
public static class FenWick {
int n;
long[] a;
long[] tree;
public FenWick(int n){
this.n = n;
a = new long[n+1];
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private void addMx(int x, long val) {
a[x] += val;
tree[x] = a[x];
while(x <= n) {
for(int i=1;i<(x&-x);i<<=1) {
tree[x] = Math.max(tree[x], tree[x-i]);
}
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
private long queryMx(int l, int r) {
long res = 0l;
while(l <= r) {
if(r-(r&-r) >= l) {
res = Math.max(res, tree[r]);
r -= r&-r;
}
else {
res = Math.max(res, a[r]);
r--;
}
}
return res;
}
}
public static class Pair{
Integer u;
Integer v;
public Pair(Integer u, Integer v) {
this.u = u;
this.v = v;
}
@Override
public int hashCode() {
int prime = 31, ret = 1;
ret = ret*prime + u.hashCode();
ret = ret*prime + v.hashCode();
return ret;
}
@Override
public boolean equals(Object obj) {
if(obj instanceof Pair) {
return u.equals(((Pair) obj).u) && v.equals(((Pair) obj).v);
}
return false;
}
}
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
}
import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static void solve(PrintWriter o) {
try {
int n = nextInt(), m = nextInt();
long k = nextLong();
long l = 1, r = (long)1e18;
while(l < r) {
long mid = (l+r)>>1;
if(!check(n, m, mid, k)) l = mid+1;
else r = mid;
}
o.println(r);
} catch (Exception e) {
e.printStackTrace();
}
}
static boolean check(int x, int y, long num, long k) {
long t1 = num/x;
long t2 = num/y;
long t3 = num/lcm(x,y);
return t1+t2-t3*2>=k;
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a%b);
}
public static long[] extgcd(long a, long b) {
if(b == 0) return new long[]{1, 0};
long[] it = extgcd(b, a%b);
long x = it[1], y = it[0];
y -= a/b*x;
return new long[]{x, y};
}
public static long lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static long qpow(long a, long n, int md){
a %= md;
long ret = 1l;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % md;
}
n >>= 1;
a = a * a % md;
}
return ret;
}
public static class FenWick {
int n;
long[] a;
long[] tree;
public FenWick(int n){
this.n = n;
a = new long[n+1];
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private void addMx(int x, long val) {
a[x] += val;
tree[x] = a[x];
while(x <= n) {
for(int i=1;i<(x&-x);i<<=1) {
tree[x] = Math.max(tree[x], tree[x-i]);
}
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
private long queryMx(int l, int r) {
long res = 0l;
while(l <= r) {
if(r-(r&-r) >= l) {
res = Math.max(res, tree[r]);
r -= r&-r;
}
else {
res = Math.max(res, a[r]);
r--;
}
}
return res;
}
}
public static class Pair{
Integer u;
Integer v;
public Pair(Integer u, Integer v) {
this.u = u;
this.v = v;
}
@Override
public int hashCode() {
int prime = 31, ret = 1;
ret = ret*prime + u.hashCode();
ret = ret*prime + v.hashCode();
return ret;
}
@Override
public boolean equals(Object obj) {
if(obj instanceof Pair) {
return u.equals(((Pair) obj).u) && v.equals(((Pair) obj).v);
}
return false;
}
}
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
} | ConDefects/ConDefects/Code/abc341_d/Java/50444206 |
condefects-java_data_978 | import java.io.*;
import java.util.*;
class Main {
int N, M;
int[][] AB;
int[] V;
int b;
Set<Integer> f1 = new HashSet<>();
Set<Pair> f2 = new HashSet<>();
@SuppressWarnings("unchecked")
void calc() {
int[] ns = nextInts();
N = ns[0]; M = ns[1];
AB = new int[N][2];
for (int i = 0; i < N; i++) AB[i] = nextInts();
for (int i = 0; i < M; i++) {
int[] xy = nextInts();
if (xy[0] == xy[1]) f1.add(xy[0]-1);
else f2.add(new Pair(xy[0]-1, xy[1]-1));
}
for (int f: f1) {
int[] ab = AB[f];
if (ab[0] < ab[1]) {
int t = ab[0]; ab[0] = ab[1]; ab[1] = t;
}
}
V = new int[N];
for (int i = 0; i < N; i++) {
V[i] = AB[i][1] - AB[i][0]; b += 2 * AB[i][0];
}
for (Iterator<Pair> iter = f2.iterator(); iter.hasNext();) {
Pair f = iter.next();
if (V[f.a] <= 0 && V[f.b] <= 0) {
iter.remove(); continue;
}
if (V[f.a] < 0 || V[f.b] < 0) continue;
b += V[f.a] + V[f.b];
V[f.a] = V[f.b] = 0;
iter.remove();
}
var stars = new HashMap<Integer,Long>();
for (Pair p: f2) {
if (V[p.a] < 0) {
long b = stars.getOrDefault(p.a, 0L);
stars.put(p.a, b | (1L << p.b));
} else {
long b = stars.getOrDefault(p.b, 0L);
stars.put(p.b, b | (1L << p.a));
}
}
var dp = new HashMap<Long, Integer>();
int max = 0;
dp.put(0L, 0);
for (int c: stars.keySet()) {
var nextDp = (HashMap<Long, Integer>)(dp.clone());
long s = stars.get(c);
for (long b: dp.keySet()) {
long nb = s | b;
long db = s & ~b;
int v = dp.getOrDefault(nb, 0) + calcVal(db) + V[c];
nextDp.put(nb, Math.max(nextDp.getOrDefault(nb, Integer.MIN_VALUE), v));
max = Math.max(max, v);
}
dp = nextDp;
}
System.out.println( (double)(b+max)/2 );
}
private int calcVal(long bp) {
int s = 0, i = 0;
for (; bp > 0; bp >>= 1) {
if ((bp & 1) != 0) s += V[i];
i++;
}
return s;
}
// ---
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String next() { try { return br.readLine(); } catch (Exception e) { return null; } }
String[] nexts() { return next().split(" "); }
static int i(String s) { return Integer.parseInt(s); }
int nextInt() { return i(next()); }
int[] nextInts() { return Arrays.stream(nexts()).mapToInt(Main::i).toArray(); }
public static void main(String[] args) {
new Main().calc();
}
}
class Pair {
int a, b;
Pair(int a0, int b0) {
if (a0 > b0) { a = b0; b = a0; }
else { a = a0; b = b0; }
}
@Override
public boolean equals(Object o) {
if (!(o instanceof Pair)) return false;
Pair p = (Pair)o;
return a == p.a && b == p.b;
}
@Override
public int hashCode() {
long h = 100001L * b + a;
return (int)(h ^ (h >> 32));
}
}
import java.io.*;
import java.util.*;
class Main {
int N, M;
int[][] AB;
int[] V;
int b;
Set<Integer> f1 = new HashSet<>();
Set<Pair> f2 = new HashSet<>();
@SuppressWarnings("unchecked")
void calc() {
int[] ns = nextInts();
N = ns[0]; M = ns[1];
AB = new int[N][2];
for (int i = 0; i < N; i++) AB[i] = nextInts();
for (int i = 0; i < M; i++) {
int[] xy = nextInts();
if (xy[0] == xy[1]) f1.add(xy[0]-1);
else f2.add(new Pair(xy[0]-1, xy[1]-1));
}
for (int f: f1) {
int[] ab = AB[f];
if (ab[0] < ab[1]) {
int t = ab[0]; ab[0] = ab[1]; ab[1] = t;
}
}
V = new int[N];
for (int i = 0; i < N; i++) {
V[i] = AB[i][1] - AB[i][0]; b += 2 * AB[i][0];
}
for (Iterator<Pair> iter = f2.iterator(); iter.hasNext();) {
Pair f = iter.next();
if (V[f.a] <= 0 && V[f.b] <= 0) {
iter.remove(); continue;
}
if (V[f.a] < 0 || V[f.b] < 0) continue;
b += V[f.a] + V[f.b];
V[f.a] = V[f.b] = 0;
iter.remove();
}
var stars = new HashMap<Integer,Long>();
for (Pair p: f2) {
if (V[p.a] < 0) {
long b = stars.getOrDefault(p.a, 0L);
stars.put(p.a, b | (1L << p.b));
} else {
long b = stars.getOrDefault(p.b, 0L);
stars.put(p.b, b | (1L << p.a));
}
}
var dp = new HashMap<Long, Integer>();
int max = 0;
dp.put(0L, 0);
for (int c: stars.keySet()) {
var nextDp = (HashMap<Long, Integer>)(dp.clone());
long s = stars.get(c);
for (long b: dp.keySet()) {
long nb = s | b;
long db = s & ~b;
int v = dp.getOrDefault(b, 0) + calcVal(db) + V[c];
nextDp.put(nb, Math.max(nextDp.getOrDefault(nb, Integer.MIN_VALUE), v));
max = Math.max(max, v);
}
dp = nextDp;
}
System.out.println( (double)(b+max)/2 );
}
private int calcVal(long bp) {
int s = 0, i = 0;
for (; bp > 0; bp >>= 1) {
if ((bp & 1) != 0) s += V[i];
i++;
}
return s;
}
// ---
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String next() { try { return br.readLine(); } catch (Exception e) { return null; } }
String[] nexts() { return next().split(" "); }
static int i(String s) { return Integer.parseInt(s); }
int nextInt() { return i(next()); }
int[] nextInts() { return Arrays.stream(nexts()).mapToInt(Main::i).toArray(); }
public static void main(String[] args) {
new Main().calc();
}
}
class Pair {
int a, b;
Pair(int a0, int b0) {
if (a0 > b0) { a = b0; b = a0; }
else { a = a0; b = b0; }
}
@Override
public boolean equals(Object o) {
if (!(o instanceof Pair)) return false;
Pair p = (Pair)o;
return a == p.a && b == p.b;
}
@Override
public int hashCode() {
long h = 100001L * b + a;
return (int)(h ^ (h >> 32));
}
} | ConDefects/ConDefects/Code/abc313_f/Java/45803080 |
condefects-java_data_979 |
import java.util.Scanner;
public class Main {
static int Mod = 998244353;
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
long a = Long.parseLong(sc.next())%Mod;
long b = Long.parseLong(sc.next())%Mod;
long c = Long.parseLong(sc.next())%Mod;
long d = Long.parseLong(sc.next())%Mod;
long e = Long.parseLong(sc.next())%Mod;
long f = Long.parseLong(sc.next())%Mod;
long ans = 0;
long def = 0;
ans += (a * b) % Mod;
ans = (ans * c) % Mod;
def += (d * e) % Mod;
def = (def * f) %Mod;
ans = ans - def;
if(ans < 0)ans *= (-1);
System.out.print(ans);
}
}
import java.util.Scanner;
public class Main {
static int Mod = 998244353;
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
long a = Long.parseLong(sc.next())%Mod;
long b = Long.parseLong(sc.next())%Mod;
long c = Long.parseLong(sc.next())%Mod;
long d = Long.parseLong(sc.next())%Mod;
long e = Long.parseLong(sc.next())%Mod;
long f = Long.parseLong(sc.next())%Mod;
long ans = 0;
long def = 0;
ans += (a * b) % Mod;
ans = (ans * c) % Mod;
def += (d * e) % Mod;
def = (def * f) %Mod;
ans = ans - def;
if(ans < 0)ans = Mod - (ans * (-1));
System.out.print(ans);
}
} | ConDefects/ConDefects/Code/abc275_b/Java/39765997 |
condefects-java_data_980 | import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
long p = 998244353;
long a = sc.nextLong() % p;
long b = sc.nextLong() % p;
long c = sc.nextLong() % p;
long d = sc.nextLong() % p;
long e = sc.nextLong() % p;
long f = sc.nextLong() % p;
long mod = (a*b*c - d*e*f) % p;
if(mod < 0) mod += p;
System.out.println(mod);
sc.close();
}
}
import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
long p = 998244353;
long a = sc.nextLong() % p;
long b = sc.nextLong() % p;
long c = sc.nextLong() % p;
long d = sc.nextLong() % p;
long e = sc.nextLong() % p;
long f = sc.nextLong() % p;
long mod = (((a*b)%p)*c%p - ((d*e)%p)*f%p) % p;
if(mod < 0) mod += p;
System.out.println(mod);
sc.close();
}
} | ConDefects/ConDefects/Code/abc275_b/Java/39740227 |
condefects-java_data_981 | import java.util.*;
import java.io.*;
class Main {
public static void main (String[] args) {
final long MOD = 998244353;
Scanner sc = new Scanner (System.in);
List<Long> a = new ArrayList<>();
long multi1 = 1;
long multi2 = 1;
long ans = 0;
for (int i = 0; i < 6; i++) {
a.add(Long.parseLong(sc.next()));
a.set(i, a.get(i) % MOD);
//System.out.println(a.get(i));
}
for (int i = 0; i < 3; i++) {
multi1 = multi1 * a.get(i) % MOD;
//System.out.println(multi1);
}
for (int i = 3; i < 6; i++) {
multi2 = multi2 * a.get(i) % MOD;
//System.out.println(multi2);
}
ans = (multi1 - multi2) % MOD;
PrintWriter output = new PrintWriter(System.out);
output.println(ans);
output.flush();
}
}
import java.util.*;
import java.io.*;
class Main {
public static void main (String[] args) {
final long MOD = 998244353;
Scanner sc = new Scanner (System.in);
List<Long> a = new ArrayList<>();
long multi1 = 1;
long multi2 = 1;
long ans = 0;
for (int i = 0; i < 6; i++) {
a.add(Long.parseLong(sc.next()));
a.set(i, a.get(i) % MOD);
//System.out.println(a.get(i));
}
for (int i = 0; i < 3; i++) {
multi1 = multi1 * a.get(i) % MOD;
//System.out.println(multi1);
}
for (int i = 3; i < 6; i++) {
multi2 = multi2 * a.get(i) % MOD;
//System.out.println(multi2);
}
ans = (multi1 - multi2 + MOD) % MOD;
PrintWriter output = new PrintWriter(System.out);
output.println(ans);
output.flush();
}
}
| ConDefects/ConDefects/Code/abc275_b/Java/42172145 |
condefects-java_data_982 | import java.util.*;
import java.io.*;
public class Main {
static MyScanner sc;
static PrintWriter out;
static {
sc = new MyScanner();
out = new PrintWriter(System.out);
}
public static void solve() {
long num = 998244353;
long a = sc.nextLong() % num;
long b = sc.nextLong() % num;
long c = sc.nextLong() % num;
long d = sc.nextLong() % num;
long e = sc.nextLong() % num;
long f = sc.nextLong() % num;
long x = (((a * b) % num) * c) % num;
long y = (((d * e) % num) * f) % num;
long ans = (x - y) % num;
out.println(ans);
}
public static void main(String[] args) {
int t = 1;
while(t-- > 0)
solve();
out.flush();
}
}
class MyScanner {
BufferedReader br;
StringTokenizer tok;
MyScanner() {
try { br = new BufferedReader(new InputStreamReader(System.in)); }
catch(Exception e) { System.out.println(e); }
tok = new StringTokenizer("");
}
public String next() {
try {
while(!tok.hasMoreTokens()) tok = new StringTokenizer(br.readLine());
}
catch(Exception e) { System.out.println(e); }
return tok.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
}
import java.util.*;
import java.io.*;
public class Main {
static MyScanner sc;
static PrintWriter out;
static {
sc = new MyScanner();
out = new PrintWriter(System.out);
}
public static void solve() {
long num = 998244353;
long a = sc.nextLong() % num;
long b = sc.nextLong() % num;
long c = sc.nextLong() % num;
long d = sc.nextLong() % num;
long e = sc.nextLong() % num;
long f = sc.nextLong() % num;
long x = (((a * b) % num) * c) % num;
long y = (((d * e) % num) * f) % num;
long ans = (x - y + num) % num;
out.println(ans);
}
public static void main(String[] args) {
int t = 1;
while(t-- > 0)
solve();
out.flush();
}
}
class MyScanner {
BufferedReader br;
StringTokenizer tok;
MyScanner() {
try { br = new BufferedReader(new InputStreamReader(System.in)); }
catch(Exception e) { System.out.println(e); }
tok = new StringTokenizer("");
}
public String next() {
try {
while(!tok.hasMoreTokens()) tok = new StringTokenizer(br.readLine());
}
catch(Exception e) { System.out.println(e); }
return tok.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
}
| ConDefects/ConDefects/Code/abc275_b/Java/37919370 |
condefects-java_data_983 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int w = sc.nextInt();
int k = sc.nextInt();
char [][] s = new char[h][w];
for (int i = 0; i < h; i++) {
s[i] = sc.next().toCharArray();
}
int ans = -1;
for (int i = 0; i < h; i++) {
int oCnt = 0;
int xCnt = 0;
int elseCnt = 0;
for (int j = 0; j < w; j++){
switch (s[i][j]) {
case 'x' -> xCnt++;
case 'o' -> oCnt++;
default -> elseCnt++;
}
if (k <= j) {
switch (s[i][j-k]) {
case 'x' -> xCnt--;
case 'o' -> oCnt--;
default -> elseCnt--;
}
}
int sumCnt = xCnt+oCnt+elseCnt;
if (sumCnt == k && xCnt == 0) {
ans = Math.max(ans,oCnt);
}
}
}
for (int j = 0; j < w; j++) {
int oCnt = 0;
int xCnt = 0;
int elseCnt = 0;
for (int i = 0; i < h; i++){
switch (s[i][j]) {
case 'x' -> xCnt++;
case 'o' -> oCnt++;
default -> elseCnt++;
}
if (k < i) {
switch (s[i-k][j]) {
case 'x' -> xCnt--;
case 'o' -> oCnt--;
default -> elseCnt--;
}
}
int sumCnt = xCnt+oCnt+elseCnt;
if (sumCnt == k && xCnt == 0) {
ans = Math.max(ans,oCnt);
}
}
}
System.out.println(ans == -1 ? ans : k-ans);
}
}
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int w = sc.nextInt();
int k = sc.nextInt();
char [][] s = new char[h][w];
for (int i = 0; i < h; i++) {
s[i] = sc.next().toCharArray();
}
int ans = -1;
for (int i = 0; i < h; i++) {
int oCnt = 0;
int xCnt = 0;
int elseCnt = 0;
for (int j = 0; j < w; j++){
switch (s[i][j]) {
case 'x' -> xCnt++;
case 'o' -> oCnt++;
default -> elseCnt++;
}
if (k <= j) {
switch (s[i][j-k]) {
case 'x' -> xCnt--;
case 'o' -> oCnt--;
default -> elseCnt--;
}
}
int sumCnt = xCnt+oCnt+elseCnt;
if (sumCnt == k && xCnt == 0) {
ans = Math.max(ans,oCnt);
}
}
}
for (int j = 0; j < w; j++) {
int oCnt = 0;
int xCnt = 0;
int elseCnt = 0;
for (int i = 0; i < h; i++){
switch (s[i][j]) {
case 'x' -> xCnt++;
case 'o' -> oCnt++;
default -> elseCnt++;
}
if (k <= i) {
switch (s[i-k][j]) {
case 'x' -> xCnt--;
case 'o' -> oCnt--;
default -> elseCnt--;
}
}
int sumCnt = xCnt+oCnt+elseCnt;
if (sumCnt == k && xCnt == 0) {
ans = Math.max(ans,oCnt);
}
}
}
System.out.println(ans == -1 ? ans : k-ans);
}
} | ConDefects/ConDefects/Code/abc337_d/Java/49653315 |
condefects-java_data_984 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void solve(int h, int w, int k, char[][] s) {
int ans = -1;
for (int i = 0; i < h; i++) {
int oCnt = 0;
int xCnt = 0;
int elseCnt = 0;
for (int j = 0; j < w; j++){
switch (s[i][j]) {
case 'x' -> xCnt++;
case 'o' -> oCnt++;
default -> elseCnt++;
}
if (k <= j) {
switch (s[i][j-k]) {
case 'x' -> xCnt--;
case 'o' -> oCnt--;
default -> elseCnt--;
}
}
int sumCnt = xCnt+oCnt+elseCnt;
if (sumCnt == k && xCnt == 0) {
ans = Math.max(ans,oCnt);
}
}
}
for (int j = 0; j < w; j++) {
int oCnt = 0;
int xCnt = 0;
int elseCnt = 0;
for (int i = 0; i < h; i++){
switch (s[i][j]) {
case 'x' -> xCnt++;
case 'o' -> oCnt++;
default -> elseCnt++;
}
if (k < i) {
switch (s[i-k][j]) {
case 'x' -> xCnt--;
case 'o' -> oCnt--;
default -> elseCnt--;
}
}
int sumCnt = xCnt+oCnt+elseCnt;
if (sumCnt == k && xCnt == 0) {
ans = Math.max(ans,oCnt);
}
}
}
System.out.println(ans == -1 ? ans : k-ans);
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int w = sc.nextInt();
int k = sc.nextInt();
char [][] s = new char[h][w];
for (int i = 0; i < h; i++) {
s[i] = sc.next().toCharArray();
}
solve(h,w,k,s);
}
}
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void solve(int h, int w, int k, char[][] s) {
int ans = -1;
for (int i = 0; i < h; i++) {
int oCnt = 0;
int xCnt = 0;
int elseCnt = 0;
for (int j = 0; j < w; j++){
switch (s[i][j]) {
case 'x' -> xCnt++;
case 'o' -> oCnt++;
default -> elseCnt++;
}
if (k <= j) {
switch (s[i][j-k]) {
case 'x' -> xCnt--;
case 'o' -> oCnt--;
default -> elseCnt--;
}
}
int sumCnt = xCnt+oCnt+elseCnt;
if (sumCnt == k && xCnt == 0) {
ans = Math.max(ans,oCnt);
}
}
}
for (int j = 0; j < w; j++) {
int oCnt = 0;
int xCnt = 0;
int elseCnt = 0;
for (int i = 0; i < h; i++){
switch (s[i][j]) {
case 'x' -> xCnt++;
case 'o' -> oCnt++;
default -> elseCnt++;
}
if (k <= i) {
switch (s[i-k][j]) {
case 'x' -> xCnt--;
case 'o' -> oCnt--;
default -> elseCnt--;
}
}
int sumCnt = xCnt+oCnt+elseCnt;
if (sumCnt == k && xCnt == 0) {
ans = Math.max(ans,oCnt);
}
}
}
System.out.println(ans == -1 ? ans : k-ans);
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int w = sc.nextInt();
int k = sc.nextInt();
char [][] s = new char[h][w];
for (int i = 0; i < h; i++) {
s[i] = sc.next().toCharArray();
}
solve(h,w,k,s);
}
} | ConDefects/ConDefects/Code/abc337_d/Java/49653530 |
condefects-java_data_985 | import java.util.Scanner;
class Main{
private static int[] array;
private static int N,M;
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
N = sc.nextInt();
M = sc.nextInt();
array = new int[N];
for(int i=1;i<M;i++){
array[0] = i;
dfs(1);
}
}
private static final void dfs(int now){
if(now==N){
StringBuilder sb = new StringBuilder();
sb.append(array[0]);
for(int i=1;i<N;i++){
sb.append(" ");
sb.append(array[i]);
}
System.out.println(sb);
}
else{
for(int i=array[now-1]+1;i<=M;i++){
array[now] = i;
dfs(now+1);
}
}
}
}
import java.util.Scanner;
class Main{
private static int[] array;
private static int N,M;
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
N = sc.nextInt();
M = sc.nextInt();
array = new int[N];
for(int i=1;i<=M;i++){
array[0] = i;
dfs(1);
}
}
private static final void dfs(int now){
if(now==N){
StringBuilder sb = new StringBuilder();
sb.append(array[0]);
for(int i=1;i<N;i++){
sb.append(" ");
sb.append(array[i]);
}
System.out.println(sb);
}
else{
for(int i=array[now-1]+1;i<=M;i++){
array[now] = i;
dfs(now+1);
}
}
}
}
| ConDefects/ConDefects/Code/abc263_c/Java/44833532 |
condefects-java_data_986 | import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long A = sc.nextLong();
long M = sc.nextLong();
long L = sc.nextLong() - A;
long R = sc.nextLong() - A;
long cnt = 0;
if (R < 0) {
R++;
} else if (L > 0) {
L--;
}
BigDecimal bd = new BigDecimal(R);
BigDecimal bd1 = new BigDecimal(L);
BigDecimal bd2 = new BigDecimal(M);
long cntR = bd.divide(bd2,RoundingMode.DOWN).longValue();
long cntL = bd1.divide(bd2,RoundingMode.DOWN).longValue();
cnt = cntR -cntL;
if (L < 0 && 0 < R) cnt++;
//else if ((L % M == 0 || R % M ==0) && (L > 0 && R > 0)) cnt++;
System.out.println(cnt);
sc.close();
}
}
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long A = sc.nextLong();
long M = sc.nextLong();
long L = sc.nextLong() - A;
long R = sc.nextLong() - A;
long cnt = 0;
if (R < 0) {
R++;
} else if (L > 0) {
L--;
}
BigDecimal bd = new BigDecimal(R);
BigDecimal bd1 = new BigDecimal(L);
BigDecimal bd2 = new BigDecimal(M);
long cntR = bd.divide(bd2,RoundingMode.DOWN).longValue();
long cntL = bd1.divide(bd2,RoundingMode.DOWN).longValue();
cnt = cntR -cntL;
if (L < 0 && 0 <= R) {cnt++;}
//else if ((L % M == 0 || R % M ==0) && (L > 0 && R > 0)) cnt++;
System.out.println(cnt);
sc.close();
}
}
| ConDefects/ConDefects/Code/abc334_b/Java/51635251 |
condefects-java_data_987 | import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
long a = sc.nextLong();
long m = sc.nextLong();
long l = sc.nextLong();
long r = sc.nextLong();
l = l - a;
r = r - a;
long ll, rr;
if(l >= 0) ll = (l + m - 1) / m;
else ll = l / m;
if(r >= 0) rr = r / m;
else rr = (-r + m - 1) / m * -1;
System.out.println(ll);
System.out.println(rr);
System.out.println(rr - ll + 1);
}
}
import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
long a = sc.nextLong();
long m = sc.nextLong();
long l = sc.nextLong();
long r = sc.nextLong();
l = l - a;
r = r - a;
long ll, rr;
if(l >= 0) ll = (l + m - 1) / m;
else ll = l / m;
if(r >= 0) rr = r / m;
else rr = (-r + m - 1) / m * -1;
System.out.println(rr - ll + 1);
}
}
| ConDefects/ConDefects/Code/abc334_b/Java/52972012 |
condefects-java_data_988 | import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Iterator;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.StringJoiner;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
public class Main {
static void solve() {
var a = sc.nextLong();
var m = sc.nextLong();
var l = sc.nextLong();
var r = sc.nextLong();
l -= a;
r -= a;
var X = (((long) 1e18) / m) + 1L;
l += m * X;
r += m * X;
pw.println((r / m - (l - 1) / m));
}
static void swap(int[] array, int i, int j) {
int temp = array[i];
array[j] = array[i];
array[i] = temp;
}
static void swap(long[] array, int i, int j) {
long temp = array[i];
array[j] = array[i];
array[i] = temp;
}
static void swap(char[] array, int i, int j) {
char temp = array[i];
array[j] = array[i];
array[i] = temp;
}
static String swap(String str, int i, int j) {
var temp = str.toCharArray();
var taihi = temp[i];
temp[i] = temp[j];
temp[j] = taihi;
return toString(temp);
}
/*
* エラトステネスの篩 nまでの素数の配列を返却する
*
*/
public static boolean[] getEratostheses(int n) {
boolean[] isPrimes = new boolean[n + 1];
Arrays.fill(isPrimes, true);
isPrimes[0] = isPrimes[1] = false;
var root = Math.sqrt(isPrimes.length);
for (int i = 0; i < root; i++) {
if (!isPrimes[i]) continue;
for (int j = i * i; j < isPrimes.length; j += i) {// iでインクリメントし)ているのポイント
isPrimes[j] = false;
}
}
return isPrimes;
}
public static List<Integer> getPrimeList(int n) {
var list = new ArrayList<Integer>();
var primes = getEratostheses(n);
for (var i = 0; i < n; i++) {
if (primes[i]) list.add(i);
}
return list;
}
public static boolean isPrime(long a) {
if (a == 1) return false;
if (a == 2) return true;
if (a % 2 == 0) return false;
var rootA = (int) Math.sqrt(a);
for (int i = 3; i <= rootA; i += 2) {
if (a % i == 0) return false;
}
return true;
}
/**
* 素因数分解の結果を返却する １は含まれないことに注意
*
* @param x
* @return 素因数分解の結果
*/
public static List<Integer> primeFactorize(int x) {
var ret = new ArrayList<Integer>();
for (int i = 2; i <= (int) Math.sqrt(x); i++) {
if (x % i == 0) {
while (x % i == 0) {
ret.add(i);
x /= i;
}
}
}
if (x != 1) {
ret.add(x);
}
return ret;
}
/**
* 次の順列にする。 MEMO: 利用の場合はもとが昇順でソートしているか確認すること
*
* ) @param array )*
*
* @return boolean 次の順列がある
*/
static boolean nextPermutation(int[] array) {
// Find longest non-increasing suffix
int i = array.length - 1;
while (i > 0 && array[i - 1] >= array[i])
i--;
// Now i is the head index of the suffix
// Are we at the last permutation already?
if (i <= 0) return false;
// Let array[i - 1] be the pivot
// Find rightmost element greater than the pivot
int j = array.length - 1;
while (array[j] <= array[i - 1])
j--;
// Now the value array[j] will become the new pivot
// Assertion: j >= i
// Swap the pivot with j
int temp = array[i - 1];
array[i - 1] = array[j];
array[j] = temp;
// Reverse the suffix
j = array.length - 1;
while (i < j) {
temp = array[i];
array[i] = array[j];
array[j] = temp;
i++;
j--;
}
// Successfully computed the next permutation
return true;
}
// public static final int MOD = ((int) 1e9 + 7);
// public static final long MOD = 998244353L;
public static final long MOD = (long) 1e8;
public static final int INF = (int) 1e9;
/**
* ランレングス圧縮
*
* @param str
* @return Pair
*/
public static List<Pair<Character, Integer>> runLength(String str) {
var ret = new ArrayList<Pair<Character, Integer>>();
for (int i = 0; i < str.length(); i++) {
var cnt = 1;
while (i < str.length() - 1 && str.charAt(i) == str.charAt(i + 1)) {
i++;
cnt++;
}
ret.add(new Pair<Character, Integer>(str.charAt(i), cnt));
}
return ret;
}
/**
* 10進数からX進数の文字列に変換する。
*
* @MEMO 逆向きの変換はLong.parseUnsignedLong(String s, int radix)を利用する！
*
* @param n 変換元（１０進数）
* @param newBase 変換後の基数
* @return newBase変換後のString
*/
public static String convertBase10ToX(long n, int radix) {
if (n == 0L) return "0";
var sb = new StringBuilder();
while (n > 0) {
long r = n % (long) radix;
sb.insert(0, r);
n /= (long) radix;
}
return sb.toString();
}
public static int[] array(int size, int init) {
var array = new int[size];
fill(array, init);
return array;
}
public static int[] array(int size, IntUnaryOperator generator) {
var array = new int[size];
Arrays.setAll(array, generator);
return array;
}
public static char[] array(int size, char init) {
var array = new char[size];
fill(array, init);
return array;
}
public static char[][] array(int h, int w, char init) {
var array = new char[h][w];
for (char[] c : array) fill(c, init);
return array;
}
public static boolean[] array(int size, boolean init) {
var array = new boolean[size];
fill(array, init);
return array;
}
public static long[] array(int size, long init) {
var array = new long[size];
fill(array, init);
return array;
}
/**
* 先頭が0でそれ以外は初期値の配列を返却する
*
* @param size
* @param init
* @return
*/
public static int[] zeroArray(int size, int init) {
int[] array = new int[size];
fill(array, init);
array[0] = 0;
return array;
}
public static long[] zeropArray(int size, long init) {
var array = new long[size];
fill(array, init);
array[0] = 0L;
return array;
}
public static long gcd(long a, long b) {
if (b > a) {
long temp = a;
a = b;
b = temp;
}
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
public static long lcm(long a, long b) {
// NOTE オーバーフローに注意すること。
// オーバーフローのおそれがある場合は以下のような対応をとる
// if (a / g > INF / b) return INF;
// @see https://drken1215.hatenablog.com/entry/2023/11/21/020301
if (b > a) {
return b / gcd(a, b) * a;
} else {
return a / gcd(a, b) * b;
}
}
/**
* 負の数にも対応した%演算
*
* @param val
* @param mod
* @return
*/
public static long mod(long val, long mod) {
long res = val % mod;
if (res < 0) res += mod;
return res;
}
/**
* べき乗の計算
*/
public static final long pow(int a, int b) {
if (b == 0) return 1;
if (b % 2 == 1) return a * pow(a, (b - 1));
var half = pow(a, b / 2);
return half * half;
}
/**
* べき乗の計算
*/
public static final long pow(long a, long b) {
if (b == 0L) return 1L;
if (b % 2L == 1L) return a * pow(a, (b - 1L));
var half = pow(a, b / 2L);
return half * half;
}
/**
* べき乗 MOD 計算量 O(logN)
*
* @param val
* @param mod
* @return
*/
public static long modpow(long a, long b, long mod) {
if (b == 0L) return 1L;
if (b == 1L) return a % mod;
if (b % 2 == 1) return (a * modpow(a, b - 1L, mod)) % mod;
long temp = modpow(a, b / 2L, mod);
return (temp * temp) % mod;
}
public static int getKeata(int x) {
return String.valueOf(x).length();
}
public static int getKeata(long x) {
return String.valueOf(x).length();
}
/**
* Arras#binarySearchでは重複した場合の返却値が安定しないので、LowerBound版を作成
*
* 値が重複しないことが保証されている場合は速度的にArrays#binarySearchを使うこと。
*
* )* @param array
*
* @param key
* @return 存在する場合はインデックス 存在しない場合は-(挿入するポイント)-1(ビット反転[~]すればもどる)
*/
public static int binarySearchLowerBound(int[] array, int key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while (ok - ng > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] >= key) {
ok = mid;
} else {
ng = mid;
}
}
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchLowerBound(long[] array, long key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while (ok - ng > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] >= key) {
ok = mid;
} else {
ng = mid;
}
}
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchUpperBound(int[] array, int key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while ((ok - ng) > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] > key) {
ok = mid;
} else {
ng = mid;
}
}
if (ng == -1) return -1;// 探索内で大きいものが見つからなかったとき
if (array[ng] == key) return ng;// 最後の値がkeyと同じ値の場合は最後の値を利用する
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchUpperBound(long[] array, long key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while ((ok - ng) > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] > key) {
ok = mid;
} else {
ng = mid;
}
}
if (ng == -1) return -1;// 探索内で大きいものが見つからなかったとき
if (array[ng] == key) return ng;// 最後の値がkeyと同じ値の場合は最後の値を利用する
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
/*--- ---*/
/*--- Util ---*/
/*--- ---*/
public static List<Integer> toList(int[] a) {
return Arrays.stream(a).boxed().collect(Collectors.toList());
}
public static List<Long> toList(long[] a) {
return Arrays.stream(a).boxed().collect(Collectors.toList());
}
public static String reverse(String str) {
return new StringBuilder().append(str).reverse().toString();
}
public static boolean isKaibun(String str) {
return str.equals(reverse(str));
}
public static String toString(int a) {
return String.valueOf(a);
}
public static String toString(long a) {
return String.valueOf(a);
}
public static String toString(char[] a) {
return String.valueOf(a);
}
public static int toInt(String a) {
return Integer.valueOf(a);
}
public static long toLong(String a) {
return Long.valueOf(a);
}
public static char[] toCharArray(int a) {
return String.valueOf(a).toCharArray();
}
public static char[] toCharArray(long a) {
return String.valueOf(a).toCharArray();
}
public static char[] toCharArray(String a) {
return a.toCharArray();
}
public static boolean isAllTrue(boolean[] boo) {
for (boolean b : boo) {
if (!b) return false;
}
return true;
}
public static int cntBoolean(boolean[] boo) {
int cnt = 0;
for (boolean b : boo) {
if (b) cnt++;
}
return cnt;
}
public static void sort(int[] a) {
Arrays.sort(a);
}
public static void sort(long[] a) {
Arrays.sort(a);
}
public static int abs(int a, int b) {
return Math.abs(a - b);
}
public static long abs(long a, long b) {
return Math.abs(a - b);
}
/**
* int配列を降順にソートする
*/
public static void sortDes(int[] a) {
Arrays.sort(a);
var temp = Arrays.copyOf(a, a.length);
for (int i = 0; i < temp.length; i++) {
a[i] = temp[temp.length - i - 1];
}
}
/**
* long配列を降順にソートする
*/
public static void sortDes(long[] a) {
Arrays.sort(a);
var temp = Arrays.copyOf(a, a.length);
for (int i = 0; i < temp.length; i++) {
a[i] = temp[temp.length - i - 1];
}
}
public static void fill(int[] array, int val) {
Arrays.fill(array, val);
}
public static void fill(char[] array, char val) {
Arrays.fill(array, val);
}
public static void fill(boolean[] array, boolean val) {
Arrays.fill(array, val);
}
public static void fill(int[][] array, int val) {
for (var a : array) Arrays.fill(a, val);
}
public static void fill(long[] array, long val) {
Arrays.fill(array, val);
}
public static void fill(long[][] array, long val) {
for (var a : array) Arrays.fill(a, val);
}
public static void initalizeDp(int[][] dp, int val) {
fill(dp, val);
dp[0][0] = 0;
}
public static void initalizeDp(long[][] dp, long val) {
fill(dp, val);
dp[0][0] = 0L;
}
public static int max(int... array) {
return Arrays.stream(array).max().getAsInt();
}
public static int sum(int... array) {
return Arrays.stream(array).sum();
}
public static int max(int a, int b) {
return Math.max(a, b);
}
public static int min(int... array) {
return Arrays.stream(array).min().getAsInt();
}
public static int min(int a, int b) {
return Math.min(a, b);
}
public static long max(long... array) {
return Arrays.stream(array).max().getAsLong();
}
public static long max(long a, long b) {
return Math.max(a, b);
}
public static long sum(long... array) {
return Arrays.stream(array).sum();
}
public static long min(long a, long b) {
return Math.min(a, b);
}
public static long min(long... array) {
return Arrays.stream(array).min().getAsLong();
}
/*--- ---*/
/*--- debug ---*/
/*--- ---*/
public static void debug(Object o, Object... args) {
var format = "%s";
var temp = new Object[args.length + 1];
temp[0] = o;
System.arraycopy(args, 0, temp, 1, args.length);
for (int i = 0; i < temp.length - 1; i++) {
format += " %s";
}
System.out.printf(format, temp);
System.out.println("");
}
public static void debug(int[] x) {
out(Arrays.toString(x));
}
public static void debug(boolean[] x) {
out(Arrays.toString(x));
}
public static void debug(long[] x) {
out(Arrays.toString(x));
}
public static void debug(char[] x) {
out(String.valueOf(x));
}
public static void debug(int[][] x) {
out(Arrays.deepToString(x));
}
public static void debugln(int[][] x) {
for (int[] w : x) {
for (var i : w) {
System.err.print(i + " ");
}
out("");
}
out("///////////////////");
}
public static void debug(long[][] x) {
out(Arrays.deepToString(x));
}
public static void debugln(long[][] x) {
for (long[] w : x) {
for (var i : w) {
System.err.print(i + " ");
}
out("");
}
out("///////////////////");
}
public static void debug(boolean[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(char[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(Object[] x) {
out(Arrays.toString(x));
}
public static void debug(Object[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(Object a) {
System.err.println(a);
}
public static void out(String x) {
System.err.println(x);
}
final static ContestPrinter pw = new ContestPrinter();
final static FastScanner sc = new FastScanner();
public static void main(String[] args) {
solve();
pw.close();
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[ptr++];
else
return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public Point nextPoint() {
return new Point(nextInt(), nextInt());
}
public Point[] nextPointArray(int size) {
Point[] array = new Point[size];
Arrays.setAll(array, i -> new Point(nextInt(), nextInt()));
return array;
}
public List<Point> nextPointList(int size) {
List<Point> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(new Point(nextInt(), nextInt()));
return list;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public int[] nextIntArray(int size) {
int[] intArray = new int[size];
Arrays.setAll(intArray, i -> nextInt());
return intArray;
}
public int[] nextIntArray(int size, IntUnaryOperator map) {
int[] intArray = new int[size];
Arrays.setAll(intArray, i -> map.applyAsInt(nextInt()));
return intArray;
}
public int[] nextIntArrayOneToZeroIndex(int size) {
return nextIntArray(size, i -> i - 1);
}
public long[] nextLongArray(int size) {
long[] longArray = new long[size];
Arrays.setAll(longArray, i -> nextLong());
return longArray;
}
public long[] nextLongArray(int size, LongUnaryOperator map) {
long[] longArray = new long[size];
Arrays.setAll(longArray, i -> map.applyAsLong(nextLong()));
return longArray;
}
public String[] nextStringArray(int size) {
String[] stringArray = new String[size];
Arrays.setAll(stringArray, i -> next());
return stringArray;
}
public List<String> nextStringList(int size) {
List<String> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(next());
return list;
}
public Integer[] nextIntegerArray(int size) {
Integer[] ret = new Integer[size];
for (int i = 0; i < size; i++) ret[i] = nextInt();
return ret;
}
public Integer[] nextIntegerArray(int size, IntUnaryOperator map) {
Integer[] ret = new Integer[size];
for (int i = 0; i < size; i++) ret[i] = map.applyAsInt(nextInt());
return ret;
}
public char[][] nextDimensionalCharArray(int h, int w) {
char[][] array = new char[h][w];
for (int i = 0; i < h; i++) {
array[i] = next().toCharArray();
}
return array;
}
public int[][] nextDimensionalIntArray(int h, int w) {
int[][] array = new int[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
array[i][j] = nextInt();
}
}
return array;
}
public long[][] nextDimensionaLongArray(int h, int w) {
long[][] array = new long[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
array[i][j] = nextLong();
}
}
return array;
}
public int[][] nextIntArrayFromStr(int h, int w) {
int[][] array = new int[h][w];
for (int i = 0; i < h; i++) {
String temp = next();
for (int j = 0; j < w; j++) {
array[i][j] = temp.charAt(j) - '0';
}
}
return array;
}
public List<Integer> nextIntgerList(int size) {
List<Integer> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(nextInt());
return list;
}
public List<Integer> nextIntgerList(int size, IntUnaryOperator map) {
List<Integer> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(map.applyAsInt(nextInt()));
return list;
}
}
class ContestPrinter extends java.io.PrintWriter {
public ContestPrinter(java.io.PrintStream stream) {
super(stream);
}
public ContestPrinter(java.io.File file) throws java.io.FileNotFoundException {
super(new java.io.PrintStream(file));
}
public ContestPrinter() {
super(System.out);
}
private static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if (x < 0) {
sb.append('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
sb.append((long) x);
sb.append(".");
x -= (long) x;
for (int i = 0; i < n; i++) {
x *= 10;
sb.append((int) x);
x -= (int) x;
}
return sb.toString();
}
@Override
public void print(float f) {
super.print(dtos(f, 20));
}
@Override
public void println(float f) {
super.println(dtos(f, 20));
}
@Override
public void print(double d) {
super.print(dtos(d, 20));
}
@Override
public void println(double d) {
super.println(dtos(d, 20));
}
@Override
public void print(boolean boo) {
super.print(boo ? "Yes" : "No");
}
public void print(int[] array, String separator) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n - 1]);
}
public void print(int[] array) {
this.print(array, " ");
}
public void print(int[] array, String separator, java.util.function.IntUnaryOperator map) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(map.applyAsInt(array[i]));
super.print(separator);
}
super.println(map.applyAsInt(array[n - 1]));
}
public void print(int[] array, java.util.function.IntUnaryOperator map) {
this.print(array, " ", map);
}
public void print(long[] array, String separator) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n - 1]);
}
public void print(long[] array) {
this.print(array, " ");
}
public void print(long[] array, String separator, java.util.function.LongUnaryOperator map) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(map.applyAsLong(array[i]));
super.print(separator);
}
super.println(map.applyAsLong(array[n - 1]));
}
public void print(long[] array, java.util.function.LongUnaryOperator map) {
this.print(array, " ", map);
}
public <T> void print(T[] array, String separator) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n - 1]);
}
public <T> void print(T[] array) {
this.print(array, " ");
}
public <T> void print(T[] array, String separator, java.util.function.UnaryOperator<T> map) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(map.apply(array[i]));
super.print(separator);
}
super.println(map.apply(array[n - 1]));
}
public <T> void print(T[] array, java.util.function.UnaryOperator<T> map) {
this.print(array, " ", map);
}
public String getOutputCollection(Collection<?> c) {
return String.join(" ", c.stream().map(String::valueOf).collect(Collectors.toList()));
}
public void print(Collection<?> c) {
super.print(getOutputCollection(c));
}
public void println(Collection<?> c) {
StringBuilder sb = new StringBuilder();
for (Object object : c) {
// java 15以下の環境だとisEmptyがコンパイルしない
// if (!sb.isEmpty()) sb.append("\r\n");
if (sb.length() != 0) sb.append("\r\n");
sb.append(object);
}
System.out.println(sb);
}
public void println(int[] array) {
print(array, "\r\n");
}
public void println(long[] array) {
print(array, "\r\n");
}
public void print(String[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (String str : a) {
joiner.add(str);
}
System.out.println(joiner);
}
public void println(String[] a) {
StringJoiner joiner = new StringJoiner("\r\n");
for (String str : a) {
joiner.add(str);
}
System.out.println(joiner);
}
public void print(Object obj) {
System.out.print(obj);
}
public void println(Object obj) {
System.out.println(obj);
}
public void printlnDeep(ArrayList<ArrayList<Integer>> c) {
StringBuilder sb = new StringBuilder();
for (var ci : c) sb.append(getOutputCollection(ci)).append("\r\n");
System.out.println(sb);
}
public void printZeroToOneIndex(int[] a) {
print(a, i -> i + 1);
}
public void printZeroToOneIndex(long[] a) {
print(a, i -> i + 1);
}
public void printZeroToOneIndex(List<Integer> a) {
print(a.stream().map(i -> i + 1).collect(Collectors.toList()));
}
public void printlnZeroToOneIndex(List<Integer> a) {
println(a.stream().map(i -> i + 1).collect(Collectors.toList()));
}
public void print(boolean[] a) {
for (int i = 0; i < a.length; i++) {
System.out.println(a[i] + " ");
}
System.out.println("");
}
public void print(boolean[][] b) {
for (int i = 0; i < b.length; i++) {
for (int j = 0; j < b[0].length; j++) {
System.out.print(b[i][j] ? "o" : "x");
}
System.out.println("");
}
}
public void print(int[][] array) {
for (var i : array) print(i);
}
public void print(long[][] array) {
for (var i : array) print(i);
}
public void print(char[][] array) {
for (char[] cs : array) {
for (char c : cs) {
print(c);
}
println();
}
}
}
class Graph {
List<ArrayList<Integer>> g;
int v;
int e;
boolean[] visited;
public Graph(int v) {
this.v = v;
for (var i = 0; i < v; i++) g.add(new ArrayList<Integer>());
visited = new boolean[v];
}
public void addEdge(int a, int b) {
g.get(a).add(b);
g.get(b).add(a);
e++;
}
public void dfs(int now) {
visited[now] = true;
for (var next : g.get(now)) {
if (visited[next]) continue;
dfs(next);
}
}
public boolean marked(int now) {
return visited[now];
}
public boolean isAllConected() {
for (var bo : visited) {
if (!bo) return false;
}
return true;
}
}
/**
* 先頭及び末尾への挿入がO（1）かつ、ランダムアクセスもO(1)で可能なデータ構造の自作クラス
*/
class ContestDeque<E> implements Iterable<E> {
private List<E> stack;
private List<E> que;
public ContestDeque() {
stack = new ArrayList<E>();
que = new ArrayList<E>();
}
public E get(int i) {
if (i < stack.size()) {
return stack.get(stack.size() - i - 1);
} else {
return que.get(i - stack.size());
}
}
public E remove(int i) {
E e;
if (i < stack.size()) {
e = stack.remove(stack.size() - i - 1);
} else {
e = que.remove(i - stack.size());
}
return e;
}
public void addFirst(E e) {
stack.add(e);
}
public void addLast(E e) {
que.add(e);
}
public void set(int i, E e) {
if (i < stack.size()) {
e = stack.set(stack.size() - i - 1, e);
} else {
e = que.set(i - stack.size(), e);
}
}
public int size() {
return stack.size() + que.size();
}
public boolean isEmpty() {
return size() == 0;
}
@Override
public String toString() {
var temp = new ArrayList<E>();
for (int i = stack.size() - 1; i >= 0; i--) {
temp.add(stack.get(i));
}
temp.addAll(que);
return String.join(" ", temp.stream().map(String::valueOf).collect(Collectors.toList()));
}
public Iterator<E> iterator() {
return new ContestDequeIterator();
}
private class ContestDequeIterator implements Iterator<E> {
private int i = 0;
public boolean hasNext() {
return i < size();
}
public E next() {
i++;
return get(i);
}
}
}
/**
* ｘｙの二次元の座標クラス ユークリッド距離が算出可能
*/
class Point implements Comparable<Point> {
long x;
long y;
Point(long x, long y) {
this.x = x;
this.y = y;
}
/**
* 距離を求める。ただし値は平方根を付ける前
*
* @param Point
* @return long 平方根を付ける前の距離
*/
public long dist(Point target) {
return (long) (x - target.x) * (x - target.x) + (y - target.y) * (y - target.y);
}
@Override
public int compareTo(Point o) {
return (int) (x == o.x ? y - o.y : x - o.x);
}
@Override
public int hashCode() {
return (int) (x + y) * 31;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof Point)) return false;
Point p = (Point) o;
return x == p.x && y == p.y;
}
@Override
public String toString() {
return String.format("(%s %s)", x, y);
}
}
/**
* グリッド上のカーソルを扱うクラス
*
*/
class GridCursor implements Comparable<GridCursor> {
int h;
int w;
static char[][] input = null;
static int maxH = -1;
static int maxW = -1;
static char OBSTACLE = '#';
static final int[][] directions8 = { { 1, 0 }, { 1, -1 }, { 1, 1 }, { -1, 0 }, { -1, 1 }, { -1, -1 }, { 0, 1 },
{ 0, -1 } };
static final int[][] directions4 = { { 1, 0 }, { -1, 0 }, { 0, 1 }, { 0, -1 } };
public boolean isInnner() {
if (maxH < 0 || maxW < 0) {
throw new IllegalStateException("h/w is not initialized!");
}
return h >= 0 && h < maxH && w >= 0 && w < maxW;
}
public GridCursor(int h, int w) {
this.h = h;
this.w = w;
}
public GridCursor(int h, int w, char[][] input) {
this.h = h;
this.w = w;
GridCursor.input = input;
maxH = input.length;
maxW = input[0].length;
}
public GridCursor(int h, int w, int maxH, int maxW) {
this.h = h;
this.w = w;
// MEMO staticのものを設定するのも微妙な気がする
GridCursor.maxH = maxH;
GridCursor.maxW = maxW;
}
public boolean move(char ch) {
// MEMO enumにするべききもするが自分しか利用しないのでそのままとする
if (ch != 'R' && ch != 'L' && ch != 'D' && ch != 'U') {
throw new IllegalArgumentException("move method only allows R/L/D/U");
}
if (maxH < 0 || maxW < 0) {
throw new IllegalStateException("h/w is not initialized!");
}
var nh = h;
var nw = w;
if (ch == 'R') nw++;
if (ch == 'L') nw--;
if (ch == 'D') nh++;
if (ch == 'U') nh--;
if (!(nh >= 0 && nw >= 0 && nh < maxH && nw < maxW)) return false;
if (input != null && input[nh][nw] == OBSTACLE) return false;
h = nh;
w = nw;
return true;
}
@Override
public int compareTo(GridCursor o) {
return (int) (h == o.h ? w - o.w : h - o.h);
}
@Override
public int hashCode() {
return (h + w) * 31;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof GridCursor)) return false;
GridCursor g = (GridCursor) o;
return h == g.h && w == g.w;
}
@Override
public String toString() {
return String.format("(%s %s)", h, w);
}
}
class Pair<S extends Comparable<S>, T extends Comparable<T>> implements Comparable<Pair<S, T>> {
S first;
T second;
public Pair(S s, T t) {
first = s;
second = t;
}
public S getFirst() {
return first;
}
public T getSecond() {
return second;
}
public boolean equals(Object another) {
if (this == another) return true;
if (!(another instanceof Pair)) return false;
Pair otherPair = (Pair) another;
return this.first.equals(otherPair.first) && this.second.equals(otherPair.second);
}
public int compareTo(Pair<S, T> another) {
java.util.Comparator<Pair<S, T>> comp1 = java.util.Comparator.comparing(Pair::getFirst);
java.util.Comparator<Pair<S, T>> comp2 = comp1.thenComparing(Pair::getSecond);
return comp2.compare(this, another);
}
public int hashCode() {
return first.hashCode() * 10007 + second.hashCode();
}
public String toString() {
return String.format("%s %s", first, second);
}
}
/**
* 辺のクラス
*
* @author ritoAtCoder
*
*/
class Edge implements Comparable<Edge> {
int from;
int to;
int cost;
Edge(int from, int to, int cost) {
this.from = from;
this.to = to;
this.cost = cost;
}
@Override
public int compareTo(Edge that) {
// java.util.Comparator<Pair<S, T>> comp1 = java.util.Comparator.comparing(Pair::getFirst);
// java.util.Comparator<Pair<S, T>> comp2 = comp1.thenComparing(Pair::getSecond);
// return comp2.compare(this, another);
// Integer.compare(cost, e.cost).th
int c = Integer.compare(this.cost, that.cost);
if (c == 0) c = Integer.compare(this.to, that.to);
if (c == 0) c = Integer.compare(this.from, that.from);
return c;
// return cost - e.cost != 0 ? cost - e.cost : (to - e.to != 0 ? to - e.to : from - e.from);
}
@Override
public int hashCode() {
return (from + to + cost) * 17;
}
@Override
public String toString() {
return String.format("%s -> %s (%s) ", from, to, cost);
}
@Override
public boolean equals(Object another) {
if (!(another instanceof Edge)) return false;
if (this == another) return true;
Edge o = (Edge) another;
return from == o.from && to == o.to && cost == o.cost;
}
}
class UnionFind {
int[] parent, rank, size, minNode;
int componentSize;// 連結成分の個数
int[] value;// ノードごとに値を持ちたいとき。直接設定する
public UnionFind(int n) {
parent = new int[n];
rank = new int[n];
size = new int[n];// ノード内に含まれる数
minNode = new int[n];
value = new int[n];
for (int i = 0; i < n; i++) {
parent[i] = i;
rank[i] = 0;// 0始まりとする
size[i] = 1;
minNode[i] = i;
}
componentSize = n;
}
public void clear() {
int n = parent.length;
parent = new int[n];
rank = new int[n];
size = new int[n];// ノード内に含まれる数
minNode = new int[n];
value = new int[n];
for (int i = 0; i < n; i++) {
parent[i] = i;
rank[i] = 0;// 0始まりとする
size[i] = 1;
minNode[i] = i;
}
componentSize = n;
}
public int root(int x) {
if (parent[x] == x) return x;
return parent[x] = root(parent[x]);// 経路圧縮
}
public boolean isConneted(int x, int y) {
return root(x) == root(y);
}
public boolean union(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
// ランクが高い方を常にx側で持つ
if (rank[x] < rank[y]) {
int temp = x;
x = y;
y = temp;
}
parent[y] = x;
if (rank[x] == rank[y]) rank[x]++;
size[x] += size[y];
minNode[x] = Math.min(minNode[x], minNode[y]);
value[x] += value[y];
componentSize--;
return true;
}
public int getSize(int x) {
return size[root(x)];
}
public int getMinNode(int x) {
return minNode[root(x)];
}
public int getComponentSize() {
return componentSize;
}
public int getValue(int x) {
return value[root(x)];
}
@Override
public String toString() {
return Arrays.toString(parent);
}
}
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Iterator;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.StringJoiner;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
public class Main {
static void solve() {
var a = sc.nextLong();
var m = sc.nextLong();
var l = sc.nextLong();
var r = sc.nextLong();
l -= a;
r -= a;
var X = (((long) 2e18) / m) + 1L;
l += m * X;
r += m * X;
pw.println((r / m - (l - 1) / m));
}
static void swap(int[] array, int i, int j) {
int temp = array[i];
array[j] = array[i];
array[i] = temp;
}
static void swap(long[] array, int i, int j) {
long temp = array[i];
array[j] = array[i];
array[i] = temp;
}
static void swap(char[] array, int i, int j) {
char temp = array[i];
array[j] = array[i];
array[i] = temp;
}
static String swap(String str, int i, int j) {
var temp = str.toCharArray();
var taihi = temp[i];
temp[i] = temp[j];
temp[j] = taihi;
return toString(temp);
}
/*
* エラトステネスの篩 nまでの素数の配列を返却する
*
*/
public static boolean[] getEratostheses(int n) {
boolean[] isPrimes = new boolean[n + 1];
Arrays.fill(isPrimes, true);
isPrimes[0] = isPrimes[1] = false;
var root = Math.sqrt(isPrimes.length);
for (int i = 0; i < root; i++) {
if (!isPrimes[i]) continue;
for (int j = i * i; j < isPrimes.length; j += i) {// iでインクリメントし)ているのポイント
isPrimes[j] = false;
}
}
return isPrimes;
}
public static List<Integer> getPrimeList(int n) {
var list = new ArrayList<Integer>();
var primes = getEratostheses(n);
for (var i = 0; i < n; i++) {
if (primes[i]) list.add(i);
}
return list;
}
public static boolean isPrime(long a) {
if (a == 1) return false;
if (a == 2) return true;
if (a % 2 == 0) return false;
var rootA = (int) Math.sqrt(a);
for (int i = 3; i <= rootA; i += 2) {
if (a % i == 0) return false;
}
return true;
}
/**
* 素因数分解の結果を返却する １は含まれないことに注意
*
* @param x
* @return 素因数分解の結果
*/
public static List<Integer> primeFactorize(int x) {
var ret = new ArrayList<Integer>();
for (int i = 2; i <= (int) Math.sqrt(x); i++) {
if (x % i == 0) {
while (x % i == 0) {
ret.add(i);
x /= i;
}
}
}
if (x != 1) {
ret.add(x);
}
return ret;
}
/**
* 次の順列にする。 MEMO: 利用の場合はもとが昇順でソートしているか確認すること
*
* ) @param array )*
*
* @return boolean 次の順列がある
*/
static boolean nextPermutation(int[] array) {
// Find longest non-increasing suffix
int i = array.length - 1;
while (i > 0 && array[i - 1] >= array[i])
i--;
// Now i is the head index of the suffix
// Are we at the last permutation already?
if (i <= 0) return false;
// Let array[i - 1] be the pivot
// Find rightmost element greater than the pivot
int j = array.length - 1;
while (array[j] <= array[i - 1])
j--;
// Now the value array[j] will become the new pivot
// Assertion: j >= i
// Swap the pivot with j
int temp = array[i - 1];
array[i - 1] = array[j];
array[j] = temp;
// Reverse the suffix
j = array.length - 1;
while (i < j) {
temp = array[i];
array[i] = array[j];
array[j] = temp;
i++;
j--;
}
// Successfully computed the next permutation
return true;
}
// public static final int MOD = ((int) 1e9 + 7);
// public static final long MOD = 998244353L;
public static final long MOD = (long) 1e8;
public static final int INF = (int) 1e9;
/**
* ランレングス圧縮
*
* @param str
* @return Pair
*/
public static List<Pair<Character, Integer>> runLength(String str) {
var ret = new ArrayList<Pair<Character, Integer>>();
for (int i = 0; i < str.length(); i++) {
var cnt = 1;
while (i < str.length() - 1 && str.charAt(i) == str.charAt(i + 1)) {
i++;
cnt++;
}
ret.add(new Pair<Character, Integer>(str.charAt(i), cnt));
}
return ret;
}
/**
* 10進数からX進数の文字列に変換する。
*
* @MEMO 逆向きの変換はLong.parseUnsignedLong(String s, int radix)を利用する！
*
* @param n 変換元（１０進数）
* @param newBase 変換後の基数
* @return newBase変換後のString
*/
public static String convertBase10ToX(long n, int radix) {
if (n == 0L) return "0";
var sb = new StringBuilder();
while (n > 0) {
long r = n % (long) radix;
sb.insert(0, r);
n /= (long) radix;
}
return sb.toString();
}
public static int[] array(int size, int init) {
var array = new int[size];
fill(array, init);
return array;
}
public static int[] array(int size, IntUnaryOperator generator) {
var array = new int[size];
Arrays.setAll(array, generator);
return array;
}
public static char[] array(int size, char init) {
var array = new char[size];
fill(array, init);
return array;
}
public static char[][] array(int h, int w, char init) {
var array = new char[h][w];
for (char[] c : array) fill(c, init);
return array;
}
public static boolean[] array(int size, boolean init) {
var array = new boolean[size];
fill(array, init);
return array;
}
public static long[] array(int size, long init) {
var array = new long[size];
fill(array, init);
return array;
}
/**
* 先頭が0でそれ以外は初期値の配列を返却する
*
* @param size
* @param init
* @return
*/
public static int[] zeroArray(int size, int init) {
int[] array = new int[size];
fill(array, init);
array[0] = 0;
return array;
}
public static long[] zeropArray(int size, long init) {
var array = new long[size];
fill(array, init);
array[0] = 0L;
return array;
}
public static long gcd(long a, long b) {
if (b > a) {
long temp = a;
a = b;
b = temp;
}
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
public static long lcm(long a, long b) {
// NOTE オーバーフローに注意すること。
// オーバーフローのおそれがある場合は以下のような対応をとる
// if (a / g > INF / b) return INF;
// @see https://drken1215.hatenablog.com/entry/2023/11/21/020301
if (b > a) {
return b / gcd(a, b) * a;
} else {
return a / gcd(a, b) * b;
}
}
/**
* 負の数にも対応した%演算
*
* @param val
* @param mod
* @return
*/
public static long mod(long val, long mod) {
long res = val % mod;
if (res < 0) res += mod;
return res;
}
/**
* べき乗の計算
*/
public static final long pow(int a, int b) {
if (b == 0) return 1;
if (b % 2 == 1) return a * pow(a, (b - 1));
var half = pow(a, b / 2);
return half * half;
}
/**
* べき乗の計算
*/
public static final long pow(long a, long b) {
if (b == 0L) return 1L;
if (b % 2L == 1L) return a * pow(a, (b - 1L));
var half = pow(a, b / 2L);
return half * half;
}
/**
* べき乗 MOD 計算量 O(logN)
*
* @param val
* @param mod
* @return
*/
public static long modpow(long a, long b, long mod) {
if (b == 0L) return 1L;
if (b == 1L) return a % mod;
if (b % 2 == 1) return (a * modpow(a, b - 1L, mod)) % mod;
long temp = modpow(a, b / 2L, mod);
return (temp * temp) % mod;
}
public static int getKeata(int x) {
return String.valueOf(x).length();
}
public static int getKeata(long x) {
return String.valueOf(x).length();
}
/**
* Arras#binarySearchでは重複した場合の返却値が安定しないので、LowerBound版を作成
*
* 値が重複しないことが保証されている場合は速度的にArrays#binarySearchを使うこと。
*
* )* @param array
*
* @param key
* @return 存在する場合はインデックス 存在しない場合は-(挿入するポイント)-1(ビット反転[~]すればもどる)
*/
public static int binarySearchLowerBound(int[] array, int key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while (ok - ng > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] >= key) {
ok = mid;
} else {
ng = mid;
}
}
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchLowerBound(long[] array, long key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while (ok - ng > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] >= key) {
ok = mid;
} else {
ng = mid;
}
}
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchUpperBound(int[] array, int key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while ((ok - ng) > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] > key) {
ok = mid;
} else {
ng = mid;
}
}
if (ng == -1) return -1;// 探索内で大きいものが見つからなかったとき
if (array[ng] == key) return ng;// 最後の値がkeyと同じ値の場合は最後の値を利用する
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchUpperBound(long[] array, long key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while ((ok - ng) > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] > key) {
ok = mid;
} else {
ng = mid;
}
}
if (ng == -1) return -1;// 探索内で大きいものが見つからなかったとき
if (array[ng] == key) return ng;// 最後の値がkeyと同じ値の場合は最後の値を利用する
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
/*--- ---*/
/*--- Util ---*/
/*--- ---*/
public static List<Integer> toList(int[] a) {
return Arrays.stream(a).boxed().collect(Collectors.toList());
}
public static List<Long> toList(long[] a) {
return Arrays.stream(a).boxed().collect(Collectors.toList());
}
public static String reverse(String str) {
return new StringBuilder().append(str).reverse().toString();
}
public static boolean isKaibun(String str) {
return str.equals(reverse(str));
}
public static String toString(int a) {
return String.valueOf(a);
}
public static String toString(long a) {
return String.valueOf(a);
}
public static String toString(char[] a) {
return String.valueOf(a);
}
public static int toInt(String a) {
return Integer.valueOf(a);
}
public static long toLong(String a) {
return Long.valueOf(a);
}
public static char[] toCharArray(int a) {
return String.valueOf(a).toCharArray();
}
public static char[] toCharArray(long a) {
return String.valueOf(a).toCharArray();
}
public static char[] toCharArray(String a) {
return a.toCharArray();
}
public static boolean isAllTrue(boolean[] boo) {
for (boolean b : boo) {
if (!b) return false;
}
return true;
}
public static int cntBoolean(boolean[] boo) {
int cnt = 0;
for (boolean b : boo) {
if (b) cnt++;
}
return cnt;
}
public static void sort(int[] a) {
Arrays.sort(a);
}
public static void sort(long[] a) {
Arrays.sort(a);
}
public static int abs(int a, int b) {
return Math.abs(a - b);
}
public static long abs(long a, long b) {
return Math.abs(a - b);
}
/**
* int配列を降順にソートする
*/
public static void sortDes(int[] a) {
Arrays.sort(a);
var temp = Arrays.copyOf(a, a.length);
for (int i = 0; i < temp.length; i++) {
a[i] = temp[temp.length - i - 1];
}
}
/**
* long配列を降順にソートする
*/
public static void sortDes(long[] a) {
Arrays.sort(a);
var temp = Arrays.copyOf(a, a.length);
for (int i = 0; i < temp.length; i++) {
a[i] = temp[temp.length - i - 1];
}
}
public static void fill(int[] array, int val) {
Arrays.fill(array, val);
}
public static void fill(char[] array, char val) {
Arrays.fill(array, val);
}
public static void fill(boolean[] array, boolean val) {
Arrays.fill(array, val);
}
public static void fill(int[][] array, int val) {
for (var a : array) Arrays.fill(a, val);
}
public static void fill(long[] array, long val) {
Arrays.fill(array, val);
}
public static void fill(long[][] array, long val) {
for (var a : array) Arrays.fill(a, val);
}
public static void initalizeDp(int[][] dp, int val) {
fill(dp, val);
dp[0][0] = 0;
}
public static void initalizeDp(long[][] dp, long val) {
fill(dp, val);
dp[0][0] = 0L;
}
public static int max(int... array) {
return Arrays.stream(array).max().getAsInt();
}
public static int sum(int... array) {
return Arrays.stream(array).sum();
}
public static int max(int a, int b) {
return Math.max(a, b);
}
public static int min(int... array) {
return Arrays.stream(array).min().getAsInt();
}
public static int min(int a, int b) {
return Math.min(a, b);
}
public static long max(long... array) {
return Arrays.stream(array).max().getAsLong();
}
public static long max(long a, long b) {
return Math.max(a, b);
}
public static long sum(long... array) {
return Arrays.stream(array).sum();
}
public static long min(long a, long b) {
return Math.min(a, b);
}
public static long min(long... array) {
return Arrays.stream(array).min().getAsLong();
}
/*--- ---*/
/*--- debug ---*/
/*--- ---*/
public static void debug(Object o, Object... args) {
var format = "%s";
var temp = new Object[args.length + 1];
temp[0] = o;
System.arraycopy(args, 0, temp, 1, args.length);
for (int i = 0; i < temp.length - 1; i++) {
format += " %s";
}
System.out.printf(format, temp);
System.out.println("");
}
public static void debug(int[] x) {
out(Arrays.toString(x));
}
public static void debug(boolean[] x) {
out(Arrays.toString(x));
}
public static void debug(long[] x) {
out(Arrays.toString(x));
}
public static void debug(char[] x) {
out(String.valueOf(x));
}
public static void debug(int[][] x) {
out(Arrays.deepToString(x));
}
public static void debugln(int[][] x) {
for (int[] w : x) {
for (var i : w) {
System.err.print(i + " ");
}
out("");
}
out("///////////////////");
}
public static void debug(long[][] x) {
out(Arrays.deepToString(x));
}
public static void debugln(long[][] x) {
for (long[] w : x) {
for (var i : w) {
System.err.print(i + " ");
}
out("");
}
out("///////////////////");
}
public static void debug(boolean[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(char[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(Object[] x) {
out(Arrays.toString(x));
}
public static void debug(Object[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(Object a) {
System.err.println(a);
}
public static void out(String x) {
System.err.println(x);
}
final static ContestPrinter pw = new ContestPrinter();
final static FastScanner sc = new FastScanner();
public static void main(String[] args) {
solve();
pw.close();
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[ptr++];
else
return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public Point nextPoint() {
return new Point(nextInt(), nextInt());
}
public Point[] nextPointArray(int size) {
Point[] array = new Point[size];
Arrays.setAll(array, i -> new Point(nextInt(), nextInt()));
return array;
}
public List<Point> nextPointList(int size) {
List<Point> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(new Point(nextInt(), nextInt()));
return list;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public int[] nextIntArray(int size) {
int[] intArray = new int[size];
Arrays.setAll(intArray, i -> nextInt());
return intArray;
}
public int[] nextIntArray(int size, IntUnaryOperator map) {
int[] intArray = new int[size];
Arrays.setAll(intArray, i -> map.applyAsInt(nextInt()));
return intArray;
}
public int[] nextIntArrayOneToZeroIndex(int size) {
return nextIntArray(size, i -> i - 1);
}
public long[] nextLongArray(int size) {
long[] longArray = new long[size];
Arrays.setAll(longArray, i -> nextLong());
return longArray;
}
public long[] nextLongArray(int size, LongUnaryOperator map) {
long[] longArray = new long[size];
Arrays.setAll(longArray, i -> map.applyAsLong(nextLong()));
return longArray;
}
public String[] nextStringArray(int size) {
String[] stringArray = new String[size];
Arrays.setAll(stringArray, i -> next());
return stringArray;
}
public List<String> nextStringList(int size) {
List<String> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(next());
return list;
}
public Integer[] nextIntegerArray(int size) {
Integer[] ret = new Integer[size];
for (int i = 0; i < size; i++) ret[i] = nextInt();
return ret;
}
public Integer[] nextIntegerArray(int size, IntUnaryOperator map) {
Integer[] ret = new Integer[size];
for (int i = 0; i < size; i++) ret[i] = map.applyAsInt(nextInt());
return ret;
}
public char[][] nextDimensionalCharArray(int h, int w) {
char[][] array = new char[h][w];
for (int i = 0; i < h; i++) {
array[i] = next().toCharArray();
}
return array;
}
public int[][] nextDimensionalIntArray(int h, int w) {
int[][] array = new int[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
array[i][j] = nextInt();
}
}
return array;
}
public long[][] nextDimensionaLongArray(int h, int w) {
long[][] array = new long[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
array[i][j] = nextLong();
}
}
return array;
}
public int[][] nextIntArrayFromStr(int h, int w) {
int[][] array = new int[h][w];
for (int i = 0; i < h; i++) {
String temp = next();
for (int j = 0; j < w; j++) {
array[i][j] = temp.charAt(j) - '0';
}
}
return array;
}
public List<Integer> nextIntgerList(int size) {
List<Integer> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(nextInt());
return list;
}
public List<Integer> nextIntgerList(int size, IntUnaryOperator map) {
List<Integer> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(map.applyAsInt(nextInt()));
return list;
}
}
class ContestPrinter extends java.io.PrintWriter {
public ContestPrinter(java.io.PrintStream stream) {
super(stream);
}
public ContestPrinter(java.io.File file) throws java.io.FileNotFoundException {
super(new java.io.PrintStream(file));
}
public ContestPrinter() {
super(System.out);
}
private static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if (x < 0) {
sb.append('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
sb.append((long) x);
sb.append(".");
x -= (long) x;
for (int i = 0; i < n; i++) {
x *= 10;
sb.append((int) x);
x -= (int) x;
}
return sb.toString();
}
@Override
public void print(float f) {
super.print(dtos(f, 20));
}
@Override
public void println(float f) {
super.println(dtos(f, 20));
}
@Override
public void print(double d) {
super.print(dtos(d, 20));
}
@Override
public void println(double d) {
super.println(dtos(d, 20));
}
@Override
public void print(boolean boo) {
super.print(boo ? "Yes" : "No");
}
public void print(int[] array, String separator) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n - 1]);
}
public void print(int[] array) {
this.print(array, " ");
}
public void print(int[] array, String separator, java.util.function.IntUnaryOperator map) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(map.applyAsInt(array[i]));
super.print(separator);
}
super.println(map.applyAsInt(array[n - 1]));
}
public void print(int[] array, java.util.function.IntUnaryOperator map) {
this.print(array, " ", map);
}
public void print(long[] array, String separator) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n - 1]);
}
public void print(long[] array) {
this.print(array, " ");
}
public void print(long[] array, String separator, java.util.function.LongUnaryOperator map) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(map.applyAsLong(array[i]));
super.print(separator);
}
super.println(map.applyAsLong(array[n - 1]));
}
public void print(long[] array, java.util.function.LongUnaryOperator map) {
this.print(array, " ", map);
}
public <T> void print(T[] array, String separator) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n - 1]);
}
public <T> void print(T[] array) {
this.print(array, " ");
}
public <T> void print(T[] array, String separator, java.util.function.UnaryOperator<T> map) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(map.apply(array[i]));
super.print(separator);
}
super.println(map.apply(array[n - 1]));
}
public <T> void print(T[] array, java.util.function.UnaryOperator<T> map) {
this.print(array, " ", map);
}
public String getOutputCollection(Collection<?> c) {
return String.join(" ", c.stream().map(String::valueOf).collect(Collectors.toList()));
}
public void print(Collection<?> c) {
super.print(getOutputCollection(c));
}
public void println(Collection<?> c) {
StringBuilder sb = new StringBuilder();
for (Object object : c) {
// java 15以下の環境だとisEmptyがコンパイルしない
// if (!sb.isEmpty()) sb.append("\r\n");
if (sb.length() != 0) sb.append("\r\n");
sb.append(object);
}
System.out.println(sb);
}
public void println(int[] array) {
print(array, "\r\n");
}
public void println(long[] array) {
print(array, "\r\n");
}
public void print(String[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (String str : a) {
joiner.add(str);
}
System.out.println(joiner);
}
public void println(String[] a) {
StringJoiner joiner = new StringJoiner("\r\n");
for (String str : a) {
joiner.add(str);
}
System.out.println(joiner);
}
public void print(Object obj) {
System.out.print(obj);
}
public void println(Object obj) {
System.out.println(obj);
}
public void printlnDeep(ArrayList<ArrayList<Integer>> c) {
StringBuilder sb = new StringBuilder();
for (var ci : c) sb.append(getOutputCollection(ci)).append("\r\n");
System.out.println(sb);
}
public void printZeroToOneIndex(int[] a) {
print(a, i -> i + 1);
}
public void printZeroToOneIndex(long[] a) {
print(a, i -> i + 1);
}
public void printZeroToOneIndex(List<Integer> a) {
print(a.stream().map(i -> i + 1).collect(Collectors.toList()));
}
public void printlnZeroToOneIndex(List<Integer> a) {
println(a.stream().map(i -> i + 1).collect(Collectors.toList()));
}
public void print(boolean[] a) {
for (int i = 0; i < a.length; i++) {
System.out.println(a[i] + " ");
}
System.out.println("");
}
public void print(boolean[][] b) {
for (int i = 0; i < b.length; i++) {
for (int j = 0; j < b[0].length; j++) {
System.out.print(b[i][j] ? "o" : "x");
}
System.out.println("");
}
}
public void print(int[][] array) {
for (var i : array) print(i);
}
public void print(long[][] array) {
for (var i : array) print(i);
}
public void print(char[][] array) {
for (char[] cs : array) {
for (char c : cs) {
print(c);
}
println();
}
}
}
class Graph {
List<ArrayList<Integer>> g;
int v;
int e;
boolean[] visited;
public Graph(int v) {
this.v = v;
for (var i = 0; i < v; i++) g.add(new ArrayList<Integer>());
visited = new boolean[v];
}
public void addEdge(int a, int b) {
g.get(a).add(b);
g.get(b).add(a);
e++;
}
public void dfs(int now) {
visited[now] = true;
for (var next : g.get(now)) {
if (visited[next]) continue;
dfs(next);
}
}
public boolean marked(int now) {
return visited[now];
}
public boolean isAllConected() {
for (var bo : visited) {
if (!bo) return false;
}
return true;
}
}
/**
* 先頭及び末尾への挿入がO（1）かつ、ランダムアクセスもO(1)で可能なデータ構造の自作クラス
*/
class ContestDeque<E> implements Iterable<E> {
private List<E> stack;
private List<E> que;
public ContestDeque() {
stack = new ArrayList<E>();
que = new ArrayList<E>();
}
public E get(int i) {
if (i < stack.size()) {
return stack.get(stack.size() - i - 1);
} else {
return que.get(i - stack.size());
}
}
public E remove(int i) {
E e;
if (i < stack.size()) {
e = stack.remove(stack.size() - i - 1);
} else {
e = que.remove(i - stack.size());
}
return e;
}
public void addFirst(E e) {
stack.add(e);
}
public void addLast(E e) {
que.add(e);
}
public void set(int i, E e) {
if (i < stack.size()) {
e = stack.set(stack.size() - i - 1, e);
} else {
e = que.set(i - stack.size(), e);
}
}
public int size() {
return stack.size() + que.size();
}
public boolean isEmpty() {
return size() == 0;
}
@Override
public String toString() {
var temp = new ArrayList<E>();
for (int i = stack.size() - 1; i >= 0; i--) {
temp.add(stack.get(i));
}
temp.addAll(que);
return String.join(" ", temp.stream().map(String::valueOf).collect(Collectors.toList()));
}
public Iterator<E> iterator() {
return new ContestDequeIterator();
}
private class ContestDequeIterator implements Iterator<E> {
private int i = 0;
public boolean hasNext() {
return i < size();
}
public E next() {
i++;
return get(i);
}
}
}
/**
* ｘｙの二次元の座標クラス ユークリッド距離が算出可能
*/
class Point implements Comparable<Point> {
long x;
long y;
Point(long x, long y) {
this.x = x;
this.y = y;
}
/**
* 距離を求める。ただし値は平方根を付ける前
*
* @param Point
* @return long 平方根を付ける前の距離
*/
public long dist(Point target) {
return (long) (x - target.x) * (x - target.x) + (y - target.y) * (y - target.y);
}
@Override
public int compareTo(Point o) {
return (int) (x == o.x ? y - o.y : x - o.x);
}
@Override
public int hashCode() {
return (int) (x + y) * 31;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof Point)) return false;
Point p = (Point) o;
return x == p.x && y == p.y;
}
@Override
public String toString() {
return String.format("(%s %s)", x, y);
}
}
/**
* グリッド上のカーソルを扱うクラス
*
*/
class GridCursor implements Comparable<GridCursor> {
int h;
int w;
static char[][] input = null;
static int maxH = -1;
static int maxW = -1;
static char OBSTACLE = '#';
static final int[][] directions8 = { { 1, 0 }, { 1, -1 }, { 1, 1 }, { -1, 0 }, { -1, 1 }, { -1, -1 }, { 0, 1 },
{ 0, -1 } };
static final int[][] directions4 = { { 1, 0 }, { -1, 0 }, { 0, 1 }, { 0, -1 } };
public boolean isInnner() {
if (maxH < 0 || maxW < 0) {
throw new IllegalStateException("h/w is not initialized!");
}
return h >= 0 && h < maxH && w >= 0 && w < maxW;
}
public GridCursor(int h, int w) {
this.h = h;
this.w = w;
}
public GridCursor(int h, int w, char[][] input) {
this.h = h;
this.w = w;
GridCursor.input = input;
maxH = input.length;
maxW = input[0].length;
}
public GridCursor(int h, int w, int maxH, int maxW) {
this.h = h;
this.w = w;
// MEMO staticのものを設定するのも微妙な気がする
GridCursor.maxH = maxH;
GridCursor.maxW = maxW;
}
public boolean move(char ch) {
// MEMO enumにするべききもするが自分しか利用しないのでそのままとする
if (ch != 'R' && ch != 'L' && ch != 'D' && ch != 'U') {
throw new IllegalArgumentException("move method only allows R/L/D/U");
}
if (maxH < 0 || maxW < 0) {
throw new IllegalStateException("h/w is not initialized!");
}
var nh = h;
var nw = w;
if (ch == 'R') nw++;
if (ch == 'L') nw--;
if (ch == 'D') nh++;
if (ch == 'U') nh--;
if (!(nh >= 0 && nw >= 0 && nh < maxH && nw < maxW)) return false;
if (input != null && input[nh][nw] == OBSTACLE) return false;
h = nh;
w = nw;
return true;
}
@Override
public int compareTo(GridCursor o) {
return (int) (h == o.h ? w - o.w : h - o.h);
}
@Override
public int hashCode() {
return (h + w) * 31;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof GridCursor)) return false;
GridCursor g = (GridCursor) o;
return h == g.h && w == g.w;
}
@Override
public String toString() {
return String.format("(%s %s)", h, w);
}
}
class Pair<S extends Comparable<S>, T extends Comparable<T>> implements Comparable<Pair<S, T>> {
S first;
T second;
public Pair(S s, T t) {
first = s;
second = t;
}
public S getFirst() {
return first;
}
public T getSecond() {
return second;
}
public boolean equals(Object another) {
if (this == another) return true;
if (!(another instanceof Pair)) return false;
Pair otherPair = (Pair) another;
return this.first.equals(otherPair.first) && this.second.equals(otherPair.second);
}
public int compareTo(Pair<S, T> another) {
java.util.Comparator<Pair<S, T>> comp1 = java.util.Comparator.comparing(Pair::getFirst);
java.util.Comparator<Pair<S, T>> comp2 = comp1.thenComparing(Pair::getSecond);
return comp2.compare(this, another);
}
public int hashCode() {
return first.hashCode() * 10007 + second.hashCode();
}
public String toString() {
return String.format("%s %s", first, second);
}
}
/**
* 辺のクラス
*
* @author ritoAtCoder
*
*/
class Edge implements Comparable<Edge> {
int from;
int to;
int cost;
Edge(int from, int to, int cost) {
this.from = from;
this.to = to;
this.cost = cost;
}
@Override
public int compareTo(Edge that) {
// java.util.Comparator<Pair<S, T>> comp1 = java.util.Comparator.comparing(Pair::getFirst);
// java.util.Comparator<Pair<S, T>> comp2 = comp1.thenComparing(Pair::getSecond);
// return comp2.compare(this, another);
// Integer.compare(cost, e.cost).th
int c = Integer.compare(this.cost, that.cost);
if (c == 0) c = Integer.compare(this.to, that.to);
if (c == 0) c = Integer.compare(this.from, that.from);
return c;
// return cost - e.cost != 0 ? cost - e.cost : (to - e.to != 0 ? to - e.to : from - e.from);
}
@Override
public int hashCode() {
return (from + to + cost) * 17;
}
@Override
public String toString() {
return String.format("%s -> %s (%s) ", from, to, cost);
}
@Override
public boolean equals(Object another) {
if (!(another instanceof Edge)) return false;
if (this == another) return true;
Edge o = (Edge) another;
return from == o.from && to == o.to && cost == o.cost;
}
}
class UnionFind {
int[] parent, rank, size, minNode;
int componentSize;// 連結成分の個数
int[] value;// ノードごとに値を持ちたいとき。直接設定する
public UnionFind(int n) {
parent = new int[n];
rank = new int[n];
size = new int[n];// ノード内に含まれる数
minNode = new int[n];
value = new int[n];
for (int i = 0; i < n; i++) {
parent[i] = i;
rank[i] = 0;// 0始まりとする
size[i] = 1;
minNode[i] = i;
}
componentSize = n;
}
public void clear() {
int n = parent.length;
parent = new int[n];
rank = new int[n];
size = new int[n];// ノード内に含まれる数
minNode = new int[n];
value = new int[n];
for (int i = 0; i < n; i++) {
parent[i] = i;
rank[i] = 0;// 0始まりとする
size[i] = 1;
minNode[i] = i;
}
componentSize = n;
}
public int root(int x) {
if (parent[x] == x) return x;
return parent[x] = root(parent[x]);// 経路圧縮
}
public boolean isConneted(int x, int y) {
return root(x) == root(y);
}
public boolean union(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
// ランクが高い方を常にx側で持つ
if (rank[x] < rank[y]) {
int temp = x;
x = y;
y = temp;
}
parent[y] = x;
if (rank[x] == rank[y]) rank[x]++;
size[x] += size[y];
minNode[x] = Math.min(minNode[x], minNode[y]);
value[x] += value[y];
componentSize--;
return true;
}
public int getSize(int x) {
return size[root(x)];
}
public int getMinNode(int x) {
return minNode[root(x)];
}
public int getComponentSize() {
return componentSize;
}
public int getValue(int x) {
return value[root(x)];
}
@Override
public String toString() {
return Arrays.toString(parent);
}
}
| ConDefects/ConDefects/Code/abc334_b/Java/53551925 |
condefects-java_data_989 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long a = sc.nextLong();
long m = sc.nextLong();
long l = sc.nextLong();
long r = sc.nextLong();
long d = 0-a;
l+=d;
r+=d;
long ans = 0;
if(r>0 && l<0) {
ans+=r/m;
ans+=Math.abs(l)/m;
ans++;
}else if(r>0 && l>0) {
ans+=r/m;
ans-=l/m;
if(l%m==0) {
ans++;
}
}else if(r<0 && l<0) {
long tr = -1*l;
long tl = -1*r;
ans+=tr/m;
ans-=tl/m;
if(l%m==0) {
ans++;
}
}else if(r==0){
ans+=Math.abs(l)/m;
ans++;
}else {
ans+=r/m;
ans++;
}
System.out.println(ans);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long a = sc.nextLong();
long m = sc.nextLong();
long l = sc.nextLong();
long r = sc.nextLong();
long d = 0-a;
l+=d;
r+=d;
long ans = 0;
if(r>0 && l<0) {
ans+=r/m;
ans+=Math.abs(l)/m;
ans++;
}else if(r>0 && l>0) {
ans+=r/m;
ans-=l/m;
if(l%m==0) {
ans++;
}
}else if(r<0 && l<0) {
long tr = -1*l;
long tl = -1*r;
ans+=tr/m;
ans-=tl/m;
if(tl%m==0) {
ans++;
}
}else if(r==0){
ans+=Math.abs(l)/m;
ans++;
}else {
ans+=r/m;
ans++;
}
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc334_b/Java/54270485 |
condefects-java_data_990 | import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Iterator;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.StringJoiner;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
public class Main {
static void solve() {
var a = sc.nextLong();
var m = sc.nextLong();
var l = sc.nextLong();
var r = sc.nextLong();
l -= a;
r -= a;
var X = (((long) 1e18) / m) + 100L;
l += m * X;
r += m * X;
pw.println((r / m - (l - 1) / m));
}
static void swap(int[] array, int i, int j) {
int temp = array[i];
array[j] = array[i];
array[i] = temp;
}
static void swap(long[] array, int i, int j) {
long temp = array[i];
array[j] = array[i];
array[i] = temp;
}
static void swap(char[] array, int i, int j) {
char temp = array[i];
array[j] = array[i];
array[i] = temp;
}
static String swap(String str, int i, int j) {
var temp = str.toCharArray();
var taihi = temp[i];
temp[i] = temp[j];
temp[j] = taihi;
return toString(temp);
}
/*
* エラトステネスの篩 nまでの素数の配列を返却する
*
*/
public static boolean[] getEratostheses(int n) {
boolean[] isPrimes = new boolean[n + 1];
Arrays.fill(isPrimes, true);
isPrimes[0] = isPrimes[1] = false;
var root = Math.sqrt(isPrimes.length);
for (int i = 0; i < root; i++) {
if (!isPrimes[i]) continue;
for (int j = i * i; j < isPrimes.length; j += i) {// iでインクリメントし)ているのポイント
isPrimes[j] = false;
}
}
return isPrimes;
}
public static List<Integer> getPrimeList(int n) {
var list = new ArrayList<Integer>();
var primes = getEratostheses(n);
for (var i = 0; i < n; i++) {
if (primes[i]) list.add(i);
}
return list;
}
public static boolean isPrime(long a) {
if (a == 1) return false;
if (a == 2) return true;
if (a % 2 == 0) return false;
var rootA = (int) Math.sqrt(a);
for (int i = 3; i <= rootA; i += 2) {
if (a % i == 0) return false;
}
return true;
}
/**
* 素因数分解の結果を返却する １は含まれないことに注意
*
* @param x
* @return 素因数分解の結果
*/
public static List<Integer> primeFactorize(int x) {
var ret = new ArrayList<Integer>();
for (int i = 2; i <= (int) Math.sqrt(x); i++) {
if (x % i == 0) {
while (x % i == 0) {
ret.add(i);
x /= i;
}
}
}
if (x != 1) {
ret.add(x);
}
return ret;
}
/**
* 次の順列にする。 MEMO: 利用の場合はもとが昇順でソートしているか確認すること
*
* ) @param array )*
*
* @return boolean 次の順列がある
*/
static boolean nextPermutation(int[] array) {
// Find longest non-increasing suffix
int i = array.length - 1;
while (i > 0 && array[i - 1] >= array[i])
i--;
// Now i is the head index of the suffix
// Are we at the last permutation already?
if (i <= 0) return false;
// Let array[i - 1] be the pivot
// Find rightmost element greater than the pivot
int j = array.length - 1;
while (array[j] <= array[i - 1])
j--;
// Now the value array[j] will become the new pivot
// Assertion: j >= i
// Swap the pivot with j
int temp = array[i - 1];
array[i - 1] = array[j];
array[j] = temp;
// Reverse the suffix
j = array.length - 1;
while (i < j) {
temp = array[i];
array[i] = array[j];
array[j] = temp;
i++;
j--;
}
// Successfully computed the next permutation
return true;
}
// public static final int MOD = ((int) 1e9 + 7);
// public static final long MOD = 998244353L;
public static final long MOD = (long) 1e8;
public static final int INF = (int) 1e9;
/**
* ランレングス圧縮
*
* @param str
* @return Pair
*/
public static List<Pair<Character, Integer>> runLength(String str) {
var ret = new ArrayList<Pair<Character, Integer>>();
for (int i = 0; i < str.length(); i++) {
var cnt = 1;
while (i < str.length() - 1 && str.charAt(i) == str.charAt(i + 1)) {
i++;
cnt++;
}
ret.add(new Pair<Character, Integer>(str.charAt(i), cnt));
}
return ret;
}
/**
* 10進数からX進数の文字列に変換する。
*
* @MEMO 逆向きの変換はLong.parseUnsignedLong(String s, int radix)を利用する！
*
* @param n 変換元（１０進数）
* @param newBase 変換後の基数
* @return newBase変換後のString
*/
public static String convertBase10ToX(long n, int radix) {
if (n == 0L) return "0";
var sb = new StringBuilder();
while (n > 0) {
long r = n % (long) radix;
sb.insert(0, r);
n /= (long) radix;
}
return sb.toString();
}
public static int[] array(int size, int init) {
var array = new int[size];
fill(array, init);
return array;
}
public static int[] array(int size, IntUnaryOperator generator) {
var array = new int[size];
Arrays.setAll(array, generator);
return array;
}
public static char[] array(int size, char init) {
var array = new char[size];
fill(array, init);
return array;
}
public static char[][] array(int h, int w, char init) {
var array = new char[h][w];
for (char[] c : array) fill(c, init);
return array;
}
public static boolean[] array(int size, boolean init) {
var array = new boolean[size];
fill(array, init);
return array;
}
public static long[] array(int size, long init) {
var array = new long[size];
fill(array, init);
return array;
}
/**
* 先頭が0でそれ以外は初期値の配列を返却する
*
* @param size
* @param init
* @return
*/
public static int[] zeroArray(int size, int init) {
int[] array = new int[size];
fill(array, init);
array[0] = 0;
return array;
}
public static long[] zeropArray(int size, long init) {
var array = new long[size];
fill(array, init);
array[0] = 0L;
return array;
}
public static long gcd(long a, long b) {
if (b > a) {
long temp = a;
a = b;
b = temp;
}
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
public static long lcm(long a, long b) {
// NOTE オーバーフローに注意すること。
// オーバーフローのおそれがある場合は以下のような対応をとる
// if (a / g > INF / b) return INF;
// @see https://drken1215.hatenablog.com/entry/2023/11/21/020301
if (b > a) {
return b / gcd(a, b) * a;
} else {
return a / gcd(a, b) * b;
}
}
/**
* 負の数にも対応した%演算
*
* @param val
* @param mod
* @return
*/
public static long mod(long val, long mod) {
long res = val % mod;
if (res < 0) res += mod;
return res;
}
/**
* べき乗の計算
*/
public static final long pow(int a, int b) {
if (b == 0) return 1;
if (b % 2 == 1) return a * pow(a, (b - 1));
var half = pow(a, b / 2);
return half * half;
}
/**
* べき乗の計算
*/
public static final long pow(long a, long b) {
if (b == 0L) return 1L;
if (b % 2L == 1L) return a * pow(a, (b - 1L));
var half = pow(a, b / 2L);
return half * half;
}
/**
* べき乗 MOD 計算量 O(logN)
*
* @param val
* @param mod
* @return
*/
public static long modpow(long a, long b, long mod) {
if (b == 0L) return 1L;
if (b == 1L) return a % mod;
if (b % 2 == 1) return (a * modpow(a, b - 1L, mod)) % mod;
long temp = modpow(a, b / 2L, mod);
return (temp * temp) % mod;
}
public static int getKeata(int x) {
return String.valueOf(x).length();
}
public static int getKeata(long x) {
return String.valueOf(x).length();
}
/**
* Arras#binarySearchでは重複した場合の返却値が安定しないので、LowerBound版を作成
*
* 値が重複しないことが保証されている場合は速度的にArrays#binarySearchを使うこと。
*
* )* @param array
*
* @param key
* @return 存在する場合はインデックス 存在しない場合は-(挿入するポイント)-1(ビット反転[~]すればもどる)
*/
public static int binarySearchLowerBound(int[] array, int key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while (ok - ng > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] >= key) {
ok = mid;
} else {
ng = mid;
}
}
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchLowerBound(long[] array, long key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while (ok - ng > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] >= key) {
ok = mid;
} else {
ng = mid;
}
}
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchUpperBound(int[] array, int key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while ((ok - ng) > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] > key) {
ok = mid;
} else {
ng = mid;
}
}
if (ng == -1) return -1;// 探索内で大きいものが見つからなかったとき
if (array[ng] == key) return ng;// 最後の値がkeyと同じ値の場合は最後の値を利用する
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchUpperBound(long[] array, long key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while ((ok - ng) > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] > key) {
ok = mid;
} else {
ng = mid;
}
}
if (ng == -1) return -1;// 探索内で大きいものが見つからなかったとき
if (array[ng] == key) return ng;// 最後の値がkeyと同じ値の場合は最後の値を利用する
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
/*--- ---*/
/*--- Util ---*/
/*--- ---*/
public static List<Integer> toList(int[] a) {
return Arrays.stream(a).boxed().collect(Collectors.toList());
}
public static List<Long> toList(long[] a) {
return Arrays.stream(a).boxed().collect(Collectors.toList());
}
public static String reverse(String str) {
return new StringBuilder().append(str).reverse().toString();
}
public static boolean isKaibun(String str) {
return str.equals(reverse(str));
}
public static String toString(int a) {
return String.valueOf(a);
}
public static String toString(long a) {
return String.valueOf(a);
}
public static String toString(char[] a) {
return String.valueOf(a);
}
public static int toInt(String a) {
return Integer.valueOf(a);
}
public static long toLong(String a) {
return Long.valueOf(a);
}
public static char[] toCharArray(int a) {
return String.valueOf(a).toCharArray();
}
public static char[] toCharArray(long a) {
return String.valueOf(a).toCharArray();
}
public static char[] toCharArray(String a) {
return a.toCharArray();
}
public static boolean isAllTrue(boolean[] boo) {
for (boolean b : boo) {
if (!b) return false;
}
return true;
}
public static int cntBoolean(boolean[] boo) {
int cnt = 0;
for (boolean b : boo) {
if (b) cnt++;
}
return cnt;
}
public static void sort(int[] a) {
Arrays.sort(a);
}
public static void sort(long[] a) {
Arrays.sort(a);
}
public static int abs(int a, int b) {
return Math.abs(a - b);
}
public static long abs(long a, long b) {
return Math.abs(a - b);
}
/**
* int配列を降順にソートする
*/
public static void sortDes(int[] a) {
Arrays.sort(a);
var temp = Arrays.copyOf(a, a.length);
for (int i = 0; i < temp.length; i++) {
a[i] = temp[temp.length - i - 1];
}
}
/**
* long配列を降順にソートする
*/
public static void sortDes(long[] a) {
Arrays.sort(a);
var temp = Arrays.copyOf(a, a.length);
for (int i = 0; i < temp.length; i++) {
a[i] = temp[temp.length - i - 1];
}
}
public static void fill(int[] array, int val) {
Arrays.fill(array, val);
}
public static void fill(char[] array, char val) {
Arrays.fill(array, val);
}
public static void fill(boolean[] array, boolean val) {
Arrays.fill(array, val);
}
public static void fill(int[][] array, int val) {
for (var a : array) Arrays.fill(a, val);
}
public static void fill(long[] array, long val) {
Arrays.fill(array, val);
}
public static void fill(long[][] array, long val) {
for (var a : array) Arrays.fill(a, val);
}
public static void initalizeDp(int[][] dp, int val) {
fill(dp, val);
dp[0][0] = 0;
}
public static void initalizeDp(long[][] dp, long val) {
fill(dp, val);
dp[0][0] = 0L;
}
public static int max(int... array) {
return Arrays.stream(array).max().getAsInt();
}
public static int sum(int... array) {
return Arrays.stream(array).sum();
}
public static int max(int a, int b) {
return Math.max(a, b);
}
public static int min(int... array) {
return Arrays.stream(array).min().getAsInt();
}
public static int min(int a, int b) {
return Math.min(a, b);
}
public static long max(long... array) {
return Arrays.stream(array).max().getAsLong();
}
public static long max(long a, long b) {
return Math.max(a, b);
}
public static long sum(long... array) {
return Arrays.stream(array).sum();
}
public static long min(long a, long b) {
return Math.min(a, b);
}
public static long min(long... array) {
return Arrays.stream(array).min().getAsLong();
}
/*--- ---*/
/*--- debug ---*/
/*--- ---*/
public static void debug(Object o, Object... args) {
var format = "%s";
var temp = new Object[args.length + 1];
temp[0] = o;
System.arraycopy(args, 0, temp, 1, args.length);
for (int i = 0; i < temp.length - 1; i++) {
format += " %s";
}
System.out.printf(format, temp);
System.out.println("");
}
public static void debug(int[] x) {
out(Arrays.toString(x));
}
public static void debug(boolean[] x) {
out(Arrays.toString(x));
}
public static void debug(long[] x) {
out(Arrays.toString(x));
}
public static void debug(char[] x) {
out(String.valueOf(x));
}
public static void debug(int[][] x) {
out(Arrays.deepToString(x));
}
public static void debugln(int[][] x) {
for (int[] w : x) {
for (var i : w) {
System.err.print(i + " ");
}
out("");
}
out("///////////////////");
}
public static void debug(long[][] x) {
out(Arrays.deepToString(x));
}
public static void debugln(long[][] x) {
for (long[] w : x) {
for (var i : w) {
System.err.print(i + " ");
}
out("");
}
out("///////////////////");
}
public static void debug(boolean[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(char[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(Object[] x) {
out(Arrays.toString(x));
}
public static void debug(Object[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(Object a) {
System.err.println(a);
}
public static void out(String x) {
System.err.println(x);
}
final static ContestPrinter pw = new ContestPrinter();
final static FastScanner sc = new FastScanner();
public static void main(String[] args) {
solve();
pw.close();
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[ptr++];
else
return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public Point nextPoint() {
return new Point(nextInt(), nextInt());
}
public Point[] nextPointArray(int size) {
Point[] array = new Point[size];
Arrays.setAll(array, i -> new Point(nextInt(), nextInt()));
return array;
}
public List<Point> nextPointList(int size) {
List<Point> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(new Point(nextInt(), nextInt()));
return list;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public int[] nextIntArray(int size) {
int[] intArray = new int[size];
Arrays.setAll(intArray, i -> nextInt());
return intArray;
}
public int[] nextIntArray(int size, IntUnaryOperator map) {
int[] intArray = new int[size];
Arrays.setAll(intArray, i -> map.applyAsInt(nextInt()));
return intArray;
}
public int[] nextIntArrayOneToZeroIndex(int size) {
return nextIntArray(size, i -> i - 1);
}
public long[] nextLongArray(int size) {
long[] longArray = new long[size];
Arrays.setAll(longArray, i -> nextLong());
return longArray;
}
public long[] nextLongArray(int size, LongUnaryOperator map) {
long[] longArray = new long[size];
Arrays.setAll(longArray, i -> map.applyAsLong(nextLong()));
return longArray;
}
public String[] nextStringArray(int size) {
String[] stringArray = new String[size];
Arrays.setAll(stringArray, i -> next());
return stringArray;
}
public List<String> nextStringList(int size) {
List<String> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(next());
return list;
}
public Integer[] nextIntegerArray(int size) {
Integer[] ret = new Integer[size];
for (int i = 0; i < size; i++) ret[i] = nextInt();
return ret;
}
public Integer[] nextIntegerArray(int size, IntUnaryOperator map) {
Integer[] ret = new Integer[size];
for (int i = 0; i < size; i++) ret[i] = map.applyAsInt(nextInt());
return ret;
}
public char[][] nextDimensionalCharArray(int h, int w) {
char[][] array = new char[h][w];
for (int i = 0; i < h; i++) {
array[i] = next().toCharArray();
}
return array;
}
public int[][] nextDimensionalIntArray(int h, int w) {
int[][] array = new int[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
array[i][j] = nextInt();
}
}
return array;
}
public long[][] nextDimensionaLongArray(int h, int w) {
long[][] array = new long[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
array[i][j] = nextLong();
}
}
return array;
}
public int[][] nextIntArrayFromStr(int h, int w) {
int[][] array = new int[h][w];
for (int i = 0; i < h; i++) {
String temp = next();
for (int j = 0; j < w; j++) {
array[i][j] = temp.charAt(j) - '0';
}
}
return array;
}
public List<Integer> nextIntgerList(int size) {
List<Integer> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(nextInt());
return list;
}
public List<Integer> nextIntgerList(int size, IntUnaryOperator map) {
List<Integer> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(map.applyAsInt(nextInt()));
return list;
}
}
class ContestPrinter extends java.io.PrintWriter {
public ContestPrinter(java.io.PrintStream stream) {
super(stream);
}
public ContestPrinter(java.io.File file) throws java.io.FileNotFoundException {
super(new java.io.PrintStream(file));
}
public ContestPrinter() {
super(System.out);
}
private static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if (x < 0) {
sb.append('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
sb.append((long) x);
sb.append(".");
x -= (long) x;
for (int i = 0; i < n; i++) {
x *= 10;
sb.append((int) x);
x -= (int) x;
}
return sb.toString();
}
@Override
public void print(float f) {
super.print(dtos(f, 20));
}
@Override
public void println(float f) {
super.println(dtos(f, 20));
}
@Override
public void print(double d) {
super.print(dtos(d, 20));
}
@Override
public void println(double d) {
super.println(dtos(d, 20));
}
@Override
public void print(boolean boo) {
super.print(boo ? "Yes" : "No");
}
public void print(int[] array, String separator) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n - 1]);
}
public void print(int[] array) {
this.print(array, " ");
}
public void print(int[] array, String separator, java.util.function.IntUnaryOperator map) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(map.applyAsInt(array[i]));
super.print(separator);
}
super.println(map.applyAsInt(array[n - 1]));
}
public void print(int[] array, java.util.function.IntUnaryOperator map) {
this.print(array, " ", map);
}
public void print(long[] array, String separator) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n - 1]);
}
public void print(long[] array) {
this.print(array, " ");
}
public void print(long[] array, String separator, java.util.function.LongUnaryOperator map) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(map.applyAsLong(array[i]));
super.print(separator);
}
super.println(map.applyAsLong(array[n - 1]));
}
public void print(long[] array, java.util.function.LongUnaryOperator map) {
this.print(array, " ", map);
}
public <T> void print(T[] array, String separator) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n - 1]);
}
public <T> void print(T[] array) {
this.print(array, " ");
}
public <T> void print(T[] array, String separator, java.util.function.UnaryOperator<T> map) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(map.apply(array[i]));
super.print(separator);
}
super.println(map.apply(array[n - 1]));
}
public <T> void print(T[] array, java.util.function.UnaryOperator<T> map) {
this.print(array, " ", map);
}
public String getOutputCollection(Collection<?> c) {
return String.join(" ", c.stream().map(String::valueOf).collect(Collectors.toList()));
}
public void print(Collection<?> c) {
super.print(getOutputCollection(c));
}
public void println(Collection<?> c) {
StringBuilder sb = new StringBuilder();
for (Object object : c) {
// java 15以下の環境だとisEmptyがコンパイルしない
// if (!sb.isEmpty()) sb.append("\r\n");
if (sb.length() != 0) sb.append("\r\n");
sb.append(object);
}
System.out.println(sb);
}
public void println(int[] array) {
print(array, "\r\n");
}
public void println(long[] array) {
print(array, "\r\n");
}
public void print(String[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (String str : a) {
joiner.add(str);
}
System.out.println(joiner);
}
public void println(String[] a) {
StringJoiner joiner = new StringJoiner("\r\n");
for (String str : a) {
joiner.add(str);
}
System.out.println(joiner);
}
public void print(Object obj) {
System.out.print(obj);
}
public void println(Object obj) {
System.out.println(obj);
}
public void printlnDeep(ArrayList<ArrayList<Integer>> c) {
StringBuilder sb = new StringBuilder();
for (var ci : c) sb.append(getOutputCollection(ci)).append("\r\n");
System.out.println(sb);
}
public void printZeroToOneIndex(int[] a) {
print(a, i -> i + 1);
}
public void printZeroToOneIndex(long[] a) {
print(a, i -> i + 1);
}
public void printZeroToOneIndex(List<Integer> a) {
print(a.stream().map(i -> i + 1).collect(Collectors.toList()));
}
public void printlnZeroToOneIndex(List<Integer> a) {
println(a.stream().map(i -> i + 1).collect(Collectors.toList()));
}
public void print(boolean[] a) {
for (int i = 0; i < a.length; i++) {
System.out.println(a[i] + " ");
}
System.out.println("");
}
public void print(boolean[][] b) {
for (int i = 0; i < b.length; i++) {
for (int j = 0; j < b[0].length; j++) {
System.out.print(b[i][j] ? "o" : "x");
}
System.out.println("");
}
}
public void print(int[][] array) {
for (var i : array) print(i);
}
public void print(long[][] array) {
for (var i : array) print(i);
}
public void print(char[][] array) {
for (char[] cs : array) {
for (char c : cs) {
print(c);
}
println();
}
}
}
class Graph {
List<ArrayList<Integer>> g;
int v;
int e;
boolean[] visited;
public Graph(int v) {
this.v = v;
for (var i = 0; i < v; i++) g.add(new ArrayList<Integer>());
visited = new boolean[v];
}
public void addEdge(int a, int b) {
g.get(a).add(b);
g.get(b).add(a);
e++;
}
public void dfs(int now) {
visited[now] = true;
for (var next : g.get(now)) {
if (visited[next]) continue;
dfs(next);
}
}
public boolean marked(int now) {
return visited[now];
}
public boolean isAllConected() {
for (var bo : visited) {
if (!bo) return false;
}
return true;
}
}
/**
* 先頭及び末尾への挿入がO（1）かつ、ランダムアクセスもO(1)で可能なデータ構造の自作クラス
*/
class ContestDeque<E> implements Iterable<E> {
private List<E> stack;
private List<E> que;
public ContestDeque() {
stack = new ArrayList<E>();
que = new ArrayList<E>();
}
public E get(int i) {
if (i < stack.size()) {
return stack.get(stack.size() - i - 1);
} else {
return que.get(i - stack.size());
}
}
public E remove(int i) {
E e;
if (i < stack.size()) {
e = stack.remove(stack.size() - i - 1);
} else {
e = que.remove(i - stack.size());
}
return e;
}
public void addFirst(E e) {
stack.add(e);
}
public void addLast(E e) {
que.add(e);
}
public void set(int i, E e) {
if (i < stack.size()) {
e = stack.set(stack.size() - i - 1, e);
} else {
e = que.set(i - stack.size(), e);
}
}
public int size() {
return stack.size() + que.size();
}
public boolean isEmpty() {
return size() == 0;
}
@Override
public String toString() {
var temp = new ArrayList<E>();
for (int i = stack.size() - 1; i >= 0; i--) {
temp.add(stack.get(i));
}
temp.addAll(que);
return String.join(" ", temp.stream().map(String::valueOf).collect(Collectors.toList()));
}
public Iterator<E> iterator() {
return new ContestDequeIterator();
}
private class ContestDequeIterator implements Iterator<E> {
private int i = 0;
public boolean hasNext() {
return i < size();
}
public E next() {
i++;
return get(i);
}
}
}
/**
* ｘｙの二次元の座標クラス ユークリッド距離が算出可能
*/
class Point implements Comparable<Point> {
long x;
long y;
Point(long x, long y) {
this.x = x;
this.y = y;
}
/**
* 距離を求める。ただし値は平方根を付ける前
*
* @param Point
* @return long 平方根を付ける前の距離
*/
public long dist(Point target) {
return (long) (x - target.x) * (x - target.x) + (y - target.y) * (y - target.y);
}
@Override
public int compareTo(Point o) {
return (int) (x == o.x ? y - o.y : x - o.x);
}
@Override
public int hashCode() {
return (int) (x + y) * 31;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof Point)) return false;
Point p = (Point) o;
return x == p.x && y == p.y;
}
@Override
public String toString() {
return String.format("(%s %s)", x, y);
}
}
/**
* グリッド上のカーソルを扱うクラス
*
*/
class GridCursor implements Comparable<GridCursor> {
int h;
int w;
static char[][] input = null;
static int maxH = -1;
static int maxW = -1;
static char OBSTACLE = '#';
static final int[][] directions8 = { { 1, 0 }, { 1, -1 }, { 1, 1 }, { -1, 0 }, { -1, 1 }, { -1, -1 }, { 0, 1 },
{ 0, -1 } };
static final int[][] directions4 = { { 1, 0 }, { -1, 0 }, { 0, 1 }, { 0, -1 } };
public boolean isInnner() {
if (maxH < 0 || maxW < 0) {
throw new IllegalStateException("h/w is not initialized!");
}
return h >= 0 && h < maxH && w >= 0 && w < maxW;
}
public GridCursor(int h, int w) {
this.h = h;
this.w = w;
}
public GridCursor(int h, int w, char[][] input) {
this.h = h;
this.w = w;
GridCursor.input = input;
maxH = input.length;
maxW = input[0].length;
}
public GridCursor(int h, int w, int maxH, int maxW) {
this.h = h;
this.w = w;
// MEMO staticのものを設定するのも微妙な気がする
GridCursor.maxH = maxH;
GridCursor.maxW = maxW;
}
public boolean move(char ch) {
// MEMO enumにするべききもするが自分しか利用しないのでそのままとする
if (ch != 'R' && ch != 'L' && ch != 'D' && ch != 'U') {
throw new IllegalArgumentException("move method only allows R/L/D/U");
}
if (maxH < 0 || maxW < 0) {
throw new IllegalStateException("h/w is not initialized!");
}
var nh = h;
var nw = w;
if (ch == 'R') nw++;
if (ch == 'L') nw--;
if (ch == 'D') nh++;
if (ch == 'U') nh--;
if (!(nh >= 0 && nw >= 0 && nh < maxH && nw < maxW)) return false;
if (input != null && input[nh][nw] == OBSTACLE) return false;
h = nh;
w = nw;
return true;
}
@Override
public int compareTo(GridCursor o) {
return (int) (h == o.h ? w - o.w : h - o.h);
}
@Override
public int hashCode() {
return (h + w) * 31;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof GridCursor)) return false;
GridCursor g = (GridCursor) o;
return h == g.h && w == g.w;
}
@Override
public String toString() {
return String.format("(%s %s)", h, w);
}
}
class Pair<S extends Comparable<S>, T extends Comparable<T>> implements Comparable<Pair<S, T>> {
S first;
T second;
public Pair(S s, T t) {
first = s;
second = t;
}
public S getFirst() {
return first;
}
public T getSecond() {
return second;
}
public boolean equals(Object another) {
if (this == another) return true;
if (!(another instanceof Pair)) return false;
Pair otherPair = (Pair) another;
return this.first.equals(otherPair.first) && this.second.equals(otherPair.second);
}
public int compareTo(Pair<S, T> another) {
java.util.Comparator<Pair<S, T>> comp1 = java.util.Comparator.comparing(Pair::getFirst);
java.util.Comparator<Pair<S, T>> comp2 = comp1.thenComparing(Pair::getSecond);
return comp2.compare(this, another);
}
public int hashCode() {
return first.hashCode() * 10007 + second.hashCode();
}
public String toString() {
return String.format("%s %s", first, second);
}
}
/**
* 辺のクラス
*
* @author ritoAtCoder
*
*/
class Edge implements Comparable<Edge> {
int from;
int to;
int cost;
Edge(int from, int to, int cost) {
this.from = from;
this.to = to;
this.cost = cost;
}
@Override
public int compareTo(Edge that) {
// java.util.Comparator<Pair<S, T>> comp1 = java.util.Comparator.comparing(Pair::getFirst);
// java.util.Comparator<Pair<S, T>> comp2 = comp1.thenComparing(Pair::getSecond);
// return comp2.compare(this, another);
// Integer.compare(cost, e.cost).th
int c = Integer.compare(this.cost, that.cost);
if (c == 0) c = Integer.compare(this.to, that.to);
if (c == 0) c = Integer.compare(this.from, that.from);
return c;
// return cost - e.cost != 0 ? cost - e.cost : (to - e.to != 0 ? to - e.to : from - e.from);
}
@Override
public int hashCode() {
return (from + to + cost) * 17;
}
@Override
public String toString() {
return String.format("%s -> %s (%s) ", from, to, cost);
}
@Override
public boolean equals(Object another) {
if (!(another instanceof Edge)) return false;
if (this == another) return true;
Edge o = (Edge) another;
return from == o.from && to == o.to && cost == o.cost;
}
}
class UnionFind {
int[] parent, rank, size, minNode;
int componentSize;// 連結成分の個数
int[] value;// ノードごとに値を持ちたいとき。直接設定する
public UnionFind(int n) {
parent = new int[n];
rank = new int[n];
size = new int[n];// ノード内に含まれる数
minNode = new int[n];
value = new int[n];
for (int i = 0; i < n; i++) {
parent[i] = i;
rank[i] = 0;// 0始まりとする
size[i] = 1;
minNode[i] = i;
}
componentSize = n;
}
public void clear() {
int n = parent.length;
parent = new int[n];
rank = new int[n];
size = new int[n];// ノード内に含まれる数
minNode = new int[n];
value = new int[n];
for (int i = 0; i < n; i++) {
parent[i] = i;
rank[i] = 0;// 0始まりとする
size[i] = 1;
minNode[i] = i;
}
componentSize = n;
}
public int root(int x) {
if (parent[x] == x) return x;
return parent[x] = root(parent[x]);// 経路圧縮
}
public boolean isConneted(int x, int y) {
return root(x) == root(y);
}
public boolean union(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
// ランクが高い方を常にx側で持つ
if (rank[x] < rank[y]) {
int temp = x;
x = y;
y = temp;
}
parent[y] = x;
if (rank[x] == rank[y]) rank[x]++;
size[x] += size[y];
minNode[x] = Math.min(minNode[x], minNode[y]);
value[x] += value[y];
componentSize--;
return true;
}
public int getSize(int x) {
return size[root(x)];
}
public int getMinNode(int x) {
return minNode[root(x)];
}
public int getComponentSize() {
return componentSize;
}
public int getValue(int x) {
return value[root(x)];
}
@Override
public String toString() {
return Arrays.toString(parent);
}
}
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Iterator;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.StringJoiner;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
public class Main {
static void solve() {
var a = sc.nextLong();
var m = sc.nextLong();
var l = sc.nextLong();
var r = sc.nextLong();
l -= a;
r -= a;
long X = (((long) 2e18) / m) + 1L;
l += m * X;
r += m * X;
pw.println((r / m - (l - 1) / m));
}
static void swap(int[] array, int i, int j) {
int temp = array[i];
array[j] = array[i];
array[i] = temp;
}
static void swap(long[] array, int i, int j) {
long temp = array[i];
array[j] = array[i];
array[i] = temp;
}
static void swap(char[] array, int i, int j) {
char temp = array[i];
array[j] = array[i];
array[i] = temp;
}
static String swap(String str, int i, int j) {
var temp = str.toCharArray();
var taihi = temp[i];
temp[i] = temp[j];
temp[j] = taihi;
return toString(temp);
}
/*
* エラトステネスの篩 nまでの素数の配列を返却する
*
*/
public static boolean[] getEratostheses(int n) {
boolean[] isPrimes = new boolean[n + 1];
Arrays.fill(isPrimes, true);
isPrimes[0] = isPrimes[1] = false;
var root = Math.sqrt(isPrimes.length);
for (int i = 0; i < root; i++) {
if (!isPrimes[i]) continue;
for (int j = i * i; j < isPrimes.length; j += i) {// iでインクリメントし)ているのポイント
isPrimes[j] = false;
}
}
return isPrimes;
}
public static List<Integer> getPrimeList(int n) {
var list = new ArrayList<Integer>();
var primes = getEratostheses(n);
for (var i = 0; i < n; i++) {
if (primes[i]) list.add(i);
}
return list;
}
public static boolean isPrime(long a) {
if (a == 1) return false;
if (a == 2) return true;
if (a % 2 == 0) return false;
var rootA = (int) Math.sqrt(a);
for (int i = 3; i <= rootA; i += 2) {
if (a % i == 0) return false;
}
return true;
}
/**
* 素因数分解の結果を返却する １は含まれないことに注意
*
* @param x
* @return 素因数分解の結果
*/
public static List<Integer> primeFactorize(int x) {
var ret = new ArrayList<Integer>();
for (int i = 2; i <= (int) Math.sqrt(x); i++) {
if (x % i == 0) {
while (x % i == 0) {
ret.add(i);
x /= i;
}
}
}
if (x != 1) {
ret.add(x);
}
return ret;
}
/**
* 次の順列にする。 MEMO: 利用の場合はもとが昇順でソートしているか確認すること
*
* ) @param array )*
*
* @return boolean 次の順列がある
*/
static boolean nextPermutation(int[] array) {
// Find longest non-increasing suffix
int i = array.length - 1;
while (i > 0 && array[i - 1] >= array[i])
i--;
// Now i is the head index of the suffix
// Are we at the last permutation already?
if (i <= 0) return false;
// Let array[i - 1] be the pivot
// Find rightmost element greater than the pivot
int j = array.length - 1;
while (array[j] <= array[i - 1])
j--;
// Now the value array[j] will become the new pivot
// Assertion: j >= i
// Swap the pivot with j
int temp = array[i - 1];
array[i - 1] = array[j];
array[j] = temp;
// Reverse the suffix
j = array.length - 1;
while (i < j) {
temp = array[i];
array[i] = array[j];
array[j] = temp;
i++;
j--;
}
// Successfully computed the next permutation
return true;
}
// public static final int MOD = ((int) 1e9 + 7);
// public static final long MOD = 998244353L;
public static final long MOD = (long) 1e8;
public static final int INF = (int) 1e9;
/**
* ランレングス圧縮
*
* @param str
* @return Pair
*/
public static List<Pair<Character, Integer>> runLength(String str) {
var ret = new ArrayList<Pair<Character, Integer>>();
for (int i = 0; i < str.length(); i++) {
var cnt = 1;
while (i < str.length() - 1 && str.charAt(i) == str.charAt(i + 1)) {
i++;
cnt++;
}
ret.add(new Pair<Character, Integer>(str.charAt(i), cnt));
}
return ret;
}
/**
* 10進数からX進数の文字列に変換する。
*
* @MEMO 逆向きの変換はLong.parseUnsignedLong(String s, int radix)を利用する！
*
* @param n 変換元（１０進数）
* @param newBase 変換後の基数
* @return newBase変換後のString
*/
public static String convertBase10ToX(long n, int radix) {
if (n == 0L) return "0";
var sb = new StringBuilder();
while (n > 0) {
long r = n % (long) radix;
sb.insert(0, r);
n /= (long) radix;
}
return sb.toString();
}
public static int[] array(int size, int init) {
var array = new int[size];
fill(array, init);
return array;
}
public static int[] array(int size, IntUnaryOperator generator) {
var array = new int[size];
Arrays.setAll(array, generator);
return array;
}
public static char[] array(int size, char init) {
var array = new char[size];
fill(array, init);
return array;
}
public static char[][] array(int h, int w, char init) {
var array = new char[h][w];
for (char[] c : array) fill(c, init);
return array;
}
public static boolean[] array(int size, boolean init) {
var array = new boolean[size];
fill(array, init);
return array;
}
public static long[] array(int size, long init) {
var array = new long[size];
fill(array, init);
return array;
}
/**
* 先頭が0でそれ以外は初期値の配列を返却する
*
* @param size
* @param init
* @return
*/
public static int[] zeroArray(int size, int init) {
int[] array = new int[size];
fill(array, init);
array[0] = 0;
return array;
}
public static long[] zeropArray(int size, long init) {
var array = new long[size];
fill(array, init);
array[0] = 0L;
return array;
}
public static long gcd(long a, long b) {
if (b > a) {
long temp = a;
a = b;
b = temp;
}
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
public static long lcm(long a, long b) {
// NOTE オーバーフローに注意すること。
// オーバーフローのおそれがある場合は以下のような対応をとる
// if (a / g > INF / b) return INF;
// @see https://drken1215.hatenablog.com/entry/2023/11/21/020301
if (b > a) {
return b / gcd(a, b) * a;
} else {
return a / gcd(a, b) * b;
}
}
/**
* 負の数にも対応した%演算
*
* @param val
* @param mod
* @return
*/
public static long mod(long val, long mod) {
long res = val % mod;
if (res < 0) res += mod;
return res;
}
/**
* べき乗の計算
*/
public static final long pow(int a, int b) {
if (b == 0) return 1;
if (b % 2 == 1) return a * pow(a, (b - 1));
var half = pow(a, b / 2);
return half * half;
}
/**
* べき乗の計算
*/
public static final long pow(long a, long b) {
if (b == 0L) return 1L;
if (b % 2L == 1L) return a * pow(a, (b - 1L));
var half = pow(a, b / 2L);
return half * half;
}
/**
* べき乗 MOD 計算量 O(logN)
*
* @param val
* @param mod
* @return
*/
public static long modpow(long a, long b, long mod) {
if (b == 0L) return 1L;
if (b == 1L) return a % mod;
if (b % 2 == 1) return (a * modpow(a, b - 1L, mod)) % mod;
long temp = modpow(a, b / 2L, mod);
return (temp * temp) % mod;
}
public static int getKeata(int x) {
return String.valueOf(x).length();
}
public static int getKeata(long x) {
return String.valueOf(x).length();
}
/**
* Arras#binarySearchでは重複した場合の返却値が安定しないので、LowerBound版を作成
*
* 値が重複しないことが保証されている場合は速度的にArrays#binarySearchを使うこと。
*
* )* @param array
*
* @param key
* @return 存在する場合はインデックス 存在しない場合は-(挿入するポイント)-1(ビット反転[~]すればもどる)
*/
public static int binarySearchLowerBound(int[] array, int key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while (ok - ng > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] >= key) {
ok = mid;
} else {
ng = mid;
}
}
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchLowerBound(long[] array, long key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while (ok - ng > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] >= key) {
ok = mid;
} else {
ng = mid;
}
}
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchUpperBound(int[] array, int key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while ((ok - ng) > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] > key) {
ok = mid;
} else {
ng = mid;
}
}
if (ng == -1) return -1;// 探索内で大きいものが見つからなかったとき
if (array[ng] == key) return ng;// 最後の値がkeyと同じ値の場合は最後の値を利用する
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchUpperBound(long[] array, long key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while ((ok - ng) > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] > key) {
ok = mid;
} else {
ng = mid;
}
}
if (ng == -1) return -1;// 探索内で大きいものが見つからなかったとき
if (array[ng] == key) return ng;// 最後の値がkeyと同じ値の場合は最後の値を利用する
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
/*--- ---*/
/*--- Util ---*/
/*--- ---*/
public static List<Integer> toList(int[] a) {
return Arrays.stream(a).boxed().collect(Collectors.toList());
}
public static List<Long> toList(long[] a) {
return Arrays.stream(a).boxed().collect(Collectors.toList());
}
public static String reverse(String str) {
return new StringBuilder().append(str).reverse().toString();
}
public static boolean isKaibun(String str) {
return str.equals(reverse(str));
}
public static String toString(int a) {
return String.valueOf(a);
}
public static String toString(long a) {
return String.valueOf(a);
}
public static String toString(char[] a) {
return String.valueOf(a);
}
public static int toInt(String a) {
return Integer.valueOf(a);
}
public static long toLong(String a) {
return Long.valueOf(a);
}
public static char[] toCharArray(int a) {
return String.valueOf(a).toCharArray();
}
public static char[] toCharArray(long a) {
return String.valueOf(a).toCharArray();
}
public static char[] toCharArray(String a) {
return a.toCharArray();
}
public static boolean isAllTrue(boolean[] boo) {
for (boolean b : boo) {
if (!b) return false;
}
return true;
}
public static int cntBoolean(boolean[] boo) {
int cnt = 0;
for (boolean b : boo) {
if (b) cnt++;
}
return cnt;
}
public static void sort(int[] a) {
Arrays.sort(a);
}
public static void sort(long[] a) {
Arrays.sort(a);
}
public static int abs(int a, int b) {
return Math.abs(a - b);
}
public static long abs(long a, long b) {
return Math.abs(a - b);
}
/**
* int配列を降順にソートする
*/
public static void sortDes(int[] a) {
Arrays.sort(a);
var temp = Arrays.copyOf(a, a.length);
for (int i = 0; i < temp.length; i++) {
a[i] = temp[temp.length - i - 1];
}
}
/**
* long配列を降順にソートする
*/
public static void sortDes(long[] a) {
Arrays.sort(a);
var temp = Arrays.copyOf(a, a.length);
for (int i = 0; i < temp.length; i++) {
a[i] = temp[temp.length - i - 1];
}
}
public static void fill(int[] array, int val) {
Arrays.fill(array, val);
}
public static void fill(char[] array, char val) {
Arrays.fill(array, val);
}
public static void fill(boolean[] array, boolean val) {
Arrays.fill(array, val);
}
public static void fill(int[][] array, int val) {
for (var a : array) Arrays.fill(a, val);
}
public static void fill(long[] array, long val) {
Arrays.fill(array, val);
}
public static void fill(long[][] array, long val) {
for (var a : array) Arrays.fill(a, val);
}
public static void initalizeDp(int[][] dp, int val) {
fill(dp, val);
dp[0][0] = 0;
}
public static void initalizeDp(long[][] dp, long val) {
fill(dp, val);
dp[0][0] = 0L;
}
public static int max(int... array) {
return Arrays.stream(array).max().getAsInt();
}
public static int sum(int... array) {
return Arrays.stream(array).sum();
}
public static int max(int a, int b) {
return Math.max(a, b);
}
public static int min(int... array) {
return Arrays.stream(array).min().getAsInt();
}
public static int min(int a, int b) {
return Math.min(a, b);
}
public static long max(long... array) {
return Arrays.stream(array).max().getAsLong();
}
public static long max(long a, long b) {
return Math.max(a, b);
}
public static long sum(long... array) {
return Arrays.stream(array).sum();
}
public static long min(long a, long b) {
return Math.min(a, b);
}
public static long min(long... array) {
return Arrays.stream(array).min().getAsLong();
}
/*--- ---*/
/*--- debug ---*/
/*--- ---*/
public static void debug(Object o, Object... args) {
var format = "%s";
var temp = new Object[args.length + 1];
temp[0] = o;
System.arraycopy(args, 0, temp, 1, args.length);
for (int i = 0; i < temp.length - 1; i++) {
format += " %s";
}
System.out.printf(format, temp);
System.out.println("");
}
public static void debug(int[] x) {
out(Arrays.toString(x));
}
public static void debug(boolean[] x) {
out(Arrays.toString(x));
}
public static void debug(long[] x) {
out(Arrays.toString(x));
}
public static void debug(char[] x) {
out(String.valueOf(x));
}
public static void debug(int[][] x) {
out(Arrays.deepToString(x));
}
public static void debugln(int[][] x) {
for (int[] w : x) {
for (var i : w) {
System.err.print(i + " ");
}
out("");
}
out("///////////////////");
}
public static void debug(long[][] x) {
out(Arrays.deepToString(x));
}
public static void debugln(long[][] x) {
for (long[] w : x) {
for (var i : w) {
System.err.print(i + " ");
}
out("");
}
out("///////////////////");
}
public static void debug(boolean[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(char[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(Object[] x) {
out(Arrays.toString(x));
}
public static void debug(Object[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(Object a) {
System.err.println(a);
}
public static void out(String x) {
System.err.println(x);
}
final static ContestPrinter pw = new ContestPrinter();
final static FastScanner sc = new FastScanner();
public static void main(String[] args) {
solve();
pw.close();
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[ptr++];
else
return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public Point nextPoint() {
return new Point(nextInt(), nextInt());
}
public Point[] nextPointArray(int size) {
Point[] array = new Point[size];
Arrays.setAll(array, i -> new Point(nextInt(), nextInt()));
return array;
}
public List<Point> nextPointList(int size) {
List<Point> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(new Point(nextInt(), nextInt()));
return list;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public int[] nextIntArray(int size) {
int[] intArray = new int[size];
Arrays.setAll(intArray, i -> nextInt());
return intArray;
}
public int[] nextIntArray(int size, IntUnaryOperator map) {
int[] intArray = new int[size];
Arrays.setAll(intArray, i -> map.applyAsInt(nextInt()));
return intArray;
}
public int[] nextIntArrayOneToZeroIndex(int size) {
return nextIntArray(size, i -> i - 1);
}
public long[] nextLongArray(int size) {
long[] longArray = new long[size];
Arrays.setAll(longArray, i -> nextLong());
return longArray;
}
public long[] nextLongArray(int size, LongUnaryOperator map) {
long[] longArray = new long[size];
Arrays.setAll(longArray, i -> map.applyAsLong(nextLong()));
return longArray;
}
public String[] nextStringArray(int size) {
String[] stringArray = new String[size];
Arrays.setAll(stringArray, i -> next());
return stringArray;
}
public List<String> nextStringList(int size) {
List<String> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(next());
return list;
}
public Integer[] nextIntegerArray(int size) {
Integer[] ret = new Integer[size];
for (int i = 0; i < size; i++) ret[i] = nextInt();
return ret;
}
public Integer[] nextIntegerArray(int size, IntUnaryOperator map) {
Integer[] ret = new Integer[size];
for (int i = 0; i < size; i++) ret[i] = map.applyAsInt(nextInt());
return ret;
}
public char[][] nextDimensionalCharArray(int h, int w) {
char[][] array = new char[h][w];
for (int i = 0; i < h; i++) {
array[i] = next().toCharArray();
}
return array;
}
public int[][] nextDimensionalIntArray(int h, int w) {
int[][] array = new int[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
array[i][j] = nextInt();
}
}
return array;
}
public long[][] nextDimensionaLongArray(int h, int w) {
long[][] array = new long[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
array[i][j] = nextLong();
}
}
return array;
}
public int[][] nextIntArrayFromStr(int h, int w) {
int[][] array = new int[h][w];
for (int i = 0; i < h; i++) {
String temp = next();
for (int j = 0; j < w; j++) {
array[i][j] = temp.charAt(j) - '0';
}
}
return array;
}
public List<Integer> nextIntgerList(int size) {
List<Integer> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(nextInt());
return list;
}
public List<Integer> nextIntgerList(int size, IntUnaryOperator map) {
List<Integer> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(map.applyAsInt(nextInt()));
return list;
}
}
class ContestPrinter extends java.io.PrintWriter {
public ContestPrinter(java.io.PrintStream stream) {
super(stream);
}
public ContestPrinter(java.io.File file) throws java.io.FileNotFoundException {
super(new java.io.PrintStream(file));
}
public ContestPrinter() {
super(System.out);
}
private static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if (x < 0) {
sb.append('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
sb.append((long) x);
sb.append(".");
x -= (long) x;
for (int i = 0; i < n; i++) {
x *= 10;
sb.append((int) x);
x -= (int) x;
}
return sb.toString();
}
@Override
public void print(float f) {
super.print(dtos(f, 20));
}
@Override
public void println(float f) {
super.println(dtos(f, 20));
}
@Override
public void print(double d) {
super.print(dtos(d, 20));
}
@Override
public void println(double d) {
super.println(dtos(d, 20));
}
@Override
public void print(boolean boo) {
super.print(boo ? "Yes" : "No");
}
public void print(int[] array, String separator) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n - 1]);
}
public void print(int[] array) {
this.print(array, " ");
}
public void print(int[] array, String separator, java.util.function.IntUnaryOperator map) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(map.applyAsInt(array[i]));
super.print(separator);
}
super.println(map.applyAsInt(array[n - 1]));
}
public void print(int[] array, java.util.function.IntUnaryOperator map) {
this.print(array, " ", map);
}
public void print(long[] array, String separator) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n - 1]);
}
public void print(long[] array) {
this.print(array, " ");
}
public void print(long[] array, String separator, java.util.function.LongUnaryOperator map) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(map.applyAsLong(array[i]));
super.print(separator);
}
super.println(map.applyAsLong(array[n - 1]));
}
public void print(long[] array, java.util.function.LongUnaryOperator map) {
this.print(array, " ", map);
}
public <T> void print(T[] array, String separator) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n - 1]);
}
public <T> void print(T[] array) {
this.print(array, " ");
}
public <T> void print(T[] array, String separator, java.util.function.UnaryOperator<T> map) {
int n = array.length;
if (n == 0) {
super.println();
return;
}
for (int i = 0; i < n - 1; i++) {
super.print(map.apply(array[i]));
super.print(separator);
}
super.println(map.apply(array[n - 1]));
}
public <T> void print(T[] array, java.util.function.UnaryOperator<T> map) {
this.print(array, " ", map);
}
public String getOutputCollection(Collection<?> c) {
return String.join(" ", c.stream().map(String::valueOf).collect(Collectors.toList()));
}
public void print(Collection<?> c) {
super.print(getOutputCollection(c));
}
public void println(Collection<?> c) {
StringBuilder sb = new StringBuilder();
for (Object object : c) {
// java 15以下の環境だとisEmptyがコンパイルしない
// if (!sb.isEmpty()) sb.append("\r\n");
if (sb.length() != 0) sb.append("\r\n");
sb.append(object);
}
System.out.println(sb);
}
public void println(int[] array) {
print(array, "\r\n");
}
public void println(long[] array) {
print(array, "\r\n");
}
public void print(String[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (String str : a) {
joiner.add(str);
}
System.out.println(joiner);
}
public void println(String[] a) {
StringJoiner joiner = new StringJoiner("\r\n");
for (String str : a) {
joiner.add(str);
}
System.out.println(joiner);
}
public void print(Object obj) {
System.out.print(obj);
}
public void println(Object obj) {
System.out.println(obj);
}
public void printlnDeep(ArrayList<ArrayList<Integer>> c) {
StringBuilder sb = new StringBuilder();
for (var ci : c) sb.append(getOutputCollection(ci)).append("\r\n");
System.out.println(sb);
}
public void printZeroToOneIndex(int[] a) {
print(a, i -> i + 1);
}
public void printZeroToOneIndex(long[] a) {
print(a, i -> i + 1);
}
public void printZeroToOneIndex(List<Integer> a) {
print(a.stream().map(i -> i + 1).collect(Collectors.toList()));
}
public void printlnZeroToOneIndex(List<Integer> a) {
println(a.stream().map(i -> i + 1).collect(Collectors.toList()));
}
public void print(boolean[] a) {
for (int i = 0; i < a.length; i++) {
System.out.println(a[i] + " ");
}
System.out.println("");
}
public void print(boolean[][] b) {
for (int i = 0; i < b.length; i++) {
for (int j = 0; j < b[0].length; j++) {
System.out.print(b[i][j] ? "o" : "x");
}
System.out.println("");
}
}
public void print(int[][] array) {
for (var i : array) print(i);
}
public void print(long[][] array) {
for (var i : array) print(i);
}
public void print(char[][] array) {
for (char[] cs : array) {
for (char c : cs) {
print(c);
}
println();
}
}
}
class Graph {
List<ArrayList<Integer>> g;
int v;
int e;
boolean[] visited;
public Graph(int v) {
this.v = v;
for (var i = 0; i < v; i++) g.add(new ArrayList<Integer>());
visited = new boolean[v];
}
public void addEdge(int a, int b) {
g.get(a).add(b);
g.get(b).add(a);
e++;
}
public void dfs(int now) {
visited[now] = true;
for (var next : g.get(now)) {
if (visited[next]) continue;
dfs(next);
}
}
public boolean marked(int now) {
return visited[now];
}
public boolean isAllConected() {
for (var bo : visited) {
if (!bo) return false;
}
return true;
}
}
/**
* 先頭及び末尾への挿入がO（1）かつ、ランダムアクセスもO(1)で可能なデータ構造の自作クラス
*/
class ContestDeque<E> implements Iterable<E> {
private List<E> stack;
private List<E> que;
public ContestDeque() {
stack = new ArrayList<E>();
que = new ArrayList<E>();
}
public E get(int i) {
if (i < stack.size()) {
return stack.get(stack.size() - i - 1);
} else {
return que.get(i - stack.size());
}
}
public E remove(int i) {
E e;
if (i < stack.size()) {
e = stack.remove(stack.size() - i - 1);
} else {
e = que.remove(i - stack.size());
}
return e;
}
public void addFirst(E e) {
stack.add(e);
}
public void addLast(E e) {
que.add(e);
}
public void set(int i, E e) {
if (i < stack.size()) {
e = stack.set(stack.size() - i - 1, e);
} else {
e = que.set(i - stack.size(), e);
}
}
public int size() {
return stack.size() + que.size();
}
public boolean isEmpty() {
return size() == 0;
}
@Override
public String toString() {
var temp = new ArrayList<E>();
for (int i = stack.size() - 1; i >= 0; i--) {
temp.add(stack.get(i));
}
temp.addAll(que);
return String.join(" ", temp.stream().map(String::valueOf).collect(Collectors.toList()));
}
public Iterator<E> iterator() {
return new ContestDequeIterator();
}
private class ContestDequeIterator implements Iterator<E> {
private int i = 0;
public boolean hasNext() {
return i < size();
}
public E next() {
i++;
return get(i);
}
}
}
/**
* ｘｙの二次元の座標クラス ユークリッド距離が算出可能
*/
class Point implements Comparable<Point> {
long x;
long y;
Point(long x, long y) {
this.x = x;
this.y = y;
}
/**
* 距離を求める。ただし値は平方根を付ける前
*
* @param Point
* @return long 平方根を付ける前の距離
*/
public long dist(Point target) {
return (long) (x - target.x) * (x - target.x) + (y - target.y) * (y - target.y);
}
@Override
public int compareTo(Point o) {
return (int) (x == o.x ? y - o.y : x - o.x);
}
@Override
public int hashCode() {
return (int) (x + y) * 31;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof Point)) return false;
Point p = (Point) o;
return x == p.x && y == p.y;
}
@Override
public String toString() {
return String.format("(%s %s)", x, y);
}
}
/**
* グリッド上のカーソルを扱うクラス
*
*/
class GridCursor implements Comparable<GridCursor> {
int h;
int w;
static char[][] input = null;
static int maxH = -1;
static int maxW = -1;
static char OBSTACLE = '#';
static final int[][] directions8 = { { 1, 0 }, { 1, -1 }, { 1, 1 }, { -1, 0 }, { -1, 1 }, { -1, -1 }, { 0, 1 },
{ 0, -1 } };
static final int[][] directions4 = { { 1, 0 }, { -1, 0 }, { 0, 1 }, { 0, -1 } };
public boolean isInnner() {
if (maxH < 0 || maxW < 0) {
throw new IllegalStateException("h/w is not initialized!");
}
return h >= 0 && h < maxH && w >= 0 && w < maxW;
}
public GridCursor(int h, int w) {
this.h = h;
this.w = w;
}
public GridCursor(int h, int w, char[][] input) {
this.h = h;
this.w = w;
GridCursor.input = input;
maxH = input.length;
maxW = input[0].length;
}
public GridCursor(int h, int w, int maxH, int maxW) {
this.h = h;
this.w = w;
// MEMO staticのものを設定するのも微妙な気がする
GridCursor.maxH = maxH;
GridCursor.maxW = maxW;
}
public boolean move(char ch) {
// MEMO enumにするべききもするが自分しか利用しないのでそのままとする
if (ch != 'R' && ch != 'L' && ch != 'D' && ch != 'U') {
throw new IllegalArgumentException("move method only allows R/L/D/U");
}
if (maxH < 0 || maxW < 0) {
throw new IllegalStateException("h/w is not initialized!");
}
var nh = h;
var nw = w;
if (ch == 'R') nw++;
if (ch == 'L') nw--;
if (ch == 'D') nh++;
if (ch == 'U') nh--;
if (!(nh >= 0 && nw >= 0 && nh < maxH && nw < maxW)) return false;
if (input != null && input[nh][nw] == OBSTACLE) return false;
h = nh;
w = nw;
return true;
}
@Override
public int compareTo(GridCursor o) {
return (int) (h == o.h ? w - o.w : h - o.h);
}
@Override
public int hashCode() {
return (h + w) * 31;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof GridCursor)) return false;
GridCursor g = (GridCursor) o;
return h == g.h && w == g.w;
}
@Override
public String toString() {
return String.format("(%s %s)", h, w);
}
}
class Pair<S extends Comparable<S>, T extends Comparable<T>> implements Comparable<Pair<S, T>> {
S first;
T second;
public Pair(S s, T t) {
first = s;
second = t;
}
public S getFirst() {
return first;
}
public T getSecond() {
return second;
}
public boolean equals(Object another) {
if (this == another) return true;
if (!(another instanceof Pair)) return false;
Pair otherPair = (Pair) another;
return this.first.equals(otherPair.first) && this.second.equals(otherPair.second);
}
public int compareTo(Pair<S, T> another) {
java.util.Comparator<Pair<S, T>> comp1 = java.util.Comparator.comparing(Pair::getFirst);
java.util.Comparator<Pair<S, T>> comp2 = comp1.thenComparing(Pair::getSecond);
return comp2.compare(this, another);
}
public int hashCode() {
return first.hashCode() * 10007 + second.hashCode();
}
public String toString() {
return String.format("%s %s", first, second);
}
}
/**
* 辺のクラス
*
* @author ritoAtCoder
*
*/
class Edge implements Comparable<Edge> {
int from;
int to;
int cost;
Edge(int from, int to, int cost) {
this.from = from;
this.to = to;
this.cost = cost;
}
@Override
public int compareTo(Edge that) {
// java.util.Comparator<Pair<S, T>> comp1 = java.util.Comparator.comparing(Pair::getFirst);
// java.util.Comparator<Pair<S, T>> comp2 = comp1.thenComparing(Pair::getSecond);
// return comp2.compare(this, another);
// Integer.compare(cost, e.cost).th
int c = Integer.compare(this.cost, that.cost);
if (c == 0) c = Integer.compare(this.to, that.to);
if (c == 0) c = Integer.compare(this.from, that.from);
return c;
// return cost - e.cost != 0 ? cost - e.cost : (to - e.to != 0 ? to - e.to : from - e.from);
}
@Override
public int hashCode() {
return (from + to + cost) * 17;
}
@Override
public String toString() {
return String.format("%s -> %s (%s) ", from, to, cost);
}
@Override
public boolean equals(Object another) {
if (!(another instanceof Edge)) return false;
if (this == another) return true;
Edge o = (Edge) another;
return from == o.from && to == o.to && cost == o.cost;
}
}
class UnionFind {
int[] parent, rank, size, minNode;
int componentSize;// 連結成分の個数
int[] value;// ノードごとに値を持ちたいとき。直接設定する
public UnionFind(int n) {
parent = new int[n];
rank = new int[n];
size = new int[n];// ノード内に含まれる数
minNode = new int[n];
value = new int[n];
for (int i = 0; i < n; i++) {
parent[i] = i;
rank[i] = 0;// 0始まりとする
size[i] = 1;
minNode[i] = i;
}
componentSize = n;
}
public void clear() {
int n = parent.length;
parent = new int[n];
rank = new int[n];
size = new int[n];// ノード内に含まれる数
minNode = new int[n];
value = new int[n];
for (int i = 0; i < n; i++) {
parent[i] = i;
rank[i] = 0;// 0始まりとする
size[i] = 1;
minNode[i] = i;
}
componentSize = n;
}
public int root(int x) {
if (parent[x] == x) return x;
return parent[x] = root(parent[x]);// 経路圧縮
}
public boolean isConneted(int x, int y) {
return root(x) == root(y);
}
public boolean union(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
// ランクが高い方を常にx側で持つ
if (rank[x] < rank[y]) {
int temp = x;
x = y;
y = temp;
}
parent[y] = x;
if (rank[x] == rank[y]) rank[x]++;
size[x] += size[y];
minNode[x] = Math.min(minNode[x], minNode[y]);
value[x] += value[y];
componentSize--;
return true;
}
public int getSize(int x) {
return size[root(x)];
}
public int getMinNode(int x) {
return minNode[root(x)];
}
public int getComponentSize() {
return componentSize;
}
public int getValue(int x) {
return value[root(x)];
}
@Override
public String toString() {
return Arrays.toString(parent);
}
}
| ConDefects/ConDefects/Code/abc334_b/Java/53551976 |
condefects-java_data_991 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
static int MOD = 1000000007;
static int INF = Integer.MAX_VALUE/2;
static void run (final FastScanner scanner, final PrintWriter out) {
char[] ss = scanner.next().toCharArray();
char[] tt = scanner.next().toCharArray();
System.out.println(len(ss)==len(tt)?"Yes":"No");
}
private static int len(char[] ss) {
if (ss[0]>ss[1]) {
char tmp = ss[0];
ss[0]=ss[1];
ss[1]=tmp;
}
return Math.min(ss[1]-ss[0], -(ss[0]-ss[1]));
}
public static void main(final String[] args) {
PrintWriter out = new PrintWriter(System.out);
FastScanner scanner = new FastScanner();
try {
run(scanner, out);
} catch (Throwable e) {
throw e;
} finally {
out.flush();
}
}
static class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
}
}
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
static int MOD = 1000000007;
static int INF = Integer.MAX_VALUE/2;
static void run (final FastScanner scanner, final PrintWriter out) {
char[] ss = scanner.next().toCharArray();
char[] tt = scanner.next().toCharArray();
System.out.println(len(ss)==len(tt)?"Yes":"No");
}
private static int len(char[] ss) {
if (ss[0]>ss[1]) {
char tmp = ss[0];
ss[0]=ss[1];
ss[1]=tmp;
}
return Math.min(ss[1]-ss[0], (ss[0]+5-ss[1]));
}
public static void main(final String[] args) {
PrintWriter out = new PrintWriter(System.out);
FastScanner scanner = new FastScanner();
try {
run(scanner, out);
} catch (Throwable e) {
throw e;
} finally {
out.flush();
}
}
static class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
}
}
| ConDefects/ConDefects/Code/abc333_b/Java/52827523 |
condefects-java_data_992 |
import java.util.HashMap;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String S = scanner.next();
String T = scanner.next();
scanner.close();
int dis1 = distance(S);
// System.out.println("dis1");
// System.out.println(dis1);
int dis2 = distance(T);
// System.out.println("dis2");
// System.out.println(dis2);
if (dis1 == dis2) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
public static int distance(String s) {
int[][] disMatrix = { {0, 1, 2, 2, 1},
{1, 0, 1, 2, 2},
{2, 1, 0, 1, 2},
{2, 2, 1, 0, 1},
{1, 2, 2, 2, 0}};
HashMap<String, Integer> StringNumber = new HashMap<String, Integer>();
// Add keys and values (String, Number)
StringNumber.put("A", 0);
StringNumber.put("B", 1);
StringNumber.put("C", 2);
StringNumber.put("D", 3);
StringNumber.put("E", 4);
String firstS = s.substring(0, 1);
String secondS = s.substring(1, 2);
int distance = disMatrix[StringNumber.get(firstS)][StringNumber.get(secondS)];
return distance;
}
}
import java.util.HashMap;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String S = scanner.next();
String T = scanner.next();
scanner.close();
int dis1 = distance(S);
// System.out.println("dis1");
// System.out.println(dis1);
int dis2 = distance(T);
// System.out.println("dis2");
// System.out.println(dis2);
if (dis1 == dis2) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
public static int distance(String s) {
int[][] disMatrix = { {0, 1, 2, 2, 1},
{1, 0, 1, 2, 2},
{2, 1, 0, 1, 2},
{2, 2, 1, 0, 1},
{1, 2, 2, 1, 0}};
HashMap<String, Integer> StringNumber = new HashMap<String, Integer>();
// Add keys and values (String, Number)
StringNumber.put("A", 0);
StringNumber.put("B", 1);
StringNumber.put("C", 2);
StringNumber.put("D", 3);
StringNumber.put("E", 4);
String firstS = s.substring(0, 1);
String secondS = s.substring(1, 2);
int distance = disMatrix[StringNumber.get(firstS)][StringNumber.get(secondS)];
return distance;
}
}
| ConDefects/ConDefects/Code/abc333_b/Java/52174253 |
condefects-java_data_993 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int[][] l=new int[2][2];
for (int i=0;i<2;i++) {
String s=sc.next();
l[i][0]=s.charAt(0)-'A';
l[i][0]=s.charAt(1)-'A';
while (l[i][0]>0) {
l[i][0]=(l[i][0]+1)%5;
l[i][1]=(l[i][1]+1)%5;
}
}
if (l[0][1]==l[1][1] || l[0][1]+l[1][1]==5) {
System.out.println("Yes");
}else {
System.out.println("No");
}
sc.close();
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int[][] l=new int[2][2];
for (int i=0;i<2;i++) {
String s=sc.next();
l[i][0]=s.charAt(0)-'A';
l[i][1]=s.charAt(1)-'A';
while (l[i][0]>0) {
l[i][0]=(l[i][0]+1)%5;
l[i][1]=(l[i][1]+1)%5;
}
}
if (l[0][1]==l[1][1] || l[0][1]+l[1][1]==5) {
System.out.println("Yes");
}else {
System.out.println("No");
}
sc.close();
}
} | ConDefects/ConDefects/Code/abc333_b/Java/51419163 |
condefects-java_data_994 | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
String S = sc.next();
String T = sc.next();
System.out.println((Math.abs(S.charAt(0) - S.charAt(1)) == Math.abs(T.charAt(0) - T.charAt(1))) ? "Yes":
((Math.abs(S.charAt(0) - S.charAt(1)) == 4 && Math.abs(T.charAt(0) - T.charAt(1)) == 1)) ||
((Math.abs(T.charAt(0) - T.charAt(1)) == 4 && Math.abs(S.charAt(0) - S.charAt(1)) == 1)) ? "Yes":
((Math.abs(S.charAt(0) - S.charAt(1)) == 2 || Math.abs(S.charAt(0) - S.charAt(1)) == 3)) &&
((Math.abs(T.charAt(0) - T.charAt(1)) == 2 && Math.abs(T.charAt(0) - T.charAt(1)) == 3)) ? "Yes":"No");
}
private static class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
public boolean hasNext() { skipUnprintable(); return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
}
}
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
String S = sc.next();
String T = sc.next();
System.out.println((Math.abs(S.charAt(0) - S.charAt(1)) == Math.abs(T.charAt(0) - T.charAt(1))) ? "Yes":
((Math.abs(S.charAt(0) - S.charAt(1)) == 4 && Math.abs(T.charAt(0) - T.charAt(1)) == 1)) ||
((Math.abs(T.charAt(0) - T.charAt(1)) == 4 && Math.abs(S.charAt(0) - S.charAt(1)) == 1)) ? "Yes":
((Math.abs(S.charAt(0) - S.charAt(1)) == 2 || Math.abs(S.charAt(0) - S.charAt(1)) == 3)) &&
((Math.abs(T.charAt(0) - T.charAt(1)) == 2 || Math.abs(T.charAt(0) - T.charAt(1)) == 3)) ? "Yes":"No");
}
private static class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
public boolean hasNext() { skipUnprintable(); return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
}
} | ConDefects/ConDefects/Code/abc333_b/Java/54975458 |
condefects-java_data_995 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
public class Main {
static In in = new In();
static Out out = new Out();
static final long inf = 0x1fffffffffffffffL;
static final int iinf = 0x3fffffff;
static final double eps = 1e-9;
static long mod = 998244353;
List<List<Integer>> edges;
void solve() {
int n = in.nextInt();
edges = in.nextEdges(n, n - 1, false);
IntPair ret1 = dfs1(0, 0, 0, -1, null);
IntPair ret2 = dfs1(ret1.second, ret1.second, 0, -1, null);
int d = ret2.first;
dfs2(ret2.second, ret2.second, ret1.second);
List<Integer> leaf1 = new ArrayList<>();
List<Integer> leaf2 = new ArrayList<>();
dfs1(ret1.second, ret1.second, 0, d, leaf1);
dfs1(ret2.second, ret2.second, 0, d, leaf2);
long[] pow2 = new long[n + 1];
pow2[0]++;
for (int i = 0; i < n; i++) {
pow2[i + 1] = pow2[i] * 2 % mod;
}
if (d % 2 == 0) {
int center = road.get(d / 2);
long ans = 1;
int c = 0;
for (Integer child : edges.get(center)) {
List<Integer> list = new ArrayList<>();
dfs1(child, center, 1, d / 2, list);
ans = ans * ((list.size() + 1) % mod) % mod;
if (list.size() > 0) {
c++;
}
}
ans = (ans + mod - (c + 1) % mod) % mod;
out.println(ans);
} else {
out.println((long)leaf1.size() * leaf2.size() % mod);
}
}
IntPair dfs1(int node, int parent, int depth, int check, List<Integer> list) {
int maxDepth = depth;
int maxNode = node;
if (depth == check) {
list.add(node);
}
for (Integer child : edges.get(node)) {
if (child == parent) {
continue;
}
IntPair res = dfs1(child, node, depth + 1, check, list);
if (maxDepth < res.first) {
maxDepth = res.first;
maxNode = res.second;
}
}
return new IntPair(maxDepth, maxNode);
}
List<Integer> road = new ArrayList<>();
boolean dfs2(int node, int parent, int target) {
boolean ret = node == target;
for (Integer child : edges.get(node)) {
if (child == parent) {
continue;
}
boolean res = dfs2(child, node, target);
if (res) {
ret = true;
}
}
if (ret) {
road.add(node);
}
return ret;
}
class IntPair implements Comparable<IntPair> {
int first;
int second;
IntPair(int first, int second) {
this.first = first;
this.second = second;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof IntPair)) {
return false;
}
IntPair that = (IntPair)o;
return first == that.first && second == that.second;
}
@Override
public int hashCode() {
return first * 31 + second;
}
@Override
public int compareTo(IntPair o) {
return first == o.first ? Integer.compare(second, o.second) : Integer.compare(first, o.first);
}
@Override
public String toString() {
return String.format("[%d, %d]", first, second);
}
}
public static void main(String... args) {
new Main().solve();
out.flush();
}
}
class In {
private final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000);
private StringTokenizer tokenizer;
String next() {
try {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
tokenizer = new StringTokenizer(reader.readLine());
}
} catch (IOException ignored) {
}
return tokenizer.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
char[] nextCharArray() {
return next().toCharArray();
}
String[] nextStringArray(int n) {
String[] s = new String[n];
for (int i = 0; i < n; i++) {
s[i] = next();
}
return s;
}
char[][] nextCharGrid(int n, int m) {
char[][] a = new char[n][m];
for (int i = 0; i < n; i++) {
a[i] = next().toCharArray();
}
return a;
}
int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
int[] nextIntArray(int n, IntUnaryOperator op) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsInt(nextInt());
}
return a;
}
int[][] nextIntMatrix(int h, int w) {
int[][] a = new int[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextIntArray(w);
}
return a;
}
long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
long[] nextLongArray(int n, LongUnaryOperator op) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsLong(nextLong());
}
return a;
}
long[][] nextLongMatrix(int h, int w) {
long[][] a = new long[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextLongArray(w);
}
return a;
}
List<List<Integer>> nextEdges(int n, int m, boolean directed) {
List<List<Integer>> res = new ArrayList<>();
for (int i = 0; i < n; i++) {
res.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
res.get(u).add(v);
if (!directed) {
res.get(v).add(u);
}
}
return res;
}
}
class Out {
private final PrintWriter out = new PrintWriter(System.out);
boolean autoFlush = false;
void println(Object... args) {
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
out.println(Arrays.stream(args).map(obj -> {
Class<?> clazz = obj == null ? null : obj.getClass();
return clazz == byte[].class ? Arrays.toString((byte[])obj) :
clazz == short[].class ? Arrays.toString((short[])obj) :
clazz == int[].class ? Arrays.toString((int[])obj) :
clazz == long[].class ? Arrays.toString((long[])obj) :
clazz == char[].class ? Arrays.toString((char[])obj) :
clazz == float[].class ? Arrays.toString((float[])obj) :
clazz == double[].class ? Arrays.toString((double[])obj) :
clazz == boolean[].class ? Arrays.toString((boolean[])obj) :
obj instanceof Object[] ? Arrays.deepToString((Object[])obj) :
String.valueOf(obj);
}).collect(Collectors.joining(" ")));
if (autoFlush) {
out.flush();
}
}
void println(char[] s) {
out.println(String.valueOf(s));
if (autoFlush) {
out.flush();
}
}
void println(int[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (int i : a) {
joiner.add(Integer.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void println(long[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (long i : a) {
joiner.add(Long.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void flush() {
out.flush();
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
public class Main {
static In in = new In();
static Out out = new Out();
static final long inf = 0x1fffffffffffffffL;
static final int iinf = 0x3fffffff;
static final double eps = 1e-9;
static long mod = 998244353;
List<List<Integer>> edges;
void solve() {
int n = in.nextInt();
edges = in.nextEdges(n, n - 1, false);
IntPair ret1 = dfs1(0, 0, 0, -1, null);
IntPair ret2 = dfs1(ret1.second, ret1.second, 0, -1, null);
int d = ret2.first;
dfs2(ret2.second, ret2.second, ret1.second);
List<Integer> leaf1 = new ArrayList<>();
List<Integer> leaf2 = new ArrayList<>();
dfs1(ret1.second, ret1.second, 0, d, leaf1);
dfs1(ret2.second, ret2.second, 0, d, leaf2);
long[] pow2 = new long[n + 1];
pow2[0]++;
for (int i = 0; i < n; i++) {
pow2[i + 1] = pow2[i] * 2 % mod;
}
if (d % 2 == 0) {
int center = road.get(d / 2);
long ans = 1;
int c = 0;
for (Integer child : edges.get(center)) {
List<Integer> list = new ArrayList<>();
dfs1(child, center, 1, d / 2, list);
ans = ans * ((list.size() + 1) % mod) % mod;
if (list.size() > 0) {
c += list.size();
}
}
ans = (ans + mod - (c + 1) % mod) % mod;
out.println(ans);
} else {
out.println((long)leaf1.size() * leaf2.size() % mod);
}
}
IntPair dfs1(int node, int parent, int depth, int check, List<Integer> list) {
int maxDepth = depth;
int maxNode = node;
if (depth == check) {
list.add(node);
}
for (Integer child : edges.get(node)) {
if (child == parent) {
continue;
}
IntPair res = dfs1(child, node, depth + 1, check, list);
if (maxDepth < res.first) {
maxDepth = res.first;
maxNode = res.second;
}
}
return new IntPair(maxDepth, maxNode);
}
List<Integer> road = new ArrayList<>();
boolean dfs2(int node, int parent, int target) {
boolean ret = node == target;
for (Integer child : edges.get(node)) {
if (child == parent) {
continue;
}
boolean res = dfs2(child, node, target);
if (res) {
ret = true;
}
}
if (ret) {
road.add(node);
}
return ret;
}
class IntPair implements Comparable<IntPair> {
int first;
int second;
IntPair(int first, int second) {
this.first = first;
this.second = second;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof IntPair)) {
return false;
}
IntPair that = (IntPair)o;
return first == that.first && second == that.second;
}
@Override
public int hashCode() {
return first * 31 + second;
}
@Override
public int compareTo(IntPair o) {
return first == o.first ? Integer.compare(second, o.second) : Integer.compare(first, o.first);
}
@Override
public String toString() {
return String.format("[%d, %d]", first, second);
}
}
public static void main(String... args) {
new Main().solve();
out.flush();
}
}
class In {
private final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000);
private StringTokenizer tokenizer;
String next() {
try {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
tokenizer = new StringTokenizer(reader.readLine());
}
} catch (IOException ignored) {
}
return tokenizer.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
char[] nextCharArray() {
return next().toCharArray();
}
String[] nextStringArray(int n) {
String[] s = new String[n];
for (int i = 0; i < n; i++) {
s[i] = next();
}
return s;
}
char[][] nextCharGrid(int n, int m) {
char[][] a = new char[n][m];
for (int i = 0; i < n; i++) {
a[i] = next().toCharArray();
}
return a;
}
int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
int[] nextIntArray(int n, IntUnaryOperator op) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsInt(nextInt());
}
return a;
}
int[][] nextIntMatrix(int h, int w) {
int[][] a = new int[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextIntArray(w);
}
return a;
}
long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
long[] nextLongArray(int n, LongUnaryOperator op) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsLong(nextLong());
}
return a;
}
long[][] nextLongMatrix(int h, int w) {
long[][] a = new long[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextLongArray(w);
}
return a;
}
List<List<Integer>> nextEdges(int n, int m, boolean directed) {
List<List<Integer>> res = new ArrayList<>();
for (int i = 0; i < n; i++) {
res.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
res.get(u).add(v);
if (!directed) {
res.get(v).add(u);
}
}
return res;
}
}
class Out {
private final PrintWriter out = new PrintWriter(System.out);
boolean autoFlush = false;
void println(Object... args) {
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
out.println(Arrays.stream(args).map(obj -> {
Class<?> clazz = obj == null ? null : obj.getClass();
return clazz == byte[].class ? Arrays.toString((byte[])obj) :
clazz == short[].class ? Arrays.toString((short[])obj) :
clazz == int[].class ? Arrays.toString((int[])obj) :
clazz == long[].class ? Arrays.toString((long[])obj) :
clazz == char[].class ? Arrays.toString((char[])obj) :
clazz == float[].class ? Arrays.toString((float[])obj) :
clazz == double[].class ? Arrays.toString((double[])obj) :
clazz == boolean[].class ? Arrays.toString((boolean[])obj) :
obj instanceof Object[] ? Arrays.deepToString((Object[])obj) :
String.valueOf(obj);
}).collect(Collectors.joining(" ")));
if (autoFlush) {
out.flush();
}
}
void println(char[] s) {
out.println(String.valueOf(s));
if (autoFlush) {
out.flush();
}
}
void println(int[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (int i : a) {
joiner.add(Integer.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void println(long[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (long i : a) {
joiner.add(Long.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void flush() {
out.flush();
}
}
| ConDefects/ConDefects/Code/abc221_f/Java/26308476 |
condefects-java_data_996 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main implements Runnable { //Runnableを実装する
public static void main(String[] args) {
new Thread(null, new Main(), "", Runtime.getRuntime().maxMemory()).start(); //16MBスタックを確保して実行
}
final long mod = 998244353;
void dfs(int v, int[] parent, int[] depth, ArrayList<Integer>[] g) {
for (int u : g[v]) {
if (u == parent[v]) continue;
parent[u] = v;
depth[u] = depth[v] + 1;
dfs(u, parent, depth, g);
}
}
long dfs2(int v, int p, int d, int diameter, ArrayList<Integer>[] g) {
if (2 * d == diameter) return 1;
long ret = 0;
for (int u : g[v]) {
if (u == p) continue;
ret += dfs2(u, v, d+1, diameter, g);
}
return ret;
}
public void run() {
FastScanner sc=new FastScanner();
PrintWriter pw=new PrintWriter(System.out);
int N=sc.nextInt();
ArrayList<Integer>[] g=new ArrayList[N+N-1];
for (int i=0;i<g.length;++i) g[i]=new ArrayList<>();
for (int i=0;i<N-1;++i) {
int u=sc.nextInt()-1;
int v=sc.nextInt()-1;
int m=N+i;
g[u].add(m);
g[m].add(u);
g[m].add(v);
g[v].add(m);
}
N+= N;
int leaf = 0;
for (int i=0;i<N;++i) if (g[i].size() == 1) ++leaf;
if (leaf == 2) {
System.out.println(1);
return;
}
int[] depth = new int[N];
int[] parent = new int[N];
Arrays.fill(parent, -1);
dfs(0, parent, depth, g);
int nxt = 0;
for (int i=0;i<N;++i) if (depth[i] > depth[nxt]) nxt = i;
Arrays.fill(depth, 0);
Arrays.fill(parent, -1);
dfs(nxt, parent, depth, g);
int nxt2 = 0;
for (int i=0;i<N;++i) if (depth[i] > depth[nxt2]) nxt2 = i;
int diameter = depth[nxt2];
while (2 * depth[nxt2] != diameter) {
nxt2 = parent[nxt2];
}
long ans=1;
long sub=1;
for (int u : g[nxt2]) {
long c = dfs2(u, nxt2, 1, diameter, g);
ans *= 1 + c;
sub += c;
ans %= mod;
sub %= mod;
}
ans = (ans + mod - sub) % mod;
System.out.println(ans);
pw.close();
}
void tr(Object...o) {
System.out.println(Arrays.deepToString(o));
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
}
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main implements Runnable { //Runnableを実装する
public static void main(String[] args) {
new Thread(null, new Main(), "", Runtime.getRuntime().maxMemory()).start(); //16MBスタックを確保して実行
}
final long mod = 998244353;
void dfs(int v, int[] parent, int[] depth, ArrayList<Integer>[] g) {
for (int u : g[v]) {
if (u == parent[v]) continue;
parent[u] = v;
depth[u] = depth[v] + 1;
dfs(u, parent, depth, g);
}
}
long dfs2(int v, int p, int d, int diameter, ArrayList<Integer>[] g) {
if (2 * d == diameter) return 1;
long ret = 0;
for (int u : g[v]) {
if (u == p) continue;
ret += dfs2(u, v, d+1, diameter, g);
}
return ret;
}
public void run() {
FastScanner sc=new FastScanner();
PrintWriter pw=new PrintWriter(System.out);
int N=sc.nextInt();
ArrayList<Integer>[] g=new ArrayList[N+N-1];
for (int i=0;i<g.length;++i) g[i]=new ArrayList<>();
for (int i=0;i<N-1;++i) {
int u=sc.nextInt()-1;
int v=sc.nextInt()-1;
int m=N+i;
g[u].add(m);
g[m].add(u);
g[m].add(v);
g[v].add(m);
}
N+= N-1;
int leaf = 0;
for (int i=0;i<N;++i) if (g[i].size() == 1) ++leaf;
if (leaf == 2) {
System.out.println(1);
return;
}
int[] depth = new int[N];
int[] parent = new int[N];
Arrays.fill(parent, -1);
dfs(0, parent, depth, g);
int nxt = 0;
for (int i=0;i<N;++i) if (depth[i] > depth[nxt]) nxt = i;
Arrays.fill(depth, 0);
Arrays.fill(parent, -1);
dfs(nxt, parent, depth, g);
int nxt2 = 0;
for (int i=0;i<N;++i) if (depth[i] > depth[nxt2]) nxt2 = i;
int diameter = depth[nxt2];
while (2 * depth[nxt2] != diameter) {
nxt2 = parent[nxt2];
}
long ans=1;
long sub=1;
for (int u : g[nxt2]) {
long c = dfs2(u, nxt2, 1, diameter, g);
ans *= 1 + c;
sub += c;
ans %= mod;
sub %= mod;
}
ans = (ans + mod - sub) % mod;
System.out.println(ans);
pw.close();
}
void tr(Object...o) {
System.out.println(Arrays.deepToString(o));
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
} | ConDefects/ConDefects/Code/abc221_f/Java/28191474 |
condefects-java_data_997 | import java.io.*;
import java.math.BigDecimal;
import java.util.*;
public class Main {
static int[][] dirs = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
static int MOD = 998244353;
static int res,q,n;
static int t;
static Boolean[][] memo;
static int[] a,s,f;
static List<Integer>[] graph;
static double ans = 0.00;
/**
* 2 5 10 12 15 20
*
* @param args
* @throws IOException
*/
public static void main(String[] args) throws IOException {
Fastinanner3 in = new Fastinanner3(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = in.nextInt();
long k = in.nextLong();
long count = 0;
int res = 0;
Map<Long,Integer> maps = new HashMap<>();
maps.put(0L,1);
for(int i = 0 ; i < n;i++){
count+=in.nextLong();
res+=maps.getOrDefault(count-k,0);
maps.put(count,maps.getOrDefault(count,0)+1);
}
out.println(res);
in.close();
out.close();
}
static long modMinus(long n) {
return n < 0 ? n + MOD : n;
}
static long modPow(long base, long exponent) {
long result = 1;
long current = base;
while (exponent > 0) {
if ((exponent & 1) == 1) {
result = (result * current) % MOD;
}
current = (current * current) % MOD;
exponent >>= 1;
}
return result;
}
static long power(long a,long b,long m){
long p=a,ans=1;
for(int i=0;i<30;i++){
int wari=(1<<i);
if((b/wari)%2==1){
ans=(ans*p)%m;
}
p=(p*p)%m;
}
return ans;
}
/**
* 5
* 5 2 1 2 2
* 0 1
* 2
* 2
* 2
* @param key
* @return
*/
private static int length(Integer key) {
int ans = 0;
while(key > 0){
key/=10;
ans++;
}
return ans;
}
private static int calc(final int n, final long[] ns) {
Trie root = new Trie();
final int h = 29;
for (long a : ns){
int d = 1<<h;
Trie tr = root;
while (d > 0){
if ((a & d) == 0){
if (tr.next[0]==null)tr.next[0]=new Trie();
tr = tr.next[0];
}else {
if (tr.next[1]==null)tr.next[1]=new Trie();
tr = tr.next[1];
}
d >>= 1;
}
}
return todo(root, 1<<h);
}
private static int todo(Trie tr, int h){
int res = 0;
if(tr.next[0] != null){
int l = todo(tr.next[0], h>>1);
if (tr.next[1] != null){
int r = todo(tr.next[1], h>>1);
res = Math.min(l, r) + h;
}else {
res = l;
}
}else if (tr.next[1] != null){
res = todo(tr.next[1], h>>1);
}
return res;
}
private static long help(long[] dict, int pos, int left, int right) {
if(pos==-1){
return 0L;
}
int oneStart=right+1;
for(int i=left;i<=right;i++){
if(((dict[i]>>pos)&1)==1){
oneStart=i;
break;
}
}
if(oneStart==left||oneStart==right+1){
return help(dict,pos-1,left,right);
}else {
return (1<<pos)+Math.min(help(dict,pos-1,left,oneStart-1),help(dict,pos-1,oneStart,right));
}
}
private static void connect(int i, int j,int[] p,int[] cnt) {
int fi = father(i,p);
int fj = father(j,p);
if(fi != fj) {
p[fi] = fj;
cnt[fj] += cnt[fi];
}
}
static int father(int i,int[] p) {
if(p[i] == i) return i;
return p[i] = father(p[i],p);
}
private static long rationalMod(long p, long q,int MOD) {
return (p % MOD * pow(q, MOD - 2,MOD) % MOD) % MOD;
}
public static long pow (long x, long exp,int MOD){
if (exp==0) return 1;
long t = pow(x, exp/2,MOD);
t = t*t % MOD;
if (exp%2 == 0) return t;
return t*x % MOD;
}
/**
* 2 1
* 22 2 290+116 406 12 23 2*3
* 222 4
* 2222 8
* @param index
* @param max
* @param curr
* @param n
* @param m
*/
private static void dfs(int index,int max,double curr,int n,int m){
if(index > max){
return;
}
if(n == 0){
return;
}
if(m == 0){
ans+=curr;
return;
}
ans += (n/(double)(n+m))*curr;
if(m >= 3) {
dfs(index + 1, max, (m/(double)(n+m))*curr*((m-1)/(double)(n+m-1))*((m-2)/(double)(n+m-2))
//new BigDecimal(m).divide(new BigDecimal(n + m),
// 8,BigDecimal.ROUND_CEILING).multiply(curr).multiply
// (new BigDecimal(m - 1)
// .divide(new BigDecimal(n+m-1),8,BigDecimal.ROUND_CEILING)).multiply(new BigDecimal(m-2).divide(new BigDecimal(n+m-2),8,
// BigDecimal.ROUND_CEILING))
, n, m - 3);
}
if(m >= 2)
dfs(index+1,max,(m/(double)(n+m))*curr*((m-1)/(double)(n+m-1))*((n-1)/(double)(n+m-2)),n-1,m-2);
}
private static void dfs3(int u, int p, int l) {
t = Math.max(t, a[u] + l);
for(int v : graph[u]) {
if(v == p) continue;
dfs3(v, u, Math.min(2, l + 1));
}
}
private static void dfs2(int u, int p, int w) {
for(int v : graph[u]) {
if(v == p || f[v] == -1) continue;
if(f[v] + 1 == f[u]) {
int w2 = -1;
if(w != -1 || s[u] != -1) w2 = Math.max(w, s[u]) + 1;
if(w2 != -1) res = Math.max(res, f[v] + w2);
dfs2(v, u, w2);
} else {
int w2 = Math.max(w, f[u]) + 1;
res = Math.max(res, f[v] + w2);
dfs2(v, u, w2);
}
}
}
private static void dfs1(int u, int p) {
if(a[u] == t) {
f[u] = 0;
q = u;
}
for(int v : graph[u]) {
if(v == p) continue;
dfs1(v, u);
if(f[v] == -1) continue;
if(f[v] + 1 > f[u]) {
s[u] = f[u];
f[u] = f[v] + 1;
} else {
s[u] = Math.max(s[u], f[v] + 1);
}
}
}
private static boolean helper1(int index, int k, long target) {
if (k > n - index) {
return false;
}
if (index == n) {
return true;
}
if (k == 0) {
return false;
}
if (memo[index][k] != null) {
return memo[index][k];
}
long sum = 0;
for (int i = index; i < n; i++) {
sum += a[i];
if ((sum & target) != target) {
continue;
}
if (helper1(i + 1, k - 1, target)) {
return memo[index][k] = true;
}
}
return memo[index][k] = false;
}
private static boolean helper(int idx, int k, long target) {
if (k > n - idx) return false;
if (idx == n) return true;
if (k == 0) return false;
if (memo[idx][k] != null) return memo[idx][k];
long sum = 0;
for (int i = idx; i < n; i++) {
sum += a[i];
if ((sum & target) != target) continue;
if (helper(i + 1, k - 1, target)) return memo[idx][k] = true;
}
return memo[idx][k] = false;
}
static class Node1 {
Node1[] next = new Node1[2];
}
static Node1 root = new Node1();
private static void add(long x) {
Node1 curr = root;
for (int i = 39; i >= 0; i--) {
int a = (int) ((x >> i) & 1);
if (curr.next[a] == null) {
curr.next[a] = new Node1();
}
curr = curr.next[a];
}
}
private static long get(long x) {
long ans = 0;
Node1 curr = root;
for (int i = 39; i >= 0; i--) {
if (((x >> i) & 1) == 0) {
if (curr.next[1] != null) {
ans = ans * 2 + 1;
curr = curr.next[1];
} else {
ans = ans * 2;
curr = curr.next[0];
}
} else {
if (curr.next[0] != null) {
ans = ans * 2 + 1;
curr = curr.next[0];
} else {
ans = ans * 2;
curr = curr.next[1];
}
}
}
return ans;
}
public static boolean isPrime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) {
return false;
}
}
return true;
}
public void solve(int n, int[] c, int[] s) {
}
static class Node {
Node left;
Node right;
int v;
int l;
int r;
public Node(int x, int y) {
l = x;
r = y;
v = Integer.MAX_VALUE;
}
public int find(int x, int y) {
if (x > y) return Integer.MAX_VALUE;
if (l == x && r == y) return v;
int m = (l + r) >> 1;
if (left == null) left = new Node(l, m);
if (right == null) right = new Node(m + 1, r);
if (m >= y) {
return left.find(x, y);
} else if (m < x) {
return right.find(x, y);
} else {
return Math.min(left.find(x, m), right.find(m + 1, y));
}
}
public void update(int x, int y) {
v = Math.min(v, y);
if (l == r) return;
int m = (l + r) >> 1;
if (left == null) left = new Node(l, m);
if (right == null) right = new Node(m + 1, r);
if (m >= x) {
left.update(x, y);
} else {
right.update(x, y);
}
}
}
private static void delete(long a, int m, Trie1 trie) {
if (m == -1) return;
int bit = (a & (1L << m)) == 0 ? 0 : 1;
if (bit == 0) {
trie.left.flow--;
if (trie.left.flow == 0) {
trie.left = null;
} else {
delete(a, m - 1, trie.left);
}
} else {
trie.right.flow--;
if (trie.right.flow == 0) {
trie.right = null;
} else {
delete(a, m - 1, trie.right);
}
}
}
private static long query(long a, int m, Trie1 trie) {
if (trie == null || m == -1) return 0;
int bit = (a & (1L << m)) == 0 ? 0 : 1;
long res = 0;
if (bit == 0 && trie.right != null || bit == 1 && trie.left != null) {
res += 1L << m;
Trie1 child = bit == 0 ? trie.right : trie.left;
return res + query(a, m - 1, child);
}
Trie1 child = bit == 0 ? trie.left : trie.right;
return res + query(a, m - 1, child);
}
private static void add(long a, int m, Trie1 trie) {
if (m == -1) return;
int bit = (a & (1L << m)) == 0 ? 0 : 1;
Trie1 child = bit == 0 ? trie.left : trie.right;
if (bit == 0) {
if (trie.left == null) trie.left = new Trie1();
trie.left.flow++;
add(a, m - 1, trie.left);
} else {
if (trie.right == null) trie.right = new Trie1();
trie.right.flow++;
add(a, m - 1, trie.right);
}
}
static private class Trie1 {
Trie1 left, right;
int flow;
}
static class Trie{
Trie[] next;
public Trie(){
next = new Trie[2];
}
}
}
class Fastinanner3 {
private StringTokenizer tokenizer;
private BufferedReader reader;
public Fastinanner3(InputStream inputStream) {
reader = new BufferedReader(new InputStreamReader(inputStream));
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
String line;
try {
line = reader.readLine();
} catch (IOException e) {
return null;
}
if (line == null) {
return null;
}
tokenizer = new StringTokenizer(line);
}
return tokenizer.nextToken();
}
public String nextLine() {
String line;
try {
line = reader.readLine();
} catch (IOException e) {
return null;
}
return line;
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public void close() {
try {
reader.close();
} catch (IOException e) {
}
}
}
import java.io.*;
import java.math.BigDecimal;
import java.util.*;
public class Main {
static int[][] dirs = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
static int MOD = 998244353;
static int res,q,n;
static int t;
static Boolean[][] memo;
static int[] a,s,f;
static List<Integer>[] graph;
static double ans = 0.00;
/**
* 2 5 10 12 15 20
*
* @param args
* @throws IOException
*/
public static void main(String[] args) throws IOException {
Fastinanner3 in = new Fastinanner3(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = in.nextInt();
long k = in.nextLong();
long count = 0;
long res = 0;
Map<Long,Integer> maps = new HashMap<>();
maps.put(0L,1);
for(int i = 0 ; i < n;i++){
count+=in.nextLong();
res+=maps.getOrDefault(count-k,0);
maps.put(count,maps.getOrDefault(count,0)+1);
}
out.println(res);
in.close();
out.close();
}
static long modMinus(long n) {
return n < 0 ? n + MOD : n;
}
static long modPow(long base, long exponent) {
long result = 1;
long current = base;
while (exponent > 0) {
if ((exponent & 1) == 1) {
result = (result * current) % MOD;
}
current = (current * current) % MOD;
exponent >>= 1;
}
return result;
}
static long power(long a,long b,long m){
long p=a,ans=1;
for(int i=0;i<30;i++){
int wari=(1<<i);
if((b/wari)%2==1){
ans=(ans*p)%m;
}
p=(p*p)%m;
}
return ans;
}
/**
* 5
* 5 2 1 2 2
* 0 1
* 2
* 2
* 2
* @param key
* @return
*/
private static int length(Integer key) {
int ans = 0;
while(key > 0){
key/=10;
ans++;
}
return ans;
}
private static int calc(final int n, final long[] ns) {
Trie root = new Trie();
final int h = 29;
for (long a : ns){
int d = 1<<h;
Trie tr = root;
while (d > 0){
if ((a & d) == 0){
if (tr.next[0]==null)tr.next[0]=new Trie();
tr = tr.next[0];
}else {
if (tr.next[1]==null)tr.next[1]=new Trie();
tr = tr.next[1];
}
d >>= 1;
}
}
return todo(root, 1<<h);
}
private static int todo(Trie tr, int h){
int res = 0;
if(tr.next[0] != null){
int l = todo(tr.next[0], h>>1);
if (tr.next[1] != null){
int r = todo(tr.next[1], h>>1);
res = Math.min(l, r) + h;
}else {
res = l;
}
}else if (tr.next[1] != null){
res = todo(tr.next[1], h>>1);
}
return res;
}
private static long help(long[] dict, int pos, int left, int right) {
if(pos==-1){
return 0L;
}
int oneStart=right+1;
for(int i=left;i<=right;i++){
if(((dict[i]>>pos)&1)==1){
oneStart=i;
break;
}
}
if(oneStart==left||oneStart==right+1){
return help(dict,pos-1,left,right);
}else {
return (1<<pos)+Math.min(help(dict,pos-1,left,oneStart-1),help(dict,pos-1,oneStart,right));
}
}
private static void connect(int i, int j,int[] p,int[] cnt) {
int fi = father(i,p);
int fj = father(j,p);
if(fi != fj) {
p[fi] = fj;
cnt[fj] += cnt[fi];
}
}
static int father(int i,int[] p) {
if(p[i] == i) return i;
return p[i] = father(p[i],p);
}
private static long rationalMod(long p, long q,int MOD) {
return (p % MOD * pow(q, MOD - 2,MOD) % MOD) % MOD;
}
public static long pow (long x, long exp,int MOD){
if (exp==0) return 1;
long t = pow(x, exp/2,MOD);
t = t*t % MOD;
if (exp%2 == 0) return t;
return t*x % MOD;
}
/**
* 2 1
* 22 2 290+116 406 12 23 2*3
* 222 4
* 2222 8
* @param index
* @param max
* @param curr
* @param n
* @param m
*/
private static void dfs(int index,int max,double curr,int n,int m){
if(index > max){
return;
}
if(n == 0){
return;
}
if(m == 0){
ans+=curr;
return;
}
ans += (n/(double)(n+m))*curr;
if(m >= 3) {
dfs(index + 1, max, (m/(double)(n+m))*curr*((m-1)/(double)(n+m-1))*((m-2)/(double)(n+m-2))
//new BigDecimal(m).divide(new BigDecimal(n + m),
// 8,BigDecimal.ROUND_CEILING).multiply(curr).multiply
// (new BigDecimal(m - 1)
// .divide(new BigDecimal(n+m-1),8,BigDecimal.ROUND_CEILING)).multiply(new BigDecimal(m-2).divide(new BigDecimal(n+m-2),8,
// BigDecimal.ROUND_CEILING))
, n, m - 3);
}
if(m >= 2)
dfs(index+1,max,(m/(double)(n+m))*curr*((m-1)/(double)(n+m-1))*((n-1)/(double)(n+m-2)),n-1,m-2);
}
private static void dfs3(int u, int p, int l) {
t = Math.max(t, a[u] + l);
for(int v : graph[u]) {
if(v == p) continue;
dfs3(v, u, Math.min(2, l + 1));
}
}
private static void dfs2(int u, int p, int w) {
for(int v : graph[u]) {
if(v == p || f[v] == -1) continue;
if(f[v] + 1 == f[u]) {
int w2 = -1;
if(w != -1 || s[u] != -1) w2 = Math.max(w, s[u]) + 1;
if(w2 != -1) res = Math.max(res, f[v] + w2);
dfs2(v, u, w2);
} else {
int w2 = Math.max(w, f[u]) + 1;
res = Math.max(res, f[v] + w2);
dfs2(v, u, w2);
}
}
}
private static void dfs1(int u, int p) {
if(a[u] == t) {
f[u] = 0;
q = u;
}
for(int v : graph[u]) {
if(v == p) continue;
dfs1(v, u);
if(f[v] == -1) continue;
if(f[v] + 1 > f[u]) {
s[u] = f[u];
f[u] = f[v] + 1;
} else {
s[u] = Math.max(s[u], f[v] + 1);
}
}
}
private static boolean helper1(int index, int k, long target) {
if (k > n - index) {
return false;
}
if (index == n) {
return true;
}
if (k == 0) {
return false;
}
if (memo[index][k] != null) {
return memo[index][k];
}
long sum = 0;
for (int i = index; i < n; i++) {
sum += a[i];
if ((sum & target) != target) {
continue;
}
if (helper1(i + 1, k - 1, target)) {
return memo[index][k] = true;
}
}
return memo[index][k] = false;
}
private static boolean helper(int idx, int k, long target) {
if (k > n - idx) return false;
if (idx == n) return true;
if (k == 0) return false;
if (memo[idx][k] != null) return memo[idx][k];
long sum = 0;
for (int i = idx; i < n; i++) {
sum += a[i];
if ((sum & target) != target) continue;
if (helper(i + 1, k - 1, target)) return memo[idx][k] = true;
}
return memo[idx][k] = false;
}
static class Node1 {
Node1[] next = new Node1[2];
}
static Node1 root = new Node1();
private static void add(long x) {
Node1 curr = root;
for (int i = 39; i >= 0; i--) {
int a = (int) ((x >> i) & 1);
if (curr.next[a] == null) {
curr.next[a] = new Node1();
}
curr = curr.next[a];
}
}
private static long get(long x) {
long ans = 0;
Node1 curr = root;
for (int i = 39; i >= 0; i--) {
if (((x >> i) & 1) == 0) {
if (curr.next[1] != null) {
ans = ans * 2 + 1;
curr = curr.next[1];
} else {
ans = ans * 2;
curr = curr.next[0];
}
} else {
if (curr.next[0] != null) {
ans = ans * 2 + 1;
curr = curr.next[0];
} else {
ans = ans * 2;
curr = curr.next[1];
}
}
}
return ans;
}
public static boolean isPrime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) {
return false;
}
}
return true;
}
public void solve(int n, int[] c, int[] s) {
}
static class Node {
Node left;
Node right;
int v;
int l;
int r;
public Node(int x, int y) {
l = x;
r = y;
v = Integer.MAX_VALUE;
}
public int find(int x, int y) {
if (x > y) return Integer.MAX_VALUE;
if (l == x && r == y) return v;
int m = (l + r) >> 1;
if (left == null) left = new Node(l, m);
if (right == null) right = new Node(m + 1, r);
if (m >= y) {
return left.find(x, y);
} else if (m < x) {
return right.find(x, y);
} else {
return Math.min(left.find(x, m), right.find(m + 1, y));
}
}
public void update(int x, int y) {
v = Math.min(v, y);
if (l == r) return;
int m = (l + r) >> 1;
if (left == null) left = new Node(l, m);
if (right == null) right = new Node(m + 1, r);
if (m >= x) {
left.update(x, y);
} else {
right.update(x, y);
}
}
}
private static void delete(long a, int m, Trie1 trie) {
if (m == -1) return;
int bit = (a & (1L << m)) == 0 ? 0 : 1;
if (bit == 0) {
trie.left.flow--;
if (trie.left.flow == 0) {
trie.left = null;
} else {
delete(a, m - 1, trie.left);
}
} else {
trie.right.flow--;
if (trie.right.flow == 0) {
trie.right = null;
} else {
delete(a, m - 1, trie.right);
}
}
}
private static long query(long a, int m, Trie1 trie) {
if (trie == null || m == -1) return 0;
int bit = (a & (1L << m)) == 0 ? 0 : 1;
long res = 0;
if (bit == 0 && trie.right != null || bit == 1 && trie.left != null) {
res += 1L << m;
Trie1 child = bit == 0 ? trie.right : trie.left;
return res + query(a, m - 1, child);
}
Trie1 child = bit == 0 ? trie.left : trie.right;
return res + query(a, m - 1, child);
}
private static void add(long a, int m, Trie1 trie) {
if (m == -1) return;
int bit = (a & (1L << m)) == 0 ? 0 : 1;
Trie1 child = bit == 0 ? trie.left : trie.right;
if (bit == 0) {
if (trie.left == null) trie.left = new Trie1();
trie.left.flow++;
add(a, m - 1, trie.left);
} else {
if (trie.right == null) trie.right = new Trie1();
trie.right.flow++;
add(a, m - 1, trie.right);
}
}
static private class Trie1 {
Trie1 left, right;
int flow;
}
static class Trie{
Trie[] next;
public Trie(){
next = new Trie[2];
}
}
}
class Fastinanner3 {
private StringTokenizer tokenizer;
private BufferedReader reader;
public Fastinanner3(InputStream inputStream) {
reader = new BufferedReader(new InputStreamReader(inputStream));
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
String line;
try {
line = reader.readLine();
} catch (IOException e) {
return null;
}
if (line == null) {
return null;
}
tokenizer = new StringTokenizer(line);
}
return tokenizer.nextToken();
}
public String nextLine() {
String line;
try {
line = reader.readLine();
} catch (IOException e) {
return null;
}
return line;
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public void close() {
try {
reader.close();
} catch (IOException e) {
}
}
}
| ConDefects/ConDefects/Code/abc233_d/Java/45020936 |
condefects-java_data_998 | import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long k = sc.nextLong();
long[] sum = new long[n + 1];
sum[0] = 0;
int a = 0;
for(int i = 0 ; i < n ; i++) {
a = sc.nextInt();
sum[i + 1] = sum[i] + a;
}
Map<Long, Integer> map = new HashMap<>();
long ans = 0;
for(int i = n ; i >= 0 ; i--) {
ans += map.getOrDefault(sum[i] + k, 0);
map.put(sum[i] , 1);
}
System.out.println(ans);
}
}
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long k = sc.nextLong();
long[] sum = new long[n + 1];
sum[0] = 0;
int a = 0;
for(int i = 0 ; i < n ; i++) {
a = sc.nextInt();
sum[i + 1] = sum[i] + a;
}
Map<Long, Integer> map = new HashMap<>();
long ans = 0;
for(int i = n ; i >= 0 ; i--) {
ans += map.getOrDefault(sum[i] + k, 0);
map.put(sum[i] , map.getOrDefault(sum[i], 0) + 1);
}
System.out.println(ans);
}
} | ConDefects/ConDefects/Code/abc233_d/Java/45301353 |
condefects-java_data_999 | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int X = sc.nextInt();
int ans = 0;
for(int i = 0; i < N; i++){
int H = sc.nextInt();
if(X >= H){
ans += 1;
}
}
System.out.print(ans);
}
}
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int X = sc.nextInt();
int ans = 0;
for(int i = 0; i < N; i++){
int H = sc.nextInt();
if(X >= H){
ans += H;
}
}
System.out.print(ans);
}
} | ConDefects/ConDefects/Code/abc328_a/Java/49008742 |
condefects-java_data_1000 | import java.util.*;
class Main{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
String bef = sc.nextLine();
for (int i = 0; 2 * i <= bef.length(); i+=2){
System.out.print(bef.charAt(i+1));
System.out.print(bef.charAt(i));
}
}
}
import java.util.*;
class Main{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
String bef = sc.nextLine();
for (int i = 0; i + 1 <= bef.length(); i+=2){
System.out.print(bef.charAt(i+1));
System.out.print(bef.charAt(i));
}
}
}
| ConDefects/ConDefects/Code/abc293_a/Java/39966962 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.