/* created by krps 本体は120行目あたりのsolve()に書いてあります。 Good Luck! */ import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.math.BigDecimal; import java.util.AbstractMap; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.HashMap; import java.util.Map; import java.util.NoSuchElementException; import java.util.PriorityQueue; import java.util.Queue; public class Main { public static void main(String[] args) { for(int i=0;i<1;i++) { slover(); out.flush(); } } static FastScanner sc = new FastScanner(); static PrintWriter out = new PrintWriter(System.out); //Set a=new HashSet(); //Integer.toBinaryString(i); //Integer.toString(i, 2); // //Integer.parseInt(bin, 2); //bitset //StringBuffer S = new StringBuffer(sc.next()); //String hoge2 = str.reverse().toString(); //map.containsKey(A) //Map map = new HashMap(N); /*for ( キーのデータ型 key : マップの名前.keySet() ) { データのデータ型 data = マップの名前.get( key ); // keyやdataを使った処理; }*/ //int i = Integer.parseInt(s); //Queue qq=new ArrayDeque<>(); //add,poll,peek BFSは前から実行される //Deque dd=new ArrayDeque<>();//push後ろに入れる,poll(pop)後ろからとる,peek addは先頭に入るからバグ注意 //stackdfsは後ろから実行される //ArrayList cc = new ArrayList<>(N); //cc.contains(tmp) //Arrays.asList(c).contains("a") //list.set(1,"walk");//1 1 2 3 5 //PriorityQueue r=new PriorityQueue();//add poll public static class Pair extends AbstractMap.SimpleEntry implements Comparable> { public Pair(final K key, final V value) { super(key, value); } @Override public int compareTo(Pair o) { Comparable key = (Comparable)this.getKey(); Comparable key2 = (Comparable)o.getKey(); /*if (false) { Comparable key3 = (Comparable) this.getValue(); Comparable key4 = (Comparable) o.getValue(); if (key.compareTo(key2) == 0) { return key3.compareTo(key4); } }*/ return key.compareTo(key2); } } // 文字列として入力を取得 //private static long mod=1000000007; //private static long mod2=998244353; private static int INF =999999999; @SuppressWarnings("unused") private static long LINF=4000000000000000000L; private static boolean isPrime(long t) { if(t<2)return false; for(int i=2;i*i<=t;i++) { if(t%i==0)return false; } return true; } private static ArrayList Divisors(long t) { ArrayList c=new ArrayList(); for(long i=1;i*i<=t;i++) { if(t%i==0) { if(i*i!=t) { c.add(t/i); } c.add((long)i); } } return c; } private static ArrayList sortedfacto(long t) { ArrayList c=new ArrayList(); for(long i=2;i*i<=t;i++) { if(t%i==0) { p(t+" "+i); c.add((long)i); t/=i; i--; } } if(t!=1)c.add(t); Collections.sort(c); return c; } @SuppressWarnings("unused") private static long ncr(long n,long r) { long res=1; for(int i=0;i=0) { //p(t); res++; t=T.indexOf(v,t)+1; } return res; } private static int arrayMax(int a[]) { int res=0; for(int i=0;i> map = new HashMap<>(); // private static int ketawa(String S) { int res=0; for(int i=0;i void p(T t) {out.println(t);} private static void p() {out.println();} private static void p(graph.edge2[] e) { for (int i = 0; i < e.length; i++) { out.println(e[i].to+" "+e[i].cost); } } private static void doubleToString(double a) { System.out.println(BigDecimal.valueOf(a).toPlainString()); } private static int mod=1000000000+7; private static long A_[]; private static long memo[][]; private static ArrayList> c; private static int[] ArrayListToList(ArrayList c2,int[] v) {for(int i=0;i ListToArrayList(int[] v) {ArrayList c=new ArrayList<>(v.length);for(int i=0;i{ long a,b; D(long a,long b){ this.a=a; this.b=b; } @Override public int compareTo(D o) { Comparable key = (Comparable)this.a; Comparable key2 = (Comparable)o.a; Comparable key3 = (Comparable)this.b; Comparable key4 = (Comparable)o.b; if(key.compareTo(key2)==0) { return key3.compareTo(key4); } return key.compareTo(key2); } } private static long memo2[][]; private static long V(int N,int k) { //NをK回に切り分ける方法 //p(N+" "+k); if(k<=0)return 0; if(N<=k)return memo2[N][k]=0; if(N-k==1)return memo2[N][k]=1; if(k==1) { return memo2[N][k]=N-1; } if(memo2[N][k]!=-1)return memo2[N][k]; else { long res=0; for (int i = 1; N-i>=k-1; i++) { res+=V(N-i,k-1); } return memo2[N][k]=res; } } private static class segmentTree{ private static int maxN=1<<19,n; private static long dat[]=new long[2*maxN-1]; private static long tannigen=INF; static void init(int n_) { n=1; while(n0) { k=(k-1)/2; dat[k]=monoid(dat[k*2+1],dat[k*2+2]); } } static long get(int k) { k+=n-1; return dat[k]; } //a,bの最小値を求める static long query(int a,int b,int k,int l,int r) { if(r<=a||b<=l) { //p("Are "+a+ " "+b+" "+l+" "+r); return tannigen; } if(a<=l&&r<=b) { //p("Arara"); return dat[k]; } else { long A=query(a, b, k*2+1, l, (l+r)/2); long B=query(a, b, k*2+2, (l+r)/2, r); //p("? " + a+" "+b+" "+A+" "+B); return monoid(A,B); } } private static long monoid(long a,long b) { return min(a,b); } } private static int px,py; private static void slover(){ int X = sc.nextInt(), Y = sc.nextInt(); p(lcm(X, Y)); return; } static long modinv(long a,long mod) { long b=mod,u=1,v=0; while(b!=0) { long t=a/b; a-=t*b;long tem=a;a=b;b=tem; u-=t*v;tem=u;u=v;v=tem; } u%=mod; if(u<0)u+=mod; return u; } static long[] extendedGCD(long a, long b) { long s = 0, old_s = 1; long t = 1, old_t = 0; long r = b, old_r = a; while(r != 0) { long q = old_r / r; long old_s0 = old_s, old_t0 = old_t, old_r0 = old_r; old_s = s; s = old_s0 - q * s; old_t = t; t = old_t0 - q * t; old_r = r; r = old_r0 - q * r; } return new long[] {old_s, old_t}; } private static int upperBound(long A[],long value) { //A[i-1]<=valuevalue)return 0; if(A[A.length-1]<=value)return A.length; while(true) { G=(S+E)/2; if(A[G]>value&&A[G-1]<=value) { return G; }else if(A[G]>value) { E=G; }else if(A[G]<=value) { S=G; } } } private static Map dikstr2(int V,int E,int r,Map> m) { //最短距離を配列ではなく、mapで処理したい Map D = new HashMap<>(V); for (int i:m.keySet()) { D.put(i, LINF); } D.replace(r, 0L); PriorityQueue> p = new PriorityQueue<>();//add poll p.add(new Pair(0L, r)); while(!p.isEmpty()) { Pair x=p.poll(); int from=x.getValue(); if(x.getKey()>D.get(from))continue; if(!m.containsKey(from))continue; for (int i = 0; i < m.get(from).size(); i++) { graph.edge2 e=m.get(from).get(i); if(D.get(e.to)>D.get(from)+e.cost) { D.replace(e.to, D.get(from)+e.cost); p.add(new Pair(D.get(e.to), e.to)); } } } return D; } private static void rkaideikerubasyo(int FROM,int LIST[][],int cost,int r,int from,Map> m) { //r-1回の貯金と、costで行ける場所を全探索する関数 if(r<=0)return; for (int i = 0; i < m.get(from).size(); i++) { int to=m.get(from).get(i); LIST[FROM][to]=min(cost,LIST[FROM][to]); if(r!=1) { rkaideikerubasyo(FROM,LIST,cost,r-1,to,m); } } } private static void doubling(long K,int A[]) { int log2=0; while((1L<>1; } p(now+1); } private static void Topological_Sort(int V,Map> m) { int indegree[]=new int[V]; for(int i:m.keySet()) { for(int t:m.get(i)) { indegree[t]++; } } Queue qq = new ArrayDeque<>(); //add,poll,peek BFSは前から実行される for (int i = 0; i < indegree.length; i++) { if(indegree[i]==0)qq.add(i); } while(!qq.isEmpty()) { int v=qq.poll(); p(v); if(!m.containsKey(v))continue; for (int i = 0; i < m.get(v).size(); i++) { int u=m.get(v).get(i); indegree[u]--; if(indegree[u]==0)qq.add(u); } } } private static class graph{ static class edge implements Comparable{ int from,to,cost; public edge(int from,int to,int cost) { this.from=from; this.to=to; this.cost=cost; } @Override public int compareTo(edge o) { Comparable key = (Comparable)this.cost; Comparable key2 = (Comparable)o.cost; return key.compareTo(key2); } } static class edge2{ int to; long cost; public edge2(int to,long cost) { this.to=to; this.cost=cost; } } //単一始点最短距離問題(ダイクストラ法) 負閉路対策不可経路復元 private static long[] dikstr(int V,int E,int r,Map> m) { //int path[]=new int[V]; //Arrays.fill(path, -1); long d[]=new long[V]; Arrays.fill(d, LINF); d[r]=0; PriorityQueue> p = new PriorityQueue<>();//add poll p.add(new Pair(0L, r)); while(!p.isEmpty()) { Pair x=p.poll(); int from=x.getValue(); if(x.getKey()>d[from])continue; if(!m.containsKey(from))continue; for (int i = 0; i < m.get(from).size(); i++) { edge2 e=m.get(from).get(i); if(d[e.to]>d[from]+e.cost) { d[e.to]=d[from]+e.cost; p.add(new Pair(d[e.to], e.to)); //path[e.to]=from; } } } //経路復元 //複数の経路を考える必要がある時は、pathに複数の同じような最短経路の辺を保存しておく //ArrayList PATHs = new ArrayList<>(); //int t=V-1;//goalから逆算するこの場合0=goal //for(;t!=-1;t=path[t]) { // PATHs.add(t); //} //p(path); //Collections.reverse(PATHs); //System.out.println(PATHs); return d; } //単一始点最短距離問題(ベルマンフォード法) 負閉路対策済み private static int[] shortest_path(int V,int E,int r,edge e[]) { int d[]=new int[V]; //0~eのグラフはこれ //Map d = new HashMap<>();それ以外はこれ //for(int i=0;i(e[i].to, INF)); // if(!d.containsKey(e[i].from))m.add(new Pair(e[i].from, INF)); //} //d.replace(r, 0); Arrays.fill(d, INF); d[r]=0; int count=0; while(true) { boolean update =false; for(int i=0;i> p,int value) { if(p.size()==0)return -1; //A[i-1]=value)return 0; if(p.get(p.size()-1).getValue()=value&&p.get(G-1).getValue()=value) { E=G; }else if(p.get(G).getValue()> p,int value) { //A[i-1]=value)return 0; if(p.get(p.size()-1).getKey()=value&&p.get(G-1).getKey()=value) { E=G; }else if(p.get(G).getKey()n)return 0; if(k==n) { return 1;//全て1だけ } if(n<=0)return 0; if(k==0)return 0; if(dp[k][n]>=0)return dp[k][n]; return dp[k][n]=(dfs(k-1,n-1)+dfs(k*2,n))%mod; } static long len[]; static long psize[]; private static long sum(long x,int i) { if(x<=0) { //p(i+" D"); return 0; } if(i==0) { return 1; } if(x>len[i-1]+2) { //p(i+" A"+" "+x+" "+len[i]); return psize[i-1]+1+sum(x-2-len[i-1],i-1); }else if(x==len[i-1]+2) { //p(i+" B"+" "+x+" "+len[i]); return psize[i-1]+1; }else if(x==len[i-1]+1) { //p(i+" E"+" "+x+" "+len[i]); return psize[i-1]; } else { //p(i+" C"+" "+x+" "+len[i]); return sum(x-1,i-1); } } private static long Pow(long i,long t) { //iのt乗をO(log t)で返す long a=i; long res=1; //for(int i=0;i>1; } return res; } private static Map primeNumbers(long N) { Map c = new HashMap<>(); for(long i=2;i*i<=N;i++) { if(N%i==0) { int count=0; while(N%i==0) { N/=i; count++; } c.put(i, count); continue; } } if(N!=1) { c.put(N, 1); } return c; } /* * * * */ //=========================Union Find============================================= //union idx2 tree to idx1 tree O(a(N)) private static class Union_Find{ private static int find(int[] tree,int idx) {//木の根のindexを返す if(tree[idx]==idx) return idx; return tree[idx] = find(tree,tree[idx]); } private static void union_shape(int[] tree) {//木の根に直接つなげる経路圧縮 for(int i=0;ic.get(root2).size()) { //root2をroot1に移し替える for(int a:c.get(root2).keySet()) { if(!c.get(root1).containsKey(a)) { c.get(root1).put(a, 0); } c.get(root1).replace(a, c.get(root1).get(a)+c.get(root2).get(a)); } tree[root2] = root1; }else { for(int a:c.get(root1).keySet()) { if(!c.get(root2).containsKey(a)) { c.get(root2).put(a, 0); } c.get(root2).replace(a, c.get(root2).get(a)+c.get(root1).get(a)); } tree[root1] = root2; } //return tree; } } //=========================二分探索============================================= private static class binarySerch{ private static int BinarySearch(int A[],int value) { int S=0,E=A.length,G=-1; while(S<=E) { G=(S+E)/2; if(A[G]==value)return G; else if(A[G]>value) { if(E==G)break;E=G; }else if(A[G]=value)return 0; if(A[A.length-1]=value&&A[G-1]=value) { E=G; }else if(A[G]value)return 0; if(A[A.length-1]<=value)return A.length; while(true) { G=(S+E)/2; if(A[G]>value&&A[G-1]<=value) { return G; }else if(A[G]>value) { E=G; }else if(A[G]<=value) { S=G; } } } private static int lowerBound(long A[],long value) { //A[i-1]=value)return 0; if(A[A.length-1]=value&&A[G-1]=value) { E=G; }else if(A[G]value)return 0; if(A[A.length-1]<=value)return A.length; while(true) { G=(S+E)/2; if(A[G]>value&&A[G-1]<=value) { return G; }else if(A[G]>value) { E=G; }else if(A[G]<=value) { S=G; } } } private static int lowerBound(ArrayList A,int value) { //A[i-1]=value)return 0; if(A.get(A.size()-1)=value&&A.get(G-1)=value) { E=G; }else if(A.get(G) A,int value) { //A[i-1]<=valuevalue)return 0; if(A.get(A.size()-1)<=value)return A.size(); while(true) { G=(S+E)/2; if(A.get(G)>value&&A.get(G-1)<=value) { return G; }else if(A.get(G)>value) { E=G; }else if(A.get(G)<=value) { S=G; } } } private static int lowerBound(ArrayList A,long value) { //A[i-1]=value)return 0; if(A.get(A.size()-1)=value&&A.get(G-1)=value) { E=G; }else if(A.get(G) A,long value) { //A[i-1]<=valuevalue)return 0; if(A.get(A.size()-1)<=value)return A.size(); while(true) { G=(S+E)/2; if(A.get(G)>value&&A.get(G-1)<=value) { return G; }else if(A.get(G)>value) { E=G; }else if(A.get(G)<=value) { S=G; } } } } //=========================累積和==================================================== private static class cumlativeSum{ private static long GetCumulativeSum(long V[],int a,int b,int nindex) { //1-indexであるa-b間の和を求める要素の数はa-b+1個 if(nindex==0) {//0-indexの時は1-indexに変える a++;b++; } return V[b]-V[a-1]; } private static int GetCumulativeSum(int V[],int a,int b,int nindex) { //1-indexであるa-b間の和を求める要素の数はa-b+1個 if(nindex==0) {//0-indexの時は1-indexに変える a++;b++; } return V[b]-V[a-1]; } private static int[] nextIntCumulativeSum(int N) { int Csum[]=new int[N+1]; for(int i=1;i<=N;i++) { Csum[i]=sc.nextInt()+Csum[i-1]; } return Csum; } private static long[] nextLongCumulativeSum(int N) { long Csum2[]=new long[N+1]; for(int i=1;i<=N;i++) { Csum2[i]=sc.nextInt()+Csum2[i-1]; } return Csum2; } private static int getV(int S[][],int x,int y,int a,int b) { //p(S[x-1][y-1]+" "+S[x+a-1][y+b-1]+" "+S[x-1][y+b-1]+" "+S[x+a-1][y-1]); return S[x-1][y-1]+S[x+a-1][y+b-1]-S[x-1][y+b-1]-S[x+a-1][y-1]; } } private static int[] seg() { int N=sc.nextInt(); int V[]=new int[2*N]; Arrays.fill(V, INF); for(int i=N;i<2*N;i++) { V[i]=sc.nextInt(); } System.out.println(Arrays.toString(V)); for(int i=N;i>1; } return res; } private static long min(long ...a) { long m=a[0]; for(int i=0;i=0&&Queue[(index-1)/2]>value) { Queue[index]=Queue[(index-1)/2]; priority_queue_add(Queue,(index-1)/2,value); } if((index-2)/2>=0&&Queue[(index-2)/2]>value) { Queue[index]=Queue[(index-2)/2]; priority_queue_add(Queue,(index-2)/2,value); } } } @SuppressWarnings("unused") private static int priority_queue_getFirst(int[] Queue) { int res=Queue[0]; Queue[0]=Queue[Queue.length-1]; Queue[Queue.length-1]=INF; //System.out.println(Arrays.toString(Queue)); //大きさのチェック Q_shape(Queue,0); return res; } private static void Q_shape(int[] Queue,int index) { if(index*2+1=0;x--) { if(dp[x])dp[x+a[i]]=true; } } p(dp[K] ? "Yes":"No"); } /*********************************************************************/ //target以下までの値のindexを返す //target以上が欲しいときは返り値+1すればいい //0-indexで個数を求めるときはさらにindex+1する必要あり private static int lower_bound(long a[],long target) { //p(target+ " "+Arrays.toString(a)); if(a[0]>target)return -1; //最後の値がtarget以下であるときは最後のindexを返す。 //target以上が欲しいときは注意する必要あり if(a[a.length-1]<=target) return a.length-1; int S=-1; int E=a.length; while(Starget) { return G; }else if(a[G]<=target){ S=G; }else if(a[G]>target) { E=G; } } return -1; } static String nextPermutation(String s) { ArrayList list=new ArrayList(); for(int i=0;i=0;i--) { if(list.get(i)=L;i--) { if(pivot

提出日時	2020/12/20 20:56:45
問題	A: Happiness Number
ユーザ	popyopinya
言語	Java11 (11.0.9)
得点	0
結果	IE
実行時間	0 ms
メモリ	--- KB

セット名	得点 / 配点	テストケース名
結果		テストケース名
sample	0 / 0

all	100 / 100

セットごとの結果