矩形面积交 :给出两个矩形的两个相对顶点,计算他们的香蕉面积
if __name__ == "__main__":
x1,y1,x2,y2 = map(float,input().split())
x3,y3,x4,y4 = map(float,input().split())
if max(min(x1,x2),min(x3,x4)) < min(max(x1,x2),max(x3,x4)):
a = max(min(x1,x2),min(x3,x4))
b = min(max(x1,x2),max(x3,x4))
c = max(min(y1,y2),min(y3,y4))
d = min(max(y1,y2),max(y3,y4))
area = (b-a)*(d-c)
print('{0:.2f}'.format(area))
else:
print('不相交哦宝')
完美的代价
#第一步是判断有没有可能
#第二步在考虑怎么移动
def ifposs(s,n):
flag = 0
for i in s:
a = s.count(i)
if a%2 != 0:
if n%2 == 0 :
flag = -1
#print('偶数不可能')
return False
break
else :
flag = flag +1
if flag != 1 and n%2!=0:
#print ('奇数情况下不可能')
return False
if flag == 1 :
#print('奇数情况下的可能')
return True
if flag == 0:
#print('偶数ok')
return True
#上面这个函数就是判断有没有可能的
if __name__ == "__main__":
n = int(input())
str = list(input())
if ifposs(str,n):