owned this note
owned this note
Published
Linked with GitHub
# Answer
[TOC]
---
## b001
```python=
inp=input()
a={0}
a=inp.split()
for i in range(0,len(a),1):
a[i]=int(a[i])
while(a[0]!=0 and a[1]!=0):
if(a[0]>=a[1]):
a[0]=a[0]%a[1]
elif(a[0]<a[1]):
a[1]=a[1]%a[0]
if(a[0]!= 0):
print(a[0])
elif(a[1]!=0):
print(a[1])
```
或
```python
import math
inp=input()
a={0}
a=inp.split()
for i in range(0,len(a),1):
a[i]=int(a[i])
print(math.gcd(a[0],a[1]))
```
---
## b003
```python=
print("Hello,TCFSH!")
```
---
## b006
```python=
inp=input()
n={0}
n=inp.split()
for i in range(0,len(n),1):
n[i]=int(n[i])
print((n[0]+n[1])*int(n[2]/2))
```
---
## b012
```python=
X = 2
Y = 0
Z = 0
average=0
All = input()
X, Y, Z=All.split()
X = int(X)
Y = int(Y)
Z = int(Z)
average = ( ( X - 1 ) * Y + Z ) / X
if(average>=60):
print("PASS")
else:
print("FAIL")
```
---
## b014
```python=
inp=input()
n={0}
n=inp.split()
for i in range(0,len(n),1):
n[i]=int(n[i])
if(n[0]+n[1]>n[2]):
if(n[0]**2+n[1]**2>n[2]**2):
print("Acute Triangle")
elif(n[0]**2+n[1]**2==n[2]**2):
print("Right Triangle")
else:
print("Obtuse Triangle")
else:
print("NULL")
```
---
## b016
```python=
inp=input()
for i in range(int(inp)):
print("Hello, World!")
```
---
## b017
```python=
inp=input()
print(2**int(inp))
```
---
## b020
```python=
inp=input()
inp=int(inp)
for i in range(1,inp+1):
print('*'*i)
for i in range(inp,0,-1):
print('*'*i)
```
---
## b021
```python=
inp=input()
inp=int(inp)
a=set()
s=list()
if(inp==1):
print(1)
else:
for i in range(1,int(inp/2)+1):
if(inp%i==0):
a.add(i)
s.append(i)
for i in range(len(a)):
a.add(int(inp/s[i]))
a=sorted(a)
for i in a:
print(i,end=' ')
```
---
## b022
50%
```python=
inp=input()
inp=int(inp)
j=[0]
if(inp>2):
j[0]=2
for i in range(3,inp,2):
c=0
for k in j:
c+=1
if(i%k==0):
break
if(c==len(j)):
j.append(i)
for i in range(len(j)-1):
print(j[i],end=' ')
print(j[len(j)-1])
```
---
## b027
```python=
inp=input()
n=[0]
n=inp.split()
for i in range(0,len(n),1):
n[i]=int(n[i])
a=n[0]
n[0]=-1
k=[0]
k.pop(0)
for i in range(0,a+1):
k.append(n[i])
k.sort()
print(str(n.index(k[a]))+" "+str(k[a])+" "+str(n.index(k[1]))+" "+str(k[1]))
```
---
## b029
```python=
p=input()
a=0
b=0
a,b=p.split()
a=int(a)
b=int(b)
for i in range(a):
all=0
inp=input()
n1={0}
n1=inp.split()
inp=input()
n2={0}
n2=inp.split()
for k in range(0,len(n1),1):
n1[k]=int(n1[k])
for k in range(0,len(n2),1):
n2[k]=int(n2[k])
n1.sort()
n2.sort()
for w in range(b):
all=all+n1[w]*n2[w]
print(all)
```
---
## b036
```python=
A=[None]
B=[None]
n=1
ANumber=0
BNumber=0
A.append(input())
A.pop(0)
while(True):
A.append(input())
if(A[n]=='0'):
A.pop(0)
break
n+=1
for i in range(0,n,1):
for k in range(0,i,1) :
if(A[i]==A[k]):
ANumber+=1
break
ANumber=n-ANumber
n=1
B.append(input())
B.pop(0)
while(True):
B.append(input())
if(B[n]=='0'):
B.pop(0)
break
n+=1
for i in range(0,n,1):
for k in range(0,i,1) :
if(B[i]==B[k]):
BNumber+=1
break
BNumber=n-BNumber
if(ANumber>BNumber):
print('A')
elif(ANumber<BNumber):
print('B')
else:
print("Equal")
```