import java.util.*;
class Main{
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
int a=scan.nextInt();
int b=scan.nextInt();
int c=scan.nextInt();
scan.close();
int x=gcd(a,b);
int num1=a*b/x;
int y=gcd(num1,c);
System.out.println(num1*c/y);
}
public static int gcd(int a,int b)
{
return b>0? gcd(b,a%b):a;
}
}
import java.util.*;
class Main{
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
int n=scan.nextInt();
scan.close();
int len=4*n+5;
int mid=len/2;
char[][] x=new char[len][len];
for(int i=0;i<=mid;i++)//左上三角
{
if(i==0||i==1)
{
for(int j=0;j<=i;j++)
x[i][j]='.';
}
else
{
for(int j=i;j>=0;j--)
{
if(j>=i-2)
{
if(i%2==0)
x[i][j]='$';
else
x[i][j]='.';
}
else if(j%2==0)
x[i][j]='$';
else
x[i][j]='.';
}
}
}
for(int i=0;i<mid;i++)//上三角
{
if(i%2==0)
{
x[i][i+1]='.';
for(int j=i+2;j<=mid;j++)
{
x[i][j]='$';
}
}
else
{
x[i][i+1]='$';
for(int j=i+2;j<=mid;j++)
{
x[i][j]='.';
}
}
}
for(int i=0;i<=mid;i++)
for(int j=0;j<=i;j++)
{
x[i][len-1-j]=x[i][j];//右上三角
x[len-1-i][j]=x[i][j];//左下三角
x[len-1-i][len-1-j]=x[i][j];//右下三角
}
for(int i=0;i<=mid;i++)
for(int j=i+1;j<=mid;j++)
{
x[i][len-1-j]=x[i][j];
x[len-1-i][j]=x[i][j];
x[len-1-i][len-1-j]=x[i][j];
}
for(int i=0;i<len;i++)
{
for(int j=0;j<len;j++)
{
System.out.print(x[i][j]);
}
System.out.println();
}
}
}
import java.io.*;
import java.util.*;
class Main{
public static void main(String[] args)
{
List<Integer> a=new ArrayList<Integer>();
Scanner scan=new Scanner(System.in);
int n=scan.nextInt();
String ss=scan.nextLine();//接受输入行数后的回车符
for(int i=1;i<=n;i++)
{
String s=scan.nextLine();
String[] b=s.split(" ");
//System.out.println(b.length);
int j=0;
while(j!=b.length)
{
if(b[j]!="")
a.add(Integer.parseInt(b[j]));
j++;
}
}
scan.close();
Collections.sort(a);
int start=a.get(0);
int count=0,i=0;
int rq=0,rc=0;
while(count!=2)
{
if(a.get(i)==start+i)
{
i++;
continue;
}
else if(a.get(i)>start+i)
{
rq=start+i;
start+=1;
count+=1;
}
else
{
rc=a.get(i);
start-=1;
count+=1;
}
}
System.out.print(rq+" "+rc);
}
}
import java.io.*;
import java.util.*;
class Main{
public static void main(String[] args)
{
List<Integer> a=new ArrayList<>();
Scanner scan=new Scanner(System.in);
String s1=scan.nextLine();
String s2=scan.nextLine();
for(int i=0;i<s1.length();i++)
{
if(s1.charAt(i)!=s2.charAt(i))
{
a.add(i);
}
}
scan.close();
int sum=0;
for(int i=0;i<a.size();i+=2)
{
sum+=a.get(i+1)-a.get(i);
}
System.out.println(sum);
}
}
import java.io.*;
import java.util.*;
class Main{
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
int n=scan.nextInt();
int[] a=new int[n+1];
for(int i=1;i<=n;i++)
{
a[i]=scan.nextInt();
}
scan.close();
int sum=0;
for(int i=1;i<=n;i++)
{
int l=a[i],r=a[i];
sum++;
for(int j=i+1;j<=n;j++)
{
if(a[j]>r) r=a[j];
if(a[j]<l) l=a[j];
if(r-l==j-i)
{
sum++;
}
}
}
System.out.println(sum);
}
}
import java.io.*;
import java.util.*;
class Main{
static int[][] a;
static int n;
static int sum=0;
static int temp=0;
static int vis=0;
static int key=0;
static List<Integer> b=new ArrayList<>();
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
n=scan.nextInt();
a=new int[n+1][n+1];
for(int i=0;i<n-1;i++)
{
int p=scan.nextInt();//起点
int q=scan.nextInt();//终点
int d=scan.nextInt();//距离
a[p][q]=a[q][p]=d;
b.add(0);
}
b.add(0);
b.add(0);
scan.close();
b.set(1,1);
DFS(1);
temp=0;
vis=0;
sum=0;
b.clear();
for(int i=0;i<=n;i++)
{
b.add(0);
}
b.set(key,1);
DFS(key);
//System.out.println(sum);
int fin=0;
for(int i=1;i<=sum;i++)
{
fin+=10+i;
}
System.out.println(fin);
}
static void DFS(int r)
{
for(int j=1;j<=n;j++)
{
if(a[r][j]!=0&&b.get(j)==0)
{
temp+=a[r][j];
vis=j;
b.set(j,1);
DFS(j);
if(temp>sum)
{
key=vis;
sum=temp;
}
temp-=a[r][j];
}
}
return;
}
}
import java.io.*;
import java.util.*;
class Main{
public static void main(String[] args)
{
String[] s= {"672159834","816357492","438951276","294753618",
"276951438","618753294","834159672","492357816"
};
Scanner scan=new Scanner(System.in);
String str="";
for(int i=0;i<9;i++)
{
str=str+scan.nextInt();
}
scan.close();
int num=0;
int key=-1;
//System.out.print(s);
for(int i=0;i<s.length;i++)
{
for(int j=0;j<9;j++)
{
if(j==8&&(s[i].charAt(j)==str.charAt(j)||str.charAt(j)=='0'))
{num++;key=i;}
else if(s[i].charAt(j)==str.charAt(j)||str.charAt(j)=='0')
continue;
else break;
}
}
if(num==1)
{
for(int i=0;i<9;i++)
{
System.out.print(s[key].charAt(i)+" ");
if(i==2||i==5||i==8)
System.out.println();
}
}
else
System.out.println("Too Many");
}
}
import java.io.*;
import java.util.*;
class Main{
static int root;
static point[] tree=new point[10005];
static class point{
public int value;
public int left;
public int right;
public int father;
point() {
this.value=0;
this.left=0;
this.right=0;
this.father=0;
}
}
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
String s=scan.nextLine();
scan.close();
String[] ss=s.split(" ");
root=Integer.parseInt(ss[0]);
for(int i=0;i<tree.length;i++)
tree[i]=new point();
for(int i=0;i<ss.length;i++)
{
int a=Integer.parseInt(ss[i]);
tree[a].value=a;
}
for(int i=1;i<ss.length;i++)
{
int a=Integer.parseInt(ss[i]);
int temp=root;
while(true)
{
if(a>temp)
{
if(tree[temp].right==0)
{
tree[temp].right=a;
tree[a].father=temp;
break;
}
else
{
temp=tree[temp].right;
}
}
else
{
if(tree[temp].left==0)
{
tree[temp].left=a;
tree[a].father=temp;
break;
}
else
{
temp=tree[temp].left;
}
}
}
}
String s1="";
String s2="";
DFS(root,s1,0,s2);
}
static void DFS(int start,String s1,int n,String s2)
{
if(tree[start].value==root)
s1=s1+tree[start].value;
else {
s1+="-|-";
s1+=tree[start].value;
}
if(tree[start].right>0)
{
s2+="1";
DFS(tree[start].right,s1,n+1,s2);
s2=s2.substring(0,s2.length()-1);
}
int len = s1.length();
int cot = 0;
for(int i = 0;i < len;i++) {
if(s1.charAt(i) == '|') {
if(s2.length() <= cot + 1 || s2.charAt(cot) != s2.charAt(cot + 1))
System.out.print("|");
else
System.out.print(".");
cot++;
} else if(cot < n) {
System.out.print(".");
} else {
System.out.print(s1.charAt(i));
}
}
if(tree[start].left > 0 || tree[start].right > 0)
System.out.print("-|");
System.out.println();
if(tree[start].left > 0) {
s2 = s2 + "0";
DFS(tree[start].left, s1, n + 1, s2);
s2 = s2.substring(0, s2.length() - 1);
}
}
}
import java.io.*;
import java.util.*;
class Main{
static boolean[][] know;
static int[][] examRoom;
static int n;
static int res=101;//记录最小的考场数
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
n=scan.nextInt();
know=new boolean[n+1][n+1];
examRoom=new int[n][n+1];
int m=scan.nextInt();
for(int i=0;i<m;i++)
{
int a=scan.nextInt();
int b=scan.nextInt();
know[a][b]=know[b][a]=true;
}
scan.close();
DFS(1,0);
System.out.println(res);
}
static void DFS(int id,int numRoom)
{
//考场数量大于或等于出现过的最小考场数量,不用继续往下了
if(numRoom>=res) return;
//考生编号大于考生人数,分配完了
if(id>n) {
res=Math.min(numRoom, res);
return;
}
//判断分配了的考场中考生是否认识
A:for(int i=0;i<numRoom;i++)
{
int num=examRoom[i][n];//获得当前考场的考生数
for(int j=0;j<num;j++) {
if(know[examRoom[i][j]][id]==true)//如果认识则判断下一个考场
continue A;
}
//如果当前考场的考生与编号id的考生都不认识,则加入
examRoom[i][examRoom[i][n]++]=id;
//判断下一个考生放在哪个考场
DFS(id+1,numRoom);
examRoom[i][n]--;
}
//遍历已分配的考场后都认识,则重新建立考场
examRoom[numRoom][examRoom[numRoom][n]++]=id;
DFS(id+1,numRoom+1);
--examRoom[numRoom][n];
}
}
import java.io.*;
import java.util.*;
class Main{
static boolean[][] vis=new boolean[10005][10005];
static int sum=0;
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
int n=scan.nextInt();
for(int i=0;i<n;i++)
{
int x1=scan.nextInt();//x1
int y1=scan.nextInt();//x2
int x2=scan.nextInt();//x3
int y2=scan.nextInt();//x4
tuse(x1,y1,x2,y2);
}
scan.close();
for(int i=0;i<vis.length;i++)
for(int j=0;j<vis[i].length;j++)
{
if(vis[i][j]==true)
sum+=1;
}
System.out.println(sum);
}
public static void tuse(int x1,int y1,int x2,int y2)
{
for(int i=x1;i<x2;i++)
for(int j=y1;j<y2;j++)
{
vis[i][j]=true;
}
}
}