Skip to content
Open
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
43 changes: 43 additions & 0 deletions soal1.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,43 @@
#!/bin/python3

import math
import os
import random
import re
import sys

#
# Complete the 'sockMerchant' function below.
#
# The function is expected to return an INTEGER.
# The function accepts following parameters:
# 1. INTEGER n
# 2. INTEGER_ARRAY ar
#

def sockMerchant(n, ar):
socks={}
count=0

for i in ar:
if i not in socks:
socks[i]=1
continue
socks[i]+=1

for i in socks.values():
count+=i//2
return count

if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')

n = int(input().strip())

ar = list(map(int, input().rstrip().split()))

result = sockMerchant(n, ar)

fptr.write(str(result) + '\n')

fptr.close()
49 changes: 49 additions & 0 deletions soal2.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,49 @@
#!/bin/python3

import math
import os
import random
import re
import sys

#
# Complete the 'angryProfessor' function below.
#
# The function is expected to return a STRING.
# The function accepts following parameters:
# 1. INTEGER k
# 2. INTEGER_ARRAY a
#

def angryProfessor(k, a):
present=0;

for i in a:
if i<=0:
present+=1;

if(present<k):
return "YES";
else:
return "NO";


if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')

t = int(input().strip())

for t_itr in range(t):
first_multiple_input = input().rstrip().split()

n = int(first_multiple_input[0])

k = int(first_multiple_input[1])

a = list(map(int, input().rstrip().split()))

result = angryProfessor(k, a)

fptr.write(result + '\n')

fptr.close()
Empty file added soal3.py
Empty file.
44 changes: 44 additions & 0 deletions soal4.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,44 @@
#!/bin/python3

import math
import os
import random
import re
import sys

#
# Complete the 'repeatedString' function below.
#
# The function is expected to return a LONG_INTEGER.
# The function accepts following parameters:
# 1. STRING s
# 2. LONG_INTEGER n
#

def repeatedString(s, n):
total=0

for i in s:
if i == 'a':
total += 1

total = n//len(s) * total

for i in s[:n%len(s)]:
if i == 'a':
total += 1

return total

if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')

s = input()

n = int(input().strip())

result = repeatedString(s, n)

fptr.write(str(result) + '\n')

fptr.close()