xevion/contest
1
0
Fork 0
mirror of https://github.com/Xevion/contest.git synced 2025-12-09 22:06:46 -06:00
Code Issues Packages Projects Releases Wiki Activity

ysu-acm solves and icpc A & B

Browse Source
This commit is contained in:
Xevion
2019-08-24 18:03:31 -05:00
parent 63afb03484
commit 3297bcd237
16 changed files with 156 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
berkely/1991 YSU-ACM High School Programming Contest/1/input Normal file
View File

@@ -0,0 +1,5 @@
5
2
3
1
2

9
berkely/1991 YSU-ACM High School Programming Contest/1/main.py Normal file
View File

@@ -0,0 +1,9 @@
import sys, os
# Read the data
path = os.path.join(sys.path[0], 'input')
data = open(path, 'r').read().split('\n')
data = list(map(int, data))
assert all(map(lambda x : x >= 1, data))
print('\n\n'.join('\n'.join('*' * x for x in range(n, 0, -1))for n in data))

2
berkely/1991 YSU-ACM High School Programming Contest/2/input Normal file
View File

@@ -0,0 +1,2 @@
5
100

16
berkely/1991 YSU-ACM High School Programming Contest/2/main.py Normal file
View File

@@ -0,0 +1,16 @@
import os, sys, math
path = os.path.join(sys.path[0], 'input')
data = open(path, 'r').read().split('\n')
# To keep with the times of 1991, we will use the constraints of Python2 for max integers
maxInt = 9223372036854775807
def extend(n):
res = 1
for x in range(2, n + 1):
res = x * res
return res
x = 100
print(extend(x))
print(math.log(extend(x), 10))

23
berkely/1991 YSU-ACM High School Programming Contest/3/input Normal file
View File

@@ -0,0 +1,23 @@
18
7
11
1
0
3
13
9
12
4
2
0
16
17
4
8
0
10
8
3
6
8
4

5
berkely/1991 YSU-ACM High School Programming Contest/5/input Normal file
View File

@@ -0,0 +1,5 @@
THIS IS THE ('FIRST') LINE IN THE SAMPLE FILE!!!!
ANY CHARACTERS CAN BE IN THE FILE%^$*.(")...
('THIS PART OF THE FILE SHOULD NOT BE CHANGED')
'(BUT THIS PART SHOULD 123........('...............
NUMBERS, 1234567890, ARE OK. OK?

14
berkely/1991 YSU-ACM High School Programming Contest/5/main.py Normal file
View File

@@ -0,0 +1,14 @@
import re, string, os, sys
pattern = r'([\s\S]*)(\(.*\))([\s\S]*)'
def main():
path = os.path.join(sys.path[0], 'input')
mapping = str.maketrans(string.ascii_uppercase, string.ascii_uppercase[::-1])
print(string.ascii_uppercase)
print(string.ascii_uppercase[::-1])
data = open(path, 'r').read()
matches = re.findall(pattern, data)[0]
result = ''
for match in matches:
result += match if match.startswith('(') else match.translate(mapping)
print(result)

18
berkely/1991 YSU-ACM High School Programming Contest/README.MD
View File

@@ -2,4 +2,20 @@
These problems honestly seem extraordinarily easy, but it's likely do to the constraints of computer programming back then. Kind of cheating, using Python.
[Official Link](https://people.eecs.berkeley.edu/~hilfingr/programming-contest/ysu_91.pdf) | [GitHub Mirror](./ysu_91.pdf)
[Official Link](https://people.eecs.berkeley.edu/~hilfingr/programming-contest/ysu_91.pdf) | [GitHub Mirror](./ysu_91.pdf)
## Notice
Inputs / Outputs are retyped since the PDF is obsfucated.
## Progress
#1 : Solved
#2 : **Unsolved**
#3 : **Unsolved**
#4 : Solved
#5 : **Unsolved**