IUOYT%$WV^HGrfsxnbl8ifrz7hyryryryryryrN(OR76975483232uwrgh
# a,b,c = map(int,input().split())
# v = 1
# while not (v%a==0 and v%b==0 and v%c==0) :
# v+=1
# print(v)
# import copy
#
# data = list(map(int,input().split()))
#
# a = copy.deepcopy(data)
#
# data.clear()
#
# print(a)
# for i in range(len(data)) :
# print(data[i])
# for x in data :
# print(x)
'''a = [1,3,4,7,4,5,1]
print(sum(a))
print(max(a))
print(min(a))
print(len(a))
a.sort()
print(a)
a.reverse()
print(a)
a.append(12)
print(a)
a.insert(2,100)
print(a)
a.pop()
print(a)
b = a.pop()
print(b)
print(a)
a.pop(3) #3번째 데이터 삭제
print(a)
a.append(4)
a.append(4)
print(a)
print(a.count(4))
print(a.index(50)) # 50의 위치 리턴
a.remove(7) #7값을 찾아서 삭제
a = int(input())
b = list(map(int,input().split()))
for i in range(1,24,1) :
print(b.count(i),end=' ')'''
# a = int(input())
# b = list(map(int,input().split()))
# b.reverse()
# for i in range(0,len(b),1) :
# print(b[i],end=' ')
# a = int(input())
# b = list(map(int,input().split()))
# print(min(b))
# a = int(input())
# for i in range(5):
#
# a = [ [0 for i in range(10)] for j in range(10) ]
# print(a)
# 가로 w, 세로 h인 이차원 배열 만들기
# a = []
# w, h = 10,10
# for i in range(h) :
# a.append(list(map(int,input().split())))
# # a.append([0]*w)
#
# print(a)
# a[0][0] = 10
#
# print(a)
# a = [[0 for i in range(20)] for j in range(20)]
# b = int(input())
# for i in range(b) :
# c = list(map(int,input().split()))
# a[c[0]][c[1]] = 1
# for i in range(1,20):
# for j in range(1,20):
# print(a[i][j],end='')
# if j!=19 :
# print(' ',end='')
# if(i==19):
# print('',end='')
# else:
# print('')
# a = []
# w,h = 20,20
# for i in range(0,19):
# a.append(list(map(int,input().split())))
# x = int(input())
# for i in range(x):
# c = list(map(int,input().split()))
# for j in range(0,19):
# if not j==c[0]-1:
# a[j][c[1]-1] = int(not a[j][c[1]-1])
# if not j==c[1]-1:
# a[c[0]-1][j] = int(not a[c[0]-1][j])
# for i in range(0,19):
# for j in range(0,19):
# print(a[i][j],end='')
# if j!=18:
# print(' ',end='')
# if i != 18:
# print('')
# y,x = map(int,input().split())
# a = [[0 for i in range(x)] for j in range(y)]
# c = int(input())
# for i in range(c):
# v = list(map(int,input().split()))
# v[3] -= 1
# v[2] -= 1
# for j in range(v[0]):
# if v[1]==0:
# #if j + v[3] > x-1:
# # break
# a[v[2]][j + v[3]] = 1
# else :
# #if j + v[2] > y-1:
# # break
# a[j + v[2]][v[3]] = 1
# for i in range(y):
# for j in range(x):
# print(a[i][j],end = '')
# if j != x-1:
# print(' ',end='')
# if i != y-1:
# print('')
# a = []
# for i in range(10):
# a.append(list(map(int,input().split())))
# x = 1
# y = 1
# while 1 :
# if a[y][x]==2 :
# a[y][x]=9
# break
# a[y][x] = 9
# if a[y][x+1]!=1:
# x += 1
# elif a[y][x+1]==1 and a[y+1][x]!=1:
# y+=1
# else :
# break
# for i in range(10):
# for j in range(10):
# print(a[i][j],end='')
# if j!=9:
# print(' ',end='')
# if i != 9:
# print('')
# # 이차원배열 정렬
# a = [ [1,3] , [3,2] , [2,7] ]
# a.sort(key = lambda x : -x[1])
# print(a)
#
# a = []
# 1805
# 3015
# 3019
# 3108
# a = int(input())
# b= []
# for i in range(a):
# b.append(list(map(int,input().split())))
# b.sort(key= lambda x : x[0])
# for i in range(a):
# print(b[i][0],b[i][1])
# a,b = map(int,input().split())
# c = []
# for i in range(a):
# c.append(list(input().split()))
# c[i][1] = int(c[i][1])
# c.sort(key= lambda x : -x[1])
# for i in range(b):
# print(c[i][0])
# a = list(map(int,input('').split()))
# print(a)
# a = list(input())
# print(a)
# a = list(map(int, a))
# print(a)
# 스택 stack : 쌓는거, 나중에들어온게 먼저나가는 구조, 후입선출 -> Last In First Out -> LIFO
# st = []
#
# st.append("hello")
# st.pop()
# top -> len(st)-1
# stack의 구조 활용 문제
# 1. 3117 2016 3102 -> 스택연습
# 2. 3127 3130 -> 리얼 스택 활용
# a = []
# c = 0
# x = int(input())
# for i in range(x):
# n = int(input())
# if n!=0:
# a.append(n)
# else:
# a.pop()
# for i in range(len(a)):
# c += a[i]
# print(c)
# a = int(input())
# x = list(map(int,input()))
# c = []
# x.reverse()
# for i in range(len(x)):
# c.append(x[i])
# if (i+1)%3==0 and i!= len(x)-1:
# c.append(',')
# c.reverse()
# for i in range(len(c)):
# print(c[i],end='')
# a = int(input())
# sk = []
# for i in range(a):
# x = input()
# if x == 'top()':
# if len(sk)==0:
# print(-1)
# continue
# print(sk[len(sk)-1])
# elif x =='pop()' and len(sk) != 0:
# sk.pop()
# elif x == 'size()':
# print(len(sk))
# elif x == 'empty()' :
# print('true' if len(sk)==0 else 'false')
# elif x[1] =='u' :
# sk.append(int(x[6:-2]))
# #print(int(x[6:-2]))
# a = list(input().split())
# jsby = [] # 정수배열 jungsubaeyeol
# def ys(x): # 연산 yeonsan
# jsby.pop()
# jsby.pop()
# jsby.append(x)
#
# for i in range(len(a)):
# if a[i]=='+':
# x = jsby[-1] + jsby[-2]
# ys(x)
# elif a[i]=='-':
# x = jsby[-2] - jsby[-1]
# ys(x)
# elif a[i]=='*':
# x = jsby[-1] * jsby[-2]
# ys(x)
# else:
# jsby.append(int(a[i]))
# # print(jsby[-1])
# print(jsby[0])
# 소들의 헤어스타일 1
# import sys
# sys.setrecursionlimit(78956727)
# a = int(input())
# st = []
# count = 0
# def ax (gap):
# global st,count
# #print(st,count)
# if len(st) > 0 and (st[-1] <= gap or (gap == -1 and len(st) > 1 and st[-1] < st[-2])):
# st.pop()
# count += len(st)
# ax(gap)
# return
# for i in range(a):
# x = int(input())
# ax(x)
# st.append(x)
# ax(-1)
# print(count)
# a = int(input())
# st = []
# count = 0
# for i in range(a):
# if i<a:
# x = int(input())
# # print(st,count)
# if i > 0 and st[-1] <= x:
# for j in range(len(st)):
# if st[-1] <= x:
# st.pop()
# else:
# break
# if len(st) > 0 and st[-1] > x:
# count += len(st)
# if i<a:
# st.append(x)
# print(count)
# a = int(input())
# st = []
# wg = 0 # w(hat i lookin)g
# x = list(map(int,input().split()))
# for i in range(a):
# if len(st)==0:
# st.append([x[i],i])
# print('0',end='')
# continue
# # print('\n asdfasdf',st[-1][0], st[-1][1], len(st), x[i])
# while len(st)!=0 and x[i] >= st[-1][0]:
# st.pop()
# #print(st)
#
# if len(st)!=0:
# # print('asdfasdf2',st[-1][0],st[-1][1],i,x[i])
# print('',st[-1][1]+1,end='')
# else:
# print(' 0',end='')
# st.append([x[i],i])
# a = int(input())
# b = list(map(int,input().split()))
# c = int(input())
# d = list(map(int,input().split()))
# import sys
# sys.setrecursionlimit(134589730)
# def s(sp,ep,tr):
# c = sp+((ep-sp)//2)
# # print('check',sp,ep,tr,c,b[c])
# if tr==b[c]:
# return c
# elif c==0 or c==ep:
# return -2
# elif tr < b[c]:
# return s(sp,c-1,tr)
# elif tr > b[c]:
# return s(c+1,ep,tr)
# for i in range(c):
# print(int(s(0,a-1,d[i]))+1,end=' ')
# a = int(input())
# k = list(map(int,input().split()))
# t = list(map(int,input().split()))
# z = [[2,1],[2,-1],[-2,1],[-2,-1],[1,2],[-1,2],[1,-2],[-1,-2]]
# maps = [[0 for i in range(1000)] for j in range(1000)]
# x = []
# k[0]-=1
# k[1]-=1
# k.append(0)
# x.append(k)
# min = -1
#
# while 1:
# x0 = x[0][0]
# y0 = x[0][1]
# c = x[0][2]
# if maps[x0][y0]==1:
# x.pop(0)
# continue
# maps[x0][y0]=1
# print([x0,y0,c],t,min)
# if x0+1 == t[0] and y0+1 == t[1]:
# print(c)
# break
# for i in range(8):
# x1 = x0 + z[i][0]
# y1 = y0 + z[i][1]
# tt = t[0]+t[1]
# if (x1 < a and x1 >= 0) and (y1 < a and y1 >= 0):
# if ((abs((x1+y1+2)-tt) <= min or min==-1 or min < 15)):
# min = abs((x1+y1+2)-tt)
# x.append([x1,y1,c+1])
# x.pop(0)
# import sys
# sys.setrecursionlimit(45867345)
# n,m,k = map(int,input().split())
# maps = [[0 for i in range(m)] for j in range(n)]
# count = 0
# t = []
# def jG(pos): # jaeGuei 재귀
# #print(pos)
# gap = 0
# global n,maps
# y = pos[0]
# x = pos[1]
# maps[y][x]=1
# if y + 1 < n and maps[y+1][x]==0:
# gap += jG([y+1,x])+1
# if y - 1 >= 0 and maps[y-1][x]==0:
# gap += jG([y-1,x])+1
# if x + 1 < m and maps[y][x+1]==0:
# gap += jG([y,x+1])+1
# if x - 1 >= 0 and maps[y][x-1]==0:
# gap += jG([y,x-1])+1
# return gap
#
# def jg(x0,y0,x1,y1): # JiksagakheongmandulGe 직사각형 만들기
# global maps
# for i in range(y0,y1):
# for j in range(x0,x1):
# maps[i][j]=1
# for i in range(k):
# g,h,j,l = map(int,input().split())
# jg(g,h,j,l)
# for i in range(n):
# for j in range(m):
# if maps[i][j]==0:
# count += 1
# t.append(jG([i,j])+1)
# print(count)
# t.sort()
# for i in range(len(t)):
# print(t[i],end=' ')
# DfSsSsSsSsSsSs Friedractice >:3
# n,m = map(int,input().split())
# a = []
# for i in range(n):
# a.append(list(map(int,input().split())))
# q = []
# q.append([0,0,0])
# while 1:
# if len(q)==0:
# print(0)
# break
# y = q[0][0]
# x = q[0][1]
# s = q[0][2]
# #print(y,x,s)
# if y==n-1 and x==m-1:
# print(s+1)
# break
# if a[y][x] ==-1:
# q.pop(0)
# continue
# gap = a[y][x]
# a[y][x] = -1
# #past = q[0][4]
# if y+1 < n and abs(a[y+1][x]-gap) < 2:
# q.append([y+1,x,s+1])
# if y-1 >= 0 and abs(a[y-1][x]-gap) < 2:
# q.append([y-1,x,s+1])
# if x+1 < m and abs(a[y][x+1]-gap) < 2:
# q.append([y,x+1,s+1])
# if x-1 >= 0 and abs(a[y][x-1]-gap) < 2:
# q.append([y,x-1,s+1])
# q.pop(0)
# py
# 문법, 자료구조, + 클래스, 상속
# 라이브러리
'''
class Person :
air = "good" # 클래스끼리 공유하는 변수
def __init__(self,name,age): # 생성자 constructor
self.name = name # 객체당 생기는 변수
self.age = age
def setname(self,name):
self.name = name
def speak(self):
print("안녕하세요 저는 ",self.name,"입니다")
a = Person("서현",50)
a.speak()
a.setname("현서")
a.speak()
b = Person("aa",500)
b.setname("선생님")
b.speak()
b.age = 5000
print(b.age)
print(a.air)
stus = []
stus.append(Person("현서",100))
# /$$ /$$ /$$$$$$ /$$ /$$ /$$$$$$$ /$$ /$$ /$$ /$$ /$$ /$$ /$$ /$$ /$$$$$$ /$$$$$$ /$$$$$$ /$$$$$$ /$$ /$$ /$$$$$$
#| $$ | $$ /$$__ $$| $$ /$$/| $$__ $$| $$ | $$ | $$$ | $$| $$ | $$| $$$ | $$ /$$__ $$ /$$__ $$ /$$__ $$|_ $$_/ | $$ /$$//$$__ $$
#| $$ | $$| $$ \ $$| $$ /$$/ | $$ \ $$| $$ | $$ | $$$$| $$| $$ | $$| $$$$| $$ | $$ \__/| $$ \ $$ | $$ \__/ | $$ \ $$ /$$/| $$ \ $$
#| $$$$$$$$| $$$$$$$$| $$$$$/ | $$$$$$$ | $$ | $$ | $$ $$ $$| $$ | $$| $$ $$ $$ | $$$$$$ | $$$$$$$$ | $$ /$$$$ | $$ \ $$$$/ | $$$$$$$$
#| $$__ $$| $$__ $$| $$ $$ | $$__ $$| $$ | $$ | $$ $$$$| $$ | $$| $$ $$$$ \____ $$| $$__ $$ | $$|_ $$ | $$ \ $$/ | $$__ $$
#| $$ | $$| $$ | $$| $$\ $$ | $$ \ $$| $$ | $$ | $$\ $$$| $$ | $$| $$\ $$$ /$$ \ $$| $$ | $$ | $$ \ $$ | $$ | $$ | $$ | $$
#| $$ | $$| $$ | $$| $$ \ $$| $$$$$$$/| $$$$$$/ | $$ \ $$| $$$$$$/| $$ \ $$ | $$$$$$/| $$ | $$ | $$$$$$/ /$$$$$$ | $$ | $$ | $$
#|__/ |__/|__/ |__/|__/ \__/|_______/ \______/ |__/ \__/ \______/ |__/ \__/ \______/ |__/ |__/ \______/ |______/ |__/ |__/ |__/
2^66
학생 관리 프로그램
-> 학생 추가(있는학생은 추가못하게), 학생 삭제(없는학생 삭제불가), 학생 검색, 학생 출력
학생 필수 필드 : 나이, 이름, 학번
print('\033[95m' + '안녕' + '\033[96m' + '하세요' + '\033[0m')
''''''
hakbu = []
text = ''
print('\033[38;5;9m프\033[38;5;214m로\033[38;5;226m그\033[38;5;34m램_\033[38;5;21m__\033[38;5;57m__\033[38;5;13m___')
#print('\033[95m' + '안녕' + '\033[96m' + '하세요' + '\033[0m')
import os
class hs: # HakSangs
def __init__(self,name,age,hb):
self.age = age
self.name = name
self.hb = hb
self.ss = 0
def nuejalgulreatda(self):
self.ss += 1
def c():
os.system('cls')
class f:
R = '\033[0m'
Lime = '\033[38;5;10m'
Red = '\033[38;5;9m'
print('\033[32m /$$ /$$ /$$$$$$ /$$ /$$ /$$$$$$$ /$$ /$$ /$$ /$$ /$$ /$$ /$$ /$$ /$$$$$$ /$$$$$$ /$$$$$$ /$$$$$$ /$$ /$$ /$$$$$$ \n| $$ | $$ /$$__ $$| $$ /$$/| $$__ $$| $$ | $$ | $$$ | $$| $$ | $$| $$$ | $$ /$$__ $$ /$$__ $$ /$$__ $$|_ $$_/ | $$ /$$//$$__ $$\n| $$ | $$| $$ \ $$| $$ /$$/ | $$ \ $$| $$ | $$ | $$$$| $$| $$ | $$| $$$$| $$ | $$ \__/| $$ \ $$ | $$ \__/ | $$ \ $$ /$$/| $$ \ $$\n| $$$$$$$$| $$$$$$$$| $$$$$/ | $$$$$$$ | $$ | $$ | $$ $$ $$| $$ | $$| $$ $$ $$ | $$$$$$ | $$$$$$$$ | $$ /$$$$ | $$ \ $$$$/ | $$$$$$$$\n| $$__ $$| $$__ $$| $$ $$ | $$__ $$| $$ | $$ | $$ $$$$| $$ | $$| $$ $$$$ \____ $$| $$__ $$ | $$|_ $$ | $$ \ $$/ | $$__ $$\n| $$ | $$| $$ | $$| $$\ $$ | $$ \ $$| $$ | $$ | $$\ $$$| $$ | $$| $$\ $$$ /$$ \ $$| $$ | $$ | $$ \ $$ | $$ | $$ | $$ | $$\n| $$ | $$| $$ | $$| $$ \ $$| $$$$$$$/| $$$$$$/ | $$ \ $$| $$$$$$/| $$ \ $$ | $$$$$$/| $$ | $$ | $$$$$$/ /$$$$$$ | $$ | $$ | $$\n|__/ |__/|__/ |__/|__/ \__/|_______/ \______/ |__/ \__/ \______/ |__/ \__/ \______/ |__/ |__/ \______/ |______/ |__/ |__/ |__/ \033[0m')
while 1:
c()
G = os.system('cls')#'\n' * 100
print('\033[95m1.학생추가\n2.학생제거\n3.학생찾기\n4.전교생출력\n5.JalMotHanSaRamUanGyoMuSilLo\n6.학생정보 수정' '\033[0m')
print('\n출력:' + text)
text = ''
x = list(input().split())
if len(x)!=0 and (x[0] == 'exit' or x[0]=='비상탈출'):
break
if len(x)!=0 and str.isdigit(x[0]):
x = int(x[0])
else:
text = '다시 입력하세요'
continue
if x == 1:
c()
print('추가하고 싶은 학생을 이름 나이 학번순으로 입력(공백 구분 필수)\n\033[38;5;9mex) 이름름님 15 12315\033[0m')
t = list(input().split())
if not len(t) > 2:
text = '잘못Dam'
continue
itum = 0
for i in range(len(hakbu)):
if str.isdigit(t[2]) and hakbu[i].hb == int(t[2]):
itum = 1
break
if itum==1:
c()
text = '학번이 중복됨'
continue
else:
if len(t) > 2:
if str.isdigit(t[1]) and str.isdigit(t[2]):
text = '성공적으로 학생 입력 성공'
hakbu.append(hs(t[0],int(t[1]),int(t[2])))
else:
text = '잘못됌'
else:
text = '잘못된 형식'
elif x==2:
if len(hakbu)==0:
text = '전교생이 한명도 없습니다.'
continue
c()
print(f.Red+'삭제'+f.R+'하고 싶은 학생의 학번')
t = input()
if str.isdigit(t):
t = int(t)
else:
text = 'DaSSiHae'
continue
for i in range(len(hakbu)):
if hakbu[i].hb == int(t):
s = hakbu[i]
c()
print(f.Red+'삭제된'+f.R+' 학생: [이름:%s, 나이:%d, 학번:%d]'%(s.name,s.age,s.hb))
print(f.Lime+'돼ㅣ돌리시겠습니까? '+f.Lime+'Y'+f.R+'/'+f.Red+'N'+f.R)
DaeDap = input()
if DaeDap=='Y' or DaeDap =='y':
text = f.Lime+'복구됨.'
else:
hakbu.pop(i)
text = 'return to first menwu'
break
elif i==len(hakbu)-1:
text = f.Red+'없는'+ f.R + ' 학생입니다.'
elif x==3:
if len(hakbu)==0:
text = '와!, \033[38;5;14m 공기\033[0m를 찾았다!.'
continue
c()
print('이름이나 학번 입력')
x1 = input()
c1 = 0
c()
for i in range(len(hakbu)):
s = hakbu[i]
if str.isdigit(x1):
if s.hb == int(x1):
text += '\033[38;5;14m' + '%s의 정보 : [나이:%d, 학번:%d, 선도간 횟수:%d]\n'%(s.name,s.age,int(x1),s.ss)+ f.R
c1=1
elif s.name == x1:
text += f.Lime+ '%s의 정보 : [나이:%d, 학번:%d, 선도간 횟수:%d]\n'%(x1,s.age,s.hb,s.ss) + f.R
c1=1
if c1==0:
text = '그 학생이나 학생들은 존재하지 않는다.'
elif x==4:
if len(hakbu)==0:
text = '! no student in school'
continue
c()
text += '찾은 정보\n'
for i in range(len(hakbu)):
s = hakbu[i]
text += '\033[96m[ 이름:%s, 나이:%d, 학번:%d, 선도 간 횟수:%d ]\033[0m\n'%(s.name,s.age,s.hb,s.ss)
elif x==5:
if len(hakbu)==0:
text = "학교 폐업하셨나요"
continue
c()
print(f.Red+'잘못한 사람의 학번 입력.'+f.R)
t = input()
if str.isdigit(t):
t = int(t)
silhang = 0
for i in range(len(hakbu)):
s = hakbu[i]
if s.hb == t:
silhang = 1
s.nuejalgulreatda()
text ='%s의 현재까지'%s.name+f.Red+ ' 선도간 총 누적 횟수'+f.R+':%d\n'%s.ss
if not silhang:
text = '그런 사람 저희 학교에 없읍니다'
elif x==6:
if len(hakbu)==0:
text = '전교생이 다 파업함?'
continue
c()
print('수정할 사람의 학번 입력')
t = input()
if str.isdigit(t):
t = int(t)
else:
text = '잘못된 입력'
continue
c1 = 0
i=0
while i<len(hakbu):
s = hakbu[i]
if s.hb == t:
c1 = 1
c()
print('수정 하고 싶은거.\n1.나이,2.이름,3 학번')
z = input()
if str.isdigit(z):
z = int(z)
else:
text = '다시입력.'
continue
while 1:
c()
if z==1:
print('수정된 나이를 입력해 주세\n\n현재 나이:%d\n'%s.age)
z1 = input()
if str.isdigit(z1):
z1 = int(z1)
else:
continue
s.age = z1
text = '나이 변경됨'
text += '\n현재 학생의 정보: [이름:%s, 나이:%d, 학번:%d]' % (s.name, s.age, s.hb)
elif z==2:
print('수정된 이름를 입력해 주ㅓ요\n\n현재 이름:%s\n'%s.name)
z1 = input()
s.name = z1
text = '이름 변경됨'
text += '\n현재 학생의 정보: [이름:%s, 나이:%d, 학번:%d]' % (s.name, s.age, s.hb)
elif z==3:
print('수정된 학번를 입력해 주ㅅ\n\n현재 학번:%d\n'%s.hb)
z1 = input()
if str.isdigit(z1):
z1 = int(z1)
else:
continue
s.hb = z1
text ='학번 변경됨'
text += '\n수정된 학생의 정보: [이름:%s, 나이:%d, 학번:%d]' % (s.name, s.age, s.hb)
else:
text = '잘못 입력 하셨음으로 처음으로 돌아갑니다.'
break
i += 1
if i > len(hakbu):
break
if c1==0:
text = '학번 다시 입력'
else:
break
else:
text = '...'
print('왜끔?')
'''
import sys
from PyQt5.QtWidgets import QApplication, QWidget, QPushButton
from PyQt5.QtCore import QCoreApplication
class App(QWidget):
def __init__(self):
super().__init__()
self.initUI()
def initUI(self):
b = QPushButton('%s' % self.size(), self)
b.resize(b.sizeHint())
b.clicked.connect(QCoreApplication.instance().quit)
self.setWindowTitle('App은Application')
self.move(300,300)
self.setGeometry(500,500,500,400)
self.show()
b.move(self.size().width() // 2 - b.size().width()//2, self.size().height() // 2 - b.size().height()//2)
if __name__ == '__main__':
app = QApplication(sys.argv)
ex = App()
sys.exit(app.exec_())1회 조회