Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 9 additions & 0 deletions HomeWork/jin/3.그리디,순열,조합/11047.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
a,b=map(int,input().split())
array=[int(input()) for _ in range(a)]
array.sort(reverse=True)

cnt=0
for i in array:
cnt+=b//i
b=b%i
print(cnt)
7 changes: 7 additions & 0 deletions HomeWork/jin/3.그리디,순열,조합/11399.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
n=int(input())
li = list(map(int,input().split()))
li.sort()
rs=0
for i in range(n):
rs+=li[i]*(n-i)
print(rs)
12 changes: 12 additions & 0 deletions HomeWork/jin/3.그리디,순열,조합/11576.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
a,b=map(int,input().split())
n=int(input())
numA=list(map(int,input().split()))
rs=0
for i in range(n):
rs+=numA[n-i-1]*a**i
rs2=[]
while rs:
rs2.append(rs%b)
rs//=b
rs2.reverse()
print(*rs2)
20 changes: 20 additions & 0 deletions HomeWork/jin/3.그리디,순열,조합/13305.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
n=int(input())
dis=list(map(int,input().split()))
node=list(map(int,input().split()))

node[-1]=1000000001
dis.append(0)

rs=dis[0]*node[0]
acc_dis=0
minV=node[0]

for i in range(1,n):
if minV<=node[i]:
acc_dis+=dis[i]
else:
rs+=acc_dis*minV
acc_dis=dis[i]
minV=node[i]
rs+=acc_dis*minV
print(rs)
20 changes: 20 additions & 0 deletions HomeWork/jin/3.그리디,순열,조합/1541.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
inp = input()
op=[]
for i in inp:
if i=='+' or i=='-':
op.append(i)
inp=inp.replace('-','+')
num = list(map(int,inp.split('+')))

# print(op,num)
rs=num[0]
rs2=0
flag=0
for i in range(len(op)):
if op[i]=='+' and not rs2:
rs+=num[i+1]
else:
rs2+=num[i+1]
if rs2:
rs-=rs2
print(rs)
6 changes: 6 additions & 0 deletions HomeWork/jin/3.그리디,순열,조합/15649.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,6 @@
from itertools import permutations

a,b=map(int,input().split())
arr=list(range(1,a+1))
for i in permutations(arr,b):
print(*i)
5 changes: 5 additions & 0 deletions HomeWork/jin/3.그리디,순열,조합/15650.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
from itertools import combinations
a,b=map(int,input().split())
a2=list(range(1,a+1))
for i in combinations(a2,b):
print(*i)
5 changes: 5 additions & 0 deletions HomeWork/jin/3.그리디,순열,조합/15651.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
from itertools import product
a,b=map(int,input().split())
a2=list(range(1,a+1))
for i in product(a2,repeat=b):
print(*i)
5 changes: 5 additions & 0 deletions HomeWork/jin/3.그리디,순열,조합/15652.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
from itertools import combinations_with_replacement
a,b=map(int,input().split())
a2=list(range(1,a+1))
for i in combinations_with_replacement(a2,b):
print(*i)
7 changes: 7 additions & 0 deletions HomeWork/jin/3.그리디,순열,조합/15654.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
from itertools import permutations

a,b=map(int,input().split())
li=list(map(int,input().split()))
li2=sorted(permutations(li, b))
for i in li2:
print(*i)
14 changes: 14 additions & 0 deletions HomeWork/jin/3.그리디,순열,조합/1931.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
n=int(input())
li=[[0,0]]
for _ in range(n):
inp = list(map(int,input().split()))
li.append(inp)
li.sort(key=lambda x:(x[1],x[0]))
cnt=0
maxV=0
# print(li)
for i in range(1,len(li)):
if li[i][0]>=maxV:
maxV=li[i][1]
cnt+=1
print(cnt)
13 changes: 13 additions & 0 deletions HomeWork/jin/3.그리디,순열,조합/2089.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
n=int(input())
rs=''
if not n:
print(0)
else:
while n:
if n%-2:
rs='1'+rs
n=n//-2+1
else:
rs='0'+rs
n//=-2
print(''.join(rs))