diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..15584ca
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1 @@
+.pyc
diff --git a/ui/api_functions_v2.py b/ui/api_functions_v2.py
index 3431216..2f75390 100644
--- a/ui/api_functions_v2.py
+++ b/ui/api_functions_v2.py
@@ -47,9 +47,9 @@ def getProblemDataFromContest(contestID):
r = requests.get(url).json()
if r['status'] == 'FAILED':
- expectedMessage = 'contestId: Contest with id ' + str(contestID) + ' not found'
- if r['comment'] == expectedMessage:
- raise ContestNotFound(contestID)
+ expectedMessage = 'contestId: Contest with id ' + str(contestID) + ' not found'
+ if r['comment'] == expectedMessage:
+ raise ContestNotFound(contestID)
r = r['result']
contest = r['contest']['name']
@@ -79,7 +79,7 @@ def getProblemDataFromContest(contestID):
return probdf
def getSolveSuccessDF(contestID):
-#contestID = 671
+ #contestID = 671
urlbase = 'http://codeforces.com/api/'
method = 'contest.standings'
maxcnt = 100000
@@ -92,19 +92,18 @@ def getSolveSuccessDF(contestID):
# CHECK TO MAKE SURE THAT TEAMS ARE NOT ALLOWED!!!
for r in rows: # for each person
- if len(r['party']['members']) > 1:
- raise Error("This contest allows teams. ELO scores are not well-defined.")
-
+ if len(r['party']['members']) > 1:
+ raise Error("This contest allows teams. ELO scores are not well-defined.")
+
users = []
points = []
for r in rows:
- users.append(r['party']['members'][0]['handle'])
-
- userpts = [0]*len(problems)
- for i in range(len(problems)):
- userpts[i] = r['problemResults'][i]['points']
- points.append([1 if u > 0 else 0 for u in userpts])
-
+ users.append(r['party']['members'][0]['handle'])
+
+ userpts = [0]*len(problems)
+ for i in range(len(problems)):
+ userpts[i] = r['problemResults'][i]['points']
+ points.append([1 if u > 0 else 0 for u in userpts])
# Grab rating changes
method = 'contest.ratingChanges'
@@ -112,23 +111,30 @@ def getSolveSuccessDF(contestID):
ratingchanges = requests.get(url).json()['result']
ratingdict = dict()
for r in ratingchanges:
- ratingdict[r['handle']] = r['oldRating']
-
+ ratingdict[r['handle']] = r['oldRating']
# Create output df
# start constructing dataframe
array_out = []
for i in range(len(users)): # for each user in the contest
- hdl = users[i]
- rating = ratingdict[hdl]
- for j, p in enumerate(problems): # for each problem in the contest, make a new row
- temp = dict.fromkeys(['handle', 'rating', 'contestID', 'problemID', 'success'])
- temp['handle'] = hdl
- temp['contestID'] = contestID
- temp['problemID'] = p['index']
- temp['success'] = points[i][j]
- temp['rating'] = rating
- array_out.append(temp)
+ hdl = users[i]
+
+ if hdl not in ratingdict:
+ continue
+
+ #try:
+ rating = ratingdict[hdl]
+ #except:
+ # url = 'http://codeforces.com/api/user.rating?handle=' + hdl
+ # rating = requests.get(url).json()['result'][-1]['newRating']
+ for j, p in enumerate(problems): # for each problem in the contest, make a new row
+ temp = dict.fromkeys(['handle', 'rating', 'contestID', 'problemID', 'success'])
+ temp['handle'] = hdl
+ temp['contestID'] = contestID
+ temp['problemID'] = p['index']
+ temp['success'] = points[i][j]
+ temp['rating'] = rating
+ array_out.append(temp)
output = pd.DataFrame.from_dict(array_out)
return output
@@ -148,46 +154,48 @@ def getUserActivity(handle):
r = requests.get(url).json()
if r['status'] == 'FAILED':
- expectedMessage = 'handle: User with handle ' + str(handle) + ' not found'
- if r['comment'] == expectedMessage:
- raise UserNotFound(handle)
+ expectedMessage = 'handle: User with handle ' + str(handle) + ' not found'
+ if r['comment'] == expectedMessage:
+ raise UserNotFound(handle)
dictlist = []
keys = ['testset', 'passedTestCount', 'author', 'relativeTimeSeconds',
- 'language', 'memoryBytes', 'timeMilliseconds', 'problem_name', 'problem_index',
- 'problem_tags', 'points', 'contestID', 'verdict', 'id', 'participantType', 'startTimeSeconds']
+ 'language', 'memoryBytes', 'timeMilliseconds', 'problem_name', 'problem_index',
+ 'problem_tags', 'points', 'contestID', 'verdict', 'id', 'participantType', 'startTimeSeconds']
r = r['result']
for rr in r:
- temp = dict.fromkeys(keys)
- temp['author'] = rr['author']['members'][0]['handle']
- temp['startTimeSeconds'] = rr['creationTimeSeconds']
-
- if 'startTimeSeconds' not in rr['author']:
- temp['participantType'] = 'GYM'
- else:
- temp['participantType'] = rr['author']['participantType']
-
- temp['id'] = rr['id']
- temp['verdict'] = rr['verdict']
- temp['contestID'] = rr['contestId']
-
- if 'points' not in rr['problem']:
- temp['points'] = 0
- else:
- temp['points'] = rr['problem']['points']
-
- temp['problem_tags'] = rr['problem']['tags']
- temp['problem_index'] = rr['problem']['index']
- temp['problem_name'] = rr['problem']['name']
- temp['timeMilliseconds'] = rr['timeConsumedMillis']
- temp['memoryBytes'] = rr['memoryConsumedBytes']
- temp['language'] = rr['programmingLanguage']
- temp['relativeTimeSeconds'] = rr['relativeTimeSeconds']
- temp['passedTestCount'] = rr['passedTestCount']
- temp['testset'] = rr['testset']
-
- dictlist.append(temp)
+ temp = dict.fromkeys(keys)
+ temp['author'] = rr['author']['members'][0]['handle']
+ temp['startTimeSeconds'] = rr['creationTimeSeconds']
+
+ if 'startTimeSeconds' not in rr['author']:
+ temp['participantType'] = 'GYM'
+ else:
+ temp['participantType'] = rr['author']['participantType']
+
+ temp['id'] = rr['id']
+ temp['verdict'] = rr['verdict']
+ if 'contestId' not in rr: continue
+ temp['contestID'] = rr['contestId']
+
+ if 'points' not in rr['problem']:
+ temp['points'] = 0
+ else:
+ temp['points'] = rr['problem']['points']
+
+ temp['problem_tags'] = rr['problem']['tags']
+ temp['problem_index'] = rr['problem']['index']
+ temp['problem_name'] = rr['problem']['name']
+ temp['timeMilliseconds'] = rr['timeConsumedMillis']
+ temp['memoryBytes'] = rr['memoryConsumedBytes']
+ temp['language'] = rr['programmingLanguage']
+ temp['relativeTimeSeconds'] = rr['relativeTimeSeconds']
+ temp['passedTestCount'] = rr['passedTestCount']
+ temp['testset'] = rr['testset']
+
+ dictlist.append(temp)
+
df_userActivity = pd.DataFrame.from_dict(dictlist)
return df_userActivity
@@ -196,10 +204,9 @@ def getUserRatingHistory(handle):
r = requests.get(url).json()
if r['status'] == 'FAILED':
- expectedMessage = 'handle: User with handle ' + str(handle) + ' not found'
- if r['comment'] == expectedMessage:
- raise UserNotFound(handle)
-
+ expectedMessage = 'handle: User with handle ' + str(handle) + ' not found'
+ if r['comment'] == expectedMessage:
+ raise UserNotFound(handle)
r = r['result']
rating_history = pd.DataFrame.from_dict(r)
return rating_history
diff --git a/ui/api_functions_v2.pyc b/ui/api_functions_v2.pyc
new file mode 100644
index 0000000..f5e015a
Binary files /dev/null and b/ui/api_functions_v2.pyc differ
diff --git a/ui/bad_contests.txt b/ui/bad_contests.txt
new file mode 100644
index 0000000..acd9ac5
--- /dev/null
+++ b/ui/bad_contests.txt
@@ -0,0 +1,187 @@
+925
+927
+958
+952
+924
+926
+953
+923
+929
+928
+921
+916
+910
+905
+886
+889
+890
+888
+885
+887
+884
+883
+873
+874
+863
+847
+858
+860
+861
+857
+856
+846
+852
+845
+838
+837
+825
+823
+826
+818
+819
+820
+821
+817
+813
+802
+808
+773
+803
+775
+772
+797
+774
+795
+784
+792
+771
+770
+769
+761
+762
+753
+751
+728
+730
+726
+718
+720
+717
+712
+710
+703
+702
+691
+690
+695
+693
+683
+678
+684
+643
+642
+641
+665
+663
+664
+640
+661
+660
+656
+639
+652
+647
+646
+638
+644
+637
+632
+636
+628
+630
+622
+620
+616
+612
+609
+600
+598
+597
+594
+595
+589
+575
+566
+562
+541
+537
+532
+530
+531
+524
+523
+522
+491
+484
+485
+470
+440
+411
+409
+398
+399
+396
+397
+394
+392
+393
+391
+390
+386
+374
+345
+328
+323
+311
+312
+306
+301
+302
+291
+290
+267
+212
+209
+207
+206
+188
+190
+185
+182
+172
+171
+170
+162
+159
+158
+153
+147
+134
+130
+125
+120
+119
+100
+98
+99
+76
+72
+64
+52
+50
+45
+44
+39
+21
+20
+15
diff --git a/ui/elo.py b/ui/elo.py
index 795ec1a..f4839e9 100755
--- a/ui/elo.py
+++ b/ui/elo.py
@@ -55,10 +55,14 @@ def get_problem_elo(problem_df):
def get_contest_elo(contestID):
try:
contest_df = af.getSolveSuccessDF(contestID)
- except:
+ except Exception as e:
+ with open('bad_contests.txt', 'a') as f:
+ f.write(str(contestID) + '\n')
return None
-
+
if contest_df.shape[0] < 50:
+ with open('bad_contests.txt', 'a') as f:
+ f.write(str(contestID) + '\n')
return None
contestID = contest_df.contestID.unique()[0]
diff --git a/ui/elo.pyc b/ui/elo.pyc
new file mode 100644
index 0000000..54a2a8e
Binary files /dev/null and b/ui/elo.pyc differ
diff --git a/ui/generator/problem_ratings_1000_to_1100.txt b/ui/generator/problem_ratings_1000_to_1100.txt
new file mode 100644
index 0000000..d3b5faf
--- /dev/null
+++ b/ui/generator/problem_ratings_1000_to_1100.txt
@@ -0,0 +1,20 @@
+codeforces.com/contest/469/problem/A
+codeforces.com/contest/460/problem/A
+codeforces.com/contest/244/problem/A
+codeforces.com/contest/318/problem/A
+codeforces.com/contest/214/problem/A
+codeforces.com/contest/25/problem/A
+codeforces.com/contest/369/problem/A
+codeforces.com/contest/23/problem/A
+codeforces.com/contest/519/problem/A
+codeforces.com/contest/805/problem/B
+codeforces.com/contest/610/problem/A
+codeforces.com/contest/387/problem/A
+codeforces.com/contest/376/problem/A
+codeforces.com/contest/46/problem/B
+codeforces.com/contest/4/problem/A
+codeforces.com/contest/579/problem/A
+codeforces.com/contest/859/problem/B
+codeforces.com/contest/195/problem/A
+codeforces.com/contest/515/problem/A
+codeforces.com/contest/777/problem/A
diff --git a/ui/generator/problem_ratings_1040_to_1140.txt b/ui/generator/problem_ratings_1040_to_1140.txt
new file mode 100644
index 0000000..04212d0
--- /dev/null
+++ b/ui/generator/problem_ratings_1040_to_1140.txt
@@ -0,0 +1,20 @@
+codeforces.com/contest/263/problem/B
+codeforces.com/contest/572/problem/A
+codeforces.com/contest/611/problem/A
+codeforces.com/contest/413/problem/A
+codeforces.com/contest/387/problem/A
+codeforces.com/contest/735/problem/A
+codeforces.com/contest/742/problem/A
+codeforces.com/contest/359/problem/A
+codeforces.com/contest/43/problem/A
+codeforces.com/contest/560/problem/A
+codeforces.com/contest/205/problem/A
+codeforces.com/contest/352/problem/A
+codeforces.com/contest/82/problem/A
+codeforces.com/contest/137/problem/A
+codeforces.com/contest/479/problem/A
+codeforces.com/contest/284/problem/B
+codeforces.com/contest/137/problem/B
+codeforces.com/contest/680/problem/B
+codeforces.com/contest/234/problem/A
+codeforces.com/contest/669/problem/B
diff --git a/ui/generator/problem_ratings_1080_to_1180.txt b/ui/generator/problem_ratings_1080_to_1180.txt
new file mode 100644
index 0000000..20090ed
--- /dev/null
+++ b/ui/generator/problem_ratings_1080_to_1180.txt
@@ -0,0 +1,20 @@
+codeforces.com/contest/379/problem/A
+codeforces.com/contest/157/problem/B
+codeforces.com/contest/876/problem/A
+codeforces.com/contest/195/problem/A
+codeforces.com/contest/875/problem/A
+codeforces.com/contest/322/problem/A
+codeforces.com/contest/608/problem/A
+codeforces.com/contest/177/problem/B1
+codeforces.com/contest/82/problem/A
+codeforces.com/contest/779/problem/A
+codeforces.com/contest/53/problem/C
+codeforces.com/contest/805/problem/A
+codeforces.com/contest/864/problem/B
+codeforces.com/contest/132/problem/A
+codeforces.com/contest/955/problem/A
+codeforces.com/contest/102/problem/B
+codeforces.com/contest/357/problem/A
+codeforces.com/contest/55/problem/A
+codeforces.com/contest/368/problem/B
+codeforces.com/contest/106/problem/B
diff --git a/ui/generator/problem_ratings_1120_to_1220.txt b/ui/generator/problem_ratings_1120_to_1220.txt
new file mode 100644
index 0000000..e8a43a5
--- /dev/null
+++ b/ui/generator/problem_ratings_1120_to_1220.txt
@@ -0,0 +1,20 @@
+codeforces.com/contest/137/problem/A
+codeforces.com/contest/66/problem/B
+codeforces.com/contest/299/problem/B
+codeforces.com/contest/284/problem/B
+codeforces.com/contest/355/problem/A
+codeforces.com/contest/706/problem/A
+codeforces.com/contest/757/problem/A
+codeforces.com/contest/242/problem/A
+codeforces.com/contest/366/problem/A
+codeforces.com/contest/483/problem/A
+codeforces.com/contest/102/problem/B
+codeforces.com/contest/357/problem/A
+codeforces.com/contest/43/problem/B
+codeforces.com/contest/556/problem/B
+codeforces.com/contest/618/problem/B
+codeforces.com/contest/196/problem/A
+codeforces.com/contest/766/problem/B
+codeforces.com/contest/719/problem/A
+codeforces.com/contest/686/problem/B
+codeforces.com/contest/379/problem/B
diff --git a/ui/generator/problem_ratings_1160_to_1260.txt b/ui/generator/problem_ratings_1160_to_1260.txt
new file mode 100644
index 0000000..8df7cb5
--- /dev/null
+++ b/ui/generator/problem_ratings_1160_to_1260.txt
@@ -0,0 +1,20 @@
+codeforces.com/contest/357/problem/A
+codeforces.com/contest/519/problem/B
+codeforces.com/contest/227/problem/B
+codeforces.com/contest/670/problem/B
+codeforces.com/contest/63/problem/B
+codeforces.com/contest/80/problem/B
+codeforces.com/contest/219/problem/A
+codeforces.com/contest/667/problem/B
+codeforces.com/contest/544/problem/A
+codeforces.com/contest/285/problem/B
+codeforces.com/contest/402/problem/A
+codeforces.com/contest/18/problem/C
+codeforces.com/contest/527/problem/A
+codeforces.com/contest/651/problem/B
+codeforces.com/contest/133/problem/B
+codeforces.com/contest/327/problem/B
+codeforces.com/contest/545/problem/B
+codeforces.com/contest/155/problem/B
+codeforces.com/contest/361/problem/B
+codeforces.com/contest/26/problem/B
diff --git a/ui/generator/problem_ratings_1200_to_1300.txt b/ui/generator/problem_ratings_1200_to_1300.txt
new file mode 100644
index 0000000..90566a9
--- /dev/null
+++ b/ui/generator/problem_ratings_1200_to_1300.txt
@@ -0,0 +1,20 @@
+codeforces.com/contest/766/problem/B
+codeforces.com/contest/363/problem/B
+codeforces.com/contest/799/problem/A
+codeforces.com/contest/467/problem/B
+codeforces.com/contest/208/problem/D
+codeforces.com/contest/596/problem/A
+codeforces.com/contest/255/problem/B
+codeforces.com/contest/180/problem/F
+codeforces.com/contest/755/problem/B
+codeforces.com/contest/387/problem/B
+codeforces.com/contest/876/problem/C
+codeforces.com/contest/433/problem/B
+codeforces.com/contest/69/problem/B
+codeforces.com/contest/178/problem/A3
+codeforces.com/contest/370/problem/A
+codeforces.com/contest/60/problem/A
+codeforces.com/contest/332/problem/A
+codeforces.com/contest/347/problem/A
+codeforces.com/contest/400/problem/B
+codeforces.com/contest/277/problem/A
diff --git a/ui/generator/problem_ratings_1240_to_1340.txt b/ui/generator/problem_ratings_1240_to_1340.txt
new file mode 100644
index 0000000..2280d6d
--- /dev/null
+++ b/ui/generator/problem_ratings_1240_to_1340.txt
@@ -0,0 +1,20 @@
+codeforces.com/contest/740/problem/B
+codeforces.com/contest/701/problem/B
+codeforces.com/contest/104/problem/B
+codeforces.com/contest/145/problem/A
+codeforces.com/contest/930/problem/A
+codeforces.com/contest/708/problem/A
+codeforces.com/contest/456/problem/B
+codeforces.com/contest/43/problem/C
+codeforces.com/contest/682/problem/B
+codeforces.com/contest/655/problem/A
+codeforces.com/contest/944/problem/C
+codeforces.com/contest/26/problem/B
+codeforces.com/contest/877/problem/A
+codeforces.com/contest/416/problem/B
+codeforces.com/contest/292/problem/B
+codeforces.com/contest/107/problem/A
+codeforces.com/contest/129/problem/B
+codeforces.com/contest/94/problem/B
+codeforces.com/contest/426/problem/B
+codeforces.com/contest/101/problem/A
diff --git a/ui/generator/problem_ratings_1280_to_1380.txt b/ui/generator/problem_ratings_1280_to_1380.txt
new file mode 100644
index 0000000..32f7606
--- /dev/null
+++ b/ui/generator/problem_ratings_1280_to_1380.txt
@@ -0,0 +1,20 @@
+codeforces.com/contest/505/problem/A
+codeforces.com/contest/682/problem/B
+codeforces.com/contest/922/problem/B
+codeforces.com/contest/58/problem/B
+codeforces.com/contest/567/problem/B
+codeforces.com/contest/217/problem/A
+codeforces.com/contest/902/problem/B
+codeforces.com/contest/83/problem/A
+codeforces.com/contest/625/problem/B
+codeforces.com/contest/740/problem/A
+codeforces.com/contest/289/problem/C
+codeforces.com/contest/508/problem/B
+codeforces.com/contest/872/problem/B
+codeforces.com/contest/913/problem/B
+codeforces.com/contest/262/problem/B
+codeforces.com/contest/755/problem/C
+codeforces.com/contest/318/problem/B
+codeforces.com/contest/236/problem/B
+codeforces.com/contest/359/problem/B
+codeforces.com/contest/462/problem/B
diff --git a/ui/generator/problem_ratings_1320_to_1420.txt b/ui/generator/problem_ratings_1320_to_1420.txt
new file mode 100644
index 0000000..c7d00ca
--- /dev/null
+++ b/ui/generator/problem_ratings_1320_to_1420.txt
@@ -0,0 +1,20 @@
+codeforces.com/contest/476/problem/B
+codeforces.com/contest/469/problem/B
+codeforces.com/contest/414/problem/B
+codeforces.com/contest/186/problem/B
+codeforces.com/contest/967/problem/A
+codeforces.com/contest/648/problem/B
+codeforces.com/contest/116/problem/B
+codeforces.com/contest/385/problem/B
+codeforces.com/contest/426/problem/B
+codeforces.com/contest/573/problem/A
+codeforces.com/contest/257/problem/B
+codeforces.com/contest/180/problem/C
+codeforces.com/contest/161/problem/A
+codeforces.com/contest/780/problem/C
+codeforces.com/contest/176/problem/A
+codeforces.com/contest/862/problem/B
+codeforces.com/contest/576/problem/A
+codeforces.com/contest/413/problem/C
+codeforces.com/contest/805/problem/D
+codeforces.com/contest/699/problem/C
diff --git a/ui/generator/problem_ratings_1360_to_1460.txt b/ui/generator/problem_ratings_1360_to_1460.txt
new file mode 100644
index 0000000..8e44bc3
--- /dev/null
+++ b/ui/generator/problem_ratings_1360_to_1460.txt
@@ -0,0 +1,20 @@
+codeforces.com/contest/493/problem/A
+codeforces.com/contest/610/problem/B
+codeforces.com/contest/631/problem/B
+codeforces.com/contest/270/problem/B
+codeforces.com/contest/316/problem/A2
+codeforces.com/contest/514/problem/B
+codeforces.com/contest/752/problem/C
+codeforces.com/contest/975/problem/C
+codeforces.com/contest/475/problem/B
+codeforces.com/contest/919/problem/C
+codeforces.com/contest/17/problem/B
+codeforces.com/contest/471/problem/B
+codeforces.com/contest/383/problem/A
+codeforces.com/contest/900/problem/B
+codeforces.com/contest/489/problem/C
+codeforces.com/contest/940/problem/B
+codeforces.com/contest/699/problem/C
+codeforces.com/contest/587/problem/A
+codeforces.com/contest/262/problem/C
+codeforces.com/contest/304/problem/C
diff --git a/ui/generator/problem_ratings_1400_to_1500.txt b/ui/generator/problem_ratings_1400_to_1500.txt
new file mode 100644
index 0000000..3fb800e
--- /dev/null
+++ b/ui/generator/problem_ratings_1400_to_1500.txt
@@ -0,0 +1,20 @@
+codeforces.com/contest/363/problem/C
+codeforces.com/contest/799/problem/B
+codeforces.com/contest/673/problem/B
+codeforces.com/contest/560/problem/B
+codeforces.com/contest/152/problem/C
+codeforces.com/contest/203/problem/B
+codeforces.com/contest/526/problem/A
+codeforces.com/contest/907/problem/A
+codeforces.com/contest/128/problem/A
+codeforces.com/contest/811/problem/B
+codeforces.com/contest/518/problem/B
+codeforces.com/contest/453/problem/A
+codeforces.com/contest/588/problem/B
+codeforces.com/contest/922/problem/A
+codeforces.com/contest/848/problem/A
+codeforces.com/contest/271/problem/B
+codeforces.com/contest/584/problem/B
+codeforces.com/contest/937/problem/B
+codeforces.com/contest/614/problem/B
+codeforces.com/contest/608/problem/B
diff --git a/ui/generator/training_generator.py b/ui/generator/training_generator.py
new file mode 100644
index 0000000..f871778
--- /dev/null
+++ b/ui/generator/training_generator.py
@@ -0,0 +1,53 @@
+from random import *
+
+def getProblems():
+ problems = []
+
+ fname = '../problem_ratings.csv'
+ with open(fname, 'r') as f:
+ lines = f.read().split('\n')[1:-1]
+
+ for line in lines:
+ problem_data = line.split(',')
+ problem_data[0] = int(problem_data[0])
+ problem_data[2] = int(problem_data[2])
+
+ problems.append(problem_data)
+
+ return problems
+
+def createSet(minR, maxR, n = 18, hn = 2, hard = 50, width = 100, jump = 40):
+ problems = getProblems()
+
+ for i in xrange(minR, maxR+1, jump):
+ low = i
+ high = i + width
+ hardR = high + hard
+
+ l1 = []
+ l2 = []
+
+ for p in problems:
+ if low <= p[2] <= high:
+ l1.append(p)
+ elif high < p[2] < hardR:
+ l2.append(p)
+
+ l = sample(l1, n) + sample(l2, hn)
+ l.sort(key = lambda x : x[2])
+
+ out_filename = 'problem_ratings_' + str(low) + '_to_' + str(high) + '.txt'
+
+ with open(out_filename, 'w') as f:
+ for p in l:
+ s = 'codeforces.com/contest/' + str(p[0]) + '/problem/' + p[1] + '\n'
+ f.write(s)
+
+
+
+
+
+if __name__ == '__main__':
+ createSet(1000, 1400)
+
+
diff --git a/ui/img_histogram.png b/ui/img_histogram.png
index 24bf57e..2d47e9c 100644
Binary files a/ui/img_histogram.png and b/ui/img_histogram.png differ
diff --git a/ui/img_langTrend.png b/ui/img_langTrend.png
index c35ca82..2c92f80 100644
Binary files a/ui/img_langTrend.png and b/ui/img_langTrend.png differ
diff --git a/ui/img_tags.png b/ui/img_tags.png
index 02df104..d7e8082 100644
Binary files a/ui/img_tags.png and b/ui/img_tags.png differ
diff --git a/ui/img_timeTrend.png b/ui/img_timeTrend.png
index 4d474a0..2c92f80 100644
Binary files a/ui/img_timeTrend.png and b/ui/img_timeTrend.png differ
diff --git a/ui/img_userProgress.png b/ui/img_userProgress.png
index f55ef42..e0823ad 100644
Binary files a/ui/img_userProgress.png and b/ui/img_userProgress.png differ
diff --git a/ui/img_userProgress_upper.png b/ui/img_userProgress_upper.png
index 5f12850..a05d792 100644
Binary files a/ui/img_userProgress_upper.png and b/ui/img_userProgress_upper.png differ
diff --git a/ui/makePlots.R b/ui/makePlots.R
index fecd64d..cc76123 100644
--- a/ui/makePlots.R
+++ b/ui/makePlots.R
@@ -202,27 +202,27 @@ print(f)
dev.off()
## Problems solved over time
-nweeks <- difftime(max(df_activity$date), min(df_activity$date), units='weeks')
+#nweeks <- difftime(max(df_activity$date), min(df_activity$date), units='weeks')
+#
+#g <- ggplot(df_activity) +
+# geom_freqpoly(aes(x=date), bins=nweeks/4) +
+# labs(x='Date', y='Problems solved')
-g <- ggplot(df_activity) +
- geom_freqpoly(aes(x=date), bins=nweeks/4) +
- labs(x='Date', y='Problems solved')
-
-png('img_timeTrend.png', width=800, height=400)
-print(g)
-dev.off()
+#png('img_timeTrend.png', width=800, height=400)
+#print(g)
+#dev.off()
## Problems solved over time
-nweeks <- difftime(max(df_activity$date), min(df_activity$date), units='weeks')
+#nweeks <- difftime(max(df_activity$date), min(df_activity$date), units='weeks')
-g <- ggplot(df_activity) +
+#g <- ggplot(df_activity) +
geom_freqpoly(aes(x=date, color=language), bins=nweeks/4) +
theme(legend.position='bottom') +
labs(x='Date', y='Problems solved')
-png('img_langTrend.png', width=800, height=400)
-print(g)
-dev.off()
+#png('img_langTrend.png', width=800, height=400)
+#print(g)
+#dev.off()
diff --git a/ui/problem_data.csv b/ui/problem_data.csv
index 9aece5c..4b15889 100644
--- a/ui/problem_data.csv
+++ b/ui/problem_data.csv
@@ -28,6 +28,11 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
7,Codeforces Beta Round #7,12,Line,,C,1270136700,"[math, number theory]",PROGRAMMING
7,Codeforces Beta Round #7,12,Palindrome Degree,,D,1270136700,"[hashing, strings]",PROGRAMMING
7,Codeforces Beta Round #7,12,Defining Macros,,E,1270136700,"[dp, expression parsing, implementation]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Train and Peter,,A,1270741500,[strings],PROGRAMMING
+8,Codeforces Beta Round #8,12,Obsession with Robots,,B,1270741500,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Looking for Order,,C,1270741500,"[bitmasks, dp]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Two Friends,,D,1270741500,"[binary search, geometry]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Beads,,E,1270741500,"[dp, graphs]",PROGRAMMING
9,Codeforces Beta Round #9 (Div. 2 Only),2,Die Roll,,A,1270983600,"[math, probabilities]",PROGRAMMING
9,Codeforces Beta Round #9 (Div. 2 Only),2,Running Student,,B,1270983600,"[brute force, geometry, implementation]",PROGRAMMING
9,Codeforces Beta Round #9 (Div. 2 Only),2,Hexadecimal's Numbers,,C,1270983600,"[brute force, implementation, math]",PROGRAMMING
@@ -38,6 +43,11 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
10,Codeforces Beta Round #10,12,Digital Root,,C,1271346300,[number theory],PROGRAMMING
10,Codeforces Beta Round #10,12,LCIS,,D,1271346300,[dp],PROGRAMMING
10,Codeforces Beta Round #10,12,Greedy Change,,E,1271346300,[constructive algorithms],PROGRAMMING
+11,Codeforces Beta Round #11,12,Increasing Sequence,,A,1272294000,"[constructive algorithms, implementation, math]",PROGRAMMING
+11,Codeforces Beta Round #11,12,Jumping Jack,,B,1272294000,[math],PROGRAMMING
+11,Codeforces Beta Round #11,12,How Many Squares?,,C,1272294000,[implementation],PROGRAMMING
+11,Codeforces Beta Round #11,12,A Simple Task,,D,1272294000,"[bitmasks, dp, graphs]",PROGRAMMING
+11,Codeforces Beta Round #11,12,"Forward, march!",,E,1272294000,"[binary search, dp, greedy]",PROGRAMMING
12,Codeforces Beta Round #12 (Div 2 Only),12,Super Agent,,A,1272538800,[implementation],PROGRAMMING
12,Codeforces Beta Round #12 (Div 2 Only),12,Correct Solution?,,B,1272538800,"[implementation, sortings]",PROGRAMMING
12,Codeforces Beta Round #12 (Div 2 Only),12,Fruits,,C,1272538800,"[implementation, sortings]",PROGRAMMING
@@ -53,6 +63,11 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
14,Codeforces Beta Round #14 (Div. 2),2,Four Segments,,C,1274283000,"[brute force, constructive algorithms, geometry, implementation, math]",PROGRAMMING
14,Codeforces Beta Round #14 (Div. 2),2,Two Paths,,D,1274283000,"[dfs and similar, dp, graphs, shortest paths, trees, two pointers]",PROGRAMMING
14,Codeforces Beta Round #14 (Div. 2),2,Camels,,E,1274283000,[dp],PROGRAMMING
+15,Codeforces Beta Round #15,12,Cottage Village,,A,1275145200,"[implementation, sortings]",PROGRAMMING
+15,Codeforces Beta Round #15,12,Laser,,B,1275145200,[math],PROGRAMMING
+15,Codeforces Beta Round #15,12,Industrial Nim,,C,1275145200,[games],PROGRAMMING
+15,Codeforces Beta Round #15,12,Map,,D,1275145200,"[data structures, implementation, sortings]",PROGRAMMING
+15,Codeforces Beta Round #15,12,Triangles,,E,1275145200,"[combinatorics, dp]",PROGRAMMING
16,Codeforces Beta Round #16 (Div. 2 Only),2,Flag,,A,1275570000,[implementation],PROGRAMMING
16,Codeforces Beta Round #16 (Div. 2 Only),2,Burglar and Matches,,B,1275570000,"[greedy, implementation, sortings]",PROGRAMMING
16,Codeforces Beta Round #16 (Div. 2 Only),2,Monitor,,C,1275570000,"[binary search, number theory]",PROGRAMMING
@@ -73,6 +88,13 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
19,Codeforces Beta Round #19,12,Deletion of Repeats,,C,1277391600,"[greedy, hashing, string suffix structures]",PROGRAMMING
19,Codeforces Beta Round #19,12,Points,,D,1277391600,[data structures],PROGRAMMING
19,Codeforces Beta Round #19,12,Fairy,,E,1277391600,"[dfs and similar, divide and conquer, dsu]",PROGRAMMING
+20,Codeforces Alpha Round #20 (Codeforces format),12,BerOS file system,500,A,1276875000,[implementation],PROGRAMMING
+20,Codeforces Alpha Round #20 (Codeforces format),12,Equation,1000,B,1276875000,[math],PROGRAMMING
+20,Codeforces Alpha Round #20 (Codeforces format),12,Dijkstra?,1500,C,1276875000,"[graphs, shortest paths]",PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Jabber ID,500,A,1277730300,[implementation],PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Intersection,1000,B,1277730300,"[implementation, math]",PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Stripe 2,1500,C,1277730300,"[binary search, dp, sortings]",PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Traveling Graph,2000,D,1277730300,"[bitmasks, graph matchings, graphs]",PROGRAMMING
22,Codeforces Beta Round #22 (Div. 2 Only),2,Second Order Statistics,,A,1277823600,[brute force],PROGRAMMING
22,Codeforces Beta Round #22 (Div. 2 Only),2,Bargaining Table,,B,1277823600,"[brute force, dp]",PROGRAMMING
22,Codeforces Beta Round #22 (Div. 2 Only),2,System Administrator,,C,1277823600,[graphs],PROGRAMMING
@@ -93,66 +115,66 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
25,Codeforces Beta Round #25 (Div. 2 Only),2,Roads in Berland,,C,1280761200,"[graphs, shortest paths]",PROGRAMMING
25,Codeforces Beta Round #25 (Div. 2 Only),2,Roads not only in Berland,,D,1280761200,"[dsu, graphs, trees]",PROGRAMMING
25,Codeforces Beta Round #25 (Div. 2 Only),2,Test,,E,1280761200,"[hashing, strings]",PROGRAMMING
-26,Codeforces Beta Round #26 (Codeforces format),12,Almost Prime,500.0,A,1281970800,[number theory],PROGRAMMING
-26,Codeforces Beta Round #26 (Codeforces format),12,Regular Bracket Sequence,1000.0,B,1281970800,[greedy],PROGRAMMING
-26,Codeforces Beta Round #26 (Codeforces format),12,Parquet,1500.0,C,1281970800,"[combinatorics, constructive algorithms]",PROGRAMMING
-26,Codeforces Beta Round #26 (Codeforces format),12,Tickets,2000.0,D,1281970800,"[combinatorics, probabilities]",PROGRAMMING
-26,Codeforces Beta Round #26 (Codeforces format),12,Multithreading,2500.0,E,1281970800,[constructive algorithms],PROGRAMMING
-27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Next Test,500.0,A,1284130800,"[implementation, sortings]",PROGRAMMING
-27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Tournament,1000.0,B,1284130800,"[bitmasks, brute force, dfs and similar, greedy]",PROGRAMMING
-27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Unordered Subsequence,1500.0,C,1284130800,"[constructive algorithms, greedy]",PROGRAMMING
-27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Ring Road 2,2000.0,D,1284130800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
-27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Number With The Given Amount Of Divisors,2500.0,E,1284130800,"[brute force, dp, number theory]",PROGRAMMING
-28,Codeforces Beta Round #28 (Codeforces format),12,Bender Problem,500.0,A,1284735600,[implementation],PROGRAMMING
-28,Codeforces Beta Round #28 (Codeforces format),12,pSort,1000.0,B,1284735600,"[dfs and similar, dsu, graphs]",PROGRAMMING
-28,Codeforces Beta Round #28 (Codeforces format),12,Bath Queue,1500.0,C,1284735600,"[combinatorics, dp, probabilities]",PROGRAMMING
-28,Codeforces Beta Round #28 (Codeforces format),12,"Don't fear, DravDe is kind",2000.0,D,1284735600,"[binary search, data structures, dp, hashing]",PROGRAMMING
-28,Codeforces Beta Round #28 (Codeforces format),12,DravDe saves the world,2500.0,E,1284735600,"[geometry, math]",PROGRAMMING
-29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Spit Problem,500.0,A,1284994800,[brute force],PROGRAMMING
-29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Traffic Lights,1000.0,B,1284994800,[implementation],PROGRAMMING
-29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Mail Stamps,1500.0,C,1284994800,"[data structures, dfs and similar, graphs, implementation]",PROGRAMMING
-29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Ant on the Tree,2000.0,D,1284994800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING
-29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Quarrel,2500.0,E,1284994800,"[graphs, shortest paths]",PROGRAMMING
-30,Codeforces Beta Round #30 (Codeforces format),12,Accounting,500.0,A,1285340400,"[brute force, math]",PROGRAMMING
-30,Codeforces Beta Round #30 (Codeforces format),12,Codeforces World Finals,1000.0,B,1285340400,[implementation],PROGRAMMING
-30,Codeforces Beta Round #30 (Codeforces format),12,Shooting Gallery,1500.0,C,1285340400,"[dp, probabilities]",PROGRAMMING
-30,Codeforces Beta Round #30 (Codeforces format),12,King's Problem?,2000.0,D,1285340400,"[geometry, greedy]",PROGRAMMING
-30,Codeforces Beta Round #30 (Codeforces format),12,Tricky and Clever Password,2500.0,E,1285340400,"[binary search, constructive algorithms, data structures, greedy, hashing, strings]",PROGRAMMING
-31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Worms Evolution,500.0,A,1285599600,[implementation],PROGRAMMING
-31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Sysadmin Bob,1000.0,B,1285599600,[strings],PROGRAMMING
-31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Schedule,1500.0,C,1285599600,[implementation],PROGRAMMING
-31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Chocolate,2000.0,D,1285599600,"[dfs and similar, implementation]",PROGRAMMING
-31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,TV Game,2500.0,E,1285599600,[dp],PROGRAMMING
-32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Reconnaissance,500.0,A,1286002800,[brute force],PROGRAMMING
-32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Borze,1000.0,B,1286002800,"[expression parsing, implementation]",PROGRAMMING
-32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Flea,1500.0,C,1286002800,[math],PROGRAMMING
-32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Constellation,2000.0,D,1286002800,[implementation],PROGRAMMING
-32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Hide-and-Seek,2500.0,E,1286002800,"[geometry, implementation]",PROGRAMMING
-33,Codeforces Beta Round #33 (Codeforces format),12,What is for dinner?,500.0,A,1286463600,"[greedy, implementation]",PROGRAMMING
-33,Codeforces Beta Round #33 (Codeforces format),12,String Problem,1000.0,B,1286463600,[shortest paths],PROGRAMMING
-33,Codeforces Beta Round #33 (Codeforces format),12,Wonderful Randomized Sum,1500.0,C,1286463600,[greedy],PROGRAMMING
-33,Codeforces Beta Round #33 (Codeforces format),12,Knights,2000.0,D,1286463600,"[geometry, graphs, shortest paths, sortings]",PROGRAMMING
-33,Codeforces Beta Round #33 (Codeforces format),12,Helper,2500.0,E,1286463600,[],PROGRAMMING
-34,Codeforces Beta Round #34 (Div. 2),2,Reconnaissance 2,500.0,A,1286802000,[implementation],PROGRAMMING
-34,Codeforces Beta Round #34 (Div. 2),2,Sale,1000.0,B,1286802000,"[greedy, sortings]",PROGRAMMING
-34,Codeforces Beta Round #34 (Div. 2),2,Page Numbers,1500.0,C,1286802000,"[expression parsing, implementation, sortings, strings]",PROGRAMMING
-34,Codeforces Beta Round #34 (Div. 2),2,Road Map,2000.0,D,1286802000,"[dfs and similar, graphs]",PROGRAMMING
-34,Codeforces Beta Round #34 (Div. 2),2,Collisions,2500.0,E,1286802000,"[brute force, implementation, math]",PROGRAMMING
-35,Codeforces Beta Round #35 (Div. 2),2,Shell Game,500.0,A,1287471600,[implementation],PROGRAMMING
-35,Codeforces Beta Round #35 (Div. 2),2,Warehouse,1000.0,B,1287471600,[implementation],PROGRAMMING
-35,Codeforces Beta Round #35 (Div. 2),2,Fire Again,1500.0,C,1287471600,"[brute force, dfs and similar, shortest paths]",PROGRAMMING
-35,Codeforces Beta Round #35 (Div. 2),2,Animals,2000.0,D,1287471600,"[dp, greedy]",PROGRAMMING
-35,Codeforces Beta Round #35 (Div. 2),2,Parade,2500.0,E,1287471600,"[data structures, sortings]",PROGRAMMING
-36,Codeforces Beta Round #36,12,Extra-terrestrial Intelligence,500.0,A,1287482400,[implementation],PROGRAMMING
-36,Codeforces Beta Round #36,12,Fractal,1000.0,B,1287482400,[implementation],PROGRAMMING
-36,Codeforces Beta Round #36,12,Bowls,1500.0,C,1287482400,"[geometry, implementation]",PROGRAMMING
-36,Codeforces Beta Round #36,12,New Game with a Chess Piece,2000.0,D,1287482400,[games],PROGRAMMING
-36,Codeforces Beta Round #36,12,Two Paths,2500.0,E,1287482400,"[constructive algorithms, dsu, graphs, implementation]",PROGRAMMING
-37,Codeforces Beta Round #37,12,Towers,500.0,A,1288018800,[sortings],PROGRAMMING
-37,Codeforces Beta Round #37,12,Computer Game,1000.0,B,1288018800,"[greedy, implementation]",PROGRAMMING
-37,Codeforces Beta Round #37,12,Old Berland Language,1500.0,C,1288018800,"[data structures, greedy, trees]",PROGRAMMING
-37,Codeforces Beta Round #37,12,Lesson Timetable,2000.0,D,1288018800,"[combinatorics, dp, math]",PROGRAMMING
-37,Codeforces Beta Round #37,12,Trial for Chief,2500.0,E,1288018800,"[graphs, greedy, shortest paths]",PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Almost Prime,500,A,1281970800,[number theory],PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Regular Bracket Sequence,1000,B,1281970800,[greedy],PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Parquet,1500,C,1281970800,"[combinatorics, constructive algorithms]",PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Tickets,2000,D,1281970800,"[combinatorics, probabilities]",PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Multithreading,2500,E,1281970800,[constructive algorithms],PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Next Test,500,A,1284130800,"[implementation, sortings]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Tournament,1000,B,1284130800,"[bitmasks, brute force, dfs and similar, greedy]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Unordered Subsequence,1500,C,1284130800,"[constructive algorithms, greedy]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Ring Road 2,2000,D,1284130800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Number With The Given Amount Of Divisors,2500,E,1284130800,"[brute force, dp, number theory]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,Bender Problem,500,A,1284735600,[implementation],PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,pSort,1000,B,1284735600,"[dfs and similar, dsu, graphs]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,Bath Queue,1500,C,1284735600,"[combinatorics, dp, probabilities]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,"Don't fear, DravDe is kind",2000,D,1284735600,"[binary search, data structures, dp, hashing]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,DravDe saves the world,2500,E,1284735600,"[geometry, math]",PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Spit Problem,500,A,1284994800,[brute force],PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Traffic Lights,1000,B,1284994800,[implementation],PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Mail Stamps,1500,C,1284994800,"[data structures, dfs and similar, graphs, implementation]",PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Ant on the Tree,2000,D,1284994800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Quarrel,2500,E,1284994800,"[graphs, shortest paths]",PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Accounting,500,A,1285340400,"[brute force, math]",PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Codeforces World Finals,1000,B,1285340400,[implementation],PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Shooting Gallery,1500,C,1285340400,"[dp, probabilities]",PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,King's Problem?,2000,D,1285340400,"[geometry, greedy]",PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Tricky and Clever Password,2500,E,1285340400,"[binary search, constructive algorithms, data structures, greedy, hashing, strings]",PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Worms Evolution,500,A,1285599600,[implementation],PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Sysadmin Bob,1000,B,1285599600,[strings],PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Schedule,1500,C,1285599600,[implementation],PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Chocolate,2000,D,1285599600,"[dfs and similar, implementation]",PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,TV Game,2500,E,1285599600,[dp],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Reconnaissance,500,A,1286002800,[brute force],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Borze,1000,B,1286002800,"[expression parsing, implementation]",PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Flea,1500,C,1286002800,[math],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Constellation,2000,D,1286002800,[implementation],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Hide-and-Seek,2500,E,1286002800,"[geometry, implementation]",PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,What is for dinner?,500,A,1286463600,"[greedy, implementation]",PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,String Problem,1000,B,1286463600,[shortest paths],PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,Wonderful Randomized Sum,1500,C,1286463600,[greedy],PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,Knights,2000,D,1286463600,"[geometry, graphs, shortest paths, sortings]",PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,Helper,2500,E,1286463600,[],PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Reconnaissance 2,500,A,1286802000,[implementation],PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Sale,1000,B,1286802000,"[greedy, sortings]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Page Numbers,1500,C,1286802000,"[expression parsing, implementation, sortings, strings]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Road Map,2000,D,1286802000,"[dfs and similar, graphs]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Collisions,2500,E,1286802000,"[brute force, implementation, math]",PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Shell Game,500,A,1287471600,[implementation],PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Warehouse,1000,B,1287471600,[implementation],PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Fire Again,1500,C,1287471600,"[brute force, dfs and similar, shortest paths]",PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Animals,2000,D,1287471600,"[dp, greedy]",PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Parade,2500,E,1287471600,"[data structures, sortings]",PROGRAMMING
+36,Codeforces Beta Round #36,12,Extra-terrestrial Intelligence,500,A,1287482400,[implementation],PROGRAMMING
+36,Codeforces Beta Round #36,12,Fractal,1000,B,1287482400,[implementation],PROGRAMMING
+36,Codeforces Beta Round #36,12,Bowls,1500,C,1287482400,"[geometry, implementation]",PROGRAMMING
+36,Codeforces Beta Round #36,12,New Game with a Chess Piece,2000,D,1287482400,[games],PROGRAMMING
+36,Codeforces Beta Round #36,12,Two Paths,2500,E,1287482400,"[constructive algorithms, dsu, graphs, implementation]",PROGRAMMING
+37,Codeforces Beta Round #37,12,Towers,500,A,1288018800,[sortings],PROGRAMMING
+37,Codeforces Beta Round #37,12,Computer Game,1000,B,1288018800,"[greedy, implementation]",PROGRAMMING
+37,Codeforces Beta Round #37,12,Old Berland Language,1500,C,1288018800,"[data structures, greedy, trees]",PROGRAMMING
+37,Codeforces Beta Round #37,12,Lesson Timetable,2000,D,1288018800,"[combinatorics, dp, math]",PROGRAMMING
+37,Codeforces Beta Round #37,12,Trial for Chief,2500,E,1288018800,"[graphs, greedy, shortest paths]",PROGRAMMING
38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Army,,A,1288440000,[implementation],PROGRAMMING
38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Chess,,B,1288440000,"[brute force, implementation, math]",PROGRAMMING
38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Blinds,,C,1288440000,[brute force],PROGRAMMING
@@ -161,26 +183,57 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Smart Boy,,F,1288440000,"[dp, games, strings]",PROGRAMMING
38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Queue,,G,1288440000,[data structures],PROGRAMMING
38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,The Great Marathon,,H,1288440000,[dp],PROGRAMMING
-40,Codeforces Beta Round #39,12,Find Color,500.0,A,1288972800,"[constructive algorithms, implementation, math]",PROGRAMMING
-40,Codeforces Beta Round #39,12,Repaintings,1000.0,B,1288972800,[math],PROGRAMMING
-40,Codeforces Beta Round #39,12,Berland Square,1500.0,C,1288972800,[math],PROGRAMMING
-40,Codeforces Beta Round #39,12,Interesting Sequence,2000.0,D,1288972800,[math],PROGRAMMING
-40,Codeforces Beta Round #39,12,Number Table,2500.0,E,1288972800,[combinatorics],PROGRAMMING
-41,Codeforces Beta Round #40 (Div. 2),2,Translation,500.0,A,1289232000,"[implementation, strings]",PROGRAMMING
-41,Codeforces Beta Round #40 (Div. 2),2,Martian Dollar,1000.0,B,1289232000,[brute force],PROGRAMMING
-41,Codeforces Beta Round #40 (Div. 2),2,Email address,1500.0,C,1289232000,"[expression parsing, implementation]",PROGRAMMING
-41,Codeforces Beta Round #40 (Div. 2),2,Pawn,2000.0,D,1289232000,[dp],PROGRAMMING
-41,Codeforces Beta Round #40 (Div. 2),2,3-cycles,2500.0,E,1289232000,"[constructive algorithms, graphs, greedy]",PROGRAMMING
-42,Codeforces Beta Round #41,12,Guilty --- to the kitchen!,500.0,A,1290096000,"[greedy, implementation]",PROGRAMMING
-42,Codeforces Beta Round #41,12,Game of chess unfinished,1000.0,B,1290096000,[implementation],PROGRAMMING
-42,Codeforces Beta Round #41,12,Safe cracking,1500.0,C,1290096000,"[brute force, constructive algorithms]",PROGRAMMING
-42,Codeforces Beta Round #41,12,Strange town,2000.0,D,1290096000,"[constructive algorithms, math]",PROGRAMMING
-42,Codeforces Beta Round #41,12,Baldman and the military,2500.0,E,1290096000,"[dfs and similar, graphs]",PROGRAMMING
-43,Codeforces Beta Round #42 (Div. 2),2,Football,500.0,A,1291046400,[strings],PROGRAMMING
-43,Codeforces Beta Round #42 (Div. 2),2,Letter,1000.0,B,1291046400,"[implementation, strings]",PROGRAMMING
-43,Codeforces Beta Round #42 (Div. 2),2,Lucky Tickets,1500.0,C,1291046400,[greedy],PROGRAMMING
-43,Codeforces Beta Round #42 (Div. 2),2,Journey,2000.0,D,1291046400,"[brute force, constructive algorithms, implementation]",PROGRAMMING
-43,Codeforces Beta Round #42 (Div. 2),2,Race,2500.0,E,1291046400,"[brute force, implementation, two pointers]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,C*++ Calculations,,A,1287904200,"[expression parsing, greedy]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Company Income Growth,,B,1287904200,[greedy],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Moon Craters,,C,1287904200,"[dp, sortings]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Cubical Planet,,D,1287904200,[math],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,What Has Dirichlet Got to Do with That?,,E,1287904200,"[dp, games]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Pacifist frogs,,F,1287904200,[implementation],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Inverse Function,,G,1287904200,[implementation],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Multiplication Table,,H,1287904200,[implementation],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Tram,,I,1287904200,[],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Spelling Check,,J,1287904200,"[hashing, implementation, strings]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Testing,,K,1287904200,[],PROGRAMMING
+40,Codeforces Beta Round #39,12,Find Color,500,A,1288972800,"[constructive algorithms, implementation, math]",PROGRAMMING
+40,Codeforces Beta Round #39,12,Repaintings,1000,B,1288972800,[math],PROGRAMMING
+40,Codeforces Beta Round #39,12,Berland Square,1500,C,1288972800,[math],PROGRAMMING
+40,Codeforces Beta Round #39,12,Interesting Sequence,2000,D,1288972800,[math],PROGRAMMING
+40,Codeforces Beta Round #39,12,Number Table,2500,E,1288972800,[combinatorics],PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Translation,500,A,1289232000,"[implementation, strings]",PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Martian Dollar,1000,B,1289232000,[brute force],PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Email address,1500,C,1289232000,"[expression parsing, implementation]",PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Pawn,2000,D,1289232000,[dp],PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,3-cycles,2500,E,1289232000,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Guilty --- to the kitchen!,500,A,1290096000,"[greedy, implementation]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Game of chess unfinished,1000,B,1290096000,[implementation],PROGRAMMING
+42,Codeforces Beta Round #41,12,Safe cracking,1500,C,1290096000,"[brute force, constructive algorithms]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Strange town,2000,D,1290096000,"[constructive algorithms, math]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Baldman and the military,2500,E,1290096000,"[dfs and similar, graphs]",PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Football,500,A,1291046400,[strings],PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Letter,1000,B,1291046400,"[implementation, strings]",PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Lucky Tickets,1500,C,1291046400,[greedy],PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Journey,2000,D,1291046400,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Race,2500,E,1291046400,"[brute force, implementation, two pointers]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Indian Summer,,A,1289041200,[implementation],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Cola,,B,1289041200,[implementation],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Holidays,,C,1289041200,[implementation],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Hyperdrive,,D,1289041200,[math],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Anfisa the Monkey,,E,1289041200,[dp],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,BerPaint,,F,1289041200,"[geometry, graphs]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Shooting Gallery,,G,1289041200,"[data structures, implementation]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Phone Number,,H,1289041200,[dp],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Toys,,I,1289041200,"[brute force, combinatorics]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Triminoes,,J,1289041200,"[constructive algorithms, greedy]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Codecraft III,,A,1289646000,[implementation],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,School,,B,1289646000,"[dp, dsu]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Dancing Lessons,,C,1289646000,[data structures],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Event Dates,,D,1289646000,"[greedy, meet-in-the-middle, sortings]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Director,,E,1289646000,"[constructive algorithms, greedy]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Goats and Wolves,,F,1289646000,[greedy],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Prime Problem,,G,1289646000,[number theory],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Road Problem,,H,1289646000,[graphs],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,TCMCF+++,,I,1289646000,[greedy],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Planting Trees,,J,1289646000,[constructive algorithms],PROGRAMMING
46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Ball Game,,A,1291536000,"[brute force, implementation]",PROGRAMMING
46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,T-shirts from Sponsor,,B,1291536000,[implementation],PROGRAMMING
46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hamsters and Tigers,,C,1291536000,[two pointers],PROGRAMMING
@@ -188,11 +241,11 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Comb,,E,1291536000,"[data structures, dp]",PROGRAMMING
46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hercule Poirot Problem,,F,1291536000,"[dsu, graphs]",PROGRAMMING
46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Emperor's Problem,,G,1291536000,[geometry],PROGRAMMING
-47,Codeforces Beta Round #44 (Div. 2),2,Triangular numbers,500.0,A,1291737600,"[brute force, math]",PROGRAMMING
-47,Codeforces Beta Round #44 (Div. 2),2,Coins,1000.0,B,1291737600,[implementation],PROGRAMMING
-47,Codeforces Beta Round #44 (Div. 2),2,Crossword,1500.0,C,1291737600,[implementation],PROGRAMMING
-47,Codeforces Beta Round #44 (Div. 2),2,Safe,2000.0,D,1291737600,[brute force],PROGRAMMING
-47,Codeforces Beta Round #44 (Div. 2),2,Cannon,2500.0,E,1291737600,"[data structures, geometry, sortings]",PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Triangular numbers,500,A,1291737600,"[brute force, math]",PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Coins,1000,B,1291737600,[implementation],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Crossword,1500,C,1291737600,[implementation],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Safe,2000,D,1291737600,[brute force],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Cannon,2500,E,1291737600,"[data structures, geometry, sortings]",PROGRAMMING
48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Rock-paper-scissors,,A,1292140800,"[implementation, schedules]",PROGRAMMING
48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Land Lot,,B,1292140800,"[brute force, implementation]",PROGRAMMING
48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,The Race,,C,1292140800,[math],PROGRAMMING
@@ -201,2582 +254,6533 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Snow sellers,,F,1292140800,"[greedy, sortings]",PROGRAMMING
48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Galaxy Union,,G,1292140800,"[dp, trees, two pointers]",PROGRAMMING
48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Black and White,,H,1292140800,[constructive algorithms],PROGRAMMING
-49,Codeforces Beta Round #46 (Div. 2),2,Sleuth,500.0,A,1292601600,[implementation],PROGRAMMING
-49,Codeforces Beta Round #46 (Div. 2),2,Sum,1000.0,B,1292601600,[math],PROGRAMMING
-49,Codeforces Beta Round #46 (Div. 2),2,Disposition,1500.0,C,1292601600,"[constructive algorithms, math]",PROGRAMMING
-49,Codeforces Beta Round #46 (Div. 2),2,Game,2000.0,D,1292601600,"[brute force, dp, implementation]",PROGRAMMING
-49,Codeforces Beta Round #46 (Div. 2),2,Common ancestor,2500.0,E,1292601600,[dp],PROGRAMMING
-51,Codeforces Beta Round #48,12,Cheaterius's Problem,500.0,A,1293552000,[implementation],PROGRAMMING
-51,Codeforces Beta Round #48,12,bHTML Tables Analisys,1000.0,B,1293552000,[expression parsing],PROGRAMMING
-51,Codeforces Beta Round #48,12,Three Base Stations,1500.0,C,1293552000,"[binary search, greedy]",PROGRAMMING
-51,Codeforces Beta Round #48,12,Geometrical problem,2000.0,D,1293552000,[implementation],PROGRAMMING
-51,Codeforces Beta Round #48,12,Pentagon,2500.0,E,1293552000,"[combinatorics, graphs, matrices]",PROGRAMMING
-51,Codeforces Beta Round #48,12,Caterpillar,3000.0,F,1293552000,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
-53,Codeforces Beta Round #49 (Div. 2),2,Autocomplete,500.0,A,1294329600,[implementation],PROGRAMMING
-53,Codeforces Beta Round #49 (Div. 2),2,Blog Photo,1000.0,B,1294329600,"[binary search, implementation]",PROGRAMMING
-53,Codeforces Beta Round #49 (Div. 2),2,Little Frog,1500.0,C,1294329600,[constructive algorithms],PROGRAMMING
-53,Codeforces Beta Round #49 (Div. 2),2,Physical Education,2000.0,D,1294329600,[sortings],PROGRAMMING
-53,Codeforces Beta Round #49 (Div. 2),2,Dead Ends,2500.0,E,1294329600,"[bitmasks, dp]",PROGRAMMING
-54,Codeforces Beta Round #50,12,Presents,500.0,A,1294733700,[implementation],PROGRAMMING
-54,Codeforces Beta Round #50,12,Cutting Jigsaw Puzzle,1000.0,B,1294733700,"[hashing, implementation]",PROGRAMMING
-54,Codeforces Beta Round #50,12,First Digit Law,1500.0,C,1294733700,"[dp, math, probabilities]",PROGRAMMING
-54,Codeforces Beta Round #50,12,Writing a Song,2000.0,D,1294733700,"[brute force, dp]",PROGRAMMING
-54,Codeforces Beta Round #50,12,Vacuum Сleaner,2500.0,E,1294733700,[geometry],PROGRAMMING
-55,Codeforces Beta Round #51,12,Flea travel,500.0,A,1294992000,"[implementation, math]",PROGRAMMING
-55,Codeforces Beta Round #51,12,Smallest number,1000.0,B,1294992000,[brute force],PROGRAMMING
-55,Codeforces Beta Round #51,12,Pie or die,1500.0,C,1294992000,[games],PROGRAMMING
-55,Codeforces Beta Round #51,12,Beautiful numbers,2000.0,D,1294992000,"[dp, number theory]",PROGRAMMING
-55,Codeforces Beta Round #51,12,Very simple problem,2500.0,E,1294992000,"[geometry, two pointers]",PROGRAMMING
-56,Codeforces Beta Round #52 (Div. 2),2,Bar,500.0,A,1295626200,[implementation],PROGRAMMING
-56,Codeforces Beta Round #52 (Div. 2),2,Spoilt Permutation,1000.0,B,1295626200,[implementation],PROGRAMMING
-56,Codeforces Beta Round #52 (Div. 2),2,Corporation Mail,1500.0,C,1295626200,"[data structures, expression parsing, implementation]",PROGRAMMING
-56,Codeforces Beta Round #52 (Div. 2),2,Changing a String,2000.0,D,1295626200,[dp],PROGRAMMING
-56,Codeforces Beta Round #52 (Div. 2),2,Domino Principle,2500.0,E,1295626200,"[binary search, data structures, sortings]",PROGRAMMING
-57,Codeforces Beta Round #53,12,Square Earth?,500.0,A,1295971200,"[dfs and similar, greedy, implementation]",PROGRAMMING
-57,Codeforces Beta Round #53,12,Martian Architecture,1000.0,B,1295971200,[implementation],PROGRAMMING
-57,Codeforces Beta Round #53,12,Array,1500.0,C,1295971200,"[combinatorics, math]",PROGRAMMING
-57,Codeforces Beta Round #53,12,Journey,2000.0,D,1295971200,"[dp, math]",PROGRAMMING
-57,Codeforces Beta Round #53,12,Chess,2500.0,E,1295971200,"[math, shortest paths]",PROGRAMMING
-58,Codeforces Beta Round #54 (Div. 2),2,Chat room,500.0,A,1296489600,"[greedy, strings]",PROGRAMMING
-58,Codeforces Beta Round #54 (Div. 2),2,Coins,1000.0,B,1296489600,[greedy],PROGRAMMING
-58,Codeforces Beta Round #54 (Div. 2),2,Trees,1500.0,C,1296489600,[brute force],PROGRAMMING
-58,Codeforces Beta Round #54 (Div. 2),2,Calendar,2000.0,D,1296489600,"[greedy, strings]",PROGRAMMING
-58,Codeforces Beta Round #54 (Div. 2),2,Expression,2500.0,E,1296489600,[dp],PROGRAMMING
-59,Codeforces Beta Round #55 (Div. 2),2,Word,500.0,A,1297440000,"[implementation, strings]",PROGRAMMING
-59,Codeforces Beta Round #55 (Div. 2),2,Fortune Telling,1000.0,B,1297440000,"[implementation, number theory]",PROGRAMMING
-59,Codeforces Beta Round #55 (Div. 2),2,Title,1500.0,C,1297440000,[expression parsing],PROGRAMMING
-59,Codeforces Beta Round #55 (Div. 2),2,Team Arrangement,2000.0,D,1297440000,"[constructive algorithms, greedy, implementation]",PROGRAMMING
-59,Codeforces Beta Round #55 (Div. 2),2,Shortest Path,2500.0,E,1297440000,"[graphs, shortest paths]",PROGRAMMING
-60,Codeforces Beta Round #56,12,Where Are My Flakes?,500.0,A,1298131200,"[implementation, two pointers]",PROGRAMMING
-60,Codeforces Beta Round #56,12,Serial Time!,1000.0,B,1298131200,"[dfs and similar, dsu]",PROGRAMMING
-60,Codeforces Beta Round #56,12,Mushroom Strife,1500.0,C,1298131200,"[brute force, dfs and similar]",PROGRAMMING
-60,Codeforces Beta Round #56,12,Savior,2000.0,D,1298131200,"[brute force, dsu, math]",PROGRAMMING
-60,Codeforces Beta Round #56,12,Mushroom Gnomes,2500.0,E,1298131200,"[math, matrices]",PROGRAMMING
-61,Codeforces Beta Round #57 (Div. 2),2,Ultra-Fast Mathematician,500.0,A,1298390400,[implementation],PROGRAMMING
-61,Codeforces Beta Round #57 (Div. 2),2,Hard Work,1000.0,B,1298390400,[strings],PROGRAMMING
-61,Codeforces Beta Round #57 (Div. 2),2,Capture Valerian,1500.0,C,1298390400,[math],PROGRAMMING
-61,Codeforces Beta Round #57 (Div. 2),2,Eternal Victory,2000.0,D,1298390400,"[dfs and similar, graphs, greedy, shortest paths, trees]",PROGRAMMING
-61,Codeforces Beta Round #57 (Div. 2),2,Enemy is weak,2500.0,E,1298390400,"[data structures, trees]",PROGRAMMING
-62,Codeforces Beta Round #58,12,A Student's Dream,500.0,A,1298649600,"[greedy, math]",PROGRAMMING
-62,Codeforces Beta Round #58,12,Tyndex.Brome,1000.0,B,1298649600,"[binary search, implementation]",PROGRAMMING
-62,Codeforces Beta Round #58,12,Inquisition,1500.0,C,1298649600,"[geometry, implementation, sortings]",PROGRAMMING
-62,Codeforces Beta Round #58,12,Wormhouse,2000.0,D,1298649600,"[dfs and similar, graphs]",PROGRAMMING
-62,Codeforces Beta Round #58,12,World Evil,2500.0,E,1298649600,"[dp, flows]",PROGRAMMING
-63,Codeforces Beta Round #59 (Div. 2),2,Sinking Ship,500.0,A,1298908800,"[implementation, sortings, strings]",PROGRAMMING
-63,Codeforces Beta Round #59 (Div. 2),2,Settlers' Training,1000.0,B,1298908800,[implementation],PROGRAMMING
-63,Codeforces Beta Round #59 (Div. 2),2,Bulls and Cows,1500.0,C,1298908800,"[brute force, implementation]",PROGRAMMING
-63,Codeforces Beta Round #59 (Div. 2),2,Dividing Island,2000.0,D,1298908800,[constructive algorithms],PROGRAMMING
-63,Codeforces Beta Round #59 (Div. 2),2,Sweets Game,2500.0,E,1298908800,"[bitmasks, dfs and similar, dp, games, implementation]",PROGRAMMING
-65,Codeforces Beta Round #60,12,Harry Potter and Three Spells,500.0,A,1299340800,"[implementation, math]",PROGRAMMING
-65,Codeforces Beta Round #60,12,Harry Potter and the History of Magic,1000.0,B,1299340800,"[brute force, greedy, implementation]",PROGRAMMING
-65,Codeforces Beta Round #60,12,Harry Potter and the Golden Snitch,1500.0,C,1299340800,"[binary search, geometry]",PROGRAMMING
-65,Codeforces Beta Round #60,12,Harry Potter and the Sorting Hat,2000.0,D,1299340800,"[brute force, dfs and similar, hashing]",PROGRAMMING
-65,Codeforces Beta Round #60,12,Harry Potter and Moving Staircases,2500.0,E,1299340800,"[dfs and similar, implementation]",PROGRAMMING
-66,Codeforces Beta Round #61 (Div. 2),2,Petya and Java,500.0,A,1299513600,"[implementation, strings]",PROGRAMMING
-66,Codeforces Beta Round #61 (Div. 2),2,Petya and Countryside,1000.0,B,1299513600,"[brute force, implementation]",PROGRAMMING
-66,Codeforces Beta Round #61 (Div. 2),2,Petya and File System,1500.0,C,1299513600,"[data structures, implementation]",PROGRAMMING
-66,Codeforces Beta Round #61 (Div. 2),2,Petya and His Friends,2000.0,D,1299513600,"[constructive algorithms, math, number theory]",PROGRAMMING
-66,Codeforces Beta Round #61 (Div. 2),2,Petya and Post,2500.0,E,1299513600,"[data structures, dp]",PROGRAMMING
-67,Manthan 2011,12,Partial Teacher,500.0,A,1300033800,"[dp, graphs, greedy, implementation]",PROGRAMMING
-67,Manthan 2011,12,Restoration of the Permutation,1000.0,B,1300033800,[greedy],PROGRAMMING
-67,Manthan 2011,12,Sequence of Balls,1500.0,C,1300033800,[dp],PROGRAMMING
-67,Manthan 2011,12,Optical Experiment,2000.0,D,1300033800,"[binary search, data structures, dp]",PROGRAMMING
-67,Manthan 2011,12,Save the City!,2500.0,E,1300033800,[geometry],PROGRAMMING
-68,Codeforces Beta Round #62,12,Irrational problem,500.0,A,1300464000,"[implementation, number theory]",PROGRAMMING
-68,Codeforces Beta Round #62,12,Energy exchange,1000.0,B,1300464000,[binary search],PROGRAMMING
-68,Codeforces Beta Round #62,12,Synchrophasotron,1500.0,C,1300464000,[brute force],PROGRAMMING
-68,Codeforces Beta Round #62,12,Half-decay tree,2000.0,D,1300464000,"[data structures, divide and conquer, dp, probabilities]",PROGRAMMING
-68,Codeforces Beta Round #62,12,Contact,2500.0,E,1300464000,[geometry],PROGRAMMING
-69,Codeforces Beta Round #63 (Div. 2),2,Young Physicist,500.0,A,1300809600,"[implementation, math]",PROGRAMMING
-69,Codeforces Beta Round #63 (Div. 2),2,Bets,1000.0,B,1300809600,"[greedy, implementation]",PROGRAMMING
-69,Codeforces Beta Round #63 (Div. 2),2,Game,1500.0,C,1300809600,[implementation],PROGRAMMING
-69,Codeforces Beta Round #63 (Div. 2),2,Dot,2000.0,D,1300809600,"[dp, games]",PROGRAMMING
-69,Codeforces Beta Round #63 (Div. 2),2,Subsegments,2500.0,E,1300809600,"[data structures, implementation]",PROGRAMMING
-70,Codeforces Beta Round #64,12,Cookies,500.0,A,1301155200,[math],PROGRAMMING
-70,Codeforces Beta Round #64,12,Text Messaging,1000.0,B,1301155200,"[expression parsing, greedy, strings]",PROGRAMMING
-70,Codeforces Beta Round #64,12,Lucky Tickets,1500.0,C,1301155200,"[binary search, data structures, sortings, two pointers]",PROGRAMMING
-70,Codeforces Beta Round #64,12,Professor's task,2000.0,D,1301155200,"[data structures, geometry]",PROGRAMMING
-70,Codeforces Beta Round #64,12,Information Reform,2500.0,E,1301155200,"[dp, implementation, trees]",PROGRAMMING
-71,Codeforces Beta Round #65 (Div. 2),2,Way Too Long Words,500.0,A,1301410800,[strings],PROGRAMMING
-71,Codeforces Beta Round #65 (Div. 2),2,Progress Bar,1000.0,B,1301410800,"[implementation, math]",PROGRAMMING
-71,Codeforces Beta Round #65 (Div. 2),2,Round Table Knights,1500.0,C,1301410800,"[dp, math, number theory]",PROGRAMMING
-71,Codeforces Beta Round #65 (Div. 2),2,Solitaire,2000.0,D,1301410800,"[brute force, implementation]",PROGRAMMING
-71,Codeforces Beta Round #65 (Div. 2),2,Nuclear Fusion,2500.0,E,1301410800,"[bitmasks, dp]",PROGRAMMING
-73,Codeforces Beta Round #66,12,The Elder Trolls IV: Oblivon,500.0,A,1302422400,"[greedy, math]",PROGRAMMING
-73,Codeforces Beta Round #66,12,Need For Brake,1000.0,B,1302422400,"[binary search, greedy, sortings]",PROGRAMMING
-73,Codeforces Beta Round #66,12,LionAge II,1000.0,C,1302422400,[dp],PROGRAMMING
-73,Codeforces Beta Round #66,12,FreeDiv,1500.0,D,1302422400,"[dfs and similar, graphs, greedy]",PROGRAMMING
-73,Codeforces Beta Round #66,12,Morrowindows,1500.0,E,1302422400,"[math, number theory]",PROGRAMMING
-73,Codeforces Beta Round #66,12,Plane of Tanks,2000.0,F,1302422400,"[brute force, geometry]",PROGRAMMING
-74,Codeforces Beta Round #68,12,Room Leader,500.0,A,1302879600,[implementation],PROGRAMMING
-74,Codeforces Beta Round #68,12,Train,1000.0,B,1302879600,"[dp, games, greedy]",PROGRAMMING
-74,Codeforces Beta Round #68,12,Chessboard Billiard,1500.0,C,1302879600,"[dfs and similar, dsu, graphs, number theory]",PROGRAMMING
-74,Codeforces Beta Round #68,12,Hanger,2000.0,D,1302879600,[data structures],PROGRAMMING
-74,Codeforces Beta Round #68,12,Shift It!,2500.0,E,1302879600,[constructive algorithms],PROGRAMMING
-75,Codeforces Beta Round #67 (Div. 2),2,Life Without Zeros,500.0,A,1302706800,[implementation],PROGRAMMING
-75,Codeforces Beta Round #67 (Div. 2),2,Facetook Priority Wall,1000.0,B,1302706800,"[expression parsing, implementation, strings]",PROGRAMMING
-75,Codeforces Beta Round #67 (Div. 2),2,Modified GCD,1500.0,C,1302706800,"[binary search, number theory]",PROGRAMMING
-75,Codeforces Beta Round #67 (Div. 2),2,Big Maximum Sum,2000.0,D,1302706800,"[data structures, dp, greedy, implementation, math, trees]",PROGRAMMING
-75,Codeforces Beta Round #67 (Div. 2),2,Ship's Shortest Path,2500.0,E,1302706800,"[geometry, shortest paths]",PROGRAMMING
-77,Codeforces Beta Round #69 (Div. 1 Only),1,Heroes,500.0,A,1303226100,"[brute force, implementation]",PROGRAMMING
-77,Codeforces Beta Round #69 (Div. 1 Only),1,Falling Anvils,1000.0,B,1303226100,"[math, probabilities]",PROGRAMMING
-77,Codeforces Beta Round #69 (Div. 1 Only),1,Beavermuncher-0xFF,1500.0,C,1303226100,"[dfs and similar, dp, dsu, greedy, trees]",PROGRAMMING
-77,Codeforces Beta Round #69 (Div. 1 Only),1,Domino Carpet,2000.0,D,1303226100,"[dp, implementation]",PROGRAMMING
-77,Codeforces Beta Round #69 (Div. 1 Only),1,Martian Food,2000.0,E,1303226100,[geometry],PROGRAMMING
-78,Codeforces Beta Round #70 (Div. 2),2,Haiku,500.0,A,1303916400,"[implementation, strings]",PROGRAMMING
-78,Codeforces Beta Round #70 (Div. 2),2,Easter Eggs,1000.0,B,1303916400,"[constructive algorithms, implementation]",PROGRAMMING
-78,Codeforces Beta Round #70 (Div. 2),2,Beaver Game,1500.0,C,1303916400,"[dp, games, number theory]",PROGRAMMING
-78,Codeforces Beta Round #70 (Div. 2),2,Archer's Shot,2000.0,D,1303916400,"[binary search, geometry, math, two pointers]",PROGRAMMING
-78,Codeforces Beta Round #70 (Div. 2),2,Evacuation,2500.0,E,1303916400,"[flows, graphs, shortest paths]",PROGRAMMING
-79,Codeforces Beta Round #71,12,Bus Game,500.0,A,1304175600,[greedy],PROGRAMMING
-79,Codeforces Beta Round #71,12,Colorful Field,1000.0,B,1304175600,"[implementation, sortings]",PROGRAMMING
-79,Codeforces Beta Round #71,12,Beaver,1500.0,C,1304175600,"[data structures, dp, greedy, hashing, strings, two pointers]",PROGRAMMING
-79,Codeforces Beta Round #71,12,Password,2000.0,D,1304175600,"[bitmasks, dp, shortest paths]",PROGRAMMING
-79,Codeforces Beta Round #71,12,Security System,2500.0,E,1304175600,[math],PROGRAMMING
-80,Codeforces Beta Round #69 (Div. 2 Only),2,Panoramix's Prediction,500.0,A,1303226100,[brute force],PROGRAMMING
-80,Codeforces Beta Round #69 (Div. 2 Only),2,Depression,1000.0,B,1303226100,"[geometry, math]",PROGRAMMING
-80,Codeforces Beta Round #69 (Div. 2 Only),2,Heroes,1500.0,C,1303226100,"[brute force, implementation]",PROGRAMMING
-80,Codeforces Beta Round #69 (Div. 2 Only),2,Falling Anvils,2000.0,D,1303226100,"[geometry, probabilities]",PROGRAMMING
-80,Codeforces Beta Round #69 (Div. 2 Only),2,Beavermuncher-0xFF,2500.0,E,1303226100,[],PROGRAMMING
-81,Yandex.Algorithm Open 2011
Qualification 1,12,Plug-in,500.0,A,1304485200,[implementation],PROGRAMMING
-81,Yandex.Algorithm Open 2011
Qualification 1,12,Sequence Formatting,1000.0,B,1304485200,"[implementation, strings]",PROGRAMMING
-81,Yandex.Algorithm Open 2011
Qualification 1,12,Average Score,1500.0,C,1304485200,"[math, sortings]",PROGRAMMING
-81,Yandex.Algorithm Open 2011
Qualification 1,12,Polycarp's Picture Gallery,2000.0,D,1304485200,"[constructive algorithms, greedy]",PROGRAMMING
-81,Yandex.Algorithm Open 2011
Qualification 1,12,Pairs,2500.0,E,1304485200,"[dfs and similar, dp, dsu, graphs, implementation, trees]",PROGRAMMING
-82,Yandex.Algorithm 2011
Qualification 2,12,Double Cola,500.0,A,1304694000,"[implementation, math]",PROGRAMMING
-82,Yandex.Algorithm 2011
Qualification 2,12,Sets,1000.0,B,1304694000,"[constructive algorithms, hashing, implementation]",PROGRAMMING
-82,Yandex.Algorithm 2011
Qualification 2,12,General Mobilization,1500.0,C,1304694000,"[data structures, dfs and similar, sortings]",PROGRAMMING
-82,Yandex.Algorithm 2011
Qualification 2,12,Two out of Three,2000.0,D,1304694000,[dp],PROGRAMMING
-82,Yandex.Algorithm 2011
Qualification 2,12,Corridor,2500.0,E,1304694000,[geometry],PROGRAMMING
-83,Codeforces Beta Round #72 (Div. 1 Only),1,Magical Array,500.0,A,1305299400,[math],PROGRAMMING
-83,Codeforces Beta Round #72 (Div. 1 Only),1,Doctor,1000.0,B,1305299400,"[binary search, math, sortings]",PROGRAMMING
-83,Codeforces Beta Round #72 (Div. 1 Only),1,Track,1500.0,C,1305299400,"[graphs, greedy, shortest paths]",PROGRAMMING
-83,Codeforces Beta Round #72 (Div. 1 Only),1,Numbers,2000.0,D,1305299400,"[dp, math, number theory]",PROGRAMMING
-83,Codeforces Beta Round #72 (Div. 1 Only),1,Two Subsequences,2500.0,E,1305299400,"[bitmasks, dp]",PROGRAMMING
-84,Codeforces Beta Round #72 (Div. 2 Only),2,Toy Army,500.0,A,1305299400,"[math, number theory]",PROGRAMMING
-84,Codeforces Beta Round #72 (Div. 2 Only),2,Magical Array,1000.0,B,1305299400,"[combinatorics, implementation]",PROGRAMMING
-84,Codeforces Beta Round #72 (Div. 2 Only),2,Biathlon,1500.0,C,1305299400,"[binary search, implementation]",PROGRAMMING
-84,Codeforces Beta Round #72 (Div. 2 Only),2,Doctor,2000.0,D,1305299400,"[binary search, implementation]",PROGRAMMING
-84,Codeforces Beta Round #72 (Div. 2 Only),2,Track,2500.0,E,1305299400,"[brute force, shortest paths]",PROGRAMMING
-85,Yandex.Algorithm 2011
Round 1,12,Domino,500.0,A,1305903600,"[constructive algorithms, implementation]",PROGRAMMING
-85,Yandex.Algorithm 2011
Round 1,12,Embassy Queue,1000.0,B,1305903600,[data structures],PROGRAMMING
-85,Yandex.Algorithm 2011
Round 1,12,Petya and Tree,1500.0,C,1305903600,"[binary search, dfs and similar, probabilities, sortings, trees]",PROGRAMMING
-85,Yandex.Algorithm 2011
Round 1,12,Sum of Medians,2000.0,D,1305903600,"[binary search, brute force, data structures, implementation]",PROGRAMMING
-85,Yandex.Algorithm 2011
Round 1,12,Guard Towers,2500.0,E,1305903600,"[binary search, dsu, geometry, graphs, sortings]",PROGRAMMING
-86,Yandex.Algorithm 2011
Round 2,12,Reflection,500.0,A,1306077000,[math],PROGRAMMING
-86,Yandex.Algorithm 2011
Round 2,12,Tetris revisited,1000.0,B,1306077000,"[constructive algorithms, graph matchings, greedy, math]",PROGRAMMING
-86,Yandex.Algorithm 2011
Round 2,12,Genetic engineering,2000.0,C,1306077000,"[dp, string suffix structures, trees]",PROGRAMMING
-86,Yandex.Algorithm 2011
Round 2,12,Powerful array,2500.0,D,1306077000,"[data structures, implementation, math, two pointers]",PROGRAMMING
-86,Yandex.Algorithm 2011
Round 2,12,Long sequence,2500.0,E,1306077000,"[brute force, math, matrices]",PROGRAMMING
-87,Codeforces Beta Round #73 (Div. 1 Only),1,Trains,500.0,A,1307458800,[math],PROGRAMMING
-87,Codeforces Beta Round #73 (Div. 1 Only),1,Vasya and Types,1000.0,B,1307458800,"[implementation, strings]",PROGRAMMING
-87,Codeforces Beta Round #73 (Div. 1 Only),1,Interesting Game,1500.0,C,1307458800,"[dp, games]",PROGRAMMING
-87,Codeforces Beta Round #73 (Div. 1 Only),1,Beautiful Road,2000.0,D,1307458800,"[dfs and similar, dp, dsu, implementation, sortings, trees]",PROGRAMMING
-87,Codeforces Beta Round #73 (Div. 1 Only),1,Mogohu-Rea Idol,2500.0,E,1307458800,[geometry],PROGRAMMING
-88,Codeforces Beta Round #73 (Div. 2 Only),2,Chord,500.0,A,1307458800,"[brute force, implementation]",PROGRAMMING
-88,Codeforces Beta Round #73 (Div. 2 Only),2,Keyboard,1000.0,B,1307458800,[implementation],PROGRAMMING
-88,Codeforces Beta Round #73 (Div. 2 Only),2,Trains,1500.0,C,1307458800,[number theory],PROGRAMMING
-88,Codeforces Beta Round #73 (Div. 2 Only),2,Vasya and Types,2000.0,D,1307458800,[implementation],PROGRAMMING
-88,Codeforces Beta Round #73 (Div. 2 Only),2,Interesting Game,2500.0,E,1307458800,[],PROGRAMMING
-89,Codeforces Beta Round #74 (Div. 1 Only),1,Robbery,500.0,A,1308236400,[greedy],PROGRAMMING
-89,Codeforces Beta Round #74 (Div. 1 Only),1,Widget Library,1000.0,B,1308236400,"[dp, expression parsing, graphs, implementation]",PROGRAMMING
-89,Codeforces Beta Round #74 (Div. 1 Only),1,Chip Play,1000.0,C,1308236400,"[brute force, data structures, implementation]",PROGRAMMING
-89,Codeforces Beta Round #74 (Div. 1 Only),1,Space mines,1500.0,D,1308236400,[geometry],PROGRAMMING
-89,Codeforces Beta Round #74 (Div. 1 Only),1,Fire and Ice,2500.0,E,1308236400,[greedy],PROGRAMMING
-90,Codeforces Beta Round #74 (Div. 2 Only),2,Cableway,500.0,A,1308236400,"[greedy, math]",PROGRAMMING
-90,Codeforces Beta Round #74 (Div. 2 Only),2,African Crossword,1000.0,B,1308236400,"[implementation, strings]",PROGRAMMING
-90,Codeforces Beta Round #74 (Div. 2 Only),2,Robbery,1500.0,C,1308236400,"[greedy, math]",PROGRAMMING
-90,Codeforces Beta Round #74 (Div. 2 Only),2,Widget Library,2000.0,D,1308236400,[],PROGRAMMING
-90,Codeforces Beta Round #74 (Div. 2 Only),2,Chip Play,2000.0,E,1308236400,[],PROGRAMMING
-91,Codeforces Beta Round #75 (Div. 1 Only),1,Newspaper Headline,500.0,A,1308582000,"[greedy, strings]",PROGRAMMING
-91,Codeforces Beta Round #75 (Div. 1 Only),1,Queue,1000.0,B,1308582000,"[binary search, data structures]",PROGRAMMING
-91,Codeforces Beta Round #75 (Div. 1 Only),1,Ski Base,1500.0,C,1308582000,"[combinatorics, dsu, graphs]",PROGRAMMING
-91,Codeforces Beta Round #75 (Div. 1 Only),1,Grocer's Problem,2500.0,D,1308582000,"[constructive algorithms, graphs, greedy]",PROGRAMMING
-91,Codeforces Beta Round #75 (Div. 1 Only),1,Igloo Skyscraper,2500.0,E,1308582000,"[data structures, geometry]",PROGRAMMING
-92,Codeforces Beta Round #75 (Div. 2 Only),2,Chips,500.0,A,1308582000,"[implementation, math]",PROGRAMMING
-92,Codeforces Beta Round #75 (Div. 2 Only),2,Binary Number,1000.0,B,1308582000,[greedy],PROGRAMMING
-92,Codeforces Beta Round #75 (Div. 2 Only),2,Newspaper Headline,1500.0,C,1308582000,"[binary search, data structures, dp, greedy]",PROGRAMMING
-92,Codeforces Beta Round #75 (Div. 2 Only),2,Queue,2000.0,D,1308582000,"[binary search, data structures, dp]",PROGRAMMING
-92,Codeforces Beta Round #75 (Div. 2 Only),2,Ski Base,2500.0,E,1308582000,"[data structures, dsu, graphs]",PROGRAMMING
-93,Codeforces Beta Round #76 (Div. 1 Only),1,Frames,500.0,A,1309446000,[implementation],PROGRAMMING
-93,Codeforces Beta Round #76 (Div. 1 Only),1,End of Exams,1000.0,B,1309446000,[greedy],PROGRAMMING
-93,Codeforces Beta Round #76 (Div. 1 Only),1,Azembler,1500.0,C,1309446000,"[brute force, implementation]",PROGRAMMING
-93,Codeforces Beta Round #76 (Div. 1 Only),1,Flags,2000.0,D,1309446000,"[dp, math, matrices]",PROGRAMMING
-93,Codeforces Beta Round #76 (Div. 1 Only),1,Lostborn,2500.0,E,1309446000,"[dp, math]",PROGRAMMING
-94,Codeforces Beta Round #76 (Div. 2 Only),2,Restoring Password,500.0,A,1309446000,"[implementation, strings]",PROGRAMMING
-94,Codeforces Beta Round #76 (Div. 2 Only),2,Friends,1000.0,B,1309446000,"[implementation, math]",PROGRAMMING
-94,Codeforces Beta Round #76 (Div. 2 Only),2,Frames,1500.0,C,1309446000,[math],PROGRAMMING
-94,Codeforces Beta Round #76 (Div. 2 Only),2,End of Exams,2000.0,D,1309446000,"[greedy, math]",PROGRAMMING
-94,Codeforces Beta Round #76 (Div. 2 Only),2,Azembler,2500.0,E,1309446000,[brute force],PROGRAMMING
-95,Codeforces Beta Round #77 (Div. 1 Only),1,Hockey,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING
-95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Numbers,1000.0,B,1310137200,"[dp, greedy]",PROGRAMMING
-95,Codeforces Beta Round #77 (Div. 1 Only),1,Volleyball,1500.0,C,1310137200,[shortest paths],PROGRAMMING
-95,Codeforces Beta Round #77 (Div. 1 Only),1,Horse Races,2000.0,D,1310137200,"[dp, math]",PROGRAMMING
-95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Country,2500.0,E,1310137200,"[dp, dsu, graphs]",PROGRAMMING
-96,Codeforces Beta Round #77 (Div. 2 Only),2,Football,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING
-96,Codeforces Beta Round #77 (Div. 2 Only),2,Lucky Numbers (easy),1000.0,B,1310137200,"[binary search, bitmasks, brute force]",PROGRAMMING
-96,Codeforces Beta Round #77 (Div. 2 Only),2,Hockey,1500.0,C,1310137200,"[implementation, strings]",PROGRAMMING
-96,Codeforces Beta Round #77 (Div. 2 Only),2,Volleyball,2000.0,D,1310137200,"[graphs, shortest paths]",PROGRAMMING
-96,Codeforces Beta Round #77 (Div. 2 Only),2,Horse Races,2500.0,E,1310137200,[],PROGRAMMING
-97,Yandex.Algorithm 2011
Finals,12,Domino,500.0,A,1310731200,"[brute force, implementation]",PROGRAMMING
-97,Yandex.Algorithm 2011
Finals,12,Superset,1500.0,B,1310731200,"[constructive algorithms, divide and conquer]",PROGRAMMING
-97,Yandex.Algorithm 2011
Finals,12,Winning Strategy,2000.0,C,1310731200,"[binary search, graphs, math, shortest paths]",PROGRAMMING
-97,Yandex.Algorithm 2011
Finals,12,Robot in Basement,2000.0,D,1310731200,"[bitmasks, brute force, implementation]",PROGRAMMING
-97,Yandex.Algorithm 2011
Finals,12,Leaders,2500.0,E,1310731200,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
-101,Codeforces Beta Round #79 (Div. 1 Only),1,Homework,500.0,A,1312390800,[greedy],PROGRAMMING
-101,Codeforces Beta Round #79 (Div. 1 Only),1,Buses,1000.0,B,1312390800,"[binary search, data structures, dp]",PROGRAMMING
-101,Codeforces Beta Round #79 (Div. 1 Only),1,Vectors,1500.0,C,1312390800,"[implementation, math]",PROGRAMMING
-101,Codeforces Beta Round #79 (Div. 1 Only),1,Castle,2000.0,D,1312390800,"[dp, greedy, probabilities, sortings, trees]",PROGRAMMING
-101,Codeforces Beta Round #79 (Div. 1 Only),1,Candies and Stones,2500.0,E,1312390800,"[divide and conquer, dp]",PROGRAMMING
-102,Codeforces Beta Round #79 (Div. 2 Only),2,Clothes,500.0,A,1312390800,[brute force],PROGRAMMING
-102,Codeforces Beta Round #79 (Div. 2 Only),2,Sum of Digits,1000.0,B,1312390800,[implementation],PROGRAMMING
-102,Codeforces Beta Round #79 (Div. 2 Only),2,Homework,1500.0,C,1312390800,[greedy],PROGRAMMING
-102,Codeforces Beta Round #79 (Div. 2 Only),2,Buses,2000.0,D,1312390800,"[binary search, data structures, dp]",PROGRAMMING
-102,Codeforces Beta Round #79 (Div. 2 Only),2,Vectors,2500.0,E,1312390800,[],PROGRAMMING
-103,Codeforces Beta Round #80 (Div. 1 Only),1,Testing Pants for Sadness,500.0,A,1312714800,"[greedy, implementation, math]",PROGRAMMING
-103,Codeforces Beta Round #80 (Div. 1 Only),1,Cthulhu,1000.0,B,1312714800,"[dfs and similar, dsu, graphs]",PROGRAMMING
-103,Codeforces Beta Round #80 (Div. 1 Only),1,Russian Roulette,1500.0,C,1312714800,"[constructive algorithms, greedy]",PROGRAMMING
-103,Codeforces Beta Round #80 (Div. 1 Only),1,Time to Raid Cowavans,2000.0,D,1312714800,"[brute force, data structures, sortings]",PROGRAMMING
-103,Codeforces Beta Round #80 (Div. 1 Only),1,Buying Sets,2500.0,E,1312714800,"[flows, graph matchings]",PROGRAMMING
-104,Codeforces Beta Round #80 (Div. 2 Only),2,Blackjack,500.0,A,1312714800,[implementation],PROGRAMMING
-104,Codeforces Beta Round #80 (Div. 2 Only),2,Testing Pants for Sadness,1000.0,B,1312714800,[math],PROGRAMMING
-104,Codeforces Beta Round #80 (Div. 2 Only),2,Cthulhu,1500.0,C,1312714800,"[dsu, trees]",PROGRAMMING
-104,Codeforces Beta Round #80 (Div. 2 Only),2,Russian Roulette,2000.0,D,1312714800,[math],PROGRAMMING
-104,Codeforces Beta Round #80 (Div. 2 Only),2,Time to Raid Cowavans,2500.0,E,1312714800,[],PROGRAMMING
-105,Codeforces Beta Round #81,12,Transmigration,500.0,A,1313247600,[implementation],PROGRAMMING
-105,Codeforces Beta Round #81,12,Dark Assembly,1000.0,B,1313247600,"[brute force, probabilities]",PROGRAMMING
-105,Codeforces Beta Round #81,12,Item World,1500.0,C,1313247600,"[brute force, implementation, sortings]",PROGRAMMING
-105,Codeforces Beta Round #81,12,Entertaining Geodetics,2000.0,D,1313247600,"[brute force, dsu, implementation]",PROGRAMMING
-105,Codeforces Beta Round #81,12,Lift and Throw,2500.0,E,1313247600,[brute force],PROGRAMMING
-106,Codeforces Beta Round #82 (Div. 2),2,Card Game,500.0,A,1313766000,[implementation],PROGRAMMING
-106,Codeforces Beta Round #82 (Div. 2),2,Choosing Laptop,1000.0,B,1313766000,"[brute force, implementation]",PROGRAMMING
-106,Codeforces Beta Round #82 (Div. 2),2,Buns,1500.0,C,1313766000,"[chinese remainder theorem, geometry]",PROGRAMMING
-106,Codeforces Beta Round #82 (Div. 2),2,Treasure Island,2000.0,D,1313766000,"[brute force, implementation]",PROGRAMMING
-106,Codeforces Beta Round #82 (Div. 2),2,Space Rescuers,2500.0,E,1313766000,"[geometry, ternary search]",PROGRAMMING
-107,Codeforces Beta Round #83 (Div. 1 Only),1,Dorm Water Supply,500.0,A,1314111600,"[dfs and similar, graphs]",PROGRAMMING
-107,Codeforces Beta Round #83 (Div. 1 Only),1,Basketball Team,1000.0,B,1314111600,"[combinatorics, dp, probabilities]",PROGRAMMING
-107,Codeforces Beta Round #83 (Div. 1 Only),1,Arrangement,1500.0,C,1314111600,"[bitmasks, dp]",PROGRAMMING
-107,Codeforces Beta Round #83 (Div. 1 Only),1,Crime Management,2000.0,D,1314111600,"[dp, matrices]",PROGRAMMING
-107,Codeforces Beta Round #83 (Div. 1 Only),1,Darts,2500.0,E,1314111600,"[geometry, probabilities]",PROGRAMMING
-109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sum of Digits,500.0,A,1314633600,"[brute force, implementation]",PROGRAMMING
-109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Probability,1000.0,B,1314633600,"[brute force, probabilities]",PROGRAMMING
-109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Tree,1500.0,C,1314633600,"[dp, dsu, trees]",PROGRAMMING
-109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sorting,2000.0,D,1314633600,"[constructive algorithms, sortings]",PROGRAMMING
-109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Interval,2500.0,E,1314633600,"[brute force, math]",PROGRAMMING
-110,Codeforces Beta Round #84 (Div. 2 Only),2,Nearly Lucky Number,500.0,A,1314633600,[implementation],PROGRAMMING
-110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky String,1000.0,B,1314633600,"[constructive algorithms, strings]",PROGRAMMING
-110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Sum of Digits,1500.0,C,1314633600,"[implementation, math]",PROGRAMMING
-110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Probability,2000.0,D,1314633600,"[brute force, combinatorics, dfs and similar, probabilities]",PROGRAMMING
-110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Tree,2500.0,E,1314633600,"[combinatorics, dfs and similar, trees]",PROGRAMMING
-111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Inequiations,500.0,A,1315051200,[greedy],PROGRAMMING
-111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Divisors,1000.0,B,1315051200,"[binary search, data structures, number theory]",PROGRAMMING
-111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Spiders,1500.0,C,1315051200,"[bitmasks, dp, dsu]",PROGRAMMING
-111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Coloring,2000.0,D,1315051200,"[combinatorics, dp]",PROGRAMMING
-111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Rectangle,2500.0,E,1315051200,[],PROGRAMMING
-112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Strings,500.0,A,1315051200,"[implementation, strings]",PROGRAMMING
-112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Square,1000.0,B,1315051200,"[implementation, math]",PROGRAMMING
-112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Inequiations,1500.0,C,1315051200,"[greedy, math]",PROGRAMMING
-112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Divisors,2000.0,D,1315051200,"[implementation, number theory]",PROGRAMMING
-112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Spiders,2500.0,E,1315051200,"[bitmasks, dp]",PROGRAMMING
-113,Codeforces Beta Round #86 (Div. 1 Only),1,Grammar Lessons,500.0,A,1315494000,"[implementation, strings]",PROGRAMMING
-113,Codeforces Beta Round #86 (Div. 1 Only),1,Petr#,1000.0,B,1315494000,"[brute force, data structures, hashing, strings]",PROGRAMMING
-113,Codeforces Beta Round #86 (Div. 1 Only),1,Double Happiness,1500.0,C,1315494000,"[brute force, number theory]",PROGRAMMING
-113,Codeforces Beta Round #86 (Div. 1 Only),1,Museum,2000.0,D,1315494000,"[matrices, probabilities]",PROGRAMMING
-113,Codeforces Beta Round #86 (Div. 1 Only),1,Sleeping,2500.0,E,1315494000,"[combinatorics, implementation, math]",PROGRAMMING
-114,Codeforces Beta Round #86 (Div. 2 Only),2,Cifera,500.0,A,1315494000,[math],PROGRAMMING
-114,Codeforces Beta Round #86 (Div. 2 Only),2,PFAST Inc.,1000.0,B,1315494000,"[bitmasks, brute force]",PROGRAMMING
-114,Codeforces Beta Round #86 (Div. 2 Only),2,Grammar Lessons,1500.0,C,1315494000,[implementation],PROGRAMMING
-114,Codeforces Beta Round #86 (Div. 2 Only),2,Petr#,2000.0,D,1315494000,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
-114,Codeforces Beta Round #86 (Div. 2 Only),2,Double Happiness,2500.0,E,1315494000,[number theory],PROGRAMMING
-115,Codeforces Beta Round #87 (Div. 1 Only),1,Party,500.0,A,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING
-115,Codeforces Beta Round #87 (Div. 1 Only),1,Lawnmower,1000.0,B,1316098800,"[greedy, sortings]",PROGRAMMING
-115,Codeforces Beta Round #87 (Div. 1 Only),1,Plumber,1500.0,C,1316098800,[math],PROGRAMMING
-115,Codeforces Beta Round #87 (Div. 1 Only),1,Unambiguous Arithmetic Expression,2000.0,D,1316098800,"[dp, expression parsing]",PROGRAMMING
-115,Codeforces Beta Round #87 (Div. 1 Only),1,Linear Kingdom Races,2500.0,E,1316098800,"[data structures, dp]",PROGRAMMING
-116,Codeforces Beta Round #87 (Div. 2 Only),2,Tram,500.0,A,1316098800,[implementation],PROGRAMMING
-116,Codeforces Beta Round #87 (Div. 2 Only),2,Little Pigs and Wolves,1000.0,B,1316098800,"[greedy, implementation]",PROGRAMMING
-116,Codeforces Beta Round #87 (Div. 2 Only),2,Party,1500.0,C,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING
-116,Codeforces Beta Round #87 (Div. 2 Only),2,Lawnmower,2000.0,D,1316098800,"[dp, greedy]",PROGRAMMING
-116,Codeforces Beta Round #87 (Div. 2 Only),2,Plumber,2500.0,E,1316098800,[],PROGRAMMING
-117,Codeforces Beta Round #88,12,Elevator,500.0,A,1316790000,"[implementation, math]",PROGRAMMING
-117,Codeforces Beta Round #88,12,Very Interesting Game,1000.0,B,1316790000,"[brute force, number theory]",PROGRAMMING
-117,Codeforces Beta Round #88,12,Cycle,1500.0,C,1316790000,"[dfs and similar, graphs]",PROGRAMMING
-117,Codeforces Beta Round #88,12,Not Quick Transformation,2000.0,D,1316790000,"[divide and conquer, math]",PROGRAMMING
-117,Codeforces Beta Round #88,12,Tree or not Tree,2500.0,E,1316790000,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING
-118,Codeforces Beta Round #89 (Div. 2),2,String Task,500.0,A,1317999600,"[implementation, strings]",PROGRAMMING
-118,Codeforces Beta Round #89 (Div. 2),2,Present from Lena,1000.0,B,1317999600,"[constructive algorithms, implementation]",PROGRAMMING
-118,Codeforces Beta Round #89 (Div. 2),2,Fancy Number,1500.0,C,1317999600,"[brute force, greedy, sortings, strings]",PROGRAMMING
-118,Codeforces Beta Round #89 (Div. 2),2,Caesar's Legions,2000.0,D,1317999600,[dp],PROGRAMMING
-118,Codeforces Beta Round #89 (Div. 2),2,Bertown roads,2500.0,E,1317999600,"[dfs and similar, graphs]",PROGRAMMING
-121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Sum,500.0,A,1319727600,[implementation],PROGRAMMING
-121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Transformation,1000.0,B,1319727600,[strings],PROGRAMMING
-121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Permutation,1500.0,C,1319727600,"[brute force, combinatorics, number theory]",PROGRAMMING
-121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Segments,2000.0,D,1319727600,"[binary search, implementation, two pointers]",PROGRAMMING
-121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Array,2500.0,E,1319727600,[data structures],PROGRAMMING
-122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Division,500.0,A,1319727600,"[brute force, number theory]",PROGRAMMING
-122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Substring,1000.0,B,1319727600,"[brute force, implementation]",PROGRAMMING
-122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Sum,1500.0,C,1319727600,"[brute force, math]",PROGRAMMING
-122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Transformation,2000.0,D,1319727600,[brute force],PROGRAMMING
-122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Permutation,2500.0,E,1319727600,[],PROGRAMMING
-123,Codeforces Beta Round #92 (Div. 1 Only),1,Prime Permutation,1000.0,A,1320333000,"[implementation, number theory, strings]",PROGRAMMING
-123,Codeforces Beta Round #92 (Div. 1 Only),1,Squares,1000.0,B,1320333000,[math],PROGRAMMING
-123,Codeforces Beta Round #92 (Div. 1 Only),1,Brackets,1500.0,C,1320333000,"[combinatorics, dp, greedy]",PROGRAMMING
-123,Codeforces Beta Round #92 (Div. 1 Only),1,String,2000.0,D,1320333000,[string suffix structures],PROGRAMMING
-123,Codeforces Beta Round #92 (Div. 1 Only),1,Maze,2500.0,E,1320333000,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING
-124,Codeforces Beta Round #92 (Div. 2 Only),2,The number of positions,500.0,A,1320333000,[math],PROGRAMMING
-124,Codeforces Beta Round #92 (Div. 2 Only),2,Permutations,1000.0,B,1320333000,"[brute force, combinatorics, implementation]",PROGRAMMING
-124,Codeforces Beta Round #92 (Div. 2 Only),2,Prime Permutation,2000.0,C,1320333000,"[constructive algorithms, dfs and similar, dsu, greedy, number theory, sortings, strings]",PROGRAMMING
-124,Codeforces Beta Round #92 (Div. 2 Only),2,Squares,2000.0,D,1320333000,"[brute force, constructive algorithms, number theory]",PROGRAMMING
-124,Codeforces Beta Round #92 (Div. 2 Only),2,Brackets,2500.0,E,1320333000,[],PROGRAMMING
-126,Codeforces Beta Round #93 (Div. 1 Only),1,Hot Bath,500.0,A,1320858000,"[binary search, brute force, math]",PROGRAMMING
-126,Codeforces Beta Round #93 (Div. 1 Only),1,Password,1000.0,B,1320858000,"[binary search, dp, hashing, string suffix structures, strings]",PROGRAMMING
-126,Codeforces Beta Round #93 (Div. 1 Only),1,E-reader Display,1500.0,C,1320858000,"[constructive algorithms, greedy]",PROGRAMMING
-126,Codeforces Beta Round #93 (Div. 1 Only),1,Fibonacci Sums,2000.0,D,1320858000,"[dp, math]",PROGRAMMING
-126,Codeforces Beta Round #93 (Div. 1 Only),1,Pills,2500.0,E,1320858000,"[brute force, flows]",PROGRAMMING
-127,Codeforces Beta Round #93 (Div. 2 Only),2,Wasted Time,500.0,A,1320858000,[geometry],PROGRAMMING
-127,Codeforces Beta Round #93 (Div. 2 Only),2,Canvas Frames,1000.0,B,1320858000,[implementation],PROGRAMMING
-127,Codeforces Beta Round #93 (Div. 2 Only),2,Hot Bath,1500.0,C,1320858000,"[binary search, math]",PROGRAMMING
-127,Codeforces Beta Round #93 (Div. 2 Only),2,Password,2000.0,D,1320858000,"[hashing, strings]",PROGRAMMING
-127,Codeforces Beta Round #93 (Div. 2 Only),2,E-reader Display,2500.0,E,1320858000,[implementation],PROGRAMMING
-128,Codeforces Beta Round #94 (Div. 1 Only),1,Statues,1000.0,A,1321337400,[dfs and similar],PROGRAMMING
-128,Codeforces Beta Round #94 (Div. 1 Only),1,String,1500.0,B,1321337400,"[brute force, constructive algorithms, hashing, string suffix structures, strings]",PROGRAMMING
-128,Codeforces Beta Round #94 (Div. 1 Only),1,Games with Rectangle,1500.0,C,1321337400,"[combinatorics, dp]",PROGRAMMING
-128,Codeforces Beta Round #94 (Div. 1 Only),1,Numbers,2000.0,D,1321337400,[constructive algorithms],PROGRAMMING
-128,Codeforces Beta Round #94 (Div. 1 Only),1,Birthday,2500.0,E,1321337400,"[geometry, math]",PROGRAMMING
-129,Codeforces Beta Round #94 (Div. 2 Only),2,Cookies,500.0,A,1321337400,[implementation],PROGRAMMING
-129,Codeforces Beta Round #94 (Div. 2 Only),2,Students and Shoelaces,1000.0,B,1321337400,"[brute force, dfs and similar, graphs]",PROGRAMMING
-129,Codeforces Beta Round #94 (Div. 2 Only),2,Statues,2000.0,C,1321337400,"[dfs and similar, graphs, implementation]",PROGRAMMING
-129,Codeforces Beta Round #94 (Div. 2 Only),2,String,2500.0,D,1321337400,"[implementation, string suffix structures, strings]",PROGRAMMING
-129,Codeforces Beta Round #94 (Div. 2 Only),2,Games with Rectangle,2500.0,E,1321337400,"[combinatorics, dp]",PROGRAMMING
-131,Codeforces Beta Round #95 (Div. 2),2,cAPS lOCK,500.0,A,1322233200,"[implementation, strings]",PROGRAMMING
-131,Codeforces Beta Round #95 (Div. 2),2,Opposites Attract,1000.0,B,1322233200,"[implementation, math]",PROGRAMMING
-131,Codeforces Beta Round #95 (Div. 2),2,The World is a Theatre,1500.0,C,1322233200,"[combinatorics, math]",PROGRAMMING
-131,Codeforces Beta Round #95 (Div. 2),2,Subway,2000.0,D,1322233200,"[dfs and similar, graphs]",PROGRAMMING
-131,Codeforces Beta Round #95 (Div. 2),2,Yet Another Task with Queens,2500.0,E,1322233200,[sortings],PROGRAMMING
-131,Codeforces Beta Round #95 (Div. 2),2,Present to Mom,2500.0,F,1322233200,"[binary search, two pointers]",PROGRAMMING
-132,Codeforces Beta Round #96 (Div. 1),1,Turing Tape,500.0,A,1322924400,[implementation],PROGRAMMING
-132,Codeforces Beta Round #96 (Div. 1),1,Piet,1500.0,B,1322924400,[implementation],PROGRAMMING
-132,Codeforces Beta Round #96 (Div. 1),1,Logo Turtle,1500.0,C,1322924400,[dp],PROGRAMMING
-132,Codeforces Beta Round #96 (Div. 1),1,Constants in the language of Shakespeare,2000.0,D,1322924400,"[constructive algorithms, dp, greedy]",PROGRAMMING
-132,Codeforces Beta Round #96 (Div. 1),1,Bits of merry old England,2500.0,E,1322924400,[flows],PROGRAMMING
-133,Codeforces Beta Round #96 (Div. 2),2,HQ9+,500.0,A,1322924400,[implementation],PROGRAMMING
-133,Codeforces Beta Round #96 (Div. 2),2,Unary,1000.0,B,1322924400,[implementation],PROGRAMMING
-133,Codeforces Beta Round #96 (Div. 2),2,Turing Tape,1500.0,C,1322924400,"[implementation, math]",PROGRAMMING
-133,Codeforces Beta Round #96 (Div. 2),2,Piet,2500.0,D,1322924400,[implementation],PROGRAMMING
-133,Codeforces Beta Round #96 (Div. 2),2,Logo Turtle,2500.0,E,1322924400,"[dp, implementation]",PROGRAMMING
-135,Codeforces Beta Round #97 (Div. 1),1,Replacement,500.0,A,1323443100,"[implementation, sortings]",PROGRAMMING
-135,Codeforces Beta Round #97 (Div. 1),1,Rectangle and Square,1000.0,B,1323443100,"[brute force, geometry, math]",PROGRAMMING
-135,Codeforces Beta Round #97 (Div. 1),1,Zero-One,1500.0,C,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING
-135,Codeforces Beta Round #97 (Div. 1),1,Cycle,2000.0,D,1323443100,"[brute force, dfs and similar, implementation]",PROGRAMMING
-135,Codeforces Beta Round #97 (Div. 1),1,Weak Subsequence,2500.0,E,1323443100,[combinatorics],PROGRAMMING
-136,Codeforces Beta Round #97 (Div. 2),2,Presents,500.0,A,1323443100,[implementation],PROGRAMMING
-136,Codeforces Beta Round #97 (Div. 2),2,Ternary Logic,1000.0,B,1323443100,"[implementation, math]",PROGRAMMING
-136,Codeforces Beta Round #97 (Div. 2),2,Replacement,1500.0,C,1323443100,"[implementation, sortings]",PROGRAMMING
-136,Codeforces Beta Round #97 (Div. 2),2,Rectangle and Square,2000.0,D,1323443100,"[geometry, implementation]",PROGRAMMING
-136,Codeforces Beta Round #97 (Div. 2),2,Zero-One,2500.0,E,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING
-137,Codeforces Beta Round #98 (Div. 2),2,Postcards and photos,500.0,A,1324015200,[implementation],PROGRAMMING
-137,Codeforces Beta Round #98 (Div. 2),2,Permutation,1000.0,B,1324015200,[greedy],PROGRAMMING
-137,Codeforces Beta Round #98 (Div. 2),2,History,1500.0,C,1324015200,[sortings],PROGRAMMING
-137,Codeforces Beta Round #98 (Div. 2),2,Palindromes,2000.0,D,1324015200,[dp],PROGRAMMING
-137,Codeforces Beta Round #98 (Div. 2),2,Last Chance,2500.0,E,1324015200,"[data structures, implementation]",PROGRAMMING
-138,Codeforces Beta Round #99 (Div. 1),1,Literature Lesson,500.0,A,1324728000,[implementation],PROGRAMMING
-138,Codeforces Beta Round #99 (Div. 1),1,Digits Permutations,1000.0,B,1324728000,[greedy],PROGRAMMING
-138,Codeforces Beta Round #99 (Div. 1),1,Mushroom Gnomes - 2,2000.0,C,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING
-138,Codeforces Beta Round #99 (Div. 1),1,World of Darkraft,2000.0,D,1324728000,"[dp, games]",PROGRAMMING
-138,Codeforces Beta Round #99 (Div. 1),1,Hellish Constraints,2500.0,E,1324728000,"[brute force, dp, two pointers]",PROGRAMMING
-139,Codeforces Beta Round #99 (Div. 2),2,Petr and Book,500.0,A,1324728000,[implementation],PROGRAMMING
-139,Codeforces Beta Round #99 (Div. 2),2,Wallpaper,1000.0,B,1324728000,"[implementation, math]",PROGRAMMING
-139,Codeforces Beta Round #99 (Div. 2),2,Literature Lesson,1500.0,C,1324728000,"[implementation, strings]",PROGRAMMING
-139,Codeforces Beta Round #99 (Div. 2),2,Digits Permutations,2000.0,D,1324728000,[implementation],PROGRAMMING
-139,Codeforces Beta Round #99 (Div. 2),2,Mushroom Gnomes - 2,3000.0,E,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING
-140,Codeforces Round #100,12,New Year Table,500.0,A,1325689200,"[geometry, math]",PROGRAMMING
-140,Codeforces Round #100,12,New Year Cards,1000.0,B,1325689200,"[brute force, greedy, implementation]",PROGRAMMING
-140,Codeforces Round #100,12,New Year Snowmen,1500.0,C,1325689200,"[binary search, data structures, greedy]",PROGRAMMING
-140,Codeforces Round #100,12,New Year Contest,2000.0,D,1325689200,"[greedy, sortings]",PROGRAMMING
-140,Codeforces Round #100,12,New Year Garland,2500.0,E,1325689200,"[combinatorics, dp]",PROGRAMMING
-140,Codeforces Round #100,12,New Year Snowflake,3000.0,F,1325689200,"[geometry, sortings]",PROGRAMMING
-141,Codeforces Round #101 (Div. 2),2,Amusing Joke,500.0,A,1326034800,"[implementation, sortings, strings]",PROGRAMMING
-141,Codeforces Round #101 (Div. 2),2,Hopscotch,1000.0,B,1326034800,"[geometry, math]",PROGRAMMING
-141,Codeforces Round #101 (Div. 2),2,Queue,2000.0,C,1326034800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
-141,Codeforces Round #101 (Div. 2),2,Take-off Ramps,2000.0,D,1326034800,"[graphs, shortest paths]",PROGRAMMING
-141,Codeforces Round #101 (Div. 2),2,Clearing Up,2500.0,E,1326034800,"[constructive algorithms, dp, dsu, graphs]",PROGRAMMING
-142,Codeforces Round #102 (Div. 1),1,Help Farmer,500.0,A,1326380700,"[brute force, math]",PROGRAMMING
-142,Codeforces Round #102 (Div. 1),1,Help General,1000.0,B,1326380700,"[constructive algorithms, greedy, implementation]",PROGRAMMING
-142,Codeforces Round #102 (Div. 1),1,Help Caretaker,1500.0,C,1326380700,"[brute force, dp]",PROGRAMMING
-142,Codeforces Round #102 (Div. 1),1,Help Shrek and Donkey 2,2000.0,D,1326380700,[games],PROGRAMMING
-142,Codeforces Round #102 (Div. 1),1,Help Greg the Dwarf 2,2500.0,E,1326380700,[geometry],PROGRAMMING
-143,Codeforces Round #102 (Div. 2),2,Help Vasilisa the Wise 2,500.0,A,1326380700,"[brute force, math]",PROGRAMMING
-143,Codeforces Round #102 (Div. 2),2,Help Kingdom of Far Far Away 2,1000.0,B,1326380700,"[implementation, strings]",PROGRAMMING
-143,Codeforces Round #102 (Div. 2),2,Help Farmer,1500.0,C,1326380700,"[implementation, math]",PROGRAMMING
-143,Codeforces Round #102 (Div. 2),2,Help General,2000.0,D,1326380700,"[graph matchings, greedy, math]",PROGRAMMING
-143,Codeforces Round #102 (Div. 2),2,Help Caretaker,2500.0,E,1326380700,[],PROGRAMMING
-144,Codeforces Round #103 (Div. 2),2,Arrival of the General,500.0,A,1326899100,[implementation],PROGRAMMING
-144,Codeforces Round #103 (Div. 2),2,Meeting,1000.0,B,1326899100,[implementation],PROGRAMMING
-144,Codeforces Round #103 (Div. 2),2,Anagram Search,1500.0,C,1326899100,"[implementation, strings]",PROGRAMMING
-144,Codeforces Round #103 (Div. 2),2,Missile Silos,2000.0,D,1326899100,"[data structures, dfs and similar, graphs, shortest paths]",PROGRAMMING
-144,Codeforces Round #103 (Div. 2),2,Competition,2500.0,E,1326899100,"[data structures, greedy]",PROGRAMMING
-145,Codeforces Round #104 (Div. 1),1,Lucky Conversion,500.0,A,1327215600,"[greedy, implementation]",PROGRAMMING
-145,Codeforces Round #104 (Div. 1),1,Lucky Number 2,1000.0,B,1327215600,[constructive algorithms],PROGRAMMING
-145,Codeforces Round #104 (Div. 1),1,Lucky Subsequence,1500.0,C,1327215600,"[combinatorics, dp, math]",PROGRAMMING
-145,Codeforces Round #104 (Div. 1),1,Lucky Pair,2500.0,D,1327215600,"[combinatorics, data structures, implementation]",PROGRAMMING
-145,Codeforces Round #104 (Div. 1),1,Lucky Queries,2500.0,E,1327215600,[data structures],PROGRAMMING
-146,Codeforces Round #104 (Div. 2),2,Lucky Ticket,500.0,A,1327215600,[implementation],PROGRAMMING
-146,Codeforces Round #104 (Div. 2),2,Lucky Mask,1000.0,B,1327215600,"[brute force, implementation]",PROGRAMMING
-146,Codeforces Round #104 (Div. 2),2,Lucky Conversion,1500.0,C,1327215600,[greedy],PROGRAMMING
-146,Codeforces Round #104 (Div. 2),2,Lucky Number 2,2000.0,D,1327215600,"[brute force, constructive algorithms, implementation]",PROGRAMMING
-146,Codeforces Round #104 (Div. 2),2,Lucky Subsequence,2500.0,E,1327215600,"[combinatorics, dp]",PROGRAMMING
-148,Codeforces Round #105 (Div. 2),2,Insomnia cure,1000.0,A,1328198400,"[constructive algorithms, implementation, math]",PROGRAMMING
-148,Codeforces Round #105 (Div. 2),2,Escape,1000.0,B,1328198400,"[implementation, math]",PROGRAMMING
-148,Codeforces Round #105 (Div. 2),2,Terse princess,1000.0,C,1328198400,"[constructive algorithms, greedy]",PROGRAMMING
-148,Codeforces Round #105 (Div. 2),2,Bag of mice,1000.0,D,1328198400,"[dp, games, math, probabilities]",PROGRAMMING
-148,Codeforces Round #105 (Div. 2),2,Porcelain,1000.0,E,1328198400,[dp],PROGRAMMING
-149,Codeforces Round #106 (Div. 2),2,Business trip,500.0,A,1328886000,"[greedy, implementation, sortings]",PROGRAMMING
-149,Codeforces Round #106 (Div. 2),2,Martian Clock,1000.0,B,1328886000,[implementation],PROGRAMMING
-149,Codeforces Round #106 (Div. 2),2,Division into Teams,1500.0,C,1328886000,"[greedy, math, sortings]",PROGRAMMING
-149,Codeforces Round #106 (Div. 2),2,Coloring Brackets,2500.0,D,1328886000,[dp],PROGRAMMING
-149,Codeforces Round #106 (Div. 2),2,Martian Strings,2500.0,E,1328886000,"[string suffix structures, strings]",PROGRAMMING
-150,Codeforces Round #107 (Div. 1),1,Win or Freeze,500.0,A,1329490800,"[games, number theory]",PROGRAMMING
-150,Codeforces Round #107 (Div. 1),1,Quantity of Strings,500.0,B,1329490800,"[combinatorics, dfs and similar, math]",PROGRAMMING
-150,Codeforces Round #107 (Div. 1),1,Smart Cheater,1000.0,C,1329490800,"[data structures, math, probabilities]",PROGRAMMING
-150,Codeforces Round #107 (Div. 1),1,Mission Impassable,1500.0,D,1329490800,[dp],PROGRAMMING
-150,Codeforces Round #107 (Div. 1),1,Freezing with Style,3000.0,E,1329490800,"[binary search, data structures, divide and conquer, trees]",PROGRAMMING
-151,Codeforces Round #107 (Div. 2),2,Soft Drinking,500.0,A,1329490800,[implementation],PROGRAMMING
-151,Codeforces Round #107 (Div. 2),2,Phone Numbers,1000.0,B,1329490800,"[implementation, strings]",PROGRAMMING
-151,Codeforces Round #107 (Div. 2),2,Win or Freeze,1500.0,C,1329490800,"[games, greedy, number theory]",PROGRAMMING
-151,Codeforces Round #107 (Div. 2),2,Quantity of Strings,1500.0,D,1329490800,"[combinatorics, dsu]",PROGRAMMING
-151,Codeforces Round #107 (Div. 2),2,Smart Cheater,3000.0,E,1329490800,[],PROGRAMMING
-152,Codeforces Round #108 (Div. 2),2,Marks,500.0,A,1329750000,[implementation],PROGRAMMING
-152,Codeforces Round #108 (Div. 2),2,Steps,1000.0,B,1329750000,"[binary search, implementation]",PROGRAMMING
-152,Codeforces Round #108 (Div. 2),2,Pocket Book,1500.0,C,1329750000,[combinatorics],PROGRAMMING
-152,Codeforces Round #108 (Div. 2),2,Frames,2500.0,D,1329750000,[brute force],PROGRAMMING
-152,Codeforces Round #108 (Div. 2),2,Garden,2500.0,E,1329750000,"[bitmasks, dp, graphs, trees]",PROGRAMMING
-154,Codeforces Round #109 (Div. 1),1,Hometask,500.0,A,1330095600,[greedy],PROGRAMMING
-154,Codeforces Round #109 (Div. 1),1,Colliders,1000.0,B,1330095600,"[math, number theory]",PROGRAMMING
-154,Codeforces Round #109 (Div. 1),1,Double Profiles,1500.0,C,1330095600,"[graphs, hashing, sortings]",PROGRAMMING
-154,Codeforces Round #109 (Div. 1),1,Flatland Fencing,2000.0,D,1330095600,"[games, math]",PROGRAMMING
-154,Codeforces Round #109 (Div. 1),1,Martian Colony,2500.0,E,1330095600,[geometry],PROGRAMMING
-155,Codeforces Round #109 (Div. 2),2,I_love_\%username\%,500.0,A,1330095600,[brute force],PROGRAMMING
-155,Codeforces Round #109 (Div. 2),2,Combination,1000.0,B,1330095600,"[greedy, sortings]",PROGRAMMING
-155,Codeforces Round #109 (Div. 2),2,Hometask,1500.0,C,1330095600,"[dp, greedy]",PROGRAMMING
-155,Codeforces Round #109 (Div. 2),2,Colliders,2000.0,D,1330095600,"[math, number theory]",PROGRAMMING
-155,Codeforces Round #109 (Div. 2),2,Double Profiles,2500.0,E,1330095600,"[hashing, sortings]",PROGRAMMING
-156,Codeforces Round #110 (Div. 1),1,Message,500.0,A,1330536600,[brute force],PROGRAMMING
-156,Codeforces Round #110 (Div. 1),1,Suspects,1000.0,B,1330536600,"[constructive algorithms, data structures, implementation]",PROGRAMMING
-156,Codeforces Round #110 (Div. 1),1,Cipher,1500.0,C,1330536600,"[combinatorics, dp]",PROGRAMMING
-156,Codeforces Round #110 (Div. 1),1,Clues,2500.0,D,1330536600,"[combinatorics, graphs]",PROGRAMMING
-156,Codeforces Round #110 (Div. 1),1,Mrs. Hudson's Pancakes,2500.0,E,1330536600,"[brute force, dp]",PROGRAMMING
-157,Codeforces Round #110 (Div. 2),2,Game Outcome,500.0,A,1330536600,[brute force],PROGRAMMING
-157,Codeforces Round #110 (Div. 2),2,Trace,1000.0,B,1330536600,"[geometry, sortings]",PROGRAMMING
-157,Codeforces Round #110 (Div. 2),2,Message,1500.0,C,1330536600,"[brute force, dp, strings]",PROGRAMMING
-157,Codeforces Round #110 (Div. 2),2,Suspects,2000.0,D,1330536600,[implementation],PROGRAMMING
-157,Codeforces Round #110 (Div. 2),2,Cipher,2500.0,E,1330536600,"[dp, math]",PROGRAMMING
-160,Codeforces Round #111 (Div. 2),2,Twins,500.0,A,1331046000,"[greedy, sortings]",PROGRAMMING
-160,Codeforces Round #111 (Div. 2),2,Unlucky Ticket,1000.0,B,1331046000,"[greedy, sortings]",PROGRAMMING
-160,Codeforces Round #111 (Div. 2),2,Find Pair,1500.0,C,1331046000,"[implementation, math, sortings]",PROGRAMMING
-160,Codeforces Round #111 (Div. 2),2,Edges in MST,2000.0,D,1331046000,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING
-160,Codeforces Round #111 (Div. 2),2,Buses and People,2500.0,E,1331046000,"[binary search, data structures, sortings]",PROGRAMMING
-161,VK Cup 2012 Round 1,12,Dress'em in Vests!,1000.0,A,1331478300,"[binary search, brute force, greedy, two pointers]",PROGRAMMING
-161,VK Cup 2012 Round 1,12,Discounts,1000.0,B,1331478300,"[constructive algorithms, greedy, sortings]",PROGRAMMING
-161,VK Cup 2012 Round 1,12,Abracadabra,2000.0,C,1331478300,[divide and conquer],PROGRAMMING
-161,VK Cup 2012 Round 1,12,Distance in Tree,2000.0,D,1331478300,"[dfs and similar, dp, trees]",PROGRAMMING
-161,VK Cup 2012 Round 1,12,Polycarpus the Safecracker,2500.0,E,1331478300,"[brute force, dp]",PROGRAMMING
-163,VK Cup 2012 Round 2,12,Substring and Subsequence,1000.0,A,1332687900,[dp],PROGRAMMING
-163,VK Cup 2012 Round 2,12,Lemmings,1000.0,B,1332687900,[binary search],PROGRAMMING
-163,VK Cup 2012 Round 2,12,Conveyor,1500.0,C,1332687900,[sortings],PROGRAMMING
-163,VK Cup 2012 Round 2,12,Large Refrigerator,2000.0,D,1332687900,[brute force],PROGRAMMING
-163,VK Cup 2012 Round 2,12,e-Government,2500.0,E,1332687900,"[data structures, dfs and similar, dp, strings, trees]",PROGRAMMING
-164,VK Cup 2012 Round 3,12,"Variable, or There and Back Again",500.0,A,1333897500,"[dfs and similar, graphs]",PROGRAMMING
-164,VK Cup 2012 Round 3,12,Ancient Berland Hieroglyphs,1000.0,B,1333897500,[two pointers],PROGRAMMING
-164,VK Cup 2012 Round 3,12,Machine Programming,1500.0,C,1333897500,[flows],PROGRAMMING
-164,VK Cup 2012 Round 3,12,Minimum Diameter,2500.0,D,1333897500,"[binary search, brute force]",PROGRAMMING
-164,VK Cup 2012 Round 3,12,Polycarpus and Tasks,2500.0,E,1333897500,[],PROGRAMMING
-165,Codeforces Round #112 (Div. 2),2,Supercentral Point,500.0,A,1331911800,[implementation],PROGRAMMING
-165,Codeforces Round #112 (Div. 2),2,Burning Midnight Oil,1000.0,B,1331911800,"[binary search, implementation]",PROGRAMMING
-165,Codeforces Round #112 (Div. 2),2,Another Problem on Strings,1500.0,C,1331911800,"[binary search, brute force, dp, math, strings, two pointers]",PROGRAMMING
-165,Codeforces Round #112 (Div. 2),2,Beard Graph,2000.0,D,1331911800,"[data structures, dsu, trees]",PROGRAMMING
-165,Codeforces Round #112 (Div. 2),2,Compatible Numbers,2500.0,E,1331911800,"[bitmasks, brute force, dfs and similar, dp]",PROGRAMMING
-166,Codeforces Round #113 (Div. 2),2,Rank List,500.0,A,1332516600,"[binary search, implementation, sortings]",PROGRAMMING
-166,Codeforces Round #113 (Div. 2),2,Polygons,3000.0,B,1332516600,"[geometry, sortings]",PROGRAMMING
-166,Codeforces Round #113 (Div. 2),2,Median,1000.0,C,1332516600,"[greedy, math, sortings]",PROGRAMMING
-166,Codeforces Round #113 (Div. 2),2,Shoe Store,3000.0,D,1332516600,"[dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING
-166,Codeforces Round #113 (Div. 2),2,Tetrahedron,1000.0,E,1332516600,"[dp, math, matrices]",PROGRAMMING
-167,Codeforces Round #114 (Div. 1),1,Wizards and Trolleybuses,500.0,A,1332860400,[implementation],PROGRAMMING
-167,Codeforces Round #114 (Div. 1),1,Wizards and Huge Prize,1000.0,B,1332860400,"[dp, probabilities]",PROGRAMMING
-167,Codeforces Round #114 (Div. 1),1,Wizards and Numbers,1500.0,C,1332860400,"[games, math]",PROGRAMMING
-167,Codeforces Round #114 (Div. 1),1,Wizards and Roads,2000.0,D,1332860400,"[data structures, divide and conquer, graph matchings]",PROGRAMMING
-167,Codeforces Round #114 (Div. 1),1,Wizards and Bets,2500.0,E,1332860400,"[math, matrices]",PROGRAMMING
-168,Codeforces Round #114 (Div. 2),2,Wizards and Demonstration,500.0,A,1332860400,[implementation],PROGRAMMING
-168,Codeforces Round #114 (Div. 2),2,Wizards and Minimal Spell,1000.0,B,1332860400,"[implementation, strings]",PROGRAMMING
-168,Codeforces Round #114 (Div. 2),2,Wizards and Trolleybuses,1500.0,C,1332860400,"[implementation, math]",PROGRAMMING
-168,Codeforces Round #114 (Div. 2),2,Wizards and Huge Prize,2000.0,D,1332860400,"[dp, probabilities]",PROGRAMMING
-168,Codeforces Round #114 (Div. 2),2,Wizards and Numbers,2500.0,E,1332860400,[],PROGRAMMING
-169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Chores,500.0,A,1332687900,[sortings],PROGRAMMING
-169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Replacing Digits,1000.0,B,1332687900,[greedy],PROGRAMMING
-169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Substring and Subsequence,1500.0,C,1332687900,[dp],PROGRAMMING
-169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Lemmings,2000.0,D,1332687900,[],PROGRAMMING
-169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Conveyor,2500.0,E,1332687900,[],PROGRAMMING
-173,Croc Champ 2012 - Round 1,12,Rock-Paper-Scissors,500.0,A,1333724400,"[implementation, math]",PROGRAMMING
-173,Croc Champ 2012 - Round 1,12,Chamber of Secrets,1000.0,B,1333724400,"[dfs and similar, shortest paths]",PROGRAMMING
-173,Croc Champ 2012 - Round 1,12,Spiral Maximum,1500.0,C,1333724400,"[brute force, dp]",PROGRAMMING
-173,Croc Champ 2012 - Round 1,12,Deputies,2000.0,D,1333724400,"[constructive algorithms, graphs, greedy, implementation]",PROGRAMMING
-173,Croc Champ 2012 - Round 1,12,Camping Groups,2500.0,E,1333724400,"[data structures, sortings]",PROGRAMMING
-174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Problem About Equation,500.0,A,1333897500,[math],PROGRAMMING
-174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,File List,1000.0,B,1333897500,"[dp, greedy, implementation]",PROGRAMMING
-174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Range Increments,1500.0,C,1333897500,"[data structures, greedy]",PROGRAMMING
-174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,"Variable, or There and Back Again",2500.0,D,1333897500,[graphs],PROGRAMMING
-174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Ancient Berland Hieroglyphs,3000.0,E,1333897500,[],PROGRAMMING
-175,Codeforces Round #115,12,Robot Bicorn Attack,500.0,A,1334390400,"[brute force, implementation]",PROGRAMMING
-175,Codeforces Round #115,12,Plane of Tanks: Pro,500.0,B,1334390400,[implementation],PROGRAMMING
-175,Codeforces Round #115,12,Geometry Horse,1000.0,C,1334390400,"[greedy, implementation, sortings]",PROGRAMMING
-175,Codeforces Round #115,12,Plane of Tanks: Duel,2500.0,D,1334390400,"[brute force, dp, probabilities]",PROGRAMMING
-175,Codeforces Round #115,12,Power Defence,3000.0,E,1334390400,"[brute force, dp, greedy]",PROGRAMMING
-175,Codeforces Round #115,12,Gnomes of Might and Magic,3000.0,F,1334390400,"[data structures, graphs, implementation, shortest paths]",PROGRAMMING
-176,Croc Champ 2012 - Round 2,12,Trading Business,500.0,A,1334934300,"[greedy, sortings]",PROGRAMMING
-176,Croc Champ 2012 - Round 2,12,Word Cut,1000.0,B,1334934300,[dp],PROGRAMMING
-176,Croc Champ 2012 - Round 2,12,Playing with Superglue,1500.0,C,1334934300,"[combinatorics, constructive algorithms]",PROGRAMMING
-176,Croc Champ 2012 - Round 2,12,Hyper String,2000.0,D,1334934300,[dp],PROGRAMMING
-176,Croc Champ 2012 - Round 2,12,Archaeology,2500.0,E,1334934300,"[data structures, dfs and similar, trees]",PROGRAMMING
-177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,30.0,A1,1335016800,[implementation],PROGRAMMING
-177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,70.0,A2,1335016800,[implementation],PROGRAMMING
-177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,30.0,B1,1335016800,[number theory],PROGRAMMING
-177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,70.0,B2,1335016800,[number theory],PROGRAMMING
-177,ABBYY Cup 2.0 - Easy,12,Party,30.0,C1,1335016800,"[dfs and similar, dsu, graphs]",PROGRAMMING
-177,ABBYY Cup 2.0 - Easy,12,Party,70.0,C2,1335016800,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING
-177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,30.0,D1,1335016800,[brute force],PROGRAMMING
-177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,70.0,D2,1335016800,[data structures],PROGRAMMING
-177,ABBYY Cup 2.0 - Easy,12,Space Voyage,30.0,E1,1335016800,[binary search],PROGRAMMING
-177,ABBYY Cup 2.0 - Easy,12,Space Voyage,70.0,E2,1335016800,[binary search],PROGRAMMING
-177,ABBYY Cup 2.0 - Easy,12,Script Generation,30.0,F1,1335016800,[],PROGRAMMING
-177,ABBYY Cup 2.0 - Easy,12,Script Generation,70.0,F2,1335016800,[],PROGRAMMING
-177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,30.0,G1,1335016800,[strings],PROGRAMMING
-177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,70.0,G2,1335016800,"[matrices, strings]",PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Educational Game,20.0,A1,1335614400,[],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Educational Game,30.0,A2,1335614400,[greedy],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Educational Game,50.0,A3,1335614400,[greedy],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,20.0,B1,1335614400,[],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,30.0,B2,1335614400,[],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,50.0,B3,1335614400,[],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,20.0,C1,1335614400,[],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,30.0,C2,1335614400,[],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,50.0,C3,1335614400,[],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Magic Squares,20.0,D1,1335614400,[],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Magic Squares,30.0,D2,1335614400,[],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Magic Squares,50.0,D3,1335614400,[],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,20.0,E1,1335614400,[],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,30.0,E2,1335614400,[],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,50.0,E3,1335614400,[],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,20.0,F1,1335614400,[],PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,30.0,F2,1335614400,"[dp, sortings, strings]",PROGRAMMING
-178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,50.0,F3,1335614400,[],PROGRAMMING
-180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Defragmentation,,A,1335078000,[implementation],PROGRAMMING
-180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Divisibility Rules,,B,1335078000,"[math, number theory]",PROGRAMMING
-180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Letter,,C,1335078000,[dp],PROGRAMMING
-180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Name,,D,1335078000,"[greedy, strings]",PROGRAMMING
-180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Cubes,,E,1335078000,"[binary search, dp, two pointers]",PROGRAMMING
-180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Mathematical Analysis Rocks!,,F,1335078000,"[constructive algorithms, implementation, math]",PROGRAMMING
-181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Series of Crimes,500.0,A,1334934300,"[brute force, geometry, implementation]",PROGRAMMING
-181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Number of Triplets,1000.0,B,1334934300,"[binary search, brute force]",PROGRAMMING
-181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Trading Business,1500.0,C,1334934300,"[games, graph matchings, greedy]",PROGRAMMING
-181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Word Cut,2000.0,D,1334934300,[dp],PROGRAMMING
-181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Playing with Superglue,2500.0,E,1334934300,[games],PROGRAMMING
-186,Codeforces Round #118 (Div. 2),2,Comparing Strings,500.0,A,1336145400,"[implementation, strings]",PROGRAMMING
-186,Codeforces Round #118 (Div. 2),2,Growing Mushrooms,1000.0,B,1336145400,"[greedy, sortings]",PROGRAMMING
-186,Codeforces Round #118 (Div. 2),2,Plant,1500.0,C,1336145400,"[dp, math, matrices, number theory]",PROGRAMMING
-186,Codeforces Round #118 (Div. 2),2,Mushroom Scientists,2000.0,D,1336145400,"[math, number theory, probabilities]",PROGRAMMING
-186,Codeforces Round #118 (Div. 2),2,Clever Fat Rat,2500.0,E,1336145400,[],PROGRAMMING
-187,Codeforces Round #119 (Div. 1),1,Permutations,500.0,A,1336663800,[greedy],PROGRAMMING
-187,Codeforces Round #119 (Div. 1),1,AlgoRace,1000.0,B,1336663800,"[dp, shortest paths]",PROGRAMMING
-187,Codeforces Round #119 (Div. 1),1,Weak Memory,1500.0,C,1336663800,"[dfs and similar, dsu]",PROGRAMMING
-187,Codeforces Round #119 (Div. 1),1,BRT Contract ,2000.0,D,1336663800,[data structures],PROGRAMMING
-187,Codeforces Round #119 (Div. 1),1,Heaven Tour,2500.0,E,1336663800,"[data structures, greedy]",PROGRAMMING
-189,Codeforces Round #119 (Div. 2),2,Cut Ribbon,500.0,A,1336663800,"[brute force, dp]",PROGRAMMING
-189,Codeforces Round #119 (Div. 2),2,Counting Rhombi,1000.0,B,1336663800,"[brute force, math]",PROGRAMMING
-189,Codeforces Round #119 (Div. 2),2,Permutations,1500.0,C,1336663800,"[greedy, implementation]",PROGRAMMING
-189,Codeforces Round #119 (Div. 2),2,AlgoRace,2000.0,D,1336663800,"[dp, shortest paths]",PROGRAMMING
-189,Codeforces Round #119 (Div. 2),2,Weak Memory,2500.0,E,1336663800,"[binary search, shortest paths]",PROGRAMMING
-191,Codeforces Round #121 (Div. 1),1,Dynasty Puzzles,500.0,A,1338132600,[dp],PROGRAMMING
-191,Codeforces Round #121 (Div. 1),1,Demonstration,1000.0,B,1338132600,[greedy],PROGRAMMING
-191,Codeforces Round #121 (Div. 1),1,Fools and Roads,1500.0,C,1338132600,"[data structures, dfs and similar, trees]",PROGRAMMING
-191,Codeforces Round #121 (Div. 1),1,Metro Scheme,2000.0,D,1338132600,"[graphs, greedy]",PROGRAMMING
-191,Codeforces Round #121 (Div. 1),1,Thwarting Demonstrations,2500.0,E,1338132600,"[binary search, data structures, trees]",PROGRAMMING
-192,Codeforces Round #121 (Div. 2),2,Funky Numbers,500.0,A,1338132600,"[binary search, brute force, implementation]",PROGRAMMING
-192,Codeforces Round #121 (Div. 2),2,Walking in the Rain,1000.0,B,1338132600,"[brute force, implementation]",PROGRAMMING
-192,Codeforces Round #121 (Div. 2),2,Dynasty Puzzles,1500.0,C,1338132600,[dp],PROGRAMMING
-192,Codeforces Round #121 (Div. 2),2,Demonstration,2000.0,D,1338132600,"[brute force, constructive algorithms]",PROGRAMMING
-192,Codeforces Round #121 (Div. 2),2,Fools and Roads,2500.0,E,1338132600,"[data structures, trees]",PROGRAMMING
-193,Codeforces Round #122 (Div. 1),1,Cutting Figure,500.0,A,1338737400,"[2-sat, chinese remainder theorem, trees]",PROGRAMMING
-193,Codeforces Round #122 (Div. 1),1,Xor,1000.0,B,1338737400,[brute force],PROGRAMMING
-193,Codeforces Round #122 (Div. 1),1,Hamming Distance,2000.0,C,1338737400,"[constructive algorithms, greedy, math, matrices]",PROGRAMMING
-193,Codeforces Round #122 (Div. 1),1,Two Segments,2000.0,D,1338737400,[data structures],PROGRAMMING
-193,Codeforces Round #122 (Div. 1),1,Fibonacci Number,2500.0,E,1338737400,"[brute force, math, matrices]",PROGRAMMING
-194,Codeforces Round #122 (Div. 2),2,Exams,500.0,A,1338737400,"[implementation, math]",PROGRAMMING
-194,Codeforces Round #122 (Div. 2),2,Square,1000.0,B,1338737400,[math],PROGRAMMING
-194,Codeforces Round #122 (Div. 2),2,Cutting Figure,1500.0,C,1338737400,"[dfs and similar, graphs, implementation, matrices, strings]",PROGRAMMING
-194,Codeforces Round #122 (Div. 2),2,Xor,2000.0,D,1338737400,[],PROGRAMMING
-194,Codeforces Round #122 (Div. 2),2,Hamming Distance,3000.0,E,1338737400,[math],PROGRAMMING
-195,Codeforces Round #123 (Div. 2),2,Let's Watch Football,500.0,A,1339342200,"[binary search, brute force, math]",PROGRAMMING
-195,Codeforces Round #123 (Div. 2),2,After Training,1000.0,B,1339342200,"[data structures, implementation, math]",PROGRAMMING
-195,Codeforces Round #123 (Div. 2),2,Try and Catch,1500.0,C,1339342200,"[expression parsing, implementation]",PROGRAMMING
-195,Codeforces Round #123 (Div. 2),2,Analyzing Polyline,2000.0,D,1339342200,"[math, sortings]",PROGRAMMING
-195,Codeforces Round #123 (Div. 2),2,Building Forest,2500.0,E,1339342200,"[data structures, dsu]",PROGRAMMING
-196,Codeforces Round #124 (Div. 1),1,Lexicographically Maximum Subsequence,500.0,A,1339506000,[greedy],PROGRAMMING
-196,Codeforces Round #124 (Div. 1),1,Infinite Maze,1000.0,B,1339506000,[dfs and similar],PROGRAMMING
-196,Codeforces Round #124 (Div. 1),1,Paint Tree,1500.0,C,1339506000,"[divide and conquer, geometry, sortings, trees]",PROGRAMMING
-196,Codeforces Round #124 (Div. 1),1,The Next Good String,3000.0,D,1339506000,"[data structures, greedy, hashing, strings]",PROGRAMMING
-196,Codeforces Round #124 (Div. 1),1,Opening Portals,2500.0,E,1339506000,"[dsu, graphs, shortest paths]",PROGRAMMING
-197,Codeforces Round #124 (Div. 2),2,Plate Game,1000.0,A,1339506000,"[constructive algorithms, games, math]",PROGRAMMING
-197,Codeforces Round #124 (Div. 2),2,Limit,500.0,B,1339506000,[math],PROGRAMMING
-197,Codeforces Round #124 (Div. 2),2,Lexicographically Maximum Subsequence,500.0,C,1339506000,"[greedy, implementation, sortings]",PROGRAMMING
-197,Codeforces Round #124 (Div. 2),2,Infinite Maze,3000.0,D,1339506000,[hashing],PROGRAMMING
-197,Codeforces Round #124 (Div. 2),2,Paint Tree,3000.0,E,1339506000,"[constructive algorithms, dfs and similar, geometry]",PROGRAMMING
-198,Codeforces Round #125 (Div. 1),1,About Bacteria,500.0,A,1340379000,"[implementation, math]",PROGRAMMING
-198,Codeforces Round #125 (Div. 1),1,Jumping on Walls,1000.0,B,1340379000,[shortest paths],PROGRAMMING
-198,Codeforces Round #125 (Div. 1),1,Delivering Carcinogen,1500.0,C,1340379000,"[binary search, geometry]",PROGRAMMING
-198,Codeforces Round #125 (Div. 1),1,Cube Snake,2000.0,D,1340379000,[constructive algorithms],PROGRAMMING
-198,Codeforces Round #125 (Div. 1),1,Gripping Story,2500.0,E,1340379000,"[binary search, data structures, sortings]",PROGRAMMING
-199,Codeforces Round #125 (Div. 2),2,Hexadecimal's theorem,500.0,A,1340379000,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING
-199,Codeforces Round #125 (Div. 2),2,Special Olympics,1000.0,B,1340379000,[geometry],PROGRAMMING
-199,Codeforces Round #125 (Div. 2),2,About Bacteria,1500.0,C,1340379000,[math],PROGRAMMING
-199,Codeforces Round #125 (Div. 2),2,Jumping on Walls,2000.0,D,1340379000,"[dfs and similar, shortest paths]",PROGRAMMING
-199,Codeforces Round #125 (Div. 2),2,Delivering Carcinogen,2500.0,E,1340379000,"[binary search, geometry]",PROGRAMMING
-200,Codeforces Round #126 (Div. 2),2,Cinema,3000.0,A,1340551800,"[brute force, data structures]",PROGRAMMING
-200,Codeforces Round #126 (Div. 2),2,Drinks,500.0,B,1340551800,"[implementation, math]",PROGRAMMING
-200,Codeforces Round #126 (Div. 2),2,Football Championship,2000.0,C,1340551800,"[brute force, implementation]",PROGRAMMING
-200,Codeforces Round #126 (Div. 2),2,Programming Language,1500.0,D,1340551800,"[binary search, brute force, expression parsing, implementation]",PROGRAMMING
-200,Codeforces Round #126 (Div. 2),2,Tractor College,3000.0,E,1340551800,"[implementation, math, number theory, ternary search]",PROGRAMMING
-201,Codeforces Round #127 (Div. 1),1,Clear Symmetry,1000.0,A,1340983800,"[constructive algorithms, dp, math]",PROGRAMMING
-201,Codeforces Round #127 (Div. 1),1,Guess That Car!,1000.0,B,1340983800,"[math, ternary search]",PROGRAMMING
-201,Codeforces Round #127 (Div. 1),1,Fragile Bridges,1500.0,C,1340983800,[dp],PROGRAMMING
-201,Codeforces Round #127 (Div. 1),1,Brand New Problem,2000.0,D,1340983800,"[bitmasks, brute force, dp]",PROGRAMMING
-201,Codeforces Round #127 (Div. 1),1,Thoroughly Bureaucratic Organization,2500.0,E,1340983800,"[binary search, combinatorics]",PROGRAMMING
-202,Codeforces Round #127 (Div. 2),2,LLPS,500.0,A,1340983800,"[binary search, bitmasks, brute force, greedy, implementation, strings]",PROGRAMMING
-202,Codeforces Round #127 (Div. 2),2,Brand New Easy Problem,1000.0,B,1340983800,[brute force],PROGRAMMING
-202,Codeforces Round #127 (Div. 2),2,Clear Symmetry,2000.0,C,1340983800,"[binary search, math]",PROGRAMMING
-202,Codeforces Round #127 (Div. 2),2,Guess That Car!,2000.0,D,1340983800,"[dp, math]",PROGRAMMING
-202,Codeforces Round #127 (Div. 2),2,Fragile Bridges,2500.0,E,1340983800,"[data structures, dp]",PROGRAMMING
-203,Codeforces Round #128 (Div. 2),2,Two Problems,500.0,A,1341329400,"[brute force, implementation]",PROGRAMMING
-203,Codeforces Round #128 (Div. 2),2,Game on Paper,1000.0,B,1341329400,"[brute force, implementation]",PROGRAMMING
-203,Codeforces Round #128 (Div. 2),2,Photographer,1500.0,C,1341329400,"[greedy, sortings]",PROGRAMMING
-203,Codeforces Round #128 (Div. 2),2,Hit Ball,2000.0,D,1341329400,"[geometry, implementation, math]",PROGRAMMING
-203,Codeforces Round #128 (Div. 2),2,Transportation,2500.0,E,1341329400,"[greedy, sortings, two pointers]",PROGRAMMING
-204,Codeforces Round #129 (Div. 1),1,Little Elephant and Interval,500.0,A,1342020600,"[binary search, combinatorics, dp]",PROGRAMMING
-204,Codeforces Round #129 (Div. 1),1,Little Elephant and Cards,500.0,B,1342020600,"[binary search, data structures]",PROGRAMMING
-204,Codeforces Round #129 (Div. 1),1,Little Elephant and Furik and Rubik,1500.0,C,1342020600,"[math, probabilities]",PROGRAMMING
-204,Codeforces Round #129 (Div. 1),1,Little Elephant and Retro Strings,2000.0,D,1342020600,[dp],PROGRAMMING
-204,Codeforces Round #129 (Div. 1),1,Little Elephant and Strings,2500.0,E,1342020600,"[data structures, implementation, string suffix structures, two pointers]",PROGRAMMING
-205,Codeforces Round #129 (Div. 2),2,Little Elephant and Rozdil,500.0,A,1342020600,"[brute force, implementation]",PROGRAMMING
-205,Codeforces Round #129 (Div. 2),2,Little Elephant and Sorting,1000.0,B,1342020600,"[brute force, greedy]",PROGRAMMING
-205,Codeforces Round #129 (Div. 2),2,Little Elephant and Interval,1500.0,C,1342020600,"[binary search, brute force, combinatorics, dp, math]",PROGRAMMING
-205,Codeforces Round #129 (Div. 2),2,Little Elephant and Cards,1500.0,D,1342020600,"[binary search, brute force, sortings]",PROGRAMMING
-205,Codeforces Round #129 (Div. 2),2,Little Elephant and Furik and Rubik,2500.0,E,1342020600,"[brute force, combinatorics, probabilities]",PROGRAMMING
-208,Codeforces Round #130 (Div. 2),2,Dubstep,500.0,A,1343057400,[strings],PROGRAMMING
-208,Codeforces Round #130 (Div. 2),2,Solitaire,2000.0,B,1343057400,"[dfs and similar, dp]",PROGRAMMING
-208,Codeforces Round #130 (Div. 2),2,Police Station,2500.0,C,1343057400,"[dp, graphs, shortest paths]",PROGRAMMING
-208,Codeforces Round #130 (Div. 2),2,"Prizes, Prizes, more Prizes",500.0,D,1343057400,[implementation],PROGRAMMING
-208,Codeforces Round #130 (Div. 2),2,Blood Cousins,3000.0,E,1343057400,"[binary search, data structures, dfs and similar, trees]",PROGRAMMING
-211,VK Cup 2012 Finals,12,Privatization,3000.0,A,1342335600,[],PROGRAMMING
-211,VK Cup 2012 Finals,12,Polycarpus is Looking for Good Substrings,1000.0,B,1342335600,[],PROGRAMMING
-211,VK Cup 2012 Finals,12,Cowboys,500.0,C,1342335600,[],PROGRAMMING
-211,VK Cup 2012 Finals,12,Cutting a Fence,1000.0,D,1342335600,[],PROGRAMMING
-211,VK Cup 2012 Finals,12,IT Restaurants,500.0,E,1342335600,[],PROGRAMMING
-213,Codeforces Round #131 (Div. 1),1,Game,1000.0,A,1343662200,"[dfs and similar, greedy]",PROGRAMMING
-213,Codeforces Round #131 (Div. 1),1,Numbers,1000.0,B,1343662200,"[combinatorics, dp]",PROGRAMMING
-213,Codeforces Round #131 (Div. 1),1,Relay Race,1500.0,C,1343662200,[dp],PROGRAMMING
-213,Codeforces Round #131 (Div. 1),1,Stars,2000.0,D,1343662200,"[constructive algorithms, geometry]",PROGRAMMING
-213,Codeforces Round #131 (Div. 1),1,Two Permutations,2500.0,E,1343662200,"[data structures, hashing, strings]",PROGRAMMING
-214,Codeforces Round #131 (Div. 2),2,System of Equations,500.0,A,1343662200,[brute force],PROGRAMMING
-214,Codeforces Round #131 (Div. 2),2,Hometask,1000.0,B,1343662200,"[brute force, constructive algorithms, greedy, math]",PROGRAMMING
-214,Codeforces Round #131 (Div. 2),2,Game,2000.0,C,1343662200,"[brute force, greedy]",PROGRAMMING
-214,Codeforces Round #131 (Div. 2),2,Numbers,2000.0,D,1343662200,"[combinatorics, dp, math]",PROGRAMMING
-214,Codeforces Round #131 (Div. 2),2,Relay Race,2500.0,E,1343662200,[dp],PROGRAMMING
-215,Codeforces Round #132 (Div. 2),2,Bicycle Chain,500.0,A,1344267000,"[brute force, implementation]",PROGRAMMING
-215,Codeforces Round #132 (Div. 2),2,Olympic Medal,500.0,B,1344267000,"[greedy, math]",PROGRAMMING
-215,Codeforces Round #132 (Div. 2),2,Crosses,3000.0,C,1344267000,"[brute force, implementation]",PROGRAMMING
-215,Codeforces Round #132 (Div. 2),2,Hot Days,2000.0,D,1344267000,[greedy],PROGRAMMING
-215,Codeforces Round #132 (Div. 2),2,Periodical Numbers,3000.0,E,1344267000,"[combinatorics, dp, number theory]",PROGRAMMING
-216,Codeforces Round #133 (Div. 2),2,Tiling with Hexagons,500.0,A,1344958200,"[implementation, math]",PROGRAMMING
-216,Codeforces Round #133 (Div. 2),2,Forming Teams,1500.0,B,1344958200,"[dfs and similar, implementation]",PROGRAMMING
-216,Codeforces Round #133 (Div. 2),2,Hiring Staff,2000.0,C,1344958200,[greedy],PROGRAMMING
-216,Codeforces Round #133 (Div. 2),2,Spider's Web,2000.0,D,1344958200,"[binary search, sortings, two pointers]",PROGRAMMING
-216,Codeforces Round #133 (Div. 2),2,Martian Luck,3000.0,E,1344958200,"[math, number theory]",PROGRAMMING
-217,Codeforces Round #134 (Div. 1),1,Ice Skating,500.0,A,1345273500,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING
-217,Codeforces Round #134 (Div. 1),1,Blackboard Fibonacci,1000.0,B,1345273500,"[brute force, math]",PROGRAMMING
-217,Codeforces Round #134 (Div. 1),1,Formurosa,2500.0,C,1345273500,"[divide and conquer, dp, expression parsing]",PROGRAMMING
-217,Codeforces Round #134 (Div. 1),1,Bitonix' Patrol,3000.0,D,1345273500,"[bitmasks, brute force, combinatorics, dfs and similar, math]",PROGRAMMING
-217,Codeforces Round #134 (Div. 1),1,Alien DNA,3000.0,E,1345273500,"[data structures, dsu, trees]",PROGRAMMING
-218,Codeforces Round #134 (Div. 2),2,Mountain Scenery,500.0,A,1345273500,"[brute force, constructive algorithms, implementation]",PROGRAMMING
-218,Codeforces Round #134 (Div. 2),2,Airport,500.0,B,1345273500,[implementation],PROGRAMMING
-218,Codeforces Round #134 (Div. 2),2,Ice Skating,1000.0,C,1345273500,"[dfs and similar, dsu, graphs]",PROGRAMMING
-218,Codeforces Round #134 (Div. 2),2,Blackboard Fibonacci,3000.0,D,1345273500,[implementation],PROGRAMMING
-218,Codeforces Round #134 (Div. 2),2,Formurosa,3000.0,E,1345273500,[],PROGRAMMING
-219,Codeforces Round #135 (Div. 2),2,k-String,500.0,A,1346081400,"[implementation, strings]",PROGRAMMING
-219,Codeforces Round #135 (Div. 2),2,Special Offer! Super Price 999 Bourles!,1000.0,B,1346081400,[implementation],PROGRAMMING
-219,Codeforces Round #135 (Div. 2),2,Color Stripe,1500.0,C,1346081400,"[brute force, dp, greedy]",PROGRAMMING
-219,Codeforces Round #135 (Div. 2),2,Choosing Capital for Treeland,2000.0,D,1346081400,"[dfs and similar, dp, trees]",PROGRAMMING
-219,Codeforces Round #135 (Div. 2),2,Parking Lot,3000.0,E,1346081400,[data structures],PROGRAMMING
-220,Codeforces Round #136 (Div. 1),1,Little Elephant and Problem,500.0,A,1346427000,"[implementation, sortings]",PROGRAMMING
-220,Codeforces Round #136 (Div. 1),1,Little Elephant and Array,1000.0,B,1346427000,"[constructive algorithms, data structures]",PROGRAMMING
-220,Codeforces Round #136 (Div. 1),1,Little Elephant and Shifts,1500.0,C,1346427000,[data structures],PROGRAMMING
-220,Codeforces Round #136 (Div. 1),1,Little Elephant and Triangle,2000.0,D,1346427000,"[chinese remainder theorem, geometry, math]",PROGRAMMING
-220,Codeforces Round #136 (Div. 1),1,Little Elephant and Inversions,2500.0,E,1346427000,"[data structures, two pointers]",PROGRAMMING
-221,Codeforces Round #136 (Div. 2),2,Little Elephant and Function,500.0,A,1346427000,"[implementation, math]",PROGRAMMING
-221,Codeforces Round #136 (Div. 2),2,Little Elephant and Numbers,1000.0,B,1346427000,[implementation],PROGRAMMING
-221,Codeforces Round #136 (Div. 2),2,Little Elephant and Problem,1500.0,C,1346427000,[sortings],PROGRAMMING
-221,Codeforces Round #136 (Div. 2),2,Little Elephant and Array,2000.0,D,1346427000,[data structures],PROGRAMMING
-221,Codeforces Round #136 (Div. 2),2,Little Elephant and Shifts,2500.0,E,1346427000,[],PROGRAMMING
-222,Codeforces Round #137 (Div. 2),2,Shooshuns and Sequence ,500.0,A,1347291900,"[brute force, implementation]",PROGRAMMING
-222,Codeforces Round #137 (Div. 2),2,Cosmic Tables,1000.0,B,1347291900,[implementation],PROGRAMMING
-222,Codeforces Round #137 (Div. 2),2,Reducing Fractions,1500.0,C,1347291900,"[implementation, number theory, sortings]",PROGRAMMING
-222,Codeforces Round #137 (Div. 2),2,Olympiad,2000.0,D,1347291900,"[binary search, greedy, sortings, two pointers]",PROGRAMMING
-222,Codeforces Round #137 (Div. 2),2,Decoding Genome,2500.0,E,1347291900,[matrices],PROGRAMMING
-223,Codeforces Round #138 (Div. 1),1,Bracket Sequence,500.0,A,1347809400,"[data structures, expression parsing, implementation]",PROGRAMMING
-223,Codeforces Round #138 (Div. 1),1,Two Strings,1000.0,B,1347809400,"[data structures, dp, strings]",PROGRAMMING
-223,Codeforces Round #138 (Div. 1),1,Partial Sums,1500.0,C,1347809400,"[combinatorics, math]",PROGRAMMING
-223,Codeforces Round #138 (Div. 1),1,Spider,2000.0,D,1347809400,"[geometry, graphs]",PROGRAMMING
-223,Codeforces Round #138 (Div. 1),1,Planar Graph,2500.0,E,1347809400,"[flows, geometry, graphs]",PROGRAMMING
-224,Codeforces Round #138 (Div. 2),2,Parallelepiped,500.0,A,1347809400,"[brute force, math]",PROGRAMMING
-224,Codeforces Round #138 (Div. 2),2,Array,1000.0,B,1347809400,"[bitmasks, implementation, two pointers]",PROGRAMMING
-224,Codeforces Round #138 (Div. 2),2,Bracket Sequence,1500.0,C,1347809400,[data structures],PROGRAMMING
-224,Codeforces Round #138 (Div. 2),2,Two Strings,2000.0,D,1347809400,"[data structures, strings]",PROGRAMMING
-224,Codeforces Round #138 (Div. 2),2,Partial Sums,2500.0,E,1347809400,"[combinatorics, math]",PROGRAMMING
-225,Codeforces Round #139 (Div. 2),2,Dice Tower,500.0,A,1348069500,"[constructive algorithms, greedy]",PROGRAMMING
-225,Codeforces Round #139 (Div. 2),2,Well-known Numbers,1000.0,B,1348069500,"[binary search, greedy, number theory]",PROGRAMMING
-225,Codeforces Round #139 (Div. 2),2,Barcode,1500.0,C,1348069500,"[dp, matrices]",PROGRAMMING
-225,Codeforces Round #139 (Div. 2),2,Snake,3000.0,D,1348069500,"[bitmasks, dfs and similar, graphs, implementation]",PROGRAMMING
-225,Codeforces Round #139 (Div. 2),2,Unsolvable,3000.0,E,1348069500,"[math, number theory]",PROGRAMMING
-226,Codeforces Round #140 (Div. 1),1,Flying Saucer Segments,500.0,A,1348500600,[math],PROGRAMMING
-226,Codeforces Round #140 (Div. 1),1,Naughty Stone Piles,1000.0,B,1348500600,[greedy],PROGRAMMING
-226,Codeforces Round #140 (Div. 1),1,Anniversary,1500.0,C,1348500600,"[data structures, implementation, math, matrices, number theory]",PROGRAMMING
-226,Codeforces Round #140 (Div. 1),1,The table,2000.0,D,1348500600,"[constructive algorithms, greedy]",PROGRAMMING
-226,Codeforces Round #140 (Div. 1),1,Noble Knight's Path,2500.0,E,1348500600,"[data structures, trees]",PROGRAMMING
-227,Codeforces Round #140 (Div. 2),2,Where do I Turn?,500.0,A,1348500600,[geometry],PROGRAMMING
-227,Codeforces Round #140 (Div. 2),2,Effective Approach,1000.0,B,1348500600,[implementation],PROGRAMMING
-227,Codeforces Round #140 (Div. 2),2,Flying Saucer Segments,1500.0,C,1348500600,[math],PROGRAMMING
-227,Codeforces Round #140 (Div. 2),2,Naughty Stone Piles,2000.0,D,1348500600,"[math, sortings]",PROGRAMMING
-227,Codeforces Round #140 (Div. 2),2,Anniversary,2500.0,E,1348500600,"[matrices, number theory]",PROGRAMMING
-228,Codeforces Round #141 (Div. 2),2,Is your horseshoe on the other hoof?,500.0,A,1348759800,[implementation],PROGRAMMING
-228,Codeforces Round #141 (Div. 2),2,Two Tables,1000.0,B,1348759800,"[brute force, implementation]",PROGRAMMING
-228,Codeforces Round #141 (Div. 2),2,Fractal Detector,1500.0,C,1348759800,"[dp, hashing]",PROGRAMMING
-228,Codeforces Round #141 (Div. 2),2,Zigzag,2000.0,D,1348759800,[data structures],PROGRAMMING
-228,Codeforces Round #141 (Div. 2),2,The Road to Berland is Paved With Good Intentions,2500.0,E,1348759800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
-229,Codeforces Round #142 (Div. 1),1,Shifts,500.0,A,1349105400,"[brute force, two pointers]",PROGRAMMING
-229,Codeforces Round #142 (Div. 1),1,Planets,500.0,B,1349105400,"[binary search, data structures, shortest paths]",PROGRAMMING
-229,Codeforces Round #142 (Div. 1),1,Triangles,1000.0,C,1349105400,"[combinatorics, graphs, math]",PROGRAMMING
-229,Codeforces Round #142 (Div. 1),1,Towers,1000.0,D,1349105400,"[dp, greedy, two pointers]",PROGRAMMING
-229,Codeforces Round #142 (Div. 1),1,Gifts,3000.0,E,1349105400,"[combinatorics, dp, probabilities]",PROGRAMMING
-230,Codeforces Round #142 (Div. 2),2,Dragons,500.0,A,1349105400,"[greedy, sortings]",PROGRAMMING
-230,Codeforces Round #142 (Div. 2),2,T-primes,500.0,B,1349105400,"[implementation, math, number theory]",PROGRAMMING
-230,Codeforces Round #142 (Div. 2),2,Shifts,1500.0,C,1349105400,"[binary search, data structures, dp, implementation]",PROGRAMMING
-230,Codeforces Round #142 (Div. 2),2,Planets,2500.0,D,1349105400,"[binary search, graphs, shortest paths]",PROGRAMMING
-230,Codeforces Round #142 (Div. 2),2,Triangles,3000.0,E,1349105400,"[combinatorics, graphs, math]",PROGRAMMING
-231,Codeforces Round #143 (Div. 2),2,Team,500.0,A,1349623800,"[brute force, greedy]",PROGRAMMING
-231,Codeforces Round #143 (Div. 2),2,"Magic, Wizardry and Wonders",1000.0,B,1349623800,"[constructive algorithms, greedy]",PROGRAMMING
-231,Codeforces Round #143 (Div. 2),2,To Add or Not to Add,1500.0,C,1349623800,"[binary search, sortings, two pointers]",PROGRAMMING
-231,Codeforces Round #143 (Div. 2),2,Magic Box,2000.0,D,1349623800,"[brute force, geometry]",PROGRAMMING
-231,Codeforces Round #143 (Div. 2),2,Cactus,2500.0,E,1349623800,"[data structures, dfs and similar, dp, graphs, trees]",PROGRAMMING
-232,Codeforces Round #144 (Div. 1),1,Cycles,500.0,A,1349969400,"[binary search, constructive algorithms, graphs, greedy]",PROGRAMMING
-232,Codeforces Round #144 (Div. 1),1,Table,1000.0,B,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
-232,Codeforces Round #144 (Div. 1),1,Doe Graphs,1500.0,C,1349969400,"[constructive algorithms, divide and conquer, dp, graphs, shortest paths]",PROGRAMMING
-232,Codeforces Round #144 (Div. 1),1,Fence,2000.0,D,1349969400,"[binary search, data structures, string suffix structures]",PROGRAMMING
-232,Codeforces Round #144 (Div. 1),1,Quick Tortoise,2500.0,E,1349969400,"[bitmasks, divide and conquer, dp]",PROGRAMMING
-233,Codeforces Round #144 (Div. 2),2,Perfect Permutation,500.0,A,1349969400,"[implementation, math]",PROGRAMMING
-233,Codeforces Round #144 (Div. 2),2,Non-square Equation,1000.0,B,1349969400,"[binary search, brute force, math]",PROGRAMMING
-233,Codeforces Round #144 (Div. 2),2,Cycles,1500.0,C,1349969400,"[combinatorics, graphs, matrices]",PROGRAMMING
-233,Codeforces Round #144 (Div. 2),2,Table,2000.0,D,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
-233,Codeforces Round #144 (Div. 2),2,Doe Graphs,2500.0,E,1349969400,[],PROGRAMMING
-234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Lefthanders and Righthanders ,,A,1350370800,[implementation],PROGRAMMING
-234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Reading,,B,1350370800,[sortings],PROGRAMMING
-234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Weather,,C,1350370800,"[dp, implementation]",PROGRAMMING
-234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Cinema,,D,1350370800,[implementation],PROGRAMMING
-234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Champions' League,,E,1350370800,[implementation],PROGRAMMING
-234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Fence,,F,1350370800,[dp],PROGRAMMING
-234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Practice,,G,1350370800,"[constructive algorithms, divide and conquer, implementation]",PROGRAMMING
-234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Merging Two Decks,,H,1350370800,"[constructive algorithms, greedy]",PROGRAMMING
-235,Codeforces Round #146 (Div. 1),1,LCM Challenge,500.0,A,1350803400,[number theory],PROGRAMMING
-235,Codeforces Round #146 (Div. 1),1,Let's Play Osu!,1000.0,B,1350803400,"[dp, math, probabilities]",PROGRAMMING
-235,Codeforces Round #146 (Div. 1),1,Cyclical Quest,1500.0,C,1350803400,"[string suffix structures, strings]",PROGRAMMING
-235,Codeforces Round #146 (Div. 1),1,Graph Game,2000.0,D,1350803400,[graphs],PROGRAMMING
-235,Codeforces Round #146 (Div. 1),1,Number Challenge,2500.0,E,1350803400,"[combinatorics, dp, implementation, number theory]",PROGRAMMING
-236,Codeforces Round #146 (Div. 2),2,Boy or Girl,500.0,A,1350803400,[implementation],PROGRAMMING
-236,Codeforces Round #146 (Div. 2),2,Easy Number Challenge,1000.0,B,1350803400,"[implementation, number theory]",PROGRAMMING
-236,Codeforces Round #146 (Div. 2),2,LCM Challenge,1500.0,C,1350803400,"[greedy, number theory]",PROGRAMMING
-236,Codeforces Round #146 (Div. 2),2,Let's Play Osu!,2000.0,D,1350803400,"[dp, probabilities]",PROGRAMMING
-236,Codeforces Round #146 (Div. 2),2,Cyclical Quest,2500.0,E,1350803400,[],PROGRAMMING
-237,Codeforces Round #147 (Div. 2),2,Free Cash,500.0,A,1351179000,[implementation],PROGRAMMING
-237,Codeforces Round #147 (Div. 2),2,Young Table,1000.0,B,1351179000,"[implementation, sortings]",PROGRAMMING
-237,Codeforces Round #147 (Div. 2),2,Primes on Interval,1500.0,C,1351179000,"[binary search, number theory, two pointers]",PROGRAMMING
-237,Codeforces Round #147 (Div. 2),2,T-decomposition,2000.0,D,1351179000,"[dfs and similar, graphs, greedy]",PROGRAMMING
-237,Codeforces Round #147 (Div. 2),2,Build String,2500.0,E,1351179000,"[flows, graphs]",PROGRAMMING
-238,Codeforces Round #148 (Div. 1),1,Not Wool Sequences,500.0,A,1352044800,"[constructive algorithms, math]",PROGRAMMING
-238,Codeforces Round #148 (Div. 1),1,Boring Partition,1000.0,B,1352044800,[constructive algorithms],PROGRAMMING
-238,Codeforces Round #148 (Div. 1),1,World Eater Brothers,1500.0,C,1352044800,"[dfs and similar, dp, greedy, trees]",PROGRAMMING
-238,Codeforces Round #148 (Div. 1),1,Tape Programming,2000.0,D,1352044800,"[data structures, implementation]",PROGRAMMING
-238,Codeforces Round #148 (Div. 1),1,Meeting Her,2500.0,E,1352044800,"[dp, graphs, shortest paths]",PROGRAMMING
-239,Codeforces Round #148 (Div. 2),2,Two Bags of Potatoes,500.0,A,1352044800,"[greedy, implementation, math]",PROGRAMMING
-239,Codeforces Round #148 (Div. 2),2,Easy Tape Programming,1000.0,B,1352044800,"[brute force, implementation]",PROGRAMMING
-239,Codeforces Round #148 (Div. 2),2,Not Wool Sequences,1500.0,C,1352044800,"[combinatorics, constructive algorithms, math]",PROGRAMMING
-239,Codeforces Round #148 (Div. 2),2,Boring Partition,2000.0,D,1352044800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
-239,Codeforces Round #148 (Div. 2),2,World Eater Brothers,2500.0,E,1352044800,[],PROGRAMMING
-240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Cinema,,A,1350370800,[implementation],PROGRAMMING
-240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Fence,,B,1350370800,[dp],PROGRAMMING
-240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Practice,,C,1350370800,"[constructive algorithms, implementation]",PROGRAMMING
-240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Merging Two Decks,,D,1350370800,"[constructive algorithms, greedy]",PROGRAMMING
-240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Road Repairs,,E,1350370800,"[dfs and similar, graphs, greedy]",PROGRAMMING
-240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,TorCoder,,F,1350370800,[data structures],PROGRAMMING
-242,Codeforces Round #149 (Div. 2),2,Heads or Tails,500.0,A,1352647800,"[brute force, implementation]",PROGRAMMING
-242,Codeforces Round #149 (Div. 2),2,Big Segment,1000.0,B,1352647800,"[implementation, sortings]",PROGRAMMING
-242,Codeforces Round #149 (Div. 2),2,King's Path,1500.0,C,1352647800,"[dfs and similar, hashing, shortest paths]",PROGRAMMING
-242,Codeforces Round #149 (Div. 2),2,Dispute,2000.0,D,1352647800,"[dfs and similar, greedy]",PROGRAMMING
-242,Codeforces Round #149 (Div. 2),2,XOR on Segment,2500.0,E,1352647800,"[bitmasks, data structures]",PROGRAMMING
-243,Codeforces Round #150 (Div. 1),1,The Brand New Function,500.0,A,1353079800,[bitmasks],PROGRAMMING
-243,Codeforces Round #150 (Div. 1),1,Hydra,1000.0,B,1353079800,"[graphs, sortings]",PROGRAMMING
-243,Codeforces Round #150 (Div. 1),1,Colorado Potato Beetle,1500.0,C,1353079800,"[dfs and similar, implementation]",PROGRAMMING
-243,Codeforces Round #150 (Div. 1),1,Cubes,2000.0,D,1353079800,"[data structures, dp, geometry, two pointers]",PROGRAMMING
-243,Codeforces Round #150 (Div. 1),1,Matrix,2500.0,E,1353079800,[data structures],PROGRAMMING
-244,Codeforces Round #150 (Div. 2),2,Dividing Orange,500.0,A,1353079800,[implementation],PROGRAMMING
-244,Codeforces Round #150 (Div. 2),2,Undoubtedly Lucky Numbers,1000.0,B,1353079800,"[bitmasks, brute force, dfs and similar]",PROGRAMMING
-244,Codeforces Round #150 (Div. 2),2,The Brand New Function,1500.0,C,1353079800,"[bitmasks, divide and conquer, math]",PROGRAMMING
-244,Codeforces Round #150 (Div. 2),2,Hydra,2000.0,D,1353079800,[],PROGRAMMING
-244,Codeforces Round #150 (Div. 2),2,Colorado Potato Beetle,2500.0,E,1353079800,[],PROGRAMMING
-246,Codeforces Round #151 (Div. 2),2,Buggy Sorting,500.0,A,1353511800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
-246,Codeforces Round #151 (Div. 2),2,Increase and Decrease,1000.0,B,1353511800,"[greedy, math]",PROGRAMMING
-246,Codeforces Round #151 (Div. 2),2,Beauty Pageant,1500.0,C,1353511800,"[brute force, constructive algorithms, greedy]",PROGRAMMING
-246,Codeforces Round #151 (Div. 2),2,Colorful Graph,2000.0,D,1353511800,"[brute force, dfs and similar, graphs]",PROGRAMMING
-246,Codeforces Round #151 (Div. 2),2,Blood Cousins Return,2500.0,E,1353511800,"[binary search, data structures, dfs and similar, dp, sortings]",PROGRAMMING
-247,"CROC-MBTU 2012, Final Round",12,Paper Work,500.0,A,1353927300,[],PROGRAMMING
-247,"CROC-MBTU 2012, Final Round",12,Restoring IPv6,1000.0,B,1353927300,[],PROGRAMMING
-247,"CROC-MBTU 2012, Final Round",12,Movie Critics,1500.0,C,1353927300,[],PROGRAMMING
-247,"CROC-MBTU 2012, Final Round",12,Building Bridge,1500.0,D,1353927300,[],PROGRAMMING
-247,"CROC-MBTU 2012, Final Round",12,Mad Joe,2000.0,E,1353927300,[],PROGRAMMING
-248,Codeforces Round #152 (Div. 2),2,Cupboards,500.0,A,1353857400,[implementation],PROGRAMMING
-248,Codeforces Round #152 (Div. 2),2,Chilly Willy,1000.0,B,1353857400,"[math, number theory]",PROGRAMMING
-248,Codeforces Round #152 (Div. 2),2,Robo-Footballer,2000.0,C,1353857400,"[binary search, geometry]",PROGRAMMING
-248,Codeforces Round #152 (Div. 2),2,Sweets for Everyone!,2000.0,D,1353857400,"[binary search, greedy, implementation]",PROGRAMMING
-248,Codeforces Round #152 (Div. 2),2,Piglet's Birthday,2500.0,E,1353857400,"[dp, probabilities]",PROGRAMMING
-249,Codeforces Round #152 (Div. 1),1,Robo-Footballer,1000.0,A,1353857400,[geometry],PROGRAMMING
-249,Codeforces Round #152 (Div. 1),1,Sweets for Everyone!,1000.0,B,1353857400,"[binary search, greedy]",PROGRAMMING
-249,Codeforces Round #152 (Div. 1),1,Piglet's Birthday,1500.0,C,1353857400,"[dp, probabilities]",PROGRAMMING
-249,Codeforces Round #152 (Div. 1),1,Donkey and Stars,1500.0,D,1353857400,"[data structures, dp, math, sortings]",PROGRAMMING
-249,Codeforces Round #152 (Div. 1),1,Endless Matrix,2500.0,E,1353857400,[math],PROGRAMMING
-250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Paper Work,500.0,A,1353938400,[greedy],PROGRAMMING
-250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Restoring IPv6,1000.0,B,1353938400,"[implementation, strings]",PROGRAMMING
-250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Movie Critics,1500.0,C,1353938400,[greedy],PROGRAMMING
-250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Building Bridge,1500.0,D,1353938400,"[geometry, ternary search, two pointers]",PROGRAMMING
-250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Mad Joe,2000.0,E,1353938400,[brute force],PROGRAMMING
-251,Codeforces Round #153 (Div. 1),1,Points on Line,500.0,A,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING
-251,Codeforces Round #153 (Div. 1),1,Playing with Permutations,1000.0,B,1354807800,"[implementation, math]",PROGRAMMING
-251,Codeforces Round #153 (Div. 1),1,Number Transformation,1500.0,C,1354807800,"[dp, greedy, number theory]",PROGRAMMING
-251,Codeforces Round #153 (Div. 1),1,Two Sets,2000.0,D,1354807800,"[bitmasks, math]",PROGRAMMING
-251,Codeforces Round #153 (Div. 1),1,Tree and Table,2500.0,E,1354807800,"[dfs and similar, dp, implementation, trees]",PROGRAMMING
-252,Codeforces Round #153 (Div. 2),2,Little Xor,500.0,A,1354807800,"[brute force, implementation]",PROGRAMMING
-252,Codeforces Round #153 (Div. 2),2,Unsorting Array,1000.0,B,1354807800,"[brute force, sortings]",PROGRAMMING
-252,Codeforces Round #153 (Div. 2),2,Points on Line,1500.0,C,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING
-252,Codeforces Round #153 (Div. 2),2,Playing with Permutations,2000.0,D,1354807800,"[brute force, combinatorics, implementation]",PROGRAMMING
-252,Codeforces Round #153 (Div. 2),2,Number Transformation,2500.0,E,1354807800,"[dp, number theory]",PROGRAMMING
-253,Codeforces Round #154 (Div. 2),2,Boys and Girls,500.0,A,1354960800,[greedy],PROGRAMMING
-253,Codeforces Round #154 (Div. 2),2,Physics Practical,1000.0,B,1354960800,"[binary search, dp, two pointers]",PROGRAMMING
-253,Codeforces Round #154 (Div. 2),2,Text Editor,1500.0,C,1354960800,"[data structures, dfs and similar, greedy, shortest paths]",PROGRAMMING
-253,Codeforces Round #154 (Div. 2),2,Table with Letters - 2,2000.0,D,1354960800,"[brute force, two pointers]",PROGRAMMING
-253,Codeforces Round #154 (Div. 2),2,Printer,2500.0,E,1354960800,"[binary search, data structures, implementation, sortings]",PROGRAMMING
-254,Codeforces Round #155 (Div. 2),2,Cards with Numbers,500.0,A,1355047200,"[constructive algorithms, sortings]",PROGRAMMING
-254,Codeforces Round #155 (Div. 2),2,Jury Size,1000.0,B,1355047200,"[brute force, implementation]",PROGRAMMING
-254,Codeforces Round #155 (Div. 2),2,Anagram,1500.0,C,1355047200,[greedy],PROGRAMMING
-254,Codeforces Round #155 (Div. 2),2,Rats,2000.0,D,1355047200,"[brute force, dfs and similar, implementation]",PROGRAMMING
-254,Codeforces Round #155 (Div. 2),2,Dormitory,2500.0,E,1355047200,"[dp, implementation]",PROGRAMMING
-255,Codeforces Round #156 (Div. 2),2,Greg's Workout,500.0,A,1355671800,[implementation],PROGRAMMING
-255,Codeforces Round #156 (Div. 2),2,Code Parsing,1000.0,B,1355671800,[implementation],PROGRAMMING
-255,Codeforces Round #156 (Div. 2),2,Almost Arithmetical Progression,1500.0,C,1355671800,"[brute force, dp]",PROGRAMMING
-255,Codeforces Round #156 (Div. 2),2,Mr. Bender and Square,2000.0,D,1355671800,"[binary search, implementation, math]",PROGRAMMING
-255,Codeforces Round #156 (Div. 2),2,Furlo and Rublo and Game,2500.0,E,1355671800,"[games, implementation, math]",PROGRAMMING
-256,Codeforces Round #156 (Div. 1),1,Almost Arithmetical Progression,500.0,A,1355671800,"[binary search, dp, two pointers]",PROGRAMMING
-256,Codeforces Round #156 (Div. 1),1,Mr. Bender and Square,1000.0,B,1355671800,"[binary search, brute force, math]",PROGRAMMING
-256,Codeforces Round #156 (Div. 1),1,Furlo and Rublo and Game,1500.0,C,1355671800,[games],PROGRAMMING
-256,Codeforces Round #156 (Div. 1),1,Liars and Serge,2000.0,D,1355671800,[dp],PROGRAMMING
-256,Codeforces Round #156 (Div. 1),1,Lucky Arrays,2500.0,E,1355671800,[data structures],PROGRAMMING
-257,Codeforces Round #159 (Div. 2),2,Sockets,500.0,A,1357659000,"[greedy, implementation, sortings]",PROGRAMMING
-257,Codeforces Round #159 (Div. 2),2,Playing Cubes,500.0,B,1357659000,"[games, greedy, implementation]",PROGRAMMING
-257,Codeforces Round #159 (Div. 2),2,View Angle,1500.0,C,1357659000,"[brute force, geometry, math]",PROGRAMMING
-257,Codeforces Round #159 (Div. 2),2,Sum,2000.0,D,1357659000,"[greedy, math]",PROGRAMMING
-257,Codeforces Round #159 (Div. 2),2,Greedy Elevator,3000.0,E,1357659000,"[data structures, implementation]",PROGRAMMING
-258,Codeforces Round #157 (Div. 1),1,Little Elephant and Bits,500.0,A,1356190200,"[greedy, math]",PROGRAMMING
-258,Codeforces Round #157 (Div. 1),1,Little Elephant and Elections,1000.0,B,1356190200,"[brute force, combinatorics, dp]",PROGRAMMING
-258,Codeforces Round #157 (Div. 1),1,Little Elephant and LCM,1500.0,C,1356190200,"[binary search, combinatorics, dp, math]",PROGRAMMING
-258,Codeforces Round #157 (Div. 1),1,Little Elephant and Broken Sorting,2000.0,D,1356190200,"[dp, math, probabilities]",PROGRAMMING
-258,Codeforces Round #157 (Div. 1),1,Little Elephant and Tree,2500.0,E,1356190200,"[data structures, dfs and similar, trees]",PROGRAMMING
-259,Codeforces Round #157 (Div. 2),2,Little Elephant and Chess,500.0,A,1356190200,"[brute force, strings]",PROGRAMMING
-259,Codeforces Round #157 (Div. 2),2,Little Elephant and Magic Square,1000.0,B,1356190200,"[brute force, implementation]",PROGRAMMING
-259,Codeforces Round #157 (Div. 2),2,Little Elephant and Bits,1500.0,C,1356190200,"[greedy, strings]",PROGRAMMING
-259,Codeforces Round #157 (Div. 2),2,Little Elephant and Elections,2000.0,D,1356190200,"[brute force, combinatorics, dp, math]",PROGRAMMING
-259,Codeforces Round #157 (Div. 2),2,Little Elephant and LCM,2500.0,E,1356190200,"[binary search, combinatorics, math]",PROGRAMMING
-260,Codeforces Round #158 (Div. 2),2,Adding Digits,500.0,A,1356622500,"[implementation, math]",PROGRAMMING
-260,Codeforces Round #158 (Div. 2),2,Ancient Prophesy,1000.0,B,1356622500,"[brute force, implementation, strings]",PROGRAMMING
-260,Codeforces Round #158 (Div. 2),2,Balls and Boxes,1500.0,C,1356622500,"[greedy, implementation]",PROGRAMMING
-260,Codeforces Round #158 (Div. 2),2,Black and White Tree,2000.0,D,1356622500,"[constructive algorithms, dsu, graphs, greedy, trees]",PROGRAMMING
-260,Codeforces Round #158 (Div. 2),2,Dividing Kingdom,2500.0,E,1356622500,"[binary search, brute force, data structures]",PROGRAMMING
-261,Codeforces Round #160 (Div. 1),1,Maxim and Discounts,500.0,A,1358091000,"[greedy, sortings]",PROGRAMMING
-261,Codeforces Round #160 (Div. 1),1,Maxim and Restaurant,1000.0,B,1358091000,"[dp, math, probabilities]",PROGRAMMING
-261,Codeforces Round #160 (Div. 1),1,Maxim and Matrix,1500.0,C,1358091000,"[constructive algorithms, dp, math]",PROGRAMMING
-261,Codeforces Round #160 (Div. 1),1,Maxim and Increasing Subsequence,2000.0,D,1358091000,[dp],PROGRAMMING
-261,Codeforces Round #160 (Div. 1),1,Maxim and Calculator,2500.0,E,1358091000,"[brute force, dp, two pointers]",PROGRAMMING
-262,Codeforces Round #160 (Div. 2),2,Roma and Lucky Numbers,500.0,A,1358091000,[implementation],PROGRAMMING
-262,Codeforces Round #160 (Div. 2),2,Roma and Changing Signs,1000.0,B,1358091000,[greedy],PROGRAMMING
-262,Codeforces Round #160 (Div. 2),2,Maxim and Discounts,1500.0,C,1358091000,"[greedy, sortings]",PROGRAMMING
-262,Codeforces Round #160 (Div. 2),2,Maxim and Restaurant,2000.0,D,1358091000,"[combinatorics, dp]",PROGRAMMING
-262,Codeforces Round #160 (Div. 2),2,Maxim and Matrix,2500.0,E,1358091000,[dp],PROGRAMMING
-263,Codeforces Round #161 (Div. 2),2,Beautiful Matrix,500.0,A,1358350200,[implementation],PROGRAMMING
-263,Codeforces Round #161 (Div. 2),2,Squares,500.0,B,1358350200,"[greedy, implementation, sortings]",PROGRAMMING
-263,Codeforces Round #161 (Div. 2),2,Circle of Numbers,2500.0,C,1358350200,"[dfs and similar, implementation]",PROGRAMMING
-263,Codeforces Round #161 (Div. 2),2,Cycle in Graph,2000.0,D,1358350200,"[dfs and similar, graphs]",PROGRAMMING
-263,Codeforces Round #161 (Div. 2),2,Rhombus,3000.0,E,1358350200,"[brute force, data structures, dp]",PROGRAMMING
-264,Codeforces Round #162 (Div. 1),1,Escape from Stones,500.0,A,1358686800,"[constructive algorithms, data structures, implementation, two pointers]",PROGRAMMING
-264,Codeforces Round #162 (Div. 1),1,Good Sequences,1000.0,B,1358686800,"[dp, number theory]",PROGRAMMING
-264,Codeforces Round #162 (Div. 1),1,Choosing Balls,1500.0,C,1358686800,[dp],PROGRAMMING
-264,Codeforces Round #162 (Div. 1),1,Colorful Stones,2000.0,D,1358686800,"[dp, two pointers]",PROGRAMMING
-264,Codeforces Round #162 (Div. 1),1,Roadside Trees,2500.0,E,1358686800,"[data structures, dp]",PROGRAMMING
-265,Codeforces Round #162 (Div. 2),2,Colorful Stones (Simplified Edition),500.0,A,1358686800,[implementation],PROGRAMMING
-265,Codeforces Round #162 (Div. 2),2,Roadside Trees (Simplified Edition),1000.0,B,1358686800,"[greedy, implementation]",PROGRAMMING
-265,Codeforces Round #162 (Div. 2),2,Escape from Stones,1500.0,C,1358686800,"[greedy, implementation]",PROGRAMMING
-265,Codeforces Round #162 (Div. 2),2,Good Sequences,2000.0,D,1358686800,"[dp, number theory]",PROGRAMMING
-265,Codeforces Round #162 (Div. 2),2,Choosing Balls,2500.0,E,1358686800,"[schedules, sortings]",PROGRAMMING
-266,Codeforces Round #163 (Div. 2),2,Stones on the Table,500.0,A,1358868600,[implementation],PROGRAMMING
-266,Codeforces Round #163 (Div. 2),2,Queue at the School,500.0,B,1358868600,"[constructive algorithms, graph matchings, implementation, shortest paths]",PROGRAMMING
-266,Codeforces Round #163 (Div. 2),2,Below the Diagonal,2500.0,C,1358868600,"[constructive algorithms, greedy, math]",PROGRAMMING
-266,Codeforces Round #163 (Div. 2),2,BerDonalds,3000.0,D,1358868600,"[graphs, math, shortest paths]",PROGRAMMING
-266,Codeforces Round #163 (Div. 2),2,More Queries to Array...,3000.0,E,1358868600,"[data structures, math]",PROGRAMMING
-268,Codeforces Round #164 (Div. 2),2,Games,500.0,A,1359387000,[brute force],PROGRAMMING
-268,Codeforces Round #164 (Div. 2),2,Buttons,1000.0,B,1359387000,"[implementation, math]",PROGRAMMING
-268,Codeforces Round #164 (Div. 2),2,Beautiful Sets of Points,1500.0,C,1359387000,"[constructive algorithms, implementation]",PROGRAMMING
-268,Codeforces Round #164 (Div. 2),2,Wall Bars,2500.0,D,1359387000,[dp],PROGRAMMING
-268,Codeforces Round #164 (Div. 2),2,Playlist,2500.0,E,1359387000,"[math, probabilities, sortings]",PROGRAMMING
-269,Codeforces Round #165 (Div. 1),1,Magical Boxes,500.0,A,1359732600,"[greedy, math]",PROGRAMMING
-269,Codeforces Round #165 (Div. 1),1,Greenhouse Effect,1000.0,B,1359732600,[dp],PROGRAMMING
-269,Codeforces Round #165 (Div. 1),1,Flawed Flow,1500.0,C,1359732600,"[constructive algorithms, flows, graphs]",PROGRAMMING
-269,Codeforces Round #165 (Div. 1),1,Maximum Waterfall,2000.0,D,1359732600,"[data structures, dp]",PROGRAMMING
-269,Codeforces Round #165 (Div. 1),1,String Theory,2500.0,E,1359732600,[],PROGRAMMING
-270,Codeforces Round #165 (Div. 2),2,Fancy Fence,500.0,A,1359732600,"[geometry, implementation, math]",PROGRAMMING
-270,Codeforces Round #165 (Div. 2),2,Multithreading,1500.0,B,1359732600,"[data structures, greedy, implementation]",PROGRAMMING
-270,Codeforces Round #165 (Div. 2),2,Magical Boxes,1500.0,C,1359732600,"[binary search, greedy, implementation, math, sortings]",PROGRAMMING
-270,Codeforces Round #165 (Div. 2),2,Greenhouse Effect,2000.0,D,1359732600,[dp],PROGRAMMING
-270,Codeforces Round #165 (Div. 2),2,Flawed Flow,2500.0,E,1359732600,"[dfs and similar, sortings]",PROGRAMMING
-271,Codeforces Round #166 (Div. 2),2,Beautiful Year,500.0,A,1360596600,[brute force],PROGRAMMING
-271,Codeforces Round #166 (Div. 2),2,Prime Matrix,1000.0,B,1360596600,"[binary search, brute force, math, number theory]",PROGRAMMING
-271,Codeforces Round #166 (Div. 2),2,Secret,1500.0,C,1360596600,"[constructive algorithms, implementation]",PROGRAMMING
-271,Codeforces Round #166 (Div. 2),2,Good Substrings,2000.0,D,1360596600,"[data structures, strings]",PROGRAMMING
-271,Codeforces Round #166 (Div. 2),2,Three Horses,3000.0,E,1360596600,"[constructive algorithms, math, number theory]",PROGRAMMING
-272,Codeforces Round #167 (Div. 2),2,Dima and Friends,500.0,A,1360769400,"[implementation, math]",PROGRAMMING
-272,Codeforces Round #167 (Div. 2),2,Dima and Sequence,1000.0,B,1360769400,"[implementation, math]",PROGRAMMING
-272,Codeforces Round #167 (Div. 2),2,Dima and Staircase,1500.0,C,1360769400,"[data structures, implementation]",PROGRAMMING
-272,Codeforces Round #167 (Div. 2),2,Dima and Two Sequences,2000.0,D,1360769400,"[combinatorics, math, sortings]",PROGRAMMING
-272,Codeforces Round #167 (Div. 2),2,Dima and Horses,2500.0,E,1360769400,"[combinatorics, constructive algorithms, graphs]",PROGRAMMING
-273,Codeforces Round #167 (Div. 1),1,Dima and Staircase,500.0,A,1360769400,[],PROGRAMMING
-273,Codeforces Round #167 (Div. 1),1,Dima and Two Sequences,1000.0,B,1360769400,[combinatorics],PROGRAMMING
-273,Codeforces Round #167 (Div. 1),1,Dima and Horses,1500.0,C,1360769400,"[graphs, greedy]",PROGRAMMING
-273,Codeforces Round #167 (Div. 1),1,Dima and Figure,2000.0,D,1360769400,[dp],PROGRAMMING
-273,Codeforces Round #167 (Div. 1),1,Dima and Game,2500.0,E,1360769400,"[dp, games]",PROGRAMMING
-274,Codeforces Round #168 (Div. 1),1,k-Multiple Free Set,500.0,A,1361374200,"[binary search, greedy, sortings]",PROGRAMMING
-274,Codeforces Round #168 (Div. 1),1,Zero Tree,1000.0,B,1361374200,"[dfs and similar, dp, greedy, trees]",PROGRAMMING
-274,Codeforces Round #168 (Div. 1),1,The Last Hole!,1500.0,C,1361374200,"[brute force, geometry]",PROGRAMMING
-274,Codeforces Round #168 (Div. 1),1,Lovely Matrix,2000.0,D,1361374200,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING
-274,Codeforces Round #168 (Div. 1),1,Mirror Room,2000.0,E,1361374200,"[data structures, implementation]",PROGRAMMING
-275,Codeforces Round #168 (Div. 2),2,Lights Out,500.0,A,1361374200,[implementation],PROGRAMMING
-275,Codeforces Round #168 (Div. 2),2,Convex Shape,1000.0,B,1361374200,"[constructive algorithms, implementation]",PROGRAMMING
-275,Codeforces Round #168 (Div. 2),2,k-Multiple Free Set,1500.0,C,1361374200,"[binary search, greedy, sortings]",PROGRAMMING
-275,Codeforces Round #168 (Div. 2),2,Zero Tree,2000.0,D,1361374200,"[dfs and similar, dp, trees]",PROGRAMMING
-275,Codeforces Round #168 (Div. 2),2,The Last Hole!,2500.0,E,1361374200,[],PROGRAMMING
-276,Codeforces Round #169 (Div. 2),2,Lunch Rush,500.0,A,1361719800,[implementation],PROGRAMMING
-276,Codeforces Round #169 (Div. 2),2,Little Girl and Game,1000.0,B,1361719800,"[games, greedy]",PROGRAMMING
-276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum Sum,1500.0,C,1361719800,"[data structures, implementation, sortings]",PROGRAMMING
-276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum XOR,2000.0,D,1361719800,"[bitmasks, dp, greedy, implementation, math]",PROGRAMMING
-276,Codeforces Round #169 (Div. 2),2,Little Girl and Problem on Trees,2500.0,E,1361719800,"[data structures, trees]",PROGRAMMING
-277,Codeforces Round #170 (Div. 1),1,Learning Languages,500.0,A,1362065400,"[dfs and similar, dsu]",PROGRAMMING
-277,Codeforces Round #170 (Div. 1),1,Set of Points,1500.0,B,1362065400,"[constructive algorithms, geometry]",PROGRAMMING
-277,Codeforces Round #170 (Div. 1),1,Game,2000.0,C,1362065400,"[games, implementation]",PROGRAMMING
-277,Codeforces Round #170 (Div. 1),1,Google Code Jam,3000.0,D,1362065400,"[dp, probabilities]",PROGRAMMING
-277,Codeforces Round #170 (Div. 1),1,Binary Tree on Plane,2000.0,E,1362065400,[flows],PROGRAMMING
-278,Codeforces Round #170 (Div. 2),2,Circle Line,500.0,A,1362065400,[implementation],PROGRAMMING
-278,Codeforces Round #170 (Div. 2),2,New Problem,1000.0,B,1362065400,"[brute force, strings]",PROGRAMMING
-278,Codeforces Round #170 (Div. 2),2,Learning Languages,1000.0,C,1362065400,[dsu],PROGRAMMING
-278,Codeforces Round #170 (Div. 2),2,Set of Points,3000.0,D,1362065400,"[constructive algorithms, geometry]",PROGRAMMING
-278,Codeforces Round #170 (Div. 2),2,Game,3000.0,E,1362065400,[games],PROGRAMMING
-279,Codeforces Round #171 (Div. 2),2,Point on Spiral,500.0,A,1362411000,"[brute force, geometry, implementation]",PROGRAMMING
-279,Codeforces Round #171 (Div. 2),2,Books,1000.0,B,1362411000,"[binary search, brute force, implementation, two pointers]",PROGRAMMING
-279,Codeforces Round #171 (Div. 2),2,Ladder,1500.0,C,1362411000,"[dp, implementation, two pointers]",PROGRAMMING
-279,Codeforces Round #171 (Div. 2),2,The Minimum Number of Variables,2000.0,D,1362411000,"[bitmasks, dp]",PROGRAMMING
-279,Codeforces Round #171 (Div. 2),2,Beautiful Decomposition,2000.0,E,1362411000,"[games, greedy]",PROGRAMMING
-280,Codeforces Round #172 (Div. 1),1,Rectangle Puzzle,500.0,A,1362929400,[geometry],PROGRAMMING
-280,Codeforces Round #172 (Div. 1),1,Maximum Xor Secondary,1000.0,B,1362929400,"[data structures, implementation, two pointers]",PROGRAMMING
-280,Codeforces Round #172 (Div. 1),1,Game on Tree,1500.0,C,1362929400,"[implementation, math, probabilities, trees]",PROGRAMMING
-280,Codeforces Round #172 (Div. 1),1,k-Maximum Subsequence Sum,2000.0,D,1362929400,"[data structures, flows]",PROGRAMMING
-280,Codeforces Round #172 (Div. 1),1,Sequence Transformation,2500.0,E,1362929400,"[data structures, dp, implementation, math]",PROGRAMMING
-281,Codeforces Round #172 (Div. 2),2,Word Capitalization,500.0,A,1362929400,[strings],PROGRAMMING
-281,Codeforces Round #172 (Div. 2),2,Nearest Fraction,1000.0,B,1362929400,"[brute force, implementation, two pointers]",PROGRAMMING
-281,Codeforces Round #172 (Div. 2),2,Rectangle Puzzle,1500.0,C,1362929400,"[geometry, implementation]",PROGRAMMING
-281,Codeforces Round #172 (Div. 2),2,Maximum Xor Secondary,2000.0,D,1362929400,[two pointers],PROGRAMMING
-281,Codeforces Round #172 (Div. 2),2,Game on Tree,2500.0,E,1362929400,[math],PROGRAMMING
-282,Codeforces Round #173 (Div. 2),2,Bit++,500.0,A,1363188600,[implementation],PROGRAMMING
-282,Codeforces Round #173 (Div. 2),2,Painting Eggs,1000.0,B,1363188600,"[greedy, math]",PROGRAMMING
-282,Codeforces Round #173 (Div. 2),2,XOR and OR,1500.0,C,1363188600,"[constructive algorithms, implementation, math]",PROGRAMMING
-282,Codeforces Round #173 (Div. 2),2,Yet Another Number Game,2000.0,D,1363188600,"[dp, games]",PROGRAMMING
-282,Codeforces Round #173 (Div. 2),2,Sausage Maximization,2500.0,E,1363188600,"[bitmasks, data structures, trees]",PROGRAMMING
-283,Codeforces Round #174 (Div. 1),1,Cows and Sequence,1000.0,A,1363534200,"[constructive algorithms, implementation]",PROGRAMMING
-283,Codeforces Round #174 (Div. 1),1,Cow Program,1000.0,B,1363534200,"[dfs and similar, dp, graphs]",PROGRAMMING
-283,Codeforces Round #174 (Div. 1),1,Coin Troubles,1500.0,C,1363534200,[dp],PROGRAMMING
-283,Codeforces Round #174 (Div. 1),1,Cows and Cool Sequences,2000.0,D,1363534200,"[dp, math, number theory]",PROGRAMMING
-283,Codeforces Round #174 (Div. 1),1,Cow Tennis Tournament,2500.0,E,1363534200,"[combinatorics, data structures, math]",PROGRAMMING
-284,Codeforces Round #174 (Div. 2),2,Cows and Primitive Roots,500.0,A,1363534200,"[implementation, math, number theory]",PROGRAMMING
-284,Codeforces Round #174 (Div. 2),2,Cows and Poker Game,1000.0,B,1363534200,"[brute force, implementation]",PROGRAMMING
-284,Codeforces Round #174 (Div. 2),2,Cows and Sequence,2000.0,C,1363534200,"[constructive algorithms, data structures, dp]",PROGRAMMING
-284,Codeforces Round #174 (Div. 2),2,Cow Program,2000.0,D,1363534200,"[dfs and similar, dp]",PROGRAMMING
-284,Codeforces Round #174 (Div. 2),2,Coin Troubles,2500.0,E,1363534200,"[dfs and similar, dp]",PROGRAMMING
-285,Codeforces Round #175 (Div. 2),2,Slightly Decreasing Permutations,500.0,A,1363879800,"[greedy, implementation]",PROGRAMMING
-285,Codeforces Round #175 (Div. 2),2,Find Marble,1000.0,B,1363879800,[implementation],PROGRAMMING
-285,Codeforces Round #175 (Div. 2),2,Building Permutation,1500.0,C,1363879800,"[greedy, implementation, sortings]",PROGRAMMING
-285,Codeforces Round #175 (Div. 2),2,Permutation Sum,2000.0,D,1363879800,"[bitmasks, combinatorics, dp, implementation, meet-in-the-middle]",PROGRAMMING
-285,Codeforces Round #175 (Div. 2),2,Positions in Permutations,2500.0,E,1363879800,"[combinatorics, dp, math]",PROGRAMMING
-286,Codeforces Round #176 (Div. 1),1,Lucky Permutation,500.0,A,1364025600,"[constructive algorithms, math]",PROGRAMMING
-286,Codeforces Round #176 (Div. 1),1,Shifting,1500.0,B,1364025600,[implementation],PROGRAMMING
-286,Codeforces Round #176 (Div. 1),1,Main Sequence,1500.0,C,1364025600,"[greedy, implementation]",PROGRAMMING
-286,Codeforces Round #176 (Div. 1),1,Tourists,2000.0,D,1364025600,"[data structures, sortings]",PROGRAMMING
-286,Codeforces Round #176 (Div. 1),1,Ladies' Shop,2500.0,E,1364025600,"[constructive algorithms, fft, math]",PROGRAMMING
-287,Codeforces Round #176 (Div. 2),2,IQ Test,500.0,A,1364025600,"[brute force, implementation]",PROGRAMMING
-287,Codeforces Round #176 (Div. 2),2,Pipeline,1500.0,B,1364025600,"[binary search, math]",PROGRAMMING
-287,Codeforces Round #176 (Div. 2),2,Lucky Permutation,1500.0,C,1364025600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
-287,Codeforces Round #176 (Div. 2),2,Shifting,2500.0,D,1364025600,[],PROGRAMMING
-287,Codeforces Round #176 (Div. 2),2,Main Sequence,2500.0,E,1364025600,"[data structures, greedy]",PROGRAMMING
-288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Strings,500.0,A,1364916600,[greedy],PROGRAMMING
-288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Houses ,1000.0,B,1364916600,[combinatorics],PROGRAMMING
-288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and XOR operation,1500.0,C,1364916600,"[implementation, math]",PROGRAMMING
-288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Trees ,2000.0,D,1364916600,"[combinatorics, dfs and similar, trees]",PROGRAMMING
-288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Lucky Numbers,2500.0,E,1364916600,"[dp, implementation, math]",PROGRAMMING
-289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Segments ,500.0,A,1364916600,"[brute force, implementation]",PROGRAMMING
-289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Matrix,1000.0,B,1364916600,"[brute force, dp, implementation, sortings, ternary search]",PROGRAMMING
-289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Strings,1500.0,C,1364916600,"[constructive algorithms, implementation]",PROGRAMMING
-289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Houses ,2000.0,D,1364916600,"[brute force, combinatorics, dfs and similar, math]",PROGRAMMING
-289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and XOR operation,2500.0,E,1364916600,"[data structures, greedy, implementation, math]",PROGRAMMING
-292,Croc Champ 2013 - Round 1,12,SMSC,1000.0,A,1366040100,[implementation],PROGRAMMING
-292,Croc Champ 2013 - Round 1,12,Network Topology,1000.0,B,1366040100,"[graphs, implementation]",PROGRAMMING
-292,Croc Champ 2013 - Round 1,12,Beautiful IP Addresses,1500.0,C,1366040100,[brute force],PROGRAMMING
-292,Croc Champ 2013 - Round 1,12,Connected Components,2000.0,D,1366040100,"[data structures, dfs and similar, dp, dsu]",PROGRAMMING
-292,Croc Champ 2013 - Round 1,12,Copying Data,2500.0,E,1366040100,[data structures],PROGRAMMING
-293,Croc Champ 2013 - Round 2,12,Weird Game,500.0,A,1366644900,"[games, greedy]",PROGRAMMING
-293,Croc Champ 2013 - Round 2,12,Distinct Paths,1500.0,B,1366644900,"[brute force, combinatorics]",PROGRAMMING
-293,Croc Champ 2013 - Round 2,12,Cube Problem,1500.0,C,1366644900,"[brute force, math, number theory]",PROGRAMMING
-293,Croc Champ 2013 - Round 2,12,Ksusha and Square,2000.0,D,1366644900,"[geometry, math, probabilities, two pointers]",PROGRAMMING
-293,Croc Champ 2013 - Round 2,12,Close Vertices,2500.0,E,1366644900,"[data structures, divide and conquer, trees]",PROGRAMMING
-294,Codeforces Round #178 (Div. 2),2,Shaass and Oskols,500.0,A,1365348600,"[implementation, math]",PROGRAMMING
-294,Codeforces Round #178 (Div. 2),2,Shaass and Bookshelf,1000.0,B,1365348600,"[dp, greedy]",PROGRAMMING
-294,Codeforces Round #178 (Div. 2),2,Shaass and Lights,1500.0,C,1365348600,"[combinatorics, number theory]",PROGRAMMING
-294,Codeforces Round #178 (Div. 2),2,Shaass and Painter Robot,2000.0,D,1365348600,"[brute force, implementation, number theory]",PROGRAMMING
-294,Codeforces Round #178 (Div. 2),2,Shaass the Great,2500.0,E,1365348600,"[dp, trees]",PROGRAMMING
-295,Codeforces Round #179 (Div. 1),1,Greg and Array,500.0,A,1365694200,"[data structures, implementation]",PROGRAMMING
-295,Codeforces Round #179 (Div. 1),1,Greg and Graph,1000.0,B,1365694200,"[dp, graphs, shortest paths]",PROGRAMMING
-295,Codeforces Round #179 (Div. 1),1,Greg and Friends,1500.0,C,1365694200,"[combinatorics, dp, graphs, shortest paths]",PROGRAMMING
-295,Codeforces Round #179 (Div. 1),1,Greg and Caves,2000.0,D,1365694200,"[combinatorics, dp]",PROGRAMMING
-295,Codeforces Round #179 (Div. 1),1,Yaroslav and Points,2500.0,E,1365694200,[data structures],PROGRAMMING
-296,Codeforces Round #179 (Div. 2),2,Yaroslav and Permutations,500.0,A,1365694200,"[greedy, math]",PROGRAMMING
-296,Codeforces Round #179 (Div. 2),2,Yaroslav and Two Strings,1500.0,B,1365694200,"[combinatorics, dp]",PROGRAMMING
-296,Codeforces Round #179 (Div. 2),2,Greg and Array,1500.0,C,1365694200,"[data structures, dp, implementation]",PROGRAMMING
-296,Codeforces Round #179 (Div. 2),2,Greg and Graph,2000.0,D,1365694200,"[dp, graphs]",PROGRAMMING
-296,Codeforces Round #179 (Div. 2),2,Greg and Friends,2500.0,E,1365694200,"[combinatorics, dfs and similar, dp]",PROGRAMMING
-297,Codeforces Round #180 (Div. 1),1,Parity Game,500.0,A,1366385400,[constructive algorithms],PROGRAMMING
-297,Codeforces Round #180 (Div. 1),1,Fish Weight,500.0,B,1366385400,"[constructive algorithms, greedy]",PROGRAMMING
-297,Codeforces Round #180 (Div. 1),1,Splitting the Uniqueness,2000.0,C,1366385400,[constructive algorithms],PROGRAMMING
-297,Codeforces Round #180 (Div. 1),1,Color the Carpet,2500.0,D,1366385400,[constructive algorithms],PROGRAMMING
-297,Codeforces Round #180 (Div. 1),1,Mystic Carvings,3000.0,E,1366385400,[data structures],PROGRAMMING
-298,Codeforces Round #180 (Div. 2),2,Snow Footprints,500.0,A,1366385400,"[greedy, implementation]",PROGRAMMING
-298,Codeforces Round #180 (Div. 2),2,Sail,500.0,B,1366385400,"[brute force, greedy, implementation]",PROGRAMMING
-298,Codeforces Round #180 (Div. 2),2,Parity Game,1500.0,C,1366385400,"[combinatorics, constructive algorithms, math, number theory]",PROGRAMMING
-298,Codeforces Round #180 (Div. 2),2,Fish Weight,1500.0,D,1366385400,"[greedy, math, sortings]",PROGRAMMING
-298,Codeforces Round #180 (Div. 2),2,Splitting the Uniqueness,3000.0,E,1366385400,"[constructive algorithms, sortings]",PROGRAMMING
-299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha and Array,500.0,A,1366644600,"[brute force, number theory, sortings]",PROGRAMMING
-299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha the Squirrel,1000.0,B,1366644600,"[brute force, implementation]",PROGRAMMING
-299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Weird Game,1500.0,C,1366644600,"[games, greedy]",PROGRAMMING
-299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Distinct Paths,2500.0,D,1366644600,[],PROGRAMMING
-299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Cube Problem,2500.0,E,1366644600,[],PROGRAMMING
-300,Codeforces Round #181 (Div. 2),2,Array,500.0,A,1366903800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
-300,Codeforces Round #181 (Div. 2),2,Coach,1000.0,B,1366903800,"[brute force, dfs and similar]",PROGRAMMING
-300,Codeforces Round #181 (Div. 2),2,Beautiful Numbers,2000.0,C,1366903800,"[brute force, combinatorics]",PROGRAMMING
-300,Codeforces Round #181 (Div. 2),2,Painting Square,3000.0,D,1366903800,"[dp, fft]",PROGRAMMING
-300,Codeforces Round #181 (Div. 2),2,Empire Strikes Back,3000.0,E,1366903800,"[binary search, math]",PROGRAMMING
-303,Codeforces Round #183 (Div. 1),1,Lucky Permutation Triple,500.0,A,1368363600,"[constructive algorithms, implementation, math]",PROGRAMMING
-303,Codeforces Round #183 (Div. 1),1,Rectangle Puzzle II,500.0,B,1368363600,"[implementation, math]",PROGRAMMING
-303,Codeforces Round #183 (Div. 1),1,Minimum Modular,2000.0,C,1368363600,"[brute force, math]",PROGRAMMING
-303,Codeforces Round #183 (Div. 1),1,Rotatable Number,2500.0,D,1368363600,"[math, number theory]",PROGRAMMING
-303,Codeforces Round #183 (Div. 1),1,Random Ranking,3000.0,E,1368363600,[dp],PROGRAMMING
-304,Codeforces Round #183 (Div. 2),2,Pythagorean Theorem II,500.0,A,1368363600,"[brute force, math]",PROGRAMMING
-304,Codeforces Round #183 (Div. 2),2,Calendar,1000.0,B,1368363600,"[brute force, implementation]",PROGRAMMING
-304,Codeforces Round #183 (Div. 2),2,Lucky Permutation Triple,1000.0,C,1368363600,[constructive algorithms],PROGRAMMING
-304,Codeforces Round #183 (Div. 2),2,Rectangle Puzzle II,2000.0,D,1368363600,"[math, ternary search]",PROGRAMMING
-304,Codeforces Round #183 (Div. 2),2,Minimum Modular,3000.0,E,1368363600,[math],PROGRAMMING
-305,Codeforces Round #184 (Div. 2),2,Strange Addition,500.0,A,1368968400,"[brute force, constructive algorithms]",PROGRAMMING
-305,Codeforces Round #184 (Div. 2),2,Continued Fractions,1000.0,B,1368968400,"[brute force, math]",PROGRAMMING
-305,Codeforces Round #184 (Div. 2),2,Ivan and Powers of Two,1500.0,C,1368968400,[],PROGRAMMING
-305,Codeforces Round #184 (Div. 2),2,Olya and Graph,2000.0,D,1368968400,"[combinatorics, math]",PROGRAMMING
-305,Codeforces Round #184 (Div. 2),2,Playing with String,2500.0,E,1368968400,[games],PROGRAMMING
-308,Croc Champ 2013 - Finals,12,Morning run,500.0,A,1368784800,[],PROGRAMMING
-308,Croc Champ 2013 - Finals,12,Context Advertising,500.0,B,1368784800,[],PROGRAMMING
-308,Croc Champ 2013 - Finals,12,Memory for Arrays,1000.0,C,1368784800,[],PROGRAMMING
-308,Croc Champ 2013 - Finals,12,Tennis Rackets,2000.0,D,1368784800,[],PROGRAMMING
-308,Croc Champ 2013 - Finals,12,Sheep,2500.0,E,1368784800,[],PROGRAMMING
-309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Morning run,500.0,A,1368803400,"[binary search, math, two pointers]",PROGRAMMING
-309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Context Advertising,500.0,B,1368803400,[two pointers],PROGRAMMING
-309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Memory for Arrays,1000.0,C,1368803400,"[binary search, bitmasks, greedy]",PROGRAMMING
-309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Tennis Rackets,2000.0,D,1368803400,"[brute force, geometry]",PROGRAMMING
-309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Sheep,2500.0,E,1368803400,"[binary search, greedy]",PROGRAMMING
-313,Codeforces Round #186 (Div. 2),2,Ilya and Bank Account,500.0,A,1369927800,"[implementation, number theory]",PROGRAMMING
-313,Codeforces Round #186 (Div. 2),2,Ilya and Queries,1000.0,B,1369927800,"[dp, implementation]",PROGRAMMING
-313,Codeforces Round #186 (Div. 2),2,Ilya and Matrix,1500.0,C,1369927800,"[constructive algorithms, greedy, implementation, sortings]",PROGRAMMING
-313,Codeforces Round #186 (Div. 2),2,Ilya and Roads,2500.0,D,1369927800,[dp],PROGRAMMING
-313,Codeforces Round #186 (Div. 2),2,Ilya and Two Numbers,2500.0,E,1369927800,"[constructive algorithms, data structures, dsu, greedy]",PROGRAMMING
-314,Codeforces Round #187 (Div. 1),1,Sereja and Contest,500.0,A,1370619000,[implementation],PROGRAMMING
-314,Codeforces Round #187 (Div. 1),1,Sereja and Periods,1000.0,B,1370619000,"[binary search, dfs and similar, strings]",PROGRAMMING
-314,Codeforces Round #187 (Div. 1),1,Sereja and Subsequences,1500.0,C,1370619000,"[data structures, dp]",PROGRAMMING
-314,Codeforces Round #187 (Div. 1),1,Sereja and Straight Lines,2000.0,D,1370619000,"[binary search, data structures, geometry, sortings, two pointers]",PROGRAMMING
-314,Codeforces Round #187 (Div. 1),1,Sereja and Squares,2500.0,E,1370619000,[dp],PROGRAMMING
-315,Codeforces Round #187 (Div. 2),2,Sereja and Bottles,500.0,A,1370619000,[brute force],PROGRAMMING
-315,Codeforces Round #187 (Div. 2),2,Sereja and Array,1000.0,B,1370619000,[implementation],PROGRAMMING
-315,Codeforces Round #187 (Div. 2),2,Sereja and Contest,1500.0,C,1370619000,"[dp, greedy, implementation]",PROGRAMMING
-315,Codeforces Round #187 (Div. 2),2,Sereja and Periods,2000.0,D,1370619000,"[dfs and similar, strings]",PROGRAMMING
-315,Codeforces Round #187 (Div. 2),2,Sereja and Subsequences,2500.0,E,1370619000,"[combinatorics, data structures]",PROGRAMMING
-316,ABBYY Cup 3.0,12,Special Task,30.0,A1,1371042000,[greedy],PROGRAMMING
-316,ABBYY Cup 3.0,12,Special Task,70.0,A2,1371042000,[math],PROGRAMMING
-316,ABBYY Cup 3.0,12,EKG,30.0,B1,1371042000,"[brute force, dfs and similar]",PROGRAMMING
-316,ABBYY Cup 3.0,12,EKG,70.0,B2,1371042000,"[dfs and similar, dp]",PROGRAMMING
-316,ABBYY Cup 3.0,12,Tidying Up,30.0,C1,1371042000,[flows],PROGRAMMING
-316,ABBYY Cup 3.0,12,Tidying Up,70.0,C2,1371042000,"[flows, graph matchings]",PROGRAMMING
-316,ABBYY Cup 3.0,12,PE Lesson,30.0,D1,1371042000,"[brute force, dp]",PROGRAMMING
-316,ABBYY Cup 3.0,12,PE Lesson,40.0,D2,1371042000,[dp],PROGRAMMING
-316,ABBYY Cup 3.0,12,PE Lesson,30.0,D3,1371042000,"[dp, math]",PROGRAMMING
-316,ABBYY Cup 3.0,12,Summer Homework,30.0,E1,1371042000,"[brute force, data structures]",PROGRAMMING
-316,ABBYY Cup 3.0,12,Summer Homework,40.0,E2,1371042000,"[data structures, math]",PROGRAMMING
-316,ABBYY Cup 3.0,12,Summer Homework,30.0,E3,1371042000,"[data structures, math]",PROGRAMMING
-316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F1,1371042000,"[dfs and similar, implementation]",PROGRAMMING
-316,ABBYY Cup 3.0,12,Suns and Rays,40.0,F2,1371042000,[],PROGRAMMING
-316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F3,1371042000,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING
-316,ABBYY Cup 3.0,12,Good Substrings,30.0,G1,1371042000,"[hashing, strings]",PROGRAMMING
-316,ABBYY Cup 3.0,12,Good Substrings,40.0,G2,1371042000,[string suffix structures],PROGRAMMING
-316,ABBYY Cup 3.0,12,Good Substrings,30.0,G3,1371042000,[string suffix structures],PROGRAMMING
-317,Codeforces Round #188 (Div. 1),1,Perfect Pair,500.0,A,1371223800,[brute force],PROGRAMMING
-317,Codeforces Round #188 (Div. 1),1,Ants,1000.0,B,1371223800,"[brute force, implementation]",PROGRAMMING
-317,Codeforces Round #188 (Div. 1),1,Balance,2500.0,C,1371223800,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING
-317,Codeforces Round #188 (Div. 1),1,Game with Powers,1500.0,D,1371223800,"[dp, games]",PROGRAMMING
-317,Codeforces Round #188 (Div. 1),1,Princess and Her Shadow,3000.0,E,1371223800,"[constructive algorithms, shortest paths]",PROGRAMMING
-318,Codeforces Round #188 (Div. 2),2,Even Odds,500.0,A,1371223800,[math],PROGRAMMING
-318,Codeforces Round #188 (Div. 2),2,Strings of Power,500.0,B,1371223800,"[implementation, strings, two pointers]",PROGRAMMING
-318,Codeforces Round #188 (Div. 2),2,Perfect Pair,1000.0,C,1371223800,"[greedy, math]",PROGRAMMING
-318,Codeforces Round #188 (Div. 2),2,Ants,2500.0,D,1371223800,[dfs and similar],PROGRAMMING
-318,Codeforces Round #188 (Div. 2),2,Balance,3000.0,E,1371223800,"[constructive algorithms, dfs and similar]",PROGRAMMING
-319,Codeforces Round #189 (Div. 1),1,Malek Dance Club,500.0,A,1371992400,"[combinatorics, math]",PROGRAMMING
-319,Codeforces Round #189 (Div. 1),1,Psychos in a Line,1000.0,B,1371992400,"[data structures, implementation]",PROGRAMMING
-319,Codeforces Round #189 (Div. 1),1,Kalila and Dimna in the Logging Industry,1500.0,C,1371992400,"[dp, geometry]",PROGRAMMING
-319,Codeforces Round #189 (Div. 1),1,Have You Ever Heard About the Word?,2500.0,D,1371992400,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING
-319,Codeforces Round #189 (Div. 1),1,Ping-Pong,2500.0,E,1371992400,[data structures],PROGRAMMING
-320,Codeforces Round #189 (Div. 2),2,Magic Numbers,500.0,A,1371992400,"[brute force, greedy]",PROGRAMMING
-320,Codeforces Round #189 (Div. 2),2,Ping-Pong (Easy Version),1000.0,B,1371992400,"[dfs and similar, graphs]",PROGRAMMING
-320,Codeforces Round #189 (Div. 2),2,Malek Dance Club,1500.0,C,1371992400,[math],PROGRAMMING
-320,Codeforces Round #189 (Div. 2),2,Psychos in a Line,2000.0,D,1371992400,[data structures],PROGRAMMING
-320,Codeforces Round #189 (Div. 2),2,Kalila and Dimna in the Logging Industry,2500.0,E,1371992400,[dp],PROGRAMMING
-321,Codeforces Round #190 (Div. 1),1,Ciel and Robot,500.0,A,1372433400,"[binary search, implementation, math]",PROGRAMMING
-321,Codeforces Round #190 (Div. 1),1,Ciel and Duel,1000.0,B,1372433400,"[dp, flows, greedy]",PROGRAMMING
-321,Codeforces Round #190 (Div. 1),1,Ciel the Commander,1500.0,C,1372433400,"[constructive algorithms, dfs and similar, divide and conquer, greedy, trees]",PROGRAMMING
-321,Codeforces Round #190 (Div. 1),1,Ciel and Flipboard,2000.0,D,1372433400,"[dp, greedy, math]",PROGRAMMING
-321,Codeforces Round #190 (Div. 1),1,Ciel and Gondolas,2500.0,E,1372433400,"[data structures, divide and conquer, dp]",PROGRAMMING
-322,Codeforces Round #190 (Div. 2),2,Ciel and Dancing,500.0,A,1372433400,[greedy],PROGRAMMING
-322,Codeforces Round #190 (Div. 2),2,Ciel and Flowers,1000.0,B,1372433400,"[combinatorics, math]",PROGRAMMING
-322,Codeforces Round #190 (Div. 2),2,Ciel and Robot,1500.0,C,1372433400,"[implementation, math, number theory]",PROGRAMMING
-322,Codeforces Round #190 (Div. 2),2,Ciel and Duel,2000.0,D,1372433400,"[dp, flows, greedy, two pointers]",PROGRAMMING
-322,Codeforces Round #190 (Div. 2),2,Ciel the Commander,2500.0,E,1372433400,[divide and conquer],PROGRAMMING
-324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,30.0,A1,1374043200,[],PROGRAMMING
-324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,70.0,A2,1374043200,[],PROGRAMMING
-324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,30.0,B1,1374043200,[],PROGRAMMING
-324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,70.0,B2,1374043200,[],PROGRAMMING
-324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C1,1374043200,[],PROGRAMMING
-324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C2,1374043200,[],PROGRAMMING
-324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,60.0,C3,1374043200,[],PROGRAMMING
-324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D1,1374043200,[],PROGRAMMING
-324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D2,1374043200,[],PROGRAMMING
-324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,40.0,D3,1374043200,[],PROGRAMMING
-324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E1,1374043200,[],PROGRAMMING
-324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E2,1374043200,[],PROGRAMMING
-325,MemSQL start[c]up Round 1,12,Square and Rectangles,500.0,A,1373734800,[implementation],PROGRAMMING
-325,MemSQL start[c]up Round 1,12,Stadium and Games,1000.0,B,1373734800,"[binary search, math]",PROGRAMMING
-325,MemSQL start[c]up Round 1,12,Monsters and Diamonds,2000.0,C,1373734800,"[dfs and similar, shortest paths]",PROGRAMMING
-325,MemSQL start[c]up Round 1,12,Reclamation,2000.0,D,1373734800,[dsu],PROGRAMMING
-325,MemSQL start[c]up Round 1,12,The Red Button,2500.0,E,1373734800,"[combinatorics, dfs and similar, dsu, greedy]",PROGRAMMING
-326,MemSQL start[c]up Round 2,12,Banana,500.0,A,1375549200,[],PROGRAMMING
-326,MemSQL start[c]up Round 2,12,Palindrome,1000.0,B,1375549200,[],PROGRAMMING
-326,MemSQL start[c]up Round 2,12,More Reclamation,1000.0,C,1375549200,[],PROGRAMMING
-326,MemSQL start[c]up Round 2,12,Rectangles and Square,2000.0,D,1375549200,[],PROGRAMMING
-326,MemSQL start[c]up Round 2,12,Counting Skyscrapers,2500.0,E,1375549200,[],PROGRAMMING
-326,MemSQL start[c]up Round 2,12,"Buy One, Get One Free",3000.0,F,1375549200,[],PROGRAMMING
-327,Codeforces Round #191 (Div. 2),2,Flipping Game,500.0,A,1372941000,"[brute force, dp, implementation]",PROGRAMMING
-327,Codeforces Round #191 (Div. 2),2,Hungry Sequence,500.0,B,1372941000,[math],PROGRAMMING
-327,Codeforces Round #191 (Div. 2),2,Magic Five,1500.0,C,1372941000,"[combinatorics, math]",PROGRAMMING
-327,Codeforces Round #191 (Div. 2),2,Block Tower,2000.0,D,1372941000,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
-327,Codeforces Round #191 (Div. 2),2,Axis Walking,3000.0,E,1372941000,"[bitmasks, combinatorics, constructive algorithms, dp, meet-in-the-middle]",PROGRAMMING
-329,Codeforces Round #192 (Div. 1),1,Purification,500.0,A,1374327000,"[constructive algorithms, greedy]",PROGRAMMING
-329,Codeforces Round #192 (Div. 1),1,Biridian Forest,1000.0,B,1374327000,"[dfs and similar, shortest paths]",PROGRAMMING
-329,Codeforces Round #192 (Div. 1),1,Graph Reconstruction,1500.0,C,1374327000,[constructive algorithms],PROGRAMMING
-329,Codeforces Round #192 (Div. 1),1,The Evil Temple and the Moving Rocks,1500.0,D,1374327000,[constructive algorithms],PROGRAMMING
-329,Codeforces Round #192 (Div. 1),1,Evil,2500.0,E,1374327000,[math],PROGRAMMING
-330,Codeforces Round #192 (Div. 2),2,Cakeminator,500.0,A,1374327000,"[brute force, implementation]",PROGRAMMING
-330,Codeforces Round #192 (Div. 2),2,Road Construction,1000.0,B,1374327000,"[constructive algorithms, graphs]",PROGRAMMING
-330,Codeforces Round #192 (Div. 2),2,Purification,1500.0,C,1374327000,[matrices],PROGRAMMING
-330,Codeforces Round #192 (Div. 2),2,Biridian Forest,2000.0,D,1374327000,"[dfs and similar, implementation, shortest paths]",PROGRAMMING
-330,Codeforces Round #192 (Div. 2),2,Graph Reconstruction,2500.0,E,1374327000,[],PROGRAMMING
-331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,30.0,A1,1374075000,"[brute force, implementation]",PROGRAMMING
-331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,70.0,A2,1374075000,"[data structures, sortings]",PROGRAMMING
-331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,30.0,B1,1374075000,[implementation],PROGRAMMING
-331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,70.0,B2,1374075000,[data structures],PROGRAMMING
-331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C1,1374075000,[dp],PROGRAMMING
-331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C2,1374075000,[dp],PROGRAMMING
-331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,60.0,C3,1374075000,[dp],PROGRAMMING
-331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D1,1374075000,"[dfs and similar, implementation]",PROGRAMMING
-331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D2,1374075000,[graphs],PROGRAMMING
-331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,40.0,D3,1374075000,"[data structures, implementation, trees]",PROGRAMMING
-331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E1,1374075000,"[constructive algorithms, graphs, implementation]",PROGRAMMING
-331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E2,1374075000,"[constructive algorithms, dp]",PROGRAMMING
-332,Codeforces Round #193 (Div. 2),2,Down the Hatch!,500.0,A,1374679800,[implementation],PROGRAMMING
-332,Codeforces Round #193 (Div. 2),2,Maximum Absurdity,1000.0,B,1374679800,"[data structures, dp, implementation]",PROGRAMMING
-332,Codeforces Round #193 (Div. 2),2,Students' Revenge,3000.0,C,1374679800,"[data structures, greedy, sortings]",PROGRAMMING
-332,Codeforces Round #193 (Div. 2),2,Theft of Blueprints,3000.0,D,1374679800,"[graphs, math]",PROGRAMMING
-332,Codeforces Round #193 (Div. 2),2,Binary Key,3000.0,E,1374679800,"[dp, greedy, implementation]",PROGRAMMING
-333,Codeforces Round #194 (Div. 1),1,Secrets,500.0,A,1374913800,[greedy],PROGRAMMING
-333,Codeforces Round #194 (Div. 1),1,Chips,1000.0,B,1374913800,[greedy],PROGRAMMING
-333,Codeforces Round #194 (Div. 1),1,Lucky Tickets,1500.0,C,1374913800,"[brute force, constructive algorithms]",PROGRAMMING
-333,Codeforces Round #194 (Div. 1),1,Characteristics of Rectangles,2000.0,D,1374913800,"[binary search, bitmasks, brute force, implementation, sortings]",PROGRAMMING
-333,Codeforces Round #194 (Div. 1),1,Summer Earnings,2500.0,E,1374913800,"[binary search, bitmasks, brute force, geometry, sortings]",PROGRAMMING
-334,Codeforces Round #194 (Div. 2),2,Candy Bags,500.0,A,1374913800,[implementation],PROGRAMMING
-334,Codeforces Round #194 (Div. 2),2,Eight Point Sets,1000.0,B,1374913800,[sortings],PROGRAMMING
-334,Codeforces Round #194 (Div. 2),2,Secrets,1500.0,C,1374913800,[math],PROGRAMMING
-334,Codeforces Round #194 (Div. 2),2,Chips,2000.0,D,1374913800,"[greedy, implementation, two pointers]",PROGRAMMING
-334,Codeforces Round #194 (Div. 2),2,Lucky Tickets,2500.0,E,1374913800,[],PROGRAMMING
-336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Triangle,500.0,A,1376062200,"[implementation, math]",PROGRAMMING
-336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Fly,1000.0,B,1376062200,[math],PROGRAMMING
-336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Sequence,1500.0,C,1376062200,"[brute force, greedy, implementation, number theory]",PROGRAMMING
-336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Beautiful Strings,2000.0,D,1376062200,"[combinatorics, math]",PROGRAMMING
-336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Painting Square,2500.0,E,1376062200,"[bitmasks, combinatorics, dp, implementation]",PROGRAMMING
-337,Codeforces Round #196 (Div. 2),2,Puzzles,500.0,A,1376668800,"[dp, graph matchings, greedy]",PROGRAMMING
-337,Codeforces Round #196 (Div. 2),2,Routine Problem,1000.0,B,1376668800,"[greedy, math, number theory]",PROGRAMMING
-337,Codeforces Round #196 (Div. 2),2,Quiz,1500.0,C,1376668800,"[binary search, greedy, math, matrices, number theory]",PROGRAMMING
-337,Codeforces Round #196 (Div. 2),2,Book of Evil,2000.0,D,1376668800,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING
-337,Codeforces Round #196 (Div. 2),2,Divisor Tree,2500.0,E,1376668800,"[brute force, number theory, trees]",PROGRAMMING
-338,Codeforces Round #196 (Div. 1),1,Quiz,500.0,A,1376668800,"[greedy, math, number theory]",PROGRAMMING
-338,Codeforces Round #196 (Div. 1),1,Book of Evil,1000.0,B,1376668800,"[dfs and similar, dp, trees]",PROGRAMMING
-338,Codeforces Round #196 (Div. 1),1,Divisor Tree,1500.0,C,1376668800,"[brute force, dp, number theory]",PROGRAMMING
-338,Codeforces Round #196 (Div. 1),1,GCD Table,2000.0,D,1376668800,"[chinese remainder theorem, math, number theory]",PROGRAMMING
-338,Codeforces Round #196 (Div. 1),1,Optimize!,2500.0,E,1376668800,[data structures],PROGRAMMING
-340,Codeforces Round #198 (Div. 2),2,The Wall,500.0,A,1377876600,[math],PROGRAMMING
-340,Codeforces Round #198 (Div. 2),2,Maximal Area Quadrilateral,3000.0,B,1377876600,"[brute force, geometry]",PROGRAMMING
-340,Codeforces Round #198 (Div. 2),2,Tourist Problem,2000.0,C,1377876600,"[combinatorics, implementation, math]",PROGRAMMING
-340,Codeforces Round #198 (Div. 2),2,Bubble Sort Graph,2000.0,D,1377876600,"[binary search, data structures, dp]",PROGRAMMING
-340,Codeforces Round #198 (Div. 2),2,Iahub and Permutations,3000.0,E,1377876600,"[combinatorics, math]",PROGRAMMING
-341,Codeforces Round #198 (Div. 1),1,Tourist Problem,500.0,A,1377876600,[math],PROGRAMMING
-341,Codeforces Round #198 (Div. 1),1,Bubble Sort Graph,500.0,B,1377876600,"[binary search, data structures, dp]",PROGRAMMING
-341,Codeforces Round #198 (Div. 1),1,Iahub and Permutations,1000.0,C,1377876600,"[combinatorics, dp, math]",PROGRAMMING
-341,Codeforces Round #198 (Div. 1),1,Iahub and Xors,2500.0,D,1377876600,[data structures],PROGRAMMING
-341,Codeforces Round #198 (Div. 1),1,Candies Game,3000.0,E,1377876600,"[constructive algorithms, greedy]",PROGRAMMING
-342,Codeforces Round #199 (Div. 2),2,Xenia and Divisors,500.0,A,1378540800,"[greedy, implementation]",PROGRAMMING
-342,Codeforces Round #199 (Div. 2),2,Xenia and Spies,1000.0,B,1378540800,"[brute force, greedy, implementation]",PROGRAMMING
-342,Codeforces Round #199 (Div. 2),2,Cupboard and Balloons,1500.0,C,1378540800,[geometry],PROGRAMMING
-342,Codeforces Round #199 (Div. 2),2,Xenia and Dominoes,2000.0,D,1378540800,"[bitmasks, dfs and similar, dp]",PROGRAMMING
-342,Codeforces Round #199 (Div. 2),2,Xenia and Tree,2500.0,E,1378540800,"[data structures, divide and conquer, trees]",PROGRAMMING
-343,Codeforces Round #200 (Div. 1),1,Rational Resistance,500.0,A,1379172600,"[math, number theory]",PROGRAMMING
-343,Codeforces Round #200 (Div. 1),1,Alternating Current,1000.0,B,1379172600,"[data structures, greedy, implementation]",PROGRAMMING
-343,Codeforces Round #200 (Div. 1),1,Read Time,1500.0,C,1379172600,"[binary search, greedy, two pointers]",PROGRAMMING
-343,Codeforces Round #200 (Div. 1),1,Water Tree,2000.0,D,1379172600,"[data structures, dfs and similar, trees]",PROGRAMMING
-343,Codeforces Round #200 (Div. 1),1,Pumping Stations,2500.0,E,1379172600,"[brute force, dfs and similar, divide and conquer, flows, greedy]",PROGRAMMING
-344,Codeforces Round #200 (Div. 2),2,Magnets,500.0,A,1379172600,[implementation],PROGRAMMING
-344,Codeforces Round #200 (Div. 2),2,Simple Molecules,1000.0,B,1379172600,"[brute force, math]",PROGRAMMING
-344,Codeforces Round #200 (Div. 2),2,Rational Resistance,1500.0,C,1379172600,[math],PROGRAMMING
-344,Codeforces Round #200 (Div. 2),2,Alternating Current,2000.0,D,1379172600,"[data structures, greedy, implementation]",PROGRAMMING
-344,Codeforces Round #200 (Div. 2),2,Read Time,2500.0,E,1379172600,"[binary search, two pointers]",PROGRAMMING
-346,Codeforces Round #201 (Div. 1),1,Alice and Bob,500.0,A,1379691000,"[games, math, number theory]",PROGRAMMING
-346,Codeforces Round #201 (Div. 1),1,Lucky Common Subsequence,1000.0,B,1379691000,"[dp, strings]",PROGRAMMING
-346,Codeforces Round #201 (Div. 1),1,Number Transformation II,1500.0,C,1379691000,"[greedy, math]",PROGRAMMING
-346,Codeforces Round #201 (Div. 1),1,Robot Control,2000.0,D,1379691000,[shortest paths],PROGRAMMING
-346,Codeforces Round #201 (Div. 1),1,Doodle Jump,2500.0,E,1379691000,[math],PROGRAMMING
-347,Codeforces Round #201 (Div. 2),2,Difference Row,500.0,A,1379691000,"[implementation, sortings]",PROGRAMMING
-347,Codeforces Round #201 (Div. 2),2,Fixed Points,1000.0,B,1379691000,"[implementation, math]",PROGRAMMING
-347,Codeforces Round #201 (Div. 2),2,Alice and Bob,1500.0,C,1379691000,"[games, math, number theory]",PROGRAMMING
-347,Codeforces Round #201 (Div. 2),2,Lucky Common Subsequence,2000.0,D,1379691000,"[dp, strings]",PROGRAMMING
-347,Codeforces Round #201 (Div. 2),2,Number Transformation II,2500.0,E,1379691000,"[dp, greedy, number theory]",PROGRAMMING
-348,Codeforces Round #202 (Div. 1),1,Mafia,500.0,A,1380295800,"[binary search, math, sortings]",PROGRAMMING
-348,Codeforces Round #202 (Div. 1),1,Apple Tree,1000.0,B,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING
-348,Codeforces Round #202 (Div. 1),1,Subset Sums,1500.0,C,1380295800,"[brute force, data structures]",PROGRAMMING
-348,Codeforces Round #202 (Div. 1),1,Turtles,2000.0,D,1380295800,"[dp, matrices]",PROGRAMMING
-348,Codeforces Round #202 (Div. 1),1,Pilgrims,2500.0,E,1380295800,"[dfs and similar, dp, trees]",PROGRAMMING
-349,Codeforces Round #202 (Div. 2),2,Cinema Line,500.0,A,1380295800,"[greedy, implementation]",PROGRAMMING
-349,Codeforces Round #202 (Div. 2),2,Color the Fence,1000.0,B,1380295800,"[data structures, dp, greedy]",PROGRAMMING
-349,Codeforces Round #202 (Div. 2),2,Mafia,1500.0,C,1380295800,[implementation],PROGRAMMING
-349,Codeforces Round #202 (Div. 2),2,Apple Tree,2000.0,D,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING
-349,Codeforces Round #202 (Div. 2),2,Subset Sums,2500.0,E,1380295800,[],PROGRAMMING
-350,Codeforces Round #203 (Div. 2),2,TL,500.0,A,1380641400,"[brute force, greedy, implementation]",PROGRAMMING
-350,Codeforces Round #203 (Div. 2),2,Resort,1000.0,B,1380641400,[brute force],PROGRAMMING
-350,Codeforces Round #203 (Div. 2),2,Bombs,1000.0,C,1380641400,"[greedy, implementation, sortings]",PROGRAMMING
-350,Codeforces Round #203 (Div. 2),2,Looking for Owls,3000.0,D,1380641400,"[binary search, geometry, hashing, sortings]",PROGRAMMING
-350,Codeforces Round #203 (Div. 2),2,Wrong Floyd,3000.0,E,1380641400,"[brute force, constructive algorithms, dfs and similar, graphs]",PROGRAMMING
-351,Codeforces Round #204 (Div. 1),1,Jeff and Rounding,1000.0,A,1380900600,"[dp, greedy, implementation, math]",PROGRAMMING
-351,Codeforces Round #204 (Div. 1),1,Jeff and Furik,1000.0,B,1380900600,"[combinatorics, dp, probabilities]",PROGRAMMING
-351,Codeforces Round #204 (Div. 1),1,Jeff and Brackets,1500.0,C,1380900600,"[dp, matrices]",PROGRAMMING
-351,Codeforces Round #204 (Div. 1),1,Jeff and Removing Periods,2000.0,D,1380900600,[data structures],PROGRAMMING
-351,Codeforces Round #204 (Div. 1),1,Jeff and Permutation,2000.0,E,1380900600,[greedy],PROGRAMMING
-352,Codeforces Round #204 (Div. 2),2,Jeff and Digits,500.0,A,1380900600,"[brute force, implementation, math]",PROGRAMMING
-352,Codeforces Round #204 (Div. 2),2,Jeff and Periods,1000.0,B,1380900600,"[implementation, sortings]",PROGRAMMING
-352,Codeforces Round #204 (Div. 2),2,Jeff and Rounding,1500.0,C,1380900600,"[dp, greedy, implementation]",PROGRAMMING
-352,Codeforces Round #204 (Div. 2),2,Jeff and Furik,2000.0,D,1380900600,[math],PROGRAMMING
-352,Codeforces Round #204 (Div. 2),2,Jeff and Brackets,2500.0,E,1380900600,[],PROGRAMMING
-353,Codeforces Round #205 (Div. 2),2,Domino,500.0,A,1381419000,"[implementation, math]",PROGRAMMING
-353,Codeforces Round #205 (Div. 2),2,Two Heaps,1500.0,B,1381419000,"[combinatorics, constructive algorithms, greedy, implementation, math, sortings]",PROGRAMMING
-353,Codeforces Round #205 (Div. 2),2,Find Maximum,1000.0,C,1381419000,"[implementation, math, number theory]",PROGRAMMING
-353,Codeforces Round #205 (Div. 2),2,Queue,2500.0,D,1381419000,[constructive algorithms],PROGRAMMING
-353,Codeforces Round #205 (Div. 2),2,Antichain,3000.0,E,1381419000,"[dp, graph matchings, greedy]",PROGRAMMING
-354,Codeforces Round #206 (Div. 1),1,Vasya and Robot,500.0,A,1381678200,"[brute force, greedy, math]",PROGRAMMING
-354,Codeforces Round #206 (Div. 1),1,Game with Strings,1000.0,B,1381678200,"[bitmasks, dp, games]",PROGRAMMING
-354,Codeforces Round #206 (Div. 1),1,Vasya and Beautiful Arrays,1500.0,C,1381678200,"[brute force, dp, number theory]",PROGRAMMING
-354,Codeforces Round #206 (Div. 1),1,Transferring Pyramid,2000.0,D,1381678200,[dp],PROGRAMMING
-354,Codeforces Round #206 (Div. 1),1,Lucky Number Representation,2500.0,E,1381678200,"[constructive algorithms, dfs and similar, dp]",PROGRAMMING
-355,Codeforces Round #206 (Div. 2),2,Vasya and Digital Root,500.0,A,1381678200,"[constructive algorithms, implementation]",PROGRAMMING
-355,Codeforces Round #206 (Div. 2),2,Vasya and Public Transport,1000.0,B,1381678200,"[greedy, implementation]",PROGRAMMING
-355,Codeforces Round #206 (Div. 2),2,Vasya and Robot,1500.0,C,1381678200,"[brute force, dp]",PROGRAMMING
-355,Codeforces Round #206 (Div. 2),2,Game with Strings,2000.0,D,1381678200,[],PROGRAMMING
-355,Codeforces Round #206 (Div. 2),2,Vasya and Beautiful Arrays,2500.0,E,1381678200,"[binary search, brute force, data structures]",PROGRAMMING
-356,Codeforces Round #207 (Div. 1),1,Knight Tournament,500.0,A,1381838400,"[data structures, dsu]",PROGRAMMING
-356,Codeforces Round #207 (Div. 1),1,Xenia and Hamming,1000.0,B,1381838400,"[implementation, math]",PROGRAMMING
-356,Codeforces Round #207 (Div. 1),1,Compartments,1500.0,C,1381838400,"[combinatorics, constructive algorithms, greedy, implementation]",PROGRAMMING
-356,Codeforces Round #207 (Div. 1),1,Bags and Coins,2000.0,D,1381838400,"[bitmasks, constructive algorithms, dp, greedy]",PROGRAMMING
-356,Codeforces Round #207 (Div. 1),1,Xenia and String Problem,2500.0,E,1381838400,"[dp, hashing, implementation, string suffix structures, strings]",PROGRAMMING
-357,Codeforces Round #207 (Div. 2),2,Group of Students,500.0,A,1381838400,"[brute force, greedy, implementation]",PROGRAMMING
-357,Codeforces Round #207 (Div. 2),2,Flag Day,1000.0,B,1381838400,"[constructive algorithms, implementation]",PROGRAMMING
-357,Codeforces Round #207 (Div. 2),2,Knight Tournament,1500.0,C,1381838400,[data structures],PROGRAMMING
-357,Codeforces Round #207 (Div. 2),2,Xenia and Hamming,2000.0,D,1381838400,[number theory],PROGRAMMING
-357,Codeforces Round #207 (Div. 2),2,Compartments,2500.0,E,1381838400,[],PROGRAMMING
-358,Codeforces Round #208 (Div. 2),2,Dima and Continuous Line,500.0,A,1382715000,"[brute force, implementation]",PROGRAMMING
-358,Codeforces Round #208 (Div. 2),2,Dima and Text Messages,1000.0,B,1382715000,"[brute force, strings]",PROGRAMMING
-358,Codeforces Round #208 (Div. 2),2,Dima and Containers,1500.0,C,1382715000,"[constructive algorithms, greedy, implementation]",PROGRAMMING
-358,Codeforces Round #208 (Div. 2),2,Dima and Hares,2000.0,D,1382715000,"[dp, greedy]",PROGRAMMING
-358,Codeforces Round #208 (Div. 2),2,Dima and Kicks,3000.0,E,1382715000,"[brute force, dsu, graphs, implementation]",PROGRAMMING
-359,Codeforces Round #209 (Div. 2),2,Table,500.0,A,1383379200,"[greedy, implementation]",PROGRAMMING
-359,Codeforces Round #209 (Div. 2),2,Permutation,1000.0,B,1383379200,"[constructive algorithms, dp, math]",PROGRAMMING
-359,Codeforces Round #209 (Div. 2),2,Prime Number,1500.0,C,1383379200,[math],PROGRAMMING
-359,Codeforces Round #209 (Div. 2),2,Pair of Numbers,2500.0,D,1383379200,"[binary search, brute force, data structures, math, two pointers]",PROGRAMMING
-359,Codeforces Round #209 (Div. 2),2,Neatness,2500.0,E,1383379200,[dfs and similar],PROGRAMMING
-360,Codeforces Round #210 (Div. 1),1,Levko and Array Recovery,500.0,A,1384102800,"[greedy, implementation]",PROGRAMMING
-360,Codeforces Round #210 (Div. 1),1,Levko and Array,1000.0,B,1384102800,"[binary search, dp]",PROGRAMMING
-360,Codeforces Round #210 (Div. 1),1,Levko and Strings,1500.0,C,1384102800,"[combinatorics, dp]",PROGRAMMING
-360,Codeforces Round #210 (Div. 1),1,Levko and Sets,1500.0,D,1384102800,[number theory],PROGRAMMING
-360,Codeforces Round #210 (Div. 1),1,Levko and Game,2000.0,E,1384102800,"[graphs, greedy, shortest paths]",PROGRAMMING
-361,Codeforces Round #210 (Div. 2),2,Levko and Table,500.0,A,1384102800,"[constructive algorithms, implementation]",PROGRAMMING
-361,Codeforces Round #210 (Div. 2),2,Levko and Permutation,1000.0,B,1384102800,"[constructive algorithms, math, number theory]",PROGRAMMING
-361,Codeforces Round #210 (Div. 2),2,Levko and Array Recovery,1500.0,C,1384102800,"[brute force, constructive algorithms, greedy]",PROGRAMMING
-361,Codeforces Round #210 (Div. 2),2,Levko and Array,2000.0,D,1384102800,"[binary search, dp]",PROGRAMMING
-361,Codeforces Round #210 (Div. 2),2,Levko and Strings,2500.0,E,1384102800,[],PROGRAMMING
-362,Codeforces Round #212 (Div. 2),2,Two Semiknights Meet,1000.0,A,1384443000,"[greedy, math]",PROGRAMMING
-362,Codeforces Round #212 (Div. 2),2,Petya and Staircases,500.0,B,1384443000,"[implementation, sortings]",PROGRAMMING
-362,Codeforces Round #212 (Div. 2),2,Insertion Sort,2500.0,C,1384443000,"[data structures, dp, implementation, math]",PROGRAMMING
-362,Codeforces Round #212 (Div. 2),2,Fools and Foolproof Roads,3000.0,D,1384443000,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING
-362,Codeforces Round #212 (Div. 2),2,Petya and Pipes,3000.0,E,1384443000,"[flows, graphs, shortest paths]",PROGRAMMING
-363,Codeforces Round #211 (Div. 2),2,Soroban,500.0,A,1384156800,[implementation],PROGRAMMING
-363,Codeforces Round #211 (Div. 2),2,Fence,1000.0,B,1384156800,"[brute force, dp]",PROGRAMMING
-363,Codeforces Round #211 (Div. 2),2,Fixing Typos,1500.0,C,1384156800,"[greedy, implementation]",PROGRAMMING
-363,Codeforces Round #211 (Div. 2),2,Renting Bikes,2000.0,D,1384156800,"[binary search, greedy]",PROGRAMMING
-363,Codeforces Round #211 (Div. 2),2,Two Circles,2500.0,E,1384156800,"[brute force, data structures, implementation]",PROGRAMMING
-364,Codeforces Round #213 (Div. 1),1,Matrix,500.0,A,1384875000,"[combinatorics, data structures, implementation]",PROGRAMMING
-364,Codeforces Round #213 (Div. 1),1,Free Market,1000.0,B,1384875000,"[dp, greedy]",PROGRAMMING
-364,Codeforces Round #213 (Div. 1),1,Beautiful Set,1500.0,C,1384875000,"[brute force, number theory]",PROGRAMMING
-364,Codeforces Round #213 (Div. 1),1,Ghd,2000.0,D,1384875000,"[brute force, math, probabilities]",PROGRAMMING
-364,Codeforces Round #213 (Div. 1),1,Empty Rectangles,2500.0,E,1384875000,"[divide and conquer, two pointers]",PROGRAMMING
-365,Codeforces Round #213 (Div. 2),2,Good Number,500.0,A,1384875000,[implementation],PROGRAMMING
-365,Codeforces Round #213 (Div. 2),2,The Fibonacci Segment,1000.0,B,1384875000,[implementation],PROGRAMMING
-365,Codeforces Round #213 (Div. 2),2,Matrix,1500.0,C,1384875000,"[brute force, combinatorics, math, matrices]",PROGRAMMING
-365,Codeforces Round #213 (Div. 2),2,Free Market,2000.0,D,1384875000,"[dp, greedy]",PROGRAMMING
-365,Codeforces Round #213 (Div. 2),2,Beautiful Set,2500.0,E,1384875000,"[brute force, number theory]",PROGRAMMING
-366,Codeforces Round #214 (Div. 2),2,Dima and Guards,500.0,A,1385307000,[implementation],PROGRAMMING
-366,Codeforces Round #214 (Div. 2),2,Dima and To-do List,1000.0,B,1385307000,"[brute force, implementation]",PROGRAMMING
-366,Codeforces Round #214 (Div. 2),2,Dima and Salad,1500.0,C,1385307000,[dp],PROGRAMMING
-366,Codeforces Round #214 (Div. 2),2,Dima and Trap Graph,2000.0,D,1385307000,"[binary search, data structures, dfs and similar, dsu, shortest paths, two pointers]",PROGRAMMING
-366,Codeforces Round #214 (Div. 2),2,Dima and Magic Guitar,2500.0,E,1385307000,"[brute force, implementation, math]",PROGRAMMING
-367,Codeforces Round #215 (Div. 1),1,Sereja and Algorithm ,500.0,A,1385479800,"[data structures, implementation]",PROGRAMMING
-367,Codeforces Round #215 (Div. 1),1,Sereja ans Anagrams,1000.0,B,1385479800,"[binary search, data structures]",PROGRAMMING
-367,Codeforces Round #215 (Div. 1),1,Sereja and the Arrangement of Numbers,1500.0,C,1385479800,"[graphs, greedy, sortings]",PROGRAMMING
-367,Codeforces Round #215 (Div. 1),1,Sereja and Sets,2000.0,D,1385479800,"[bitmasks, dfs and similar]",PROGRAMMING
-367,Codeforces Round #215 (Div. 1),1,Sereja and Intervals,2000.0,E,1385479800,"[combinatorics, dp]",PROGRAMMING
-368,Codeforces Round #215 (Div. 2),2,Sereja and Coat Rack,500.0,A,1385479800,[implementation],PROGRAMMING
-368,Codeforces Round #215 (Div. 2),2,Sereja and Suffixes,1000.0,B,1385479800,"[data structures, dp]",PROGRAMMING
-368,Codeforces Round #215 (Div. 2),2,Sereja and Algorithm ,1500.0,C,1385479800,"[brute force, implementation]",PROGRAMMING
-368,Codeforces Round #215 (Div. 2),2,Sereja ans Anagrams,2000.0,D,1385479800,"[data structures, two pointers]",PROGRAMMING
-368,Codeforces Round #215 (Div. 2),2,Sereja and the Arrangement of Numbers,2500.0,E,1385479800,"[combinatorics, graphs, implementation]",PROGRAMMING
-369,Codeforces Round #216 (Div. 2),2,Valera and Plates,500.0,A,1385739000,[implementation],PROGRAMMING
-369,Codeforces Round #216 (Div. 2),2,Valera and Contest,1000.0,B,1385739000,"[constructive algorithms, implementation, math]",PROGRAMMING
-369,Codeforces Round #216 (Div. 2),2,Valera and Elections,1500.0,C,1385739000,"[dfs and similar, graphs, trees]",PROGRAMMING
-369,Codeforces Round #216 (Div. 2),2,Valera and Fools,2000.0,D,1385739000,"[dfs and similar, dp, shortest paths]",PROGRAMMING
-369,Codeforces Round #216 (Div. 2),2,Valera and Queries,2500.0,E,1385739000,"[binary search, data structures]",PROGRAMMING
-370,Codeforces Round #217 (Div. 2),2,"Rook, Bishop and King",500.0,A,1386399600,[math],PROGRAMMING
-370,Codeforces Round #217 (Div. 2),2,Berland Bingo,500.0,B,1386399600,[implementation],PROGRAMMING
-370,Codeforces Round #217 (Div. 2),2,Mittens,1500.0,C,1386399600,"[constructive algorithms, greedy, sortings]",PROGRAMMING
-370,Codeforces Round #217 (Div. 2),2,Broken Monitor,3000.0,D,1386399600,"[brute force, constructive algorithms, implementation]",PROGRAMMING
-370,Codeforces Round #217 (Div. 2),2,Summer Reading,3000.0,E,1386399600,"[dp, greedy]",PROGRAMMING
-371,Codeforces Round #218 (Div. 2),2,K-Periodic Array,500.0,A,1386493200,"[implementation, math]",PROGRAMMING
-371,Codeforces Round #218 (Div. 2),2,Fox Dividing Cheese,1000.0,B,1386493200,"[math, number theory]",PROGRAMMING
-371,Codeforces Round #218 (Div. 2),2,Hamburgers,1500.0,C,1386493200,"[binary search, brute force]",PROGRAMMING
-371,Codeforces Round #218 (Div. 2),2,Vessels,2000.0,D,1386493200,"[data structures, dsu, implementation, trees]",PROGRAMMING
-371,Codeforces Round #218 (Div. 2),2,Subway Innovation,2500.0,E,1386493200,"[math, two pointers]",PROGRAMMING
-372,Codeforces Round #219 (Div. 1),1,Counting Kangaroos is Fun,500.0,A,1386943200,"[binary search, greedy, sortings, two pointers]",PROGRAMMING
-372,Codeforces Round #219 (Div. 1),1,Counting Rectangles is Fun,1000.0,B,1386943200,"[brute force, divide and conquer, dp]",PROGRAMMING
-372,Codeforces Round #219 (Div. 1),1,Watching Fireworks is Fun,1500.0,C,1386943200,"[data structures, dp, math]",PROGRAMMING
-372,Codeforces Round #219 (Div. 1),1,Choosing Subtree is Fun,2000.0,D,1386943200,"[binary search, data structures, dfs and similar, trees, two pointers]",PROGRAMMING
-372,Codeforces Round #219 (Div. 1),1,Drawing Circles is Fun,2500.0,E,1386943200,"[combinatorics, geometry]",PROGRAMMING
-373,Codeforces Round #219 (Div. 2),2,Collecting Beats is Fun,500.0,A,1386943200,[implementation],PROGRAMMING
-373,Codeforces Round #219 (Div. 2),2,Making Sequences is Fun,1000.0,B,1386943200,"[binary search, implementation, math]",PROGRAMMING
-373,Codeforces Round #219 (Div. 2),2,Counting Kangaroos is Fun,1500.0,C,1386943200,"[greedy, sortings, two pointers]",PROGRAMMING
-373,Codeforces Round #219 (Div. 2),2,Counting Rectangles is Fun,2000.0,D,1386943200,[],PROGRAMMING
-373,Codeforces Round #219 (Div. 2),2,Watching Fireworks is Fun,2500.0,E,1386943200,[dp],PROGRAMMING
-375,Codeforces Round #221 (Div. 1),1,Divisible by Seven,500.0,A,1387893600,"[math, number theory]",PROGRAMMING
-375,Codeforces Round #221 (Div. 1),1,Maximum Submatrix 2,1000.0,B,1387893600,"[data structures, dp, implementation, sortings]",PROGRAMMING
-375,Codeforces Round #221 (Div. 1),1,Circling Round Treasures,1500.0,C,1387893600,"[bitmasks, shortest paths]",PROGRAMMING
-375,Codeforces Round #221 (Div. 1),1,Tree and Queries,2000.0,D,1387893600,"[data structures, dfs and similar, trees]",PROGRAMMING
-375,Codeforces Round #221 (Div. 1),1,Red and Black Tree,2500.0,E,1387893600,"[dp, implementation, math]",PROGRAMMING
-376,Codeforces Round #221 (Div. 2),2,Lever,500.0,A,1387893600,"[implementation, math]",PROGRAMMING
-376,Codeforces Round #221 (Div. 2),2,I.O.U.,1000.0,B,1387893600,[implementation],PROGRAMMING
-376,Codeforces Round #221 (Div. 2),2,Divisible by Seven,1500.0,C,1387893600,"[math, number theory]",PROGRAMMING
-376,Codeforces Round #221 (Div. 2),2,Maximum Submatrix 2,2000.0,D,1387893600,"[dp, implementation, sortings]",PROGRAMMING
-376,Codeforces Round #221 (Div. 2),2,Circling Round Treasures,2500.0,E,1387893600,"[bitmasks, shortest paths]",PROGRAMMING
-377,Codeforces Round #222 (Div. 1),1,Maze,500.0,A,1388331000,[dfs and similar],PROGRAMMING
-377,Codeforces Round #222 (Div. 1),1,Preparing for the Contest,1000.0,B,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING
-377,Codeforces Round #222 (Div. 1),1,Captains Mode,1000.0,C,1388331000,"[bitmasks, dp, games]",PROGRAMMING
-377,Codeforces Round #222 (Div. 1),1,Developing Game,2000.0,D,1388331000,[data structures],PROGRAMMING
-377,Codeforces Round #222 (Div. 1),1,Cookie Clicker,2500.0,E,1388331000,"[dp, geometry]",PROGRAMMING
-378,Codeforces Round #222 (Div. 2),2,Playing with Dice,500.0,A,1388331000,[brute force],PROGRAMMING
-378,Codeforces Round #222 (Div. 2),2,Semifinals,1000.0,B,1388331000,"[implementation, sortings]",PROGRAMMING
-378,Codeforces Round #222 (Div. 2),2,Maze,1500.0,C,1388331000,[dfs and similar],PROGRAMMING
-378,Codeforces Round #222 (Div. 2),2,Preparing for the Contest,2000.0,D,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING
-378,Codeforces Round #222 (Div. 2),2,Captains Mode,2000.0,E,1388331000,"[bitmasks, brute force, dp, greedy]",PROGRAMMING
-379,Good Bye 2013,12,New Year Candles,500.0,A,1388417400,[implementation],PROGRAMMING
-379,Good Bye 2013,12,New Year Present,1000.0,B,1388417400,"[constructive algorithms, implementation]",PROGRAMMING
-379,Good Bye 2013,12,New Year Ratings Change,1500.0,C,1388417400,"[greedy, sortings]",PROGRAMMING
-379,Good Bye 2013,12,New Year Letter,2000.0,D,1388417400,"[bitmasks, brute force, dp]",PROGRAMMING
-379,Good Bye 2013,12,New Year Tree Decorations,2500.0,E,1388417400,"[geometry, schedules, sortings]",PROGRAMMING
-379,Good Bye 2013,12,New Year Tree,3000.0,F,1388417400,"[data structures, divide and conquer, trees]",PROGRAMMING
-379,Good Bye 2013,12,New Year Cactus,3500.0,G,1388417400,[dp],PROGRAMMING
-380,Codeforces Round #223 (Div. 1),1,Sereja and Prefixes,500.0,A,1389540600,"[binary search, brute force]",PROGRAMMING
-380,Codeforces Round #223 (Div. 1),1,Sereja and Tree,1000.0,B,1389540600,"[graphs, implementation]",PROGRAMMING
-380,Codeforces Round #223 (Div. 1),1,Sereja and Brackets,1500.0,C,1389540600,"[data structures, schedules]",PROGRAMMING
-380,Codeforces Round #223 (Div. 1),1,Sereja and Cinema,2000.0,D,1389540600,"[combinatorics, math]",PROGRAMMING
-380,Codeforces Round #223 (Div. 1),1,Sereja and Dividing,2500.0,E,1389540600,[data structures],PROGRAMMING
-381,Codeforces Round #223 (Div. 2),2,Sereja and Dima,500.0,A,1389540600,"[greedy, implementation, two pointers]",PROGRAMMING
-381,Codeforces Round #223 (Div. 2),2,Sereja and Stairs,1000.0,B,1389540600,"[greedy, implementation, sortings]",PROGRAMMING
-381,Codeforces Round #223 (Div. 2),2,Sereja and Prefixes,1500.0,C,1389540600,"[binary search, implementation, two pointers]",PROGRAMMING
-381,Codeforces Round #223 (Div. 2),2,Sereja and Tree,2000.0,D,1389540600,[brute force],PROGRAMMING
-381,Codeforces Round #223 (Div. 2),2,Sereja and Brackets,2500.0,E,1389540600,[data structures],PROGRAMMING
-382,Codeforces Round #224 (Div. 2),2,Ksenia and Pan Scales,500.0,A,1389972600,"[greedy, implementation]",PROGRAMMING
-382,Codeforces Round #224 (Div. 2),2,Number Busters,2500.0,B,1389972600,"[binary search, math]",PROGRAMMING
-382,Codeforces Round #224 (Div. 2),2,Arithmetic Progression,1500.0,C,1389972600,"[implementation, sortings]",PROGRAMMING
-382,Codeforces Round #224 (Div. 2),2,Ksenia and Pawns,3000.0,D,1389972600,"[dfs and similar, graphs, implementation, trees]",PROGRAMMING
-382,Codeforces Round #224 (Div. 2),2,Ksenia and Combinatorics,3000.0,E,1389972600,"[combinatorics, dp]",PROGRAMMING
-383,Codeforces Round #225 (Div. 1),1,Milking cows,500.0,A,1390231800,"[data structures, greedy]",PROGRAMMING
-383,Codeforces Round #225 (Div. 1),1,Volcanoes,1500.0,B,1390231800,"[binary search, implementation, sortings, two pointers]",PROGRAMMING
-383,Codeforces Round #225 (Div. 1),1,Propagating tree,1500.0,C,1390231800,"[data structures, dfs and similar, trees]",PROGRAMMING
-383,Codeforces Round #225 (Div. 1),1,Antimatter,2000.0,D,1390231800,[dp],PROGRAMMING
-383,Codeforces Round #225 (Div. 1),1,Vowels,2500.0,E,1390231800,"[combinatorics, divide and conquer, dp]",PROGRAMMING
-384,Codeforces Round #225 (Div. 2),2,Coder,500.0,A,1390231800,[implementation],PROGRAMMING
-384,Codeforces Round #225 (Div. 2),2,Multitasking,1000.0,B,1390231800,"[greedy, implementation, sortings, two pointers]",PROGRAMMING
-384,Codeforces Round #225 (Div. 2),2,Milking cows,1500.0,C,1390231800,[greedy],PROGRAMMING
-384,Codeforces Round #225 (Div. 2),2,Volcanoes,2500.0,D,1390231800,[implementation],PROGRAMMING
-384,Codeforces Round #225 (Div. 2),2,Propagating tree,2500.0,E,1390231800,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
-385,Codeforces Round #226 (Div. 2),2,Bear and Raspberry,500.0,A,1390577700,"[brute force, greedy, implementation]",PROGRAMMING
-385,Codeforces Round #226 (Div. 2),2,Bear and Strings,1000.0,B,1390577700,"[brute force, greedy, implementation, math, strings]",PROGRAMMING
-385,Codeforces Round #226 (Div. 2),2,Bear and Prime Numbers,1500.0,C,1390577700,"[binary search, brute force, data structures, dp, implementation, math, number theory]",PROGRAMMING
-385,Codeforces Round #226 (Div. 2),2,Bear and Floodlight,2000.0,D,1390577700,"[bitmasks, dp, geometry]",PROGRAMMING
-385,Codeforces Round #226 (Div. 2),2,Bear in the Field,2500.0,E,1390577700,"[math, matrices]",PROGRAMMING
-387,Codeforces Round #227 (Div. 2),2,George and Sleep,500.0,A,1391095800,[implementation],PROGRAMMING
-387,Codeforces Round #227 (Div. 2),2,George and Round,1000.0,B,1391095800,"[brute force, greedy, two pointers]",PROGRAMMING
-387,Codeforces Round #227 (Div. 2),2,George and Number,1500.0,C,1391095800,"[greedy, implementation]",PROGRAMMING
-387,Codeforces Round #227 (Div. 2),2,George and Interesting Graph,2000.0,D,1391095800,[graph matchings],PROGRAMMING
-387,Codeforces Round #227 (Div. 2),2,George and Cards,2500.0,E,1391095800,"[binary search, data structures]",PROGRAMMING
-388,Codeforces Round #228 (Div. 1),1,Fox and Box Accumulation,500.0,A,1391442000,"[greedy, sortings]",PROGRAMMING
-388,Codeforces Round #228 (Div. 1),1,Fox and Minimal path,1000.0,B,1391442000,"[bitmasks, constructive algorithms, graphs, implementation, math]",PROGRAMMING
-388,Codeforces Round #228 (Div. 1),1,Fox and Card Game,1500.0,C,1391442000,"[games, greedy, sortings]",PROGRAMMING
-388,Codeforces Round #228 (Div. 1),1,Fox and Perfect Sets,2000.0,D,1391442000,[math],PROGRAMMING
-388,Codeforces Round #228 (Div. 1),1,Fox and Meteor Shower,2500.0,E,1391442000,[geometry],PROGRAMMING
-389,Codeforces Round #228 (Div. 2),2,Fox and Number Game,500.0,A,1391442000,"[greedy, math]",PROGRAMMING
-389,Codeforces Round #228 (Div. 2),2,Fox and Cross,1000.0,B,1391442000,"[greedy, implementation]",PROGRAMMING
-389,Codeforces Round #228 (Div. 2),2,Fox and Box Accumulation,1500.0,C,1391442000,"[binary search, dp, greedy]",PROGRAMMING
-389,Codeforces Round #228 (Div. 2),2,Fox and Minimal path,2000.0,D,1391442000,"[constructive algorithms, graphs, implementation, shortest paths]",PROGRAMMING
-389,Codeforces Round #228 (Div. 2),2,Fox and Card Game,2500.0,E,1391442000,"[greedy, implementation]",PROGRAMMING
-400,Codeforces Round #234 (Div. 2),2,Inna and Choose Options,500.0,A,1394033400,"[dp, implementation]",PROGRAMMING
-400,Codeforces Round #234 (Div. 2),2,Inna and New Matrix of Candies,1000.0,B,1394033400,"[brute force, implementation, schedules]",PROGRAMMING
-400,Codeforces Round #234 (Div. 2),2,Inna and Huge Candy Matrix,1500.0,C,1394033400,"[implementation, math]",PROGRAMMING
-400,Codeforces Round #234 (Div. 2),2,Dima and Bacteria,2000.0,D,1394033400,"[dsu, graphs, shortest paths]",PROGRAMMING
-400,Codeforces Round #234 (Div. 2),2,Inna and Binary Logic,2500.0,E,1394033400,"[binary search, bitmasks, data structures]",PROGRAMMING
-401,Codeforces Round #235 (Div. 2),2,Vanya and Cards,500.0,A,1394465400,"[implementation, math]",PROGRAMMING
-401,Codeforces Round #235 (Div. 2),2,Sereja and Contests,1000.0,B,1394465400,"[greedy, implementation, math]",PROGRAMMING
-401,Codeforces Round #235 (Div. 2),2,Team,1500.0,C,1394465400,"[constructive algorithms, greedy, implementation]",PROGRAMMING
-401,Codeforces Round #235 (Div. 2),2,Roman and Numbers,2000.0,D,1394465400,"[bitmasks, brute force, combinatorics, dp, number theory]",PROGRAMMING
-401,Codeforces Round #235 (Div. 2),2,Olympic Games,2500.0,E,1394465400,[math],PROGRAMMING
-402,Codeforces Round #236 (Div. 2),2,Nuts,500.0,A,1394983800,"[greedy, math]",PROGRAMMING
-402,Codeforces Round #236 (Div. 2),2,Trees in a Row,1000.0,B,1394983800,[brute force],PROGRAMMING
-402,Codeforces Round #236 (Div. 2),2,Searching for Graph,1500.0,C,1394983800,"[brute force, constructive algorithms]",PROGRAMMING
-402,Codeforces Round #236 (Div. 2),2,Upgrading Array,2000.0,D,1394983800,"[dp, greedy, math]",PROGRAMMING
-402,Codeforces Round #236 (Div. 2),2,Strictly Positive Matrix,2500.0,E,1394983800,[graphs],PROGRAMMING
-403,Codeforces Round #236 (Div. 1),1,Searching for Graph,500.0,A,1394983800,"[constructive algorithms, graphs]",PROGRAMMING
-403,Codeforces Round #236 (Div. 1),1,Upgrading Array,1000.0,B,1394983800,"[dp, greedy, number theory]",PROGRAMMING
-403,Codeforces Round #236 (Div. 1),1,Strictly Positive Matrix,1500.0,C,1394983800,[graphs],PROGRAMMING
-403,Codeforces Round #236 (Div. 1),1,Beautiful Pairs of Numbers,1500.0,D,1394983800,"[combinatorics, dp]",PROGRAMMING
-403,Codeforces Round #236 (Div. 1),1,Two Rooted Trees,2000.0,E,1394983800,"[data structures, implementation]",PROGRAMMING
-404,Codeforces Round #237 (Div. 2),2,Valera and X,500.0,A,1395243000,[implementation],PROGRAMMING
-404,Codeforces Round #237 (Div. 2),2,Marathon,1000.0,B,1395243000,"[implementation, math]",PROGRAMMING
-404,Codeforces Round #237 (Div. 2),2,Restore Graph,1500.0,C,1395243000,"[dfs and similar, graphs, sortings]",PROGRAMMING
-404,Codeforces Round #237 (Div. 2),2,Minesweeper 1D,2000.0,D,1395243000,"[dp, implementation]",PROGRAMMING
-404,Codeforces Round #237 (Div. 2),2,Maze 1D,2500.0,E,1395243000,"[binary search, greedy, implementation]",PROGRAMMING
-405,Codeforces Round #238 (Div. 2),2,Gravity Flip,500.0,A,1395502200,"[greedy, implementation, sortings]",PROGRAMMING
-405,Codeforces Round #238 (Div. 2),2,Domino Effect,1000.0,B,1395502200,[],PROGRAMMING
-405,Codeforces Round #238 (Div. 2),2,Unusual Product,1500.0,C,1395502200,"[implementation, math]",PROGRAMMING
-405,Codeforces Round #238 (Div. 2),2,Toy Sum,2000.0,D,1395502200,"[greedy, implementation, math]",PROGRAMMING
-405,Codeforces Round #238 (Div. 2),2,Graph Cutting,3000.0,E,1395502200,[dfs and similar],PROGRAMMING
-406,Codeforces Round #238 (Div. 1),1,Unusual Product,500.0,A,1395502200,"[implementation, math]",PROGRAMMING
-406,Codeforces Round #238 (Div. 1),1,Toy Sum,1000.0,B,1395502200,"[constructive algorithms, greedy]",PROGRAMMING
-406,Codeforces Round #238 (Div. 1),1,Graph Cutting,2000.0,C,1395502200,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
-406,Codeforces Round #238 (Div. 1),1,Hill Climbing,2000.0,D,1395502200,"[dfs and similar, geometry, trees]",PROGRAMMING
-406,Codeforces Round #238 (Div. 1),1,Hamming Triples,2500.0,E,1395502200,"[implementation, math]",PROGRAMMING
-407,Codeforces Round #239 (Div. 1),1,Triangle,500.0,A,1396162800,"[brute force, implementation, math]",PROGRAMMING
-407,Codeforces Round #239 (Div. 1),1,Long Path,1000.0,B,1396162800,"[dp, implementation]",PROGRAMMING
-407,Codeforces Round #239 (Div. 1),1,Curious Array,2000.0,C,1396162800,"[brute force, implementation, math]",PROGRAMMING
-407,Codeforces Round #239 (Div. 1),1,Largest Submatrix 3,2000.0,D,1396162800,"[dp, hashing]",PROGRAMMING
-407,Codeforces Round #239 (Div. 1),1,k-d-sequence,2500.0,E,1396162800,[data structures],PROGRAMMING
-408,Codeforces Round #239 (Div. 2),2,Line to Cashier,500.0,A,1396162800,[implementation],PROGRAMMING
-408,Codeforces Round #239 (Div. 2),2,Garland,1000.0,B,1396162800,[implementation],PROGRAMMING
-408,Codeforces Round #239 (Div. 2),2,Triangle,1500.0,C,1396162800,"[geometry, math]",PROGRAMMING
-408,Codeforces Round #239 (Div. 2),2,Long Path,2000.0,D,1396162800,[dp],PROGRAMMING
-408,Codeforces Round #239 (Div. 2),2,Curious Array,3000.0,E,1396162800,[],PROGRAMMING
-412,Coder-Strike 2014 - Round 1,12,Poster,500.0,A,1397837400,"[greedy, implementation]",PROGRAMMING
-412,Coder-Strike 2014 - Round 1,12,Network Configuration,1000.0,B,1397837400,"[greedy, sortings]",PROGRAMMING
-412,Coder-Strike 2014 - Round 1,12,Pattern,1500.0,C,1397837400,"[implementation, strings]",PROGRAMMING
-412,Coder-Strike 2014 - Round 1,12,Giving Awards,2000.0,D,1397837400,[dfs and similar],PROGRAMMING
-412,Coder-Strike 2014 - Round 1,12,E-mail Addresses,2500.0,E,1397837400,[implementation],PROGRAMMING
-413,Coder-Strike 2014 - Round 2,12,Data Recovery,500.0,A,1397977200,[implementation],PROGRAMMING
-413,Coder-Strike 2014 - Round 2,12,Spyke Chatting,1000.0,B,1397977200,[implementation],PROGRAMMING
-413,Coder-Strike 2014 - Round 2,12,Jeopardy!,1500.0,C,1397977200,"[greedy, math]",PROGRAMMING
-413,Coder-Strike 2014 - Round 2,12,2048,2000.0,D,1397977200,"[bitmasks, dp]",PROGRAMMING
-413,Coder-Strike 2014 - Round 2,12,Maze 2D,2500.0,E,1397977200,"[data structures, divide and conquer]",PROGRAMMING
-414,Codeforces Round #240 (Div. 1),1,Mashmokh and Numbers,500.0,A,1396798800,"[constructive algorithms, number theory]",PROGRAMMING
-414,Codeforces Round #240 (Div. 1),1,Mashmokh and ACM,1000.0,B,1396798800,"[combinatorics, dp]",PROGRAMMING
-414,Codeforces Round #240 (Div. 1),1,Mashmokh and Reverse Operation,1500.0,C,1396798800,"[combinatorics, divide and conquer]",PROGRAMMING
-414,Codeforces Round #240 (Div. 1),1,Mashmokh and Water Tanks,1500.0,D,1396798800,"[binary search, data structures, greedy, two pointers]",PROGRAMMING
-414,Codeforces Round #240 (Div. 1),1,Mashmokh's Designed Problem,2500.0,E,1396798800,[data structures],PROGRAMMING
-415,Codeforces Round #240 (Div. 2),2,Mashmokh and Lights,500.0,A,1396798800,[implementation],PROGRAMMING
-415,Codeforces Round #240 (Div. 2),2,Mashmokh and Tokens,1000.0,B,1396798800,"[binary search, greedy, math]",PROGRAMMING
-415,Codeforces Round #240 (Div. 2),2,Mashmokh and Numbers,1500.0,C,1396798800,"[constructive algorithms, greedy, number theory]",PROGRAMMING
-415,Codeforces Round #240 (Div. 2),2,Mashmokh and ACM,2000.0,D,1396798800,"[combinatorics, dp, number theory]",PROGRAMMING
-415,Codeforces Round #240 (Div. 2),2,Mashmokh and Reverse Operation,2500.0,E,1396798800,"[divide and conquer, sortings]",PROGRAMMING
-416,Codeforces Round #241 (Div. 2),2,Guess a number!,500.0,A,1397376000,"[greedy, implementation, two pointers]",PROGRAMMING
-416,Codeforces Round #241 (Div. 2),2,Art Union,1000.0,B,1397376000,"[brute force, dp, implementation]",PROGRAMMING
-416,Codeforces Round #241 (Div. 2),2,Booking System,1500.0,C,1397376000,"[binary search, dp, greedy, implementation]",PROGRAMMING
-416,Codeforces Round #241 (Div. 2),2,Population Size,2000.0,D,1397376000,"[greedy, implementation]",PROGRAMMING
-416,Codeforces Round #241 (Div. 2),2,President's Path,2500.0,E,1397376000,"[dp, graphs, shortest paths]",PROGRAMMING
-417,RCC 2014 Warmup (Div. 2),2,Elimination,500.0,A,1397749200,"[dp, implementation, math]",PROGRAMMING
-417,RCC 2014 Warmup (Div. 2),2,Crash,1000.0,B,1397749200,[implementation],PROGRAMMING
-417,RCC 2014 Warmup (Div. 2),2,Football,1500.0,C,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING
-417,RCC 2014 Warmup (Div. 2),2,Cunning Gena,2000.0,D,1397749200,"[bitmasks, dp, greedy, sortings]",PROGRAMMING
-417,RCC 2014 Warmup (Div. 2),2,Square Table,2500.0,E,1397749200,"[constructive algorithms, math, probabilities]",PROGRAMMING
-418,RCC 2014 Warmup (Div. 1),1,Football,500.0,A,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING
-418,RCC 2014 Warmup (Div. 1),1,Cunning Gena,1000.0,B,1397749200,"[bitmasks, dp, sortings]",PROGRAMMING
-418,RCC 2014 Warmup (Div. 1),1,Square Table,1500.0,C,1397749200,"[constructive algorithms, dp, math]",PROGRAMMING
-418,RCC 2014 Warmup (Div. 1),1,Big Problems for Organizers,2500.0,D,1397749200,"[data structures, graphs, trees]",PROGRAMMING
-418,RCC 2014 Warmup (Div. 1),1,Tricky Password,2500.0,E,1397749200,[data structures],PROGRAMMING
-419,Coder-Strike 2014 - Finals,12,Start Up,500.0,A,1398169200,[],PROGRAMMING
-419,Coder-Strike 2014 - Finals,12,Online Meeting,1500.0,B,1398169200,[],PROGRAMMING
-419,Coder-Strike 2014 - Finals,12,Bug in Code,1500.0,C,1398169200,[],PROGRAMMING
-419,Coder-Strike 2014 - Finals,12,Cup Trick,1500.0,D,1398169200,[],PROGRAMMING
-419,Coder-Strike 2014 - Finals,12,Playing the ball,2000.0,E,1398169200,[],PROGRAMMING
-420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Start Up,500.0,A,1398169140,[implementation],PROGRAMMING
-420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Online Meeting,1500.0,B,1398169140,[implementation],PROGRAMMING
-420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Bug in Code,1500.0,C,1398169140,"[data structures, graphs, implementation, two pointers]",PROGRAMMING
-420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Cup Trick,1500.0,D,1398169140,[data structures],PROGRAMMING
-420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Playing the ball,2000.0,E,1398169140,[geometry],PROGRAMMING
-421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Pasha and Hamsters,500.0,A,1398168900,"[constructive algorithms, implementation]",PROGRAMMING
-421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Start Up,1000.0,B,1398168900,[implementation],PROGRAMMING
-421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Online Meeting,2000.0,C,1398168900,[implementation],PROGRAMMING
-421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Bug in Code,2000.0,D,1398168900,"[binary search, data structures, sortings]",PROGRAMMING
-421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Cup Trick,2000.0,E,1398168900,[data structures],PROGRAMMING
-424,Codeforces Round #242 (Div. 2),2,Squats,500.0,A,1398409200,[implementation],PROGRAMMING
-424,Codeforces Round #242 (Div. 2),2,Megacity,1000.0,B,1398409200,"[binary search, greedy, implementation, sortings]",PROGRAMMING
-424,Codeforces Round #242 (Div. 2),2,Magic Formulas,1500.0,C,1398409200,[math],PROGRAMMING
-424,Codeforces Round #242 (Div. 2),2,Biathlon Track,2500.0,D,1398409200,"[binary search, brute force, constructive algorithms, data structures, dp]",PROGRAMMING
-424,Codeforces Round #242 (Div. 2),2,Colored Jenga,3000.0,E,1398409200,"[dfs and similar, dp, probabilities]",PROGRAMMING
-425,Codeforces Round #243 (Div. 1),1,Sereja and Swaps,500.0,A,1398612600,"[brute force, sortings]",PROGRAMMING
-425,Codeforces Round #243 (Div. 1),1,Sereja and Table ,1000.0,B,1398612600,"[bitmasks, greedy]",PROGRAMMING
-425,Codeforces Round #243 (Div. 1),1,Sereja and Two Sequences,1500.0,C,1398612600,"[data structures, dp]",PROGRAMMING
-425,Codeforces Round #243 (Div. 1),1,Sereja and Squares,2000.0,D,1398612600,"[binary search, data structures, hashing]",PROGRAMMING
-425,Codeforces Round #243 (Div. 1),1,Sereja and Sets,2000.0,E,1398612600,[dp],PROGRAMMING
-426,Codeforces Round #243 (Div. 2),2,Sereja and Mugs,500.0,A,1398612600,[implementation],PROGRAMMING
-426,Codeforces Round #243 (Div. 2),2,Sereja and Mirroring,1000.0,B,1398612600,[implementation],PROGRAMMING
-426,Codeforces Round #243 (Div. 2),2,Sereja and Swaps,1500.0,C,1398612600,"[brute force, sortings, two pointers]",PROGRAMMING
-426,Codeforces Round #243 (Div. 2),2,Sereja and Table ,2000.0,D,1398612600,[],PROGRAMMING
-426,Codeforces Round #243 (Div. 2),2,Sereja and Two Sequences,2500.0,E,1398612600,[],PROGRAMMING
-427,Codeforces Round #244 (Div. 2),2,Police Recruits,500.0,A,1399044600,[implementation],PROGRAMMING
-427,Codeforces Round #244 (Div. 2),2,Prison Transfer,1000.0,B,1399044600,"[data structures, implementation]",PROGRAMMING
-427,Codeforces Round #244 (Div. 2),2,Checkposts,1500.0,C,1399044600,"[dfs and similar, graphs, two pointers]",PROGRAMMING
-427,Codeforces Round #244 (Div. 2),2,Match & Catch,2000.0,D,1399044600,"[dp, string suffix structures, strings]",PROGRAMMING
-427,Codeforces Round #244 (Div. 2),2,Police Patrol,2500.0,E,1399044600,"[greedy, implementation, math, ternary search]",PROGRAMMING
-429,Codeforces Round #245 (Div. 1),1,Xor-tree,500.0,A,1399822800,"[dfs and similar, trees]",PROGRAMMING
-429,Codeforces Round #245 (Div. 1),1,Working out,1000.0,B,1399822800,[dp],PROGRAMMING
-429,Codeforces Round #245 (Div. 1),1,Guess the Tree,1500.0,C,1399822800,"[bitmasks, constructive algorithms, dp, greedy, trees]",PROGRAMMING
-429,Codeforces Round #245 (Div. 1),1,Tricky Function,2000.0,D,1399822800,"[data structures, divide and conquer, geometry]",PROGRAMMING
-429,Codeforces Round #245 (Div. 1),1,Points and Segments,2000.0,E,1399822800,[graphs],PROGRAMMING
-430,Codeforces Round #245 (Div. 2),2,Points and Segments (easy),500.0,A,1399822800,"[constructive algorithms, sortings]",PROGRAMMING
-430,Codeforces Round #245 (Div. 2),2,Balls Game,1000.0,B,1399822800,"[brute force, two pointers]",PROGRAMMING
-430,Codeforces Round #245 (Div. 2),2,Xor-tree,1500.0,C,1399822800,"[brute force, data structures, dfs and similar, trees]",PROGRAMMING
-430,Codeforces Round #245 (Div. 2),2,Working out,2000.0,D,1399822800,"[brute force, dp]",PROGRAMMING
-430,Codeforces Round #245 (Div. 2),2,Guess the Tree,2500.0,E,1399822800,"[constructive algorithms, data structures, dfs and similar]",PROGRAMMING
-431,Codeforces Round #247 (Div. 2),2,Black Square,500.0,A,1400686200,[implementation],PROGRAMMING
-431,Codeforces Round #247 (Div. 2),2,Shower Line,1500.0,B,1400686200,"[brute force, implementation]",PROGRAMMING
-431,Codeforces Round #247 (Div. 2),2,k-Tree,1500.0,C,1400686200,"[dp, implementation, trees]",PROGRAMMING
-431,Codeforces Round #247 (Div. 2),2,Random Task,2000.0,D,1400686200,"[binary search, bitmasks, combinatorics, dp, math]",PROGRAMMING
-431,Codeforces Round #247 (Div. 2),2,Chemistry Experiment,2500.0,E,1400686200,"[binary search, data structures, ternary search]",PROGRAMMING
-432,Codeforces Round #246 (Div. 2),2,Choosing Teams,500.0,A,1400167800,"[greedy, implementation, sortings]",PROGRAMMING
-432,Codeforces Round #246 (Div. 2),2,Football Kit,1000.0,B,1400167800,"[brute force, greedy, implementation]",PROGRAMMING
-432,Codeforces Round #246 (Div. 2),2,Prime Swaps,1500.0,C,1400167800,"[greedy, sortings]",PROGRAMMING
-432,Codeforces Round #246 (Div. 2),2,Prefixes and Suffixes,2000.0,D,1400167800,"[dp, string suffix structures, strings, two pointers]",PROGRAMMING
-432,Codeforces Round #246 (Div. 2),2,Square Tiling,2500.0,E,1400167800,"[constructive algorithms, greedy]",PROGRAMMING
-433,Codeforces Round #248 (Div. 2),2,Kitahara Haruki's Gift,500.0,A,1400914800,"[brute force, implementation]",PROGRAMMING
-433,Codeforces Round #248 (Div. 2),2,Kuriyama Mirai's Stones,1500.0,B,1400914800,"[dp, implementation, sortings]",PROGRAMMING
-433,Codeforces Round #248 (Div. 2),2,Ryouko's Memory Note,1500.0,C,1400914800,"[implementation, math, sortings]",PROGRAMMING
-433,Codeforces Round #248 (Div. 2),2,Nanami's Digital Board,2000.0,D,1400914800,"[dsu, implementation]",PROGRAMMING
-433,Codeforces Round #248 (Div. 2),2,Tachibana Kanade's Tofu,2500.0,E,1400914800,[dp],PROGRAMMING
-434,Codeforces Round #248 (Div. 1),1,Ryouko's Memory Note,500.0,A,1400914800,"[math, sortings]",PROGRAMMING
-434,Codeforces Round #248 (Div. 1),1,Nanami's Digital Board,1000.0,B,1400914800,"[divide and conquer, dp, dsu, implementation, two pointers]",PROGRAMMING
-434,Codeforces Round #248 (Div. 1),1,Tachibana Kanade's Tofu,1500.0,C,1400914800,[dp],PROGRAMMING
-434,Codeforces Round #248 (Div. 1),1,Nanami's Power Plant,2000.0,D,1400914800,[flows],PROGRAMMING
-434,Codeforces Round #248 (Div. 1),1,Furukawa Nagisa's Tree,3000.0,E,1400914800,"[binary search, divide and conquer, sortings, trees]",PROGRAMMING
-435,Codeforces Round #249 (Div. 2),2,Queue on Bus Stop,500.0,A,1401463800,[implementation],PROGRAMMING
-435,Codeforces Round #249 (Div. 2),2,Pasha Maximizes,1000.0,B,1401463800,[greedy],PROGRAMMING
-435,Codeforces Round #249 (Div. 2),2,Cardiogram,1500.0,C,1401463800,[implementation],PROGRAMMING
-435,Codeforces Round #249 (Div. 2),2,Special Grid,2000.0,D,1401463800,"[brute force, dp, greedy]",PROGRAMMING
-435,Codeforces Round #249 (Div. 2),2,Special Graph,2500.0,E,1401463800,[],PROGRAMMING
-436,Zepto Code Rush 2014,12,Feed with Candy,1000.0,A,1402673400,[greedy],PROGRAMMING
-436,Zepto Code Rush 2014,12,Om Nom and Spiders,1000.0,B,1402673400,"[implementation, math]",PROGRAMMING
-436,Zepto Code Rush 2014,12,Dungeons and Candies,1500.0,C,1402673400,"[dsu, graphs, greedy, trees]",PROGRAMMING
-436,Zepto Code Rush 2014,12,Pudding Monsters,2500.0,D,1402673400,[dp],PROGRAMMING
-436,Zepto Code Rush 2014,12,Cardboard Box,2500.0,E,1402673400,"[data structures, greedy]",PROGRAMMING
-436,Zepto Code Rush 2014,12,Banners,3000.0,F,1402673400,"[brute force, data structures, dp]",PROGRAMMING
-437,Codeforces Round #250 (Div. 2),2,The Child and Homework,500.0,A,1401627600,[implementation],PROGRAMMING
-437,Codeforces Round #250 (Div. 2),2,The Child and Set,1500.0,B,1401627600,"[bitmasks, greedy, implementation, sortings]",PROGRAMMING
-437,Codeforces Round #250 (Div. 2),2,The Child and Toy,1500.0,C,1401627600,"[graphs, greedy, sortings]",PROGRAMMING
-437,Codeforces Round #250 (Div. 2),2,The Child and Zoo,2000.0,D,1401627600,"[dsu, sortings]",PROGRAMMING
-437,Codeforces Round #250 (Div. 2),2,The Child and Polygon,2500.0,E,1401627600,[],PROGRAMMING
-438,Codeforces Round #250 (Div. 1),1,The Child and Toy,500.0,A,1401627600,[greedy],PROGRAMMING
-438,Codeforces Round #250 (Div. 1),1,The Child and Zoo,1000.0,B,1401627600,"[dp, dsu, sortings]",PROGRAMMING
-438,Codeforces Round #250 (Div. 1),1,The Child and Polygon,1500.0,C,1401627600,"[dp, geometry]",PROGRAMMING
-438,Codeforces Round #250 (Div. 1),1,The Child and Sequence,2000.0,D,1401627600,[data structures],PROGRAMMING
-438,Codeforces Round #250 (Div. 1),1,The Child and Binary Tree,3000.0,E,1401627600,"[combinatorics, divide and conquer, fft, number theory]",PROGRAMMING
-439,Codeforces Round #251 (Div. 2),2,"Devu, the Singer and Churu, the Joker",500.0,A,1401895800,"[greedy, implementation]",PROGRAMMING
-439,Codeforces Round #251 (Div. 2),2,"Devu, the Dumb Guy",1000.0,B,1401895800,"[implementation, sortings]",PROGRAMMING
-439,Codeforces Round #251 (Div. 2),2,Devu and Partitioning of the Array,1500.0,C,1401895800,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING
-439,Codeforces Round #251 (Div. 2),2,Devu and his Brother,2000.0,D,1401895800,"[binary search, sortings, ternary search, two pointers]",PROGRAMMING
-439,Codeforces Round #251 (Div. 2),2,Devu and Birthday Celebration,2500.0,E,1401895800,"[combinatorics, dp, math]",PROGRAMMING
-441,Codeforces Round #252 (Div. 2),2,Valera and Antique Items,500.0,A,1402241400,[implementation],PROGRAMMING
-441,Codeforces Round #252 (Div. 2),2,Valera and Fruits,1000.0,B,1402241400,"[greedy, implementation]",PROGRAMMING
-441,Codeforces Round #252 (Div. 2),2,Valera and Tubes ,1500.0,C,1402241400,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING
-441,Codeforces Round #252 (Div. 2),2,Valera and Swaps,2000.0,D,1402241400,"[constructive algorithms, dsu, graphs, implementation, string suffix structures]",PROGRAMMING
-441,Codeforces Round #252 (Div. 2),2,Valera and Number,2500.0,E,1402241400,"[bitmasks, dp]",PROGRAMMING
-442,Codeforces Round #253 (Div. 1),1,Borya and Hanabi,500.0,A,1403191800,"[bitmasks, brute force, implementation]",PROGRAMMING
-442,Codeforces Round #253 (Div. 1),1,Andrey and Problem,1500.0,B,1403191800,"[greedy, math, probabilities]",PROGRAMMING
-442,Codeforces Round #253 (Div. 1),1,Artem and Array ,1500.0,C,1403191800,"[data structures, greedy]",PROGRAMMING
-442,Codeforces Round #253 (Div. 1),1,Adam and Tree,2000.0,D,1403191800,"[data structures, trees]",PROGRAMMING
-442,Codeforces Round #253 (Div. 1),1,Gena and Second Distance,2500.0,E,1403191800,[geometry],PROGRAMMING
-443,Codeforces Round #253 (Div. 2),2,Anton and Letters,500.0,A,1403191800,"[constructive algorithms, implementation]",PROGRAMMING
-443,Codeforces Round #253 (Div. 2),2,Kolya and Tandem Repeat,1000.0,B,1403191800,[brute force],PROGRAMMING
-443,Codeforces Round #253 (Div. 2),2,Borya and Hanabi,1500.0,C,1403191800,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING
-443,Codeforces Round #253 (Div. 2),2,Andrey and Problem,2500.0,D,1403191800,"[dp, greedy, math, probabilities, sortings]",PROGRAMMING
-443,Codeforces Round #253 (Div. 2),2,Artem and Array ,2500.0,E,1403191800,[],PROGRAMMING
-444,Codeforces Round #254 (Div. 1),1,DZY Loves Physics,500.0,A,1404651900,"[greedy, math]",PROGRAMMING
-444,Codeforces Round #254 (Div. 1),1,DZY Loves FFT,1000.0,B,1404651900,[probabilities],PROGRAMMING
-444,Codeforces Round #254 (Div. 1),1,DZY Loves Colors,2000.0,C,1404651900,[data structures],PROGRAMMING
-444,Codeforces Round #254 (Div. 1),1,DZY Loves Strings,2000.0,D,1404651900,"[binary search, hashing, strings, two pointers]",PROGRAMMING
-444,Codeforces Round #254 (Div. 1),1,DZY Loves Planting,2500.0,E,1404651900,"[binary search, dsu, trees]",PROGRAMMING
-445,Codeforces Round #254 (Div. 2),2,DZY Loves Chessboard,500.0,A,1404651900,"[dfs and similar, implementation]",PROGRAMMING
-445,Codeforces Round #254 (Div. 2),2,DZY Loves Chemistry,1000.0,B,1404651900,"[dfs and similar, dsu, greedy]",PROGRAMMING
-445,Codeforces Round #254 (Div. 2),2,DZY Loves Physics,1500.0,C,1404651900,"[graphs, greedy]",PROGRAMMING
-445,Codeforces Round #254 (Div. 2),2,DZY Loves FFT,2000.0,D,1404651900,[probabilities],PROGRAMMING
-445,Codeforces Round #254 (Div. 2),2,DZY Loves Colors,3000.0,E,1404651900,[data structures],PROGRAMMING
-446,Codeforces Round #FF (Div. 1),1,DZY Loves Sequences,500.0,A,1405256400,"[dp, implementation, two pointers]",PROGRAMMING
-446,Codeforces Round #FF (Div. 1),1,DZY Loves Modification,1500.0,B,1405256400,"[brute force, greedy]",PROGRAMMING
-446,Codeforces Round #FF (Div. 1),1,DZY Loves Fibonacci Numbers,1500.0,C,1405256400,"[data structures, number theory]",PROGRAMMING
-446,Codeforces Round #FF (Div. 1),1,DZY Loves Games,2000.0,D,1405256400,"[math, matrices, probabilities]",PROGRAMMING
-446,Codeforces Round #FF (Div. 1),1,DZY Loves Bridges,2500.0,E,1405256400,"[math, matrices]",PROGRAMMING
-447,Codeforces Round #FF (Div. 2),2,DZY Loves Hash,500.0,A,1405256400,[implementation],PROGRAMMING
-447,Codeforces Round #FF (Div. 2),2,DZY Loves Strings,1000.0,B,1405256400,"[greedy, implementation]",PROGRAMMING
-447,Codeforces Round #FF (Div. 2),2,DZY Loves Sequences,1500.0,C,1405256400,[dp],PROGRAMMING
-447,Codeforces Round #FF (Div. 2),2,DZY Loves Modification,2500.0,D,1405256400,"[data structures, greedy]",PROGRAMMING
-447,Codeforces Round #FF (Div. 2),2,DZY Loves Fibonacci Numbers,2500.0,E,1405256400,[data structures],PROGRAMMING
-448,Codeforces Round #256 (Div. 2),2,Rewards,500.0,A,1405605600,[implementation],PROGRAMMING
-448,Codeforces Round #256 (Div. 2),2,Suffix Structures,1000.0,B,1405605600,"[implementation, strings]",PROGRAMMING
-448,Codeforces Round #256 (Div. 2),2,Painting Fence,2500.0,C,1405605600,"[divide and conquer, dp, greedy]",PROGRAMMING
-448,Codeforces Round #256 (Div. 2),2,Multiplication Table,2000.0,D,1405605600,"[binary search, brute force]",PROGRAMMING
-448,Codeforces Round #256 (Div. 2),2,Divisors,3000.0,E,1405605600,"[brute force, dfs and similar, implementation, number theory]",PROGRAMMING
-449,Codeforces Round #257 (Div. 1),1,Jzzhu and Chocolate,500.0,A,1405774800,[math],PROGRAMMING
-449,Codeforces Round #257 (Div. 1),1,Jzzhu and Cities,1000.0,B,1405774800,"[graphs, shortest paths]",PROGRAMMING
-449,Codeforces Round #257 (Div. 1),1,Jzzhu and Apples,1500.0,C,1405774800,"[constructive algorithms, number theory]",PROGRAMMING
-449,Codeforces Round #257 (Div. 1),1,Jzzhu and Numbers,2000.0,D,1405774800,"[bitmasks, combinatorics, dp]",PROGRAMMING
-449,Codeforces Round #257 (Div. 1),1,Jzzhu and Squares,2500.0,E,1405774800,"[dp, math, number theory]",PROGRAMMING
-450,Codeforces Round #257 (Div. 2),2,Jzzhu and Children,500.0,A,1405774800,[implementation],PROGRAMMING
-450,Codeforces Round #257 (Div. 2),2,Jzzhu and Sequences,1000.0,B,1405774800,"[implementation, math]",PROGRAMMING
-450,Codeforces Round #257 (Div. 2),2,Jzzhu and Chocolate,1500.0,C,1405774800,"[greedy, implementation]",PROGRAMMING
-450,Codeforces Round #257 (Div. 2),2,Jzzhu and Cities,2000.0,D,1405774800,"[graphs, shortest paths]",PROGRAMMING
-450,Codeforces Round #257 (Div. 2),2,Jzzhu and Apples,2500.0,E,1405774800,"[constructive algorithms, number theory]",PROGRAMMING
-451,Codeforces Round #258 (Div. 2),2,Game With Sticks,500.0,A,1406215800,[implementation],PROGRAMMING
-451,Codeforces Round #258 (Div. 2),2,Sort the Array,1000.0,B,1406215800,"[implementation, sortings]",PROGRAMMING
-451,Codeforces Round #258 (Div. 2),2,Predict Outcome of the Game,1500.0,C,1406215800,"[brute force, implementation, math]",PROGRAMMING
-451,Codeforces Round #258 (Div. 2),2,Count Good Substrings,2500.0,D,1406215800,[math],PROGRAMMING
-451,Codeforces Round #258 (Div. 2),2,Devu and Flowers,3000.0,E,1406215800,"[bitmasks, combinatorics, number theory]",PROGRAMMING
-452,MemSQL Start[c]UP 2.0 - Round 1,12,Eevee,500.0,A,1406480400,"[implementation, strings]",PROGRAMMING
-452,MemSQL Start[c]UP 2.0 - Round 1,12,4-point polyline,1000.0,B,1406480400,"[brute force, constructive algorithms, geometry, trees]",PROGRAMMING
-452,MemSQL Start[c]UP 2.0 - Round 1,12,Magic Trick,1000.0,C,1406480400,"[combinatorics, math, probabilities]",PROGRAMMING
-452,MemSQL Start[c]UP 2.0 - Round 1,12,"Washer, Dryer, Folder",1500.0,D,1406480400,"[greedy, implementation]",PROGRAMMING
-452,MemSQL Start[c]UP 2.0 - Round 1,12,Three strings,2500.0,E,1406480400,"[data structures, dsu, string suffix structures, strings]",PROGRAMMING
-452,MemSQL Start[c]UP 2.0 - Round 1,12,Permutation,2500.0,F,1406480400,"[data structures, divide and conquer, hashing]",PROGRAMMING
-453,Codeforces Round #259 (Div. 1),1,Little Pony and Expected Maximum,500.0,A,1406907000,[probabilities],PROGRAMMING
-453,Codeforces Round #259 (Div. 1),1,Little Pony and Harmony Chest,1000.0,B,1406907000,"[bitmasks, brute force, dp]",PROGRAMMING
-453,Codeforces Round #259 (Div. 1),1,Little Pony and Summer Sun Celebration,1500.0,C,1406907000,"[constructive algorithms, dfs and similar]",PROGRAMMING
-453,Codeforces Round #259 (Div. 1),1,Little Pony and Elements of Harmony,2500.0,D,1406907000,"[dp, matrices]",PROGRAMMING
-453,Codeforces Round #259 (Div. 1),1,Little Pony and Lord Tirek,2500.0,E,1406907000,[data structures],PROGRAMMING
-454,Codeforces Round #259 (Div. 2),2,Little Pony and Crystal Mine,500.0,A,1406907000,[implementation],PROGRAMMING
-454,Codeforces Round #259 (Div. 2),2,Little Pony and Sort by Shift,1000.0,B,1406907000,[implementation],PROGRAMMING
-454,Codeforces Round #259 (Div. 2),2,Little Pony and Expected Maximum,1500.0,C,1406907000,"[combinatorics, math, probabilities]",PROGRAMMING
-454,Codeforces Round #259 (Div. 2),2,Little Pony and Harmony Chest,2000.0,D,1406907000,"[bitmasks, dp]",PROGRAMMING
-454,Codeforces Round #259 (Div. 2),2,Little Pony and Summer Sun Celebration,2500.0,E,1406907000,[dfs and similar],PROGRAMMING
-455,Codeforces Round #260 (Div. 1),1,Boredom,500.0,A,1407511800,[dp],PROGRAMMING
-455,Codeforces Round #260 (Div. 1),1,A Lot of Games,1000.0,B,1407511800,"[dfs and similar, dp, games, implementation, strings, trees]",PROGRAMMING
-455,Codeforces Round #260 (Div. 1),1,Civilization,1500.0,C,1407511800,"[dfs and similar, dp, dsu, ternary search, trees]",PROGRAMMING
-455,Codeforces Round #260 (Div. 1),1,Serega and Fun,2000.0,D,1407511800,[data structures],PROGRAMMING
-455,Codeforces Round #260 (Div. 1),1,Function,2500.0,E,1407511800,[data structures],PROGRAMMING
-456,Codeforces Round #260 (Div. 2),2,Laptops,500.0,A,1407511800,[sortings],PROGRAMMING
-456,Codeforces Round #260 (Div. 2),2,Fedya and Maths,1000.0,B,1407511800,"[math, number theory]",PROGRAMMING
-456,Codeforces Round #260 (Div. 2),2,Boredom,1500.0,C,1407511800,[dp],PROGRAMMING
-456,Codeforces Round #260 (Div. 2),2,A Lot of Games,2000.0,D,1407511800,"[dp, games, strings]",PROGRAMMING
-456,Codeforces Round #260 (Div. 2),2,Civilization,2500.0,E,1407511800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
-457,MemSQL Start[c]UP 2.0 - Round 2,12,Golden System,1000.0,A,1407690000,"[math, meet-in-the-middle]",PROGRAMMING
-457,MemSQL Start[c]UP 2.0 - Round 2,12,Distributed Join,1000.0,B,1407690000,[greedy],PROGRAMMING
-457,MemSQL Start[c]UP 2.0 - Round 2,12,Elections,1500.0,C,1407690000,[brute force],PROGRAMMING
-457,MemSQL Start[c]UP 2.0 - Round 2,12,Bingo!,2000.0,D,1407690000,"[combinatorics, math, probabilities]",PROGRAMMING
-457,MemSQL Start[c]UP 2.0 - Round 2,12,Flow Optimality,2500.0,E,1407690000,"[constructive algorithms, flows, math]",PROGRAMMING
-457,MemSQL Start[c]UP 2.0 - Round 2,12,An easy problem about trees,3000.0,F,1407690000,"[dp, games, greedy, trees]",PROGRAMMING
-459,Codeforces Round #261 (Div. 2),2,Pashmak and Garden,500.0,A,1408116600,[implementation],PROGRAMMING
-459,Codeforces Round #261 (Div. 2),2,Pashmak and Flowers,500.0,B,1408116600,"[implementation, sortings]",PROGRAMMING
-459,Codeforces Round #261 (Div. 2),2,Pashmak and Buses,2000.0,C,1408116600,"[combinatorics, constructive algorithms, math]",PROGRAMMING
-459,Codeforces Round #261 (Div. 2),2,Pashmak and Parmida's problem,2000.0,D,1408116600,"[data structures, divide and conquer, sortings]",PROGRAMMING
-459,Codeforces Round #261 (Div. 2),2,Pashmak and Graph,3000.0,E,1408116600,"[dp, sortings]",PROGRAMMING
-460,Codeforces Round #262 (Div. 2),2,Vasya and Socks,500.0,A,1408548600,"[brute force, implementation]",PROGRAMMING
-460,Codeforces Round #262 (Div. 2),2,Little Dima and Equation,1000.0,B,1408548600,"[brute force, implementation, math]",PROGRAMMING
-460,Codeforces Round #262 (Div. 2),2,Present,1500.0,C,1408548600,"[binary search, data structures, greedy]",PROGRAMMING
-460,Codeforces Round #262 (Div. 2),2,Little Victor and Set,2000.0,D,1408548600,"[brute force, constructive algorithms]",PROGRAMMING
-460,Codeforces Round #262 (Div. 2),2,Roland and Rose,2500.0,E,1408548600,"[brute force, geometry, math, sortings]",PROGRAMMING
-461,Codeforces Round #263 (Div. 1),1,Appleman and Toastman,500.0,A,1409061600,"[greedy, sortings]",PROGRAMMING
-461,Codeforces Round #263 (Div. 1),1,Appleman and Tree,1000.0,B,1409061600,"[dfs and similar, dp, trees]",PROGRAMMING
-461,Codeforces Round #263 (Div. 1),1,Appleman and a Sheet of Paper,1500.0,C,1409061600,"[data structures, implementation]",PROGRAMMING
-461,Codeforces Round #263 (Div. 1),1,Appleman and Complicated Task,2000.0,D,1409061600,"[dsu, math]",PROGRAMMING
-461,Codeforces Round #263 (Div. 1),1,Appleman and a Game,2500.0,E,1409061600,[shortest paths],PROGRAMMING
-462,Codeforces Round #263 (Div. 2),2,Appleman and Easy Task,500.0,A,1409061600,"[brute force, implementation]",PROGRAMMING
-462,Codeforces Round #263 (Div. 2),2,Appleman and Card Game,1000.0,B,1409061600,[greedy],PROGRAMMING
-462,Codeforces Round #263 (Div. 2),2,Appleman and Toastman,1500.0,C,1409061600,"[implementation, sortings]",PROGRAMMING
-462,Codeforces Round #263 (Div. 2),2,Appleman and Tree,2000.0,D,1409061600,"[dp, graphs]",PROGRAMMING
-462,Codeforces Round #263 (Div. 2),2,Appleman and a Sheet of Paper,2500.0,E,1409061600,[],PROGRAMMING
-463,Codeforces Round #264 (Div. 2),2,Caisa and Sugar,500.0,A,1409383800,[implementation],PROGRAMMING
-463,Codeforces Round #264 (Div. 2),2,Caisa and Pylons,1000.0,B,1409383800,[math],PROGRAMMING
-463,Codeforces Round #264 (Div. 2),2,Gargari and Bishops,1500.0,C,1409383800,"[greedy, hashing, implementation]",PROGRAMMING
-463,Codeforces Round #264 (Div. 2),2,Gargari and Permutations,2000.0,D,1409383800,"[dfs and similar, dp, graphs]",PROGRAMMING
-463,Codeforces Round #264 (Div. 2),2,Caisa and Tree,2500.0,E,1409383800,"[brute force, dfs and similar, trees]",PROGRAMMING
-464,Codeforces Round #265 (Div. 1),1,No to Palindromes!,500.0,A,1410103800,"[greedy, strings]",PROGRAMMING
-464,Codeforces Round #265 (Div. 1),1,Restore Cube ,1500.0,B,1410103800,"[brute force, geometry]",PROGRAMMING
-464,Codeforces Round #265 (Div. 1),1,Substitutes in Number,1500.0,C,1410103800,[dp],PROGRAMMING
-464,Codeforces Round #265 (Div. 1),1,World of Darkraft - 2,2000.0,D,1410103800,"[dp, probabilities]",PROGRAMMING
-464,Codeforces Round #265 (Div. 1),1,The Classic Problem,2500.0,E,1410103800,"[data structures, graphs, shortest paths]",PROGRAMMING
-465,Codeforces Round #265 (Div. 2),2,inc ARG,500.0,A,1410103800,[implementation],PROGRAMMING
-465,Codeforces Round #265 (Div. 2),2,Inbox (100500),1000.0,B,1410103800,[implementation],PROGRAMMING
-465,Codeforces Round #265 (Div. 2),2,No to Palindromes!,1500.0,C,1410103800,[brute force],PROGRAMMING
-465,Codeforces Round #265 (Div. 2),2,Restore Cube ,2500.0,D,1410103800,[brute force],PROGRAMMING
-465,Codeforces Round #265 (Div. 2),2,Substitutes in Number,2500.0,E,1410103800,"[constructive algorithms, dp]",PROGRAMMING
-466,Codeforces Round #266 (Div. 2),2,Cheap Travel,500.0,A,1410535800,[implementation],PROGRAMMING
-466,Codeforces Round #266 (Div. 2),2,Wonder Room,1000.0,B,1410535800,"[brute force, math]",PROGRAMMING
-466,Codeforces Round #266 (Div. 2),2,Number of Ways,1500.0,C,1410535800,"[binary search, brute force, data structures, dp, two pointers]",PROGRAMMING
-466,Codeforces Round #266 (Div. 2),2,Increase Sequence,2000.0,D,1410535800,"[combinatorics, dp]",PROGRAMMING
-466,Codeforces Round #266 (Div. 2),2,Information Graph,2500.0,E,1410535800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
-467,Codeforces Round #267 (Div. 2),2,George and Accommodation,500.0,A,1411054200,[implementation],PROGRAMMING
-467,Codeforces Round #267 (Div. 2),2,Fedor and New Game,1000.0,B,1411054200,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING
-467,Codeforces Round #267 (Div. 2),2,George and Job,1500.0,C,1411054200,"[dp, implementation]",PROGRAMMING
-467,Codeforces Round #267 (Div. 2),2,Fedor and Essay,2000.0,D,1411054200,"[dfs and similar, dp, graphs, hashing, strings]",PROGRAMMING
-467,Codeforces Round #267 (Div. 2),2,Alex and Complicated Task,2500.0,E,1411054200,"[data structures, dp, greedy]",PROGRAMMING
-468,Codeforces Round #268 (Div. 1),1,24 Game,500.0,A,1411218000,"[constructive algorithms, greedy, math]",PROGRAMMING
-468,Codeforces Round #268 (Div. 1),1,Two Sets,1000.0,B,1411218000,"[2-sat, dfs and similar, dsu, graph matchings, greedy]",PROGRAMMING
-468,Codeforces Round #268 (Div. 1),1,Hack it!,1500.0,C,1411218000,"[binary search, constructive algorithms, math]",PROGRAMMING
-468,Codeforces Round #268 (Div. 1),1,Tree,2000.0,D,1411218000,[graph matchings],PROGRAMMING
-468,Codeforces Round #268 (Div. 1),1,Permanent,2500.0,E,1411218000,"[dp, graph matchings, math, meet-in-the-middle]",PROGRAMMING
-469,Codeforces Round #268 (Div. 2),2,I Wanna Be the Guy,500.0,A,1411218000,"[greedy, implementation]",PROGRAMMING
-469,Codeforces Round #268 (Div. 2),2,Chat Online,1000.0,B,1411218000,[implementation],PROGRAMMING
-469,Codeforces Round #268 (Div. 2),2,24 Game,1500.0,C,1411218000,"[constructive algorithms, implementation]",PROGRAMMING
-469,Codeforces Round #268 (Div. 2),2,Two Sets,2000.0,D,1411218000,"[2-sat, data structures, graph matchings, greedy]",PROGRAMMING
-469,Codeforces Round #268 (Div. 2),2,Hack it!,2500.0,E,1411218000,[constructive algorithms],PROGRAMMING
-471,Codeforces Round #269 (Div. 2),2,MUH and Sticks,500.0,A,1411745400,[implementation],PROGRAMMING
-471,Codeforces Round #269 (Div. 2),2,MUH and Important Things,1000.0,B,1411745400,[sortings],PROGRAMMING
-471,Codeforces Round #269 (Div. 2),2,MUH and House of Cards,2000.0,C,1411745400,"[binary search, brute force, greedy, math]",PROGRAMMING
-471,Codeforces Round #269 (Div. 2),2,MUH and Cube Walls,2000.0,D,1411745400,"[string suffix structures, strings]",PROGRAMMING
-471,Codeforces Round #269 (Div. 2),2,MUH and Lots and Lots of Segments,2500.0,E,1411745400,"[data structures, dsu]",PROGRAMMING
-472,Codeforces Round #270,12,Design Tutorial: Learn from Math,500.0,A,1411918500,"[math, number theory]",PROGRAMMING
-472,Codeforces Round #270,12,Design Tutorial: Learn from Life,1000.0,B,1411918500,[],PROGRAMMING
-472,Codeforces Round #270,12,Design Tutorial: Make It Nondeterministic,1500.0,C,1411918500,[greedy],PROGRAMMING
-472,Codeforces Round #270,12,Design Tutorial: Inverse the Problem,2000.0,D,1411918500,"[dfs and similar, dsu, shortest paths, trees]",PROGRAMMING
-472,Codeforces Round #270,12,Design Tutorial: Learn from a Game,3000.0,E,1411918500,"[constructive algorithms, implementation]",PROGRAMMING
-472,Codeforces Round #270,12,Design Tutorial: Change the Goal,3000.0,F,1411918500,"[constructive algorithms, math, matrices]",PROGRAMMING
-472,Codeforces Round #270,12,Design Tutorial: Increase the Constraints,3500.0,G,1411918500,"[bitmasks, data structures, fft]",PROGRAMMING
-474,Codeforces Round #271 (Div. 2),2,Keyboard,500.0,A,1412609400,[implementation],PROGRAMMING
-474,Codeforces Round #271 (Div. 2),2,Worms,1000.0,B,1412609400,"[binary search, implementation]",PROGRAMMING
-474,Codeforces Round #271 (Div. 2),2,Captain Marmot,1500.0,C,1412609400,"[brute force, geometry]",PROGRAMMING
-474,Codeforces Round #271 (Div. 2),2,Flowers,2000.0,D,1412609400,[dp],PROGRAMMING
-474,Codeforces Round #271 (Div. 2),2,Pillars,3000.0,E,1412609400,"[binary search, data structures, dp, sortings, trees]",PROGRAMMING
-474,Codeforces Round #271 (Div. 2),2,Ant colony,3000.0,F,1412609400,"[data structures, number theory]",PROGRAMMING
-475,Bayan 2015 Contest Warm Up,12,Bayan Bus,500.0,A,1412514000,[implementation],PROGRAMMING
-475,Bayan 2015 Contest Warm Up,12,Strongly Connected City,1000.0,B,1412514000,"[brute force, dfs and similar, graphs, implementation]",PROGRAMMING
-475,Bayan 2015 Contest Warm Up,12,Kamal-ol-molk's Painting,1500.0,C,1412514000,"[brute force, constructive algorithms, greedy]",PROGRAMMING
-475,Bayan 2015 Contest Warm Up,12,CGCDSSQ,2000.0,D,1412514000,"[brute force, data structures, math]",PROGRAMMING
-475,Bayan 2015 Contest Warm Up,12,Strongly Connected City 2,2500.0,E,1412514000,[dfs and similar],PROGRAMMING
-475,Bayan 2015 Contest Warm Up,12,Meta-universe,2500.0,F,1412514000,[data structures],PROGRAMMING
-476,Codeforces Round #272 (Div. 2),2,Dreamoon and Stairs,500.0,A,1413122400,"[implementation, math]",PROGRAMMING
-476,Codeforces Round #272 (Div. 2),2,Dreamoon and WiFi,1500.0,B,1413122400,"[bitmasks, brute force, combinatorics, dp, math, probabilities]",PROGRAMMING
-476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sums,1500.0,C,1413122400,[math],PROGRAMMING
-476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sets,2000.0,D,1413122400,"[constructive algorithms, greedy, math]",PROGRAMMING
-476,Codeforces Round #272 (Div. 2),2,Dreamoon and Strings,2500.0,E,1413122400,"[dp, strings]",PROGRAMMING
-477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sums,500.0,A,1413122400,[math],PROGRAMMING
-477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sets,1000.0,B,1413122400,[math],PROGRAMMING
-477,Codeforces Round #272 (Div. 1),1,Dreamoon and Strings,1500.0,C,1413122400,[dp],PROGRAMMING
-477,Codeforces Round #272 (Div. 1),1,Dreamoon and Binary,2000.0,D,1413122400,"[dp, strings]",PROGRAMMING
-477,Codeforces Round #272 (Div. 1),1,Dreamoon and Notepad,3000.0,E,1413122400,[data structures],PROGRAMMING
-478,Codeforces Round #273 (Div. 2),2,Initial Bet,500.0,A,1413474000,[implementation],PROGRAMMING
-478,Codeforces Round #273 (Div. 2),2,Random Teams,1000.0,B,1413474000,"[combinatorics, constructive algorithms, greedy, math]",PROGRAMMING
-478,Codeforces Round #273 (Div. 2),2,Table Decorations,1500.0,C,1413474000,[greedy],PROGRAMMING
-478,Codeforces Round #273 (Div. 2),2,Red-Green Towers,2000.0,D,1413474000,[dp],PROGRAMMING
-478,Codeforces Round #273 (Div. 2),2,Wavy numbers,2500.0,E,1413474000,"[brute force, dfs and similar, meet-in-the-middle, sortings]",PROGRAMMING
-479,Codeforces Round #274 (Div. 2),2,Expression,500.0,A,1413709200,"[brute force, math]",PROGRAMMING
-479,Codeforces Round #274 (Div. 2),2,Towers,1000.0,B,1413709200,"[brute force, greedy, implementation, sortings]",PROGRAMMING
-479,Codeforces Round #274 (Div. 2),2,Exams,1500.0,C,1413709200,"[greedy, sortings]",PROGRAMMING
-479,Codeforces Round #274 (Div. 2),2,Long Jumps,2000.0,D,1413709200,"[binary search, greedy, implementation]",PROGRAMMING
-479,Codeforces Round #274 (Div. 2),2,Riding in a Lift,2500.0,E,1413709200,[dp],PROGRAMMING
-480,Codeforces Round #274 (Div. 1),1,Exams,500.0,A,1413709200,"[greedy, sortings]",PROGRAMMING
-480,Codeforces Round #274 (Div. 1),1,Long Jumps,1000.0,B,1413709200,"[binary search, greedy, hashing, implementation, sortings]",PROGRAMMING
-480,Codeforces Round #274 (Div. 1),1,Riding in a Lift,1500.0,C,1413709200,"[dp, implementation]",PROGRAMMING
-480,Codeforces Round #274 (Div. 1),1,Parcels,2000.0,D,1413709200,"[dp, graphs]",PROGRAMMING
-480,Codeforces Round #274 (Div. 1),1,Parking Lot,2500.0,E,1413709200,"[data structures, divide and conquer]",PROGRAMMING
-482,Codeforces Round #275 (Div. 1),1,Diverse Permutation,500.0,A,1414170000,"[constructive algorithms, greedy]",PROGRAMMING
-482,Codeforces Round #275 (Div. 1),1,Interesting Array,1500.0,B,1414170000,"[constructive algorithms, data structures, trees]",PROGRAMMING
-482,Codeforces Round #275 (Div. 1),1,Game with Strings,1500.0,C,1414170000,"[bitmasks, dp, probabilities]",PROGRAMMING
-482,Codeforces Round #275 (Div. 1),1,Random Function and Tree,2000.0,D,1414170000,"[combinatorics, dp, trees]",PROGRAMMING
-482,Codeforces Round #275 (Div. 1),1,ELCA,2500.0,E,1414170000,"[data structures, trees]",PROGRAMMING
-483,Codeforces Round #275 (Div. 2),2,Counterexample ,500.0,A,1414170000,"[brute force, implementation]",PROGRAMMING
-483,Codeforces Round #275 (Div. 2),2,Friends and Presents,1000.0,B,1414170000,"[binary search, math]",PROGRAMMING
-483,Codeforces Round #275 (Div. 2),2,Diverse Permutation,1500.0,C,1414170000,"[constructive algorithms, implementation]",PROGRAMMING
-483,Codeforces Round #275 (Div. 2),2,Interesting Array,2500.0,D,1414170000,[data structures],PROGRAMMING
-483,Codeforces Round #275 (Div. 2),2,Game with Strings,2500.0,E,1414170000,[],PROGRAMMING
-486,Codeforces Round #277 (Div. 2),2,Calculating Function,500.0,A,1415718000,"[implementation, math]",PROGRAMMING
-486,Codeforces Round #277 (Div. 2),2,OR in Matrix,1000.0,B,1415718000,"[greedy, hashing, implementation]",PROGRAMMING
-486,Codeforces Round #277 (Div. 2),2,Palindrome Transformation,1500.0,C,1415718000,"[greedy, implementation]",PROGRAMMING
-486,Codeforces Round #277 (Div. 2),2,Valid Sets,2000.0,D,1415718000,"[dfs and similar, dp, math, trees]",PROGRAMMING
-486,Codeforces Round #277 (Div. 2),2,LIS of Sequence,2500.0,E,1415718000,"[data structures, dp, greedy, hashing, math]",PROGRAMMING
-487,Codeforces Round #278 (Div. 1),1,Fight the Monster,500.0,A,1416590400,"[binary search, brute force]",PROGRAMMING
-487,Codeforces Round #278 (Div. 1),1,Strip,1500.0,B,1416590400,"[binary search, data structures, dp, two pointers]",PROGRAMMING
-487,Codeforces Round #278 (Div. 1),1,Prefix Product Sequence,1500.0,C,1416590400,"[constructive algorithms, number theory]",PROGRAMMING
-487,Codeforces Round #278 (Div. 1),1,Conveyor Belts,2000.0,D,1416590400,[data structures],PROGRAMMING
-487,Codeforces Round #278 (Div. 1),1,Tourists,2500.0,E,1416590400,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
-488,Codeforces Round #278 (Div. 2),2,Giga Tower,500.0,A,1416590400,[brute force],PROGRAMMING
-488,Codeforces Round #278 (Div. 2),2,Candy Boxes,1500.0,B,1416590400,"[brute force, constructive algorithms]",PROGRAMMING
-488,Codeforces Round #278 (Div. 2),2,Fight the Monster,1500.0,C,1416590400,[brute force],PROGRAMMING
-488,Codeforces Round #278 (Div. 2),2,Strip,2500.0,D,1416590400,"[data structures, dp, two pointers]",PROGRAMMING
-488,Codeforces Round #278 (Div. 2),2,Prefix Product Sequence,2500.0,E,1416590400,"[constructive algorithms, math]",PROGRAMMING
-489,Codeforces Round #277.5 (Div. 2),2,SwapSort,500.0,A,1416238500,"[implementation, sortings]",PROGRAMMING
-489,Codeforces Round #277.5 (Div. 2),2,BerSU Ball,1000.0,B,1416238500,"[dfs and similar, dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING
-489,Codeforces Round #277.5 (Div. 2),2,Given Length and Sum of Digits...,1500.0,C,1416238500,"[dp, greedy, implementation]",PROGRAMMING
-489,Codeforces Round #277.5 (Div. 2),2,Unbearable Controversy of Being,2000.0,D,1416238500,"[brute force, combinatorics, dfs and similar, graphs]",PROGRAMMING
-489,Codeforces Round #277.5 (Div. 2),2,Hiking,2500.0,E,1416238500,"[binary search, dp]",PROGRAMMING
-489,Codeforces Round #277.5 (Div. 2),2,Special Matrices,2500.0,F,1416238500,"[combinatorics, dp]",PROGRAMMING
-490,Codeforces Round #279 (Div. 2),2,Team Olympiad,500.0,A,1416733800,"[greedy, implementation, sortings]",PROGRAMMING
-490,Codeforces Round #279 (Div. 2),2,Queue,1000.0,B,1416733800,"[dsu, implementation]",PROGRAMMING
-490,Codeforces Round #279 (Div. 2),2,Hacking Cypher,1500.0,C,1416733800,"[brute force, math, strings]",PROGRAMMING
-490,Codeforces Round #279 (Div. 2),2,Chocolate,2000.0,D,1416733800,"[brute force, dfs and similar, math, meet-in-the-middle, number theory]",PROGRAMMING
-490,Codeforces Round #279 (Div. 2),2,Restoring Increasing Sequence,2000.0,E,1416733800,"[binary search, brute force, greedy, implementation]",PROGRAMMING
-490,Codeforces Round #279 (Div. 2),2,Treeland Tour,2500.0,F,1416733800,"[data structures, dfs and similar, dp, trees]",PROGRAMMING
-492,Codeforces Round #280 (Div. 2),2,Vanya and Cubes,500.0,A,1417451400,[implementation],PROGRAMMING
-492,Codeforces Round #280 (Div. 2),2,Vanya and Lanterns,1000.0,B,1417451400,"[binary search, math, sortings]",PROGRAMMING
-492,Codeforces Round #280 (Div. 2),2,Vanya and Exams,1500.0,C,1417451400,"[greedy, sortings]",PROGRAMMING
-492,Codeforces Round #280 (Div. 2),2,Vanya and Computer Game,2000.0,D,1417451400,"[binary search, implementation, math, sortings]",PROGRAMMING
-492,Codeforces Round #280 (Div. 2),2,Vanya and Field,2500.0,E,1417451400,[math],PROGRAMMING
-493,Codeforces Round #281 (Div. 2),2,Vasya and Football,500.0,A,1417618800,[implementation],PROGRAMMING
-493,Codeforces Round #281 (Div. 2),2,Vasya and Wrestling,1000.0,B,1417618800,[implementation],PROGRAMMING
-493,Codeforces Round #281 (Div. 2),2,Vasya and Basketball,2000.0,C,1417618800,"[binary search, brute force, implementation, sortings, two pointers]",PROGRAMMING
-493,Codeforces Round #281 (Div. 2),2,Vasya and Chess,1500.0,D,1417618800,"[constructive algorithms, games]",PROGRAMMING
-493,Codeforces Round #281 (Div. 2),2,Vasya and Polynomial,3000.0,E,1417618800,[math],PROGRAMMING
-494,Codeforces Round #282 (Div. 1),1,Treasure,500.0,A,1418488200,[greedy],PROGRAMMING
-494,Codeforces Round #282 (Div. 1),1,Obsessive String,1000.0,B,1418488200,"[dp, strings]",PROGRAMMING
-494,Codeforces Round #282 (Div. 1),1,Helping People,1750.0,C,1418488200,"[dp, probabilities]",PROGRAMMING
-494,Codeforces Round #282 (Div. 1),1,Birthday,1750.0,D,1418488200,"[data structures, dfs and similar, dp, trees]",PROGRAMMING
-494,Codeforces Round #282 (Div. 1),1,Sharti,2500.0,E,1418488200,[games],PROGRAMMING
-495,Codeforces Round #282 (Div. 2),2,Digital Counter,500.0,A,1418488200,[implementation],PROGRAMMING
-495,Codeforces Round #282 (Div. 2),2,Modular Equations,1000.0,B,1418488200,[math],PROGRAMMING
-495,Codeforces Round #282 (Div. 2),2,Treasure,1500.0,C,1418488200,[implementation],PROGRAMMING
-495,Codeforces Round #282 (Div. 2),2,Obsessive String,2000.0,D,1418488200,"[binary search, dp, strings]",PROGRAMMING
-495,Codeforces Round #282 (Div. 2),2,Helping People,2750.0,E,1418488200,[],PROGRAMMING
-496,Codeforces Round #283 (Div. 2),2,Minimum Difficulty,500.0,A,1418833800,"[brute force, implementation, math]",PROGRAMMING
-496,Codeforces Round #283 (Div. 2),2,Secret Combination,1000.0,B,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
-496,Codeforces Round #283 (Div. 2),2,Removing Columns,1750.0,C,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
-496,Codeforces Round #283 (Div. 2),2,Tennis Game,2250.0,D,1418833800,[binary search],PROGRAMMING
-496,Codeforces Round #283 (Div. 2),2,Distributing Parts ,2250.0,E,1418833800,"[greedy, sortings]",PROGRAMMING
-497,Codeforces Round #283 (Div. 1),1,Removing Columns,750.0,A,1418833800,[greedy],PROGRAMMING
-497,Codeforces Round #283 (Div. 1),1,Tennis Game,1250.0,B,1418833800,"[binary search, brute force, implementation]",PROGRAMMING
-497,Codeforces Round #283 (Div. 1),1,Distributing Parts ,1250.0,C,1418833800,"[data structures, greedy, implementation, sortings, two pointers]",PROGRAMMING
-497,Codeforces Round #283 (Div. 1),1,Gears,2000.0,D,1418833800,"[brute force, geometry, math]",PROGRAMMING
-497,Codeforces Round #283 (Div. 1),1,Subsequences Return,2500.0,E,1418833800,"[dp, matrices]",PROGRAMMING
-498,Codeforces Round #284 (Div. 1),1,Crazy Town,500.0,A,1419438600,[geometry],PROGRAMMING
-498,Codeforces Round #284 (Div. 1),1,Name That Tune,2000.0,B,1419438600,"[dp, probabilities, two pointers]",PROGRAMMING
-498,Codeforces Round #284 (Div. 1),1,Array and Operations,1000.0,C,1419438600,"[flows, graph matchings, number theory]",PROGRAMMING
-498,Codeforces Round #284 (Div. 1),1,Traffic Jams in the Land,2000.0,D,1419438600,"[data structures, dp, number theory]",PROGRAMMING
-498,Codeforces Round #284 (Div. 1),1,Stairs and Lines,2500.0,E,1419438600,"[dp, matrices]",PROGRAMMING
-499,Codeforces Round #284 (Div. 2),2,Watching a movie,500.0,A,1419438600,[implementation],PROGRAMMING
-499,Codeforces Round #284 (Div. 2),2,Lecture,500.0,B,1419438600,[strings],PROGRAMMING
-499,Codeforces Round #284 (Div. 2),2,Crazy Town,1500.0,C,1419438600,[math],PROGRAMMING
-499,Codeforces Round #284 (Div. 2),2,Name That Tune,3000.0,D,1419438600,[],PROGRAMMING
-499,Codeforces Round #284 (Div. 2),2,Array and Operations,3000.0,E,1419438600,[],PROGRAMMING
-500,Good Bye 2014,12,New Year Transportation,500.0,A,1419951600,"[dfs and similar, graphs, implementation]",PROGRAMMING
-500,Good Bye 2014,12,New Year Permutation,1000.0,B,1419951600,"[dfs and similar, dsu, graphs, greedy, math, sortings]",PROGRAMMING
-500,Good Bye 2014,12,New Year Book Reading,1000.0,C,1419951600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
-500,Good Bye 2014,12,New Year Santa Network,1500.0,D,1419951600,"[combinatorics, dfs and similar, graphs, trees]",PROGRAMMING
-500,Good Bye 2014,12,New Year Domino,2750.0,E,1419951600,"[data structures, dp, dsu]",PROGRAMMING
-500,Good Bye 2014,12,New Year Shopping,2750.0,F,1419951600,"[divide and conquer, dp]",PROGRAMMING
-500,Good Bye 2014,12,New Year Running,3500.0,G,1419951600,"[number theory, trees]",PROGRAMMING
-501,Codeforces Round #285 (Div. 2),2,Contest,500.0,A,1421053200,[implementation],PROGRAMMING
-501,Codeforces Round #285 (Div. 2),2,Misha and Changing Handles,500.0,B,1421053200,"[data structures, dsu, strings]",PROGRAMMING
-501,Codeforces Round #285 (Div. 2),2,Misha and Forest,1500.0,C,1421053200,"[constructive algorithms, data structures, greedy, sortings, trees]",PROGRAMMING
-501,Codeforces Round #285 (Div. 2),2,Misha and Permutations Summation,3000.0,D,1421053200,[data structures],PROGRAMMING
-501,Codeforces Round #285 (Div. 2),2,Misha and Palindrome Degree,3000.0,E,1421053200,"[binary search, combinatorics, implementation]",PROGRAMMING
-504,Codeforces Round #285 (Div. 1),1,Misha and Forest,500.0,A,1421053200,"[constructive algorithms, data structures, graphs, greedy]",PROGRAMMING
-504,Codeforces Round #285 (Div. 1),1,Misha and Permutations Summation,500.0,B,1421053200,"[binary search, data structures, math]",PROGRAMMING
-504,Codeforces Round #285 (Div. 1),1,Misha and Palindrome Degree,2500.0,C,1421053200,[math],PROGRAMMING
-504,Codeforces Round #285 (Div. 1),1,Misha and XOR,2500.0,D,1421053200,[bitmasks],PROGRAMMING
-504,Codeforces Round #285 (Div. 1),1,Misha and LCP on Tree,3000.0,E,1421053200,"[binary search, dfs and similar, hashing, string suffix structures, trees]",PROGRAMMING
-505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Gift,500.0,A,1421586000,"[brute force, implementation, strings]",PROGRAMMING
-505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Colorful Graph,1000.0,B,1421586000,"[dfs and similar, dp, dsu, graphs]",PROGRAMMING
-505,Codeforces Round #286 (Div. 2),2,"Mr. Kitayuta, the Treasure Hunter",1500.0,C,1421586000,"[dfs and similar, dp, two pointers]",PROGRAMMING
-505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Technology,2000.0,D,1421586000,[dfs and similar],PROGRAMMING
-505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta vs. Bamboos,2750.0,E,1421586000,"[binary search, greedy]",PROGRAMMING
-506,Codeforces Round #286 (Div. 1),1,"Mr. Kitayuta, the Treasure Hunter",500.0,A,1421586000,[dp],PROGRAMMING
-506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Technology,1000.0,B,1421586000,"[dfs and similar, graphs]",PROGRAMMING
-506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta vs. Bamboos,1750.0,C,1421586000,[binary search],PROGRAMMING
-506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Colorful Graph,1750.0,D,1421586000,"[brute force, dfs and similar, dsu]",PROGRAMMING
-506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Gift,2500.0,E,1421586000,"[combinatorics, dp, matrices, strings]",PROGRAMMING
-507,Codeforces Round #287 (Div. 2),2,Amr and Music,500.0,A,1422028800,"[greedy, implementation, sortings]",PROGRAMMING
-507,Codeforces Round #287 (Div. 2),2,Amr and Pins,1000.0,B,1422028800,"[geometry, math]",PROGRAMMING
-507,Codeforces Round #287 (Div. 2),2,Guess Your Way Out!,1500.0,C,1422028800,"[implementation, math]",PROGRAMMING
-507,Codeforces Round #287 (Div. 2),2,The Maths Lecture,2000.0,D,1422028800,"[dp, implementation]",PROGRAMMING
-507,Codeforces Round #287 (Div. 2),2,Breaking Good,2500.0,E,1422028800,"[dfs and similar, dp, graphs, shortest paths]",PROGRAMMING
-508,Codeforces Round #288 (Div. 2),2,Pasha and Pixels,500.0,A,1422376200,[brute force],PROGRAMMING
-508,Codeforces Round #288 (Div. 2),2,Anton and currency you all know,1000.0,B,1422376200,[greedy],PROGRAMMING
-508,Codeforces Round #288 (Div. 2),2,Anya and Ghosts,1500.0,C,1422376200,[greedy],PROGRAMMING
-508,Codeforces Round #288 (Div. 2),2,Tanya and Password,2000.0,D,1422376200,"[dfs and similar, graphs]",PROGRAMMING
-508,Codeforces Round #288 (Div. 2),2,Arthur and Brackets,2500.0,E,1422376200,"[dp, greedy]",PROGRAMMING
-509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Maximum in Table,,A,1422705600,"[brute force, implementation]",PROGRAMMING
-509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Painting Pebbles,,B,1422705600,"[constructive algorithms, greedy, implementation]",PROGRAMMING
-509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Sums of Digits,,C,1422705600,"[dp, greedy, implementation]",PROGRAMMING
-509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Restoring Numbers,,D,1422705600,"[constructive algorithms, math]",PROGRAMMING
-509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Pretty Song,,E,1422705600,"[math, strings]",PROGRAMMING
-509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Progress Monitoring,,F,1422705600,[dp],PROGRAMMING
-510,Codeforces Round #290 (Div. 2),2,Fox And Snake,500.0,A,1422894600,[implementation],PROGRAMMING
-510,Codeforces Round #290 (Div. 2),2,Fox And Two Dots,1000.0,B,1422894600,[dfs and similar],PROGRAMMING
-510,Codeforces Round #290 (Div. 2),2,Fox And Names,1500.0,C,1422894600,"[dfs and similar, graphs, sortings]",PROGRAMMING
-510,Codeforces Round #290 (Div. 2),2,Fox And Jumping,2000.0,D,1422894600,"[bitmasks, brute force, dp, math]",PROGRAMMING
-510,Codeforces Round #290 (Div. 2),2,Fox And Dinner,2500.0,E,1422894600,[flows],PROGRAMMING
-512,Codeforces Round #290 (Div. 1),1,Fox And Names,500.0,A,1422894600,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING
-512,Codeforces Round #290 (Div. 1),1,Fox And Jumping,1000.0,B,1422894600,"[data structures, dp, math, number theory, shortest paths]",PROGRAMMING
-512,Codeforces Round #290 (Div. 1),1,Fox And Dinner,1500.0,C,1422894600,"[flows, graph matchings]",PROGRAMMING
-512,Codeforces Round #290 (Div. 1),1,Fox And Travelling,2250.0,D,1422894600,"[dp, trees]",PROGRAMMING
-512,Codeforces Round #290 (Div. 1),1,Fox And Polygon,2250.0,E,1422894600,"[constructive algorithms, divide and conquer]",PROGRAMMING
-513,Rockethon 2015,12,Game,3.0,A,1423328400,"[constructive algorithms, math]",PROGRAMMING
-513,Rockethon 2015,12,Permutations,3.0,B1,1423328400,[brute force],PROGRAMMING
-513,Rockethon 2015,12,Permutations,4.0,B2,1423328400,"[bitmasks, divide and conquer, math]",PROGRAMMING
-513,Rockethon 2015,12,Second price auction,8.0,C,1423328400,"[bitmasks, probabilities]",PROGRAMMING
-513,Rockethon 2015,12,Constrained Tree,9.0,D1,1423328400,[dfs and similar],PROGRAMMING
-513,Rockethon 2015,12,Constrained Tree,8.0,D2,1423328400,"[constructive algorithms, data structures]",PROGRAMMING
-513,Rockethon 2015,12,Subarray Cuts,9.0,E1,1423328400,[dp],PROGRAMMING
-513,Rockethon 2015,12,Subarray Cuts,12.0,E2,1423328400,[dp],PROGRAMMING
-513,Rockethon 2015,12,Scaygerboss,14.0,F1,1423328400,[flows],PROGRAMMING
-513,Rockethon 2015,12,Scaygerboss,6.0,F2,1423328400,[flows],PROGRAMMING
-513,Rockethon 2015,12,Inversions problem,3.0,G1,1423328400,"[brute force, dfs and similar, dp, meet-in-the-middle]",PROGRAMMING
-513,Rockethon 2015,12,Inversions problem,5.0,G2,1423328400,"[dp, probabilities]",PROGRAMMING
-513,Rockethon 2015,12,Inversions problem,16.0,G3,1423328400,[dp],PROGRAMMING
-514,Codeforces Round #291 (Div. 2),2,Chewbaсca and Number,500.0,A,1423931400,"[greedy, implementation]",PROGRAMMING
-514,Codeforces Round #291 (Div. 2),2,Han Solo and Lazer Gun,1000.0,B,1423931400,"[brute force, data structures, geometry, math]",PROGRAMMING
-514,Codeforces Round #291 (Div. 2),2,Watto and Mechanism,2000.0,C,1423931400,"[binary search, hashing, string suffix structures, strings]",PROGRAMMING
-514,Codeforces Round #291 (Div. 2),2,R2D2 and Droid Army,2000.0,D,1423931400,"[binary search, data structures, two pointers]",PROGRAMMING
-514,Codeforces Round #291 (Div. 2),2,Darth Vader and Tree,2500.0,E,1423931400,"[dp, matrices]",PROGRAMMING
-515,Codeforces Round #292 (Div. 2),2,Drazil and Date,500.0,A,1424190900,[math],PROGRAMMING
-515,Codeforces Round #292 (Div. 2),2,Drazil and His Happy Friends,1000.0,B,1424190900,"[brute force, dsu, meet-in-the-middle, number theory]",PROGRAMMING
-515,Codeforces Round #292 (Div. 2),2,Drazil and Factorial,1000.0,C,1424190900,"[greedy, math, sortings]",PROGRAMMING
-515,Codeforces Round #292 (Div. 2),2,Drazil and Tiles,3000.0,D,1424190900,"[constructive algorithms, greedy]",PROGRAMMING
-515,Codeforces Round #292 (Div. 2),2,Drazil and Park,3000.0,E,1424190900,[data structures],PROGRAMMING
-516,Codeforces Round #292 (Div. 1),1,Drazil and Factorial,500.0,A,1424190900,"[dp, greedy, implementation, math]",PROGRAMMING
-516,Codeforces Round #292 (Div. 1),1,Drazil and Tiles,1000.0,B,1424190900,"[data structures, graph matchings, greedy, implementation]",PROGRAMMING
-516,Codeforces Round #292 (Div. 1),1,Drazil and Park,1500.0,C,1424190900,[data structures],PROGRAMMING
-516,Codeforces Round #292 (Div. 1),1,Drazil and Morning Exercise,3000.0,D,1424190900,"[dfs and similar, dp, dsu, trees, two pointers]",PROGRAMMING
-516,Codeforces Round #292 (Div. 1),1,Drazil and His Happy Friends,3000.0,E,1424190900,"[math, number theory]",PROGRAMMING
-518,Codeforces Round #293 (Div. 2),2,Vitaly and Strings,500.0,A,1424795400,[strings],PROGRAMMING
-518,Codeforces Round #293 (Div. 2),2,Tanya and Postcard,1000.0,B,1424795400,"[implementation, strings]",PROGRAMMING
-518,Codeforces Round #293 (Div. 2),2,Anya and Smartphone,1500.0,C,1424795400,"[data structures, implementation]",PROGRAMMING
-518,Codeforces Round #293 (Div. 2),2,Ilya and Escalator,2000.0,D,1424795400,"[combinatorics, dp, probabilities]",PROGRAMMING
-518,Codeforces Round #293 (Div. 2),2,Arthur and Questions,2500.0,E,1424795400,"[greedy, implementation, ternary search]",PROGRAMMING
-518,Codeforces Round #293 (Div. 2),2,Pasha and Pipe,2500.0,F,1424795400,"[binary search, brute force, combinatorics, dp, implementation]",PROGRAMMING
-519,Codeforces Round #294 (Div. 2),2,A and B and Chess,500.0,A,1425128400,[implementation],PROGRAMMING
-519,Codeforces Round #294 (Div. 2),2,A and B and Compilation Errors,1000.0,B,1425128400,"[data structures, implementation]",PROGRAMMING
-519,Codeforces Round #294 (Div. 2),2,A and B and Team Training,1500.0,C,1425128400,"[greedy, implementation, math, number theory]",PROGRAMMING
-519,Codeforces Round #294 (Div. 2),2,A and B and Interesting Substrings,2000.0,D,1425128400,"[data structures, dp, two pointers]",PROGRAMMING
-519,Codeforces Round #294 (Div. 2),2,A and B and Lecture Rooms,2500.0,E,1425128400,"[binary search, data structures, dfs and similar, dp, trees]",PROGRAMMING
-520,Codeforces Round #295 (Div. 2),2,Pangram,500.0,A,1425279600,"[implementation, strings]",PROGRAMMING
-520,Codeforces Round #295 (Div. 2),2,Two Buttons,1000.0,B,1425279600,"[dfs and similar, graphs, greedy, implementation, math, shortest paths]",PROGRAMMING
-520,Codeforces Round #295 (Div. 2),2,DNA Alignment,1500.0,C,1425279600,"[math, strings]",PROGRAMMING
-520,Codeforces Round #295 (Div. 2),2,Cubes,2000.0,D,1425279600,"[games, greedy, implementation]",PROGRAMMING
-520,Codeforces Round #295 (Div. 2),2,Pluses everywhere,2500.0,E,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING
-521,Codeforces Round #295 (Div. 1),1,DNA Alignment,500.0,A,1425279600,"[greedy, math]",PROGRAMMING
-521,Codeforces Round #295 (Div. 1),1,Cubes,1000.0,B,1425279600,"[data structures, greedy, implementation]",PROGRAMMING
-521,Codeforces Round #295 (Div. 1),1,Pluses everywhere,1500.0,C,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING
-521,Codeforces Round #295 (Div. 1),1,Shop,2000.0,D,1425279600,[greedy],PROGRAMMING
-521,Codeforces Round #295 (Div. 1),1,Cycling City,2500.0,E,1425279600,"[dfs and similar, graphs]",PROGRAMMING
-525,Codeforces Round #297 (Div. 2),2,Vitaliy and Pie,250.0,A,1427387400,"[greedy, hashing]",PROGRAMMING
-525,Codeforces Round #297 (Div. 2),2,Pasha and String,750.0,B,1427387400,[greedy],PROGRAMMING
-525,Codeforces Round #297 (Div. 2),2,Ilya and Sticks,1000.0,C,1427387400,"[greedy, sortings]",PROGRAMMING
-525,Codeforces Round #297 (Div. 2),2,Arthur and Walls,3000.0,D,1427387400,"[data structures, greedy]",PROGRAMMING
-525,Codeforces Round #297 (Div. 2),2,Anya and Cubes,3000.0,E,1427387400,"[binary search, bitmasks, brute force, dp, meet-in-the-middle]",PROGRAMMING
-526,ZeptoLab Code Rush 2015,12,King of Thieves,500.0,A,1428165300,"[brute force, implementation]",PROGRAMMING
-526,ZeptoLab Code Rush 2015,12,Om Nom and Dark Park,500.0,B,1428165300,"[dfs and similar, greedy, implementation]",PROGRAMMING
-526,ZeptoLab Code Rush 2015,12,Om Nom and Candies,1250.0,C,1428165300,"[brute force, greedy, math]",PROGRAMMING
-526,ZeptoLab Code Rush 2015,12,Om Nom and Necklace,1750.0,D,1428165300,"[hashing, string suffix structures, strings]",PROGRAMMING
-526,ZeptoLab Code Rush 2015,12,Transmitting Levels,2250.0,E,1428165300,"[dp, implementation]",PROGRAMMING
-526,ZeptoLab Code Rush 2015,12,Pudding Monsters,3000.0,F,1428165300,"[data structures, divide and conquer]",PROGRAMMING
-526,ZeptoLab Code Rush 2015,12,Spiders Evil Plan,3000.0,G,1428165300,"[greedy, trees]",PROGRAMMING
-527,Codeforces Round #296 (Div. 2),2,Playing with Paper,500.0,A,1426610700,"[implementation, math]",PROGRAMMING
-527,Codeforces Round #296 (Div. 2),2,Error Correct System,1000.0,B,1426610700,[greedy],PROGRAMMING
-527,Codeforces Round #296 (Div. 2),2,Glass Carving,1500.0,C,1426610700,"[binary search, data structures, implementation]",PROGRAMMING
-527,Codeforces Round #296 (Div. 2),2,Clique Problem,2000.0,D,1426610700,"[data structures, dp, greedy, implementation, sortings]",PROGRAMMING
-527,Codeforces Round #296 (Div. 2),2,Data Center Drama,2500.0,E,1426610700,"[dfs and similar, graphs]",PROGRAMMING
-528,Codeforces Round #296 (Div. 1),1,Glass Carving,500.0,A,1426610700,"[data structures, implementation]",PROGRAMMING
-528,Codeforces Round #296 (Div. 1),1,Clique Problem,1000.0,B,1426610700,"[dp, greedy]",PROGRAMMING
-528,Codeforces Round #296 (Div. 1),1,Data Center Drama,1500.0,C,1426610700,"[constructive algorithms, graphs]",PROGRAMMING
-528,Codeforces Round #296 (Div. 1),1,Fuzzy Search,2000.0,D,1426610700,"[bitmasks, brute force, fft]",PROGRAMMING
-528,Codeforces Round #296 (Div. 1),1,Triangles 3000,2500.0,E,1426610700,"[geometry, sortings]",PROGRAMMING
-529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,And Yet Another Bracket Sequence,2500.0,A,1426956300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
-529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Group Photo 2 (online mirror version),500.0,B,1426956300,"[brute force, greedy, sortings]",PROGRAMMING
-529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Rooks and Rectangles,1500.0,C,1426956300,[data structures],PROGRAMMING
-529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Social Network,1250.0,D,1426956300,"[data structures, greedy]",PROGRAMMING
-529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,The Art of Dealing with ATM,500.0,E,1426956300,[brute force],PROGRAMMING
-533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Berland Miners,3000.0,A,1429286400,"[binary search, data structures, dfs and similar, greedy, trees]",PROGRAMMING
-533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Work Group,750.0,B,1429286400,"[dfs and similar, dp, graphs, strings, trees]",PROGRAMMING
-533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Board Game,250.0,C,1429286400,"[games, greedy, implementation, math]",PROGRAMMING
-533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Landmarks,3000.0,D,1429286400,[data structures],PROGRAMMING
-533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Correcting Mistakes,500.0,E,1429286400,"[constructive algorithms, dp, greedy, hashing, strings, two pointers]",PROGRAMMING
-533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Encoding,1500.0,F,1429286400,"[hashing, string suffix structures, strings]",PROGRAMMING
-534,Codeforces Round #298 (Div. 2),2,Exam,500.0,A,1428854400,"[constructive algorithms, implementation]",PROGRAMMING
-534,Codeforces Round #298 (Div. 2),2,Covered Path,1000.0,B,1428854400,"[dp, greedy, math]",PROGRAMMING
-534,Codeforces Round #298 (Div. 2),2,Polycarpus' Dice,1500.0,C,1428854400,[math],PROGRAMMING
-534,Codeforces Round #298 (Div. 2),2,Handshakes,2000.0,D,1428854400,"[binary search, constructive algorithms, data structures, greedy]",PROGRAMMING
-534,Codeforces Round #298 (Div. 2),2,Berland Local Positioning System,2500.0,E,1428854400,"[constructive algorithms, greedy, hashing, implementation]",PROGRAMMING
-534,Codeforces Round #298 (Div. 2),2,Simplified Nonogram,3000.0,F,1428854400,"[bitmasks, dp, hashing, meet-in-the-middle]",PROGRAMMING
-535,Codeforces Round #299 (Div. 2),2,Tavas and Nafas,500.0,A,1429029300,[implementation],PROGRAMMING
-535,Codeforces Round #299 (Div. 2),2,Tavas and SaDDas,1000.0,B,1429029300,"[bitmasks, brute force, implementation]",PROGRAMMING
-535,Codeforces Round #299 (Div. 2),2,Tavas and Karafs,1500.0,C,1429029300,"[binary search, math]",PROGRAMMING
-535,Codeforces Round #299 (Div. 2),2,Tavas and Malekas,2000.0,D,1429029300,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING
-535,Codeforces Round #299 (Div. 2),2,Tavas and Pashmaks,2500.0,E,1429029300,[geometry],PROGRAMMING
-536,Codeforces Round #299 (Div. 1),1,Tavas and Karafs,500.0,A,1429029300,"[binary search, math]",PROGRAMMING
-536,Codeforces Round #299 (Div. 1),1,Tavas and Malekas,1000.0,B,1429029300,"[hashing, string suffix structures, strings]",PROGRAMMING
-536,Codeforces Round #299 (Div. 1),1,Tavas and Pashmaks,1500.0,C,1429029300,[geometry],PROGRAMMING
-536,Codeforces Round #299 (Div. 1),1,Tavas in Kansas,2000.0,D,1429029300,"[dp, games]",PROGRAMMING
-536,Codeforces Round #299 (Div. 1),1,Tavas on the Path,2500.0,E,1429029300,"[data structures, divide and conquer, trees]",PROGRAMMING
-538,Codeforces Round #300,12,Cutting Banner,500.0,A,1430064000,"[brute force, implementation]",PROGRAMMING
-538,Codeforces Round #300,12,Quasi Binary,1000.0,B,1430064000,"[constructive algorithms, dp, greedy, implementation]",PROGRAMMING
-538,Codeforces Round #300,12,Tourist's Notes,1500.0,C,1430064000,"[binary search, brute force, greedy, implementation, math]",PROGRAMMING
-538,Codeforces Round #300,12,Weird Chess,1500.0,D,1430064000,"[brute force, constructive algorithms, implementation]",PROGRAMMING
-538,Codeforces Round #300,12,Demiurges Play Again,2000.0,E,1430064000,"[dfs and similar, dp, math, trees]",PROGRAMMING
-538,Codeforces Round #300,12,A Heap of Heaps,2500.0,F,1430064000,"[brute force, data structures, math, sortings]",PROGRAMMING
-538,Codeforces Round #300,12,Berserk Robot ,3000.0,G,1430064000,"[constructive algorithms, math, sortings]",PROGRAMMING
-538,Codeforces Round #300,12,Summer Dichotomy,3000.0,H,1430064000,"[2-sat, data structures, dfs and similar, greedy]",PROGRAMMING
-540,Codeforces Round #301 (Div. 2),2,Combination Lock,500.0,A,1430411400,[implementation],PROGRAMMING
-540,Codeforces Round #301 (Div. 2),2,School Marks,1000.0,B,1430411400,"[greedy, implementation]",PROGRAMMING
-540,Codeforces Round #301 (Div. 2),2,Ice Cave,1500.0,C,1430411400,[dfs and similar],PROGRAMMING
-540,Codeforces Round #301 (Div. 2),2,Bad Luck Island,2000.0,D,1430411400,"[dp, probabilities]",PROGRAMMING
-540,Codeforces Round #301 (Div. 2),2,Infinite Inversions,2500.0,E,1430411400,"[binary search, data structures, implementation, sortings, trees]",PROGRAMMING
-542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Place Your Ad Here,2000.0,A,1430668800,"[data structures, sortings]",PROGRAMMING
-542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Duck Hunt,3000.0,B,1430668800,[data structures],PROGRAMMING
-542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Idempotent functions,750.0,C,1430668800,"[constructive algorithms, graphs, math]",PROGRAMMING
-542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Superhero's Job,2250.0,D,1430668800,"[dfs and similar, dp, hashing, math, number theory]",PROGRAMMING
-542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Playing on Graph,2250.0,E,1430668800,"[graphs, shortest paths]",PROGRAMMING
-542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Quest,1000.0,F,1430668800,"[dp, greedy]",PROGRAMMING
-543,Codeforces Round #302 (Div. 1),1,Writing Code,500.0,A,1431016200,[dp],PROGRAMMING
-543,Codeforces Round #302 (Div. 1),1,Destroying Roads,1000.0,B,1431016200,"[graphs, shortest paths]",PROGRAMMING
-543,Codeforces Round #302 (Div. 1),1,Remembering Strings,1750.0,C,1431016200,"[bitmasks, dp]",PROGRAMMING
-543,Codeforces Round #302 (Div. 1),1,Road Improvement,1750.0,D,1431016200,"[dp, trees]",PROGRAMMING
-543,Codeforces Round #302 (Div. 1),1,Listening to Music,2500.0,E,1431016200,"[constructive algorithms, data structures]",PROGRAMMING
-544,Codeforces Round #302 (Div. 2),2,Set of Strings,500.0,A,1431016200,[implementation],PROGRAMMING
-544,Codeforces Round #302 (Div. 2),2,Sea and Islands,1000.0,B,1431016200,"[constructive algorithms, implementation]",PROGRAMMING
-544,Codeforces Round #302 (Div. 2),2,Writing Code,1500.0,C,1431016200,[dp],PROGRAMMING
-544,Codeforces Round #302 (Div. 2),2,Destroying Roads,2000.0,D,1431016200,"[brute force, graphs, shortest paths]",PROGRAMMING
-544,Codeforces Round #302 (Div. 2),2,Remembering Strings,2750.0,E,1431016200,"[bitmasks, dp]",PROGRAMMING
-545,Codeforces Round #303 (Div. 2),2,Toy Cars,500.0,A,1432053000,[implementation],PROGRAMMING
-545,Codeforces Round #303 (Div. 2),2,Equidistant String,1000.0,B,1432053000,[greedy],PROGRAMMING
-545,Codeforces Round #303 (Div. 2),2,Woodcutters,1750.0,C,1432053000,"[dp, greedy]",PROGRAMMING
-545,Codeforces Round #303 (Div. 2),2,Queue,1750.0,D,1432053000,"[greedy, implementation, sortings]",PROGRAMMING
-545,Codeforces Round #303 (Div. 2),2,Paths and Trees,2500.0,E,1432053000,"[graphs, greedy, shortest paths]",PROGRAMMING
-546,Codeforces Round #304 (Div. 2),2,Soldier and Bananas,500.0,A,1432312200,"[implementation, math]",PROGRAMMING
-546,Codeforces Round #304 (Div. 2),2,Soldier and Badges,1000.0,B,1432312200,"[brute force, greedy, implementation, sortings]",PROGRAMMING
-546,Codeforces Round #304 (Div. 2),2,Soldier and Cards,1250.0,C,1432312200,"[brute force, dfs and similar]",PROGRAMMING
-546,Codeforces Round #304 (Div. 2),2,Soldier and Number Game,1500.0,D,1432312200,"[constructive algorithms, dp, math, number theory]",PROGRAMMING
-546,Codeforces Round #304 (Div. 2),2,Soldier and Traveling,2250.0,E,1432312200,"[flows, math]",PROGRAMMING
-547,Codeforces Round #305 (Div. 1),1,Mike and Frog,750.0,A,1432658100,"[brute force, implementation, math]",PROGRAMMING
-547,Codeforces Round #305 (Div. 1),1,Mike and Feet,1000.0,B,1432658100,"[binary search, data structures, dp, dsu]",PROGRAMMING
-547,Codeforces Round #305 (Div. 1),1,Mike and Foam,1750.0,C,1432658100,"[bitmasks, number theory]",PROGRAMMING
-547,Codeforces Round #305 (Div. 1),1,Mike and Fish,1750.0,D,1432658100,"[dfs and similar, graphs]",PROGRAMMING
-547,Codeforces Round #305 (Div. 1),1,Mike and Friends,2500.0,E,1432658100,"[data structures, string suffix structures, strings]",PROGRAMMING
-548,Codeforces Round #305 (Div. 2),2,Mike and Fax,500.0,A,1432658100,"[brute force, implementation]",PROGRAMMING
-548,Codeforces Round #305 (Div. 2),2,Mike and Fun,1000.0,B,1432658100,"[brute force, greedy, implementation]",PROGRAMMING
-548,Codeforces Round #305 (Div. 2),2,Mike and Frog,1750.0,C,1432658100,[number theory],PROGRAMMING
-548,Codeforces Round #305 (Div. 2),2,Mike and Feet,2000.0,D,1432658100,"[binary search, data structures]",PROGRAMMING
-548,Codeforces Round #305 (Div. 2),2,Mike and Foam,2750.0,E,1432658100,[number theory],PROGRAMMING
-549,Looksery Cup 2015,12,Face Detection,250.0,A,1433595600,[implementation],PROGRAMMING
-549,Looksery Cup 2015,12,Looksery Party,1750.0,B,1433595600,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING
-549,Looksery Cup 2015,12,The Game Of Parity,2000.0,C,1433595600,[games],PROGRAMMING
-549,Looksery Cup 2015,12,Haar Features,1000.0,D,1433595600,"[greedy, implementation]",PROGRAMMING
-549,Looksery Cup 2015,12,Sasha Circle,3000.0,E,1433595600,[math],PROGRAMMING
-549,Looksery Cup 2015,12,Yura and Developers,3000.0,F,1433595600,"[data structures, divide and conquer]",PROGRAMMING
-549,Looksery Cup 2015,12,Happy Line,1500.0,G,1433595600,"[greedy, sortings]",PROGRAMMING
-549,Looksery Cup 2015,12,Degenerate Matrix,1500.0,H,1433595600,"[binary search, math]",PROGRAMMING
-550,Codeforces Round #306 (Div. 2),2,Two Substrings,1000.0,A,1433435400,"[brute force, dp, implementation, strings]",PROGRAMMING
-550,Codeforces Round #306 (Div. 2),2,Preparing Olympiad,750.0,B,1433435400,"[bitmasks, brute force]",PROGRAMMING
-550,Codeforces Round #306 (Div. 2),2,Divisibility by Eight,1000.0,C,1433435400,"[brute force, dp, math]",PROGRAMMING
-550,Codeforces Round #306 (Div. 2),2,Regular Bridge,2000.0,D,1433435400,"[constructive algorithms, graphs, implementation]",PROGRAMMING
-550,Codeforces Round #306 (Div. 2),2,Brackets in Implications,3000.0,E,1433435400,"[constructive algorithms, greedy, implementation]",PROGRAMMING
-551,Codeforces Round #307 (Div. 2),2,GukiZ and Contest,500.0,A,1434127500,"[implementation, sortings]",PROGRAMMING
-551,Codeforces Round #307 (Div. 2),2,ZgukistringZ,1250.0,B,1434127500,"[brute force, constructive algorithms, implementation, strings]",PROGRAMMING
-551,Codeforces Round #307 (Div. 2),2,GukiZ hates Boxes,1750.0,C,1434127500,"[binary search, greedy]",PROGRAMMING
-551,Codeforces Round #307 (Div. 2),2,GukiZ and Binary Operations,2000.0,D,1434127500,"[combinatorics, math, matrices, number theory]",PROGRAMMING
-551,Codeforces Round #307 (Div. 2),2,GukiZ and GukiZiana,2500.0,E,1434127500,"[binary search, data structures]",PROGRAMMING
-552,Codeforces Round #308 (Div. 2),2,Vanya and Table,500.0,A,1434645000,"[implementation, math]",PROGRAMMING
-552,Codeforces Round #308 (Div. 2),2,Vanya and Books,1000.0,B,1434645000,"[implementation, math]",PROGRAMMING
-552,Codeforces Round #308 (Div. 2),2,Vanya and Scales,1500.0,C,1434645000,"[brute force, dp, greedy, math, meet-in-the-middle]",PROGRAMMING
-552,Codeforces Round #308 (Div. 2),2,Vanya and Triangles,2000.0,D,1434645000,"[brute force, combinatorics, data structures, geometry, math, sortings]",PROGRAMMING
-552,Codeforces Round #308 (Div. 2),2,Vanya and Brackets,2500.0,E,1434645000,"[brute force, dp, expression parsing, greedy, implementation]",PROGRAMMING
-553,Codeforces Round #309 (Div. 1),1,Kyoya and Colored Balls,250.0,A,1435163400,"[combinatorics, dp, math]",PROGRAMMING
-553,Codeforces Round #309 (Div. 1),1,Kyoya and Permutation,500.0,B,1435163400,"[binary search, combinatorics, constructive algorithms, implementation, math]",PROGRAMMING
-553,Codeforces Round #309 (Div. 1),1,Love Triangles,1000.0,C,1435163400,"[dfs and similar, dsu, graphs]",PROGRAMMING
-553,Codeforces Round #309 (Div. 1),1,Nudist Beach,1500.0,D,1435163400,"[binary search, graphs, greedy]",PROGRAMMING
-553,Codeforces Round #309 (Div. 1),1,Kyoya and Train,3000.0,E,1435163400,"[dp, fft, probabilities]",PROGRAMMING
-554,Codeforces Round #309 (Div. 2),2,Kyoya and Photobooks,250.0,A,1435163400,"[brute force, math]",PROGRAMMING
-554,Codeforces Round #309 (Div. 2),2,Ohana Cleans Up,500.0,B,1435163400,"[brute force, strings]",PROGRAMMING
-554,Codeforces Round #309 (Div. 2),2,Kyoya and Colored Balls,1500.0,C,1435163400,"[combinatorics, dp, math]",PROGRAMMING
-554,Codeforces Round #309 (Div. 2),2,Kyoya and Permutation,3000.0,D,1435163400,[math],PROGRAMMING
-554,Codeforces Round #309 (Div. 2),2,Love Triangles,3000.0,E,1435163400,"[dfs and similar, dsu]",PROGRAMMING
-555,Codeforces Round #310 (Div. 1),1,Case of Matryoshkas,250.0,A,1435414200,[implementation],PROGRAMMING
-555,Codeforces Round #310 (Div. 1),1,Case of Fugitive,750.0,B,1435414200,"[data structures, greedy, sortings]",PROGRAMMING
-555,Codeforces Round #310 (Div. 1),1,Case of Chocolate,1250.0,C,1435414200,[data structures],PROGRAMMING
-555,Codeforces Round #310 (Div. 1),1,Case of a Top Secret,2000.0,D,1435414200,"[binary search, implementation, math]",PROGRAMMING
-555,Codeforces Round #310 (Div. 1),1,Case of Computer Network,3000.0,E,1435414200,"[dfs and similar, graphs, trees]",PROGRAMMING
-556,Codeforces Round #310 (Div. 2),2,Case of the Zeros and Ones,250.0,A,1435414200,[greedy],PROGRAMMING
-556,Codeforces Round #310 (Div. 2),2,Case of Fake Numbers,250.0,B,1435414200,"[brute force, implementation]",PROGRAMMING
-556,Codeforces Round #310 (Div. 2),2,Case of Matryoshkas,1000.0,C,1435414200,[implementation],PROGRAMMING
-556,Codeforces Round #310 (Div. 2),2,Case of Fugitive,3000.0,D,1435414200,"[binary search, data structures, greedy]",PROGRAMMING
-556,Codeforces Round #310 (Div. 2),2,Case of Chocolate,3000.0,E,1435414200,"[binary search, data structures]",PROGRAMMING
-557,Codeforces Round #311 (Div. 2),2,Ilya and Diplomas,500.0,A,1435676400,"[greedy, implementation]",PROGRAMMING
-557,Codeforces Round #311 (Div. 2),2,Pasha and Tea,1000.0,B,1435676400,"[implementation, sortings]",PROGRAMMING
-557,Codeforces Round #311 (Div. 2),2,Arthur and Table,1500.0,C,1435676400,"[brute force, data structures, dp, greedy]",PROGRAMMING
-557,Codeforces Round #311 (Div. 2),2,Vitaly and Cycle,2000.0,D,1435676400,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING
-557,Codeforces Round #311 (Div. 2),2,Ann and Half-Palindrome,2500.0,E,1435676400,"[data structures, dp, string suffix structures, strings, trees]",PROGRAMMING
-558,Codeforces Round #312 (Div. 2),2,Lala Land and Apple Trees,500.0,A,1436886600,"[brute force, implementation, sortings]",PROGRAMMING
-558,Codeforces Round #312 (Div. 2),2,Amr and The Large Array,1000.0,B,1436886600,[implementation],PROGRAMMING
-558,Codeforces Round #312 (Div. 2),2,Amr and Chemistry,1500.0,C,1436886600,"[brute force, greedy]",PROGRAMMING
-558,Codeforces Round #312 (Div. 2),2,Guess Your Way Out! II,2250.0,D,1436886600,"[data structures, implementation, sortings]",PROGRAMMING
-558,Codeforces Round #312 (Div. 2),2,A Simple Task,2500.0,E,1436886600,"[data structures, sortings, strings]",PROGRAMMING
-559,Codeforces Round #313 (Div. 1),1,Gerald's Hexagon,500.0,A,1437573600,"[brute force, geometry, math]",PROGRAMMING
-559,Codeforces Round #313 (Div. 1),1,Equivalent Strings,1000.0,B,1437573600,"[divide and conquer, hashing, sortings, strings]",PROGRAMMING
-559,Codeforces Round #313 (Div. 1),1,Gerald and Giant Chess,1500.0,C,1437573600,"[combinatorics, dp, math, number theory]",PROGRAMMING
-559,Codeforces Round #313 (Div. 1),1,Randomizer,2250.0,D,1437573600,"[combinatorics, geometry, probabilities]",PROGRAMMING
-559,Codeforces Round #313 (Div. 1),1,Gerald and Path,2250.0,E,1437573600,"[dp, sortings]",PROGRAMMING
-560,Codeforces Round #313 (Div. 2),2,Currency System in Geraldion,500.0,A,1437573600,"[geometry, implementation, sortings]",PROGRAMMING
-560,Codeforces Round #313 (Div. 2),2,Gerald is into Art,1000.0,B,1437573600,"[constructive algorithms, implementation]",PROGRAMMING
-560,Codeforces Round #313 (Div. 2),2,Gerald's Hexagon,1500.0,C,1437573600,[geometry],PROGRAMMING
-560,Codeforces Round #313 (Div. 2),2,Equivalent Strings,2000.0,D,1437573600,"[hashing, implementation, strings]",PROGRAMMING
-560,Codeforces Round #313 (Div. 2),2,Gerald and Giant Chess,2500.0,E,1437573600,"[combinatorics, dp]",PROGRAMMING
-567,Codeforces Round #Pi (Div. 2),2,Lineland Mail,500.0,A,1438790400,[implementation],PROGRAMMING
-567,Codeforces Round #Pi (Div. 2),2,Berland National Library,1000.0,B,1438790400,[implementation],PROGRAMMING
-567,Codeforces Round #Pi (Div. 2),2,Geometric Progression,1500.0,C,1438790400,"[binary search, data structures, dp]",PROGRAMMING
-567,Codeforces Round #Pi (Div. 2),2,One-Dimensional Battle Ships,2000.0,D,1438790400,"[binary search, data structures, sortings]",PROGRAMMING
-567,Codeforces Round #Pi (Div. 2),2,President and Roads,2500.0,E,1438790400,"[dfs and similar, graphs, hashing, shortest paths]",PROGRAMMING
-567,Codeforces Round #Pi (Div. 2),2,Mausoleum,2500.0,F,1438790400,[dp],PROGRAMMING
-568,Codeforces Round #315 (Div. 1),1,Primes or Palindromes?,500.0,A,1439224200,"[brute force, implementation, math, number theory]",PROGRAMMING
-568,Codeforces Round #315 (Div. 1),1,Symmetric and Transitive,1000.0,B,1439224200,"[combinatorics, dp, math]",PROGRAMMING
-568,Codeforces Round #315 (Div. 1),1,New Language,1500.0,C,1439224200,"[2-sat, greedy]",PROGRAMMING
-568,Codeforces Round #315 (Div. 1),1,Sign Posts,2250.0,D,1439224200,"[brute force, math]",PROGRAMMING
-568,Codeforces Round #315 (Div. 1),1,Longest Increasing Subsequence,2500.0,E,1439224200,"[data structures, dp]",PROGRAMMING
-569,Codeforces Round #315 (Div. 2),2,Music,500.0,A,1439224200,"[implementation, math]",PROGRAMMING
-569,Codeforces Round #315 (Div. 2),2,Inventory,1000.0,B,1439224200,[greedy],PROGRAMMING
-569,Codeforces Round #315 (Div. 2),2,Primes or Palindromes?,1500.0,C,1439224200,"[binary search, brute force, number theory]",PROGRAMMING
-569,Codeforces Round #315 (Div. 2),2,Symmetric and Transitive,2250.0,D,1439224200,"[brute force, dp, math]",PROGRAMMING
-569,Codeforces Round #315 (Div. 2),2,New Language,2750.0,E,1439224200,[],PROGRAMMING
-570,Codeforces Round #316 (Div. 2),2,Elections,500.0,A,1439483400,[implementation],PROGRAMMING
-570,Codeforces Round #316 (Div. 2),2,Simple Game,1000.0,B,1439483400,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
-570,Codeforces Round #316 (Div. 2),2,Replacement,1500.0,C,1439483400,"[constructive algorithms, data structures, implementation]",PROGRAMMING
-570,Codeforces Round #316 (Div. 2),2,Tree Requests,2000.0,D,1439483400,"[binary search, constructive algorithms, dfs and similar, trees]",PROGRAMMING
-570,Codeforces Round #316 (Div. 2),2,Pig and Palindromes,2500.0,E,1439483400,"[combinatorics, dp]",PROGRAMMING
-571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Lengthening Sticks,750.0,A,1440261000,"[combinatorics, implementation, math]",PROGRAMMING
-571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Minimization,1250.0,B,1440261000,"[dp, greedy, sortings]",PROGRAMMING
-571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,CNF 2,1500.0,C,1440261000,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING
-571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Campus,2000.0,D,1440261000,"[binary search, data structures, dsu, trees]",PROGRAMMING
-571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Geometric Progressions,2750.0,E,1440261000,[math],PROGRAMMING
-572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Arrays,500.0,A,1440261000,[sortings],PROGRAMMING
-572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Order Book,1000.0,B,1440261000,"[data structures, greedy, implementation, sortings]",PROGRAMMING
-572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Lengthening Sticks,1750.0,C,1440261000,"[brute force, combinatorics, dp, math]",PROGRAMMING
-572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Minimization,2250.0,D,1440261000,"[dp, sortings]",PROGRAMMING
-572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,CNF 2,2500.0,E,1440261000,[],PROGRAMMING
-573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Poker,500.0,A,1440865800,"[implementation, number theory]",PROGRAMMING
-573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Blocks,1000.0,B,1440865800,"[binary search, data structures, dp]",PROGRAMMING
-573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Drawing,1750.0,C,1440865800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING
-573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Cavalry,2000.0,D,1440865800,"[data structures, divide and conquer, dp]",PROGRAMMING
-573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Bowling,2500.0,E,1440865800,[greedy],PROGRAMMING
-574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Elections,500.0,A,1440865800,[implementation],PROGRAMMING
-574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Three Musketeers,1000.0,B,1440865800,"[brute force, dfs and similar, graphs, hashing]",PROGRAMMING
-574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Poker,1500.0,C,1440865800,[number theory],PROGRAMMING
-574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Blocks,2000.0,D,1440865800,"[data structures, dp, shortest paths]",PROGRAMMING
-574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Drawing,2750.0,E,1440865800,[],PROGRAMMING
-576,Codeforces Round #319 (Div. 1),1,Vasya and Petya's Game,500.0,A,1441902600,"[math, number theory]",PROGRAMMING
-576,Codeforces Round #319 (Div. 1),1,Invariance of Tree,1250.0,B,1441902600,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING
-576,Codeforces Round #319 (Div. 1),1,Points on Plane,1250.0,C,1441902600,"[constructive algorithms, divide and conquer, geometry, greedy, sortings]",PROGRAMMING
-576,Codeforces Round #319 (Div. 1),1,Flights for Regular Customers,2000.0,D,1441902600,"[dp, matrices]",PROGRAMMING
-576,Codeforces Round #319 (Div. 1),1,Painting Edges,2750.0,E,1441902600,"[binary search, data structures]",PROGRAMMING
-577,Codeforces Round #319 (Div. 2),2,Multiplication Table,500.0,A,1441902600,"[implementation, number theory]",PROGRAMMING
-577,Codeforces Round #319 (Div. 2),2,Modulo Sum,1250.0,B,1441902600,"[combinatorics, data structures, dp, two pointers]",PROGRAMMING
-577,Codeforces Round #319 (Div. 2),2,Vasya and Petya's Game,1500.0,C,1441902600,"[implementation, number theory]",PROGRAMMING
-577,Codeforces Round #319 (Div. 2),2,Invariance of Tree,2250.0,D,1441902600,[],PROGRAMMING
-577,Codeforces Round #319 (Div. 2),2,Points on Plane,2250.0,E,1441902600,[constructive algorithms],PROGRAMMING
-578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,A Problem about Polyline,250.0,A,1442416500,"[geometry, math]",PROGRAMMING
-578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,"""Or"" Game",500.0,B,1442416500,"[brute force, greedy]",PROGRAMMING
-578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Weakness and Poorness,750.0,C,1442416500,[ternary search],PROGRAMMING
-578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,LCS Again,2500.0,D,1442416500,"[dp, greedy]",PROGRAMMING
-578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Walking!,2750.0,E,1442416500,"[constructive algorithms, greedy]",PROGRAMMING
-578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Mirror Box,3000.0,F,1442416500,"[matrices, trees]",PROGRAMMING
-579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Raising Bacteria,250.0,A,1442416500,[bitmasks],PROGRAMMING
-579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Finding Team Member,500.0,B,1442416500,"[brute force, implementation, sortings]",PROGRAMMING
-579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,A Problem about Polyline,1250.0,C,1442416500,"[binary search, math]",PROGRAMMING
-579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,"""Or"" Game",2000.0,D,1442416500,"[brute force, greedy, math]",PROGRAMMING
-579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Weakness and Poorness,3000.0,E,1442416500,[ternary search],PROGRAMMING
-579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,LCS Again,3000.0,F,1442416500,[],PROGRAMMING
-580,Codeforces Round #321 (Div. 2),2,Kefa and First Steps,750.0,A,1442939400,"[brute force, dp, implementation]",PROGRAMMING
-580,Codeforces Round #321 (Div. 2),2,Kefa and Company,1250.0,B,1442939400,"[binary search, sortings, two pointers]",PROGRAMMING
-580,Codeforces Round #321 (Div. 2),2,Kefa and Park,1500.0,C,1442939400,"[dfs and similar, trees]",PROGRAMMING
-580,Codeforces Round #321 (Div. 2),2,Kefa and Dishes,2000.0,D,1442939400,"[bitmasks, dp]",PROGRAMMING
-580,Codeforces Round #321 (Div. 2),2,Kefa and Watch,2500.0,E,1442939400,"[data structures, hashing, strings]",PROGRAMMING
-581,Codeforces Round #322 (Div. 2),2,Vasya the Hipster,500.0,A,1443430800,[implementation],PROGRAMMING
-581,Codeforces Round #322 (Div. 2),2,Luxurious Houses,1000.0,B,1443430800,[implementation],PROGRAMMING
-581,Codeforces Round #322 (Div. 2),2,Developing Skills,1500.0,C,1443430800,"[implementation, sortings]",PROGRAMMING
-581,Codeforces Round #322 (Div. 2),2,Three Logos,2000.0,D,1443430800,"[bitmasks, brute force, constructive algorithms, implementation, math]",PROGRAMMING
-581,Codeforces Round #322 (Div. 2),2,Kojiro and Furrari,3000.0,E,1443430800,"[dp, greedy]",PROGRAMMING
-581,Codeforces Round #322 (Div. 2),2,Zublicanes and Mumocrates,3000.0,F,1443430800,"[dp, trees, two pointers]",PROGRAMMING
-582,Codeforces Round #323 (Div. 1),1,GCD Table,750.0,A,1443890700,"[constructive algorithms, greedy]",PROGRAMMING
-582,Codeforces Round #323 (Div. 1),1,Once Again...,1250.0,B,1443890700,"[dp, matrices]",PROGRAMMING
-582,Codeforces Round #323 (Div. 1),1,Superior Periodic Subarrays,1500.0,C,1443890700,[number theory],PROGRAMMING
-582,Codeforces Round #323 (Div. 1),1,Number of Binominal Coefficients,2250.0,D,1443890700,"[dp, number theory]",PROGRAMMING
-582,Codeforces Round #323 (Div. 1),1,Boolean Function,2500.0,E,1443890700,"[bitmasks, dp, expression parsing]",PROGRAMMING
-583,Codeforces Round #323 (Div. 2),2,Asphalting Roads,500.0,A,1443890700,[implementation],PROGRAMMING
-583,Codeforces Round #323 (Div. 2),2,Robot's Task,1000.0,B,1443890700,[implementation],PROGRAMMING
-583,Codeforces Round #323 (Div. 2),2,GCD Table,1750.0,C,1443890700,[],PROGRAMMING
-583,Codeforces Round #323 (Div. 2),2,Once Again...,2250.0,D,1443890700,[],PROGRAMMING
-583,Codeforces Round #323 (Div. 2),2,Superior Periodic Subarrays,2500.0,E,1443890700,[number theory],PROGRAMMING
-584,Codeforces Round #324 (Div. 2),2,Olesya and Rodion,500.0,A,1444149000,[math],PROGRAMMING
-584,Codeforces Round #324 (Div. 2),2,Kolya and Tanya ,1000.0,B,1444149000,[combinatorics],PROGRAMMING
-584,Codeforces Round #324 (Div. 2),2,Marina and Vasya,1500.0,C,1444149000,"[constructive algorithms, greedy]",PROGRAMMING
-584,Codeforces Round #324 (Div. 2),2,Dima and Lisa,2000.0,D,1444149000,[number theory],PROGRAMMING
-584,Codeforces Round #324 (Div. 2),2,Anton and Ira,2500.0,E,1444149000,"[constructive algorithms, greedy]",PROGRAMMING
-585,Codeforces Round #325 (Div. 1),1,Gennady the Dentist,500.0,A,1444641000,"[brute force, implementation]",PROGRAMMING
-585,Codeforces Round #325 (Div. 1),1,Phillip and Trains,750.0,B,1444641000,[dfs and similar],PROGRAMMING
-585,Codeforces Round #325 (Div. 1),1,"Alice, Bob, Oranges and Apples",1250.0,C,1444641000,[number theory],PROGRAMMING
-585,Codeforces Round #325 (Div. 1),1,Lizard Era: Beginning,1750.0,D,1444641000,[meet-in-the-middle],PROGRAMMING
-585,Codeforces Round #325 (Div. 1),1,Present for Vitalik the Philatelist ,2250.0,E,1444641000,"[combinatorics, math, number theory]",PROGRAMMING
-585,Codeforces Round #325 (Div. 1),1,Digits of Number Pi,3000.0,F,1444641000,"[dp, implementation, strings]",PROGRAMMING
-586,Codeforces Round #325 (Div. 2),2,Alena's Schedule,500.0,A,1444641000,[implementation],PROGRAMMING
-586,Codeforces Round #325 (Div. 2),2,Laurenty and Shop,1000.0,B,1444641000,[implementation],PROGRAMMING
-586,Codeforces Round #325 (Div. 2),2,Gennady the Dentist,1500.0,C,1444641000,[implementation],PROGRAMMING
-586,Codeforces Round #325 (Div. 2),2,Phillip and Trains,1750.0,D,1444641000,[dp],PROGRAMMING
-586,Codeforces Round #325 (Div. 2),2,"Alice, Bob, Oranges and Apples",2250.0,E,1444641000,[number theory],PROGRAMMING
-586,Codeforces Round #325 (Div. 2),2,Lizard Era: Beginning,2750.0,F,1444641000,[meet-in-the-middle],PROGRAMMING
-587,Codeforces Round #326 (Div. 1),1,Duff and Weight Lifting,500.0,A,1444926600,[greedy],PROGRAMMING
-587,Codeforces Round #326 (Div. 1),1,Duff in Beach,1000.0,B,1444926600,[dp],PROGRAMMING
-587,Codeforces Round #326 (Div. 1),1,Duff in the Army,1500.0,C,1444926600,"[data structures, trees]",PROGRAMMING
-587,Codeforces Round #326 (Div. 1),1,Duff in Mafia,2000.0,D,1444926600,"[2-sat, binary search]",PROGRAMMING
-587,Codeforces Round #326 (Div. 1),1,Duff as a Queen,2750.0,E,1444926600,[data structures],PROGRAMMING
-587,Codeforces Round #326 (Div. 1),1,Duff is Mad,2750.0,F,1444926600,"[data structures, strings]",PROGRAMMING
-588,Codeforces Round #326 (Div. 2),2,Duff and Meat,750.0,A,1444926600,[greedy],PROGRAMMING
-588,Codeforces Round #326 (Div. 2),2,Duff in Love,1000.0,B,1444926600,[math],PROGRAMMING
-588,Codeforces Round #326 (Div. 2),2,Duff and Weight Lifting,1500.0,C,1444926600,[],PROGRAMMING
-588,Codeforces Round #326 (Div. 2),2,Duff in Beach,2000.0,D,1444926600,[],PROGRAMMING
-588,Codeforces Round #326 (Div. 2),2,Duff in the Army,2500.0,E,1444926600,"[data structures, dfs and similar, trees]",PROGRAMMING
-588,Codeforces Round #326 (Div. 2),2,Duff in Mafia,3000.0,F,1444926600,[],PROGRAMMING
-590,Codeforces Round #327 (Div. 1),1,Median Smoothing,750.0,A,1445763600,[],PROGRAMMING
-590,Codeforces Round #327 (Div. 1),1,Chip 'n Dale Rescue Rangers,1000.0,B,1445763600,"[binary search, geometry, math]",PROGRAMMING
-590,Codeforces Round #327 (Div. 1),1,Three States,1250.0,C,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
-590,Codeforces Round #327 (Div. 1),1,Top Secret Task,1750.0,D,1445763600,[dp],PROGRAMMING
-590,Codeforces Round #327 (Div. 1),1,Birthday,2500.0,E,1445763600,"[graph matchings, strings]",PROGRAMMING
-591,Codeforces Round #327 (Div. 2),2,Wizards' Duel,500.0,A,1445763600,[math],PROGRAMMING
-591,Codeforces Round #327 (Div. 2),2,Rebranding,1000.0,B,1445763600,[implementation],PROGRAMMING
-591,Codeforces Round #327 (Div. 2),2,Median Smoothing,1750.0,C,1445763600,[constructive algorithms],PROGRAMMING
-591,Codeforces Round #327 (Div. 2),2,Chip 'n Dale Rescue Rangers,2000.0,D,1445763600,[],PROGRAMMING
-591,Codeforces Round #327 (Div. 2),2,Three States,2250.0,E,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
-592,Codeforces Round #328 (Div. 2),2,PawnChess,500.0,A,1446309000,[implementation],PROGRAMMING
-592,Codeforces Round #328 (Div. 2),2,The Monster and the Squirrel,1000.0,B,1446309000,[math],PROGRAMMING
-592,Codeforces Round #328 (Div. 2),2,The Big Race,1500.0,C,1446309000,[math],PROGRAMMING
-592,Codeforces Round #328 (Div. 2),2,Super M,2000.0,D,1446309000,"[dfs and similar, dp, trees]",PROGRAMMING
-592,Codeforces Round #328 (Div. 2),2,BCPC,3000.0,E,1446309000,"[binary search, geometry, two pointers]",PROGRAMMING
-593,Codeforces Round #329 (Div. 2),2,2Char,250.0,A,1446655500,[brute force],PROGRAMMING
-593,Codeforces Round #329 (Div. 2),2,Anton and Lines,1000.0,B,1446655500,"[geometry, sortings]",PROGRAMMING
-593,Codeforces Round #329 (Div. 2),2,Beautiful Function,3000.0,C,1446655500,"[constructive algorithms, math]",PROGRAMMING
-593,Codeforces Round #329 (Div. 2),2,Happy Tree Party,3000.0,D,1446655500,"[data structures, trees]",PROGRAMMING
-593,Codeforces Round #329 (Div. 2),2,Strange Calculation and Cats,3000.0,E,1446655500,"[dp, matrices]",PROGRAMMING
-596,Codeforces Round #331 (Div. 2),2,Wilbur and Swimming Pool,500.0,A,1447605300,[implementation],PROGRAMMING
-596,Codeforces Round #331 (Div. 2),2,Wilbur and Array,1000.0,B,1447605300,[greedy],PROGRAMMING
-596,Codeforces Round #331 (Div. 2),2,Wilbur and Points,1500.0,C,1447605300,"[greedy, sortings]",PROGRAMMING
-596,Codeforces Round #331 (Div. 2),2,Wilbur and Trees,2250.0,D,1447605300,"[dp, probabilities, sortings]",PROGRAMMING
-596,Codeforces Round #331 (Div. 2),2,Wilbur and Strings,2500.0,E,1447605300,"[dfs and similar, dp, graphs]",PROGRAMMING
-599,Codeforces Round #332 (Div. 2),2,Patrick and Shopping,500.0,A,1448037300,[implementation],PROGRAMMING
-599,Codeforces Round #332 (Div. 2),2,Spongebob and Joke,1000.0,B,1448037300,[implementation],PROGRAMMING
-599,Codeforces Round #332 (Div. 2),2,Day at the Beach,1500.0,C,1448037300,[sortings],PROGRAMMING
-599,Codeforces Round #332 (Div. 2),2,Spongebob and Squares,2000.0,D,1448037300,"[brute force, math]",PROGRAMMING
-599,Codeforces Round #332 (Div. 2),2,Sandy and Nuts,3000.0,E,1448037300,"[bitmasks, dp]",PROGRAMMING
-601,Codeforces Round #333 (Div. 1),1,The Two Routes,500.0,A,1448382900,"[graphs, shortest paths]",PROGRAMMING
-601,Codeforces Round #333 (Div. 1),1,Lipshitz Sequence,1250.0,B,1448382900,[data structures],PROGRAMMING
-601,Codeforces Round #333 (Div. 1),1,Kleofáš and the n-thlon,1250.0,C,1448382900,"[dp, probabilities]",PROGRAMMING
-601,Codeforces Round #333 (Div. 1),1,Acyclic Organic Compounds,2000.0,D,1448382900,"[data structures, dfs and similar, dsu, hashing, trees]",PROGRAMMING
-601,Codeforces Round #333 (Div. 1),1,A Museum Robbery,2500.0,E,1448382900,"[data structures, dp]",PROGRAMMING
-602,Codeforces Round #333 (Div. 2),2,Two Bases,500.0,A,1448382900,[implementation],PROGRAMMING
-602,Codeforces Round #333 (Div. 2),2,Approximating a Constant Range,1000.0,B,1448382900,"[dp, two pointers]",PROGRAMMING
-602,Codeforces Round #333 (Div. 2),2,The Two Routes,1500.0,C,1448382900,[],PROGRAMMING
-602,Codeforces Round #333 (Div. 2),2,Lipshitz Sequence,2250.0,D,1448382900,[],PROGRAMMING
-602,Codeforces Round #333 (Div. 2),2,Kleofáš and the n-thlon,2250.0,E,1448382900,[probabilities],PROGRAMMING
-603,Codeforces Round #334 (Div. 1),1,Alternative Thinking,500.0,A,1448984100,"[dp, greedy]",PROGRAMMING
-603,Codeforces Round #334 (Div. 1),1,Moodular Arithmetic,1000.0,B,1448984100,"[dfs and similar, dsu, math, number theory]",PROGRAMMING
-603,Codeforces Round #334 (Div. 1),1,Lieges of Legendre,1500.0,C,1448984100,[games],PROGRAMMING
-603,Codeforces Round #334 (Div. 1),1,Ruminations on Ruminants,2000.0,D,1448984100,"[geometry, math]",PROGRAMMING
-603,Codeforces Round #334 (Div. 1),1,Pastoral Oddities,3000.0,E,1448984100,"[data structures, divide and conquer, dsu, trees]",PROGRAMMING
-604,Codeforces Round #334 (Div. 2),2,Uncowed Forces,500.0,A,1448984100,[implementation],PROGRAMMING
-604,Codeforces Round #334 (Div. 2),2,More Cowbell,1000.0,B,1448984100,"[binary search, greedy]",PROGRAMMING
-604,Codeforces Round #334 (Div. 2),2,Alternative Thinking,1500.0,C,1448984100,"[constructive algorithms, dp, math]",PROGRAMMING
-604,Codeforces Round #334 (Div. 2),2,Moodular Arithmetic,2000.0,D,1448984100,[dsu],PROGRAMMING
-604,Codeforces Round #334 (Div. 2),2,Lieges of Legendre,2500.0,E,1448984100,[],PROGRAMMING
-605,Codeforces Round #335 (Div. 1),1,Sorting Railway Cars,500.0,A,1449677100,"[constructive algorithms, greedy]",PROGRAMMING
-605,Codeforces Round #335 (Div. 1),1,Lazy Student,1000.0,B,1449677100,"[constructive algorithms, data structures, graphs]",PROGRAMMING
-605,Codeforces Round #335 (Div. 1),1,Freelancer's Dreams,1500.0,C,1449677100,[geometry],PROGRAMMING
-605,Codeforces Round #335 (Div. 1),1,Board Game,2000.0,D,1449677100,"[data structures, dfs and similar]",PROGRAMMING
-605,Codeforces Round #335 (Div. 1),1,Intergalaxy Trips,2500.0,E,1449677100,"[probabilities, shortest paths]",PROGRAMMING
-606,Codeforces Round #335 (Div. 2),2,Magic Spheres,500.0,A,1449677100,[implementation],PROGRAMMING
-606,Codeforces Round #335 (Div. 2),2,Testing Robots,1000.0,B,1449677100,[implementation],PROGRAMMING
-606,Codeforces Round #335 (Div. 2),2,Sorting Railway Cars,1500.0,C,1449677100,[],PROGRAMMING
-606,Codeforces Round #335 (Div. 2),2,Lazy Student,2000.0,D,1449677100,[graphs],PROGRAMMING
-606,Codeforces Round #335 (Div. 2),2,Freelancer's Dreams,2500.0,E,1449677100,[],PROGRAMMING
-607,Codeforces Round #336 (Div. 1),1,Chain Reaction,500.0,A,1450888500,"[binary search, dp]",PROGRAMMING
-607,Codeforces Round #336 (Div. 1),1,Zuma,1250.0,B,1450888500,[dp],PROGRAMMING
-607,Codeforces Round #336 (Div. 1),1,Marbles,1500.0,C,1450888500,"[hashing, strings]",PROGRAMMING
-607,Codeforces Round #336 (Div. 1),1,Power Tree,2000.0,D,1450888500,[data structures],PROGRAMMING
-607,Codeforces Round #336 (Div. 1),1,Cross Sum,3000.0,E,1450888500,"[binary search, geometry]",PROGRAMMING
-608,Codeforces Round #336 (Div. 2),2,Saitama Destroys Hotel,500.0,A,1450888500,"[implementation, math]",PROGRAMMING
-608,Codeforces Round #336 (Div. 2),2,Hamming Distance Sum,1000.0,B,1450888500,[combinatorics],PROGRAMMING
-608,Codeforces Round #336 (Div. 2),2,Chain Reaction,1500.0,C,1450888500,[dp],PROGRAMMING
-608,Codeforces Round #336 (Div. 2),2,Zuma,2250.0,D,1450888500,[],PROGRAMMING
-608,Codeforces Round #336 (Div. 2),2,Marbles,2500.0,E,1450888500,[],PROGRAMMING
-610,Codeforces Round #337 (Div. 2),2,Pasha and Stick,500.0,A,1451215200,"[combinatorics, math]",PROGRAMMING
-610,Codeforces Round #337 (Div. 2),2,Vika and Squares,1000.0,B,1451215200,[implementation],PROGRAMMING
-610,Codeforces Round #337 (Div. 2),2,Harmony Analysis,1500.0,C,1451215200,[constructive algorithms],PROGRAMMING
-610,Codeforces Round #337 (Div. 2),2,Vika and Segments,2500.0,D,1451215200,"[data structures, geometry, two pointers]",PROGRAMMING
-610,Codeforces Round #337 (Div. 2),2,Alphabet Permutations,2500.0,E,1451215200,"[data structures, strings]",PROGRAMMING
-611,Good Bye 2015,12,New Year and Days,500.0,A,1451487900,[implementation],PROGRAMMING
-611,Good Bye 2015,12,New Year and Old Property,750.0,B,1451487900,"[brute force, implementation]",PROGRAMMING
-611,Good Bye 2015,12,New Year and Domino,1250.0,C,1451487900,"[dp, implementation]",PROGRAMMING
-611,Good Bye 2015,12,New Year and Ancient Prophecy,1750.0,D,1451487900,"[hashing, strings]",PROGRAMMING
-611,Good Bye 2015,12,New Year and Three Musketeers,2500.0,E,1451487900,"[data structures, greedy]",PROGRAMMING
-611,Good Bye 2015,12,New Year and Cleaning,2500.0,F,1451487900,"[binary search, implementation]",PROGRAMMING
-611,Good Bye 2015,12,New Year and Cake,3000.0,G,1451487900,"[geometry, two pointers]",PROGRAMMING
-611,Good Bye 2015,12,New Year and Forgotten Tree,3500.0,H,1451487900,"[constructive algorithms, flows]",PROGRAMMING
-613,Codeforces Round #339 (Div. 1),1,Peter and Snow Blower,750.0,A,1452789300,"[binary search, geometry, ternary search]",PROGRAMMING
-613,Codeforces Round #339 (Div. 1),1,Skills,1250.0,B,1452789300,"[binary search, brute force, two pointers]",PROGRAMMING
-613,Codeforces Round #339 (Div. 1),1,Necklace,1250.0,C,1452789300,[constructive algorithms],PROGRAMMING
-613,Codeforces Round #339 (Div. 1),1,Kingdom and its Cities,2000.0,D,1452789300,"[dfs and similar, divide and conquer, graphs, sortings, trees]",PROGRAMMING
-613,Codeforces Round #339 (Div. 1),1,Puzzle Lover,2500.0,E,1452789300,"[dp, hashing, strings]",PROGRAMMING
-614,Codeforces Round #339 (Div. 2),2,Link/Cut Tree,500.0,A,1452789300,[brute force],PROGRAMMING
-614,Codeforces Round #339 (Div. 2),2,Gena's Code,1000.0,B,1452789300,[implementation],PROGRAMMING
-614,Codeforces Round #339 (Div. 2),2,Peter and Snow Blower,1750.0,C,1452789300,[],PROGRAMMING
-614,Codeforces Round #339 (Div. 2),2,Skills,2250.0,D,1452789300,[],PROGRAMMING
-614,Codeforces Round #339 (Div. 2),2,Necklace,2250.0,E,1452789300,[],PROGRAMMING
-617,Codeforces Round #340 (Div. 2),2,Elephant,500.0,A,1453563300,[math],PROGRAMMING
-617,Codeforces Round #340 (Div. 2),2,Chocolate,1000.0,B,1453563300,[combinatorics],PROGRAMMING
-617,Codeforces Round #340 (Div. 2),2,Watering Flowers,1250.0,C,1453563300,[implementation],PROGRAMMING
-617,Codeforces Round #340 (Div. 2),2,Polyline,1750.0,D,1453563300,[constructive algorithms],PROGRAMMING
-617,Codeforces Round #340 (Div. 2),2,XOR and Favorite Number,2750.0,E,1453563300,[data structures],PROGRAMMING
-618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Slime Combining,500.0,A,1454087400,[implementation],PROGRAMMING
-618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Guess the Permutation,1000.0,B,1454087400,[constructive algorithms],PROGRAMMING
-618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Constellation,1500.0,C,1454087400,"[geometry, implementation]",PROGRAMMING
-618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Hamiltonian Spanning Tree,1750.0,D,1454087400,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING
-618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Robot Arm,2500.0,E,1454087400,[data structures],PROGRAMMING
-618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Double Knapsack,2750.0,F,1454087400,"[constructive algorithms, two pointers]",PROGRAMMING
-618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Combining Slimes,3500.0,G,1454087400,"[dp, matrices, probabilities]",PROGRAMMING
-621,Codeforces Round #341 (Div. 2),2,Wet Shark and Odd and Even,500.0,A,1454249100,[implementation],PROGRAMMING
-621,Codeforces Round #341 (Div. 2),2,Wet Shark and Bishops,1000.0,B,1454249100,[combinatorics],PROGRAMMING
-621,Codeforces Round #341 (Div. 2),2,Wet Shark and Flowers,1500.0,C,1454249100,[probabilities],PROGRAMMING
-621,Codeforces Round #341 (Div. 2),2,Rat Kwesh and Cheese,2000.0,D,1454249100,"[brute force, math]",PROGRAMMING
-621,Codeforces Round #341 (Div. 2),2,Wet Shark and Blocks,2500.0,E,1454249100,"[dp, matrices]",PROGRAMMING
-623,AIM Tech Round (Div. 1),1,Graph and String,500.0,A,1454605500,"[constructive algorithms, graphs]",PROGRAMMING
-623,AIM Tech Round (Div. 1),1,Array GCD,1000.0,B,1454605500,"[dp, greedy, number theory]",PROGRAMMING
-623,AIM Tech Round (Div. 1),1,Electric Charges,1750.0,C,1454605500,[binary search],PROGRAMMING
-623,AIM Tech Round (Div. 1),1,Birthday,2000.0,D,1454605500,"[greedy, probabilities]",PROGRAMMING
-623,AIM Tech Round (Div. 1),1,Transforming Sequence,2250.0,E,1454605500,"[combinatorics, dp, fft]",PROGRAMMING
-624,AIM Tech Round (Div. 2),2,Save Luke,500.0,A,1454605500,[math],PROGRAMMING
-624,AIM Tech Round (Div. 2),2,Making a String,1000.0,B,1454605500,"[greedy, sortings]",PROGRAMMING
-624,AIM Tech Round (Div. 2),2,Graph and String,1500.0,C,1454605500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
-624,AIM Tech Round (Div. 2),2,Array GCD,2000.0,D,1454605500,"[dp, greedy, number theory]",PROGRAMMING
-624,AIM Tech Round (Div. 2),2,Electric Charges,3000.0,E,1454605500,[],PROGRAMMING
-625,Codeforces Round #342 (Div. 2),2,Guest From the Past,750.0,A,1454835900,"[implementation, math]",PROGRAMMING
-625,Codeforces Round #342 (Div. 2),2,War of the Corporations,750.0,B,1454835900,"[constructive algorithms, strings]",PROGRAMMING
-625,Codeforces Round #342 (Div. 2),2,K-special Tables,1000.0,C,1454835900,"[constructive algorithms, implementation]",PROGRAMMING
-625,Codeforces Round #342 (Div. 2),2,Finals in arithmetic,2000.0,D,1454835900,"[constructive algorithms, implementation]",PROGRAMMING
-625,Codeforces Round #342 (Div. 2),2,Frog Fights,3000.0,E,1454835900,"[data structures, greedy]",PROGRAMMING
-626,8VC Venture Cup 2016 - Elimination Round,12,Robot Sequence,500.0,A,1455384900,"[brute force, implementation]",PROGRAMMING
-626,8VC Venture Cup 2016 - Elimination Round,12,Cards,750.0,B,1455384900,"[constructive algorithms, dp]",PROGRAMMING
-626,8VC Venture Cup 2016 - Elimination Round,12,Block Towers,1000.0,C,1455384900,"[brute force, greedy]",PROGRAMMING
-626,8VC Venture Cup 2016 - Elimination Round,12,Jerry's Protest,1500.0,D,1455384900,"[brute force, combinatorics, probabilities]",PROGRAMMING
-626,8VC Venture Cup 2016 - Elimination Round,12,Simple Skewness,2000.0,E,1455384900,"[binary search, math, ternary search]",PROGRAMMING
-626,8VC Venture Cup 2016 - Elimination Round,12,Group Projects,2500.0,F,1455384900,[dp],PROGRAMMING
-626,8VC Venture Cup 2016 - Elimination Round,12,Raffles,3000.0,G,1455384900,"[data structures, greedy]",PROGRAMMING
-627,8VC Venture Cup 2016 - Final Round,12,XOR Equation,500.0,A,1456683000,"[dp, math]",PROGRAMMING
-627,8VC Venture Cup 2016 - Final Round,12,Factory Repairs,1000.0,B,1456683000,[data structures],PROGRAMMING
-627,8VC Venture Cup 2016 - Final Round,12,Package Delivery,1500.0,C,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING
-627,8VC Venture Cup 2016 - Final Round,12,Preorder Test,2000.0,D,1456683000,"[binary search, dp, trees]",PROGRAMMING
-627,8VC Venture Cup 2016 - Final Round,12,Orchestra,2500.0,E,1456683000,[two pointers],PROGRAMMING
-627,8VC Venture Cup 2016 - Final Round,12,Island Puzzle,3000.0,F,1456683000,"[dfs and similar, graphs, trees]",PROGRAMMING
-629,Codeforces Round #343 (Div. 2),2,Far Relative’s Birthday Cake,500.0,A,1455986100,"[brute force, constructive algorithms, implementation]",PROGRAMMING
-629,Codeforces Round #343 (Div. 2),2,Far Relative’s Problem,1000.0,B,1455986100,[brute force],PROGRAMMING
-629,Codeforces Round #343 (Div. 2),2,Famil Door and Brackets,1750.0,C,1455986100,"[dp, strings]",PROGRAMMING
-629,Codeforces Round #343 (Div. 2),2,Babaei and Birthday Cake,2000.0,D,1455986100,"[data structures, dp]",PROGRAMMING
-629,Codeforces Round #343 (Div. 2),2,Famil Door and Roads,2500.0,E,1455986100,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING
-631,Codeforces Round #344 (Div. 2),2,Interview,500.0,A,1457022900,"[brute force, implementation]",PROGRAMMING
-631,Codeforces Round #344 (Div. 2),2,Print Check,1000.0,B,1457022900,"[constructive algorithms, implementation]",PROGRAMMING
-631,Codeforces Round #344 (Div. 2),2,Report,1500.0,C,1457022900,"[data structures, sortings]",PROGRAMMING
-631,Codeforces Round #344 (Div. 2),2,Messenger,2000.0,D,1457022900,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
-631,Codeforces Round #344 (Div. 2),2,Product Sum,2500.0,E,1457022900,"[data structures, dp, geometry]",PROGRAMMING
-633,"Manthan, Codefest 16",12,Ebony and Ivory,250.0,A,1456506900,"[brute force, math]",PROGRAMMING
-633,"Manthan, Codefest 16",12,A Trivial Problem,500.0,B,1456506900,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING
-633,"Manthan, Codefest 16",12,Spy Syndrome 2,1500.0,C,1456506900,"[data structures, dp, hashing, implementation, sortings, string suffix structures, strings]",PROGRAMMING
-633,"Manthan, Codefest 16",12,Fibonacci-ish,1750.0,D,1456506900,"[brute force, hashing, implementation, math]",PROGRAMMING
-633,"Manthan, Codefest 16",12,Startup Funding,2500.0,E,1456506900,"[binary search, data structures, probabilities, two pointers]",PROGRAMMING
-633,"Manthan, Codefest 16",12,The Chocolate Spree,2750.0,F,1456506900,"[dfs and similar, dp, trees]",PROGRAMMING
-633,"Manthan, Codefest 16",12,Yash And Trees,3000.0,G,1456506900,"[bitmasks, data structures, dfs and similar]",PROGRAMMING
-633,"Manthan, Codefest 16",12,Fibonacci-ish II,3000.0,H,1456506900,"[data structures, implementation]",PROGRAMMING
-634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Island Puzzle,500.0,A,1456683000,"[constructive algorithms, implementation]",PROGRAMMING
-634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,XOR Equation,1000.0,B,1456683000,"[constructive algorithms, dp, implementation]",PROGRAMMING
-634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Factory Repairs,1500.0,C,1456683000,[data structures],PROGRAMMING
-634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Package Delivery,2000.0,D,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING
-634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Preorder Test,2500.0,E,1456683000,[],PROGRAMMING
-634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Orchestra,3000.0,F,1456683000,[two pointers],PROGRAMMING
-635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Orchestra,500.0,A,1456683000,"[brute force, implementation]",PROGRAMMING
-635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Island Puzzle,1000.0,B,1456683000,[],PROGRAMMING
-635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,XOR Equation,1500.0,C,1456683000,[dp],PROGRAMMING
-635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Factory Repairs,2000.0,D,1456683000,[],PROGRAMMING
-635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Package Delivery,2500.0,E,1456683000,"[data structures, greedy]",PROGRAMMING
-635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Preorder Test,3000.0,F,1456683000,[],PROGRAMMING
-645,CROC 2016 - Elimination Round,12,Amity Assessment,500.0,A,1458318900,"[brute force, constructive algorithms, implementation]",PROGRAMMING
-645,CROC 2016 - Elimination Round,12,Mischievous Mess Makers,1000.0,B,1458318900,"[greedy, math]",PROGRAMMING
-645,CROC 2016 - Elimination Round,12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING
-645,CROC 2016 - Elimination Round,12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, dp, graphs]",PROGRAMMING
-645,CROC 2016 - Elimination Round,12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING
-645,CROC 2016 - Elimination Round,12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, math, number theory]",PROGRAMMING
-645,CROC 2016 - Elimination Round,12,Armistice Area Apportionment,3500.0,G,1458318900,"[binary search, geometry]",PROGRAMMING
-648,Технокубок 2016 - Отборочный Раунд 1,12,Наибольший подъем,500.0,A,1458745200,[constructive algorithms],PROGRAMMING
-648,Технокубок 2016 - Отборочный Раунд 1,12,Собери стол,1000.0,B,1458745200,"[constructive algorithms, sortings]",PROGRAMMING
-648,Технокубок 2016 - Отборочный Раунд 1,12,Путь Робота,1500.0,C,1458745200,"[dfs and similar, graphs]",PROGRAMMING
-648,Технокубок 2016 - Отборочный Раунд 1,12,Собачки и миски,2000.0,D,1458745200,"[greedy, sortings]",PROGRAMMING
-648,Технокубок 2016 - Отборочный Раунд 1,12,Собери число,2500.0,E,1458745200,[],PROGRAMMING
-649,Технокубок 2016 - Отборочный Раунд 2,12,Любимые числа Поликарпа,500.0,A,1458975600,[constructive algorithms],PROGRAMMING
-649,Технокубок 2016 - Отборочный Раунд 2,12,Этажи,1000.0,B,1458975600,[constructive algorithms],PROGRAMMING
-649,Технокубок 2016 - Отборочный Раунд 2,12,Печать условий,1500.0,C,1458975600,"[greedy, sortings]",PROGRAMMING
-649,Технокубок 2016 - Отборочный Раунд 2,12,Дефрагментация памяти,2000.0,D,1458975600,"[greedy, implementation]",PROGRAMMING
-649,Технокубок 2016 - Отборочный Раунд 2,12,Автобус,2500.0,E,1458975600,"[binary search, data structures, greedy, sortings]",PROGRAMMING
-650,Codeforces Round #345 (Div. 1),1,Watchmen,500.0,A,1457342700,"[data structures, math]",PROGRAMMING
-650,Codeforces Round #345 (Div. 1),1,Image Preview,1000.0,B,1457342700,"[binary search, dp, two pointers]",PROGRAMMING
-650,Codeforces Round #345 (Div. 1),1,Table Compression,1500.0,C,1457342700,"[dfs and similar, dp, dsu, graphs, greedy]",PROGRAMMING
-650,Codeforces Round #345 (Div. 1),1,Zip-line,2000.0,D,1457342700,"[binary search, data structures, dp]",PROGRAMMING
-650,Codeforces Round #345 (Div. 1),1,Clockwork Bomb,2500.0,E,1457342700,"[data structures, dfs and similar, dsu, trees]",PROGRAMMING
-651,Codeforces Round #345 (Div. 2),2,Joysticks,500.0,A,1457342700,"[dp, greedy]",PROGRAMMING
-651,Codeforces Round #345 (Div. 2),2,Beautiful Paintings,1000.0,B,1457342700,"[greedy, sortings]",PROGRAMMING
-651,Codeforces Round #345 (Div. 2),2,Watchmen,1500.0,C,1457342700,"[data structures, geometry, implementation, sortings]",PROGRAMMING
-651,Codeforces Round #345 (Div. 2),2,Image Preview,2000.0,D,1457342700,"[binary search, dp, two pointers]",PROGRAMMING
-651,Codeforces Round #345 (Div. 2),2,Table Compression,2500.0,E,1457342700,"[dsu, graphs, greedy]",PROGRAMMING
-653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Three Balls,500.0,A,1458376500,"[brute force, implementation, sortings]",PROGRAMMING
-653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Compressing,1000.0,B,1458376500,"[brute force, dfs and similar, dp, strings]",PROGRAMMING
-653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Up-Down,1500.0,C,1458376500,"[brute force, implementation]",PROGRAMMING
-653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Delivery Bears,2000.0,D,1458376500,"[binary search, flows]",PROGRAMMING
-653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Forgotten Tree 2,2500.0,E,1458376500,"[dfs and similar, dsu, graphs]",PROGRAMMING
-653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Paper task,3500.0,F,1458376500,"[data structures, string suffix structures]",PROGRAMMING
-653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Move by Prime,3500.0,G,1458376500,[combinatorics],PROGRAMMING
-655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Amity Assessment,500.0,A,1458318900,[],PROGRAMMING
-655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Mischievous Mess Makers,1000.0,B,1458318900,[],PROGRAMMING
-655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING
-655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, graphs]",PROGRAMMING
-655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING
-655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, number theory]",PROGRAMMING
-655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Armistice Area Apportionment,3500.0,G,1458318900,[],PROGRAMMING
-657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Forgotten Tree 3,500.0,A,1459182900,[graphs],PROGRAMMING
-657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Polynomials,1000.0,B,1459182900,[math],PROGRAMMING
-657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Contribution,1500.0,C,1459182900,[sortings],PROGRAMMING
-657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Paradox,2000.0,D,1459182900,[sortings],PROGRAMMING
-657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Chemistry,3000.0,E,1459182900,[],PROGRAMMING
-658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Reverse Radewoosh,500.0,A,1459182900,[implementation],PROGRAMMING
-658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Displayed Friends,1000.0,B,1459182900,[],PROGRAMMING
-658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Forgotten Tree 3,1500.0,C,1459182900,[],PROGRAMMING
-658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Polynomials,2000.0,D,1459182900,[],PROGRAMMING
-658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Contribution,2500.0,E,1459182900,[],PROGRAMMING
-659,Codeforces Round #346 (Div. 2),2,Round House,500.0,A,1459353900,"[implementation, math]",PROGRAMMING
-659,Codeforces Round #346 (Div. 2),2,Qualifying Contest,1000.0,B,1459353900,[sortings],PROGRAMMING
-659,Codeforces Round #346 (Div. 2),2,Tanya and Toys,1000.0,C,1459353900,"[greedy, implementation]",PROGRAMMING
-659,Codeforces Round #346 (Div. 2),2,Bicycle Race,1250.0,D,1459353900,"[geometry, implementation, math]",PROGRAMMING
-659,Codeforces Round #346 (Div. 2),2,New Reform,1500.0,E,1459353900,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING
-659,Codeforces Round #346 (Div. 2),2,Polycarp and Hay,2000.0,F,1459353900,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING
-659,Codeforces Round #346 (Div. 2),2,Fence Divercity,2500.0,G,1459353900,"[combinatorics, dp]",PROGRAMMING
-662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Gambling Nim,500.0,A,1460729700,"[bitmasks, math, matrices, probabilities]",PROGRAMMING
-662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Graph Coloring,250.0,B,1460729700,[dfs and similar],PROGRAMMING
-662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Binary Table,2250.0,C,1460729700,"[bitmasks, brute force, divide and conquer, dp, fft, math]",PROGRAMMING
-662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,International Olympiad,250.0,D,1460729700,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
-662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,To Hack or not to Hack,2250.0,E,1460729700,"[brute force, dp, greedy]",PROGRAMMING
-666,Codeforces Round #349 (Div. 1),1,Reberland Linguistics,500.0,A,1461947700,"[dp, implementation]",PROGRAMMING
-666,Codeforces Round #349 (Div. 1),1,World Tour,1000.0,B,1461947700,"[graphs, shortest paths]",PROGRAMMING
-666,Codeforces Round #349 (Div. 1),1,Codeword,2000.0,C,1461947700,[combinatorics],PROGRAMMING
-666,Codeforces Round #349 (Div. 1),1,Chain Reaction,2000.0,D,1461947700,[brute force],PROGRAMMING
-666,Codeforces Round #349 (Div. 1),1,Forensic Examination,3000.0,E,1461947700,"[data structures, string suffix structures]",PROGRAMMING
-667,Codeforces Round #349 (Div. 2),2,Pouring Rain,500.0,A,1461947700,"[geometry, math]",PROGRAMMING
-667,Codeforces Round #349 (Div. 2),2,Coat of Anticubism,1000.0,B,1461947700,"[constructive algorithms, geometry]",PROGRAMMING
-667,Codeforces Round #349 (Div. 2),2,Reberland Linguistics,1500.0,C,1461947700,"[dp, strings]",PROGRAMMING
-667,Codeforces Round #349 (Div. 2),2,World Tour,2000.0,D,1461947700,"[brute force, graphs, shortest paths]",PROGRAMMING
-667,Codeforces Round #349 (Div. 2),2,Chain Reaction,3000.0,E,1461947700,[],PROGRAMMING
-668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Matrix,500.0,A,1461515700,[],PROGRAMMING
-668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Dance,1000.0,B,1461515700,[],PROGRAMMING
-668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Random Variable,1500.0,C,1461515700,[math],PROGRAMMING
-668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Time Machine,2000.0,D,1461515700,[data structures],PROGRAMMING
-668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and 2-SAT,3000.0,E,1461515700,[graphs],PROGRAMMING
-668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Graph,3000.0,F,1461515700,[dp],PROGRAMMING
-669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Presents,500.0,A,1461515700,[math],PROGRAMMING
-669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Grasshopper,1000.0,B,1461515700,[],PROGRAMMING
-669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Matrix,1500.0,C,1461515700,"[constructive algorithms, implementation]",PROGRAMMING
-669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Dance,2000.0,D,1461515700,"[data structures, implementation, math]",PROGRAMMING
-669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Time Machine,2500.0,E,1461515700,[data structures],PROGRAMMING
-670,Codeforces Round #350 (Div. 2),2,Holidays,500.0,A,1462464300,"[brute force, constructive algorithms]",PROGRAMMING
-670,Codeforces Round #350 (Div. 2),2,Game of Robots,750.0,B,1462464300,[implementation],PROGRAMMING
-670,Codeforces Round #350 (Div. 2),2,Cinema,1000.0,C,1462464300,"[implementation, sortings]",PROGRAMMING
-670,Codeforces Round #350 (Div. 2),2,Magic Powder - 1,1000.0,D1,1462464300,"[binary search, brute force]",PROGRAMMING
-670,Codeforces Round #350 (Div. 2),2,Magic Powder - 2,500.0,D2,1462464300,[binary search],PROGRAMMING
-670,Codeforces Round #350 (Div. 2),2,Correct Bracket Sequence Editor,2000.0,E,1462464300,"[data structures, dsu]",PROGRAMMING
-670,Codeforces Round #350 (Div. 2),2,Restore a Number,2500.0,F,1462464300,"[constructive algorithms, strings]",PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Sleuth,500,A,1292601600,[implementation],PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Sum,1000,B,1292601600,[math],PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Disposition,1500,C,1292601600,"[constructive algorithms, math]",PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Game,2000,D,1292601600,"[brute force, dp, implementation]",PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Common ancestor,2500,E,1292601600,[dp],PROGRAMMING
+50,Codeforces Beta Round #47,12,Domino piling,500,A,1292862000,"[greedy, math]",PROGRAMMING
+50,Codeforces Beta Round #47,12,Choosing Symbol Pairs,1000,B,1292862000,[strings],PROGRAMMING
+50,Codeforces Beta Round #47,12,Happy Farm 5,1500,C,1292862000,[geometry],PROGRAMMING
+50,Codeforces Beta Round #47,12,Bombing,2000,D,1292862000,"[binary search, dp, probabilities]",PROGRAMMING
+50,Codeforces Beta Round #47,12,Square Equation Roots,2500,E,1292862000,[math],PROGRAMMING
+51,Codeforces Beta Round #48,12,Cheaterius's Problem,500,A,1293552000,[implementation],PROGRAMMING
+51,Codeforces Beta Round #48,12,bHTML Tables Analisys,1000,B,1293552000,[expression parsing],PROGRAMMING
+51,Codeforces Beta Round #48,12,Three Base Stations,1500,C,1293552000,"[binary search, greedy]",PROGRAMMING
+51,Codeforces Beta Round #48,12,Geometrical problem,2000,D,1293552000,[implementation],PROGRAMMING
+51,Codeforces Beta Round #48,12,Pentagon,2500,E,1293552000,"[combinatorics, graphs, matrices]",PROGRAMMING
+51,Codeforces Beta Round #48,12,Caterpillar,3000,F,1293552000,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+52,Codeforces Testing Round #1,12,123-sequence,500,A,1294160400,[implementation],PROGRAMMING
+52,Codeforces Testing Round #1,12,Right Triangles,1000,B,1294160400,[combinatorics],PROGRAMMING
+52,Codeforces Testing Round #1,12,Circular RMQ,1500,C,1294160400,[data structures],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Autocomplete,500,A,1294329600,[implementation],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Blog Photo,1000,B,1294329600,"[binary search, implementation]",PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Little Frog,1500,C,1294329600,[constructive algorithms],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Physical Education,2000,D,1294329600,[sortings],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Dead Ends,2500,E,1294329600,"[bitmasks, dp]",PROGRAMMING
+54,Codeforces Beta Round #50,12,Presents,500,A,1294733700,[implementation],PROGRAMMING
+54,Codeforces Beta Round #50,12,Cutting Jigsaw Puzzle,1000,B,1294733700,"[hashing, implementation]",PROGRAMMING
+54,Codeforces Beta Round #50,12,First Digit Law,1500,C,1294733700,"[dp, math, probabilities]",PROGRAMMING
+54,Codeforces Beta Round #50,12,Writing a Song,2000,D,1294733700,"[brute force, dp]",PROGRAMMING
+54,Codeforces Beta Round #50,12,Vacuum Сleaner,2500,E,1294733700,[geometry],PROGRAMMING
+55,Codeforces Beta Round #51,12,Flea travel,500,A,1294992000,"[implementation, math]",PROGRAMMING
+55,Codeforces Beta Round #51,12,Smallest number,1000,B,1294992000,[brute force],PROGRAMMING
+55,Codeforces Beta Round #51,12,Pie or die,1500,C,1294992000,[games],PROGRAMMING
+55,Codeforces Beta Round #51,12,Beautiful numbers,2000,D,1294992000,"[dp, number theory]",PROGRAMMING
+55,Codeforces Beta Round #51,12,Very simple problem,2500,E,1294992000,"[geometry, two pointers]",PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Bar,500,A,1295626200,[implementation],PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Spoilt Permutation,1000,B,1295626200,[implementation],PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Corporation Mail,1500,C,1295626200,"[data structures, expression parsing, implementation]",PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Changing a String,2000,D,1295626200,[dp],PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Domino Principle,2500,E,1295626200,"[binary search, data structures, sortings]",PROGRAMMING
+57,Codeforces Beta Round #53,12,Square Earth?,500,A,1295971200,"[dfs and similar, greedy, implementation]",PROGRAMMING
+57,Codeforces Beta Round #53,12,Martian Architecture,1000,B,1295971200,[implementation],PROGRAMMING
+57,Codeforces Beta Round #53,12,Array,1500,C,1295971200,"[combinatorics, math]",PROGRAMMING
+57,Codeforces Beta Round #53,12,Journey,2000,D,1295971200,"[dp, math]",PROGRAMMING
+57,Codeforces Beta Round #53,12,Chess,2500,E,1295971200,"[math, shortest paths]",PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Chat room,500,A,1296489600,"[greedy, strings]",PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Coins,1000,B,1296489600,[greedy],PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Trees,1500,C,1296489600,[brute force],PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Calendar,2000,D,1296489600,"[greedy, strings]",PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Expression,2500,E,1296489600,[dp],PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Word,500,A,1297440000,"[implementation, strings]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Fortune Telling,1000,B,1297440000,"[implementation, number theory]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Title,1500,C,1297440000,[expression parsing],PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Team Arrangement,2000,D,1297440000,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Shortest Path,2500,E,1297440000,"[graphs, shortest paths]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Where Are My Flakes?,500,A,1298131200,"[implementation, two pointers]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Serial Time!,1000,B,1298131200,"[dfs and similar, dsu]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Mushroom Strife,1500,C,1298131200,"[brute force, dfs and similar]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Savior,2000,D,1298131200,"[brute force, dsu, math]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Mushroom Gnomes,2500,E,1298131200,"[math, matrices]",PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Ultra-Fast Mathematician,500,A,1298390400,[implementation],PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Hard Work,1000,B,1298390400,[strings],PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Capture Valerian,1500,C,1298390400,[math],PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Eternal Victory,2000,D,1298390400,"[dfs and similar, graphs, greedy, shortest paths, trees]",PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Enemy is weak,2500,E,1298390400,"[data structures, trees]",PROGRAMMING
+62,Codeforces Beta Round #58,12,A Student's Dream,500,A,1298649600,"[greedy, math]",PROGRAMMING
+62,Codeforces Beta Round #58,12,Tyndex.Brome,1000,B,1298649600,"[binary search, implementation]",PROGRAMMING
+62,Codeforces Beta Round #58,12,Inquisition,1500,C,1298649600,"[geometry, implementation, sortings]",PROGRAMMING
+62,Codeforces Beta Round #58,12,Wormhouse,2000,D,1298649600,"[dfs and similar, graphs]",PROGRAMMING
+62,Codeforces Beta Round #58,12,World Evil,2500,E,1298649600,"[dp, flows]",PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Sinking Ship,500,A,1298908800,"[implementation, sortings, strings]",PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Settlers' Training,1000,B,1298908800,[implementation],PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Bulls and Cows,1500,C,1298908800,"[brute force, implementation]",PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Dividing Island,2000,D,1298908800,[constructive algorithms],PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Sweets Game,2500,E,1298908800,"[bitmasks, dfs and similar, dp, games, implementation]",PROGRAMMING
+64,Unknown Language Round #1,12,Factorial,,A,1298304000,"[*special, implementation]",PROGRAMMING
+64,Unknown Language Round #1,12,Expression,,B,1298304000,"[*special, expression parsing]",PROGRAMMING
+64,Unknown Language Round #1,12,Table,,C,1298304000,"[*special, greedy, implementation, math]",PROGRAMMING
+64,Unknown Language Round #1,12,Presents,,D,1298304000,"[*special, greedy]",PROGRAMMING
+64,Unknown Language Round #1,12,Prime Segment,,E,1298304000,"[*special, brute force]",PROGRAMMING
+64,Unknown Language Round #1,12,Domain,,F,1298304000,"[*special, expression parsing]",PROGRAMMING
+64,Unknown Language Round #1,12,Path Canonization,,G,1298304000,[*special],PROGRAMMING
+64,Unknown Language Round #1,12,Table Bowling,,H,1298304000,"[*special, sortings]",PROGRAMMING
+64,Unknown Language Round #1,12,Sort the Table,,I,1298304000,"[*special, sortings]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and Three Spells,500,A,1299340800,"[implementation, math]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and the History of Magic,1000,B,1299340800,"[brute force, greedy, implementation]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and the Golden Snitch,1500,C,1299340800,"[binary search, geometry]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and the Sorting Hat,2000,D,1299340800,"[brute force, dfs and similar, hashing]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and Moving Staircases,2500,E,1299340800,"[dfs and similar, implementation]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and Java,500,A,1299513600,"[implementation, strings]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and Countryside,1000,B,1299513600,"[brute force, implementation]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and File System,1500,C,1299513600,"[data structures, implementation]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and His Friends,2000,D,1299513600,"[constructive algorithms, math, number theory]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and Post,2500,E,1299513600,"[data structures, dp]",PROGRAMMING
+67,Manthan 2011,12,Partial Teacher,500,A,1300033800,"[dp, graphs, greedy, implementation]",PROGRAMMING
+67,Manthan 2011,12,Restoration of the Permutation,1000,B,1300033800,[greedy],PROGRAMMING
+67,Manthan 2011,12,Sequence of Balls,1500,C,1300033800,[dp],PROGRAMMING
+67,Manthan 2011,12,Optical Experiment,2000,D,1300033800,"[binary search, data structures, dp]",PROGRAMMING
+67,Manthan 2011,12,Save the City!,2500,E,1300033800,[geometry],PROGRAMMING
+68,Codeforces Beta Round #62,12,Irrational problem,500,A,1300464000,"[implementation, number theory]",PROGRAMMING
+68,Codeforces Beta Round #62,12,Energy exchange,1000,B,1300464000,[binary search],PROGRAMMING
+68,Codeforces Beta Round #62,12,Synchrophasotron,1500,C,1300464000,[brute force],PROGRAMMING
+68,Codeforces Beta Round #62,12,Half-decay tree,2000,D,1300464000,"[data structures, divide and conquer, dp, probabilities]",PROGRAMMING
+68,Codeforces Beta Round #62,12,Contact,2500,E,1300464000,[geometry],PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Young Physicist,500,A,1300809600,"[implementation, math]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Bets,1000,B,1300809600,"[greedy, implementation]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Game,1500,C,1300809600,[implementation],PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Dot,2000,D,1300809600,"[dp, games]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Subsegments,2500,E,1300809600,"[data structures, implementation]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Cookies,500,A,1301155200,[math],PROGRAMMING
+70,Codeforces Beta Round #64,12,Text Messaging,1000,B,1301155200,"[expression parsing, greedy, strings]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Lucky Tickets,1500,C,1301155200,"[binary search, data structures, sortings, two pointers]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Professor's task,2000,D,1301155200,"[data structures, geometry]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Information Reform,2500,E,1301155200,"[dp, implementation, trees]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Way Too Long Words,500,A,1301410800,[strings],PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Progress Bar,1000,B,1301410800,"[implementation, math]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Round Table Knights,1500,C,1301410800,"[dp, math, number theory]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Solitaire,2000,D,1301410800,"[brute force, implementation]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Nuclear Fusion,2500,E,1301410800,"[bitmasks, dp]",PROGRAMMING
+72,Unknown Language Round #2,12,"Goshtasp, Vishtasp and Eidi",,A,1300637400,"[*special, greedy, math]",PROGRAMMING
+72,Unknown Language Round #2,12,INI-file,,B,1300637400,"[*special, implementation]",PROGRAMMING
+72,Unknown Language Round #2,12,Extraordinarily Nice Numbers,,C,1300637400,"[*special, math]",PROGRAMMING
+72,Unknown Language Round #2,12,Perse-script,,D,1300637400,"[*special, expression parsing]",PROGRAMMING
+72,Unknown Language Round #2,12,Ali goes shopping,,E,1300637400,"[*special, brute force, strings]",PROGRAMMING
+72,Unknown Language Round #2,12,Oil,,F,1300637400,"[*special, greedy, math]",PROGRAMMING
+72,Unknown Language Round #2,12,Fibonacci army,,G,1300637400,"[*special, dp]",PROGRAMMING
+72,Unknown Language Round #2,12,Reverse It!,,H,1300637400,"[*special, implementation]",PROGRAMMING
+72,Unknown Language Round #2,12,Goofy Numbers,,I,1300637400,"[*special, implementation]",PROGRAMMING
+73,Codeforces Beta Round #66,12,The Elder Trolls IV: Oblivon,500,A,1302422400,"[greedy, math]",PROGRAMMING
+73,Codeforces Beta Round #66,12,Need For Brake,1000,B,1302422400,"[binary search, greedy, sortings]",PROGRAMMING
+73,Codeforces Beta Round #66,12,LionAge II,1000,C,1302422400,[dp],PROGRAMMING
+73,Codeforces Beta Round #66,12,FreeDiv,1500,D,1302422400,"[dfs and similar, graphs, greedy]",PROGRAMMING
+73,Codeforces Beta Round #66,12,Morrowindows,1500,E,1302422400,"[math, number theory]",PROGRAMMING
+73,Codeforces Beta Round #66,12,Plane of Tanks,2000,F,1302422400,"[brute force, geometry]",PROGRAMMING
+74,Codeforces Beta Round #68,12,Room Leader,500,A,1302879600,[implementation],PROGRAMMING
+74,Codeforces Beta Round #68,12,Train,1000,B,1302879600,"[dp, games, greedy]",PROGRAMMING
+74,Codeforces Beta Round #68,12,Chessboard Billiard,1500,C,1302879600,"[dfs and similar, dsu, graphs, number theory]",PROGRAMMING
+74,Codeforces Beta Round #68,12,Hanger,2000,D,1302879600,[data structures],PROGRAMMING
+74,Codeforces Beta Round #68,12,Shift It!,2500,E,1302879600,[constructive algorithms],PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Life Without Zeros,500,A,1302706800,[implementation],PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Facetook Priority Wall,1000,B,1302706800,"[expression parsing, implementation, strings]",PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Modified GCD,1500,C,1302706800,"[binary search, number theory]",PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Big Maximum Sum,2000,D,1302706800,"[data structures, dp, greedy, implementation, math, trees]",PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Ship's Shortest Path,2500,E,1302706800,"[geometry, shortest paths]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Gift,,A,1302609600,"[dsu, graphs, sortings, trees]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Mice,,B,1302609600,"[greedy, two pointers]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Mutation,,C,1302609600,"[bitmasks, dp, math]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Plus and xor,,D,1302609600,"[dp, greedy, math]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Points,,E,1302609600,"[implementation, math]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Tourist,,F,1302609600,"[binary search, data structures, dp]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Heroes,500,A,1303226100,"[brute force, implementation]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Falling Anvils,1000,B,1303226100,"[math, probabilities]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Beavermuncher-0xFF,1500,C,1303226100,"[dfs and similar, dp, dsu, greedy, trees]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Domino Carpet,2000,D,1303226100,"[dp, implementation]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Martian Food,2000,E,1303226100,[geometry],PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Haiku,500,A,1303916400,"[implementation, strings]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Easter Eggs,1000,B,1303916400,"[constructive algorithms, implementation]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Beaver Game,1500,C,1303916400,"[dp, games, number theory]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Archer's Shot,2000,D,1303916400,"[binary search, geometry, math, two pointers]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Evacuation,2500,E,1303916400,"[flows, graphs, shortest paths]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Bus Game,500,A,1304175600,[greedy],PROGRAMMING
+79,Codeforces Beta Round #71,12,Colorful Field,1000,B,1304175600,"[implementation, sortings]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Beaver,1500,C,1304175600,"[data structures, dp, greedy, hashing, strings, two pointers]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Password,2000,D,1304175600,"[bitmasks, dp, shortest paths]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Security System,2500,E,1304175600,[math],PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Panoramix's Prediction,500,A,1303226100,[brute force],PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Depression,1000,B,1303226100,"[geometry, math]",PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Heroes,1500,C,1303226100,"[brute force, implementation]",PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Falling Anvils,2000,D,1303226100,"[geometry, probabilities]",PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Beavermuncher-0xFF,2500,E,1303226100,[],PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Plug-in,500,A,1304485200,[implementation],PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Sequence Formatting,1000,B,1304485200,"[implementation, strings]",PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Average Score,1500,C,1304485200,"[math, sortings]",PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Polycarp's Picture Gallery,2000,D,1304485200,"[constructive algorithms, greedy]",PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Pairs,2500,E,1304485200,"[dfs and similar, dp, dsu, graphs, implementation, trees]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Double Cola,500,A,1304694000,"[implementation, math]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Sets,1000,B,1304694000,"[constructive algorithms, hashing, implementation]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,General Mobilization,1500,C,1304694000,"[data structures, dfs and similar, sortings]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Two out of Three,2000,D,1304694000,[dp],PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Corridor,2500,E,1304694000,[geometry],PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Magical Array,500,A,1305299400,[math],PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Doctor,1000,B,1305299400,"[binary search, math, sortings]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Track,1500,C,1305299400,"[graphs, greedy, shortest paths]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Numbers,2000,D,1305299400,"[dp, math, number theory]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Two Subsequences,2500,E,1305299400,"[bitmasks, dp]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Toy Army,500,A,1305299400,"[math, number theory]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Magical Array,1000,B,1305299400,"[combinatorics, implementation]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Biathlon,1500,C,1305299400,"[binary search, implementation]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Doctor,2000,D,1305299400,"[binary search, implementation]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Track,2500,E,1305299400,"[brute force, shortest paths]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Domino,500,A,1305903600,"[constructive algorithms, implementation]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Embassy Queue,1000,B,1305903600,[data structures],PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Petya and Tree,1500,C,1305903600,"[binary search, dfs and similar, probabilities, sortings, trees]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Sum of Medians,2000,D,1305903600,"[binary search, brute force, data structures, implementation]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Guard Towers,2500,E,1305903600,"[binary search, dsu, geometry, graphs, sortings]",PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Reflection,500,A,1306077000,[math],PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Tetris revisited,1000,B,1306077000,"[constructive algorithms, graph matchings, greedy, math]",PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Genetic engineering,2000,C,1306077000,"[dp, string suffix structures, trees]",PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Powerful array,2500,D,1306077000,"[data structures, implementation, math, two pointers]",PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Long sequence,2500,E,1306077000,"[brute force, math, matrices]",PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Trains,500,A,1307458800,[math],PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Vasya and Types,1000,B,1307458800,"[implementation, strings]",PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Interesting Game,1500,C,1307458800,"[dp, games]",PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Beautiful Road,2000,D,1307458800,"[dfs and similar, dp, dsu, implementation, sortings, trees]",PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Mogohu-Rea Idol,2500,E,1307458800,[geometry],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Chord,500,A,1307458800,"[brute force, implementation]",PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Keyboard,1000,B,1307458800,[implementation],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Trains,1500,C,1307458800,[number theory],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Vasya and Types,2000,D,1307458800,[implementation],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Interesting Game,2500,E,1307458800,[],PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Robbery,500,A,1308236400,[greedy],PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Widget Library,1000,B,1308236400,"[dp, expression parsing, graphs, implementation]",PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Chip Play,1000,C,1308236400,"[brute force, data structures, implementation]",PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Space mines,1500,D,1308236400,[geometry],PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Fire and Ice,2500,E,1308236400,[greedy],PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Cableway,500,A,1308236400,"[greedy, math]",PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,African Crossword,1000,B,1308236400,"[implementation, strings]",PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Robbery,1500,C,1308236400,"[greedy, math]",PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Widget Library,2000,D,1308236400,[],PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Chip Play,2000,E,1308236400,[],PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Newspaper Headline,500,A,1308582000,"[greedy, strings]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Queue,1000,B,1308582000,"[binary search, data structures]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Ski Base,1500,C,1308582000,"[combinatorics, dsu, graphs]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Grocer's Problem,2500,D,1308582000,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Igloo Skyscraper,2500,E,1308582000,"[data structures, geometry]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Chips,500,A,1308582000,"[implementation, math]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Binary Number,1000,B,1308582000,[greedy],PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Newspaper Headline,1500,C,1308582000,"[binary search, data structures, dp, greedy]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Queue,2000,D,1308582000,"[binary search, data structures, dp]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Ski Base,2500,E,1308582000,"[data structures, dsu, graphs]",PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Frames,500,A,1309446000,[implementation],PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,End of Exams,1000,B,1309446000,[greedy],PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Azembler,1500,C,1309446000,"[brute force, implementation]",PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Flags,2000,D,1309446000,"[dp, math, matrices]",PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Lostborn,2500,E,1309446000,"[dp, math]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Restoring Password,500,A,1309446000,"[implementation, strings]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Friends,1000,B,1309446000,"[implementation, math]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Frames,1500,C,1309446000,[math],PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,End of Exams,2000,D,1309446000,"[greedy, math]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Azembler,2500,E,1309446000,[brute force],PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Hockey,500,A,1310137200,"[implementation, strings]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Numbers,1000,B,1310137200,"[dp, greedy]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Volleyball,1500,C,1310137200,[shortest paths],PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Horse Races,2000,D,1310137200,"[dp, math]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Country,2500,E,1310137200,"[dp, dsu, graphs]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Football,500,A,1310137200,"[implementation, strings]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Lucky Numbers (easy),1000,B,1310137200,"[binary search, bitmasks, brute force]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Hockey,1500,C,1310137200,"[implementation, strings]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Volleyball,2000,D,1310137200,"[graphs, shortest paths]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Horse Races,2500,E,1310137200,[],PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Domino,500,A,1310731200,"[brute force, implementation]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Superset,1500,B,1310731200,"[constructive algorithms, divide and conquer]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Winning Strategy,2000,C,1310731200,"[binary search, graphs, math, shortest paths]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Robot in Basement,2000,D,1310731200,"[bitmasks, brute force, implementation]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Leaders,2500,E,1310731200,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Victoria the Wise,500,A,1311346800,"[brute force, implementation]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help King,1000,B,1311346800,"[implementation, probabilities, trees]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Greg the Dwarf,1500,C,1311346800,"[geometry, ternary search]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Monks,2000,D,1311346800,[constructive algorithms],PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Shrek and Donkey,2500,E,1311346800,"[dp, games, math, probabilities]",PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Far Away Kingdom,500,A,1311346800,[strings],PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Chef Gerasim,1000,B,1311346800,"[implementation, sortings]",PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Victoria the Wise,1500,C,1311346800,[brute force],PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help King,2000,D,1311346800,[],PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Greg the Dwarf,2500,E,1311346800,"[binary search, geometry, ternary search]",PROGRAMMING
+100,Unknown Language Round #3,12,Carpeting the Room,,A,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Friendly Numbers,,B,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,A+B,,C,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,World of Mouth,,D,1312005600,"[*special, strings]",PROGRAMMING
+100,Unknown Language Round #3,12,Lamps in a Line,,E,1312005600,"[*special, math]",PROGRAMMING
+100,Unknown Language Round #3,12,Polynom,,F,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Name the album,,G,1312005600,"[*special, data structures, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Battleship,,H,1312005600,"[*special, dfs and similar, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Rotation,,I,1312005600,"[*special, geometry, math]",PROGRAMMING
+100,Unknown Language Round #3,12,Interval Coloring,,J,1312005600,"[*special, greedy, math]",PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Homework,500,A,1312390800,[greedy],PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Buses,1000,B,1312390800,"[binary search, data structures, dp]",PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Vectors,1500,C,1312390800,"[implementation, math]",PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Castle,2000,D,1312390800,"[dp, greedy, probabilities, sortings, trees]",PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Candies and Stones,2500,E,1312390800,"[divide and conquer, dp]",PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Clothes,500,A,1312390800,[brute force],PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Sum of Digits,1000,B,1312390800,[implementation],PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Homework,1500,C,1312390800,[greedy],PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Buses,2000,D,1312390800,"[binary search, data structures, dp]",PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Vectors,2500,E,1312390800,[],PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Testing Pants for Sadness,500,A,1312714800,"[greedy, implementation, math]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Cthulhu,1000,B,1312714800,"[dfs and similar, dsu, graphs]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Russian Roulette,1500,C,1312714800,"[constructive algorithms, greedy]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Time to Raid Cowavans,2000,D,1312714800,"[brute force, data structures, sortings]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Buying Sets,2500,E,1312714800,"[flows, graph matchings]",PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Blackjack,500,A,1312714800,[implementation],PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Testing Pants for Sadness,1000,B,1312714800,[math],PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Cthulhu,1500,C,1312714800,"[dsu, trees]",PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Russian Roulette,2000,D,1312714800,[math],PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Time to Raid Cowavans,2500,E,1312714800,[],PROGRAMMING
+105,Codeforces Beta Round #81,12,Transmigration,500,A,1313247600,[implementation],PROGRAMMING
+105,Codeforces Beta Round #81,12,Dark Assembly,1000,B,1313247600,"[brute force, probabilities]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Item World,1500,C,1313247600,"[brute force, implementation, sortings]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Entertaining Geodetics,2000,D,1313247600,"[brute force, dsu, implementation]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Lift and Throw,2500,E,1313247600,[brute force],PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Card Game,500,A,1313766000,[implementation],PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Choosing Laptop,1000,B,1313766000,"[brute force, implementation]",PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Buns,1500,C,1313766000,"[chinese remainder theorem, geometry]",PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Treasure Island,2000,D,1313766000,"[brute force, implementation]",PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Space Rescuers,2500,E,1313766000,"[geometry, ternary search]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Dorm Water Supply,500,A,1314111600,"[dfs and similar, graphs]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Basketball Team,1000,B,1314111600,"[combinatorics, dp, probabilities]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Arrangement,1500,C,1314111600,"[bitmasks, dp]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Crime Management,2000,D,1314111600,"[dp, matrices]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Darts,2500,E,1314111600,"[geometry, probabilities]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Palindromic Times,500,A,1314111600,"[implementation, strings]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Datatypes,1000,B,1314111600,"[math, sortings]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Dorm Water Supply,1500,C,1314111600,"[dfs and similar, implementation]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Basketball Team,2000,D,1314111600,"[combinatorics, math, probabilities]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Arrangement,2500,E,1314111600,[],PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sum of Digits,500,A,1314633600,"[brute force, implementation]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Probability,1000,B,1314633600,"[brute force, probabilities]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Tree,1500,C,1314633600,"[dp, dsu, trees]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sorting,2000,D,1314633600,"[constructive algorithms, sortings]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Interval,2500,E,1314633600,"[brute force, math]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Nearly Lucky Number,500,A,1314633600,[implementation],PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky String,1000,B,1314633600,"[constructive algorithms, strings]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Sum of Digits,1500,C,1314633600,"[implementation, math]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Probability,2000,D,1314633600,"[brute force, combinatorics, dfs and similar, probabilities]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Tree,2500,E,1314633600,"[combinatorics, dfs and similar, trees]",PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Inequiations,500,A,1315051200,[greedy],PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Divisors,1000,B,1315051200,"[binary search, data structures, number theory]",PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Spiders,1500,C,1315051200,"[bitmasks, dp, dsu]",PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Coloring,2000,D,1315051200,"[combinatorics, dp]",PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Rectangle,2500,E,1315051200,[],PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Strings,500,A,1315051200,"[implementation, strings]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Square,1000,B,1315051200,"[implementation, math]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Inequiations,1500,C,1315051200,"[greedy, math]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Divisors,2000,D,1315051200,"[implementation, number theory]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Spiders,2500,E,1315051200,"[bitmasks, dp]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Grammar Lessons,500,A,1315494000,"[implementation, strings]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Petr#,1000,B,1315494000,"[brute force, data structures, hashing, strings]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Double Happiness,1500,C,1315494000,"[brute force, number theory]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Museum,2000,D,1315494000,"[matrices, probabilities]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Sleeping,2500,E,1315494000,"[combinatorics, implementation, math]",PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Cifera,500,A,1315494000,[math],PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,PFAST Inc.,1000,B,1315494000,"[bitmasks, brute force]",PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Grammar Lessons,1500,C,1315494000,[implementation],PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Petr#,2000,D,1315494000,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Double Happiness,2500,E,1315494000,[number theory],PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Party,500,A,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Lawnmower,1000,B,1316098800,"[greedy, sortings]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Plumber,1500,C,1316098800,[math],PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Unambiguous Arithmetic Expression,2000,D,1316098800,"[dp, expression parsing]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Linear Kingdom Races,2500,E,1316098800,"[data structures, dp]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Tram,500,A,1316098800,[implementation],PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Little Pigs and Wolves,1000,B,1316098800,"[greedy, implementation]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Party,1500,C,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Lawnmower,2000,D,1316098800,"[dp, greedy]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Plumber,2500,E,1316098800,[],PROGRAMMING
+117,Codeforces Beta Round #88,12,Elevator,500,A,1316790000,"[implementation, math]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Very Interesting Game,1000,B,1316790000,"[brute force, number theory]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Cycle,1500,C,1316790000,"[dfs and similar, graphs]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Not Quick Transformation,2000,D,1316790000,"[divide and conquer, math]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Tree or not Tree,2500,E,1316790000,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,String Task,500,A,1317999600,"[implementation, strings]",PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Present from Lena,1000,B,1317999600,"[constructive algorithms, implementation]",PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Fancy Number,1500,C,1317999600,"[brute force, greedy, sortings, strings]",PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Caesar's Legions,2000,D,1317999600,[dp],PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Bertown roads,2500,E,1317999600,"[dfs and similar, graphs]",PROGRAMMING
+119,Codeforces Beta Round #90,12,Epic Game,500,A,1318604400,[implementation],PROGRAMMING
+119,Codeforces Beta Round #90,12,Before Exam,1000,B,1318604400,"[constructive algorithms, implementation, sortings]",PROGRAMMING
+119,Codeforces Beta Round #90,12,Education Reform,1500,C,1318604400,[dp],PROGRAMMING
+119,Codeforces Beta Round #90,12,String Transformation,2000,D,1318604400,"[hashing, strings]",PROGRAMMING
+119,Codeforces Beta Round #90,12,Alternative Reality,2500,E,1318604400,[geometry],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Elevator,,A,1318919400,"[brute force, implementation, math]",PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Quiz League,,B,1318919400,[implementation],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Winnie-the-Pooh and honey,,C,1318919400,"[implementation, math]",PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Three Sons,,D,1318919400,[brute force],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Put Knight!,,E,1318919400,[games],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Spiders,,F,1318919400,"[dp, greedy, trees]",PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Boom,,G,1318919400,[implementation],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Brevity is Soul of Wit,,H,1318919400,[graph matchings],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Luck is in Numbers,,I,1318919400,[greedy],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Minimum Sum,,J,1318919400,"[divide and conquer, geometry, sortings]",PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Sum,500,A,1319727600,[implementation],PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Transformation,1000,B,1319727600,[strings],PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Permutation,1500,C,1319727600,"[brute force, combinatorics, number theory]",PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Segments,2000,D,1319727600,"[binary search, implementation, two pointers]",PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Array,2500,E,1319727600,[data structures],PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Division,500,A,1319727600,"[brute force, number theory]",PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Substring,1000,B,1319727600,"[brute force, implementation]",PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Sum,1500,C,1319727600,"[brute force, math]",PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Transformation,2000,D,1319727600,[brute force],PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Permutation,2500,E,1319727600,[],PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Prime Permutation,1000,A,1320333000,"[implementation, number theory, strings]",PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Squares,1000,B,1320333000,[math],PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Brackets,1500,C,1320333000,"[combinatorics, dp, greedy]",PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,String,2000,D,1320333000,[string suffix structures],PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Maze,2500,E,1320333000,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,The number of positions,500,A,1320333000,[math],PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Permutations,1000,B,1320333000,"[brute force, combinatorics, implementation]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Prime Permutation,2000,C,1320333000,"[constructive algorithms, dfs and similar, dsu, greedy, number theory, sortings, strings]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Squares,2000,D,1320333000,"[brute force, constructive algorithms, number theory]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Brackets,2500,E,1320333000,[],PROGRAMMING
+125,Codeforces Testing Round #2,12,Measuring Lengths in Baden,1000,A,1319893200,[math],PROGRAMMING
+125,Codeforces Testing Round #2,12,Simple XML,1500,B,1319893200,[implementation],PROGRAMMING
+125,Codeforces Testing Round #2,12,Hobbits' Party,2000,C,1319893200,"[constructive algorithms, greedy]",PROGRAMMING
+125,Codeforces Testing Round #2,12,Two progressions,3000,D,1319893200,"[constructive algorithms, greedy]",PROGRAMMING
+125,Codeforces Testing Round #2,12,MST Company,5000,E,1319893200,"[binary search, graphs]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Hot Bath,500,A,1320858000,"[binary search, brute force, math]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Password,1000,B,1320858000,"[binary search, dp, hashing, string suffix structures, strings]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,E-reader Display,1500,C,1320858000,"[constructive algorithms, greedy]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Fibonacci Sums,2000,D,1320858000,"[dp, math]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Pills,2500,E,1320858000,"[brute force, flows]",PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Wasted Time,500,A,1320858000,[geometry],PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Canvas Frames,1000,B,1320858000,[implementation],PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Hot Bath,1500,C,1320858000,"[binary search, math]",PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Password,2000,D,1320858000,"[hashing, strings]",PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,E-reader Display,2500,E,1320858000,[implementation],PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Statues,1000,A,1321337400,[dfs and similar],PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,String,1500,B,1321337400,"[brute force, constructive algorithms, hashing, string suffix structures, strings]",PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Games with Rectangle,1500,C,1321337400,"[combinatorics, dp]",PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Numbers,2000,D,1321337400,[constructive algorithms],PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Birthday,2500,E,1321337400,"[geometry, math]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Cookies,500,A,1321337400,[implementation],PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Students and Shoelaces,1000,B,1321337400,"[brute force, dfs and similar, graphs]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Statues,2000,C,1321337400,"[dfs and similar, graphs, implementation]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,String,2500,D,1321337400,"[implementation, string suffix structures, strings]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Games with Rectangle,2500,E,1321337400,"[combinatorics, dp]",PROGRAMMING
+130,Unknown Language Round #4,12,Hexagonal numbers,,A,1321801200,"[*special, implementation]",PROGRAMMING
+130,Unknown Language Round #4,12,Gnikool Ssalg,,B,1321801200,"[*special, implementation, strings]",PROGRAMMING
+130,Unknown Language Round #4,12,Decimal sum,,C,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Exponentiation,,D,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Tribonacci numbers,,E,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Prime factorization,,F,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,CAPS LOCK ON,,G,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Balanced brackets,,H,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Array sorting,,I,1321801200,"[*special, sortings]",PROGRAMMING
+130,Unknown Language Round #4,12,Date calculation,,J,1321801200,[*special],PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,cAPS lOCK,500,A,1322233200,"[implementation, strings]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Opposites Attract,1000,B,1322233200,"[implementation, math]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,The World is a Theatre,1500,C,1322233200,"[combinatorics, math]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Subway,2000,D,1322233200,"[dfs and similar, graphs]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Yet Another Task with Queens,2500,E,1322233200,[sortings],PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Present to Mom,2500,F,1322233200,"[binary search, two pointers]",PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Turing Tape,500,A,1322924400,[implementation],PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Piet,1500,B,1322924400,[implementation],PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Logo Turtle,1500,C,1322924400,[dp],PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Constants in the language of Shakespeare,2000,D,1322924400,"[constructive algorithms, dp, greedy]",PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Bits of merry old England,2500,E,1322924400,[flows],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,HQ9+,500,A,1322924400,[implementation],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Unary,1000,B,1322924400,[implementation],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Turing Tape,1500,C,1322924400,"[implementation, math]",PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Piet,2500,D,1322924400,[implementation],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Logo Turtle,2500,E,1322924400,"[dp, implementation]",PROGRAMMING
+134,Codeforces Testing Round #3,12,Average Numbers,500,A,1322838000,"[brute force, implementation]",PROGRAMMING
+134,Codeforces Testing Round #3,12,Pairs of Numbers,1000,B,1322838000,"[brute force, dfs and similar, math, number theory]",PROGRAMMING
+134,Codeforces Testing Round #3,12,Swaps,1500,C,1322838000,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Replacement,500,A,1323443100,"[implementation, sortings]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Rectangle and Square,1000,B,1323443100,"[brute force, geometry, math]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Zero-One,1500,C,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Cycle,2000,D,1323443100,"[brute force, dfs and similar, implementation]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Weak Subsequence,2500,E,1323443100,[combinatorics],PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Presents,500,A,1323443100,[implementation],PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Ternary Logic,1000,B,1323443100,"[implementation, math]",PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Replacement,1500,C,1323443100,"[implementation, sortings]",PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Rectangle and Square,2000,D,1323443100,"[geometry, implementation]",PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Zero-One,2500,E,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Postcards and photos,500,A,1324015200,[implementation],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Permutation,1000,B,1324015200,[greedy],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,History,1500,C,1324015200,[sortings],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Palindromes,2000,D,1324015200,[dp],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Last Chance,2500,E,1324015200,"[data structures, implementation]",PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Literature Lesson,500,A,1324728000,[implementation],PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Digits Permutations,1000,B,1324728000,[greedy],PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Mushroom Gnomes - 2,2000,C,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,World of Darkraft,2000,D,1324728000,"[dp, games]",PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Hellish Constraints,2500,E,1324728000,"[brute force, dp, two pointers]",PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Petr and Book,500,A,1324728000,[implementation],PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Wallpaper,1000,B,1324728000,"[implementation, math]",PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Literature Lesson,1500,C,1324728000,"[implementation, strings]",PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Digits Permutations,2000,D,1324728000,[implementation],PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Mushroom Gnomes - 2,3000,E,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Table,500,A,1325689200,"[geometry, math]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Cards,1000,B,1325689200,"[brute force, greedy, implementation]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Snowmen,1500,C,1325689200,"[binary search, data structures, greedy]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Contest,2000,D,1325689200,"[greedy, sortings]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Garland,2500,E,1325689200,"[combinatorics, dp]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Snowflake,3000,F,1325689200,"[geometry, sortings]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Amusing Joke,500,A,1326034800,"[implementation, sortings, strings]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Hopscotch,1000,B,1326034800,"[geometry, math]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Queue,2000,C,1326034800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Take-off Ramps,2000,D,1326034800,"[graphs, shortest paths]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Clearing Up,2500,E,1326034800,"[constructive algorithms, dp, dsu, graphs]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Farmer,500,A,1326380700,"[brute force, math]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help General,1000,B,1326380700,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Caretaker,1500,C,1326380700,"[brute force, dp]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Shrek and Donkey 2,2000,D,1326380700,[games],PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Greg the Dwarf 2,2500,E,1326380700,[geometry],PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Vasilisa the Wise 2,500,A,1326380700,"[brute force, math]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Kingdom of Far Far Away 2,1000,B,1326380700,"[implementation, strings]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Farmer,1500,C,1326380700,"[implementation, math]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help General,2000,D,1326380700,"[graph matchings, greedy, math]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Caretaker,2500,E,1326380700,[],PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Arrival of the General,500,A,1326899100,[implementation],PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Meeting,1000,B,1326899100,[implementation],PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Anagram Search,1500,C,1326899100,"[implementation, strings]",PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Missile Silos,2000,D,1326899100,"[data structures, dfs and similar, graphs, shortest paths]",PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Competition,2500,E,1326899100,"[data structures, greedy]",PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Conversion,500,A,1327215600,"[greedy, implementation]",PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Number 2,1000,B,1327215600,[constructive algorithms],PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Subsequence,1500,C,1327215600,"[combinatorics, dp, math]",PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Pair,2500,D,1327215600,"[combinatorics, data structures, implementation]",PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Queries,2500,E,1327215600,[data structures],PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Ticket,500,A,1327215600,[implementation],PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Mask,1000,B,1327215600,"[brute force, implementation]",PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Conversion,1500,C,1327215600,[greedy],PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Number 2,2000,D,1327215600,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Subsequence,2500,E,1327215600,"[combinatorics, dp]",PROGRAMMING
+147,Codeforces Testing Round #4,12,Punctuation,500,A,1325602800,"[implementation, strings]",PROGRAMMING
+147,Codeforces Testing Round #4,12,Smile House,1000,B,1325602800,"[binary search, graphs, matrices]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Insomnia cure,1000,A,1328198400,"[constructive algorithms, implementation, math]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Escape,1000,B,1328198400,"[implementation, math]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Terse princess,1000,C,1328198400,"[constructive algorithms, greedy]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Bag of mice,1000,D,1328198400,"[dp, games, math, probabilities]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Porcelain,1000,E,1328198400,[dp],PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Business trip,500,A,1328886000,"[greedy, implementation, sortings]",PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Martian Clock,1000,B,1328886000,[implementation],PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Division into Teams,1500,C,1328886000,"[greedy, math, sortings]",PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Coloring Brackets,2500,D,1328886000,[dp],PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Martian Strings,2500,E,1328886000,"[string suffix structures, strings]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Win or Freeze,500,A,1329490800,"[games, number theory]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Quantity of Strings,500,B,1329490800,"[combinatorics, dfs and similar, math]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Smart Cheater,1000,C,1329490800,"[data structures, math, probabilities]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Mission Impassable,1500,D,1329490800,[dp],PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Freezing with Style,3000,E,1329490800,"[binary search, data structures, divide and conquer, trees]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Soft Drinking,500,A,1329490800,[implementation],PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Phone Numbers,1000,B,1329490800,"[implementation, strings]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Win or Freeze,1500,C,1329490800,"[games, greedy, number theory]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Quantity of Strings,1500,D,1329490800,"[combinatorics, dsu]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Smart Cheater,3000,E,1329490800,[],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Marks,500,A,1329750000,[implementation],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Steps,1000,B,1329750000,"[binary search, implementation]",PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Pocket Book,1500,C,1329750000,[combinatorics],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Frames,2500,D,1329750000,[brute force],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Garden,2500,E,1329750000,"[bitmasks, dp, graphs, trees]",PROGRAMMING
+153,Surprise Language Round #5,12,A + B,,A,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Binary notation,,B,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Caesar Cipher,,C,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Date Change,,D,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Euclidean Distance,,E,1329922800,[*special],PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Hometask,500,A,1330095600,[greedy],PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Colliders,1000,B,1330095600,"[math, number theory]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Double Profiles,1500,C,1330095600,"[graphs, hashing, sortings]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Flatland Fencing,2000,D,1330095600,"[games, math]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Martian Colony,2500,E,1330095600,[geometry],PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,I_love_\%username\%,500,A,1330095600,[brute force],PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Combination,1000,B,1330095600,"[greedy, sortings]",PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Hometask,1500,C,1330095600,"[dp, greedy]",PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Colliders,2000,D,1330095600,"[math, number theory]",PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Double Profiles,2500,E,1330095600,"[hashing, sortings]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Message,500,A,1330536600,[brute force],PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Suspects,1000,B,1330536600,"[constructive algorithms, data structures, implementation]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Cipher,1500,C,1330536600,"[combinatorics, dp]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Clues,2500,D,1330536600,"[combinatorics, graphs]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Mrs. Hudson's Pancakes,2500,E,1330536600,"[brute force, dp]",PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Game Outcome,500,A,1330536600,[brute force],PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Trace,1000,B,1330536600,"[geometry, sortings]",PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Message,1500,C,1330536600,"[brute force, dp, strings]",PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Suspects,2000,D,1330536600,[implementation],PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Cipher,2500,E,1330536600,"[dp, math]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Next Round,500,A,1330804800,[implementation],PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Taxi,1000,B,1330804800,"[greedy, implementation]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Cd and pwd commands,1000,C,1330804800,"[data structures, implementation]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Ice Sculptures,1500,D,1330804800,"[brute force, number theory]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Phone Talks,2000,E,1330804800,"[dp, sortings]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Friends or Not,500,A,1331280000,"[*special, greedy, implementation]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Matchmaker,1000,B,1331280000,"[greedy, sortings]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,String Manipulation 1.0,1500,C,1331280000,"[binary search, brute force, data structures, strings]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Palindrome pairs,2000,D,1331280000,"[*special, brute force, dp, strings]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Zebra Tower,2500,E,1331280000,"[data structures, greedy, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Twins,500,A,1331046000,"[greedy, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Unlucky Ticket,1000,B,1331046000,"[greedy, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Find Pair,1500,C,1331046000,"[implementation, math, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Edges in MST,2000,D,1331046000,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Buses and People,2500,E,1331046000,"[binary search, data structures, sortings]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Dress'em in Vests!,1000,A,1331478300,"[binary search, brute force, greedy, two pointers]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Discounts,1000,B,1331478300,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Abracadabra,2000,C,1331478300,[divide and conquer],PROGRAMMING
+161,VK Cup 2012 Round 1,12,Distance in Tree,2000,D,1331478300,"[dfs and similar, dp, trees]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Polycarpus the Safecracker,2500,E,1331478300,"[brute force, dp]",PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Pentagonal numbers,,A,1332083400,"[*special, implementation]",PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Binary notation,,B,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Prime factorization,,C,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Remove digits,,D,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,HQ9+,,E,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Factorial zeros,,F,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Non-decimal sum,,G,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Alternating case,,H,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Truncatable primes,,I,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Brackets,,J,1332083400,[*special],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Substring and Subsequence,1000,A,1332687900,[dp],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Lemmings,1000,B,1332687900,[binary search],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Conveyor,1500,C,1332687900,[sortings],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Large Refrigerator,2000,D,1332687900,[brute force],PROGRAMMING
+163,VK Cup 2012 Round 2,12,e-Government,2500,E,1332687900,"[data structures, dfs and similar, dp, strings, trees]",PROGRAMMING
+164,VK Cup 2012 Round 3,12,"Variable, or There and Back Again",500,A,1333897500,"[dfs and similar, graphs]",PROGRAMMING
+164,VK Cup 2012 Round 3,12,Ancient Berland Hieroglyphs,1000,B,1333897500,[two pointers],PROGRAMMING
+164,VK Cup 2012 Round 3,12,Machine Programming,1500,C,1333897500,[flows],PROGRAMMING
+164,VK Cup 2012 Round 3,12,Minimum Diameter,2500,D,1333897500,"[binary search, brute force]",PROGRAMMING
+164,VK Cup 2012 Round 3,12,Polycarpus and Tasks,2500,E,1333897500,[],PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Supercentral Point,500,A,1331911800,[implementation],PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Burning Midnight Oil,1000,B,1331911800,"[binary search, implementation]",PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Another Problem on Strings,1500,C,1331911800,"[binary search, brute force, dp, math, strings, two pointers]",PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Beard Graph,2000,D,1331911800,"[data structures, dsu, trees]",PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Compatible Numbers,2500,E,1331911800,"[bitmasks, brute force, dfs and similar, dp]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Rank List,500,A,1332516600,"[binary search, implementation, sortings]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Polygons,3000,B,1332516600,"[geometry, sortings]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Median,1000,C,1332516600,"[greedy, math, sortings]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Shoe Store,3000,D,1332516600,"[dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Tetrahedron,1000,E,1332516600,"[dp, math, matrices]",PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Trolleybuses,500,A,1332860400,[implementation],PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Huge Prize,1000,B,1332860400,"[dp, probabilities]",PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Numbers,1500,C,1332860400,"[games, math]",PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Roads,2000,D,1332860400,"[data structures, divide and conquer, graph matchings]",PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Bets,2500,E,1332860400,"[math, matrices]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Demonstration,500,A,1332860400,[implementation],PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Minimal Spell,1000,B,1332860400,"[implementation, strings]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Trolleybuses,1500,C,1332860400,"[implementation, math]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Huge Prize,2000,D,1332860400,"[dp, probabilities]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Numbers,2500,E,1332860400,[],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Chores,500,A,1332687900,[sortings],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Replacing Digits,1000,B,1332687900,[greedy],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Substring and Subsequence,1500,C,1332687900,[dp],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Lemmings,2000,D,1332687900,[],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Conveyor,2500,E,1332687900,[],PROGRAMMING
+170,VK Cup 2012 Wild-card Round 2,12,Placing Rectangles,,A,1332954000,[*special],PROGRAMMING
+171,April Fools Day Contest,12,Mysterious numbers - 1,,A,1333292400,"[*special, constructive algorithms]",PROGRAMMING
+171,April Fools Day Contest,12,Star,,B,1333292400,"[*special, combinatorics]",PROGRAMMING
+171,April Fools Day Contest,12,A Piece of Cake,,C,1333292400,"[*special, implementation]",PROGRAMMING
+171,April Fools Day Contest,12,Broken checker,,D,1333292400,"[*special, brute force]",PROGRAMMING
+171,April Fools Day Contest,12,MYSTERIOUS LANGUAGE,,E,1333292400,[*special],PROGRAMMING
+171,April Fools Day Contest,12,ucyhf,,F,1333292400,"[*special, brute force, implementation, number theory]",PROGRAMMING
+171,April Fools Day Contest,12,Mysterious numbers - 2,,G,1333292400,[*special],PROGRAMMING
+171,April Fools Day Contest,12,A polyline,,H,1333292400,"[*special, implementation]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Phone Code,1000,A,1333440000,"[brute force, implementation]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Pseudorandom Sequence Period,1000,B,1333440000,"[implementation, number theory]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Bus,1500,C,1333440000,"[implementation, sortings]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Calendar Reform,1500,D,1333440000,[number theory],PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,BHTML+BCSS,2000,E,1333440000,"[dfs and similar, expression parsing]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Rock-Paper-Scissors,500,A,1333724400,"[implementation, math]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Chamber of Secrets,1000,B,1333724400,"[dfs and similar, shortest paths]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Spiral Maximum,1500,C,1333724400,"[brute force, dp]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Deputies,2000,D,1333724400,"[constructive algorithms, graphs, greedy, implementation]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Camping Groups,2500,E,1333724400,"[data structures, sortings]",PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Problem About Equation,500,A,1333897500,[math],PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,File List,1000,B,1333897500,"[dp, greedy, implementation]",PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Range Increments,1500,C,1333897500,"[data structures, greedy]",PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,"Variable, or There and Back Again",2500,D,1333897500,[graphs],PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Ancient Berland Hieroglyphs,3000,E,1333897500,[],PROGRAMMING
+175,Codeforces Round #115,12,Robot Bicorn Attack,500,A,1334390400,"[brute force, implementation]",PROGRAMMING
+175,Codeforces Round #115,12,Plane of Tanks: Pro,500,B,1334390400,[implementation],PROGRAMMING
+175,Codeforces Round #115,12,Geometry Horse,1000,C,1334390400,"[greedy, implementation, sortings]",PROGRAMMING
+175,Codeforces Round #115,12,Plane of Tanks: Duel,2500,D,1334390400,"[brute force, dp, probabilities]",PROGRAMMING
+175,Codeforces Round #115,12,Power Defence,3000,E,1334390400,"[brute force, dp, greedy]",PROGRAMMING
+175,Codeforces Round #115,12,Gnomes of Might and Magic,3000,F,1334390400,"[data structures, graphs, implementation, shortest paths]",PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Trading Business,500,A,1334934300,"[greedy, sortings]",PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Word Cut,1000,B,1334934300,[dp],PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Playing with Superglue,1500,C,1334934300,"[combinatorics, constructive algorithms]",PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Hyper String,2000,D,1334934300,[dp],PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Archaeology,2500,E,1334934300,"[data structures, dfs and similar, trees]",PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,30,A1,1335016800,[implementation],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,70,A2,1335016800,[implementation],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,30,B1,1335016800,[number theory],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,70,B2,1335016800,[number theory],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Party,30,C1,1335016800,"[dfs and similar, dsu, graphs]",PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Party,70,C2,1335016800,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,30,D1,1335016800,[brute force],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,70,D2,1335016800,[data structures],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Space Voyage,30,E1,1335016800,[binary search],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Space Voyage,70,E2,1335016800,[binary search],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Script Generation,30,F1,1335016800,[],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Script Generation,70,F2,1335016800,[],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,30,G1,1335016800,[strings],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,70,G2,1335016800,"[matrices, strings]",PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Educational Game,20,A1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Educational Game,30,A2,1335614400,[greedy],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Educational Game,50,A3,1335614400,[greedy],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,20,B1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,30,B2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,50,B3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,20,C1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,30,C2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,50,C3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Magic Squares,20,D1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Magic Squares,30,D2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Magic Squares,50,D3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,20,E1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,30,E2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,50,E3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,20,F1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,30,F2,1335614400,"[dp, sortings, strings]",PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,50,F3,1335614400,[],PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Defragmentation,,A,1335078000,[implementation],PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Divisibility Rules,,B,1335078000,"[math, number theory]",PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Letter,,C,1335078000,[dp],PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Name,,D,1335078000,"[greedy, strings]",PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Cubes,,E,1335078000,"[binary search, dp, two pointers]",PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Mathematical Analysis Rocks!,,F,1335078000,"[constructive algorithms, implementation, math]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Series of Crimes,500,A,1334934300,"[brute force, geometry, implementation]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Number of Triplets,1000,B,1334934300,"[binary search, brute force]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Trading Business,1500,C,1334934300,"[games, graph matchings, greedy]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Word Cut,2000,D,1334934300,[dp],PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Playing with Superglue,2500,E,1334934300,[games],PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Battlefield,3000,A,1335280200,"[geometry, graphs, implementation, shortest paths]",PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Vasya's Calendar,500,B,1335280200,[implementation],PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Optimal Sum,3000,C,1335280200,"[data structures, greedy]",PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Common Divisors,1000,D,1335280200,"[brute force, hashing, implementation, math, strings]",PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Wooden Fence,1500,E,1335280200,[dp],PROGRAMMING
+183,Croc Champ 2012 - Final,12,Headquarters,500,A,1335532800,"[constructive algorithms, math]",PROGRAMMING
+183,Croc Champ 2012 - Final,12,Zoo,1000,B,1335532800,"[brute force, geometry]",PROGRAMMING
+183,Croc Champ 2012 - Final,12,Cyclic Coloring,1500,C,1335532800,[dfs and similar],PROGRAMMING
+183,Croc Champ 2012 - Final,12,T-shirt,2000,D,1335532800,"[dp, greedy, probabilities]",PROGRAMMING
+183,Croc Champ 2012 - Final,12,Candy Shop,2500,E,1335532800,[greedy],PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Plant,500,A,1336145400,[math],PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Mushroom Scientists,1000,B,1336145400,"[math, ternary search]",PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Clever Fat Rat,1500,C,1336145400,[dp],PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Visit of the Great,2000,D,1336145400,"[math, number theory]",PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Soap Time! - 2,2500,E,1336145400,"[binary search, data structures]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Comparing Strings,500,A,1336145400,"[implementation, strings]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Growing Mushrooms,1000,B,1336145400,"[greedy, sortings]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Plant,1500,C,1336145400,"[dp, math, matrices, number theory]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Mushroom Scientists,2000,D,1336145400,"[math, number theory, probabilities]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Clever Fat Rat,2500,E,1336145400,[],PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,Permutations,500,A,1336663800,[greedy],PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,AlgoRace,1000,B,1336663800,"[dp, shortest paths]",PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,Weak Memory,1500,C,1336663800,"[dfs and similar, dsu]",PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,BRT Contract ,2000,D,1336663800,[data structures],PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,Heaven Tour,2500,E,1336663800,"[data structures, greedy]",PROGRAMMING
+188,Surprise Language Round #6,12,Hexagonal Numbers,,A,1337959800,[*special],PROGRAMMING
+188,Surprise Language Round #6,12,A + Reverse B,,B,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,LCM,,C,1337959800,"[*special, implementation, math]",PROGRAMMING
+188,Surprise Language Round #6,12,Asterisks,,D,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,HQ9+,,E,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,Binary Notation,,F,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,Array Sorting,,G,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,Stack,,H,1337959800,"[*special, expression parsing, implementation]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Cut Ribbon,500,A,1336663800,"[brute force, dp]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Counting Rhombi,1000,B,1336663800,"[brute force, math]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Permutations,1500,C,1336663800,"[greedy, implementation]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,AlgoRace,2000,D,1336663800,"[dp, shortest paths]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Weak Memory,2500,E,1336663800,"[binary search, shortest paths]",PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Vasya and the Bus,500,A,1337182200,"[greedy, math]",PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Surrounded,1000,B,1337182200,[geometry],PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,STL,1500,C,1337182200,[dfs and similar],PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Non-Secret Cypher,2000,D,1337182200,[two pointers],PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Counter Attack,2500,E,1337182200,"[data structures, dsu, graphs, hashing, sortings]",PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Dynasty Puzzles,500,A,1338132600,[dp],PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Demonstration,1000,B,1338132600,[greedy],PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Fools and Roads,1500,C,1338132600,"[data structures, dfs and similar, trees]",PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Metro Scheme,2000,D,1338132600,"[graphs, greedy]",PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Thwarting Demonstrations,2500,E,1338132600,"[binary search, data structures, trees]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Funky Numbers,500,A,1338132600,"[binary search, brute force, implementation]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Walking in the Rain,1000,B,1338132600,"[brute force, implementation]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Dynasty Puzzles,1500,C,1338132600,[dp],PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Demonstration,2000,D,1338132600,"[brute force, constructive algorithms]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Fools and Roads,2500,E,1338132600,"[data structures, trees]",PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Cutting Figure,500,A,1338737400,"[2-sat, chinese remainder theorem, trees]",PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Xor,1000,B,1338737400,[brute force],PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Hamming Distance,2000,C,1338737400,"[constructive algorithms, greedy, math, matrices]",PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Two Segments,2000,D,1338737400,[data structures],PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Fibonacci Number,2500,E,1338737400,"[brute force, math, matrices]",PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Exams,500,A,1338737400,"[implementation, math]",PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Square,1000,B,1338737400,[math],PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Cutting Figure,1500,C,1338737400,"[dfs and similar, graphs, implementation, matrices, strings]",PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Xor,2000,D,1338737400,[],PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Hamming Distance,3000,E,1338737400,[math],PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Let's Watch Football,500,A,1339342200,"[binary search, brute force, math]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,After Training,1000,B,1339342200,"[data structures, implementation, math]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Try and Catch,1500,C,1339342200,"[expression parsing, implementation]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Analyzing Polyline,2000,D,1339342200,"[math, sortings]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Building Forest,2500,E,1339342200,"[data structures, dsu]",PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Lexicographically Maximum Subsequence,500,A,1339506000,[greedy],PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Infinite Maze,1000,B,1339506000,[dfs and similar],PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Paint Tree,1500,C,1339506000,"[divide and conquer, geometry, sortings, trees]",PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,The Next Good String,3000,D,1339506000,"[data structures, greedy, hashing, strings]",PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Opening Portals,2500,E,1339506000,"[dsu, graphs, shortest paths]",PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Plate Game,1000,A,1339506000,"[constructive algorithms, games, math]",PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Limit,500,B,1339506000,[math],PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Lexicographically Maximum Subsequence,500,C,1339506000,"[greedy, implementation, sortings]",PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Infinite Maze,3000,D,1339506000,[hashing],PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Paint Tree,3000,E,1339506000,"[constructive algorithms, dfs and similar, geometry]",PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,About Bacteria,500,A,1340379000,"[implementation, math]",PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Jumping on Walls,1000,B,1340379000,[shortest paths],PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Delivering Carcinogen,1500,C,1340379000,"[binary search, geometry]",PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Cube Snake,2000,D,1340379000,[constructive algorithms],PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Gripping Story,2500,E,1340379000,"[binary search, data structures, sortings]",PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Hexadecimal's theorem,500,A,1340379000,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Special Olympics,1000,B,1340379000,[geometry],PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,About Bacteria,1500,C,1340379000,[math],PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Jumping on Walls,2000,D,1340379000,"[dfs and similar, shortest paths]",PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Delivering Carcinogen,2500,E,1340379000,"[binary search, geometry]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Cinema,3000,A,1340551800,"[brute force, data structures]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Drinks,500,B,1340551800,"[implementation, math]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Football Championship,2000,C,1340551800,"[brute force, implementation]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Programming Language,1500,D,1340551800,"[binary search, brute force, expression parsing, implementation]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Tractor College,3000,E,1340551800,"[implementation, math, number theory, ternary search]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Clear Symmetry,1000,A,1340983800,"[constructive algorithms, dp, math]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Guess That Car!,1000,B,1340983800,"[math, ternary search]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Fragile Bridges,1500,C,1340983800,[dp],PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Brand New Problem,2000,D,1340983800,"[bitmasks, brute force, dp]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Thoroughly Bureaucratic Organization,2500,E,1340983800,"[binary search, combinatorics]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,LLPS,500,A,1340983800,"[binary search, bitmasks, brute force, greedy, implementation, strings]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Brand New Easy Problem,1000,B,1340983800,[brute force],PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Clear Symmetry,2000,C,1340983800,"[binary search, math]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Guess That Car!,2000,D,1340983800,"[dp, math]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Fragile Bridges,2500,E,1340983800,"[data structures, dp]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Two Problems,500,A,1341329400,"[brute force, implementation]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Game on Paper,1000,B,1341329400,"[brute force, implementation]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Photographer,1500,C,1341329400,"[greedy, sortings]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Hit Ball,2000,D,1341329400,"[geometry, implementation, math]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Transportation,2500,E,1341329400,"[greedy, sortings, two pointers]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Interval,500,A,1342020600,"[binary search, combinatorics, dp]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Cards,500,B,1342020600,"[binary search, data structures]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Furik and Rubik,1500,C,1342020600,"[math, probabilities]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Retro Strings,2000,D,1342020600,[dp],PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Strings,2500,E,1342020600,"[data structures, implementation, string suffix structures, two pointers]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Rozdil,500,A,1342020600,"[brute force, implementation]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Sorting,1000,B,1342020600,"[brute force, greedy]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Interval,1500,C,1342020600,"[binary search, brute force, combinatorics, dp, math]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Cards,1500,D,1342020600,"[binary search, brute force, sortings]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Furik and Rubik,2500,E,1342020600,"[brute force, combinatorics, probabilities]",PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,20,A1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,30,A2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,50,A3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Military Trainings,20,B1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Military Trainings,30,B2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Military Trainings,50,B3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,20,C1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,30,C2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,50,C3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D10,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D4,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D5,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D6,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D7,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D8,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D9,1341576900,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,20,A1,1341730800,[greedy],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,30,A2,1341730800,[greedy],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,50,A3,1341730800,[greedy],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,20,B1,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,30,B2,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,50,B3,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,20,C1,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,30,C2,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,50,C3,1341730800,[data structures],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D1,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D10,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D2,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D3,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D4,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D5,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D6,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D7,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D8,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D9,1341730800,[],PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Dubstep,500,A,1343057400,[strings],PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Solitaire,2000,B,1343057400,"[dfs and similar, dp]",PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Police Station,2500,C,1343057400,"[dp, graphs, shortest paths]",PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,"Prizes, Prizes, more Prizes",500,D,1343057400,[implementation],PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Blood Cousins,3000,E,1343057400,"[binary search, data structures, dfs and similar, trees]",PROGRAMMING
+209,"VK Cup 2012 Finals, Practice Session",12,Multicolored Marbles,500,A,1342252500,"[dp, math]",PROGRAMMING
+209,"VK Cup 2012 Finals, Practice Session",12,Pixels,500,B,1342252500,"[constructive algorithms, math]",PROGRAMMING
+209,"VK Cup 2012 Finals, Practice Session",12,Trails and Glades,1000,C,1342252500,"[constructive algorithms, dsu, graphs, greedy]",PROGRAMMING
+211,VK Cup 2012 Finals,12,Privatization,3000,A,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,Polycarpus is Looking for Good Substrings,1000,B,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,Cowboys,500,C,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,Cutting a Fence,1000,D,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,IT Restaurants,500,E,1342335600,[],PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Privatization,3000,A,1342450800,"[flows, graphs]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Polycarpus is Looking for Good Substrings,2000,B,1342450800,"[bitmasks, hashing, implementation]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Cowboys,1500,C,1342450800,"[dp, math]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Cutting a Fence,2500,D,1342450800,"[binary search, data structures, dsu]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,IT Restaurants,500,E,1342450800,"[dfs and similar, dp, trees]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Game,1000,A,1343662200,"[dfs and similar, greedy]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Numbers,1000,B,1343662200,"[combinatorics, dp]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Relay Race,1500,C,1343662200,[dp],PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Stars,2000,D,1343662200,"[constructive algorithms, geometry]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Two Permutations,2500,E,1343662200,"[data structures, hashing, strings]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,System of Equations,500,A,1343662200,[brute force],PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Hometask,1000,B,1343662200,"[brute force, constructive algorithms, greedy, math]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Game,2000,C,1343662200,"[brute force, greedy]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Numbers,2000,D,1343662200,"[combinatorics, dp, math]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Relay Race,2500,E,1343662200,[dp],PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Bicycle Chain,500,A,1344267000,"[brute force, implementation]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Olympic Medal,500,B,1344267000,"[greedy, math]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Crosses,3000,C,1344267000,"[brute force, implementation]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Hot Days,2000,D,1344267000,[greedy],PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Periodical Numbers,3000,E,1344267000,"[combinatorics, dp, number theory]",PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Tiling with Hexagons,500,A,1344958200,"[implementation, math]",PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Forming Teams,1500,B,1344958200,"[dfs and similar, implementation]",PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Hiring Staff,2000,C,1344958200,[greedy],PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Spider's Web,2000,D,1344958200,"[binary search, sortings, two pointers]",PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Martian Luck,3000,E,1344958200,"[math, number theory]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Ice Skating,500,A,1345273500,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Blackboard Fibonacci,1000,B,1345273500,"[brute force, math]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Formurosa,2500,C,1345273500,"[divide and conquer, dp, expression parsing]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Bitonix' Patrol,3000,D,1345273500,"[bitmasks, brute force, combinatorics, dfs and similar, math]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Alien DNA,3000,E,1345273500,"[data structures, dsu, trees]",PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Mountain Scenery,500,A,1345273500,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Airport,500,B,1345273500,[implementation],PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Ice Skating,1000,C,1345273500,"[dfs and similar, dsu, graphs]",PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Blackboard Fibonacci,3000,D,1345273500,[implementation],PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Formurosa,3000,E,1345273500,[],PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,k-String,500,A,1346081400,"[implementation, strings]",PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Special Offer! Super Price 999 Bourles!,1000,B,1346081400,[implementation],PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Color Stripe,1500,C,1346081400,"[brute force, dp, greedy]",PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Choosing Capital for Treeland,2000,D,1346081400,"[dfs and similar, dp, trees]",PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Parking Lot,3000,E,1346081400,[data structures],PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Problem,500,A,1346427000,"[implementation, sortings]",PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Array,1000,B,1346427000,"[constructive algorithms, data structures]",PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Shifts,1500,C,1346427000,[data structures],PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Triangle,2000,D,1346427000,"[chinese remainder theorem, geometry, math]",PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Inversions,2500,E,1346427000,"[data structures, two pointers]",PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Function,500,A,1346427000,"[implementation, math]",PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Numbers,1000,B,1346427000,[implementation],PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Problem,1500,C,1346427000,[sortings],PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Array,2000,D,1346427000,[data structures],PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Shifts,2500,E,1346427000,[],PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Shooshuns and Sequence ,500,A,1347291900,"[brute force, implementation]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Cosmic Tables,1000,B,1347291900,[implementation],PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Reducing Fractions,1500,C,1347291900,"[implementation, number theory, sortings]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Olympiad,2000,D,1347291900,"[binary search, greedy, sortings, two pointers]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Decoding Genome,2500,E,1347291900,[matrices],PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Bracket Sequence,500,A,1347809400,"[data structures, expression parsing, implementation]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Two Strings,1000,B,1347809400,"[data structures, dp, strings]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Partial Sums,1500,C,1347809400,"[combinatorics, math]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Spider,2000,D,1347809400,"[geometry, graphs]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Planar Graph,2500,E,1347809400,"[flows, geometry, graphs]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Parallelepiped,500,A,1347809400,"[brute force, math]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Array,1000,B,1347809400,"[bitmasks, implementation, two pointers]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Bracket Sequence,1500,C,1347809400,[data structures],PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Two Strings,2000,D,1347809400,"[data structures, strings]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Partial Sums,2500,E,1347809400,"[combinatorics, math]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Dice Tower,500,A,1348069500,"[constructive algorithms, greedy]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Well-known Numbers,1000,B,1348069500,"[binary search, greedy, number theory]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Barcode,1500,C,1348069500,"[dp, matrices]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Snake,3000,D,1348069500,"[bitmasks, dfs and similar, graphs, implementation]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Unsolvable,3000,E,1348069500,"[math, number theory]",PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Flying Saucer Segments,500,A,1348500600,[math],PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Naughty Stone Piles,1000,B,1348500600,[greedy],PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Anniversary,1500,C,1348500600,"[data structures, implementation, math, matrices, number theory]",PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,The table,2000,D,1348500600,"[constructive algorithms, greedy]",PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Noble Knight's Path,2500,E,1348500600,"[data structures, trees]",PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Where do I Turn?,500,A,1348500600,[geometry],PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Effective Approach,1000,B,1348500600,[implementation],PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Flying Saucer Segments,1500,C,1348500600,[math],PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Naughty Stone Piles,2000,D,1348500600,"[math, sortings]",PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Anniversary,2500,E,1348500600,"[matrices, number theory]",PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Is your horseshoe on the other hoof?,500,A,1348759800,[implementation],PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Two Tables,1000,B,1348759800,"[brute force, implementation]",PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Fractal Detector,1500,C,1348759800,"[dp, hashing]",PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Zigzag,2000,D,1348759800,[data structures],PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,The Road to Berland is Paved With Good Intentions,2500,E,1348759800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Shifts,500,A,1349105400,"[brute force, two pointers]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Planets,500,B,1349105400,"[binary search, data structures, shortest paths]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Triangles,1000,C,1349105400,"[combinatorics, graphs, math]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Towers,1000,D,1349105400,"[dp, greedy, two pointers]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Gifts,3000,E,1349105400,"[combinatorics, dp, probabilities]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Dragons,500,A,1349105400,"[greedy, sortings]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,T-primes,500,B,1349105400,"[implementation, math, number theory]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Shifts,1500,C,1349105400,"[binary search, data structures, dp, implementation]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Planets,2500,D,1349105400,"[binary search, graphs, shortest paths]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Triangles,3000,E,1349105400,"[combinatorics, graphs, math]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,Team,500,A,1349623800,"[brute force, greedy]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,"Magic, Wizardry and Wonders",1000,B,1349623800,"[constructive algorithms, greedy]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,To Add or Not to Add,1500,C,1349623800,"[binary search, sortings, two pointers]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,Magic Box,2000,D,1349623800,"[brute force, geometry]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,Cactus,2500,E,1349623800,"[data structures, dfs and similar, dp, graphs, trees]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Cycles,500,A,1349969400,"[binary search, constructive algorithms, graphs, greedy]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Table,1000,B,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Doe Graphs,1500,C,1349969400,"[constructive algorithms, divide and conquer, dp, graphs, shortest paths]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Fence,2000,D,1349969400,"[binary search, data structures, string suffix structures]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Quick Tortoise,2500,E,1349969400,"[bitmasks, divide and conquer, dp]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Perfect Permutation,500,A,1349969400,"[implementation, math]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Non-square Equation,1000,B,1349969400,"[binary search, brute force, math]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Cycles,1500,C,1349969400,"[combinatorics, graphs, matrices]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Table,2000,D,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Doe Graphs,2500,E,1349969400,[],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Lefthanders and Righthanders ,,A,1350370800,[implementation],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Reading,,B,1350370800,[sortings],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Weather,,C,1350370800,"[dp, implementation]",PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Cinema,,D,1350370800,[implementation],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Champions' League,,E,1350370800,[implementation],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Fence,,F,1350370800,[dp],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Practice,,G,1350370800,"[constructive algorithms, divide and conquer, implementation]",PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Merging Two Decks,,H,1350370800,"[constructive algorithms, greedy]",PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,LCM Challenge,500,A,1350803400,[number theory],PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Let's Play Osu!,1000,B,1350803400,"[dp, math, probabilities]",PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Cyclical Quest,1500,C,1350803400,"[string suffix structures, strings]",PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Graph Game,2000,D,1350803400,[graphs],PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Number Challenge,2500,E,1350803400,"[combinatorics, dp, implementation, number theory]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Boy or Girl,500,A,1350803400,[implementation],PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Easy Number Challenge,1000,B,1350803400,"[implementation, number theory]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,LCM Challenge,1500,C,1350803400,"[greedy, number theory]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Let's Play Osu!,2000,D,1350803400,"[dp, probabilities]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Cyclical Quest,2500,E,1350803400,[],PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Free Cash,500,A,1351179000,[implementation],PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Young Table,1000,B,1351179000,"[implementation, sortings]",PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Primes on Interval,1500,C,1351179000,"[binary search, number theory, two pointers]",PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,T-decomposition,2000,D,1351179000,"[dfs and similar, graphs, greedy]",PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Build String,2500,E,1351179000,"[flows, graphs]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Not Wool Sequences,500,A,1352044800,"[constructive algorithms, math]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Boring Partition,1000,B,1352044800,[constructive algorithms],PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,World Eater Brothers,1500,C,1352044800,"[dfs and similar, dp, greedy, trees]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Tape Programming,2000,D,1352044800,"[data structures, implementation]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Meeting Her,2500,E,1352044800,"[dp, graphs, shortest paths]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Two Bags of Potatoes,500,A,1352044800,"[greedy, implementation, math]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Easy Tape Programming,1000,B,1352044800,"[brute force, implementation]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Not Wool Sequences,1500,C,1352044800,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Boring Partition,2000,D,1352044800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,World Eater Brothers,2500,E,1352044800,[],PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Cinema,,A,1350370800,[implementation],PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Fence,,B,1350370800,[dp],PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Practice,,C,1350370800,"[constructive algorithms, implementation]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Merging Two Decks,,D,1350370800,"[constructive algorithms, greedy]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Road Repairs,,E,1350370800,"[dfs and similar, graphs, greedy]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,TorCoder,,F,1350370800,[data structures],PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Old Peykan,,A,1351783800,[greedy],PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Friends,,B,1351783800,"[binary search, bitmasks, data structures, math]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Mirror Box,,C,1351783800,"[geometry, implementation]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Numbers,,D,1351783800,[],PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Flights,,E,1351783800,"[graphs, shortest paths]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Race,,F,1351783800,"[brute force, implementation]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Challenging Balloons,,G,1351783800,[constructive algorithms],PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,Heads or Tails,500,A,1352647800,"[brute force, implementation]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,Big Segment,1000,B,1352647800,"[implementation, sortings]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,King's Path,1500,C,1352647800,"[dfs and similar, hashing, shortest paths]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,Dispute,2000,D,1352647800,"[dfs and similar, greedy]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,XOR on Segment,2500,E,1352647800,"[bitmasks, data structures]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,The Brand New Function,500,A,1353079800,[bitmasks],PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Hydra,1000,B,1353079800,"[graphs, sortings]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Colorado Potato Beetle,1500,C,1353079800,"[dfs and similar, implementation]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Cubes,2000,D,1353079800,"[data structures, dp, geometry, two pointers]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Matrix,2500,E,1353079800,[data structures],PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Dividing Orange,500,A,1353079800,[implementation],PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Undoubtedly Lucky Numbers,1000,B,1353079800,"[bitmasks, brute force, dfs and similar]",PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,The Brand New Function,1500,C,1353079800,"[bitmasks, divide and conquer, math]",PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Hydra,2000,D,1353079800,[],PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Colorado Potato Beetle,2500,E,1353079800,[],PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,System Administrator,,A,1353339000,[implementation],PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Internet Address,,B,1353339000,"[implementation, strings]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Game with Coins,,C,1353339000,[greedy],PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Restoring Table,,D,1353339000,"[constructive algorithms, greedy]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Mishap in Club,,E,1353339000,[implementation],PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Log Stream Analysis,,F,1353339000,"[binary search, brute force, implementation, strings]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Suggested Friends,,G,1353339000,"[brute force, graphs]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Queries for Number of Palindromes,,H,1353339000,"[dp, hashing, strings]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Buggy Sorting,500,A,1353511800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Increase and Decrease,1000,B,1353511800,"[greedy, math]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Beauty Pageant,1500,C,1353511800,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Colorful Graph,2000,D,1353511800,"[brute force, dfs and similar, graphs]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Blood Cousins Return,2500,E,1353511800,"[binary search, data structures, dfs and similar, dp, sortings]",PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Paper Work,500,A,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Restoring IPv6,1000,B,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Movie Critics,1500,C,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Building Bridge,1500,D,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Mad Joe,2000,E,1353927300,[],PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Cupboards,500,A,1353857400,[implementation],PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Chilly Willy,1000,B,1353857400,"[math, number theory]",PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Robo-Footballer,2000,C,1353857400,"[binary search, geometry]",PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Sweets for Everyone!,2000,D,1353857400,"[binary search, greedy, implementation]",PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Piglet's Birthday,2500,E,1353857400,"[dp, probabilities]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Robo-Footballer,1000,A,1353857400,[geometry],PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Sweets for Everyone!,1000,B,1353857400,"[binary search, greedy]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Piglet's Birthday,1500,C,1353857400,"[dp, probabilities]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Donkey and Stars,1500,D,1353857400,"[data structures, dp, math, sortings]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Endless Matrix,2500,E,1353857400,[math],PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Paper Work,500,A,1353938400,[greedy],PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Restoring IPv6,1000,B,1353938400,"[implementation, strings]",PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Movie Critics,1500,C,1353938400,[greedy],PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Building Bridge,1500,D,1353938400,"[geometry, ternary search, two pointers]",PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Mad Joe,2000,E,1353938400,[brute force],PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Points on Line,500,A,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Playing with Permutations,1000,B,1354807800,"[implementation, math]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Number Transformation,1500,C,1354807800,"[dp, greedy, number theory]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Two Sets,2000,D,1354807800,"[bitmasks, math]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Tree and Table,2500,E,1354807800,"[dfs and similar, dp, implementation, trees]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Little Xor,500,A,1354807800,"[brute force, implementation]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Unsorting Array,1000,B,1354807800,"[brute force, sortings]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Points on Line,1500,C,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Playing with Permutations,2000,D,1354807800,"[brute force, combinatorics, implementation]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Number Transformation,2500,E,1354807800,"[dp, number theory]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Boys and Girls,500,A,1354960800,[greedy],PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Physics Practical,1000,B,1354960800,"[binary search, dp, two pointers]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Text Editor,1500,C,1354960800,"[data structures, dfs and similar, greedy, shortest paths]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Table with Letters - 2,2000,D,1354960800,"[brute force, two pointers]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Printer,2500,E,1354960800,"[binary search, data structures, implementation, sortings]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Cards with Numbers,500,A,1355047200,"[constructive algorithms, sortings]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Jury Size,1000,B,1355047200,"[brute force, implementation]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Anagram,1500,C,1355047200,[greedy],PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Rats,2000,D,1355047200,"[brute force, dfs and similar, implementation]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Dormitory,2500,E,1355047200,"[dp, implementation]",PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Greg's Workout,500,A,1355671800,[implementation],PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Code Parsing,1000,B,1355671800,[implementation],PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Almost Arithmetical Progression,1500,C,1355671800,"[brute force, dp]",PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Mr. Bender and Square,2000,D,1355671800,"[binary search, implementation, math]",PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Furlo and Rublo and Game,2500,E,1355671800,"[games, implementation, math]",PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Almost Arithmetical Progression,500,A,1355671800,"[binary search, dp, two pointers]",PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Mr. Bender and Square,1000,B,1355671800,"[binary search, brute force, math]",PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Furlo and Rublo and Game,1500,C,1355671800,[games],PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Liars and Serge,2000,D,1355671800,[dp],PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Lucky Arrays,2500,E,1355671800,[data structures],PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Sockets,500,A,1357659000,"[greedy, implementation, sortings]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Playing Cubes,500,B,1357659000,"[games, greedy, implementation]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,View Angle,1500,C,1357659000,"[brute force, geometry, math]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Sum,2000,D,1357659000,"[greedy, math]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Greedy Elevator,3000,E,1357659000,"[data structures, implementation]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Bits,500,A,1356190200,"[greedy, math]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Elections,1000,B,1356190200,"[brute force, combinatorics, dp]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and LCM,1500,C,1356190200,"[binary search, combinatorics, dp, math]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Broken Sorting,2000,D,1356190200,"[dp, math, probabilities]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Tree,2500,E,1356190200,"[data structures, dfs and similar, trees]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Chess,500,A,1356190200,"[brute force, strings]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Magic Square,1000,B,1356190200,"[brute force, implementation]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Bits,1500,C,1356190200,"[greedy, strings]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Elections,2000,D,1356190200,"[brute force, combinatorics, dp, math]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and LCM,2500,E,1356190200,"[binary search, combinatorics, math]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Adding Digits,500,A,1356622500,"[implementation, math]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Ancient Prophesy,1000,B,1356622500,"[brute force, implementation, strings]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Balls and Boxes,1500,C,1356622500,"[greedy, implementation]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Black and White Tree,2000,D,1356622500,"[constructive algorithms, dsu, graphs, greedy, trees]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Dividing Kingdom,2500,E,1356622500,"[binary search, brute force, data structures]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Discounts,500,A,1358091000,"[greedy, sortings]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Restaurant,1000,B,1358091000,"[dp, math, probabilities]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Matrix,1500,C,1358091000,"[constructive algorithms, dp, math]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Increasing Subsequence,2000,D,1358091000,[dp],PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Calculator,2500,E,1358091000,"[brute force, dp, two pointers]",PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Roma and Lucky Numbers,500,A,1358091000,[implementation],PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Roma and Changing Signs,1000,B,1358091000,[greedy],PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Maxim and Discounts,1500,C,1358091000,"[greedy, sortings]",PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Maxim and Restaurant,2000,D,1358091000,"[combinatorics, dp]",PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Maxim and Matrix,2500,E,1358091000,[dp],PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Beautiful Matrix,500,A,1358350200,[implementation],PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Squares,500,B,1358350200,"[greedy, implementation, sortings]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Circle of Numbers,2500,C,1358350200,"[dfs and similar, implementation]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Cycle in Graph,2000,D,1358350200,"[dfs and similar, graphs]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Rhombus,3000,E,1358350200,"[brute force, data structures, dp]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Escape from Stones,500,A,1358686800,"[constructive algorithms, data structures, implementation, two pointers]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Good Sequences,1000,B,1358686800,"[dp, number theory]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Choosing Balls,1500,C,1358686800,[dp],PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Colorful Stones,2000,D,1358686800,"[dp, two pointers]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Roadside Trees,2500,E,1358686800,"[data structures, dp]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Colorful Stones (Simplified Edition),500,A,1358686800,[implementation],PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Roadside Trees (Simplified Edition),1000,B,1358686800,"[greedy, implementation]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Escape from Stones,1500,C,1358686800,"[greedy, implementation]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Good Sequences,2000,D,1358686800,"[dp, number theory]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Choosing Balls,2500,E,1358686800,"[schedules, sortings]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,Stones on the Table,500,A,1358868600,[implementation],PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,Queue at the School,500,B,1358868600,"[constructive algorithms, graph matchings, implementation, shortest paths]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,Below the Diagonal,2500,C,1358868600,"[constructive algorithms, greedy, math]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,BerDonalds,3000,D,1358868600,"[graphs, math, shortest paths]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,More Queries to Array...,3000,E,1358868600,"[data structures, math]",PROGRAMMING
+267,Codeforces Testing Round #5,12,Subtractions,500,A,1358002800,"[math, number theory]",PROGRAMMING
+267,Codeforces Testing Round #5,12,Dominoes,1000,B,1358002800,"[dfs and similar, graphs]",PROGRAMMING
+267,Codeforces Testing Round #5,12,Berland Traffic,1500,C,1358002800,"[math, matrices]",PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Games,500,A,1359387000,[brute force],PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Buttons,1000,B,1359387000,"[implementation, math]",PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Beautiful Sets of Points,1500,C,1359387000,"[constructive algorithms, implementation]",PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Wall Bars,2500,D,1359387000,[dp],PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Playlist,2500,E,1359387000,"[math, probabilities, sortings]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Magical Boxes,500,A,1359732600,"[greedy, math]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Greenhouse Effect,1000,B,1359732600,[dp],PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Flawed Flow,1500,C,1359732600,"[constructive algorithms, flows, graphs]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Maximum Waterfall,2000,D,1359732600,"[data structures, dp]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,String Theory,2500,E,1359732600,[],PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Fancy Fence,500,A,1359732600,"[geometry, implementation, math]",PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Multithreading,1500,B,1359732600,"[data structures, greedy, implementation]",PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Magical Boxes,1500,C,1359732600,"[binary search, greedy, implementation, math, sortings]",PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Greenhouse Effect,2000,D,1359732600,[dp],PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Flawed Flow,2500,E,1359732600,"[dfs and similar, sortings]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Beautiful Year,500,A,1360596600,[brute force],PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Prime Matrix,1000,B,1360596600,"[binary search, brute force, math, number theory]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Secret,1500,C,1360596600,"[constructive algorithms, implementation]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Good Substrings,2000,D,1360596600,"[data structures, strings]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Three Horses,3000,E,1360596600,"[constructive algorithms, math, number theory]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Friends,500,A,1360769400,"[implementation, math]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Sequence,1000,B,1360769400,"[implementation, math]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Staircase,1500,C,1360769400,"[data structures, implementation]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Two Sequences,2000,D,1360769400,"[combinatorics, math, sortings]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Horses,2500,E,1360769400,"[combinatorics, constructive algorithms, graphs]",PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Staircase,500,A,1360769400,[],PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Two Sequences,1000,B,1360769400,[combinatorics],PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Horses,1500,C,1360769400,"[graphs, greedy]",PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Figure,2000,D,1360769400,[dp],PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Game,2500,E,1360769400,"[dp, games]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,k-Multiple Free Set,500,A,1361374200,"[binary search, greedy, sortings]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,Zero Tree,1000,B,1361374200,"[dfs and similar, dp, greedy, trees]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,The Last Hole!,1500,C,1361374200,"[brute force, geometry]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,Lovely Matrix,2000,D,1361374200,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,Mirror Room,2000,E,1361374200,"[data structures, implementation]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,Lights Out,500,A,1361374200,[implementation],PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,Convex Shape,1000,B,1361374200,"[constructive algorithms, implementation]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,k-Multiple Free Set,1500,C,1361374200,"[binary search, greedy, sortings]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,Zero Tree,2000,D,1361374200,"[dfs and similar, dp, trees]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,The Last Hole!,2500,E,1361374200,[],PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Lunch Rush,500,A,1361719800,[implementation],PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Game,1000,B,1361719800,"[games, greedy]",PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum Sum,1500,C,1361719800,"[data structures, implementation, sortings]",PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum XOR,2000,D,1361719800,"[bitmasks, dp, greedy, implementation, math]",PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Problem on Trees,2500,E,1361719800,"[data structures, trees]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Learning Languages,500,A,1362065400,"[dfs and similar, dsu]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Set of Points,1500,B,1362065400,"[constructive algorithms, geometry]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Game,2000,C,1362065400,"[games, implementation]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Google Code Jam,3000,D,1362065400,"[dp, probabilities]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Binary Tree on Plane,2000,E,1362065400,[flows],PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Circle Line,500,A,1362065400,[implementation],PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,New Problem,1000,B,1362065400,"[brute force, strings]",PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Learning Languages,1000,C,1362065400,[dsu],PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Set of Points,3000,D,1362065400,"[constructive algorithms, geometry]",PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Game,3000,E,1362065400,[games],PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Point on Spiral,500,A,1362411000,"[brute force, geometry, implementation]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Books,1000,B,1362411000,"[binary search, brute force, implementation, two pointers]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Ladder,1500,C,1362411000,"[dp, implementation, two pointers]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,The Minimum Number of Variables,2000,D,1362411000,"[bitmasks, dp]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Beautiful Decomposition,2000,E,1362411000,"[games, greedy]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Rectangle Puzzle,500,A,1362929400,[geometry],PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Maximum Xor Secondary,1000,B,1362929400,"[data structures, implementation, two pointers]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Game on Tree,1500,C,1362929400,"[implementation, math, probabilities, trees]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,k-Maximum Subsequence Sum,2000,D,1362929400,"[data structures, flows]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Sequence Transformation,2500,E,1362929400,"[data structures, dp, implementation, math]",PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Word Capitalization,500,A,1362929400,[strings],PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Nearest Fraction,1000,B,1362929400,"[brute force, implementation, two pointers]",PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Rectangle Puzzle,1500,C,1362929400,"[geometry, implementation]",PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Maximum Xor Secondary,2000,D,1362929400,[two pointers],PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Game on Tree,2500,E,1362929400,[math],PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Bit++,500,A,1363188600,[implementation],PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Painting Eggs,1000,B,1363188600,"[greedy, math]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,XOR and OR,1500,C,1363188600,"[constructive algorithms, implementation, math]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Yet Another Number Game,2000,D,1363188600,"[dp, games]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Sausage Maximization,2500,E,1363188600,"[bitmasks, data structures, trees]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cows and Sequence,1000,A,1363534200,"[constructive algorithms, implementation]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cow Program,1000,B,1363534200,"[dfs and similar, dp, graphs]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Coin Troubles,1500,C,1363534200,[dp],PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cows and Cool Sequences,2000,D,1363534200,"[dp, math, number theory]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cow Tennis Tournament,2500,E,1363534200,"[combinatorics, data structures, math]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cows and Primitive Roots,500,A,1363534200,"[implementation, math, number theory]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cows and Poker Game,1000,B,1363534200,"[brute force, implementation]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cows and Sequence,2000,C,1363534200,"[constructive algorithms, data structures, dp]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cow Program,2000,D,1363534200,"[dfs and similar, dp]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Coin Troubles,2500,E,1363534200,"[dfs and similar, dp]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Slightly Decreasing Permutations,500,A,1363879800,"[greedy, implementation]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Find Marble,1000,B,1363879800,[implementation],PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Building Permutation,1500,C,1363879800,"[greedy, implementation, sortings]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Permutation Sum,2000,D,1363879800,"[bitmasks, combinatorics, dp, implementation, meet-in-the-middle]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Positions in Permutations,2500,E,1363879800,"[combinatorics, dp, math]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Lucky Permutation,500,A,1364025600,"[constructive algorithms, math]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Shifting,1500,B,1364025600,[implementation],PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Main Sequence,1500,C,1364025600,"[greedy, implementation]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Tourists,2000,D,1364025600,"[data structures, sortings]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Ladies' Shop,2500,E,1364025600,"[constructive algorithms, fft, math]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,IQ Test,500,A,1364025600,"[brute force, implementation]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Pipeline,1500,B,1364025600,"[binary search, math]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Lucky Permutation,1500,C,1364025600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Shifting,2500,D,1364025600,[],PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Main Sequence,2500,E,1364025600,"[data structures, greedy]",PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Strings,500,A,1364916600,[greedy],PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Houses ,1000,B,1364916600,[combinatorics],PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and XOR operation,1500,C,1364916600,"[implementation, math]",PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Trees ,2000,D,1364916600,"[combinatorics, dfs and similar, trees]",PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Lucky Numbers,2500,E,1364916600,"[dp, implementation, math]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Segments ,500,A,1364916600,"[brute force, implementation]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Matrix,1000,B,1364916600,"[brute force, dp, implementation, sortings, ternary search]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Strings,1500,C,1364916600,"[constructive algorithms, implementation]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Houses ,2000,D,1364916600,"[brute force, combinatorics, dfs and similar, math]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and XOR operation,2500,E,1364916600,"[data structures, greedy, implementation, math]",PROGRAMMING
+290,April Fools Day Contest 2013,12,Mysterious strings,,A,1364830200,"[*special, implementation]",PROGRAMMING
+290,April Fools Day Contest 2013,12,QR code,,B,1364830200,"[*special, implementation]",PROGRAMMING
+290,April Fools Day Contest 2013,12,WTF?,,C,1364830200,"[*special, graph matchings, implementation, trees]",PROGRAMMING
+290,April Fools Day Contest 2013,12,Orange,,D,1364830200,"[*special, implementation]",PROGRAMMING
+290,April Fools Day Contest 2013,12,HQ,,E,1364830200,"[*special, constructive algorithms]",PROGRAMMING
+290,April Fools Day Contest 2013,12,Greedy Petya,,F,1364830200,"[*special, dfs and similar, graphs, greedy]",PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Spyke Talks,500,A,1365796800,"[implementation, sortings]",PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Command Line Arguments,1000,B,1365796800,"[implementation, strings]",PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Network Mask,1500,C,1365796800,"[brute force, implementation]",PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Parallel Programming,2000,D,1365796800,[greedy],PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Tree-String Problem,2500,E,1365796800,"[dfs and similar, hashing, strings]",PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,SMSC,1000,A,1366040100,[implementation],PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Network Topology,1000,B,1366040100,"[graphs, implementation]",PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Beautiful IP Addresses,1500,C,1366040100,[brute force],PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Connected Components,2000,D,1366040100,"[data structures, dfs and similar, dp, dsu]",PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Copying Data,2500,E,1366040100,[data structures],PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Weird Game,500,A,1366644900,"[games, greedy]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Distinct Paths,1500,B,1366644900,"[brute force, combinatorics]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Cube Problem,1500,C,1366644900,"[brute force, math, number theory]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Ksusha and Square,2000,D,1366644900,"[geometry, math, probabilities, two pointers]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Close Vertices,2500,E,1366644900,"[data structures, divide and conquer, trees]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Oskols,500,A,1365348600,"[implementation, math]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Bookshelf,1000,B,1365348600,"[dp, greedy]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Lights,1500,C,1365348600,"[combinatorics, number theory]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Painter Robot,2000,D,1365348600,"[brute force, implementation, number theory]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass the Great,2500,E,1365348600,"[dp, trees]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Array,500,A,1365694200,"[data structures, implementation]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Graph,1000,B,1365694200,"[dp, graphs, shortest paths]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Friends,1500,C,1365694200,"[combinatorics, dp, graphs, shortest paths]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Caves,2000,D,1365694200,"[combinatorics, dp]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Yaroslav and Points,2500,E,1365694200,[data structures],PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Yaroslav and Permutations,500,A,1365694200,"[greedy, math]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Yaroslav and Two Strings,1500,B,1365694200,"[combinatorics, dp]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Greg and Array,1500,C,1365694200,"[data structures, dp, implementation]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Greg and Graph,2000,D,1365694200,"[dp, graphs]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Greg and Friends,2500,E,1365694200,"[combinatorics, dfs and similar, dp]",PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Parity Game,500,A,1366385400,[constructive algorithms],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Fish Weight,500,B,1366385400,"[constructive algorithms, greedy]",PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Splitting the Uniqueness,2000,C,1366385400,[constructive algorithms],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Color the Carpet,2500,D,1366385400,[constructive algorithms],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Mystic Carvings,3000,E,1366385400,[data structures],PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Snow Footprints,500,A,1366385400,"[greedy, implementation]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Sail,500,B,1366385400,"[brute force, greedy, implementation]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Parity Game,1500,C,1366385400,"[combinatorics, constructive algorithms, math, number theory]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Fish Weight,1500,D,1366385400,"[greedy, math, sortings]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Splitting the Uniqueness,3000,E,1366385400,"[constructive algorithms, sortings]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha and Array,500,A,1366644600,"[brute force, number theory, sortings]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha the Squirrel,1000,B,1366644600,"[brute force, implementation]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Weird Game,1500,C,1366644600,"[games, greedy]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Distinct Paths,2500,D,1366644600,[],PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Cube Problem,2500,E,1366644600,[],PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Array,500,A,1366903800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Coach,1000,B,1366903800,"[brute force, dfs and similar]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Beautiful Numbers,2000,C,1366903800,"[brute force, combinatorics]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Painting Square,3000,D,1366903800,"[dp, fft]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Empire Strikes Back,3000,E,1366903800,"[binary search, math]",PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Sequence,500,A,1367769900,[constructive algorithms],PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Time,1000,B,1367769900,"[binary search, graphs, shortest paths]",PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Algorithm,1500,C,1367769900,[constructive algorithms],PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Divisors,2000,D,1367769900,[data structures],PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Arrangements,2500,E,1367769900,[dp],PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Eugeny and Array,500,A,1367769900,[implementation],PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Eugeny and Play List,1000,B,1367769900,"[binary search, implementation, two pointers]",PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Yaroslav and Sequence,1500,C,1367769900,[constructive algorithms],PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Yaroslav and Time,2000,D,1367769900,"[binary search, dfs and similar, dp, shortest paths]",PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Yaroslav and Algorithm,2500,E,1367769900,[],PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Lucky Permutation Triple,500,A,1368363600,"[constructive algorithms, implementation, math]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Rectangle Puzzle II,500,B,1368363600,"[implementation, math]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Minimum Modular,2000,C,1368363600,"[brute force, math]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Rotatable Number,2500,D,1368363600,"[math, number theory]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Random Ranking,3000,E,1368363600,[dp],PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Pythagorean Theorem II,500,A,1368363600,"[brute force, math]",PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Calendar,1000,B,1368363600,"[brute force, implementation]",PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Lucky Permutation Triple,1000,C,1368363600,[constructive algorithms],PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Rectangle Puzzle II,2000,D,1368363600,"[math, ternary search]",PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Minimum Modular,3000,E,1368363600,[math],PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Strange Addition,500,A,1368968400,"[brute force, constructive algorithms]",PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Continued Fractions,1000,B,1368968400,"[brute force, math]",PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Ivan and Powers of Two,1500,C,1368968400,[],PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Olya and Graph,2000,D,1368968400,"[combinatorics, math]",PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Playing with String,2500,E,1368968400,[games],PROGRAMMING
+306,Testing Round #6,12,Candies,500,A,1368302400,[implementation],PROGRAMMING
+306,Testing Round #6,12,Optimizer,1000,B,1368302400,"[data structures, greedy, sortings]",PROGRAMMING
+306,Testing Round #6,12,"White, Black and White Again",1500,C,1368302400,"[combinatorics, number theory]",PROGRAMMING
+306,Testing Round #6,12,Polygon,2000,D,1368302400,"[constructive algorithms, geometry]",PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Morning run,500,A,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Context Advertising,500,B,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Memory for Arrays,1000,C,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Tennis Rackets,2000,D,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Sheep,2500,E,1368784800,[],PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Morning run,500,A,1368803400,"[binary search, math, two pointers]",PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Context Advertising,500,B,1368803400,[two pointers],PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Memory for Arrays,1000,C,1368803400,"[binary search, bitmasks, greedy]",PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Tennis Rackets,2000,D,1368803400,"[brute force, geometry]",PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Sheep,2500,E,1368803400,"[binary search, greedy]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,The Closest Pair,500,A,1369582200,"[constructive algorithms, implementation]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Cats Transport,1000,B,1369582200,"[data structures, dp]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Fetch the Treasure,1500,C,1369582200,"[brute force, data structures, shortest paths]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Interval Cubing,2000,D,1369582200,"[data structures, math]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Biologist,2500,E,1369582200,[flows],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Whose sentence is it?,500,A,1369582200,[implementation],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Archer,1000,B,1369582200,"[math, probabilities]",PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,The Closest Pair,1500,C,1369582200,[constructive algorithms],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Cats Transport,2000,D,1369582200,[],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Fetch the Treasure,2500,E,1369582200,[],PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Bank Account,500,A,1369927800,"[implementation, number theory]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Queries,1000,B,1369927800,"[dp, implementation]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Matrix,1500,C,1369927800,"[constructive algorithms, greedy, implementation, sortings]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Roads,2500,D,1369927800,[dp],PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Two Numbers,2500,E,1369927800,"[constructive algorithms, data structures, dsu, greedy]",PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Contest,500,A,1370619000,[implementation],PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Periods,1000,B,1370619000,"[binary search, dfs and similar, strings]",PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Subsequences,1500,C,1370619000,"[data structures, dp]",PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Straight Lines,2000,D,1370619000,"[binary search, data structures, geometry, sortings, two pointers]",PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Squares,2500,E,1370619000,[dp],PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Bottles,500,A,1370619000,[brute force],PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Array,1000,B,1370619000,[implementation],PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Contest,1500,C,1370619000,"[dp, greedy, implementation]",PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Periods,2000,D,1370619000,"[dfs and similar, strings]",PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Subsequences,2500,E,1370619000,"[combinatorics, data structures]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Special Task,30,A1,1371042000,[greedy],PROGRAMMING
+316,ABBYY Cup 3.0,12,Special Task,70,A2,1371042000,[math],PROGRAMMING
+316,ABBYY Cup 3.0,12,EKG,30,B1,1371042000,"[brute force, dfs and similar]",PROGRAMMING
+316,ABBYY Cup 3.0,12,EKG,70,B2,1371042000,"[dfs and similar, dp]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Tidying Up,30,C1,1371042000,[flows],PROGRAMMING
+316,ABBYY Cup 3.0,12,Tidying Up,70,C2,1371042000,"[flows, graph matchings]",PROGRAMMING
+316,ABBYY Cup 3.0,12,PE Lesson,30,D1,1371042000,"[brute force, dp]",PROGRAMMING
+316,ABBYY Cup 3.0,12,PE Lesson,40,D2,1371042000,[dp],PROGRAMMING
+316,ABBYY Cup 3.0,12,PE Lesson,30,D3,1371042000,"[dp, math]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Summer Homework,30,E1,1371042000,"[brute force, data structures]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Summer Homework,40,E2,1371042000,"[data structures, math]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Summer Homework,30,E3,1371042000,"[data structures, math]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Suns and Rays,30,F1,1371042000,"[dfs and similar, implementation]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Suns and Rays,40,F2,1371042000,[],PROGRAMMING
+316,ABBYY Cup 3.0,12,Suns and Rays,30,F3,1371042000,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Good Substrings,30,G1,1371042000,"[hashing, strings]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Good Substrings,40,G2,1371042000,[string suffix structures],PROGRAMMING
+316,ABBYY Cup 3.0,12,Good Substrings,30,G3,1371042000,[string suffix structures],PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Perfect Pair,500,A,1371223800,[brute force],PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Ants,1000,B,1371223800,"[brute force, implementation]",PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Balance,2500,C,1371223800,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Game with Powers,1500,D,1371223800,"[dp, games]",PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Princess and Her Shadow,3000,E,1371223800,"[constructive algorithms, shortest paths]",PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Even Odds,500,A,1371223800,[math],PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Strings of Power,500,B,1371223800,"[implementation, strings, two pointers]",PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Perfect Pair,1000,C,1371223800,"[greedy, math]",PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Ants,2500,D,1371223800,[dfs and similar],PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Balance,3000,E,1371223800,"[constructive algorithms, dfs and similar]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Malek Dance Club,500,A,1371992400,"[combinatorics, math]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Psychos in a Line,1000,B,1371992400,"[data structures, implementation]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Kalila and Dimna in the Logging Industry,1500,C,1371992400,"[dp, geometry]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Have You Ever Heard About the Word?,2500,D,1371992400,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Ping-Pong,2500,E,1371992400,[data structures],PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Magic Numbers,500,A,1371992400,"[brute force, greedy]",PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Ping-Pong (Easy Version),1000,B,1371992400,"[dfs and similar, graphs]",PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Malek Dance Club,1500,C,1371992400,[math],PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Psychos in a Line,2000,D,1371992400,[data structures],PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Kalila and Dimna in the Logging Industry,2500,E,1371992400,[dp],PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Robot,500,A,1372433400,"[binary search, implementation, math]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Duel,1000,B,1372433400,"[dp, flows, greedy]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel the Commander,1500,C,1372433400,"[constructive algorithms, dfs and similar, divide and conquer, greedy, trees]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Flipboard,2000,D,1372433400,"[dp, greedy, math]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Gondolas,2500,E,1372433400,"[data structures, divide and conquer, dp]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Dancing,500,A,1372433400,[greedy],PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Flowers,1000,B,1372433400,"[combinatorics, math]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Robot,1500,C,1372433400,"[implementation, math, number theory]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Duel,2000,D,1372433400,"[dp, flows, greedy, two pointers]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel the Commander,2500,E,1372433400,[divide and conquer],PROGRAMMING
+323,Testing Round #7,12,Black-and-White Cube,500,A,1372363200,"[combinatorics, constructive algorithms]",PROGRAMMING
+323,Testing Round #7,12,Tournament-graph,1000,B,1372363200,[constructive algorithms],PROGRAMMING
+323,Testing Round #7,12,Two permutations,1500,C,1372363200,[data structures],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,30,A1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,70,A2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,30,B1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,70,B2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20,C1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20,C2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,60,C3,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30,D1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30,D2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,40,D3,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50,E1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50,E2,1374043200,[],PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Square and Rectangles,500,A,1373734800,[implementation],PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Stadium and Games,1000,B,1373734800,"[binary search, math]",PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Monsters and Diamonds,2000,C,1373734800,"[dfs and similar, shortest paths]",PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Reclamation,2000,D,1373734800,[dsu],PROGRAMMING
+325,MemSQL start[c]up Round 1,12,The Red Button,2500,E,1373734800,"[combinatorics, dfs and similar, dsu, greedy]",PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Banana,500,A,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Palindrome,1000,B,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,More Reclamation,1000,C,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Rectangles and Square,2000,D,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Counting Skyscrapers,2500,E,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,"Buy One, Get One Free",3000,F,1375549200,[],PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Flipping Game,500,A,1372941000,"[brute force, dp, implementation]",PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Hungry Sequence,500,B,1372941000,[math],PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Magic Five,1500,C,1372941000,"[combinatorics, math]",PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Block Tower,2000,D,1372941000,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Axis Walking,3000,E,1372941000,"[bitmasks, combinatorics, constructive algorithms, dp, meet-in-the-middle]",PROGRAMMING
+328,Testing Round #8,12,IQ Test,500,A,1373662800,[implementation],PROGRAMMING
+328,Testing Round #8,12,Sheldon and Ice Pieces,500,B,1373662800,[greedy],PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Purification,500,A,1374327000,"[constructive algorithms, greedy]",PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Biridian Forest,1000,B,1374327000,"[dfs and similar, shortest paths]",PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Graph Reconstruction,1500,C,1374327000,[constructive algorithms],PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,The Evil Temple and the Moving Rocks,1500,D,1374327000,[constructive algorithms],PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Evil,2500,E,1374327000,[math],PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Cakeminator,500,A,1374327000,"[brute force, implementation]",PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Road Construction,1000,B,1374327000,"[constructive algorithms, graphs]",PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Purification,1500,C,1374327000,[matrices],PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Biridian Forest,2000,D,1374327000,"[dfs and similar, implementation, shortest paths]",PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Graph Reconstruction,2500,E,1374327000,[],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,30,A1,1374075000,"[brute force, implementation]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,70,A2,1374075000,"[data structures, sortings]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,30,B1,1374075000,[implementation],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,70,B2,1374075000,[data structures],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20,C1,1374075000,[dp],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20,C2,1374075000,[dp],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,60,C3,1374075000,[dp],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30,D1,1374075000,"[dfs and similar, implementation]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30,D2,1374075000,[graphs],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,40,D3,1374075000,"[data structures, implementation, trees]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50,E1,1374075000,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50,E2,1374075000,"[constructive algorithms, dp]",PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Down the Hatch!,500,A,1374679800,[implementation],PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Maximum Absurdity,1000,B,1374679800,"[data structures, dp, implementation]",PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Students' Revenge,3000,C,1374679800,"[data structures, greedy, sortings]",PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Theft of Blueprints,3000,D,1374679800,"[graphs, math]",PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Binary Key,3000,E,1374679800,"[dp, greedy, implementation]",PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Secrets,500,A,1374913800,[greedy],PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Chips,1000,B,1374913800,[greedy],PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Lucky Tickets,1500,C,1374913800,"[brute force, constructive algorithms]",PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Characteristics of Rectangles,2000,D,1374913800,"[binary search, bitmasks, brute force, implementation, sortings]",PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Summer Earnings,2500,E,1374913800,"[binary search, bitmasks, brute force, geometry, sortings]",PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Candy Bags,500,A,1374913800,[implementation],PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Eight Point Sets,1000,B,1374913800,[sortings],PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Secrets,1500,C,1374913800,[math],PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Chips,2000,D,1374913800,"[greedy, implementation, two pointers]",PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Lucky Tickets,2500,E,1374913800,[],PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Banana,500,A,1375549200,"[binary search, constructive algorithms, greedy]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Palindrome,1000,B,1375549200,"[constructive algorithms, dp]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,More Reclamation,1000,C,1375549200,[games],PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Rectangles and Square,2000,D,1375549200,"[brute force, dp]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Counting Skyscrapers,2500,E,1375549200,"[dp, math, probabilities]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,"Buy One, Get One Free",3000,F,1375549200,"[dp, greedy]",PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Triangle,500,A,1376062200,"[implementation, math]",PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Fly,1000,B,1376062200,[math],PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Sequence,1500,C,1376062200,"[brute force, greedy, implementation, number theory]",PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Beautiful Strings,2000,D,1376062200,"[combinatorics, math]",PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Painting Square,2500,E,1376062200,"[bitmasks, combinatorics, dp, implementation]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Puzzles,500,A,1376668800,"[dp, graph matchings, greedy]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Routine Problem,1000,B,1376668800,"[greedy, math, number theory]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Quiz,1500,C,1376668800,"[binary search, greedy, math, matrices, number theory]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Book of Evil,2000,D,1376668800,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Divisor Tree,2500,E,1376668800,"[brute force, number theory, trees]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Quiz,500,A,1376668800,"[greedy, math, number theory]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Book of Evil,1000,B,1376668800,"[dfs and similar, dp, trees]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Divisor Tree,1500,C,1376668800,"[brute force, dp, number theory]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,GCD Table,2000,D,1376668800,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Optimize!,2500,E,1376668800,[data structures],PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Helpful Maths,500,A,1377531000,"[greedy, implementation, sortings, strings]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Xenia and Ringroad,1000,B,1377531000,[implementation],PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Xenia and Weights,1500,C,1377531000,"[constructive algorithms, dfs and similar, dp, greedy]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Xenia and Bit Operations,2000,D,1377531000,"[data structures, trees]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Three Swaps,3000,E,1377531000,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,The Wall,500,A,1377876600,[math],PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Maximal Area Quadrilateral,3000,B,1377876600,"[brute force, geometry]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Tourist Problem,2000,C,1377876600,"[combinatorics, implementation, math]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Bubble Sort Graph,2000,D,1377876600,"[binary search, data structures, dp]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Iahub and Permutations,3000,E,1377876600,"[combinatorics, math]",PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Tourist Problem,500,A,1377876600,[math],PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Bubble Sort Graph,500,B,1377876600,"[binary search, data structures, dp]",PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Iahub and Permutations,1000,C,1377876600,"[combinatorics, dp, math]",PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Iahub and Xors,2500,D,1377876600,[data structures],PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Candies Game,3000,E,1377876600,"[constructive algorithms, greedy]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Divisors,500,A,1378540800,"[greedy, implementation]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Spies,1000,B,1378540800,"[brute force, greedy, implementation]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Cupboard and Balloons,1500,C,1378540800,[geometry],PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Dominoes,2000,D,1378540800,"[bitmasks, dfs and similar, dp]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Tree,2500,E,1378540800,"[data structures, divide and conquer, trees]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Rational Resistance,500,A,1379172600,"[math, number theory]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Alternating Current,1000,B,1379172600,"[data structures, greedy, implementation]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Read Time,1500,C,1379172600,"[binary search, greedy, two pointers]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Water Tree,2000,D,1379172600,"[data structures, dfs and similar, trees]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Pumping Stations,2500,E,1379172600,"[brute force, dfs and similar, divide and conquer, flows, greedy]",PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Magnets,500,A,1379172600,[implementation],PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Simple Molecules,1000,B,1379172600,"[brute force, math]",PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Rational Resistance,1500,C,1379172600,[math],PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Alternating Current,2000,D,1379172600,"[data structures, greedy, implementation]",PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Read Time,2500,E,1379172600,"[binary search, two pointers]",PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Expecting Trouble,,A,1379086800,"[*special, probabilities]",PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Triskaidekaphobia,,B,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Counting Fridays,,C,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Chain Letter,,D,1379086800,"[*special, dfs and similar, graphs]",PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Black Cat Rush,,E,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Superstitions Inspection,,F,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Suffix Subgroup,,G,1379086800,"[*special, strings]",PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Alice and Bob,500,A,1379691000,"[games, math, number theory]",PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Lucky Common Subsequence,1000,B,1379691000,"[dp, strings]",PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Number Transformation II,1500,C,1379691000,"[greedy, math]",PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Robot Control,2000,D,1379691000,[shortest paths],PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Doodle Jump,2500,E,1379691000,[math],PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Difference Row,500,A,1379691000,"[implementation, sortings]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Fixed Points,1000,B,1379691000,"[implementation, math]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Alice and Bob,1500,C,1379691000,"[games, math, number theory]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Lucky Common Subsequence,2000,D,1379691000,"[dp, strings]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Number Transformation II,2500,E,1379691000,"[dp, greedy, number theory]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Mafia,500,A,1380295800,"[binary search, math, sortings]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Apple Tree,1000,B,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Subset Sums,1500,C,1380295800,"[brute force, data structures]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Turtles,2000,D,1380295800,"[dp, matrices]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Pilgrims,2500,E,1380295800,"[dfs and similar, dp, trees]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Cinema Line,500,A,1380295800,"[greedy, implementation]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Color the Fence,1000,B,1380295800,"[data structures, dp, greedy]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Mafia,1500,C,1380295800,[implementation],PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Apple Tree,2000,D,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Subset Sums,2500,E,1380295800,[],PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,TL,500,A,1380641400,"[brute force, greedy, implementation]",PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Resort,1000,B,1380641400,[brute force],PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Bombs,1000,C,1380641400,"[greedy, implementation, sortings]",PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Looking for Owls,3000,D,1380641400,"[binary search, geometry, hashing, sortings]",PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Wrong Floyd,3000,E,1380641400,"[brute force, constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Rounding,1000,A,1380900600,"[dp, greedy, implementation, math]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Furik,1000,B,1380900600,"[combinatorics, dp, probabilities]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Brackets,1500,C,1380900600,"[dp, matrices]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Removing Periods,2000,D,1380900600,[data structures],PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Permutation,2000,E,1380900600,[greedy],PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Digits,500,A,1380900600,"[brute force, implementation, math]",PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Periods,1000,B,1380900600,"[implementation, sortings]",PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Rounding,1500,C,1380900600,"[dp, greedy, implementation]",PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Furik,2000,D,1380900600,[math],PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Brackets,2500,E,1380900600,[],PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Domino,500,A,1381419000,"[implementation, math]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Two Heaps,1500,B,1381419000,"[combinatorics, constructive algorithms, greedy, implementation, math, sortings]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Find Maximum,1000,C,1381419000,"[implementation, math, number theory]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Queue,2500,D,1381419000,[constructive algorithms],PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Antichain,3000,E,1381419000,"[dp, graph matchings, greedy]",PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Vasya and Robot,500,A,1381678200,"[brute force, greedy, math]",PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Game with Strings,1000,B,1381678200,"[bitmasks, dp, games]",PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Vasya and Beautiful Arrays,1500,C,1381678200,"[brute force, dp, number theory]",PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Transferring Pyramid,2000,D,1381678200,[dp],PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Lucky Number Representation,2500,E,1381678200,"[constructive algorithms, dfs and similar, dp]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Digital Root,500,A,1381678200,"[constructive algorithms, implementation]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Public Transport,1000,B,1381678200,"[greedy, implementation]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Robot,1500,C,1381678200,"[brute force, dp]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Game with Strings,2000,D,1381678200,[],PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Beautiful Arrays,2500,E,1381678200,"[binary search, brute force, data structures]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Knight Tournament,500,A,1381838400,"[data structures, dsu]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Xenia and Hamming,1000,B,1381838400,"[implementation, math]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Compartments,1500,C,1381838400,"[combinatorics, constructive algorithms, greedy, implementation]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Bags and Coins,2000,D,1381838400,"[bitmasks, constructive algorithms, dp, greedy]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Xenia and String Problem,2500,E,1381838400,"[dp, hashing, implementation, string suffix structures, strings]",PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Group of Students,500,A,1381838400,"[brute force, greedy, implementation]",PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Flag Day,1000,B,1381838400,"[constructive algorithms, implementation]",PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Knight Tournament,1500,C,1381838400,[data structures],PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Xenia and Hamming,2000,D,1381838400,[number theory],PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Compartments,2500,E,1381838400,[],PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Continuous Line,500,A,1382715000,"[brute force, implementation]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Text Messages,1000,B,1382715000,"[brute force, strings]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Containers,1500,C,1382715000,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Hares,2000,D,1382715000,"[dp, greedy]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Kicks,3000,E,1382715000,"[brute force, dsu, graphs, implementation]",PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Table,500,A,1383379200,"[greedy, implementation]",PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Permutation,1000,B,1383379200,"[constructive algorithms, dp, math]",PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Prime Number,1500,C,1383379200,[math],PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Pair of Numbers,2500,D,1383379200,"[binary search, brute force, data structures, math, two pointers]",PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Neatness,2500,E,1383379200,[dfs and similar],PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Array Recovery,500,A,1384102800,"[greedy, implementation]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Array,1000,B,1384102800,"[binary search, dp]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Strings,1500,C,1384102800,"[combinatorics, dp]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Sets,1500,D,1384102800,[number theory],PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Game,2000,E,1384102800,"[graphs, greedy, shortest paths]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Table,500,A,1384102800,"[constructive algorithms, implementation]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Permutation,1000,B,1384102800,"[constructive algorithms, math, number theory]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Array Recovery,1500,C,1384102800,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Array,2000,D,1384102800,"[binary search, dp]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Strings,2500,E,1384102800,[],PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Two Semiknights Meet,1000,A,1384443000,"[greedy, math]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Petya and Staircases,500,B,1384443000,"[implementation, sortings]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Insertion Sort,2500,C,1384443000,"[data structures, dp, implementation, math]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Fools and Foolproof Roads,3000,D,1384443000,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Petya and Pipes,3000,E,1384443000,"[flows, graphs, shortest paths]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Soroban,500,A,1384156800,[implementation],PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Fence,1000,B,1384156800,"[brute force, dp]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Fixing Typos,1500,C,1384156800,"[greedy, implementation]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Renting Bikes,2000,D,1384156800,"[binary search, greedy]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Two Circles,2500,E,1384156800,"[brute force, data structures, implementation]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Matrix,500,A,1384875000,"[combinatorics, data structures, implementation]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Free Market,1000,B,1384875000,"[dp, greedy]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Beautiful Set,1500,C,1384875000,"[brute force, number theory]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Ghd,2000,D,1384875000,"[brute force, math, probabilities]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Empty Rectangles,2500,E,1384875000,"[divide and conquer, two pointers]",PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Good Number,500,A,1384875000,[implementation],PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,The Fibonacci Segment,1000,B,1384875000,[implementation],PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Matrix,1500,C,1384875000,"[brute force, combinatorics, math, matrices]",PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Free Market,2000,D,1384875000,"[dp, greedy]",PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Beautiful Set,2500,E,1384875000,"[brute force, number theory]",PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Guards,500,A,1385307000,[implementation],PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and To-do List,1000,B,1385307000,"[brute force, implementation]",PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Salad,1500,C,1385307000,[dp],PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Trap Graph,2000,D,1385307000,"[binary search, data structures, dfs and similar, dsu, shortest paths, two pointers]",PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Magic Guitar,2500,E,1385307000,"[brute force, implementation, math]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and Algorithm ,500,A,1385479800,"[data structures, implementation]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja ans Anagrams,1000,B,1385479800,"[binary search, data structures]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and the Arrangement of Numbers,1500,C,1385479800,"[graphs, greedy, sortings]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and Sets,2000,D,1385479800,"[bitmasks, dfs and similar]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and Intervals,2000,E,1385479800,"[combinatorics, dp]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and Coat Rack,500,A,1385479800,[implementation],PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and Suffixes,1000,B,1385479800,"[data structures, dp]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and Algorithm ,1500,C,1385479800,"[brute force, implementation]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja ans Anagrams,2000,D,1385479800,"[data structures, two pointers]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and the Arrangement of Numbers,2500,E,1385479800,"[combinatorics, graphs, implementation]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Plates,500,A,1385739000,[implementation],PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Contest,1000,B,1385739000,"[constructive algorithms, implementation, math]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Elections,1500,C,1385739000,"[dfs and similar, graphs, trees]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Fools,2000,D,1385739000,"[dfs and similar, dp, shortest paths]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Queries,2500,E,1385739000,"[binary search, data structures]",PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,"Rook, Bishop and King",500,A,1386399600,[math],PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Berland Bingo,500,B,1386399600,[implementation],PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Mittens,1500,C,1386399600,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Broken Monitor,3000,D,1386399600,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Summer Reading,3000,E,1386399600,"[dp, greedy]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,K-Periodic Array,500,A,1386493200,"[implementation, math]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Fox Dividing Cheese,1000,B,1386493200,"[math, number theory]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Hamburgers,1500,C,1386493200,"[binary search, brute force]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Vessels,2000,D,1386493200,"[data structures, dsu, implementation, trees]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Subway Innovation,2500,E,1386493200,"[math, two pointers]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Counting Kangaroos is Fun,500,A,1386943200,"[binary search, greedy, sortings, two pointers]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Counting Rectangles is Fun,1000,B,1386943200,"[brute force, divide and conquer, dp]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Watching Fireworks is Fun,1500,C,1386943200,"[data structures, dp, math]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Choosing Subtree is Fun,2000,D,1386943200,"[binary search, data structures, dfs and similar, trees, two pointers]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Drawing Circles is Fun,2500,E,1386943200,"[combinatorics, geometry]",PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Collecting Beats is Fun,500,A,1386943200,[implementation],PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Making Sequences is Fun,1000,B,1386943200,"[binary search, implementation, math]",PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Counting Kangaroos is Fun,1500,C,1386943200,"[greedy, sortings, two pointers]",PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Counting Rectangles is Fun,2000,D,1386943200,[],PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Watching Fireworks is Fun,2500,E,1386943200,[dp],PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Pink Pony,500,A,1387380600,"[greedy, implementation]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Nine,1000,B,1387380600,"[combinatorics, greedy]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Dima,1500,C,1387380600,"[dfs and similar, dp, graphs, implementation]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Sequence ,2000,D,1387380600,"[binary search, data structures, dp, trees]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Babies,2500,E,1387380600,"[binary search, data structures, dsu, geometry, implementation]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Divisible by Seven,500,A,1387893600,"[math, number theory]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Maximum Submatrix 2,1000,B,1387893600,"[data structures, dp, implementation, sortings]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Circling Round Treasures,1500,C,1387893600,"[bitmasks, shortest paths]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Tree and Queries,2000,D,1387893600,"[data structures, dfs and similar, trees]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Red and Black Tree,2500,E,1387893600,"[dp, implementation, math]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Lever,500,A,1387893600,"[implementation, math]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,I.O.U.,1000,B,1387893600,[implementation],PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Divisible by Seven,1500,C,1387893600,"[math, number theory]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Maximum Submatrix 2,2000,D,1387893600,"[dp, implementation, sortings]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Circling Round Treasures,2500,E,1387893600,"[bitmasks, shortest paths]",PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Maze,500,A,1388331000,[dfs and similar],PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Preparing for the Contest,1000,B,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Captains Mode,1000,C,1388331000,"[bitmasks, dp, games]",PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Developing Game,2000,D,1388331000,[data structures],PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Cookie Clicker,2500,E,1388331000,"[dp, geometry]",PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Playing with Dice,500,A,1388331000,[brute force],PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Semifinals,1000,B,1388331000,"[implementation, sortings]",PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Maze,1500,C,1388331000,[dfs and similar],PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Preparing for the Contest,2000,D,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Captains Mode,2000,E,1388331000,"[bitmasks, brute force, dp, greedy]",PROGRAMMING
+379,Good Bye 2013,12,New Year Candles,500,A,1388417400,[implementation],PROGRAMMING
+379,Good Bye 2013,12,New Year Present,1000,B,1388417400,"[constructive algorithms, implementation]",PROGRAMMING
+379,Good Bye 2013,12,New Year Ratings Change,1500,C,1388417400,"[greedy, sortings]",PROGRAMMING
+379,Good Bye 2013,12,New Year Letter,2000,D,1388417400,"[bitmasks, brute force, dp]",PROGRAMMING
+379,Good Bye 2013,12,New Year Tree Decorations,2500,E,1388417400,"[geometry, schedules, sortings]",PROGRAMMING
+379,Good Bye 2013,12,New Year Tree,3000,F,1388417400,"[data structures, divide and conquer, trees]",PROGRAMMING
+379,Good Bye 2013,12,New Year Cactus,3500,G,1388417400,[dp],PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Prefixes,500,A,1389540600,"[binary search, brute force]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Tree,1000,B,1389540600,"[graphs, implementation]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Brackets,1500,C,1389540600,"[data structures, schedules]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Cinema,2000,D,1389540600,"[combinatorics, math]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Dividing,2500,E,1389540600,[data structures],PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Dima,500,A,1389540600,"[greedy, implementation, two pointers]",PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Stairs,1000,B,1389540600,"[greedy, implementation, sortings]",PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Prefixes,1500,C,1389540600,"[binary search, implementation, two pointers]",PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Tree,2000,D,1389540600,[brute force],PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Brackets,2500,E,1389540600,[data structures],PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Ksenia and Pan Scales,500,A,1389972600,"[greedy, implementation]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Number Busters,2500,B,1389972600,"[binary search, math]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Arithmetic Progression,1500,C,1389972600,"[implementation, sortings]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Ksenia and Pawns,3000,D,1389972600,"[dfs and similar, graphs, implementation, trees]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Ksenia and Combinatorics,3000,E,1389972600,"[combinatorics, dp]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Milking cows,500,A,1390231800,"[data structures, greedy]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Volcanoes,1500,B,1390231800,"[binary search, implementation, sortings, two pointers]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Propagating tree,1500,C,1390231800,"[data structures, dfs and similar, trees]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Antimatter,2000,D,1390231800,[dp],PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Vowels,2500,E,1390231800,"[combinatorics, divide and conquer, dp]",PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Coder,500,A,1390231800,[implementation],PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Multitasking,1000,B,1390231800,"[greedy, implementation, sortings, two pointers]",PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Milking cows,1500,C,1390231800,[greedy],PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Volcanoes,2500,D,1390231800,[implementation],PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Propagating tree,2500,E,1390231800,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Raspberry,500,A,1390577700,"[brute force, greedy, implementation]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Strings,1000,B,1390577700,"[brute force, greedy, implementation, math, strings]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Prime Numbers,1500,C,1390577700,"[binary search, brute force, data structures, dp, implementation, math, number theory]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Floodlight,2000,D,1390577700,"[bitmasks, dp, geometry]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear in the Field,2500,E,1390577700,"[math, matrices]",PROGRAMMING
+386,Testing Round #9,12,Second-Price Auction,500,A,1389906900,[implementation],PROGRAMMING
+386,Testing Round #9,12,"Fly, freebies, fly!",1000,B,1389906900,"[binary search, brute force, implementation]",PROGRAMMING
+386,Testing Round #9,12,Diverse Substrings,1500,C,1389906900,"[dp, two pointers]",PROGRAMMING
+386,Testing Round #9,12,Game with Points,2000,D,1389906900,"[dp, graphs, implementation, shortest paths]",PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Sleep,500,A,1391095800,[implementation],PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Round,1000,B,1391095800,"[brute force, greedy, two pointers]",PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Number,1500,C,1391095800,"[greedy, implementation]",PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Interesting Graph,2000,D,1391095800,[graph matchings],PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Cards,2500,E,1391095800,"[binary search, data structures]",PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Box Accumulation,500,A,1391442000,"[greedy, sortings]",PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Minimal path,1000,B,1391442000,"[bitmasks, constructive algorithms, graphs, implementation, math]",PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Card Game,1500,C,1391442000,"[games, greedy, sortings]",PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Perfect Sets,2000,D,1391442000,[math],PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Meteor Shower,2500,E,1391442000,[geometry],PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Number Game,500,A,1391442000,"[greedy, math]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Cross,1000,B,1391442000,"[greedy, implementation]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Box Accumulation,1500,C,1391442000,"[binary search, dp, greedy]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Minimal path,2000,D,1391442000,"[constructive algorithms, graphs, implementation, shortest paths]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Card Game,2500,E,1391442000,"[greedy, implementation]",PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Alarm Clock,500,A,1392132600,[implementation],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,"Inna, Dima and Song",1000,B,1392132600,[implementation],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Candy Boxes,1500,C,1392132600,[data structures],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Sweet Matrix,2000,D,1392132600,[constructive algorithms],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Large Sweet Matrix,2500,E,1392132600,[],PROGRAMMING
+391,Rockethon 2014,12,Genetic Engineering,3,A,1392573600,"[implementation, two pointers]",PROGRAMMING
+391,Rockethon 2014,12,Word Folding,5,B,1392573600,[brute force],PROGRAMMING
+391,Rockethon 2014,12,The Tournament,4,C1,1392573600,[brute force],PROGRAMMING
+391,Rockethon 2014,12,The Tournament,4,C2,1392573600,[greedy],PROGRAMMING
+391,Rockethon 2014,12,The Tournament,8,C3,1392573600,[],PROGRAMMING
+391,Rockethon 2014,12,Supercollider,3,D1,1392573600,[brute force],PROGRAMMING
+391,Rockethon 2014,12,Supercollider,16,D2,1392573600,[data structures],PROGRAMMING
+391,Rockethon 2014,12,Three Trees,11,E1,1392573600,[],PROGRAMMING
+391,Rockethon 2014,12,Three Trees,13,E2,1392573600,[],PROGRAMMING
+391,Rockethon 2014,12,Stock Trading,8,F1,1392573600,[dp],PROGRAMMING
+391,Rockethon 2014,12,Stock Trading,15,F2,1392573600,[greedy],PROGRAMMING
+391,Rockethon 2014,12,Stock Trading,10,F3,1392573600,[],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Blocked Points,500,A,1392728400,[math],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Tower of Hanoi,1000,B,1392728400,[dp],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Yet Another Number Sequence,1500,C,1392728400,"[combinatorics, math, matrices]",PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Three Arrays,2000,D,1392728400,[data structures],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Deleting Substrings,2500,E,1392728400,[],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Nineteen,500,A,1392728400,[],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Three matrices,1000,B,1392728400,[],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Blocked Points,1500,C,1392728400,[geometry],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Tower of Hanoi,2000,D,1392728400,[dp],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Yet Another Number Sequence,2500,E,1392728400,[],PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Counting Sticks,500,A,1392910200,[implementation],PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Very Beautiful Number,1000,B,1392910200,[],PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Dominoes,1500,C,1392910200,"[constructive algorithms, greedy]",PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Physical Education and Buns,2000,D,1392910200,"[brute force, implementation, math]",PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Lightbulb for Minister,2500,E,1392910200,[geometry],PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Number of Decompositions into Multipliers,500,A,1393428600,"[combinatorics, number theory]",PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Sum of Fractions,1000,B,1393428600,"[math, number theory]",PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Changing Tree,1500,C,1393428600,"[data structures, trees]",PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Sum of Number of Inversions in Permutations,2000,D,1393428600,[combinatorics],PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Iteration of One Well-Known Function,2500,E,1393428600,[],PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Segment's Own Points,500,A,1393428600,[],PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Corruption and Numbers,1000,B,1393428600,"[implementation, math]",PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Number of Decompositions into Multipliers,1500,C,1393428600,"[combinatorics, number theory]",PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Sum of Fractions,2000,D,1393428600,[math],PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Changing Tree,2500,E,1393428600,"[data structures, trees]",PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Cards,500,A,1393687800,[implementation],PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Painting The Wall,1000,B,1393687800,"[dp, probabilities]",PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Tree and Array,1500,C,1393687800,[constructive algorithms],PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Instant Messanger,2000,D,1393687800,[data structures],PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Sorting Permutations,2500,E,1393687800,[],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Pages,500,A,1393687800,[implementation],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Red and Blue Balls,1000,B,1393687800,[],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Cards,1500,C,1393687800,[number theory],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Painting The Wall,2000,D,1393687800,[],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Tree and Array,2500,E,1393687800,[],PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and Choose Options,500,A,1394033400,"[dp, implementation]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and New Matrix of Candies,1000,B,1394033400,"[brute force, implementation, schedules]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and Huge Candy Matrix,1500,C,1394033400,"[implementation, math]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Dima and Bacteria,2000,D,1394033400,"[dsu, graphs, shortest paths]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and Binary Logic,2500,E,1394033400,"[binary search, bitmasks, data structures]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Vanya and Cards,500,A,1394465400,"[implementation, math]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Sereja and Contests,1000,B,1394465400,"[greedy, implementation, math]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Team,1500,C,1394465400,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Roman and Numbers,2000,D,1394465400,"[bitmasks, brute force, combinatorics, dp, number theory]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Olympic Games,2500,E,1394465400,[math],PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Nuts,500,A,1394983800,"[greedy, math]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Trees in a Row,1000,B,1394983800,[brute force],PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Searching for Graph,1500,C,1394983800,"[brute force, constructive algorithms]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Upgrading Array,2000,D,1394983800,"[dp, greedy, math]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Strictly Positive Matrix,2500,E,1394983800,[graphs],PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Searching for Graph,500,A,1394983800,"[constructive algorithms, graphs]",PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Upgrading Array,1000,B,1394983800,"[dp, greedy, number theory]",PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Strictly Positive Matrix,1500,C,1394983800,[graphs],PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Beautiful Pairs of Numbers,1500,D,1394983800,"[combinatorics, dp]",PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Two Rooted Trees,2000,E,1394983800,"[data structures, implementation]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Valera and X,500,A,1395243000,[implementation],PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Marathon,1000,B,1395243000,"[implementation, math]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Restore Graph,1500,C,1395243000,"[dfs and similar, graphs, sortings]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Minesweeper 1D,2000,D,1395243000,"[dp, implementation]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Maze 1D,2500,E,1395243000,"[binary search, greedy, implementation]",PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Gravity Flip,500,A,1395502200,"[greedy, implementation, sortings]",PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Domino Effect,1000,B,1395502200,[],PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Unusual Product,1500,C,1395502200,"[implementation, math]",PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Toy Sum,2000,D,1395502200,"[greedy, implementation, math]",PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Graph Cutting,3000,E,1395502200,[dfs and similar],PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Unusual Product,500,A,1395502200,"[implementation, math]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Toy Sum,1000,B,1395502200,"[constructive algorithms, greedy]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Graph Cutting,2000,C,1395502200,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Hill Climbing,2000,D,1395502200,"[dfs and similar, geometry, trees]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Hamming Triples,2500,E,1395502200,"[implementation, math]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Triangle,500,A,1396162800,"[brute force, implementation, math]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Long Path,1000,B,1396162800,"[dp, implementation]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Curious Array,2000,C,1396162800,"[brute force, implementation, math]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Largest Submatrix 3,2000,D,1396162800,"[dp, hashing]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,k-d-sequence,2500,E,1396162800,[data structures],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Line to Cashier,500,A,1396162800,[implementation],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Garland,1000,B,1396162800,[implementation],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Triangle,1500,C,1396162800,"[geometry, math]",PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Long Path,2000,D,1396162800,[dp],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Curious Array,3000,E,1396162800,[],PROGRAMMING
+409,April Fools Day Contest 2014,12,The Great Game,,A,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Mysterious Language,,B,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Magnum Opus,,C,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Big Data,,D,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Dome,,E,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,1,,F,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,On a plane,,G,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,A + B Strikes Back,,H,1396366200,"[*special, brute force, constructive algorithms, dsu, implementation]",PROGRAMMING
+409,April Fools Day Contest 2014,12,Feed the Golorp,,I,1396366200,[*special],PROGRAMMING
+411,Coder-Strike 2014 - Qualification Round,12,Password Check,,A,1397505600,[implementation],PROGRAMMING
+411,Coder-Strike 2014 - Qualification Round,12,Multi-core Processor,,B,1397505600,[implementation],PROGRAMMING
+411,Coder-Strike 2014 - Qualification Round,12,Kicker,,C,1397505600,[implementation],PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Poster,500,A,1397837400,"[greedy, implementation]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Network Configuration,1000,B,1397837400,"[greedy, sortings]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Pattern,1500,C,1397837400,"[implementation, strings]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Giving Awards,2000,D,1397837400,[dfs and similar],PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,E-mail Addresses,2500,E,1397837400,[implementation],PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Data Recovery,500,A,1397977200,[implementation],PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Spyke Chatting,1000,B,1397977200,[implementation],PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Jeopardy!,1500,C,1397977200,"[greedy, math]",PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,2048,2000,D,1397977200,"[bitmasks, dp]",PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Maze 2D,2500,E,1397977200,"[data structures, divide and conquer]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and Numbers,500,A,1396798800,"[constructive algorithms, number theory]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and ACM,1000,B,1396798800,"[combinatorics, dp]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and Reverse Operation,1500,C,1396798800,"[combinatorics, divide and conquer]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and Water Tanks,1500,D,1396798800,"[binary search, data structures, greedy, two pointers]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh's Designed Problem,2500,E,1396798800,[data structures],PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Lights,500,A,1396798800,[implementation],PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Tokens,1000,B,1396798800,"[binary search, greedy, math]",PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Numbers,1500,C,1396798800,"[constructive algorithms, greedy, number theory]",PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and ACM,2000,D,1396798800,"[combinatorics, dp, number theory]",PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Reverse Operation,2500,E,1396798800,"[divide and conquer, sortings]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Guess a number!,500,A,1397376000,"[greedy, implementation, two pointers]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Art Union,1000,B,1397376000,"[brute force, dp, implementation]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Booking System,1500,C,1397376000,"[binary search, dp, greedy, implementation]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Population Size,2000,D,1397376000,"[greedy, implementation]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,President's Path,2500,E,1397376000,"[dp, graphs, shortest paths]",PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Elimination,500,A,1397749200,"[dp, implementation, math]",PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Crash,1000,B,1397749200,[implementation],PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Football,1500,C,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Cunning Gena,2000,D,1397749200,"[bitmasks, dp, greedy, sortings]",PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Square Table,2500,E,1397749200,"[constructive algorithms, math, probabilities]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Football,500,A,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Cunning Gena,1000,B,1397749200,"[bitmasks, dp, sortings]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Square Table,1500,C,1397749200,"[constructive algorithms, dp, math]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Big Problems for Organizers,2500,D,1397749200,"[data structures, graphs, trees]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Tricky Password,2500,E,1397749200,[data structures],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Start Up,500,A,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Online Meeting,1500,B,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Bug in Code,1500,C,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Cup Trick,1500,D,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Playing the ball,2000,E,1398169200,[],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Start Up,500,A,1398169140,[implementation],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Online Meeting,1500,B,1398169140,[implementation],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Bug in Code,1500,C,1398169140,"[data structures, graphs, implementation, two pointers]",PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Cup Trick,1500,D,1398169140,[data structures],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Playing the ball,2000,E,1398169140,[geometry],PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Pasha and Hamsters,500,A,1398168900,"[constructive algorithms, implementation]",PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Start Up,1000,B,1398168900,[implementation],PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Online Meeting,2000,C,1398168900,[implementation],PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Bug in Code,2000,D,1398168900,"[binary search, data structures, sortings]",PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Cup Trick,2000,E,1398168900,[data structures],PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Squats,500,A,1398409200,[implementation],PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Megacity,1000,B,1398409200,"[binary search, greedy, implementation, sortings]",PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Magic Formulas,1500,C,1398409200,[math],PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Biathlon Track,2500,D,1398409200,"[binary search, brute force, constructive algorithms, data structures, dp]",PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Colored Jenga,3000,E,1398409200,"[dfs and similar, dp, probabilities]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Swaps,500,A,1398612600,"[brute force, sortings]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Table ,1000,B,1398612600,"[bitmasks, greedy]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Two Sequences,1500,C,1398612600,"[data structures, dp]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Squares,2000,D,1398612600,"[binary search, data structures, hashing]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Sets,2000,E,1398612600,[dp],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Mugs,500,A,1398612600,[implementation],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Mirroring,1000,B,1398612600,[implementation],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Swaps,1500,C,1398612600,"[brute force, sortings, two pointers]",PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Table ,2000,D,1398612600,[],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Two Sequences,2500,E,1398612600,[],PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Police Recruits,500,A,1399044600,[implementation],PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Prison Transfer,1000,B,1399044600,"[data structures, implementation]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Checkposts,1500,C,1399044600,"[dfs and similar, graphs, two pointers]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Match & Catch,2000,D,1399044600,"[dp, string suffix structures, strings]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Police Patrol,2500,E,1399044600,"[greedy, implementation, math, ternary search]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Xor-tree,500,A,1399822800,"[dfs and similar, trees]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Working out,1000,B,1399822800,[dp],PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Guess the Tree,1500,C,1399822800,"[bitmasks, constructive algorithms, dp, greedy, trees]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Tricky Function,2000,D,1399822800,"[data structures, divide and conquer, geometry]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Points and Segments,2000,E,1399822800,[graphs],PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Points and Segments (easy),500,A,1399822800,"[constructive algorithms, sortings]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Balls Game,1000,B,1399822800,"[brute force, two pointers]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Xor-tree,1500,C,1399822800,"[brute force, data structures, dfs and similar, trees]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Working out,2000,D,1399822800,"[brute force, dp]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Guess the Tree,2500,E,1399822800,"[constructive algorithms, data structures, dfs and similar]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Black Square,500,A,1400686200,[implementation],PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Shower Line,1500,B,1400686200,"[brute force, implementation]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,k-Tree,1500,C,1400686200,"[dp, implementation, trees]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Random Task,2000,D,1400686200,"[binary search, bitmasks, combinatorics, dp, math]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Chemistry Experiment,2500,E,1400686200,"[binary search, data structures, ternary search]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Choosing Teams,500,A,1400167800,"[greedy, implementation, sortings]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Football Kit,1000,B,1400167800,"[brute force, greedy, implementation]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Prime Swaps,1500,C,1400167800,"[greedy, sortings]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Prefixes and Suffixes,2000,D,1400167800,"[dp, string suffix structures, strings, two pointers]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Square Tiling,2500,E,1400167800,"[constructive algorithms, greedy]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Kitahara Haruki's Gift,500,A,1400914800,"[brute force, implementation]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Kuriyama Mirai's Stones,1500,B,1400914800,"[dp, implementation, sortings]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Ryouko's Memory Note,1500,C,1400914800,"[implementation, math, sortings]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Nanami's Digital Board,2000,D,1400914800,"[dsu, implementation]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Tachibana Kanade's Tofu,2500,E,1400914800,[dp],PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Ryouko's Memory Note,500,A,1400914800,"[math, sortings]",PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Nanami's Digital Board,1000,B,1400914800,"[divide and conquer, dp, dsu, implementation, two pointers]",PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Tachibana Kanade's Tofu,1500,C,1400914800,[dp],PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Nanami's Power Plant,2000,D,1400914800,[flows],PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Furukawa Nagisa's Tree,3000,E,1400914800,"[binary search, divide and conquer, sortings, trees]",PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Queue on Bus Stop,500,A,1401463800,[implementation],PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Pasha Maximizes,1000,B,1401463800,[greedy],PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Cardiogram,1500,C,1401463800,[implementation],PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Special Grid,2000,D,1401463800,"[brute force, dp, greedy]",PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Special Graph,2500,E,1401463800,[],PROGRAMMING
+436,Zepto Code Rush 2014,12,Feed with Candy,1000,A,1402673400,[greedy],PROGRAMMING
+436,Zepto Code Rush 2014,12,Om Nom and Spiders,1000,B,1402673400,"[implementation, math]",PROGRAMMING
+436,Zepto Code Rush 2014,12,Dungeons and Candies,1500,C,1402673400,"[dsu, graphs, greedy, trees]",PROGRAMMING
+436,Zepto Code Rush 2014,12,Pudding Monsters,2500,D,1402673400,[dp],PROGRAMMING
+436,Zepto Code Rush 2014,12,Cardboard Box,2500,E,1402673400,"[data structures, greedy]",PROGRAMMING
+436,Zepto Code Rush 2014,12,Banners,3000,F,1402673400,"[brute force, data structures, dp]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Homework,500,A,1401627600,[implementation],PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Set,1500,B,1401627600,"[bitmasks, greedy, implementation, sortings]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Toy,1500,C,1401627600,"[graphs, greedy, sortings]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Zoo,2000,D,1401627600,"[dsu, sortings]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Polygon,2500,E,1401627600,[],PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Toy,500,A,1401627600,[greedy],PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Zoo,1000,B,1401627600,"[dp, dsu, sortings]",PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Polygon,1500,C,1401627600,"[dp, geometry]",PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Sequence,2000,D,1401627600,[data structures],PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Binary Tree,3000,E,1401627600,"[combinatorics, divide and conquer, fft, number theory]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,"Devu, the Singer and Churu, the Joker",500,A,1401895800,"[greedy, implementation]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,"Devu, the Dumb Guy",1000,B,1401895800,"[implementation, sortings]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,Devu and Partitioning of the Array,1500,C,1401895800,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,Devu and his Brother,2000,D,1401895800,"[binary search, sortings, ternary search, two pointers]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,Devu and Birthday Celebration,2500,E,1401895800,"[combinatorics, dp, math]",PROGRAMMING
+440,Testing Round #10,12,Forgotten Episode,500,A,1401809400,[implementation],PROGRAMMING
+440,Testing Round #10,12,Balancer,1000,B,1401809400,[implementation],PROGRAMMING
+440,Testing Round #10,12,One-Based Arithmetic,1500,C,1401809400,"[dfs and similar, divide and conquer]",PROGRAMMING
+440,Testing Round #10,12,Berland Federalization,2000,D,1401809400,"[dp, trees]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Antique Items,500,A,1402241400,[implementation],PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Fruits,1000,B,1402241400,"[greedy, implementation]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Tubes ,1500,C,1402241400,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Swaps,2000,D,1402241400,"[constructive algorithms, dsu, graphs, implementation, string suffix structures]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Number,2500,E,1402241400,"[bitmasks, dp]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Borya and Hanabi,500,A,1403191800,"[bitmasks, brute force, implementation]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Andrey and Problem,1500,B,1403191800,"[greedy, math, probabilities]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Artem and Array ,1500,C,1403191800,"[data structures, greedy]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Adam and Tree,2000,D,1403191800,"[data structures, trees]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Gena and Second Distance,2500,E,1403191800,[geometry],PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Anton and Letters,500,A,1403191800,"[constructive algorithms, implementation]",PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Kolya and Tandem Repeat,1000,B,1403191800,[brute force],PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Borya and Hanabi,1500,C,1403191800,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Andrey and Problem,2500,D,1403191800,"[dp, greedy, math, probabilities, sortings]",PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Artem and Array ,2500,E,1403191800,[],PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Physics,500,A,1404651900,"[greedy, math]",PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves FFT,1000,B,1404651900,[probabilities],PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Colors,2000,C,1404651900,[data structures],PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Strings,2000,D,1404651900,"[binary search, hashing, strings, two pointers]",PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Planting,2500,E,1404651900,"[binary search, dsu, trees]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Chessboard,500,A,1404651900,"[dfs and similar, implementation]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Chemistry,1000,B,1404651900,"[dfs and similar, dsu, greedy]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Physics,1500,C,1404651900,"[graphs, greedy]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves FFT,2000,D,1404651900,[probabilities],PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Colors,3000,E,1404651900,[data structures],PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Sequences,500,A,1405256400,"[dp, implementation, two pointers]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Modification,1500,B,1405256400,"[brute force, greedy]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Fibonacci Numbers,1500,C,1405256400,"[data structures, number theory]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Games,2000,D,1405256400,"[math, matrices, probabilities]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Bridges,2500,E,1405256400,"[math, matrices]",PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Hash,500,A,1405256400,[implementation],PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Strings,1000,B,1405256400,"[greedy, implementation]",PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Sequences,1500,C,1405256400,[dp],PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Modification,2500,D,1405256400,"[data structures, greedy]",PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Fibonacci Numbers,2500,E,1405256400,[data structures],PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Rewards,500,A,1405605600,[implementation],PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Suffix Structures,1000,B,1405605600,"[implementation, strings]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Painting Fence,2500,C,1405605600,"[divide and conquer, dp, greedy]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Multiplication Table,2000,D,1405605600,"[binary search, brute force]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Divisors,3000,E,1405605600,"[brute force, dfs and similar, implementation, number theory]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Chocolate,500,A,1405774800,[math],PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Cities,1000,B,1405774800,"[graphs, shortest paths]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Apples,1500,C,1405774800,"[constructive algorithms, number theory]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Numbers,2000,D,1405774800,"[bitmasks, combinatorics, dp]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Squares,2500,E,1405774800,"[dp, math, number theory]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Children,500,A,1405774800,[implementation],PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Sequences,1000,B,1405774800,"[implementation, math]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Chocolate,1500,C,1405774800,"[greedy, implementation]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Cities,2000,D,1405774800,"[graphs, shortest paths]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Apples,2500,E,1405774800,"[constructive algorithms, number theory]",PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Game With Sticks,500,A,1406215800,[implementation],PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Sort the Array,1000,B,1406215800,"[implementation, sortings]",PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Predict Outcome of the Game,1500,C,1406215800,"[brute force, implementation, math]",PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Count Good Substrings,2500,D,1406215800,[math],PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Devu and Flowers,3000,E,1406215800,"[bitmasks, combinatorics, number theory]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Eevee,500,A,1406480400,"[implementation, strings]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,4-point polyline,1000,B,1406480400,"[brute force, constructive algorithms, geometry, trees]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Magic Trick,1000,C,1406480400,"[combinatorics, math, probabilities]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,"Washer, Dryer, Folder",1500,D,1406480400,"[greedy, implementation]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Three strings,2500,E,1406480400,"[data structures, dsu, string suffix structures, strings]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Permutation,2500,F,1406480400,"[data structures, divide and conquer, hashing]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Expected Maximum,500,A,1406907000,[probabilities],PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Harmony Chest,1000,B,1406907000,"[bitmasks, brute force, dp]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Summer Sun Celebration,1500,C,1406907000,"[constructive algorithms, dfs and similar]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Elements of Harmony,2500,D,1406907000,"[dp, matrices]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Lord Tirek,2500,E,1406907000,[data structures],PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Crystal Mine,500,A,1406907000,[implementation],PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Sort by Shift,1000,B,1406907000,[implementation],PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Expected Maximum,1500,C,1406907000,"[combinatorics, math, probabilities]",PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Harmony Chest,2000,D,1406907000,"[bitmasks, dp]",PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Summer Sun Celebration,2500,E,1406907000,[dfs and similar],PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Boredom,500,A,1407511800,[dp],PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,A Lot of Games,1000,B,1407511800,"[dfs and similar, dp, games, implementation, strings, trees]",PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Civilization,1500,C,1407511800,"[dfs and similar, dp, dsu, ternary search, trees]",PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Serega and Fun,2000,D,1407511800,[data structures],PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Function,2500,E,1407511800,[data structures],PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Laptops,500,A,1407511800,[sortings],PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Fedya and Maths,1000,B,1407511800,"[math, number theory]",PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Boredom,1500,C,1407511800,[dp],PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,A Lot of Games,2000,D,1407511800,"[dp, games, strings]",PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Civilization,2500,E,1407511800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Golden System,1000,A,1407690000,"[math, meet-in-the-middle]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Distributed Join,1000,B,1407690000,[greedy],PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Elections,1500,C,1407690000,[brute force],PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Bingo!,2000,D,1407690000,"[combinatorics, math, probabilities]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Flow Optimality,2500,E,1407690000,"[constructive algorithms, flows, math]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,An easy problem about trees,3000,F,1407690000,"[dp, games, greedy, trees]",PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Golden System,1000,A,1407690000,[math],PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Distributed Join,1000,B,1407690000,[greedy],PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Elections,1500,C,1407690000,"[data structures, ternary search]",PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Bingo!,2000,D,1407690000,"[combinatorics, probabilities]",PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Flow Optimality,2500,E,1407690000,[],PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,An easy problem about trees,3000,F,1407690000,[],PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Garden,500,A,1408116600,[implementation],PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Flowers,500,B,1408116600,"[implementation, sortings]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Buses,2000,C,1408116600,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Parmida's problem,2000,D,1408116600,"[data structures, divide and conquer, sortings]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Graph,3000,E,1408116600,"[dp, sortings]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Vasya and Socks,500,A,1408548600,"[brute force, implementation]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Little Dima and Equation,1000,B,1408548600,"[brute force, implementation, math]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Present,1500,C,1408548600,"[binary search, data structures, greedy]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Little Victor and Set,2000,D,1408548600,"[brute force, constructive algorithms]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Roland and Rose,2500,E,1408548600,"[brute force, geometry, math, sortings]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and Toastman,500,A,1409061600,"[greedy, sortings]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and Tree,1000,B,1409061600,"[dfs and similar, dp, trees]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and a Sheet of Paper,1500,C,1409061600,"[data structures, implementation]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and Complicated Task,2000,D,1409061600,"[dsu, math]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and a Game,2500,E,1409061600,[shortest paths],PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Easy Task,500,A,1409061600,"[brute force, implementation]",PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Card Game,1000,B,1409061600,[greedy],PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Toastman,1500,C,1409061600,"[implementation, sortings]",PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Tree,2000,D,1409061600,"[dp, graphs]",PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and a Sheet of Paper,2500,E,1409061600,[],PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Caisa and Sugar,500,A,1409383800,[implementation],PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Caisa and Pylons,1000,B,1409383800,[math],PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Gargari and Bishops,1500,C,1409383800,"[greedy, hashing, implementation]",PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Gargari and Permutations,2000,D,1409383800,"[dfs and similar, dp, graphs]",PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Caisa and Tree,2500,E,1409383800,"[brute force, dfs and similar, trees]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,No to Palindromes!,500,A,1410103800,"[greedy, strings]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,Restore Cube ,1500,B,1410103800,"[brute force, geometry]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,Substitutes in Number,1500,C,1410103800,[dp],PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,World of Darkraft - 2,2000,D,1410103800,"[dp, probabilities]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,The Classic Problem,2500,E,1410103800,"[data structures, graphs, shortest paths]",PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,inc ARG,500,A,1410103800,[implementation],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,Inbox (100500),1000,B,1410103800,[implementation],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,No to Palindromes!,1500,C,1410103800,[brute force],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,Restore Cube ,2500,D,1410103800,[brute force],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,Substitutes in Number,2500,E,1410103800,"[constructive algorithms, dp]",PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Cheap Travel,500,A,1410535800,[implementation],PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Wonder Room,1000,B,1410535800,"[brute force, math]",PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Number of Ways,1500,C,1410535800,"[binary search, brute force, data structures, dp, two pointers]",PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Increase Sequence,2000,D,1410535800,"[combinatorics, dp]",PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Information Graph,2500,E,1410535800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,George and Accommodation,500,A,1411054200,[implementation],PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,Fedor and New Game,1000,B,1411054200,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,George and Job,1500,C,1411054200,"[dp, implementation]",PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,Fedor and Essay,2000,D,1411054200,"[dfs and similar, dp, graphs, hashing, strings]",PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,Alex and Complicated Task,2500,E,1411054200,"[data structures, dp, greedy]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,24 Game,500,A,1411218000,"[constructive algorithms, greedy, math]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Two Sets,1000,B,1411218000,"[2-sat, dfs and similar, dsu, graph matchings, greedy]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Hack it!,1500,C,1411218000,"[binary search, constructive algorithms, math]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Tree,2000,D,1411218000,[graph matchings],PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Permanent,2500,E,1411218000,"[dp, graph matchings, math, meet-in-the-middle]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,I Wanna Be the Guy,500,A,1411218000,"[greedy, implementation]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,Chat Online,1000,B,1411218000,[implementation],PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,24 Game,1500,C,1411218000,"[constructive algorithms, implementation]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,Two Sets,2000,D,1411218000,"[2-sat, data structures, graph matchings, greedy]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,Hack it!,2500,E,1411218000,[constructive algorithms],PROGRAMMING
+470,Surprise Language Round #7,12,Crystal Ball Sequence,,A,1410622200,"[*special, implementation]",PROGRAMMING
+470,Surprise Language Round #7,12,Hexakosioihexekontahexaphobia,,B,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Eval,,C,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Caesar Cipher,,D,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Chessboard,,E,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Pairwise Sums,,F,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Hamming Distance,,G,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Array Sorting,,H,1410622200,[*special],PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Sticks,500,A,1411745400,[implementation],PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Important Things,1000,B,1411745400,[sortings],PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and House of Cards,2000,C,1411745400,"[binary search, brute force, greedy, math]",PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Cube Walls,2000,D,1411745400,"[string suffix structures, strings]",PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Lots and Lots of Segments,2500,E,1411745400,"[data structures, dsu]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Learn from Math,500,A,1411918500,"[math, number theory]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Learn from Life,1000,B,1411918500,[],PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Make It Nondeterministic,1500,C,1411918500,[greedy],PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Inverse the Problem,2000,D,1411918500,"[dfs and similar, dsu, shortest paths, trees]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Learn from a Game,3000,E,1411918500,"[constructive algorithms, implementation]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Change the Goal,3000,F,1411918500,"[constructive algorithms, math, matrices]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Increase the Constraints,3500,G,1411918500,"[bitmasks, data structures, fft]",PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Keyboard,500,A,1412609400,[implementation],PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Worms,1000,B,1412609400,"[binary search, implementation]",PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Captain Marmot,1500,C,1412609400,"[brute force, geometry]",PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Flowers,2000,D,1412609400,[dp],PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Pillars,3000,E,1412609400,"[binary search, data structures, dp, sortings, trees]",PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Ant colony,3000,F,1412609400,"[data structures, number theory]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Bayan Bus,500,A,1412514000,[implementation],PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Strongly Connected City,1000,B,1412514000,"[brute force, dfs and similar, graphs, implementation]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Kamal-ol-molk's Painting,1500,C,1412514000,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,CGCDSSQ,2000,D,1412514000,"[brute force, data structures, math]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Strongly Connected City 2,2500,E,1412514000,[dfs and similar],PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Meta-universe,2500,F,1412514000,[data structures],PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Stairs,500,A,1413122400,"[implementation, math]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and WiFi,1500,B,1413122400,"[bitmasks, brute force, combinatorics, dp, math, probabilities]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sums,1500,C,1413122400,[math],PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sets,2000,D,1413122400,"[constructive algorithms, greedy, math]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Strings,2500,E,1413122400,"[dp, strings]",PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sums,500,A,1413122400,[math],PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sets,1000,B,1413122400,[math],PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Strings,1500,C,1413122400,[dp],PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Binary,2000,D,1413122400,"[dp, strings]",PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Notepad,3000,E,1413122400,[data structures],PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Initial Bet,500,A,1413474000,[implementation],PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Random Teams,1000,B,1413474000,"[combinatorics, constructive algorithms, greedy, math]",PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Table Decorations,1500,C,1413474000,[greedy],PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Red-Green Towers,2000,D,1413474000,[dp],PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Wavy numbers,2500,E,1413474000,"[brute force, dfs and similar, meet-in-the-middle, sortings]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Expression,500,A,1413709200,"[brute force, math]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Towers,1000,B,1413709200,"[brute force, greedy, implementation, sortings]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Exams,1500,C,1413709200,"[greedy, sortings]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Long Jumps,2000,D,1413709200,"[binary search, greedy, implementation]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Riding in a Lift,2500,E,1413709200,[dp],PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Exams,500,A,1413709200,"[greedy, sortings]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Long Jumps,1000,B,1413709200,"[binary search, greedy, hashing, implementation, sortings]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Riding in a Lift,1500,C,1413709200,"[dp, implementation]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Parcels,2000,D,1413709200,"[dp, graphs]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Parking Lot,2500,E,1413709200,"[data structures, divide and conquer]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Diverse Permutation,500,A,1414170000,"[constructive algorithms, greedy]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Interesting Array,1500,B,1414170000,"[constructive algorithms, data structures, trees]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Game with Strings,1500,C,1414170000,"[bitmasks, dp, probabilities]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Random Function and Tree,2000,D,1414170000,"[combinatorics, dp, trees]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,ELCA,2500,E,1414170000,"[data structures, trees]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Counterexample ,500,A,1414170000,"[brute force, implementation]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Friends and Presents,1000,B,1414170000,"[binary search, math]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Diverse Permutation,1500,C,1414170000,"[constructive algorithms, implementation]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Interesting Array,2500,D,1414170000,[data structures],PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Game with Strings,2500,E,1414170000,[],PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Bits,500,A,1415205000,"[bitmasks, constructive algorithms]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Maximum Value,1000,B,1415205000,"[binary search, math, sortings, two pointers]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Strange Sorting,3000,C,1415205000,"[implementation, math]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Kindergarten,2000,D,1415205000,"[data structures, dp, greedy]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Sign on Fence,3000,E,1415205000,"[binary search, constructive algorithms, data structures]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Factory,1000,A,1415205000,"[implementation, math, matrices]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Valuable Resources,500,B,1415205000,"[brute force, greedy]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Bits,1500,C,1415205000,"[implementation, math]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Maximum Value,3000,D,1415205000,"[binary search, sortings]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Strange Sorting,3000,E,1415205000,[],PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,Calculating Function,500,A,1415718000,"[implementation, math]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,OR in Matrix,1000,B,1415718000,"[greedy, hashing, implementation]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,Palindrome Transformation,1500,C,1415718000,"[greedy, implementation]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,Valid Sets,2000,D,1415718000,"[dfs and similar, dp, math, trees]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,LIS of Sequence,2500,E,1415718000,"[data structures, dp, greedy, hashing, math]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Fight the Monster,500,A,1416590400,"[binary search, brute force]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Strip,1500,B,1416590400,"[binary search, data structures, dp, two pointers]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Prefix Product Sequence,1500,C,1416590400,"[constructive algorithms, number theory]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Conveyor Belts,2000,D,1416590400,[data structures],PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Tourists,2500,E,1416590400,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Giga Tower,500,A,1416590400,[brute force],PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Candy Boxes,1500,B,1416590400,"[brute force, constructive algorithms]",PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Fight the Monster,1500,C,1416590400,[brute force],PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Strip,2500,D,1416590400,"[data structures, dp, two pointers]",PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Prefix Product Sequence,2500,E,1416590400,"[constructive algorithms, math]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,SwapSort,500,A,1416238500,"[implementation, sortings]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,BerSU Ball,1000,B,1416238500,"[dfs and similar, dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Given Length and Sum of Digits...,1500,C,1416238500,"[dp, greedy, implementation]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Unbearable Controversy of Being,2000,D,1416238500,"[brute force, combinatorics, dfs and similar, graphs]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Hiking,2500,E,1416238500,"[binary search, dp]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Special Matrices,2500,F,1416238500,"[combinatorics, dp]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Team Olympiad,500,A,1416733800,"[greedy, implementation, sortings]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Queue,1000,B,1416733800,"[dsu, implementation]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Hacking Cypher,1500,C,1416733800,"[brute force, math, strings]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Chocolate,2000,D,1416733800,"[brute force, dfs and similar, math, meet-in-the-middle, number theory]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Restoring Increasing Sequence,2000,E,1416733800,"[binary search, brute force, greedy, implementation]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Treeland Tour,2500,F,1416733800,"[data structures, dfs and similar, dp, trees]",PROGRAMMING
+491,Testing Round #11,12,Up the hill,500,A,1416519000,[implementation],PROGRAMMING
+491,Testing Round #11,12,New York Hotel,1000,B,1416519000,"[greedy, math]",PROGRAMMING
+491,Testing Round #11,12,Deciphering,1500,C,1416519000,"[flows, graph matchings]",PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Cubes,500,A,1417451400,[implementation],PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Lanterns,1000,B,1417451400,"[binary search, math, sortings]",PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Exams,1500,C,1417451400,"[greedy, sortings]",PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Computer Game,2000,D,1417451400,"[binary search, implementation, math, sortings]",PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Field,2500,E,1417451400,[math],PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Football,500,A,1417618800,[implementation],PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Wrestling,1000,B,1417618800,[implementation],PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Basketball,2000,C,1417618800,"[binary search, brute force, implementation, sortings, two pointers]",PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Chess,1500,D,1417618800,"[constructive algorithms, games]",PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Polynomial,3000,E,1417618800,[math],PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Treasure,500,A,1418488200,[greedy],PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Obsessive String,1000,B,1418488200,"[dp, strings]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Helping People,1750,C,1418488200,"[dp, probabilities]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Birthday,1750,D,1418488200,"[data structures, dfs and similar, dp, trees]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Sharti,2500,E,1418488200,[games],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Digital Counter,500,A,1418488200,[implementation],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Modular Equations,1000,B,1418488200,[math],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Treasure,1500,C,1418488200,[implementation],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Obsessive String,2000,D,1418488200,"[binary search, dp, strings]",PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Helping People,2750,E,1418488200,[],PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Minimum Difficulty,500,A,1418833800,"[brute force, implementation, math]",PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Secret Combination,1000,B,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Removing Columns,1750,C,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Tennis Game,2250,D,1418833800,[binary search],PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Distributing Parts ,2250,E,1418833800,"[greedy, sortings]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Removing Columns,750,A,1418833800,[greedy],PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Tennis Game,1250,B,1418833800,"[binary search, brute force, implementation]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Distributing Parts ,1250,C,1418833800,"[data structures, greedy, implementation, sortings, two pointers]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Gears,2000,D,1418833800,"[brute force, geometry, math]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Subsequences Return,2500,E,1418833800,"[dp, matrices]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Crazy Town,500,A,1419438600,[geometry],PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Name That Tune,2000,B,1419438600,"[dp, probabilities, two pointers]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Array and Operations,1000,C,1419438600,"[flows, graph matchings, number theory]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Traffic Jams in the Land,2000,D,1419438600,"[data structures, dp, number theory]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Stairs and Lines,2500,E,1419438600,"[dp, matrices]",PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Watching a movie,500,A,1419438600,[implementation],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Lecture,500,B,1419438600,[strings],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Crazy Town,1500,C,1419438600,[math],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Name That Tune,3000,D,1419438600,[],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Array and Operations,3000,E,1419438600,[],PROGRAMMING
+500,Good Bye 2014,12,New Year Transportation,500,A,1419951600,"[dfs and similar, graphs, implementation]",PROGRAMMING
+500,Good Bye 2014,12,New Year Permutation,1000,B,1419951600,"[dfs and similar, dsu, graphs, greedy, math, sortings]",PROGRAMMING
+500,Good Bye 2014,12,New Year Book Reading,1000,C,1419951600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
+500,Good Bye 2014,12,New Year Santa Network,1500,D,1419951600,"[combinatorics, dfs and similar, graphs, trees]",PROGRAMMING
+500,Good Bye 2014,12,New Year Domino,2750,E,1419951600,"[data structures, dp, dsu]",PROGRAMMING
+500,Good Bye 2014,12,New Year Shopping,2750,F,1419951600,"[divide and conquer, dp]",PROGRAMMING
+500,Good Bye 2014,12,New Year Running,3500,G,1419951600,"[number theory, trees]",PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Contest,500,A,1421053200,[implementation],PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Changing Handles,500,B,1421053200,"[data structures, dsu, strings]",PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Forest,1500,C,1421053200,"[constructive algorithms, data structures, greedy, sortings, trees]",PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Permutations Summation,3000,D,1421053200,[data structures],PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Palindrome Degree,3000,E,1421053200,"[binary search, combinatorics, implementation]",PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and Forest,500,A,1421053200,"[constructive algorithms, data structures, graphs, greedy]",PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and Permutations Summation,500,B,1421053200,"[binary search, data structures, math]",PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and Palindrome Degree,2500,C,1421053200,[math],PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and XOR,2500,D,1421053200,[bitmasks],PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and LCP on Tree,3000,E,1421053200,"[binary search, dfs and similar, hashing, string suffix structures, trees]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Gift,500,A,1421586000,"[brute force, implementation, strings]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Colorful Graph,1000,B,1421586000,"[dfs and similar, dp, dsu, graphs]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,"Mr. Kitayuta, the Treasure Hunter",1500,C,1421586000,"[dfs and similar, dp, two pointers]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Technology,2000,D,1421586000,[dfs and similar],PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta vs. Bamboos,2750,E,1421586000,"[binary search, greedy]",PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,"Mr. Kitayuta, the Treasure Hunter",500,A,1421586000,[dp],PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Technology,1000,B,1421586000,"[dfs and similar, graphs]",PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta vs. Bamboos,1750,C,1421586000,[binary search],PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Colorful Graph,1750,D,1421586000,"[brute force, dfs and similar, dsu]",PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Gift,2500,E,1421586000,"[combinatorics, dp, matrices, strings]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Amr and Music,500,A,1422028800,"[greedy, implementation, sortings]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Amr and Pins,1000,B,1422028800,"[geometry, math]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Guess Your Way Out!,1500,C,1422028800,"[implementation, math]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,The Maths Lecture,2000,D,1422028800,"[dp, implementation]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Breaking Good,2500,E,1422028800,"[dfs and similar, dp, graphs, shortest paths]",PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Pasha and Pixels,500,A,1422376200,[brute force],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Anton and currency you all know,1000,B,1422376200,[greedy],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Anya and Ghosts,1500,C,1422376200,[greedy],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Tanya and Password,2000,D,1422376200,"[dfs and similar, graphs]",PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Arthur and Brackets,2500,E,1422376200,"[dp, greedy]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Maximum in Table,,A,1422705600,"[brute force, implementation]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Painting Pebbles,,B,1422705600,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Sums of Digits,,C,1422705600,"[dp, greedy, implementation]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Restoring Numbers,,D,1422705600,"[constructive algorithms, math]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Pretty Song,,E,1422705600,"[math, strings]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Progress Monitoring,,F,1422705600,[dp],PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Snake,500,A,1422894600,[implementation],PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Two Dots,1000,B,1422894600,[dfs and similar],PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Names,1500,C,1422894600,"[dfs and similar, graphs, sortings]",PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Jumping,2000,D,1422894600,"[bitmasks, brute force, dp, math]",PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Dinner,2500,E,1422894600,[flows],PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Names,500,A,1422894600,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Jumping,1000,B,1422894600,"[data structures, dp, math, number theory, shortest paths]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Dinner,1500,C,1422894600,"[flows, graph matchings]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Travelling,2250,D,1422894600,"[dp, trees]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Polygon,2250,E,1422894600,"[constructive algorithms, divide and conquer]",PROGRAMMING
+513,Rockethon 2015,12,Game,3,A,1423328400,"[constructive algorithms, math]",PROGRAMMING
+513,Rockethon 2015,12,Permutations,3,B1,1423328400,[brute force],PROGRAMMING
+513,Rockethon 2015,12,Permutations,4,B2,1423328400,"[bitmasks, divide and conquer, math]",PROGRAMMING
+513,Rockethon 2015,12,Second price auction,8,C,1423328400,"[bitmasks, probabilities]",PROGRAMMING
+513,Rockethon 2015,12,Constrained Tree,9,D1,1423328400,[dfs and similar],PROGRAMMING
+513,Rockethon 2015,12,Constrained Tree,8,D2,1423328400,"[constructive algorithms, data structures]",PROGRAMMING
+513,Rockethon 2015,12,Subarray Cuts,9,E1,1423328400,[dp],PROGRAMMING
+513,Rockethon 2015,12,Subarray Cuts,12,E2,1423328400,[dp],PROGRAMMING
+513,Rockethon 2015,12,Scaygerboss,14,F1,1423328400,[flows],PROGRAMMING
+513,Rockethon 2015,12,Scaygerboss,6,F2,1423328400,[flows],PROGRAMMING
+513,Rockethon 2015,12,Inversions problem,3,G1,1423328400,"[brute force, dfs and similar, dp, meet-in-the-middle]",PROGRAMMING
+513,Rockethon 2015,12,Inversions problem,5,G2,1423328400,"[dp, probabilities]",PROGRAMMING
+513,Rockethon 2015,12,Inversions problem,16,G3,1423328400,[dp],PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Chewbaсca and Number,500,A,1423931400,"[greedy, implementation]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Han Solo and Lazer Gun,1000,B,1423931400,"[brute force, data structures, geometry, math]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Watto and Mechanism,2000,C,1423931400,"[binary search, hashing, string suffix structures, strings]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,R2D2 and Droid Army,2000,D,1423931400,"[binary search, data structures, two pointers]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Darth Vader and Tree,2500,E,1423931400,"[dp, matrices]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Date,500,A,1424190900,[math],PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and His Happy Friends,1000,B,1424190900,"[brute force, dsu, meet-in-the-middle, number theory]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Factorial,1000,C,1424190900,"[greedy, math, sortings]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Tiles,3000,D,1424190900,"[constructive algorithms, greedy]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Park,3000,E,1424190900,[data structures],PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Factorial,500,A,1424190900,"[dp, greedy, implementation, math]",PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Tiles,1000,B,1424190900,"[data structures, graph matchings, greedy, implementation]",PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Park,1500,C,1424190900,[data structures],PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Morning Exercise,3000,D,1424190900,"[dfs and similar, dp, dsu, trees, two pointers]",PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and His Happy Friends,3000,E,1424190900,"[math, number theory]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Vitaly and Strings,500,A,1424795400,[strings],PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Tanya and Postcard,1000,B,1424795400,"[implementation, strings]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Anya and Smartphone,1500,C,1424795400,"[data structures, implementation]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Ilya and Escalator,2000,D,1424795400,"[combinatorics, dp, probabilities]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Arthur and Questions,2500,E,1424795400,"[greedy, implementation, ternary search]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Pasha and Pipe,2500,F,1424795400,"[binary search, brute force, combinatorics, dp, implementation]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Chess,500,A,1425128400,[implementation],PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Compilation Errors,1000,B,1425128400,"[data structures, implementation]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Team Training,1500,C,1425128400,"[greedy, implementation, math, number theory]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Interesting Substrings,2000,D,1425128400,"[data structures, dp, two pointers]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Lecture Rooms,2500,E,1425128400,"[binary search, data structures, dfs and similar, dp, trees]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Pangram,500,A,1425279600,"[implementation, strings]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Two Buttons,1000,B,1425279600,"[dfs and similar, graphs, greedy, implementation, math, shortest paths]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,DNA Alignment,1500,C,1425279600,"[math, strings]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Cubes,2000,D,1425279600,"[games, greedy, implementation]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Pluses everywhere,2500,E,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,DNA Alignment,500,A,1425279600,"[greedy, math]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Cubes,1000,B,1425279600,"[data structures, greedy, implementation]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Pluses everywhere,1500,C,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Shop,2000,D,1425279600,[greedy],PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Cycling City,2500,E,1425279600,"[dfs and similar, graphs]",PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Reposts,500,A,1425740400,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Photo to Remember,1000,B,1425740400,"[data structures, dp, implementation]",PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Chicken or Fish?,1500,C,1425740400,[greedy],PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Closest Equals,2000,D,1425740400,[data structures],PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,"Rotate, Flip and Zoom",500,A,1426345200,[implementation],PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,Mean Requests,1000,B,1426345200,[implementation],PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,Name Quest,1500,C,1426345200,[greedy],PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,Statistics of Recompressing Videos,2000,D,1426345200,"[data structures, implementation]",PROGRAMMING
+524,VK Cup 2015 - Round 1,12,"Возможно, вы знаете этих людей?",500,A,1426946400,[implementation],PROGRAMMING
+524,VK Cup 2015 - Round 1,12,Фото на память - 2 (round version),500,B,1426946400,"[dp, greedy]",PROGRAMMING
+524,VK Cup 2015 - Round 1,12,The Art of Dealing with ATM,1000,C,1426946400,"[binary search, sortings]",PROGRAMMING
+524,VK Cup 2015 - Round 1,12,Social Network,1250,D,1426946400,"[greedy, two pointers]",PROGRAMMING
+524,VK Cup 2015 - Round 1,12,Rooks and Rectangles,1750,E,1426946400,[data structures],PROGRAMMING
+524,VK Cup 2015 - Round 1,12,And Yet Another Bracket Sequence,3000,F,1426946400,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Vitaliy and Pie,250,A,1427387400,"[greedy, hashing]",PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Pasha and String,750,B,1427387400,[greedy],PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Ilya and Sticks,1000,C,1427387400,"[greedy, sortings]",PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Arthur and Walls,3000,D,1427387400,"[data structures, greedy]",PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Anya and Cubes,3000,E,1427387400,"[binary search, bitmasks, brute force, dp, meet-in-the-middle]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,King of Thieves,500,A,1428165300,"[brute force, implementation]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Om Nom and Dark Park,500,B,1428165300,"[dfs and similar, greedy, implementation]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Om Nom and Candies,1250,C,1428165300,"[brute force, greedy, math]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Om Nom and Necklace,1750,D,1428165300,"[hashing, string suffix structures, strings]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Transmitting Levels,2250,E,1428165300,"[dp, implementation]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Pudding Monsters,3000,F,1428165300,"[data structures, divide and conquer]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Spiders Evil Plan,3000,G,1428165300,"[greedy, trees]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Playing with Paper,500,A,1426610700,"[implementation, math]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Error Correct System,1000,B,1426610700,[greedy],PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Glass Carving,1500,C,1426610700,"[binary search, data structures, implementation]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Clique Problem,2000,D,1426610700,"[data structures, dp, greedy, implementation, sortings]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Data Center Drama,2500,E,1426610700,"[dfs and similar, graphs]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Glass Carving,500,A,1426610700,"[data structures, implementation]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Clique Problem,1000,B,1426610700,"[dp, greedy]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Data Center Drama,1500,C,1426610700,"[constructive algorithms, graphs]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Fuzzy Search,2000,D,1426610700,"[bitmasks, brute force, fft]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Triangles 3000,2500,E,1426610700,"[geometry, sortings]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,And Yet Another Bracket Sequence,2500,A,1426956300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Group Photo 2 (online mirror version),500,B,1426956300,"[brute force, greedy, sortings]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Rooks and Rectangles,1500,C,1426956300,[data structures],PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Social Network,1250,D,1426956300,"[data structures, greedy]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,The Art of Dealing with ATM,500,E,1426956300,[brute force],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,String inside out,,B,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Set subtraction,,D,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Sum and product,,E,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Points in triangle,,H,1427562000,"[*special, geometry]",PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Different variables,,I,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,String inside out,,B,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Set subtraction,,D,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Sum and product,,E,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Points in triangle,,H,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Different variables,,I,1427562000,[*special],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Berland Miners,3000,A,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Work Group,500,B,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Board Game,250,C,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Landmarks,3000,D,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Correcting Mistakes,500,E,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Encoding,1250,F,1429286400,[],PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Berland Miners,3000,A,1429286400,"[binary search, data structures, dfs and similar, greedy, trees]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Work Group,750,B,1429286400,"[dfs and similar, dp, graphs, strings, trees]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Board Game,250,C,1429286400,"[games, greedy, implementation, math]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Landmarks,3000,D,1429286400,[data structures],PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Correcting Mistakes,500,E,1429286400,"[constructive algorithms, dp, greedy, hashing, strings, two pointers]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Encoding,1500,F,1429286400,"[hashing, string suffix structures, strings]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Exam,500,A,1428854400,"[constructive algorithms, implementation]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Covered Path,1000,B,1428854400,"[dp, greedy, math]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Polycarpus' Dice,1500,C,1428854400,[math],PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Handshakes,2000,D,1428854400,"[binary search, constructive algorithms, data structures, greedy]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Berland Local Positioning System,2500,E,1428854400,"[constructive algorithms, greedy, hashing, implementation]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Simplified Nonogram,3000,F,1428854400,"[bitmasks, dp, hashing, meet-in-the-middle]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Nafas,500,A,1429029300,[implementation],PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and SaDDas,1000,B,1429029300,"[bitmasks, brute force, implementation]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Karafs,1500,C,1429029300,"[binary search, math]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Malekas,2000,D,1429029300,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Pashmaks,2500,E,1429029300,[geometry],PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas and Karafs,500,A,1429029300,"[binary search, math]",PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas and Malekas,1000,B,1429029300,"[hashing, string suffix structures, strings]",PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas and Pashmaks,1500,C,1429029300,[geometry],PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas in Kansas,2000,D,1429029300,"[dp, games]",PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas on the Path,2500,E,1429029300,"[data structures, divide and conquer, trees]",PROGRAMMING
+537,VK Cup 2015 - Wild Card Round 2,12,Antiplagiarism,,A,1429381800,[*special],PROGRAMMING
+538,Codeforces Round #300,12,Cutting Banner,500,A,1430064000,"[brute force, implementation]",PROGRAMMING
+538,Codeforces Round #300,12,Quasi Binary,1000,B,1430064000,"[constructive algorithms, dp, greedy, implementation]",PROGRAMMING
+538,Codeforces Round #300,12,Tourist's Notes,1500,C,1430064000,"[binary search, brute force, greedy, implementation, math]",PROGRAMMING
+538,Codeforces Round #300,12,Weird Chess,1500,D,1430064000,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+538,Codeforces Round #300,12,Demiurges Play Again,2000,E,1430064000,"[dfs and similar, dp, math, trees]",PROGRAMMING
+538,Codeforces Round #300,12,A Heap of Heaps,2500,F,1430064000,"[brute force, data structures, math, sortings]",PROGRAMMING
+538,Codeforces Round #300,12,Berserk Robot ,3000,G,1430064000,"[constructive algorithms, math, sortings]",PROGRAMMING
+538,Codeforces Round #300,12,Summer Dichotomy,3000,H,1430064000,"[2-sat, data structures, dfs and similar, greedy]",PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Combination Lock,500,A,1430411400,[implementation],PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,School Marks,1000,B,1430411400,"[greedy, implementation]",PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Ice Cave,1500,C,1430411400,[dfs and similar],PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Bad Luck Island,2000,D,1430411400,"[dp, probabilities]",PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Infinite Inversions,2500,E,1430411400,"[binary search, data structures, implementation, sortings, trees]",PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Place Your Ad Here,750,A,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Duck Hunt,3000,B,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Idempotent functions,250,C,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Superhero's Job,1250,D,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Playing on Graph,750,E,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Quest,500,F,1430668800,[],PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Place Your Ad Here,2000,A,1430668800,"[data structures, sortings]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Duck Hunt,3000,B,1430668800,[data structures],PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Idempotent functions,750,C,1430668800,"[constructive algorithms, graphs, math]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Superhero's Job,2250,D,1430668800,"[dfs and similar, dp, hashing, math, number theory]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Playing on Graph,2250,E,1430668800,"[graphs, shortest paths]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Quest,1000,F,1430668800,"[dp, greedy]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Writing Code,500,A,1431016200,[dp],PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Destroying Roads,1000,B,1431016200,"[graphs, shortest paths]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Remembering Strings,1750,C,1431016200,"[bitmasks, dp]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Road Improvement,1750,D,1431016200,"[dp, trees]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Listening to Music,2500,E,1431016200,"[constructive algorithms, data structures]",PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Set of Strings,500,A,1431016200,[implementation],PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Sea and Islands,1000,B,1431016200,"[constructive algorithms, implementation]",PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Writing Code,1500,C,1431016200,[dp],PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Destroying Roads,2000,D,1431016200,"[brute force, graphs, shortest paths]",PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Remembering Strings,2750,E,1431016200,"[bitmasks, dp]",PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Toy Cars,500,A,1432053000,[implementation],PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Equidistant String,1000,B,1432053000,[greedy],PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Woodcutters,1750,C,1432053000,"[dp, greedy]",PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Queue,1750,D,1432053000,"[greedy, implementation, sortings]",PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Paths and Trees,2500,E,1432053000,"[graphs, greedy, shortest paths]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Bananas,500,A,1432312200,"[implementation, math]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Badges,1000,B,1432312200,"[brute force, greedy, implementation, sortings]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Cards,1250,C,1432312200,"[brute force, dfs and similar]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Number Game,1500,D,1432312200,"[constructive algorithms, dp, math, number theory]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Traveling,2250,E,1432312200,"[flows, math]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Frog,750,A,1432658100,"[brute force, implementation, math]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Feet,1000,B,1432658100,"[binary search, data structures, dp, dsu]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Foam,1750,C,1432658100,"[bitmasks, number theory]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Fish,1750,D,1432658100,"[dfs and similar, graphs]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Friends,2500,E,1432658100,"[data structures, string suffix structures, strings]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Fax,500,A,1432658100,"[brute force, implementation]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Fun,1000,B,1432658100,"[brute force, greedy, implementation]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Frog,1750,C,1432658100,[number theory],PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Feet,2000,D,1432658100,"[binary search, data structures]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Foam,2750,E,1432658100,[number theory],PROGRAMMING
+549,Looksery Cup 2015,12,Face Detection,250,A,1433595600,[implementation],PROGRAMMING
+549,Looksery Cup 2015,12,Looksery Party,1750,B,1433595600,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING
+549,Looksery Cup 2015,12,The Game Of Parity,2000,C,1433595600,[games],PROGRAMMING
+549,Looksery Cup 2015,12,Haar Features,1000,D,1433595600,"[greedy, implementation]",PROGRAMMING
+549,Looksery Cup 2015,12,Sasha Circle,3000,E,1433595600,[math],PROGRAMMING
+549,Looksery Cup 2015,12,Yura and Developers,3000,F,1433595600,"[data structures, divide and conquer]",PROGRAMMING
+549,Looksery Cup 2015,12,Happy Line,1500,G,1433595600,"[greedy, sortings]",PROGRAMMING
+549,Looksery Cup 2015,12,Degenerate Matrix,1500,H,1433595600,"[binary search, math]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Two Substrings,1000,A,1433435400,"[brute force, dp, implementation, strings]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Preparing Olympiad,750,B,1433435400,"[bitmasks, brute force]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Divisibility by Eight,1000,C,1433435400,"[brute force, dp, math]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Regular Bridge,2000,D,1433435400,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Brackets in Implications,3000,E,1433435400,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ and Contest,500,A,1434127500,"[implementation, sortings]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,ZgukistringZ,1250,B,1434127500,"[brute force, constructive algorithms, implementation, strings]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ hates Boxes,1750,C,1434127500,"[binary search, greedy]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ and Binary Operations,2000,D,1434127500,"[combinatorics, math, matrices, number theory]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ and GukiZiana,2500,E,1434127500,"[binary search, data structures]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Table,500,A,1434645000,"[implementation, math]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Books,1000,B,1434645000,"[implementation, math]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Scales,1500,C,1434645000,"[brute force, dp, greedy, math, meet-in-the-middle]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Triangles,2000,D,1434645000,"[brute force, combinatorics, data structures, geometry, math, sortings]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Brackets,2500,E,1434645000,"[brute force, dp, expression parsing, greedy, implementation]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Kyoya and Colored Balls,250,A,1435163400,"[combinatorics, dp, math]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Kyoya and Permutation,500,B,1435163400,"[binary search, combinatorics, constructive algorithms, implementation, math]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Love Triangles,1000,C,1435163400,"[dfs and similar, dsu, graphs]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Nudist Beach,1500,D,1435163400,"[binary search, graphs, greedy]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Kyoya and Train,3000,E,1435163400,"[dp, fft, probabilities]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Kyoya and Photobooks,250,A,1435163400,"[brute force, math]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Ohana Cleans Up,500,B,1435163400,"[brute force, strings]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Kyoya and Colored Balls,1500,C,1435163400,"[combinatorics, dp, math]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Kyoya and Permutation,3000,D,1435163400,[math],PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Love Triangles,3000,E,1435163400,"[dfs and similar, dsu]",PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Matryoshkas,250,A,1435414200,[implementation],PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Fugitive,750,B,1435414200,"[data structures, greedy, sortings]",PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Chocolate,1250,C,1435414200,[data structures],PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of a Top Secret,2000,D,1435414200,"[binary search, implementation, math]",PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Computer Network,3000,E,1435414200,"[dfs and similar, graphs, trees]",PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of the Zeros and Ones,250,A,1435414200,[greedy],PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Fake Numbers,250,B,1435414200,"[brute force, implementation]",PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Matryoshkas,1000,C,1435414200,[implementation],PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Fugitive,3000,D,1435414200,"[binary search, data structures, greedy]",PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Chocolate,3000,E,1435414200,"[binary search, data structures]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Ilya and Diplomas,500,A,1435676400,"[greedy, implementation]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Pasha and Tea,1000,B,1435676400,"[implementation, sortings]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Arthur and Table,1500,C,1435676400,"[brute force, data structures, dp, greedy]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Vitaly and Cycle,2000,D,1435676400,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Ann and Half-Palindrome,2500,E,1435676400,"[data structures, dp, string suffix structures, strings, trees]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Lala Land and Apple Trees,500,A,1436886600,"[brute force, implementation, sortings]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Amr and The Large Array,1000,B,1436886600,[implementation],PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Amr and Chemistry,1500,C,1436886600,"[brute force, greedy]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Guess Your Way Out! II,2250,D,1436886600,"[data structures, implementation, sortings]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,A Simple Task,2500,E,1436886600,"[data structures, sortings, strings]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Gerald's Hexagon,500,A,1437573600,"[brute force, geometry, math]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Equivalent Strings,1000,B,1437573600,"[divide and conquer, hashing, sortings, strings]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Gerald and Giant Chess,1500,C,1437573600,"[combinatorics, dp, math, number theory]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Randomizer,2250,D,1437573600,"[combinatorics, geometry, probabilities]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Gerald and Path,2250,E,1437573600,"[dp, sortings]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Currency System in Geraldion,500,A,1437573600,"[geometry, implementation, sortings]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Gerald is into Art,1000,B,1437573600,"[constructive algorithms, implementation]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Gerald's Hexagon,1500,C,1437573600,[geometry],PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Equivalent Strings,2000,D,1437573600,"[hashing, implementation, strings]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Gerald and Giant Chess,2500,E,1437573600,"[combinatorics, dp]",PROGRAMMING
+562,VK Cup 2015 - Finals,12,Logistical Questions,1500,A,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Clique in the Divisibility Graph,250,B,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Restoring Map,2250,C,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Restructuring Company,250,D,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Max and Min,500,E,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Matching Names,250,F,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Replicating Processes,500,G,1437898500,[],PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Matching Names,1750,A,1438273200,"[dfs and similar, strings, trees]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Replicating Processes,2500,B,1438273200,"[constructive algorithms, greedy]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Logistical Questions,3000,C,1438273200,"[dfs and similar, divide and conquer, trees]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Restructuring Company,1000,D,1438273200,"[data structures, dsu]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Restoring Map,3000,E,1438273200,"[bitmasks, constructive algorithms, trees]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Clique in the Divisibility Graph,500,F,1438273200,"[dp, math, number theory]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Max and Min,2500,G,1438273200,[geometry],PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Lineland Mail,500,A,1438790400,[implementation],PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Berland National Library,1000,B,1438790400,[implementation],PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Geometric Progression,1500,C,1438790400,"[binary search, data structures, dp]",PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,One-Dimensional Battle Ships,2000,D,1438790400,"[binary search, data structures, sortings]",PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,President and Roads,2500,E,1438790400,"[dfs and similar, graphs, hashing, shortest paths]",PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Mausoleum,2500,F,1438790400,[dp],PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Primes or Palindromes?,500,A,1439224200,"[brute force, implementation, math, number theory]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Symmetric and Transitive,1000,B,1439224200,"[combinatorics, dp, math]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,New Language,1500,C,1439224200,"[2-sat, greedy]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Sign Posts,2250,D,1439224200,"[brute force, math]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Longest Increasing Subsequence,2500,E,1439224200,"[data structures, dp]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Music,500,A,1439224200,"[implementation, math]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Inventory,1000,B,1439224200,[greedy],PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Primes or Palindromes?,1500,C,1439224200,"[binary search, brute force, number theory]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Symmetric and Transitive,2250,D,1439224200,"[brute force, dp, math]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,New Language,2750,E,1439224200,[],PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Elections,500,A,1439483400,[implementation],PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Simple Game,1000,B,1439483400,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Replacement,1500,C,1439483400,"[constructive algorithms, data structures, implementation]",PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Tree Requests,2000,D,1439483400,"[binary search, constructive algorithms, dfs and similar, trees]",PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Pig and Palindromes,2500,E,1439483400,"[combinatorics, dp]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Lengthening Sticks,750,A,1440261000,"[combinatorics, implementation, math]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Minimization,1250,B,1440261000,"[dp, greedy, sortings]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,CNF 2,1500,C,1440261000,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Campus,2000,D,1440261000,"[binary search, data structures, dsu, trees]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Geometric Progressions,2750,E,1440261000,[math],PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Arrays,500,A,1440261000,[sortings],PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Order Book,1000,B,1440261000,"[data structures, greedy, implementation, sortings]",PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Lengthening Sticks,1750,C,1440261000,"[brute force, combinatorics, dp, math]",PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Minimization,2250,D,1440261000,"[dp, sortings]",PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,CNF 2,2500,E,1440261000,[],PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Poker,500,A,1440865800,"[implementation, number theory]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Blocks,1000,B,1440865800,"[binary search, data structures, dp]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Drawing,1750,C,1440865800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Cavalry,2000,D,1440865800,"[data structures, divide and conquer, dp]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Bowling,2500,E,1440865800,[greedy],PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Elections,500,A,1440865800,[implementation],PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Three Musketeers,1000,B,1440865800,"[brute force, dfs and similar, graphs, hashing]",PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Poker,1500,C,1440865800,[number theory],PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Blocks,2000,D,1440865800,"[data structures, dp, shortest paths]",PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Drawing,2750,E,1440865800,[],PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Fibonotci,,A,1441526400,"[math, matrices]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Bribes,,B,1441526400,"[dfs and similar, trees]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Party,,C,1441526400,"[bitmasks, brute force, graph matchings]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Tablecity,,D,1441526400,[constructive algorithms],PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Spectator Riots,,E,1441526400,[geometry],PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Bulbo,,F,1441526400,"[dp, greedy]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Run for beer,,G,1441526400,"[dfs and similar, shortest paths]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Bots,,H,1441526400,"[combinatorics, number theory]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Robots protection,,I,1441526400,[data structures],PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Vasya and Petya's Game,500,A,1441902600,"[math, number theory]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Invariance of Tree,1250,B,1441902600,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Points on Plane,1250,C,1441902600,"[constructive algorithms, divide and conquer, geometry, greedy, sortings]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Flights for Regular Customers,2000,D,1441902600,"[dp, matrices]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Painting Edges,2750,E,1441902600,"[binary search, data structures]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Multiplication Table,500,A,1441902600,"[implementation, number theory]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Modulo Sum,1250,B,1441902600,"[combinatorics, data structures, dp, two pointers]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Vasya and Petya's Game,1500,C,1441902600,"[implementation, number theory]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Invariance of Tree,2250,D,1441902600,[],PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Points on Plane,2250,E,1441902600,[constructive algorithms],PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,A Problem about Polyline,250,A,1442416500,"[geometry, math]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,"""Or"" Game",500,B,1442416500,"[brute force, greedy]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Weakness and Poorness,750,C,1442416500,[ternary search],PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,LCS Again,2500,D,1442416500,"[dp, greedy]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Walking!,2750,E,1442416500,"[constructive algorithms, greedy]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Mirror Box,3000,F,1442416500,"[matrices, trees]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Raising Bacteria,250,A,1442416500,[bitmasks],PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Finding Team Member,500,B,1442416500,"[brute force, implementation, sortings]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,A Problem about Polyline,1250,C,1442416500,"[binary search, math]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,"""Or"" Game",2000,D,1442416500,"[brute force, greedy, math]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Weakness and Poorness,3000,E,1442416500,[ternary search],PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,LCS Again,3000,F,1442416500,[],PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and First Steps,750,A,1442939400,"[brute force, dp, implementation]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Company,1250,B,1442939400,"[binary search, sortings, two pointers]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Park,1500,C,1442939400,"[dfs and similar, trees]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Dishes,2000,D,1442939400,"[bitmasks, dp]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Watch,2500,E,1442939400,"[data structures, hashing, strings]",PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Vasya the Hipster,500,A,1443430800,[implementation],PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Luxurious Houses,1000,B,1443430800,[implementation],PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Developing Skills,1500,C,1443430800,"[implementation, sortings]",PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Three Logos,2000,D,1443430800,"[bitmasks, brute force, constructive algorithms, implementation, math]",PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Kojiro and Furrari,3000,E,1443430800,"[dp, greedy]",PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Zublicanes and Mumocrates,3000,F,1443430800,"[dp, trees, two pointers]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,GCD Table,750,A,1443890700,"[constructive algorithms, greedy]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Once Again...,1250,B,1443890700,"[dp, matrices]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Superior Periodic Subarrays,1500,C,1443890700,[number theory],PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Number of Binominal Coefficients,2250,D,1443890700,"[dp, number theory]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Boolean Function,2500,E,1443890700,"[bitmasks, dp, expression parsing]",PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Asphalting Roads,500,A,1443890700,[implementation],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Robot's Task,1000,B,1443890700,[implementation],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,GCD Table,1750,C,1443890700,[],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Once Again...,2250,D,1443890700,[],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Superior Periodic Subarrays,2500,E,1443890700,[number theory],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Olesya and Rodion,500,A,1444149000,[math],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Kolya and Tanya ,1000,B,1444149000,[combinatorics],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Marina and Vasya,1500,C,1444149000,"[constructive algorithms, greedy]",PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Dima and Lisa,2000,D,1444149000,[number theory],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Anton and Ira,2500,E,1444149000,"[constructive algorithms, greedy]",PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Gennady the Dentist,500,A,1444641000,"[brute force, implementation]",PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Phillip and Trains,750,B,1444641000,[dfs and similar],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,"Alice, Bob, Oranges and Apples",1250,C,1444641000,[number theory],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Lizard Era: Beginning,1750,D,1444641000,[meet-in-the-middle],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Present for Vitalik the Philatelist ,2250,E,1444641000,"[combinatorics, math, number theory]",PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Digits of Number Pi,3000,F,1444641000,"[dp, implementation, strings]",PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Alena's Schedule,500,A,1444641000,[implementation],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Laurenty and Shop,1000,B,1444641000,[implementation],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Gennady the Dentist,1500,C,1444641000,[implementation],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Phillip and Trains,1750,D,1444641000,[dp],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,"Alice, Bob, Oranges and Apples",2250,E,1444641000,[number theory],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Lizard Era: Beginning,2750,F,1444641000,[meet-in-the-middle],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff and Weight Lifting,500,A,1444926600,[greedy],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff in Beach,1000,B,1444926600,[dp],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff in the Army,1500,C,1444926600,"[data structures, trees]",PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff in Mafia,2000,D,1444926600,"[2-sat, binary search]",PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff as a Queen,2750,E,1444926600,[data structures],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff is Mad,2750,F,1444926600,"[data structures, strings]",PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff and Meat,750,A,1444926600,[greedy],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in Love,1000,B,1444926600,[math],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff and Weight Lifting,1500,C,1444926600,[],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in Beach,2000,D,1444926600,[],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in the Army,2500,E,1444926600,"[data structures, dfs and similar, trees]",PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in Mafia,3000,F,1444926600,[],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Email Aliases,,A,1445068800,[implementation],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Layer Cake,,B,1445068800,[sortings],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Polycarp's Masterpiece,,C,1445068800,"[data structures, divide and conquer, dp]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Boulevard,,D,1445068800,"[brute force, implementation]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Training with Doors,,E,1445068800,[],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Gourmet and Banquet,,F,1445068800,"[binary search, flows, greedy]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Hiring,,G,1445068800,"[binary search, data structures]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Tourist Guide,,H,1445068800,[dfs and similar],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lottery,,I,1445068800,[implementation],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Cleaner Robot,,J,1445068800,"[dfs and similar, implementation]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Task processing,,K,1445068800,"[brute force, math]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Agricultural Archaeology,,L,1445068800,"[greedy, math]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Taxi in Berland,,M,1445068800,[shortest paths],PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Median Smoothing,750,A,1445763600,[],PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Chip 'n Dale Rescue Rangers,1000,B,1445763600,"[binary search, geometry, math]",PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Three States,1250,C,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Top Secret Task,1750,D,1445763600,[dp],PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Birthday,2500,E,1445763600,"[graph matchings, strings]",PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Wizards' Duel,500,A,1445763600,[math],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Rebranding,1000,B,1445763600,[implementation],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Median Smoothing,1750,C,1445763600,[constructive algorithms],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Chip 'n Dale Rescue Rangers,2000,D,1445763600,[],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Three States,2250,E,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,PawnChess,500,A,1446309000,[implementation],PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,The Monster and the Squirrel,1000,B,1446309000,[math],PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,The Big Race,1500,C,1446309000,[math],PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,Super M,2000,D,1446309000,"[dfs and similar, dp, trees]",PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,BCPC,3000,E,1446309000,"[binary search, geometry, two pointers]",PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,2Char,250,A,1446655500,[brute force],PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Anton and Lines,1000,B,1446655500,"[geometry, sortings]",PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Beautiful Function,3000,C,1446655500,"[constructive algorithms, math]",PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Happy Tree Party,3000,D,1446655500,"[data structures, trees]",PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Strange Calculation and Cats,3000,E,1446655500,"[dp, matrices]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Warrior and Archer,500,A,1447000200,[games],PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Max and Bike,1000,B,1447000200,"[binary search, geometry]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Edo and Magnets,1500,C,1447000200,"[brute force, two pointers]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,REQ,2000,D,1447000200,"[data structures, number theory]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Cutting the Line,3000,E,1447000200,"[string suffix structures, strings]",PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Vitaly and Night,500,A,1447000200,[implementation],PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Pasha and Phone,1000,B,1447000200,"[binary search, math]",PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Warrior and Archer,1500,C,1447000200,[games],PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Max and Bike,2000,D,1447000200,[],PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Edo and Magnets,2500,E,1447000200,[],PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Swimming Pool,500,A,1447605300,[implementation],PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Array,1000,B,1447605300,[greedy],PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Points,1500,C,1447605300,"[greedy, sortings]",PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Trees,2250,D,1447605300,"[dp, probabilities, sortings]",PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Strings,2500,E,1447605300,"[dfs and similar, dp, graphs]",PROGRAMMING
+597,Testing Round #12,12,Divisibility,500,A,1447264800,[math],PROGRAMMING
+597,Testing Round #12,12,Restaurant,1000,B,1447264800,"[dp, greedy, sortings]",PROGRAMMING
+597,Testing Round #12,12,Subsequences,1500,C,1447264800,"[data structures, dp]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Tricky Sum,,A,1447426800,[math],PROGRAMMING
+598,Educational Codeforces Round 1,12,Queries on a String,,B,1447426800,"[implementation, strings]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Nearest vectors,,C,1447426800,"[geometry, sortings]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Igor In the Museum,,D,1447426800,[dfs and similar],PROGRAMMING
+598,Educational Codeforces Round 1,12,Chocolate Bar,,E,1447426800,"[brute force, dp]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Cut Length,,F,1447426800,[geometry],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Patrick and Shopping,500,A,1448037300,[implementation],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Spongebob and Joke,1000,B,1448037300,[implementation],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Day at the Beach,1500,C,1448037300,[sortings],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Spongebob and Squares,2000,D,1448037300,"[brute force, math]",PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Sandy and Nuts,3000,E,1448037300,"[bitmasks, dp]",PROGRAMMING
+600,Educational Codeforces Round 2,12,Extract Numbers,,A,1448636400,[implementation],PROGRAMMING
+600,Educational Codeforces Round 2,12,Queries about less or equal elements,,B,1448636400,"[binary search, sortings, two pointers]",PROGRAMMING
+600,Educational Codeforces Round 2,12,Make Palindrome,,C,1448636400,[greedy],PROGRAMMING
+600,Educational Codeforces Round 2,12,Area of Two Circles' Intersection,,D,1448636400,[geometry],PROGRAMMING
+600,Educational Codeforces Round 2,12,Lomsat gelral,,E,1448636400,"[dfs and similar, dsu, trees]",PROGRAMMING
+600,Educational Codeforces Round 2,12,Edge coloring of bipartite graph,,F,1448636400,[graphs],PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,The Two Routes,500,A,1448382900,"[graphs, shortest paths]",PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,Lipshitz Sequence,1250,B,1448382900,[data structures],PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,Kleofáš and the n-thlon,1250,C,1448382900,"[dp, probabilities]",PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,Acyclic Organic Compounds,2000,D,1448382900,"[data structures, dfs and similar, dsu, hashing, trees]",PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,A Museum Robbery,2500,E,1448382900,"[data structures, dp]",PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Two Bases,500,A,1448382900,[implementation],PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Approximating a Constant Range,1000,B,1448382900,"[dp, two pointers]",PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,The Two Routes,1500,C,1448382900,[],PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Lipshitz Sequence,2250,D,1448382900,[],PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Kleofáš and the n-thlon,2250,E,1448382900,[probabilities],PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Alternative Thinking,500,A,1448984100,"[dp, greedy]",PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Moodular Arithmetic,1000,B,1448984100,"[dfs and similar, dsu, math, number theory]",PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Lieges of Legendre,1500,C,1448984100,[games],PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Ruminations on Ruminants,2000,D,1448984100,"[geometry, math]",PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Pastoral Oddities,3000,E,1448984100,"[data structures, divide and conquer, dsu, trees]",PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Uncowed Forces,500,A,1448984100,[implementation],PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,More Cowbell,1000,B,1448984100,"[binary search, greedy]",PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Alternative Thinking,1500,C,1448984100,"[constructive algorithms, dp, math]",PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Moodular Arithmetic,2000,D,1448984100,[dsu],PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Lieges of Legendre,2500,E,1448984100,[],PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Sorting Railway Cars,500,A,1449677100,"[constructive algorithms, greedy]",PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Lazy Student,1000,B,1449677100,"[constructive algorithms, data structures, graphs]",PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Freelancer's Dreams,1500,C,1449677100,[geometry],PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Board Game,2000,D,1449677100,"[data structures, dfs and similar]",PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Intergalaxy Trips,2500,E,1449677100,"[probabilities, shortest paths]",PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Magic Spheres,500,A,1449677100,[implementation],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Testing Robots,1000,B,1449677100,[implementation],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Sorting Railway Cars,1500,C,1449677100,[],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Lazy Student,2000,D,1449677100,[graphs],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Freelancer's Dreams,2500,E,1449677100,[],PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Chain Reaction,500,A,1450888500,"[binary search, dp]",PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Zuma,1250,B,1450888500,[dp],PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Marbles,1500,C,1450888500,"[hashing, strings]",PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Power Tree,2000,D,1450888500,[data structures],PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Cross Sum,3000,E,1450888500,"[binary search, geometry]",PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Saitama Destroys Hotel,500,A,1450888500,"[implementation, math]",PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Hamming Distance Sum,1000,B,1450888500,[combinatorics],PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Chain Reaction,1500,C,1450888500,[dp],PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Zuma,2250,D,1450888500,[],PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Marbles,2500,E,1450888500,[],PROGRAMMING
+609,Educational Codeforces Round 3,12,USB Flash Drives,,A,1450537200,"[greedy, implementation, sortings]",PROGRAMMING
+609,Educational Codeforces Round 3,12,The Best Gift,,B,1450537200,[implementation],PROGRAMMING
+609,Educational Codeforces Round 3,12,Load Balancing,,C,1450537200,[implementation],PROGRAMMING
+609,Educational Codeforces Round 3,12,Gadgets for dollars and pounds,,D,1450537200,"[binary search, two pointers]",PROGRAMMING
+609,Educational Codeforces Round 3,12,Minimum spanning tree for each edge,,E,1450537200,"[data structures, dfs and similar, dsu, graphs, trees]",PROGRAMMING
+609,Educational Codeforces Round 3,12,Frogs and mosquitoes,,F,1450537200,[data structures],PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Pasha and Stick,500,A,1451215200,"[combinatorics, math]",PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Vika and Squares,1000,B,1451215200,[implementation],PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Harmony Analysis,1500,C,1451215200,[constructive algorithms],PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Vika and Segments,2500,D,1451215200,"[data structures, geometry, two pointers]",PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Alphabet Permutations,2500,E,1451215200,"[data structures, strings]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Days,500,A,1451487900,[implementation],PROGRAMMING
+611,Good Bye 2015,12,New Year and Old Property,750,B,1451487900,"[brute force, implementation]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Domino,1250,C,1451487900,"[dp, implementation]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Ancient Prophecy,1750,D,1451487900,"[hashing, strings]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Three Musketeers,2500,E,1451487900,"[data structures, greedy]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Cleaning,2500,F,1451487900,"[binary search, implementation]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Cake,3000,G,1451487900,"[geometry, two pointers]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Forgotten Tree,3500,H,1451487900,"[constructive algorithms, flows]",PROGRAMMING
+612,Educational Codeforces Round 4,12,The Text Splitting,,A,1451055600,"[brute force, implementation, strings]",PROGRAMMING
+612,Educational Codeforces Round 4,12,HDD is Outdated Technology,,B,1451055600,[implementation],PROGRAMMING
+612,Educational Codeforces Round 4,12,Replace To Make Regular Bracket Sequence,,C,1451055600,"[data structures, expression parsing, math]",PROGRAMMING
+612,Educational Codeforces Round 4,12,The Union of k-Segments,,D,1451055600,[sortings],PROGRAMMING
+612,Educational Codeforces Round 4,12,Square Root of Permutation,,E,1451055600,"[combinatorics, constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+612,Educational Codeforces Round 4,12,Simba on the Circle,,F,1451055600,[dp],PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Peter and Snow Blower,750,A,1452789300,"[binary search, geometry, ternary search]",PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Skills,1250,B,1452789300,"[binary search, brute force, two pointers]",PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Necklace,1250,C,1452789300,[constructive algorithms],PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Kingdom and its Cities,2000,D,1452789300,"[dfs and similar, divide and conquer, graphs, sortings, trees]",PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Puzzle Lover,2500,E,1452789300,"[dp, hashing, strings]",PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Link/Cut Tree,500,A,1452789300,[brute force],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Gena's Code,1000,B,1452789300,[implementation],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Peter and Snow Blower,1750,C,1452789300,[],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Skills,2250,D,1452789300,[],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Necklace,2250,E,1452789300,[],PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Bulbs,500,A,1452261900,[implementation],PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Longtail Hedgehog,1250,B,1452261900,"[dp, graphs]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Running Track,1750,C,1452261900,"[dp, greedy, strings, trees]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Multipliers,2000,D,1452261900,"[math, number theory]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Hexagons,2500,E,1452261900,"[binary search, implementation, math]",PROGRAMMING
+616,Educational Codeforces Round 5,12,Comparing Two Long Integers,,A,1452524400,"[implementation, strings]",PROGRAMMING
+616,Educational Codeforces Round 5,12,Dinner with Emma,,B,1452524400,"[games, greedy]",PROGRAMMING
+616,Educational Codeforces Round 5,12,The Labyrinth,,C,1452524400,[dfs and similar],PROGRAMMING
+616,Educational Codeforces Round 5,12,Longest k-Good Segment,,D,1452524400,"[binary search, data structures, two pointers]",PROGRAMMING
+616,Educational Codeforces Round 5,12,Sum of Remainders,,E,1452524400,"[implementation, math, number theory]",PROGRAMMING
+616,Educational Codeforces Round 5,12,Expensive Strings,,F,1452524400,"[string suffix structures, strings]",PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Elephant,500,A,1453563300,[math],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Chocolate,1000,B,1453563300,[combinatorics],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Watering Flowers,1250,C,1453563300,[implementation],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Polyline,1750,D,1453563300,[constructive algorithms],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,XOR and Favorite Number,2750,E,1453563300,[data structures],PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Slime Combining,500,A,1454087400,[implementation],PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Guess the Permutation,1000,B,1454087400,[constructive algorithms],PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Constellation,1500,C,1454087400,"[geometry, implementation]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Hamiltonian Spanning Tree,1750,D,1454087400,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Robot Arm,2500,E,1454087400,[data structures],PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Double Knapsack,2750,F,1454087400,"[constructive algorithms, two pointers]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Combining Slimes,3500,G,1454087400,"[dp, matrices, probabilities]",PROGRAMMING
+620,Educational Codeforces Round 6,12,Professor GukiZ's Robot,,A,1453388400,"[implementation, math]",PROGRAMMING
+620,Educational Codeforces Round 6,12,Grandfather Dovlet’s calculator,,B,1453388400,[implementation],PROGRAMMING
+620,Educational Codeforces Round 6,12,Pearls in a Row,,C,1453388400,[greedy],PROGRAMMING
+620,Educational Codeforces Round 6,12,Professor GukiZ and Two Arrays,,D,1453388400,"[binary search, two pointers]",PROGRAMMING
+620,Educational Codeforces Round 6,12,New Year Tree,,E,1453388400,"[bitmasks, data structures]",PROGRAMMING
+620,Educational Codeforces Round 6,12,Xors on Segments,,F,1453388400,[data structures],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Odd and Even,500,A,1454249100,[implementation],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Bishops,1000,B,1454249100,[combinatorics],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Flowers,1500,C,1454249100,[probabilities],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Rat Kwesh and Cheese,2000,D,1454249100,"[brute force, math]",PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Blocks,2500,E,1454249100,"[dp, matrices]",PROGRAMMING
+622,Educational Codeforces Round 7,12,Infinite Sequence,,A,1455116400,"[implementation, math]",PROGRAMMING
+622,Educational Codeforces Round 7,12,The Time,,B,1455116400,[implementation],PROGRAMMING
+622,Educational Codeforces Round 7,12,Not Equal on a Segment,,C,1455116400,"[data structures, implementation]",PROGRAMMING
+622,Educational Codeforces Round 7,12,Optimal Number Permutation,,D,1455116400,[constructive algorithms],PROGRAMMING
+622,Educational Codeforces Round 7,12,Ants in Leaves,,E,1455116400,"[dfs and similar, greedy, trees]",PROGRAMMING
+622,Educational Codeforces Round 7,12,The Sum of the k-th Powers,,F,1455116400,[math],PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Graph and String,500,A,1454605500,"[constructive algorithms, graphs]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Array GCD,1000,B,1454605500,"[dp, greedy, number theory]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Electric Charges,1750,C,1454605500,[binary search],PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Birthday,2000,D,1454605500,"[greedy, probabilities]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Transforming Sequence,2250,E,1454605500,"[combinatorics, dp, fft]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Save Luke,500,A,1454605500,[math],PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Making a String,1000,B,1454605500,"[greedy, sortings]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Graph and String,1500,C,1454605500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Array GCD,2000,D,1454605500,"[dp, greedy, number theory]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Electric Charges,3000,E,1454605500,[],PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,Guest From the Past,750,A,1454835900,"[implementation, math]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,War of the Corporations,750,B,1454835900,"[constructive algorithms, strings]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,K-special Tables,1000,C,1454835900,"[constructive algorithms, implementation]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,Finals in arithmetic,2000,D,1454835900,"[constructive algorithms, implementation]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,Frog Fights,3000,E,1454835900,"[data structures, greedy]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Robot Sequence,500,A,1455384900,"[brute force, implementation]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Cards,750,B,1455384900,"[constructive algorithms, dp]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Block Towers,1000,C,1455384900,"[brute force, greedy]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Jerry's Protest,1500,D,1455384900,"[brute force, combinatorics, probabilities]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Simple Skewness,2000,E,1455384900,"[binary search, math, ternary search]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Group Projects,2500,F,1455384900,[dp],PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Raffles,3000,G,1455384900,"[data structures, greedy]",PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,XOR Equation,500,A,1456683000,"[dp, math]",PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Factory Repairs,1000,B,1456683000,[data structures],PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Package Delivery,1500,C,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Preorder Test,2000,D,1456683000,"[binary search, dp, trees]",PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Orchestra,2500,E,1456683000,[two pointers],PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Island Puzzle,3000,F,1456683000,"[dfs and similar, graphs, trees]",PROGRAMMING
+628,Educational Codeforces Round 8,12,Tennis Tournament,,A,1455894000,[implementation],PROGRAMMING
+628,Educational Codeforces Round 8,12,New Skateboard,,B,1455894000,[dp],PROGRAMMING
+628,Educational Codeforces Round 8,12,Bear and String Distance,,C,1455894000,[greedy],PROGRAMMING
+628,Educational Codeforces Round 8,12,Magic Numbers,,D,1455894000,[dp],PROGRAMMING
+628,Educational Codeforces Round 8,12,Zbazi in Zeydabad,,E,1455894000,"[data structures, implementation]",PROGRAMMING
+628,Educational Codeforces Round 8,12,Bear and Fair Set,,F,1455894000,[flows],PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Far Relative’s Birthday Cake,500,A,1455986100,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Far Relative’s Problem,1000,B,1455986100,[brute force],PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Famil Door and Brackets,1750,C,1455986100,"[dp, strings]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Babaei and Birthday Cake,2000,D,1455986100,"[data structures, dp]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Famil Door and Roads,2500,E,1455986100,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Again Twenty Five!,,A,1455807600,[number theory],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Moore's Law,,B,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Lucky Numbers,,C,1455807600,"[combinatorics, math]",PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Hexagons!,,D,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,A rectangle,,E,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Selection of Personnel,,F,1455807600,"[combinatorics, math]",PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Challenge Pennants,,G,1455807600,[combinatorics],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Benches,,H,1455807600,[combinatorics],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Parking Lot,,I,1455807600,[combinatorics],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Divisibility,,J,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Indivisibility,,K,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Cracking the Code,,L,1455807600,[implementation],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Turn,,M,1455807600,"[geometry, math]",PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Forecast,,N,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Arrow,,O,1455807600,[geometry],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Area of a Star,,P,1455807600,[geometry],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Pyramids,,Q,1455807600,[geometry],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Game,,R,1455807600,[games],PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Interview,500,A,1457022900,"[brute force, implementation]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Print Check,1000,B,1457022900,"[constructive algorithms, implementation]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Report,1500,C,1457022900,"[data structures, sortings]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Messenger,2000,D,1457022900,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Product Sum,2500,E,1457022900,"[data structures, dp, geometry]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Grandma Laura and Apples,,A,1456844400,[],PROGRAMMING
+632,Educational Codeforces Round 9,12,"Alice, Bob, Two Teams",,B,1456844400,"[brute force, constructive algorithms]",PROGRAMMING
+632,Educational Codeforces Round 9,12,The Smallest String Concatenation,,C,1456844400,"[sortings, strings]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Longest Subsequence,,D,1456844400,"[brute force, math, number theory]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Thief in a Shop,,E,1456844400,"[divide and conquer, dp, fft]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Magic Matrix,,F,1456844400,"[brute force, divide and conquer, graphs, trees]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Ebony and Ivory,250,A,1456506900,"[brute force, math]",PROGRAMMING
+633,"Manthan, Codefest 16",12,A Trivial Problem,500,B,1456506900,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Spy Syndrome 2,1500,C,1456506900,"[data structures, dp, hashing, implementation, sortings, string suffix structures, strings]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Fibonacci-ish,1750,D,1456506900,"[brute force, hashing, implementation, math]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Startup Funding,2500,E,1456506900,"[binary search, data structures, probabilities, two pointers]",PROGRAMMING
+633,"Manthan, Codefest 16",12,The Chocolate Spree,2750,F,1456506900,"[dfs and similar, dp, trees]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Yash And Trees,3000,G,1456506900,"[bitmasks, data structures, dfs and similar]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Fibonacci-ish II,3000,H,1456506900,"[data structures, implementation]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Island Puzzle,500,A,1456683000,"[constructive algorithms, implementation]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,XOR Equation,1000,B,1456683000,"[constructive algorithms, dp, implementation]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Factory Repairs,1500,C,1456683000,[data structures],PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Package Delivery,2000,D,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Preorder Test,2500,E,1456683000,[],PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Orchestra,3000,F,1456683000,[two pointers],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Orchestra,500,A,1456683000,"[brute force, implementation]",PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Island Puzzle,1000,B,1456683000,[],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,XOR Equation,1500,C,1456683000,[dp],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Factory Repairs,2000,D,1456683000,[],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Package Delivery,2500,E,1456683000,"[data structures, greedy]",PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Preorder Test,3000,F,1456683000,[],PROGRAMMING
+636,VeeRoute Marathon,12,Transfer,,A,1456765200,[*special],PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Voting for Photos,500,A,1457870400,[implementation],PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Chat Order,1000,B,1457870400,"[binary search, data structures, sortings]",PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Promocodes with Mistakes,1500,C,1457870400,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Running with Obstacles,2000,D,1457870400,"[data structures, dp, greedy]",PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Home Numbers,500,A,1458475200,[constructive algorithms],PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Making Genome in Berland,1000,B,1458475200,"[*special, dfs and similar, strings]",PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Road Improvement,1500,C,1458475200,"[dfs and similar, greedy, trees]",PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Three-dimensional Turtle Super Computer ,2000,D,1458475200,"[brute force, dfs and similar, graphs]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Displayed Friends,500,A,1459182900,[implementation],PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Forgotten Tree 3,750,B,1459182900,"[constructive algorithms, graphs, trees]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Polynomials,1000,C,1459182900,"[hashing, implementation, math]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Contribution,1500,D,1459182900,"[data structures, greedy, sortings]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Paradox,2000,E,1459182900,"[greedy, math, sortings]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Chemistry,3000,F,1459182900,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Seasons,,B,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Array Sum,,C,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Grasshopper,500,A,1461515700,[implementation],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Matrix,750,B,1461515700,[implementation],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Dance,1000,C,1461515700,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Random Variable,1500,D,1461515700,"[dp, implementation, math, probabilities]",PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Time Machine,2000,E,1461515700,[data structures],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and 2-SAT,3000,F,1461515700,[],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Graph,3000,G,1461515700,[],PROGRAMMING
+642,VK Cup 2016 - Wild Card Round 2,12,Scheduler for Invokers,,A,1461596400,[*special],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bear and Colors,500,A,1462633500,[implementation],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bear and Two Paths,1000,B,1462633500,[constructive algorithms],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Levels and Regions,1750,C,1462633500,[dp],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bearish Fanpages,2250,D,1462633500,[],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bear and Destroying Subtrees,2250,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bears and Juice,3000,F,1462633500,[math],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Choosing Ads,3000,G,1462633500,[],PROGRAMMING
+644,CROC 2016 - Qualification,12,Parliament of Berland,500,A,1458118800,[constructive algorithms],PROGRAMMING
+644,CROC 2016 - Qualification,12,Processing Queries,1000,B,1458118800,"[data structures, two pointers]",PROGRAMMING
+644,CROC 2016 - Qualification,12,Hostname Aliases,1500,C,1458118800,"[binary search, data structures, sortings, strings]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Amity Assessment,500,A,1458318900,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Mischievous Mess Makers,1000,B,1458318900,"[greedy, math]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Enduring Exodus,1500,C,1458318900,"[binary search, two pointers]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Robot Rapping Results Report,2000,D,1458318900,"[binary search, dp, graphs]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Intellectual Inquiry,2500,E,1458318900,"[dp, greedy, strings]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Cowslip Collections,3000,F,1458318900,"[combinatorics, math, number theory]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Armistice Area Apportionment,3500,G,1458318900,"[binary search, geometry]",PROGRAMMING
+646,Технокубок 2016 - Ознакомительный Раунд 1,12,Три брата,500,A,1458568800,[],PROGRAMMING
+646,Технокубок 2016 - Ознакомительный Раунд 1,12,Ошибка передачи сообщения,1000,B,1458568800,[strings],PROGRAMMING
+647,Технокубок 2016 - Ознакомительный Раунд 2,12,Оценки Васи,500,A,1458799200,[],PROGRAMMING
+647,Технокубок 2016 - Ознакомительный Раунд 2,12,Звёздное небо,1000,B,1458799200,[],PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Наибольший подъем,500,A,1458745200,[constructive algorithms],PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Собери стол,1000,B,1458745200,"[constructive algorithms, sortings]",PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Путь Робота,1500,C,1458745200,"[dfs and similar, graphs]",PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Собачки и миски,2000,D,1458745200,"[greedy, sortings]",PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Собери число,2500,E,1458745200,[],PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Любимые числа Поликарпа,500,A,1458975600,[constructive algorithms],PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Этажи,1000,B,1458975600,[constructive algorithms],PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Печать условий,1500,C,1458975600,"[greedy, sortings]",PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Дефрагментация памяти,2000,D,1458975600,"[greedy, implementation]",PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Автобус,2500,E,1458975600,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Watchmen,500,A,1457342700,"[data structures, math]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Image Preview,1000,B,1457342700,"[binary search, dp, two pointers]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Table Compression,1500,C,1457342700,"[dfs and similar, dp, dsu, graphs, greedy]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Zip-line,2000,D,1457342700,"[binary search, data structures, dp]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Clockwork Bomb,2500,E,1457342700,"[data structures, dfs and similar, dsu, trees]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Joysticks,500,A,1457342700,"[dp, greedy]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Beautiful Paintings,1000,B,1457342700,"[greedy, sortings]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Watchmen,1500,C,1457342700,"[data structures, geometry, implementation, sortings]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Image Preview,2000,D,1457342700,"[binary search, dp, two pointers]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Table Compression,2500,E,1457342700,"[dsu, graphs, greedy]",PROGRAMMING
+652,Educational Codeforces Round 10,12,Gabriel and Caterpillar,,A,1458910800,[implementation],PROGRAMMING
+652,Educational Codeforces Round 10,12,z-sort,,B,1458910800,[sortings],PROGRAMMING
+652,Educational Codeforces Round 10,12,Foe Pairs,,C,1458910800,[two pointers],PROGRAMMING
+652,Educational Codeforces Round 10,12,Nested Segments,,D,1458910800,"[data structures, sortings]",PROGRAMMING
+652,Educational Codeforces Round 10,12,Pursuit For Artifacts,,E,1458910800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+652,Educational Codeforces Round 10,12,Ants on a Circle,,F,1458910800,"[constructive algorithms, math]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Three Balls,500,A,1458376500,"[brute force, implementation, sortings]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Compressing,1000,B,1458376500,"[brute force, dfs and similar, dp, strings]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Up-Down,1500,C,1458376500,"[brute force, implementation]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Delivery Bears,2000,D,1458376500,"[binary search, flows]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Forgotten Tree 2,2500,E,1458376500,"[dfs and similar, dsu, graphs]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Paper task,3500,F,1458376500,"[data structures, string suffix structures]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Move by Prime,3500,G,1458376500,[combinatorics],PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Amity Assessment,500,A,1458318900,[],PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Mischievous Mess Makers,1000,B,1458318900,[],PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Enduring Exodus,1500,C,1458318900,"[binary search, two pointers]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Robot Rapping Results Report,2000,D,1458318900,"[binary search, graphs]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Intellectual Inquiry,2500,E,1458318900,"[dp, greedy, strings]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Cowslip Collections,3000,F,1458318900,"[combinatorics, number theory]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Armistice Area Apportionment,3500,G,1458318900,[],PROGRAMMING
+656,April Fools Day Contest 2016,12,Da Vinci Powers,,A,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Scrambled,,B,1459526400,"[*special, implementation]",PROGRAMMING
+656,April Fools Day Contest 2016,12,Without Text,,C,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Rosetta Problem,,D,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Out of Controls,,E,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Ace It!,,F,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,You're a Professional,,G,1459526400,[*special],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Forgotten Tree 3,500,A,1459182900,[graphs],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Polynomials,1000,B,1459182900,[math],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Contribution,1500,C,1459182900,[sortings],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Paradox,2000,D,1459182900,[sortings],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Chemistry,3000,E,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Reverse Radewoosh,500,A,1459182900,[implementation],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Displayed Friends,1000,B,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Forgotten Tree 3,1500,C,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Polynomials,2000,D,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Contribution,2500,E,1459182900,[],PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Round House,500,A,1459353900,"[implementation, math]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Qualifying Contest,1000,B,1459353900,[sortings],PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Tanya and Toys,1000,C,1459353900,"[greedy, implementation]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Bicycle Race,1250,D,1459353900,"[geometry, implementation, math]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,New Reform,1500,E,1459353900,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Polycarp and Hay,2000,F,1459353900,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Fence Divercity,2500,G,1459353900,"[combinatorics, dp]",PROGRAMMING
+660,Educational Codeforces Round 11,12,Co-prime Array,,A,1460127600,"[greedy, implementation]",PROGRAMMING
+660,Educational Codeforces Round 11,12,Seating On Bus,,B,1460127600,[implementation],PROGRAMMING
+660,Educational Codeforces Round 11,12,Hard Process,,C,1460127600,"[binary search, dp, two pointers]",PROGRAMMING
+660,Educational Codeforces Round 11,12,Number of Parallelograms,,D,1460127600,[geometry],PROGRAMMING
+660,Educational Codeforces Round 11,12,Different Subsets For All Tuples,,E,1460127600,[combinatorics],PROGRAMMING
+660,Educational Codeforces Round 11,12,Bear and Bowling 4,,F,1460127600,"[binary search, data structures, geometry, ternary search]",PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Seasons,,B,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Array Sum,,C,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Gambling Nim,500,A,1460729700,"[bitmasks, math, matrices, probabilities]",PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Graph Coloring,250,B,1460729700,[dfs and similar],PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Binary Table,2250,C,1460729700,"[bitmasks, brute force, divide and conquer, dp, fft, math]",PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,International Olympiad,250,D,1460729700,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,To Hack or not to Hack,2250,E,1460729700,"[brute force, dp, greedy]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,Rebus,500,A,1460824500,"[constructive algorithms, expression parsing, greedy, math]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,International Olympiad,1000,B,1460824500,"[brute force, constructive algorithms, greedy, strings]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,Graph Coloring,1500,C,1460824500,[dfs and similar],PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,To Hack or not to Hack,2500,D,1460824500,"[brute force, dp, greedy]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,Binary Table,2500,E,1460824500,"[bitmasks, divide and conquer, dp]",PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,Complicated GCD,500,A,1460824500,[math],PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,Rebus,1000,B,1460824500,[greedy],PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,International Olympiad,1500,C,1460824500,[greedy],PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,Graph Coloring,2000,D,1460824500,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,To Hack or not to Hack,3000,E,1460824500,[],PROGRAMMING
+665,Educational Codeforces Round 12,12,Buses Between Cities,,A,1461164400,[implementation],PROGRAMMING
+665,Educational Codeforces Round 12,12,Shopping,,B,1461164400,[brute force],PROGRAMMING
+665,Educational Codeforces Round 12,12,Simple Strings,,C,1461164400,"[dp, greedy, strings]",PROGRAMMING
+665,Educational Codeforces Round 12,12,Simple Subset,,D,1461164400,"[constructive algorithms, greedy]",PROGRAMMING
+665,Educational Codeforces Round 12,12,Beautiful Subarrays,,E,1461164400,"[data structures, divide and conquer]",PROGRAMMING
+665,Educational Codeforces Round 12,12,Four Divisors,,F,1461164400,"[dp, math, number theory]",PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Reberland Linguistics,500,A,1461947700,"[dp, implementation]",PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,World Tour,1000,B,1461947700,"[graphs, shortest paths]",PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Codeword,2000,C,1461947700,[combinatorics],PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Chain Reaction,2000,D,1461947700,[brute force],PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Forensic Examination,3000,E,1461947700,"[data structures, string suffix structures]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Pouring Rain,500,A,1461947700,"[geometry, math]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Coat of Anticubism,1000,B,1461947700,"[constructive algorithms, geometry]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Reberland Linguistics,1500,C,1461947700,"[dp, strings]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,World Tour,2000,D,1461947700,"[brute force, graphs, shortest paths]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Chain Reaction,3000,E,1461947700,[],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Matrix,500,A,1461515700,[],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Dance,1000,B,1461515700,[],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Random Variable,1500,C,1461515700,[math],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Time Machine,2000,D,1461515700,[data structures],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and 2-SAT,3000,E,1461515700,[graphs],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Graph,3000,F,1461515700,[dp],PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Presents,500,A,1461515700,[math],PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Grasshopper,1000,B,1461515700,[],PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Matrix,1500,C,1461515700,"[constructive algorithms, implementation]",PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Dance,2000,D,1461515700,"[data structures, implementation, math]",PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Time Machine,2500,E,1461515700,[data structures],PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Holidays,500,A,1462464300,"[brute force, constructive algorithms]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Game of Robots,750,B,1462464300,[implementation],PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Cinema,1000,C,1462464300,"[implementation, sortings]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Magic Powder - 1,1000,D1,1462464300,"[binary search, brute force]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Magic Powder - 2,500,D2,1462464300,[binary search],PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Correct Bracket Sequence Editor,2000,E,1462464300,"[data structures, dsu]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Restore a Number,2500,F,1462464300,"[constructive algorithms, strings]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Recycling Bottles,500,A,1462984500,"[dp, greedy]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Robin Hood,1000,B,1462984500,"[binary search, greedy]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Ultimate Weirdness of an Array,1500,C,1462984500,"[data structures, number theory]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Roads in Yusland,2000,D,1462984500,"[data structures, dp, greedy]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Organizing a Race,3000,E,1462984500,"[data structures, greedy]",PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Summer Camp,500,A,1462984500,[implementation],PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Different is Good,1000,B,1462984500,"[constructive algorithms, implementation, strings]",PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Recycling Bottles,1500,C,1462984500,"[brute force, geometry, greedy]",PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Robin Hood,2000,D,1462984500,"[binary search, greedy]",PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Ultimate Weirdness of an Array,2500,E,1462984500,[],PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Game,500,A,1462633500,[implementation],PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Problems for Round,750,B,1462633500,"[greedy, implementation]",PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Colors,1000,C,1462633500,[],PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Two Paths,1500,D,1462633500,[],PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Levels and Regions,2250,E,1462633500,"[divide and conquer, dp]",PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bearish Fanpages,3000,F,1462633500,[],PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Colors,500,A,1462633500,"[brute force, data structures, implementation]",PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Two Paths,1000,B,1462633500,"[constructive algorithms, graphs]",PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Levels and Regions,1750,C,1462633500,"[divide and conquer, dp]",PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bearish Fanpages,2250,D,1462633500,[],PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Destroying Subtrees,2250,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bears and Juice,3000,F,1462633500,[combinatorics],PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Choosing Ads,3000,G,1462633500,[],PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Infinite Sequence,500,A,1463416500,[math],PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Restoring Painting,1000,B,1463416500,"[brute force, constructive algorithms, math]",PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Money Transfers,1500,C,1463416500,"[data structures, greedy, sortings]",PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Tree Construction,2000,D,1463416500,"[data structures, trees]",PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Trains and Statistic,2500,E,1463416500,"[data structures, dp, greedy]",PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,Nicholas and Permutation,500,A,1464188700,[implementation],PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,Pyramid of Glasses,1000,B,1464188700,[implementation],PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,Vasya and String,1500,C,1464188700,"[binary search, dp, two pointers]",PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,Theseus and labyrinth,2250,D,1464188700,"[implementation, shortest paths]",PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,The Last Fight Between Human and AI,2250,E,1464188700,[math],PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Fence,500,A,1464798900,[implementation],PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Food Processor,1000,B,1464798900,"[implementation, math]",PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Label,1500,C,1464798900,[implementation],PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Treasure,2250,D,1464798900,"[data structures, graphs]",PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Balloons,2250,E,1464798900,"[binary search, brute force, dp, implementation]",PROGRAMMING
+678,Educational Codeforces Round 13,12,Johny Likes Numbers,,A,1465834200,[implementation],PROGRAMMING
+678,Educational Codeforces Round 13,12,The Same Calendar,,B,1465834200,[implementation],PROGRAMMING
+678,Educational Codeforces Round 13,12,Joty and Chocolate,,C,1465834200,"[implementation, math, number theory]",PROGRAMMING
+678,Educational Codeforces Round 13,12,Iterated Linear Function,,D,1465834200,"[math, number theory]",PROGRAMMING
+678,Educational Codeforces Round 13,12,Another Sith Tournament,,E,1465834200,"[bitmasks, dp]",PROGRAMMING
+678,Educational Codeforces Round 13,12,Lena and Queries,,F,1465834200,"[data structures, divide and conquer, geometry]",PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Prime 100,750,A,1465403700,[constructive algorithms],PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Tower of Cubes,1250,B,1465403700,"[dp, greedy]",PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Square Grid,1500,C,1465403700,"[dfs and similar, dsu, implementation]",PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Chase,2000,D,1465403700,"[brute force, dfs and similar, implementation]",PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Bad Powers of 42,2500,E,1465403700,[data structures],PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Five Cards,500,A,1465403700,"[constructive algorithms, implementation]",PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Finding Criminals,1000,B,1465403700,"[constructive algorithms, implementation]",PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Prime 100,1750,C,1465403700,"[constructive algorithms, number theory]",PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Tower of Cubes,2250,D,1465403700,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Square Grid,2750,E,1465403700,[],PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,A Good Contest,500,A,1465922100,[implementation],PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,Economy Game,1000,B,1465922100,[brute force],PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,Heap Operations,1500,C,1465922100,"[data structures, greedy]",PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,Gifts by the List,2000,D,1465922100,"[dfs and similar, trees]",PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,Runaway to a Shadow,2500,E,1465922100,[geometry],PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and Numbers,500,A,1466181300,"[constructive algorithms, number theory]",PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and Mex,1000,B,1466181300,[sortings],PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and the Tree,1500,C,1466181300,"[dfs and similar, dp, trees]",PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and Strings,2000,D,1466181300,"[dp, strings]",PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and Triangles,3000,E,1466181300,"[geometry, two pointers]",PROGRAMMING
+683,Surprise Language Round #8,12,The Check of the Point,,A,1466092800,[],PROGRAMMING
+683,Surprise Language Round #8,12,The Teacher of Physical Education,,B,1466092800,[],PROGRAMMING
+683,Surprise Language Round #8,12,Symmetric Difference,,C,1466092800,[],PROGRAMMING
+683,Surprise Language Round #8,12,Chocolate Bar,,D,1466092800,[],PROGRAMMING
+683,Surprise Language Round #8,12,Hammer throwing,,E,1466092800,[],PROGRAMMING
+683,Surprise Language Round #8,12,Reformat the String,,F,1466092800,[],PROGRAMMING
+683,Surprise Language Round #8,12,The Fraction,,G,1466092800,[],PROGRAMMING
+683,Surprise Language Round #8,12,Exchange of Books,,H,1466092800,[],PROGRAMMING
+683,Surprise Language Round #8,12,Loader,,I,1466092800,[],PROGRAMMING
+683,Surprise Language Round #8,12,The Hero with Bombs,,J,1466092800,[],PROGRAMMING
+684,Codeforces Marathon Round 1,12,Online Exam,,A2,1465722000,[],PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Robbers' watch,500,A,1466699700,"[brute force, dp, math]",PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Kay and Snowflake,1250,B,1466699700,"[data structures, dfs and similar, trees]",PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Optimal Point,1250,C,1466699700,"[binary search, math]",PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Kay and Eternity,2000,D,1466699700,[brute force],PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Travelling Through the Snow Queen's Kingdom,2500,E,1466699700,"[brute force, graphs]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Free Ice Cream,500,A,1466699700,"[constructive algorithms, implementation]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Little Robber Girl's Zoo,1000,B,1466699700,"[constructive algorithms, implementation, sortings]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Robbers' watch,1500,C,1466699700,"[brute force, math]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Kay and Snowflake,2250,D,1466699700,"[data structures, dfs and similar, trees]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Optimal Point,2250,E,1466699700,[],PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,NP-Hard Problem,500,A,1467219900,"[dfs and similar, graphs]",PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,Remainders Game,1000,B,1467219900,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,The Values You Can Make,1500,C,1467219900,[dp],PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,Dividing Kingdom II,2000,D,1467219900,"[brute force, data structures, dsu, sortings]",PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,TOF,2500,E,1467219900,[],PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,Opponents,500,A,1467219900,[implementation],PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,Lovely Palindromes,1000,B,1467219900,"[constructive algorithms, math]",PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,NP-Hard Problem,1500,C,1467219900,"[dfs and similar, graphs]",PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,Remainders Game,2000,D,1467219900,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,The Values You Can Make,2500,E,1467219900,[dp],PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Mike and Cellphone,500,A,1467822900,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Mike and Shortcuts,1000,B,1467822900,[dfs and similar],PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Mike and Chocolate Thieves,1500,C,1467822900,"[binary search, math]",PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Friends and Subsequences,2000,D,1467822900,"[binary search, data structures]",PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Mike and Geometry Problem,2500,E,1467822900,"[combinatorics, data structures, implementation]",PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (easy),,A1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (medium),,A2,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (hard),,A3,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (easy),,B1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (medium),,B2,1468137600,[geometry],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (hard),,B3,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (easy),,C1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (medium),,C2,1468137600,"[dfs and similar, graphs, trees]",PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (hard),,C3,1468137600,[trees],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (easy),,D1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (medium),,D2,1468137600,[combinatorics],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (hard),,D3,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Photographs (I),,E1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Photographs (II),,E2,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (easy),,F1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (medium),,F2,1468137600,"[constructive algorithms, hashing, trees]",PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (hard),,F3,1468137600,[trees],PROGRAMMING
+691,Educational Codeforces Round 14,12,Fashion in Berland,,A,1468425600,[implementation],PROGRAMMING
+691,Educational Codeforces Round 14,12,s-palindrome,,B,1468425600,[implementation],PROGRAMMING
+691,Educational Codeforces Round 14,12,Exponential notation,,C,1468425600,[implementation],PROGRAMMING
+691,Educational Codeforces Round 14,12,Swaps in Permutation,,D,1468425600,"[dfs and similar, dsu]",PROGRAMMING
+691,Educational Codeforces Round 14,12,Xor-sequences,,E,1468425600,[matrices],PROGRAMMING
+691,Educational Codeforces Round 14,12,Couple Cover,,F,1468425600,"[brute force, dp, number theory]",PROGRAMMING
+695,VK Cup 2016 - Finals,12,LRU,1250,A,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Break Up,1250,B,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Limak and Shooting Points,1250,C,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Cron,1750,D,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Huffman Coding on Segment,2500,E,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Coprime Permutation,2500,F,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Cool Slogans,3000,G,1467534000,[],PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,Lorenzo Von Matterhorn,500,A,1468514100,"[data structures, implementation, trees]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,Puzzles,1000,B,1468514100,"[dfs and similar, math, probabilities, trees]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,PLEASE,1500,C,1468514100,"[combinatorics, dp, implementation, math, matrices]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,Legen...,2000,D,1468514100,"[data structures, dp, matrices, strings]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,...Wait for it...,2500,E,1468514100,"[data structures, dsu, trees]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,...Dary!,3000,F,1468514100,"[binary search, geometry, two pointers]",PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Pineapple Incident,500,A,1468514100,[math],PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Barnicle,1000,B,1468514100,[implementation],PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Lorenzo Von Matterhorn,1500,C,1468514100,"[data structures, implementation, trees]",PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Puzzles,2000,D,1468514100,[],PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,PLEASE,2500,E,1468514100,"[math, number theory]",PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Legen...,3000,F,1468514100,[],PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Vacations,500,A,1468933500,[dp],PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Fix a Tree,1000,B,1468933500,"[constructive algorithms, dfs and similar, dsu, trees]",PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,LRU,1500,C,1468933500,"[bitmasks, dp, probabilities]",PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Limak and Shooting Points,2000,D,1468933500,"[brute force, geometry]",PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Cron,2500,E,1468933500,[],PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Coprime Permutation,3000,F,1468933500,"[combinatorics, number theory]",PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,Launch of Collider,500,A,1468933500,[implementation],PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,One Bomb,1000,B,1468933500,[implementation],PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,Vacations,1500,C,1468933500,"[brute force, dp]",PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,Fix a Tree,2000,D,1468933500,"[constructive algorithms, dfs and similar, dsu]",PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,LRU,2500,E,1468933500,"[bitmasks, dp, probabilities]",PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,Limak and Shooting Points,3000,F,1468933500,[],PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,As Fast As Possible,500,A,1469205300,"[binary search, math]",PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,Connecting Universities,1000,B,1469205300,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,Break Up,1500,C,1469205300,[dfs and similar],PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,Huffman Coding on Segment,2250,D,1469205300,"[data structures, greedy]",PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,Cool Slogans,3000,E,1469205300,"[string suffix structures, strings]",PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,Cards,500,A,1469205300,[greedy],PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,Cells Not Under Attack,750,B,1469205300,[math],PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,They Are Everywhere,1000,C,1469205300,"[binary search, two pointers]",PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,As Fast As Possible,1500,D,1469205300,"[binary search, math]",PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,Connecting Universities,2000,E,1469205300,"[dfs and similar, graphs]",PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,Break Up,2500,F,1469205300,[graphs],PROGRAMMING
+702,Educational Codeforces Round 15,12,Maximum Increase,,A,1469804400,"[dp, greedy, implementation]",PROGRAMMING
+702,Educational Codeforces Round 15,12,Powers of Two,,B,1469804400,"[brute force, data structures, implementation]",PROGRAMMING
+702,Educational Codeforces Round 15,12,Cellular Network,,C,1469804400,"[binary search, two pointers]",PROGRAMMING
+702,Educational Codeforces Round 15,12,Road to Post Office,,D,1469804400,[math],PROGRAMMING
+702,Educational Codeforces Round 15,12,Analysis of Pathes in Functional Graph,,E,1469804400,"[data structures, graphs]",PROGRAMMING
+702,Educational Codeforces Round 15,12,T-Shirts,,F,1469804400,[data structures],PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Mishka and Game,500,A,1470323700,[implementation],PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Mishka and trip,1000,B,1470323700,"[implementation, math]",PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Chris and Road,1750,C,1470323700,"[geometry, implementation]",PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Mishka and Interesting sum,2000,D,1470323700,[data structures],PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Mishka and Divisors,2250,E,1470323700,"[dp, number theory]",PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Thor,500,A,1470578700,"[brute force, data structures, implementation]",PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Ant Man,1250,B,1470578700,"[dp, graphs, greedy]",PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Black Widow,1250,C,1470578700,[dp],PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Captain America,2000,D,1470578700,[flows],PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Iron Man,2500,E,1470578700,[],PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Hulk,500,A,1470578700,[],PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Spider Man,1000,B,1470578700,[games],PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Thor,1500,C,1470578700,"[data structures, implementation]",PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Ant Man,2250,D,1470578700,"[dp, graphs]",PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Black Widow,2250,E,1470578700,[],PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Beru-taxi,500,A,1470933300,"[brute force, geometry]",PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Interesting drink,1000,B,1470933300,"[binary search, implementation]",PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Hard problem,1500,C,1470933300,[dp],PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Vasiliy's Multiset,2000,D,1470933300,"[binary search, data structures, trees]",PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Working routine,2500,E,1470933300,"[data structures, implementation, matrices]",PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Brain's Photos,500,A,1471698300,[implementation],PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Bakery,1000,B,1471698300,[graphs],PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Pythagorean Triples,1500,C,1471698300,"[math, number theory]",PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Persistent Bookcase ,2000,D,1471698300,"[data structures, dfs and similar, implementation]",PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Garlands,2500,E,1471698300,[data structures],PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Letters Cyclic Shift,500,A,1472056500,"[constructive algorithms, implementation]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Recover the String,1000,B,1472056500,"[constructive algorithms, implementation, math]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Centroids,1500,C,1472056500,"[data structures, dfs and similar, dp, greedy, trees]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Incorrect Flow,2000,D,1472056500,[flows],PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Student's Camp,2500,E,1472056500,"[dp, math]",PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Juicer,500,A,1472056500,[implementation],PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Checkpoints,1000,B,1472056500,"[implementation, sortings]",PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Letters Cyclic Shift,1500,C,1472056500,[greedy],PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Recover the String,2000,D,1472056500,"[greedy, math]",PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Centroids,2500,E,1472056500,"[dp, trees]",PROGRAMMING
+710,Educational Codeforces Round 16,12,King Moves,,A,1471875000,[implementation],PROGRAMMING
+710,Educational Codeforces Round 16,12,Optimal Point on a Line,,B,1471875000,"[brute force, sortings]",PROGRAMMING
+710,Educational Codeforces Round 16,12,Magic Odd Square,,C,1471875000,[constructive algorithms],PROGRAMMING
+710,Educational Codeforces Round 16,12,Two Arithmetic Progressions,,D,1471875000,[math],PROGRAMMING
+710,Educational Codeforces Round 16,12,Generate a String,,E,1471875000,"[dfs and similar, dp]",PROGRAMMING
+710,Educational Codeforces Round 16,12,String Set Queries,,F,1471875000,"[brute force, data structures, hashing, string suffix structures, strings]",PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Bus to Udayland,500,A,1472472300,"[brute force, implementation]",PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Chris and Magic Square,1000,B,1472472300,[constructive algorithms],PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Coloring Trees,1500,C,1472472300,[dp],PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Directed Roads,2000,D,1472472300,"[combinatorics, dfs and similar, graphs]",PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,ZS and The Birthday Paradox,2500,E,1472472300,"[math, number theory, probabilities]",PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and Crow,500,A,1473525900,[implementation],PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and Trident,1000,B,1473525900,[implementation],PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and De-Evolution,1500,C,1473525900,"[greedy, math]",PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and Scores,2250,D,1473525900,"[combinatorics, dp]",PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and Casinos,2500,E,1473525900,"[data structures, math, probabilities]",PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Sonya and Queries,500,A,1473784500,[data structures],PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Searching Rectangles,1000,B,1473784500,"[binary search, constructive algorithms]",PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Sonya and Problem Wihtout a Legend,2000,C,1473784500,"[dp, sortings]",PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Animals and Puzzle,2000,D,1473784500,"[binary search, data structures]",PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Sonya Partymaker,2000,E,1473784500,[],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Meeting of Old Friends,500,A,1473784500,[math],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Filya and Homework,1000,B,1473784500,[implementation],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Sonya and Queries,1000,C,1473784500,[data structures],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Searching Rectangles,2000,D,1473784500,[binary search],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Sonya and Problem Wihtout a Legend,3000,E,1473784500,"[dp, flows, sortings]",PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Plus and Square Root,500,A,1474119900,"[constructive algorithms, math]",PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Complete The Graph,1000,B,1474119900,"[binary search, constructive algorithms, graphs, shortest paths]",PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Digit Tree,1500,C,1474119900,"[divide and conquer, dsu]",PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Create a Maze,2500,D,1474119900,[constructive algorithms],PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Complete the Permutations,2750,E,1474119900,[],PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Crazy Computer,500,A,1474119900,[implementation],PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Complete the Word,1000,B,1474119900,[two pointers],PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Plus and Square Root,1500,C,1474119900,"[constructive algorithms, math, number theory]",PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Complete The Graph,2000,D,1474119900,"[graphs, shortest paths]",PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Digit Tree,2500,E,1474119900,[divide and conquer],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Festival Organization,,A,1473584400,"[math, number theory]",PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,R3D3’s Summer Adventure,,B,1473584400,[greedy],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Potions Homework,,C,1473584400,"[implementation, sortings]",PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Dexterina’s Lab,,D,1473584400,"[games, matrices, probabilities]",PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,"Paint it really, really dark gray",,E,1473584400,[dfs and similar],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Heroes of Making Magic III,,F,1473584400,[data structures],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Underfail,,G,1473584400,[flows],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Pokermon League challenge,,H,1473584400,[probabilities],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Cowboy Beblop at his computer,,I,1473584400,[],PROGRAMMING
+718,Codeforces Round #373 (Div. 1),1,Efim and Strange Grade,500,A,1474635900,[implementation],PROGRAMMING
+718,Codeforces Round #373 (Div. 1),1,Sasha and Array,1250,C,1474635900,"[data structures, math, matrices]",PROGRAMMING
+718,Codeforces Round #373 (Div. 1),1,Andrew and Chemistry,2000,D,1474635900,"[hashing, trees]",PROGRAMMING
+718,Codeforces Round #373 (Div. 1),1,Matvey's Birthday,2500,E,1474635900,[graphs],PROGRAMMING
+719,Codeforces Round #373 (Div. 2),2,Vitya in the Countryside,500,A,1474635900,[implementation],PROGRAMMING
+719,Codeforces Round #373 (Div. 2),2,Anatoly and Cockroaches,1000,B,1474635900,[greedy],PROGRAMMING
+719,Codeforces Round #373 (Div. 2),2,Efim and Strange Grade,1500,C,1474635900,[implementation],PROGRAMMING
+719,Codeforces Round #373 (Div. 2),2,Sasha and Array,2250,E,1474635900,"[data structures, math, matrices]",PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Closing ceremony,,A,1474196700,[greedy],PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Cactusophobia,,B,1474196700,"[dfs and similar, flows]",PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Homework,,C,1474196700,[],PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Slalom,,D,1474196700,"[data structures, dp]",PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Cipher,,E,1474196700,[],PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Array Covering,,F,1474196700,[],PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,One-dimensional Japanese Crossword,500,A,1475244300,[implementation],PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,Passwords,1000,B,1475244300,"[sortings, strings]",PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,Journey,1500,C,1475244300,"[dp, graphs]",PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,Maxim and Array,2000,D,1475244300,"[constructive algorithms, data structures, greedy]",PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,Road to Home,2750,E,1475244300,"[binary search, dp]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Broken Clock,500,A,1475330700,"[brute force, implementation]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Verse Pattern,500,B,1475330700,"[implementation, strings]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Destroying Array,1000,C,1475330700,"[data structures, dsu]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Generating Sets,1500,D,1475330700,"[binary search, data structures, dfs and similar, greedy]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Research Rover,2000,E,1475330700,"[combinatorics, dp]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Cyclic Cipher,2500,F,1475330700,"[chinese remainder theorem, implementation, number theory, two pointers]",PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,The New Year: Meeting Friends,500,A,1475494500,[sortings],PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,Text Document Analysis,1000,B,1475494500,"[expression parsing, implementation]",PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,Polycarp at the Radio,1500,C,1475494500,[greedy],PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,Lakes in Berland,2000,D,1475494500,"[dfs and similar, dsu, greedy]",PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,One-Way Reform,2500,E,1475494500,"[constructive algorithms, dfs and similar, flows, graphs, greedy]",PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,st-Spanning Tree,3000,F,1475494500,"[dsu, graphs, greedy, implementation]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Checking the Calendar,500,A,1475928900,[implementation],PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Batch Sort,1000,B,1475928900,"[brute force, greedy, implementation]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Ray Tracing,1500,C,1475928900,"[greedy, hashing, implementation, math, number theory]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Dense Subsequence,1500,D,1475928900,"[data structures, greedy]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Goods transportation,2500,E,1475928900,"[dp, flows]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Uniformly Branched Trees,2500,F,1475928900,[combinatorics],PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Xor-matic Number of the Graph,2500,G,1475928900,"[bitmasks, graphs, math, trees]",PROGRAMMING
+725,Canada Cup 2016,12,Jumping Ball,500,A,1477148700,[implementation],PROGRAMMING
+725,Canada Cup 2016,12,Food on the Plane,1000,B,1477148700,[math],PROGRAMMING
+725,Canada Cup 2016,12,Hidden Word,1500,C,1477148700,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+725,Canada Cup 2016,12,Contest Balloons,2250,D,1477148700,"[data structures, greedy]",PROGRAMMING
+725,Canada Cup 2016,12,Too Much Money,2500,E,1477148700,[brute force],PROGRAMMING
+725,Canada Cup 2016,12,Family Photos,3250,F,1477148700,[greedy],PROGRAMMING
+725,Canada Cup 2016,12,Messages on a Tree,3500,G,1477148700,[],PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Transformation: from A to B,1000,A,1476522300,"[brute force, dfs and similar]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Bill Total Value,1000,B,1476522300,"[expression parsing, implementation]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Guess the Array,1500,C,1476522300,"[constructive algorithms, math]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,T-shirts Distribution,1500,D,1476522300,"[constructive algorithms, flows, greedy]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Games on a CD,2500,E,1476522300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Polycarp's problems,3000,F,1476522300,"[binary search, dp, greedy]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Interview with Oleg,500,A,1479632700,"[implementation, strings]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Spotlights,1000,B,1479632700,"[dp, implementation]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Road to Cinema,1750,C,1479632700,"[binary search, greedy, sortings]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Sea Battle,1750,D,1479632700,"[constructive algorithms, greedy]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Subordinates,2000,E,1479632700,"[constructive algorithms, data structures, greedy, sortings]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Financiers Game,2500,F,1479632700,[dp],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Toda 2,,A,1477209600,[greedy],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Minimum and Maximum,,B,1477209600,[constructive algorithms],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Bulmart,,C,1477209600,"[binary search, dfs and similar]",PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Running Over The Bridges,,D,1477209600,"[greedy, implementation]",PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Award Ceremony,,E,1477209600,[greedy],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Ber Patio,,F,1477209600,[],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Car Repair Shop,,G,1477209600,[implementation],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Delete Them,,H,1477209600,[implementation],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Olympiad in Programming and Sports,,I,1477209600,"[dp, flows, greedy]",PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Bottles,,J,1477209600,[dp],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Roads Orientation Problem,,K,1477209600,[],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Expression Queries,,L,1477209600,[],PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Night at the Museum,500,A,1476611100,"[implementation, strings]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Coupons and Discounts,1000,B,1476611100,"[constructive algorithms, greedy]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Socks,1500,C,1476611100,"[dsu, graphs, greedy]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,80-th Level Archeology,2000,D,1476611100,"[brute force, data structures, greedy, sortings]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Funny Game,2500,E,1476611100,"[dp, games]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Video Cards,3000,F,1476611100,"[brute force, data structures, implementation, number theory]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Buy a Shovel,500,A,1476714900,"[brute force, constructive algorithms, math]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Cormen --- The Best Friend Of a Man,1000,B,1476714900,"[dp, greedy]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Sanatorium,1500,C,1476714900,"[constructive algorithms, greedy]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Exams,2000,D,1476714900,"[binary search, greedy, sortings]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Sockets,2000,E,1476714900,"[greedy, sortings]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Tourist Reform,2500,F,1476714900,[dfs and similar],PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Grasshopper And the String,500,A,1477922700,[implementation],PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Parade,1000,B,1477922700,[math],PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Epidemic in Monstropolis,2000,C,1477922700,"[constructive algorithms, dp, greedy, two pointers]",PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Kostya the Sculptor,2000,D,1477922700,"[data structures, hashing]",PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Sleep in Class,2750,E,1477922700,"[data structures, math, two pointers]",PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Drivers Dissatisfaction,3000,F,1477922700,"[data structures, dsu, graphs, trees]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Danik,500,A,1479227700,"[implementation, strings]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Digits,750,B,1479227700,"[implementation, math]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Making Potions,1250,C,1479227700,"[binary search, dp, greedy, two pointers]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Chess,1500,D,1479227700,[implementation],PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Tree,2000,E,1479227700,"[dfs and similar, dp, trees]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and School,2750,F,1479227700,"[bitmasks, constructive algorithms, implementation, math]",PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Ostap and Grasshopper,500,A,1480264500,"[implementation, strings]",PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Urbanization,1000,B,1480264500,"[greedy, sortings]",PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Tennis Championship,1750,C,1480264500,"[greedy, math]",PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Taxes,1750,D,1480264500,"[math, number theory]",PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Ostap and Tree,2500,E,1480264500,"[dp, trees]",PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Tennis Championship,750,A,1480264500,"[dfs and similar, dp, math]",PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Taxes,750,B,1480264500,"[math, number theory]",PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Ostap and Tree,1500,C,1480264500,[dp],PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Permutations,2000,D,1480264500,[matrices],PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Chess Championship,2500,E,1480264500,"[constructive algorithms, flows, greedy]",PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Road to Cinema,750,A,1479632700,[binary search],PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Sea Battle,750,B,1479632700,"[greedy, implementation]",PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Subordinates,1000,C,1479632700,[greedy],PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Financiers Game,1500,D,1479632700,"[dp, games]",PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Tanya is 5!,2000,E,1479632700,"[graph matchings, graphs, greedy, schedules]",PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Dirty plates,2500,F,1479632700,"[constructive algorithms, math]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Interview with Oleg,500,A,1479632700,"[implementation, strings]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Spotlights,1000,B,1479632700,"[brute force, dp, implementation]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Road to Cinema,1750,C,1479632700,[binary search],PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Sea Battle,1750,D,1479632700,"[binary search, constructive algorithms, greedy]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Subordinates,2000,E,1479632700,"[constructive algorithms, greedy]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Financiers Game,2500,F,1479632700,"[dp, games]",PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Alyona and mex,500,A,1479918900,"[constructive algorithms, greedy]",PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Alyona and a tree,1000,B,1479918900,"[binary search, data structures, dfs and similar, graphs, trees]",PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Alyona and towers,1500,C,1479918900,[data structures],PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Recover a functional graph,2000,D,1479918900,[graph matchings],PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Gosha is hunting,2500,E,1479918900,"[brute force, dp, flows, sortings]",PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and copybooks,500,A,1479918900,"[brute force, implementation]",PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and flowers,1000,B,1479918900,[constructive algorithms],PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and mex,1500,C,1479918900,[constructive algorithms],PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and a tree,2000,D,1479918900,"[binary search, data structures, dfs and similar, graph matchings, graphs]",PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and towers,2500,E,1479918900,[],PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa's loud Owf and Mehrdad's evil plan,500,A,1481034900,"[dfs and similar, math]",PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa's weak amphitheater and Mehrdad's valuable Hoses,1000,B,1481034900,"[dfs and similar, dp, dsu]",PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa’s overnight party and Mehrdad’s silent entering,1250,C,1481034900,"[constructive algorithms, dfs and similar]",PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths,2000,D,1481034900,"[data structures, trees]",PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa’s abnormal DNA and Mehrdad’s deep interest,2500,E,1481034900,"[data structures, string suffix structures]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa’s hard exam and Mehrdad’s naive cheat,500,A,1481034900,"[implementation, math, number theory]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa’s obvious problem and Mehrdad’s terrible solution,1000,B,1481034900,"[math, number theory]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa's loud Owf and Mehrdad's evil plan,1500,C,1481034900,"[dfs and similar, math]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa's weak amphitheater and Mehrdad's valuable Hoses,2000,D,1481034900,"[dfs and similar, dp, dsu]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa’s overnight party and Mehrdad’s silent entering,2250,E,1481034900,[],PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Vladik and flights,500,A,1481726100,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Chloe and the sequence ,1000,B,1481726100,"[binary search, bitmasks, constructive algorithms, implementation]",PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Vladik and fractions,1250,C,1481726100,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Chloe and pleasant prizes,2000,D,1481726100,"[dfs and similar, dp, trees]",PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Vladik and cards,2500,E,1481726100,"[binary search, bitmasks, brute force, dp]",PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow Builds A Nation,500,A,1481992500,"[dfs and similar, graphs]",PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow's Game,1250,B,1481992500,"[bitmasks, divide and conquer]",PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow Buys a Deck of Cards,1750,C,1481992500,"[bitmasks, brute force, dp]",PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow Draws a Circle,2250,D,1481992500,[geometry],PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow Masters the Cyclic Shift,2500,E,1481992500,[strings],PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow Learns the Cyclic Shift,500,A,1481992500,"[implementation, strings]",PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow Solves A Puzzle,1000,B,1481992500,[implementation],PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow Builds A Nation,1500,C,1481992500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow's Game,2250,D,1481992500,[bitmasks],PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow Buys a Deck of Cards,2750,E,1481992500,[],PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Compote,500,A,1482057300,[math],PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Decoding,1000,B,1482057300,"[implementation, strings]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Tram,1500,C,1482057300,"[constructive algorithms, implementation, math]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Green and Black Tea,2000,D,1482057300,"[constructive algorithms, greedy]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Numbers Exchange,2500,E,1482057300,"[greedy, implementation]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Music in Car,3000,F,1482057300,"[data structures, greedy, two pointers]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,New Roads,3000,G,1482057300,"[constructive algorithms, trees]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Display Size,500,A,1482113100,"[brute force, math]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Mammoth's Genome Decoding,1000,B,1482113100,"[implementation, strings]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Servers,1500,C,1482113100,[implementation],PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Winter Is Coming,2000,D,1482113100,"[greedy, sortings]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Comments,2000,E,1482113100,"[dfs and similar, expression parsing]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Igor and Interesting Numbers,2500,F,1482113100,"[brute force, combinatorics, dp]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and a Place in a Class,500,A,1482656700,"[implementation, math]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Keyboard Check,1000,B,1482656700,"[implementation, strings]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Robot,1500,C,1482656700,"[constructive algorithms, math]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and a Palindrome,2000,D,1482656700,"[constructive algorithms, data structures, greedy]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Tangerines,2500,E,1482656700,"[binary search, greedy, two pointers]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Clauses and a Soccer Championship,2500,F,1482656700,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Bachgold Problem,500,A,1482165300,"[greedy, implementation, math, number theory]",PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Parallelogram is Back,1000,B,1482165300,"[brute force, constructive algorithms, geometry]",PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Voting,1500,C,1482165300,"[greedy, implementation, two pointers]",PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Leaving Auction,2000,D,1482165300,"[binary search, data structures]",PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Inversions After Shuffle,2500,E,1482165300,"[data structures, probabilities]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Hurry,500,A,1483107300,"[binary search, brute force, implementation, math]",PROGRAMMING
+750,Good Bye 2016,12,New Year and North Pole,750,B,1483107300,[implementation],PROGRAMMING
+750,Good Bye 2016,12,New Year and Rating,1000,C,1483107300,"[binary search, greedy, math]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Fireworks,1500,D,1483107300,"[brute force, data structures, dfs and similar, dp, implementation]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Old Subsequence,2250,E,1483107300,"[data structures, divide and conquer, dp]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Finding Roots,3000,F,1483107300,"[constructive algorithms, implementation, trees]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Binary Tree Paths,3250,G,1483107300,"[bitmasks, brute force, combinatorics, dp]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Snowy Grid,3500,H,1483107300,"[dfs and similar, dsu, graphs]",PROGRAMMING
+751,Технокубок 2017 - Ознакомительный Раунд 3,12,Оценки Васи,500,A,1482395400,[],PROGRAMMING
+751,Технокубок 2017 - Ознакомительный Раунд 3,12,Путь Поликарпа,1000,B,1482395400,[],PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and a Place in a Class,500,A,1482656700,"[constructive algorithms, math]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Keyboard Check,1000,B,1482656700,"[greedy, implementation, strings]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Robot,1500,C,1482656700,"[greedy, shortest paths]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and a Palindrome,2000,D,1482656700,"[data structures, greedy, hashing, strings]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Tangerines,2500,E,1482656700,"[binary search, dp, two pointers]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Clauses and a Soccer Championship,2500,F,1482656700,[trees],PROGRAMMING
+753,Testing Round #13,12,Santa Claus and Candies,500,A,1483002300,"[dp, greedy, math]",PROGRAMMING
+753,Testing Round #13,12,Interactive Bulls and Cows (Easy),1000,B,1483002300,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+753,Testing Round #13,12,Interactive Bulls and Cows (Hard),1500,C,1483002300,"[brute force, constructive algorithms]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Lesha and array splitting,500,A,1483713300,"[constructive algorithms, greedy]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Ilya and tic-tac-toe game,1000,B,1483713300,"[brute force, implementation]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Vladik and chat,1500,C,1483713300,"[brute force, constructive algorithms, dp, implementation, strings]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Fedor and coupons,2000,D,1483713300,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Dasha and cyclic table,2500,E,1483713300,"[bitmasks, brute force, fft]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Hypothesis,500,A,1484499900,"[brute force, graphs, math]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Game,1000,B,1484499900,"[binary search, data structures, games, greedy, sortings]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Forest,1500,C,1484499900,"[dfs and similar, dsu, graphs]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Polygon,2250,D,1484499900,[data structures],PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and White-Red graph,2500,E,1484499900,"[constructive algorithms, graphs, shortest paths]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Gifts,2750,F,1484499900,"[bitmasks, dp, greedy]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Many Other Balls,3500,G,1484499900,"[combinatorics, divide and conquer, dp, fft, math, number theory]",PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Pavel and barbecue,500,A,1485108900,[dfs and similar],PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Travel Card,1000,B,1485108900,"[binary search, dp]",PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Nikita and stack,1500,C,1485108900,[data structures],PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Bacterial Melee,2000,D,1485108900,"[brute force, combinatorics, dp, string suffix structures]",PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Byteland coins,2500,E,1485108900,"[combinatorics, dp, math]",PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Long number,3000,F,1485108900,"[expression parsing, math, number theory]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Gotta Catch Em' All!,500,A,1484235300,[implementation],PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Bash's Big Day,1000,B,1484235300,"[greedy, math, number theory]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Felicity is Coming!,1500,C,1484235300,"[data structures, hashing, sortings, strings]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Felicity's Big Secret Revealed,2000,D,1484235300,"[bitmasks, dp]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Bash Plays with Functions,2500,E,1484235300,"[brute force, combinatorics, dp, number theory]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Team Rocket Rises Again,2750,F,1484235300,"[data structures, graphs, shortest paths]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Can Bash Save the Day?,3500,G,1484235300,"[data structures, divide and conquer, graphs, trees]",PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Holiday Of Equality,500,A,1484838300,"[implementation, math]",PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Blown Garland,1000,B,1484838300,[implementation],PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Unfair Poll,1500,C,1484838300,"[binary search, implementation, math]",PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Ability To Convert,1750,D,1484838300,"[dp, greedy, strings]",PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Broken Tree,2500,E,1484838300,"[dfs and similar, greedy, trees]",PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Geometrical Progression,3000,F,1484838300,"[brute force, math, number theory]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Pavel and barbecue,500,A,1485108900,"[dfs and similar, dsu]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Travel Card,1000,B,1485108900,"[binary search, dp, greedy, two pointers]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Nikita and stack,1500,C,1485108900,"[binary search, data structures]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Bacterial Melee,2000,D,1485108900,[dp],PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Byteland coins,2500,E,1485108900,"[dp, math]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Long number,3000,F,1485108900,[],PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Petr and a calendar,500,A,1485108900,"[implementation, math]",PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Frodo and pillows,1000,B,1485108900,"[binary search, greedy]",PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Pavel and barbecue,1500,C,1485108900,"[dfs and similar, graphs]",PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Travel Card,2000,D,1485108900,"[binary search, dp, two pointers]",PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Nikita and stack,2500,E,1485108900,[],PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Bacterial Melee,3000,F,1485108900,[],PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Stairs,500,A,1485873300,"[brute force, constructive algorithms, math]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and friends,1000,B,1485873300,"[brute force, implementation, math]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Password,1500,C,1485873300,"[brute force, dp, implementation]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Very Difficult Problem,2000,D,1485873300,"[binary search, brute force, constructive algorithms, greedy, sortings]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Puzzle,2500,E,1485873300,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Photos,3000,F,1485873300,"[brute force, data structures]",PROGRAMMING
+762,Educational Codeforces Round 17,12,k-th divisor,,A,1485354900,"[math, number theory]",PROGRAMMING
+762,Educational Codeforces Round 17,12,USB vs. PS/2,,B,1485354900,"[greedy, sortings, two pointers]",PROGRAMMING
+762,Educational Codeforces Round 17,12,Two strings,,C,1485354900,"[binary search, hashing, two pointers]",PROGRAMMING
+762,Educational Codeforces Round 17,12,Maximum path,,D,1485354900,"[dp, implementation]",PROGRAMMING
+762,Educational Codeforces Round 17,12,Radio stations,,E,1485354900,"[binary search, data structures]",PROGRAMMING
+762,Educational Codeforces Round 17,12,Tree nesting,,F,1485354900,"[combinatorics, graphs, trees]",PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and a tree,500,A,1486042500,"[dfs and similar, dp, dsu, trees]",PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and rectangles,750,B,1486042500,[constructive algorithms],PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and remoduling,1500,C,1486042500,"[brute force, number theory]",PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and a flat tree,2000,D,1486042500,"[data structures, hashing, trees]",PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and our friends animals,2500,E,1486042500,[dsu],PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Taymyr is calling you,500,A,1486042500,"[brute force, implementation, math]",PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Timofey and cubes,1000,B,1486042500,"[constructive algorithms, implementation]",PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Timofey and a tree,1500,C,1486042500,[dfs and similar],PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Timofey and rectangles,1750,D,1486042500,[],PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Timofey and remoduling,2500,E,1486042500,[],PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Neverending competitions,500,A,1487059500,[implementation],PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Code obfuscation,1000,B,1487059500,"[implementation, strings]",PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Table Tennis Game 2,1250,C,1487059500,[math],PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Artsem and Saunders,2000,D,1487059500,"[constructive algorithms, dsu, math]",PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Tree Folding,2500,E,1487059500,"[dfs and similar, dp, implementation, trees]",PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Souvenirs,3250,F,1487059500,[data structures],PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,"Math, math everywhere",3500,G,1487059500,[],PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and Longest Uncommon Subsequence,500,A,1486487100,"[constructive algorithms, strings]",PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Triangle,1000,B,1486487100,"[constructive algorithms, geometry, greedy, sortings]",PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Message,1500,C,1486487100,"[brute force, dp, strings]",PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Dictionary,2000,D,1486487100,"[data structures, dfs and similar, dsu, graphs]",PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and a xor trip,2500,E,1486487100,"[bitmasks, constructive algorithms, data structures, dfs and similar, dp, trees]",PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,Snacktower,500,A,1487408700,"[data structures, implementation]",PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,The Queue,1250,B,1487408700,"[brute force, greedy]",PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,Garland,1500,C,1487408700,"[dfs and similar, graphs, greedy, trees]",PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,Cartons of milk,2000,D,1487408700,"[binary search, data structures, greedy, sortings, two pointers]",PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,Change-free,2500,E,1487408700,[greedy],PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Oath of the Night's Watch,500,A,1487606700,"[constructive algorithms, sortings]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Code For 1,1000,B,1487606700,"[constructive algorithms, dfs and similar, divide and conquer]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Jon Snow and his Favourite Number,1250,C,1487606700,"[brute force, dp, implementation, sortings]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Jon and Orbs,1750,D,1487606700,"[dp, math, probabilities]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Game of Stones,2000,E,1487606700,"[dp, games]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Barrels and boxes,2250,F,1487606700,"[brute force, combinatorics, number theory, probabilities]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,The Winds of Winter,2750,G,1487606700,[data structures],PROGRAMMING
+769,VK Cup 2017 - Qualification 1,12,Year of University Entrance,500,A,1488628800,[sortings],PROGRAMMING
+769,VK Cup 2017 - Qualification 1,12,News About Credit,1000,B,1488628800,"[greedy, two pointers]",PROGRAMMING
+769,VK Cup 2017 - Qualification 1,12,Cycle In Maze,1500,C,1488628800,"[dfs and similar, greedy, shortest paths]",PROGRAMMING
+769,VK Cup 2017 - Qualification 1,12,k-Interesting Pairs Of Integers,2000,D,1488628800,"[bitmasks, brute force]",PROGRAMMING
+770,VK Cup 2017 - Qualification 2,12,New Password,500,A,1489233600,[implementation],PROGRAMMING
+770,VK Cup 2017 - Qualification 2,12,Maximize Sum of Digits,1000,B,1489233600,[implementation],PROGRAMMING
+770,VK Cup 2017 - Qualification 2,12,Online Courses In BSU,1500,C,1489233600,"[dfs and similar, graphs]",PROGRAMMING
+770,VK Cup 2017 - Qualification 2,12,Draw Brackets!,1500,D,1489233600,[implementation],PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Friendship Condition,250,A,1489851300,"[dfs and similar, dsu, graphs]",PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Different Names,500,B,1489851300,"[constructive algorithms, greedy]",PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Tree Jumps,1000,C,1489851300,"[dfs and similar, dp, trees]",PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Company,1500,D,1489851300,[dp],PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Rectangle Strips,2250,E,1489851300,"[dp, greedy]",PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Isomorphic Points,2500,F,1489851300,"[geometry, two pointers]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Voltage Keepsake,500,A,1492356900,"[binary search, math]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Volatile Kite,1000,B,1492356900,[geometry],PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Vulnerable Kerbals,1750,C,1492356900,"[dp, graphs, number theory]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Varying Kibibits,2250,D,1492356900,"[bitmasks, dp]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Verifying Kingdom,2250,E,1492356900,"[binary search, trees]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Success Rate,500,A,1494171900,"[binary search, math]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Dynamic Problem Scoring,1000,B,1494171900,"[brute force, greedy]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Prairie Partition,1750,C,1494171900,"[binary search, constructive algorithms, greedy, math]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Perishable Roads,2500,D,1494171900,"[dp, graphs, shortest paths]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Blog Post Rating,2750,E,1494171900,"[data structures, sortings]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Test Data Generation,3500,F,1494171900,"[combinatorics, divide and conquer, dp, fft, math, number theory]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Amusement Park,,A,1491406500,"[*special, ternary search]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Significant Cups,,B,1491406500,"[*special, binary search, data structures, two pointers]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Lie or Truth,,D,1491406500,"[*special, constructive algorithms, sortings]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Big Number and Remainder,,E,1491406500,"[*special, math, number theory]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Pens And Days Of Week,,F,1491406500,"[*special, binary search, number theory]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING
+775,VK Cup 2017 - Wild Card Round 2,12,University Schedule,,A,1493220900,[*special],PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,A Serial Killer,500,A,1487861100,[implementation],PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock and his girlfriend,1000,B,1487861100,[number theory],PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Molly's Chemicals,1500,C,1487861100,"[binary search, data structures, math]",PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,The Door Problem,2000,D,1487861100,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,The Holmes Children,2250,E,1487861100,"[math, number theory]",PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock's bet to Moriarty,3000,F,1487861100,"[constructive algorithms, geometry, graphs, trees]",PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock and the Encrypted Data,3250,G,1487861100,"[bitmasks, combinatorics, dp]",PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Shell Game,500,A,1487930700,"[constructive algorithms, implementation]",PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Game of Credit Cards,1000,B,1487930700,"[data structures, dp, greedy, sortings]",PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Alyona and Spreadsheet,1500,C,1487930700,"[binary search, dp, implementation, two pointers]",PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Cloud of Hashtags,2000,D,1487930700,"[binary search, greedy, implementation, strings]",PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Hanoi Factory,2500,E,1487930700,"[brute force, data structures, dp, greedy, sortings]",PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,String Game,500,A,1488096300,"[binary search, greedy, strings]",PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,Bitwise Formula,1000,B,1488096300,"[bitmasks, brute force, dfs and similar, expression parsing, implementation]",PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,Peterson Polyglot,1500,C,1488096300,"[brute force, dfs and similar, dsu, hashing, trees]",PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,Parquet Re-laying,2250,D,1488096300,[constructive algorithms],PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,Selling Numbers,2250,E,1488096300,"[dp, sortings]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Pupils Redistribution,500,A,1488096300,"[constructive algorithms, math]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Weird Rounding,1000,B,1488096300,"[brute force, greedy]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Dishonest Sellers,1000,C,1488096300,"[greedy, sortings]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,String Game,1500,D,1488096300,"[binary search, strings]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Bitwise Formula,2000,E,1488096300,"[data structures, expression parsing, greedy]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Peterson Polyglot,2500,F,1488096300,[],PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Socks,500,A,1488705300,[implementation],PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,The Meeting Place Cannot Be Changed,1000,B,1488705300,[binary search],PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Colored Balloons,1250,C,1488705300,[dfs and similar],PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Innokenty and a Football League,1500,D,1488705300,"[2-sat, graphs, greedy, implementation]",PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Underground Lab,1750,E,1488705300,"[dfs and similar, graphs]",PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Axel and Marston in Bitland,2500,F,1488705300,"[bitmasks, graphs, matrices]",PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Nervous Barriers,3000,G,1488705300,"[data structures, dp]",PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Intranet of Buses,3500,H,1488705300,"[binary search, geometry, implementation, two pointers]",PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Andryusha and Colored Balloons,500,A,1488719100,"[brute force, constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Innokenty and a Football League,1000,B,1488719100,"[2-sat, brute force, graph matchings, greedy, implementation]",PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Underground Lab,1250,C,1488719100,"[brute force, constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Axel and Marston in Bitland,1750,D,1488719100,"[bitmasks, brute force, dp, matrices]",PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Andryusha and Nervous Barriers,2250,E,1488719100,[data structures],PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Intranet of Buses,2750,F,1488719100,"[binary search, geometry, two pointers]",PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Andryusha and Socks,500,A,1488719100,[implementation],PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,The Meeting Place Cannot Be Changed,1000,B,1488719100,"[binary search, ternary search]",PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Andryusha and Colored Balloons,1250,C,1488719100,[dfs and similar],PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Innokenty and a Football League,1500,D,1488719100,[greedy],PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Underground Lab,1750,E,1488719100,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Axel and Marston in Bitland,2500,F,1488719100,[matrices],PROGRAMMING
+784,April Fools Contest 2017,12,Numbers Joke,,A,1490972400,[*special],PROGRAMMING
+784,April Fools Contest 2017,12,Kids' Riddle,,B,1490972400,[*special],PROGRAMMING
+784,April Fools Contest 2017,12,INTERCALC,,C,1490972400,"[*special, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,Touchy-Feely Palindromes,,D,1490972400,"[*special, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,Twisted Circuit,,E,1490972400,"[*special, brute force, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,Crunching Numbers Just for You,,F,1490972400,"[*special, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,BF Calculator,,G,1490972400,[*special],PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and Polyhedrons,500,A,1489590300,[implementation],PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and Classes,1000,B,1489590300,"[greedy, sortings]",PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and Fairy Tale,1500,C,1489590300,"[binary search, math]",PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and School - 2,2250,D,1489590300,"[combinatorics, math, number theory]",PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and Permutation,2500,E,1489590300,"[brute force, data structures]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,Berzerk,750,A,1490281500,"[dfs and similar, dp, games]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,Legacy,1000,B,1490281500,"[data structures, graphs, shortest paths]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,Till I Collapse,1500,C,1490281500,"[data structures, divide and conquer]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,Rap God,2000,D,1490281500,"[data structures, dfs and similar, hashing, strings, trees]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,ALT,2500,E,1490281500,"[data structures, flows, graphs, trees]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,The Monster,500,A,1490281500,"[brute force, math]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,Not Afraid,1000,B,1490281500,"[greedy, implementation]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,Berzerk,1750,C,1490281500,"[dp, games]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,Legacy,2000,D,1490281500,"[data structures, shortest paths]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,Till I Collapse,2500,E,1490281500,[],PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,Functions again,500,A,1490803500,[dp],PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,Weird journey,1250,B,1490803500,"[combinatorics, dfs and similar, graphs]",PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,The Great Mixing,1500,C,1490803500,"[dfs and similar, dp, math]",PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,Finding lines,2000,D,1490803500,"[constructive algorithms, divide and conquer]",PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,New task,2250,E,1490803500,[],PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,Anastasia and pebbles,500,A,1490803500,"[greedy, implementation, math]",PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,Masha and geometric depression,1000,B,1490803500,"[brute force, implementation, math]",PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,Functions again,1500,C,1490803500,"[data structures, dp, greedy]",PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,Weird journey,2250,D,1490803500,[graphs],PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,The Great Mixing,2500,E,1490803500,"[brute force, dfs and similar, dp, math]",PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Different Names,500,A,1489851300,"[constructive algorithms, greedy]",PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Tree Jumps,1000,B,1489851300,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Company,1500,C,1489851300,[dp],PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Rectangle Strips,2250,D,1489851300,[dp],PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Isomorphic Points,2500,E,1489851300,[],PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Big Brother,500,A,1489851300,[implementation],PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Friendship Condition,1000,B,1489851300,"[dfs and similar, dsu, graphs]",PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Different Names,1500,C,1489851300,"[constructive algorithms, greedy]",PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Tree Jumps,2000,D,1489851300,"[dfs and similar, dp, trees]",PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Company,2500,E,1489851300,[],PROGRAMMING
+792,Educational Codeforces Round 18,12,New Bus Route,,A,1490625300,"[implementation, sortings]",PROGRAMMING
+792,Educational Codeforces Round 18,12,Counting-out Rhyme,,B,1490625300,[implementation],PROGRAMMING
+792,Educational Codeforces Round 18,12,Divide by Three,,C,1490625300,"[dp, greedy, math, number theory]",PROGRAMMING
+792,Educational Codeforces Round 18,12,Paths in a Complete Binary Tree,,D,1490625300,"[bitmasks, trees]",PROGRAMMING
+792,Educational Codeforces Round 18,12,Colored Balls,,E,1490625300,"[greedy, math]",PROGRAMMING
+792,Educational Codeforces Round 18,12,Mages and Monsters,,F,1490625300,"[data structures, geometry]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Oleg and shares,500,A,1492965900,"[implementation, math]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Igor and his way to work,1000,B,1492965900,"[dfs and similar, shortest paths]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Mice problem,1500,C,1492965900,"[geometry, implementation, sortings]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Presents in Bankopolis,2000,D,1492965900,"[dp, graphs, shortest paths]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Problem of offices,2500,E,1492965900,"[constructive algorithms, dfs and similar, dp, trees]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Julia the snail,3000,F,1492965900,"[data structures, divide and conquer]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Oleg and chess,3500,G,1492965900,"[flows, graph matchings]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Bank Robbery,500,A,1494668100,[implementation],PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Cutting Carrot,1000,B,1494668100,"[geometry, math]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Naming Company,1750,C,1494668100,"[games, greedy, sortings]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Labelling Cities,2000,D,1494668100,"[dfs and similar, graphs, hashing]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Choosing Carrot,2500,E,1494668100,[games],PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Leha and security system,2750,F,1494668100,[data structures],PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Replace All,3500,G,1494668100,"[combinatorics, dp, math]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Amusement Park,,A,1491406500,"[*special, brute force, ternary search]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Significant Cups,,B,1491406500,"[*special, binary search, sortings, two pointers]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Lie or Truth,,D,1491406500,"[*special, implementation, sortings]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Big Number and Remainder,,E,1491406500,"[*special, brute force, number theory]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Pens And Days Of Week,,F,1491406500,"[*special, brute force, number theory]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Buying A House,500,A,1491842100,"[brute force, implementation]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Find The Bone,750,B,1491842100,[implementation],PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Bank Hacking,1000,C,1491842100,"[constructive algorithms, data structures, dp, trees]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Police Stations,1500,D,1491842100,"[constructive algorithms, shortest paths, trees]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Exam Cheating,2000,E,1491842100,"[binary search, dp]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Sequence Recovery,2500,F,1491842100,"[bitmasks, data structures, greedy]",PROGRAMMING
+797,Educational Codeforces Round 19,12,k-Factorization,,A,1492266900,"[implementation, math, number theory]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Odd sum,,B,1492266900,"[dp, greedy]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Minimal string,,C,1492266900,"[greedy, strings]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Broken BST,,D,1492266900,"[data structures, dfs and similar]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Array Queries,,E,1492266900,"[brute force, data structures, dp]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Mice and Holes,,F,1492266900,"[data structures, dp, greedy, sortings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and palindrome,500,A,1492785300,"[brute force, constructive algorithms, strings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and strings,1000,B,1492785300,"[brute force, strings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and gcd problem,1500,C,1492785300,"[dp, greedy, number theory]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and distribution,2000,D,1492785300,"[constructive algorithms, sortings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and code of a permutation,2500,E,1492785300,"[constructive algorithms, data structures, graphs, sortings]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Carrot Cakes,500,A,1494516900,"[brute force, implementation]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,T-shirt buying,1000,B,1494516900,"[data structures, implementation]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Fountains,1500,C,1494516900,"[binary search, data structures]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Field expansion,2000,D,1494516900,"[brute force, dp, meet-in-the-middle]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Aquarium decoration,2500,E,1494516900,"[data structures, greedy, two pointers]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Beautiful fountains rows,3250,F,1494516900,[data structures],PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Cut the pie,3500,G,1494516900,"[binary search, data structures, geometry]",PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Voltage Keepsake,500,A,1492356900,"[binary search, greedy]",PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Volatile Kite,1000,B,1492356900,[geometry],PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Vulnerable Kerbals,1750,C,1492356900,[number theory],PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Varying Kibibits,2250,D,1492356900,"[combinatorics, dp]",PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Verifying Kingdom,2250,E,1492356900,[],PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vicious Keyboard,500,A,1492356900,[brute force],PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Valued Keys,1000,B,1492356900,"[constructive algorithms, greedy, strings]",PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Voltage Keepsake,1500,C,1492356900,"[binary search, math]",PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Volatile Kite,2000,D,1492356900,"[brute force, geometry, greedy]",PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vulnerable Kerbals,2750,E,1492356900,[],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (easy),,A,1495958700,[greedy],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (medium),,B,1495958700,"[data structures, greedy]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (hard),,C,1495958700,[flows],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (easy),,D,1495958700,[math],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (medium),,E,1495958700,[math],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (hard),,F,1495958700,[math],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (easy),,G,1495958700,[implementation],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (medium),,H,1495958700,[constructive algorithms],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (hard),,I,1495958700,[string suffix structures],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (easy),,J,1495958700,"[dfs and similar, trees]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (medium),,K,1495958700,"[dp, trees]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (hard),,L,1495958700,"[dfs and similar, dp, math, trees]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (easy),,M,1495958700,"[greedy, sortings]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (medium),,N,1495958700,"[binary search, flows]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (hard),,O,1495958700,"[binary search, flows]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Maximal Binary Matrix,,A,1493391900,[constructive algorithms],PROGRAMMING
+803,Educational Codeforces Round 20,12,Distances to Zero,,B,1493391900,[constructive algorithms],PROGRAMMING
+803,Educational Codeforces Round 20,12,Maximal GCD,,C,1493391900,"[greedy, math]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Magazine Ad,,D,1493391900,"[binary search, greedy]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Roma and Poker,,E,1493391900,[dp],PROGRAMMING
+803,Educational Codeforces Round 20,12,Coprime Subsequences,,F,1493391900,"[bitmasks, combinatorics, number theory]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Periodic RMQ Problem,,G,1493391900,[data structures],PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Find Amir,500,A,1493909400,"[greedy, math]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Minimum number of steps,1000,B,1493909400,"[greedy, implementation, math]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Ice cream coloring,1500,C,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Expected diameter of a tree,2000,D,1493909400,"[binary search, brute force, dfs and similar, dp, sortings, trees]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,The same permutation ,2500,E,1493909400,[constructive algorithms],PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Fake bullions,3000,F,1493909400,"[dfs and similar, dp, graphs]",PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Fake NP,500,A,1493909400,[math],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,3-palindrome,1000,B,1493909400,[constructive algorithms],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Find Amir,1500,C,1493909400,[constructive algorithms],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Minimum number of steps,2000,D,1493909400,[],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Ice cream coloring,2500,E,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Expected diameter of a tree,3000,F,1493909400,"[graphs, probabilities]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Success Rate,500,A,1494171900,"[binary search, math]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Dynamic Problem Scoring,1000,B,1494171900,"[brute force, greedy]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Prairie Partition,1750,C,1494171900,"[binary search, greedy]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Perishable Roads,2500,D,1494171900,[graphs],PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Blog Post Rating,2750,E,1494171900,[data structures],PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Test Data Generation,3500,F,1494171900,[],PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Is it rated?,500,A,1494171900,"[implementation, sortings]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,T-Shirt Hunt,1000,B,1494171900,[brute force],PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Success Rate,1500,C,1494171900,"[binary search, math]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Dynamic Problem Scoring,2000,D,1494171900,"[brute force, greedy]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Prairie Partition,2750,E,1494171900,"[binary search, greedy]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Perishable Roads,3500,F,1494171900,[],PROGRAMMING
+808,Educational Codeforces Round 21,12,Lucky Year,,A,1494860700,[implementation],PROGRAMMING
+808,Educational Codeforces Round 21,12,Average Sleep Time,,B,1494860700,"[data structures, math]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Tea Party,,C,1494860700,"[constructive algorithms, greedy]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Array Division,,D,1494860700,"[binary search, data structures, implementation]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Selling Souvenirs,,E,1494860700,"[dp, greedy, ternary search]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Card Game,,F,1494860700,"[binary search, flows, graphs]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Anthem of Berland,,G,1494860700,"[dp, strings]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Do you want a date?,500,A,1495303500,"[math, sortings]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Glad to see you!,1000,B,1495303500,[binary search],PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Find a car,1500,C,1495303500,"[combinatorics, divide and conquer, dp]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Hitchhiking in the Baltic States,2000,D,1495303500,"[data structures, dp]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Surprise me!,2500,E,1495303500,"[divide and conquer, math, trees]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Straight <>,500,A,1495303500,"[implementation, math]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Summer sell-off,1000,B,1495303500,"[greedy, sortings]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Do you want a date?,1500,C,1495303500,"[math, sortings]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Glad to see you!,2000,D,1495303500,[binary search],PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Find a car,2500,E,1495303500,"[divide and conquer, dp]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Courtesy,500,A,1495877700,"[brute force, implementation]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Complicated Book,1000,B,1495877700,"[implementation, sortings]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Memorable Trip,1500,C,1495877700,"[dp, implementation]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Favorite Game,2000,D,1495877700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Entertaining Flags,2500,E,1495877700,"[data structures, dsu, graphs]",PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Crossroads,500,A,1496326500,[implementation],PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,"Sagheer, the Hausmeister",1000,B,1496326500,"[bitmasks, brute force, dp]",PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Nubian Market,1500,C,1496326500,[binary search],PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Kindergarten,2000,D,1496326500,"[dfs and similar, graphs, implementation]",PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Apple Tree,2500,E,1496326500,[games],PROGRAMMING
+813,Educational Codeforces Round 22,12,The Contest,,A,1496675100,[implementation],PROGRAMMING
+813,Educational Codeforces Round 22,12,The Golden Age,,B,1496675100,"[brute force, math]",PROGRAMMING
+813,Educational Codeforces Round 22,12,The Tag Game,,C,1496675100,[dfs and similar],PROGRAMMING
+813,Educational Codeforces Round 22,12,Two Melodies,,D,1496675100,"[dp, flows]",PROGRAMMING
+813,Educational Codeforces Round 22,12,Army Creation,,E,1496675100,"[binary search, data structures]",PROGRAMMING
+813,Educational Codeforces Round 22,12,Bipartite Checking,,F,1496675100,"[data structures, dsu, graphs]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An abandoned sentiment from past,500,A,1496837700,"[implementation, sortings]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An express train to reveries,1000,B,1496837700,[constructive algorithms],PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An impassioned circulation of affection,1750,C,1496837700,"[brute force, dp, two pointers]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An overnight dance in discotheque,1750,D,1496837700,"[dfs and similar, dp, geometry, greedy, trees]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An unavoidable detour for home,2500,E,1496837700,"[combinatorics, dp]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Game,500,A,1497710100,"[brute force, greedy, implementation]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Test,1250,B,1497710100,"[brute force, constructive algorithms, math]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Supermarket,1500,C,1497710100,"[brute force, dp, trees]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Cards,2250,D,1497710100,"[binary search, combinatorics, data structures, geometry]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Neighborhood,2250,E,1497710100,"[binary search, constructive algorithms]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Morning,500,A,1497710100,"[brute force, implementation]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Coffee,1000,B,1497710100,"[binary search, data structures]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Game,1500,C,1497710100,"[brute force, greedy]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Test,2000,D,1497710100,[combinatorics],PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Supermarket,2750,E,1497710100,"[dp, trees]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Treasure Hunt,,A,1497539100,"[implementation, number theory]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Makes And The Product,,B,1497539100,"[combinatorics, sortings]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Really Big Numbers,,C,1497539100,"[binary search, brute force, dp, math]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Imbalanced Array,,D,1497539100,"[data structures, divide and conquer, dsu, sortings]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Choosing The Commander,,E,1497539100,"[bitmasks, data structures, trees]",PROGRAMMING
+817,Educational Codeforces Round 23,12,MEX Queries,,F,1497539100,"[binary search, data structures, trees]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Diplomas and Certificates,,A,1498748700,"[implementation, math]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Permutation Game,,B,1498748700,[implementation],PROGRAMMING
+818,Educational Codeforces Round 24,12,Sofa Thief,,C,1498748700,"[brute force, implementation]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Multicolored Cars,,D,1498748700,"[data structures, implementation]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Card Game Again,,E,1498748700,"[binary search, data structures, number theory, two pointers]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Level Generation,,F,1498748700,"[binary search, math, ternary search]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Four Melodies,,G,1498748700,[flows],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Boring Game,500,A,1498574100,[],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and PR Shifts,1000,B,1498574100,"[data structures, implementation]",PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Beacons on Field,1500,C,1498574100,[number theory],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Astronomers,2000,D,1498574100,[number theory],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Flight to the Moon,2500,E,1498574100,"[constructive algorithms, graphs]",PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Book Reading,500,A,1498574100,[implementation],PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Angle in Polygon,1000,B,1498574100,"[constructive algorithms, geometry]",PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Boring Game,1500,C,1498574100,[],PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and PR Shifts,2000,D,1498574100,[],PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Beacons on Field,2500,E,1498574100,[],PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and Future Gadget Laboratory,500,A,1498401300,[implementation],PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and Banana Trees,1000,B,1498401300,"[brute force, math]",PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and Boxes,1500,C,1498401300,"[data structures, trees]",PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and City,2000,D,1498401300,"[graphs, shortest paths]",PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and El Psy Kongroo,2500,E,1498401300,"[dp, matrices]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,I'm bored with life,500,A,1499011500,"[implementation, math, number theory]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,Crossword solving,750,B,1499011500,"[brute force, implementation]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,"Hacker, pack your bags!",1250,C,1499011500,"[binary search, greedy, sortings]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,My pretty girl Noora,1750,D,1499011500,"[brute force, dp, greedy, math, number theory]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,Liar,2250,E,1499011500,"[binary search, dp, hashing, string suffix structures]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,Madness,2500,F,1499011500,"[dfs and similar, trees]",PROGRAMMING
+823,VK Cup 2017 - Finals,12,High Load,500,A,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,DNA Evolution,1000,B,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Bamboo Partition,1500,C,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Rusty String,2000,D,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Singer House,2750,E,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Perpetual Motion Machine,2750,F,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Dirty Arkady's Kitchen,3500,G,1499587500,[],PROGRAMMING
+825,Educational Codeforces Round 25,12,Binary Protocol,,A,1500217500,[implementation],PROGRAMMING
+825,Educational Codeforces Round 25,12,Five-In-a-Row,,B,1500217500,"[brute force, implementation]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Multi-judge Solving,,C,1500217500,"[greedy, implementation]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Suitable Replacement,,D,1500217500,"[greedy, implementation]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Minimal Labels,,E,1500217500,"[data structures, graphs, greedy]",PROGRAMMING
+825,Educational Codeforces Round 25,12,String Compression,,F,1500217500,"[dp, hashing, string suffix structures, strings]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Tree Queries,,G,1500217500,"[dfs and similar, trees]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,String Reconstruction,500,A,1499791500,"[data structures, greedy]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,High Load,750,B,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,DNA Evolution,1500,C,1499791500,[data structures],PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Best Edge Weight,1750,D,1499791500,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Rusty String,1750,E,1499791500,"[fft, math]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Dirty Arkady's Kitchen,2500,F,1499791500,"[dp, shortest paths]",PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Restaurant Tables,500,A,1499791500,[implementation],PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Black Square,750,B,1499791500,[implementation],PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,String Reconstruction,1250,C,1499791500,"[data structures, sortings]",PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,High Load,1750,D,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,DNA Evolution,2000,E,1499791500,[data structures],PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Best Edge Weight,2750,F,1499791500,[data structures],PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Office Keys,500,A,1499958300,"[binary search, brute force, dp, greedy, sortings]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Cards Sorting,1000,B,1499958300,"[data structures, implementation, sortings]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Bamboo Partition,1500,C,1499958300,"[brute force, math, number theory, sortings, two pointers]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Singer House,2250,D,1499958300,"[combinatorics, dp, trees]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Perpetual Motion Machine,2250,E,1499958300,"[constructive algorithms, implementation, math, trees]",PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Unimodal Array,500,A,1499958300,[implementation],PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Keyboard Layouts,750,B,1499958300,"[implementation, strings]",PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Jury Marks,1000,C,1499958300,[brute force],PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Office Keys,1500,D,1499958300,"[binary search, brute force, dp, greedy]",PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Cards Sorting,2000,E,1499958300,[data structures],PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Bamboo Partition,2500,F,1499958300,[],PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Sasha and Sticks,500,A,1500906900,"[games, math]",PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Petya and Exam,1000,B,1500906900,[implementation],PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Strange Radiation,1750,C,1500906900,"[binary search, implementation, math]",PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,"Misha, Grisha and Underground",2000,D,1500906900,"[dfs and similar, trees]",PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Vasya and Shifts,2500,E,1500906900,[matrices],PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,The Meaningless Game,500,A,1501425300,"[math, number theory]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,The Bakery,1250,B,1501425300,"[binary search, data structures, dp, two pointers]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,Ever-Hungry Krakozyabra,1500,C,1501425300,"[brute force, greedy]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,Red-Black Cobweb,2250,D,1501425300,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,Caramel Clouds,2500,E,1501425300,"[data structures, dp, sortings]",PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Useless Toy,500,A,1501425300,[implementation],PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Festive Evening,1000,B,1501425300,"[data structures, implementation]",PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Meaningless Game,1500,C,1501425300,[math],PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Bakery,2250,D,1501425300,"[data structures, divide and conquer, dp]",PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,Ever-Hungry Krakozyabra,2500,E,1501425300,[],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Key races,500,A,1501511700,[math],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,The number on the board,750,B,1501511700,[greedy],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Star sky,1250,C,1501511700,"[dp, implementation]",PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Palindromic characteristics,1500,D,1501511700,"[brute force, dp, hashing, strings]",PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,The penguin's game,2250,E,1501511700,[constructive algorithms],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Roads in the Kingdom,2250,F,1501511700,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+837,Educational Codeforces Round 26,12,Text Volume,,A,1501773300,[implementation],PROGRAMMING
+837,Educational Codeforces Round 26,12,Flag of Berland,,B,1501773300,"[brute force, implementation]",PROGRAMMING
+837,Educational Codeforces Round 26,12,Two Seals,,C,1501773300,[brute force],PROGRAMMING
+837,Educational Codeforces Round 26,12,Round Subset,,D,1501773300,[dp],PROGRAMMING
+837,Educational Codeforces Round 26,12,Vasya's Function,,E,1501773300,"[binary search, implementation, math]",PROGRAMMING
+837,Educational Codeforces Round 26,12,Prefix Sums,,F,1501773300,"[binary search, brute force, combinatorics, math, matrices]",PROGRAMMING
+837,Educational Codeforces Round 26,12,Functions On The Segments,,G,1501773300,[data structures],PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Binary Blocks,,A,1502085900,[brute force],PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Diverging Directions,,B,1502085900,"[data structures, dfs and similar, trees]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Future Failure,,C,1502085900,"[dp, games]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Airplane Arrangements,,D,1502085900,"[math, number theory]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Convex Countour,,E,1502085900,[dp],PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Expected Earnings,,F,1502085900,[],PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Arya and Bran,500,A,1502548500,[implementation],PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Game of the Rows,1000,B,1502548500,"[brute force, greedy, implementation]",PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Journey,1500,C,1502548500,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Winter is here,2000,D,1502548500,"[combinatorics, dp, math, number theory]",PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Mother of Dragons,2500,E,1502548500,"[brute force, graphs, math, meet-in-the-middle]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,Leha and Function,500,A,1503068700,"[combinatorics, greedy, math, number theory, sortings]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,Leha and another game about graph,1000,B,1503068700,"[constructive algorithms, data structures, dfs and similar, dp, graphs]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,On the Bench,1500,C,1503068700,"[combinatorics, dp]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,Destiny,2000,D,1503068700,"[data structures, probabilities]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,In a Trap,2500,E,1503068700,[trees],PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Generous Kefa,500,A,1503068700,"[brute force, implementation]",PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Godsend,1000,B,1503068700,"[games, math]",PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Leha and Function,1500,C,1503068700,[greedy],PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Leha and another game about graph,2000,D,1503068700,"[dfs and similar, graphs]",PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,On the Bench,2500,E,1503068700,[],PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Kirill And The Game,500,A,1504019100,"[brute force, two pointers]",PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Gleb And Pizza,1000,B,1504019100,[geometry],PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Ilya And The Tree,1500,C,1504019100,"[dfs and similar, math, trees]",PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Vitya and Strange Lesson,2000,D,1504019100,"[binary search, data structures]",PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Nikita and game,2500,E,1504019100,"[binary search, dfs and similar, divide and conquer, trees]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Sorting by Subsequences,500,A,1503592500,"[dfs and similar, dsu, implementation, sortings]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Interactive LowerBound,1000,B,1503592500,"[brute force, probabilities]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Upgrading Tree,1750,C,1503592500,"[constructive algorithms, dfs and similar, math]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Dynamic Shortest Path,2250,D,1503592500,"[graphs, shortest paths]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Maximum Flow,2250,E,1503592500,[flows],PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Diversity,500,A,1503592500,[implementation],PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Rectangles,1000,B,1503592500,"[combinatorics, math]",PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Sorting by Subsequences,1500,C,1503592500,[dfs and similar],PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Interactive LowerBound,2000,D,1503592500,"[brute force, probabilities]",PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Upgrading Tree,3000,E,1503592500,[],PROGRAMMING
+845,Educational Codeforces Round 27,12,Chess Tourney,,A,1503327900,[sortings],PROGRAMMING
+845,Educational Codeforces Round 27,12,Luba And The Ticket,,B,1503327900,"[brute force, greedy]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Two TVs,,C,1503327900,"[data structures, greedy, sortings]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Driving Test,,D,1503327900,"[data structures, dp, greedy]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Fire in the City,,E,1503327900,"[binary search, data structures]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Guards In The Storehouse,,F,1503327900,[dp],PROGRAMMING
+845,Educational Codeforces Round 27,12,Shortest Path Problem?,,G,1503327900,"[dfs and similar, math]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Curriculum Vitae,,A,1504623900,[brute force],PROGRAMMING
+846,Educational Codeforces Round 28,12,Math Show,,B,1504623900,"[brute force, greedy]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Four Segments,,C,1504623900,"[brute force, dp]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Monitor,,D,1504623900,"[binary search, data structures]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Chemistry in Berland,,E,1504623900,"[dfs and similar, greedy, trees]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Random Query,,F,1504623900,"[math, two pointers]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Union of Doubly Linked Lists,,A,1505739900,[implementation],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Preparing for Merge Sort,,B,1505739900,[binary search],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Sum of Nestings,,C,1505739900,[],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Dog Show,,D,1505739900,"[data structures, greedy]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen,,E,1505739900,[binary search],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Elections,,F,1505739900,[greedy],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,University Classes,,G,1505739900,[implementation],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Load Testing,,H,1505739900,[],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Noise Level,,I,1505739900,[dfs and similar],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Students Initiation,,J,1505739900,"[binary search, flows]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Travel Cards,,K,1505739900,[sortings],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland SU Computer Network,,L,1505739900,"[dfs and similar, hashing, trees]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Weather Tomorrow,,M,1505739900,[implementation],PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,From Y to Y,500,A,1504272900,[constructive algorithms],PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Rooter's Song,1000,B,1504272900,"[constructive algorithms, data structures, geometry, implementation, sortings, two pointers]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Goodbye Souvenir,1750,C,1504272900,"[data structures, divide and conquer]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Shake It!,1750,D,1504272900,"[combinatorics, dp, flows, graphs]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Days of Floral Colours,2500,E,1504272900,"[combinatorics, dp, fft, math]",PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Odds and Ends,500,A,1504272900,[implementation],PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Tell Your World,1000,B,1504272900,"[brute force, geometry]",PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,From Y to Y,1500,C,1504272900,[constructive algorithms],PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Rooter's Song,2000,D,1504272900,[],PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Goodbye Souvenir,2500,E,1504272900,[data structures],PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Five Dimensional Points,500,A,1504535700,"[brute force, math]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a list of numbers,1000,B,1504535700,[number theory],PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a game with Mojtaba,1250,C,1504535700,"[bitmasks, dp, games]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Tournament Construction,1750,D,1504535700,"[dp, graphs, greedy, math]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Random Elections,2000,E,1504535700,"[bitmasks, brute force, fft, math]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Rainbow Balls,2500,F,1504535700,[math],PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a research in Mexican wave,500,A,1504535700,[implementation],PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and an exam about geometry,1000,B,1504535700,"[geometry, math]",PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Five Dimensional Points,1500,C,1504535700,"[brute force, math]",PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a list of numbers,2000,D,1504535700,[],PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a game with Mojtaba,2500,E,1504535700,"[bitmasks, games]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Digits,,A,1504432800,"[brute force, implementation, math]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Neural Network country,,B,1504432800,"[dp, matrices]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Property,,C,1504432800,"[greedy, sortings]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Exploration plan,,D,1504432800,"[binary search, flows, graph matchings, shortest paths]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Casinos and travel,,E,1504432800,[dp],PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Product transformation,,F,1504432800,"[combinatorics, math, number theory]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Bathroom terminal,,G,1504432800,[implementation],PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Bob and stages,,H,1504432800,"[dp, geometry]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Dating,,I,1504432800,"[brute force, dfs and similar, graphs, trees]",PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Planning,750,A,1504702500,[greedy],PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Jury Meeting,750,B,1504702500,"[greedy, sortings, two pointers]",PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Boredom,1750,C,1504702500,[data structures],PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Michael and Charging Stations,1750,D,1504702500,"[binary search, dp]",PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Lada Malina,2500,E,1504702500,"[data structures, geometry]",PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Fraction,500,A,1504702500,"[brute force, constructive algorithms, math]",PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Maxim Buys an Apartment,1000,B,1504702500,[constructive algorithms],PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Planning,1750,C,1504702500,[],PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Jury Meeting,1750,D,1504702500,[greedy],PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Boredom,2500,E,1504702500,[data structures],PROGRAMMING
+855,"Manthan, Codefest 17",12,Tom Riddle's Diary,500,A,1506263700,[implementation],PROGRAMMING
+855,"Manthan, Codefest 17",12,Marvolo Gaunt's Ring,1000,B,1506263700,"[data structures, dp]",PROGRAMMING
+855,"Manthan, Codefest 17",12,Helga Hufflepuff's Cup,1500,C,1506263700,"[dp, trees]",PROGRAMMING
+855,"Manthan, Codefest 17",12,Rowena Ravenclaw's Diadem,2000,D,1506263700,[trees],PROGRAMMING
+855,"Manthan, Codefest 17",12,Salazar Slytherin's Locket,2500,E,1506263700,"[bitmasks, dp]",PROGRAMMING
+855,"Manthan, Codefest 17",12,Nagini,3000,F,1506263700,[data structures],PROGRAMMING
+855,"Manthan, Codefest 17",12,Harry Vs Voldemort,3500,G,1506263700,"[dp, graphs, trees]",PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Set Theory,,A,1505050500,"[brute force, constructive algorithms]",PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Similar Words,,B,1505050500,"[dp, strings]",PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Eleventh Birthday,,C,1505050500,"[combinatorics, dp, math]",PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Masha and Cactus,,D,1505050500,[],PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Satellites,,E,1505050500,[],PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,To Play or not to Play,,F,1505050500,[],PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,k-rounding,750,A,1505653500,"[brute force, number theory]",PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Which floor?,750,B,1505653500,[brute force],PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Did you mean...,1500,C,1505653500,"[dp, greedy]",PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Polycarp's phone book,2000,D,1505653500,"[data structures, sortings]",PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Tests Renumeration,2500,E,1505653500,[implementation],PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Wizard's Tour,3000,F,1505653500,"[constructive algorithms, dfs and similar]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Declined Finalists,500,A,1505583300,[greedy],PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Lazy Security Guard,750,B,1505583300,"[brute force, math]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Pie Rules,1000,C,1505583300,"[dp, games]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Third Month Insanity,1500,D,1505583300,"[dp, probabilities]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Desk Disorder,2000,E,1505583300,"[combinatorics, dfs and similar, dsu, graphs, trees]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Ordering T-Shirts,2750,F,1505583300,[greedy],PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Circle of Numbers,3000,G,1505583300,[math],PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Did you mean...,500,A,1505653500,[greedy],PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Polycarp's phone book,1000,B,1505653500,"[brute force, data structures, hashing, strings]",PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Tests Renumeration,1500,C,1505653500,[greedy],PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Wizard's Tour,2000,D,1505653500,"[dfs and similar, graphs, greedy]",PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Arkady and a Nobody-men,2250,E,1505653500,"[data structures, dfs and similar, trees]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,k-rounding,750,A,1505653500,"[math, number theory]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Which floor?,750,B,1505653500,[brute force],PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Did you mean...,1500,C,1505653500,"[brute force, strings]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Polycarp's phone book,2000,D,1505653500,"[brute force, data structures, strings]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Tests Renumeration,2500,E,1505653500,[],PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Wizard's Tour,3000,F,1505653500,[dfs and similar],PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the MEX,500,A,1505833500,[implementation],PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the bipartiteness,1000,B,1505833500,"[dfs and similar, graphs]",PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the xor,1500,C,1505833500,[constructive algorithms],PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the binary string,1750,D,1505833500,"[binary search, divide and conquer]",PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the function,2000,E,1505833500,"[binary search, data structures]",PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the final stage,2750,F,1505833500,"[data structures, strings]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Quasi-palindrome,,A,1506006300,"[brute force, implementation]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Kayaking,,B,1506006300,"[brute force, greedy, sortings]",PROGRAMMING
+863,Educational Codeforces Round 29,12,1-2-3,,C,1506006300,"[graphs, implementation]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Yet Another Array Queries Problem,,D,1506006300,"[data structures, implementation]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Turn Off The TV,,E,1506006300,"[data structures, sortings]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Almost Permutation,,F,1506006300,[flows],PROGRAMMING
+863,Educational Codeforces Round 29,12,Graphic Settings,,G,1506006300,[],PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Fair Game,500,A,1506335700,"[implementation, sortings]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Polycarp and Letters,1000,B,1506335700,"[brute force, implementation]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Bus,1500,C,1506335700,"[greedy, implementation]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Make a Permutation!,2000,D,1506335700,"[greedy, implementation]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Fire,2500,E,1506335700,"[dp, sortings]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Cities Excursions,3000,F,1506335700,[dfs and similar],PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Save the problem!,500,A,1506791100,[constructive algorithms],PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Ordering Pizza,1000,B,1506791100,"[binary search, sortings, ternary search]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Gotta Go Fast,1500,C,1506791100,"[binary search, dp]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Buy Low Sell High,2000,D,1506791100,"[constructive algorithms, data structures, greedy]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Hex Dyslexia,2500,E,1506791100,"[bitmasks, brute force, dp, graphs]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Egg Roulette,3000,F,1506791100,"[bitmasks, brute force, divide and conquer, math, meet-in-the-middle]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Flowers and Chocolate,3500,G,1506791100,"[combinatorics, math, matrices]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Save the problem!,500,A,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Ordering Pizza,1000,B,1506791100,"[greedy, implementation, sortings]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Gotta Go Fast,1500,C,1506791100,"[binary search, dp, probabilities]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Buy Low Sell High,2000,D,1506791100,"[data structures, greedy, two pointers]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Hex Dyslexia,2500,E,1506791100,[],PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Egg Roulette,3000,F,1506791100,[],PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Flowers and Chocolate,3500,G,1506791100,[math],PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Between the Offices,500,A,1506791100,[implementation],PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Save the problem!,1000,B,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Ordering Pizza,1500,C,1506791100,"[greedy, implementation, sortings, ternary search]",PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Gotta Go Fast,2000,D,1506791100,[],PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Buy Low Sell High,2500,E,1506791100,"[data structures, greedy]",PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Hex Dyslexia,3000,F,1506791100,[],PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Bark to Unlock,250,A,1507187100,"[brute force, strings]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Race Against Time,500,B,1507187100,[implementation],PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Qualification Rounds,1000,C,1507187100,"[bitmasks, brute force, constructive algorithms, dp]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Huge Strings,1500,D,1507187100,"[bitmasks, brute force, dp, strings]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Policeman and a Tree,2250,E,1507187100,"[dp, graphs, trees]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Yet Another Minimization Problem,2500,F,1507187100,"[divide and conquer, dp]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,El Toll Caves,3500,G,1507187100,[math],PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Artful Expedient,500,A,1507296900,"[brute force, implementation]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Eternal Immortality,1000,B,1507296900,[math],PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Intriguing Obsession,1500,C,1507296900,"[combinatorics, dp, math]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Overdosing Ubiquity,2250,D,1507296900,"[brute force, dfs and similar, graphs]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Untended Antiquity,2500,E,1507296900,"[data structures, hashing]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Search for Pretty Integers,500,A,1508054700,[brute force],PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Maximum of Maximums of Minimums,1000,B,1508054700,[greedy],PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Maximum splitting,1500,C,1508054700,"[dp, greedy, number theory]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Something with XOR Queries,2250,D,1508054700,"[brute force, probabilities]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,"Points, Lines and Ready-made Titles",2500,E,1508054700,"[dfs and similar, dsu, trees]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Paths,3250,F,1508054700,"[data structures, number theory]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Maximum splitting,500,A,1508054700,"[dp, greedy, math, number theory]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Something with XOR Queries,1250,B,1508054700,"[brute force, implementation]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,"Points, Lines and Ready-made Titles",1500,C,1508054700,[dfs and similar],PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Paths,2250,D,1508054700,"[number theory, sortings]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Restore the Tree,2250,E,1508054700,"[graphs, greedy, trees]",PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Search for Pretty Integers,500,A,1508054700,[implementation],PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum of Maximums of Minimums,1000,B,1508054700,[implementation],PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum splitting,1500,C,1508054700,"[greedy, math, number theory]",PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Something with XOR Queries,2250,D,1508054700,"[brute force, implementation]",PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,"Points, Lines and Ready-made Titles",2500,E,1508054700,[],PROGRAMMING
+873,Educational Codeforces Round 30,12,Chores,,A,1507817100,[implementation],PROGRAMMING
+873,Educational Codeforces Round 30,12,Balanced Substring,,B,1507817100,"[dp, implementation]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Strange Game On Matrix,,C,1507817100,"[greedy, two pointers]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Merge Sort,,D,1507817100,[divide and conquer],PROGRAMMING
+873,Educational Codeforces Round 30,12,Awards For Contestants,,E,1507817100,"[brute force, data structures, dp]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Forbidden Indices,,F,1507817100,"[dsu, string suffix structures, strings]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Classroom Watch,500,A,1508151900,[brute force],PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Sorting the Coins,1000,B,1508151900,"[dsu, sortings, two pointers]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,National Property,1500,C,1508151900,"[2-sat, dfs and similar, graphs, implementation]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,High Cry,1750,D,1508151900,"[binary search, bitmasks, data structures, divide and conquer]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Delivery Club,2000,E,1508151900,"[binary search, data structures, dp]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Royal Questions,2500,F,1508151900,"[dsu, greedy]",PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Trip For Meal,500,A,1508151900,[math],PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Divisiblity of Differences,1000,B,1508151900,[math],PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Classroom Watch,1500,C,1508151900,[brute force],PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Sorting the Coins,2000,D,1508151900,"[dsu, sortings, trees, two pointers]",PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,National Property,2500,E,1508151900,"[2-sat, dfs and similar, graphs]",PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,High Cry,2750,F,1508151900,[data structures],PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Alex and broken contest,500,A,1508773500,"[implementation, strings]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Nikita and string,1000,B,1508773500,"[brute force, dp]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Slava and tanks,1500,C,1508773500,[constructive algorithms],PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Olya and Energy Drinks,2000,D,1508773500,"[data structures, dfs and similar, shortest paths]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Danil and a Part-time Job,2250,E,1508773500,"[bitmasks, data structures, trees]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Ann and Books,2750,F,1508773500,"[data structures, flows, hashing]",PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Short Program,500,A,1509029100,"[bitmasks, constructive algorithms]",PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Teams Formation,1250,B,1509029100,[implementation],PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Tournament,1250,C,1509029100,"[data structures, graphs]",PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Magic Breeding,2000,D,1509029100,[],PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Numbers on the blackboard,2500,E,1509029100,"[combinatorics, dp]",PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Borya's Diagnosis,500,A,1509029100,[implementation],PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Table Tennis,1000,B,1509029100,[implementation],PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Short Program,1500,C,1509029100,"[bitmasks, constructive algorithms, graph matchings]",PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Teams Formation,2250,D,1509029100,[],PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Tournament,2250,E,1509029100,[],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Automatic Door,,A,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Army,,B,1508573100,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Downloading B++,,C,1508573100,[binary search],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen Strike Back,,D,1508573100,"[binary search, dp]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Field of Wonders,,E,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lost in Transliteration,,F,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Orientation of Edges,,G,1508573100,[graphs],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Palindromic Cut,,H,1508573100,"[brute force, implementation]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Photo Processing,,I,1508573100,[binary search],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Renovation,,J,1508573100,"[greedy, sortings]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Road Widening,,K,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland.Taxi,,L,1508573100,[data structures],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Quadcopter Competition,,M,1508573100,[greedy],PROGRAMMING
+884,Educational Codeforces Round 31,12,Book Reading,,A,1509113100,[implementation],PROGRAMMING
+884,Educational Codeforces Round 31,12,Japanese Crosswords Strike Back,,B,1509113100,[implementation],PROGRAMMING
+884,Educational Codeforces Round 31,12,Bertown Subway,,C,1509113100,"[dfs and similar, greedy]",PROGRAMMING
+884,Educational Codeforces Round 31,12,Boxes And Balls,,D,1509113100,"[data structures, greedy]",PROGRAMMING
+884,Educational Codeforces Round 31,12,Binary Matrix,,E,1509113100,[dsu],PROGRAMMING
+884,Educational Codeforces Round 31,12,Anti-Palindromize,,F,1509113100,[flows],PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,ACM ICPC,500,A,1510502700,[brute force],PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Vlad and Cafes,1000,B,1510502700,[],PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Petya and Catacombs,1500,C,1510502700,"[dsu, greedy]",PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Restoration of string,2000,D,1510502700,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Maximum Element,2500,E,1510502700,"[combinatorics, dp]",PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Symmetric Projections,3000,F,1510502700,[geometry],PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Div. 64,500,A,1509725100,[implementation],PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Cubes for Masha,1000,B,1509725100,[brute force],PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Solution for Cube,1500,C,1509725100,"[brute force, implementation]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Ratings and Reality Shows,2000,D,1509725100,"[data structures, two pointers]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Little Brother,2500,E,1509725100,"[binary search, geometry]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Row of Models,3000,F,1509725100,[],PROGRAMMING
+888,Educational Codeforces Round 32,12,Local Extrema,,A,1510239900,"[brute force, implementation]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Buggy Robot,,B,1510239900,"[dp, greedy]",PROGRAMMING
+888,Educational Codeforces Round 32,12,K-Dominant Character,,C,1510239900,"[binary search, implementation, two pointers]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Almost Identity Permutations,,D,1510239900,"[combinatorics, dp, math]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Maximum Subsequence,,E,1510239900,"[bitmasks, divide and conquer, meet-in-the-middle]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Connecting Vertices,,F,1510239900,[dp],PROGRAMMING
+888,Educational Codeforces Round 32,12,Xor-MST,,G,1510239900,"[bitmasks, constructive algorithms, data structures]",PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Petya and Catacombs,500,A,1510502700,[greedy],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Restoration of string,1000,B,1510502700,"[dsu, graphs, strings]",PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Maximum Element,1500,C,1510502700,[dp],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Symmetric Projections,2000,D,1510502700,[geometry],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Mod Mod Mod,2250,E,1510502700,"[binary search, dp, math]",PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,ACM ICPC,500,A,1510502700,[],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Vlad and Cafes,1000,B,1510502700,[],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Petya and Catacombs,1500,C,1510502700,[greedy],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Restoration of string,2000,D,1510502700,"[graphs, greedy, strings]",PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Maximum Element,2500,E,1510502700,[dp],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Symmetric Projections,3000,F,1510502700,[],PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Pride,500,A,1510929300,"[brute force, dp, greedy, math, number theory]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Gluttony,1000,B,1510929300,[constructive algorithms],PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Envy,1500,C,1510929300,"[data structures, dsu, graphs]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Sloth,2000,D,1510929300,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Lust,2500,E,1510929300,"[combinatorics, math]",PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Greed,500,A,1510929300,[implementation],PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Wrath,1000,B,1510929300,"[implementation, two pointers]",PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Pride,1500,C,1510929300,[greedy],PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Gluttony,2000,D,1510929300,[constructive algorithms],PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Envy,2500,E,1510929300,[],PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Chess For Three,,A,1511449500,[implementation],PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Beautiful Divisors,,B,1511449500,[brute force],PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Rumor,,C,1511449500,[dfs and similar],PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Credit Card,,D,1511449500,"[data structures, dp, greedy, implementation]",PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Counting Arrays,,E,1511449500,"[combinatorics, dp, number theory]",PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Subtree Minimum Query,,F,1511449500,"[data structures, trees]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,QAQ,500,A,1511099700,"[brute force, dp]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Ralph And His Magic Field,1000,B,1511099700,"[combinatorics, math, number theory]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Marco and GCD Sequence,1500,C,1511099700,"[constructive algorithms, math]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Ralph And His Tour in Binary Country,2000,D,1511099700,"[data structures, trees]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Ralph and Mushrooms,2500,E,1511099700,"[dp, graphs]",PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,Pizza Separation,500,A,1511712300,[brute force],PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,XK Segments,1000,B,1511712300,"[binary search, sortings, two pointers]",PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,Square Subsets,1750,C,1511712300,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,String Mark,2000,D,1511712300,"[combinatorics, math, strings]",PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,Eyes Closed,2250,E,1511712300,"[data structures, probabilities]",PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,Nephren gives a riddle,500,A,1512223500,[dfs and similar],PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,Ithea Plays With Chtholly,1000,B,1512223500,"[games, greedy]",PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,"Willem, Chtholly and Seniorious",1500,C,1512223500,[probabilities],PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,Nephren Runs a Cinema,2000,D,1512223500,"[chinese remainder theorem, combinatorics, math, number theory]",PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,"Welcome home, Chtholly",2500,E,1512223500,"[data structures, dsu]",PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Scarborough Fair,500,A,1512223500,[implementation],PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Chtholly's request,1000,B,1512223500,[brute force],PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Nephren gives a riddle,1500,C,1512223500,"[combinatorics, math]",PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Ithea Plays With Chtholly,2000,D,1512223500,[implementation],PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,"Willem, Chtholly and Seniorious",2500,E,1512223500,[],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Rounding,500,A,1513424100,[implementation],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Proper Nutrition,750,B,1513424100,"[brute force, number theory]",PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Phone Numbers,1500,C,1513424100,"[implementation, strings]",PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Alarm Clock,1750,D,1513424100,[greedy],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Squares and not squares,2000,E,1513424100,[greedy],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Restoring the Expression,2500,F,1513424100,"[brute force, hashing, math]",PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Splitting in Teams,500,A,1513492500,[greedy],PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Months and Years,1000,B,1513492500,[implementation],PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Dividing the numbers,1500,C,1513492500,"[constructive algorithms, graphs]",PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Shovel Sale,1750,D,1513492500,[math],PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Segments Removal,2250,E,1513492500,"[data structures, dsu, flows, two pointers]",PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Letters Removing,2500,F,1513492500,[data structures],PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Find Extra One,500,A,1513008300,[implementation],PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Position in Fraction,1000,B,1513008300,[math],PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Remove Extra One,1500,C,1513008300,"[brute force, data structures]",PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Unusual Sequences,2000,D,1513008300,"[bitmasks, combinatorics, dp, math, number theory]",PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Maximum Questions,2500,E,1513008300,"[data structures, dp, strings]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Hashing Trees,500,A,1513697700,"[constructive algorithms, trees]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,GCD of Polynomials,1000,B,1513697700,"[constructive algorithms, math]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Bipartite Segments,1750,C,1513697700,"[binary search, data structures, dfs and similar, dsu, graphs, two pointers]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Weighting a Tree,2000,D,1513697700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Cyclic Cipher,2500,E,1513697700,[fft],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Visiting a Friend,500,A,1513697700,[implementation],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Coloring a Tree,1000,B,1513697700,"[dfs and similar, dsu]",PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Hashing Trees,1500,C,1513697700,[],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,GCD of Polynomials,2000,D,1513697700,[math],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Bipartite Segments,2750,E,1513697700,"[data structures, dfs and similar]",PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Hungry Student Problem,,A,1513091100,[greedy],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,The Modcrab,,B,1513091100,[greedy],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Boxes Packing,,C,1513091100,[greedy],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Almost Difference,,D,1513091100,[math],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Swapping Characters,,E,1513091100,"[hashing, implementation, strings]",PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Clear The Matrix,,F,1513091100,"[bitmasks, dp]",PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Yet Another Maxflow Problem,,G,1513091100,"[data structures, flows]",PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Masha and Bears,500,A,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Tic-Tac-Toe,1000,B,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Shockers,1500,C,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Seating of Students,2250,D,1514037900,[constructive algorithms],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Party,2250,E,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Power Tower,3000,F,1514037900,[],PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Shockers,500,A,1514037900,[implementation],PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Seating of Students,1250,B,1514037900,"[brute force, constructive algorithms, math]",PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Party,1250,C,1514037900,"[bitmasks, brute force, dp, graphs]",PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Power Tower,2000,D,1514037900,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Reverses,2500,E,1514037900,"[dp, string suffix structures, strings]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Masha and Bears,500,A,1514037900,"[brute force, implementation]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Tic-Tac-Toe,1000,B,1514037900,[implementation],PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Shockers,1500,C,1514037900,"[bitmasks, implementation]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Seating of Students,2250,D,1514037900,[],PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Party,2250,E,1514037900,"[bitmasks, dp]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Power Tower,3000,F,1514037900,[],PROGRAMMING
+908,Good Bye 2017,12,New Year and Counting Cards,500,A,1514562000,[implementation],PROGRAMMING
+908,Good Bye 2017,12,New Year and Buggy Bot,750,B,1514562000,"[brute force, implementation]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Curling,1000,C,1514562000,"[brute force, geometry, implementation, math]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Arbitrary Arrangement,1750,D,1514562000,"[dp, math, probabilities]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Entity Enumeration,1750,E,1514562000,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Rainbow Roads,2000,F,1514562000,"[graphs, greedy, implementation]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Original Order,2750,G,1514562000,"[dp, math]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Boolean Bridges,3500,H,1514562000,[],PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Generate Login,500,A,1514392500,"[brute force, greedy, sortings]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Segments,1000,B,1514392500,"[constructive algorithms, math]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Python Indentation,1500,C,1514392500,[dp],PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Colorful Points,1750,D,1514392500,"[data structures, greedy, implementation]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Coprocessor,2000,E,1514392500,"[dfs and similar, dp, graphs, greedy]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,AND-permutations,2500,F,1514392500,[constructive algorithms],PROGRAMMING
+910,Testing Round #14 (Unrated),12,The Way to Home,500,A,1513940700,"[dfs and similar, dp, greedy]",PROGRAMMING
+910,Testing Round #14 (Unrated),12,Door Frames,1000,B,1513940700,"[greedy, implementation]",PROGRAMMING
+910,Testing Round #14 (Unrated),12,Minimum Sum,1500,C,1513940700,[greedy],PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Nearest Minimums,,A,1514469900,[implementation],PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Two Cakes,,B,1514469900,"[binary search, brute force, implementation]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Three Garlands,,C,1514469900,"[brute force, constructive algorithms]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Inversion Counting,,D,1514469900,"[brute force, math]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Stack Sorting,,E,1514469900,"[data structures, implementation]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Tree Destruction,,F,1514469900,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Mass Change Queries,,G,1514469900,[data structures],PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,Tricky Alchemy,500,A,1515162900,[implementation],PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,New Year's Eve,1000,B,1515162900,"[bitmasks, constructive algorithms]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,"Perun, Ult!",1750,C,1515162900,"[brute force, greedy, sortings]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,Fishes,2000,D,1515162900,"[data structures, probabilities]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,Prime Gift,2500,E,1515162900,"[binary search, dfs and similar, math, meet-in-the-middle, number theory, two pointers]",PROGRAMMING
+913,Hello 2018,12,Modular Exponentiation,500,A,1515422700,[implementation],PROGRAMMING
+913,Hello 2018,12,Christmas Spruce,750,B,1515422700,"[implementation, trees]",PROGRAMMING
+913,Hello 2018,12,Party Lemonade,1000,C,1515422700,"[bitmasks, dp, greedy]",PROGRAMMING
+913,Hello 2018,12,Too Easy Problems,1250,D,1515422700,"[binary search, brute force, data structures, greedy, sortings]",PROGRAMMING
+913,Hello 2018,12,Logical Expression,1750,E,1515422700,"[bitmasks, dp, shortest paths]",PROGRAMMING
+913,Hello 2018,12,Strongly Connected Tournament,2250,F,1515422700,"[dp, graphs, probabilities]",PROGRAMMING
+913,Hello 2018,12,Power Substring,3000,G,1515422700,"[math, number theory]",PROGRAMMING
+913,Hello 2018,12,Don't Exceed,3500,H,1515422700,"[math, probabilities]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Perfect Squares,500,A,1516462500,"[implementation, math]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Conan and Agasa play a Card Game,1000,B,1516462500,"[games, greedy]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Travelling Salesman and Special Numbers,1500,C,1516462500,"[brute force, combinatorics, dp]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Bash and a Tough Math Puzzle,2000,D,1516462500,"[data structures, number theory]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Palindromes in a Tree,2500,E,1516462500,"[bitmasks, divide and conquer, trees]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Substrings in a String,3000,F,1516462500,"[bitmasks, brute force, string suffix structures, strings]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Sum the Fibonacci,3500,G,1516462500,"[bitmasks, divide and conquer]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Ember and Storm's Tree Game,3750,H,1516462500,"[combinatorics, dp, games, trees]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Garden,,A,1515848700,[implementation],PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Browser,,B,1515848700,[implementation],PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Permute Digits,,C,1515848700,"[dp, greedy]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Almost Acyclic Graph,,D,1515848700,"[dfs and similar, graphs]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Physical Education Lessons,,E,1515848700,"[data structures, implementation, sortings]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Imbalance Value of a Tree,,F,1515848700,"[data structures, dsu, graphs, trees]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Coprime Arrays,,G,1515848700,"[math, number theory]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Alarm Snooze,500,A,1516372500,"[brute force, implementation]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Binary Sequence (changed after round),1000,B,1516372500,"[bitmasks, greedy]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Interesting Graph,1500,C,1516372500,"[constructive algorithms, graphs, shortest paths]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and To-do List,2250,D,1516372500,"[data structures, trees]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Tree,2500,E,1516372500,"[data structures, trees]",PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,The Monster,500,A,1517236500,[greedy],PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,MADMAX,750,B,1517236500,"[dp, games, graphs]",PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,Pollywog,1500,C,1517236500,[dp],PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,Stranger Trees,2000,D,1517236500,"[dp, math, matrices, trees]",PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,Upside Down,2750,E,1517236500,"[data structures, string suffix structures, strings, trees]",PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,Eleven,500,A,1517236500,[implementation],PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,Radio Station,1000,B,1517236500,[implementation],PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,The Monster,1500,C,1517236500,"[data structures, greedy]",PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,MADMAX,1750,D,1517236500,"[dfs and similar, dp, games]",PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,Pollywog,2500,E,1517236500,[],PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Supermarket,500,A,1517403900,[greedy],PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Perfect Number,750,B,1517403900,"[binary search, brute force, dp, implementation, number theory]",PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Seat Arrangements,1000,C,1517403900,[implementation],PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Substring,1500,D,1517403900,"[dfs and similar, dp, graphs]",PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Congruence Equation,2000,E,1517403900,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,A Game With Numbers,2500,F,1517403900,"[games, graphs]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Water The Garden,,A,1517582100,[implementation],PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tea Queue,,B,1517582100,[implementation],PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Swap Adjacent Elements,,C,1517582100,"[dfs and similar, greedy, sortings, two pointers]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tanks,,D,1517582100,"[dp, greedy, implementation]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Connected Components?,,E,1517582100,"[data structures, dfs and similar, dsu, graphs]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,SUM and REPLACE,,F,1517582100,"[brute force, data structures, number theory]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,List Of Integers,,G,1517582100,"[binary search, bitmasks, brute force, combinatorics, math, number theory]",PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-1,,1,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-2,,2,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-3,,3,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-4,,4,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-5,,5,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-6,,6,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-7,,7,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-8,,8,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-9,,9,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-10,,10,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-11,,11,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-12,,12,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-13,,13,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-14,,14,1517500800,[],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Cloning Toys,500,A,1518023700,[implementation],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Magic Forest,1000,B,1518023700,[brute force],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Cave Painting,1250,C,1518023700,"[brute force, number theory]",PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Robot Vacuum Cleaner,1500,D,1518023700,"[greedy, sortings]",PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Birds,2000,E,1518023700,[dp],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Divisibility,2750,F,1518023700,"[constructive algorithms, dp, greedy, number theory]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Primal Sport,500,A,1520696100,"[math, number theory]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Producing Snow,1000,B,1520696100,"[binary search, data structures]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Perfect Security,1500,C,1520696100,"[data structures, greedy]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Picking Strings,1750,D,1520696100,"[constructive algorithms, implementation, strings]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Perpetual Subtraction,2250,E,1520696100,"[fft, math, matrices]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Public Service,3000,F,1520696100,[],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Mystical Mosaic,500,A,1521905700,[implementation],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Three-level Laser,1000,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Riverside Curio,1250,C,1521905700,"[data structures, greedy]",PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Contact ATC,2000,D,1521905700,[],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Wardrobe,2250,E,1521905700,[],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Minimal Subset Difference,3000,F,1521905700,[],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Stairs and Elevators,500,A,1525007700,[binary search],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Resource Distribution,1000,B,1525007700,"[binary search, implementation, sortings]",PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Big Secret,1500,C,1525007700,[],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Aztec Catacombs,2000,D,1525007700,[constructive algorithms],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,May Holidays,2750,E,1525007700,[trees],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Parametric Circulation,3250,F,1525007700,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,2-3-numbers,,A,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Add Points,,B,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Choose Place,,D,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Mobile Communications,,F,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Large Bouquets,,G,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,A Vital Problem,,I,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Segments,,J,1521300900,[data structures],PROGRAMMING
+927,VK Cup 2018 - Wild-card Round 2,12,BuberPool Taxi Optimization,,A,1524152100,[],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Login Verification,500,A,1519486500,[],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Chat,1250,B,1519486500,[],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Dependency management,2000,C,1519486500,[],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Autocompletion,2250,D,1519486500,[],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Прокат велосипедов,500,A,1520004900,[],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Места в самолёте,1000,B,1520004900,[],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Красивая команда,1750,C,1520004900,[combinatorics],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Пограничные врата,2500,D,1520004900,[],PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Peculiar apple-tree,500,A,1520177700,[dfs and similar],PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with String,1000,B,1520177700,"[implementation, probabilities, strings]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Teodor is not a liar!,1500,C,1520177700,"[data structures, dp]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with Tokens,2000,D,1520177700,"[data structures, games, implementation]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Coins Exhibition,2500,E,1520177700,"[data structures, dp]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Friends Meeting,500,A,1520177700,"[brute force, implementation, math]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,World Cup,1000,B,1520177700,[implementation],PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Laboratory Work,1750,C,1520177700,"[implementation, math]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Peculiar apple-tree,1750,D,1520177700,[dfs and similar],PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Game with String,2500,E,1520177700,"[implementation, math, probabilities]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Teodor is not a liar!,3000,F,1520177700,"[data structures, dp]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindromic Supersequence,500,A,1518705300,[constructive algorithms],PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Recursive Queries,1000,B,1518705300,"[data structures, dfs and similar]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Permutation Cycle,1500,C,1518705300,"[brute force, constructive algorithms]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Tree,2000,D,1518705300,"[binary search, dp, trees]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Team Work,2500,E,1518705300,"[combinatorics, dp]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Escape Through Leaf,2500,F,1518705300,"[data structures, dp, geometry]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindrome Partition,3000,G,1518705300,"[dp, strings]",PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Twisty Movement,500,A,1518609900,"[data structures, dp]",PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Determined Cleanup,750,B,1518609900,[math],PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Colourful Prospect,1500,C,1518609900,[geometry],PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Creative Cutout,2250,D,1518609900,"[brute force, combinatorics, math]",PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Preponderant Reunion,2500,E,1518609900,"[constructive algorithms, dp]",PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Compatible Pair,500,A,1518609900,[brute force],PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Prosperous Lot,1000,B,1518609900,[implementation],PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Twisty Movement,1500,C,1518609900,"[brute force, dp]",PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Determined Cleanup,2000,D,1518609900,[math],PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Colourful Prospect,2500,E,1518609900,[],PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and his Company,500,A,1519058100,[brute force],PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and the Gates,750,B,1519058100,[implementation],PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fifa and Fafa,1250,C,1519058100,[geometry],PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Alphabet,1750,D,1519058100,"[math, probabilities]",PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Mathematics,2250,E,1519058100,"[dp, trees]",PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and Array,2750,F,1519058100,[data structures],PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Save Energy!,500,A,1519574700,"[binary search, implementation, math]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Sleepy Game,1000,B,1519574700,"[dfs and similar, dp, graphs]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Lock Puzzle,1500,C,1519574700,"[constructive algorithms, implementation]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,World of Tank,2000,D,1519574700,"[dp, greedy]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Iqea,2500,E,1519574700,"[data structures, dfs and similar, divide and conquer, dsu, shortest paths, trees]",PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Olympiad,500,A,1519574700,[implementation],PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Vile Grasshoppers,1000,B,1519574700,[math],PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Save Energy!,1500,C,1519574700,[math],PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Sleepy Game,2000,D,1519574700,"[dfs and similar, graphs]",PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Lock Puzzle,2500,E,1519574700,[constructive algorithms],PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Word Correction,,A,1518793500,[implementation],PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Run For Your Prize,,B,1518793500,[brute force],PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Constructing Tests,,C,1518793500,"[binary search, brute force]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Buy a Ticket,,D,1518793500,"[data structures, graphs, shortest paths]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Max History,,E,1518793500,"[combinatorics, math]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Erasing Substrings,,F,1518793500,"[bitmasks, dp, greedy]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Shortest Path Queries,,G,1518793500,"[bitmasks, data structures, graphs]",PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Love Triangle,500,A,1518861900,"[brute force, implementation]",PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Hamster Farm,1000,B,1518861900,[implementation],PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Convenient For Everybody,1500,C,1518861900,"[binary search, two pointers]",PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Love Rescue,2000,D,1518861900,"[dfs and similar, dsu]",PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Maximize!,2500,E,1518861900,"[binary search, greedy, ternary search, two pointers]",PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Cutlet,2750,F,1518861900,"[data structures, dp]",PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Points on the line,500,A,1519464900,[brute force],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Our Tanya is Crying Out Loud,1250,B,1519464900,[greedy],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Phone Numbers,1250,C,1519464900,[constructive algorithms],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Alena And The Heater,1500,D,1519464900,[implementation],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Cashback,2000,E,1519464900,"[data structures, dp, greedy, math]",PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Machine Learning,2750,F,1519464900,"[brute force, data structures]",PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,World Cup,500,A,1520152800,[implementation],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Laboratory Work,1250,B,1520152800,[],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Peculiar apple-tree,1250,C,1520152800,[dfs and similar],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with String,2000,D,1520152800,[],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Teodor is not a liar!,2500,E,1520152800,"[binary search, data structures, dp]",PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with Tokens,3000,F,1520152800,"[data structures, games]",PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Coins Exhibition,3500,G,1520152800,[],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Partition,,A,1520348700,[greedy],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Weird Subtraction Process,,B,1520348700,[number theory],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,String Transformation,,C,1520348700,[greedy],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Timetable,,D,1520348700,[dp],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Largest Beautiful Number,,E,1520348700,"[greedy, implementation]",PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Fibonacci String Subsequences,,F,1520348700,"[combinatorics, dp, matrices]",PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Almost Increasing Array,,G,1520348700,"[data structures, dp]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Primal Sport,500,A,1520696100,"[brute force, math, number theory]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Producing Snow,1000,B,1520696100,"[binary search, data structures, implementation]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perfect Security,1500,C,1520696100,"[data structures, strings]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Picking Strings,1750,D,1520696100,"[constructive algorithms, implementation]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perpetual Subtraction,2250,E,1520696100,"[fft, math, matrices]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Public Service,3000,F,1520696100,[],PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Protect Sheep,500,A,1520696100,[brute force],PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Primal Sport,1000,B,1520696100,"[brute force, math, number theory]",PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Producing Snow,1500,C,1520696100,"[binary search, data structures]",PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Perfect Security,2000,D,1520696100,[data structures],PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Picking Strings,2250,E,1520696100,"[constructive algorithms, implementation]",PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Zebras,500,A,1520583000,[greedy],PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,A Leapfrog in the Array,1000,B,1520583000,[math],PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Data Center Maintenance,1250,C,1520583000,"[dfs and similar, graphs]",PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Curfew,1750,D,1520583000,"[binary search, brute force]",PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Binary Cards,2250,E,1520583000,[brute force],PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Astronomy,2500,F,1520583000,"[geometry, probabilities]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,"Left-handers, Right-handers and Ambidexters",500,A,1520583000,[implementation],PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Intercepted Message,1000,B,1520583000,[greedy],PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Zebras,1500,C,1520583000,"[constructive algorithms, greedy]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,A Leapfrog in the Array,2000,D,1520583000,"[constructive algorithms, math]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Data Center Maintenance,2250,E,1520583000,"[2-sat, graphs]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Curfew,2750,F,1520583000,[greedy],PROGRAMMING
+952,April Fools Contest 2018,12,Quirky Quantifiers,,A,1522596900,[math],PROGRAMMING
+952,April Fools Contest 2018,12,A Map of the Cat,,B,1522596900,[brute force],PROGRAMMING
+952,April Fools Contest 2018,12,Ravioli Sort,,C,1522596900,[implementation],PROGRAMMING
+952,April Fools Contest 2018,12,I'm Feeling Lucky!,,D,1522596900,[probabilities],PROGRAMMING
+952,April Fools Contest 2018,12,Cheese Board,,E,1522596900,[],PROGRAMMING
+952,April Fools Contest 2018,12,2 + 2 != 4,,F,1522596900,[],PROGRAMMING
+952,April Fools Contest 2018,12,Puzzling Language,,G,1522596900,[constructive algorithms],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,2-3-numbers,,A,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Add Points,,B,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Choose Place,,D,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Mobile Communications,,F,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Large Bouquets,,G,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,A Vital Problem,,I,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Segments,,J,1521300900,[],PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Diagonal Walking,,A,1521698700,[implementation],PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,String Typing,,B,1521698700,[strings],PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Matrix Walk,,C,1521698700,[implementation],PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Fight Against Traffic,,D,1521698700,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Water Taps,,E,1521698700,"[binary search, greedy, sortings]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Runner's Problem,,F,1521698700,"[dp, matrices, sortings]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Castle Defense,,G,1521698700,"[binary search, two pointers]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Path Counting,,H,1521698700,"[combinatorics, dp]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Yet Another String Matching Problem,,I,1521698700,[fft],PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Feed the cat,500,A,1521822900,"[greedy, math]",PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Not simply beatiful strings,1000,B,1521822900,[implementation],PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Sad powers,1500,C,1521822900,"[binary search, math, number theory]",PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Scissors,2000,D,1521822900,"[brute force, strings]",PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Icicles,2500,E,1521822900,[],PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Heaps,3000,F,1521822900,"[dp, trees]",PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Mystical Mosaic,500,A,1521905700,[implementation],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Three-level Laser,1000,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Riverside Curio,1250,C,1521905700,"[data structures, greedy, implementation]",PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Contact ATC,2000,D,1521905700,[],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Wardrobe,2250,E,1521905700,[dp],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Minimal Subset Difference,3000,F,1521905700,"[bitmasks, dp]",PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Tritonic Iridescence,500,A,1521905700,[implementation],PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Mystical Mosaic,1000,B,1521905700,[brute force],PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Three-level Laser,1500,C,1521905700,"[binary search, math]",PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Riverside Curio,1750,D,1521905700,[greedy],PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Contact ATC,2500,E,1521905700,[],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (easy),,A1,1523689500,[implementation],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (medium),,A2,1523689500,"[hashing, strings]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (hard),,A3,1523689500,[],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (easy),,B1,1523689500,[implementation],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (medium),,B2,1523689500,"[data structures, greedy, trees]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (easy),,C1,1523689500,[brute force],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (medium),,C2,1523689500,[dp],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (hard),,C3,1523689500,"[data structures, dp]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (easy),,D1,1523689500,"[expression parsing, math]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (hard),,D2,1523689500,[],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (easy),,E1,1523689500,"[brute force, geometry, greedy, math]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (medium),,E2,1523689500,"[binary search, dp, greedy, sortings]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (hard),,E3,1523689500,[geometry],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (easy),,F1,1523689500,[implementation],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (medium),,F2,1523689500,"[binary search, two pointers]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (hard),,F3,1523689500,[fft],PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the even-odd game,500,A,1522771500,"[games, math]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the message,1000,B,1522771500,"[dsu, implementation]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the wrong algorithm,1250,C,1522771500,"[constructive algorithms, trees]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and another array construction task,1750,D,1522771500,"[constructive algorithms, greedy, number theory]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the xor-MST,2000,E,1522771500,"[bitmasks, dp, graphs, implementation, math]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and yet another xor task,2500,F,1522771500,"[bitmasks, dp, math, matrices]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Check the string,500,A,1523117100,[implementation],PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Minimize the error,1000,B,1523117100,"[data structures, greedy, sortings]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Subsequence Counting,1500,C,1523117100,"[bitmasks, constructive algorithms, greedy, implementation]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Full Binary Tree Queries,2000,D,1523117100,"[brute force, implementation, trees]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Alternating Tree,2250,E,1523117100,"[combinatorics, dfs and similar, divide and conquer, dp, probabilities, trees]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Pathwalks,2500,F,1523117100,"[data structures, dp, graphs]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Bandit Blues,3000,G,1523117100,"[combinatorics, dp, fft, math]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Santa's Gift,3500,H,1523117100,"[data structures, trees]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tetris,,A,1522850700,[implementation],PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Lecture Sleep,,B,1522850700,"[data structures, dp, implementation, two pointers]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Chessboard,,C,1522850700,"[bitmasks, brute force, implementation]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Pair Of Lines,,D,1522850700,[geometry],PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tufurama,,E,1522850700,[data structures],PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,k-substrings,,F,1522850700,"[binary search, hashing, string suffix structures]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Partitions,,G,1522850700,"[combinatorics, math, number theory]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Equator,,A,1523370900,[implementation],PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Students in Railway Carriage,,B,1523370900,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Make a Square,,C,1523370900,"[brute force, implementation, math]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Merge Equals,,D,1523370900,"[data structures, implementation]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,"Byteland, Berland and Disputed Cities",,E,1523370900,"[constructive algorithms, greedy]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Simple Cycles Edges,,F,1523370900,"[dfs and similar, graphs, trees]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Visible Black Areas,,G,1523370900,"[data structures, dsu, geometry, trees]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Alternating Sum,500,A,1523973900,"[math, number theory]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Destruction of a Tree,1000,B,1523973900,"[constructive algorithms, dfs and similar, dp, greedy, trees]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Cutting Rectangle,1500,C,1523973900,"[brute force, math, number theory]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Frequency of String,2000,D,1523973900,"[hashing, string suffix structures, strings]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Circles of Waiting,2500,E,1523973900,[math],PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Splits,500,A,1523973900,[math],PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Messages,1000,B,1523973900,[math],PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Alternating Sum,1500,C,1523973900,"[math, matrices, number theory]",PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Destruction of a Tree,2000,D,1523973900,"[dfs and similar, dp, trees]",PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Cutting Rectangle,2500,E,1523973900,[math],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Paper Airplanes,500,A,1524677700,[math],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Battleship,1000,B,1524677700,[implementation],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Greedy Arkady,1500,C,1524677700,[math],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Single-use Stones,2000,D,1524677700,"[binary search, flows, greedy, two pointers]",PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Short Code,2500,E,1524677700,"[data structures, dp, greedy, strings, trees]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Stairs and Elevators,500,A,1525007700,"[binary search, data structures, greedy]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Resource Distribution,1000,B,1525007700,"[binary search, data structures, greedy, two pointers]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Big Secret,1500,C,1525007700,"[constructive algorithms, data structures, greedy]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Aztec Catacombs,2000,D,1525007700,"[constructive algorithms, graphs]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,May Holidays,2750,E,1525007700,[],PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Parametric Circulation,3250,F,1525007700,[flows],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Mind the Gap,500,A,1525007700,[implementation],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Watering System,1000,B,1525007700,[sortings],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Stairs and Elevators,1500,C,1525007700,[binary search],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Resource Distribution,2000,D,1525007700,"[binary search, sortings]",PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Big Secret,2750,E,1525007700,[],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Aztec Catacombs,3250,F,1525007700,[],PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Aramic script,500,A,1525183500,"[implementation, strings]",PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Mancala,1000,B,1525183500,"[brute force, implementation]",PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Valhalla Siege,1500,C,1525183500,[binary search],PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Ghosts,2000,D,1525183500,"[geometry, math]",PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Hag's Khashba,2500,E,1525183500,[geometry],PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimum Binary Number,,A,1525099200,[implementation],PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Lara Croft and the New Game,,B,1525099200,"[implementation, math]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Nested Segments,,C,1525099200,"[greedy, implementation, sortings]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Degree Set,,D,1525099200,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Well played!,,E,1525099200,"[greedy, sortings]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimal k-covering,,F,1525099200,[flows],PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Wrong Subtraction,,A,1525615500,[implementation],PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Two-gram,,B,1525615500,"[implementation, strings]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Less or Equal,,C,1525615500,[sortings],PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,"Divide by three, multiply by two",,D,1525615500,"[dfs and similar, math, sortings]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Cyclic Components,,E,1525615500,"[dfs and similar, dsu, graphs]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Consecutive Subsequence,,F,1525615500,[dp],PROGRAMMING
+A,Links and Pearls,500.0,"[implementation, math]",PROGRAMMING,980,Codeforces Round #480 (Div. 2),1525791900,2
+B,Marlin,1000.0,[constructive algorithms],PROGRAMMING,980,Codeforces Round #480 (Div. 2),1525791900,2
+C,Posterized,1500.0,[greedy],PROGRAMMING,980,Codeforces Round #480 (Div. 2),1525791900,2
+D,Perfect Groups,2000.0,"[dp, math, number theory]",PROGRAMMING,980,Codeforces Round #480 (Div. 2),1525791900,2
+E,The Number Games,2500.0,"[data structures, greedy, trees]",PROGRAMMING,980,Codeforces Round #480 (Div. 2),1525791900,2
+F,Cactus to Tree,3000.0,"[dp, graphs, trees]",PROGRAMMING,980,Codeforces Round #480 (Div. 2),1525791900,2
+980,Codeforces Round #480 (Div. 2),2,Links and Pearls,500.0,A,1525791900,"[implementation, math]",PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,Marlin,1000.0,B,1525791900,[constructive algorithms],PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,Posterized,1500.0,C,1525791900,[greedy],PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,Perfect Groups,2000.0,D,1525791900,"[dp, math, number theory]",PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,The Number Games,2500.0,E,1525791900,"[data structures, greedy, trees]",PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,Cactus to Tree,3000.0,F,1525791900,"[dp, graphs, trees]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Wrong Subtraction,,A,1525615500,[implementation],PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Two-gram,,B,1525615500,"[implementation, strings]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Less or Equal,,C,1525615500,[sortings],PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,"Divide by three, multiply by two",,D,1525615500,"[dfs and similar, math, sortings]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Cyclic Components,,E,1525615500,"[dfs and similar, dsu, graphs]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Consecutive Subsequence,,F,1525615500,[dp],PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Aramic script,500.0,A,1525183500,"[implementation, strings]",PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Mancala,1000.0,B,1525183500,"[brute force, implementation]",PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Valhalla Siege,1500.0,C,1525183500,[binary search],PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Ghosts,2000.0,D,1525183500,"[geometry, math]",PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Hag's Khashba,2500.0,E,1525183500,[geometry],PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimum Binary Number,,A,1525099200,[implementation],PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Lara Croft and the New Game,,B,1525099200,"[implementation, math]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Nested Segments,,C,1525099200,"[greedy, implementation, sortings]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Degree Set,,D,1525099200,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Well played!,,E,1525099200,"[greedy, sortings]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimal k-covering,,F,1525099200,[flows],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Stairs and Elevators,500.0,A,1525007700,[binary search],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Resource Distribution,1000.0,B,1525007700,"[binary search, implementation, sortings]",PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Big Secret,1500.0,C,1525007700,[],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Aztec Catacombs,2000.0,D,1525007700,[constructive algorithms],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,May Holidays,2750.0,E,1525007700,"[data structures, trees]",PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Parametric Circulation,3250.0,F,1525007700,[],PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Stairs and Elevators,500.0,A,1525007700,"[binary search, data structures, greedy]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Resource Distribution,1000.0,B,1525007700,"[binary search, data structures, greedy, two pointers]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Big Secret,1500.0,C,1525007700,"[constructive algorithms, data structures, greedy]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Aztec Catacombs,2000.0,D,1525007700,"[constructive algorithms, graphs]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,May Holidays,2750.0,E,1525007700,[],PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Parametric Circulation,3250.0,F,1525007700,[flows],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Mind the Gap,500.0,A,1525007700,[implementation],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Watering System,1000.0,B,1525007700,[sortings],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Stairs and Elevators,1500.0,C,1525007700,[binary search],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Resource Distribution,2000.0,D,1525007700,"[binary search, sortings]",PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Big Secret,2750.0,E,1525007700,[],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Aztec Catacombs,3250.0,F,1525007700,[],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Paper Airplanes,500.0,A,1524677700,[math],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Battleship,1000.0,B,1524677700,[implementation],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Greedy Arkady,1500.0,C,1524677700,[math],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Single-use Stones,2000.0,D,1524677700,"[binary search, flows, greedy, two pointers]",PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Short Code,2500.0,E,1524677700,"[data structures, dp, greedy, strings, trees]",PROGRAMMING
+927,VK Cup 2018 - Wild-card Round 2,12,BuberPool Taxi Optimization,,A,1524152100,[],PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Alternating Sum,500.0,A,1523973900,"[math, number theory]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Destruction of a Tree,1000.0,B,1523973900,"[constructive algorithms, dfs and similar, dp, greedy, trees]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Cutting Rectangle,1500.0,C,1523973900,"[brute force, math, number theory]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Frequency of String,2000.0,D,1523973900,"[hashing, string suffix structures, strings]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Circles of Waiting,2500.0,E,1523973900,[math],PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Splits,500.0,A,1523973900,[math],PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Messages,1000.0,B,1523973900,[math],PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Alternating Sum,1500.0,C,1523973900,"[math, matrices, number theory]",PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Destruction of a Tree,2000.0,D,1523973900,"[dfs and similar, dp, trees]",PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Cutting Rectangle,2500.0,E,1523973900,[math],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (easy),,A1,1523689500,[implementation],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (medium),,A2,1523689500,"[hashing, strings]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (hard),,A3,1523689500,[],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (easy),,B1,1523689500,[implementation],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (medium),,B2,1523689500,"[data structures, greedy, trees]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (easy),,C1,1523689500,[brute force],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (medium),,C2,1523689500,[dp],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (hard),,C3,1523689500,"[data structures, dp]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (easy),,D1,1523689500,"[expression parsing, math]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (hard),,D2,1523689500,[],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (easy),,E1,1523689500,"[brute force, geometry, greedy, math]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (medium),,E2,1523689500,"[binary search, dp, greedy, sortings]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (hard),,E3,1523689500,[geometry],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (easy),,F1,1523689500,[implementation],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (medium),,F2,1523689500,"[binary search, two pointers]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (hard),,F3,1523689500,[fft],PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Equator,,A,1523370900,[implementation],PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Students in Railway Carriage,,B,1523370900,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Make a Square,,C,1523370900,"[brute force, implementation, math]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Merge Equals,,D,1523370900,"[data structures, implementation]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,"Byteland, Berland and Disputed Cities",,E,1523370900,"[constructive algorithms, greedy]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Simple Cycles Edges,,F,1523370900,"[dfs and similar, graphs, trees]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Visible Black Areas,,G,1523370900,"[data structures, dsu, geometry, trees]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Check the string,500.0,A,1523117100,[implementation],PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Minimize the error,1000.0,B,1523117100,"[data structures, greedy, sortings]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Subsequence Counting,1500.0,C,1523117100,"[bitmasks, constructive algorithms, greedy, implementation]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Full Binary Tree Queries,2000.0,D,1523117100,"[brute force, implementation, trees]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Alternating Tree,2250.0,E,1523117100,"[combinatorics, dfs and similar, divide and conquer, dp, probabilities, trees]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Pathwalks,2500.0,F,1523117100,"[data structures, dp, graphs]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Bandit Blues,3000.0,G,1523117100,"[combinatorics, dp, fft, math]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Santa's Gift,3500.0,H,1523117100,"[data structures, trees]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tetris,,A,1522850700,[implementation],PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Lecture Sleep,,B,1522850700,"[data structures, dp, implementation, two pointers]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Chessboard,,C,1522850700,"[bitmasks, brute force, implementation]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Pair Of Lines,,D,1522850700,[geometry],PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tufurama,,E,1522850700,[data structures],PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,k-substrings,,F,1522850700,"[binary search, hashing, string suffix structures]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Partitions,,G,1522850700,"[combinatorics, math, number theory]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the even-odd game,500.0,A,1522771500,"[games, math]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the message,1000.0,B,1522771500,"[dsu, implementation]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the wrong algorithm,1250.0,C,1522771500,"[constructive algorithms, trees]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and another array construction task,1750.0,D,1522771500,"[constructive algorithms, greedy, number theory]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the xor-MST,2000.0,E,1522771500,"[bitmasks, dp, graphs, implementation, math]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and yet another xor task,2500.0,F,1522771500,"[bitmasks, dp, math, matrices]",PROGRAMMING
+952,April Fools Contest 2018,12,Quirky Quantifiers,,A,1522596900,[math],PROGRAMMING
+952,April Fools Contest 2018,12,A Map of the Cat,,B,1522596900,[brute force],PROGRAMMING
+952,April Fools Contest 2018,12,Ravioli Sort,,C,1522596900,[implementation],PROGRAMMING
+952,April Fools Contest 2018,12,I'm Feeling Lucky!,,D,1522596900,[probabilities],PROGRAMMING
+952,April Fools Contest 2018,12,Cheese Board,,E,1522596900,[],PROGRAMMING
+952,April Fools Contest 2018,12,2 + 2 != 4,,F,1522596900,[],PROGRAMMING
+952,April Fools Contest 2018,12,Puzzling Language,,G,1522596900,[constructive algorithms],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Mystical Mosaic,500.0,A,1521905700,[implementation],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Three-level Laser,1000.0,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Riverside Curio,1250.0,C,1521905700,"[data structures, greedy]",PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Contact ATC,2000.0,D,1521905700,[],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Wardrobe,2250.0,E,1521905700,[],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Minimal Subset Difference,3000.0,F,1521905700,[],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Mystical Mosaic,500.0,A,1521905700,[implementation],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Three-level Laser,1000.0,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Riverside Curio,1250.0,C,1521905700,"[data structures, greedy, implementation]",PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Contact ATC,2000.0,D,1521905700,[],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Wardrobe,2250.0,E,1521905700,[dp],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Minimal Subset Difference,3000.0,F,1521905700,"[bitmasks, dp]",PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Tritonic Iridescence,500.0,A,1521905700,[implementation],PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Mystical Mosaic,1000.0,B,1521905700,[brute force],PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Three-level Laser,1500.0,C,1521905700,"[binary search, math]",PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Riverside Curio,1750.0,D,1521905700,[greedy],PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Contact ATC,2500.0,E,1521905700,[],PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Feed the cat,500.0,A,1521822900,"[greedy, math]",PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Not simply beatiful strings,1000.0,B,1521822900,[implementation],PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Sad powers,1500.0,C,1521822900,"[binary search, math, number theory]",PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Scissors,2000.0,D,1521822900,"[brute force, strings]",PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Icicles,2500.0,E,1521822900,[],PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Heaps,3000.0,F,1521822900,"[dp, trees]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Diagonal Walking,,A,1521698700,[implementation],PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,String Typing,,B,1521698700,[strings],PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Matrix Walk,,C,1521698700,[implementation],PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Fight Against Traffic,,D,1521698700,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Water Taps,,E,1521698700,"[binary search, greedy, sortings]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Runner's Problem,,F,1521698700,"[dp, matrices, sortings]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Castle Defense,,G,1521698700,"[binary search, two pointers]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Path Counting,,H,1521698700,"[combinatorics, dp]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Yet Another String Matching Problem,,I,1521698700,[fft],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,2-3-numbers,,A,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Add Points,,B,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Choose Place,,D,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Mobile Communications,,F,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Large Bouquets,,G,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,A Vital Problem,,I,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Segments,,J,1521300900,[data structures],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,2-3-numbers,,A,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Add Points,,B,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Choose Place,,D,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Mobile Communications,,F,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Large Bouquets,,G,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,A Vital Problem,,I,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Segments,,J,1521300900,[],PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Primal Sport,500.0,A,1520696100,"[math, number theory]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Producing Snow,1000.0,B,1520696100,"[binary search, data structures]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Perfect Security,1500.0,C,1520696100,"[data structures, greedy]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Picking Strings,1750.0,D,1520696100,"[constructive algorithms, implementation, strings]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Perpetual Subtraction,2250.0,E,1520696100,"[fft, math, matrices]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Public Service,3000.0,F,1520696100,[],PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Primal Sport,500.0,A,1520696100,"[brute force, math, number theory]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Producing Snow,1000.0,B,1520696100,"[binary search, data structures, implementation]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perfect Security,1500.0,C,1520696100,"[data structures, strings]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Picking Strings,1750.0,D,1520696100,"[constructive algorithms, implementation]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perpetual Subtraction,2250.0,E,1520696100,"[fft, math, matrices]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Public Service,3000.0,F,1520696100,[],PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Protect Sheep,500.0,A,1520696100,[brute force],PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Primal Sport,1000.0,B,1520696100,"[brute force, math, number theory]",PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Producing Snow,1500.0,C,1520696100,"[binary search, data structures]",PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Perfect Security,2000.0,D,1520696100,[data structures],PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Picking Strings,2250.0,E,1520696100,"[constructive algorithms, implementation]",PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Zebras,500.0,A,1520583000,[greedy],PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,A Leapfrog in the Array,1000.0,B,1520583000,[math],PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Data Center Maintenance,1250.0,C,1520583000,"[dfs and similar, graphs]",PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Curfew,1750.0,D,1520583000,"[binary search, brute force]",PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Binary Cards,2250.0,E,1520583000,[brute force],PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Astronomy,2500.0,F,1520583000,"[geometry, probabilities]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,"Left-handers, Right-handers and Ambidexters",500.0,A,1520583000,[implementation],PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Intercepted Message,1000.0,B,1520583000,[greedy],PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Zebras,1500.0,C,1520583000,"[constructive algorithms, greedy]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,A Leapfrog in the Array,2000.0,D,1520583000,"[constructive algorithms, math]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Data Center Maintenance,2250.0,E,1520583000,"[2-sat, graphs]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Curfew,2750.0,F,1520583000,[greedy],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Partition,,A,1520348700,[greedy],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Weird Subtraction Process,,B,1520348700,[number theory],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,String Transformation,,C,1520348700,[greedy],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Timetable,,D,1520348700,[dp],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Largest Beautiful Number,,E,1520348700,"[greedy, implementation]",PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Fibonacci String Subsequences,,F,1520348700,"[combinatorics, dp, matrices]",PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Almost Increasing Array,,G,1520348700,"[data structures, dp]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Peculiar apple-tree,500.0,A,1520177700,[dfs and similar],PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with String,1000.0,B,1520177700,"[implementation, probabilities, strings]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Teodor is not a liar!,1500.0,C,1520177700,"[data structures, dp]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with Tokens,2000.0,D,1520177700,"[data structures, games, implementation]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Coins Exhibition,2500.0,E,1520177700,"[data structures, dp]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Friends Meeting,500.0,A,1520177700,"[brute force, implementation, math]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,World Cup,1000.0,B,1520177700,[implementation],PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Laboratory Work,1750.0,C,1520177700,"[implementation, math]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Peculiar apple-tree,1750.0,D,1520177700,[dfs and similar],PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Game with String,2500.0,E,1520177700,"[implementation, math, probabilities]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Teodor is not a liar!,3000.0,F,1520177700,"[data structures, dp]",PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,World Cup,500.0,A,1520152800,[implementation],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Laboratory Work,1250.0,B,1520152800,[],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Peculiar apple-tree,1250.0,C,1520152800,[dfs and similar],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with String,2000.0,D,1520152800,[],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Teodor is not a liar!,2500.0,E,1520152800,"[binary search, data structures, dp]",PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with Tokens,3000.0,F,1520152800,"[data structures, games]",PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Coins Exhibition,3500.0,G,1520152800,[],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Прокат велосипедов,500.0,A,1520004900,[],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Места в самолёте,1000.0,B,1520004900,[],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Красивая команда,1750.0,C,1520004900,[combinatorics],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Пограничные врата,2500.0,D,1520004900,[],PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Save Energy!,500.0,A,1519574700,"[binary search, implementation, math]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Sleepy Game,1000.0,B,1519574700,"[dfs and similar, dp, graphs]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Lock Puzzle,1500.0,C,1519574700,"[constructive algorithms, implementation]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,World of Tank,2000.0,D,1519574700,"[dp, greedy]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Iqea,2500.0,E,1519574700,"[data structures, dfs and similar, divide and conquer, dsu, shortest paths, trees]",PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Olympiad,500.0,A,1519574700,[implementation],PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Vile Grasshoppers,1000.0,B,1519574700,[math],PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Save Energy!,1500.0,C,1519574700,[math],PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Sleepy Game,2000.0,D,1519574700,"[dfs and similar, graphs]",PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Lock Puzzle,2500.0,E,1519574700,[constructive algorithms],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Login Verification,500.0,A,1519486500,[],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Chat,1250.0,B,1519486500,[],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Dependency management,2000.0,C,1519486500,[],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Autocompletion,2250.0,D,1519486500,[],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Points on the line,500.0,A,1519464900,[brute force],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Our Tanya is Crying Out Loud,1250.0,B,1519464900,[greedy],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Phone Numbers,1250.0,C,1519464900,[constructive algorithms],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Alena And The Heater,1500.0,D,1519464900,[implementation],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Cashback,2000.0,E,1519464900,"[data structures, dp, greedy, math]",PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Machine Learning,2750.0,F,1519464900,"[brute force, data structures]",PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and his Company,500.0,A,1519058100,[brute force],PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and the Gates,750.0,B,1519058100,[implementation],PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fifa and Fafa,1250.0,C,1519058100,[geometry],PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Alphabet,1750.0,D,1519058100,"[math, probabilities]",PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Mathematics,2250.0,E,1519058100,"[dp, trees]",PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and Array,2750.0,F,1519058100,[data structures],PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Love Triangle,500.0,A,1518861900,[],PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Hamster Farm,1000.0,B,1518861900,[implementation],PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Convenient For Everybody,1500.0,C,1518861900,"[binary search, two pointers]",PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Love Rescue,2000.0,D,1518861900,"[dsu, greedy]",PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Maximize!,2500.0,E,1518861900,"[binary search, greedy, ternary search, two pointers]",PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Cutlet,2750.0,F,1518861900,"[data structures, dp]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Word Correction,,A,1518793500,[implementation],PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Run For Your Prize,,B,1518793500,"[brute force, greedy]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Constructing Tests,,C,1518793500,"[binary search, brute force]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Buy a Ticket,,D,1518793500,"[data structures, graphs, shortest paths]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Max History,,E,1518793500,"[combinatorics, math]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Erasing Substrings,,F,1518793500,"[bitmasks, dp, greedy]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Shortest Path Queries,,G,1518793500,"[bitmasks, data structures, dsu, graphs]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindromic Supersequence,500.0,A,1518705300,[constructive algorithms],PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Recursive Queries,1000.0,B,1518705300,"[data structures, dfs and similar]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Permutation Cycle,1500.0,C,1518705300,"[brute force, constructive algorithms]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Tree,2000.0,D,1518705300,"[binary search, dp, trees]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Team Work,2500.0,E,1518705300,"[combinatorics, dp]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Escape Through Leaf,2500.0,F,1518705300,"[data structures, dp, geometry]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindrome Partition,3000.0,G,1518705300,"[dp, string suffix structures, strings]",PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Twisty Movement,500.0,A,1518609900,[dp],PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Determined Cleanup,750.0,B,1518609900,[math],PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Colourful Prospect,1500.0,C,1518609900,[geometry],PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Creative Cutout,2250.0,D,1518609900,"[brute force, combinatorics, math]",PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Preponderant Reunion,2500.0,E,1518609900,"[constructive algorithms, dp]",PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Compatible Pair,500.0,A,1518609900,"[brute force, games]",PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Prosperous Lot,1000.0,B,1518609900,[implementation],PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Twisty Movement,1500.0,C,1518609900,"[brute force, dp, implementation]",PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Determined Cleanup,2000.0,D,1518609900,[math],PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Colourful Prospect,2500.0,E,1518609900,[],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Cloning Toys,500.0,A,1518023700,[implementation],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Magic Forest,1000.0,B,1518023700,[brute force],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Cave Painting,1250.0,C,1518023700,"[brute force, number theory]",PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Robot Vacuum Cleaner,1500.0,D,1518023700,"[greedy, sortings]",PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Birds,2000.0,E,1518023700,[dp],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Divisibility,2750.0,F,1518023700,"[constructive algorithms, dp, greedy, number theory]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Water The Garden,,A,1517582100,[implementation],PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tea Queue,,B,1517582100,[implementation],PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Swap Adjacent Elements,,C,1517582100,"[dfs and similar, greedy, sortings, two pointers]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tanks,,D,1517582100,"[dp, greedy, implementation]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Connected Components?,,E,1517582100,"[data structures, dfs and similar, dsu, graphs]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,SUM and REPLACE,,F,1517582100,"[brute force, data structures, number theory]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,List Of Integers,,G,1517582100,"[binary search, bitmasks, brute force, combinatorics, math, number theory]",PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-1,,01,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-2,,02,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-3,,03,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-4,,04,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-5,,05,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-6,,06,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-7,,07,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-8,,08,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-9,,09,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-10,,10,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-11,,11,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-12,,12,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-13,,13,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-14,,14,1517500800,[],PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Supermarket,500.0,A,1517403900,[greedy],PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Perfect Number,750.0,B,1517403900,"[binary search, brute force, dp, implementation, number theory]",PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Seat Arrangements,1000.0,C,1517403900,[implementation],PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Substring,1500.0,D,1517403900,"[dfs and similar, dp, graphs]",PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Congruence Equation,2000.0,E,1517403900,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,A Game With Numbers,2500.0,F,1517403900,"[games, graphs, shortest paths]",PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,The Monster,500.0,A,1517236500,[greedy],PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,MADMAX,750.0,B,1517236500,"[dp, games, graphs]",PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,Pollywog,1500.0,C,1517236500,[dp],PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,Stranger Trees,2000.0,D,1517236500,"[dp, math, matrices, trees]",PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,Upside Down,2750.0,E,1517236500,"[data structures, string suffix structures, strings, trees]",PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,Eleven,500.0,A,1517236500,[implementation],PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,Radio Station,1000.0,B,1517236500,[implementation],PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,The Monster,1500.0,C,1517236500,"[data structures, greedy]",PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,MADMAX,1750.0,D,1517236500,"[dfs and similar, dp, games]",PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,Pollywog,2500.0,E,1517236500,[],PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Perfect Squares,500.0,A,1516462500,"[implementation, math]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Conan and Agasa play a Card Game,1000.0,B,1516462500,"[games, greedy]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Travelling Salesman and Special Numbers,1500.0,C,1516462500,"[brute force, combinatorics, dp]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Bash and a Tough Math Puzzle,2000.0,D,1516462500,"[data structures, number theory]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Palindromes in a Tree,2500.0,E,1516462500,"[bitmasks, divide and conquer, trees]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Substrings in a String,3000.0,F,1516462500,"[bitmasks, brute force, string suffix structures, strings]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Sum the Fibonacci,3500.0,G,1516462500,"[bitmasks, divide and conquer]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Ember and Storm's Tree Game,3750.0,H,1516462500,"[combinatorics, dp, games, trees]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Alarm Snooze,500.0,A,1516372500,"[brute force, implementation]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Binary Sequence (changed after round),1000.0,B,1516372500,"[bitmasks, greedy]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Interesting Graph,1500.0,C,1516372500,"[constructive algorithms, graphs, shortest paths]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and To-do List,2250.0,D,1516372500,"[data structures, trees]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Tree,2500.0,E,1516372500,"[data structures, trees]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Garden,,A,1515848700,[implementation],PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Browser,,B,1515848700,[implementation],PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Permute Digits,,C,1515848700,"[dp, greedy]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Almost Acyclic Graph,,D,1515848700,"[dfs and similar, graphs]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Physical Education Lessons,,E,1515848700,"[data structures, implementation, sortings]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Imbalance Value of a Tree,,F,1515848700,"[data structures, dsu, graphs, trees]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Coprime Arrays,,G,1515848700,"[math, number theory]",PROGRAMMING
+913,Hello 2018,12,Modular Exponentiation,500.0,A,1515422700,"[implementation, math]",PROGRAMMING
+913,Hello 2018,12,Christmas Spruce,750.0,B,1515422700,"[implementation, trees]",PROGRAMMING
+913,Hello 2018,12,Party Lemonade,1000.0,C,1515422700,"[bitmasks, dp, greedy]",PROGRAMMING
+913,Hello 2018,12,Too Easy Problems,1250.0,D,1515422700,"[binary search, brute force, data structures, greedy, sortings]",PROGRAMMING
+913,Hello 2018,12,Logical Expression,1750.0,E,1515422700,"[bitmasks, dp, shortest paths]",PROGRAMMING
+913,Hello 2018,12,Strongly Connected Tournament,2250.0,F,1515422700,"[dp, graphs, probabilities]",PROGRAMMING
+913,Hello 2018,12,Power Substring,3000.0,G,1515422700,"[math, number theory]",PROGRAMMING
+913,Hello 2018,12,Don't Exceed,3500.0,H,1515422700,"[math, probabilities]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,Tricky Alchemy,500.0,A,1515162900,[implementation],PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,New Year's Eve,1000.0,B,1515162900,"[bitmasks, constructive algorithms]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,"Perun, Ult!",1750.0,C,1515162900,"[brute force, greedy, sortings]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,Fishes,2000.0,D,1515162900,"[data structures, probabilities]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,Prime Gift,2500.0,E,1515162900,"[binary search, dfs and similar, math, meet-in-the-middle, number theory, two pointers]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Counting Cards,500.0,A,1514562000,[implementation],PROGRAMMING
+908,Good Bye 2017,12,New Year and Buggy Bot,750.0,B,1514562000,"[brute force, implementation]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Curling,1000.0,C,1514562000,"[brute force, geometry, implementation, math]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Arbitrary Arrangement,1750.0,D,1514562000,"[dp, math, probabilities]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Entity Enumeration,1750.0,E,1514562000,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Rainbow Roads,2000.0,F,1514562000,"[graphs, greedy, implementation]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Original Order,2750.0,G,1514562000,"[dp, math]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Boolean Bridges,3500.0,H,1514562000,[],PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Nearest Minimums,,A,1514469900,[implementation],PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Two Cakes,,B,1514469900,"[binary search, brute force, implementation]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Three Garlands,,C,1514469900,"[brute force, constructive algorithms]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Inversion Counting,,D,1514469900,"[brute force, math]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Stack Sorting,,E,1514469900,"[data structures, implementation]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Tree Destruction,,F,1514469900,"[constructive algorithms, dfs and similar, graphs, greedy, trees]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Mass Change Queries,,G,1514469900,[data structures],PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Generate Login,500.0,A,1514392500,"[brute force, greedy, sortings]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Segments,1000.0,B,1514392500,"[constructive algorithms, math]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Python Indentation,1500.0,C,1514392500,[dp],PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Colorful Points,1750.0,D,1514392500,"[data structures, greedy, implementation]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Coprocessor,2000.0,E,1514392500,"[dfs and similar, dp, graphs, greedy]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,AND-permutations,2500.0,F,1514392500,[constructive algorithms],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Masha and Bears,500.0,A,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Tic-Tac-Toe,1000.0,B,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Shockers,1500.0,C,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Seating of Students,2250.0,D,1514037900,[constructive algorithms],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Party,2250.0,E,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Power Tower,3000.0,F,1514037900,[],PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Shockers,500.0,A,1514037900,[implementation],PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Seating of Students,1250.0,B,1514037900,"[brute force, constructive algorithms, math]",PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Party,1250.0,C,1514037900,"[bitmasks, brute force, dp, graphs]",PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Power Tower,2000.0,D,1514037900,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Reverses,2500.0,E,1514037900,"[dp, string suffix structures, strings]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Masha and Bears,500.0,A,1514037900,"[brute force, implementation]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Tic-Tac-Toe,1000.0,B,1514037900,[implementation],PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Shockers,1500.0,C,1514037900,"[bitmasks, implementation]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Seating of Students,2250.0,D,1514037900,[],PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Party,2250.0,E,1514037900,"[bitmasks, dp]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Power Tower,3000.0,F,1514037900,[],PROGRAMMING
+910,Testing Round #14 (Unrated),12,The Way to Home,500.0,A,1513940700,"[dfs and similar, dp, greedy]",PROGRAMMING
+910,Testing Round #14 (Unrated),12,Door Frames,1000.0,B,1513940700,"[greedy, implementation]",PROGRAMMING
+910,Testing Round #14 (Unrated),12,Minimum Sum,1500.0,C,1513940700,[greedy],PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Hashing Trees,500.0,A,1513697700,"[constructive algorithms, trees]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,GCD of Polynomials,1000.0,B,1513697700,"[constructive algorithms, math]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Bipartite Segments,1750.0,C,1513697700,"[binary search, data structures, dfs and similar, dsu, graphs, two pointers]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Weighting a Tree,2000.0,D,1513697700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Cyclic Cipher,2500.0,E,1513697700,[fft],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Visiting a Friend,500.0,A,1513697700,[implementation],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Coloring a Tree,1000.0,B,1513697700,"[dfs and similar, dsu]",PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Hashing Trees,1500.0,C,1513697700,[],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,GCD of Polynomials,2000.0,D,1513697700,[math],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Bipartite Segments,2750.0,E,1513697700,"[data structures, dfs and similar]",PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Splitting in Teams,500.0,A,1513492500,[greedy],PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Months and Years,1000.0,B,1513492500,[implementation],PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Dividing the numbers,1500.0,C,1513492500,"[constructive algorithms, graphs]",PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Shovel Sale,1750.0,D,1513492500,[math],PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Segments Removal,2250.0,E,1513492500,"[data structures, dsu, flows, two pointers]",PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Letters Removing,2500.0,F,1513492500,[data structures],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Rounding,500.0,A,1513424100,[implementation],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Proper Nutrition,750.0,B,1513424100,"[brute force, number theory]",PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Phone Numbers,1500.0,C,1513424100,"[implementation, strings]",PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Alarm Clock,1750.0,D,1513424100,[greedy],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Squares and not squares,2000.0,E,1513424100,[greedy],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Restoring the Expression,2500.0,F,1513424100,"[brute force, hashing, math]",PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Hungry Student Problem,,A,1513091100,[greedy],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,The Modcrab,,B,1513091100,[greedy],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Boxes Packing,,C,1513091100,[greedy],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Almost Difference,,D,1513091100,[math],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Swapping Characters,,E,1513091100,"[hashing, implementation, strings]",PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Clear The Matrix,,F,1513091100,"[bitmasks, dp]",PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Yet Another Maxflow Problem,,G,1513091100,"[data structures, flows]",PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Find Extra One,500.0,A,1513008300,[implementation],PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Position in Fraction,1000.0,B,1513008300,[math],PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Remove Extra One,1500.0,C,1513008300,"[brute force, data structures]",PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Unusual Sequences,2000.0,D,1513008300,"[bitmasks, combinatorics, dp, math, number theory]",PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Maximum Questions,2500.0,E,1513008300,"[data structures, dp, strings]",PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,Nephren gives a riddle,500.0,A,1512223500,[dfs and similar],PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,Ithea Plays With Chtholly,1000.0,B,1512223500,"[games, greedy]",PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,"Willem, Chtholly and Seniorious",1500.0,C,1512223500,[probabilities],PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,Nephren Runs a Cinema,2000.0,D,1512223500,"[chinese remainder theorem, combinatorics, math, number theory]",PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,"Welcome home, Chtholly",2500.0,E,1512223500,"[data structures, dsu]",PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Scarborough Fair,500.0,A,1512223500,[implementation],PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Chtholly's request,1000.0,B,1512223500,[brute force],PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Nephren gives a riddle,1500.0,C,1512223500,"[combinatorics, math]",PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Ithea Plays With Chtholly,2000.0,D,1512223500,[implementation],PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,"Willem, Chtholly and Seniorious",2500.0,E,1512223500,[],PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,Pizza Separation,500.0,A,1511712300,[brute force],PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,XK Segments,1000.0,B,1511712300,"[binary search, sortings, two pointers]",PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,Square Subsets,1750.0,C,1511712300,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,String Mark,2000.0,D,1511712300,"[combinatorics, math, strings]",PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,Eyes Closed,2250.0,E,1511712300,"[data structures, probabilities]",PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Chess For Three,,A,1511449500,[implementation],PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Beautiful Divisors,,B,1511449500,[brute force],PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Rumor,,C,1511449500,[dfs and similar],PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Credit Card,,D,1511449500,"[data structures, dp, greedy, implementation]",PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Counting Arrays,,E,1511449500,"[combinatorics, dp, number theory]",PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Subtree Minimum Query,,F,1511449500,"[data structures, trees]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,QAQ,500.0,A,1511099700,"[brute force, dp]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Ralph And His Magic Field,1000.0,B,1511099700,"[combinatorics, math, number theory]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Marco and GCD Sequence,1500.0,C,1511099700,"[constructive algorithms, math]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Ralph And His Tour in Binary Country,2000.0,D,1511099700,"[data structures, trees]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Ralph and Mushrooms,2500.0,E,1511099700,"[dp, graphs]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Pride,500.0,A,1510929300,"[brute force, dp, greedy, math, number theory]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Gluttony,1000.0,B,1510929300,[constructive algorithms],PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Envy,1500.0,C,1510929300,"[data structures, dsu, graphs]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Sloth,2000.0,D,1510929300,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Lust,2500.0,E,1510929300,"[combinatorics, math]",PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Greed,500.0,A,1510929300,[implementation],PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Wrath,1000.0,B,1510929300,"[implementation, two pointers]",PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Pride,1500.0,C,1510929300,[greedy],PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Gluttony,2000.0,D,1510929300,"[constructive algorithms, greedy]",PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Envy,2500.0,E,1510929300,[],PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,ACM ICPC,500.0,A,1510502700,[brute force],PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Vlad and Cafes,1000.0,B,1510502700,[],PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Petya and Catacombs,1500.0,C,1510502700,"[dsu, greedy]",PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Restoration of string,2000.0,D,1510502700,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Maximum Element,2500.0,E,1510502700,"[combinatorics, dp]",PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Symmetric Projections,3000.0,F,1510502700,[geometry],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Petya and Catacombs,500.0,A,1510502700,[greedy],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Restoration of string,1000.0,B,1510502700,"[dsu, graphs, strings]",PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Maximum Element,1500.0,C,1510502700,[dp],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Symmetric Projections,2000.0,D,1510502700,[geometry],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Mod Mod Mod,2250.0,E,1510502700,"[binary search, dp, math]",PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,ACM ICPC,500.0,A,1510502700,[],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Vlad and Cafes,1000.0,B,1510502700,[],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Petya and Catacombs,1500.0,C,1510502700,[greedy],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Restoration of string,2000.0,D,1510502700,"[graphs, greedy, strings]",PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Maximum Element,2500.0,E,1510502700,[dp],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Symmetric Projections,3000.0,F,1510502700,[],PROGRAMMING
+888,Educational Codeforces Round 32,12,Local Extrema,,A,1510239900,"[brute force, implementation]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Buggy Robot,,B,1510239900,"[dp, greedy]",PROGRAMMING
+888,Educational Codeforces Round 32,12,K-Dominant Character,,C,1510239900,"[binary search, implementation, two pointers]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Almost Identity Permutations,,D,1510239900,"[combinatorics, dp, math]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Maximum Subsequence,,E,1510239900,"[bitmasks, divide and conquer, meet-in-the-middle]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Connecting Vertices,,F,1510239900,[dp],PROGRAMMING
+888,Educational Codeforces Round 32,12,Xor-MST,,G,1510239900,"[bitmasks, constructive algorithms, data structures]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Div. 64,500.0,A,1509725100,[implementation],PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Cubes for Masha,1000.0,B,1509725100,[brute force],PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Solution for Cube,1500.0,C,1509725100,"[brute force, implementation]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Ratings and Reality Shows,2000.0,D,1509725100,"[data structures, two pointers]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Little Brother,2500.0,E,1509725100,"[binary search, geometry]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Row of Models,3000.0,F,1509725100,"[greedy, sortings]",PROGRAMMING
+884,Educational Codeforces Round 31,12,Book Reading,,A,1509113100,[implementation],PROGRAMMING
+884,Educational Codeforces Round 31,12,Japanese Crosswords Strike Back,,B,1509113100,[implementation],PROGRAMMING
+884,Educational Codeforces Round 31,12,Bertown Subway,,C,1509113100,"[dfs and similar, greedy, math]",PROGRAMMING
+884,Educational Codeforces Round 31,12,Boxes And Balls,,D,1509113100,"[data structures, greedy]",PROGRAMMING
+884,Educational Codeforces Round 31,12,Binary Matrix,,E,1509113100,[dsu],PROGRAMMING
+884,Educational Codeforces Round 31,12,Anti-Palindromize,,F,1509113100,"[flows, graphs, greedy]",PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Short Program,500.0,A,1509029100,"[bitmasks, constructive algorithms]",PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Teams Formation,1250.0,B,1509029100,[implementation],PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Tournament,1250.0,C,1509029100,"[data structures, graphs]",PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Magic Breeding,2000.0,D,1509029100,[],PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Numbers on the blackboard,2500.0,E,1509029100,"[combinatorics, dp]",PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Borya's Diagnosis,500.0,A,1509029100,[implementation],PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Table Tennis,1000.0,B,1509029100,[implementation],PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Short Program,1500.0,C,1509029100,"[bitmasks, constructive algorithms, graph matchings]",PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Teams Formation,2250.0,D,1509029100,[],PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Tournament,2250.0,E,1509029100,[],PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Alex and broken contest,500.0,A,1508773500,"[implementation, strings]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Nikita and string,1000.0,B,1508773500,"[brute force, dp]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Slava and tanks,1500.0,C,1508773500,[constructive algorithms],PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Olya and Energy Drinks,2000.0,D,1508773500,"[data structures, dfs and similar, shortest paths]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Danil and a Part-time Job,2250.0,E,1508773500,"[bitmasks, data structures, trees]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Ann and Books,2750.0,F,1508773500,"[data structures, flows, hashing]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Automatic Door,,A,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Army,,B,1508573100,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Downloading B++,,C,1508573100,[binary search],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen Strike Back,,D,1508573100,"[binary search, dp]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Field of Wonders,,E,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lost in Transliteration,,F,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Orientation of Edges,,G,1508573100,[graphs],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Palindromic Cut,,H,1508573100,"[brute force, implementation]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Photo Processing,,I,1508573100,"[binary search, dp]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Renovation,,J,1508573100,"[greedy, sortings]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Road Widening,,K,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland.Taxi,,L,1508573100,[data structures],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Quadcopter Competition,,M,1508573100,[greedy],PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Classroom Watch,500.0,A,1508151900,[brute force],PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Sorting the Coins,1000.0,B,1508151900,"[dsu, sortings, two pointers]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,National Property,1500.0,C,1508151900,"[2-sat, dfs and similar, graphs, implementation]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,High Cry,1750.0,D,1508151900,"[binary search, bitmasks, data structures, divide and conquer]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Delivery Club,2000.0,E,1508151900,"[binary search, data structures, dp]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Royal Questions,2500.0,F,1508151900,"[dsu, greedy]",PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Trip For Meal,500.0,A,1508151900,[math],PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Divisiblity of Differences,1000.0,B,1508151900,[math],PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Classroom Watch,1500.0,C,1508151900,[brute force],PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Sorting the Coins,2000.0,D,1508151900,"[dsu, sortings, trees, two pointers]",PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,National Property,2500.0,E,1508151900,"[2-sat, dfs and similar, graphs]",PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,High Cry,2750.0,F,1508151900,[data structures],PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Search for Pretty Integers,500.0,A,1508054700,[brute force],PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Maximum of Maximums of Minimums,1000.0,B,1508054700,[greedy],PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Maximum splitting,1500.0,C,1508054700,"[dp, greedy, number theory]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Something with XOR Queries,2250.0,D,1508054700,"[brute force, probabilities]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,"Points, Lines and Ready-made Titles",2500.0,E,1508054700,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Paths,3250.0,F,1508054700,"[data structures, number theory]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Maximum splitting,500.0,A,1508054700,"[dp, greedy, math, number theory]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Something with XOR Queries,1250.0,B,1508054700,"[brute force, implementation]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,"Points, Lines and Ready-made Titles",1500.0,C,1508054700,"[dfs and similar, graphs]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Paths,2250.0,D,1508054700,"[number theory, sortings]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Restore the Tree,2250.0,E,1508054700,"[graphs, greedy, trees]",PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Search for Pretty Integers,500.0,A,1508054700,[implementation],PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum of Maximums of Minimums,1000.0,B,1508054700,[implementation],PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum splitting,1500.0,C,1508054700,"[greedy, math, number theory]",PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Something with XOR Queries,2250.0,D,1508054700,"[brute force, implementation]",PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,"Points, Lines and Ready-made Titles",2500.0,E,1508054700,[],PROGRAMMING
+873,Educational Codeforces Round 30,12,Chores,,A,1507817100,[implementation],PROGRAMMING
+873,Educational Codeforces Round 30,12,Balanced Substring,,B,1507817100,"[dp, implementation]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Strange Game On Matrix,,C,1507817100,"[greedy, two pointers]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Merge Sort,,D,1507817100,"[constructive algorithms, divide and conquer]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Awards For Contestants,,E,1507817100,"[brute force, data structures, dp]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Forbidden Indices,,F,1507817100,"[dsu, string suffix structures, strings]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Artful Expedient,500.0,A,1507296900,"[brute force, implementation]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Eternal Immortality,1000.0,B,1507296900,[math],PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Intriguing Obsession,1500.0,C,1507296900,"[combinatorics, dp, math]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Overdosing Ubiquity,2250.0,D,1507296900,"[brute force, dfs and similar, graphs]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Untended Antiquity,2500.0,E,1507296900,"[data structures, hashing]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Bark to Unlock,250.0,A,1507187100,"[brute force, strings]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Race Against Time,500.0,B,1507187100,[implementation],PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Qualification Rounds,1000.0,C,1507187100,"[bitmasks, brute force, constructive algorithms, dp]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Huge Strings,1500.0,D,1507187100,"[bitmasks, brute force, dp, strings]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Policeman and a Tree,2250.0,E,1507187100,"[dp, graphs, trees]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Yet Another Minimization Problem,2500.0,F,1507187100,"[divide and conquer, dp]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,El Toll Caves,3500.0,G,1507187100,[math],PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Save the problem!,500.0,A,1506791100,[constructive algorithms],PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Ordering Pizza,1000.0,B,1506791100,"[binary search, sortings, ternary search]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Gotta Go Fast,1500.0,C,1506791100,"[binary search, dp]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Buy Low Sell High,2000.0,D,1506791100,"[constructive algorithms, data structures, greedy]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Hex Dyslexia,2500.0,E,1506791100,"[bitmasks, brute force, dp, graphs]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Egg Roulette,3000.0,F,1506791100,"[bitmasks, brute force, divide and conquer, math, meet-in-the-middle]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Flowers and Chocolate,3500.0,G,1506791100,"[combinatorics, math, matrices]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Save the problem!,500.0,A,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Ordering Pizza,1000.0,B,1506791100,"[greedy, implementation, sortings]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Gotta Go Fast,1500.0,C,1506791100,"[binary search, dp, probabilities]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Buy Low Sell High,2000.0,D,1506791100,"[data structures, greedy, two pointers]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Hex Dyslexia,2500.0,E,1506791100,[],PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Egg Roulette,3000.0,F,1506791100,[],PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Flowers and Chocolate,3500.0,G,1506791100,[math],PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Between the Offices,500.0,A,1506791100,[implementation],PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Save the problem!,1000.0,B,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Ordering Pizza,1500.0,C,1506791100,"[greedy, implementation, sortings, ternary search]",PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Gotta Go Fast,2000.0,D,1506791100,[],PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Buy Low Sell High,2500.0,E,1506791100,"[data structures, greedy]",PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Hex Dyslexia,3000.0,F,1506791100,[],PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Fair Game,500.0,A,1506335700,"[implementation, sortings]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Polycarp and Letters,1000.0,B,1506335700,"[brute force, implementation]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Bus,1500.0,C,1506335700,"[greedy, implementation]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Make a Permutation!,2000.0,D,1506335700,"[greedy, implementation]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Fire,2500.0,E,1506335700,"[dp, sortings]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Cities Excursions,3000.0,F,1506335700,[dfs and similar],PROGRAMMING
+855,"Manthan, Codefest 17",12,Tom Riddle's Diary,500.0,A,1506263700,[implementation],PROGRAMMING
+855,"Manthan, Codefest 17",12,Marvolo Gaunt's Ring,1000.0,B,1506263700,"[data structures, dp]",PROGRAMMING
+855,"Manthan, Codefest 17",12,Helga Hufflepuff's Cup,1500.0,C,1506263700,"[dp, trees]",PROGRAMMING
+855,"Manthan, Codefest 17",12,Rowena Ravenclaw's Diadem,2000.0,D,1506263700,[trees],PROGRAMMING
+855,"Manthan, Codefest 17",12,Salazar Slytherin's Locket,2500.0,E,1506263700,"[bitmasks, dp]",PROGRAMMING
+855,"Manthan, Codefest 17",12,Nagini,3000.0,F,1506263700,[data structures],PROGRAMMING
+855,"Manthan, Codefest 17",12,Harry Vs Voldemort,3500.0,G,1506263700,"[dp, graphs, trees]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Quasi-palindrome,,A,1506006300,"[brute force, implementation]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Kayaking,,B,1506006300,"[brute force, greedy, sortings]",PROGRAMMING
+863,Educational Codeforces Round 29,12,1-2-3,,C,1506006300,"[graphs, implementation]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Yet Another Array Queries Problem,,D,1506006300,"[data structures, implementation]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Turn Off The TV,,E,1506006300,"[data structures, sortings]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Almost Permutation,,F,1506006300,[flows],PROGRAMMING
+863,Educational Codeforces Round 29,12,Graphic Settings,,G,1506006300,[],PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the MEX,500.0,A,1505833500,[implementation],PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the bipartiteness,1000.0,B,1505833500,"[dfs and similar, graphs]",PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the xor,1500.0,C,1505833500,[constructive algorithms],PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the binary string,1750.0,D,1505833500,"[binary search, divide and conquer]",PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the function,2000.0,E,1505833500,"[binary search, data structures]",PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the final stage,2750.0,F,1505833500,"[data structures, strings]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Union of Doubly Linked Lists,,A,1505739900,[implementation],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Preparing for Merge Sort,,B,1505739900,[binary search],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Sum of Nestings,,C,1505739900,[],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Dog Show,,D,1505739900,"[data structures, greedy]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen,,E,1505739900,[binary search],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Elections,,F,1505739900,[greedy],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,University Classes,,G,1505739900,[implementation],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Load Testing,,H,1505739900,[],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Noise Level,,I,1505739900,[dfs and similar],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Students Initiation,,J,1505739900,"[binary search, flows]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Travel Cards,,K,1505739900,[sortings],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland SU Computer Network,,L,1505739900,"[dfs and similar, hashing, trees]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Weather Tomorrow,,M,1505739900,[implementation],PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,k-rounding,750.0,A,1505653500,"[brute force, number theory]",PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Which floor?,750.0,B,1505653500,[brute force],PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Did you mean...,1500.0,C,1505653500,"[dp, greedy, implementation]",PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Polycarp's phone book,2000.0,D,1505653500,"[data structures, sortings]",PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Tests Renumeration,2500.0,E,1505653500,[implementation],PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Wizard's Tour,3000.0,F,1505653500,"[constructive algorithms, dfs and similar]",PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Did you mean...,500.0,A,1505653500,[greedy],PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Polycarp's phone book,1000.0,B,1505653500,"[brute force, data structures, hashing, strings]",PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Tests Renumeration,1500.0,C,1505653500,[greedy],PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Wizard's Tour,2000.0,D,1505653500,"[dfs and similar, graphs, greedy]",PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Arkady and a Nobody-men,2250.0,E,1505653500,"[data structures, dfs and similar, trees]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,k-rounding,750.0,A,1505653500,"[math, number theory]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Which floor?,750.0,B,1505653500,[brute force],PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Did you mean...,1500.0,C,1505653500,"[brute force, strings]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Polycarp's phone book,2000.0,D,1505653500,"[brute force, data structures, strings]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Tests Renumeration,2500.0,E,1505653500,[],PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Wizard's Tour,3000.0,F,1505653500,[dfs and similar],PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Declined Finalists,500.0,A,1505583300,[greedy],PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Lazy Security Guard,750.0,B,1505583300,"[brute force, math]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Pie Rules,1000.0,C,1505583300,"[dp, games]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Third Month Insanity,1500.0,D,1505583300,"[dp, probabilities]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Desk Disorder,2000.0,E,1505583300,"[combinatorics, dfs and similar, dsu, graphs, trees]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Ordering T-Shirts,2750.0,F,1505583300,[greedy],PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Circle of Numbers,3000.0,G,1505583300,[math],PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Set Theory,,A,1505050500,"[brute force, constructive algorithms]",PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Similar Words,,B,1505050500,"[dp, strings]",PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Eleventh Birthday,,C,1505050500,"[combinatorics, dp, math]",PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Masha and Cactus,,D,1505050500,[],PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Satellites,,E,1505050500,[],PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,To Play or not to Play,,F,1505050500,[],PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Planning,750.0,A,1504702500,[greedy],PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Jury Meeting,750.0,B,1504702500,"[greedy, sortings, two pointers]",PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Boredom,1750.0,C,1504702500,[data structures],PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Michael and Charging Stations,1750.0,D,1504702500,"[binary search, dp]",PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Lada Malina,2500.0,E,1504702500,"[data structures, geometry]",PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Fraction,500.0,A,1504702500,"[brute force, constructive algorithms, math]",PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Maxim Buys an Apartment,1000.0,B,1504702500,[constructive algorithms],PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Planning,1750.0,C,1504702500,[],PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Jury Meeting,1750.0,D,1504702500,[greedy],PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Boredom,2500.0,E,1504702500,[data structures],PROGRAMMING
+846,Educational Codeforces Round 28,12,Curriculum Vitae,,A,1504623900,[brute force],PROGRAMMING
+846,Educational Codeforces Round 28,12,Math Show,,B,1504623900,"[brute force, greedy]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Four Segments,,C,1504623900,"[brute force, dp]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Monitor,,D,1504623900,"[binary search, data structures]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Chemistry in Berland,,E,1504623900,"[dfs and similar, greedy, trees]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Random Query,,F,1504623900,"[math, two pointers]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Five Dimensional Points,500.0,A,1504535700,"[brute force, geometry, math]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a list of numbers,1000.0,B,1504535700,[number theory],PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a game with Mojtaba,1250.0,C,1504535700,"[bitmasks, dp, games]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Tournament Construction,1750.0,D,1504535700,"[dp, graphs, greedy, math]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Random Elections,2000.0,E,1504535700,"[bitmasks, brute force, fft, math]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Rainbow Balls,2500.0,F,1504535700,[math],PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a research in Mexican wave,500.0,A,1504535700,[implementation],PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and an exam about geometry,1000.0,B,1504535700,"[geometry, math]",PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Five Dimensional Points,1500.0,C,1504535700,"[brute force, math]",PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a list of numbers,2000.0,D,1504535700,[],PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a game with Mojtaba,2500.0,E,1504535700,"[bitmasks, games]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Digits,,A,1504432800,"[brute force, implementation, math]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Neural Network country,,B,1504432800,"[dp, matrices]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Property,,C,1504432800,"[greedy, sortings]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Exploration plan,,D,1504432800,"[binary search, flows, graph matchings, shortest paths]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Casinos and travel,,E,1504432800,[dp],PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Product transformation,,F,1504432800,"[combinatorics, math, number theory]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Bathroom terminal,,G,1504432800,[implementation],PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Bob and stages,,H,1504432800,"[dp, geometry]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Dating,,I,1504432800,"[brute force, dfs and similar, graphs, trees]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,From Y to Y,500.0,A,1504272900,[constructive algorithms],PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Rooter's Song,1000.0,B,1504272900,"[constructive algorithms, data structures, geometry, implementation, sortings, two pointers]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Goodbye Souvenir,1750.0,C,1504272900,"[data structures, divide and conquer]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Shake It!,1750.0,D,1504272900,"[combinatorics, dp, flows, graphs]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Days of Floral Colours,2500.0,E,1504272900,"[combinatorics, dp, fft, math]",PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Odds and Ends,500.0,A,1504272900,[implementation],PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Tell Your World,1000.0,B,1504272900,"[brute force, geometry]",PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,From Y to Y,1500.0,C,1504272900,[constructive algorithms],PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Rooter's Song,2000.0,D,1504272900,[],PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Goodbye Souvenir,2500.0,E,1504272900,[data structures],PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Kirill And The Game,500.0,A,1504019100,"[brute force, two pointers]",PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Gleb And Pizza,1000.0,B,1504019100,[geometry],PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Ilya And The Tree,1500.0,C,1504019100,"[dfs and similar, math, trees]",PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Vitya and Strange Lesson,2000.0,D,1504019100,"[binary search, data structures]",PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Nikita and game,2500.0,E,1504019100,"[binary search, dfs and similar, divide and conquer, trees]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Sorting by Subsequences,500.0,A,1503592500,"[dfs and similar, dsu, implementation, sortings]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Interactive LowerBound,1000.0,B,1503592500,"[brute force, probabilities]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Upgrading Tree,1750.0,C,1503592500,"[constructive algorithms, dfs and similar, math]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Dynamic Shortest Path,2250.0,D,1503592500,"[graphs, shortest paths]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Maximum Flow,2250.0,E,1503592500,[flows],PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Diversity,500.0,A,1503592500,[implementation],PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Rectangles,1000.0,B,1503592500,"[combinatorics, math]",PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Sorting by Subsequences,1500.0,C,1503592500,[dfs and similar],PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Interactive LowerBound,2000.0,D,1503592500,"[brute force, probabilities]",PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Upgrading Tree,3000.0,E,1503592500,[],PROGRAMMING
+845,Educational Codeforces Round 27,12,Chess Tourney,,A,1503327900,[sortings],PROGRAMMING
+845,Educational Codeforces Round 27,12,Luba And The Ticket,,B,1503327900,"[brute force, greedy]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Two TVs,,C,1503327900,"[data structures, greedy, sortings]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Driving Test,,D,1503327900,"[data structures, dp, greedy]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Fire in the City,,E,1503327900,"[binary search, data structures]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Guards In The Storehouse,,F,1503327900,[dp],PROGRAMMING
+845,Educational Codeforces Round 27,12,Shortest Path Problem?,,G,1503327900,"[dfs and similar, math]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,Leha and Function,500.0,A,1503068700,"[combinatorics, greedy, math, number theory, sortings]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,Leha and another game about graph,1000.0,B,1503068700,"[constructive algorithms, data structures, dfs and similar, dp, graphs]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,On the Bench,1500.0,C,1503068700,"[combinatorics, dp]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,Destiny,2000.0,D,1503068700,"[data structures, probabilities]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,In a Trap,2500.0,E,1503068700,[trees],PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Generous Kefa,500.0,A,1503068700,"[brute force, implementation]",PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Godsend,1000.0,B,1503068700,"[games, math]",PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Leha and Function,1500.0,C,1503068700,[greedy],PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Leha and another game about graph,2000.0,D,1503068700,"[dfs and similar, graphs]",PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,On the Bench,2500.0,E,1503068700,[],PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Arya and Bran,500.0,A,1502548500,[implementation],PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Game of the Rows,1000.0,B,1502548500,"[brute force, greedy, implementation]",PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Journey,1500.0,C,1502548500,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Winter is here,2000.0,D,1502548500,"[combinatorics, dp, math, number theory]",PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Mother of Dragons,2500.0,E,1502548500,"[brute force, graphs, math, meet-in-the-middle]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Binary Blocks,,A,1502085900,[brute force],PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Diverging Directions,,B,1502085900,"[data structures, dfs and similar, trees]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Future Failure,,C,1502085900,"[dp, games]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Airplane Arrangements,,D,1502085900,"[math, number theory]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Convex Countour,,E,1502085900,[dp],PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Expected Earnings,,F,1502085900,[],PROGRAMMING
+837,Educational Codeforces Round 26,12,Text Volume,,A,1501773300,[implementation],PROGRAMMING
+837,Educational Codeforces Round 26,12,Flag of Berland,,B,1501773300,"[brute force, implementation]",PROGRAMMING
+837,Educational Codeforces Round 26,12,Two Seals,,C,1501773300,[brute force],PROGRAMMING
+837,Educational Codeforces Round 26,12,Round Subset,,D,1501773300,[dp],PROGRAMMING
+837,Educational Codeforces Round 26,12,Vasya's Function,,E,1501773300,"[binary search, implementation, math]",PROGRAMMING
+837,Educational Codeforces Round 26,12,Prefix Sums,,F,1501773300,"[binary search, brute force, combinatorics, math, matrices]",PROGRAMMING
+837,Educational Codeforces Round 26,12,Functions On The Segments,,G,1501773300,[data structures],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Key races,500.0,A,1501511700,[math],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,The number on the board,750.0,B,1501511700,[greedy],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Star sky,1250.0,C,1501511700,"[dp, implementation]",PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Palindromic characteristics,1500.0,D,1501511700,"[brute force, dp, hashing, strings]",PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,The penguin's game,2250.0,E,1501511700,[constructive algorithms],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Roads in the Kingdom,2250.0,F,1501511700,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,The Meaningless Game,500.0,A,1501425300,"[math, number theory]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,The Bakery,1250.0,B,1501425300,"[binary search, data structures, dp, two pointers]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,Ever-Hungry Krakozyabra,1500.0,C,1501425300,"[brute force, greedy]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,Red-Black Cobweb,2250.0,D,1501425300,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,Caramel Clouds,2500.0,E,1501425300,"[data structures, dp, sortings]",PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Useless Toy,500.0,A,1501425300,[implementation],PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Festive Evening,1000.0,B,1501425300,"[data structures, implementation]",PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Meaningless Game,1500.0,C,1501425300,[math],PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Bakery,2250.0,D,1501425300,"[data structures, divide and conquer, dp]",PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,Ever-Hungry Krakozyabra,2500.0,E,1501425300,[],PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Sasha and Sticks,500.0,A,1500906900,"[games, math]",PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Petya and Exam,1000.0,B,1500906900,[implementation],PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Strange Radiation,1750.0,C,1500906900,"[binary search, implementation, math]",PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,"Misha, Grisha and Underground",2000.0,D,1500906900,"[dfs and similar, trees]",PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Vasya and Shifts,2500.0,E,1500906900,[matrices],PROGRAMMING
+825,Educational Codeforces Round 25,12,Binary Protocol,,A,1500217500,[implementation],PROGRAMMING
+825,Educational Codeforces Round 25,12,Five-In-a-Row,,B,1500217500,"[brute force, implementation]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Multi-judge Solving,,C,1500217500,"[greedy, implementation]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Suitable Replacement,,D,1500217500,"[greedy, implementation]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Minimal Labels,,E,1500217500,"[data structures, graphs, greedy]",PROGRAMMING
+825,Educational Codeforces Round 25,12,String Compression,,F,1500217500,"[dp, hashing, string suffix structures, strings]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Tree Queries,,G,1500217500,"[dfs and similar, graphs, trees]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Office Keys,500.0,A,1499958300,"[binary search, brute force, dp, greedy, sortings]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Cards Sorting,1000.0,B,1499958300,"[data structures, implementation, sortings]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Bamboo Partition,1500.0,C,1499958300,"[brute force, math, number theory, sortings, two pointers]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Singer House,2250.0,D,1499958300,"[combinatorics, dp, trees]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Perpetual Motion Machine,2250.0,E,1499958300,"[constructive algorithms, implementation, math, trees]",PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Unimodal Array,500.0,A,1499958300,[implementation],PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Keyboard Layouts,750.0,B,1499958300,"[implementation, strings]",PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Jury Marks,1000.0,C,1499958300,[brute force],PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Office Keys,1500.0,D,1499958300,"[binary search, brute force, dp, greedy]",PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Cards Sorting,2000.0,E,1499958300,[data structures],PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Bamboo Partition,2500.0,F,1499958300,[],PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,String Reconstruction,500.0,A,1499791500,"[data structures, greedy]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,High Load,750.0,B,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,DNA Evolution,1500.0,C,1499791500,[data structures],PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Best Edge Weight,1750.0,D,1499791500,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Rusty String,1750.0,E,1499791500,"[fft, math]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Dirty Arkady's Kitchen,2500.0,F,1499791500,"[dp, shortest paths]",PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Restaurant Tables,500.0,A,1499791500,[implementation],PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Black Square,750.0,B,1499791500,[implementation],PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,String Reconstruction,1250.0,C,1499791500,"[data structures, sortings]",PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,High Load,1750.0,D,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,DNA Evolution,2000.0,E,1499791500,[data structures],PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Best Edge Weight,2750.0,F,1499791500,[data structures],PROGRAMMING
+823,VK Cup 2017 - Finals,12,High Load,500.0,A,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,DNA Evolution,1000.0,B,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Bamboo Partition,1500.0,C,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Rusty String,2000.0,D,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Singer House,2750.0,E,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Perpetual Motion Machine,2750.0,F,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Dirty Arkady's Kitchen,3500.0,G,1499587500,[],PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,I'm bored with life,500.0,A,1499011500,"[implementation, math, number theory]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,Crossword solving,750.0,B,1499011500,"[brute force, implementation, strings]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,"Hacker, pack your bags!",1250.0,C,1499011500,"[binary search, greedy, sortings]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,My pretty girl Noora,1750.0,D,1499011500,"[brute force, dp, greedy, math, number theory]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,Liar,2250.0,E,1499011500,"[binary search, dp, hashing, string suffix structures]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,Madness,2500.0,F,1499011500,"[dfs and similar, trees]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Diplomas and Certificates,,A,1498748700,"[implementation, math]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Permutation Game,,B,1498748700,[implementation],PROGRAMMING
+818,Educational Codeforces Round 24,12,Sofa Thief,,C,1498748700,"[brute force, implementation]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Multicolored Cars,,D,1498748700,"[data structures, implementation]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Card Game Again,,E,1498748700,"[binary search, data structures, number theory, two pointers]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Level Generation,,F,1498748700,"[binary search, math, ternary search]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Four Melodies,,G,1498748700,[flows],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Boring Game,500.0,A,1498574100,[],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and PR Shifts,1000.0,B,1498574100,"[data structures, implementation]",PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Beacons on Field,1500.0,C,1498574100,[number theory],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Astronomers,2000.0,D,1498574100,[number theory],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Flight to the Moon,2500.0,E,1498574100,"[constructive algorithms, graphs]",PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Book Reading,500.0,A,1498574100,[implementation],PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Angle in Polygon,1000.0,B,1498574100,"[constructive algorithms, geometry]",PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Boring Game,1500.0,C,1498574100,[],PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and PR Shifts,2000.0,D,1498574100,[],PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Beacons on Field,2500.0,E,1498574100,[],PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and Future Gadget Laboratory,500.0,A,1498401300,[implementation],PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and Banana Trees,1000.0,B,1498401300,"[brute force, math]",PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and Boxes,1500.0,C,1498401300,"[data structures, trees]",PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and City,2000.0,D,1498401300,"[graphs, shortest paths]",PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and El Psy Kongroo,2500.0,E,1498401300,"[dp, matrices]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Game,500.0,A,1497710100,"[brute force, greedy, implementation]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Test,1250.0,B,1497710100,"[brute force, constructive algorithms, math]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Supermarket,1500.0,C,1497710100,"[brute force, dp, trees]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Cards,2250.0,D,1497710100,"[binary search, combinatorics, data structures, geometry]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Neighborhood,2250.0,E,1497710100,"[binary search, constructive algorithms]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Morning,500.0,A,1497710100,"[brute force, implementation]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Coffee,1000.0,B,1497710100,"[binary search, data structures]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Game,1500.0,C,1497710100,"[brute force, greedy]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Test,2000.0,D,1497710100,[combinatorics],PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Supermarket,2750.0,E,1497710100,"[dp, trees]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Treasure Hunt,,A,1497539100,"[implementation, number theory]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Makes And The Product,,B,1497539100,"[combinatorics, sortings]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Really Big Numbers,,C,1497539100,"[binary search, brute force, dp, math]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Imbalanced Array,,D,1497539100,"[data structures, divide and conquer, dsu, sortings]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Choosing The Commander,,E,1497539100,"[bitmasks, data structures, trees]",PROGRAMMING
+817,Educational Codeforces Round 23,12,MEX Queries,,F,1497539100,"[binary search, data structures, trees]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An abandoned sentiment from past,500.0,A,1496837700,"[implementation, sortings]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An express train to reveries,1000.0,B,1496837700,[constructive algorithms],PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An impassioned circulation of affection,1750.0,C,1496837700,"[brute force, dp, strings, two pointers]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An overnight dance in discotheque,1750.0,D,1496837700,"[dfs and similar, dp, geometry, greedy, trees]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An unavoidable detour for home,2500.0,E,1496837700,"[combinatorics, dp]",PROGRAMMING
+813,Educational Codeforces Round 22,12,The Contest,,A,1496675100,[implementation],PROGRAMMING
+813,Educational Codeforces Round 22,12,The Golden Age,,B,1496675100,"[brute force, math]",PROGRAMMING
+813,Educational Codeforces Round 22,12,The Tag Game,,C,1496675100,[dfs and similar],PROGRAMMING
+813,Educational Codeforces Round 22,12,Two Melodies,,D,1496675100,"[dp, flows]",PROGRAMMING
+813,Educational Codeforces Round 22,12,Army Creation,,E,1496675100,"[binary search, data structures]",PROGRAMMING
+813,Educational Codeforces Round 22,12,Bipartite Checking,,F,1496675100,"[data structures, dsu, graphs]",PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Crossroads,500.0,A,1496326500,[implementation],PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,"Sagheer, the Hausmeister",1000.0,B,1496326500,"[bitmasks, brute force, dp]",PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Nubian Market,1500.0,C,1496326500,[binary search],PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Kindergarten,2000.0,D,1496326500,"[dfs and similar, graphs, implementation]",PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Apple Tree,2500.0,E,1496326500,[games],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (easy),,A,1495958700,[greedy],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (medium),,B,1495958700,"[data structures, greedy]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (hard),,C,1495958700,[flows],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (easy),,D,1495958700,[math],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (medium),,E,1495958700,[math],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (hard),,F,1495958700,[math],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (easy),,G,1495958700,[implementation],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (medium),,H,1495958700,[constructive algorithms],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (hard),,I,1495958700,[string suffix structures],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (easy),,J,1495958700,"[dfs and similar, trees]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (medium),,K,1495958700,"[dp, trees]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (hard),,L,1495958700,"[dfs and similar, dp, math, trees]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (easy),,M,1495958700,"[greedy, sortings]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (medium),,N,1495958700,"[binary search, flows]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (hard),,O,1495958700,"[binary search, flows]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Courtesy,500.0,A,1495877700,"[brute force, implementation]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Complicated Book,1000.0,B,1495877700,"[implementation, sortings]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Memorable Trip,1500.0,C,1495877700,"[dp, implementation]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Favorite Game,2000.0,D,1495877700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Entertaining Flags,2500.0,E,1495877700,"[data structures, dsu, graphs]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Do you want a date?,500.0,A,1495303500,"[math, sortings]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Glad to see you!,1000.0,B,1495303500,[binary search],PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Find a car,1500.0,C,1495303500,"[combinatorics, divide and conquer, dp]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Hitchhiking in the Baltic States,2000.0,D,1495303500,"[data structures, dp]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Surprise me!,2500.0,E,1495303500,"[divide and conquer, math, trees]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Straight <>,500.0,A,1495303500,"[implementation, math]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Summer sell-off,1000.0,B,1495303500,"[greedy, sortings]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Do you want a date?,1500.0,C,1495303500,"[math, sortings]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Glad to see you!,2000.0,D,1495303500,[binary search],PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Find a car,2500.0,E,1495303500,"[divide and conquer, dp]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Lucky Year,,A,1494860700,[implementation],PROGRAMMING
+808,Educational Codeforces Round 21,12,Average Sleep Time,,B,1494860700,"[data structures, math]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Tea Party,,C,1494860700,"[constructive algorithms, greedy]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Array Division,,D,1494860700,"[binary search, data structures, implementation]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Selling Souvenirs,,E,1494860700,"[dp, greedy, ternary search]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Card Game,,F,1494860700,"[binary search, flows, graphs]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Anthem of Berland,,G,1494860700,"[dp, strings]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Bank Robbery,500.0,A,1494668100,[implementation],PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Cutting Carrot,1000.0,B,1494668100,"[geometry, math]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Naming Company,1750.0,C,1494668100,"[games, greedy, sortings]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Labelling Cities,2000.0,D,1494668100,"[dfs and similar, graphs, hashing]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Choosing Carrot,2500.0,E,1494668100,[games],PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Leha and security system,2750.0,F,1494668100,[data structures],PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Replace All,3500.0,G,1494668100,"[combinatorics, dp, math]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Carrot Cakes,500.0,A,1494516900,"[brute force, implementation]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,T-shirt buying,1000.0,B,1494516900,"[data structures, implementation]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Fountains,1500.0,C,1494516900,"[binary search, data structures]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Field expansion,2000.0,D,1494516900,"[brute force, dp, meet-in-the-middle]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Aquarium decoration,2500.0,E,1494516900,"[data structures, greedy, two pointers]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Beautiful fountains rows,3250.0,F,1494516900,[data structures],PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Cut the pie,3500.0,G,1494516900,"[binary search, data structures, geometry]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Success Rate,500.0,A,1494171900,"[binary search, math]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Dynamic Problem Scoring,1000.0,B,1494171900,"[brute force, greedy]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Prairie Partition,1750.0,C,1494171900,"[binary search, constructive algorithms, greedy, math]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Perishable Roads,2500.0,D,1494171900,"[dp, graphs, shortest paths]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Blog Post Rating,2750.0,E,1494171900,"[data structures, sortings]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Test Data Generation,3500.0,F,1494171900,"[combinatorics, divide and conquer, dp, fft, math, number theory]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Success Rate,500.0,A,1494171900,"[binary search, math]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Dynamic Problem Scoring,1000.0,B,1494171900,"[brute force, greedy]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Prairie Partition,1750.0,C,1494171900,"[binary search, greedy]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Perishable Roads,2500.0,D,1494171900,[graphs],PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Blog Post Rating,2750.0,E,1494171900,[data structures],PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Test Data Generation,3500.0,F,1494171900,[],PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Is it rated?,500.0,A,1494171900,"[implementation, sortings]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,T-Shirt Hunt,1000.0,B,1494171900,"[brute force, implementation]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Success Rate,1500.0,C,1494171900,"[binary search, math]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Dynamic Problem Scoring,2000.0,D,1494171900,"[brute force, greedy]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Prairie Partition,2750.0,E,1494171900,"[binary search, greedy]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Perishable Roads,3500.0,F,1494171900,[],PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Find Amir,500.0,A,1493909400,"[greedy, math]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Minimum number of steps,1000.0,B,1493909400,"[greedy, implementation, math]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Ice cream coloring,1500.0,C,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Expected diameter of a tree,2000.0,D,1493909400,"[binary search, brute force, dfs and similar, dp, sortings, trees]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,The same permutation ,2500.0,E,1493909400,[constructive algorithms],PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Fake bullions,3000.0,F,1493909400,"[dfs and similar, dp, graphs]",PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Fake NP,500.0,A,1493909400,[math],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,3-palindrome,1000.0,B,1493909400,[constructive algorithms],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Find Amir,1500.0,C,1493909400,[constructive algorithms],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Minimum number of steps,2000.0,D,1493909400,[],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Ice cream coloring,2500.0,E,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Expected diameter of a tree,3000.0,F,1493909400,"[graphs, probabilities]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Maximal Binary Matrix,,A,1493391900,[constructive algorithms],PROGRAMMING
+803,Educational Codeforces Round 20,12,Distances to Zero,,B,1493391900,[constructive algorithms],PROGRAMMING
+803,Educational Codeforces Round 20,12,Maximal GCD,,C,1493391900,"[greedy, math]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Magazine Ad,,D,1493391900,"[binary search, greedy]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Roma and Poker,,E,1493391900,[dp],PROGRAMMING
+803,Educational Codeforces Round 20,12,Coprime Subsequences,,F,1493391900,"[bitmasks, combinatorics, number theory]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Periodic RMQ Problem,,G,1493391900,[data structures],PROGRAMMING
+775,VK Cup 2017 - Wild Card Round 2,12,University Schedule,,A,1493220900,[*special],PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Oleg and shares,500.0,A,1492965900,"[implementation, math]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Igor and his way to work,1000.0,B,1492965900,"[dfs and similar, shortest paths]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Mice problem,1500.0,C,1492965900,"[geometry, implementation, sortings]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Presents in Bankopolis,2000.0,D,1492965900,"[dp, graphs, shortest paths]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Problem of offices,2500.0,E,1492965900,"[constructive algorithms, dfs and similar, dp, trees]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Julia the snail,3000.0,F,1492965900,"[data structures, divide and conquer]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Oleg and chess,3500.0,G,1492965900,"[flows, graph matchings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and palindrome,500.0,A,1492785300,"[brute force, constructive algorithms, strings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and strings,1000.0,B,1492785300,"[brute force, dp, strings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and gcd problem,1500.0,C,1492785300,"[dp, greedy, number theory]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and distribution,2000.0,D,1492785300,"[constructive algorithms, sortings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and code of a permutation,2500.0,E,1492785300,"[constructive algorithms, data structures, graphs, sortings]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Voltage Keepsake,500.0,A,1492356900,"[binary search, math]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Volatile Kite,1000.0,B,1492356900,[geometry],PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Vulnerable Kerbals,1750.0,C,1492356900,"[dp, graphs, number theory]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Varying Kibibits,2250.0,D,1492356900,"[bitmasks, dp]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Verifying Kingdom,2250.0,E,1492356900,"[binary search, trees]",PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Voltage Keepsake,500.0,A,1492356900,"[binary search, greedy]",PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Volatile Kite,1000.0,B,1492356900,[geometry],PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Vulnerable Kerbals,1750.0,C,1492356900,[number theory],PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Varying Kibibits,2250.0,D,1492356900,"[combinatorics, dp]",PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Verifying Kingdom,2250.0,E,1492356900,[],PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vicious Keyboard,500.0,A,1492356900,[brute force],PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Valued Keys,1000.0,B,1492356900,"[constructive algorithms, greedy, strings]",PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Voltage Keepsake,1500.0,C,1492356900,"[binary search, math]",PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Volatile Kite,2000.0,D,1492356900,"[brute force, geometry, greedy]",PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vulnerable Kerbals,2750.0,E,1492356900,[],PROGRAMMING
+797,Educational Codeforces Round 19,12,k-Factorization,,A,1492266900,"[implementation, math, number theory]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Odd sum,,B,1492266900,"[dp, greedy]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Minimal string,,C,1492266900,"[greedy, strings]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Broken BST,,D,1492266900,"[data structures, dfs and similar]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Array Queries,,E,1492266900,"[brute force, data structures, dp]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Mice and Holes,,F,1492266900,"[data structures, dp, greedy, sortings]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Buying A House,500.0,A,1491842100,"[brute force, implementation]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Find The Bone,750.0,B,1491842100,[implementation],PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Bank Hacking,1000.0,C,1491842100,"[constructive algorithms, data structures, dp, trees]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Police Stations,1500.0,D,1491842100,"[constructive algorithms, shortest paths, trees]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Exam Cheating,2000.0,E,1491842100,"[binary search, dp]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Sequence Recovery,2500.0,F,1491842100,"[bitmasks, data structures, greedy]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Amusement Park,,A,1491406500,"[*special, ternary search]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Significant Cups,,B,1491406500,"[*special, binary search, data structures, two pointers]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Lie or Truth,,D,1491406500,"[*special, constructive algorithms, sortings]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Big Number and Remainder,,E,1491406500,"[*special, math, number theory]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Pens And Days Of Week,,F,1491406500,"[*special, binary search, number theory]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Amusement Park,,A,1491406500,"[*special, brute force, ternary search]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Significant Cups,,B,1491406500,"[*special, binary search, sortings, two pointers]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Lie or Truth,,D,1491406500,"[*special, implementation, sortings]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Big Number and Remainder,,E,1491406500,"[*special, brute force, number theory]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Pens And Days Of Week,,F,1491406500,"[*special, brute force, number theory]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING
+784,April Fools Contest 2017,12,Numbers Joke,,A,1490972400,[*special],PROGRAMMING
+784,April Fools Contest 2017,12,Kids' Riddle,,B,1490972400,[*special],PROGRAMMING
+784,April Fools Contest 2017,12,INTERCALC,,C,1490972400,"[*special, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,Touchy-Feely Palindromes,,D,1490972400,"[*special, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,Twisted Circuit,,E,1490972400,"[*special, brute force, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,Crunching Numbers Just for You,,F,1490972400,"[*special, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,BF Calculator,,G,1490972400,[*special],PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,Functions again,500.0,A,1490803500,"[dp, two pointers]",PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,Weird journey,1250.0,B,1490803500,"[combinatorics, dfs and similar, dsu, graphs]",PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,The Great Mixing,1500.0,C,1490803500,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,Finding lines,2000.0,D,1490803500,"[constructive algorithms, divide and conquer]",PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,New task,2250.0,E,1490803500,[data structures],PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,Anastasia and pebbles,500.0,A,1490803500,"[implementation, math]",PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,Masha and geometric depression,1000.0,B,1490803500,"[brute force, implementation, math]",PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,Functions again,1500.0,C,1490803500,"[data structures, dp]",PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,Weird journey,2250.0,D,1490803500,[graphs],PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,The Great Mixing,2500.0,E,1490803500,"[brute force, dfs and similar, dp, graph matchings, math]",PROGRAMMING
+792,Educational Codeforces Round 18,12,New Bus Route,,A,1490625300,"[implementation, sortings]",PROGRAMMING
+792,Educational Codeforces Round 18,12,Counting-out Rhyme,,B,1490625300,[implementation],PROGRAMMING
+792,Educational Codeforces Round 18,12,Divide by Three,,C,1490625300,"[dp, greedy, math, number theory]",PROGRAMMING
+792,Educational Codeforces Round 18,12,Paths in a Complete Binary Tree,,D,1490625300,"[bitmasks, trees]",PROGRAMMING
+792,Educational Codeforces Round 18,12,Colored Balls,,E,1490625300,"[greedy, math]",PROGRAMMING
+792,Educational Codeforces Round 18,12,Mages and Monsters,,F,1490625300,"[data structures, geometry]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,Berzerk,750.0,A,1490281500,"[dfs and similar, dp, games]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,Legacy,1000.0,B,1490281500,"[data structures, graphs, shortest paths]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,Till I Collapse,1500.0,C,1490281500,"[data structures, divide and conquer]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,Rap God,2000.0,D,1490281500,"[data structures, dfs and similar, hashing, strings, trees]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,ALT,2500.0,E,1490281500,"[data structures, flows, graphs, trees]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,The Monster,500.0,A,1490281500,"[brute force, math]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,Not Afraid,1000.0,B,1490281500,"[greedy, implementation]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,Berzerk,1750.0,C,1490281500,"[dp, games]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,Legacy,2000.0,D,1490281500,"[data structures, shortest paths]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,Till I Collapse,2500.0,E,1490281500,"[data structures, trees]",PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Friendship Condition,250.0,A,1489851300,"[dfs and similar, dsu, graphs]",PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Different Names,500.0,B,1489851300,"[constructive algorithms, greedy]",PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Tree Jumps,1000.0,C,1489851300,"[dfs and similar, dp, trees]",PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Company,1500.0,D,1489851300,[dp],PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Rectangle Strips,2250.0,E,1489851300,"[dp, greedy]",PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Isomorphic Points,2500.0,F,1489851300,"[geometry, two pointers]",PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Different Names,500.0,A,1489851300,"[constructive algorithms, greedy]",PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Tree Jumps,1000.0,B,1489851300,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Company,1500.0,C,1489851300,[dp],PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Rectangle Strips,2250.0,D,1489851300,[dp],PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Isomorphic Points,2500.0,E,1489851300,[],PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Big Brother,500.0,A,1489851300,[implementation],PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Friendship Condition,1000.0,B,1489851300,"[dfs and similar, dsu, graphs]",PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Different Names,1500.0,C,1489851300,"[constructive algorithms, greedy]",PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Tree Jumps,2000.0,D,1489851300,"[dfs and similar, dp, trees]",PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Company,2500.0,E,1489851300,[],PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and Polyhedrons,500.0,A,1489590300,[implementation],PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and Classes,1000.0,B,1489590300,"[greedy, sortings]",PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and Fairy Tale,1500.0,C,1489590300,"[binary search, math]",PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and School - 2,2250.0,D,1489590300,"[combinatorics, math, number theory]",PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and Permutation,2500.0,E,1489590300,"[brute force, data structures]",PROGRAMMING
+770,VK Cup 2017 - Qualification 2,12,New Password,500.0,A,1489233600,[implementation],PROGRAMMING
+770,VK Cup 2017 - Qualification 2,12,Maximize Sum of Digits,1000.0,B,1489233600,[implementation],PROGRAMMING
+770,VK Cup 2017 - Qualification 2,12,Online Courses In BSU,1500.0,C,1489233600,"[dfs and similar, graphs]",PROGRAMMING
+770,VK Cup 2017 - Qualification 2,12,Draw Brackets!,1500.0,D,1489233600,[implementation],PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Andryusha and Colored Balloons,500.0,A,1488719100,"[brute force, constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Innokenty and a Football League,1000.0,B,1488719100,"[2-sat, brute force, graph matchings, greedy, implementation]",PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Underground Lab,1250.0,C,1488719100,"[brute force, constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Axel and Marston in Bitland,1750.0,D,1488719100,"[bitmasks, brute force, dp, matrices]",PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Andryusha and Nervous Barriers,2250.0,E,1488719100,[data structures],PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Intranet of Buses,2750.0,F,1488719100,"[binary search, geometry, two pointers]",PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Andryusha and Socks,500.0,A,1488719100,[implementation],PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,The Meeting Place Cannot Be Changed,1000.0,B,1488719100,"[binary search, ternary search]",PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Andryusha and Colored Balloons,1250.0,C,1488719100,[dfs and similar],PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Innokenty and a Football League,1500.0,D,1488719100,[greedy],PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Underground Lab,1750.0,E,1488719100,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Axel and Marston in Bitland,2500.0,F,1488719100,[matrices],PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Socks,500.0,A,1488705300,[implementation],PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,The Meeting Place Cannot Be Changed,1000.0,B,1488705300,[binary search],PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Colored Balloons,1250.0,C,1488705300,[dfs and similar],PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Innokenty and a Football League,1500.0,D,1488705300,"[2-sat, graphs, greedy, implementation]",PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Underground Lab,1750.0,E,1488705300,"[dfs and similar, graphs]",PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Axel and Marston in Bitland,2500.0,F,1488705300,"[bitmasks, graphs, matrices]",PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Nervous Barriers,3000.0,G,1488705300,"[data structures, dp]",PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Intranet of Buses,3500.0,H,1488705300,"[binary search, geometry, implementation, two pointers]",PROGRAMMING
+769,VK Cup 2017 - Qualification 1,12,Year of University Entrance,500.0,A,1488628800,[sortings],PROGRAMMING
+769,VK Cup 2017 - Qualification 1,12,News About Credit,1000.0,B,1488628800,"[greedy, two pointers]",PROGRAMMING
+769,VK Cup 2017 - Qualification 1,12,Cycle In Maze,1500.0,C,1488628800,"[dfs and similar, greedy, shortest paths]",PROGRAMMING
+769,VK Cup 2017 - Qualification 1,12,k-Interesting Pairs Of Integers,2000.0,D,1488628800,"[bitmasks, brute force]",PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,String Game,500.0,A,1488096300,"[binary search, greedy, strings]",PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,Bitwise Formula,1000.0,B,1488096300,"[bitmasks, brute force, dfs and similar, expression parsing, implementation]",PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,Peterson Polyglot,1500.0,C,1488096300,"[brute force, dfs and similar, dsu, hashing, trees]",PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,Parquet Re-laying,2250.0,D,1488096300,[constructive algorithms],PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,Selling Numbers,2250.0,E,1488096300,"[dp, sortings]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Pupils Redistribution,500.0,A,1488096300,"[constructive algorithms, math]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Weird Rounding,1000.0,B,1488096300,"[brute force, greedy]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Dishonest Sellers,1000.0,C,1488096300,"[greedy, sortings]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,String Game,1500.0,D,1488096300,"[binary search, strings]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Bitwise Formula,2000.0,E,1488096300,"[data structures, expression parsing, greedy]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Peterson Polyglot,2500.0,F,1488096300,[],PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Shell Game,500.0,A,1487930700,"[constructive algorithms, implementation]",PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Game of Credit Cards,1000.0,B,1487930700,"[data structures, dp, greedy, sortings]",PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Alyona and Spreadsheet,1500.0,C,1487930700,"[binary search, dp, implementation, two pointers]",PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Cloud of Hashtags,2000.0,D,1487930700,"[binary search, greedy, implementation, strings]",PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Hanoi Factory,2500.0,E,1487930700,"[brute force, data structures, dp, greedy, sortings]",PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,A Serial Killer,500.0,A,1487861100,[implementation],PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock and his girlfriend,1000.0,B,1487861100,[number theory],PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Molly's Chemicals,1500.0,C,1487861100,"[binary search, data structures, math]",PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,The Door Problem,2000.0,D,1487861100,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,The Holmes Children,2250.0,E,1487861100,"[math, number theory]",PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock's bet to Moriarty,3000.0,F,1487861100,"[constructive algorithms, geometry, graphs, trees]",PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock and the Encrypted Data,3250.0,G,1487861100,"[bitmasks, combinatorics, dp]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Oath of the Night's Watch,500.0,A,1487606700,"[constructive algorithms, sortings]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Code For 1,1000.0,B,1487606700,"[constructive algorithms, dfs and similar, divide and conquer]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Jon Snow and his Favourite Number,1250.0,C,1487606700,"[brute force, dp, implementation, sortings]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Jon and Orbs,1750.0,D,1487606700,"[dp, math, probabilities]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Game of Stones,2000.0,E,1487606700,"[dp, games]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Barrels and boxes,2250.0,F,1487606700,"[brute force, combinatorics, number theory, probabilities]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,The Winds of Winter,2750.0,G,1487606700,[data structures],PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,Snacktower,500.0,A,1487408700,"[data structures, implementation]",PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,The Queue,1250.0,B,1487408700,"[brute force, greedy]",PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,Garland,1500.0,C,1487408700,"[dfs and similar, graphs, greedy, trees]",PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,Cartons of milk,2000.0,D,1487408700,"[binary search, data structures, greedy, sortings, two pointers]",PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,Change-free,2500.0,E,1487408700,[greedy],PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Neverending competitions,500.0,A,1487059500,[implementation],PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Code obfuscation,1000.0,B,1487059500,"[implementation, strings]",PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Table Tennis Game 2,1250.0,C,1487059500,[math],PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Artsem and Saunders,2000.0,D,1487059500,"[constructive algorithms, dsu, math]",PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Tree Folding,2500.0,E,1487059500,"[dfs and similar, dp, implementation, trees]",PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Souvenirs,3250.0,F,1487059500,[data structures],PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,"Math, math everywhere",3500.0,G,1487059500,[],PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and Longest Uncommon Subsequence,500.0,A,1486487100,"[constructive algorithms, strings]",PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Triangle,1000.0,B,1486487100,"[constructive algorithms, geometry, greedy, sortings]",PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Message,1500.0,C,1486487100,"[brute force, dp, strings]",PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Dictionary,2000.0,D,1486487100,"[data structures, dfs and similar, dsu, graphs]",PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and a xor trip,2500.0,E,1486487100,"[bitmasks, constructive algorithms, data structures, dfs and similar, dp, trees]",PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and a tree,500.0,A,1486042500,"[dfs and similar, dp, dsu, trees]",PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and rectangles,750.0,B,1486042500,[constructive algorithms],PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and remoduling,1500.0,C,1486042500,"[brute force, number theory]",PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and a flat tree,2000.0,D,1486042500,"[data structures, hashing, trees]",PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and our friends animals,2500.0,E,1486042500,[dsu],PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Taymyr is calling you,500.0,A,1486042500,"[brute force, implementation, math]",PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Timofey and cubes,1000.0,B,1486042500,"[constructive algorithms, implementation]",PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Timofey and a tree,1500.0,C,1486042500,[dfs and similar],PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Timofey and rectangles,1750.0,D,1486042500,[],PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Timofey and remoduling,2500.0,E,1486042500,[],PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Stairs,500.0,A,1485873300,"[brute force, constructive algorithms, math]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and friends,1000.0,B,1485873300,"[brute force, implementation, math]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Password,1500.0,C,1485873300,"[brute force, dp, implementation]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Very Difficult Problem,2000.0,D,1485873300,"[binary search, brute force, constructive algorithms, greedy, sortings]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Puzzle,2500.0,E,1485873300,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Photos,3000.0,F,1485873300,"[brute force, data structures]",PROGRAMMING
+762,Educational Codeforces Round 17,12,k-th divisor,,A,1485354900,"[math, number theory]",PROGRAMMING
+762,Educational Codeforces Round 17,12,USB vs. PS/2,,B,1485354900,"[greedy, sortings, two pointers]",PROGRAMMING
+762,Educational Codeforces Round 17,12,Two strings,,C,1485354900,"[binary search, hashing, two pointers]",PROGRAMMING
+762,Educational Codeforces Round 17,12,Maximum path,,D,1485354900,"[dp, implementation]",PROGRAMMING
+762,Educational Codeforces Round 17,12,Radio stations,,E,1485354900,"[binary search, data structures]",PROGRAMMING
+762,Educational Codeforces Round 17,12,Tree nesting,,F,1485354900,"[combinatorics, graphs, trees]",PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Pavel and barbecue,500.0,A,1485108900,[dfs and similar],PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Travel Card,1000.0,B,1485108900,"[binary search, dp]",PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Nikita and stack,1500.0,C,1485108900,[data structures],PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Bacterial Melee,2000.0,D,1485108900,"[brute force, combinatorics, dp, string suffix structures]",PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Byteland coins,2500.0,E,1485108900,"[combinatorics, dp, math]",PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Long number,3000.0,F,1485108900,"[expression parsing, math, number theory]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Pavel and barbecue,500.0,A,1485108900,"[dfs and similar, dsu]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Travel Card,1000.0,B,1485108900,"[binary search, dp, greedy, two pointers]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Nikita and stack,1500.0,C,1485108900,"[binary search, data structures]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Bacterial Melee,2000.0,D,1485108900,[dp],PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Byteland coins,2500.0,E,1485108900,"[dp, math]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Long number,3000.0,F,1485108900,[],PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Petr and a calendar,500.0,A,1485108900,"[implementation, math]",PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Frodo and pillows,1000.0,B,1485108900,"[binary search, greedy]",PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Pavel and barbecue,1500.0,C,1485108900,"[dfs and similar, graphs]",PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Travel Card,2000.0,D,1485108900,"[binary search, dp, two pointers]",PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Nikita and stack,2500.0,E,1485108900,[],PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Bacterial Melee,3000.0,F,1485108900,[],PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Holiday Of Equality,500.0,A,1484838300,"[implementation, math]",PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Blown Garland,1000.0,B,1484838300,[implementation],PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Unfair Poll,1500.0,C,1484838300,"[binary search, implementation, math]",PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Ability To Convert,1750.0,D,1484838300,"[dp, greedy, strings]",PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Broken Tree,2500.0,E,1484838300,"[dfs and similar, greedy, trees]",PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Geometrical Progression,3000.0,F,1484838300,"[brute force, math, number theory]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Hypothesis,500.0,A,1484499900,"[brute force, graphs, math]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Game,1000.0,B,1484499900,"[binary search, data structures, games, greedy, sortings]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Forest,1500.0,C,1484499900,"[dfs and similar, dsu, graphs]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Polygon,2250.0,D,1484499900,[data structures],PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and White-Red graph,2500.0,E,1484499900,"[constructive algorithms, graphs, shortest paths]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Gifts,2750.0,F,1484499900,"[bitmasks, dp, greedy]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Many Other Balls,3500.0,G,1484499900,"[combinatorics, divide and conquer, dp, fft, math, number theory]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Gotta Catch Em' All!,500.0,A,1484235300,[implementation],PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Bash's Big Day,1000.0,B,1484235300,"[greedy, math, number theory]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Felicity is Coming!,1500.0,C,1484235300,"[data structures, hashing, sortings, strings]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Felicity's Big Secret Revealed,2000.0,D,1484235300,"[bitmasks, dp]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Bash Plays with Functions,2500.0,E,1484235300,"[brute force, combinatorics, dp, number theory]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Team Rocket Rises Again,2750.0,F,1484235300,"[data structures, graphs, shortest paths]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Can Bash Save the Day?,3500.0,G,1484235300,"[data structures, divide and conquer, graphs, trees]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Lesha and array splitting,500.0,A,1483713300,"[constructive algorithms, greedy]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Ilya and tic-tac-toe game,1000.0,B,1483713300,"[brute force, implementation]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Vladik and chat,1500.0,C,1483713300,"[brute force, constructive algorithms, dp, implementation, strings]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Fedor and coupons,2000.0,D,1483713300,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Dasha and cyclic table,2500.0,E,1483713300,"[bitmasks, brute force, fft]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Hurry,500.0,A,1483107300,"[binary search, brute force, implementation, math]",PROGRAMMING
+750,Good Bye 2016,12,New Year and North Pole,750.0,B,1483107300,[implementation],PROGRAMMING
+750,Good Bye 2016,12,New Year and Rating,1000.0,C,1483107300,"[binary search, greedy, math]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Fireworks,1500.0,D,1483107300,"[brute force, data structures, dfs and similar, dp, implementation]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Old Subsequence,2250.0,E,1483107300,"[data structures, divide and conquer, dp]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Finding Roots,3000.0,F,1483107300,"[constructive algorithms, implementation, trees]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Binary Tree Paths,3250.0,G,1483107300,"[bitmasks, brute force, combinatorics, dp]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Snowy Grid,3500.0,H,1483107300,"[dfs and similar, dsu, graphs]",PROGRAMMING
+753,Testing Round #13,12,Santa Claus and Candies,500.0,A,1483002300,"[dp, greedy, math]",PROGRAMMING
+753,Testing Round #13,12,Interactive Bulls and Cows (Easy),1000.0,B,1483002300,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+753,Testing Round #13,12,Interactive Bulls and Cows (Hard),1500.0,C,1483002300,"[brute force, constructive algorithms]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and a Place in a Class,500.0,A,1482656700,"[implementation, math]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Keyboard Check,1000.0,B,1482656700,"[implementation, strings]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Robot,1500.0,C,1482656700,"[constructive algorithms, math]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and a Palindrome,2000.0,D,1482656700,"[constructive algorithms, data structures, greedy]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Tangerines,2500.0,E,1482656700,"[binary search, greedy, two pointers]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Clauses and a Soccer Championship,2500.0,F,1482656700,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and a Place in a Class,500.0,A,1482656700,"[constructive algorithms, math]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Keyboard Check,1000.0,B,1482656700,"[greedy, implementation, strings]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Robot,1500.0,C,1482656700,"[greedy, shortest paths]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and a Palindrome,2000.0,D,1482656700,"[data structures, greedy, hashing, strings]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Tangerines,2500.0,E,1482656700,"[binary search, dp, two pointers]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Clauses and a Soccer Championship,2500.0,F,1482656700,[trees],PROGRAMMING
+751,Технокубок 2017 - Ознакомительный Раунд 3,12,Оценки Васи,500.0,A,1482395400,[],PROGRAMMING
+751,Технокубок 2017 - Ознакомительный Раунд 3,12,Путь Поликарпа,1000.0,B,1482395400,[],PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Bachgold Problem,500.0,A,1482165300,"[greedy, implementation, math, number theory]",PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Parallelogram is Back,1000.0,B,1482165300,"[brute force, constructive algorithms, geometry]",PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Voting,1500.0,C,1482165300,"[greedy, implementation, two pointers]",PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Leaving Auction,2000.0,D,1482165300,"[binary search, data structures]",PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Inversions After Shuffle,2500.0,E,1482165300,"[data structures, probabilities]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Display Size,500.0,A,1482113100,"[brute force, math]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Mammoth's Genome Decoding,1000.0,B,1482113100,"[implementation, strings]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Servers,1500.0,C,1482113100,[implementation],PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Winter Is Coming,2000.0,D,1482113100,"[greedy, sortings]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Comments,2000.0,E,1482113100,"[dfs and similar, expression parsing]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Igor and Interesting Numbers,2500.0,F,1482113100,"[brute force, combinatorics, dp]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Compote,500.0,A,1482057300,[math],PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Decoding,1000.0,B,1482057300,"[implementation, strings]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Tram,1500.0,C,1482057300,"[constructive algorithms, implementation, math]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Green and Black Tea,2000.0,D,1482057300,"[constructive algorithms, greedy]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Numbers Exchange,2500.0,E,1482057300,"[greedy, implementation]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Music in Car,3000.0,F,1482057300,"[data structures, greedy, two pointers]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,New Roads,3000.0,G,1482057300,"[constructive algorithms, trees]",PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow Builds A Nation,500.0,A,1481992500,"[dfs and similar, graphs]",PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow's Game,1250.0,B,1481992500,"[bitmasks, divide and conquer]",PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow Buys a Deck of Cards,1750.0,C,1481992500,"[bitmasks, brute force, dp]",PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow Draws a Circle,2250.0,D,1481992500,[geometry],PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow Masters the Cyclic Shift,2500.0,E,1481992500,[strings],PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow Learns the Cyclic Shift,500.0,A,1481992500,"[implementation, strings]",PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow Solves A Puzzle,1000.0,B,1481992500,[implementation],PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow Builds A Nation,1500.0,C,1481992500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow's Game,2250.0,D,1481992500,[bitmasks],PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow Buys a Deck of Cards,2750.0,E,1481992500,[],PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Vladik and flights,500.0,A,1481726100,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Chloe and the sequence ,1000.0,B,1481726100,"[binary search, bitmasks, constructive algorithms, implementation]",PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Vladik and fractions,1250.0,C,1481726100,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Chloe and pleasant prizes,2000.0,D,1481726100,"[dfs and similar, dp, trees]",PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Vladik and cards,2500.0,E,1481726100,"[binary search, bitmasks, brute force, dp]",PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa's loud Owf and Mehrdad's evil plan,500.0,A,1481034900,"[dfs and similar, math]",PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa's weak amphitheater and Mehrdad's valuable Hoses,1000.0,B,1481034900,"[dfs and similar, dp, dsu]",PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa’s overnight party and Mehrdad’s silent entering,1250.0,C,1481034900,"[constructive algorithms, dfs and similar]",PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths,2000.0,D,1481034900,"[data structures, trees]",PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa’s abnormal DNA and Mehrdad’s deep interest,2500.0,E,1481034900,"[data structures, string suffix structures]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa’s hard exam and Mehrdad’s naive cheat,500.0,A,1481034900,"[implementation, math, number theory]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa’s obvious problem and Mehrdad’s terrible solution,1000.0,B,1481034900,"[math, number theory]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa's loud Owf and Mehrdad's evil plan,1500.0,C,1481034900,"[dfs and similar, math]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa's weak amphitheater and Mehrdad's valuable Hoses,2000.0,D,1481034900,"[dfs and similar, dp, dsu]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa’s overnight party and Mehrdad’s silent entering,2250.0,E,1481034900,[],PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Ostap and Grasshopper,500.0,A,1480264500,"[implementation, strings]",PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Urbanization,1000.0,B,1480264500,"[greedy, sortings]",PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Tennis Championship,1750.0,C,1480264500,"[greedy, math]",PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Taxes,1750.0,D,1480264500,"[math, number theory]",PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Ostap and Tree,2500.0,E,1480264500,"[dp, trees]",PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Tennis Championship,750.0,A,1480264500,"[dfs and similar, dp, math]",PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Taxes,750.0,B,1480264500,"[math, number theory]",PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Ostap and Tree,1500.0,C,1480264500,[dp],PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Permutations,2000.0,D,1480264500,[matrices],PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Chess Championship,2500.0,E,1480264500,"[constructive algorithms, flows, greedy]",PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Alyona and mex,500.0,A,1479918900,"[constructive algorithms, greedy]",PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Alyona and a tree,1000.0,B,1479918900,"[binary search, data structures, dfs and similar, graphs, trees]",PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Alyona and towers,1500.0,C,1479918900,[data structures],PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Recover a functional graph,2000.0,D,1479918900,[graph matchings],PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Gosha is hunting,2500.0,E,1479918900,"[brute force, dp, flows, sortings]",PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and copybooks,500.0,A,1479918900,"[brute force, implementation]",PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and flowers,1000.0,B,1479918900,[constructive algorithms],PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and mex,1500.0,C,1479918900,[constructive algorithms],PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and a tree,2000.0,D,1479918900,"[binary search, data structures, dfs and similar, graph matchings, graphs]",PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and towers,2500.0,E,1479918900,[],PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Interview with Oleg,500.0,A,1479632700,"[implementation, strings]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Spotlights,1000.0,B,1479632700,"[dp, implementation]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Road to Cinema,1750.0,C,1479632700,"[binary search, greedy, sortings]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Sea Battle,1750.0,D,1479632700,"[constructive algorithms, greedy]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Subordinates,2000.0,E,1479632700,"[constructive algorithms, data structures, greedy, sortings]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Financiers Game,2500.0,F,1479632700,[dp],PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Road to Cinema,750.0,A,1479632700,[binary search],PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Sea Battle,750.0,B,1479632700,"[greedy, implementation]",PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Subordinates,1000.0,C,1479632700,[greedy],PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Financiers Game,1500.0,D,1479632700,"[dp, games]",PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Tanya is 5!,2000.0,E,1479632700,"[graph matchings, graphs, greedy, schedules]",PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Dirty plates,2500.0,F,1479632700,"[constructive algorithms, math]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Interview with Oleg,500.0,A,1479632700,"[implementation, strings]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Spotlights,1000.0,B,1479632700,"[brute force, dp, implementation]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Road to Cinema,1750.0,C,1479632700,[binary search],PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Sea Battle,1750.0,D,1479632700,"[binary search, constructive algorithms, greedy]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Subordinates,2000.0,E,1479632700,"[constructive algorithms, greedy]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Financiers Game,2500.0,F,1479632700,"[dp, games]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Danik,500.0,A,1479227700,"[implementation, strings]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Digits,750.0,B,1479227700,"[implementation, math]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Making Potions,1250.0,C,1479227700,"[binary search, dp, greedy, two pointers]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Chess,1500.0,D,1479227700,[implementation],PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Tree,2000.0,E,1479227700,"[dfs and similar, dp, trees]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and School,2750.0,F,1479227700,"[bitmasks, constructive algorithms, implementation, math]",PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Grasshopper And the String,500.0,A,1477922700,[implementation],PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Parade,1000.0,B,1477922700,[math],PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Epidemic in Monstropolis,2000.0,C,1477922700,"[constructive algorithms, dp, greedy, two pointers]",PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Kostya the Sculptor,2000.0,D,1477922700,"[data structures, hashing]",PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Sleep in Class,2750.0,E,1477922700,"[data structures, math, two pointers]",PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Drivers Dissatisfaction,3000.0,F,1477922700,"[data structures, dsu, graphs, trees]",PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Toda 2,,A,1477209600,[greedy],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Minimum and Maximum,,B,1477209600,[constructive algorithms],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Bulmart,,C,1477209600,"[binary search, dfs and similar]",PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Running Over The Bridges,,D,1477209600,"[greedy, implementation]",PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Award Ceremony,,E,1477209600,[greedy],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Ber Patio,,F,1477209600,[],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Car Repair Shop,,G,1477209600,[implementation],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Delete Them,,H,1477209600,[implementation],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Olympiad in Programming and Sports,,I,1477209600,"[dp, flows, greedy]",PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Bottles,,J,1477209600,[dp],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Roads Orientation Problem,,K,1477209600,[],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Expression Queries,,L,1477209600,[],PROGRAMMING
+725,Canada Cup 2016,12,Jumping Ball,500.0,A,1477148700,[implementation],PROGRAMMING
+725,Canada Cup 2016,12,Food on the Plane,1000.0,B,1477148700,[math],PROGRAMMING
+725,Canada Cup 2016,12,Hidden Word,1500.0,C,1477148700,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+725,Canada Cup 2016,12,Contest Balloons,2250.0,D,1477148700,"[data structures, greedy]",PROGRAMMING
+725,Canada Cup 2016,12,Too Much Money,2500.0,E,1477148700,[brute force],PROGRAMMING
+725,Canada Cup 2016,12,Family Photos,3250.0,F,1477148700,[greedy],PROGRAMMING
+725,Canada Cup 2016,12,Messages on a Tree,3500.0,G,1477148700,[],PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Buy a Shovel,500.0,A,1476714900,"[brute force, constructive algorithms, math]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Cormen --- The Best Friend Of a Man,1000.0,B,1476714900,"[dp, greedy]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Sanatorium,1500.0,C,1476714900,"[constructive algorithms, greedy]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Exams,2000.0,D,1476714900,"[binary search, greedy, sortings]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Sockets,2000.0,E,1476714900,"[greedy, sortings]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Tourist Reform,2500.0,F,1476714900,[dfs and similar],PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Night at the Museum,500.0,A,1476611100,"[implementation, strings]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Coupons and Discounts,1000.0,B,1476611100,"[constructive algorithms, greedy]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Socks,1500.0,C,1476611100,"[dsu, graphs, greedy]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,80-th Level Archeology,2000.0,D,1476611100,"[brute force, data structures, greedy, sortings]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Funny Game,2500.0,E,1476611100,"[dp, games]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Video Cards,3000.0,F,1476611100,"[brute force, data structures, implementation, number theory]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Transformation: from A to B,1000.0,A,1476522300,"[brute force, dfs and similar]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Bill Total Value,1000.0,B,1476522300,"[expression parsing, implementation]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Guess the Array,1500.0,C,1476522300,"[constructive algorithms, math]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,T-shirts Distribution,1500.0,D,1476522300,"[constructive algorithms, flows, greedy]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Games on a CD,2500.0,E,1476522300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Polycarp's problems,3000.0,F,1476522300,"[binary search, dp, greedy]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Checking the Calendar,500.0,A,1475928900,[implementation],PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Batch Sort,1000.0,B,1475928900,"[brute force, greedy, implementation]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Ray Tracing,1500.0,C,1475928900,"[greedy, hashing, implementation, math, number theory]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Dense Subsequence,1500.0,D,1475928900,"[data structures, greedy]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Goods transportation,2500.0,E,1475928900,"[dp, flows]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Uniformly Branched Trees,2500.0,F,1475928900,[combinatorics],PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Xor-matic Number of the Graph,2500.0,G,1475928900,"[bitmasks, graphs, math, trees]",PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,The New Year: Meeting Friends,500.0,A,1475494500,[sortings],PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,Text Document Analysis,1000.0,B,1475494500,"[expression parsing, implementation]",PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,Polycarp at the Radio,1500.0,C,1475494500,[greedy],PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,Lakes in Berland,2000.0,D,1475494500,"[dfs and similar, dsu, greedy]",PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,One-Way Reform,2500.0,E,1475494500,"[constructive algorithms, dfs and similar, flows, graphs, greedy]",PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,st-Spanning Tree,3000.0,F,1475494500,"[dsu, graphs, greedy, implementation]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Broken Clock,500.0,A,1475330700,"[brute force, implementation]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Verse Pattern,500.0,B,1475330700,"[implementation, strings]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Destroying Array,1000.0,C,1475330700,"[data structures, dsu]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Generating Sets,1500.0,D,1475330700,"[binary search, data structures, dfs and similar, greedy]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Research Rover,2000.0,E,1475330700,"[combinatorics, dp]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Cyclic Cipher,2500.0,F,1475330700,"[chinese remainder theorem, implementation, number theory, two pointers]",PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,One-dimensional Japanese Crossword,500.0,A,1475244300,[implementation],PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,Passwords,1000.0,B,1475244300,"[sortings, strings]",PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,Journey,1500.0,C,1475244300,"[dp, graphs]",PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,Maxim and Array,2000.0,D,1475244300,"[constructive algorithms, data structures, greedy]",PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,Road to Home,2750.0,E,1475244300,"[binary search, dp]",PROGRAMMING
+718,Codeforces Round #373 (Div. 1),1,Efim and Strange Grade,500.0,A,1474635900,[implementation],PROGRAMMING
+718,Codeforces Round #373 (Div. 1),1,Sasha and Array,1250.0,C,1474635900,"[data structures, math, matrices]",PROGRAMMING
+718,Codeforces Round #373 (Div. 1),1,Andrew and Chemistry,2000.0,D,1474635900,"[hashing, trees]",PROGRAMMING
+718,Codeforces Round #373 (Div. 1),1,Matvey's Birthday,2500.0,E,1474635900,[graphs],PROGRAMMING
+719,Codeforces Round #373 (Div. 2),2,Vitya in the Countryside,500.0,A,1474635900,[implementation],PROGRAMMING
+719,Codeforces Round #373 (Div. 2),2,Anatoly and Cockroaches,1000.0,B,1474635900,[greedy],PROGRAMMING
+719,Codeforces Round #373 (Div. 2),2,Efim and Strange Grade,1500.0,C,1474635900,[implementation],PROGRAMMING
+719,Codeforces Round #373 (Div. 2),2,Sasha and Array,2250.0,E,1474635900,"[data structures, math, matrices]",PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Closing ceremony,,A,1474196700,[greedy],PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Cactusophobia,,B,1474196700,"[dfs and similar, flows]",PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Homework,,C,1474196700,[],PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Slalom,,D,1474196700,"[data structures, dp]",PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Cipher,,E,1474196700,[],PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Array Covering,,F,1474196700,[],PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Plus and Square Root,500.0,A,1474119900,"[constructive algorithms, math]",PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Complete The Graph,1000.0,B,1474119900,"[binary search, constructive algorithms, graphs, shortest paths]",PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Digit Tree,1500.0,C,1474119900,"[divide and conquer, dsu]",PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Create a Maze,2500.0,D,1474119900,[constructive algorithms],PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Complete the Permutations,2750.0,E,1474119900,[],PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Crazy Computer,500.0,A,1474119900,[implementation],PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Complete the Word,1000.0,B,1474119900,[two pointers],PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Plus and Square Root,1500.0,C,1474119900,"[constructive algorithms, math, number theory]",PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Complete The Graph,2000.0,D,1474119900,"[graphs, shortest paths]",PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Digit Tree,2500.0,E,1474119900,[divide and conquer],PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Sonya and Queries,500.0,A,1473784500,[data structures],PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Searching Rectangles,1000.0,B,1473784500,"[binary search, constructive algorithms]",PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Sonya and Problem Wihtout a Legend,2000.0,C,1473784500,"[dp, sortings]",PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Animals and Puzzle,2000.0,D,1473784500,"[binary search, data structures]",PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Sonya Partymaker,2000.0,E,1473784500,[],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Meeting of Old Friends,500.0,A,1473784500,[math],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Filya and Homework,1000.0,B,1473784500,[implementation],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Sonya and Queries,1000.0,C,1473784500,[data structures],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Searching Rectangles,2000.0,D,1473784500,[binary search],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Sonya and Problem Wihtout a Legend,3000.0,E,1473784500,"[dp, flows, sortings]",PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Festival Organization,,A,1473584400,"[math, number theory]",PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,R3D3’s Summer Adventure,,B,1473584400,[greedy],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Potions Homework,,C,1473584400,"[implementation, sortings]",PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Dexterina’s Lab,,D,1473584400,"[games, matrices, probabilities]",PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,"Paint it really, really dark gray",,E,1473584400,[dfs and similar],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Heroes of Making Magic III,,F,1473584400,[data structures],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Underfail,,G,1473584400,[flows],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Pokermon League challenge,,H,1473584400,[probabilities],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Cowboy Beblop at his computer,,I,1473584400,[],PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and Crow,500.0,A,1473525900,[implementation],PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and Trident,1000.0,B,1473525900,[implementation],PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and De-Evolution,1500.0,C,1473525900,"[greedy, math]",PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and Scores,2250.0,D,1473525900,"[combinatorics, dp]",PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and Casinos,2500.0,E,1473525900,"[data structures, math, probabilities]",PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Bus to Udayland,500.0,A,1472472300,"[brute force, implementation]",PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Chris and Magic Square,1000.0,B,1472472300,[constructive algorithms],PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Coloring Trees,1500.0,C,1472472300,[dp],PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Directed Roads,2000.0,D,1472472300,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,ZS and The Birthday Paradox,2500.0,E,1472472300,"[math, number theory, probabilities]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Letters Cyclic Shift,500.0,A,1472056500,"[constructive algorithms, implementation]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Recover the String,1000.0,B,1472056500,"[constructive algorithms, implementation, math]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Centroids,1500.0,C,1472056500,"[data structures, dfs and similar, dp, greedy, trees]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Incorrect Flow,2000.0,D,1472056500,[flows],PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Student's Camp,2500.0,E,1472056500,"[dp, math]",PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Juicer,500.0,A,1472056500,[implementation],PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Checkpoints,1000.0,B,1472056500,"[implementation, sortings]",PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Letters Cyclic Shift,1500.0,C,1472056500,[greedy],PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Recover the String,2000.0,D,1472056500,"[greedy, math]",PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Centroids,2500.0,E,1472056500,"[dp, trees]",PROGRAMMING
+710,Educational Codeforces Round 16,12,King Moves,,A,1471875000,[implementation],PROGRAMMING
+710,Educational Codeforces Round 16,12,Optimal Point on a Line,,B,1471875000,"[brute force, sortings]",PROGRAMMING
+710,Educational Codeforces Round 16,12,Magic Odd Square,,C,1471875000,[constructive algorithms],PROGRAMMING
+710,Educational Codeforces Round 16,12,Two Arithmetic Progressions,,D,1471875000,[math],PROGRAMMING
+710,Educational Codeforces Round 16,12,Generate a String,,E,1471875000,"[dfs and similar, dp]",PROGRAMMING
+710,Educational Codeforces Round 16,12,String Set Queries,,F,1471875000,"[brute force, data structures, hashing, string suffix structures, strings]",PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Brain's Photos,500.0,A,1471698300,[implementation],PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Bakery,1000.0,B,1471698300,[graphs],PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Pythagorean Triples,1500.0,C,1471698300,"[math, number theory]",PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Persistent Bookcase ,2000.0,D,1471698300,"[data structures, dfs and similar, implementation]",PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Garlands,2500.0,E,1471698300,[data structures],PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Beru-taxi,500.0,A,1470933300,"[brute force, geometry, implementation]",PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Interesting drink,1000.0,B,1470933300,"[binary search, implementation]",PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Hard problem,1500.0,C,1470933300,[dp],PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Vasiliy's Multiset,2000.0,D,1470933300,"[binary search, data structures, trees]",PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Working routine,2500.0,E,1470933300,"[data structures, implementation]",PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Thor,500.0,A,1470578700,"[brute force, data structures, implementation]",PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Ant Man,1250.0,B,1470578700,"[dp, graphs, greedy]",PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Black Widow,1250.0,C,1470578700,"[dp, implementation]",PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Captain America,2000.0,D,1470578700,[flows],PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Iron Man,2500.0,E,1470578700,"[geometry, trees]",PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Hulk,500.0,A,1470578700,[implementation],PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Spider Man,1000.0,B,1470578700,[games],PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Thor,1500.0,C,1470578700,"[data structures, implementation]",PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Ant Man,2250.0,D,1470578700,"[dp, graphs]",PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Black Widow,2250.0,E,1470578700,[],PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Mishka and Game,500.0,A,1470323700,[implementation],PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Mishka and trip,1000.0,B,1470323700,"[implementation, math]",PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Chris and Road,1750.0,C,1470323700,"[geometry, implementation]",PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Mishka and Interesting sum,2000.0,D,1470323700,[data structures],PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Mishka and Divisors,2250.0,E,1470323700,"[dp, number theory]",PROGRAMMING
+702,Educational Codeforces Round 15,12,Maximum Increase,,A,1469804400,"[dp, greedy, implementation]",PROGRAMMING
+702,Educational Codeforces Round 15,12,Powers of Two,,B,1469804400,"[brute force, data structures, implementation, math]",PROGRAMMING
+702,Educational Codeforces Round 15,12,Cellular Network,,C,1469804400,"[binary search, two pointers]",PROGRAMMING
+702,Educational Codeforces Round 15,12,Road to Post Office,,D,1469804400,[math],PROGRAMMING
+702,Educational Codeforces Round 15,12,Analysis of Pathes in Functional Graph,,E,1469804400,"[data structures, graphs]",PROGRAMMING
+702,Educational Codeforces Round 15,12,T-Shirts,,F,1469804400,[data structures],PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,As Fast As Possible,500.0,A,1469205300,"[binary search, math]",PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,Connecting Universities,1000.0,B,1469205300,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,Break Up,1500.0,C,1469205300,[dfs and similar],PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,Huffman Coding on Segment,2250.0,D,1469205300,"[data structures, greedy]",PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,Cool Slogans,3000.0,E,1469205300,"[string suffix structures, strings]",PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,Cards,500.0,A,1469205300,"[greedy, implementation]",PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,Cells Not Under Attack,750.0,B,1469205300,[math],PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,They Are Everywhere,1000.0,C,1469205300,"[binary search, two pointers]",PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,As Fast As Possible,1500.0,D,1469205300,"[binary search, math]",PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,Connecting Universities,2000.0,E,1469205300,"[dfs and similar, graphs]",PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,Break Up,2500.0,F,1469205300,[graphs],PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Vacations,500.0,A,1468933500,[dp],PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Fix a Tree,1000.0,B,1468933500,"[constructive algorithms, dfs and similar, dsu, trees]",PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,LRU,1500.0,C,1468933500,"[bitmasks, dp, probabilities]",PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Limak and Shooting Points,2000.0,D,1468933500,"[brute force, geometry]",PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Cron,2500.0,E,1468933500,[],PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Coprime Permutation,3000.0,F,1468933500,"[combinatorics, number theory]",PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,Launch of Collider,500.0,A,1468933500,[implementation],PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,One Bomb,1000.0,B,1468933500,[implementation],PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,Vacations,1500.0,C,1468933500,"[brute force, dp]",PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,Fix a Tree,2000.0,D,1468933500,"[constructive algorithms, dfs and similar, dsu]",PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,LRU,2500.0,E,1468933500,"[bitmasks, dp, probabilities]",PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,Limak and Shooting Points,3000.0,F,1468933500,[],PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,Lorenzo Von Matterhorn,500.0,A,1468514100,"[data structures, implementation, trees]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,Puzzles,1000.0,B,1468514100,"[dfs and similar, math, probabilities, trees]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,PLEASE,1500.0,C,1468514100,"[combinatorics, dp, implementation, math, matrices]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,Legen...,2000.0,D,1468514100,"[data structures, dp, matrices, strings]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,...Wait for it...,2500.0,E,1468514100,"[data structures, dsu, trees]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,...Dary!,3000.0,F,1468514100,"[binary search, geometry, two pointers]",PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Pineapple Incident,500.0,A,1468514100,[math],PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Barnicle,1000.0,B,1468514100,[implementation],PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Lorenzo Von Matterhorn,1500.0,C,1468514100,"[data structures, implementation, trees]",PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Puzzles,2000.0,D,1468514100,[],PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,PLEASE,2500.0,E,1468514100,"[math, number theory]",PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Legen...,3000.0,F,1468514100,[],PROGRAMMING
+691,Educational Codeforces Round 14,12,Fashion in Berland,,A,1468425600,[implementation],PROGRAMMING
+691,Educational Codeforces Round 14,12,s-palindrome,,B,1468425600,[implementation],PROGRAMMING
+691,Educational Codeforces Round 14,12,Exponential notation,,C,1468425600,[implementation],PROGRAMMING
+691,Educational Codeforces Round 14,12,Swaps in Permutation,,D,1468425600,"[dfs and similar, dsu]",PROGRAMMING
+691,Educational Codeforces Round 14,12,Xor-sequences,,E,1468425600,[matrices],PROGRAMMING
+691,Educational Codeforces Round 14,12,Couple Cover,,F,1468425600,"[brute force, dp, number theory]",PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (easy),,A1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (medium),,A2,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (hard),,A3,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (easy),,B1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (medium),,B2,1468137600,[geometry],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (hard),,B3,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (easy),,C1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (medium),,C2,1468137600,"[dfs and similar, graphs, trees]",PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (hard),,C3,1468137600,[trees],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (easy),,D1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (medium),,D2,1468137600,[combinatorics],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (hard),,D3,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Photographs (I),,E1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Photographs (II),,E2,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (easy),,F1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (medium),,F2,1468137600,"[constructive algorithms, hashing, trees]",PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (hard),,F3,1468137600,[trees],PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Mike and Cellphone,500.0,A,1467822900,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Mike and Shortcuts,1000.0,B,1467822900,[dfs and similar],PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Mike and Chocolate Thieves,1500.0,C,1467822900,"[binary search, math]",PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Friends and Subsequences,2000.0,D,1467822900,"[binary search, data structures]",PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Mike and Geometry Problem,2500.0,E,1467822900,"[combinatorics, data structures, implementation]",PROGRAMMING
+695,VK Cup 2016 - Finals,12,LRU,1250.0,A,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Break Up,1250.0,B,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Limak and Shooting Points,1250.0,C,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Cron,1750.0,D,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Huffman Coding on Segment,2500.0,E,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Coprime Permutation,2500.0,F,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Cool Slogans,3000.0,G,1467534000,[],PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,NP-Hard Problem,500.0,A,1467219900,"[dfs and similar, graphs]",PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,Remainders Game,1000.0,B,1467219900,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,The Values You Can Make,1500.0,C,1467219900,[dp],PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,Dividing Kingdom II,2000.0,D,1467219900,"[brute force, data structures, dsu, sortings]",PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,TOF,2500.0,E,1467219900,[],PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,Opponents,500.0,A,1467219900,[implementation],PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,Lovely Palindromes,1000.0,B,1467219900,"[constructive algorithms, math]",PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,NP-Hard Problem,1500.0,C,1467219900,"[dfs and similar, graphs]",PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,Remainders Game,2000.0,D,1467219900,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,The Values You Can Make,2500.0,E,1467219900,[dp],PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Robbers' watch,500.0,A,1466699700,"[brute force, dp, math]",PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Kay and Snowflake,1250.0,B,1466699700,"[data structures, dfs and similar, trees]",PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Optimal Point,1250.0,C,1466699700,"[binary search, math]",PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Kay and Eternity,2000.0,D,1466699700,[brute force],PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Travelling Through the Snow Queen's Kingdom,2500.0,E,1466699700,"[brute force, graphs]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Free Ice Cream,500.0,A,1466699700,"[constructive algorithms, implementation]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Little Robber Girl's Zoo,1000.0,B,1466699700,"[constructive algorithms, implementation, sortings]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Robbers' watch,1500.0,C,1466699700,"[brute force, math]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Kay and Snowflake,2250.0,D,1466699700,"[data structures, dfs and similar, trees]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Optimal Point,2250.0,E,1466699700,[],PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and Numbers,500.0,A,1466181300,"[constructive algorithms, number theory]",PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and Mex,1000.0,B,1466181300,[sortings],PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and the Tree,1500.0,C,1466181300,"[dfs and similar, dp, trees]",PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and Strings,2000.0,D,1466181300,"[dp, strings]",PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and Triangles,3000.0,E,1466181300,"[geometry, two pointers]",PROGRAMMING
+683,Surprise Language Round #8,12,The Check of the Point,,A,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,The Teacher of Physical Education,,B,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Symmetric Difference,,C,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Chocolate Bar,,D,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Hammer throwing,,E,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Reformat the String,,F,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,The Fraction,,G,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Exchange of Books,,H,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Loader,,I,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,The Hero with Bombs,,J,1466092800,[*special],PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,A Good Contest,500.0,A,1465922100,[implementation],PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,Economy Game,1000.0,B,1465922100,[brute force],PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,Heap Operations,1500.0,C,1465922100,"[data structures, greedy]",PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,Gifts by the List,2000.0,D,1465922100,"[dfs and similar, trees]",PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,Runaway to a Shadow,2500.0,E,1465922100,[geometry],PROGRAMMING
+678,Educational Codeforces Round 13,12,Johny Likes Numbers,,A,1465834200,[implementation],PROGRAMMING
+678,Educational Codeforces Round 13,12,The Same Calendar,,B,1465834200,[implementation],PROGRAMMING
+678,Educational Codeforces Round 13,12,Joty and Chocolate,,C,1465834200,"[implementation, math, number theory]",PROGRAMMING
+678,Educational Codeforces Round 13,12,Iterated Linear Function,,D,1465834200,"[math, number theory]",PROGRAMMING
+678,Educational Codeforces Round 13,12,Another Sith Tournament,,E,1465834200,"[bitmasks, dp]",PROGRAMMING
+678,Educational Codeforces Round 13,12,Lena and Queries,,F,1465834200,"[data structures, divide and conquer, geometry]",PROGRAMMING
+684,Codeforces Marathon Round 1,12,Online Exam,,A2,1465722000,[*special],PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Prime 100,750.0,A,1465403700,[constructive algorithms],PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Tower of Cubes,1250.0,B,1465403700,"[dp, greedy]",PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Square Grid,1500.0,C,1465403700,"[dfs and similar, dsu, implementation]",PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Chase,2000.0,D,1465403700,"[brute force, dfs and similar, implementation]",PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Bad Powers of 42,2500.0,E,1465403700,[data structures],PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Five Cards,500.0,A,1465403700,"[constructive algorithms, implementation]",PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Finding Criminals,1000.0,B,1465403700,"[constructive algorithms, implementation]",PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Prime 100,1750.0,C,1465403700,"[constructive algorithms, number theory]",PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Tower of Cubes,2250.0,D,1465403700,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Square Grid,2750.0,E,1465403700,[],PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Fence,500.0,A,1464798900,[implementation],PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Food Processor,1000.0,B,1464798900,"[implementation, math]",PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Label,1500.0,C,1464798900,[implementation],PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Treasure,2250.0,D,1464798900,"[data structures, graphs]",PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Balloons,2250.0,E,1464798900,"[binary search, brute force, dp, implementation]",PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,Nicholas and Permutation,500.0,A,1464188700,[implementation],PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,Pyramid of Glasses,1000.0,B,1464188700,[implementation],PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,Vasya and String,1500.0,C,1464188700,"[binary search, dp, two pointers]",PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,Theseus and labyrinth,2250.0,D,1464188700,"[implementation, shortest paths]",PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,The Last Fight Between Human and AI,2250.0,E,1464188700,[math],PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Infinite Sequence,500.0,A,1463416500,[math],PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Restoring Painting,1000.0,B,1463416500,"[brute force, constructive algorithms, math]",PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Money Transfers,1500.0,C,1463416500,"[data structures, greedy, sortings]",PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Tree Construction,2000.0,D,1463416500,"[data structures, trees]",PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Trains and Statistic,2500.0,E,1463416500,"[data structures, dp, greedy]",PROGRAMMING
671,Codeforces Round #352 (Div. 1),1,Recycling Bottles,500.0,A,1462984500,"[dp, greedy]",PROGRAMMING
671,Codeforces Round #352 (Div. 1),1,Robin Hood,1000.0,B,1462984500,"[binary search, greedy]",PROGRAMMING
671,Codeforces Round #352 (Div. 1),1,Ultimate Weirdness of an Array,1500.0,C,1462984500,"[data structures, number theory]",PROGRAMMING
@@ -2787,6 +6791,13 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
672,Codeforces Round #352 (Div. 2),2,Recycling Bottles,1500.0,C,1462984500,"[brute force, geometry, greedy]",PROGRAMMING
672,Codeforces Round #352 (Div. 2),2,Robin Hood,2000.0,D,1462984500,"[binary search, greedy]",PROGRAMMING
672,Codeforces Round #352 (Div. 2),2,Ultimate Weirdness of an Array,2500.0,E,1462984500,[],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bear and Colors,500.0,A,1462633500,[implementation],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bear and Two Paths,1000.0,B,1462633500,[constructive algorithms],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Levels and Regions,1750.0,C,1462633500,[dp],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bearish Fanpages,2250.0,D,1462633500,[],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bear and Destroying Subtrees,2250.0,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bears and Juice,3000.0,F,1462633500,[math],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Choosing Ads,3000.0,G,1462633500,[],PROGRAMMING
673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Game,500.0,A,1462633500,[implementation],PROGRAMMING
673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Problems for Round,750.0,B,1462633500,"[greedy, implementation]",PROGRAMMING
673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Colors,1000.0,C,1462633500,[],PROGRAMMING
@@ -2800,17 +6811,4959 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Destroying Subtrees,2250.0,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING
674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bears and Juice,3000.0,F,1462633500,[combinatorics],PROGRAMMING
674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Choosing Ads,3000.0,G,1462633500,[],PROGRAMMING
-706,Codeforces Round #367 (Div. 2),2,Beru-taxi,500.0,A,1470933300,"[brute force, geometry]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Holidays,500.0,A,1462464300,"[brute force, constructive algorithms]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Game of Robots,750.0,B,1462464300,[implementation],PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Cinema,1000.0,C,1462464300,"[implementation, sortings]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Magic Powder - 1,1000.0,D1,1462464300,"[binary search, brute force]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Magic Powder - 2,500.0,D2,1462464300,[binary search],PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Correct Bracket Sequence Editor,2000.0,E,1462464300,"[data structures, dsu]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Restore a Number,2500.0,F,1462464300,"[constructive algorithms, strings]",PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Reberland Linguistics,500.0,A,1461947700,"[dp, implementation, strings]",PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,World Tour,1000.0,B,1461947700,"[graphs, shortest paths]",PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Codeword,2000.0,C,1461947700,[combinatorics],PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Chain Reaction,2000.0,D,1461947700,[brute force],PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Forensic Examination,3000.0,E,1461947700,"[data structures, string suffix structures]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Pouring Rain,500.0,A,1461947700,"[geometry, math]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Coat of Anticubism,1000.0,B,1461947700,"[constructive algorithms, geometry]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Reberland Linguistics,1500.0,C,1461947700,"[dp, strings]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,World Tour,2000.0,D,1461947700,"[brute force, graphs, shortest paths]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Chain Reaction,3000.0,E,1461947700,[],PROGRAMMING
+642,VK Cup 2016 - Wild Card Round 2,12,Scheduler for Invokers,,A,1461596400,[*special],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Grasshopper,500.0,A,1461515700,[implementation],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Matrix,750.0,B,1461515700,[implementation],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Dance,1000.0,C,1461515700,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Random Variable,1500.0,D,1461515700,"[dp, implementation, math, probabilities]",PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Time Machine,2000.0,E,1461515700,[data structures],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and 2-SAT,3000.0,F,1461515700,[],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Graph,3000.0,G,1461515700,[],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Matrix,500.0,A,1461515700,[],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Dance,1000.0,B,1461515700,[],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Random Variable,1500.0,C,1461515700,[math],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Time Machine,2000.0,D,1461515700,[data structures],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and 2-SAT,3000.0,E,1461515700,[graphs],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Graph,3000.0,F,1461515700,[dp],PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Presents,500.0,A,1461515700,[math],PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Grasshopper,1000.0,B,1461515700,[],PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Matrix,1500.0,C,1461515700,"[constructive algorithms, implementation]",PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Dance,2000.0,D,1461515700,"[data structures, implementation, math]",PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Time Machine,2500.0,E,1461515700,[data structures],PROGRAMMING
+665,Educational Codeforces Round 12,12,Buses Between Cities,,A,1461164400,[implementation],PROGRAMMING
+665,Educational Codeforces Round 12,12,Shopping,,B,1461164400,[brute force],PROGRAMMING
+665,Educational Codeforces Round 12,12,Simple Strings,,C,1461164400,"[dp, greedy, strings]",PROGRAMMING
+665,Educational Codeforces Round 12,12,Simple Subset,,D,1461164400,"[constructive algorithms, greedy]",PROGRAMMING
+665,Educational Codeforces Round 12,12,Beautiful Subarrays,,E,1461164400,"[data structures, divide and conquer]",PROGRAMMING
+665,Educational Codeforces Round 12,12,Four Divisors,,F,1461164400,"[dp, math, number theory]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,Rebus,500.0,A,1460824500,"[constructive algorithms, expression parsing, greedy, math]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,International Olympiad,1000.0,B,1460824500,"[brute force, constructive algorithms, greedy, strings]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,Graph Coloring,1500.0,C,1460824500,[dfs and similar],PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,To Hack or not to Hack,2500.0,D,1460824500,"[brute force, dp, greedy]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,Binary Table,2500.0,E,1460824500,"[bitmasks, divide and conquer, dp]",PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,Complicated GCD,500.0,A,1460824500,[math],PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,Rebus,1000.0,B,1460824500,[greedy],PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,International Olympiad,1500.0,C,1460824500,[greedy],PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,Graph Coloring,2000.0,D,1460824500,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,To Hack or not to Hack,3000.0,E,1460824500,[],PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Gambling Nim,500.0,A,1460729700,"[bitmasks, math, matrices, probabilities]",PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Graph Coloring,250.0,B,1460729700,[dfs and similar],PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Binary Table,2250.0,C,1460729700,"[bitmasks, brute force, divide and conquer, dp, fft, math]",PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,International Olympiad,250.0,D,1460729700,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,To Hack or not to Hack,2250.0,E,1460729700,"[brute force, dp, greedy]",PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Seasons,,B,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Array Sum,,C,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Seasons,,B,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Array Sum,,C,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING
+660,Educational Codeforces Round 11,12,Co-prime Array,,A,1460127600,"[greedy, implementation]",PROGRAMMING
+660,Educational Codeforces Round 11,12,Seating On Bus,,B,1460127600,[implementation],PROGRAMMING
+660,Educational Codeforces Round 11,12,Hard Process,,C,1460127600,"[binary search, dp, two pointers]",PROGRAMMING
+660,Educational Codeforces Round 11,12,Number of Parallelograms,,D,1460127600,[geometry],PROGRAMMING
+660,Educational Codeforces Round 11,12,Different Subsets For All Tuples,,E,1460127600,[combinatorics],PROGRAMMING
+660,Educational Codeforces Round 11,12,Bear and Bowling 4,,F,1460127600,"[binary search, data structures, geometry, ternary search]",PROGRAMMING
+656,April Fools Day Contest 2016,12,Da Vinci Powers,,A,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Scrambled,,B,1459526400,"[*special, implementation]",PROGRAMMING
+656,April Fools Day Contest 2016,12,Without Text,,C,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Rosetta Problem,,D,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Out of Controls,,E,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Ace It!,,F,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,You're a Professional,,G,1459526400,[*special],PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Round House,500.0,A,1459353900,"[implementation, math]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Qualifying Contest,1000.0,B,1459353900,[sortings],PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Tanya and Toys,1000.0,C,1459353900,"[greedy, implementation]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Bicycle Race,1250.0,D,1459353900,"[geometry, implementation, math]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,New Reform,1500.0,E,1459353900,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Polycarp and Hay,2000.0,F,1459353900,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Fence Divercity,2500.0,G,1459353900,"[combinatorics, dp]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Displayed Friends,500.0,A,1459182900,[implementation],PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Forgotten Tree 3,750.0,B,1459182900,"[constructive algorithms, graphs, trees]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Polynomials,1000.0,C,1459182900,"[hashing, implementation, math]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Contribution,1500.0,D,1459182900,"[data structures, greedy, sortings]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Paradox,2000.0,E,1459182900,"[greedy, math, sortings]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Chemistry,3000.0,F,1459182900,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Forgotten Tree 3,500.0,A,1459182900,[graphs],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Polynomials,1000.0,B,1459182900,[math],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Contribution,1500.0,C,1459182900,[sortings],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Paradox,2000.0,D,1459182900,[sortings],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Chemistry,3000.0,E,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Reverse Radewoosh,500.0,A,1459182900,[implementation],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Displayed Friends,1000.0,B,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Forgotten Tree 3,1500.0,C,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Polynomials,2000.0,D,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Contribution,2500.0,E,1459182900,[],PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Любимые числа Поликарпа,500.0,A,1458975600,[constructive algorithms],PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Этажи,1000.0,B,1458975600,[constructive algorithms],PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Печать условий,1500.0,C,1458975600,"[greedy, sortings]",PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Дефрагментация памяти,2000.0,D,1458975600,"[greedy, implementation]",PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Автобус,2500.0,E,1458975600,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+652,Educational Codeforces Round 10,12,Gabriel and Caterpillar,,A,1458910800,[implementation],PROGRAMMING
+652,Educational Codeforces Round 10,12,z-sort,,B,1458910800,[sortings],PROGRAMMING
+652,Educational Codeforces Round 10,12,Foe Pairs,,C,1458910800,[two pointers],PROGRAMMING
+652,Educational Codeforces Round 10,12,Nested Segments,,D,1458910800,"[data structures, sortings]",PROGRAMMING
+652,Educational Codeforces Round 10,12,Pursuit For Artifacts,,E,1458910800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+652,Educational Codeforces Round 10,12,Ants on a Circle,,F,1458910800,"[constructive algorithms, math]",PROGRAMMING
+647,Технокубок 2016 - Ознакомительный Раунд 2,12,Оценки Васи,500.0,A,1458799200,[],PROGRAMMING
+647,Технокубок 2016 - Ознакомительный Раунд 2,12,Звёздное небо,1000.0,B,1458799200,[],PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Наибольший подъем,500.0,A,1458745200,[constructive algorithms],PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Собери стол,1000.0,B,1458745200,"[constructive algorithms, sortings]",PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Путь Робота,1500.0,C,1458745200,"[dfs and similar, graphs]",PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Собачки и миски,2000.0,D,1458745200,"[greedy, sortings]",PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Собери число,2500.0,E,1458745200,[],PROGRAMMING
+646,Технокубок 2016 - Ознакомительный Раунд 1,12,Три брата,500.0,A,1458568800,[],PROGRAMMING
+646,Технокубок 2016 - Ознакомительный Раунд 1,12,Ошибка передачи сообщения,1000.0,B,1458568800,[strings],PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Home Numbers,500.0,A,1458475200,[constructive algorithms],PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Making Genome in Berland,1000.0,B,1458475200,"[*special, dfs and similar, strings]",PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Road Improvement,1500.0,C,1458475200,"[dfs and similar, greedy, trees]",PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Three-dimensional Turtle Super Computer ,2000.0,D,1458475200,"[brute force, dfs and similar, graphs]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Three Balls,500.0,A,1458376500,"[brute force, implementation, sortings]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Compressing,1000.0,B,1458376500,"[brute force, dfs and similar, dp, strings]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Up-Down,1500.0,C,1458376500,"[brute force, implementation]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Delivery Bears,2000.0,D,1458376500,"[binary search, flows]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Forgotten Tree 2,2500.0,E,1458376500,"[dfs and similar, dsu, graphs]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Paper task,3500.0,F,1458376500,"[data structures, string suffix structures]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Move by Prime,3500.0,G,1458376500,[combinatorics],PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Amity Assessment,500.0,A,1458318900,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Mischievous Mess Makers,1000.0,B,1458318900,"[greedy, math]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, dp, graphs]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, math, number theory]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Armistice Area Apportionment,3500.0,G,1458318900,"[binary search, geometry]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Amity Assessment,500.0,A,1458318900,[],PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Mischievous Mess Makers,1000.0,B,1458318900,[],PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, graphs]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, number theory]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Armistice Area Apportionment,3500.0,G,1458318900,[geometry],PROGRAMMING
+644,CROC 2016 - Qualification,12,Parliament of Berland,500.0,A,1458118800,[constructive algorithms],PROGRAMMING
+644,CROC 2016 - Qualification,12,Processing Queries,1000.0,B,1458118800,"[data structures, two pointers]",PROGRAMMING
+644,CROC 2016 - Qualification,12,Hostname Aliases,1500.0,C,1458118800,"[binary search, data structures, sortings, strings]",PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Voting for Photos,500.0,A,1457870400,[implementation],PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Chat Order,1000.0,B,1457870400,"[binary search, data structures, sortings]",PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Promocodes with Mistakes,1500.0,C,1457870400,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Running with Obstacles,2000.0,D,1457870400,"[data structures, dp, greedy]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Watchmen,500.0,A,1457342700,"[data structures, math]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Image Preview,1000.0,B,1457342700,"[binary search, dp, two pointers]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Table Compression,1500.0,C,1457342700,"[dfs and similar, dp, dsu, graphs, greedy]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Zip-line,2000.0,D,1457342700,"[binary search, data structures, dp]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Clockwork Bomb,2500.0,E,1457342700,"[data structures, dfs and similar, dsu, trees]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Joysticks,500.0,A,1457342700,"[dp, greedy]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Beautiful Paintings,1000.0,B,1457342700,"[greedy, sortings]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Watchmen,1500.0,C,1457342700,"[data structures, geometry, implementation, sortings]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Image Preview,2000.0,D,1457342700,"[binary search, dp, two pointers]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Table Compression,2500.0,E,1457342700,"[dsu, graphs, greedy]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Interview,500.0,A,1457022900,"[brute force, implementation]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Print Check,1000.0,B,1457022900,"[constructive algorithms, implementation]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Report,1500.0,C,1457022900,"[data structures, sortings]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Messenger,2000.0,D,1457022900,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Product Sum,2500.0,E,1457022900,"[data structures, dp, geometry]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Grandma Laura and Apples,,A,1456844400,[],PROGRAMMING
+632,Educational Codeforces Round 9,12,"Alice, Bob, Two Teams",,B,1456844400,"[brute force, constructive algorithms]",PROGRAMMING
+632,Educational Codeforces Round 9,12,The Smallest String Concatenation,,C,1456844400,"[sortings, strings]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Longest Subsequence,,D,1456844400,"[brute force, math, number theory]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Thief in a Shop,,E,1456844400,"[divide and conquer, dp, fft]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Magic Matrix,,F,1456844400,"[brute force, divide and conquer, graphs, trees]",PROGRAMMING
+636,VeeRoute Marathon,12,Transfer,,A,1456765200,[*special],PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,XOR Equation,500.0,A,1456683000,"[dp, math]",PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Factory Repairs,1000.0,B,1456683000,[data structures],PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Package Delivery,1500.0,C,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Preorder Test,2000.0,D,1456683000,"[binary search, dp, trees]",PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Orchestra,2500.0,E,1456683000,[two pointers],PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Island Puzzle,3000.0,F,1456683000,"[dfs and similar, graphs, trees]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Island Puzzle,500.0,A,1456683000,"[constructive algorithms, implementation]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,XOR Equation,1000.0,B,1456683000,"[constructive algorithms, dp, implementation]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Factory Repairs,1500.0,C,1456683000,[data structures],PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Package Delivery,2000.0,D,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Preorder Test,2500.0,E,1456683000,[],PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Orchestra,3000.0,F,1456683000,[two pointers],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Orchestra,500.0,A,1456683000,"[brute force, implementation]",PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Island Puzzle,1000.0,B,1456683000,[],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,XOR Equation,1500.0,C,1456683000,[dp],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Factory Repairs,2000.0,D,1456683000,[],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Package Delivery,2500.0,E,1456683000,"[data structures, greedy]",PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Preorder Test,3000.0,F,1456683000,[],PROGRAMMING
+633,"Manthan, Codefest 16",12,Ebony and Ivory,250.0,A,1456506900,"[brute force, math, number theory]",PROGRAMMING
+633,"Manthan, Codefest 16",12,A Trivial Problem,500.0,B,1456506900,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Spy Syndrome 2,1500.0,C,1456506900,"[data structures, dp, hashing, implementation, sortings, string suffix structures, strings]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Fibonacci-ish,1750.0,D,1456506900,"[brute force, hashing, implementation, math]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Startup Funding,2500.0,E,1456506900,"[binary search, data structures, probabilities, two pointers]",PROGRAMMING
+633,"Manthan, Codefest 16",12,The Chocolate Spree,2750.0,F,1456506900,"[dfs and similar, dp, trees]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Yash And Trees,3000.0,G,1456506900,"[bitmasks, data structures, dfs and similar]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Fibonacci-ish II,3000.0,H,1456506900,"[data structures, implementation]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Far Relative’s Birthday Cake,500.0,A,1455986100,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Far Relative’s Problem,1000.0,B,1455986100,[brute force],PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Famil Door and Brackets,1750.0,C,1455986100,"[dp, strings]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Babaei and Birthday Cake,2000.0,D,1455986100,"[data structures, dp]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Famil Door and Roads,2500.0,E,1455986100,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING
+628,Educational Codeforces Round 8,12,Tennis Tournament,,A,1455894000,[implementation],PROGRAMMING
+628,Educational Codeforces Round 8,12,New Skateboard,,B,1455894000,[dp],PROGRAMMING
+628,Educational Codeforces Round 8,12,Bear and String Distance,,C,1455894000,[greedy],PROGRAMMING
+628,Educational Codeforces Round 8,12,Magic Numbers,,D,1455894000,[dp],PROGRAMMING
+628,Educational Codeforces Round 8,12,Zbazi in Zeydabad,,E,1455894000,"[data structures, implementation]",PROGRAMMING
+628,Educational Codeforces Round 8,12,Bear and Fair Set,,F,1455894000,[flows],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Again Twenty Five!,,A,1455807600,[number theory],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Moore's Law,,B,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Lucky Numbers,,C,1455807600,"[combinatorics, math]",PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Hexagons!,,D,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,A rectangle,,E,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Selection of Personnel,,F,1455807600,"[combinatorics, math]",PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Challenge Pennants,,G,1455807600,[combinatorics],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Benches,,H,1455807600,[combinatorics],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Parking Lot,,I,1455807600,[combinatorics],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Divisibility,,J,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Indivisibility,,K,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Cracking the Code,,L,1455807600,[implementation],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Turn,,M,1455807600,"[geometry, math]",PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Forecast,,N,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Arrow,,O,1455807600,[geometry],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Area of a Star,,P,1455807600,[geometry],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Pyramids,,Q,1455807600,[geometry],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Game,,R,1455807600,[games],PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Robot Sequence,500.0,A,1455384900,"[brute force, implementation]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Cards,750.0,B,1455384900,"[constructive algorithms, dp]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Block Towers,1000.0,C,1455384900,"[brute force, greedy]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Jerry's Protest,1500.0,D,1455384900,"[brute force, combinatorics, probabilities]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Simple Skewness,2000.0,E,1455384900,"[binary search, math, ternary search]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Group Projects,2500.0,F,1455384900,[dp],PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Raffles,3000.0,G,1455384900,"[data structures, greedy]",PROGRAMMING
+622,Educational Codeforces Round 7,12,Infinite Sequence,,A,1455116400,"[implementation, math]",PROGRAMMING
+622,Educational Codeforces Round 7,12,The Time,,B,1455116400,[implementation],PROGRAMMING
+622,Educational Codeforces Round 7,12,Not Equal on a Segment,,C,1455116400,"[data structures, implementation]",PROGRAMMING
+622,Educational Codeforces Round 7,12,Optimal Number Permutation,,D,1455116400,[constructive algorithms],PROGRAMMING
+622,Educational Codeforces Round 7,12,Ants in Leaves,,E,1455116400,"[dfs and similar, greedy, trees]",PROGRAMMING
+622,Educational Codeforces Round 7,12,The Sum of the k-th Powers,,F,1455116400,[math],PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,Guest From the Past,750.0,A,1454835900,"[implementation, math]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,War of the Corporations,750.0,B,1454835900,"[constructive algorithms, strings]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,K-special Tables,1000.0,C,1454835900,"[constructive algorithms, implementation]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,Finals in arithmetic,2000.0,D,1454835900,"[constructive algorithms, implementation]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,Frog Fights,3000.0,E,1454835900,"[data structures, greedy]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Graph and String,500.0,A,1454605500,"[constructive algorithms, graphs]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Array GCD,1000.0,B,1454605500,"[dp, greedy, number theory]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Electric Charges,1750.0,C,1454605500,[binary search],PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Birthday,2000.0,D,1454605500,"[greedy, probabilities]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Transforming Sequence,2250.0,E,1454605500,"[combinatorics, dp, fft]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Save Luke,500.0,A,1454605500,[math],PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Making a String,1000.0,B,1454605500,"[greedy, sortings]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Graph and String,1500.0,C,1454605500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Array GCD,2000.0,D,1454605500,"[dp, greedy, number theory]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Electric Charges,3000.0,E,1454605500,[],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Odd and Even,500.0,A,1454249100,[implementation],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Bishops,1000.0,B,1454249100,[combinatorics],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Flowers,1500.0,C,1454249100,[probabilities],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Rat Kwesh and Cheese,2000.0,D,1454249100,"[brute force, math]",PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Blocks,2500.0,E,1454249100,"[dp, matrices]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Slime Combining,500.0,A,1454087400,[implementation],PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Guess the Permutation,1000.0,B,1454087400,[constructive algorithms],PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Constellation,1500.0,C,1454087400,"[geometry, implementation]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Hamiltonian Spanning Tree,1750.0,D,1454087400,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Robot Arm,2500.0,E,1454087400,[data structures],PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Double Knapsack,2750.0,F,1454087400,"[constructive algorithms, two pointers]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Combining Slimes,3500.0,G,1454087400,"[dp, matrices, probabilities]",PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Elephant,500.0,A,1453563300,[math],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Chocolate,1000.0,B,1453563300,[combinatorics],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Watering Flowers,1250.0,C,1453563300,[implementation],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Polyline,1750.0,D,1453563300,[constructive algorithms],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,XOR and Favorite Number,2750.0,E,1453563300,[data structures],PROGRAMMING
+620,Educational Codeforces Round 6,12,Professor GukiZ's Robot,,A,1453388400,"[implementation, math]",PROGRAMMING
+620,Educational Codeforces Round 6,12,Grandfather Dovlet’s calculator,,B,1453388400,[implementation],PROGRAMMING
+620,Educational Codeforces Round 6,12,Pearls in a Row,,C,1453388400,[greedy],PROGRAMMING
+620,Educational Codeforces Round 6,12,Professor GukiZ and Two Arrays,,D,1453388400,"[binary search, two pointers]",PROGRAMMING
+620,Educational Codeforces Round 6,12,New Year Tree,,E,1453388400,"[bitmasks, data structures]",PROGRAMMING
+620,Educational Codeforces Round 6,12,Xors on Segments,,F,1453388400,[data structures],PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Peter and Snow Blower,750.0,A,1452789300,"[binary search, geometry, ternary search]",PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Skills,1250.0,B,1452789300,"[binary search, brute force, two pointers]",PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Necklace,1250.0,C,1452789300,[constructive algorithms],PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Kingdom and its Cities,2000.0,D,1452789300,"[dfs and similar, divide and conquer, graphs, sortings, trees]",PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Puzzle Lover,2500.0,E,1452789300,"[dp, hashing, strings]",PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Link/Cut Tree,500.0,A,1452789300,[brute force],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Gena's Code,1000.0,B,1452789300,[implementation],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Peter and Snow Blower,1750.0,C,1452789300,[],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Skills,2250.0,D,1452789300,[],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Necklace,2250.0,E,1452789300,[],PROGRAMMING
+616,Educational Codeforces Round 5,12,Comparing Two Long Integers,,A,1452524400,"[implementation, strings]",PROGRAMMING
+616,Educational Codeforces Round 5,12,Dinner with Emma,,B,1452524400,"[games, greedy]",PROGRAMMING
+616,Educational Codeforces Round 5,12,The Labyrinth,,C,1452524400,[dfs and similar],PROGRAMMING
+616,Educational Codeforces Round 5,12,Longest k-Good Segment,,D,1452524400,"[binary search, data structures, two pointers]",PROGRAMMING
+616,Educational Codeforces Round 5,12,Sum of Remainders,,E,1452524400,"[implementation, math, number theory]",PROGRAMMING
+616,Educational Codeforces Round 5,12,Expensive Strings,,F,1452524400,"[string suffix structures, strings]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Bulbs,500.0,A,1452261900,[implementation],PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Longtail Hedgehog,1250.0,B,1452261900,"[dp, graphs]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Running Track,1750.0,C,1452261900,"[dp, greedy, strings, trees]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Multipliers,2000.0,D,1452261900,"[math, number theory]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Hexagons,2500.0,E,1452261900,"[binary search, implementation, math]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Days,500.0,A,1451487900,[implementation],PROGRAMMING
+611,Good Bye 2015,12,New Year and Old Property,750.0,B,1451487900,"[brute force, implementation]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Domino,1250.0,C,1451487900,"[dp, implementation]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Ancient Prophecy,1750.0,D,1451487900,"[hashing, strings]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Three Musketeers,2500.0,E,1451487900,"[data structures, greedy]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Cleaning,2500.0,F,1451487900,"[binary search, implementation]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Cake,3000.0,G,1451487900,"[geometry, two pointers]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Forgotten Tree,3500.0,H,1451487900,"[constructive algorithms, flows]",PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Pasha and Stick,500.0,A,1451215200,"[combinatorics, math]",PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Vika and Squares,1000.0,B,1451215200,[implementation],PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Harmony Analysis,1500.0,C,1451215200,[constructive algorithms],PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Vika and Segments,2500.0,D,1451215200,"[data structures, geometry, two pointers]",PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Alphabet Permutations,2500.0,E,1451215200,"[data structures, strings]",PROGRAMMING
+612,Educational Codeforces Round 4,12,The Text Splitting,,A,1451055600,"[brute force, implementation, strings]",PROGRAMMING
+612,Educational Codeforces Round 4,12,HDD is Outdated Technology,,B,1451055600,[implementation],PROGRAMMING
+612,Educational Codeforces Round 4,12,Replace To Make Regular Bracket Sequence,,C,1451055600,"[data structures, expression parsing, math]",PROGRAMMING
+612,Educational Codeforces Round 4,12,The Union of k-Segments,,D,1451055600,[sortings],PROGRAMMING
+612,Educational Codeforces Round 4,12,Square Root of Permutation,,E,1451055600,"[combinatorics, constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+612,Educational Codeforces Round 4,12,Simba on the Circle,,F,1451055600,[dp],PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Chain Reaction,500.0,A,1450888500,"[binary search, dp]",PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Zuma,1250.0,B,1450888500,[dp],PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Marbles,1500.0,C,1450888500,"[hashing, strings]",PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Power Tree,2000.0,D,1450888500,[data structures],PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Cross Sum,3000.0,E,1450888500,"[binary search, geometry]",PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Saitama Destroys Hotel,500.0,A,1450888500,"[implementation, math]",PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Hamming Distance Sum,1000.0,B,1450888500,[combinatorics],PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Chain Reaction,1500.0,C,1450888500,[dp],PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Zuma,2250.0,D,1450888500,[],PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Marbles,2500.0,E,1450888500,[],PROGRAMMING
+609,Educational Codeforces Round 3,12,USB Flash Drives,,A,1450537200,"[greedy, implementation, sortings]",PROGRAMMING
+609,Educational Codeforces Round 3,12,The Best Gift,,B,1450537200,[implementation],PROGRAMMING
+609,Educational Codeforces Round 3,12,Load Balancing,,C,1450537200,[implementation],PROGRAMMING
+609,Educational Codeforces Round 3,12,Gadgets for dollars and pounds,,D,1450537200,"[binary search, two pointers]",PROGRAMMING
+609,Educational Codeforces Round 3,12,Minimum spanning tree for each edge,,E,1450537200,"[data structures, dfs and similar, dsu, graphs, trees]",PROGRAMMING
+609,Educational Codeforces Round 3,12,Frogs and mosquitoes,,F,1450537200,[data structures],PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Sorting Railway Cars,500.0,A,1449677100,"[constructive algorithms, greedy]",PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Lazy Student,1000.0,B,1449677100,"[constructive algorithms, data structures, graphs]",PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Freelancer's Dreams,1500.0,C,1449677100,[geometry],PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Board Game,2000.0,D,1449677100,"[data structures, dfs and similar]",PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Intergalaxy Trips,2500.0,E,1449677100,"[probabilities, shortest paths]",PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Magic Spheres,500.0,A,1449677100,[implementation],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Testing Robots,1000.0,B,1449677100,[implementation],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Sorting Railway Cars,1500.0,C,1449677100,[],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Lazy Student,2000.0,D,1449677100,[graphs],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Freelancer's Dreams,2500.0,E,1449677100,[],PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Alternative Thinking,500.0,A,1448984100,"[dp, greedy]",PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Moodular Arithmetic,1000.0,B,1448984100,"[dfs and similar, dsu, math, number theory]",PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Lieges of Legendre,1500.0,C,1448984100,[games],PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Ruminations on Ruminants,2000.0,D,1448984100,"[geometry, math]",PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Pastoral Oddities,3000.0,E,1448984100,"[data structures, divide and conquer, dsu, trees]",PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Uncowed Forces,500.0,A,1448984100,[implementation],PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,More Cowbell,1000.0,B,1448984100,"[binary search, greedy]",PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Alternative Thinking,1500.0,C,1448984100,"[constructive algorithms, dp, math]",PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Moodular Arithmetic,2000.0,D,1448984100,[dsu],PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Lieges of Legendre,2500.0,E,1448984100,[],PROGRAMMING
+600,Educational Codeforces Round 2,12,Extract Numbers,,A,1448636400,[implementation],PROGRAMMING
+600,Educational Codeforces Round 2,12,Queries about less or equal elements,,B,1448636400,"[binary search, sortings, two pointers]",PROGRAMMING
+600,Educational Codeforces Round 2,12,Make Palindrome,,C,1448636400,[greedy],PROGRAMMING
+600,Educational Codeforces Round 2,12,Area of Two Circles' Intersection,,D,1448636400,[geometry],PROGRAMMING
+600,Educational Codeforces Round 2,12,Lomsat gelral,,E,1448636400,"[dfs and similar, dsu, trees]",PROGRAMMING
+600,Educational Codeforces Round 2,12,Edge coloring of bipartite graph,,F,1448636400,[graphs],PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,The Two Routes,500.0,A,1448382900,"[graphs, shortest paths]",PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,Lipshitz Sequence,1250.0,B,1448382900,[data structures],PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,Kleofáš and the n-thlon,1250.0,C,1448382900,"[dp, probabilities]",PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,Acyclic Organic Compounds,2000.0,D,1448382900,"[data structures, dfs and similar, dsu, hashing, trees]",PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,A Museum Robbery,2500.0,E,1448382900,"[data structures, dp]",PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Two Bases,500.0,A,1448382900,[implementation],PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Approximating a Constant Range,1000.0,B,1448382900,"[dp, two pointers]",PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,The Two Routes,1500.0,C,1448382900,[],PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Lipshitz Sequence,2250.0,D,1448382900,[],PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Kleofáš and the n-thlon,2250.0,E,1448382900,[probabilities],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Patrick and Shopping,500.0,A,1448037300,[implementation],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Spongebob and Joke,1000.0,B,1448037300,[implementation],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Day at the Beach,1500.0,C,1448037300,[sortings],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Spongebob and Squares,2000.0,D,1448037300,"[brute force, math]",PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Sandy and Nuts,3000.0,E,1448037300,"[bitmasks, dp]",PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Swimming Pool,500.0,A,1447605300,[implementation],PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Array,1000.0,B,1447605300,[greedy],PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Points,1500.0,C,1447605300,"[greedy, sortings]",PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Trees,2250.0,D,1447605300,"[dp, probabilities, sortings]",PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Strings,2500.0,E,1447605300,"[dfs and similar, dp, graphs]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Tricky Sum,,A,1447426800,[math],PROGRAMMING
+598,Educational Codeforces Round 1,12,Queries on a String,,B,1447426800,"[implementation, strings]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Nearest vectors,,C,1447426800,"[geometry, sortings]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Igor In the Museum,,D,1447426800,[dfs and similar],PROGRAMMING
+598,Educational Codeforces Round 1,12,Chocolate Bar,,E,1447426800,"[brute force, dp]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Cut Length,,F,1447426800,[geometry],PROGRAMMING
+597,Testing Round #12,12,Divisibility,500.0,A,1447264800,[math],PROGRAMMING
+597,Testing Round #12,12,Restaurant,1000.0,B,1447264800,"[dp, greedy, sortings]",PROGRAMMING
+597,Testing Round #12,12,Subsequences,1500.0,C,1447264800,"[data structures, dp]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Warrior and Archer,500.0,A,1447000200,[games],PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Max and Bike,1000.0,B,1447000200,"[binary search, geometry]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Edo and Magnets,1500.0,C,1447000200,"[brute force, two pointers]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,REQ,2000.0,D,1447000200,"[data structures, number theory]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Cutting the Line,3000.0,E,1447000200,"[string suffix structures, strings]",PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Vitaly and Night,500.0,A,1447000200,[implementation],PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Pasha and Phone,1000.0,B,1447000200,"[binary search, math]",PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Warrior and Archer,1500.0,C,1447000200,[games],PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Max and Bike,2000.0,D,1447000200,[],PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Edo and Magnets,2500.0,E,1447000200,[],PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,2Char,250.0,A,1446655500,[brute force],PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Anton and Lines,1000.0,B,1446655500,"[geometry, sortings]",PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Beautiful Function,3000.0,C,1446655500,"[constructive algorithms, math]",PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Happy Tree Party,3000.0,D,1446655500,"[data structures, trees]",PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Strange Calculation and Cats,3000.0,E,1446655500,"[dp, matrices]",PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,PawnChess,500.0,A,1446309000,[implementation],PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,The Monster and the Squirrel,1000.0,B,1446309000,[math],PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,The Big Race,1500.0,C,1446309000,[math],PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,Super M,2000.0,D,1446309000,"[dfs and similar, dp, trees]",PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,BCPC,3000.0,E,1446309000,"[binary search, geometry, two pointers]",PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Median Smoothing,750.0,A,1445763600,[],PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Chip 'n Dale Rescue Rangers,1000.0,B,1445763600,"[binary search, geometry, math]",PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Three States,1250.0,C,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Top Secret Task,1750.0,D,1445763600,[dp],PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Birthday,2500.0,E,1445763600,"[graph matchings, strings]",PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Wizards' Duel,500.0,A,1445763600,[math],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Rebranding,1000.0,B,1445763600,[implementation],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Median Smoothing,1750.0,C,1445763600,[constructive algorithms],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Chip 'n Dale Rescue Rangers,2000.0,D,1445763600,[],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Three States,2250.0,E,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Email Aliases,,A,1445068800,[implementation],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Layer Cake,,B,1445068800,[sortings],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Polycarp's Masterpiece,,C,1445068800,"[data structures, divide and conquer, dp]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Boulevard,,D,1445068800,"[brute force, implementation]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Training with Doors,,E,1445068800,[],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Gourmet and Banquet,,F,1445068800,"[binary search, flows, greedy]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Hiring,,G,1445068800,"[binary search, data structures]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Tourist Guide,,H,1445068800,[dfs and similar],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lottery,,I,1445068800,[implementation],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Cleaner Robot,,J,1445068800,"[dfs and similar, implementation]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Task processing,,K,1445068800,"[brute force, math]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Agricultural Archaeology,,L,1445068800,"[greedy, math]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Taxi in Berland,,M,1445068800,[shortest paths],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff and Weight Lifting,500.0,A,1444926600,[greedy],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff in Beach,1000.0,B,1444926600,[dp],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff in the Army,1500.0,C,1444926600,"[data structures, trees]",PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff in Mafia,2000.0,D,1444926600,"[2-sat, binary search]",PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff as a Queen,2750.0,E,1444926600,[data structures],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff is Mad,2750.0,F,1444926600,"[data structures, strings]",PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff and Meat,750.0,A,1444926600,[greedy],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in Love,1000.0,B,1444926600,[math],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff and Weight Lifting,1500.0,C,1444926600,[],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in Beach,2000.0,D,1444926600,[],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in the Army,2500.0,E,1444926600,"[data structures, dfs and similar, trees]",PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in Mafia,3000.0,F,1444926600,[],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Gennady the Dentist,500.0,A,1444641000,"[brute force, implementation]",PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Phillip and Trains,750.0,B,1444641000,[dfs and similar],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,"Alice, Bob, Oranges and Apples",1250.0,C,1444641000,[number theory],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Lizard Era: Beginning,1750.0,D,1444641000,[meet-in-the-middle],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Present for Vitalik the Philatelist ,2250.0,E,1444641000,"[combinatorics, math, number theory]",PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Digits of Number Pi,3000.0,F,1444641000,"[dp, implementation, strings]",PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Alena's Schedule,500.0,A,1444641000,[implementation],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Laurenty and Shop,1000.0,B,1444641000,[implementation],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Gennady the Dentist,1500.0,C,1444641000,[implementation],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Phillip and Trains,1750.0,D,1444641000,[dp],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,"Alice, Bob, Oranges and Apples",2250.0,E,1444641000,[number theory],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Lizard Era: Beginning,2750.0,F,1444641000,[meet-in-the-middle],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Olesya and Rodion,500.0,A,1444149000,[math],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Kolya and Tanya ,1000.0,B,1444149000,[combinatorics],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Marina and Vasya,1500.0,C,1444149000,"[constructive algorithms, greedy]",PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Dima and Lisa,2000.0,D,1444149000,[number theory],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Anton and Ira,2500.0,E,1444149000,"[constructive algorithms, greedy]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,GCD Table,750.0,A,1443890700,"[constructive algorithms, greedy]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Once Again...,1250.0,B,1443890700,"[dp, matrices]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Superior Periodic Subarrays,1500.0,C,1443890700,[number theory],PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Number of Binominal Coefficients,2250.0,D,1443890700,"[dp, number theory]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Boolean Function,2500.0,E,1443890700,"[bitmasks, dp, expression parsing]",PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Asphalting Roads,500.0,A,1443890700,[implementation],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Robot's Task,1000.0,B,1443890700,[implementation],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,GCD Table,1750.0,C,1443890700,[],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Once Again...,2250.0,D,1443890700,[],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Superior Periodic Subarrays,2500.0,E,1443890700,[number theory],PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Vasya the Hipster,500.0,A,1443430800,[implementation],PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Luxurious Houses,1000.0,B,1443430800,[implementation],PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Developing Skills,1500.0,C,1443430800,"[implementation, sortings]",PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Three Logos,2000.0,D,1443430800,"[bitmasks, brute force, constructive algorithms, implementation, math]",PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Kojiro and Furrari,3000.0,E,1443430800,"[dp, greedy]",PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Zublicanes and Mumocrates,3000.0,F,1443430800,"[dp, trees, two pointers]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and First Steps,750.0,A,1442939400,"[brute force, dp, implementation]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Company,1250.0,B,1442939400,"[binary search, sortings, two pointers]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Park,1500.0,C,1442939400,"[dfs and similar, trees]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Dishes,2000.0,D,1442939400,"[bitmasks, dp]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Watch,2500.0,E,1442939400,"[data structures, hashing, strings]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,A Problem about Polyline,250.0,A,1442416500,"[geometry, math]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,"""Or"" Game",500.0,B,1442416500,"[brute force, greedy]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Weakness and Poorness,750.0,C,1442416500,[ternary search],PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,LCS Again,2500.0,D,1442416500,"[dp, greedy]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Walking!,2750.0,E,1442416500,"[constructive algorithms, greedy]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Mirror Box,3000.0,F,1442416500,"[matrices, trees]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Raising Bacteria,250.0,A,1442416500,[bitmasks],PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Finding Team Member,500.0,B,1442416500,"[brute force, implementation, sortings]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,A Problem about Polyline,1250.0,C,1442416500,"[binary search, math]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,"""Or"" Game",2000.0,D,1442416500,"[brute force, greedy, math]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Weakness and Poorness,3000.0,E,1442416500,[ternary search],PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,LCS Again,3000.0,F,1442416500,[],PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Vasya and Petya's Game,500.0,A,1441902600,"[math, number theory]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Invariance of Tree,1250.0,B,1441902600,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Points on Plane,1250.0,C,1441902600,"[constructive algorithms, divide and conquer, geometry, greedy, sortings]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Flights for Regular Customers,2000.0,D,1441902600,"[dp, matrices]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Painting Edges,2750.0,E,1441902600,"[binary search, data structures]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Multiplication Table,500.0,A,1441902600,"[implementation, number theory]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Modulo Sum,1250.0,B,1441902600,"[combinatorics, data structures, dp, two pointers]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Vasya and Petya's Game,1500.0,C,1441902600,"[implementation, number theory]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Invariance of Tree,2250.0,D,1441902600,[],PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Points on Plane,2250.0,E,1441902600,[constructive algorithms],PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Fibonotci,,A,1441526400,"[math, matrices]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Bribes,,B,1441526400,"[dfs and similar, trees]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Party,,C,1441526400,"[bitmasks, brute force, graph matchings]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Tablecity,,D,1441526400,[constructive algorithms],PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Spectator Riots,,E,1441526400,[geometry],PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Bulbo,,F,1441526400,"[dp, greedy]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Run for beer,,G,1441526400,"[dfs and similar, shortest paths]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Bots,,H,1441526400,"[combinatorics, number theory]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Robots protection,,I,1441526400,[data structures],PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Poker,500.0,A,1440865800,"[implementation, number theory]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Blocks,1000.0,B,1440865800,"[binary search, data structures, dp]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Drawing,1750.0,C,1440865800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Cavalry,2000.0,D,1440865800,"[data structures, divide and conquer, dp]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Bowling,2500.0,E,1440865800,[greedy],PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Elections,500.0,A,1440865800,[implementation],PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Three Musketeers,1000.0,B,1440865800,"[brute force, dfs and similar, graphs, hashing]",PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Poker,1500.0,C,1440865800,[number theory],PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Blocks,2000.0,D,1440865800,"[data structures, dp, shortest paths]",PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Drawing,2750.0,E,1440865800,[],PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Lengthening Sticks,750.0,A,1440261000,"[combinatorics, implementation, math]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Minimization,1250.0,B,1440261000,"[dp, greedy, sortings]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,CNF 2,1500.0,C,1440261000,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Campus,2000.0,D,1440261000,"[binary search, data structures, dsu, trees]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Geometric Progressions,2750.0,E,1440261000,[math],PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Arrays,500.0,A,1440261000,[sortings],PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Order Book,1000.0,B,1440261000,"[data structures, greedy, implementation, sortings]",PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Lengthening Sticks,1750.0,C,1440261000,"[brute force, combinatorics, dp, math]",PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Minimization,2250.0,D,1440261000,"[dp, sortings]",PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,CNF 2,2500.0,E,1440261000,[],PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Elections,500.0,A,1439483400,[implementation],PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Simple Game,1000.0,B,1439483400,"[constructive algorithms, games, greedy, implementation, math]",PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Replacement,1500.0,C,1439483400,"[constructive algorithms, data structures, implementation]",PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Tree Requests,2000.0,D,1439483400,"[binary search, constructive algorithms, dfs and similar, trees]",PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Pig and Palindromes,2500.0,E,1439483400,"[combinatorics, dp]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Primes or Palindromes?,500.0,A,1439224200,"[brute force, implementation, math, number theory]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Symmetric and Transitive,1000.0,B,1439224200,"[combinatorics, dp, math]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,New Language,1500.0,C,1439224200,"[2-sat, greedy]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Sign Posts,2250.0,D,1439224200,"[brute force, math]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Longest Increasing Subsequence,2500.0,E,1439224200,"[data structures, dp]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Music,500.0,A,1439224200,"[implementation, math]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Inventory,1000.0,B,1439224200,[greedy],PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Primes or Palindromes?,1500.0,C,1439224200,"[binary search, brute force, number theory]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Symmetric and Transitive,2250.0,D,1439224200,"[brute force, dp, math]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,New Language,2750.0,E,1439224200,[],PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Lineland Mail,500.0,A,1438790400,[implementation],PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Berland National Library,1000.0,B,1438790400,[implementation],PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Geometric Progression,1500.0,C,1438790400,"[binary search, data structures, dp]",PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,One-Dimensional Battle Ships,2000.0,D,1438790400,"[binary search, data structures, sortings]",PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,President and Roads,2500.0,E,1438790400,"[dfs and similar, graphs, hashing, shortest paths]",PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Mausoleum,2500.0,F,1438790400,[dp],PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Matching Names,1750.0,A,1438273200,"[dfs and similar, strings, trees]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Replicating Processes,2500.0,B,1438273200,"[constructive algorithms, greedy]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Logistical Questions,3000.0,C,1438273200,"[dfs and similar, divide and conquer, trees]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Restructuring Company,1000.0,D,1438273200,"[data structures, dsu]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Restoring Map,3000.0,E,1438273200,"[bitmasks, constructive algorithms, trees]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Clique in the Divisibility Graph,500.0,F,1438273200,"[dp, math, number theory]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Max and Min,2500.0,G,1438273200,[geometry],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Logistical Questions,1500.0,A,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Clique in the Divisibility Graph,250.0,B,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Restoring Map,2250.0,C,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Restructuring Company,250.0,D,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Max and Min,500.0,E,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Matching Names,250.0,F,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Replicating Processes,500.0,G,1437898500,[],PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Gerald's Hexagon,500.0,A,1437573600,"[brute force, geometry, math]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Equivalent Strings,1000.0,B,1437573600,"[divide and conquer, hashing, sortings, strings]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Gerald and Giant Chess,1500.0,C,1437573600,"[combinatorics, dp, math, number theory]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Randomizer,2250.0,D,1437573600,"[combinatorics, geometry, probabilities]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Gerald and Path,2250.0,E,1437573600,"[dp, sortings]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Currency System in Geraldion,500.0,A,1437573600,"[geometry, implementation, sortings]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Gerald is into Art,1000.0,B,1437573600,"[constructive algorithms, implementation]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Gerald's Hexagon,1500.0,C,1437573600,[geometry],PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Equivalent Strings,2000.0,D,1437573600,"[hashing, implementation, strings]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Gerald and Giant Chess,2500.0,E,1437573600,"[combinatorics, dp]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Lala Land and Apple Trees,500.0,A,1436886600,"[brute force, implementation, sortings]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Amr and The Large Array,1000.0,B,1436886600,[implementation],PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Amr and Chemistry,1500.0,C,1436886600,"[brute force, greedy]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Guess Your Way Out! II,2250.0,D,1436886600,"[data structures, implementation, sortings]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,A Simple Task,2500.0,E,1436886600,"[data structures, sortings, strings]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Ilya and Diplomas,500.0,A,1435676400,"[greedy, implementation]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Pasha and Tea,1000.0,B,1435676400,"[implementation, sortings]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Arthur and Table,1500.0,C,1435676400,"[brute force, data structures, dp, greedy]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Vitaly and Cycle,2000.0,D,1435676400,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Ann and Half-Palindrome,2500.0,E,1435676400,"[data structures, dp, string suffix structures, strings, trees]",PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Matryoshkas,250.0,A,1435414200,[implementation],PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Fugitive,750.0,B,1435414200,"[data structures, greedy, sortings]",PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Chocolate,1250.0,C,1435414200,[data structures],PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of a Top Secret,2000.0,D,1435414200,"[binary search, implementation, math]",PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Computer Network,3000.0,E,1435414200,"[dfs and similar, graphs, trees]",PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of the Zeros and Ones,250.0,A,1435414200,[greedy],PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Fake Numbers,250.0,B,1435414200,"[brute force, implementation]",PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Matryoshkas,1000.0,C,1435414200,[implementation],PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Fugitive,3000.0,D,1435414200,"[binary search, data structures, greedy]",PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Chocolate,3000.0,E,1435414200,"[binary search, data structures]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Kyoya and Colored Balls,250.0,A,1435163400,"[combinatorics, dp, math]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Kyoya and Permutation,500.0,B,1435163400,"[binary search, combinatorics, constructive algorithms, implementation, math]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Love Triangles,1000.0,C,1435163400,"[dfs and similar, dsu, graphs]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Nudist Beach,1500.0,D,1435163400,"[binary search, graphs, greedy]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Kyoya and Train,3000.0,E,1435163400,"[dp, fft, probabilities]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Kyoya and Photobooks,250.0,A,1435163400,"[brute force, math]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Ohana Cleans Up,500.0,B,1435163400,"[brute force, strings]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Kyoya and Colored Balls,1500.0,C,1435163400,"[combinatorics, dp, math]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Kyoya and Permutation,3000.0,D,1435163400,[math],PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Love Triangles,3000.0,E,1435163400,"[dfs and similar, dsu]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Table,500.0,A,1434645000,"[implementation, math]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Books,1000.0,B,1434645000,"[implementation, math]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Scales,1500.0,C,1434645000,"[brute force, dp, greedy, math, meet-in-the-middle]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Triangles,2000.0,D,1434645000,"[brute force, combinatorics, data structures, geometry, math, sortings]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Brackets,2500.0,E,1434645000,"[brute force, dp, expression parsing, greedy, implementation]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ and Contest,500.0,A,1434127500,"[implementation, sortings]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,ZgukistringZ,1250.0,B,1434127500,"[brute force, constructive algorithms, implementation, strings]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ hates Boxes,1750.0,C,1434127500,"[binary search, greedy]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ and Binary Operations,2000.0,D,1434127500,"[combinatorics, math, matrices, number theory]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ and GukiZiana,2500.0,E,1434127500,"[binary search, data structures]",PROGRAMMING
+549,Looksery Cup 2015,12,Face Detection,250.0,A,1433595600,[implementation],PROGRAMMING
+549,Looksery Cup 2015,12,Looksery Party,1750.0,B,1433595600,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING
+549,Looksery Cup 2015,12,The Game Of Parity,2000.0,C,1433595600,[games],PROGRAMMING
+549,Looksery Cup 2015,12,Haar Features,1000.0,D,1433595600,"[greedy, implementation]",PROGRAMMING
+549,Looksery Cup 2015,12,Sasha Circle,3000.0,E,1433595600,[math],PROGRAMMING
+549,Looksery Cup 2015,12,Yura and Developers,3000.0,F,1433595600,"[data structures, divide and conquer]",PROGRAMMING
+549,Looksery Cup 2015,12,Happy Line,1500.0,G,1433595600,"[greedy, sortings]",PROGRAMMING
+549,Looksery Cup 2015,12,Degenerate Matrix,1500.0,H,1433595600,"[binary search, math]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Two Substrings,1000.0,A,1433435400,"[brute force, dp, implementation, strings]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Preparing Olympiad,750.0,B,1433435400,"[bitmasks, brute force]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Divisibility by Eight,1000.0,C,1433435400,"[brute force, dp, math]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Regular Bridge,2000.0,D,1433435400,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Brackets in Implications,3000.0,E,1433435400,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Frog,750.0,A,1432658100,"[brute force, implementation, math]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Feet,1000.0,B,1432658100,"[binary search, data structures, dp, dsu]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Foam,1750.0,C,1432658100,"[bitmasks, number theory]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Fish,1750.0,D,1432658100,"[dfs and similar, graphs]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Friends,2500.0,E,1432658100,"[data structures, string suffix structures, strings]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Fax,500.0,A,1432658100,"[brute force, implementation]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Fun,1000.0,B,1432658100,"[brute force, greedy, implementation]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Frog,1750.0,C,1432658100,[number theory],PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Feet,2000.0,D,1432658100,"[binary search, data structures]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Foam,2750.0,E,1432658100,[number theory],PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Bananas,500.0,A,1432312200,"[implementation, math]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Badges,1000.0,B,1432312200,"[brute force, greedy, implementation, sortings]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Cards,1250.0,C,1432312200,"[brute force, dfs and similar]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Number Game,1500.0,D,1432312200,"[constructive algorithms, dp, math, number theory]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Traveling,2250.0,E,1432312200,"[flows, math]",PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Toy Cars,500.0,A,1432053000,[implementation],PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Equidistant String,1000.0,B,1432053000,[greedy],PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Woodcutters,1750.0,C,1432053000,"[dp, greedy]",PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Queue,1750.0,D,1432053000,"[greedy, implementation, sortings]",PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Paths and Trees,2500.0,E,1432053000,"[graphs, greedy, shortest paths]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Writing Code,500.0,A,1431016200,[dp],PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Destroying Roads,1000.0,B,1431016200,"[graphs, shortest paths]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Remembering Strings,1750.0,C,1431016200,"[bitmasks, dp]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Road Improvement,1750.0,D,1431016200,"[dp, trees]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Listening to Music,2500.0,E,1431016200,"[constructive algorithms, data structures]",PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Set of Strings,500.0,A,1431016200,[implementation],PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Sea and Islands,1000.0,B,1431016200,"[constructive algorithms, implementation]",PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Writing Code,1500.0,C,1431016200,[dp],PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Destroying Roads,2000.0,D,1431016200,"[brute force, graphs, shortest paths]",PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Remembering Strings,2750.0,E,1431016200,"[bitmasks, dp]",PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Place Your Ad Here,750.0,A,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Duck Hunt,3000.0,B,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Idempotent functions,250.0,C,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Superhero's Job,1250.0,D,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Playing on Graph,750.0,E,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Quest,500.0,F,1430668800,[],PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Place Your Ad Here,2000.0,A,1430668800,"[data structures, sortings]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Duck Hunt,3000.0,B,1430668800,[data structures],PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Idempotent functions,750.0,C,1430668800,"[constructive algorithms, graphs, math]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Superhero's Job,2250.0,D,1430668800,"[dfs and similar, dp, hashing, math, number theory]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Playing on Graph,2250.0,E,1430668800,"[graphs, shortest paths]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Quest,1000.0,F,1430668800,"[dp, greedy]",PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Combination Lock,500.0,A,1430411400,[implementation],PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,School Marks,1000.0,B,1430411400,"[greedy, implementation]",PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Ice Cave,1500.0,C,1430411400,[dfs and similar],PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Bad Luck Island,2000.0,D,1430411400,"[dp, probabilities]",PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Infinite Inversions,2500.0,E,1430411400,"[binary search, data structures, implementation, sortings, trees]",PROGRAMMING
+538,Codeforces Round #300,12,Cutting Banner,500.0,A,1430064000,"[brute force, implementation]",PROGRAMMING
+538,Codeforces Round #300,12,Quasi Binary,1000.0,B,1430064000,"[constructive algorithms, dp, greedy, implementation]",PROGRAMMING
+538,Codeforces Round #300,12,Tourist's Notes,1500.0,C,1430064000,"[binary search, brute force, greedy, implementation, math]",PROGRAMMING
+538,Codeforces Round #300,12,Weird Chess,1500.0,D,1430064000,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+538,Codeforces Round #300,12,Demiurges Play Again,2000.0,E,1430064000,"[dfs and similar, dp, math, trees]",PROGRAMMING
+538,Codeforces Round #300,12,A Heap of Heaps,2500.0,F,1430064000,"[brute force, data structures, math, sortings]",PROGRAMMING
+538,Codeforces Round #300,12,Berserk Robot ,3000.0,G,1430064000,"[constructive algorithms, math, sortings]",PROGRAMMING
+538,Codeforces Round #300,12,Summer Dichotomy,3000.0,H,1430064000,"[2-sat, data structures, dfs and similar, greedy]",PROGRAMMING
+537,VK Cup 2015 - Wild Card Round 2,12,Antiplagiarism,,A,1429381800,[*special],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Berland Miners,3000.0,A,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Work Group,500.0,B,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Board Game,250.0,C,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Landmarks,3000.0,D,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Correcting Mistakes,500.0,E,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Encoding,1250.0,F,1429286400,[],PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Berland Miners,3000.0,A,1429286400,"[binary search, data structures, dfs and similar, greedy, trees]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Work Group,750.0,B,1429286400,"[dfs and similar, dp, graphs, strings, trees]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Board Game,250.0,C,1429286400,"[games, greedy, implementation, math]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Landmarks,3000.0,D,1429286400,[data structures],PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Correcting Mistakes,500.0,E,1429286400,"[constructive algorithms, dp, greedy, hashing, strings, two pointers]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Encoding,1500.0,F,1429286400,"[hashing, string suffix structures, strings]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Nafas,500.0,A,1429029300,[implementation],PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and SaDDas,1000.0,B,1429029300,"[bitmasks, brute force, implementation]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Karafs,1500.0,C,1429029300,"[binary search, math]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Malekas,2000.0,D,1429029300,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Pashmaks,2500.0,E,1429029300,[geometry],PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas and Karafs,500.0,A,1429029300,"[binary search, math]",PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas and Malekas,1000.0,B,1429029300,"[hashing, string suffix structures, strings]",PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas and Pashmaks,1500.0,C,1429029300,[geometry],PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas in Kansas,2000.0,D,1429029300,"[dp, games]",PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas on the Path,2500.0,E,1429029300,"[data structures, divide and conquer, trees]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Exam,500.0,A,1428854400,"[constructive algorithms, implementation]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Covered Path,1000.0,B,1428854400,"[dp, greedy, math]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Polycarpus' Dice,1500.0,C,1428854400,[math],PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Handshakes,2000.0,D,1428854400,"[binary search, constructive algorithms, data structures, greedy]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Berland Local Positioning System,2500.0,E,1428854400,"[constructive algorithms, greedy, hashing, implementation]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Simplified Nonogram,3000.0,F,1428854400,"[bitmasks, dp, hashing, meet-in-the-middle]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,King of Thieves,500.0,A,1428165300,"[brute force, implementation]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Om Nom and Dark Park,500.0,B,1428165300,"[dfs and similar, greedy, implementation]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Om Nom and Candies,1250.0,C,1428165300,"[brute force, greedy, math]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Om Nom and Necklace,1750.0,D,1428165300,"[hashing, string suffix structures, strings]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Transmitting Levels,2250.0,E,1428165300,"[dp, implementation]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Pudding Monsters,3000.0,F,1428165300,"[data structures, divide and conquer]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Spiders Evil Plan,3000.0,G,1428165300,"[greedy, trees]",PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,String inside out,,B,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Set subtraction,,D,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Sum and product,,E,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Points in triangle,,H,1427562000,"[*special, geometry]",PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Different variables,,I,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,String inside out,,B,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Set subtraction,,D,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Sum and product,,E,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Points in triangle,,H,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Different variables,,I,1427562000,[*special],PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Vitaliy and Pie,250.0,A,1427387400,"[greedy, hashing]",PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Pasha and String,750.0,B,1427387400,[greedy],PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Ilya and Sticks,1000.0,C,1427387400,"[greedy, sortings]",PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Arthur and Walls,3000.0,D,1427387400,"[data structures, greedy]",PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Anya and Cubes,3000.0,E,1427387400,"[binary search, bitmasks, brute force, dp, meet-in-the-middle]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,And Yet Another Bracket Sequence,2500.0,A,1426956300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Group Photo 2 (online mirror version),500.0,B,1426956300,"[brute force, greedy, sortings]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Rooks and Rectangles,1500.0,C,1426956300,[data structures],PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Social Network,1250.0,D,1426956300,"[data structures, greedy]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,The Art of Dealing with ATM,500.0,E,1426956300,[brute force],PROGRAMMING
+524,VK Cup 2015 - Round 1,12,"Возможно, вы знаете этих людей?",500.0,A,1426946400,[implementation],PROGRAMMING
+524,VK Cup 2015 - Round 1,12,Фото на память - 2 (round version),500.0,B,1426946400,"[dp, greedy]",PROGRAMMING
+524,VK Cup 2015 - Round 1,12,The Art of Dealing with ATM,1000.0,C,1426946400,"[binary search, sortings]",PROGRAMMING
+524,VK Cup 2015 - Round 1,12,Social Network,1250.0,D,1426946400,"[greedy, two pointers]",PROGRAMMING
+524,VK Cup 2015 - Round 1,12,Rooks and Rectangles,1750.0,E,1426946400,[data structures],PROGRAMMING
+524,VK Cup 2015 - Round 1,12,And Yet Another Bracket Sequence,3000.0,F,1426946400,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Playing with Paper,500.0,A,1426610700,"[implementation, math]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Error Correct System,1000.0,B,1426610700,[greedy],PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Glass Carving,1500.0,C,1426610700,"[binary search, data structures, implementation]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Clique Problem,2000.0,D,1426610700,"[data structures, dp, greedy, implementation, sortings]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Data Center Drama,2500.0,E,1426610700,"[dfs and similar, graphs]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Glass Carving,500.0,A,1426610700,"[data structures, implementation]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Clique Problem,1000.0,B,1426610700,"[dp, greedy]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Data Center Drama,1500.0,C,1426610700,"[constructive algorithms, graphs]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Fuzzy Search,2000.0,D,1426610700,"[bitmasks, brute force, fft]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Triangles 3000,2500.0,E,1426610700,"[geometry, sortings]",PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,"Rotate, Flip and Zoom",500.0,A,1426345200,[implementation],PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,Mean Requests,1000.0,B,1426345200,[implementation],PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,Name Quest,1500.0,C,1426345200,[greedy],PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,Statistics of Recompressing Videos,2000.0,D,1426345200,"[data structures, implementation]",PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Reposts,500.0,A,1425740400,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Photo to Remember,1000.0,B,1425740400,"[data structures, dp, implementation]",PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Chicken or Fish?,1500.0,C,1425740400,[greedy],PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Closest Equals,2000.0,D,1425740400,[data structures],PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Pangram,500.0,A,1425279600,"[implementation, strings]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Two Buttons,1000.0,B,1425279600,"[dfs and similar, graphs, greedy, implementation, math, shortest paths]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,DNA Alignment,1500.0,C,1425279600,"[math, strings]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Cubes,2000.0,D,1425279600,"[games, greedy, implementation]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Pluses everywhere,2500.0,E,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,DNA Alignment,500.0,A,1425279600,"[greedy, math]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Cubes,1000.0,B,1425279600,"[data structures, greedy, implementation]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Pluses everywhere,1500.0,C,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Shop,2000.0,D,1425279600,[greedy],PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Cycling City,2500.0,E,1425279600,"[dfs and similar, graphs]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Chess,500.0,A,1425128400,[implementation],PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Compilation Errors,1000.0,B,1425128400,"[data structures, implementation]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Team Training,1500.0,C,1425128400,"[greedy, implementation, math, number theory]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Interesting Substrings,2000.0,D,1425128400,"[data structures, dp, two pointers]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Lecture Rooms,2500.0,E,1425128400,"[binary search, data structures, dfs and similar, dp, trees]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Vitaly and Strings,500.0,A,1424795400,[strings],PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Tanya and Postcard,1000.0,B,1424795400,"[implementation, strings]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Anya and Smartphone,1500.0,C,1424795400,"[data structures, implementation]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Ilya and Escalator,2000.0,D,1424795400,"[combinatorics, dp, probabilities]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Arthur and Questions,2500.0,E,1424795400,"[greedy, implementation, ternary search]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Pasha and Pipe,2500.0,F,1424795400,"[binary search, brute force, combinatorics, dp, implementation]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Date,500.0,A,1424190900,[math],PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and His Happy Friends,1000.0,B,1424190900,"[brute force, dsu, meet-in-the-middle, number theory]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Factorial,1000.0,C,1424190900,"[greedy, math, sortings]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Tiles,3000.0,D,1424190900,"[constructive algorithms, greedy]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Park,3000.0,E,1424190900,[data structures],PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Factorial,500.0,A,1424190900,"[dp, greedy, implementation, math]",PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Tiles,1000.0,B,1424190900,"[data structures, graph matchings, greedy, implementation]",PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Park,1500.0,C,1424190900,[data structures],PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Morning Exercise,3000.0,D,1424190900,"[dfs and similar, dp, dsu, trees, two pointers]",PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and His Happy Friends,3000.0,E,1424190900,"[math, number theory]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Chewbaсca and Number,500.0,A,1423931400,"[greedy, implementation]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Han Solo and Lazer Gun,1000.0,B,1423931400,"[brute force, data structures, geometry, math]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Watto and Mechanism,2000.0,C,1423931400,"[binary search, hashing, string suffix structures, strings]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,R2D2 and Droid Army,2000.0,D,1423931400,"[binary search, data structures, two pointers]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Darth Vader and Tree,2500.0,E,1423931400,"[dp, matrices]",PROGRAMMING
+513,Rockethon 2015,12,Game,3.0,A,1423328400,"[constructive algorithms, math]",PROGRAMMING
+513,Rockethon 2015,12,Permutations,3.0,B1,1423328400,[brute force],PROGRAMMING
+513,Rockethon 2015,12,Permutations,4.0,B2,1423328400,"[bitmasks, divide and conquer, math]",PROGRAMMING
+513,Rockethon 2015,12,Second price auction,8.0,C,1423328400,"[bitmasks, probabilities]",PROGRAMMING
+513,Rockethon 2015,12,Constrained Tree,9.0,D1,1423328400,[dfs and similar],PROGRAMMING
+513,Rockethon 2015,12,Constrained Tree,8.0,D2,1423328400,"[constructive algorithms, data structures]",PROGRAMMING
+513,Rockethon 2015,12,Subarray Cuts,9.0,E1,1423328400,[dp],PROGRAMMING
+513,Rockethon 2015,12,Subarray Cuts,12.0,E2,1423328400,[dp],PROGRAMMING
+513,Rockethon 2015,12,Scaygerboss,14.0,F1,1423328400,[flows],PROGRAMMING
+513,Rockethon 2015,12,Scaygerboss,6.0,F2,1423328400,[flows],PROGRAMMING
+513,Rockethon 2015,12,Inversions problem,3.0,G1,1423328400,"[brute force, dfs and similar, dp, meet-in-the-middle]",PROGRAMMING
+513,Rockethon 2015,12,Inversions problem,5.0,G2,1423328400,"[dp, probabilities]",PROGRAMMING
+513,Rockethon 2015,12,Inversions problem,16.0,G3,1423328400,[dp],PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Names,500.0,A,1422894600,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Jumping,1000.0,B,1422894600,"[data structures, dp, math, number theory, shortest paths]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Dinner,1500.0,C,1422894600,"[flows, graph matchings]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Travelling,2250.0,D,1422894600,"[dp, trees]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Polygon,2250.0,E,1422894600,"[constructive algorithms, divide and conquer]",PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Snake,500.0,A,1422894600,[implementation],PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Two Dots,1000.0,B,1422894600,[dfs and similar],PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Names,1500.0,C,1422894600,"[dfs and similar, graphs, sortings]",PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Jumping,2000.0,D,1422894600,"[bitmasks, brute force, dp, math]",PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Dinner,2500.0,E,1422894600,[flows],PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Maximum in Table,,A,1422705600,"[brute force, implementation]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Painting Pebbles,,B,1422705600,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Sums of Digits,,C,1422705600,"[dp, greedy, implementation]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Restoring Numbers,,D,1422705600,"[constructive algorithms, math]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Pretty Song,,E,1422705600,"[math, strings]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Progress Monitoring,,F,1422705600,[dp],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Pasha and Pixels,500.0,A,1422376200,[brute force],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Anton and currency you all know,1000.0,B,1422376200,[greedy],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Anya and Ghosts,1500.0,C,1422376200,[greedy],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Tanya and Password,2000.0,D,1422376200,"[dfs and similar, graphs]",PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Arthur and Brackets,2500.0,E,1422376200,"[dp, greedy]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Amr and Music,500.0,A,1422028800,"[greedy, implementation, sortings]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Amr and Pins,1000.0,B,1422028800,"[geometry, math]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Guess Your Way Out!,1500.0,C,1422028800,"[implementation, math]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,The Maths Lecture,2000.0,D,1422028800,"[dp, implementation]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Breaking Good,2500.0,E,1422028800,"[dfs and similar, dp, graphs, shortest paths]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Gift,500.0,A,1421586000,"[brute force, implementation, strings]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Colorful Graph,1000.0,B,1421586000,"[dfs and similar, dp, dsu, graphs]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,"Mr. Kitayuta, the Treasure Hunter",1500.0,C,1421586000,"[dfs and similar, dp, two pointers]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Technology,2000.0,D,1421586000,[dfs and similar],PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta vs. Bamboos,2750.0,E,1421586000,"[binary search, greedy]",PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,"Mr. Kitayuta, the Treasure Hunter",500.0,A,1421586000,[dp],PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Technology,1000.0,B,1421586000,"[dfs and similar, graphs]",PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta vs. Bamboos,1750.0,C,1421586000,[binary search],PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Colorful Graph,1750.0,D,1421586000,"[brute force, dfs and similar, dsu]",PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Gift,2500.0,E,1421586000,"[combinatorics, dp, matrices, strings]",PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Contest,500.0,A,1421053200,[implementation],PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Changing Handles,500.0,B,1421053200,"[data structures, dsu, strings]",PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Forest,1500.0,C,1421053200,"[constructive algorithms, data structures, greedy, sortings, trees]",PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Permutations Summation,3000.0,D,1421053200,[data structures],PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Palindrome Degree,3000.0,E,1421053200,"[binary search, combinatorics, implementation]",PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and Forest,500.0,A,1421053200,"[constructive algorithms, data structures, graphs, greedy]",PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and Permutations Summation,500.0,B,1421053200,"[binary search, data structures, math]",PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and Palindrome Degree,2500.0,C,1421053200,[math],PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and XOR,2500.0,D,1421053200,[bitmasks],PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and LCP on Tree,3000.0,E,1421053200,"[binary search, dfs and similar, hashing, string suffix structures, trees]",PROGRAMMING
+500,Good Bye 2014,12,New Year Transportation,500.0,A,1419951600,"[dfs and similar, graphs, implementation]",PROGRAMMING
+500,Good Bye 2014,12,New Year Permutation,1000.0,B,1419951600,"[dfs and similar, dsu, graphs, greedy, math, sortings]",PROGRAMMING
+500,Good Bye 2014,12,New Year Book Reading,1000.0,C,1419951600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
+500,Good Bye 2014,12,New Year Santa Network,1500.0,D,1419951600,"[combinatorics, dfs and similar, graphs, trees]",PROGRAMMING
+500,Good Bye 2014,12,New Year Domino,2750.0,E,1419951600,"[data structures, dp, dsu]",PROGRAMMING
+500,Good Bye 2014,12,New Year Shopping,2750.0,F,1419951600,"[divide and conquer, dp]",PROGRAMMING
+500,Good Bye 2014,12,New Year Running,3500.0,G,1419951600,"[number theory, trees]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Crazy Town,500.0,A,1419438600,[geometry],PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Name That Tune,2000.0,B,1419438600,"[dp, probabilities, two pointers]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Array and Operations,1000.0,C,1419438600,"[flows, graph matchings, number theory]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Traffic Jams in the Land,2000.0,D,1419438600,"[data structures, dp, number theory]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Stairs and Lines,2500.0,E,1419438600,"[dp, matrices]",PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Watching a movie,500.0,A,1419438600,[implementation],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Lecture,500.0,B,1419438600,[strings],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Crazy Town,1500.0,C,1419438600,[math],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Name That Tune,3000.0,D,1419438600,[],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Array and Operations,3000.0,E,1419438600,[],PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Minimum Difficulty,500.0,A,1418833800,"[brute force, implementation, math]",PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Secret Combination,1000.0,B,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Removing Columns,1750.0,C,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Tennis Game,2250.0,D,1418833800,[binary search],PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Distributing Parts ,2250.0,E,1418833800,"[greedy, sortings]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Removing Columns,750.0,A,1418833800,[greedy],PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Tennis Game,1250.0,B,1418833800,"[binary search, brute force, implementation]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Distributing Parts ,1250.0,C,1418833800,"[data structures, greedy, implementation, sortings, two pointers]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Gears,2000.0,D,1418833800,"[brute force, geometry, math]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Subsequences Return,2500.0,E,1418833800,"[dp, matrices]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Treasure,500.0,A,1418488200,[greedy],PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Obsessive String,1000.0,B,1418488200,"[dp, strings]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Helping People,1750.0,C,1418488200,"[dp, probabilities]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Birthday,1750.0,D,1418488200,"[data structures, dfs and similar, dp, trees]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Sharti,2500.0,E,1418488200,[games],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Digital Counter,500.0,A,1418488200,[implementation],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Modular Equations,1000.0,B,1418488200,[math],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Treasure,1500.0,C,1418488200,[implementation],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Obsessive String,2000.0,D,1418488200,"[binary search, dp, strings]",PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Helping People,2750.0,E,1418488200,[],PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Football,500.0,A,1417618800,[implementation],PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Wrestling,1000.0,B,1417618800,[implementation],PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Basketball,2000.0,C,1417618800,"[binary search, brute force, data structures, implementation, sortings, two pointers]",PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Chess,1500.0,D,1417618800,"[constructive algorithms, games]",PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Polynomial,3000.0,E,1417618800,[math],PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Cubes,500.0,A,1417451400,[implementation],PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Lanterns,1000.0,B,1417451400,"[binary search, math, sortings]",PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Exams,1500.0,C,1417451400,"[greedy, sortings]",PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Computer Game,2000.0,D,1417451400,"[binary search, implementation, math, sortings]",PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Field,2500.0,E,1417451400,[math],PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Team Olympiad,500.0,A,1416733800,"[greedy, implementation, sortings]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Queue,1000.0,B,1416733800,"[dsu, implementation]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Hacking Cypher,1500.0,C,1416733800,"[brute force, math, strings]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Chocolate,2000.0,D,1416733800,"[brute force, dfs and similar, math, meet-in-the-middle, number theory]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Restoring Increasing Sequence,2000.0,E,1416733800,"[binary search, brute force, greedy, implementation]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Treeland Tour,2500.0,F,1416733800,"[data structures, dfs and similar, dp, trees]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Fight the Monster,500.0,A,1416590400,"[binary search, brute force]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Strip,1500.0,B,1416590400,"[binary search, data structures, dp, two pointers]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Prefix Product Sequence,1500.0,C,1416590400,"[constructive algorithms, number theory]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Conveyor Belts,2000.0,D,1416590400,[data structures],PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Tourists,2500.0,E,1416590400,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Giga Tower,500.0,A,1416590400,[brute force],PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Candy Boxes,1500.0,B,1416590400,"[brute force, constructive algorithms]",PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Fight the Monster,1500.0,C,1416590400,[brute force],PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Strip,2500.0,D,1416590400,"[data structures, dp, two pointers]",PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Prefix Product Sequence,2500.0,E,1416590400,"[constructive algorithms, math]",PROGRAMMING
+491,Testing Round #11,12,Up the hill,500.0,A,1416519000,[implementation],PROGRAMMING
+491,Testing Round #11,12,New York Hotel,1000.0,B,1416519000,"[greedy, math]",PROGRAMMING
+491,Testing Round #11,12,Deciphering,1500.0,C,1416519000,"[flows, graph matchings]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,SwapSort,500.0,A,1416238500,"[implementation, sortings]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,BerSU Ball,1000.0,B,1416238500,"[dfs and similar, dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Given Length and Sum of Digits...,1500.0,C,1416238500,"[dp, greedy, implementation]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Unbearable Controversy of Being,2000.0,D,1416238500,"[brute force, combinatorics, dfs and similar, graphs]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Hiking,2500.0,E,1416238500,"[binary search, dp]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Special Matrices,2500.0,F,1416238500,"[combinatorics, dp]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,Calculating Function,500.0,A,1415718000,"[implementation, math]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,OR in Matrix,1000.0,B,1415718000,"[greedy, hashing, implementation]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,Palindrome Transformation,1500.0,C,1415718000,"[greedy, implementation]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,Valid Sets,2000.0,D,1415718000,"[dfs and similar, dp, math, trees]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,LIS of Sequence,2500.0,E,1415718000,"[data structures, dp, greedy, hashing, math]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Bits,500.0,A,1415205000,"[bitmasks, constructive algorithms]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Maximum Value,1000.0,B,1415205000,"[binary search, math, sortings, two pointers]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Strange Sorting,3000.0,C,1415205000,"[implementation, math]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Kindergarten,2000.0,D,1415205000,"[data structures, dp, greedy]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Sign on Fence,3000.0,E,1415205000,"[binary search, constructive algorithms, data structures]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Factory,1000.0,A,1415205000,"[implementation, math, matrices]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Valuable Resources,500.0,B,1415205000,"[brute force, greedy]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Bits,1500.0,C,1415205000,"[implementation, math]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Maximum Value,3000.0,D,1415205000,"[binary search, sortings]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Strange Sorting,3000.0,E,1415205000,[],PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Diverse Permutation,500.0,A,1414170000,"[constructive algorithms, greedy]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Interesting Array,1500.0,B,1414170000,"[constructive algorithms, data structures, trees]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Game with Strings,1500.0,C,1414170000,"[bitmasks, dp, probabilities]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Random Function and Tree,2000.0,D,1414170000,"[combinatorics, dp, trees]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,ELCA,2500.0,E,1414170000,"[data structures, trees]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Counterexample ,500.0,A,1414170000,"[brute force, implementation]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Friends and Presents,1000.0,B,1414170000,"[binary search, math]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Diverse Permutation,1500.0,C,1414170000,"[constructive algorithms, implementation]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Interesting Array,2500.0,D,1414170000,[data structures],PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Game with Strings,2500.0,E,1414170000,[],PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Expression,500.0,A,1413709200,"[brute force, math]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Towers,1000.0,B,1413709200,"[brute force, greedy, implementation, sortings]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Exams,1500.0,C,1413709200,"[greedy, sortings]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Long Jumps,2000.0,D,1413709200,"[binary search, greedy, implementation]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Riding in a Lift,2500.0,E,1413709200,[dp],PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Exams,500.0,A,1413709200,"[greedy, sortings]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Long Jumps,1000.0,B,1413709200,"[binary search, greedy, hashing, implementation, sortings]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Riding in a Lift,1500.0,C,1413709200,"[dp, implementation]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Parcels,2000.0,D,1413709200,"[dp, graphs]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Parking Lot,2500.0,E,1413709200,"[data structures, divide and conquer]",PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Initial Bet,500.0,A,1413474000,[implementation],PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Random Teams,1000.0,B,1413474000,"[combinatorics, constructive algorithms, greedy, math]",PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Table Decorations,1500.0,C,1413474000,[greedy],PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Red-Green Towers,2000.0,D,1413474000,[dp],PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Wavy numbers,2500.0,E,1413474000,"[brute force, dfs and similar, meet-in-the-middle, sortings]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Stairs,500.0,A,1413122400,"[implementation, math]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and WiFi,1500.0,B,1413122400,"[bitmasks, brute force, combinatorics, dp, math, probabilities]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sums,1500.0,C,1413122400,[math],PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sets,2000.0,D,1413122400,"[constructive algorithms, greedy, math]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Strings,2500.0,E,1413122400,"[dp, strings]",PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sums,500.0,A,1413122400,[math],PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sets,1000.0,B,1413122400,[math],PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Strings,1500.0,C,1413122400,[dp],PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Binary,2000.0,D,1413122400,"[dp, strings]",PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Notepad,3000.0,E,1413122400,[data structures],PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Keyboard,500.0,A,1412609400,[implementation],PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Worms,1000.0,B,1412609400,"[binary search, implementation]",PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Captain Marmot,1500.0,C,1412609400,"[brute force, geometry]",PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Flowers,2000.0,D,1412609400,[dp],PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Pillars,3000.0,E,1412609400,"[binary search, data structures, dp, sortings, trees]",PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Ant colony,3000.0,F,1412609400,"[data structures, number theory]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Bayan Bus,500.0,A,1412514000,[implementation],PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Strongly Connected City,1000.0,B,1412514000,"[brute force, dfs and similar, graphs, implementation]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Kamal-ol-molk's Painting,1500.0,C,1412514000,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,CGCDSSQ,2000.0,D,1412514000,"[brute force, data structures, math]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Strongly Connected City 2,2500.0,E,1412514000,[dfs and similar],PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Meta-universe,2500.0,F,1412514000,[data structures],PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Learn from Math,500.0,A,1411918500,"[math, number theory]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Learn from Life,1000.0,B,1411918500,[],PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Make It Nondeterministic,1500.0,C,1411918500,[greedy],PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Inverse the Problem,2000.0,D,1411918500,"[dfs and similar, dsu, shortest paths, trees]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Learn from a Game,3000.0,E,1411918500,"[constructive algorithms, implementation]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Change the Goal,3000.0,F,1411918500,"[constructive algorithms, math, matrices]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Increase the Constraints,3500.0,G,1411918500,"[bitmasks, data structures, fft]",PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Sticks,500.0,A,1411745400,[implementation],PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Important Things,1000.0,B,1411745400,[sortings],PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and House of Cards,2000.0,C,1411745400,"[binary search, brute force, greedy, math]",PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Cube Walls,2000.0,D,1411745400,"[string suffix structures, strings]",PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Lots and Lots of Segments,2500.0,E,1411745400,"[data structures, dsu]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,24 Game,500.0,A,1411218000,"[constructive algorithms, greedy, math]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Two Sets,1000.0,B,1411218000,"[2-sat, dfs and similar, dsu, graph matchings, greedy]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Hack it!,1500.0,C,1411218000,"[binary search, constructive algorithms, math]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Tree,2000.0,D,1411218000,[graph matchings],PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Permanent,2500.0,E,1411218000,"[dp, graph matchings, math, meet-in-the-middle]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,I Wanna Be the Guy,500.0,A,1411218000,"[greedy, implementation]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,Chat Online,1000.0,B,1411218000,[implementation],PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,24 Game,1500.0,C,1411218000,"[constructive algorithms, implementation]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,Two Sets,2000.0,D,1411218000,"[2-sat, data structures, graph matchings, greedy]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,Hack it!,2500.0,E,1411218000,[constructive algorithms],PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,George and Accommodation,500.0,A,1411054200,[implementation],PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,Fedor and New Game,1000.0,B,1411054200,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,George and Job,1500.0,C,1411054200,"[dp, implementation]",PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,Fedor and Essay,2000.0,D,1411054200,"[dfs and similar, dp, graphs, hashing, strings]",PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,Alex and Complicated Task,2500.0,E,1411054200,"[data structures, dp, greedy]",PROGRAMMING
+470,Surprise Language Round #7,12,Crystal Ball Sequence,,A,1410622200,"[*special, implementation]",PROGRAMMING
+470,Surprise Language Round #7,12,Hexakosioihexekontahexaphobia,,B,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Eval,,C,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Caesar Cipher,,D,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Chessboard,,E,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Pairwise Sums,,F,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Hamming Distance,,G,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Array Sorting,,H,1410622200,[*special],PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Cheap Travel,500.0,A,1410535800,[implementation],PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Wonder Room,1000.0,B,1410535800,"[brute force, math]",PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Number of Ways,1500.0,C,1410535800,"[binary search, brute force, data structures, dp, two pointers]",PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Increase Sequence,2000.0,D,1410535800,"[combinatorics, dp]",PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Information Graph,2500.0,E,1410535800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,No to Palindromes!,500.0,A,1410103800,"[greedy, strings]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,Restore Cube ,1500.0,B,1410103800,"[brute force, geometry]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,Substitutes in Number,1500.0,C,1410103800,[dp],PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,World of Darkraft - 2,2000.0,D,1410103800,"[dp, probabilities]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,The Classic Problem,2500.0,E,1410103800,"[data structures, graphs, shortest paths]",PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,inc ARG,500.0,A,1410103800,[implementation],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,Inbox (100500),1000.0,B,1410103800,[implementation],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,No to Palindromes!,1500.0,C,1410103800,[brute force],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,Restore Cube ,2500.0,D,1410103800,[brute force],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,Substitutes in Number,2500.0,E,1410103800,"[constructive algorithms, dp]",PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Caisa and Sugar,500.0,A,1409383800,[implementation],PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Caisa and Pylons,1000.0,B,1409383800,[math],PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Gargari and Bishops,1500.0,C,1409383800,"[greedy, hashing, implementation]",PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Gargari and Permutations,2000.0,D,1409383800,"[dfs and similar, dp, graphs]",PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Caisa and Tree,2500.0,E,1409383800,"[brute force, dfs and similar, trees]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and Toastman,500.0,A,1409061600,"[greedy, sortings]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and Tree,1000.0,B,1409061600,"[dfs and similar, dp, trees]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and a Sheet of Paper,1500.0,C,1409061600,"[data structures, implementation]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and Complicated Task,2000.0,D,1409061600,"[dsu, math]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and a Game,2500.0,E,1409061600,[shortest paths],PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Easy Task,500.0,A,1409061600,"[brute force, implementation]",PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Card Game,1000.0,B,1409061600,[greedy],PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Toastman,1500.0,C,1409061600,"[implementation, sortings]",PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Tree,2000.0,D,1409061600,"[dp, graphs]",PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and a Sheet of Paper,2500.0,E,1409061600,[],PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Vasya and Socks,500.0,A,1408548600,"[brute force, implementation, math]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Little Dima and Equation,1000.0,B,1408548600,"[brute force, implementation, math]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Present,1500.0,C,1408548600,"[binary search, data structures, greedy]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Little Victor and Set,2000.0,D,1408548600,"[brute force, constructive algorithms]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Roland and Rose,2500.0,E,1408548600,"[brute force, geometry, math, sortings]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Garden,500.0,A,1408116600,[implementation],PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Flowers,500.0,B,1408116600,"[combinatorics, implementation, sortings]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Buses,2000.0,C,1408116600,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Parmida's problem,2000.0,D,1408116600,"[data structures, divide and conquer, sortings]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Graph,3000.0,E,1408116600,"[dp, sortings]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Golden System,1000.0,A,1407690000,"[math, meet-in-the-middle]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Distributed Join,1000.0,B,1407690000,[greedy],PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Elections,1500.0,C,1407690000,[brute force],PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Bingo!,2000.0,D,1407690000,"[combinatorics, math, probabilities]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Flow Optimality,2500.0,E,1407690000,"[constructive algorithms, flows, math]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,An easy problem about trees,3000.0,F,1407690000,"[dp, games, greedy, trees]",PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Golden System,1000.0,A,1407690000,[math],PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Distributed Join,1000.0,B,1407690000,[greedy],PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Elections,1500.0,C,1407690000,"[data structures, ternary search]",PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Bingo!,2000.0,D,1407690000,"[combinatorics, probabilities]",PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Flow Optimality,2500.0,E,1407690000,[],PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,An easy problem about trees,3000.0,F,1407690000,[],PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Boredom,500.0,A,1407511800,[dp],PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,A Lot of Games,1000.0,B,1407511800,"[dfs and similar, dp, games, implementation, strings, trees]",PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Civilization,1500.0,C,1407511800,"[dfs and similar, dp, dsu, ternary search, trees]",PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Serega and Fun,2000.0,D,1407511800,[data structures],PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Function,2500.0,E,1407511800,[data structures],PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Laptops,500.0,A,1407511800,[sortings],PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Fedya and Maths,1000.0,B,1407511800,"[math, number theory]",PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Boredom,1500.0,C,1407511800,[dp],PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,A Lot of Games,2000.0,D,1407511800,"[dp, games, strings]",PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Civilization,2500.0,E,1407511800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Expected Maximum,500.0,A,1406907000,[probabilities],PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Harmony Chest,1000.0,B,1406907000,"[bitmasks, brute force, dp]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Summer Sun Celebration,1500.0,C,1406907000,"[constructive algorithms, dfs and similar]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Elements of Harmony,2500.0,D,1406907000,"[dp, matrices]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Lord Tirek,2500.0,E,1406907000,[data structures],PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Crystal Mine,500.0,A,1406907000,[implementation],PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Sort by Shift,1000.0,B,1406907000,[implementation],PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Expected Maximum,1500.0,C,1406907000,"[combinatorics, math, probabilities]",PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Harmony Chest,2000.0,D,1406907000,"[bitmasks, dp]",PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Summer Sun Celebration,2500.0,E,1406907000,[dfs and similar],PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Eevee,500.0,A,1406480400,"[brute force, implementation, strings]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,4-point polyline,1000.0,B,1406480400,"[brute force, constructive algorithms, geometry, trees]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Magic Trick,1000.0,C,1406480400,"[combinatorics, math, probabilities]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,"Washer, Dryer, Folder",1500.0,D,1406480400,"[greedy, implementation]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Three strings,2500.0,E,1406480400,"[data structures, dsu, string suffix structures, strings]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Permutation,2500.0,F,1406480400,"[data structures, divide and conquer, hashing]",PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Game With Sticks,500.0,A,1406215800,[implementation],PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Sort the Array,1000.0,B,1406215800,"[implementation, sortings]",PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Predict Outcome of the Game,1500.0,C,1406215800,"[brute force, implementation, math]",PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Count Good Substrings,2500.0,D,1406215800,[math],PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Devu and Flowers,3000.0,E,1406215800,"[bitmasks, combinatorics, number theory]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Chocolate,500.0,A,1405774800,[math],PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Cities,1000.0,B,1405774800,"[graphs, shortest paths]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Apples,1500.0,C,1405774800,"[constructive algorithms, number theory]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Numbers,2000.0,D,1405774800,"[bitmasks, combinatorics, dp]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Squares,2500.0,E,1405774800,"[dp, math, number theory]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Children,500.0,A,1405774800,[implementation],PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Sequences,1000.0,B,1405774800,"[implementation, math]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Chocolate,1500.0,C,1405774800,"[greedy, implementation]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Cities,2000.0,D,1405774800,"[graphs, shortest paths]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Apples,2500.0,E,1405774800,"[constructive algorithms, number theory]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Rewards,500.0,A,1405605600,[implementation],PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Suffix Structures,1000.0,B,1405605600,"[implementation, strings]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Painting Fence,2500.0,C,1405605600,"[divide and conquer, dp, greedy]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Multiplication Table,2000.0,D,1405605600,"[binary search, brute force]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Divisors,3000.0,E,1405605600,"[brute force, dfs and similar, implementation, number theory]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Sequences,500.0,A,1405256400,"[dp, implementation, two pointers]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Modification,1500.0,B,1405256400,"[brute force, greedy]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Fibonacci Numbers,1500.0,C,1405256400,"[data structures, number theory]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Games,2000.0,D,1405256400,"[math, matrices, probabilities]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Bridges,2500.0,E,1405256400,"[math, matrices]",PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Hash,500.0,A,1405256400,[implementation],PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Strings,1000.0,B,1405256400,"[greedy, implementation]",PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Sequences,1500.0,C,1405256400,[dp],PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Modification,2500.0,D,1405256400,"[data structures, greedy]",PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Fibonacci Numbers,2500.0,E,1405256400,[data structures],PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Physics,500.0,A,1404651900,"[greedy, math]",PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves FFT,1000.0,B,1404651900,[probabilities],PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Colors,2000.0,C,1404651900,[data structures],PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Strings,2000.0,D,1404651900,"[binary search, hashing, strings, two pointers]",PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Planting,2500.0,E,1404651900,"[binary search, dsu, trees]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Chessboard,500.0,A,1404651900,"[dfs and similar, implementation]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Chemistry,1000.0,B,1404651900,"[dfs and similar, dsu, greedy]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Physics,1500.0,C,1404651900,"[graphs, greedy]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves FFT,2000.0,D,1404651900,[probabilities],PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Colors,3000.0,E,1404651900,[data structures],PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Borya and Hanabi,500.0,A,1403191800,"[bitmasks, brute force, implementation]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Andrey and Problem,1500.0,B,1403191800,"[greedy, math, probabilities]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Artem and Array ,1500.0,C,1403191800,"[data structures, greedy]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Adam and Tree,2000.0,D,1403191800,"[data structures, trees]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Gena and Second Distance,2500.0,E,1403191800,[geometry],PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Anton and Letters,500.0,A,1403191800,"[constructive algorithms, implementation]",PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Kolya and Tandem Repeat,1000.0,B,1403191800,[brute force],PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Borya and Hanabi,1500.0,C,1403191800,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Andrey and Problem,2500.0,D,1403191800,"[dp, greedy, math, probabilities, sortings]",PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Artem and Array ,2500.0,E,1403191800,[],PROGRAMMING
+436,Zepto Code Rush 2014,12,Feed with Candy,1000.0,A,1402673400,[greedy],PROGRAMMING
+436,Zepto Code Rush 2014,12,Om Nom and Spiders,1000.0,B,1402673400,"[implementation, math]",PROGRAMMING
+436,Zepto Code Rush 2014,12,Dungeons and Candies,1500.0,C,1402673400,"[dsu, graphs, greedy, trees]",PROGRAMMING
+436,Zepto Code Rush 2014,12,Pudding Monsters,2500.0,D,1402673400,[dp],PROGRAMMING
+436,Zepto Code Rush 2014,12,Cardboard Box,2500.0,E,1402673400,"[data structures, greedy]",PROGRAMMING
+436,Zepto Code Rush 2014,12,Banners,3000.0,F,1402673400,"[brute force, data structures, dp]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Antique Items,500.0,A,1402241400,[implementation],PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Fruits,1000.0,B,1402241400,"[greedy, implementation]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Tubes ,1500.0,C,1402241400,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Swaps,2000.0,D,1402241400,"[constructive algorithms, dsu, graphs, implementation, string suffix structures]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Number,2500.0,E,1402241400,"[bitmasks, dp]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,"Devu, the Singer and Churu, the Joker",500.0,A,1401895800,"[greedy, implementation]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,"Devu, the Dumb Guy",1000.0,B,1401895800,"[implementation, sortings]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,Devu and Partitioning of the Array,1500.0,C,1401895800,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,Devu and his Brother,2000.0,D,1401895800,"[binary search, sortings, ternary search, two pointers]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,Devu and Birthday Celebration,2500.0,E,1401895800,"[combinatorics, dp, math]",PROGRAMMING
+440,Testing Round #10,12,Forgotten Episode,500.0,A,1401809400,[implementation],PROGRAMMING
+440,Testing Round #10,12,Balancer,1000.0,B,1401809400,[implementation],PROGRAMMING
+440,Testing Round #10,12,One-Based Arithmetic,1500.0,C,1401809400,"[dfs and similar, divide and conquer]",PROGRAMMING
+440,Testing Round #10,12,Berland Federalization,2000.0,D,1401809400,"[dp, trees]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Homework,500.0,A,1401627600,[implementation],PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Set,1500.0,B,1401627600,"[bitmasks, greedy, implementation, sortings]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Toy,1500.0,C,1401627600,"[graphs, greedy, sortings]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Zoo,2000.0,D,1401627600,"[dsu, sortings]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Polygon,2500.0,E,1401627600,[],PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Toy,500.0,A,1401627600,[greedy],PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Zoo,1000.0,B,1401627600,"[dp, dsu, sortings]",PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Polygon,1500.0,C,1401627600,"[dp, geometry]",PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Sequence,2000.0,D,1401627600,[data structures],PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Binary Tree,3000.0,E,1401627600,"[combinatorics, divide and conquer, fft, number theory]",PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Queue on Bus Stop,500.0,A,1401463800,[implementation],PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Pasha Maximizes,1000.0,B,1401463800,[greedy],PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Cardiogram,1500.0,C,1401463800,[implementation],PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Special Grid,2000.0,D,1401463800,"[brute force, dp, greedy]",PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Special Graph,2500.0,E,1401463800,[],PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Kitahara Haruki's Gift,500.0,A,1400914800,"[brute force, implementation]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Kuriyama Mirai's Stones,1500.0,B,1400914800,"[dp, implementation, sortings]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Ryouko's Memory Note,1500.0,C,1400914800,"[implementation, math, sortings]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Nanami's Digital Board,2000.0,D,1400914800,"[dsu, implementation]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Tachibana Kanade's Tofu,2500.0,E,1400914800,[dp],PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Ryouko's Memory Note,500.0,A,1400914800,"[math, sortings]",PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Nanami's Digital Board,1000.0,B,1400914800,"[divide and conquer, dp, dsu, implementation, two pointers]",PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Tachibana Kanade's Tofu,1500.0,C,1400914800,[dp],PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Nanami's Power Plant,2000.0,D,1400914800,[flows],PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Furukawa Nagisa's Tree,3000.0,E,1400914800,"[binary search, divide and conquer, sortings, trees]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Black Square,500.0,A,1400686200,[implementation],PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Shower Line,1500.0,B,1400686200,"[brute force, implementation]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,k-Tree,1500.0,C,1400686200,"[dp, implementation, trees]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Random Task,2000.0,D,1400686200,"[binary search, bitmasks, combinatorics, dp, math]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Chemistry Experiment,2500.0,E,1400686200,"[binary search, data structures, ternary search]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Choosing Teams,500.0,A,1400167800,"[greedy, implementation, sortings]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Football Kit,1000.0,B,1400167800,"[brute force, greedy, implementation]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Prime Swaps,1500.0,C,1400167800,"[greedy, sortings]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Prefixes and Suffixes,2000.0,D,1400167800,"[dp, string suffix structures, strings, two pointers]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Square Tiling,2500.0,E,1400167800,"[constructive algorithms, greedy]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Xor-tree,500.0,A,1399822800,"[dfs and similar, trees]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Working out,1000.0,B,1399822800,[dp],PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Guess the Tree,1500.0,C,1399822800,"[bitmasks, constructive algorithms, dp, greedy, trees]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Tricky Function,2000.0,D,1399822800,"[data structures, divide and conquer, geometry]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Points and Segments,2000.0,E,1399822800,[graphs],PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Points and Segments (easy),500.0,A,1399822800,"[constructive algorithms, sortings]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Balls Game,1000.0,B,1399822800,"[brute force, two pointers]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Xor-tree,1500.0,C,1399822800,"[brute force, data structures, dfs and similar, trees]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Working out,2000.0,D,1399822800,"[brute force, dp]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Guess the Tree,2500.0,E,1399822800,"[constructive algorithms, data structures, dfs and similar]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Police Recruits,500.0,A,1399044600,[implementation],PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Prison Transfer,1000.0,B,1399044600,"[data structures, implementation]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Checkposts,1500.0,C,1399044600,"[dfs and similar, graphs, two pointers]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Match & Catch,2000.0,D,1399044600,"[dp, string suffix structures, strings]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Police Patrol,2500.0,E,1399044600,"[greedy, implementation, math, ternary search]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Swaps,500.0,A,1398612600,"[brute force, sortings]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Table ,1000.0,B,1398612600,"[bitmasks, greedy]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Two Sequences,1500.0,C,1398612600,"[data structures, dp]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Squares,2000.0,D,1398612600,"[binary search, data structures, hashing]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Sets,2000.0,E,1398612600,[dp],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Mugs,500.0,A,1398612600,[implementation],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Mirroring,1000.0,B,1398612600,[implementation],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Swaps,1500.0,C,1398612600,"[brute force, sortings, two pointers]",PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Table ,2000.0,D,1398612600,[],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Two Sequences,2500.0,E,1398612600,[],PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Squats,500.0,A,1398409200,[implementation],PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Megacity,1000.0,B,1398409200,"[binary search, greedy, implementation, sortings]",PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Magic Formulas,1500.0,C,1398409200,[math],PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Biathlon Track,2500.0,D,1398409200,"[binary search, brute force, constructive algorithms, data structures, dp]",PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Colored Jenga,3000.0,E,1398409200,"[dfs and similar, dp, probabilities]",PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Start Up,500.0,A,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Online Meeting,1500.0,B,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Bug in Code,1500.0,C,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Cup Trick,1500.0,D,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Playing the ball,2000.0,E,1398169200,[],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Start Up,500.0,A,1398169140,[implementation],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Online Meeting,1500.0,B,1398169140,[implementation],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Bug in Code,1500.0,C,1398169140,"[data structures, graphs, implementation, two pointers]",PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Cup Trick,1500.0,D,1398169140,[data structures],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Playing the ball,2000.0,E,1398169140,[geometry],PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Pasha and Hamsters,500.0,A,1398168900,"[constructive algorithms, implementation]",PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Start Up,1000.0,B,1398168900,[implementation],PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Online Meeting,2000.0,C,1398168900,[implementation],PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Bug in Code,2000.0,D,1398168900,"[binary search, data structures, sortings]",PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Cup Trick,2000.0,E,1398168900,[data structures],PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Data Recovery,500.0,A,1397977200,[implementation],PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Spyke Chatting,1000.0,B,1397977200,[implementation],PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Jeopardy!,1500.0,C,1397977200,"[greedy, math]",PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,2048,2000.0,D,1397977200,"[bitmasks, dp]",PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Maze 2D,2500.0,E,1397977200,"[data structures, divide and conquer]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Poster,500.0,A,1397837400,"[greedy, implementation]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Network Configuration,1000.0,B,1397837400,"[greedy, sortings]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Pattern,1500.0,C,1397837400,"[implementation, strings]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Giving Awards,2000.0,D,1397837400,[dfs and similar],PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,E-mail Addresses,2500.0,E,1397837400,[implementation],PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Elimination,500.0,A,1397749200,"[dp, implementation, math]",PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Crash,1000.0,B,1397749200,[implementation],PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Football,1500.0,C,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Cunning Gena,2000.0,D,1397749200,"[bitmasks, dp, greedy, sortings]",PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Square Table,2500.0,E,1397749200,"[constructive algorithms, math, probabilities]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Football,500.0,A,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Cunning Gena,1000.0,B,1397749200,"[bitmasks, dp, sortings]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Square Table,1500.0,C,1397749200,"[constructive algorithms, dp, math]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Big Problems for Organizers,2500.0,D,1397749200,"[data structures, graphs, trees]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Tricky Password,2500.0,E,1397749200,[data structures],PROGRAMMING
+411,Coder-Strike 2014 - Qualification Round,12,Password Check,,A,1397505600,[implementation],PROGRAMMING
+411,Coder-Strike 2014 - Qualification Round,12,Multi-core Processor,,B,1397505600,[implementation],PROGRAMMING
+411,Coder-Strike 2014 - Qualification Round,12,Kicker,,C,1397505600,[implementation],PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Guess a number!,500.0,A,1397376000,"[greedy, implementation, two pointers]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Art Union,1000.0,B,1397376000,"[brute force, dp, implementation]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Booking System,1500.0,C,1397376000,"[binary search, dp, greedy, implementation]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Population Size,2000.0,D,1397376000,"[greedy, implementation]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,President's Path,2500.0,E,1397376000,"[dp, graphs, shortest paths]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and Numbers,500.0,A,1396798800,"[constructive algorithms, number theory]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and ACM,1000.0,B,1396798800,"[combinatorics, dp]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and Reverse Operation,1500.0,C,1396798800,"[combinatorics, divide and conquer]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and Water Tanks,1500.0,D,1396798800,"[binary search, data structures, greedy, two pointers]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh's Designed Problem,2500.0,E,1396798800,[data structures],PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Lights,500.0,A,1396798800,[implementation],PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Tokens,1000.0,B,1396798800,"[binary search, greedy, math]",PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Numbers,1500.0,C,1396798800,"[constructive algorithms, greedy, number theory]",PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and ACM,2000.0,D,1396798800,"[combinatorics, dp, number theory]",PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Reverse Operation,2500.0,E,1396798800,"[divide and conquer, sortings]",PROGRAMMING
+409,April Fools Day Contest 2014,12,The Great Game,,A,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Mysterious Language,,B,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Magnum Opus,,C,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Big Data,,D,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Dome,,E,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,000001,,F,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,On a plane,,G,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,A + B Strikes Back,,H,1396366200,"[*special, brute force, constructive algorithms, dsu, implementation]",PROGRAMMING
+409,April Fools Day Contest 2014,12,Feed the Golorp,,I,1396366200,[*special],PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Triangle,500.0,A,1396162800,"[brute force, implementation, math]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Long Path,1000.0,B,1396162800,"[dp, implementation]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Curious Array,2000.0,C,1396162800,"[brute force, implementation, math]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Largest Submatrix 3,2000.0,D,1396162800,"[dp, hashing]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,k-d-sequence,2500.0,E,1396162800,[data structures],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Line to Cashier,500.0,A,1396162800,[implementation],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Garland,1000.0,B,1396162800,[implementation],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Triangle,1500.0,C,1396162800,"[geometry, math]",PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Long Path,2000.0,D,1396162800,[dp],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Curious Array,3000.0,E,1396162800,[],PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Gravity Flip,500.0,A,1395502200,"[greedy, implementation, sortings]",PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Domino Effect,1000.0,B,1395502200,[],PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Unusual Product,1500.0,C,1395502200,"[implementation, math]",PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Toy Sum,2000.0,D,1395502200,"[greedy, implementation, math]",PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Graph Cutting,3000.0,E,1395502200,[dfs and similar],PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Unusual Product,500.0,A,1395502200,"[implementation, math]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Toy Sum,1000.0,B,1395502200,"[constructive algorithms, greedy]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Graph Cutting,2000.0,C,1395502200,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Hill Climbing,2000.0,D,1395502200,"[dfs and similar, geometry, trees]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Hamming Triples,2500.0,E,1395502200,"[implementation, math]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Valera and X,500.0,A,1395243000,[implementation],PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Marathon,1000.0,B,1395243000,"[implementation, math]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Restore Graph,1500.0,C,1395243000,"[dfs and similar, graphs, sortings]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Minesweeper 1D,2000.0,D,1395243000,"[dp, implementation]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Maze 1D,2500.0,E,1395243000,"[binary search, greedy, implementation]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Nuts,500.0,A,1394983800,"[greedy, math]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Trees in a Row,1000.0,B,1394983800,[brute force],PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Searching for Graph,1500.0,C,1394983800,"[brute force, constructive algorithms]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Upgrading Array,2000.0,D,1394983800,"[dp, greedy, math]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Strictly Positive Matrix,2500.0,E,1394983800,[graphs],PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Searching for Graph,500.0,A,1394983800,"[constructive algorithms, graphs]",PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Upgrading Array,1000.0,B,1394983800,"[dp, greedy, number theory]",PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Strictly Positive Matrix,1500.0,C,1394983800,[graphs],PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Beautiful Pairs of Numbers,1500.0,D,1394983800,"[combinatorics, dp]",PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Two Rooted Trees,2000.0,E,1394983800,"[data structures, implementation]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Vanya and Cards,500.0,A,1394465400,"[implementation, math]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Sereja and Contests,1000.0,B,1394465400,"[greedy, implementation, math]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Team,1500.0,C,1394465400,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Roman and Numbers,2000.0,D,1394465400,"[bitmasks, brute force, combinatorics, dp, number theory]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Olympic Games,2500.0,E,1394465400,[math],PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and Choose Options,500.0,A,1394033400,"[dp, implementation]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and New Matrix of Candies,1000.0,B,1394033400,"[brute force, implementation, schedules]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and Huge Candy Matrix,1500.0,C,1394033400,"[implementation, math]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Dima and Bacteria,2000.0,D,1394033400,"[dsu, graphs, shortest paths]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and Binary Logic,2500.0,E,1394033400,"[binary search, bitmasks, data structures]",PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Cards,500.0,A,1393687800,[implementation],PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Painting The Wall,1000.0,B,1393687800,"[dp, probabilities]",PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Tree and Array,1500.0,C,1393687800,[constructive algorithms],PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Instant Messanger,2000.0,D,1393687800,[data structures],PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Sorting Permutations,2500.0,E,1393687800,[],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Pages,500.0,A,1393687800,[implementation],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Red and Blue Balls,1000.0,B,1393687800,[],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Cards,1500.0,C,1393687800,[number theory],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Painting The Wall,2000.0,D,1393687800,[],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Tree and Array,2500.0,E,1393687800,[],PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Number of Decompositions into Multipliers,500.0,A,1393428600,"[combinatorics, number theory]",PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Sum of Fractions,1000.0,B,1393428600,"[math, number theory]",PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Changing Tree,1500.0,C,1393428600,"[data structures, trees]",PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Sum of Number of Inversions in Permutations,2000.0,D,1393428600,[combinatorics],PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Iteration of One Well-Known Function,2500.0,E,1393428600,[],PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Segment's Own Points,500.0,A,1393428600,[],PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Corruption and Numbers,1000.0,B,1393428600,"[implementation, math]",PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Number of Decompositions into Multipliers,1500.0,C,1393428600,"[combinatorics, number theory]",PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Sum of Fractions,2000.0,D,1393428600,[math],PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Changing Tree,2500.0,E,1393428600,"[data structures, trees]",PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Counting Sticks,500.0,A,1392910200,[implementation],PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Very Beautiful Number,1000.0,B,1392910200,[],PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Dominoes,1500.0,C,1392910200,"[constructive algorithms, greedy]",PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Physical Education and Buns,2000.0,D,1392910200,"[brute force, implementation, math]",PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Lightbulb for Minister,2500.0,E,1392910200,[geometry],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Blocked Points,500.0,A,1392728400,[math],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Tower of Hanoi,1000.0,B,1392728400,[dp],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Yet Another Number Sequence,1500.0,C,1392728400,"[combinatorics, math, matrices]",PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Three Arrays,2000.0,D,1392728400,[data structures],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Deleting Substrings,2500.0,E,1392728400,[],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Nineteen,500.0,A,1392728400,[],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Three matrices,1000.0,B,1392728400,[],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Blocked Points,1500.0,C,1392728400,[geometry],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Tower of Hanoi,2000.0,D,1392728400,[dp],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Yet Another Number Sequence,2500.0,E,1392728400,[],PROGRAMMING
+391,Rockethon 2014,12,Genetic Engineering,3.0,A,1392573600,"[implementation, two pointers]",PROGRAMMING
+391,Rockethon 2014,12,Word Folding,5.0,B,1392573600,[brute force],PROGRAMMING
+391,Rockethon 2014,12,The Tournament,4.0,C1,1392573600,[brute force],PROGRAMMING
+391,Rockethon 2014,12,The Tournament,4.0,C2,1392573600,[greedy],PROGRAMMING
+391,Rockethon 2014,12,The Tournament,8.0,C3,1392573600,[],PROGRAMMING
+391,Rockethon 2014,12,Supercollider,3.0,D1,1392573600,[brute force],PROGRAMMING
+391,Rockethon 2014,12,Supercollider,16.0,D2,1392573600,[data structures],PROGRAMMING
+391,Rockethon 2014,12,Three Trees,11.0,E1,1392573600,[],PROGRAMMING
+391,Rockethon 2014,12,Three Trees,13.0,E2,1392573600,[],PROGRAMMING
+391,Rockethon 2014,12,Stock Trading,8.0,F1,1392573600,[dp],PROGRAMMING
+391,Rockethon 2014,12,Stock Trading,15.0,F2,1392573600,[greedy],PROGRAMMING
+391,Rockethon 2014,12,Stock Trading,10.0,F3,1392573600,[],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Alarm Clock,500.0,A,1392132600,[implementation],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,"Inna, Dima and Song",1000.0,B,1392132600,[implementation],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Candy Boxes,1500.0,C,1392132600,[data structures],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Sweet Matrix,2000.0,D,1392132600,[constructive algorithms],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Large Sweet Matrix,2500.0,E,1392132600,[],PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Box Accumulation,500.0,A,1391442000,"[greedy, sortings]",PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Minimal path,1000.0,B,1391442000,"[bitmasks, constructive algorithms, graphs, implementation, math]",PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Card Game,1500.0,C,1391442000,"[games, greedy, sortings]",PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Perfect Sets,2000.0,D,1391442000,[math],PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Meteor Shower,2500.0,E,1391442000,[geometry],PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Number Game,500.0,A,1391442000,"[greedy, math]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Cross,1000.0,B,1391442000,"[greedy, implementation]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Box Accumulation,1500.0,C,1391442000,"[binary search, dp, greedy]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Minimal path,2000.0,D,1391442000,"[constructive algorithms, graphs, implementation, shortest paths]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Card Game,2500.0,E,1391442000,"[greedy, implementation]",PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Sleep,500.0,A,1391095800,[implementation],PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Round,1000.0,B,1391095800,"[brute force, greedy, two pointers]",PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Number,1500.0,C,1391095800,"[greedy, implementation]",PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Interesting Graph,2000.0,D,1391095800,[graph matchings],PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Cards,2500.0,E,1391095800,"[binary search, data structures]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Raspberry,500.0,A,1390577700,"[brute force, greedy, implementation]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Strings,1000.0,B,1390577700,"[brute force, greedy, implementation, math, strings]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Prime Numbers,1500.0,C,1390577700,"[binary search, brute force, data structures, dp, implementation, math, number theory]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Floodlight,2000.0,D,1390577700,"[bitmasks, dp, geometry]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear in the Field,2500.0,E,1390577700,"[math, matrices]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Milking cows,500.0,A,1390231800,"[data structures, greedy]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Volcanoes,1500.0,B,1390231800,"[binary search, implementation, sortings, two pointers]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Propagating tree,1500.0,C,1390231800,"[data structures, dfs and similar, trees]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Antimatter,2000.0,D,1390231800,[dp],PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Vowels,2500.0,E,1390231800,"[combinatorics, divide and conquer, dp]",PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Coder,500.0,A,1390231800,[implementation],PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Multitasking,1000.0,B,1390231800,"[greedy, implementation, sortings, two pointers]",PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Milking cows,1500.0,C,1390231800,[greedy],PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Volcanoes,2500.0,D,1390231800,[implementation],PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Propagating tree,2500.0,E,1390231800,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Ksenia and Pan Scales,500.0,A,1389972600,"[greedy, implementation]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Number Busters,2500.0,B,1389972600,"[binary search, math]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Arithmetic Progression,1500.0,C,1389972600,"[implementation, sortings]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Ksenia and Pawns,3000.0,D,1389972600,"[dfs and similar, graphs, implementation, trees]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Ksenia and Combinatorics,3000.0,E,1389972600,"[combinatorics, dp]",PROGRAMMING
+386,Testing Round #9,12,Second-Price Auction,500.0,A,1389906900,[implementation],PROGRAMMING
+386,Testing Round #9,12,"Fly, freebies, fly!",1000.0,B,1389906900,"[binary search, brute force, implementation]",PROGRAMMING
+386,Testing Round #9,12,Diverse Substrings,1500.0,C,1389906900,"[dp, two pointers]",PROGRAMMING
+386,Testing Round #9,12,Game with Points,2000.0,D,1389906900,"[dp, graphs, implementation, shortest paths]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Prefixes,500.0,A,1389540600,"[binary search, brute force]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Tree,1000.0,B,1389540600,"[graphs, implementation]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Brackets,1500.0,C,1389540600,"[data structures, schedules]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Cinema,2000.0,D,1389540600,"[combinatorics, math]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Dividing,2500.0,E,1389540600,[data structures],PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Dima,500.0,A,1389540600,"[greedy, implementation, two pointers]",PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Stairs,1000.0,B,1389540600,"[greedy, implementation, sortings]",PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Prefixes,1500.0,C,1389540600,"[binary search, implementation, two pointers]",PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Tree,2000.0,D,1389540600,[brute force],PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Brackets,2500.0,E,1389540600,[data structures],PROGRAMMING
+379,Good Bye 2013,12,New Year Candles,500.0,A,1388417400,[implementation],PROGRAMMING
+379,Good Bye 2013,12,New Year Present,1000.0,B,1388417400,"[constructive algorithms, implementation]",PROGRAMMING
+379,Good Bye 2013,12,New Year Ratings Change,1500.0,C,1388417400,"[greedy, sortings]",PROGRAMMING
+379,Good Bye 2013,12,New Year Letter,2000.0,D,1388417400,"[bitmasks, brute force, dp]",PROGRAMMING
+379,Good Bye 2013,12,New Year Tree Decorations,2500.0,E,1388417400,"[geometry, schedules, sortings]",PROGRAMMING
+379,Good Bye 2013,12,New Year Tree,3000.0,F,1388417400,"[data structures, divide and conquer, trees]",PROGRAMMING
+379,Good Bye 2013,12,New Year Cactus,3500.0,G,1388417400,[dp],PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Maze,500.0,A,1388331000,[dfs and similar],PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Preparing for the Contest,1000.0,B,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Captains Mode,1000.0,C,1388331000,"[bitmasks, dp, games]",PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Developing Game,2000.0,D,1388331000,[data structures],PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Cookie Clicker,2500.0,E,1388331000,"[dp, geometry]",PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Playing with Dice,500.0,A,1388331000,[brute force],PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Semifinals,1000.0,B,1388331000,"[implementation, sortings]",PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Maze,1500.0,C,1388331000,[dfs and similar],PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Preparing for the Contest,2000.0,D,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Captains Mode,2000.0,E,1388331000,"[bitmasks, brute force, dp, greedy]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Divisible by Seven,500.0,A,1387893600,"[math, number theory]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Maximum Submatrix 2,1000.0,B,1387893600,"[data structures, dp, implementation, sortings]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Circling Round Treasures,1500.0,C,1387893600,"[bitmasks, shortest paths]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Tree and Queries,2000.0,D,1387893600,"[data structures, dfs and similar, trees]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Red and Black Tree,2500.0,E,1387893600,"[dp, implementation, math]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Lever,500.0,A,1387893600,"[implementation, math]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,I.O.U.,1000.0,B,1387893600,[implementation],PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Divisible by Seven,1500.0,C,1387893600,"[math, number theory]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Maximum Submatrix 2,2000.0,D,1387893600,"[dp, implementation, sortings]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Circling Round Treasures,2500.0,E,1387893600,"[bitmasks, shortest paths]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Pink Pony,500.0,A,1387380600,"[greedy, implementation]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Nine,1000.0,B,1387380600,"[combinatorics, greedy]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Dima,1500.0,C,1387380600,"[dfs and similar, dp, graphs, implementation]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Sequence ,2000.0,D,1387380600,"[binary search, data structures, dp, trees]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Babies,2500.0,E,1387380600,"[binary search, data structures, dsu, geometry, implementation]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Counting Kangaroos is Fun,500.0,A,1386943200,"[binary search, greedy, sortings, two pointers]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Counting Rectangles is Fun,1000.0,B,1386943200,"[brute force, divide and conquer, dp]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Watching Fireworks is Fun,1500.0,C,1386943200,"[data structures, dp, math]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Choosing Subtree is Fun,2000.0,D,1386943200,"[binary search, data structures, dfs and similar, trees, two pointers]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Drawing Circles is Fun,2500.0,E,1386943200,"[combinatorics, geometry]",PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Collecting Beats is Fun,500.0,A,1386943200,[implementation],PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Making Sequences is Fun,1000.0,B,1386943200,"[binary search, implementation, math]",PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Counting Kangaroos is Fun,1500.0,C,1386943200,"[greedy, sortings, two pointers]",PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Counting Rectangles is Fun,2000.0,D,1386943200,[],PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Watching Fireworks is Fun,2500.0,E,1386943200,[dp],PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,K-Periodic Array,500.0,A,1386493200,"[implementation, math]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Fox Dividing Cheese,1000.0,B,1386493200,"[math, number theory]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Hamburgers,1500.0,C,1386493200,"[binary search, brute force]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Vessels,2000.0,D,1386493200,"[data structures, dsu, implementation, trees]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Subway Innovation,2500.0,E,1386493200,"[math, two pointers]",PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,"Rook, Bishop and King",500.0,A,1386399600,[math],PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Berland Bingo,500.0,B,1386399600,[implementation],PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Mittens,1500.0,C,1386399600,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Broken Monitor,3000.0,D,1386399600,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Summer Reading,3000.0,E,1386399600,"[dp, greedy]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Plates,500.0,A,1385739000,[implementation],PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Contest,1000.0,B,1385739000,"[constructive algorithms, implementation, math]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Elections,1500.0,C,1385739000,"[dfs and similar, graphs, trees]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Fools,2000.0,D,1385739000,"[dfs and similar, dp, shortest paths]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Queries,2500.0,E,1385739000,"[binary search, data structures]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and Algorithm ,500.0,A,1385479800,"[data structures, implementation]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja ans Anagrams,1000.0,B,1385479800,"[binary search, data structures]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and the Arrangement of Numbers,1500.0,C,1385479800,"[graphs, greedy, sortings]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and Sets,2000.0,D,1385479800,"[bitmasks, dfs and similar]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and Intervals,2000.0,E,1385479800,"[combinatorics, dp]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and Coat Rack,500.0,A,1385479800,[implementation],PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and Suffixes,1000.0,B,1385479800,"[data structures, dp]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and Algorithm ,1500.0,C,1385479800,"[brute force, implementation]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja ans Anagrams,2000.0,D,1385479800,"[data structures, two pointers]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and the Arrangement of Numbers,2500.0,E,1385479800,"[combinatorics, graphs, implementation]",PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Guards,500.0,A,1385307000,[implementation],PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and To-do List,1000.0,B,1385307000,"[brute force, implementation]",PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Salad,1500.0,C,1385307000,[dp],PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Trap Graph,2000.0,D,1385307000,"[binary search, data structures, dfs and similar, dsu, shortest paths, two pointers]",PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Magic Guitar,2500.0,E,1385307000,"[brute force, implementation, math]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Matrix,500.0,A,1384875000,"[combinatorics, data structures, implementation]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Free Market,1000.0,B,1384875000,"[dp, greedy]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Beautiful Set,1500.0,C,1384875000,"[brute force, number theory]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Ghd,2000.0,D,1384875000,"[brute force, math, probabilities]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Empty Rectangles,2500.0,E,1384875000,"[divide and conquer, two pointers]",PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Good Number,500.0,A,1384875000,[implementation],PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,The Fibonacci Segment,1000.0,B,1384875000,[implementation],PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Matrix,1500.0,C,1384875000,"[brute force, combinatorics, math, matrices]",PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Free Market,2000.0,D,1384875000,"[dp, greedy]",PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Beautiful Set,2500.0,E,1384875000,"[brute force, number theory]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Two Semiknights Meet,1000.0,A,1384443000,"[greedy, math]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Petya and Staircases,500.0,B,1384443000,"[implementation, sortings]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Insertion Sort,2500.0,C,1384443000,"[data structures, dp, implementation, math]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Fools and Foolproof Roads,3000.0,D,1384443000,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Petya and Pipes,3000.0,E,1384443000,"[flows, graphs, shortest paths]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Soroban,500.0,A,1384156800,[implementation],PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Fence,1000.0,B,1384156800,"[brute force, dp]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Fixing Typos,1500.0,C,1384156800,"[greedy, implementation]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Renting Bikes,2000.0,D,1384156800,"[binary search, greedy]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Two Circles,2500.0,E,1384156800,"[brute force, data structures, implementation]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Array Recovery,500.0,A,1384102800,"[greedy, implementation]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Array,1000.0,B,1384102800,"[binary search, dp]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Strings,1500.0,C,1384102800,"[combinatorics, dp]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Sets,1500.0,D,1384102800,[number theory],PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Game,2000.0,E,1384102800,"[graphs, greedy, shortest paths]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Table,500.0,A,1384102800,"[constructive algorithms, implementation]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Permutation,1000.0,B,1384102800,"[constructive algorithms, math, number theory]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Array Recovery,1500.0,C,1384102800,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Array,2000.0,D,1384102800,"[binary search, dp]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Strings,2500.0,E,1384102800,[],PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Table,500.0,A,1383379200,"[greedy, implementation]",PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Permutation,1000.0,B,1383379200,"[constructive algorithms, dp, math]",PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Prime Number,1500.0,C,1383379200,[math],PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Pair of Numbers,2500.0,D,1383379200,"[binary search, brute force, data structures, math, two pointers]",PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Neatness,2500.0,E,1383379200,[dfs and similar],PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Continuous Line,500.0,A,1382715000,"[brute force, implementation]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Text Messages,1000.0,B,1382715000,"[brute force, strings]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Containers,1500.0,C,1382715000,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Hares,2000.0,D,1382715000,"[dp, greedy]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Kicks,3000.0,E,1382715000,"[brute force, dsu, graphs, implementation]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Knight Tournament,500.0,A,1381838400,"[data structures, dsu]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Xenia and Hamming,1000.0,B,1381838400,"[implementation, math]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Compartments,1500.0,C,1381838400,"[combinatorics, constructive algorithms, greedy, implementation]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Bags and Coins,2000.0,D,1381838400,"[bitmasks, constructive algorithms, dp, greedy]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Xenia and String Problem,2500.0,E,1381838400,"[dp, hashing, implementation, string suffix structures, strings]",PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Group of Students,500.0,A,1381838400,"[brute force, greedy, implementation]",PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Flag Day,1000.0,B,1381838400,"[constructive algorithms, implementation]",PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Knight Tournament,1500.0,C,1381838400,[data structures],PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Xenia and Hamming,2000.0,D,1381838400,[number theory],PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Compartments,2500.0,E,1381838400,[],PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Vasya and Robot,500.0,A,1381678200,"[brute force, greedy, math]",PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Game with Strings,1000.0,B,1381678200,"[bitmasks, dp, games]",PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Vasya and Beautiful Arrays,1500.0,C,1381678200,"[brute force, dp, number theory]",PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Transferring Pyramid,2000.0,D,1381678200,[dp],PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Lucky Number Representation,2500.0,E,1381678200,"[constructive algorithms, dfs and similar, dp]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Digital Root,500.0,A,1381678200,"[constructive algorithms, implementation]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Public Transport,1000.0,B,1381678200,"[greedy, implementation]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Robot,1500.0,C,1381678200,"[brute force, dp]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Game with Strings,2000.0,D,1381678200,[],PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Beautiful Arrays,2500.0,E,1381678200,"[binary search, brute force, data structures]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Domino,500.0,A,1381419000,"[implementation, math]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Two Heaps,1500.0,B,1381419000,"[combinatorics, constructive algorithms, greedy, implementation, math, sortings]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Find Maximum,1000.0,C,1381419000,"[implementation, math, number theory]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Queue,2500.0,D,1381419000,[constructive algorithms],PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Antichain,3000.0,E,1381419000,"[dp, graph matchings, greedy]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Rounding,1000.0,A,1380900600,"[dp, greedy, implementation, math]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Furik,1000.0,B,1380900600,"[combinatorics, dp, probabilities]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Brackets,1500.0,C,1380900600,"[dp, matrices]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Removing Periods,2000.0,D,1380900600,[data structures],PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Permutation,2000.0,E,1380900600,[greedy],PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Digits,500.0,A,1380900600,"[brute force, implementation, math]",PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Periods,1000.0,B,1380900600,"[implementation, sortings]",PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Rounding,1500.0,C,1380900600,"[dp, greedy, implementation]",PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Furik,2000.0,D,1380900600,[math],PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Brackets,2500.0,E,1380900600,[],PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,TL,500.0,A,1380641400,"[brute force, greedy, implementation]",PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Resort,1000.0,B,1380641400,[graphs],PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Bombs,1000.0,C,1380641400,"[greedy, implementation, sortings]",PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Looking for Owls,3000.0,D,1380641400,"[binary search, geometry, hashing, sortings]",PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Wrong Floyd,3000.0,E,1380641400,"[brute force, constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Mafia,500.0,A,1380295800,"[binary search, math, sortings]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Apple Tree,1000.0,B,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Subset Sums,1500.0,C,1380295800,"[brute force, data structures]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Turtles,2000.0,D,1380295800,"[dp, matrices]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Pilgrims,2500.0,E,1380295800,"[dfs and similar, dp, trees]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Cinema Line,500.0,A,1380295800,"[greedy, implementation]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Color the Fence,1000.0,B,1380295800,"[data structures, dp, greedy]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Mafia,1500.0,C,1380295800,[implementation],PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Apple Tree,2000.0,D,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Subset Sums,2500.0,E,1380295800,[],PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Alice and Bob,500.0,A,1379691000,"[games, math, number theory]",PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Lucky Common Subsequence,1000.0,B,1379691000,"[dp, strings]",PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Number Transformation II,1500.0,C,1379691000,"[greedy, math]",PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Robot Control,2000.0,D,1379691000,[shortest paths],PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Doodle Jump,2500.0,E,1379691000,[math],PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Difference Row,500.0,A,1379691000,"[implementation, sortings]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Fixed Points,1000.0,B,1379691000,"[implementation, math]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Alice and Bob,1500.0,C,1379691000,"[games, math, number theory]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Lucky Common Subsequence,2000.0,D,1379691000,"[dp, strings]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Number Transformation II,2500.0,E,1379691000,"[dp, greedy, number theory]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Rational Resistance,500.0,A,1379172600,"[math, number theory]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Alternating Current,1000.0,B,1379172600,"[data structures, greedy, implementation]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Read Time,1500.0,C,1379172600,"[binary search, greedy, two pointers]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Water Tree,2000.0,D,1379172600,"[data structures, dfs and similar, trees]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Pumping Stations,2500.0,E,1379172600,"[brute force, dfs and similar, divide and conquer, flows, greedy]",PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Magnets,500.0,A,1379172600,[implementation],PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Simple Molecules,1000.0,B,1379172600,"[brute force, math]",PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Rational Resistance,1500.0,C,1379172600,[math],PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Alternating Current,2000.0,D,1379172600,"[data structures, greedy, implementation]",PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Read Time,2500.0,E,1379172600,"[binary search, two pointers]",PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Expecting Trouble,,A,1379086800,"[*special, probabilities]",PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Triskaidekaphobia,,B,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Counting Fridays,,C,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Chain Letter,,D,1379086800,"[*special, dfs and similar, graphs]",PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Black Cat Rush,,E,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Superstitions Inspection,,F,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Suffix Subgroup,,G,1379086800,"[*special, strings]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Divisors,500.0,A,1378540800,"[greedy, implementation]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Spies,1000.0,B,1378540800,"[brute force, greedy, implementation]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Cupboard and Balloons,1500.0,C,1378540800,[geometry],PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Dominoes,2000.0,D,1378540800,"[bitmasks, dfs and similar, dp]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Tree,2500.0,E,1378540800,"[data structures, divide and conquer, trees]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,The Wall,500.0,A,1377876600,[math],PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Maximal Area Quadrilateral,3000.0,B,1377876600,"[brute force, geometry]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Tourist Problem,2000.0,C,1377876600,"[combinatorics, implementation, math]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Bubble Sort Graph,2000.0,D,1377876600,"[binary search, data structures, dp]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Iahub and Permutations,3000.0,E,1377876600,"[combinatorics, math]",PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Tourist Problem,500.0,A,1377876600,[math],PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Bubble Sort Graph,500.0,B,1377876600,"[binary search, data structures, dp]",PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Iahub and Permutations,1000.0,C,1377876600,"[combinatorics, dp, math]",PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Iahub and Xors,2500.0,D,1377876600,[data structures],PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Candies Game,3000.0,E,1377876600,"[constructive algorithms, greedy]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Helpful Maths,500.0,A,1377531000,"[greedy, implementation, sortings, strings]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Xenia and Ringroad,1000.0,B,1377531000,[implementation],PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Xenia and Weights,1500.0,C,1377531000,"[constructive algorithms, dfs and similar, dp, greedy]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Xenia and Bit Operations,2000.0,D,1377531000,"[data structures, trees]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Three Swaps,3000.0,E,1377531000,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Puzzles,500.0,A,1376668800,"[dp, graph matchings, greedy]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Routine Problem,1000.0,B,1376668800,"[greedy, math, number theory]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Quiz,1500.0,C,1376668800,"[binary search, greedy, math, matrices, number theory]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Book of Evil,2000.0,D,1376668800,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Divisor Tree,2500.0,E,1376668800,"[brute force, number theory, trees]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Quiz,500.0,A,1376668800,"[greedy, math, number theory]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Book of Evil,1000.0,B,1376668800,"[dfs and similar, dp, trees]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Divisor Tree,1500.0,C,1376668800,"[brute force, dp, number theory]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,GCD Table,2000.0,D,1376668800,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Optimize!,2500.0,E,1376668800,[data structures],PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Triangle,500.0,A,1376062200,"[implementation, math]",PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Fly,1000.0,B,1376062200,[math],PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Sequence,1500.0,C,1376062200,"[brute force, greedy, implementation, number theory]",PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Beautiful Strings,2000.0,D,1376062200,"[combinatorics, math]",PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Painting Square,2500.0,E,1376062200,"[bitmasks, combinatorics, dp, implementation]",PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Banana,500.0,A,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Palindrome,1000.0,B,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,More Reclamation,1000.0,C,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Rectangles and Square,2000.0,D,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Counting Skyscrapers,2500.0,E,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,"Buy One, Get One Free",3000.0,F,1375549200,[],PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Banana,500.0,A,1375549200,"[binary search, constructive algorithms, greedy]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Palindrome,1000.0,B,1375549200,"[constructive algorithms, dp]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,More Reclamation,1000.0,C,1375549200,[games],PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Rectangles and Square,2000.0,D,1375549200,"[brute force, dp]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Counting Skyscrapers,2500.0,E,1375549200,"[dp, math, probabilities]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,"Buy One, Get One Free",3000.0,F,1375549200,"[dp, greedy]",PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Secrets,500.0,A,1374913800,[greedy],PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Chips,1000.0,B,1374913800,[greedy],PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Lucky Tickets,1500.0,C,1374913800,"[brute force, constructive algorithms]",PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Characteristics of Rectangles,2000.0,D,1374913800,"[binary search, bitmasks, brute force, implementation, sortings]",PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Summer Earnings,2500.0,E,1374913800,"[binary search, bitmasks, brute force, geometry, sortings]",PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Candy Bags,500.0,A,1374913800,[implementation],PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Eight Point Sets,1000.0,B,1374913800,[sortings],PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Secrets,1500.0,C,1374913800,[math],PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Chips,2000.0,D,1374913800,"[greedy, implementation, two pointers]",PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Lucky Tickets,2500.0,E,1374913800,[],PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Down the Hatch!,500.0,A,1374679800,[implementation],PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Maximum Absurdity,1000.0,B,1374679800,"[data structures, dp, implementation]",PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Students' Revenge,3000.0,C,1374679800,"[data structures, greedy, sortings]",PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Theft of Blueprints,3000.0,D,1374679800,"[graphs, math]",PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Binary Key,3000.0,E,1374679800,"[dp, greedy, implementation]",PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Purification,500.0,A,1374327000,"[constructive algorithms, greedy]",PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Biridian Forest,1000.0,B,1374327000,"[dfs and similar, shortest paths]",PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Graph Reconstruction,1500.0,C,1374327000,[constructive algorithms],PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,The Evil Temple and the Moving Rocks,1500.0,D,1374327000,[constructive algorithms],PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Evil,2500.0,E,1374327000,[math],PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Cakeminator,500.0,A,1374327000,"[brute force, implementation]",PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Road Construction,1000.0,B,1374327000,"[constructive algorithms, graphs]",PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Purification,1500.0,C,1374327000,[matrices],PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Biridian Forest,2000.0,D,1374327000,"[dfs and similar, implementation, shortest paths]",PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Graph Reconstruction,2500.0,E,1374327000,[],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,30.0,A1,1374075000,"[brute force, implementation]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,70.0,A2,1374075000,"[data structures, sortings]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,30.0,B1,1374075000,[implementation],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,70.0,B2,1374075000,[data structures],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C1,1374075000,[dp],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C2,1374075000,[dp],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,60.0,C3,1374075000,[dp],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D1,1374075000,"[dfs and similar, implementation]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D2,1374075000,[graphs],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,40.0,D3,1374075000,"[data structures, implementation, trees]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E1,1374075000,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E2,1374075000,"[constructive algorithms, dp]",PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,30.0,A1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,70.0,A2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,30.0,B1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,70.0,B2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,60.0,C3,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,40.0,D3,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E2,1374043200,[],PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Square and Rectangles,500.0,A,1373734800,[implementation],PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Stadium and Games,1000.0,B,1373734800,"[binary search, math]",PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Monsters and Diamonds,2000.0,C,1373734800,"[dfs and similar, shortest paths]",PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Reclamation,2000.0,D,1373734800,[dsu],PROGRAMMING
+325,MemSQL start[c]up Round 1,12,The Red Button,2500.0,E,1373734800,"[combinatorics, dfs and similar, dsu, greedy]",PROGRAMMING
+328,Testing Round #8,12,IQ Test,500.0,A,1373662800,[implementation],PROGRAMMING
+328,Testing Round #8,12,Sheldon and Ice Pieces,500.0,B,1373662800,[greedy],PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Flipping Game,500.0,A,1372941000,"[brute force, dp, implementation]",PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Hungry Sequence,500.0,B,1372941000,[math],PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Magic Five,1500.0,C,1372941000,"[combinatorics, math]",PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Block Tower,2000.0,D,1372941000,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Axis Walking,3000.0,E,1372941000,"[bitmasks, combinatorics, constructive algorithms, dp, meet-in-the-middle]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Robot,500.0,A,1372433400,"[binary search, implementation, math]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Duel,1000.0,B,1372433400,"[dp, flows, greedy]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel the Commander,1500.0,C,1372433400,"[constructive algorithms, dfs and similar, divide and conquer, greedy, trees]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Flipboard,2000.0,D,1372433400,"[dp, greedy, math]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Gondolas,2500.0,E,1372433400,"[data structures, divide and conquer, dp]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Dancing,500.0,A,1372433400,[greedy],PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Flowers,1000.0,B,1372433400,"[combinatorics, math]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Robot,1500.0,C,1372433400,"[implementation, math, number theory]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Duel,2000.0,D,1372433400,"[dp, flows, greedy, two pointers]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel the Commander,2500.0,E,1372433400,[divide and conquer],PROGRAMMING
+323,Testing Round #7,12,Black-and-White Cube,500.0,A,1372363200,"[combinatorics, constructive algorithms]",PROGRAMMING
+323,Testing Round #7,12,Tournament-graph,1000.0,B,1372363200,[constructive algorithms],PROGRAMMING
+323,Testing Round #7,12,Two permutations,1500.0,C,1372363200,[data structures],PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Malek Dance Club,500.0,A,1371992400,"[combinatorics, math]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Psychos in a Line,1000.0,B,1371992400,"[data structures, implementation]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Kalila and Dimna in the Logging Industry,1500.0,C,1371992400,"[dp, geometry]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Have You Ever Heard About the Word?,2500.0,D,1371992400,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Ping-Pong,2500.0,E,1371992400,[data structures],PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Magic Numbers,500.0,A,1371992400,"[brute force, greedy]",PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Ping-Pong (Easy Version),1000.0,B,1371992400,"[dfs and similar, graphs]",PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Malek Dance Club,1500.0,C,1371992400,[math],PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Psychos in a Line,2000.0,D,1371992400,[data structures],PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Kalila and Dimna in the Logging Industry,2500.0,E,1371992400,[dp],PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Perfect Pair,500.0,A,1371223800,[brute force],PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Ants,1000.0,B,1371223800,"[brute force, implementation]",PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Balance,2500.0,C,1371223800,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Game with Powers,1500.0,D,1371223800,"[dp, games]",PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Princess and Her Shadow,3000.0,E,1371223800,"[constructive algorithms, shortest paths]",PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Even Odds,500.0,A,1371223800,[math],PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Strings of Power,500.0,B,1371223800,"[implementation, strings, two pointers]",PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Perfect Pair,1000.0,C,1371223800,"[greedy, math]",PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Ants,2500.0,D,1371223800,[dfs and similar],PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Balance,3000.0,E,1371223800,"[constructive algorithms, dfs and similar]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Special Task,30.0,A1,1371042000,[greedy],PROGRAMMING
+316,ABBYY Cup 3.0,12,Special Task,70.0,A2,1371042000,[math],PROGRAMMING
+316,ABBYY Cup 3.0,12,EKG,30.0,B1,1371042000,"[brute force, dfs and similar]",PROGRAMMING
+316,ABBYY Cup 3.0,12,EKG,70.0,B2,1371042000,"[dfs and similar, dp]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Tidying Up,30.0,C1,1371042000,[flows],PROGRAMMING
+316,ABBYY Cup 3.0,12,Tidying Up,70.0,C2,1371042000,"[flows, graph matchings]",PROGRAMMING
+316,ABBYY Cup 3.0,12,PE Lesson,30.0,D1,1371042000,"[brute force, dp]",PROGRAMMING
+316,ABBYY Cup 3.0,12,PE Lesson,40.0,D2,1371042000,[dp],PROGRAMMING
+316,ABBYY Cup 3.0,12,PE Lesson,30.0,D3,1371042000,"[dp, math]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Summer Homework,30.0,E1,1371042000,"[brute force, data structures]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Summer Homework,40.0,E2,1371042000,"[data structures, math]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Summer Homework,30.0,E3,1371042000,"[data structures, math]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F1,1371042000,"[dfs and similar, implementation]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Suns and Rays,40.0,F2,1371042000,[],PROGRAMMING
+316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F3,1371042000,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Good Substrings,30.0,G1,1371042000,"[hashing, strings]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Good Substrings,40.0,G2,1371042000,[string suffix structures],PROGRAMMING
+316,ABBYY Cup 3.0,12,Good Substrings,30.0,G3,1371042000,[string suffix structures],PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Contest,500.0,A,1370619000,[implementation],PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Periods,1000.0,B,1370619000,"[binary search, dfs and similar, strings]",PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Subsequences,1500.0,C,1370619000,"[data structures, dp]",PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Straight Lines,2000.0,D,1370619000,"[binary search, data structures, geometry, sortings, two pointers]",PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Squares,2500.0,E,1370619000,[dp],PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Bottles,500.0,A,1370619000,[brute force],PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Array,1000.0,B,1370619000,[implementation],PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Contest,1500.0,C,1370619000,"[dp, greedy, implementation]",PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Periods,2000.0,D,1370619000,"[dfs and similar, strings]",PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Subsequences,2500.0,E,1370619000,"[combinatorics, data structures]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Bank Account,500.0,A,1369927800,"[implementation, number theory]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Queries,1000.0,B,1369927800,"[dp, implementation]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Matrix,1500.0,C,1369927800,"[constructive algorithms, greedy, implementation, sortings]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Roads,2500.0,D,1369927800,[dp],PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Two Numbers,2500.0,E,1369927800,"[constructive algorithms, data structures, dsu, greedy]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,The Closest Pair,500.0,A,1369582200,"[constructive algorithms, implementation]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Cats Transport,1000.0,B,1369582200,"[data structures, dp]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Fetch the Treasure,1500.0,C,1369582200,"[brute force, data structures, shortest paths]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Interval Cubing,2000.0,D,1369582200,"[data structures, math]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Biologist,2500.0,E,1369582200,[flows],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Whose sentence is it?,500.0,A,1369582200,[implementation],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Archer,1000.0,B,1369582200,"[math, probabilities]",PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,The Closest Pair,1500.0,C,1369582200,[constructive algorithms],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Cats Transport,2000.0,D,1369582200,[],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Fetch the Treasure,2500.0,E,1369582200,[],PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Strange Addition,500.0,A,1368968400,"[brute force, constructive algorithms]",PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Continued Fractions,1000.0,B,1368968400,"[brute force, math]",PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Ivan and Powers of Two,1500.0,C,1368968400,[],PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Olya and Graph,2000.0,D,1368968400,"[combinatorics, math]",PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Playing with String,2500.0,E,1368968400,[games],PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Morning run,500.0,A,1368803400,"[binary search, math, two pointers]",PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Context Advertising,500.0,B,1368803400,[two pointers],PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Memory for Arrays,1000.0,C,1368803400,"[binary search, bitmasks, greedy]",PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Tennis Rackets,2000.0,D,1368803400,"[brute force, geometry]",PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Sheep,2500.0,E,1368803400,"[binary search, greedy]",PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Morning run,500.0,A,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Context Advertising,500.0,B,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Memory for Arrays,1000.0,C,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Tennis Rackets,2000.0,D,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Sheep,2500.0,E,1368784800,[],PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Lucky Permutation Triple,500.0,A,1368363600,"[constructive algorithms, implementation, math]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Rectangle Puzzle II,500.0,B,1368363600,"[implementation, math]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Minimum Modular,2000.0,C,1368363600,"[brute force, math]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Rotatable Number,2500.0,D,1368363600,"[math, number theory]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Random Ranking,3000.0,E,1368363600,[dp],PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Pythagorean Theorem II,500.0,A,1368363600,"[brute force, math]",PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Calendar,1000.0,B,1368363600,"[brute force, implementation]",PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Lucky Permutation Triple,1000.0,C,1368363600,[constructive algorithms],PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Rectangle Puzzle II,2000.0,D,1368363600,"[math, ternary search]",PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Minimum Modular,3000.0,E,1368363600,[math],PROGRAMMING
+306,Testing Round #6,12,Candies,500.0,A,1368302400,[implementation],PROGRAMMING
+306,Testing Round #6,12,Optimizer,1000.0,B,1368302400,"[data structures, greedy, sortings]",PROGRAMMING
+306,Testing Round #6,12,"White, Black and White Again",1500.0,C,1368302400,"[combinatorics, number theory]",PROGRAMMING
+306,Testing Round #6,12,Polygon,2000.0,D,1368302400,"[constructive algorithms, geometry]",PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Sequence,500.0,A,1367769900,[constructive algorithms],PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Time,1000.0,B,1367769900,"[binary search, graphs, shortest paths]",PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Algorithm,1500.0,C,1367769900,[constructive algorithms],PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Divisors,2000.0,D,1367769900,[data structures],PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Arrangements,2500.0,E,1367769900,[dp],PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Eugeny and Array,500.0,A,1367769900,[implementation],PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Eugeny and Play List,1000.0,B,1367769900,"[binary search, implementation, two pointers]",PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Yaroslav and Sequence,1500.0,C,1367769900,[constructive algorithms],PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Yaroslav and Time,2000.0,D,1367769900,"[binary search, dfs and similar, dp, shortest paths]",PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Yaroslav and Algorithm,2500.0,E,1367769900,[],PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Array,500.0,A,1366903800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Coach,1000.0,B,1366903800,"[brute force, dfs and similar]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Beautiful Numbers,2000.0,C,1366903800,"[brute force, combinatorics]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Painting Square,3000.0,D,1366903800,"[dp, fft]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Empire Strikes Back,3000.0,E,1366903800,"[binary search, math]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Weird Game,500.0,A,1366644900,"[games, greedy]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Distinct Paths,1500.0,B,1366644900,"[brute force, combinatorics]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Cube Problem,1500.0,C,1366644900,"[brute force, math, number theory]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Ksusha and Square,2000.0,D,1366644900,"[geometry, math, probabilities, two pointers]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Close Vertices,2500.0,E,1366644900,"[data structures, divide and conquer, trees]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha and Array,500.0,A,1366644600,"[brute force, number theory, sortings]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha the Squirrel,1000.0,B,1366644600,"[brute force, implementation]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Weird Game,1500.0,C,1366644600,"[games, greedy]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Distinct Paths,2500.0,D,1366644600,[],PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Cube Problem,2500.0,E,1366644600,[],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Parity Game,500.0,A,1366385400,[constructive algorithms],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Fish Weight,500.0,B,1366385400,"[constructive algorithms, greedy]",PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Splitting the Uniqueness,2000.0,C,1366385400,[constructive algorithms],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Color the Carpet,2500.0,D,1366385400,[constructive algorithms],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Mystic Carvings,3000.0,E,1366385400,[data structures],PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Snow Footprints,500.0,A,1366385400,"[greedy, implementation]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Sail,500.0,B,1366385400,"[brute force, greedy, implementation]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Parity Game,1500.0,C,1366385400,"[combinatorics, constructive algorithms, math, number theory]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Fish Weight,1500.0,D,1366385400,"[greedy, math, sortings]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Splitting the Uniqueness,3000.0,E,1366385400,"[constructive algorithms, sortings]",PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,SMSC,1000.0,A,1366040100,[implementation],PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Network Topology,1000.0,B,1366040100,"[graphs, implementation]",PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Beautiful IP Addresses,1500.0,C,1366040100,[brute force],PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Connected Components,2000.0,D,1366040100,"[data structures, dfs and similar, dp, dsu]",PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Copying Data,2500.0,E,1366040100,[data structures],PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Spyke Talks,500.0,A,1365796800,"[implementation, sortings]",PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Command Line Arguments,1000.0,B,1365796800,"[implementation, strings]",PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Network Mask,1500.0,C,1365796800,"[brute force, implementation]",PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Parallel Programming,2000.0,D,1365796800,[greedy],PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Tree-String Problem,2500.0,E,1365796800,"[dfs and similar, hashing, strings]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Array,500.0,A,1365694200,"[data structures, implementation]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Graph,1000.0,B,1365694200,"[dp, graphs, shortest paths]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Friends,1500.0,C,1365694200,"[combinatorics, dp, graphs, shortest paths]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Caves,2000.0,D,1365694200,"[combinatorics, dp]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Yaroslav and Points,2500.0,E,1365694200,[data structures],PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Yaroslav and Permutations,500.0,A,1365694200,"[greedy, math]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Yaroslav and Two Strings,1500.0,B,1365694200,"[combinatorics, dp]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Greg and Array,1500.0,C,1365694200,"[data structures, dp, implementation]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Greg and Graph,2000.0,D,1365694200,"[dp, graphs]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Greg and Friends,2500.0,E,1365694200,"[combinatorics, dfs and similar, dp]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Oskols,500.0,A,1365348600,"[implementation, math]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Bookshelf,1000.0,B,1365348600,"[dp, greedy]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Lights,1500.0,C,1365348600,"[combinatorics, number theory]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Painter Robot,2000.0,D,1365348600,"[brute force, implementation, number theory]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass the Great,2500.0,E,1365348600,"[dp, trees]",PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Strings,500.0,A,1364916600,[greedy],PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Houses ,1000.0,B,1364916600,[combinatorics],PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and XOR operation,1500.0,C,1364916600,"[implementation, math]",PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Trees ,2000.0,D,1364916600,"[combinatorics, dfs and similar, trees]",PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Lucky Numbers,2500.0,E,1364916600,"[dp, implementation, math]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Segments ,500.0,A,1364916600,"[brute force, implementation]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Matrix,1000.0,B,1364916600,"[brute force, dp, implementation, sortings, ternary search]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Strings,1500.0,C,1364916600,"[constructive algorithms, implementation]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Houses ,2000.0,D,1364916600,"[brute force, combinatorics, dfs and similar, math]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and XOR operation,2500.0,E,1364916600,"[data structures, greedy, implementation, math]",PROGRAMMING
+290,April Fools Day Contest 2013,12,Mysterious strings,,A,1364830200,"[*special, implementation]",PROGRAMMING
+290,April Fools Day Contest 2013,12,QR code,,B,1364830200,"[*special, implementation]",PROGRAMMING
+290,April Fools Day Contest 2013,12,WTF?,,C,1364830200,"[*special, graph matchings, implementation, trees]",PROGRAMMING
+290,April Fools Day Contest 2013,12,Orange,,D,1364830200,"[*special, implementation]",PROGRAMMING
+290,April Fools Day Contest 2013,12,HQ,,E,1364830200,"[*special, constructive algorithms]",PROGRAMMING
+290,April Fools Day Contest 2013,12,Greedy Petya,,F,1364830200,"[*special, dfs and similar, graphs, greedy]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Lucky Permutation,500.0,A,1364025600,"[constructive algorithms, math]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Shifting,1500.0,B,1364025600,[implementation],PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Main Sequence,1500.0,C,1364025600,"[greedy, implementation]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Tourists,2000.0,D,1364025600,"[data structures, sortings]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Ladies' Shop,2500.0,E,1364025600,"[constructive algorithms, fft, math]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,IQ Test,500.0,A,1364025600,"[brute force, implementation]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Pipeline,1500.0,B,1364025600,"[binary search, math]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Lucky Permutation,1500.0,C,1364025600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Shifting,2500.0,D,1364025600,[],PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Main Sequence,2500.0,E,1364025600,"[data structures, greedy]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Slightly Decreasing Permutations,500.0,A,1363879800,"[greedy, implementation]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Find Marble,1000.0,B,1363879800,[implementation],PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Building Permutation,1500.0,C,1363879800,"[greedy, implementation, sortings]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Permutation Sum,2000.0,D,1363879800,"[bitmasks, combinatorics, dp, implementation, meet-in-the-middle]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Positions in Permutations,2500.0,E,1363879800,"[combinatorics, dp, math]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cows and Sequence,1000.0,A,1363534200,"[constructive algorithms, implementation]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cow Program,1000.0,B,1363534200,"[dfs and similar, dp, graphs]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Coin Troubles,1500.0,C,1363534200,[dp],PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cows and Cool Sequences,2000.0,D,1363534200,"[dp, math, number theory]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cow Tennis Tournament,2500.0,E,1363534200,"[combinatorics, data structures, math]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cows and Primitive Roots,500.0,A,1363534200,"[implementation, math, number theory]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cows and Poker Game,1000.0,B,1363534200,"[brute force, implementation]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cows and Sequence,2000.0,C,1363534200,"[constructive algorithms, data structures, dp]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cow Program,2000.0,D,1363534200,"[dfs and similar, dp]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Coin Troubles,2500.0,E,1363534200,"[dfs and similar, dp]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Bit++,500.0,A,1363188600,[implementation],PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Painting Eggs,1000.0,B,1363188600,"[greedy, math]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,XOR and OR,1500.0,C,1363188600,"[constructive algorithms, implementation, math]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Yet Another Number Game,2000.0,D,1363188600,"[dp, games]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Sausage Maximization,2500.0,E,1363188600,"[bitmasks, data structures, trees]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Rectangle Puzzle,500.0,A,1362929400,[geometry],PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Maximum Xor Secondary,1000.0,B,1362929400,"[data structures, implementation, two pointers]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Game on Tree,1500.0,C,1362929400,"[implementation, math, probabilities, trees]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,k-Maximum Subsequence Sum,2000.0,D,1362929400,"[data structures, flows]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Sequence Transformation,2500.0,E,1362929400,"[data structures, dp, implementation, math]",PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Word Capitalization,500.0,A,1362929400,[strings],PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Nearest Fraction,1000.0,B,1362929400,"[brute force, implementation, two pointers]",PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Rectangle Puzzle,1500.0,C,1362929400,"[geometry, implementation]",PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Maximum Xor Secondary,2000.0,D,1362929400,[two pointers],PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Game on Tree,2500.0,E,1362929400,[math],PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Point on Spiral,500.0,A,1362411000,"[brute force, geometry, implementation]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Books,1000.0,B,1362411000,"[binary search, brute force, implementation, two pointers]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Ladder,1500.0,C,1362411000,"[dp, implementation, two pointers]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,The Minimum Number of Variables,2000.0,D,1362411000,"[bitmasks, dp]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Beautiful Decomposition,2000.0,E,1362411000,"[games, greedy]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Learning Languages,500.0,A,1362065400,"[dfs and similar, dsu]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Set of Points,1500.0,B,1362065400,"[constructive algorithms, geometry]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Game,2000.0,C,1362065400,"[games, implementation]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Google Code Jam,3000.0,D,1362065400,"[dp, probabilities]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Binary Tree on Plane,2000.0,E,1362065400,[flows],PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Circle Line,500.0,A,1362065400,[implementation],PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,New Problem,1000.0,B,1362065400,"[brute force, strings]",PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Learning Languages,1000.0,C,1362065400,[dsu],PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Set of Points,3000.0,D,1362065400,"[constructive algorithms, geometry]",PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Game,3000.0,E,1362065400,[games],PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Lunch Rush,500.0,A,1361719800,[implementation],PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Game,1000.0,B,1361719800,"[games, greedy]",PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum Sum,1500.0,C,1361719800,"[data structures, implementation, sortings]",PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum XOR,2000.0,D,1361719800,"[bitmasks, dp, greedy, implementation, math]",PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Problem on Trees,2500.0,E,1361719800,"[data structures, trees]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,k-Multiple Free Set,500.0,A,1361374200,"[binary search, greedy, sortings]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,Zero Tree,1000.0,B,1361374200,"[dfs and similar, dp, greedy, trees]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,The Last Hole!,1500.0,C,1361374200,"[brute force, geometry]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,Lovely Matrix,2000.0,D,1361374200,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,Mirror Room,2000.0,E,1361374200,"[data structures, implementation]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,Lights Out,500.0,A,1361374200,[implementation],PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,Convex Shape,1000.0,B,1361374200,"[constructive algorithms, implementation]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,k-Multiple Free Set,1500.0,C,1361374200,"[binary search, greedy, sortings]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,Zero Tree,2000.0,D,1361374200,"[dfs and similar, dp, trees]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,The Last Hole!,2500.0,E,1361374200,[],PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Friends,500.0,A,1360769400,"[implementation, math]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Sequence,1000.0,B,1360769400,"[implementation, math]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Staircase,1500.0,C,1360769400,"[data structures, implementation]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Two Sequences,2000.0,D,1360769400,"[combinatorics, math, sortings]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Horses,2500.0,E,1360769400,"[combinatorics, constructive algorithms, graphs]",PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Staircase,500.0,A,1360769400,[],PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Two Sequences,1000.0,B,1360769400,[combinatorics],PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Horses,1500.0,C,1360769400,"[graphs, greedy]",PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Figure,2000.0,D,1360769400,[dp],PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Game,2500.0,E,1360769400,"[dp, games]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Beautiful Year,500.0,A,1360596600,[brute force],PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Prime Matrix,1000.0,B,1360596600,"[binary search, brute force, math, number theory]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Secret,1500.0,C,1360596600,"[constructive algorithms, implementation]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Good Substrings,2000.0,D,1360596600,"[data structures, strings]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Three Horses,3000.0,E,1360596600,"[constructive algorithms, math, number theory]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Magical Boxes,500.0,A,1359732600,"[greedy, math]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Greenhouse Effect,1000.0,B,1359732600,[dp],PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Flawed Flow,1500.0,C,1359732600,"[constructive algorithms, flows, graphs]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Maximum Waterfall,2000.0,D,1359732600,"[data structures, dp]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,String Theory,2500.0,E,1359732600,[],PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Fancy Fence,500.0,A,1359732600,"[geometry, implementation, math]",PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Multithreading,1500.0,B,1359732600,"[data structures, greedy, implementation]",PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Magical Boxes,1500.0,C,1359732600,"[binary search, greedy, implementation, math, sortings]",PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Greenhouse Effect,2000.0,D,1359732600,[dp],PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Flawed Flow,2500.0,E,1359732600,"[dfs and similar, sortings]",PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Games,500.0,A,1359387000,[brute force],PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Buttons,1000.0,B,1359387000,"[implementation, math]",PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Beautiful Sets of Points,1500.0,C,1359387000,"[constructive algorithms, implementation]",PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Wall Bars,2500.0,D,1359387000,[dp],PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Playlist,2500.0,E,1359387000,"[math, probabilities, sortings]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,Stones on the Table,500.0,A,1358868600,[implementation],PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,Queue at the School,500.0,B,1358868600,"[constructive algorithms, graph matchings, implementation, shortest paths]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,Below the Diagonal,2500.0,C,1358868600,"[constructive algorithms, greedy, math]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,BerDonalds,3000.0,D,1358868600,"[graphs, math, shortest paths]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,More Queries to Array...,3000.0,E,1358868600,"[data structures, math]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Escape from Stones,500.0,A,1358686800,"[constructive algorithms, data structures, implementation, two pointers]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Good Sequences,1000.0,B,1358686800,"[dp, number theory]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Choosing Balls,1500.0,C,1358686800,[dp],PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Colorful Stones,2000.0,D,1358686800,"[dp, two pointers]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Roadside Trees,2500.0,E,1358686800,"[data structures, dp]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Colorful Stones (Simplified Edition),500.0,A,1358686800,[implementation],PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Roadside Trees (Simplified Edition),1000.0,B,1358686800,"[greedy, implementation]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Escape from Stones,1500.0,C,1358686800,"[greedy, implementation]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Good Sequences,2000.0,D,1358686800,"[dp, number theory]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Choosing Balls,2500.0,E,1358686800,"[schedules, sortings]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Beautiful Matrix,500.0,A,1358350200,[implementation],PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Squares,500.0,B,1358350200,"[greedy, implementation, sortings]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Circle of Numbers,2500.0,C,1358350200,"[dfs and similar, implementation]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Cycle in Graph,2000.0,D,1358350200,"[dfs and similar, graphs]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Rhombus,3000.0,E,1358350200,"[brute force, data structures, dp]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Discounts,500.0,A,1358091000,"[greedy, sortings]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Restaurant,1000.0,B,1358091000,"[dp, math, probabilities]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Matrix,1500.0,C,1358091000,"[constructive algorithms, dp, math]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Increasing Subsequence,2000.0,D,1358091000,[dp],PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Calculator,2500.0,E,1358091000,"[brute force, dp, two pointers]",PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Roma and Lucky Numbers,500.0,A,1358091000,[implementation],PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Roma and Changing Signs,1000.0,B,1358091000,[greedy],PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Maxim and Discounts,1500.0,C,1358091000,"[greedy, sortings]",PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Maxim and Restaurant,2000.0,D,1358091000,"[combinatorics, dp]",PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Maxim and Matrix,2500.0,E,1358091000,[dp],PROGRAMMING
+267,Codeforces Testing Round #5,12,Subtractions,500.0,A,1358002800,"[math, number theory]",PROGRAMMING
+267,Codeforces Testing Round #5,12,Dominoes,1000.0,B,1358002800,"[dfs and similar, graphs]",PROGRAMMING
+267,Codeforces Testing Round #5,12,Berland Traffic,1500.0,C,1358002800,"[math, matrices]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Sockets,500.0,A,1357659000,"[greedy, implementation, sortings]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Playing Cubes,500.0,B,1357659000,"[games, greedy, implementation]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,View Angle,1500.0,C,1357659000,"[brute force, geometry, math]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Sum,2000.0,D,1357659000,"[greedy, math]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Greedy Elevator,3000.0,E,1357659000,"[data structures, implementation]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Adding Digits,500.0,A,1356622500,"[implementation, math]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Ancient Prophesy,1000.0,B,1356622500,"[brute force, implementation, strings]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Balls and Boxes,1500.0,C,1356622500,"[greedy, implementation]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Black and White Tree,2000.0,D,1356622500,"[constructive algorithms, dsu, graphs, greedy, trees]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Dividing Kingdom,2500.0,E,1356622500,"[binary search, brute force, data structures]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Bits,500.0,A,1356190200,"[greedy, math]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Elections,1000.0,B,1356190200,"[brute force, combinatorics, dp]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and LCM,1500.0,C,1356190200,"[binary search, combinatorics, dp, math]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Broken Sorting,2000.0,D,1356190200,"[dp, math, probabilities]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Tree,2500.0,E,1356190200,"[data structures, dfs and similar, trees]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Chess,500.0,A,1356190200,"[brute force, strings]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Magic Square,1000.0,B,1356190200,"[brute force, implementation]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Bits,1500.0,C,1356190200,"[greedy, strings]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Elections,2000.0,D,1356190200,"[brute force, combinatorics, dp, math]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and LCM,2500.0,E,1356190200,"[binary search, combinatorics, math]",PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Almost Arithmetical Progression,500.0,A,1355671800,"[binary search, dp, two pointers]",PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Mr. Bender and Square,1000.0,B,1355671800,"[binary search, brute force, math]",PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Furlo and Rublo and Game,1500.0,C,1355671800,[games],PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Liars and Serge,2000.0,D,1355671800,[dp],PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Lucky Arrays,2500.0,E,1355671800,[data structures],PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Greg's Workout,500.0,A,1355671800,[implementation],PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Code Parsing,1000.0,B,1355671800,[implementation],PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Almost Arithmetical Progression,1500.0,C,1355671800,"[brute force, dp]",PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Mr. Bender and Square,2000.0,D,1355671800,"[binary search, implementation, math]",PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Furlo and Rublo and Game,2500.0,E,1355671800,"[games, implementation, math]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Cards with Numbers,500.0,A,1355047200,"[constructive algorithms, sortings]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Jury Size,1000.0,B,1355047200,"[brute force, implementation]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Anagram,1500.0,C,1355047200,[greedy],PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Rats,2000.0,D,1355047200,"[brute force, dfs and similar, implementation]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Dormitory,2500.0,E,1355047200,"[dp, implementation]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Boys and Girls,500.0,A,1354960800,[greedy],PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Physics Practical,1000.0,B,1354960800,"[binary search, dp, two pointers]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Text Editor,1500.0,C,1354960800,"[data structures, dfs and similar, greedy, shortest paths]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Table with Letters - 2,2000.0,D,1354960800,"[brute force, two pointers]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Printer,2500.0,E,1354960800,"[binary search, data structures, implementation, sortings]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Points on Line,500.0,A,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Playing with Permutations,1000.0,B,1354807800,"[implementation, math]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Number Transformation,1500.0,C,1354807800,"[dp, greedy, number theory]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Two Sets,2000.0,D,1354807800,"[bitmasks, math]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Tree and Table,2500.0,E,1354807800,"[dfs and similar, dp, implementation, trees]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Little Xor,500.0,A,1354807800,"[brute force, implementation]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Unsorting Array,1000.0,B,1354807800,"[brute force, sortings]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Points on Line,1500.0,C,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Playing with Permutations,2000.0,D,1354807800,"[brute force, combinatorics, implementation]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Number Transformation,2500.0,E,1354807800,"[dp, number theory]",PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Paper Work,500.0,A,1353938400,[greedy],PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Restoring IPv6,1000.0,B,1353938400,"[implementation, strings]",PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Movie Critics,1500.0,C,1353938400,[greedy],PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Building Bridge,1500.0,D,1353938400,"[geometry, ternary search, two pointers]",PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Mad Joe,2000.0,E,1353938400,[brute force],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Paper Work,500.0,A,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Restoring IPv6,1000.0,B,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Movie Critics,1500.0,C,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Building Bridge,1500.0,D,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Mad Joe,2000.0,E,1353927300,[],PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Cupboards,500.0,A,1353857400,[implementation],PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Chilly Willy,1000.0,B,1353857400,"[math, number theory]",PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Robo-Footballer,2000.0,C,1353857400,"[binary search, geometry]",PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Sweets for Everyone!,2000.0,D,1353857400,"[binary search, greedy, implementation]",PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Piglet's Birthday,2500.0,E,1353857400,"[dp, probabilities]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Robo-Footballer,1000.0,A,1353857400,[geometry],PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Sweets for Everyone!,1000.0,B,1353857400,"[binary search, greedy]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Piglet's Birthday,1500.0,C,1353857400,"[dp, probabilities]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Donkey and Stars,1500.0,D,1353857400,"[data structures, dp, math, sortings]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Endless Matrix,2500.0,E,1353857400,[math],PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Buggy Sorting,500.0,A,1353511800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Increase and Decrease,1000.0,B,1353511800,"[greedy, math]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Beauty Pageant,1500.0,C,1353511800,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Colorful Graph,2000.0,D,1353511800,"[brute force, dfs and similar, graphs]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Blood Cousins Return,2500.0,E,1353511800,"[binary search, data structures, dfs and similar, dp, sortings]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,System Administrator,,A,1353339000,[implementation],PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Internet Address,,B,1353339000,"[implementation, strings]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Game with Coins,,C,1353339000,[greedy],PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Restoring Table,,D,1353339000,"[constructive algorithms, greedy]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Mishap in Club,,E,1353339000,[implementation],PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Log Stream Analysis,,F,1353339000,"[binary search, brute force, implementation, strings]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Suggested Friends,,G,1353339000,"[brute force, graphs]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Queries for Number of Palindromes,,H,1353339000,"[dp, hashing, strings]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,The Brand New Function,500.0,A,1353079800,[bitmasks],PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Hydra,1000.0,B,1353079800,"[graphs, sortings]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Colorado Potato Beetle,1500.0,C,1353079800,"[dfs and similar, implementation]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Cubes,2000.0,D,1353079800,"[data structures, dp, geometry, two pointers]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Matrix,2500.0,E,1353079800,[data structures],PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Dividing Orange,500.0,A,1353079800,[implementation],PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Undoubtedly Lucky Numbers,1000.0,B,1353079800,"[bitmasks, brute force, dfs and similar]",PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,The Brand New Function,1500.0,C,1353079800,"[bitmasks, divide and conquer, math]",PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Hydra,2000.0,D,1353079800,[],PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Colorado Potato Beetle,2500.0,E,1353079800,[],PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,Heads or Tails,500.0,A,1352647800,"[brute force, implementation]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,Big Segment,1000.0,B,1352647800,"[implementation, sortings]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,King's Path,1500.0,C,1352647800,"[dfs and similar, hashing, shortest paths]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,Dispute,2000.0,D,1352647800,"[dfs and similar, greedy]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,XOR on Segment,2500.0,E,1352647800,"[bitmasks, data structures]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Not Wool Sequences,500.0,A,1352044800,"[constructive algorithms, math]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Boring Partition,1000.0,B,1352044800,[constructive algorithms],PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,World Eater Brothers,1500.0,C,1352044800,"[dfs and similar, dp, greedy, trees]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Tape Programming,2000.0,D,1352044800,"[data structures, implementation]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Meeting Her,2500.0,E,1352044800,"[dp, graphs, shortest paths]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Two Bags of Potatoes,500.0,A,1352044800,"[greedy, implementation, math]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Easy Tape Programming,1000.0,B,1352044800,"[brute force, implementation]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Not Wool Sequences,1500.0,C,1352044800,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Boring Partition,2000.0,D,1352044800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,World Eater Brothers,2500.0,E,1352044800,[],PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Old Peykan,,A,1351783800,[greedy],PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Friends,,B,1351783800,"[binary search, bitmasks, data structures, math]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Mirror Box,,C,1351783800,"[geometry, implementation]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Numbers,,D,1351783800,[],PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Flights,,E,1351783800,"[graphs, shortest paths]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Race,,F,1351783800,"[brute force, implementation]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Challenging Balloons,,G,1351783800,[constructive algorithms],PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Free Cash,500.0,A,1351179000,[implementation],PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Young Table,1000.0,B,1351179000,"[implementation, sortings]",PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Primes on Interval,1500.0,C,1351179000,"[binary search, number theory, two pointers]",PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,T-decomposition,2000.0,D,1351179000,"[dfs and similar, graphs, greedy]",PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Build String,2500.0,E,1351179000,"[flows, graphs]",PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,LCM Challenge,500.0,A,1350803400,[number theory],PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Let's Play Osu!,1000.0,B,1350803400,"[dp, math, probabilities]",PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Cyclical Quest,1500.0,C,1350803400,"[string suffix structures, strings]",PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Graph Game,2000.0,D,1350803400,[graphs],PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Number Challenge,2500.0,E,1350803400,"[combinatorics, dp, implementation, number theory]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Boy or Girl,500.0,A,1350803400,[implementation],PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Easy Number Challenge,1000.0,B,1350803400,"[implementation, number theory]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,LCM Challenge,1500.0,C,1350803400,"[greedy, number theory]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Let's Play Osu!,2000.0,D,1350803400,"[dp, probabilities]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Cyclical Quest,2500.0,E,1350803400,[],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Lefthanders and Righthanders ,,A,1350370800,[implementation],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Reading,,B,1350370800,[sortings],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Weather,,C,1350370800,"[dp, implementation]",PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Cinema,,D,1350370800,[implementation],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Champions' League,,E,1350370800,[implementation],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Fence,,F,1350370800,[dp],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Practice,,G,1350370800,"[constructive algorithms, divide and conquer, implementation]",PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Merging Two Decks,,H,1350370800,"[constructive algorithms, greedy]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Cinema,,A,1350370800,[implementation],PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Fence,,B,1350370800,[dp],PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Practice,,C,1350370800,"[constructive algorithms, implementation]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Merging Two Decks,,D,1350370800,"[constructive algorithms, greedy]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Road Repairs,,E,1350370800,"[dfs and similar, graphs, greedy]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,TorCoder,,F,1350370800,[data structures],PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Cycles,500.0,A,1349969400,"[binary search, constructive algorithms, graphs, greedy]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Table,1000.0,B,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Doe Graphs,1500.0,C,1349969400,"[constructive algorithms, divide and conquer, dp, graphs, shortest paths]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Fence,2000.0,D,1349969400,"[binary search, data structures, string suffix structures]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Quick Tortoise,2500.0,E,1349969400,"[bitmasks, divide and conquer, dp]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Perfect Permutation,500.0,A,1349969400,"[implementation, math]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Non-square Equation,1000.0,B,1349969400,"[binary search, brute force, math]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Cycles,1500.0,C,1349969400,"[combinatorics, graphs, matrices]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Table,2000.0,D,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Doe Graphs,2500.0,E,1349969400,[],PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,Team,500.0,A,1349623800,"[brute force, greedy]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,"Magic, Wizardry and Wonders",1000.0,B,1349623800,"[constructive algorithms, greedy]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,To Add or Not to Add,1500.0,C,1349623800,"[binary search, sortings, two pointers]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,Magic Box,2000.0,D,1349623800,"[brute force, geometry]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,Cactus,2500.0,E,1349623800,"[data structures, dfs and similar, dp, graphs, trees]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Shifts,500.0,A,1349105400,"[brute force, two pointers]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Planets,500.0,B,1349105400,"[binary search, data structures, shortest paths]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Triangles,1000.0,C,1349105400,"[combinatorics, graphs, math]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Towers,1000.0,D,1349105400,"[dp, greedy, two pointers]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Gifts,3000.0,E,1349105400,"[combinatorics, dp, probabilities]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Dragons,500.0,A,1349105400,"[greedy, sortings]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,T-primes,500.0,B,1349105400,"[implementation, math, number theory]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Shifts,1500.0,C,1349105400,"[binary search, data structures, dp, implementation]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Planets,2500.0,D,1349105400,"[binary search, graphs, shortest paths]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Triangles,3000.0,E,1349105400,"[combinatorics, graphs, math]",PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Is your horseshoe on the other hoof?,500.0,A,1348759800,[implementation],PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Two Tables,1000.0,B,1348759800,"[brute force, implementation]",PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Fractal Detector,1500.0,C,1348759800,"[dp, hashing]",PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Zigzag,2000.0,D,1348759800,[data structures],PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,The Road to Berland is Paved With Good Intentions,2500.0,E,1348759800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Flying Saucer Segments,500.0,A,1348500600,[math],PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Naughty Stone Piles,1000.0,B,1348500600,[greedy],PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Anniversary,1500.0,C,1348500600,"[data structures, implementation, math, matrices, number theory]",PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,The table,2000.0,D,1348500600,"[constructive algorithms, greedy]",PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Noble Knight's Path,2500.0,E,1348500600,"[data structures, trees]",PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Where do I Turn?,500.0,A,1348500600,[geometry],PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Effective Approach,1000.0,B,1348500600,[implementation],PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Flying Saucer Segments,1500.0,C,1348500600,[math],PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Naughty Stone Piles,2000.0,D,1348500600,"[math, sortings]",PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Anniversary,2500.0,E,1348500600,"[matrices, number theory]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Dice Tower,500.0,A,1348069500,"[constructive algorithms, greedy]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Well-known Numbers,1000.0,B,1348069500,"[binary search, greedy, number theory]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Barcode,1500.0,C,1348069500,"[dp, matrices]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Snake,3000.0,D,1348069500,"[bitmasks, dfs and similar, graphs, implementation]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Unsolvable,3000.0,E,1348069500,"[math, number theory]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Bracket Sequence,500.0,A,1347809400,"[data structures, expression parsing, implementation]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Two Strings,1000.0,B,1347809400,"[data structures, dp, strings]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Partial Sums,1500.0,C,1347809400,"[combinatorics, math]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Spider,2000.0,D,1347809400,"[geometry, graphs]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Planar Graph,2500.0,E,1347809400,"[flows, geometry, graphs]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Parallelepiped,500.0,A,1347809400,"[brute force, math]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Array,1000.0,B,1347809400,"[bitmasks, implementation, two pointers]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Bracket Sequence,1500.0,C,1347809400,[data structures],PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Two Strings,2000.0,D,1347809400,"[data structures, strings]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Partial Sums,2500.0,E,1347809400,"[combinatorics, math]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Shooshuns and Sequence ,500.0,A,1347291900,"[brute force, implementation]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Cosmic Tables,1000.0,B,1347291900,[implementation],PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Reducing Fractions,1500.0,C,1347291900,"[implementation, number theory, sortings]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Olympiad,2000.0,D,1347291900,"[binary search, greedy, sortings, two pointers]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Decoding Genome,2500.0,E,1347291900,[matrices],PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Problem,500.0,A,1346427000,"[implementation, sortings]",PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Array,1000.0,B,1346427000,"[constructive algorithms, data structures]",PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Shifts,1500.0,C,1346427000,[data structures],PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Triangle,2000.0,D,1346427000,"[chinese remainder theorem, geometry, math]",PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Inversions,2500.0,E,1346427000,"[data structures, two pointers]",PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Function,500.0,A,1346427000,"[implementation, math]",PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Numbers,1000.0,B,1346427000,[implementation],PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Problem,1500.0,C,1346427000,[sortings],PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Array,2000.0,D,1346427000,[data structures],PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Shifts,2500.0,E,1346427000,[],PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,k-String,500.0,A,1346081400,"[implementation, strings]",PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Special Offer! Super Price 999 Bourles!,1000.0,B,1346081400,[implementation],PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Color Stripe,1500.0,C,1346081400,"[brute force, dp, greedy]",PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Choosing Capital for Treeland,2000.0,D,1346081400,"[dfs and similar, dp, trees]",PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Parking Lot,3000.0,E,1346081400,[data structures],PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Ice Skating,500.0,A,1345273500,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Blackboard Fibonacci,1000.0,B,1345273500,"[brute force, math]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Formurosa,2500.0,C,1345273500,"[divide and conquer, dp, expression parsing]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Bitonix' Patrol,3000.0,D,1345273500,"[bitmasks, brute force, combinatorics, dfs and similar, math]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Alien DNA,3000.0,E,1345273500,"[data structures, dsu, trees]",PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Mountain Scenery,500.0,A,1345273500,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Airport,500.0,B,1345273500,[implementation],PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Ice Skating,1000.0,C,1345273500,"[dfs and similar, dsu, graphs]",PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Blackboard Fibonacci,3000.0,D,1345273500,[implementation],PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Formurosa,3000.0,E,1345273500,[],PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Tiling with Hexagons,500.0,A,1344958200,"[implementation, math]",PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Forming Teams,1500.0,B,1344958200,"[dfs and similar, implementation]",PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Hiring Staff,2000.0,C,1344958200,[greedy],PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Spider's Web,2000.0,D,1344958200,"[binary search, sortings, two pointers]",PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Martian Luck,3000.0,E,1344958200,"[math, number theory]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Bicycle Chain,500.0,A,1344267000,"[brute force, implementation]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Olympic Medal,500.0,B,1344267000,"[greedy, math]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Crosses,3000.0,C,1344267000,"[brute force, implementation]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Hot Days,2000.0,D,1344267000,[greedy],PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Periodical Numbers,3000.0,E,1344267000,"[combinatorics, dp, number theory]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Game,1000.0,A,1343662200,"[dfs and similar, greedy]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Numbers,1000.0,B,1343662200,"[combinatorics, dp]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Relay Race,1500.0,C,1343662200,[dp],PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Stars,2000.0,D,1343662200,"[constructive algorithms, geometry]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Two Permutations,2500.0,E,1343662200,"[data structures, hashing, strings]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,System of Equations,500.0,A,1343662200,[brute force],PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Hometask,1000.0,B,1343662200,"[brute force, constructive algorithms, greedy, math]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Game,2000.0,C,1343662200,"[brute force, greedy]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Numbers,2000.0,D,1343662200,"[combinatorics, dp, math]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Relay Race,2500.0,E,1343662200,[dp],PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Dubstep,500.0,A,1343057400,[strings],PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Solitaire,2000.0,B,1343057400,"[dfs and similar, dp]",PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Police Station,2500.0,C,1343057400,"[dp, graphs, shortest paths]",PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,"Prizes, Prizes, more Prizes",500.0,D,1343057400,[implementation],PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Blood Cousins,3000.0,E,1343057400,"[binary search, data structures, dfs and similar, trees]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Privatization,3000.0,A,1342450800,"[flows, graphs]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Polycarpus is Looking for Good Substrings,2000.0,B,1342450800,"[bitmasks, hashing, implementation]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Cowboys,1500.0,C,1342450800,"[dp, math]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Cutting a Fence,2500.0,D,1342450800,"[binary search, data structures, dsu]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,IT Restaurants,500.0,E,1342450800,"[dfs and similar, dp, trees]",PROGRAMMING
+211,VK Cup 2012 Finals,12,Privatization,3000.0,A,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,Polycarpus is Looking for Good Substrings,1000.0,B,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,Cowboys,500.0,C,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,Cutting a Fence,1000.0,D,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,IT Restaurants,500.0,E,1342335600,[],PROGRAMMING
+209,"VK Cup 2012 Finals, Practice Session",12,Multicolored Marbles,500.0,A,1342252500,"[dp, math]",PROGRAMMING
+209,"VK Cup 2012 Finals, Practice Session",12,Pixels,500.0,B,1342252500,"[constructive algorithms, math]",PROGRAMMING
+209,"VK Cup 2012 Finals, Practice Session",12,Trails and Glades,1000.0,C,1342252500,"[constructive algorithms, dsu, graphs, greedy]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Interval,500.0,A,1342020600,"[binary search, combinatorics, dp]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Cards,500.0,B,1342020600,"[binary search, data structures]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Furik and Rubik,1500.0,C,1342020600,"[math, probabilities]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Retro Strings,2000.0,D,1342020600,[dp],PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Strings,2500.0,E,1342020600,"[data structures, implementation, string suffix structures, two pointers]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Rozdil,500.0,A,1342020600,"[brute force, implementation]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Sorting,1000.0,B,1342020600,"[brute force, greedy]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Interval,1500.0,C,1342020600,"[binary search, brute force, combinatorics, dp, math]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Cards,1500.0,D,1342020600,"[binary search, brute force, sortings]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Furik and Rubik,2500.0,E,1342020600,"[brute force, combinatorics, probabilities]",PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,20.0,A1,1341730800,[greedy],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,30.0,A2,1341730800,[greedy],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,50.0,A3,1341730800,[greedy],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,20.0,B1,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,30.0,B2,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,50.0,B3,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,20.0,C1,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,30.0,C2,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,50.0,C3,1341730800,[data structures],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D1,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D10,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D2,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D3,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D4,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D5,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D6,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D7,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D8,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D9,1341730800,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,20.0,A1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,30.0,A2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,50.0,A3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Military Trainings,20.0,B1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Military Trainings,30.0,B2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Military Trainings,50.0,B3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,20.0,C1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,30.0,C2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,50.0,C3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D10,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D4,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D5,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D6,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D7,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D8,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D9,1341576900,[],PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Two Problems,500.0,A,1341329400,"[brute force, implementation]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Game on Paper,1000.0,B,1341329400,"[brute force, implementation]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Photographer,1500.0,C,1341329400,"[greedy, sortings]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Hit Ball,2000.0,D,1341329400,"[geometry, implementation, math]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Transportation,2500.0,E,1341329400,"[greedy, sortings, two pointers]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Clear Symmetry,1000.0,A,1340983800,"[constructive algorithms, dp, math]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Guess That Car!,1000.0,B,1340983800,"[math, ternary search]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Fragile Bridges,1500.0,C,1340983800,[dp],PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Brand New Problem,2000.0,D,1340983800,"[bitmasks, brute force, dp]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Thoroughly Bureaucratic Organization,2500.0,E,1340983800,"[binary search, combinatorics]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,LLPS,500.0,A,1340983800,"[binary search, bitmasks, brute force, greedy, implementation, strings]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Brand New Easy Problem,1000.0,B,1340983800,[brute force],PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Clear Symmetry,2000.0,C,1340983800,"[binary search, math]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Guess That Car!,2000.0,D,1340983800,"[dp, math]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Fragile Bridges,2500.0,E,1340983800,"[data structures, dp]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Cinema,3000.0,A,1340551800,"[brute force, data structures]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Drinks,500.0,B,1340551800,"[implementation, math]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Football Championship,2000.0,C,1340551800,"[brute force, implementation]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Programming Language,1500.0,D,1340551800,"[binary search, brute force, expression parsing, implementation]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Tractor College,3000.0,E,1340551800,"[implementation, math, number theory, ternary search]",PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,About Bacteria,500.0,A,1340379000,"[implementation, math]",PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Jumping on Walls,1000.0,B,1340379000,[shortest paths],PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Delivering Carcinogen,1500.0,C,1340379000,"[binary search, geometry]",PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Cube Snake,2000.0,D,1340379000,[constructive algorithms],PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Gripping Story,2500.0,E,1340379000,"[binary search, data structures, sortings]",PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Hexadecimal's theorem,500.0,A,1340379000,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Special Olympics,1000.0,B,1340379000,[geometry],PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,About Bacteria,1500.0,C,1340379000,[math],PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Jumping on Walls,2000.0,D,1340379000,"[dfs and similar, shortest paths]",PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Delivering Carcinogen,2500.0,E,1340379000,"[binary search, geometry]",PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Lexicographically Maximum Subsequence,500.0,A,1339506000,[greedy],PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Infinite Maze,1000.0,B,1339506000,[dfs and similar],PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Paint Tree,1500.0,C,1339506000,"[divide and conquer, geometry, sortings, trees]",PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,The Next Good String,3000.0,D,1339506000,"[data structures, greedy, hashing, strings]",PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Opening Portals,2500.0,E,1339506000,"[dsu, graphs, shortest paths]",PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Plate Game,1000.0,A,1339506000,"[constructive algorithms, games, math]",PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Limit,500.0,B,1339506000,[math],PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Lexicographically Maximum Subsequence,500.0,C,1339506000,"[greedy, implementation, sortings]",PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Infinite Maze,3000.0,D,1339506000,[hashing],PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Paint Tree,3000.0,E,1339506000,"[constructive algorithms, dfs and similar, geometry]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Let's Watch Football,500.0,A,1339342200,"[binary search, brute force, math]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,After Training,1000.0,B,1339342200,"[data structures, implementation, math]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Try and Catch,1500.0,C,1339342200,"[expression parsing, implementation]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Analyzing Polyline,2000.0,D,1339342200,"[math, sortings]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Building Forest,2500.0,E,1339342200,"[data structures, dsu]",PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Cutting Figure,500.0,A,1338737400,"[2-sat, chinese remainder theorem, trees]",PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Xor,1000.0,B,1338737400,[brute force],PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Hamming Distance,2000.0,C,1338737400,"[constructive algorithms, greedy, math, matrices]",PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Two Segments,2000.0,D,1338737400,[data structures],PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Fibonacci Number,2500.0,E,1338737400,"[brute force, math, matrices]",PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Exams,500.0,A,1338737400,"[implementation, math]",PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Square,1000.0,B,1338737400,[math],PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Cutting Figure,1500.0,C,1338737400,"[dfs and similar, graphs, implementation, matrices, strings]",PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Xor,2000.0,D,1338737400,[],PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Hamming Distance,3000.0,E,1338737400,[math],PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Dynasty Puzzles,500.0,A,1338132600,[dp],PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Demonstration,1000.0,B,1338132600,[greedy],PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Fools and Roads,1500.0,C,1338132600,"[data structures, dfs and similar, trees]",PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Metro Scheme,2000.0,D,1338132600,"[graphs, greedy]",PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Thwarting Demonstrations,2500.0,E,1338132600,"[binary search, data structures, trees]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Funky Numbers,500.0,A,1338132600,"[binary search, brute force, implementation]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Walking in the Rain,1000.0,B,1338132600,"[brute force, implementation]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Dynasty Puzzles,1500.0,C,1338132600,[dp],PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Demonstration,2000.0,D,1338132600,"[brute force, constructive algorithms]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Fools and Roads,2500.0,E,1338132600,"[data structures, trees]",PROGRAMMING
+188,Surprise Language Round #6,12,Hexagonal Numbers,,A,1337959800,[*special],PROGRAMMING
+188,Surprise Language Round #6,12,A + Reverse B,,B,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,LCM,,C,1337959800,"[*special, implementation, math]",PROGRAMMING
+188,Surprise Language Round #6,12,Asterisks,,D,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,HQ9+,,E,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,Binary Notation,,F,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,Array Sorting,,G,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,Stack,,H,1337959800,"[*special, expression parsing, implementation]",PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Vasya and the Bus,500.0,A,1337182200,"[greedy, math]",PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Surrounded,1000.0,B,1337182200,[geometry],PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,STL,1500.0,C,1337182200,[dfs and similar],PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Non-Secret Cypher,2000.0,D,1337182200,[two pointers],PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Counter Attack,2500.0,E,1337182200,"[data structures, dsu, graphs, hashing, sortings]",PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,Permutations,500.0,A,1336663800,[greedy],PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,AlgoRace,1000.0,B,1336663800,"[dp, shortest paths]",PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,Weak Memory,1500.0,C,1336663800,"[dfs and similar, dsu]",PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,BRT Contract ,2000.0,D,1336663800,[data structures],PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,Heaven Tour,2500.0,E,1336663800,"[data structures, greedy]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Cut Ribbon,500.0,A,1336663800,"[brute force, dp]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Counting Rhombi,1000.0,B,1336663800,"[brute force, math]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Permutations,1500.0,C,1336663800,"[greedy, implementation]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,AlgoRace,2000.0,D,1336663800,"[dp, shortest paths]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Weak Memory,2500.0,E,1336663800,"[binary search, shortest paths]",PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Plant,500.0,A,1336145400,[math],PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Mushroom Scientists,1000.0,B,1336145400,"[math, ternary search]",PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Clever Fat Rat,1500.0,C,1336145400,[dp],PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Visit of the Great,2000.0,D,1336145400,"[math, number theory]",PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Soap Time! - 2,2500.0,E,1336145400,"[binary search, data structures]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Comparing Strings,500.0,A,1336145400,"[implementation, strings]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Growing Mushrooms,1000.0,B,1336145400,"[greedy, sortings]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Plant,1500.0,C,1336145400,"[dp, math, matrices, number theory]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Mushroom Scientists,2000.0,D,1336145400,"[math, number theory, probabilities]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Clever Fat Rat,2500.0,E,1336145400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Educational Game,20.0,A1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Educational Game,30.0,A2,1335614400,[greedy],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Educational Game,50.0,A3,1335614400,[greedy],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,20.0,B1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,30.0,B2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,50.0,B3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,20.0,C1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,30.0,C2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,50.0,C3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Magic Squares,20.0,D1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Magic Squares,30.0,D2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Magic Squares,50.0,D3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,20.0,E1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,30.0,E2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,50.0,E3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,20.0,F1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,30.0,F2,1335614400,"[dp, sortings, strings]",PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,50.0,F3,1335614400,[],PROGRAMMING
+183,Croc Champ 2012 - Final,12,Headquarters,500.0,A,1335532800,"[constructive algorithms, math]",PROGRAMMING
+183,Croc Champ 2012 - Final,12,Zoo,1000.0,B,1335532800,"[brute force, geometry]",PROGRAMMING
+183,Croc Champ 2012 - Final,12,Cyclic Coloring,1500.0,C,1335532800,[dfs and similar],PROGRAMMING
+183,Croc Champ 2012 - Final,12,T-shirt,2000.0,D,1335532800,"[dp, greedy, probabilities]",PROGRAMMING
+183,Croc Champ 2012 - Final,12,Candy Shop,2500.0,E,1335532800,[greedy],PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Battlefield,3000.0,A,1335280200,"[geometry, graphs, implementation, shortest paths]",PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Vasya's Calendar,500.0,B,1335280200,[implementation],PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Optimal Sum,3000.0,C,1335280200,"[data structures, greedy]",PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Common Divisors,1000.0,D,1335280200,"[brute force, hashing, implementation, math, strings]",PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Wooden Fence,1500.0,E,1335280200,[dp],PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Defragmentation,,A,1335078000,[implementation],PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Divisibility Rules,,B,1335078000,"[math, number theory]",PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Letter,,C,1335078000,[dp],PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Name,,D,1335078000,"[greedy, strings]",PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Cubes,,E,1335078000,"[binary search, dp, two pointers]",PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Mathematical Analysis Rocks!,,F,1335078000,"[constructive algorithms, implementation, math]",PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,30.0,A1,1335016800,[implementation],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,70.0,A2,1335016800,[implementation],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,30.0,B1,1335016800,[number theory],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,70.0,B2,1335016800,[number theory],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Party,30.0,C1,1335016800,"[dfs and similar, dsu, graphs]",PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Party,70.0,C2,1335016800,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,30.0,D1,1335016800,[brute force],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,70.0,D2,1335016800,[data structures],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Space Voyage,30.0,E1,1335016800,[binary search],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Space Voyage,70.0,E2,1335016800,[binary search],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Script Generation,30.0,F1,1335016800,[],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Script Generation,70.0,F2,1335016800,[],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,30.0,G1,1335016800,[strings],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,70.0,G2,1335016800,"[matrices, strings]",PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Trading Business,500.0,A,1334934300,"[greedy, sortings]",PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Word Cut,1000.0,B,1334934300,[dp],PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Playing with Superglue,1500.0,C,1334934300,"[combinatorics, constructive algorithms]",PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Hyper String,2000.0,D,1334934300,[dp],PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Archaeology,2500.0,E,1334934300,"[data structures, dfs and similar, trees]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Series of Crimes,500.0,A,1334934300,"[brute force, geometry, implementation]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Number of Triplets,1000.0,B,1334934300,"[binary search, brute force]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Trading Business,1500.0,C,1334934300,"[games, graph matchings, greedy]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Word Cut,2000.0,D,1334934300,[dp],PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Playing with Superglue,2500.0,E,1334934300,[games],PROGRAMMING
+175,Codeforces Round #115,12,Robot Bicorn Attack,500.0,A,1334390400,"[brute force, implementation]",PROGRAMMING
+175,Codeforces Round #115,12,Plane of Tanks: Pro,500.0,B,1334390400,[implementation],PROGRAMMING
+175,Codeforces Round #115,12,Geometry Horse,1000.0,C,1334390400,"[greedy, implementation, sortings]",PROGRAMMING
+175,Codeforces Round #115,12,Plane of Tanks: Duel,2500.0,D,1334390400,"[brute force, dp, math, probabilities]",PROGRAMMING
+175,Codeforces Round #115,12,Power Defence,3000.0,E,1334390400,"[brute force, dp, geometry, greedy]",PROGRAMMING
+175,Codeforces Round #115,12,Gnomes of Might and Magic,3000.0,F,1334390400,"[data structures, graphs, implementation, shortest paths]",PROGRAMMING
+164,VK Cup 2012 Round 3,12,"Variable, or There and Back Again",500.0,A,1333897500,"[dfs and similar, graphs]",PROGRAMMING
+164,VK Cup 2012 Round 3,12,Ancient Berland Hieroglyphs,1000.0,B,1333897500,[two pointers],PROGRAMMING
+164,VK Cup 2012 Round 3,12,Machine Programming,1500.0,C,1333897500,[flows],PROGRAMMING
+164,VK Cup 2012 Round 3,12,Minimum Diameter,2500.0,D,1333897500,"[binary search, brute force]",PROGRAMMING
+164,VK Cup 2012 Round 3,12,Polycarpus and Tasks,2500.0,E,1333897500,[],PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Problem About Equation,500.0,A,1333897500,[math],PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,File List,1000.0,B,1333897500,"[dp, greedy, implementation]",PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Range Increments,1500.0,C,1333897500,"[data structures, greedy]",PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,"Variable, or There and Back Again",2500.0,D,1333897500,[graphs],PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Ancient Berland Hieroglyphs,3000.0,E,1333897500,[],PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Rock-Paper-Scissors,500.0,A,1333724400,"[implementation, math]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Chamber of Secrets,1000.0,B,1333724400,"[dfs and similar, shortest paths]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Spiral Maximum,1500.0,C,1333724400,"[brute force, dp]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Deputies,2000.0,D,1333724400,"[constructive algorithms, graphs, greedy, implementation]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Camping Groups,2500.0,E,1333724400,"[data structures, sortings]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Phone Code,1000.0,A,1333440000,"[brute force, implementation]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Pseudorandom Sequence Period,1000.0,B,1333440000,"[implementation, number theory]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Bus,1500.0,C,1333440000,"[implementation, sortings]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Calendar Reform,1500.0,D,1333440000,[number theory],PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,BHTML+BCSS,2000.0,E,1333440000,"[dfs and similar, expression parsing]",PROGRAMMING
+171,April Fools Day Contest,12,Mysterious numbers - 1,,A,1333292400,"[*special, constructive algorithms]",PROGRAMMING
+171,April Fools Day Contest,12,Star,,B,1333292400,"[*special, combinatorics]",PROGRAMMING
+171,April Fools Day Contest,12,A Piece of Cake,,C,1333292400,"[*special, implementation]",PROGRAMMING
+171,April Fools Day Contest,12,Broken checker,,D,1333292400,"[*special, brute force]",PROGRAMMING
+171,April Fools Day Contest,12,MYSTERIOUS LANGUAGE,,E,1333292400,[*special],PROGRAMMING
+171,April Fools Day Contest,12,ucyhf,,F,1333292400,"[*special, brute force, implementation, number theory]",PROGRAMMING
+171,April Fools Day Contest,12,Mysterious numbers - 2,,G,1333292400,[*special],PROGRAMMING
+171,April Fools Day Contest,12,A polyline,,H,1333292400,"[*special, implementation]",PROGRAMMING
+170,VK Cup 2012 Wild-card Round 2,12,Placing Rectangles,,A,1332954000,[*special],PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Trolleybuses,500.0,A,1332860400,[implementation],PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Huge Prize,1000.0,B,1332860400,"[dp, probabilities]",PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Numbers,1500.0,C,1332860400,"[games, math]",PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Roads,2000.0,D,1332860400,"[data structures, divide and conquer, graph matchings]",PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Bets,2500.0,E,1332860400,"[math, matrices]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Demonstration,500.0,A,1332860400,"[implementation, math]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Minimal Spell,1000.0,B,1332860400,"[implementation, strings]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Trolleybuses,1500.0,C,1332860400,"[implementation, math]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Huge Prize,2000.0,D,1332860400,"[dp, probabilities]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Numbers,2500.0,E,1332860400,[],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Substring and Subsequence,1000.0,A,1332687900,[dp],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Lemmings,1000.0,B,1332687900,[binary search],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Conveyor,1500.0,C,1332687900,[sortings],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Large Refrigerator,2000.0,D,1332687900,[brute force],PROGRAMMING
+163,VK Cup 2012 Round 2,12,e-Government,2500.0,E,1332687900,"[data structures, dfs and similar, dp, strings, trees]",PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Chores,500.0,A,1332687900,[sortings],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Replacing Digits,1000.0,B,1332687900,[greedy],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Substring and Subsequence,1500.0,C,1332687900,[dp],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Lemmings,2000.0,D,1332687900,[],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Conveyor,2500.0,E,1332687900,[],PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Rank List,500.0,A,1332516600,"[binary search, implementation, sortings]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Polygons,3000.0,B,1332516600,"[geometry, sortings]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Median,1000.0,C,1332516600,"[greedy, math, sortings]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Shoe Store,3000.0,D,1332516600,"[dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Tetrahedron,1000.0,E,1332516600,"[dp, math, matrices]",PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Pentagonal numbers,,A,1332083400,"[*special, implementation]",PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Binary notation,,B,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Prime factorization,,C,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Remove digits,,D,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,HQ9+,,E,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Factorial zeros,,F,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Non-decimal sum,,G,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Alternating case,,H,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Truncatable primes,,I,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Brackets,,J,1332083400,[*special],PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Supercentral Point,500.0,A,1331911800,[implementation],PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Burning Midnight Oil,1000.0,B,1331911800,"[binary search, implementation]",PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Another Problem on Strings,1500.0,C,1331911800,"[binary search, brute force, dp, math, strings, two pointers]",PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Beard Graph,2000.0,D,1331911800,"[data structures, dsu, trees]",PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Compatible Numbers,2500.0,E,1331911800,"[bitmasks, brute force, dfs and similar, dp]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Dress'em in Vests!,1000.0,A,1331478300,"[binary search, brute force, greedy, two pointers]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Discounts,1000.0,B,1331478300,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Abracadabra,2000.0,C,1331478300,[divide and conquer],PROGRAMMING
+161,VK Cup 2012 Round 1,12,Distance in Tree,2000.0,D,1331478300,"[dfs and similar, dp, trees]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Polycarpus the Safecracker,2500.0,E,1331478300,"[brute force, dp]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Friends or Not,500.0,A,1331280000,"[*special, greedy, implementation]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Matchmaker,1000.0,B,1331280000,"[greedy, sortings]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,String Manipulation 1.0,1500.0,C,1331280000,"[binary search, brute force, data structures, strings]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Palindrome pairs,2000.0,D,1331280000,"[*special, brute force, dp, strings]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Zebra Tower,2500.0,E,1331280000,"[data structures, greedy, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Twins,500.0,A,1331046000,"[greedy, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Unlucky Ticket,1000.0,B,1331046000,"[greedy, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Find Pair,1500.0,C,1331046000,"[implementation, math, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Edges in MST,2000.0,D,1331046000,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Buses and People,2500.0,E,1331046000,"[binary search, data structures, sortings]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Next Round,500.0,A,1330804800,[implementation],PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Taxi,1000.0,B,1330804800,"[greedy, implementation]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Cd and pwd commands,1000.0,C,1330804800,"[data structures, implementation]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Ice Sculptures,1500.0,D,1330804800,"[brute force, number theory]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Phone Talks,2000.0,E,1330804800,"[dp, sortings]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Message,500.0,A,1330536600,[brute force],PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Suspects,1000.0,B,1330536600,"[constructive algorithms, data structures, implementation]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Cipher,1500.0,C,1330536600,"[combinatorics, dp]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Clues,2500.0,D,1330536600,"[combinatorics, graphs]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Mrs. Hudson's Pancakes,2500.0,E,1330536600,"[brute force, dp]",PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Game Outcome,500.0,A,1330536600,[brute force],PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Trace,1000.0,B,1330536600,"[geometry, sortings]",PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Message,1500.0,C,1330536600,"[brute force, dp, strings]",PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Suspects,2000.0,D,1330536600,[implementation],PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Cipher,2500.0,E,1330536600,"[dp, math]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Hometask,500.0,A,1330095600,[greedy],PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Colliders,1000.0,B,1330095600,"[math, number theory]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Double Profiles,1500.0,C,1330095600,"[graphs, hashing, sortings]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Flatland Fencing,2000.0,D,1330095600,"[games, math]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Martian Colony,2500.0,E,1330095600,[geometry],PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,I_love_\%username\%,500.0,A,1330095600,[brute force],PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Combination,1000.0,B,1330095600,"[greedy, sortings]",PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Hometask,1500.0,C,1330095600,"[dp, greedy]",PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Colliders,2000.0,D,1330095600,"[math, number theory]",PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Double Profiles,2500.0,E,1330095600,"[hashing, sortings]",PROGRAMMING
+153,Surprise Language Round #5,12,A + B,,A,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Binary notation,,B,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Caesar Cipher,,C,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Date Change,,D,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Euclidean Distance,,E,1329922800,[*special],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Marks,500.0,A,1329750000,[implementation],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Steps,1000.0,B,1329750000,"[binary search, implementation]",PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Pocket Book,1500.0,C,1329750000,[combinatorics],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Frames,2500.0,D,1329750000,[brute force],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Garden,2500.0,E,1329750000,"[bitmasks, dp, graphs, trees]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Win or Freeze,500.0,A,1329490800,"[games, number theory]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Quantity of Strings,500.0,B,1329490800,"[combinatorics, dfs and similar, math]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Smart Cheater,1000.0,C,1329490800,"[data structures, math, probabilities]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Mission Impassable,1500.0,D,1329490800,[dp],PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Freezing with Style,3000.0,E,1329490800,"[binary search, data structures, divide and conquer, trees]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Soft Drinking,500.0,A,1329490800,"[implementation, math]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Phone Numbers,1000.0,B,1329490800,"[implementation, strings]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Win or Freeze,1500.0,C,1329490800,"[games, greedy, number theory]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Quantity of Strings,1500.0,D,1329490800,"[combinatorics, dsu]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Smart Cheater,3000.0,E,1329490800,[],PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Business trip,500.0,A,1328886000,"[greedy, implementation, sortings]",PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Martian Clock,1000.0,B,1328886000,[implementation],PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Division into Teams,1500.0,C,1328886000,"[greedy, math, sortings]",PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Coloring Brackets,2500.0,D,1328886000,[dp],PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Martian Strings,2500.0,E,1328886000,"[string suffix structures, strings]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Insomnia cure,1000.0,A,1328198400,"[constructive algorithms, implementation, math]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Escape,1000.0,B,1328198400,"[implementation, math]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Terse princess,1000.0,C,1328198400,"[constructive algorithms, greedy]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Bag of mice,1000.0,D,1328198400,"[dp, games, math, probabilities]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Porcelain,1000.0,E,1328198400,[dp],PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Conversion,500.0,A,1327215600,"[greedy, implementation]",PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Number 2,1000.0,B,1327215600,[constructive algorithms],PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Subsequence,1500.0,C,1327215600,"[combinatorics, dp, math]",PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Pair,2500.0,D,1327215600,"[combinatorics, data structures, implementation]",PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Queries,2500.0,E,1327215600,[data structures],PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Ticket,500.0,A,1327215600,[implementation],PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Mask,1000.0,B,1327215600,"[brute force, implementation]",PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Conversion,1500.0,C,1327215600,[greedy],PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Number 2,2000.0,D,1327215600,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Subsequence,2500.0,E,1327215600,"[combinatorics, dp]",PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Arrival of the General,500.0,A,1326899100,[implementation],PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Meeting,1000.0,B,1326899100,[implementation],PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Anagram Search,1500.0,C,1326899100,"[implementation, strings]",PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Missile Silos,2000.0,D,1326899100,"[data structures, dfs and similar, graphs, shortest paths]",PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Competition,2500.0,E,1326899100,"[data structures, greedy]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Farmer,500.0,A,1326380700,"[brute force, math]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help General,1000.0,B,1326380700,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Caretaker,1500.0,C,1326380700,"[brute force, dp]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Shrek and Donkey 2,2000.0,D,1326380700,[games],PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Greg the Dwarf 2,2500.0,E,1326380700,[geometry],PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Vasilisa the Wise 2,500.0,A,1326380700,"[brute force, math]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Kingdom of Far Far Away 2,1000.0,B,1326380700,"[implementation, strings]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Farmer,1500.0,C,1326380700,"[implementation, math]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help General,2000.0,D,1326380700,"[graph matchings, greedy, math]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Caretaker,2500.0,E,1326380700,[],PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Amusing Joke,500.0,A,1326034800,"[implementation, sortings, strings]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Hopscotch,1000.0,B,1326034800,"[geometry, math]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Queue,2000.0,C,1326034800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Take-off Ramps,2000.0,D,1326034800,"[graphs, shortest paths]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Clearing Up,2500.0,E,1326034800,"[constructive algorithms, dp, dsu, graphs]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Table,500.0,A,1325689200,"[geometry, math]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Cards,1000.0,B,1325689200,"[brute force, greedy, implementation]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Snowmen,1500.0,C,1325689200,"[binary search, data structures, greedy]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Contest,2000.0,D,1325689200,"[greedy, sortings]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Garland,2500.0,E,1325689200,"[combinatorics, dp]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Snowflake,3000.0,F,1325689200,"[geometry, sortings]",PROGRAMMING
+147,Codeforces Testing Round #4,12,Punctuation,500.0,A,1325602800,"[implementation, strings]",PROGRAMMING
+147,Codeforces Testing Round #4,12,Smile House,1000.0,B,1325602800,"[binary search, graphs, matrices]",PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Literature Lesson,500.0,A,1324728000,[implementation],PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Digits Permutations,1000.0,B,1324728000,[greedy],PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Mushroom Gnomes - 2,2000.0,C,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,World of Darkraft,2000.0,D,1324728000,"[dp, games]",PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Hellish Constraints,2500.0,E,1324728000,"[brute force, dp, two pointers]",PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Petr and Book,500.0,A,1324728000,[implementation],PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Wallpaper,1000.0,B,1324728000,"[implementation, math]",PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Literature Lesson,1500.0,C,1324728000,"[implementation, strings]",PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Digits Permutations,2000.0,D,1324728000,[implementation],PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Mushroom Gnomes - 2,3000.0,E,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Postcards and photos,500.0,A,1324015200,[implementation],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Permutation,1000.0,B,1324015200,[greedy],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,History,1500.0,C,1324015200,[sortings],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Palindromes,2000.0,D,1324015200,[dp],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Last Chance,2500.0,E,1324015200,"[data structures, implementation]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Replacement,500.0,A,1323443100,"[implementation, sortings]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Rectangle and Square,1000.0,B,1323443100,"[brute force, geometry, math]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Zero-One,1500.0,C,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Cycle,2000.0,D,1323443100,"[brute force, dfs and similar, implementation]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Weak Subsequence,2500.0,E,1323443100,[combinatorics],PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Presents,500.0,A,1323443100,[implementation],PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Ternary Logic,1000.0,B,1323443100,"[implementation, math]",PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Replacement,1500.0,C,1323443100,"[implementation, sortings]",PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Rectangle and Square,2000.0,D,1323443100,"[geometry, implementation]",PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Zero-One,2500.0,E,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Turing Tape,500.0,A,1322924400,[implementation],PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Piet,1500.0,B,1322924400,[implementation],PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Logo Turtle,1500.0,C,1322924400,[dp],PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Constants in the language of Shakespeare,2000.0,D,1322924400,"[constructive algorithms, dp, greedy]",PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Bits of merry old England,2500.0,E,1322924400,[flows],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,HQ9+,500.0,A,1322924400,[implementation],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Unary,1000.0,B,1322924400,[implementation],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Turing Tape,1500.0,C,1322924400,"[implementation, math]",PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Piet,2500.0,D,1322924400,[implementation],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Logo Turtle,2500.0,E,1322924400,"[dp, implementation]",PROGRAMMING
+134,Codeforces Testing Round #3,12,Average Numbers,500.0,A,1322838000,"[brute force, implementation]",PROGRAMMING
+134,Codeforces Testing Round #3,12,Pairs of Numbers,1000.0,B,1322838000,"[brute force, dfs and similar, math, number theory]",PROGRAMMING
+134,Codeforces Testing Round #3,12,Swaps,1500.0,C,1322838000,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,cAPS lOCK,500.0,A,1322233200,"[implementation, strings]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Opposites Attract,1000.0,B,1322233200,"[implementation, math]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,The World is a Theatre,1500.0,C,1322233200,"[combinatorics, math]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Subway,2000.0,D,1322233200,"[dfs and similar, graphs]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Yet Another Task with Queens,2500.0,E,1322233200,[sortings],PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Present to Mom,2500.0,F,1322233200,"[binary search, two pointers]",PROGRAMMING
+130,Unknown Language Round #4,12,Hexagonal numbers,,A,1321801200,"[*special, implementation]",PROGRAMMING
+130,Unknown Language Round #4,12,Gnikool Ssalg,,B,1321801200,"[*special, implementation, strings]",PROGRAMMING
+130,Unknown Language Round #4,12,Decimal sum,,C,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Exponentiation,,D,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Tribonacci numbers,,E,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Prime factorization,,F,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,CAPS LOCK ON,,G,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Balanced brackets,,H,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Array sorting,,I,1321801200,"[*special, sortings]",PROGRAMMING
+130,Unknown Language Round #4,12,Date calculation,,J,1321801200,[*special],PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Statues,1000.0,A,1321337400,[dfs and similar],PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,String,1500.0,B,1321337400,"[brute force, constructive algorithms, hashing, string suffix structures, strings]",PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Games with Rectangle,1500.0,C,1321337400,"[combinatorics, dp]",PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Numbers,2000.0,D,1321337400,[constructive algorithms],PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Birthday,2500.0,E,1321337400,"[geometry, math]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Cookies,500.0,A,1321337400,[implementation],PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Students and Shoelaces,1000.0,B,1321337400,"[brute force, dfs and similar, graphs]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Statues,2000.0,C,1321337400,"[dfs and similar, graphs, implementation]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,String,2500.0,D,1321337400,"[implementation, string suffix structures, strings]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Games with Rectangle,2500.0,E,1321337400,"[combinatorics, dp]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Hot Bath,500.0,A,1320858000,"[binary search, brute force, math]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Password,1000.0,B,1320858000,"[binary search, dp, hashing, string suffix structures, strings]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,E-reader Display,1500.0,C,1320858000,"[constructive algorithms, greedy]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Fibonacci Sums,2000.0,D,1320858000,"[dp, math]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Pills,2500.0,E,1320858000,"[brute force, flows]",PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Wasted Time,500.0,A,1320858000,[geometry],PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Canvas Frames,1000.0,B,1320858000,[implementation],PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Hot Bath,1500.0,C,1320858000,"[binary search, math]",PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Password,2000.0,D,1320858000,"[hashing, strings]",PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,E-reader Display,2500.0,E,1320858000,[implementation],PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Prime Permutation,1000.0,A,1320333000,"[implementation, number theory, strings]",PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Squares,1000.0,B,1320333000,[math],PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Brackets,1500.0,C,1320333000,"[combinatorics, dp, greedy]",PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,String,2000.0,D,1320333000,[string suffix structures],PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Maze,2500.0,E,1320333000,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,The number of positions,500.0,A,1320333000,[math],PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Permutations,1000.0,B,1320333000,"[brute force, combinatorics, implementation]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Prime Permutation,2000.0,C,1320333000,"[constructive algorithms, dfs and similar, dsu, greedy, number theory, sortings, strings]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Squares,2000.0,D,1320333000,"[brute force, constructive algorithms, number theory]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Brackets,2500.0,E,1320333000,[],PROGRAMMING
+125,Codeforces Testing Round #2,12,Measuring Lengths in Baden,1000.0,A,1319893200,[math],PROGRAMMING
+125,Codeforces Testing Round #2,12,Simple XML,1500.0,B,1319893200,[implementation],PROGRAMMING
+125,Codeforces Testing Round #2,12,Hobbits' Party,2000.0,C,1319893200,"[constructive algorithms, greedy]",PROGRAMMING
+125,Codeforces Testing Round #2,12,Two progressions,3000.0,D,1319893200,"[constructive algorithms, greedy]",PROGRAMMING
+125,Codeforces Testing Round #2,12,MST Company,5000.0,E,1319893200,"[binary search, graphs]",PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Sum,500.0,A,1319727600,[implementation],PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Transformation,1000.0,B,1319727600,[strings],PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Permutation,1500.0,C,1319727600,"[brute force, combinatorics, number theory]",PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Segments,2000.0,D,1319727600,"[binary search, implementation, two pointers]",PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Array,2500.0,E,1319727600,[data structures],PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Division,500.0,A,1319727600,"[brute force, number theory]",PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Substring,1000.0,B,1319727600,"[brute force, implementation]",PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Sum,1500.0,C,1319727600,"[brute force, math]",PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Transformation,2000.0,D,1319727600,[brute force],PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Permutation,2500.0,E,1319727600,[],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Elevator,,A,1318919400,"[brute force, implementation, math]",PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Quiz League,,B,1318919400,[implementation],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Winnie-the-Pooh and honey,,C,1318919400,"[implementation, math]",PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Three Sons,,D,1318919400,[brute force],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Put Knight!,,E,1318919400,[games],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Spiders,,F,1318919400,"[dp, greedy, trees]",PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Boom,,G,1318919400,[implementation],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Brevity is Soul of Wit,,H,1318919400,[graph matchings],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Luck is in Numbers,,I,1318919400,[greedy],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Minimum Sum,,J,1318919400,"[divide and conquer, geometry, sortings]",PROGRAMMING
+119,Codeforces Beta Round #90,12,Epic Game,500.0,A,1318604400,[implementation],PROGRAMMING
+119,Codeforces Beta Round #90,12,Before Exam,1000.0,B,1318604400,"[constructive algorithms, implementation, sortings]",PROGRAMMING
+119,Codeforces Beta Round #90,12,Education Reform,1500.0,C,1318604400,[dp],PROGRAMMING
+119,Codeforces Beta Round #90,12,String Transformation,2000.0,D,1318604400,"[hashing, strings]",PROGRAMMING
+119,Codeforces Beta Round #90,12,Alternative Reality,2500.0,E,1318604400,[geometry],PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,String Task,500.0,A,1317999600,"[implementation, strings]",PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Present from Lena,1000.0,B,1317999600,"[constructive algorithms, implementation]",PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Fancy Number,1500.0,C,1317999600,"[brute force, greedy, sortings, strings]",PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Caesar's Legions,2000.0,D,1317999600,[dp],PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Bertown roads,2500.0,E,1317999600,"[dfs and similar, graphs]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Elevator,500.0,A,1316790000,"[implementation, math]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Very Interesting Game,1000.0,B,1316790000,"[brute force, number theory]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Cycle,1500.0,C,1316790000,"[dfs and similar, graphs]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Not Quick Transformation,2000.0,D,1316790000,"[divide and conquer, math]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Tree or not Tree,2500.0,E,1316790000,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Party,500.0,A,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Lawnmower,1000.0,B,1316098800,"[greedy, sortings]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Plumber,1500.0,C,1316098800,[math],PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Unambiguous Arithmetic Expression,2000.0,D,1316098800,"[dp, expression parsing]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Linear Kingdom Races,2500.0,E,1316098800,"[data structures, dp]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Tram,500.0,A,1316098800,[implementation],PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Little Pigs and Wolves,1000.0,B,1316098800,"[greedy, implementation]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Party,1500.0,C,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Lawnmower,2000.0,D,1316098800,"[dp, greedy]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Plumber,2500.0,E,1316098800,[],PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Grammar Lessons,500.0,A,1315494000,"[implementation, strings]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Petr#,1000.0,B,1315494000,"[brute force, data structures, hashing, strings]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Double Happiness,1500.0,C,1315494000,"[brute force, number theory]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Museum,2000.0,D,1315494000,"[matrices, probabilities]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Sleeping,2500.0,E,1315494000,"[combinatorics, implementation, math]",PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Cifera,500.0,A,1315494000,[math],PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,PFAST Inc.,1000.0,B,1315494000,"[bitmasks, brute force]",PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Grammar Lessons,1500.0,C,1315494000,[implementation],PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Petr#,2000.0,D,1315494000,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Double Happiness,2500.0,E,1315494000,[number theory],PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Inequiations,500.0,A,1315051200,[greedy],PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Divisors,1000.0,B,1315051200,"[binary search, data structures, number theory]",PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Spiders,1500.0,C,1315051200,"[bitmasks, dp, dsu]",PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Coloring,2000.0,D,1315051200,"[combinatorics, dp]",PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Rectangle,2500.0,E,1315051200,[],PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Strings,500.0,A,1315051200,"[implementation, strings]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Square,1000.0,B,1315051200,"[implementation, math]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Inequiations,1500.0,C,1315051200,"[greedy, math]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Divisors,2000.0,D,1315051200,"[implementation, number theory]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Spiders,2500.0,E,1315051200,"[bitmasks, dp]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sum of Digits,500.0,A,1314633600,"[brute force, implementation]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Probability,1000.0,B,1314633600,"[brute force, probabilities]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Tree,1500.0,C,1314633600,"[dp, dsu, trees]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sorting,2000.0,D,1314633600,"[constructive algorithms, sortings]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Interval,2500.0,E,1314633600,"[brute force, math]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Nearly Lucky Number,500.0,A,1314633600,[implementation],PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky String,1000.0,B,1314633600,"[constructive algorithms, strings]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Sum of Digits,1500.0,C,1314633600,"[implementation, math]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Probability,2000.0,D,1314633600,"[brute force, combinatorics, dfs and similar, probabilities]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Tree,2500.0,E,1314633600,"[combinatorics, dfs and similar, trees]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Dorm Water Supply,500.0,A,1314111600,"[dfs and similar, graphs]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Basketball Team,1000.0,B,1314111600,"[combinatorics, dp, probabilities]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Arrangement,1500.0,C,1314111600,"[bitmasks, dp]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Crime Management,2000.0,D,1314111600,"[dp, matrices]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Darts,2500.0,E,1314111600,"[geometry, probabilities]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Palindromic Times,500.0,A,1314111600,"[implementation, strings]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Datatypes,1000.0,B,1314111600,"[math, sortings]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Dorm Water Supply,1500.0,C,1314111600,"[dfs and similar, implementation]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Basketball Team,2000.0,D,1314111600,"[combinatorics, math, probabilities]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Arrangement,2500.0,E,1314111600,[],PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Card Game,500.0,A,1313766000,[implementation],PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Choosing Laptop,1000.0,B,1313766000,"[brute force, implementation]",PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Buns,1500.0,C,1313766000,"[chinese remainder theorem, geometry]",PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Treasure Island,2000.0,D,1313766000,"[brute force, implementation]",PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Space Rescuers,2500.0,E,1313766000,"[geometry, ternary search]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Transmigration,500.0,A,1313247600,[implementation],PROGRAMMING
+105,Codeforces Beta Round #81,12,Dark Assembly,1000.0,B,1313247600,"[brute force, probabilities]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Item World,1500.0,C,1313247600,"[brute force, implementation, sortings]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Entertaining Geodetics,2000.0,D,1313247600,"[brute force, dsu, implementation]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Lift and Throw,2500.0,E,1313247600,[brute force],PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Testing Pants for Sadness,500.0,A,1312714800,"[greedy, implementation, math]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Cthulhu,1000.0,B,1312714800,"[dfs and similar, dsu, graphs]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Russian Roulette,1500.0,C,1312714800,"[constructive algorithms, greedy]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Time to Raid Cowavans,2000.0,D,1312714800,"[brute force, data structures, sortings]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Buying Sets,2500.0,E,1312714800,"[flows, graph matchings]",PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Blackjack,500.0,A,1312714800,[implementation],PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Testing Pants for Sadness,1000.0,B,1312714800,[math],PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Cthulhu,1500.0,C,1312714800,"[dsu, trees]",PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Russian Roulette,2000.0,D,1312714800,[math],PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Time to Raid Cowavans,2500.0,E,1312714800,[],PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Homework,500.0,A,1312390800,[greedy],PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Buses,1000.0,B,1312390800,"[binary search, data structures, dp]",PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Vectors,1500.0,C,1312390800,"[implementation, math]",PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Castle,2000.0,D,1312390800,"[dp, greedy, probabilities, sortings, trees]",PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Candies and Stones,2500.0,E,1312390800,"[divide and conquer, dp]",PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Clothes,500.0,A,1312390800,[brute force],PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Sum of Digits,1000.0,B,1312390800,[implementation],PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Homework,1500.0,C,1312390800,[greedy],PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Buses,2000.0,D,1312390800,"[binary search, data structures, dp]",PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Vectors,2500.0,E,1312390800,[],PROGRAMMING
+100,Unknown Language Round #3,12,Carpeting the Room,,A,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Friendly Numbers,,B,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,A+B,,C,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,World of Mouth,,D,1312005600,"[*special, strings]",PROGRAMMING
+100,Unknown Language Round #3,12,Lamps in a Line,,E,1312005600,"[*special, math]",PROGRAMMING
+100,Unknown Language Round #3,12,Polynom,,F,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Name the album,,G,1312005600,"[*special, data structures, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Battleship,,H,1312005600,"[*special, dfs and similar, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Rotation,,I,1312005600,"[*special, geometry, math]",PROGRAMMING
+100,Unknown Language Round #3,12,Interval Coloring,,J,1312005600,"[*special, greedy, math]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Victoria the Wise,500.0,A,1311346800,"[brute force, implementation]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help King,1000.0,B,1311346800,"[implementation, probabilities, trees]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Greg the Dwarf,1500.0,C,1311346800,"[geometry, ternary search]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Monks,2000.0,D,1311346800,[constructive algorithms],PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Shrek and Donkey,2500.0,E,1311346800,"[dp, games, math, probabilities]",PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Far Away Kingdom,500.0,A,1311346800,[strings],PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Chef Gerasim,1000.0,B,1311346800,"[implementation, sortings]",PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Victoria the Wise,1500.0,C,1311346800,[brute force],PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help King,2000.0,D,1311346800,[],PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Greg the Dwarf,2500.0,E,1311346800,"[binary search, geometry, ternary search]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Domino,500.0,A,1310731200,"[brute force, implementation]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Superset,1500.0,B,1310731200,"[constructive algorithms, divide and conquer]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Winning Strategy,2000.0,C,1310731200,"[binary search, graphs, math, shortest paths]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Robot in Basement,2000.0,D,1310731200,"[bitmasks, brute force, implementation]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Leaders,2500.0,E,1310731200,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Hockey,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Numbers,1000.0,B,1310137200,"[dp, greedy]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Volleyball,1500.0,C,1310137200,[shortest paths],PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Horse Races,2000.0,D,1310137200,"[dp, math]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Country,2500.0,E,1310137200,"[dp, dsu, graphs]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Football,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Lucky Numbers (easy),1000.0,B,1310137200,"[binary search, bitmasks, brute force]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Hockey,1500.0,C,1310137200,"[implementation, strings]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Volleyball,2000.0,D,1310137200,"[graphs, shortest paths]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Horse Races,2500.0,E,1310137200,[],PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Frames,500.0,A,1309446000,[implementation],PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,End of Exams,1000.0,B,1309446000,[greedy],PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Azembler,1500.0,C,1309446000,"[brute force, implementation]",PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Flags,2000.0,D,1309446000,"[dp, math, matrices]",PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Lostborn,2500.0,E,1309446000,"[dp, math]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Restoring Password,500.0,A,1309446000,"[implementation, strings]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Friends,1000.0,B,1309446000,"[implementation, math]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Frames,1500.0,C,1309446000,[math],PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,End of Exams,2000.0,D,1309446000,"[greedy, math]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Azembler,2500.0,E,1309446000,[brute force],PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Newspaper Headline,500.0,A,1308582000,"[greedy, strings]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Queue,1000.0,B,1308582000,"[binary search, data structures]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Ski Base,1500.0,C,1308582000,"[combinatorics, dsu, graphs]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Grocer's Problem,2500.0,D,1308582000,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Igloo Skyscraper,2500.0,E,1308582000,"[data structures, geometry]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Chips,500.0,A,1308582000,"[implementation, math]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Binary Number,1000.0,B,1308582000,[greedy],PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Newspaper Headline,1500.0,C,1308582000,"[binary search, data structures, dp, greedy]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Queue,2000.0,D,1308582000,"[binary search, data structures, dp]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Ski Base,2500.0,E,1308582000,"[data structures, dsu, graphs]",PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Robbery,500.0,A,1308236400,[greedy],PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Widget Library,1000.0,B,1308236400,"[dp, expression parsing, graphs, implementation]",PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Chip Play,1000.0,C,1308236400,"[brute force, data structures, implementation]",PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Space mines,1500.0,D,1308236400,[geometry],PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Fire and Ice,2500.0,E,1308236400,[greedy],PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Cableway,500.0,A,1308236400,"[greedy, math]",PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,African Crossword,1000.0,B,1308236400,"[implementation, strings]",PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Robbery,1500.0,C,1308236400,"[greedy, math]",PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Widget Library,2000.0,D,1308236400,[],PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Chip Play,2000.0,E,1308236400,[],PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Trains,500.0,A,1307458800,[math],PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Vasya and Types,1000.0,B,1307458800,"[implementation, strings]",PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Interesting Game,1500.0,C,1307458800,"[dp, games]",PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Beautiful Road,2000.0,D,1307458800,"[dfs and similar, dp, dsu, implementation, sortings, trees]",PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Mogohu-Rea Idol,2500.0,E,1307458800,[geometry],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Chord,500.0,A,1307458800,"[brute force, implementation]",PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Keyboard,1000.0,B,1307458800,[implementation],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Trains,1500.0,C,1307458800,[number theory],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Vasya and Types,2000.0,D,1307458800,[implementation],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Interesting Game,2500.0,E,1307458800,[],PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Reflection,500.0,A,1306077000,[math],PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Tetris revisited,1000.0,B,1306077000,"[constructive algorithms, graph matchings, greedy, math]",PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Genetic engineering,2000.0,C,1306077000,"[dp, string suffix structures, trees]",PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Powerful array,2500.0,D,1306077000,"[data structures, implementation, math, two pointers]",PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Long sequence,2500.0,E,1306077000,"[brute force, math, matrices]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Domino,500.0,A,1305903600,"[constructive algorithms, implementation]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Embassy Queue,1000.0,B,1305903600,[data structures],PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Petya and Tree,1500.0,C,1305903600,"[binary search, dfs and similar, probabilities, sortings, trees]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Sum of Medians,2000.0,D,1305903600,"[binary search, brute force, data structures, implementation]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Guard Towers,2500.0,E,1305903600,"[binary search, dsu, geometry, graphs, sortings]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Magical Array,500.0,A,1305299400,[math],PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Doctor,1000.0,B,1305299400,"[binary search, math, sortings]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Track,1500.0,C,1305299400,"[graphs, greedy, shortest paths]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Numbers,2000.0,D,1305299400,"[dp, math, number theory]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Two Subsequences,2500.0,E,1305299400,"[bitmasks, dp]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Toy Army,500.0,A,1305299400,"[math, number theory]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Magical Array,1000.0,B,1305299400,"[combinatorics, implementation]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Biathlon,1500.0,C,1305299400,"[binary search, implementation]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Doctor,2000.0,D,1305299400,"[binary search, implementation]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Track,2500.0,E,1305299400,"[brute force, shortest paths]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Double Cola,500.0,A,1304694000,"[implementation, math]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Sets,1000.0,B,1304694000,"[constructive algorithms, hashing, implementation]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,General Mobilization,1500.0,C,1304694000,"[data structures, dfs and similar, sortings]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Two out of Three,2000.0,D,1304694000,[dp],PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Corridor,2500.0,E,1304694000,[geometry],PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Plug-in,500.0,A,1304485200,[implementation],PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Sequence Formatting,1000.0,B,1304485200,"[implementation, strings]",PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Average Score,1500.0,C,1304485200,"[math, sortings]",PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Polycarp's Picture Gallery,2000.0,D,1304485200,"[constructive algorithms, greedy]",PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Pairs,2500.0,E,1304485200,"[dfs and similar, dp, dsu, graphs, implementation, trees]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Bus Game,500.0,A,1304175600,[greedy],PROGRAMMING
+79,Codeforces Beta Round #71,12,Colorful Field,1000.0,B,1304175600,"[implementation, sortings]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Beaver,1500.0,C,1304175600,"[data structures, dp, greedy, hashing, strings, two pointers]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Password,2000.0,D,1304175600,"[bitmasks, dp, shortest paths]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Security System,2500.0,E,1304175600,[math],PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Haiku,500.0,A,1303916400,"[implementation, strings]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Easter Eggs,1000.0,B,1303916400,"[constructive algorithms, implementation]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Beaver Game,1500.0,C,1303916400,"[dp, games, number theory]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Archer's Shot,2000.0,D,1303916400,"[binary search, geometry, math, two pointers]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Evacuation,2500.0,E,1303916400,"[flows, graphs, shortest paths]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Heroes,500.0,A,1303226100,"[brute force, implementation]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Falling Anvils,1000.0,B,1303226100,"[math, probabilities]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Beavermuncher-0xFF,1500.0,C,1303226100,"[dfs and similar, dp, dsu, greedy, trees]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Domino Carpet,2000.0,D,1303226100,"[dp, implementation]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Martian Food,2000.0,E,1303226100,[geometry],PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Panoramix's Prediction,500.0,A,1303226100,[brute force],PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Depression,1000.0,B,1303226100,"[geometry, math]",PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Heroes,1500.0,C,1303226100,"[brute force, implementation]",PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Falling Anvils,2000.0,D,1303226100,"[geometry, probabilities]",PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Beavermuncher-0xFF,2500.0,E,1303226100,[],PROGRAMMING
+74,Codeforces Beta Round #68,12,Room Leader,500.0,A,1302879600,[implementation],PROGRAMMING
+74,Codeforces Beta Round #68,12,Train,1000.0,B,1302879600,"[dp, games, greedy]",PROGRAMMING
+74,Codeforces Beta Round #68,12,Chessboard Billiard,1500.0,C,1302879600,"[dfs and similar, dsu, graphs, number theory]",PROGRAMMING
+74,Codeforces Beta Round #68,12,Hanger,2000.0,D,1302879600,[data structures],PROGRAMMING
+74,Codeforces Beta Round #68,12,Shift It!,2500.0,E,1302879600,[constructive algorithms],PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Life Without Zeros,500.0,A,1302706800,[implementation],PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Facetook Priority Wall,1000.0,B,1302706800,"[expression parsing, implementation, strings]",PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Modified GCD,1500.0,C,1302706800,"[binary search, number theory]",PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Big Maximum Sum,2000.0,D,1302706800,"[data structures, dp, greedy, implementation, math, trees]",PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Ship's Shortest Path,2500.0,E,1302706800,"[geometry, shortest paths]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Gift,,A,1302609600,"[dsu, graphs, sortings, trees]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Mice,,B,1302609600,"[greedy, two pointers]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Mutation,,C,1302609600,"[bitmasks, dp, math]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Plus and xor,,D,1302609600,"[dp, greedy, math]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Points,,E,1302609600,"[implementation, math]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Tourist,,F,1302609600,"[binary search, data structures, dp]",PROGRAMMING
+73,Codeforces Beta Round #66,12,The Elder Trolls IV: Oblivon,500.0,A,1302422400,"[greedy, math]",PROGRAMMING
+73,Codeforces Beta Round #66,12,Need For Brake,1000.0,B,1302422400,"[binary search, greedy, sortings]",PROGRAMMING
+73,Codeforces Beta Round #66,12,LionAge II,1000.0,C,1302422400,[dp],PROGRAMMING
+73,Codeforces Beta Round #66,12,FreeDiv,1500.0,D,1302422400,"[dfs and similar, graphs, greedy]",PROGRAMMING
+73,Codeforces Beta Round #66,12,Morrowindows,1500.0,E,1302422400,"[math, number theory]",PROGRAMMING
+73,Codeforces Beta Round #66,12,Plane of Tanks,2000.0,F,1302422400,"[brute force, geometry]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Way Too Long Words,500.0,A,1301410800,[strings],PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Progress Bar,1000.0,B,1301410800,"[implementation, math]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Round Table Knights,1500.0,C,1301410800,"[dp, math, number theory]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Solitaire,2000.0,D,1301410800,"[brute force, implementation]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Nuclear Fusion,2500.0,E,1301410800,"[bitmasks, dp]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Cookies,500.0,A,1301155200,[math],PROGRAMMING
+70,Codeforces Beta Round #64,12,Text Messaging,1000.0,B,1301155200,"[expression parsing, greedy, strings]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Lucky Tickets,1500.0,C,1301155200,"[binary search, data structures, sortings, two pointers]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Professor's task,2000.0,D,1301155200,"[data structures, geometry]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Information Reform,2500.0,E,1301155200,"[dp, implementation, trees]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Young Physicist,500.0,A,1300809600,"[implementation, math]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Bets,1000.0,B,1300809600,"[greedy, implementation]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Game,1500.0,C,1300809600,[implementation],PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Dot,2000.0,D,1300809600,"[dp, games]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Subsegments,2500.0,E,1300809600,"[data structures, implementation]",PROGRAMMING
+72,Unknown Language Round #2,12,"Goshtasp, Vishtasp and Eidi",,A,1300637400,"[*special, greedy, math]",PROGRAMMING
+72,Unknown Language Round #2,12,INI-file,,B,1300637400,"[*special, implementation]",PROGRAMMING
+72,Unknown Language Round #2,12,Extraordinarily Nice Numbers,,C,1300637400,"[*special, math]",PROGRAMMING
+72,Unknown Language Round #2,12,Perse-script,,D,1300637400,"[*special, expression parsing]",PROGRAMMING
+72,Unknown Language Round #2,12,Ali goes shopping,,E,1300637400,"[*special, brute force, strings]",PROGRAMMING
+72,Unknown Language Round #2,12,Oil,,F,1300637400,"[*special, greedy, math]",PROGRAMMING
+72,Unknown Language Round #2,12,Fibonacci army,,G,1300637400,"[*special, dp]",PROGRAMMING
+72,Unknown Language Round #2,12,Reverse It!,,H,1300637400,"[*special, implementation]",PROGRAMMING
+72,Unknown Language Round #2,12,Goofy Numbers,,I,1300637400,"[*special, implementation]",PROGRAMMING
+68,Codeforces Beta Round #62,12,Irrational problem,500.0,A,1300464000,"[implementation, number theory]",PROGRAMMING
+68,Codeforces Beta Round #62,12,Energy exchange,1000.0,B,1300464000,[binary search],PROGRAMMING
+68,Codeforces Beta Round #62,12,Synchrophasotron,1500.0,C,1300464000,[brute force],PROGRAMMING
+68,Codeforces Beta Round #62,12,Half-decay tree,2000.0,D,1300464000,"[data structures, divide and conquer, dp, probabilities]",PROGRAMMING
+68,Codeforces Beta Round #62,12,Contact,2500.0,E,1300464000,[geometry],PROGRAMMING
+67,Manthan 2011,12,Partial Teacher,500.0,A,1300033800,"[dp, graphs, greedy, implementation]",PROGRAMMING
+67,Manthan 2011,12,Restoration of the Permutation,1000.0,B,1300033800,[greedy],PROGRAMMING
+67,Manthan 2011,12,Sequence of Balls,1500.0,C,1300033800,[dp],PROGRAMMING
+67,Manthan 2011,12,Optical Experiment,2000.0,D,1300033800,"[binary search, data structures, dp]",PROGRAMMING
+67,Manthan 2011,12,Save the City!,2500.0,E,1300033800,[geometry],PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and Java,500.0,A,1299513600,"[implementation, strings]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and Countryside,1000.0,B,1299513600,"[brute force, implementation]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and File System,1500.0,C,1299513600,"[data structures, implementation]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and His Friends,2000.0,D,1299513600,"[constructive algorithms, math, number theory]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and Post,2500.0,E,1299513600,"[data structures, dp]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and Three Spells,500.0,A,1299340800,"[implementation, math]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and the History of Magic,1000.0,B,1299340800,"[brute force, greedy, implementation]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and the Golden Snitch,1500.0,C,1299340800,"[binary search, geometry]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and the Sorting Hat,2000.0,D,1299340800,"[brute force, dfs and similar, hashing]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and Moving Staircases,2500.0,E,1299340800,"[dfs and similar, implementation]",PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Sinking Ship,500.0,A,1298908800,"[implementation, sortings, strings]",PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Settlers' Training,1000.0,B,1298908800,[implementation],PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Bulls and Cows,1500.0,C,1298908800,"[brute force, implementation]",PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Dividing Island,2000.0,D,1298908800,[constructive algorithms],PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Sweets Game,2500.0,E,1298908800,"[bitmasks, dfs and similar, dp, games, implementation]",PROGRAMMING
+62,Codeforces Beta Round #58,12,A Student's Dream,500.0,A,1298649600,"[greedy, math]",PROGRAMMING
+62,Codeforces Beta Round #58,12,Tyndex.Brome,1000.0,B,1298649600,"[binary search, implementation]",PROGRAMMING
+62,Codeforces Beta Round #58,12,Inquisition,1500.0,C,1298649600,"[geometry, implementation, sortings]",PROGRAMMING
+62,Codeforces Beta Round #58,12,Wormhouse,2000.0,D,1298649600,"[dfs and similar, graphs]",PROGRAMMING
+62,Codeforces Beta Round #58,12,World Evil,2500.0,E,1298649600,"[dp, flows]",PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Ultra-Fast Mathematician,500.0,A,1298390400,[implementation],PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Hard Work,1000.0,B,1298390400,[strings],PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Capture Valerian,1500.0,C,1298390400,[math],PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Eternal Victory,2000.0,D,1298390400,"[dfs and similar, graphs, greedy, shortest paths, trees]",PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Enemy is weak,2500.0,E,1298390400,"[data structures, trees]",PROGRAMMING
+64,Unknown Language Round #1,12,Factorial,,A,1298304000,"[*special, implementation]",PROGRAMMING
+64,Unknown Language Round #1,12,Expression,,B,1298304000,"[*special, expression parsing]",PROGRAMMING
+64,Unknown Language Round #1,12,Table,,C,1298304000,"[*special, greedy, implementation, math]",PROGRAMMING
+64,Unknown Language Round #1,12,Presents,,D,1298304000,"[*special, greedy]",PROGRAMMING
+64,Unknown Language Round #1,12,Prime Segment,,E,1298304000,"[*special, brute force]",PROGRAMMING
+64,Unknown Language Round #1,12,Domain,,F,1298304000,"[*special, expression parsing]",PROGRAMMING
+64,Unknown Language Round #1,12,Path Canonization,,G,1298304000,[*special],PROGRAMMING
+64,Unknown Language Round #1,12,Table Bowling,,H,1298304000,"[*special, sortings]",PROGRAMMING
+64,Unknown Language Round #1,12,Sort the Table,,I,1298304000,"[*special, sortings]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Where Are My Flakes?,500.0,A,1298131200,"[implementation, two pointers]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Serial Time!,1000.0,B,1298131200,"[dfs and similar, dsu]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Mushroom Strife,1500.0,C,1298131200,"[brute force, dfs and similar]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Savior,2000.0,D,1298131200,"[brute force, dsu, math]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Mushroom Gnomes,2500.0,E,1298131200,"[math, matrices]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Word,500.0,A,1297440000,"[implementation, strings]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Fortune Telling,1000.0,B,1297440000,"[implementation, number theory]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Title,1500.0,C,1297440000,[expression parsing],PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Team Arrangement,2000.0,D,1297440000,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Shortest Path,2500.0,E,1297440000,"[graphs, shortest paths]",PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Chat room,500.0,A,1296489600,"[greedy, strings]",PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Coins,1000.0,B,1296489600,[greedy],PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Trees,1500.0,C,1296489600,[brute force],PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Calendar,2000.0,D,1296489600,"[greedy, strings]",PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Expression,2500.0,E,1296489600,[dp],PROGRAMMING
+57,Codeforces Beta Round #53,12,Square Earth?,500.0,A,1295971200,"[dfs and similar, greedy, implementation]",PROGRAMMING
+57,Codeforces Beta Round #53,12,Martian Architecture,1000.0,B,1295971200,[implementation],PROGRAMMING
+57,Codeforces Beta Round #53,12,Array,1500.0,C,1295971200,"[combinatorics, math]",PROGRAMMING
+57,Codeforces Beta Round #53,12,Journey,2000.0,D,1295971200,"[dp, math]",PROGRAMMING
+57,Codeforces Beta Round #53,12,Chess,2500.0,E,1295971200,"[math, shortest paths]",PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Bar,500.0,A,1295626200,[implementation],PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Spoilt Permutation,1000.0,B,1295626200,[implementation],PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Corporation Mail,1500.0,C,1295626200,"[data structures, expression parsing, implementation]",PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Changing a String,2000.0,D,1295626200,[dp],PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Domino Principle,2500.0,E,1295626200,"[binary search, data structures, sortings]",PROGRAMMING
+55,Codeforces Beta Round #51,12,Flea travel,500.0,A,1294992000,"[implementation, math]",PROGRAMMING
+55,Codeforces Beta Round #51,12,Smallest number,1000.0,B,1294992000,[brute force],PROGRAMMING
+55,Codeforces Beta Round #51,12,Pie or die,1500.0,C,1294992000,[games],PROGRAMMING
+55,Codeforces Beta Round #51,12,Beautiful numbers,2000.0,D,1294992000,"[dp, number theory]",PROGRAMMING
+55,Codeforces Beta Round #51,12,Very simple problem,2500.0,E,1294992000,"[geometry, two pointers]",PROGRAMMING
+54,Codeforces Beta Round #50,12,Presents,500.0,A,1294733700,[implementation],PROGRAMMING
+54,Codeforces Beta Round #50,12,Cutting Jigsaw Puzzle,1000.0,B,1294733700,"[hashing, implementation]",PROGRAMMING
+54,Codeforces Beta Round #50,12,First Digit Law,1500.0,C,1294733700,"[dp, math, probabilities]",PROGRAMMING
+54,Codeforces Beta Round #50,12,Writing a Song,2000.0,D,1294733700,"[brute force, dp]",PROGRAMMING
+54,Codeforces Beta Round #50,12,Vacuum Сleaner,2500.0,E,1294733700,[geometry],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Autocomplete,500.0,A,1294329600,[implementation],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Blog Photo,1000.0,B,1294329600,"[binary search, implementation]",PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Little Frog,1500.0,C,1294329600,[constructive algorithms],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Physical Education,2000.0,D,1294329600,[sortings],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Dead Ends,2500.0,E,1294329600,"[bitmasks, dp]",PROGRAMMING
+52,Codeforces Testing Round #1,12,123-sequence,500.0,A,1294160400,[implementation],PROGRAMMING
+52,Codeforces Testing Round #1,12,Right Triangles,1000.0,B,1294160400,[combinatorics],PROGRAMMING
+52,Codeforces Testing Round #1,12,Circular RMQ,1500.0,C,1294160400,[data structures],PROGRAMMING
+51,Codeforces Beta Round #48,12,Cheaterius's Problem,500.0,A,1293552000,[implementation],PROGRAMMING
+51,Codeforces Beta Round #48,12,bHTML Tables Analisys,1000.0,B,1293552000,[expression parsing],PROGRAMMING
+51,Codeforces Beta Round #48,12,Three Base Stations,1500.0,C,1293552000,"[binary search, greedy]",PROGRAMMING
+51,Codeforces Beta Round #48,12,Geometrical problem,2000.0,D,1293552000,[implementation],PROGRAMMING
+51,Codeforces Beta Round #48,12,Pentagon,2500.0,E,1293552000,"[combinatorics, graphs, matrices]",PROGRAMMING
+51,Codeforces Beta Round #48,12,Caterpillar,3000.0,F,1293552000,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+50,Codeforces Beta Round #47,12,Domino piling,500.0,A,1292862000,"[greedy, math]",PROGRAMMING
+50,Codeforces Beta Round #47,12,Choosing Symbol Pairs,1000.0,B,1292862000,[strings],PROGRAMMING
+50,Codeforces Beta Round #47,12,Happy Farm 5,1500.0,C,1292862000,[geometry],PROGRAMMING
+50,Codeforces Beta Round #47,12,Bombing,2000.0,D,1292862000,"[binary search, dp, probabilities]",PROGRAMMING
+50,Codeforces Beta Round #47,12,Square Equation Roots,2500.0,E,1292862000,[math],PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Sleuth,500.0,A,1292601600,[implementation],PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Sum,1000.0,B,1292601600,[math],PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Disposition,1500.0,C,1292601600,"[constructive algorithms, math]",PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Game,2000.0,D,1292601600,"[brute force, dp, implementation]",PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Common ancestor,2500.0,E,1292601600,[dp],PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Rock-paper-scissors,,A,1292140800,"[implementation, schedules]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Land Lot,,B,1292140800,"[brute force, implementation]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,The Race,,C,1292140800,[math],PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Permutations,,D,1292140800,[greedy],PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Ivan the Fool VS Gorynych the Dragon,,E,1292140800,"[dp, games, graphs]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Snow sellers,,F,1292140800,"[greedy, sortings]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Galaxy Union,,G,1292140800,"[dp, trees, two pointers]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Black and White,,H,1292140800,[constructive algorithms],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Triangular numbers,500.0,A,1291737600,"[brute force, math]",PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Coins,1000.0,B,1291737600,[implementation],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Crossword,1500.0,C,1291737600,[implementation],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Safe,2000.0,D,1291737600,[brute force],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Cannon,2500.0,E,1291737600,"[data structures, geometry, sortings]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Ball Game,,A,1291536000,"[brute force, implementation]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,T-shirts from Sponsor,,B,1291536000,[implementation],PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hamsters and Tigers,,C,1291536000,[two pointers],PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Parking Lot,,D,1291536000,"[data structures, implementation]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Comb,,E,1291536000,"[data structures, dp]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hercule Poirot Problem,,F,1291536000,"[dsu, graphs]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Emperor's Problem,,G,1291536000,[geometry],PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Football,500.0,A,1291046400,[strings],PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Letter,1000.0,B,1291046400,"[implementation, strings]",PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Lucky Tickets,1500.0,C,1291046400,[greedy],PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Journey,2000.0,D,1291046400,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Race,2500.0,E,1291046400,"[brute force, implementation, two pointers]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Guilty --- to the kitchen!,500.0,A,1290096000,"[greedy, implementation]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Game of chess unfinished,1000.0,B,1290096000,[implementation],PROGRAMMING
+42,Codeforces Beta Round #41,12,Safe cracking,1500.0,C,1290096000,"[brute force, constructive algorithms]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Strange town,2000.0,D,1290096000,"[constructive algorithms, math]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Baldman and the military,2500.0,E,1290096000,"[dfs and similar, graphs]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Codecraft III,,A,1289646000,[implementation],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,School,,B,1289646000,"[dp, dsu]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Dancing Lessons,,C,1289646000,[data structures],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Event Dates,,D,1289646000,"[greedy, meet-in-the-middle, sortings]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Director,,E,1289646000,"[constructive algorithms, greedy]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Goats and Wolves,,F,1289646000,[greedy],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Prime Problem,,G,1289646000,[number theory],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Road Problem,,H,1289646000,[graphs],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,TCMCF+++,,I,1289646000,[greedy],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Planting Trees,,J,1289646000,[constructive algorithms],PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Translation,500.0,A,1289232000,"[implementation, strings]",PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Martian Dollar,1000.0,B,1289232000,[brute force],PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Email address,1500.0,C,1289232000,"[expression parsing, implementation]",PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Pawn,2000.0,D,1289232000,[dp],PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,3-cycles,2500.0,E,1289232000,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Indian Summer,,A,1289041200,[implementation],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Cola,,B,1289041200,[implementation],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Holidays,,C,1289041200,[implementation],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Hyperdrive,,D,1289041200,[math],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Anfisa the Monkey,,E,1289041200,[dp],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,BerPaint,,F,1289041200,"[geometry, graphs]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Shooting Gallery,,G,1289041200,"[data structures, implementation]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Phone Number,,H,1289041200,[dp],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Toys,,I,1289041200,"[brute force, combinatorics]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Triminoes,,J,1289041200,"[constructive algorithms, greedy]",PROGRAMMING
+40,Codeforces Beta Round #39,12,Find Color,500.0,A,1288972800,"[constructive algorithms, implementation, math]",PROGRAMMING
+40,Codeforces Beta Round #39,12,Repaintings,1000.0,B,1288972800,[math],PROGRAMMING
+40,Codeforces Beta Round #39,12,Berland Square,1500.0,C,1288972800,[math],PROGRAMMING
+40,Codeforces Beta Round #39,12,Interesting Sequence,2000.0,D,1288972800,[math],PROGRAMMING
+40,Codeforces Beta Round #39,12,Number Table,2500.0,E,1288972800,[combinatorics],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Army,,A,1288440000,[implementation],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Chess,,B,1288440000,"[brute force, implementation, math]",PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Blinds,,C,1288440000,[brute force],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Vasya the Architect,,D,1288440000,[implementation],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Let's Go Rolling!,,E,1288440000,"[dp, sortings]",PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Smart Boy,,F,1288440000,"[dp, games, strings]",PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Queue,,G,1288440000,[data structures],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,The Great Marathon,,H,1288440000,[dp],PROGRAMMING
+37,Codeforces Beta Round #37,12,Towers,500.0,A,1288018800,[sortings],PROGRAMMING
+37,Codeforces Beta Round #37,12,Computer Game,1000.0,B,1288018800,"[greedy, implementation]",PROGRAMMING
+37,Codeforces Beta Round #37,12,Old Berland Language,1500.0,C,1288018800,"[data structures, greedy, trees]",PROGRAMMING
+37,Codeforces Beta Round #37,12,Lesson Timetable,2000.0,D,1288018800,"[combinatorics, dp, math]",PROGRAMMING
+37,Codeforces Beta Round #37,12,Trial for Chief,2500.0,E,1288018800,"[graphs, greedy, shortest paths]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,C*++ Calculations,,A,1287904200,"[expression parsing, greedy]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Company Income Growth,,B,1287904200,[greedy],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Moon Craters,,C,1287904200,"[dp, sortings]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Cubical Planet,,D,1287904200,[math],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,What Has Dirichlet Got to Do with That?,,E,1287904200,"[dp, games]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Pacifist frogs,,F,1287904200,[implementation],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Inverse Function,,G,1287904200,[implementation],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Multiplication Table,,H,1287904200,[implementation],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Tram,,I,1287904200,[],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Spelling Check,,J,1287904200,"[hashing, implementation, strings]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Testing,,K,1287904200,[],PROGRAMMING
+36,Codeforces Beta Round #36,12,Extra-terrestrial Intelligence,500.0,A,1287482400,[implementation],PROGRAMMING
+36,Codeforces Beta Round #36,12,Fractal,1000.0,B,1287482400,[implementation],PROGRAMMING
+36,Codeforces Beta Round #36,12,Bowls,1500.0,C,1287482400,"[geometry, implementation]",PROGRAMMING
+36,Codeforces Beta Round #36,12,New Game with a Chess Piece,2000.0,D,1287482400,[games],PROGRAMMING
+36,Codeforces Beta Round #36,12,Two Paths,2500.0,E,1287482400,"[constructive algorithms, dsu, graphs, implementation]",PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Shell Game,500.0,A,1287471600,[implementation],PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Warehouse,1000.0,B,1287471600,[implementation],PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Fire Again,1500.0,C,1287471600,"[brute force, dfs and similar, shortest paths]",PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Animals,2000.0,D,1287471600,"[dp, greedy]",PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Parade,2500.0,E,1287471600,"[data structures, sortings]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Reconnaissance 2,500.0,A,1286802000,[implementation],PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Sale,1000.0,B,1286802000,"[greedy, sortings]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Page Numbers,1500.0,C,1286802000,"[expression parsing, implementation, sortings, strings]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Road Map,2000.0,D,1286802000,"[dfs and similar, graphs]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Collisions,2500.0,E,1286802000,"[brute force, implementation, math]",PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,What is for dinner?,500.0,A,1286463600,"[greedy, implementation]",PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,String Problem,1000.0,B,1286463600,[shortest paths],PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,Wonderful Randomized Sum,1500.0,C,1286463600,[greedy],PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,Knights,2000.0,D,1286463600,"[geometry, graphs, shortest paths, sortings]",PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,Helper,2500.0,E,1286463600,[],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Reconnaissance,500.0,A,1286002800,[brute force],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Borze,1000.0,B,1286002800,"[expression parsing, implementation]",PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Flea,1500.0,C,1286002800,[math],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Constellation,2000.0,D,1286002800,[implementation],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Hide-and-Seek,2500.0,E,1286002800,"[geometry, implementation]",PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Worms Evolution,500.0,A,1285599600,[implementation],PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Sysadmin Bob,1000.0,B,1285599600,[strings],PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Schedule,1500.0,C,1285599600,[implementation],PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Chocolate,2000.0,D,1285599600,"[dfs and similar, implementation]",PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,TV Game,2500.0,E,1285599600,[dp],PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Accounting,500.0,A,1285340400,"[brute force, math]",PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Codeforces World Finals,1000.0,B,1285340400,[implementation],PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Shooting Gallery,1500.0,C,1285340400,"[dp, probabilities]",PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,King's Problem?,2000.0,D,1285340400,"[geometry, greedy]",PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Tricky and Clever Password,2500.0,E,1285340400,"[binary search, constructive algorithms, data structures, greedy, hashing, strings]",PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Spit Problem,500.0,A,1284994800,[brute force],PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Traffic Lights,1000.0,B,1284994800,[implementation],PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Mail Stamps,1500.0,C,1284994800,"[data structures, dfs and similar, graphs, implementation]",PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Ant on the Tree,2000.0,D,1284994800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Quarrel,2500.0,E,1284994800,"[graphs, shortest paths]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,Bender Problem,500.0,A,1284735600,[implementation],PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,pSort,1000.0,B,1284735600,"[dfs and similar, dsu, graphs]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,Bath Queue,1500.0,C,1284735600,"[combinatorics, dp, probabilities]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,"Don't fear, DravDe is kind",2000.0,D,1284735600,"[binary search, data structures, dp, hashing]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,DravDe saves the world,2500.0,E,1284735600,"[geometry, math]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Next Test,500.0,A,1284130800,"[implementation, sortings]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Tournament,1000.0,B,1284130800,"[bitmasks, brute force, dfs and similar, greedy]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Unordered Subsequence,1500.0,C,1284130800,"[constructive algorithms, greedy]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Ring Road 2,2000.0,D,1284130800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Number With The Given Amount Of Divisors,2500.0,E,1284130800,"[brute force, dp, number theory]",PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Almost Prime,500.0,A,1281970800,[number theory],PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Regular Bracket Sequence,1000.0,B,1281970800,[greedy],PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Parquet,1500.0,C,1281970800,"[combinatorics, constructive algorithms]",PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Tickets,2000.0,D,1281970800,"[combinatorics, probabilities]",PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Multithreading,2500.0,E,1281970800,[constructive algorithms],PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,IQ test,,A,1280761200,[brute force],PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,Phone numbers,,B,1280761200,[implementation],PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,Roads in Berland,,C,1280761200,"[graphs, shortest paths]",PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,Roads not only in Berland,,D,1280761200,"[dsu, graphs, trees]",PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,Test,,E,1280761200,"[hashing, strings]",PROGRAMMING
+24,Codeforces Beta Round #24,12,Ring road,,A,1280149200,[graphs],PROGRAMMING
+24,Codeforces Beta Round #24,12,F1 Champions,,B,1280149200,[implementation],PROGRAMMING
+24,Codeforces Beta Round #24,12,Sequence of points,,C,1280149200,"[geometry, implementation, math]",PROGRAMMING
+24,Codeforces Beta Round #24,12,Broken robot,,D,1280149200,"[dp, probabilities]",PROGRAMMING
+24,Codeforces Beta Round #24,12,Berland collider,,E,1280149200,[binary search],PROGRAMMING
+23,Codeforces Beta Round #23,12,You're Given a String...,,A,1278687600,"[brute force, greedy]",PROGRAMMING
+23,Codeforces Beta Round #23,12,Party,,B,1278687600,"[constructive algorithms, graphs, math]",PROGRAMMING
+23,Codeforces Beta Round #23,12,Oranges and Apples,,C,1278687600,"[constructive algorithms, sortings]",PROGRAMMING
+23,Codeforces Beta Round #23,12,Tetragon,,D,1278687600,"[geometry, math]",PROGRAMMING
+23,Codeforces Beta Round #23,12,Tree,,E,1278687600,[dp],PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,Second Order Statistics,,A,1277823600,[brute force],PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,Bargaining Table,,B,1277823600,"[brute force, dp]",PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,System Administrator,,C,1277823600,[graphs],PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,Segments,,D,1277823600,"[greedy, sortings]",PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,Scheme,,E,1277823600,"[dfs and similar, graphs, trees]",PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Jabber ID,500.0,A,1277730300,[implementation],PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Intersection,1000.0,B,1277730300,"[implementation, math]",PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Stripe 2,1500.0,C,1277730300,"[binary search, dp, sortings]",PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Traveling Graph,2000.0,D,1277730300,"[bitmasks, graph matchings, graphs]",PROGRAMMING
+19,Codeforces Beta Round #19,12,World Football Cup,,A,1277391600,[implementation],PROGRAMMING
+19,Codeforces Beta Round #19,12,Checkout Assistant,,B,1277391600,[dp],PROGRAMMING
+19,Codeforces Beta Round #19,12,Deletion of Repeats,,C,1277391600,"[greedy, hashing, string suffix structures]",PROGRAMMING
+19,Codeforces Beta Round #19,12,Points,,D,1277391600,[data structures],PROGRAMMING
+19,Codeforces Beta Round #19,12,Fairy,,E,1277391600,"[dfs and similar, divide and conquer, dsu]",PROGRAMMING
+20,Codeforces Alpha Round #20 (Codeforces format),12,BerOS file system,500.0,A,1276875000,[implementation],PROGRAMMING
+20,Codeforces Alpha Round #20 (Codeforces format),12,Equation,1000.0,B,1276875000,[math],PROGRAMMING
+20,Codeforces Alpha Round #20 (Codeforces format),12,Dijkstra?,1500.0,C,1276875000,"[graphs, shortest paths]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Triangle,,A,1276700400,"[brute force, geometry]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Platforms,,B,1276700400,"[brute force, math]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Stripe,,C,1276700400,"[data structures, implementation]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Seller Bob,,D,1276700400,"[brute force, dp, greedy]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Flag 2,,E,1276700400,[dp],PROGRAMMING
+17,Codeforces Beta Round #17,12,Noldbach problem,,A,1276182000,"[brute force, math, number theory]",PROGRAMMING
+17,Codeforces Beta Round #17,12,Hierarchy,,B,1276182000,"[dfs and similar, dsu, greedy, shortest paths]",PROGRAMMING
+17,Codeforces Beta Round #17,12,Balance,,C,1276182000,[dp],PROGRAMMING
+17,Codeforces Beta Round #17,12,Notepad,,D,1276182000,[number theory],PROGRAMMING
+17,Codeforces Beta Round #17,12,Palisection,,E,1276182000,[strings],PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Flag,,A,1275570000,[implementation],PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Burglar and Matches,,B,1275570000,"[greedy, implementation, sortings]",PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Monitor,,C,1275570000,"[binary search, number theory]",PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Logging,,D,1275570000,"[implementation, strings]",PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Fish,,E,1275570000,"[bitmasks, dp, probabilities]",PROGRAMMING
+15,Codeforces Beta Round #15,12,Cottage Village,,A,1275145200,"[implementation, sortings]",PROGRAMMING
+15,Codeforces Beta Round #15,12,Laser,,B,1275145200,[math],PROGRAMMING
+15,Codeforces Beta Round #15,12,Industrial Nim,,C,1275145200,[games],PROGRAMMING
+15,Codeforces Beta Round #15,12,Map,,D,1275145200,"[data structures, implementation, sortings]",PROGRAMMING
+15,Codeforces Beta Round #15,12,Triangles,,E,1275145200,"[combinatorics, dp]",PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Letter,,A,1274283000,[implementation],PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Young Photographer,,B,1274283000,[implementation],PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Four Segments,,C,1274283000,"[brute force, constructive algorithms, geometry, implementation, math]",PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Two Paths,,D,1274283000,"[dfs and similar, dp, graphs, shortest paths, trees, two pointers]",PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Camels,,E,1274283000,[dp],PROGRAMMING
+13,Codeforces Beta Round #13,12,Numbers,,A,1273154400,"[implementation, math]",PROGRAMMING
+13,Codeforces Beta Round #13,12,Letter A,,B,1273154400,"[geometry, implementation]",PROGRAMMING
+13,Codeforces Beta Round #13,12,Sequence,,C,1273154400,"[dp, sortings]",PROGRAMMING
+13,Codeforces Beta Round #13,12,Triangles,,D,1273154400,"[dp, geometry]",PROGRAMMING
+13,Codeforces Beta Round #13,12,Holes,,E,1273154400,"[data structures, dsu]",PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Super Agent,,A,1272538800,[implementation],PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Correct Solution?,,B,1272538800,"[implementation, sortings]",PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Fruits,,C,1272538800,"[implementation, sortings]",PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Ball,,D,1272538800,"[data structures, sortings]",PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Start of the session,,E,1272538800,[constructive algorithms],PROGRAMMING
+11,Codeforces Beta Round #11,12,Increasing Sequence,,A,1272294000,"[constructive algorithms, implementation, math]",PROGRAMMING
+11,Codeforces Beta Round #11,12,Jumping Jack,,B,1272294000,[math],PROGRAMMING
+11,Codeforces Beta Round #11,12,How Many Squares?,,C,1272294000,[implementation],PROGRAMMING
+11,Codeforces Beta Round #11,12,A Simple Task,,D,1272294000,"[bitmasks, dp, graphs]",PROGRAMMING
+11,Codeforces Beta Round #11,12,"Forward, march!",,E,1272294000,"[binary search, dp, greedy]",PROGRAMMING
+10,Codeforces Beta Round #10,12,Power Consumption Calculation,,A,1271346300,[implementation],PROGRAMMING
+10,Codeforces Beta Round #10,12,Cinema Cashier,,B,1271346300,"[dp, implementation]",PROGRAMMING
+10,Codeforces Beta Round #10,12,Digital Root,,C,1271346300,[number theory],PROGRAMMING
+10,Codeforces Beta Round #10,12,LCIS,,D,1271346300,[dp],PROGRAMMING
+10,Codeforces Beta Round #10,12,Greedy Change,,E,1271346300,[constructive algorithms],PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,Die Roll,,A,1270983600,"[math, probabilities]",PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,Running Student,,B,1270983600,"[brute force, geometry, implementation]",PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,Hexadecimal's Numbers,,C,1270983600,"[brute force, implementation, math]",PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,How many trees?,,D,1270983600,"[combinatorics, divide and conquer, dp]",PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,Interestring graph and Apples,,E,1270983600,"[dfs and similar, dsu, graphs]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Train and Peter,,A,1270741500,[strings],PROGRAMMING
+8,Codeforces Beta Round #8,12,Obsession with Robots,,B,1270741500,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Looking for Order,,C,1270741500,"[bitmasks, dp]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Two Friends,,D,1270741500,"[binary search, geometry]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Beads,,E,1270741500,"[dp, graphs]",PROGRAMMING
+7,Codeforces Beta Round #7,12,Kalevitch and Chess,,A,1270136700,"[brute force, constructive algorithms]",PROGRAMMING
+7,Codeforces Beta Round #7,12,Memory Manager,,B,1270136700,[implementation],PROGRAMMING
+7,Codeforces Beta Round #7,12,Line,,C,1270136700,"[math, number theory]",PROGRAMMING
+7,Codeforces Beta Round #7,12,Palindrome Degree,,D,1270136700,"[hashing, strings]",PROGRAMMING
+7,Codeforces Beta Round #7,12,Defining Macros,,E,1270136700,"[dp, expression parsing, implementation]",PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,Triangle,,A,1269673200,"[brute force, geometry]",PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,President's Office,,B,1269673200,[implementation],PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,"Alice, Bob and Chocolate",,C,1269673200,"[greedy, two pointers]",PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,Lizards and Basements 2,,D,1269673200,"[brute force, dp]",PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,Exposition,,E,1269673200,"[binary search, data structures, dsu, trees, two pointers]",PROGRAMMING
+5,Codeforces Beta Round #5,12,Chat Servers Outgoing Traffic,,A,1269100800,[implementation],PROGRAMMING
+5,Codeforces Beta Round #5,12,Center Alignment,,B,1269100800,"[implementation, strings]",PROGRAMMING
+5,Codeforces Beta Round #5,12,Longest Regular Bracket Sequence,,C,1269100800,"[constructive algorithms, data structures, dp, greedy, sortings, strings]",PROGRAMMING
+5,Codeforces Beta Round #5,12,Follow Traffic Rules,,D,1269100800,"[implementation, math]",PROGRAMMING
+5,Codeforces Beta Round #5,12,Bindian Signalizing,,E,1269100800,[data structures],PROGRAMMING
+4,Codeforces Beta Round #4 (Div. 2 Only),2,Watermelon,,A,1268395200,"[brute force, math]",PROGRAMMING
+4,Codeforces Beta Round #4 (Div. 2 Only),2,Before an Exam,,B,1268395200,"[constructive algorithms, greedy]",PROGRAMMING
+4,Codeforces Beta Round #4 (Div. 2 Only),2,Registration System,,C,1268395200,"[data structures, hashing, implementation]",PROGRAMMING
+4,Codeforces Beta Round #4 (Div. 2 Only),2,Mysterious Present,,D,1268395200,"[dp, sortings]",PROGRAMMING
+3,Codeforces Beta Round #3,12,Shortest path of the king,,A,1267963200,"[greedy, shortest paths]",PROGRAMMING
+3,Codeforces Beta Round #3,12,Lorry,,B,1267963200,"[greedy, sortings]",PROGRAMMING
+3,Codeforces Beta Round #3,12,Tic-tac-toe,,C,1267963200,"[brute force, games, implementation]",PROGRAMMING
+3,Codeforces Beta Round #3,12,Least Cost Bracket Sequence,,D,1267963200,[greedy],PROGRAMMING
+2,Codeforces Beta Round #2,12,Winner,,A,1267117200,"[hashing, implementation]",PROGRAMMING
+2,Codeforces Beta Round #2,12,The least round way,,B,1267117200,"[dp, math]",PROGRAMMING
+2,Codeforces Beta Round #2,12,Commentator problem,,C,1267117200,[geometry],PROGRAMMING
+1,Codeforces Beta Round #1,12,Theatre Square,,A,1266580800,[math],PROGRAMMING
+1,Codeforces Beta Round #1,12,Spreadsheet,,B,1266580800,"[implementation, math]",PROGRAMMING
+1,Codeforces Beta Round #1,12,Ancient Berland Circus,,C,1266580800,"[geometry, math]",PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,Links and Pearls,500.0,A,1525791900,"[implementation, math]",PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,Marlin,1000.0,B,1525791900,[constructive algorithms],PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,Posterized,1500.0,C,1525791900,[greedy],PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,Perfect Groups,2000.0,D,1525791900,"[dp, math, number theory]",PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,The Number Games,2500.0,E,1525791900,"[data structures, greedy, trees]",PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,Cactus to Tree,3000.0,F,1525791900,"[dp, graphs, trees]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Wrong Subtraction,,A,1525615500,[implementation],PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Two-gram,,B,1525615500,"[implementation, strings]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Less or Equal,,C,1525615500,[sortings],PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,"Divide by three, multiply by two",,D,1525615500,"[dfs and similar, math, sortings]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Cyclic Components,,E,1525615500,"[dfs and similar, dsu, graphs]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Consecutive Subsequence,,F,1525615500,[dp],PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Aramic script,500.0,A,1525183500,"[implementation, strings]",PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Mancala,1000.0,B,1525183500,"[brute force, implementation]",PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Valhalla Siege,1500.0,C,1525183500,[binary search],PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Ghosts,2000.0,D,1525183500,"[geometry, math]",PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Hag's Khashba,2500.0,E,1525183500,[geometry],PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimum Binary Number,,A,1525099200,[implementation],PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Lara Croft and the New Game,,B,1525099200,"[implementation, math]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Nested Segments,,C,1525099200,"[greedy, implementation, sortings]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Degree Set,,D,1525099200,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Well played!,,E,1525099200,"[greedy, sortings]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimal k-covering,,F,1525099200,[flows],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Stairs and Elevators,500.0,A,1525007700,[binary search],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Resource Distribution,1000.0,B,1525007700,"[binary search, implementation, sortings]",PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Big Secret,1500.0,C,1525007700,[],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Aztec Catacombs,2000.0,D,1525007700,[constructive algorithms],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,May Holidays,2750.0,E,1525007700,"[data structures, trees]",PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Parametric Circulation,3250.0,F,1525007700,[],PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Stairs and Elevators,500.0,A,1525007700,"[binary search, data structures, greedy]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Resource Distribution,1000.0,B,1525007700,"[binary search, data structures, greedy, two pointers]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Big Secret,1500.0,C,1525007700,"[constructive algorithms, data structures, greedy]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Aztec Catacombs,2000.0,D,1525007700,"[constructive algorithms, graphs]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,May Holidays,2750.0,E,1525007700,[],PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Parametric Circulation,3250.0,F,1525007700,[flows],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Mind the Gap,500.0,A,1525007700,[implementation],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Watering System,1000.0,B,1525007700,[sortings],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Stairs and Elevators,1500.0,C,1525007700,[binary search],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Resource Distribution,2000.0,D,1525007700,"[binary search, sortings]",PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Big Secret,2750.0,E,1525007700,[],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Aztec Catacombs,3250.0,F,1525007700,[],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Paper Airplanes,500.0,A,1524677700,[math],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Battleship,1000.0,B,1524677700,[implementation],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Greedy Arkady,1500.0,C,1524677700,[math],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Single-use Stones,2000.0,D,1524677700,"[binary search, flows, greedy, two pointers]",PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Short Code,2500.0,E,1524677700,"[data structures, dp, greedy, strings, trees]",PROGRAMMING
+927,VK Cup 2018 - Wild-card Round 2,12,BuberPool Taxi Optimization,,A,1524152100,[],PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Alternating Sum,500.0,A,1523973900,"[math, number theory]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Destruction of a Tree,1000.0,B,1523973900,"[constructive algorithms, dfs and similar, dp, greedy, trees]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Cutting Rectangle,1500.0,C,1523973900,"[brute force, math, number theory]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Frequency of String,2000.0,D,1523973900,"[hashing, string suffix structures, strings]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Circles of Waiting,2500.0,E,1523973900,[math],PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Splits,500.0,A,1523973900,[math],PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Messages,1000.0,B,1523973900,[math],PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Alternating Sum,1500.0,C,1523973900,"[math, matrices, number theory]",PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Destruction of a Tree,2000.0,D,1523973900,"[dfs and similar, dp, trees]",PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Cutting Rectangle,2500.0,E,1523973900,[math],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (easy),,A1,1523689500,[implementation],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (medium),,A2,1523689500,"[hashing, strings]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (hard),,A3,1523689500,[],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (easy),,B1,1523689500,[implementation],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (medium),,B2,1523689500,"[data structures, greedy, trees]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (easy),,C1,1523689500,[brute force],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (medium),,C2,1523689500,[dp],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (hard),,C3,1523689500,"[data structures, dp]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (easy),,D1,1523689500,"[expression parsing, math]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (hard),,D2,1523689500,[],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (easy),,E1,1523689500,"[brute force, geometry, greedy, math]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (medium),,E2,1523689500,"[binary search, dp, greedy, sortings]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (hard),,E3,1523689500,[geometry],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (easy),,F1,1523689500,[implementation],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (medium),,F2,1523689500,"[binary search, two pointers]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (hard),,F3,1523689500,[fft],PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Equator,,A,1523370900,[implementation],PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Students in Railway Carriage,,B,1523370900,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Make a Square,,C,1523370900,"[brute force, implementation, math]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Merge Equals,,D,1523370900,"[data structures, implementation]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,"Byteland, Berland and Disputed Cities",,E,1523370900,"[constructive algorithms, greedy]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Simple Cycles Edges,,F,1523370900,"[dfs and similar, graphs, trees]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Visible Black Areas,,G,1523370900,"[data structures, dsu, geometry, trees]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Check the string,500.0,A,1523117100,[implementation],PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Minimize the error,1000.0,B,1523117100,"[data structures, greedy, sortings]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Subsequence Counting,1500.0,C,1523117100,"[bitmasks, constructive algorithms, greedy, implementation]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Full Binary Tree Queries,2000.0,D,1523117100,"[brute force, implementation, trees]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Alternating Tree,2250.0,E,1523117100,"[combinatorics, dfs and similar, divide and conquer, dp, probabilities, trees]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Pathwalks,2500.0,F,1523117100,"[data structures, dp, graphs]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Bandit Blues,3000.0,G,1523117100,"[combinatorics, dp, fft, math]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Santa's Gift,3500.0,H,1523117100,"[data structures, trees]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tetris,,A,1522850700,[implementation],PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Lecture Sleep,,B,1522850700,"[data structures, dp, implementation, two pointers]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Chessboard,,C,1522850700,"[bitmasks, brute force, implementation]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Pair Of Lines,,D,1522850700,[geometry],PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tufurama,,E,1522850700,[data structures],PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,k-substrings,,F,1522850700,"[binary search, hashing, string suffix structures]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Partitions,,G,1522850700,"[combinatorics, math, number theory]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the even-odd game,500.0,A,1522771500,"[games, math]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the message,1000.0,B,1522771500,"[dsu, implementation]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the wrong algorithm,1250.0,C,1522771500,"[constructive algorithms, trees]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and another array construction task,1750.0,D,1522771500,"[constructive algorithms, greedy, number theory]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the xor-MST,2000.0,E,1522771500,"[bitmasks, dp, graphs, implementation, math]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and yet another xor task,2500.0,F,1522771500,"[bitmasks, dp, math, matrices]",PROGRAMMING
+952,April Fools Contest 2018,12,Quirky Quantifiers,,A,1522596900,[math],PROGRAMMING
+952,April Fools Contest 2018,12,A Map of the Cat,,B,1522596900,[brute force],PROGRAMMING
+952,April Fools Contest 2018,12,Ravioli Sort,,C,1522596900,[implementation],PROGRAMMING
+952,April Fools Contest 2018,12,I'm Feeling Lucky!,,D,1522596900,[probabilities],PROGRAMMING
+952,April Fools Contest 2018,12,Cheese Board,,E,1522596900,[],PROGRAMMING
+952,April Fools Contest 2018,12,2 + 2 != 4,,F,1522596900,[],PROGRAMMING
+952,April Fools Contest 2018,12,Puzzling Language,,G,1522596900,[constructive algorithms],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Mystical Mosaic,500.0,A,1521905700,[implementation],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Three-level Laser,1000.0,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Riverside Curio,1250.0,C,1521905700,"[data structures, greedy]",PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Contact ATC,2000.0,D,1521905700,[],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Wardrobe,2250.0,E,1521905700,[],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Minimal Subset Difference,3000.0,F,1521905700,[],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Mystical Mosaic,500.0,A,1521905700,[implementation],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Three-level Laser,1000.0,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Riverside Curio,1250.0,C,1521905700,"[data structures, greedy, implementation]",PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Contact ATC,2000.0,D,1521905700,[],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Wardrobe,2250.0,E,1521905700,[dp],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Minimal Subset Difference,3000.0,F,1521905700,"[bitmasks, dp]",PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Tritonic Iridescence,500.0,A,1521905700,[implementation],PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Mystical Mosaic,1000.0,B,1521905700,[brute force],PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Three-level Laser,1500.0,C,1521905700,"[binary search, math]",PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Riverside Curio,1750.0,D,1521905700,[greedy],PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Contact ATC,2500.0,E,1521905700,[],PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Feed the cat,500.0,A,1521822900,"[greedy, math]",PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Not simply beatiful strings,1000.0,B,1521822900,[implementation],PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Sad powers,1500.0,C,1521822900,"[binary search, math, number theory]",PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Scissors,2000.0,D,1521822900,"[brute force, strings]",PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Icicles,2500.0,E,1521822900,[],PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Heaps,3000.0,F,1521822900,"[dp, trees]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Diagonal Walking,,A,1521698700,[implementation],PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,String Typing,,B,1521698700,[strings],PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Matrix Walk,,C,1521698700,[implementation],PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Fight Against Traffic,,D,1521698700,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Water Taps,,E,1521698700,"[binary search, greedy, sortings]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Runner's Problem,,F,1521698700,"[dp, matrices, sortings]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Castle Defense,,G,1521698700,"[binary search, two pointers]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Path Counting,,H,1521698700,"[combinatorics, dp]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Yet Another String Matching Problem,,I,1521698700,[fft],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,2-3-numbers,,A,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Add Points,,B,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Choose Place,,D,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Mobile Communications,,F,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Large Bouquets,,G,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,A Vital Problem,,I,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Segments,,J,1521300900,[data structures],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,2-3-numbers,,A,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Add Points,,B,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Choose Place,,D,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Mobile Communications,,F,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Large Bouquets,,G,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,A Vital Problem,,I,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Segments,,J,1521300900,[],PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Primal Sport,500.0,A,1520696100,"[math, number theory]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Producing Snow,1000.0,B,1520696100,"[binary search, data structures]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Perfect Security,1500.0,C,1520696100,"[data structures, greedy]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Picking Strings,1750.0,D,1520696100,"[constructive algorithms, implementation, strings]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Perpetual Subtraction,2250.0,E,1520696100,"[fft, math, matrices]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Public Service,3000.0,F,1520696100,[],PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Primal Sport,500.0,A,1520696100,"[brute force, math, number theory]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Producing Snow,1000.0,B,1520696100,"[binary search, data structures, implementation]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perfect Security,1500.0,C,1520696100,"[data structures, strings]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Picking Strings,1750.0,D,1520696100,"[constructive algorithms, implementation]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perpetual Subtraction,2250.0,E,1520696100,"[fft, math, matrices]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Public Service,3000.0,F,1520696100,[],PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Protect Sheep,500.0,A,1520696100,[brute force],PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Primal Sport,1000.0,B,1520696100,"[brute force, math, number theory]",PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Producing Snow,1500.0,C,1520696100,"[binary search, data structures]",PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Perfect Security,2000.0,D,1520696100,[data structures],PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Picking Strings,2250.0,E,1520696100,"[constructive algorithms, implementation]",PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Zebras,500.0,A,1520583000,[greedy],PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,A Leapfrog in the Array,1000.0,B,1520583000,[math],PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Data Center Maintenance,1250.0,C,1520583000,"[dfs and similar, graphs]",PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Curfew,1750.0,D,1520583000,"[binary search, brute force]",PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Binary Cards,2250.0,E,1520583000,[brute force],PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Astronomy,2500.0,F,1520583000,"[geometry, probabilities]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,"Left-handers, Right-handers and Ambidexters",500.0,A,1520583000,[implementation],PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Intercepted Message,1000.0,B,1520583000,[greedy],PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Zebras,1500.0,C,1520583000,"[constructive algorithms, greedy]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,A Leapfrog in the Array,2000.0,D,1520583000,"[constructive algorithms, math]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Data Center Maintenance,2250.0,E,1520583000,"[2-sat, graphs]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Curfew,2750.0,F,1520583000,[greedy],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Partition,,A,1520348700,[greedy],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Weird Subtraction Process,,B,1520348700,[number theory],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,String Transformation,,C,1520348700,[greedy],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Timetable,,D,1520348700,[dp],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Largest Beautiful Number,,E,1520348700,"[greedy, implementation]",PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Fibonacci String Subsequences,,F,1520348700,"[combinatorics, dp, matrices]",PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Almost Increasing Array,,G,1520348700,"[data structures, dp]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Peculiar apple-tree,500.0,A,1520177700,[dfs and similar],PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with String,1000.0,B,1520177700,"[implementation, probabilities, strings]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Teodor is not a liar!,1500.0,C,1520177700,"[data structures, dp]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with Tokens,2000.0,D,1520177700,"[data structures, games, implementation]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Coins Exhibition,2500.0,E,1520177700,"[data structures, dp]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Friends Meeting,500.0,A,1520177700,"[brute force, implementation, math]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,World Cup,1000.0,B,1520177700,[implementation],PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Laboratory Work,1750.0,C,1520177700,"[implementation, math]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Peculiar apple-tree,1750.0,D,1520177700,[dfs and similar],PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Game with String,2500.0,E,1520177700,"[implementation, math, probabilities]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Teodor is not a liar!,3000.0,F,1520177700,"[data structures, dp]",PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,World Cup,500.0,A,1520152800,[implementation],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Laboratory Work,1250.0,B,1520152800,[],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Peculiar apple-tree,1250.0,C,1520152800,[dfs and similar],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with String,2000.0,D,1520152800,[],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Teodor is not a liar!,2500.0,E,1520152800,"[binary search, data structures, dp]",PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with Tokens,3000.0,F,1520152800,"[data structures, games]",PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Coins Exhibition,3500.0,G,1520152800,[],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Прокат велосипедов,500.0,A,1520004900,[],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Места в самолёте,1000.0,B,1520004900,[],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Красивая команда,1750.0,C,1520004900,[combinatorics],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Пограничные врата,2500.0,D,1520004900,[],PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Save Energy!,500.0,A,1519574700,"[binary search, implementation, math]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Sleepy Game,1000.0,B,1519574700,"[dfs and similar, dp, graphs]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Lock Puzzle,1500.0,C,1519574700,"[constructive algorithms, implementation]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,World of Tank,2000.0,D,1519574700,"[dp, greedy]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Iqea,2500.0,E,1519574700,"[data structures, dfs and similar, divide and conquer, dsu, shortest paths, trees]",PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Olympiad,500.0,A,1519574700,[implementation],PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Vile Grasshoppers,1000.0,B,1519574700,[math],PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Save Energy!,1500.0,C,1519574700,[math],PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Sleepy Game,2000.0,D,1519574700,"[dfs and similar, graphs]",PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Lock Puzzle,2500.0,E,1519574700,[constructive algorithms],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Login Verification,500.0,A,1519486500,[],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Chat,1250.0,B,1519486500,[],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Dependency management,2000.0,C,1519486500,[],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Autocompletion,2250.0,D,1519486500,[],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Points on the line,500.0,A,1519464900,[brute force],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Our Tanya is Crying Out Loud,1250.0,B,1519464900,[greedy],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Phone Numbers,1250.0,C,1519464900,[constructive algorithms],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Alena And The Heater,1500.0,D,1519464900,[implementation],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Cashback,2000.0,E,1519464900,"[data structures, dp, greedy, math]",PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Machine Learning,2750.0,F,1519464900,"[brute force, data structures]",PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and his Company,500.0,A,1519058100,[brute force],PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and the Gates,750.0,B,1519058100,[implementation],PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fifa and Fafa,1250.0,C,1519058100,[geometry],PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Alphabet,1750.0,D,1519058100,"[math, probabilities]",PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Mathematics,2250.0,E,1519058100,"[dp, trees]",PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and Array,2750.0,F,1519058100,[data structures],PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Love Triangle,500.0,A,1518861900,[],PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Hamster Farm,1000.0,B,1518861900,[implementation],PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Convenient For Everybody,1500.0,C,1518861900,"[binary search, two pointers]",PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Love Rescue,2000.0,D,1518861900,"[dsu, greedy]",PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Maximize!,2500.0,E,1518861900,"[binary search, greedy, ternary search, two pointers]",PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Cutlet,2750.0,F,1518861900,"[data structures, dp]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Word Correction,,A,1518793500,[implementation],PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Run For Your Prize,,B,1518793500,"[brute force, greedy]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Constructing Tests,,C,1518793500,"[binary search, brute force]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Buy a Ticket,,D,1518793500,"[data structures, graphs, shortest paths]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Max History,,E,1518793500,"[combinatorics, math]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Erasing Substrings,,F,1518793500,"[bitmasks, dp, greedy]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Shortest Path Queries,,G,1518793500,"[bitmasks, data structures, dsu, graphs]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindromic Supersequence,500.0,A,1518705300,[constructive algorithms],PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Recursive Queries,1000.0,B,1518705300,"[data structures, dfs and similar]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Permutation Cycle,1500.0,C,1518705300,"[brute force, constructive algorithms]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Tree,2000.0,D,1518705300,"[binary search, dp, trees]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Team Work,2500.0,E,1518705300,"[combinatorics, dp]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Escape Through Leaf,2500.0,F,1518705300,"[data structures, dp, geometry]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindrome Partition,3000.0,G,1518705300,"[dp, string suffix structures, strings]",PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Twisty Movement,500.0,A,1518609900,[dp],PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Determined Cleanup,750.0,B,1518609900,[math],PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Colourful Prospect,1500.0,C,1518609900,[geometry],PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Creative Cutout,2250.0,D,1518609900,"[brute force, combinatorics, math]",PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Preponderant Reunion,2500.0,E,1518609900,"[constructive algorithms, dp]",PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Compatible Pair,500.0,A,1518609900,"[brute force, games]",PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Prosperous Lot,1000.0,B,1518609900,[implementation],PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Twisty Movement,1500.0,C,1518609900,"[brute force, dp, implementation]",PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Determined Cleanup,2000.0,D,1518609900,[math],PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Colourful Prospect,2500.0,E,1518609900,[],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Cloning Toys,500.0,A,1518023700,[implementation],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Magic Forest,1000.0,B,1518023700,[brute force],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Cave Painting,1250.0,C,1518023700,"[brute force, number theory]",PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Robot Vacuum Cleaner,1500.0,D,1518023700,"[greedy, sortings]",PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Birds,2000.0,E,1518023700,[dp],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Divisibility,2750.0,F,1518023700,"[constructive algorithms, dp, greedy, number theory]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Water The Garden,,A,1517582100,[implementation],PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tea Queue,,B,1517582100,[implementation],PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Swap Adjacent Elements,,C,1517582100,"[dfs and similar, greedy, sortings, two pointers]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tanks,,D,1517582100,"[dp, greedy, implementation]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Connected Components?,,E,1517582100,"[data structures, dfs and similar, dsu, graphs]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,SUM and REPLACE,,F,1517582100,"[brute force, data structures, number theory]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,List Of Integers,,G,1517582100,"[binary search, bitmasks, brute force, combinatorics, math, number theory]",PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-1,,01,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-2,,02,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-3,,03,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-4,,04,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-5,,05,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-6,,06,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-7,,07,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-8,,08,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-9,,09,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-10,,10,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-11,,11,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-12,,12,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-13,,13,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-14,,14,1517500800,[],PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Supermarket,500.0,A,1517403900,[greedy],PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Perfect Number,750.0,B,1517403900,"[binary search, brute force, dp, implementation, number theory]",PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Seat Arrangements,1000.0,C,1517403900,[implementation],PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Substring,1500.0,D,1517403900,"[dfs and similar, dp, graphs]",PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Congruence Equation,2000.0,E,1517403900,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,A Game With Numbers,2500.0,F,1517403900,"[games, graphs, shortest paths]",PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,The Monster,500.0,A,1517236500,[greedy],PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,MADMAX,750.0,B,1517236500,"[dp, games, graphs]",PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,Pollywog,1500.0,C,1517236500,[dp],PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,Stranger Trees,2000.0,D,1517236500,"[dp, math, matrices, trees]",PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,Upside Down,2750.0,E,1517236500,"[data structures, string suffix structures, strings, trees]",PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,Eleven,500.0,A,1517236500,[implementation],PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,Radio Station,1000.0,B,1517236500,[implementation],PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,The Monster,1500.0,C,1517236500,"[data structures, greedy]",PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,MADMAX,1750.0,D,1517236500,"[dfs and similar, dp, games]",PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,Pollywog,2500.0,E,1517236500,[],PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Perfect Squares,500.0,A,1516462500,"[implementation, math]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Conan and Agasa play a Card Game,1000.0,B,1516462500,"[games, greedy]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Travelling Salesman and Special Numbers,1500.0,C,1516462500,"[brute force, combinatorics, dp]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Bash and a Tough Math Puzzle,2000.0,D,1516462500,"[data structures, number theory]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Palindromes in a Tree,2500.0,E,1516462500,"[bitmasks, divide and conquer, trees]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Substrings in a String,3000.0,F,1516462500,"[bitmasks, brute force, string suffix structures, strings]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Sum the Fibonacci,3500.0,G,1516462500,"[bitmasks, divide and conquer]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Ember and Storm's Tree Game,3750.0,H,1516462500,"[combinatorics, dp, games, trees]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Alarm Snooze,500.0,A,1516372500,"[brute force, implementation]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Binary Sequence (changed after round),1000.0,B,1516372500,"[bitmasks, greedy]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Interesting Graph,1500.0,C,1516372500,"[constructive algorithms, graphs, shortest paths]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and To-do List,2250.0,D,1516372500,"[data structures, trees]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Tree,2500.0,E,1516372500,"[data structures, trees]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Garden,,A,1515848700,[implementation],PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Browser,,B,1515848700,[implementation],PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Permute Digits,,C,1515848700,"[dp, greedy]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Almost Acyclic Graph,,D,1515848700,"[dfs and similar, graphs]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Physical Education Lessons,,E,1515848700,"[data structures, implementation, sortings]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Imbalance Value of a Tree,,F,1515848700,"[data structures, dsu, graphs, trees]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Coprime Arrays,,G,1515848700,"[math, number theory]",PROGRAMMING
+913,Hello 2018,12,Modular Exponentiation,500.0,A,1515422700,"[implementation, math]",PROGRAMMING
+913,Hello 2018,12,Christmas Spruce,750.0,B,1515422700,"[implementation, trees]",PROGRAMMING
+913,Hello 2018,12,Party Lemonade,1000.0,C,1515422700,"[bitmasks, dp, greedy]",PROGRAMMING
+913,Hello 2018,12,Too Easy Problems,1250.0,D,1515422700,"[binary search, brute force, data structures, greedy, sortings]",PROGRAMMING
+913,Hello 2018,12,Logical Expression,1750.0,E,1515422700,"[bitmasks, dp, shortest paths]",PROGRAMMING
+913,Hello 2018,12,Strongly Connected Tournament,2250.0,F,1515422700,"[dp, graphs, probabilities]",PROGRAMMING
+913,Hello 2018,12,Power Substring,3000.0,G,1515422700,"[math, number theory]",PROGRAMMING
+913,Hello 2018,12,Don't Exceed,3500.0,H,1515422700,"[math, probabilities]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,Tricky Alchemy,500.0,A,1515162900,[implementation],PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,New Year's Eve,1000.0,B,1515162900,"[bitmasks, constructive algorithms]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,"Perun, Ult!",1750.0,C,1515162900,"[brute force, greedy, sortings]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,Fishes,2000.0,D,1515162900,"[data structures, probabilities]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,Prime Gift,2500.0,E,1515162900,"[binary search, dfs and similar, math, meet-in-the-middle, number theory, two pointers]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Counting Cards,500.0,A,1514562000,[implementation],PROGRAMMING
+908,Good Bye 2017,12,New Year and Buggy Bot,750.0,B,1514562000,"[brute force, implementation]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Curling,1000.0,C,1514562000,"[brute force, geometry, implementation, math]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Arbitrary Arrangement,1750.0,D,1514562000,"[dp, math, probabilities]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Entity Enumeration,1750.0,E,1514562000,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Rainbow Roads,2000.0,F,1514562000,"[graphs, greedy, implementation]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Original Order,2750.0,G,1514562000,"[dp, math]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Boolean Bridges,3500.0,H,1514562000,[],PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Nearest Minimums,,A,1514469900,[implementation],PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Two Cakes,,B,1514469900,"[binary search, brute force, implementation]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Three Garlands,,C,1514469900,"[brute force, constructive algorithms]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Inversion Counting,,D,1514469900,"[brute force, math]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Stack Sorting,,E,1514469900,"[data structures, implementation]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Tree Destruction,,F,1514469900,"[constructive algorithms, dfs and similar, graphs, greedy, trees]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Mass Change Queries,,G,1514469900,[data structures],PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Generate Login,500.0,A,1514392500,"[brute force, greedy, sortings]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Segments,1000.0,B,1514392500,"[constructive algorithms, math]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Python Indentation,1500.0,C,1514392500,[dp],PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Colorful Points,1750.0,D,1514392500,"[data structures, greedy, implementation]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Coprocessor,2000.0,E,1514392500,"[dfs and similar, dp, graphs, greedy]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,AND-permutations,2500.0,F,1514392500,[constructive algorithms],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Masha and Bears,500.0,A,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Tic-Tac-Toe,1000.0,B,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Shockers,1500.0,C,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Seating of Students,2250.0,D,1514037900,[constructive algorithms],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Party,2250.0,E,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Power Tower,3000.0,F,1514037900,[],PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Shockers,500.0,A,1514037900,[implementation],PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Seating of Students,1250.0,B,1514037900,"[brute force, constructive algorithms, math]",PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Party,1250.0,C,1514037900,"[bitmasks, brute force, dp, graphs]",PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Power Tower,2000.0,D,1514037900,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Reverses,2500.0,E,1514037900,"[dp, string suffix structures, strings]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Masha and Bears,500.0,A,1514037900,"[brute force, implementation]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Tic-Tac-Toe,1000.0,B,1514037900,[implementation],PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Shockers,1500.0,C,1514037900,"[bitmasks, implementation]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Seating of Students,2250.0,D,1514037900,[],PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Party,2250.0,E,1514037900,"[bitmasks, dp]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Power Tower,3000.0,F,1514037900,[],PROGRAMMING
+910,Testing Round #14 (Unrated),12,The Way to Home,500.0,A,1513940700,"[dfs and similar, dp, greedy]",PROGRAMMING
+910,Testing Round #14 (Unrated),12,Door Frames,1000.0,B,1513940700,"[greedy, implementation]",PROGRAMMING
+910,Testing Round #14 (Unrated),12,Minimum Sum,1500.0,C,1513940700,[greedy],PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Hashing Trees,500.0,A,1513697700,"[constructive algorithms, trees]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,GCD of Polynomials,1000.0,B,1513697700,"[constructive algorithms, math]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Bipartite Segments,1750.0,C,1513697700,"[binary search, data structures, dfs and similar, dsu, graphs, two pointers]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Weighting a Tree,2000.0,D,1513697700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Cyclic Cipher,2500.0,E,1513697700,[fft],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Visiting a Friend,500.0,A,1513697700,[implementation],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Coloring a Tree,1000.0,B,1513697700,"[dfs and similar, dsu]",PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Hashing Trees,1500.0,C,1513697700,[],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,GCD of Polynomials,2000.0,D,1513697700,[math],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Bipartite Segments,2750.0,E,1513697700,"[data structures, dfs and similar]",PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Splitting in Teams,500.0,A,1513492500,[greedy],PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Months and Years,1000.0,B,1513492500,[implementation],PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Dividing the numbers,1500.0,C,1513492500,"[constructive algorithms, graphs]",PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Shovel Sale,1750.0,D,1513492500,[math],PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Segments Removal,2250.0,E,1513492500,"[data structures, dsu, flows, two pointers]",PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Letters Removing,2500.0,F,1513492500,[data structures],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Rounding,500.0,A,1513424100,[implementation],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Proper Nutrition,750.0,B,1513424100,"[brute force, implementation, number theory]",PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Phone Numbers,1500.0,C,1513424100,"[implementation, strings]",PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Alarm Clock,1750.0,D,1513424100,[greedy],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Squares and not squares,2000.0,E,1513424100,[greedy],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Restoring the Expression,2500.0,F,1513424100,"[brute force, hashing, math]",PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Hungry Student Problem,,A,1513091100,[greedy],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,The Modcrab,,B,1513091100,[greedy],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Boxes Packing,,C,1513091100,[greedy],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Almost Difference,,D,1513091100,[math],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Swapping Characters,,E,1513091100,"[hashing, implementation, strings]",PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Clear The Matrix,,F,1513091100,"[bitmasks, dp]",PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Yet Another Maxflow Problem,,G,1513091100,"[data structures, flows]",PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Find Extra One,500.0,A,1513008300,[implementation],PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Position in Fraction,1000.0,B,1513008300,[math],PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Remove Extra One,1500.0,C,1513008300,"[brute force, data structures]",PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Unusual Sequences,2000.0,D,1513008300,"[bitmasks, combinatorics, dp, math, number theory]",PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Maximum Questions,2500.0,E,1513008300,"[data structures, dp, strings]",PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,Nephren gives a riddle,500.0,A,1512223500,[dfs and similar],PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,Ithea Plays With Chtholly,1000.0,B,1512223500,"[games, greedy]",PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,"Willem, Chtholly and Seniorious",1500.0,C,1512223500,[probabilities],PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,Nephren Runs a Cinema,2000.0,D,1512223500,"[chinese remainder theorem, combinatorics, math, number theory]",PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,"Welcome home, Chtholly",2500.0,E,1512223500,"[data structures, dsu]",PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Scarborough Fair,500.0,A,1512223500,[implementation],PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Chtholly's request,1000.0,B,1512223500,[brute force],PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Nephren gives a riddle,1500.0,C,1512223500,"[combinatorics, math]",PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Ithea Plays With Chtholly,2000.0,D,1512223500,[implementation],PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,"Willem, Chtholly and Seniorious",2500.0,E,1512223500,[],PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,Pizza Separation,500.0,A,1511712300,[brute force],PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,XK Segments,1000.0,B,1511712300,"[binary search, sortings, two pointers]",PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,Square Subsets,1750.0,C,1511712300,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,String Mark,2000.0,D,1511712300,"[combinatorics, math, strings]",PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,Eyes Closed,2250.0,E,1511712300,"[data structures, probabilities]",PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Chess For Three,,A,1511449500,[implementation],PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Beautiful Divisors,,B,1511449500,[brute force],PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Rumor,,C,1511449500,[dfs and similar],PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Credit Card,,D,1511449500,"[data structures, dp, greedy, implementation]",PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Counting Arrays,,E,1511449500,"[combinatorics, dp, number theory]",PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Subtree Minimum Query,,F,1511449500,"[data structures, trees]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,QAQ,500.0,A,1511099700,"[brute force, dp]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Ralph And His Magic Field,1000.0,B,1511099700,"[combinatorics, math, number theory]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Marco and GCD Sequence,1500.0,C,1511099700,"[constructive algorithms, math]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Ralph And His Tour in Binary Country,2000.0,D,1511099700,"[data structures, trees]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Ralph and Mushrooms,2500.0,E,1511099700,"[dp, graphs]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Pride,500.0,A,1510929300,"[brute force, dp, greedy, math, number theory]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Gluttony,1000.0,B,1510929300,"[constructive algorithms, greedy]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Envy,1500.0,C,1510929300,"[data structures, dsu, graphs]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Sloth,2000.0,D,1510929300,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Lust,2500.0,E,1510929300,"[combinatorics, math, matrices]",PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Greed,500.0,A,1510929300,[implementation],PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Wrath,1000.0,B,1510929300,"[implementation, two pointers]",PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Pride,1500.0,C,1510929300,[greedy],PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Gluttony,2000.0,D,1510929300,"[constructive algorithms, greedy]",PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Envy,2500.0,E,1510929300,[],PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,ACM ICPC,500.0,A,1510502700,[brute force],PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Vlad and Cafes,1000.0,B,1510502700,[],PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Petya and Catacombs,1500.0,C,1510502700,"[dsu, greedy]",PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Restoration of string,2000.0,D,1510502700,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Maximum Element,2500.0,E,1510502700,"[combinatorics, dp]",PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Symmetric Projections,3000.0,F,1510502700,[geometry],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Petya and Catacombs,500.0,A,1510502700,[greedy],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Restoration of string,1000.0,B,1510502700,"[dsu, graphs, strings]",PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Maximum Element,1500.0,C,1510502700,[dp],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Symmetric Projections,2000.0,D,1510502700,[geometry],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Mod Mod Mod,2250.0,E,1510502700,"[binary search, dp, math]",PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,ACM ICPC,500.0,A,1510502700,[],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Vlad and Cafes,1000.0,B,1510502700,[],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Petya and Catacombs,1500.0,C,1510502700,[greedy],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Restoration of string,2000.0,D,1510502700,"[graphs, greedy, strings]",PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Maximum Element,2500.0,E,1510502700,[dp],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Symmetric Projections,3000.0,F,1510502700,[],PROGRAMMING
+888,Educational Codeforces Round 32,12,Local Extrema,,A,1510239900,"[brute force, implementation]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Buggy Robot,,B,1510239900,"[dp, greedy]",PROGRAMMING
+888,Educational Codeforces Round 32,12,K-Dominant Character,,C,1510239900,"[binary search, implementation, two pointers]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Almost Identity Permutations,,D,1510239900,"[combinatorics, dp, math]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Maximum Subsequence,,E,1510239900,"[bitmasks, divide and conquer, meet-in-the-middle]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Connecting Vertices,,F,1510239900,[dp],PROGRAMMING
+888,Educational Codeforces Round 32,12,Xor-MST,,G,1510239900,"[bitmasks, constructive algorithms, data structures]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Div. 64,500.0,A,1509725100,[implementation],PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Cubes for Masha,1000.0,B,1509725100,[brute force],PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Solution for Cube,1500.0,C,1509725100,"[brute force, implementation]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Ratings and Reality Shows,2000.0,D,1509725100,"[data structures, two pointers]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Little Brother,2500.0,E,1509725100,"[binary search, geometry]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Row of Models,3000.0,F,1509725100,"[greedy, sortings]",PROGRAMMING
+884,Educational Codeforces Round 31,12,Book Reading,,A,1509113100,[implementation],PROGRAMMING
+884,Educational Codeforces Round 31,12,Japanese Crosswords Strike Back,,B,1509113100,[implementation],PROGRAMMING
+884,Educational Codeforces Round 31,12,Bertown Subway,,C,1509113100,"[dfs and similar, greedy, math]",PROGRAMMING
+884,Educational Codeforces Round 31,12,Boxes And Balls,,D,1509113100,"[data structures, greedy]",PROGRAMMING
+884,Educational Codeforces Round 31,12,Binary Matrix,,E,1509113100,[dsu],PROGRAMMING
+884,Educational Codeforces Round 31,12,Anti-Palindromize,,F,1509113100,"[flows, graphs, greedy]",PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Short Program,500.0,A,1509029100,"[bitmasks, constructive algorithms]",PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Teams Formation,1250.0,B,1509029100,[implementation],PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Tournament,1250.0,C,1509029100,"[data structures, graphs]",PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Magic Breeding,2000.0,D,1509029100,[],PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Numbers on the blackboard,2500.0,E,1509029100,"[combinatorics, dp]",PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Borya's Diagnosis,500.0,A,1509029100,[implementation],PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Table Tennis,1000.0,B,1509029100,[implementation],PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Short Program,1500.0,C,1509029100,"[bitmasks, constructive algorithms, graph matchings]",PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Teams Formation,2250.0,D,1509029100,[],PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Tournament,2250.0,E,1509029100,[],PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Alex and broken contest,500.0,A,1508773500,"[implementation, strings]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Nikita and string,1000.0,B,1508773500,"[brute force, dp]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Slava and tanks,1500.0,C,1508773500,[constructive algorithms],PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Olya and Energy Drinks,2000.0,D,1508773500,"[data structures, dfs and similar, shortest paths]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Danil and a Part-time Job,2250.0,E,1508773500,"[bitmasks, data structures, trees]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Ann and Books,2750.0,F,1508773500,"[data structures, flows, hashing]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Automatic Door,,A,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Army,,B,1508573100,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Downloading B++,,C,1508573100,[binary search],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen Strike Back,,D,1508573100,"[binary search, dp]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Field of Wonders,,E,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lost in Transliteration,,F,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Orientation of Edges,,G,1508573100,[graphs],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Palindromic Cut,,H,1508573100,"[brute force, implementation]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Photo Processing,,I,1508573100,"[binary search, dp]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Renovation,,J,1508573100,"[greedy, sortings]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Road Widening,,K,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland.Taxi,,L,1508573100,[data structures],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Quadcopter Competition,,M,1508573100,[greedy],PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Classroom Watch,500.0,A,1508151900,[brute force],PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Sorting the Coins,1000.0,B,1508151900,"[dsu, sortings, two pointers]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,National Property,1500.0,C,1508151900,"[2-sat, dfs and similar, graphs, implementation]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,High Cry,1750.0,D,1508151900,"[binary search, bitmasks, data structures, divide and conquer]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Delivery Club,2000.0,E,1508151900,"[binary search, data structures, dp]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Royal Questions,2500.0,F,1508151900,"[dsu, greedy]",PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Trip For Meal,500.0,A,1508151900,[math],PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Divisiblity of Differences,1000.0,B,1508151900,[math],PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Classroom Watch,1500.0,C,1508151900,[brute force],PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Sorting the Coins,2000.0,D,1508151900,"[dsu, sortings, trees, two pointers]",PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,National Property,2500.0,E,1508151900,"[2-sat, dfs and similar, graphs]",PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,High Cry,2750.0,F,1508151900,[data structures],PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Search for Pretty Integers,500.0,A,1508054700,"[brute force, implementation]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Maximum of Maximums of Minimums,1000.0,B,1508054700,[greedy],PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Maximum splitting,1500.0,C,1508054700,"[dp, greedy, number theory]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Something with XOR Queries,2250.0,D,1508054700,"[brute force, probabilities]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,"Points, Lines and Ready-made Titles",2500.0,E,1508054700,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Paths,3250.0,F,1508054700,"[data structures, number theory]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Maximum splitting,500.0,A,1508054700,"[dp, greedy, math, number theory]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Something with XOR Queries,1250.0,B,1508054700,"[brute force, implementation]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,"Points, Lines and Ready-made Titles",1500.0,C,1508054700,"[dfs and similar, graphs]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Paths,2250.0,D,1508054700,"[number theory, sortings]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Restore the Tree,2250.0,E,1508054700,"[graphs, greedy, trees]",PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Search for Pretty Integers,500.0,A,1508054700,[implementation],PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum of Maximums of Minimums,1000.0,B,1508054700,[implementation],PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum splitting,1500.0,C,1508054700,"[greedy, math, number theory]",PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Something with XOR Queries,2250.0,D,1508054700,"[brute force, implementation]",PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,"Points, Lines and Ready-made Titles",2500.0,E,1508054700,[],PROGRAMMING
+873,Educational Codeforces Round 30,12,Chores,,A,1507817100,[implementation],PROGRAMMING
+873,Educational Codeforces Round 30,12,Balanced Substring,,B,1507817100,"[dp, implementation]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Strange Game On Matrix,,C,1507817100,"[greedy, two pointers]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Merge Sort,,D,1507817100,"[constructive algorithms, divide and conquer]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Awards For Contestants,,E,1507817100,"[brute force, data structures, dp]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Forbidden Indices,,F,1507817100,"[dsu, string suffix structures, strings]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Artful Expedient,500.0,A,1507296900,"[brute force, implementation]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Eternal Immortality,1000.0,B,1507296900,[math],PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Intriguing Obsession,1500.0,C,1507296900,"[combinatorics, dp, math]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Overdosing Ubiquity,2250.0,D,1507296900,"[brute force, dfs and similar, graphs]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Untended Antiquity,2500.0,E,1507296900,"[data structures, hashing]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Bark to Unlock,250.0,A,1507187100,"[brute force, strings]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Race Against Time,500.0,B,1507187100,[implementation],PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Qualification Rounds,1000.0,C,1507187100,"[bitmasks, brute force, constructive algorithms, dp]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Huge Strings,1500.0,D,1507187100,"[bitmasks, brute force, dp, strings]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Policeman and a Tree,2250.0,E,1507187100,"[dp, graphs, trees]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Yet Another Minimization Problem,2500.0,F,1507187100,"[divide and conquer, dp]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,El Toll Caves,3500.0,G,1507187100,[math],PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Save the problem!,500.0,A,1506791100,[constructive algorithms],PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Ordering Pizza,1000.0,B,1506791100,"[binary search, sortings, ternary search]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Gotta Go Fast,1500.0,C,1506791100,"[binary search, dp]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Buy Low Sell High,2000.0,D,1506791100,"[constructive algorithms, data structures, greedy]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Hex Dyslexia,2500.0,E,1506791100,"[bitmasks, brute force, dp, graphs]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Egg Roulette,3000.0,F,1506791100,"[bitmasks, brute force, divide and conquer, math, meet-in-the-middle]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Flowers and Chocolate,3500.0,G,1506791100,"[combinatorics, math, matrices]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Save the problem!,500.0,A,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Ordering Pizza,1000.0,B,1506791100,"[greedy, implementation, sortings]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Gotta Go Fast,1500.0,C,1506791100,"[binary search, dp, probabilities]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Buy Low Sell High,2000.0,D,1506791100,"[data structures, greedy, two pointers]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Hex Dyslexia,2500.0,E,1506791100,[],PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Egg Roulette,3000.0,F,1506791100,[],PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Flowers and Chocolate,3500.0,G,1506791100,[math],PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Between the Offices,500.0,A,1506791100,[implementation],PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Save the problem!,1000.0,B,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Ordering Pizza,1500.0,C,1506791100,"[greedy, implementation, sortings, ternary search]",PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Gotta Go Fast,2000.0,D,1506791100,[],PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Buy Low Sell High,2500.0,E,1506791100,"[data structures, greedy]",PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Hex Dyslexia,3000.0,F,1506791100,[],PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Fair Game,500.0,A,1506335700,"[implementation, sortings]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Polycarp and Letters,1000.0,B,1506335700,"[brute force, implementation]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Bus,1500.0,C,1506335700,"[greedy, implementation]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Make a Permutation!,2000.0,D,1506335700,"[greedy, implementation]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Fire,2500.0,E,1506335700,"[dp, sortings]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Cities Excursions,3000.0,F,1506335700,[dfs and similar],PROGRAMMING
+855,"Manthan, Codefest 17",12,Tom Riddle's Diary,500.0,A,1506263700,[implementation],PROGRAMMING
+855,"Manthan, Codefest 17",12,Marvolo Gaunt's Ring,1000.0,B,1506263700,"[data structures, dp]",PROGRAMMING
+855,"Manthan, Codefest 17",12,Helga Hufflepuff's Cup,1500.0,C,1506263700,"[dp, trees]",PROGRAMMING
+855,"Manthan, Codefest 17",12,Rowena Ravenclaw's Diadem,2000.0,D,1506263700,[trees],PROGRAMMING
+855,"Manthan, Codefest 17",12,Salazar Slytherin's Locket,2500.0,E,1506263700,"[bitmasks, dp]",PROGRAMMING
+855,"Manthan, Codefest 17",12,Nagini,3000.0,F,1506263700,[data structures],PROGRAMMING
+855,"Manthan, Codefest 17",12,Harry Vs Voldemort,3500.0,G,1506263700,"[dp, graphs, trees]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Quasi-palindrome,,A,1506006300,"[brute force, implementation]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Kayaking,,B,1506006300,"[brute force, greedy, sortings]",PROGRAMMING
+863,Educational Codeforces Round 29,12,1-2-3,,C,1506006300,"[graphs, implementation]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Yet Another Array Queries Problem,,D,1506006300,"[data structures, implementation]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Turn Off The TV,,E,1506006300,"[data structures, sortings]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Almost Permutation,,F,1506006300,[flows],PROGRAMMING
+863,Educational Codeforces Round 29,12,Graphic Settings,,G,1506006300,[],PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the MEX,500.0,A,1505833500,[implementation],PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the bipartiteness,1000.0,B,1505833500,"[dfs and similar, graphs]",PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the xor,1500.0,C,1505833500,[constructive algorithms],PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the binary string,1750.0,D,1505833500,"[binary search, divide and conquer]",PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the function,2000.0,E,1505833500,"[binary search, data structures]",PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the final stage,2750.0,F,1505833500,"[data structures, strings]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Union of Doubly Linked Lists,,A,1505739900,[implementation],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Preparing for Merge Sort,,B,1505739900,[binary search],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Sum of Nestings,,C,1505739900,[],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Dog Show,,D,1505739900,"[data structures, greedy]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen,,E,1505739900,[binary search],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Elections,,F,1505739900,[greedy],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,University Classes,,G,1505739900,[implementation],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Load Testing,,H,1505739900,[],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Noise Level,,I,1505739900,[dfs and similar],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Students Initiation,,J,1505739900,"[binary search, flows]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Travel Cards,,K,1505739900,[sortings],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland SU Computer Network,,L,1505739900,"[dfs and similar, hashing, trees]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Weather Tomorrow,,M,1505739900,[implementation],PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,k-rounding,750.0,A,1505653500,"[brute force, number theory]",PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Which floor?,750.0,B,1505653500,[brute force],PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Did you mean...,1500.0,C,1505653500,"[dp, greedy, implementation]",PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Polycarp's phone book,2000.0,D,1505653500,"[data structures, sortings]",PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Tests Renumeration,2500.0,E,1505653500,[implementation],PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Wizard's Tour,3000.0,F,1505653500,"[constructive algorithms, dfs and similar]",PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Did you mean...,500.0,A,1505653500,[greedy],PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Polycarp's phone book,1000.0,B,1505653500,"[brute force, data structures, hashing, strings]",PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Tests Renumeration,1500.0,C,1505653500,[greedy],PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Wizard's Tour,2000.0,D,1505653500,"[dfs and similar, graphs, greedy]",PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Arkady and a Nobody-men,2250.0,E,1505653500,"[data structures, dfs and similar, trees]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,k-rounding,750.0,A,1505653500,"[math, number theory]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Which floor?,750.0,B,1505653500,[brute force],PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Did you mean...,1500.0,C,1505653500,"[brute force, strings]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Polycarp's phone book,2000.0,D,1505653500,"[brute force, data structures, strings]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Tests Renumeration,2500.0,E,1505653500,[],PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Wizard's Tour,3000.0,F,1505653500,[dfs and similar],PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Declined Finalists,500.0,A,1505583300,[greedy],PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Lazy Security Guard,750.0,B,1505583300,"[brute force, math]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Pie Rules,1000.0,C,1505583300,"[dp, games]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Third Month Insanity,1500.0,D,1505583300,"[dp, probabilities]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Desk Disorder,2000.0,E,1505583300,"[combinatorics, dfs and similar, dsu, graphs, trees]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Ordering T-Shirts,2750.0,F,1505583300,[greedy],PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Circle of Numbers,3000.0,G,1505583300,[math],PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Set Theory,,A,1505050500,"[brute force, constructive algorithms]",PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Similar Words,,B,1505050500,"[dp, strings]",PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Eleventh Birthday,,C,1505050500,"[combinatorics, dp, math]",PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Masha and Cactus,,D,1505050500,[],PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Satellites,,E,1505050500,[],PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,To Play or not to Play,,F,1505050500,[],PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Planning,750.0,A,1504702500,[greedy],PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Jury Meeting,750.0,B,1504702500,"[greedy, sortings, two pointers]",PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Boredom,1750.0,C,1504702500,[data structures],PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Michael and Charging Stations,1750.0,D,1504702500,"[binary search, dp]",PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Lada Malina,2500.0,E,1504702500,"[data structures, geometry]",PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Fraction,500.0,A,1504702500,"[brute force, constructive algorithms, math]",PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Maxim Buys an Apartment,1000.0,B,1504702500,[constructive algorithms],PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Planning,1750.0,C,1504702500,[],PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Jury Meeting,1750.0,D,1504702500,[greedy],PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Boredom,2500.0,E,1504702500,[data structures],PROGRAMMING
+846,Educational Codeforces Round 28,12,Curriculum Vitae,,A,1504623900,[brute force],PROGRAMMING
+846,Educational Codeforces Round 28,12,Math Show,,B,1504623900,"[brute force, greedy]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Four Segments,,C,1504623900,"[brute force, dp]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Monitor,,D,1504623900,"[binary search, data structures]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Chemistry in Berland,,E,1504623900,"[dfs and similar, greedy, trees]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Random Query,,F,1504623900,"[math, two pointers]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Five Dimensional Points,500.0,A,1504535700,"[brute force, geometry, math]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a list of numbers,1000.0,B,1504535700,[number theory],PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a game with Mojtaba,1250.0,C,1504535700,"[bitmasks, dp, games]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Tournament Construction,1750.0,D,1504535700,"[dp, graphs, greedy, math]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Random Elections,2000.0,E,1504535700,"[bitmasks, brute force, fft, math]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Rainbow Balls,2500.0,F,1504535700,[math],PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a research in Mexican wave,500.0,A,1504535700,[implementation],PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and an exam about geometry,1000.0,B,1504535700,"[geometry, math]",PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Five Dimensional Points,1500.0,C,1504535700,"[brute force, math]",PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a list of numbers,2000.0,D,1504535700,[],PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a game with Mojtaba,2500.0,E,1504535700,"[bitmasks, games]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Digits,,A,1504432800,"[brute force, implementation, math]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Neural Network country,,B,1504432800,"[dp, matrices]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Property,,C,1504432800,"[greedy, sortings]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Exploration plan,,D,1504432800,"[binary search, flows, graph matchings, shortest paths]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Casinos and travel,,E,1504432800,[dp],PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Product transformation,,F,1504432800,"[combinatorics, math, number theory]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Bathroom terminal,,G,1504432800,[implementation],PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Bob and stages,,H,1504432800,"[dp, geometry]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Dating,,I,1504432800,"[brute force, dfs and similar, graphs, trees]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,From Y to Y,500.0,A,1504272900,[constructive algorithms],PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Rooter's Song,1000.0,B,1504272900,"[constructive algorithms, data structures, geometry, implementation, sortings, two pointers]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Goodbye Souvenir,1750.0,C,1504272900,"[data structures, divide and conquer]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Shake It!,1750.0,D,1504272900,"[combinatorics, dp, flows, graphs]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Days of Floral Colours,2500.0,E,1504272900,"[combinatorics, dp, fft, math]",PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Odds and Ends,500.0,A,1504272900,[implementation],PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Tell Your World,1000.0,B,1504272900,"[brute force, geometry]",PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,From Y to Y,1500.0,C,1504272900,[constructive algorithms],PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Rooter's Song,2000.0,D,1504272900,[],PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Goodbye Souvenir,2500.0,E,1504272900,[data structures],PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Kirill And The Game,500.0,A,1504019100,"[brute force, two pointers]",PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Gleb And Pizza,1000.0,B,1504019100,[geometry],PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Ilya And The Tree,1500.0,C,1504019100,"[dfs and similar, math, trees]",PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Vitya and Strange Lesson,2000.0,D,1504019100,"[binary search, data structures]",PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Nikita and game,2500.0,E,1504019100,"[binary search, dfs and similar, divide and conquer, trees]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Sorting by Subsequences,500.0,A,1503592500,"[dfs and similar, dsu, implementation, sortings]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Interactive LowerBound,1000.0,B,1503592500,"[brute force, probabilities]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Upgrading Tree,1750.0,C,1503592500,"[constructive algorithms, dfs and similar, math]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Dynamic Shortest Path,2250.0,D,1503592500,"[graphs, shortest paths]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Maximum Flow,2250.0,E,1503592500,[flows],PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Diversity,500.0,A,1503592500,[implementation],PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Rectangles,1000.0,B,1503592500,"[combinatorics, math]",PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Sorting by Subsequences,1500.0,C,1503592500,[dfs and similar],PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Interactive LowerBound,2000.0,D,1503592500,"[brute force, probabilities]",PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Upgrading Tree,3000.0,E,1503592500,[],PROGRAMMING
+845,Educational Codeforces Round 27,12,Chess Tourney,,A,1503327900,[sortings],PROGRAMMING
+845,Educational Codeforces Round 27,12,Luba And The Ticket,,B,1503327900,"[brute force, greedy]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Two TVs,,C,1503327900,"[data structures, greedy, sortings]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Driving Test,,D,1503327900,"[data structures, dp, greedy]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Fire in the City,,E,1503327900,"[binary search, data structures]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Guards In The Storehouse,,F,1503327900,[dp],PROGRAMMING
+845,Educational Codeforces Round 27,12,Shortest Path Problem?,,G,1503327900,"[dfs and similar, math]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,Leha and Function,500.0,A,1503068700,"[combinatorics, greedy, math, number theory, sortings]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,Leha and another game about graph,1000.0,B,1503068700,"[constructive algorithms, data structures, dfs and similar, dp, graphs]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,On the Bench,1500.0,C,1503068700,"[combinatorics, dp]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,Destiny,2000.0,D,1503068700,"[data structures, probabilities]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,In a Trap,2500.0,E,1503068700,[trees],PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Generous Kefa,500.0,A,1503068700,"[brute force, implementation]",PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Godsend,1000.0,B,1503068700,"[games, math]",PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Leha and Function,1500.0,C,1503068700,[greedy],PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Leha and another game about graph,2000.0,D,1503068700,"[dfs and similar, graphs]",PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,On the Bench,2500.0,E,1503068700,[],PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Arya and Bran,500.0,A,1502548500,[implementation],PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Game of the Rows,1000.0,B,1502548500,"[brute force, greedy, implementation]",PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Journey,1500.0,C,1502548500,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Winter is here,2000.0,D,1502548500,"[combinatorics, dp, math, number theory]",PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Mother of Dragons,2500.0,E,1502548500,"[brute force, graphs, math, meet-in-the-middle]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Binary Blocks,,A,1502085900,[brute force],PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Diverging Directions,,B,1502085900,"[data structures, dfs and similar, trees]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Future Failure,,C,1502085900,"[dp, games]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Airplane Arrangements,,D,1502085900,"[math, number theory]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Convex Countour,,E,1502085900,[dp],PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Expected Earnings,,F,1502085900,[],PROGRAMMING
+837,Educational Codeforces Round 26,12,Text Volume,,A,1501773300,[implementation],PROGRAMMING
+837,Educational Codeforces Round 26,12,Flag of Berland,,B,1501773300,"[brute force, implementation]",PROGRAMMING
+837,Educational Codeforces Round 26,12,Two Seals,,C,1501773300,[brute force],PROGRAMMING
+837,Educational Codeforces Round 26,12,Round Subset,,D,1501773300,[dp],PROGRAMMING
+837,Educational Codeforces Round 26,12,Vasya's Function,,E,1501773300,"[binary search, implementation, math]",PROGRAMMING
+837,Educational Codeforces Round 26,12,Prefix Sums,,F,1501773300,"[binary search, brute force, combinatorics, math, matrices]",PROGRAMMING
+837,Educational Codeforces Round 26,12,Functions On The Segments,,G,1501773300,[data structures],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Key races,500.0,A,1501511700,[math],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,The number on the board,750.0,B,1501511700,[greedy],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Star sky,1250.0,C,1501511700,"[dp, implementation]",PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Palindromic characteristics,1500.0,D,1501511700,"[brute force, dp, hashing, strings]",PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,The penguin's game,2250.0,E,1501511700,[constructive algorithms],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Roads in the Kingdom,2250.0,F,1501511700,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,The Meaningless Game,500.0,A,1501425300,"[math, number theory]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,The Bakery,1250.0,B,1501425300,"[binary search, data structures, dp, two pointers]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,Ever-Hungry Krakozyabra,1500.0,C,1501425300,"[brute force, greedy]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,Red-Black Cobweb,2250.0,D,1501425300,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,Caramel Clouds,2500.0,E,1501425300,"[data structures, dp, sortings]",PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Useless Toy,500.0,A,1501425300,[implementation],PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Festive Evening,1000.0,B,1501425300,"[data structures, implementation]",PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Meaningless Game,1500.0,C,1501425300,[math],PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Bakery,2250.0,D,1501425300,"[data structures, divide and conquer, dp]",PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,Ever-Hungry Krakozyabra,2500.0,E,1501425300,[],PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Sasha and Sticks,500.0,A,1500906900,"[games, math]",PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Petya and Exam,1000.0,B,1500906900,[implementation],PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Strange Radiation,1750.0,C,1500906900,"[binary search, implementation, math]",PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,"Misha, Grisha and Underground",2000.0,D,1500906900,"[dfs and similar, trees]",PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Vasya and Shifts,2500.0,E,1500906900,[matrices],PROGRAMMING
+825,Educational Codeforces Round 25,12,Binary Protocol,,A,1500217500,[implementation],PROGRAMMING
+825,Educational Codeforces Round 25,12,Five-In-a-Row,,B,1500217500,"[brute force, implementation]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Multi-judge Solving,,C,1500217500,"[greedy, implementation]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Suitable Replacement,,D,1500217500,"[greedy, implementation]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Minimal Labels,,E,1500217500,"[data structures, graphs, greedy]",PROGRAMMING
+825,Educational Codeforces Round 25,12,String Compression,,F,1500217500,"[dp, hashing, string suffix structures, strings]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Tree Queries,,G,1500217500,"[dfs and similar, graphs, trees]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Office Keys,500.0,A,1499958300,"[binary search, brute force, dp, greedy, sortings]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Cards Sorting,1000.0,B,1499958300,"[data structures, implementation, sortings]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Bamboo Partition,1500.0,C,1499958300,"[brute force, math, number theory, sortings, two pointers]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Singer House,2250.0,D,1499958300,"[combinatorics, dp, trees]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Perpetual Motion Machine,2250.0,E,1499958300,"[constructive algorithms, implementation, math, trees]",PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Unimodal Array,500.0,A,1499958300,[implementation],PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Keyboard Layouts,750.0,B,1499958300,"[implementation, strings]",PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Jury Marks,1000.0,C,1499958300,[brute force],PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Office Keys,1500.0,D,1499958300,"[binary search, brute force, dp, greedy]",PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Cards Sorting,2000.0,E,1499958300,[data structures],PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Bamboo Partition,2500.0,F,1499958300,[],PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,String Reconstruction,500.0,A,1499791500,"[data structures, greedy]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,High Load,750.0,B,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,DNA Evolution,1500.0,C,1499791500,[data structures],PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Best Edge Weight,1750.0,D,1499791500,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Rusty String,1750.0,E,1499791500,"[fft, math]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Dirty Arkady's Kitchen,2500.0,F,1499791500,"[dp, shortest paths]",PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Restaurant Tables,500.0,A,1499791500,[implementation],PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Black Square,750.0,B,1499791500,[implementation],PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,String Reconstruction,1250.0,C,1499791500,"[data structures, sortings]",PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,High Load,1750.0,D,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,DNA Evolution,2000.0,E,1499791500,[data structures],PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Best Edge Weight,2750.0,F,1499791500,[data structures],PROGRAMMING
+823,VK Cup 2017 - Finals,12,High Load,500.0,A,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,DNA Evolution,1000.0,B,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Bamboo Partition,1500.0,C,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Rusty String,2000.0,D,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Singer House,2750.0,E,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Perpetual Motion Machine,2750.0,F,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Dirty Arkady's Kitchen,3500.0,G,1499587500,[],PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,I'm bored with life,500.0,A,1499011500,"[implementation, math, number theory]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,Crossword solving,750.0,B,1499011500,"[brute force, implementation, strings]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,"Hacker, pack your bags!",1250.0,C,1499011500,"[binary search, greedy, sortings]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,My pretty girl Noora,1750.0,D,1499011500,"[brute force, dp, greedy, math, number theory]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,Liar,2250.0,E,1499011500,"[binary search, dp, hashing, string suffix structures]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,Madness,2500.0,F,1499011500,"[dfs and similar, trees]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Diplomas and Certificates,,A,1498748700,"[implementation, math]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Permutation Game,,B,1498748700,[implementation],PROGRAMMING
+818,Educational Codeforces Round 24,12,Sofa Thief,,C,1498748700,"[brute force, implementation]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Multicolored Cars,,D,1498748700,"[data structures, implementation]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Card Game Again,,E,1498748700,"[binary search, data structures, number theory, two pointers]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Level Generation,,F,1498748700,"[binary search, math, ternary search]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Four Melodies,,G,1498748700,[flows],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Boring Game,500.0,A,1498574100,[],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and PR Shifts,1000.0,B,1498574100,"[data structures, implementation]",PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Beacons on Field,1500.0,C,1498574100,[number theory],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Astronomers,2000.0,D,1498574100,[number theory],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Flight to the Moon,2500.0,E,1498574100,"[constructive algorithms, graphs]",PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Book Reading,500.0,A,1498574100,[implementation],PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Angle in Polygon,1000.0,B,1498574100,"[constructive algorithms, geometry]",PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Boring Game,1500.0,C,1498574100,[],PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and PR Shifts,2000.0,D,1498574100,[],PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Beacons on Field,2500.0,E,1498574100,[],PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and Future Gadget Laboratory,500.0,A,1498401300,[implementation],PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and Banana Trees,1000.0,B,1498401300,"[brute force, math]",PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and Boxes,1500.0,C,1498401300,"[data structures, trees]",PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and City,2000.0,D,1498401300,"[graphs, shortest paths]",PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and El Psy Kongroo,2500.0,E,1498401300,"[dp, matrices]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Game,500.0,A,1497710100,"[brute force, greedy, implementation]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Test,1250.0,B,1497710100,"[brute force, constructive algorithms, math]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Supermarket,1500.0,C,1497710100,"[brute force, dp, trees]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Cards,2250.0,D,1497710100,"[binary search, combinatorics, data structures, geometry]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Neighborhood,2250.0,E,1497710100,"[binary search, constructive algorithms]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Morning,500.0,A,1497710100,"[brute force, implementation]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Coffee,1000.0,B,1497710100,"[binary search, data structures]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Game,1500.0,C,1497710100,"[brute force, greedy]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Test,2000.0,D,1497710100,[combinatorics],PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Supermarket,2750.0,E,1497710100,"[dp, trees]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Treasure Hunt,,A,1497539100,"[implementation, number theory]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Makes And The Product,,B,1497539100,"[combinatorics, sortings]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Really Big Numbers,,C,1497539100,"[binary search, brute force, dp, math]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Imbalanced Array,,D,1497539100,"[data structures, divide and conquer, dsu, sortings]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Choosing The Commander,,E,1497539100,"[bitmasks, data structures, trees]",PROGRAMMING
+817,Educational Codeforces Round 23,12,MEX Queries,,F,1497539100,"[binary search, data structures, trees]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An abandoned sentiment from past,500.0,A,1496837700,"[implementation, sortings]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An express train to reveries,1000.0,B,1496837700,[constructive algorithms],PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An impassioned circulation of affection,1750.0,C,1496837700,"[brute force, dp, strings, two pointers]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An overnight dance in discotheque,1750.0,D,1496837700,"[dfs and similar, dp, geometry, greedy, trees]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An unavoidable detour for home,2500.0,E,1496837700,"[combinatorics, dp]",PROGRAMMING
+813,Educational Codeforces Round 22,12,The Contest,,A,1496675100,[implementation],PROGRAMMING
+813,Educational Codeforces Round 22,12,The Golden Age,,B,1496675100,"[brute force, math]",PROGRAMMING
+813,Educational Codeforces Round 22,12,The Tag Game,,C,1496675100,[dfs and similar],PROGRAMMING
+813,Educational Codeforces Round 22,12,Two Melodies,,D,1496675100,"[dp, flows]",PROGRAMMING
+813,Educational Codeforces Round 22,12,Army Creation,,E,1496675100,"[binary search, data structures]",PROGRAMMING
+813,Educational Codeforces Round 22,12,Bipartite Checking,,F,1496675100,"[data structures, dsu, graphs]",PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Crossroads,500.0,A,1496326500,[implementation],PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,"Sagheer, the Hausmeister",1000.0,B,1496326500,"[bitmasks, brute force, dp]",PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Nubian Market,1500.0,C,1496326500,[binary search],PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Kindergarten,2000.0,D,1496326500,"[dfs and similar, graphs, implementation]",PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Apple Tree,2500.0,E,1496326500,[games],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (easy),,A,1495958700,[greedy],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (medium),,B,1495958700,"[data structures, greedy]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (hard),,C,1495958700,[flows],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (easy),,D,1495958700,[math],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (medium),,E,1495958700,[math],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (hard),,F,1495958700,[math],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (easy),,G,1495958700,[implementation],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (medium),,H,1495958700,[constructive algorithms],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (hard),,I,1495958700,[string suffix structures],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (easy),,J,1495958700,"[dfs and similar, trees]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (medium),,K,1495958700,"[dp, trees]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (hard),,L,1495958700,"[dfs and similar, dp, math, trees]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (easy),,M,1495958700,"[greedy, sortings]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (medium),,N,1495958700,"[binary search, flows]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (hard),,O,1495958700,"[binary search, flows]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Courtesy,500.0,A,1495877700,"[brute force, implementation]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Complicated Book,1000.0,B,1495877700,"[implementation, sortings]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Memorable Trip,1500.0,C,1495877700,"[dp, implementation]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Favorite Game,2000.0,D,1495877700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Entertaining Flags,2500.0,E,1495877700,"[data structures, dsu, graphs]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Do you want a date?,500.0,A,1495303500,"[math, sortings]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Glad to see you!,1000.0,B,1495303500,[binary search],PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Find a car,1500.0,C,1495303500,"[combinatorics, divide and conquer, dp]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Hitchhiking in the Baltic States,2000.0,D,1495303500,"[data structures, dp]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Surprise me!,2500.0,E,1495303500,"[divide and conquer, math, trees]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Straight <>,500.0,A,1495303500,"[implementation, math]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Summer sell-off,1000.0,B,1495303500,"[greedy, sortings]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Do you want a date?,1500.0,C,1495303500,"[math, sortings]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Glad to see you!,2000.0,D,1495303500,[binary search],PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Find a car,2500.0,E,1495303500,"[divide and conquer, dp]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Lucky Year,,A,1494860700,[implementation],PROGRAMMING
+808,Educational Codeforces Round 21,12,Average Sleep Time,,B,1494860700,"[data structures, math]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Tea Party,,C,1494860700,"[constructive algorithms, greedy]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Array Division,,D,1494860700,"[binary search, data structures, implementation]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Selling Souvenirs,,E,1494860700,"[dp, greedy, ternary search]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Card Game,,F,1494860700,"[binary search, flows, graphs]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Anthem of Berland,,G,1494860700,"[dp, strings]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Bank Robbery,500.0,A,1494668100,[implementation],PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Cutting Carrot,1000.0,B,1494668100,"[geometry, math]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Naming Company,1750.0,C,1494668100,"[games, greedy, sortings]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Labelling Cities,2000.0,D,1494668100,"[dfs and similar, graphs, hashing]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Choosing Carrot,2500.0,E,1494668100,[games],PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Leha and security system,2750.0,F,1494668100,[data structures],PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Replace All,3500.0,G,1494668100,"[combinatorics, dp, math]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Carrot Cakes,500.0,A,1494516900,"[brute force, implementation]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,T-shirt buying,1000.0,B,1494516900,"[data structures, implementation]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Fountains,1500.0,C,1494516900,"[binary search, data structures]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Field expansion,2000.0,D,1494516900,"[brute force, dp, meet-in-the-middle]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Aquarium decoration,2500.0,E,1494516900,"[data structures, greedy, two pointers]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Beautiful fountains rows,3250.0,F,1494516900,[data structures],PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Cut the pie,3500.0,G,1494516900,"[binary search, data structures, geometry]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Success Rate,500.0,A,1494171900,"[binary search, math]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Dynamic Problem Scoring,1000.0,B,1494171900,"[brute force, greedy]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Prairie Partition,1750.0,C,1494171900,"[binary search, constructive algorithms, greedy, math]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Perishable Roads,2500.0,D,1494171900,"[dp, graphs, shortest paths]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Blog Post Rating,2750.0,E,1494171900,"[data structures, sortings]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Test Data Generation,3500.0,F,1494171900,"[combinatorics, divide and conquer, dp, fft, math, number theory]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Success Rate,500.0,A,1494171900,"[binary search, math]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Dynamic Problem Scoring,1000.0,B,1494171900,"[brute force, greedy]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Prairie Partition,1750.0,C,1494171900,"[binary search, greedy]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Perishable Roads,2500.0,D,1494171900,[graphs],PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Blog Post Rating,2750.0,E,1494171900,[data structures],PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Test Data Generation,3500.0,F,1494171900,[],PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Is it rated?,500.0,A,1494171900,"[implementation, sortings]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,T-Shirt Hunt,1000.0,B,1494171900,"[brute force, implementation]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Success Rate,1500.0,C,1494171900,"[binary search, math]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Dynamic Problem Scoring,2000.0,D,1494171900,"[brute force, greedy]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Prairie Partition,2750.0,E,1494171900,"[binary search, greedy]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Perishable Roads,3500.0,F,1494171900,[],PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Find Amir,500.0,A,1493909400,"[greedy, math]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Minimum number of steps,1000.0,B,1493909400,"[greedy, implementation, math]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Ice cream coloring,1500.0,C,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Expected diameter of a tree,2000.0,D,1493909400,"[binary search, brute force, dfs and similar, dp, sortings, trees]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,The same permutation ,2500.0,E,1493909400,[constructive algorithms],PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Fake bullions,3000.0,F,1493909400,"[dfs and similar, dp, graphs]",PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Fake NP,500.0,A,1493909400,[math],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,3-palindrome,1000.0,B,1493909400,[constructive algorithms],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Find Amir,1500.0,C,1493909400,[constructive algorithms],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Minimum number of steps,2000.0,D,1493909400,[],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Ice cream coloring,2500.0,E,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Expected diameter of a tree,3000.0,F,1493909400,"[graphs, probabilities]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Maximal Binary Matrix,,A,1493391900,[constructive algorithms],PROGRAMMING
+803,Educational Codeforces Round 20,12,Distances to Zero,,B,1493391900,[constructive algorithms],PROGRAMMING
+803,Educational Codeforces Round 20,12,Maximal GCD,,C,1493391900,"[greedy, math]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Magazine Ad,,D,1493391900,"[binary search, greedy]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Roma and Poker,,E,1493391900,[dp],PROGRAMMING
+803,Educational Codeforces Round 20,12,Coprime Subsequences,,F,1493391900,"[bitmasks, combinatorics, number theory]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Periodic RMQ Problem,,G,1493391900,[data structures],PROGRAMMING
+775,VK Cup 2017 - Wild Card Round 2,12,University Schedule,,A,1493220900,[*special],PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Oleg and shares,500.0,A,1492965900,"[implementation, math]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Igor and his way to work,1000.0,B,1492965900,"[dfs and similar, shortest paths]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Mice problem,1500.0,C,1492965900,"[geometry, implementation, sortings]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Presents in Bankopolis,2000.0,D,1492965900,"[dp, graphs, shortest paths]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Problem of offices,2500.0,E,1492965900,"[constructive algorithms, dfs and similar, dp, trees]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Julia the snail,3000.0,F,1492965900,"[data structures, divide and conquer]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Oleg and chess,3500.0,G,1492965900,"[flows, graph matchings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and palindrome,500.0,A,1492785300,"[brute force, constructive algorithms, strings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and strings,1000.0,B,1492785300,"[brute force, dp, strings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and gcd problem,1500.0,C,1492785300,"[dp, greedy, number theory]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and distribution,2000.0,D,1492785300,"[constructive algorithms, sortings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and code of a permutation,2500.0,E,1492785300,"[constructive algorithms, data structures, graphs, sortings]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Voltage Keepsake,500.0,A,1492356900,"[binary search, math]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Volatile Kite,1000.0,B,1492356900,[geometry],PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Vulnerable Kerbals,1750.0,C,1492356900,"[dp, graphs, number theory]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Varying Kibibits,2250.0,D,1492356900,"[bitmasks, dp]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Verifying Kingdom,2250.0,E,1492356900,"[binary search, trees]",PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Voltage Keepsake,500.0,A,1492356900,"[binary search, greedy]",PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Volatile Kite,1000.0,B,1492356900,[geometry],PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Vulnerable Kerbals,1750.0,C,1492356900,[number theory],PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Varying Kibibits,2250.0,D,1492356900,"[combinatorics, dp]",PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Verifying Kingdom,2250.0,E,1492356900,[],PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vicious Keyboard,500.0,A,1492356900,[brute force],PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Valued Keys,1000.0,B,1492356900,"[constructive algorithms, greedy, strings]",PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Voltage Keepsake,1500.0,C,1492356900,"[binary search, math]",PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Volatile Kite,2000.0,D,1492356900,"[brute force, geometry, greedy]",PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vulnerable Kerbals,2750.0,E,1492356900,[],PROGRAMMING
+797,Educational Codeforces Round 19,12,k-Factorization,,A,1492266900,"[implementation, math, number theory]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Odd sum,,B,1492266900,"[dp, greedy]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Minimal string,,C,1492266900,"[greedy, strings]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Broken BST,,D,1492266900,"[data structures, dfs and similar]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Array Queries,,E,1492266900,"[brute force, data structures, dp]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Mice and Holes,,F,1492266900,"[data structures, dp, greedy, sortings]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Buying A House,500.0,A,1491842100,"[brute force, implementation]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Find The Bone,750.0,B,1491842100,[implementation],PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Bank Hacking,1000.0,C,1491842100,"[constructive algorithms, data structures, dp, trees]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Police Stations,1500.0,D,1491842100,"[constructive algorithms, shortest paths, trees]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Exam Cheating,2000.0,E,1491842100,"[binary search, dp]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Sequence Recovery,2500.0,F,1491842100,"[bitmasks, data structures, greedy]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Amusement Park,,A,1491406500,"[*special, ternary search]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Significant Cups,,B,1491406500,"[*special, binary search, data structures, two pointers]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Lie or Truth,,D,1491406500,"[*special, constructive algorithms, sortings]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Big Number and Remainder,,E,1491406500,"[*special, math, number theory]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Pens And Days Of Week,,F,1491406500,"[*special, binary search, number theory]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Amusement Park,,A,1491406500,"[*special, brute force, ternary search]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Significant Cups,,B,1491406500,"[*special, binary search, sortings, two pointers]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Lie or Truth,,D,1491406500,"[*special, implementation, sortings]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Big Number and Remainder,,E,1491406500,"[*special, brute force, number theory]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Pens And Days Of Week,,F,1491406500,"[*special, brute force, number theory]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING
+784,April Fools Contest 2017,12,Numbers Joke,,A,1490972400,[*special],PROGRAMMING
+784,April Fools Contest 2017,12,Kids' Riddle,,B,1490972400,[*special],PROGRAMMING
+784,April Fools Contest 2017,12,INTERCALC,,C,1490972400,"[*special, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,Touchy-Feely Palindromes,,D,1490972400,"[*special, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,Twisted Circuit,,E,1490972400,"[*special, brute force, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,Crunching Numbers Just for You,,F,1490972400,"[*special, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,BF Calculator,,G,1490972400,[*special],PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,Functions again,500.0,A,1490803500,"[dp, two pointers]",PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,Weird journey,1250.0,B,1490803500,"[combinatorics, dfs and similar, dsu, graphs]",PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,The Great Mixing,1500.0,C,1490803500,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,Finding lines,2000.0,D,1490803500,"[constructive algorithms, divide and conquer]",PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,New task,2250.0,E,1490803500,[data structures],PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,Anastasia and pebbles,500.0,A,1490803500,"[implementation, math]",PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,Masha and geometric depression,1000.0,B,1490803500,"[brute force, implementation, math]",PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,Functions again,1500.0,C,1490803500,"[data structures, dp]",PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,Weird journey,2250.0,D,1490803500,[graphs],PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,The Great Mixing,2500.0,E,1490803500,"[brute force, dfs and similar, dp, graph matchings, math]",PROGRAMMING
+792,Educational Codeforces Round 18,12,New Bus Route,,A,1490625300,"[implementation, sortings]",PROGRAMMING
+792,Educational Codeforces Round 18,12,Counting-out Rhyme,,B,1490625300,[implementation],PROGRAMMING
+792,Educational Codeforces Round 18,12,Divide by Three,,C,1490625300,"[dp, greedy, math, number theory]",PROGRAMMING
+792,Educational Codeforces Round 18,12,Paths in a Complete Binary Tree,,D,1490625300,"[bitmasks, trees]",PROGRAMMING
+792,Educational Codeforces Round 18,12,Colored Balls,,E,1490625300,"[greedy, math]",PROGRAMMING
+792,Educational Codeforces Round 18,12,Mages and Monsters,,F,1490625300,"[data structures, geometry]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,Berzerk,750.0,A,1490281500,"[dfs and similar, dp, games]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,Legacy,1000.0,B,1490281500,"[data structures, graphs, shortest paths]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,Till I Collapse,1500.0,C,1490281500,"[data structures, divide and conquer]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,Rap God,2000.0,D,1490281500,"[data structures, dfs and similar, hashing, strings, trees]",PROGRAMMING
+786,Codeforces Round #406 (Div. 1),1,ALT,2500.0,E,1490281500,"[data structures, flows, graphs, trees]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,The Monster,500.0,A,1490281500,"[brute force, math]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,Not Afraid,1000.0,B,1490281500,"[greedy, implementation]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,Berzerk,1750.0,C,1490281500,"[dp, games]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,Legacy,2000.0,D,1490281500,"[data structures, shortest paths]",PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,Till I Collapse,2500.0,E,1490281500,"[data structures, trees]",PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Friendship Condition,250.0,A,1489851300,"[dfs and similar, dsu, graphs]",PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Different Names,500.0,B,1489851300,"[constructive algorithms, greedy]",PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Tree Jumps,1000.0,C,1489851300,"[dfs and similar, dp, trees]",PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Company,1500.0,D,1489851300,[dp],PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Rectangle Strips,2250.0,E,1489851300,"[dp, greedy]",PROGRAMMING
+771,VK Cup 2017 - Round 1,12,Bear and Isomorphic Points,2500.0,F,1489851300,"[geometry, two pointers]",PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Different Names,500.0,A,1489851300,"[constructive algorithms, greedy]",PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Tree Jumps,1000.0,B,1489851300,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Company,1500.0,C,1489851300,[dp],PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Rectangle Strips,2250.0,D,1489851300,[dp],PROGRAMMING
+790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Isomorphic Points,2500.0,E,1489851300,[],PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Big Brother,500.0,A,1489851300,[implementation],PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Friendship Condition,1000.0,B,1489851300,"[dfs and similar, dsu, graphs]",PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Different Names,1500.0,C,1489851300,"[constructive algorithms, greedy]",PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Tree Jumps,2000.0,D,1489851300,"[dfs and similar, dp, trees]",PROGRAMMING
+791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Company,2500.0,E,1489851300,[],PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and Polyhedrons,500.0,A,1489590300,[implementation],PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and Classes,1000.0,B,1489590300,"[greedy, sortings]",PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and Fairy Tale,1500.0,C,1489590300,"[binary search, math]",PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and School - 2,2250.0,D,1489590300,"[combinatorics, math, number theory]",PROGRAMMING
+785,Codeforces Round #404 (Div. 2),2,Anton and Permutation,2500.0,E,1489590300,"[brute force, data structures]",PROGRAMMING
+770,VK Cup 2017 - Qualification 2,12,New Password,500.0,A,1489233600,[implementation],PROGRAMMING
+770,VK Cup 2017 - Qualification 2,12,Maximize Sum of Digits,1000.0,B,1489233600,[implementation],PROGRAMMING
+770,VK Cup 2017 - Qualification 2,12,Online Courses In BSU,1500.0,C,1489233600,"[dfs and similar, graphs]",PROGRAMMING
+770,VK Cup 2017 - Qualification 2,12,Draw Brackets!,1500.0,D,1489233600,[implementation],PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Andryusha and Colored Balloons,500.0,A,1488719100,"[brute force, constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Innokenty and a Football League,1000.0,B,1488719100,"[2-sat, brute force, graph matchings, greedy, implementation]",PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Underground Lab,1250.0,C,1488719100,"[brute force, constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Axel and Marston in Bitland,1750.0,D,1488719100,"[bitmasks, brute force, dp, matrices]",PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Andryusha and Nervous Barriers,2250.0,E,1488719100,[data structures],PROGRAMMING
+781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Intranet of Buses,2750.0,F,1488719100,"[binary search, geometry, two pointers]",PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Andryusha and Socks,500.0,A,1488719100,[implementation],PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,The Meeting Place Cannot Be Changed,1000.0,B,1488719100,"[binary search, ternary search]",PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Andryusha and Colored Balloons,1250.0,C,1488719100,[dfs and similar],PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Innokenty and a Football League,1500.0,D,1488719100,[greedy],PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Underground Lab,1750.0,E,1488719100,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING
+782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Axel and Marston in Bitland,2500.0,F,1488719100,[matrices],PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Socks,500.0,A,1488705300,[implementation],PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,The Meeting Place Cannot Be Changed,1000.0,B,1488705300,[binary search],PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Colored Balloons,1250.0,C,1488705300,[dfs and similar],PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Innokenty and a Football League,1500.0,D,1488705300,"[2-sat, graphs, greedy, implementation]",PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Underground Lab,1750.0,E,1488705300,"[dfs and similar, graphs]",PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Axel and Marston in Bitland,2500.0,F,1488705300,"[bitmasks, graphs, matrices]",PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Nervous Barriers,3000.0,G,1488705300,"[data structures, dp]",PROGRAMMING
+780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Intranet of Buses,3500.0,H,1488705300,"[binary search, geometry, implementation, two pointers]",PROGRAMMING
+769,VK Cup 2017 - Qualification 1,12,Year of University Entrance,500.0,A,1488628800,[sortings],PROGRAMMING
+769,VK Cup 2017 - Qualification 1,12,News About Credit,1000.0,B,1488628800,"[greedy, two pointers]",PROGRAMMING
+769,VK Cup 2017 - Qualification 1,12,Cycle In Maze,1500.0,C,1488628800,"[dfs and similar, greedy, shortest paths]",PROGRAMMING
+769,VK Cup 2017 - Qualification 1,12,k-Interesting Pairs Of Integers,2000.0,D,1488628800,"[bitmasks, brute force]",PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,String Game,500.0,A,1488096300,"[binary search, greedy, strings]",PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,Bitwise Formula,1000.0,B,1488096300,"[bitmasks, brute force, dfs and similar, expression parsing, implementation]",PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,Peterson Polyglot,1500.0,C,1488096300,"[brute force, dfs and similar, dsu, hashing, trees]",PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,Parquet Re-laying,2250.0,D,1488096300,[constructive algorithms],PROGRAMMING
+778,Codeforces Round #402 (Div. 1),1,Selling Numbers,2250.0,E,1488096300,"[dp, sortings]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Pupils Redistribution,500.0,A,1488096300,"[constructive algorithms, math]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Weird Rounding,1000.0,B,1488096300,"[brute force, greedy]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Dishonest Sellers,1000.0,C,1488096300,"[greedy, sortings]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,String Game,1500.0,D,1488096300,"[binary search, strings]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Bitwise Formula,2000.0,E,1488096300,"[data structures, expression parsing, greedy]",PROGRAMMING
+779,Codeforces Round #402 (Div. 2),2,Peterson Polyglot,2500.0,F,1488096300,[],PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Shell Game,500.0,A,1487930700,"[constructive algorithms, implementation]",PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Game of Credit Cards,1000.0,B,1487930700,"[data structures, dp, greedy, sortings]",PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Alyona and Spreadsheet,1500.0,C,1487930700,"[binary search, dp, implementation, two pointers]",PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Cloud of Hashtags,2000.0,D,1487930700,"[binary search, greedy, implementation, strings]",PROGRAMMING
+777,Codeforces Round #401 (Div. 2),2,Hanoi Factory,2500.0,E,1487930700,"[brute force, data structures, dp, greedy, sortings]",PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,A Serial Killer,500.0,A,1487861100,[implementation],PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock and his girlfriend,1000.0,B,1487861100,[number theory],PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Molly's Chemicals,1500.0,C,1487861100,"[binary search, data structures, math]",PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,The Door Problem,2000.0,D,1487861100,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,The Holmes Children,2250.0,E,1487861100,"[math, number theory]",PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock's bet to Moriarty,3000.0,F,1487861100,"[constructive algorithms, geometry, graphs, trees]",PROGRAMMING
+776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock and the Encrypted Data,3250.0,G,1487861100,"[bitmasks, combinatorics, dp]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Oath of the Night's Watch,500.0,A,1487606700,"[constructive algorithms, sortings]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Code For 1,1000.0,B,1487606700,"[constructive algorithms, dfs and similar, divide and conquer]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Jon Snow and his Favourite Number,1250.0,C,1487606700,"[brute force, dp, implementation, sortings]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Jon and Orbs,1750.0,D,1487606700,"[dp, math, probabilities]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Game of Stones,2000.0,E,1487606700,"[dp, games]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Barrels and boxes,2250.0,F,1487606700,"[brute force, combinatorics, number theory, probabilities]",PROGRAMMING
+768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,The Winds of Winter,2750.0,G,1487606700,[data structures],PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,Snacktower,500.0,A,1487408700,"[data structures, implementation]",PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,The Queue,1250.0,B,1487408700,"[brute force, greedy]",PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,Garland,1500.0,C,1487408700,"[dfs and similar, graphs, greedy, trees]",PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,Cartons of milk,2000.0,D,1487408700,"[binary search, data structures, greedy, sortings, two pointers]",PROGRAMMING
+767,Codeforces Round #398 (Div. 2),2,Change-free,2500.0,E,1487408700,[greedy],PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Neverending competitions,500.0,A,1487059500,[implementation],PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Code obfuscation,1000.0,B,1487059500,"[implementation, strings]",PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Table Tennis Game 2,1250.0,C,1487059500,[math],PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Artsem and Saunders,2000.0,D,1487059500,"[constructive algorithms, dsu, math]",PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Tree Folding,2500.0,E,1487059500,"[dfs and similar, dp, implementation, trees]",PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Souvenirs,3250.0,F,1487059500,[data structures],PROGRAMMING
+765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,"Math, math everywhere",3500.0,G,1487059500,[],PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and Longest Uncommon Subsequence,500.0,A,1486487100,"[constructive algorithms, strings]",PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Triangle,1000.0,B,1486487100,"[constructive algorithms, geometry, greedy, sortings]",PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Message,1500.0,C,1486487100,"[brute force, dp, strings]",PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Dictionary,2000.0,D,1486487100,"[data structures, dfs and similar, dsu, graphs]",PROGRAMMING
+766,Codeforces Round #396 (Div. 2),2,Mahmoud and a xor trip,2500.0,E,1486487100,"[bitmasks, constructive algorithms, data structures, dfs and similar, dp, trees]",PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and a tree,500.0,A,1486042500,"[dfs and similar, dp, dsu, trees]",PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and rectangles,750.0,B,1486042500,[constructive algorithms],PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and remoduling,1500.0,C,1486042500,"[brute force, number theory]",PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and a flat tree,2000.0,D,1486042500,"[data structures, hashing, trees]",PROGRAMMING
+763,Codeforces Round #395 (Div. 1),1,Timofey and our friends animals,2500.0,E,1486042500,[dsu],PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Taymyr is calling you,500.0,A,1486042500,"[brute force, implementation, math]",PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Timofey and cubes,1000.0,B,1486042500,"[constructive algorithms, implementation]",PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Timofey and a tree,1500.0,C,1486042500,[dfs and similar],PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Timofey and rectangles,1750.0,D,1486042500,[],PROGRAMMING
+764,Codeforces Round #395 (Div. 2),2,Timofey and remoduling,2500.0,E,1486042500,[],PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Stairs,500.0,A,1485873300,"[brute force, constructive algorithms, math]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and friends,1000.0,B,1485873300,"[brute force, implementation, math]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Password,1500.0,C,1485873300,"[brute force, dp, implementation]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Very Difficult Problem,2000.0,D,1485873300,"[binary search, brute force, constructive algorithms, greedy, sortings]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Puzzle,2500.0,E,1485873300,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING
+761,Codeforces Round #394 (Div. 2),2,Dasha and Photos,3000.0,F,1485873300,"[brute force, data structures]",PROGRAMMING
+762,Educational Codeforces Round 17,12,k-th divisor,,A,1485354900,"[math, number theory]",PROGRAMMING
+762,Educational Codeforces Round 17,12,USB vs. PS/2,,B,1485354900,"[greedy, sortings, two pointers]",PROGRAMMING
+762,Educational Codeforces Round 17,12,Two strings,,C,1485354900,"[binary search, hashing, two pointers]",PROGRAMMING
+762,Educational Codeforces Round 17,12,Maximum path,,D,1485354900,"[dp, implementation]",PROGRAMMING
+762,Educational Codeforces Round 17,12,Radio stations,,E,1485354900,"[binary search, data structures]",PROGRAMMING
+762,Educational Codeforces Round 17,12,Tree nesting,,F,1485354900,"[combinatorics, graphs, trees]",PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Pavel and barbecue,500.0,A,1485108900,[dfs and similar],PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Travel Card,1000.0,B,1485108900,"[binary search, dp]",PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Nikita and stack,1500.0,C,1485108900,[data structures],PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Bacterial Melee,2000.0,D,1485108900,"[brute force, combinatorics, dp, string suffix structures]",PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Byteland coins,2500.0,E,1485108900,"[combinatorics, dp, math]",PROGRAMMING
+756,8VC Venture Cup 2017 - Final Round,12,Long number,3000.0,F,1485108900,"[expression parsing, math, number theory]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Pavel and barbecue,500.0,A,1485108900,"[dfs and similar, dsu]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Travel Card,1000.0,B,1485108900,"[binary search, dp, greedy, two pointers]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Nikita and stack,1500.0,C,1485108900,"[binary search, data structures]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Bacterial Melee,2000.0,D,1485108900,[dp],PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Byteland coins,2500.0,E,1485108900,"[dp, math]",PROGRAMMING
+759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Long number,3000.0,F,1485108900,[],PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Petr and a calendar,500.0,A,1485108900,"[implementation, math]",PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Frodo and pillows,1000.0,B,1485108900,"[binary search, greedy]",PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Pavel and barbecue,1500.0,C,1485108900,"[dfs and similar, graphs]",PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Travel Card,2000.0,D,1485108900,"[binary search, dp, two pointers]",PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Nikita and stack,2500.0,E,1485108900,[],PROGRAMMING
+760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Bacterial Melee,3000.0,F,1485108900,[],PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Holiday Of Equality,500.0,A,1484838300,"[implementation, math]",PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Blown Garland,1000.0,B,1484838300,[implementation],PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Unfair Poll,1500.0,C,1484838300,"[binary search, implementation, math]",PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Ability To Convert,1750.0,D,1484838300,"[dp, greedy, strings]",PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Broken Tree,2500.0,E,1484838300,"[dfs and similar, greedy, trees]",PROGRAMMING
+758,Codeforces Round #392 (Div. 2),2,Geometrical Progression,3000.0,F,1484838300,"[brute force, math, number theory]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Hypothesis,500.0,A,1484499900,"[brute force, graphs, math]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Game,1000.0,B,1484499900,"[binary search, data structures, games, greedy, sortings]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Forest,1500.0,C,1484499900,"[dfs and similar, dsu, graphs]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Polygon,2250.0,D,1484499900,[data structures],PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and White-Red graph,2500.0,E,1484499900,"[constructive algorithms, graphs, shortest paths]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Gifts,2750.0,F,1484499900,"[bitmasks, dp, greedy]",PROGRAMMING
+755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Many Other Balls,3500.0,G,1484499900,"[combinatorics, divide and conquer, dp, fft, math, number theory]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Gotta Catch Em' All!,500.0,A,1484235300,[implementation],PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Bash's Big Day,1000.0,B,1484235300,"[greedy, math, number theory]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Felicity is Coming!,1500.0,C,1484235300,"[data structures, hashing, sortings, strings]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Felicity's Big Secret Revealed,2000.0,D,1484235300,"[bitmasks, dp]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Bash Plays with Functions,2500.0,E,1484235300,"[brute force, combinatorics, dp, number theory]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Team Rocket Rises Again,2750.0,F,1484235300,"[data structures, graphs, shortest paths]",PROGRAMMING
+757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Can Bash Save the Day?,3500.0,G,1484235300,"[data structures, divide and conquer, graphs, trees]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Lesha and array splitting,500.0,A,1483713300,"[constructive algorithms, greedy]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Ilya and tic-tac-toe game,1000.0,B,1483713300,"[brute force, implementation]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Vladik and chat,1500.0,C,1483713300,"[brute force, constructive algorithms, dp, implementation, strings]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Fedor and coupons,2000.0,D,1483713300,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+754,Codeforces Round #390 (Div. 2),2,Dasha and cyclic table,2500.0,E,1483713300,"[bitmasks, brute force, fft]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Hurry,500.0,A,1483107300,"[binary search, brute force, implementation, math]",PROGRAMMING
+750,Good Bye 2016,12,New Year and North Pole,750.0,B,1483107300,[implementation],PROGRAMMING
+750,Good Bye 2016,12,New Year and Rating,1000.0,C,1483107300,"[binary search, greedy, math]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Fireworks,1500.0,D,1483107300,"[brute force, data structures, dfs and similar, dp, implementation]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Old Subsequence,2250.0,E,1483107300,"[data structures, divide and conquer, dp]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Finding Roots,3000.0,F,1483107300,"[constructive algorithms, implementation, trees]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Binary Tree Paths,3250.0,G,1483107300,"[bitmasks, brute force, combinatorics, dp]",PROGRAMMING
+750,Good Bye 2016,12,New Year and Snowy Grid,3500.0,H,1483107300,"[dfs and similar, dsu, graphs]",PROGRAMMING
+753,Testing Round #13,12,Santa Claus and Candies,500.0,A,1483002300,"[dp, greedy, math]",PROGRAMMING
+753,Testing Round #13,12,Interactive Bulls and Cows (Easy),1000.0,B,1483002300,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+753,Testing Round #13,12,Interactive Bulls and Cows (Hard),1500.0,C,1483002300,"[brute force, constructive algorithms]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and a Place in a Class,500.0,A,1482656700,"[implementation, math]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Keyboard Check,1000.0,B,1482656700,"[implementation, strings]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Robot,1500.0,C,1482656700,"[constructive algorithms, math]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and a Palindrome,2000.0,D,1482656700,"[constructive algorithms, data structures, greedy]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Tangerines,2500.0,E,1482656700,"[binary search, greedy, two pointers]",PROGRAMMING
+748,Technocup 2017 - Elimination Round 3,12,Santa Clauses and a Soccer Championship,2500.0,F,1482656700,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and a Place in a Class,500.0,A,1482656700,"[constructive algorithms, math]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Keyboard Check,1000.0,B,1482656700,"[greedy, implementation, strings]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Robot,1500.0,C,1482656700,"[greedy, shortest paths]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and a Palindrome,2000.0,D,1482656700,"[data structures, greedy, hashing, strings]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Tangerines,2500.0,E,1482656700,"[binary search, dp, two pointers]",PROGRAMMING
+752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Clauses and a Soccer Championship,2500.0,F,1482656700,[trees],PROGRAMMING
+751,Технокубок 2017 - Ознакомительный Раунд 3,12,Оценки Васи,500.0,A,1482395400,[],PROGRAMMING
+751,Технокубок 2017 - Ознакомительный Раунд 3,12,Путь Поликарпа,1000.0,B,1482395400,[],PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Bachgold Problem,500.0,A,1482165300,"[greedy, implementation, math, number theory]",PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Parallelogram is Back,1000.0,B,1482165300,"[brute force, constructive algorithms, geometry]",PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Voting,1500.0,C,1482165300,"[greedy, implementation, two pointers]",PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Leaving Auction,2000.0,D,1482165300,"[binary search, data structures]",PROGRAMMING
+749,Codeforces Round #388 (Div. 2),2,Inversions After Shuffle,2500.0,E,1482165300,"[data structures, probabilities]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Display Size,500.0,A,1482113100,"[brute force, math]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Mammoth's Genome Decoding,1000.0,B,1482113100,"[implementation, strings]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Servers,1500.0,C,1482113100,[implementation],PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Winter Is Coming,2000.0,D,1482113100,"[greedy, sortings]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Comments,2000.0,E,1482113100,"[dfs and similar, expression parsing]",PROGRAMMING
+747,Codeforces Round #387 (Div. 2),2,Igor and Interesting Numbers,2500.0,F,1482113100,"[brute force, combinatorics, dp]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Compote,500.0,A,1482057300,[math],PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Decoding,1000.0,B,1482057300,"[implementation, strings]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Tram,1500.0,C,1482057300,"[constructive algorithms, implementation, math]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Green and Black Tea,2000.0,D,1482057300,"[constructive algorithms, greedy]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Numbers Exchange,2500.0,E,1482057300,"[greedy, implementation]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,Music in Car,3000.0,F,1482057300,"[data structures, greedy, two pointers]",PROGRAMMING
+746,Codeforces Round #386 (Div. 2),2,New Roads,3000.0,G,1482057300,"[constructive algorithms, trees]",PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow Builds A Nation,500.0,A,1481992500,"[dfs and similar, graphs]",PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow's Game,1250.0,B,1481992500,"[bitmasks, divide and conquer]",PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow Buys a Deck of Cards,1750.0,C,1481992500,"[bitmasks, brute force, dp]",PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow Draws a Circle,2250.0,D,1481992500,[geometry],PROGRAMMING
+744,Codeforces Round #385 (Div. 1),1,Hongcow Masters the Cyclic Shift,2500.0,E,1481992500,[strings],PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow Learns the Cyclic Shift,500.0,A,1481992500,"[implementation, strings]",PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow Solves A Puzzle,1000.0,B,1481992500,[implementation],PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow Builds A Nation,1500.0,C,1481992500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow's Game,2250.0,D,1481992500,[bitmasks],PROGRAMMING
+745,Codeforces Round #385 (Div. 2),2,Hongcow Buys a Deck of Cards,2750.0,E,1481992500,[],PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Vladik and flights,500.0,A,1481726100,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Chloe and the sequence ,1000.0,B,1481726100,"[binary search, bitmasks, constructive algorithms, implementation]",PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Vladik and fractions,1250.0,C,1481726100,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Chloe and pleasant prizes,2000.0,D,1481726100,"[dfs and similar, dp, trees]",PROGRAMMING
+743,Codeforces Round #384 (Div. 2),2,Vladik and cards,2500.0,E,1481726100,"[binary search, bitmasks, brute force, dp]",PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa's loud Owf and Mehrdad's evil plan,500.0,A,1481034900,"[dfs and similar, math]",PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa's weak amphitheater and Mehrdad's valuable Hoses,1000.0,B,1481034900,"[dfs and similar, dp, dsu]",PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa’s overnight party and Mehrdad’s silent entering,1250.0,C,1481034900,"[constructive algorithms, dfs and similar]",PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths,2000.0,D,1481034900,"[data structures, trees]",PROGRAMMING
+741,Codeforces Round #383 (Div. 1),1,Arpa’s abnormal DNA and Mehrdad’s deep interest,2500.0,E,1481034900,"[data structures, string suffix structures]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa’s hard exam and Mehrdad’s naive cheat,500.0,A,1481034900,"[implementation, math, number theory]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa’s obvious problem and Mehrdad’s terrible solution,1000.0,B,1481034900,"[math, number theory]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa's loud Owf and Mehrdad's evil plan,1500.0,C,1481034900,"[dfs and similar, math]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa's weak amphitheater and Mehrdad's valuable Hoses,2000.0,D,1481034900,"[dfs and similar, dp, dsu]",PROGRAMMING
+742,Codeforces Round #383 (Div. 2),2,Arpa’s overnight party and Mehrdad’s silent entering,2250.0,E,1481034900,[],PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Ostap and Grasshopper,500.0,A,1480264500,"[implementation, strings]",PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Urbanization,1000.0,B,1480264500,"[greedy, sortings]",PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Tennis Championship,1750.0,C,1480264500,"[greedy, math]",PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Taxes,1750.0,D,1480264500,"[math, number theory]",PROGRAMMING
+735,Codeforces Round #382 (Div. 2),2,Ostap and Tree,2500.0,E,1480264500,"[dp, trees]",PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Tennis Championship,750.0,A,1480264500,"[dfs and similar, dp, math]",PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Taxes,750.0,B,1480264500,"[math, number theory]",PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Ostap and Tree,1500.0,C,1480264500,[dp],PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Permutations,2000.0,D,1480264500,[matrices],PROGRAMMING
+736,Codeforces Round #382 (Div. 1),1,Chess Championship,2500.0,E,1480264500,"[constructive algorithms, flows, greedy]",PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Alyona and mex,500.0,A,1479918900,"[constructive algorithms, greedy]",PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Alyona and a tree,1000.0,B,1479918900,"[binary search, data structures, dfs and similar, graphs, trees]",PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Alyona and towers,1500.0,C,1479918900,[data structures],PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Recover a functional graph,2000.0,D,1479918900,[graph matchings],PROGRAMMING
+739,Codeforces Round #381 (Div. 1),1,Gosha is hunting,2500.0,E,1479918900,"[brute force, dp, flows, sortings]",PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and copybooks,500.0,A,1479918900,"[brute force, implementation]",PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and flowers,1000.0,B,1479918900,[constructive algorithms],PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and mex,1500.0,C,1479918900,[constructive algorithms],PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and a tree,2000.0,D,1479918900,"[binary search, data structures, dfs and similar, graph matchings, graphs]",PROGRAMMING
+740,Codeforces Round #381 (Div. 2),2,Alyona and towers,2500.0,E,1479918900,[],PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Interview with Oleg,500.0,A,1479632700,"[implementation, strings]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Spotlights,1000.0,B,1479632700,"[dp, implementation]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Road to Cinema,1750.0,C,1479632700,"[binary search, greedy, sortings]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Sea Battle,1750.0,D,1479632700,"[constructive algorithms, greedy]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Subordinates,2000.0,E,1479632700,"[constructive algorithms, data structures, greedy, sortings]",PROGRAMMING
+729,Technocup 2017 - Elimination Round 2,12,Financiers Game,2500.0,F,1479632700,[dp],PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Road to Cinema,750.0,A,1479632700,[binary search],PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Sea Battle,750.0,B,1479632700,"[greedy, implementation]",PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Subordinates,1000.0,C,1479632700,[greedy],PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Financiers Game,1500.0,D,1479632700,"[dp, games]",PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Tanya is 5!,2000.0,E,1479632700,"[graph matchings, graphs, greedy, schedules]",PROGRAMMING
+737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Dirty plates,2500.0,F,1479632700,"[constructive algorithms, math]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Interview with Oleg,500.0,A,1479632700,"[implementation, strings]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Spotlights,1000.0,B,1479632700,"[brute force, dp, implementation]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Road to Cinema,1750.0,C,1479632700,[binary search],PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Sea Battle,1750.0,D,1479632700,"[binary search, constructive algorithms, greedy]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Subordinates,2000.0,E,1479632700,"[constructive algorithms, greedy]",PROGRAMMING
+738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Financiers Game,2500.0,F,1479632700,"[dp, games]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Danik,500.0,A,1479227700,"[implementation, strings]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Digits,750.0,B,1479227700,"[implementation, math]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Making Potions,1250.0,C,1479227700,"[binary search, dp, greedy, two pointers]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Chess,1500.0,D,1479227700,[implementation],PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and Tree,2000.0,E,1479227700,"[dfs and similar, dp, trees]",PROGRAMMING
+734,Codeforces Round #379 (Div. 2),2,Anton and School,2750.0,F,1479227700,"[bitmasks, constructive algorithms, implementation, math]",PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Grasshopper And the String,500.0,A,1477922700,[implementation],PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Parade,1000.0,B,1477922700,[math],PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Epidemic in Monstropolis,2000.0,C,1477922700,"[constructive algorithms, dp, greedy, two pointers]",PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Kostya the Sculptor,2000.0,D,1477922700,"[data structures, hashing]",PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Sleep in Class,2750.0,E,1477922700,"[data structures, math, two pointers]",PROGRAMMING
+733,Codeforces Round #378 (Div. 2),2,Drivers Dissatisfaction,3000.0,F,1477922700,"[data structures, dsu, graphs, trees]",PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Toda 2,,A,1477209600,[greedy],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Minimum and Maximum,,B,1477209600,[constructive algorithms],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Bulmart,,C,1477209600,"[binary search, dfs and similar]",PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Running Over The Bridges,,D,1477209600,"[greedy, implementation]",PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Award Ceremony,,E,1477209600,[greedy],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Ber Patio,,F,1477209600,[],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Car Repair Shop,,G,1477209600,[implementation],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Delete Them,,H,1477209600,[implementation],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Olympiad in Programming and Sports,,I,1477209600,"[dp, flows, greedy]",PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Bottles,,J,1477209600,[dp],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Roads Orientation Problem,,K,1477209600,[],PROGRAMMING
+730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Expression Queries,,L,1477209600,[],PROGRAMMING
+725,Canada Cup 2016,12,Jumping Ball,500.0,A,1477148700,[implementation],PROGRAMMING
+725,Canada Cup 2016,12,Food on the Plane,1000.0,B,1477148700,[math],PROGRAMMING
+725,Canada Cup 2016,12,Hidden Word,1500.0,C,1477148700,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+725,Canada Cup 2016,12,Contest Balloons,2250.0,D,1477148700,"[data structures, greedy]",PROGRAMMING
+725,Canada Cup 2016,12,Too Much Money,2500.0,E,1477148700,[brute force],PROGRAMMING
+725,Canada Cup 2016,12,Family Photos,3250.0,F,1477148700,[greedy],PROGRAMMING
+725,Canada Cup 2016,12,Messages on a Tree,3500.0,G,1477148700,[],PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Buy a Shovel,500.0,A,1476714900,"[brute force, constructive algorithms, math]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Cormen --- The Best Friend Of a Man,1000.0,B,1476714900,"[dp, greedy]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Sanatorium,1500.0,C,1476714900,"[constructive algorithms, greedy]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Exams,2000.0,D,1476714900,"[binary search, greedy, sortings]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Sockets,2000.0,E,1476714900,"[greedy, sortings]",PROGRAMMING
+732,Codeforces Round #377 (Div. 2),2,Tourist Reform,2500.0,F,1476714900,[dfs and similar],PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Night at the Museum,500.0,A,1476611100,"[implementation, strings]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Coupons and Discounts,1000.0,B,1476611100,"[constructive algorithms, greedy]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Socks,1500.0,C,1476611100,"[dsu, graphs, greedy]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,80-th Level Archeology,2000.0,D,1476611100,"[brute force, data structures, greedy, sortings]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Funny Game,2500.0,E,1476611100,"[dp, games]",PROGRAMMING
+731,Codeforces Round #376 (Div. 2),2,Video Cards,3000.0,F,1476611100,"[brute force, data structures, implementation, number theory]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Transformation: from A to B,1000.0,A,1476522300,"[brute force, dfs and similar]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Bill Total Value,1000.0,B,1476522300,"[expression parsing, implementation]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Guess the Array,1500.0,C,1476522300,"[constructive algorithms, math]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,T-shirts Distribution,1500.0,D,1476522300,"[constructive algorithms, flows, greedy]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Games on a CD,2500.0,E,1476522300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Polycarp's problems,3000.0,F,1476522300,"[binary search, dp, greedy]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Checking the Calendar,500.0,A,1475928900,[implementation],PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Batch Sort,1000.0,B,1475928900,"[brute force, greedy, implementation]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Ray Tracing,1500.0,C,1475928900,"[greedy, hashing, implementation, math, number theory]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Dense Subsequence,1500.0,D,1475928900,"[data structures, greedy]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Goods transportation,2500.0,E,1475928900,"[dp, flows]",PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Uniformly Branched Trees,2500.0,F,1475928900,[combinatorics],PROGRAMMING
+724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Xor-matic Number of the Graph,2500.0,G,1475928900,"[bitmasks, graphs, math, trees]",PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,The New Year: Meeting Friends,500.0,A,1475494500,[sortings],PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,Text Document Analysis,1000.0,B,1475494500,"[expression parsing, implementation]",PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,Polycarp at the Radio,1500.0,C,1475494500,[greedy],PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,Lakes in Berland,2000.0,D,1475494500,"[dfs and similar, dsu, greedy]",PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,One-Way Reform,2500.0,E,1475494500,"[constructive algorithms, dfs and similar, flows, graphs, greedy]",PROGRAMMING
+723,Codeforces Round #375 (Div. 2),2,st-Spanning Tree,3000.0,F,1475494500,"[dsu, graphs, greedy, implementation]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Broken Clock,500.0,A,1475330700,"[brute force, implementation]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Verse Pattern,500.0,B,1475330700,"[implementation, strings]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Destroying Array,1000.0,C,1475330700,"[data structures, dsu]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Generating Sets,1500.0,D,1475330700,"[binary search, data structures, dfs and similar, greedy]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Research Rover,2000.0,E,1475330700,"[combinatorics, dp]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Cyclic Cipher,2500.0,F,1475330700,"[chinese remainder theorem, implementation, number theory, two pointers]",PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,One-dimensional Japanese Crossword,500.0,A,1475244300,[implementation],PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,Passwords,1000.0,B,1475244300,"[sortings, strings]",PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,Journey,1500.0,C,1475244300,"[dp, graphs]",PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,Maxim and Array,2000.0,D,1475244300,"[constructive algorithms, data structures, greedy]",PROGRAMMING
+721,Codeforces Round #374 (Div. 2),2,Road to Home,2750.0,E,1475244300,"[binary search, dp]",PROGRAMMING
+718,Codeforces Round #373 (Div. 1),1,Efim and Strange Grade,500.0,A,1474635900,[implementation],PROGRAMMING
+718,Codeforces Round #373 (Div. 1),1,Sasha and Array,1250.0,C,1474635900,"[data structures, math, matrices]",PROGRAMMING
+718,Codeforces Round #373 (Div. 1),1,Andrew and Chemistry,2000.0,D,1474635900,"[hashing, trees]",PROGRAMMING
+718,Codeforces Round #373 (Div. 1),1,Matvey's Birthday,2500.0,E,1474635900,[graphs],PROGRAMMING
+719,Codeforces Round #373 (Div. 2),2,Vitya in the Countryside,500.0,A,1474635900,[implementation],PROGRAMMING
+719,Codeforces Round #373 (Div. 2),2,Anatoly and Cockroaches,1000.0,B,1474635900,[greedy],PROGRAMMING
+719,Codeforces Round #373 (Div. 2),2,Efim and Strange Grade,1500.0,C,1474635900,[implementation],PROGRAMMING
+719,Codeforces Round #373 (Div. 2),2,Sasha and Array,2250.0,E,1474635900,"[data structures, math, matrices]",PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Closing ceremony,,A,1474196700,[greedy],PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Cactusophobia,,B,1474196700,"[dfs and similar, flows]",PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Homework,,C,1474196700,[],PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Slalom,,D,1474196700,"[data structures, dp]",PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Cipher,,E,1474196700,[],PROGRAMMING
+720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Array Covering,,F,1474196700,[],PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Plus and Square Root,500.0,A,1474119900,"[constructive algorithms, math]",PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Complete The Graph,1000.0,B,1474119900,"[binary search, constructive algorithms, graphs, shortest paths]",PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Digit Tree,1500.0,C,1474119900,"[divide and conquer, dsu]",PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Create a Maze,2500.0,D,1474119900,[constructive algorithms],PROGRAMMING
+715,Codeforces Round #372 (Div. 1),1,Complete the Permutations,2750.0,E,1474119900,[],PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Crazy Computer,500.0,A,1474119900,[implementation],PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Complete the Word,1000.0,B,1474119900,[two pointers],PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Plus and Square Root,1500.0,C,1474119900,"[constructive algorithms, math, number theory]",PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Complete The Graph,2000.0,D,1474119900,"[graphs, shortest paths]",PROGRAMMING
+716,Codeforces Round #372 (Div. 2),2,Digit Tree,2500.0,E,1474119900,[divide and conquer],PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Sonya and Queries,500.0,A,1473784500,[data structures],PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Searching Rectangles,1000.0,B,1473784500,"[binary search, constructive algorithms]",PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Sonya and Problem Wihtout a Legend,2000.0,C,1473784500,"[dp, sortings]",PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Animals and Puzzle,2000.0,D,1473784500,"[binary search, data structures]",PROGRAMMING
+713,Codeforces Round #371 (Div. 1),1,Sonya Partymaker,2000.0,E,1473784500,[],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Meeting of Old Friends,500.0,A,1473784500,[math],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Filya and Homework,1000.0,B,1473784500,[implementation],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Sonya and Queries,1000.0,C,1473784500,[data structures],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Searching Rectangles,2000.0,D,1473784500,[binary search],PROGRAMMING
+714,Codeforces Round #371 (Div. 2),2,Sonya and Problem Wihtout a Legend,3000.0,E,1473784500,"[dp, flows, sortings]",PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Festival Organization,,A,1473584400,"[math, number theory]",PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,R3D3’s Summer Adventure,,B,1473584400,[greedy],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Potions Homework,,C,1473584400,"[implementation, sortings]",PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Dexterina’s Lab,,D,1473584400,"[games, matrices, probabilities]",PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,"Paint it really, really dark gray",,E,1473584400,[dfs and similar],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Heroes of Making Magic III,,F,1473584400,[data structures],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Underfail,,G,1473584400,[flows],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Pokermon League challenge,,H,1473584400,[probabilities],PROGRAMMING
+717,Bubble Cup 9 - Finals [Online Mirror],12,Cowboy Beblop at his computer,,I,1473584400,[],PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and Crow,500.0,A,1473525900,[implementation],PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and Trident,1000.0,B,1473525900,[implementation],PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and De-Evolution,1500.0,C,1473525900,"[greedy, math]",PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and Scores,2250.0,D,1473525900,"[combinatorics, dp]",PROGRAMMING
+712,Codeforces Round #370 (Div. 2),2,Memory and Casinos,2500.0,E,1473525900,"[data structures, math, probabilities]",PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Bus to Udayland,500.0,A,1472472300,"[brute force, implementation]",PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Chris and Magic Square,1000.0,B,1472472300,[constructive algorithms],PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Coloring Trees,1500.0,C,1472472300,[dp],PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Directed Roads,2000.0,D,1472472300,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,ZS and The Birthday Paradox,2500.0,E,1472472300,"[math, number theory, probabilities]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Letters Cyclic Shift,500.0,A,1472056500,"[constructive algorithms, implementation]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Recover the String,1000.0,B,1472056500,"[constructive algorithms, implementation, math]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Centroids,1500.0,C,1472056500,"[data structures, dfs and similar, dp, greedy, trees]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Incorrect Flow,2000.0,D,1472056500,[flows],PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Student's Camp,2500.0,E,1472056500,"[dp, math]",PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Juicer,500.0,A,1472056500,[implementation],PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Checkpoints,1000.0,B,1472056500,"[implementation, sortings]",PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Letters Cyclic Shift,1500.0,C,1472056500,[greedy],PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Recover the String,2000.0,D,1472056500,"[greedy, math]",PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Centroids,2500.0,E,1472056500,"[dp, trees]",PROGRAMMING
+710,Educational Codeforces Round 16,12,King Moves,,A,1471875000,[implementation],PROGRAMMING
+710,Educational Codeforces Round 16,12,Optimal Point on a Line,,B,1471875000,"[brute force, sortings]",PROGRAMMING
+710,Educational Codeforces Round 16,12,Magic Odd Square,,C,1471875000,[constructive algorithms],PROGRAMMING
+710,Educational Codeforces Round 16,12,Two Arithmetic Progressions,,D,1471875000,[math],PROGRAMMING
+710,Educational Codeforces Round 16,12,Generate a String,,E,1471875000,"[dfs and similar, dp]",PROGRAMMING
+710,Educational Codeforces Round 16,12,String Set Queries,,F,1471875000,"[brute force, data structures, hashing, string suffix structures, strings]",PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Brain's Photos,500.0,A,1471698300,[implementation],PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Bakery,1000.0,B,1471698300,[graphs],PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Pythagorean Triples,1500.0,C,1471698300,"[math, number theory]",PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Persistent Bookcase ,2000.0,D,1471698300,"[data structures, dfs and similar, implementation]",PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Garlands,2500.0,E,1471698300,[data structures],PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Beru-taxi,500.0,A,1470933300,"[brute force, geometry, implementation]",PROGRAMMING
706,Codeforces Round #367 (Div. 2),2,Interesting drink,1000.0,B,1470933300,"[binary search, implementation]",PROGRAMMING
706,Codeforces Round #367 (Div. 2),2,Hard problem,1500.0,C,1470933300,[dp],PROGRAMMING
706,Codeforces Round #367 (Div. 2),2,Vasiliy's Multiset,2000.0,D,1470933300,"[binary search, data structures, trees]",PROGRAMMING
-706,Codeforces Round #367 (Div. 2),2,Working routine,2500.0,E,1470933300,"[data structures, implementation, matrices]",PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Working routine,2500.0,E,1470933300,"[data structures, implementation]",PROGRAMMING
704,Codeforces Round #366 (Div. 1),1,Thor,500.0,A,1470578700,"[brute force, data structures, implementation]",PROGRAMMING
704,Codeforces Round #366 (Div. 1),1,Ant Man,1250.0,B,1470578700,"[dp, graphs, greedy]",PROGRAMMING
-704,Codeforces Round #366 (Div. 1),1,Black Widow,1250.0,C,1470578700,[dp],PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Black Widow,1250.0,C,1470578700,"[dp, implementation]",PROGRAMMING
704,Codeforces Round #366 (Div. 1),1,Captain America,2000.0,D,1470578700,[flows],PROGRAMMING
-704,Codeforces Round #366 (Div. 1),1,Iron Man,2500.0,E,1470578700,[],PROGRAMMING
-705,Codeforces Round #366 (Div. 2),2,Hulk,500.0,A,1470578700,[],PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Iron Man,2500.0,E,1470578700,"[geometry, trees]",PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Hulk,500.0,A,1470578700,[implementation],PROGRAMMING
705,Codeforces Round #366 (Div. 2),2,Spider Man,1000.0,B,1470578700,[games],PROGRAMMING
705,Codeforces Round #366 (Div. 2),2,Thor,1500.0,C,1470578700,"[data structures, implementation]",PROGRAMMING
705,Codeforces Round #366 (Div. 2),2,Ant Man,2250.0,D,1470578700,"[dp, graphs]",PROGRAMMING
@@ -2821,7 +11774,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
703,Codeforces Round #365 (Div. 2),2,Mishka and Interesting sum,2000.0,D,1470323700,[data structures],PROGRAMMING
703,Codeforces Round #365 (Div. 2),2,Mishka and Divisors,2250.0,E,1470323700,"[dp, number theory]",PROGRAMMING
702,Educational Codeforces Round 15,12,Maximum Increase,,A,1469804400,"[dp, greedy, implementation]",PROGRAMMING
-702,Educational Codeforces Round 15,12,Powers of Two,,B,1469804400,"[brute force, data structures, implementation]",PROGRAMMING
+702,Educational Codeforces Round 15,12,Powers of Two,,B,1469804400,"[brute force, data structures, implementation, math]",PROGRAMMING
702,Educational Codeforces Round 15,12,Cellular Network,,C,1469804400,"[binary search, two pointers]",PROGRAMMING
702,Educational Codeforces Round 15,12,Road to Post Office,,D,1469804400,[math],PROGRAMMING
702,Educational Codeforces Round 15,12,Analysis of Pathes in Functional Graph,,E,1469804400,"[data structures, graphs]",PROGRAMMING
@@ -2831,7 +11784,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
700,Codeforces Round #364 (Div. 1),1,Break Up,1500.0,C,1469205300,[dfs and similar],PROGRAMMING
700,Codeforces Round #364 (Div. 1),1,Huffman Coding on Segment,2250.0,D,1469205300,"[data structures, greedy]",PROGRAMMING
700,Codeforces Round #364 (Div. 1),1,Cool Slogans,3000.0,E,1469205300,"[string suffix structures, strings]",PROGRAMMING
-701,Codeforces Round #364 (Div. 2),2,Cards,500.0,A,1469205300,[greedy],PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,Cards,500.0,A,1469205300,"[greedy, implementation]",PROGRAMMING
701,Codeforces Round #364 (Div. 2),2,Cells Not Under Attack,750.0,B,1469205300,[math],PROGRAMMING
701,Codeforces Round #364 (Div. 2),2,They Are Everywhere,1000.0,C,1469205300,"[binary search, two pointers]",PROGRAMMING
701,Codeforces Round #364 (Div. 2),2,As Fast As Possible,1500.0,D,1469205300,"[binary search, math]",PROGRAMMING
@@ -2921,16 +11874,16 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
682,Codeforces Round #358 (Div. 2),2,Alyona and the Tree,1500.0,C,1466181300,"[dfs and similar, dp, trees]",PROGRAMMING
682,Codeforces Round #358 (Div. 2),2,Alyona and Strings,2000.0,D,1466181300,"[dp, strings]",PROGRAMMING
682,Codeforces Round #358 (Div. 2),2,Alyona and Triangles,3000.0,E,1466181300,"[geometry, two pointers]",PROGRAMMING
-683,Surprise Language Round #8,12,The Check of the Point,,A,1466092800,[],PROGRAMMING
-683,Surprise Language Round #8,12,The Teacher of Physical Education,,B,1466092800,[],PROGRAMMING
-683,Surprise Language Round #8,12,Symmetric Difference,,C,1466092800,[],PROGRAMMING
-683,Surprise Language Round #8,12,Chocolate Bar,,D,1466092800,[],PROGRAMMING
-683,Surprise Language Round #8,12,Hammer throwing,,E,1466092800,[],PROGRAMMING
-683,Surprise Language Round #8,12,Reformat the String,,F,1466092800,[],PROGRAMMING
-683,Surprise Language Round #8,12,The Fraction,,G,1466092800,[],PROGRAMMING
-683,Surprise Language Round #8,12,Exchange of Books,,H,1466092800,[],PROGRAMMING
-683,Surprise Language Round #8,12,Loader,,I,1466092800,[],PROGRAMMING
-683,Surprise Language Round #8,12,The Hero with Bombs,,J,1466092800,[],PROGRAMMING
+683,Surprise Language Round #8,12,The Check of the Point,,A,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,The Teacher of Physical Education,,B,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Symmetric Difference,,C,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Chocolate Bar,,D,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Hammer throwing,,E,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Reformat the String,,F,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,The Fraction,,G,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Exchange of Books,,H,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Loader,,I,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,The Hero with Bombs,,J,1466092800,[*special],PROGRAMMING
681,Codeforces Round #357 (Div. 2),2,A Good Contest,500.0,A,1465922100,[implementation],PROGRAMMING
681,Codeforces Round #357 (Div. 2),2,Economy Game,1000.0,B,1465922100,[brute force],PROGRAMMING
681,Codeforces Round #357 (Div. 2),2,Heap Operations,1500.0,C,1465922100,"[data structures, greedy]",PROGRAMMING
@@ -2942,7 +11895,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
678,Educational Codeforces Round 13,12,Iterated Linear Function,,D,1465834200,"[math, number theory]",PROGRAMMING
678,Educational Codeforces Round 13,12,Another Sith Tournament,,E,1465834200,"[bitmasks, dp]",PROGRAMMING
678,Educational Codeforces Round 13,12,Lena and Queries,,F,1465834200,"[data structures, divide and conquer, geometry]",PROGRAMMING
-684,Codeforces Marathon Round 1,12,Online Exam,,A2,1465722000,[],PROGRAMMING
+684,Codeforces Marathon Round 1,12,Online Exam,,A2,1465722000,[*special],PROGRAMMING
679,Codeforces Round #356 (Div. 1),1,Bear and Prime 100,750.0,A,1465403700,[constructive algorithms],PROGRAMMING
679,Codeforces Round #356 (Div. 1),1,Bear and Tower of Cubes,1250.0,B,1465403700,"[dp, greedy]",PROGRAMMING
679,Codeforces Round #356 (Div. 1),1,Bear and Square Grid,1500.0,C,1465403700,"[dfs and similar, dsu, implementation]",PROGRAMMING
@@ -2968,42 +11921,4548 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
675,Codeforces Round #353 (Div. 2),2,Money Transfers,1500.0,C,1463416500,"[data structures, greedy, sortings]",PROGRAMMING
675,Codeforces Round #353 (Div. 2),2,Tree Construction,2000.0,D,1463416500,"[data structures, trees]",PROGRAMMING
675,Codeforces Round #353 (Div. 2),2,Trains and Statistic,2500.0,E,1463416500,"[data structures, dp, greedy]",PROGRAMMING
-711,Codeforces Round #369 (Div. 2),2,Bus to Udayland,500.0,A,1472472300,"[brute force, implementation]",PROGRAMMING
-711,Codeforces Round #369 (Div. 2),2,Chris and Magic Square,1000.0,B,1472472300,[constructive algorithms],PROGRAMMING
-711,Codeforces Round #369 (Div. 2),2,Coloring Trees,1500.0,C,1472472300,[dp],PROGRAMMING
-711,Codeforces Round #369 (Div. 2),2,Directed Roads,2000.0,D,1472472300,"[combinatorics, dfs and similar, graphs]",PROGRAMMING
-711,Codeforces Round #369 (Div. 2),2,ZS and The Birthday Paradox,2500.0,E,1472472300,"[math, number theory, probabilities]",PROGRAMMING
-708,AIM Tech Round 3 (Div. 1),1,Letters Cyclic Shift,500.0,A,1472056500,"[constructive algorithms, implementation]",PROGRAMMING
-708,AIM Tech Round 3 (Div. 1),1,Recover the String,1000.0,B,1472056500,"[constructive algorithms, implementation, math]",PROGRAMMING
-708,AIM Tech Round 3 (Div. 1),1,Centroids,1500.0,C,1472056500,"[data structures, dfs and similar, dp, greedy, trees]",PROGRAMMING
-708,AIM Tech Round 3 (Div. 1),1,Incorrect Flow,2000.0,D,1472056500,[flows],PROGRAMMING
-708,AIM Tech Round 3 (Div. 1),1,Student's Camp,2500.0,E,1472056500,"[dp, math]",PROGRAMMING
-709,AIM Tech Round 3 (Div. 2),2,Juicer,500.0,A,1472056500,[implementation],PROGRAMMING
-709,AIM Tech Round 3 (Div. 2),2,Checkpoints,1000.0,B,1472056500,"[implementation, sortings]",PROGRAMMING
-709,AIM Tech Round 3 (Div. 2),2,Letters Cyclic Shift,1500.0,C,1472056500,[greedy],PROGRAMMING
-709,AIM Tech Round 3 (Div. 2),2,Recover the String,2000.0,D,1472056500,"[greedy, math]",PROGRAMMING
-709,AIM Tech Round 3 (Div. 2),2,Centroids,2500.0,E,1472056500,"[dp, trees]",PROGRAMMING
-710,Educational Codeforces Round 16,12,King Moves,,A,1471875000,[implementation],PROGRAMMING
-710,Educational Codeforces Round 16,12,Optimal Point on a Line,,B,1471875000,"[brute force, sortings]",PROGRAMMING
-710,Educational Codeforces Round 16,12,Magic Odd Square,,C,1471875000,[constructive algorithms],PROGRAMMING
-710,Educational Codeforces Round 16,12,Two Arithmetic Progressions,,D,1471875000,[math],PROGRAMMING
-710,Educational Codeforces Round 16,12,Generate a String,,E,1471875000,"[dfs and similar, dp]",PROGRAMMING
-710,Educational Codeforces Round 16,12,String Set Queries,,F,1471875000,"[brute force, data structures, hashing, string suffix structures, strings]",PROGRAMMING
-707,Codeforces Round #368 (Div. 2),2,Brain's Photos,500.0,A,1471698300,[implementation],PROGRAMMING
-707,Codeforces Round #368 (Div. 2),2,Bakery,1000.0,B,1471698300,[graphs],PROGRAMMING
-707,Codeforces Round #368 (Div. 2),2,Pythagorean Triples,1500.0,C,1471698300,"[math, number theory]",PROGRAMMING
-707,Codeforces Round #368 (Div. 2),2,Persistent Bookcase ,2000.0,D,1471698300,"[data structures, dfs and similar, implementation]",PROGRAMMING
-707,Codeforces Round #368 (Div. 2),2,Garlands,2500.0,E,1471698300,[data structures],PROGRAMMING
-788,Codeforces Round #407 (Div. 1),1,Functions again,500.0,A,1490803500,[dp],PROGRAMMING
-788,Codeforces Round #407 (Div. 1),1,Weird journey,1250.0,B,1490803500,"[combinatorics, dfs and similar, graphs]",PROGRAMMING
-788,Codeforces Round #407 (Div. 1),1,The Great Mixing,1500.0,C,1490803500,"[dfs and similar, dp, math]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Recycling Bottles,500.0,A,1462984500,"[dp, greedy]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Robin Hood,1000.0,B,1462984500,"[binary search, greedy]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Ultimate Weirdness of an Array,1500.0,C,1462984500,"[data structures, number theory]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Roads in Yusland,2000.0,D,1462984500,"[data structures, dp, greedy]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Organizing a Race,3000.0,E,1462984500,"[data structures, greedy]",PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Summer Camp,500.0,A,1462984500,[implementation],PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Different is Good,1000.0,B,1462984500,"[constructive algorithms, implementation, strings]",PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Recycling Bottles,1500.0,C,1462984500,"[brute force, geometry, greedy]",PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Robin Hood,2000.0,D,1462984500,"[binary search, greedy]",PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Ultimate Weirdness of an Array,2500.0,E,1462984500,[],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bear and Colors,500.0,A,1462633500,[implementation],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bear and Two Paths,1000.0,B,1462633500,[constructive algorithms],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Levels and Regions,1750.0,C,1462633500,[dp],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bearish Fanpages,2250.0,D,1462633500,[],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bear and Destroying Subtrees,2250.0,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bears and Juice,3000.0,F,1462633500,[math],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Choosing Ads,3000.0,G,1462633500,[],PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Game,500.0,A,1462633500,[implementation],PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Problems for Round,750.0,B,1462633500,"[greedy, implementation]",PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Colors,1000.0,C,1462633500,[],PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Two Paths,1500.0,D,1462633500,[],PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Levels and Regions,2250.0,E,1462633500,"[divide and conquer, dp]",PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bearish Fanpages,3000.0,F,1462633500,[],PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Colors,500.0,A,1462633500,"[brute force, data structures, implementation]",PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Two Paths,1000.0,B,1462633500,"[constructive algorithms, graphs]",PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Levels and Regions,1750.0,C,1462633500,"[divide and conquer, dp]",PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bearish Fanpages,2250.0,D,1462633500,[],PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Destroying Subtrees,2250.0,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bears and Juice,3000.0,F,1462633500,[combinatorics],PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Choosing Ads,3000.0,G,1462633500,[],PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Holidays,500.0,A,1462464300,"[brute force, constructive algorithms]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Game of Robots,750.0,B,1462464300,[implementation],PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Cinema,1000.0,C,1462464300,"[implementation, sortings]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Magic Powder - 1,1000.0,D1,1462464300,"[binary search, brute force]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Magic Powder - 2,500.0,D2,1462464300,[binary search],PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Correct Bracket Sequence Editor,2000.0,E,1462464300,"[data structures, dsu]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Restore a Number,2500.0,F,1462464300,"[constructive algorithms, strings]",PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Reberland Linguistics,500.0,A,1461947700,"[dp, implementation, strings]",PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,World Tour,1000.0,B,1461947700,"[graphs, shortest paths]",PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Codeword,2000.0,C,1461947700,[combinatorics],PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Chain Reaction,2000.0,D,1461947700,[brute force],PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Forensic Examination,3000.0,E,1461947700,"[data structures, string suffix structures]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Pouring Rain,500.0,A,1461947700,"[geometry, math]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Coat of Anticubism,1000.0,B,1461947700,"[constructive algorithms, geometry]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Reberland Linguistics,1500.0,C,1461947700,"[dp, strings]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,World Tour,2000.0,D,1461947700,"[brute force, graphs, shortest paths]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Chain Reaction,3000.0,E,1461947700,[],PROGRAMMING
+642,VK Cup 2016 - Wild Card Round 2,12,Scheduler for Invokers,,A,1461596400,[*special],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Grasshopper,500.0,A,1461515700,[implementation],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Matrix,750.0,B,1461515700,[implementation],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Dance,1000.0,C,1461515700,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Random Variable,1500.0,D,1461515700,"[dp, implementation, math, probabilities]",PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Time Machine,2000.0,E,1461515700,[data structures],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and 2-SAT,3000.0,F,1461515700,[],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Graph,3000.0,G,1461515700,[],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Matrix,500.0,A,1461515700,[],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Dance,1000.0,B,1461515700,[],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Random Variable,1500.0,C,1461515700,[math],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Time Machine,2000.0,D,1461515700,[data structures],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and 2-SAT,3000.0,E,1461515700,[graphs],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Graph,3000.0,F,1461515700,[dp],PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Presents,500.0,A,1461515700,[math],PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Grasshopper,1000.0,B,1461515700,[],PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Matrix,1500.0,C,1461515700,"[constructive algorithms, implementation]",PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Dance,2000.0,D,1461515700,"[data structures, implementation, math]",PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Time Machine,2500.0,E,1461515700,[data structures],PROGRAMMING
+665,Educational Codeforces Round 12,12,Buses Between Cities,,A,1461164400,[implementation],PROGRAMMING
+665,Educational Codeforces Round 12,12,Shopping,,B,1461164400,[brute force],PROGRAMMING
+665,Educational Codeforces Round 12,12,Simple Strings,,C,1461164400,"[dp, greedy, strings]",PROGRAMMING
+665,Educational Codeforces Round 12,12,Simple Subset,,D,1461164400,"[constructive algorithms, greedy]",PROGRAMMING
+665,Educational Codeforces Round 12,12,Beautiful Subarrays,,E,1461164400,"[data structures, divide and conquer]",PROGRAMMING
+665,Educational Codeforces Round 12,12,Four Divisors,,F,1461164400,"[dp, math, number theory]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,Rebus,500.0,A,1460824500,"[constructive algorithms, expression parsing, greedy, math]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,International Olympiad,1000.0,B,1460824500,"[brute force, constructive algorithms, greedy, strings]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,Graph Coloring,1500.0,C,1460824500,[dfs and similar],PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,To Hack or not to Hack,2500.0,D,1460824500,"[brute force, dp, greedy]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,Binary Table,2500.0,E,1460824500,"[bitmasks, divide and conquer, dp]",PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,Complicated GCD,500.0,A,1460824500,[math],PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,Rebus,1000.0,B,1460824500,[greedy],PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,International Olympiad,1500.0,C,1460824500,[greedy],PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,Graph Coloring,2000.0,D,1460824500,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,To Hack or not to Hack,3000.0,E,1460824500,[],PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Gambling Nim,500.0,A,1460729700,"[bitmasks, math, matrices, probabilities]",PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Graph Coloring,250.0,B,1460729700,[dfs and similar],PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Binary Table,2250.0,C,1460729700,"[bitmasks, brute force, divide and conquer, dp, fft, math]",PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,International Olympiad,250.0,D,1460729700,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,To Hack or not to Hack,2250.0,E,1460729700,"[brute force, dp, greedy]",PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Seasons,,B,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Array Sum,,C,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Seasons,,B,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Array Sum,,C,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING
+660,Educational Codeforces Round 11,12,Co-prime Array,,A,1460127600,"[greedy, implementation]",PROGRAMMING
+660,Educational Codeforces Round 11,12,Seating On Bus,,B,1460127600,[implementation],PROGRAMMING
+660,Educational Codeforces Round 11,12,Hard Process,,C,1460127600,"[binary search, dp, two pointers]",PROGRAMMING
+660,Educational Codeforces Round 11,12,Number of Parallelograms,,D,1460127600,[geometry],PROGRAMMING
+660,Educational Codeforces Round 11,12,Different Subsets For All Tuples,,E,1460127600,[combinatorics],PROGRAMMING
+660,Educational Codeforces Round 11,12,Bear and Bowling 4,,F,1460127600,"[binary search, data structures, geometry, ternary search]",PROGRAMMING
+656,April Fools Day Contest 2016,12,Da Vinci Powers,,A,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Scrambled,,B,1459526400,"[*special, implementation]",PROGRAMMING
+656,April Fools Day Contest 2016,12,Without Text,,C,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Rosetta Problem,,D,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Out of Controls,,E,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Ace It!,,F,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,You're a Professional,,G,1459526400,[*special],PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Round House,500.0,A,1459353900,"[implementation, math]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Qualifying Contest,1000.0,B,1459353900,[sortings],PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Tanya and Toys,1000.0,C,1459353900,"[greedy, implementation]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Bicycle Race,1250.0,D,1459353900,"[geometry, implementation, math]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,New Reform,1500.0,E,1459353900,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Polycarp and Hay,2000.0,F,1459353900,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Fence Divercity,2500.0,G,1459353900,"[combinatorics, dp]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Displayed Friends,500.0,A,1459182900,[implementation],PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Forgotten Tree 3,750.0,B,1459182900,"[constructive algorithms, graphs, trees]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Polynomials,1000.0,C,1459182900,"[hashing, implementation, math]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Contribution,1500.0,D,1459182900,"[data structures, greedy, sortings]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Paradox,2000.0,E,1459182900,"[greedy, math, sortings]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Chemistry,3000.0,F,1459182900,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Forgotten Tree 3,500.0,A,1459182900,[graphs],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Polynomials,1000.0,B,1459182900,[math],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Contribution,1500.0,C,1459182900,[sortings],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Paradox,2000.0,D,1459182900,[sortings],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Chemistry,3000.0,E,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Reverse Radewoosh,500.0,A,1459182900,[implementation],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Displayed Friends,1000.0,B,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Forgotten Tree 3,1500.0,C,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Polynomials,2000.0,D,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Contribution,2500.0,E,1459182900,[],PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Любимые числа Поликарпа,500.0,A,1458975600,[constructive algorithms],PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Этажи,1000.0,B,1458975600,[constructive algorithms],PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Печать условий,1500.0,C,1458975600,"[greedy, sortings]",PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Дефрагментация памяти,2000.0,D,1458975600,"[greedy, implementation]",PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Автобус,2500.0,E,1458975600,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+652,Educational Codeforces Round 10,12,Gabriel and Caterpillar,,A,1458910800,[implementation],PROGRAMMING
+652,Educational Codeforces Round 10,12,z-sort,,B,1458910800,[sortings],PROGRAMMING
+652,Educational Codeforces Round 10,12,Foe Pairs,,C,1458910800,[two pointers],PROGRAMMING
+652,Educational Codeforces Round 10,12,Nested Segments,,D,1458910800,"[data structures, sortings]",PROGRAMMING
+652,Educational Codeforces Round 10,12,Pursuit For Artifacts,,E,1458910800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+652,Educational Codeforces Round 10,12,Ants on a Circle,,F,1458910800,"[constructive algorithms, math]",PROGRAMMING
+647,Технокубок 2016 - Ознакомительный Раунд 2,12,Оценки Васи,500.0,A,1458799200,[],PROGRAMMING
+647,Технокубок 2016 - Ознакомительный Раунд 2,12,Звёздное небо,1000.0,B,1458799200,[],PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Наибольший подъем,500.0,A,1458745200,[constructive algorithms],PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Собери стол,1000.0,B,1458745200,"[constructive algorithms, sortings]",PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Путь Робота,1500.0,C,1458745200,"[dfs and similar, graphs]",PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Собачки и миски,2000.0,D,1458745200,"[greedy, sortings]",PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Собери число,2500.0,E,1458745200,[],PROGRAMMING
+646,Технокубок 2016 - Ознакомительный Раунд 1,12,Три брата,500.0,A,1458568800,[],PROGRAMMING
+646,Технокубок 2016 - Ознакомительный Раунд 1,12,Ошибка передачи сообщения,1000.0,B,1458568800,[strings],PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Home Numbers,500.0,A,1458475200,[constructive algorithms],PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Making Genome in Berland,1000.0,B,1458475200,"[*special, dfs and similar, strings]",PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Road Improvement,1500.0,C,1458475200,"[dfs and similar, greedy, trees]",PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Three-dimensional Turtle Super Computer ,2000.0,D,1458475200,"[brute force, dfs and similar, graphs]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Three Balls,500.0,A,1458376500,"[brute force, implementation, sortings]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Compressing,1000.0,B,1458376500,"[brute force, dfs and similar, dp, strings]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Up-Down,1500.0,C,1458376500,"[brute force, implementation]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Delivery Bears,2000.0,D,1458376500,"[binary search, flows]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Forgotten Tree 2,2500.0,E,1458376500,"[dfs and similar, dsu, graphs]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Paper task,3500.0,F,1458376500,"[data structures, string suffix structures]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Move by Prime,3500.0,G,1458376500,[combinatorics],PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Amity Assessment,500.0,A,1458318900,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Mischievous Mess Makers,1000.0,B,1458318900,"[greedy, math]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, dp, graphs]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, math, number theory]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Armistice Area Apportionment,3500.0,G,1458318900,"[binary search, geometry]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Amity Assessment,500.0,A,1458318900,[],PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Mischievous Mess Makers,1000.0,B,1458318900,[],PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, graphs]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, number theory]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Armistice Area Apportionment,3500.0,G,1458318900,[geometry],PROGRAMMING
+644,CROC 2016 - Qualification,12,Parliament of Berland,500.0,A,1458118800,[constructive algorithms],PROGRAMMING
+644,CROC 2016 - Qualification,12,Processing Queries,1000.0,B,1458118800,"[data structures, two pointers]",PROGRAMMING
+644,CROC 2016 - Qualification,12,Hostname Aliases,1500.0,C,1458118800,"[binary search, data structures, sortings, strings]",PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Voting for Photos,500.0,A,1457870400,[implementation],PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Chat Order,1000.0,B,1457870400,"[binary search, data structures, sortings]",PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Promocodes with Mistakes,1500.0,C,1457870400,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Running with Obstacles,2000.0,D,1457870400,"[data structures, dp, greedy]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Watchmen,500.0,A,1457342700,"[data structures, math]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Image Preview,1000.0,B,1457342700,"[binary search, dp, two pointers]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Table Compression,1500.0,C,1457342700,"[dfs and similar, dp, dsu, graphs, greedy]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Zip-line,2000.0,D,1457342700,"[binary search, data structures, dp]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Clockwork Bomb,2500.0,E,1457342700,"[data structures, dfs and similar, dsu, trees]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Joysticks,500.0,A,1457342700,"[dp, greedy]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Beautiful Paintings,1000.0,B,1457342700,"[greedy, sortings]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Watchmen,1500.0,C,1457342700,"[data structures, geometry, implementation, sortings]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Image Preview,2000.0,D,1457342700,"[binary search, dp, two pointers]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Table Compression,2500.0,E,1457342700,"[dsu, graphs, greedy]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Interview,500.0,A,1457022900,"[brute force, implementation]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Print Check,1000.0,B,1457022900,"[constructive algorithms, implementation]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Report,1500.0,C,1457022900,"[data structures, sortings]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Messenger,2000.0,D,1457022900,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Product Sum,2500.0,E,1457022900,"[data structures, dp, geometry]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Grandma Laura and Apples,,A,1456844400,[],PROGRAMMING
+632,Educational Codeforces Round 9,12,"Alice, Bob, Two Teams",,B,1456844400,"[brute force, constructive algorithms]",PROGRAMMING
+632,Educational Codeforces Round 9,12,The Smallest String Concatenation,,C,1456844400,"[sortings, strings]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Longest Subsequence,,D,1456844400,"[brute force, math, number theory]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Thief in a Shop,,E,1456844400,"[divide and conquer, dp, fft]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Magic Matrix,,F,1456844400,"[brute force, divide and conquer, graphs, trees]",PROGRAMMING
+636,VeeRoute Marathon,12,Transfer,,A,1456765200,[*special],PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,XOR Equation,500.0,A,1456683000,"[dp, math]",PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Factory Repairs,1000.0,B,1456683000,[data structures],PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Package Delivery,1500.0,C,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Preorder Test,2000.0,D,1456683000,"[binary search, dp, trees]",PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Orchestra,2500.0,E,1456683000,[two pointers],PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Island Puzzle,3000.0,F,1456683000,"[dfs and similar, graphs, trees]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Island Puzzle,500.0,A,1456683000,"[constructive algorithms, implementation]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,XOR Equation,1000.0,B,1456683000,"[constructive algorithms, dp, implementation]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Factory Repairs,1500.0,C,1456683000,[data structures],PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Package Delivery,2000.0,D,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Preorder Test,2500.0,E,1456683000,[],PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Orchestra,3000.0,F,1456683000,[two pointers],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Orchestra,500.0,A,1456683000,"[brute force, implementation]",PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Island Puzzle,1000.0,B,1456683000,[],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,XOR Equation,1500.0,C,1456683000,[dp],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Factory Repairs,2000.0,D,1456683000,[],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Package Delivery,2500.0,E,1456683000,"[data structures, greedy]",PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Preorder Test,3000.0,F,1456683000,[],PROGRAMMING
+633,"Manthan, Codefest 16",12,Ebony and Ivory,250.0,A,1456506900,"[brute force, math, number theory]",PROGRAMMING
+633,"Manthan, Codefest 16",12,A Trivial Problem,500.0,B,1456506900,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Spy Syndrome 2,1500.0,C,1456506900,"[data structures, dp, hashing, implementation, sortings, string suffix structures, strings]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Fibonacci-ish,1750.0,D,1456506900,"[brute force, hashing, implementation, math]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Startup Funding,2500.0,E,1456506900,"[binary search, data structures, probabilities, two pointers]",PROGRAMMING
+633,"Manthan, Codefest 16",12,The Chocolate Spree,2750.0,F,1456506900,"[dfs and similar, dp, trees]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Yash And Trees,3000.0,G,1456506900,"[bitmasks, data structures, dfs and similar]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Fibonacci-ish II,3000.0,H,1456506900,"[data structures, implementation]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Far Relative’s Birthday Cake,500.0,A,1455986100,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Far Relative’s Problem,1000.0,B,1455986100,[brute force],PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Famil Door and Brackets,1750.0,C,1455986100,"[dp, strings]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Babaei and Birthday Cake,2000.0,D,1455986100,"[data structures, dp]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Famil Door and Roads,2500.0,E,1455986100,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING
+628,Educational Codeforces Round 8,12,Tennis Tournament,,A,1455894000,[implementation],PROGRAMMING
+628,Educational Codeforces Round 8,12,New Skateboard,,B,1455894000,[dp],PROGRAMMING
+628,Educational Codeforces Round 8,12,Bear and String Distance,,C,1455894000,[greedy],PROGRAMMING
+628,Educational Codeforces Round 8,12,Magic Numbers,,D,1455894000,[dp],PROGRAMMING
+628,Educational Codeforces Round 8,12,Zbazi in Zeydabad,,E,1455894000,"[data structures, implementation]",PROGRAMMING
+628,Educational Codeforces Round 8,12,Bear and Fair Set,,F,1455894000,[flows],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Again Twenty Five!,,A,1455807600,[number theory],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Moore's Law,,B,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Lucky Numbers,,C,1455807600,"[combinatorics, math]",PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Hexagons!,,D,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,A rectangle,,E,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Selection of Personnel,,F,1455807600,"[combinatorics, math]",PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Challenge Pennants,,G,1455807600,[combinatorics],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Benches,,H,1455807600,[combinatorics],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Parking Lot,,I,1455807600,[combinatorics],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Divisibility,,J,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Indivisibility,,K,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Cracking the Code,,L,1455807600,[implementation],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Turn,,M,1455807600,"[geometry, math]",PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Forecast,,N,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Arrow,,O,1455807600,[geometry],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Area of a Star,,P,1455807600,[geometry],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Pyramids,,Q,1455807600,[geometry],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Game,,R,1455807600,[games],PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Robot Sequence,500.0,A,1455384900,"[brute force, implementation]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Cards,750.0,B,1455384900,"[constructive algorithms, dp]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Block Towers,1000.0,C,1455384900,"[brute force, greedy]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Jerry's Protest,1500.0,D,1455384900,"[brute force, combinatorics, probabilities]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Simple Skewness,2000.0,E,1455384900,"[binary search, math, ternary search]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Group Projects,2500.0,F,1455384900,[dp],PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Raffles,3000.0,G,1455384900,"[data structures, greedy]",PROGRAMMING
+622,Educational Codeforces Round 7,12,Infinite Sequence,,A,1455116400,"[implementation, math]",PROGRAMMING
+622,Educational Codeforces Round 7,12,The Time,,B,1455116400,[implementation],PROGRAMMING
+622,Educational Codeforces Round 7,12,Not Equal on a Segment,,C,1455116400,"[data structures, implementation]",PROGRAMMING
+622,Educational Codeforces Round 7,12,Optimal Number Permutation,,D,1455116400,[constructive algorithms],PROGRAMMING
+622,Educational Codeforces Round 7,12,Ants in Leaves,,E,1455116400,"[dfs and similar, greedy, trees]",PROGRAMMING
+622,Educational Codeforces Round 7,12,The Sum of the k-th Powers,,F,1455116400,[math],PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,Guest From the Past,750.0,A,1454835900,"[implementation, math]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,War of the Corporations,750.0,B,1454835900,"[constructive algorithms, strings]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,K-special Tables,1000.0,C,1454835900,"[constructive algorithms, implementation]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,Finals in arithmetic,2000.0,D,1454835900,"[constructive algorithms, implementation]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,Frog Fights,3000.0,E,1454835900,"[data structures, greedy]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Graph and String,500.0,A,1454605500,"[constructive algorithms, graphs]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Array GCD,1000.0,B,1454605500,"[dp, greedy, number theory]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Electric Charges,1750.0,C,1454605500,[binary search],PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Birthday,2000.0,D,1454605500,"[greedy, probabilities]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Transforming Sequence,2250.0,E,1454605500,"[combinatorics, dp, fft]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Save Luke,500.0,A,1454605500,[math],PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Making a String,1000.0,B,1454605500,"[greedy, sortings]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Graph and String,1500.0,C,1454605500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Array GCD,2000.0,D,1454605500,"[dp, greedy, number theory]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Electric Charges,3000.0,E,1454605500,[],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Odd and Even,500.0,A,1454249100,[implementation],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Bishops,1000.0,B,1454249100,[combinatorics],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Flowers,1500.0,C,1454249100,[probabilities],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Rat Kwesh and Cheese,2000.0,D,1454249100,"[brute force, math]",PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Blocks,2500.0,E,1454249100,"[dp, matrices]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Slime Combining,500.0,A,1454087400,[implementation],PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Guess the Permutation,1000.0,B,1454087400,[constructive algorithms],PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Constellation,1500.0,C,1454087400,"[geometry, implementation]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Hamiltonian Spanning Tree,1750.0,D,1454087400,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Robot Arm,2500.0,E,1454087400,[data structures],PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Double Knapsack,2750.0,F,1454087400,"[constructive algorithms, two pointers]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Combining Slimes,3500.0,G,1454087400,"[dp, matrices, probabilities]",PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Elephant,500.0,A,1453563300,[math],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Chocolate,1000.0,B,1453563300,[combinatorics],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Watering Flowers,1250.0,C,1453563300,[implementation],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Polyline,1750.0,D,1453563300,[constructive algorithms],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,XOR and Favorite Number,2750.0,E,1453563300,[data structures],PROGRAMMING
+620,Educational Codeforces Round 6,12,Professor GukiZ's Robot,,A,1453388400,"[implementation, math]",PROGRAMMING
+620,Educational Codeforces Round 6,12,Grandfather Dovlet’s calculator,,B,1453388400,[implementation],PROGRAMMING
+620,Educational Codeforces Round 6,12,Pearls in a Row,,C,1453388400,[greedy],PROGRAMMING
+620,Educational Codeforces Round 6,12,Professor GukiZ and Two Arrays,,D,1453388400,"[binary search, two pointers]",PROGRAMMING
+620,Educational Codeforces Round 6,12,New Year Tree,,E,1453388400,"[bitmasks, data structures]",PROGRAMMING
+620,Educational Codeforces Round 6,12,Xors on Segments,,F,1453388400,[data structures],PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Peter and Snow Blower,750.0,A,1452789300,"[binary search, geometry, ternary search]",PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Skills,1250.0,B,1452789300,"[binary search, brute force, two pointers]",PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Necklace,1250.0,C,1452789300,[constructive algorithms],PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Kingdom and its Cities,2000.0,D,1452789300,"[dfs and similar, divide and conquer, graphs, sortings, trees]",PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Puzzle Lover,2500.0,E,1452789300,"[dp, hashing, strings]",PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Link/Cut Tree,500.0,A,1452789300,[brute force],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Gena's Code,1000.0,B,1452789300,[implementation],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Peter and Snow Blower,1750.0,C,1452789300,[],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Skills,2250.0,D,1452789300,[],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Necklace,2250.0,E,1452789300,[],PROGRAMMING
+616,Educational Codeforces Round 5,12,Comparing Two Long Integers,,A,1452524400,"[implementation, strings]",PROGRAMMING
+616,Educational Codeforces Round 5,12,Dinner with Emma,,B,1452524400,"[games, greedy]",PROGRAMMING
+616,Educational Codeforces Round 5,12,The Labyrinth,,C,1452524400,[dfs and similar],PROGRAMMING
+616,Educational Codeforces Round 5,12,Longest k-Good Segment,,D,1452524400,"[binary search, data structures, two pointers]",PROGRAMMING
+616,Educational Codeforces Round 5,12,Sum of Remainders,,E,1452524400,"[implementation, math, number theory]",PROGRAMMING
+616,Educational Codeforces Round 5,12,Expensive Strings,,F,1452524400,"[string suffix structures, strings]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Bulbs,500.0,A,1452261900,[implementation],PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Longtail Hedgehog,1250.0,B,1452261900,"[dp, graphs]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Running Track,1750.0,C,1452261900,"[dp, greedy, strings, trees]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Multipliers,2000.0,D,1452261900,"[math, number theory]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Hexagons,2500.0,E,1452261900,"[binary search, implementation, math]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Days,500.0,A,1451487900,[implementation],PROGRAMMING
+611,Good Bye 2015,12,New Year and Old Property,750.0,B,1451487900,"[brute force, implementation]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Domino,1250.0,C,1451487900,"[dp, implementation]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Ancient Prophecy,1750.0,D,1451487900,"[hashing, strings]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Three Musketeers,2500.0,E,1451487900,"[data structures, greedy]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Cleaning,2500.0,F,1451487900,"[binary search, implementation]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Cake,3000.0,G,1451487900,"[geometry, two pointers]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Forgotten Tree,3500.0,H,1451487900,"[constructive algorithms, flows]",PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Pasha and Stick,500.0,A,1451215200,"[combinatorics, math]",PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Vika and Squares,1000.0,B,1451215200,[implementation],PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Harmony Analysis,1500.0,C,1451215200,[constructive algorithms],PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Vika and Segments,2500.0,D,1451215200,"[data structures, geometry, two pointers]",PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Alphabet Permutations,2500.0,E,1451215200,"[data structures, strings]",PROGRAMMING
+612,Educational Codeforces Round 4,12,The Text Splitting,,A,1451055600,"[brute force, implementation, strings]",PROGRAMMING
+612,Educational Codeforces Round 4,12,HDD is Outdated Technology,,B,1451055600,[implementation],PROGRAMMING
+612,Educational Codeforces Round 4,12,Replace To Make Regular Bracket Sequence,,C,1451055600,"[data structures, expression parsing, math]",PROGRAMMING
+612,Educational Codeforces Round 4,12,The Union of k-Segments,,D,1451055600,[sortings],PROGRAMMING
+612,Educational Codeforces Round 4,12,Square Root of Permutation,,E,1451055600,"[combinatorics, constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+612,Educational Codeforces Round 4,12,Simba on the Circle,,F,1451055600,[dp],PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Chain Reaction,500.0,A,1450888500,"[binary search, dp]",PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Zuma,1250.0,B,1450888500,[dp],PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Marbles,1500.0,C,1450888500,"[hashing, strings]",PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Power Tree,2000.0,D,1450888500,[data structures],PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Cross Sum,3000.0,E,1450888500,"[binary search, geometry]",PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Saitama Destroys Hotel,500.0,A,1450888500,"[implementation, math]",PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Hamming Distance Sum,1000.0,B,1450888500,[combinatorics],PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Chain Reaction,1500.0,C,1450888500,[dp],PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Zuma,2250.0,D,1450888500,[],PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Marbles,2500.0,E,1450888500,[],PROGRAMMING
+609,Educational Codeforces Round 3,12,USB Flash Drives,,A,1450537200,"[greedy, implementation, sortings]",PROGRAMMING
+609,Educational Codeforces Round 3,12,The Best Gift,,B,1450537200,[implementation],PROGRAMMING
+609,Educational Codeforces Round 3,12,Load Balancing,,C,1450537200,[implementation],PROGRAMMING
+609,Educational Codeforces Round 3,12,Gadgets for dollars and pounds,,D,1450537200,"[binary search, two pointers]",PROGRAMMING
+609,Educational Codeforces Round 3,12,Minimum spanning tree for each edge,,E,1450537200,"[data structures, dfs and similar, dsu, graphs, trees]",PROGRAMMING
+609,Educational Codeforces Round 3,12,Frogs and mosquitoes,,F,1450537200,[data structures],PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Sorting Railway Cars,500.0,A,1449677100,"[constructive algorithms, greedy]",PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Lazy Student,1000.0,B,1449677100,"[constructive algorithms, data structures, graphs]",PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Freelancer's Dreams,1500.0,C,1449677100,[geometry],PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Board Game,2000.0,D,1449677100,"[data structures, dfs and similar]",PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Intergalaxy Trips,2500.0,E,1449677100,"[probabilities, shortest paths]",PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Magic Spheres,500.0,A,1449677100,[implementation],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Testing Robots,1000.0,B,1449677100,[implementation],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Sorting Railway Cars,1500.0,C,1449677100,[],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Lazy Student,2000.0,D,1449677100,[graphs],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Freelancer's Dreams,2500.0,E,1449677100,[],PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Alternative Thinking,500.0,A,1448984100,"[dp, greedy]",PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Moodular Arithmetic,1000.0,B,1448984100,"[dfs and similar, dsu, math, number theory]",PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Lieges of Legendre,1500.0,C,1448984100,[games],PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Ruminations on Ruminants,2000.0,D,1448984100,"[geometry, math]",PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Pastoral Oddities,3000.0,E,1448984100,"[data structures, divide and conquer, dsu, trees]",PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Uncowed Forces,500.0,A,1448984100,[implementation],PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,More Cowbell,1000.0,B,1448984100,"[binary search, greedy]",PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Alternative Thinking,1500.0,C,1448984100,"[constructive algorithms, dp, math]",PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Moodular Arithmetic,2000.0,D,1448984100,[dsu],PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Lieges of Legendre,2500.0,E,1448984100,[],PROGRAMMING
+600,Educational Codeforces Round 2,12,Extract Numbers,,A,1448636400,[implementation],PROGRAMMING
+600,Educational Codeforces Round 2,12,Queries about less or equal elements,,B,1448636400,"[binary search, sortings, two pointers]",PROGRAMMING
+600,Educational Codeforces Round 2,12,Make Palindrome,,C,1448636400,[greedy],PROGRAMMING
+600,Educational Codeforces Round 2,12,Area of Two Circles' Intersection,,D,1448636400,[geometry],PROGRAMMING
+600,Educational Codeforces Round 2,12,Lomsat gelral,,E,1448636400,"[dfs and similar, dsu, trees]",PROGRAMMING
+600,Educational Codeforces Round 2,12,Edge coloring of bipartite graph,,F,1448636400,[graphs],PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,The Two Routes,500.0,A,1448382900,"[graphs, shortest paths]",PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,Lipshitz Sequence,1250.0,B,1448382900,[data structures],PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,Kleofáš and the n-thlon,1250.0,C,1448382900,"[dp, probabilities]",PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,Acyclic Organic Compounds,2000.0,D,1448382900,"[data structures, dfs and similar, dsu, hashing, trees]",PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,A Museum Robbery,2500.0,E,1448382900,"[data structures, dp]",PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Two Bases,500.0,A,1448382900,[implementation],PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Approximating a Constant Range,1000.0,B,1448382900,"[dp, two pointers]",PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,The Two Routes,1500.0,C,1448382900,[],PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Lipshitz Sequence,2250.0,D,1448382900,[],PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Kleofáš and the n-thlon,2250.0,E,1448382900,[probabilities],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Patrick and Shopping,500.0,A,1448037300,[implementation],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Spongebob and Joke,1000.0,B,1448037300,[implementation],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Day at the Beach,1500.0,C,1448037300,[sortings],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Spongebob and Squares,2000.0,D,1448037300,"[brute force, math]",PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Sandy and Nuts,3000.0,E,1448037300,"[bitmasks, dp]",PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Swimming Pool,500.0,A,1447605300,[implementation],PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Array,1000.0,B,1447605300,[greedy],PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Points,1500.0,C,1447605300,"[greedy, sortings]",PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Trees,2250.0,D,1447605300,"[dp, probabilities, sortings]",PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Strings,2500.0,E,1447605300,"[dfs and similar, dp, graphs]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Tricky Sum,,A,1447426800,[math],PROGRAMMING
+598,Educational Codeforces Round 1,12,Queries on a String,,B,1447426800,"[implementation, strings]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Nearest vectors,,C,1447426800,"[geometry, sortings]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Igor In the Museum,,D,1447426800,[dfs and similar],PROGRAMMING
+598,Educational Codeforces Round 1,12,Chocolate Bar,,E,1447426800,"[brute force, dp]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Cut Length,,F,1447426800,[geometry],PROGRAMMING
+597,Testing Round #12,12,Divisibility,500.0,A,1447264800,[math],PROGRAMMING
+597,Testing Round #12,12,Restaurant,1000.0,B,1447264800,"[dp, greedy, sortings]",PROGRAMMING
+597,Testing Round #12,12,Subsequences,1500.0,C,1447264800,"[data structures, dp]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Warrior and Archer,500.0,A,1447000200,[games],PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Max and Bike,1000.0,B,1447000200,"[binary search, geometry]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Edo and Magnets,1500.0,C,1447000200,"[brute force, two pointers]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,REQ,2000.0,D,1447000200,"[data structures, number theory]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Cutting the Line,3000.0,E,1447000200,"[string suffix structures, strings]",PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Vitaly and Night,500.0,A,1447000200,[implementation],PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Pasha and Phone,1000.0,B,1447000200,"[binary search, math]",PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Warrior and Archer,1500.0,C,1447000200,[games],PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Max and Bike,2000.0,D,1447000200,[],PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Edo and Magnets,2500.0,E,1447000200,[],PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,2Char,250.0,A,1446655500,[brute force],PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Anton and Lines,1000.0,B,1446655500,"[geometry, sortings]",PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Beautiful Function,3000.0,C,1446655500,"[constructive algorithms, math]",PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Happy Tree Party,3000.0,D,1446655500,"[data structures, trees]",PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Strange Calculation and Cats,3000.0,E,1446655500,"[dp, matrices]",PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,PawnChess,500.0,A,1446309000,[implementation],PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,The Monster and the Squirrel,1000.0,B,1446309000,[math],PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,The Big Race,1500.0,C,1446309000,[math],PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,Super M,2000.0,D,1446309000,"[dfs and similar, dp, trees]",PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,BCPC,3000.0,E,1446309000,"[binary search, geometry, two pointers]",PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Median Smoothing,750.0,A,1445763600,[],PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Chip 'n Dale Rescue Rangers,1000.0,B,1445763600,"[binary search, geometry, math]",PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Three States,1250.0,C,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Top Secret Task,1750.0,D,1445763600,[dp],PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Birthday,2500.0,E,1445763600,"[graph matchings, strings]",PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Wizards' Duel,500.0,A,1445763600,[math],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Rebranding,1000.0,B,1445763600,[implementation],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Median Smoothing,1750.0,C,1445763600,[constructive algorithms],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Chip 'n Dale Rescue Rangers,2000.0,D,1445763600,[],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Three States,2250.0,E,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Email Aliases,,A,1445068800,[implementation],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Layer Cake,,B,1445068800,[sortings],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Polycarp's Masterpiece,,C,1445068800,"[data structures, divide and conquer, dp]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Boulevard,,D,1445068800,"[brute force, implementation]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Training with Doors,,E,1445068800,[],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Gourmet and Banquet,,F,1445068800,"[binary search, flows, greedy]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Hiring,,G,1445068800,"[binary search, data structures]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Tourist Guide,,H,1445068800,[dfs and similar],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lottery,,I,1445068800,[implementation],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Cleaner Robot,,J,1445068800,"[dfs and similar, implementation]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Task processing,,K,1445068800,"[brute force, math]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Agricultural Archaeology,,L,1445068800,"[greedy, math]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Taxi in Berland,,M,1445068800,[shortest paths],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff and Weight Lifting,500.0,A,1444926600,[greedy],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff in Beach,1000.0,B,1444926600,[dp],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff in the Army,1500.0,C,1444926600,"[data structures, trees]",PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff in Mafia,2000.0,D,1444926600,"[2-sat, binary search]",PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff as a Queen,2750.0,E,1444926600,[data structures],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff is Mad,2750.0,F,1444926600,"[data structures, strings]",PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff and Meat,750.0,A,1444926600,[greedy],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in Love,1000.0,B,1444926600,[math],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff and Weight Lifting,1500.0,C,1444926600,[],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in Beach,2000.0,D,1444926600,[],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in the Army,2500.0,E,1444926600,"[data structures, dfs and similar, trees]",PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in Mafia,3000.0,F,1444926600,[],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Gennady the Dentist,500.0,A,1444641000,"[brute force, implementation]",PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Phillip and Trains,750.0,B,1444641000,[dfs and similar],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,"Alice, Bob, Oranges and Apples",1250.0,C,1444641000,[number theory],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Lizard Era: Beginning,1750.0,D,1444641000,[meet-in-the-middle],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Present for Vitalik the Philatelist ,2250.0,E,1444641000,"[combinatorics, math, number theory]",PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Digits of Number Pi,3000.0,F,1444641000,"[dp, implementation, strings]",PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Alena's Schedule,500.0,A,1444641000,[implementation],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Laurenty and Shop,1000.0,B,1444641000,[implementation],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Gennady the Dentist,1500.0,C,1444641000,[implementation],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Phillip and Trains,1750.0,D,1444641000,[dp],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,"Alice, Bob, Oranges and Apples",2250.0,E,1444641000,[number theory],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Lizard Era: Beginning,2750.0,F,1444641000,[meet-in-the-middle],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Olesya and Rodion,500.0,A,1444149000,[math],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Kolya and Tanya ,1000.0,B,1444149000,[combinatorics],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Marina and Vasya,1500.0,C,1444149000,"[constructive algorithms, greedy]",PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Dima and Lisa,2000.0,D,1444149000,[number theory],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Anton and Ira,2500.0,E,1444149000,"[constructive algorithms, greedy]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,GCD Table,750.0,A,1443890700,"[constructive algorithms, greedy]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Once Again...,1250.0,B,1443890700,"[dp, matrices]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Superior Periodic Subarrays,1500.0,C,1443890700,[number theory],PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Number of Binominal Coefficients,2250.0,D,1443890700,"[dp, number theory]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Boolean Function,2500.0,E,1443890700,"[bitmasks, dp, expression parsing]",PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Asphalting Roads,500.0,A,1443890700,[implementation],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Robot's Task,1000.0,B,1443890700,[implementation],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,GCD Table,1750.0,C,1443890700,[],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Once Again...,2250.0,D,1443890700,[],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Superior Periodic Subarrays,2500.0,E,1443890700,[number theory],PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Vasya the Hipster,500.0,A,1443430800,[implementation],PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Luxurious Houses,1000.0,B,1443430800,[implementation],PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Developing Skills,1500.0,C,1443430800,"[implementation, sortings]",PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Three Logos,2000.0,D,1443430800,"[bitmasks, brute force, constructive algorithms, implementation, math]",PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Kojiro and Furrari,3000.0,E,1443430800,"[dp, greedy]",PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Zublicanes and Mumocrates,3000.0,F,1443430800,"[dp, trees, two pointers]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and First Steps,750.0,A,1442939400,"[brute force, dp, implementation]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Company,1250.0,B,1442939400,"[binary search, sortings, two pointers]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Park,1500.0,C,1442939400,"[dfs and similar, trees]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Dishes,2000.0,D,1442939400,"[bitmasks, dp]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Watch,2500.0,E,1442939400,"[data structures, hashing, strings]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,A Problem about Polyline,250.0,A,1442416500,"[geometry, math]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,"""Or"" Game",500.0,B,1442416500,"[brute force, greedy]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Weakness and Poorness,750.0,C,1442416500,[ternary search],PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,LCS Again,2500.0,D,1442416500,"[dp, greedy]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Walking!,2750.0,E,1442416500,"[constructive algorithms, greedy]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Mirror Box,3000.0,F,1442416500,"[matrices, trees]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Raising Bacteria,250.0,A,1442416500,[bitmasks],PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Finding Team Member,500.0,B,1442416500,"[brute force, implementation, sortings]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,A Problem about Polyline,1250.0,C,1442416500,"[binary search, math]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,"""Or"" Game",2000.0,D,1442416500,"[brute force, greedy, math]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Weakness and Poorness,3000.0,E,1442416500,[ternary search],PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,LCS Again,3000.0,F,1442416500,[],PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Vasya and Petya's Game,500.0,A,1441902600,"[math, number theory]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Invariance of Tree,1250.0,B,1441902600,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Points on Plane,1250.0,C,1441902600,"[constructive algorithms, divide and conquer, geometry, greedy, sortings]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Flights for Regular Customers,2000.0,D,1441902600,"[dp, matrices]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Painting Edges,2750.0,E,1441902600,"[binary search, data structures]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Multiplication Table,500.0,A,1441902600,"[implementation, number theory]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Modulo Sum,1250.0,B,1441902600,"[combinatorics, data structures, dp, two pointers]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Vasya and Petya's Game,1500.0,C,1441902600,"[implementation, number theory]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Invariance of Tree,2250.0,D,1441902600,[],PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Points on Plane,2250.0,E,1441902600,[constructive algorithms],PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Fibonotci,,A,1441526400,"[math, matrices]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Bribes,,B,1441526400,"[dfs and similar, trees]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Party,,C,1441526400,"[bitmasks, brute force, graph matchings]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Tablecity,,D,1441526400,[constructive algorithms],PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Spectator Riots,,E,1441526400,[geometry],PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Bulbo,,F,1441526400,"[dp, greedy]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Run for beer,,G,1441526400,"[dfs and similar, shortest paths]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Bots,,H,1441526400,"[combinatorics, number theory]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Robots protection,,I,1441526400,[data structures],PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Poker,500.0,A,1440865800,"[implementation, number theory]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Blocks,1000.0,B,1440865800,"[binary search, data structures, dp]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Drawing,1750.0,C,1440865800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Cavalry,2000.0,D,1440865800,"[data structures, divide and conquer, dp]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Bowling,2500.0,E,1440865800,[greedy],PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Elections,500.0,A,1440865800,[implementation],PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Three Musketeers,1000.0,B,1440865800,"[brute force, dfs and similar, graphs, hashing]",PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Poker,1500.0,C,1440865800,[number theory],PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Blocks,2000.0,D,1440865800,"[data structures, dp, shortest paths]",PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Drawing,2750.0,E,1440865800,[],PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Lengthening Sticks,750.0,A,1440261000,"[combinatorics, implementation, math]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Minimization,1250.0,B,1440261000,"[dp, greedy, sortings]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,CNF 2,1500.0,C,1440261000,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Campus,2000.0,D,1440261000,"[binary search, data structures, dsu, trees]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Geometric Progressions,2750.0,E,1440261000,[math],PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Arrays,500.0,A,1440261000,[sortings],PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Order Book,1000.0,B,1440261000,"[data structures, greedy, implementation, sortings]",PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Lengthening Sticks,1750.0,C,1440261000,"[brute force, combinatorics, dp, math]",PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Minimization,2250.0,D,1440261000,"[dp, sortings]",PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,CNF 2,2500.0,E,1440261000,[],PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Elections,500.0,A,1439483400,[implementation],PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Simple Game,1000.0,B,1439483400,"[constructive algorithms, games, greedy, implementation, math]",PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Replacement,1500.0,C,1439483400,"[constructive algorithms, data structures, implementation]",PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Tree Requests,2000.0,D,1439483400,"[binary search, constructive algorithms, dfs and similar, trees]",PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Pig and Palindromes,2500.0,E,1439483400,"[combinatorics, dp]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Primes or Palindromes?,500.0,A,1439224200,"[brute force, implementation, math, number theory]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Symmetric and Transitive,1000.0,B,1439224200,"[combinatorics, dp, math]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,New Language,1500.0,C,1439224200,"[2-sat, greedy]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Sign Posts,2250.0,D,1439224200,"[brute force, math]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Longest Increasing Subsequence,2500.0,E,1439224200,"[data structures, dp]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Music,500.0,A,1439224200,"[implementation, math]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Inventory,1000.0,B,1439224200,[greedy],PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Primes or Palindromes?,1500.0,C,1439224200,"[binary search, brute force, number theory]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Symmetric and Transitive,2250.0,D,1439224200,"[brute force, dp, math]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,New Language,2750.0,E,1439224200,[],PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Lineland Mail,500.0,A,1438790400,[implementation],PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Berland National Library,1000.0,B,1438790400,[implementation],PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Geometric Progression,1500.0,C,1438790400,"[binary search, data structures, dp]",PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,One-Dimensional Battle Ships,2000.0,D,1438790400,"[binary search, data structures, sortings]",PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,President and Roads,2500.0,E,1438790400,"[dfs and similar, graphs, hashing, shortest paths]",PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Mausoleum,2500.0,F,1438790400,[dp],PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Matching Names,1750.0,A,1438273200,"[dfs and similar, strings, trees]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Replicating Processes,2500.0,B,1438273200,"[constructive algorithms, greedy]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Logistical Questions,3000.0,C,1438273200,"[dfs and similar, divide and conquer, trees]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Restructuring Company,1000.0,D,1438273200,"[data structures, dsu]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Restoring Map,3000.0,E,1438273200,"[bitmasks, constructive algorithms, trees]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Clique in the Divisibility Graph,500.0,F,1438273200,"[dp, math, number theory]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Max and Min,2500.0,G,1438273200,[geometry],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Logistical Questions,1500.0,A,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Clique in the Divisibility Graph,250.0,B,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Restoring Map,2250.0,C,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Restructuring Company,250.0,D,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Max and Min,500.0,E,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Matching Names,250.0,F,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Replicating Processes,500.0,G,1437898500,[],PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Gerald's Hexagon,500.0,A,1437573600,"[brute force, geometry, math]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Equivalent Strings,1000.0,B,1437573600,"[divide and conquer, hashing, sortings, strings]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Gerald and Giant Chess,1500.0,C,1437573600,"[combinatorics, dp, math, number theory]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Randomizer,2250.0,D,1437573600,"[combinatorics, geometry, probabilities]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Gerald and Path,2250.0,E,1437573600,"[dp, sortings]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Currency System in Geraldion,500.0,A,1437573600,"[geometry, implementation, sortings]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Gerald is into Art,1000.0,B,1437573600,"[constructive algorithms, implementation]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Gerald's Hexagon,1500.0,C,1437573600,[geometry],PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Equivalent Strings,2000.0,D,1437573600,"[hashing, implementation, strings]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Gerald and Giant Chess,2500.0,E,1437573600,"[combinatorics, dp]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Lala Land and Apple Trees,500.0,A,1436886600,"[brute force, implementation, sortings]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Amr and The Large Array,1000.0,B,1436886600,[implementation],PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Amr and Chemistry,1500.0,C,1436886600,"[brute force, greedy]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Guess Your Way Out! II,2250.0,D,1436886600,"[data structures, implementation, sortings]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,A Simple Task,2500.0,E,1436886600,"[data structures, sortings, strings]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Ilya and Diplomas,500.0,A,1435676400,"[greedy, implementation]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Pasha and Tea,1000.0,B,1435676400,"[implementation, sortings]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Arthur and Table,1500.0,C,1435676400,"[brute force, data structures, dp, greedy]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Vitaly and Cycle,2000.0,D,1435676400,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Ann and Half-Palindrome,2500.0,E,1435676400,"[data structures, dp, string suffix structures, strings, trees]",PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Matryoshkas,250.0,A,1435414200,[implementation],PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Fugitive,750.0,B,1435414200,"[data structures, greedy, sortings]",PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Chocolate,1250.0,C,1435414200,[data structures],PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of a Top Secret,2000.0,D,1435414200,"[binary search, implementation, math]",PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Computer Network,3000.0,E,1435414200,"[dfs and similar, graphs, trees]",PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of the Zeros and Ones,250.0,A,1435414200,[greedy],PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Fake Numbers,250.0,B,1435414200,"[brute force, implementation]",PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Matryoshkas,1000.0,C,1435414200,[implementation],PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Fugitive,3000.0,D,1435414200,"[binary search, data structures, greedy]",PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Chocolate,3000.0,E,1435414200,"[binary search, data structures]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Kyoya and Colored Balls,250.0,A,1435163400,"[combinatorics, dp, math]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Kyoya and Permutation,500.0,B,1435163400,"[binary search, combinatorics, constructive algorithms, implementation, math]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Love Triangles,1000.0,C,1435163400,"[dfs and similar, dsu, graphs]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Nudist Beach,1500.0,D,1435163400,"[binary search, graphs, greedy]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Kyoya and Train,3000.0,E,1435163400,"[dp, fft, probabilities]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Kyoya and Photobooks,250.0,A,1435163400,"[brute force, math]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Ohana Cleans Up,500.0,B,1435163400,"[brute force, strings]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Kyoya and Colored Balls,1500.0,C,1435163400,"[combinatorics, dp, math]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Kyoya and Permutation,3000.0,D,1435163400,[math],PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Love Triangles,3000.0,E,1435163400,"[dfs and similar, dsu]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Table,500.0,A,1434645000,"[implementation, math]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Books,1000.0,B,1434645000,"[implementation, math]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Scales,1500.0,C,1434645000,"[brute force, dp, greedy, math, meet-in-the-middle]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Triangles,2000.0,D,1434645000,"[brute force, combinatorics, data structures, geometry, math, sortings]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Brackets,2500.0,E,1434645000,"[brute force, dp, expression parsing, greedy, implementation]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ and Contest,500.0,A,1434127500,"[implementation, sortings]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,ZgukistringZ,1250.0,B,1434127500,"[brute force, constructive algorithms, implementation, strings]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ hates Boxes,1750.0,C,1434127500,"[binary search, greedy]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ and Binary Operations,2000.0,D,1434127500,"[combinatorics, math, matrices, number theory]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ and GukiZiana,2500.0,E,1434127500,"[binary search, data structures]",PROGRAMMING
+549,Looksery Cup 2015,12,Face Detection,250.0,A,1433595600,[implementation],PROGRAMMING
+549,Looksery Cup 2015,12,Looksery Party,1750.0,B,1433595600,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING
+549,Looksery Cup 2015,12,The Game Of Parity,2000.0,C,1433595600,[games],PROGRAMMING
+549,Looksery Cup 2015,12,Haar Features,1000.0,D,1433595600,"[greedy, implementation]",PROGRAMMING
+549,Looksery Cup 2015,12,Sasha Circle,3000.0,E,1433595600,[math],PROGRAMMING
+549,Looksery Cup 2015,12,Yura and Developers,3000.0,F,1433595600,"[data structures, divide and conquer]",PROGRAMMING
+549,Looksery Cup 2015,12,Happy Line,1500.0,G,1433595600,"[greedy, sortings]",PROGRAMMING
+549,Looksery Cup 2015,12,Degenerate Matrix,1500.0,H,1433595600,"[binary search, math]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Two Substrings,1000.0,A,1433435400,"[brute force, dp, implementation, strings]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Preparing Olympiad,750.0,B,1433435400,"[bitmasks, brute force]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Divisibility by Eight,1000.0,C,1433435400,"[brute force, dp, math]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Regular Bridge,2000.0,D,1433435400,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Brackets in Implications,3000.0,E,1433435400,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Frog,750.0,A,1432658100,"[brute force, implementation, math]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Feet,1000.0,B,1432658100,"[binary search, data structures, dp, dsu]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Foam,1750.0,C,1432658100,"[bitmasks, number theory]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Fish,1750.0,D,1432658100,"[dfs and similar, graphs]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Friends,2500.0,E,1432658100,"[data structures, string suffix structures, strings]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Fax,500.0,A,1432658100,"[brute force, implementation]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Fun,1000.0,B,1432658100,"[brute force, greedy, implementation]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Frog,1750.0,C,1432658100,[number theory],PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Feet,2000.0,D,1432658100,"[binary search, data structures]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Foam,2750.0,E,1432658100,[number theory],PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Bananas,500.0,A,1432312200,"[implementation, math]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Badges,1000.0,B,1432312200,"[brute force, greedy, implementation, sortings]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Cards,1250.0,C,1432312200,"[brute force, dfs and similar]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Number Game,1500.0,D,1432312200,"[constructive algorithms, dp, math, number theory]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Traveling,2250.0,E,1432312200,"[flows, math]",PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Toy Cars,500.0,A,1432053000,[implementation],PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Equidistant String,1000.0,B,1432053000,[greedy],PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Woodcutters,1750.0,C,1432053000,"[dp, greedy]",PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Queue,1750.0,D,1432053000,"[greedy, implementation, sortings]",PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Paths and Trees,2500.0,E,1432053000,"[graphs, greedy, shortest paths]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Writing Code,500.0,A,1431016200,[dp],PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Destroying Roads,1000.0,B,1431016200,"[graphs, shortest paths]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Remembering Strings,1750.0,C,1431016200,"[bitmasks, dp]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Road Improvement,1750.0,D,1431016200,"[dp, trees]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Listening to Music,2500.0,E,1431016200,"[constructive algorithms, data structures]",PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Set of Strings,500.0,A,1431016200,[implementation],PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Sea and Islands,1000.0,B,1431016200,"[constructive algorithms, implementation]",PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Writing Code,1500.0,C,1431016200,[dp],PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Destroying Roads,2000.0,D,1431016200,"[brute force, graphs, shortest paths]",PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Remembering Strings,2750.0,E,1431016200,"[bitmasks, dp]",PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Place Your Ad Here,750.0,A,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Duck Hunt,3000.0,B,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Idempotent functions,250.0,C,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Superhero's Job,1250.0,D,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Playing on Graph,750.0,E,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Quest,500.0,F,1430668800,[],PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Place Your Ad Here,2000.0,A,1430668800,"[data structures, sortings]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Duck Hunt,3000.0,B,1430668800,[data structures],PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Idempotent functions,750.0,C,1430668800,"[constructive algorithms, graphs, math]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Superhero's Job,2250.0,D,1430668800,"[dfs and similar, dp, hashing, math, number theory]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Playing on Graph,2250.0,E,1430668800,"[graphs, shortest paths]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Quest,1000.0,F,1430668800,"[dp, greedy]",PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Combination Lock,500.0,A,1430411400,[implementation],PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,School Marks,1000.0,B,1430411400,"[greedy, implementation]",PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Ice Cave,1500.0,C,1430411400,[dfs and similar],PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Bad Luck Island,2000.0,D,1430411400,"[dp, probabilities]",PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Infinite Inversions,2500.0,E,1430411400,"[binary search, data structures, implementation, sortings, trees]",PROGRAMMING
+538,Codeforces Round #300,12,Cutting Banner,500.0,A,1430064000,"[brute force, implementation]",PROGRAMMING
+538,Codeforces Round #300,12,Quasi Binary,1000.0,B,1430064000,"[constructive algorithms, dp, greedy, implementation]",PROGRAMMING
+538,Codeforces Round #300,12,Tourist's Notes,1500.0,C,1430064000,"[binary search, brute force, greedy, implementation, math]",PROGRAMMING
+538,Codeforces Round #300,12,Weird Chess,1500.0,D,1430064000,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+538,Codeforces Round #300,12,Demiurges Play Again,2000.0,E,1430064000,"[dfs and similar, dp, math, trees]",PROGRAMMING
+538,Codeforces Round #300,12,A Heap of Heaps,2500.0,F,1430064000,"[brute force, data structures, math, sortings]",PROGRAMMING
+538,Codeforces Round #300,12,Berserk Robot ,3000.0,G,1430064000,"[constructive algorithms, math, sortings]",PROGRAMMING
+538,Codeforces Round #300,12,Summer Dichotomy,3000.0,H,1430064000,"[2-sat, data structures, dfs and similar, greedy]",PROGRAMMING
+537,VK Cup 2015 - Wild Card Round 2,12,Antiplagiarism,,A,1429381800,[*special],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Berland Miners,3000.0,A,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Work Group,500.0,B,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Board Game,250.0,C,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Landmarks,3000.0,D,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Correcting Mistakes,500.0,E,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Encoding,1250.0,F,1429286400,[],PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Berland Miners,3000.0,A,1429286400,"[binary search, data structures, dfs and similar, greedy, trees]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Work Group,750.0,B,1429286400,"[dfs and similar, dp, graphs, strings, trees]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Board Game,250.0,C,1429286400,"[games, greedy, implementation, math]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Landmarks,3000.0,D,1429286400,[data structures],PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Correcting Mistakes,500.0,E,1429286400,"[constructive algorithms, dp, greedy, hashing, strings, two pointers]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Encoding,1500.0,F,1429286400,"[hashing, string suffix structures, strings]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Nafas,500.0,A,1429029300,[implementation],PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and SaDDas,1000.0,B,1429029300,"[bitmasks, brute force, implementation]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Karafs,1500.0,C,1429029300,"[binary search, math]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Malekas,2000.0,D,1429029300,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Pashmaks,2500.0,E,1429029300,[geometry],PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas and Karafs,500.0,A,1429029300,"[binary search, math]",PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas and Malekas,1000.0,B,1429029300,"[hashing, string suffix structures, strings]",PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas and Pashmaks,1500.0,C,1429029300,[geometry],PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas in Kansas,2000.0,D,1429029300,"[dp, games]",PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas on the Path,2500.0,E,1429029300,"[data structures, divide and conquer, trees]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Exam,500.0,A,1428854400,"[constructive algorithms, implementation]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Covered Path,1000.0,B,1428854400,"[dp, greedy, math]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Polycarpus' Dice,1500.0,C,1428854400,[math],PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Handshakes,2000.0,D,1428854400,"[binary search, constructive algorithms, data structures, greedy]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Berland Local Positioning System,2500.0,E,1428854400,"[constructive algorithms, greedy, hashing, implementation]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Simplified Nonogram,3000.0,F,1428854400,"[bitmasks, dp, hashing, meet-in-the-middle]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,King of Thieves,500.0,A,1428165300,"[brute force, implementation]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Om Nom and Dark Park,500.0,B,1428165300,"[dfs and similar, greedy, implementation]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Om Nom and Candies,1250.0,C,1428165300,"[brute force, greedy, math]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Om Nom and Necklace,1750.0,D,1428165300,"[hashing, string suffix structures, strings]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Transmitting Levels,2250.0,E,1428165300,"[dp, implementation]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Pudding Monsters,3000.0,F,1428165300,"[data structures, divide and conquer]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Spiders Evil Plan,3000.0,G,1428165300,"[greedy, trees]",PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,String inside out,,B,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Set subtraction,,D,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Sum and product,,E,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Points in triangle,,H,1427562000,"[*special, geometry]",PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Different variables,,I,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,String inside out,,B,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Set subtraction,,D,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Sum and product,,E,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Points in triangle,,H,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Different variables,,I,1427562000,[*special],PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Vitaliy and Pie,250.0,A,1427387400,"[greedy, hashing]",PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Pasha and String,750.0,B,1427387400,[greedy],PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Ilya and Sticks,1000.0,C,1427387400,"[greedy, sortings]",PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Arthur and Walls,3000.0,D,1427387400,"[data structures, greedy]",PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Anya and Cubes,3000.0,E,1427387400,"[binary search, bitmasks, brute force, dp, meet-in-the-middle]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,And Yet Another Bracket Sequence,2500.0,A,1426956300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Group Photo 2 (online mirror version),500.0,B,1426956300,"[brute force, greedy, sortings]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Rooks and Rectangles,1500.0,C,1426956300,[data structures],PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Social Network,1250.0,D,1426956300,"[data structures, greedy]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,The Art of Dealing with ATM,500.0,E,1426956300,[brute force],PROGRAMMING
+524,VK Cup 2015 - Round 1,12,"Возможно, вы знаете этих людей?",500.0,A,1426946400,[implementation],PROGRAMMING
+524,VK Cup 2015 - Round 1,12,Фото на память - 2 (round version),500.0,B,1426946400,"[dp, greedy]",PROGRAMMING
+524,VK Cup 2015 - Round 1,12,The Art of Dealing with ATM,1000.0,C,1426946400,"[binary search, sortings]",PROGRAMMING
+524,VK Cup 2015 - Round 1,12,Social Network,1250.0,D,1426946400,"[greedy, two pointers]",PROGRAMMING
+524,VK Cup 2015 - Round 1,12,Rooks and Rectangles,1750.0,E,1426946400,[data structures],PROGRAMMING
+524,VK Cup 2015 - Round 1,12,And Yet Another Bracket Sequence,3000.0,F,1426946400,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Playing with Paper,500.0,A,1426610700,"[implementation, math]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Error Correct System,1000.0,B,1426610700,[greedy],PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Glass Carving,1500.0,C,1426610700,"[binary search, data structures, implementation]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Clique Problem,2000.0,D,1426610700,"[data structures, dp, greedy, implementation, sortings]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Data Center Drama,2500.0,E,1426610700,"[dfs and similar, graphs]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Glass Carving,500.0,A,1426610700,"[data structures, implementation]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Clique Problem,1000.0,B,1426610700,"[dp, greedy]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Data Center Drama,1500.0,C,1426610700,"[constructive algorithms, graphs]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Fuzzy Search,2000.0,D,1426610700,"[bitmasks, brute force, fft]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Triangles 3000,2500.0,E,1426610700,"[geometry, sortings]",PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,"Rotate, Flip and Zoom",500.0,A,1426345200,[implementation],PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,Mean Requests,1000.0,B,1426345200,[implementation],PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,Name Quest,1500.0,C,1426345200,[greedy],PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,Statistics of Recompressing Videos,2000.0,D,1426345200,"[data structures, implementation]",PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Reposts,500.0,A,1425740400,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Photo to Remember,1000.0,B,1425740400,"[data structures, dp, implementation]",PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Chicken or Fish?,1500.0,C,1425740400,[greedy],PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Closest Equals,2000.0,D,1425740400,[data structures],PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Pangram,500.0,A,1425279600,"[implementation, strings]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Two Buttons,1000.0,B,1425279600,"[dfs and similar, graphs, greedy, implementation, math, shortest paths]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,DNA Alignment,1500.0,C,1425279600,"[math, strings]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Cubes,2000.0,D,1425279600,"[games, greedy, implementation]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Pluses everywhere,2500.0,E,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,DNA Alignment,500.0,A,1425279600,"[greedy, math]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Cubes,1000.0,B,1425279600,"[data structures, greedy, implementation]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Pluses everywhere,1500.0,C,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Shop,2000.0,D,1425279600,[greedy],PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Cycling City,2500.0,E,1425279600,"[dfs and similar, graphs]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Chess,500.0,A,1425128400,[implementation],PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Compilation Errors,1000.0,B,1425128400,"[data structures, implementation]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Team Training,1500.0,C,1425128400,"[greedy, implementation, math, number theory]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Interesting Substrings,2000.0,D,1425128400,"[data structures, dp, two pointers]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Lecture Rooms,2500.0,E,1425128400,"[binary search, data structures, dfs and similar, dp, trees]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Vitaly and Strings,500.0,A,1424795400,[strings],PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Tanya and Postcard,1000.0,B,1424795400,"[implementation, strings]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Anya and Smartphone,1500.0,C,1424795400,"[data structures, implementation]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Ilya and Escalator,2000.0,D,1424795400,"[combinatorics, dp, probabilities]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Arthur and Questions,2500.0,E,1424795400,"[greedy, implementation, ternary search]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Pasha and Pipe,2500.0,F,1424795400,"[binary search, brute force, combinatorics, dp, implementation]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Date,500.0,A,1424190900,[math],PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and His Happy Friends,1000.0,B,1424190900,"[brute force, dsu, meet-in-the-middle, number theory]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Factorial,1000.0,C,1424190900,"[greedy, math, sortings]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Tiles,3000.0,D,1424190900,"[constructive algorithms, greedy]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Park,3000.0,E,1424190900,[data structures],PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Factorial,500.0,A,1424190900,"[dp, greedy, implementation, math]",PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Tiles,1000.0,B,1424190900,"[data structures, graph matchings, greedy, implementation]",PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Park,1500.0,C,1424190900,[data structures],PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Morning Exercise,3000.0,D,1424190900,"[dfs and similar, dp, dsu, trees, two pointers]",PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and His Happy Friends,3000.0,E,1424190900,"[math, number theory]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Chewbaсca and Number,500.0,A,1423931400,"[greedy, implementation]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Han Solo and Lazer Gun,1000.0,B,1423931400,"[brute force, data structures, geometry, math]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Watto and Mechanism,2000.0,C,1423931400,"[binary search, hashing, string suffix structures, strings]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,R2D2 and Droid Army,2000.0,D,1423931400,"[binary search, data structures, two pointers]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Darth Vader and Tree,2500.0,E,1423931400,"[dp, matrices]",PROGRAMMING
+513,Rockethon 2015,12,Game,3.0,A,1423328400,"[constructive algorithms, math]",PROGRAMMING
+513,Rockethon 2015,12,Permutations,3.0,B1,1423328400,[brute force],PROGRAMMING
+513,Rockethon 2015,12,Permutations,4.0,B2,1423328400,"[bitmasks, divide and conquer, math]",PROGRAMMING
+513,Rockethon 2015,12,Second price auction,8.0,C,1423328400,"[bitmasks, probabilities]",PROGRAMMING
+513,Rockethon 2015,12,Constrained Tree,9.0,D1,1423328400,[dfs and similar],PROGRAMMING
+513,Rockethon 2015,12,Constrained Tree,8.0,D2,1423328400,"[constructive algorithms, data structures]",PROGRAMMING
+513,Rockethon 2015,12,Subarray Cuts,9.0,E1,1423328400,[dp],PROGRAMMING
+513,Rockethon 2015,12,Subarray Cuts,12.0,E2,1423328400,[dp],PROGRAMMING
+513,Rockethon 2015,12,Scaygerboss,14.0,F1,1423328400,[flows],PROGRAMMING
+513,Rockethon 2015,12,Scaygerboss,6.0,F2,1423328400,[flows],PROGRAMMING
+513,Rockethon 2015,12,Inversions problem,3.0,G1,1423328400,"[brute force, dfs and similar, dp, meet-in-the-middle]",PROGRAMMING
+513,Rockethon 2015,12,Inversions problem,5.0,G2,1423328400,"[dp, probabilities]",PROGRAMMING
+513,Rockethon 2015,12,Inversions problem,16.0,G3,1423328400,[dp],PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Names,500.0,A,1422894600,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Jumping,1000.0,B,1422894600,"[data structures, dp, math, number theory, shortest paths]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Dinner,1500.0,C,1422894600,"[flows, graph matchings]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Travelling,2250.0,D,1422894600,"[dp, trees]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Polygon,2250.0,E,1422894600,"[constructive algorithms, divide and conquer]",PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Snake,500.0,A,1422894600,[implementation],PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Two Dots,1000.0,B,1422894600,[dfs and similar],PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Names,1500.0,C,1422894600,"[dfs and similar, graphs, sortings]",PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Jumping,2000.0,D,1422894600,"[bitmasks, brute force, dp, math]",PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Dinner,2500.0,E,1422894600,[flows],PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Maximum in Table,,A,1422705600,"[brute force, implementation]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Painting Pebbles,,B,1422705600,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Sums of Digits,,C,1422705600,"[dp, greedy, implementation]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Restoring Numbers,,D,1422705600,"[constructive algorithms, math]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Pretty Song,,E,1422705600,"[math, strings]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Progress Monitoring,,F,1422705600,[dp],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Pasha and Pixels,500.0,A,1422376200,[brute force],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Anton and currency you all know,1000.0,B,1422376200,[greedy],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Anya and Ghosts,1500.0,C,1422376200,[greedy],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Tanya and Password,2000.0,D,1422376200,"[dfs and similar, graphs]",PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Arthur and Brackets,2500.0,E,1422376200,"[dp, greedy]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Amr and Music,500.0,A,1422028800,"[greedy, implementation, sortings]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Amr and Pins,1000.0,B,1422028800,"[geometry, math]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Guess Your Way Out!,1500.0,C,1422028800,"[implementation, math]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,The Maths Lecture,2000.0,D,1422028800,"[dp, implementation]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Breaking Good,2500.0,E,1422028800,"[dfs and similar, dp, graphs, shortest paths]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Gift,500.0,A,1421586000,"[brute force, implementation, strings]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Colorful Graph,1000.0,B,1421586000,"[dfs and similar, dp, dsu, graphs]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,"Mr. Kitayuta, the Treasure Hunter",1500.0,C,1421586000,"[dfs and similar, dp, two pointers]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Technology,2000.0,D,1421586000,[dfs and similar],PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta vs. Bamboos,2750.0,E,1421586000,"[binary search, greedy]",PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,"Mr. Kitayuta, the Treasure Hunter",500.0,A,1421586000,[dp],PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Technology,1000.0,B,1421586000,"[dfs and similar, graphs]",PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta vs. Bamboos,1750.0,C,1421586000,[binary search],PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Colorful Graph,1750.0,D,1421586000,"[brute force, dfs and similar, dsu]",PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Gift,2500.0,E,1421586000,"[combinatorics, dp, matrices, strings]",PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Contest,500.0,A,1421053200,[implementation],PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Changing Handles,500.0,B,1421053200,"[data structures, dsu, strings]",PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Forest,1500.0,C,1421053200,"[constructive algorithms, data structures, greedy, sortings, trees]",PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Permutations Summation,3000.0,D,1421053200,[data structures],PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Palindrome Degree,3000.0,E,1421053200,"[binary search, combinatorics, implementation]",PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and Forest,500.0,A,1421053200,"[constructive algorithms, data structures, graphs, greedy]",PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and Permutations Summation,500.0,B,1421053200,"[binary search, data structures, math]",PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and Palindrome Degree,2500.0,C,1421053200,[math],PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and XOR,2500.0,D,1421053200,[bitmasks],PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and LCP on Tree,3000.0,E,1421053200,"[binary search, dfs and similar, hashing, string suffix structures, trees]",PROGRAMMING
+500,Good Bye 2014,12,New Year Transportation,500.0,A,1419951600,"[dfs and similar, graphs, implementation]",PROGRAMMING
+500,Good Bye 2014,12,New Year Permutation,1000.0,B,1419951600,"[dfs and similar, dsu, graphs, greedy, math, sortings]",PROGRAMMING
+500,Good Bye 2014,12,New Year Book Reading,1000.0,C,1419951600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
+500,Good Bye 2014,12,New Year Santa Network,1500.0,D,1419951600,"[combinatorics, dfs and similar, graphs, trees]",PROGRAMMING
+500,Good Bye 2014,12,New Year Domino,2750.0,E,1419951600,"[data structures, dp, dsu]",PROGRAMMING
+500,Good Bye 2014,12,New Year Shopping,2750.0,F,1419951600,"[divide and conquer, dp]",PROGRAMMING
+500,Good Bye 2014,12,New Year Running,3500.0,G,1419951600,"[number theory, trees]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Crazy Town,500.0,A,1419438600,[geometry],PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Name That Tune,2000.0,B,1419438600,"[dp, probabilities, two pointers]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Array and Operations,1000.0,C,1419438600,"[flows, graph matchings, number theory]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Traffic Jams in the Land,2000.0,D,1419438600,"[data structures, dp, number theory]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Stairs and Lines,2500.0,E,1419438600,"[dp, matrices]",PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Watching a movie,500.0,A,1419438600,[implementation],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Lecture,500.0,B,1419438600,[strings],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Crazy Town,1500.0,C,1419438600,[math],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Name That Tune,3000.0,D,1419438600,[],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Array and Operations,3000.0,E,1419438600,[],PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Minimum Difficulty,500.0,A,1418833800,"[brute force, implementation, math]",PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Secret Combination,1000.0,B,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Removing Columns,1750.0,C,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Tennis Game,2250.0,D,1418833800,[binary search],PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Distributing Parts ,2250.0,E,1418833800,"[greedy, sortings]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Removing Columns,750.0,A,1418833800,[greedy],PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Tennis Game,1250.0,B,1418833800,"[binary search, brute force, implementation]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Distributing Parts ,1250.0,C,1418833800,"[data structures, greedy, implementation, sortings, two pointers]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Gears,2000.0,D,1418833800,"[brute force, geometry, math]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Subsequences Return,2500.0,E,1418833800,"[dp, matrices]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Treasure,500.0,A,1418488200,[greedy],PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Obsessive String,1000.0,B,1418488200,"[dp, strings]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Helping People,1750.0,C,1418488200,"[dp, probabilities]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Birthday,1750.0,D,1418488200,"[data structures, dfs and similar, dp, trees]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Sharti,2500.0,E,1418488200,[games],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Digital Counter,500.0,A,1418488200,[implementation],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Modular Equations,1000.0,B,1418488200,[math],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Treasure,1500.0,C,1418488200,[implementation],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Obsessive String,2000.0,D,1418488200,"[binary search, dp, strings]",PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Helping People,2750.0,E,1418488200,[],PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Football,500.0,A,1417618800,[implementation],PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Wrestling,1000.0,B,1417618800,[implementation],PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Basketball,2000.0,C,1417618800,"[binary search, brute force, data structures, implementation, sortings, two pointers]",PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Chess,1500.0,D,1417618800,"[constructive algorithms, games]",PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Polynomial,3000.0,E,1417618800,[math],PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Cubes,500.0,A,1417451400,[implementation],PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Lanterns,1000.0,B,1417451400,"[binary search, math, sortings]",PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Exams,1500.0,C,1417451400,"[greedy, sortings]",PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Computer Game,2000.0,D,1417451400,"[binary search, implementation, math, sortings]",PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Field,2500.0,E,1417451400,[math],PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Team Olympiad,500.0,A,1416733800,"[greedy, implementation, sortings]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Queue,1000.0,B,1416733800,"[dsu, implementation]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Hacking Cypher,1500.0,C,1416733800,"[brute force, math, strings]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Chocolate,2000.0,D,1416733800,"[brute force, dfs and similar, math, meet-in-the-middle, number theory]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Restoring Increasing Sequence,2000.0,E,1416733800,"[binary search, brute force, greedy, implementation]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Treeland Tour,2500.0,F,1416733800,"[data structures, dfs and similar, dp, trees]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Fight the Monster,500.0,A,1416590400,"[binary search, brute force]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Strip,1500.0,B,1416590400,"[binary search, data structures, dp, two pointers]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Prefix Product Sequence,1500.0,C,1416590400,"[constructive algorithms, number theory]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Conveyor Belts,2000.0,D,1416590400,[data structures],PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Tourists,2500.0,E,1416590400,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Giga Tower,500.0,A,1416590400,[brute force],PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Candy Boxes,1500.0,B,1416590400,"[brute force, constructive algorithms]",PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Fight the Monster,1500.0,C,1416590400,[brute force],PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Strip,2500.0,D,1416590400,"[data structures, dp, two pointers]",PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Prefix Product Sequence,2500.0,E,1416590400,"[constructive algorithms, math]",PROGRAMMING
+491,Testing Round #11,12,Up the hill,500.0,A,1416519000,[implementation],PROGRAMMING
+491,Testing Round #11,12,New York Hotel,1000.0,B,1416519000,"[greedy, math]",PROGRAMMING
+491,Testing Round #11,12,Deciphering,1500.0,C,1416519000,"[flows, graph matchings]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,SwapSort,500.0,A,1416238500,"[implementation, sortings]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,BerSU Ball,1000.0,B,1416238500,"[dfs and similar, dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Given Length and Sum of Digits...,1500.0,C,1416238500,"[dp, greedy, implementation]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Unbearable Controversy of Being,2000.0,D,1416238500,"[brute force, combinatorics, dfs and similar, graphs]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Hiking,2500.0,E,1416238500,"[binary search, dp]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Special Matrices,2500.0,F,1416238500,"[combinatorics, dp]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,Calculating Function,500.0,A,1415718000,"[implementation, math]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,OR in Matrix,1000.0,B,1415718000,"[greedy, hashing, implementation]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,Palindrome Transformation,1500.0,C,1415718000,"[greedy, implementation]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,Valid Sets,2000.0,D,1415718000,"[dfs and similar, dp, math, trees]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,LIS of Sequence,2500.0,E,1415718000,"[data structures, dp, greedy, hashing, math]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Bits,500.0,A,1415205000,"[bitmasks, constructive algorithms]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Maximum Value,1000.0,B,1415205000,"[binary search, math, sortings, two pointers]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Strange Sorting,3000.0,C,1415205000,"[implementation, math]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Kindergarten,2000.0,D,1415205000,"[data structures, dp, greedy]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Sign on Fence,3000.0,E,1415205000,"[binary search, constructive algorithms, data structures]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Factory,1000.0,A,1415205000,"[implementation, math, matrices]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Valuable Resources,500.0,B,1415205000,"[brute force, greedy]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Bits,1500.0,C,1415205000,"[implementation, math]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Maximum Value,3000.0,D,1415205000,"[binary search, sortings]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Strange Sorting,3000.0,E,1415205000,[],PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Diverse Permutation,500.0,A,1414170000,"[constructive algorithms, greedy]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Interesting Array,1500.0,B,1414170000,"[constructive algorithms, data structures, trees]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Game with Strings,1500.0,C,1414170000,"[bitmasks, dp, probabilities]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Random Function and Tree,2000.0,D,1414170000,"[combinatorics, dp, trees]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,ELCA,2500.0,E,1414170000,"[data structures, trees]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Counterexample ,500.0,A,1414170000,"[brute force, implementation]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Friends and Presents,1000.0,B,1414170000,"[binary search, math]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Diverse Permutation,1500.0,C,1414170000,"[constructive algorithms, implementation]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Interesting Array,2500.0,D,1414170000,[data structures],PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Game with Strings,2500.0,E,1414170000,[],PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Expression,500.0,A,1413709200,"[brute force, math]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Towers,1000.0,B,1413709200,"[brute force, greedy, implementation, sortings]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Exams,1500.0,C,1413709200,"[greedy, sortings]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Long Jumps,2000.0,D,1413709200,"[binary search, greedy, implementation]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Riding in a Lift,2500.0,E,1413709200,[dp],PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Exams,500.0,A,1413709200,"[greedy, sortings]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Long Jumps,1000.0,B,1413709200,"[binary search, greedy, hashing, implementation, sortings]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Riding in a Lift,1500.0,C,1413709200,"[dp, implementation]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Parcels,2000.0,D,1413709200,"[dp, graphs]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Parking Lot,2500.0,E,1413709200,"[data structures, divide and conquer]",PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Initial Bet,500.0,A,1413474000,[implementation],PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Random Teams,1000.0,B,1413474000,"[combinatorics, constructive algorithms, greedy, math]",PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Table Decorations,1500.0,C,1413474000,[greedy],PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Red-Green Towers,2000.0,D,1413474000,[dp],PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Wavy numbers,2500.0,E,1413474000,"[brute force, dfs and similar, meet-in-the-middle, sortings]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Stairs,500.0,A,1413122400,"[implementation, math]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and WiFi,1500.0,B,1413122400,"[bitmasks, brute force, combinatorics, dp, math, probabilities]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sums,1500.0,C,1413122400,[math],PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sets,2000.0,D,1413122400,"[constructive algorithms, greedy, math]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Strings,2500.0,E,1413122400,"[dp, strings]",PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sums,500.0,A,1413122400,[math],PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sets,1000.0,B,1413122400,[math],PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Strings,1500.0,C,1413122400,[dp],PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Binary,2000.0,D,1413122400,"[dp, strings]",PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Notepad,3000.0,E,1413122400,[data structures],PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Keyboard,500.0,A,1412609400,[implementation],PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Worms,1000.0,B,1412609400,"[binary search, implementation]",PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Captain Marmot,1500.0,C,1412609400,"[brute force, geometry]",PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Flowers,2000.0,D,1412609400,[dp],PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Pillars,3000.0,E,1412609400,"[binary search, data structures, dp, sortings, trees]",PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Ant colony,3000.0,F,1412609400,"[data structures, number theory]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Bayan Bus,500.0,A,1412514000,[implementation],PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Strongly Connected City,1000.0,B,1412514000,"[brute force, dfs and similar, graphs, implementation]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Kamal-ol-molk's Painting,1500.0,C,1412514000,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,CGCDSSQ,2000.0,D,1412514000,"[brute force, data structures, math]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Strongly Connected City 2,2500.0,E,1412514000,[dfs and similar],PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Meta-universe,2500.0,F,1412514000,[data structures],PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Learn from Math,500.0,A,1411918500,"[math, number theory]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Learn from Life,1000.0,B,1411918500,[],PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Make It Nondeterministic,1500.0,C,1411918500,[greedy],PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Inverse the Problem,2000.0,D,1411918500,"[dfs and similar, dsu, shortest paths, trees]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Learn from a Game,3000.0,E,1411918500,"[constructive algorithms, implementation]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Change the Goal,3000.0,F,1411918500,"[constructive algorithms, math, matrices]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Increase the Constraints,3500.0,G,1411918500,"[bitmasks, data structures, fft]",PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Sticks,500.0,A,1411745400,[implementation],PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Important Things,1000.0,B,1411745400,[sortings],PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and House of Cards,2000.0,C,1411745400,"[binary search, brute force, greedy, math]",PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Cube Walls,2000.0,D,1411745400,"[string suffix structures, strings]",PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Lots and Lots of Segments,2500.0,E,1411745400,"[data structures, dsu]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,24 Game,500.0,A,1411218000,"[constructive algorithms, greedy, math]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Two Sets,1000.0,B,1411218000,"[2-sat, dfs and similar, dsu, graph matchings, greedy]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Hack it!,1500.0,C,1411218000,"[binary search, constructive algorithms, math]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Tree,2000.0,D,1411218000,[graph matchings],PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Permanent,2500.0,E,1411218000,"[dp, graph matchings, math, meet-in-the-middle]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,I Wanna Be the Guy,500.0,A,1411218000,"[greedy, implementation]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,Chat Online,1000.0,B,1411218000,[implementation],PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,24 Game,1500.0,C,1411218000,"[constructive algorithms, implementation]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,Two Sets,2000.0,D,1411218000,"[2-sat, data structures, graph matchings, greedy]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,Hack it!,2500.0,E,1411218000,[constructive algorithms],PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,George and Accommodation,500.0,A,1411054200,[implementation],PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,Fedor and New Game,1000.0,B,1411054200,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,George and Job,1500.0,C,1411054200,"[dp, implementation]",PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,Fedor and Essay,2000.0,D,1411054200,"[dfs and similar, dp, graphs, hashing, strings]",PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,Alex and Complicated Task,2500.0,E,1411054200,"[data structures, dp, greedy]",PROGRAMMING
+470,Surprise Language Round #7,12,Crystal Ball Sequence,,A,1410622200,"[*special, implementation]",PROGRAMMING
+470,Surprise Language Round #7,12,Hexakosioihexekontahexaphobia,,B,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Eval,,C,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Caesar Cipher,,D,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Chessboard,,E,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Pairwise Sums,,F,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Hamming Distance,,G,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Array Sorting,,H,1410622200,[*special],PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Cheap Travel,500.0,A,1410535800,[implementation],PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Wonder Room,1000.0,B,1410535800,"[brute force, math]",PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Number of Ways,1500.0,C,1410535800,"[binary search, brute force, data structures, dp, two pointers]",PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Increase Sequence,2000.0,D,1410535800,"[combinatorics, dp]",PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Information Graph,2500.0,E,1410535800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,No to Palindromes!,500.0,A,1410103800,"[greedy, strings]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,Restore Cube ,1500.0,B,1410103800,"[brute force, geometry]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,Substitutes in Number,1500.0,C,1410103800,[dp],PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,World of Darkraft - 2,2000.0,D,1410103800,"[dp, probabilities]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,The Classic Problem,2500.0,E,1410103800,"[data structures, graphs, shortest paths]",PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,inc ARG,500.0,A,1410103800,[implementation],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,Inbox (100500),1000.0,B,1410103800,[implementation],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,No to Palindromes!,1500.0,C,1410103800,[brute force],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,Restore Cube ,2500.0,D,1410103800,[brute force],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,Substitutes in Number,2500.0,E,1410103800,"[constructive algorithms, dp]",PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Caisa and Sugar,500.0,A,1409383800,[implementation],PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Caisa and Pylons,1000.0,B,1409383800,[math],PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Gargari and Bishops,1500.0,C,1409383800,"[greedy, hashing, implementation]",PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Gargari and Permutations,2000.0,D,1409383800,"[dfs and similar, dp, graphs]",PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Caisa and Tree,2500.0,E,1409383800,"[brute force, dfs and similar, trees]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and Toastman,500.0,A,1409061600,"[greedy, sortings]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and Tree,1000.0,B,1409061600,"[dfs and similar, dp, trees]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and a Sheet of Paper,1500.0,C,1409061600,"[data structures, implementation]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and Complicated Task,2000.0,D,1409061600,"[dsu, math]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and a Game,2500.0,E,1409061600,[shortest paths],PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Easy Task,500.0,A,1409061600,"[brute force, implementation]",PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Card Game,1000.0,B,1409061600,[greedy],PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Toastman,1500.0,C,1409061600,"[implementation, sortings]",PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Tree,2000.0,D,1409061600,"[dp, graphs]",PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and a Sheet of Paper,2500.0,E,1409061600,[],PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Vasya and Socks,500.0,A,1408548600,"[brute force, implementation, math]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Little Dima and Equation,1000.0,B,1408548600,"[brute force, implementation, math]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Present,1500.0,C,1408548600,"[binary search, data structures, greedy]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Little Victor and Set,2000.0,D,1408548600,"[brute force, constructive algorithms]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Roland and Rose,2500.0,E,1408548600,"[brute force, geometry, math, sortings]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Garden,500.0,A,1408116600,[implementation],PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Flowers,500.0,B,1408116600,"[combinatorics, implementation, sortings]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Buses,2000.0,C,1408116600,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Parmida's problem,2000.0,D,1408116600,"[data structures, divide and conquer, sortings]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Graph,3000.0,E,1408116600,"[dp, sortings]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Golden System,1000.0,A,1407690000,"[math, meet-in-the-middle]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Distributed Join,1000.0,B,1407690000,[greedy],PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Elections,1500.0,C,1407690000,[brute force],PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Bingo!,2000.0,D,1407690000,"[combinatorics, math, probabilities]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Flow Optimality,2500.0,E,1407690000,"[constructive algorithms, flows, math]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,An easy problem about trees,3000.0,F,1407690000,"[dp, games, greedy, trees]",PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Golden System,1000.0,A,1407690000,[math],PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Distributed Join,1000.0,B,1407690000,[greedy],PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Elections,1500.0,C,1407690000,"[data structures, ternary search]",PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Bingo!,2000.0,D,1407690000,"[combinatorics, probabilities]",PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Flow Optimality,2500.0,E,1407690000,[],PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,An easy problem about trees,3000.0,F,1407690000,[],PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Boredom,500.0,A,1407511800,[dp],PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,A Lot of Games,1000.0,B,1407511800,"[dfs and similar, dp, games, implementation, strings, trees]",PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Civilization,1500.0,C,1407511800,"[dfs and similar, dp, dsu, ternary search, trees]",PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Serega and Fun,2000.0,D,1407511800,[data structures],PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Function,2500.0,E,1407511800,[data structures],PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Laptops,500.0,A,1407511800,[sortings],PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Fedya and Maths,1000.0,B,1407511800,"[math, number theory]",PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Boredom,1500.0,C,1407511800,[dp],PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,A Lot of Games,2000.0,D,1407511800,"[dp, games, strings]",PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Civilization,2500.0,E,1407511800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Expected Maximum,500.0,A,1406907000,[probabilities],PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Harmony Chest,1000.0,B,1406907000,"[bitmasks, brute force, dp]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Summer Sun Celebration,1500.0,C,1406907000,"[constructive algorithms, dfs and similar]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Elements of Harmony,2500.0,D,1406907000,"[dp, matrices]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Lord Tirek,2500.0,E,1406907000,[data structures],PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Crystal Mine,500.0,A,1406907000,[implementation],PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Sort by Shift,1000.0,B,1406907000,[implementation],PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Expected Maximum,1500.0,C,1406907000,"[combinatorics, math, probabilities]",PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Harmony Chest,2000.0,D,1406907000,"[bitmasks, dp]",PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Summer Sun Celebration,2500.0,E,1406907000,[dfs and similar],PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Eevee,500.0,A,1406480400,"[brute force, implementation, strings]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,4-point polyline,1000.0,B,1406480400,"[brute force, constructive algorithms, geometry, trees]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Magic Trick,1000.0,C,1406480400,"[combinatorics, math, probabilities]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,"Washer, Dryer, Folder",1500.0,D,1406480400,"[greedy, implementation]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Three strings,2500.0,E,1406480400,"[data structures, dsu, string suffix structures, strings]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Permutation,2500.0,F,1406480400,"[data structures, divide and conquer, hashing]",PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Game With Sticks,500.0,A,1406215800,[implementation],PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Sort the Array,1000.0,B,1406215800,"[implementation, sortings]",PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Predict Outcome of the Game,1500.0,C,1406215800,"[brute force, implementation, math]",PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Count Good Substrings,2500.0,D,1406215800,[math],PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Devu and Flowers,3000.0,E,1406215800,"[bitmasks, combinatorics, number theory]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Chocolate,500.0,A,1405774800,[math],PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Cities,1000.0,B,1405774800,"[graphs, shortest paths]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Apples,1500.0,C,1405774800,"[constructive algorithms, number theory]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Numbers,2000.0,D,1405774800,"[bitmasks, combinatorics, dp]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Squares,2500.0,E,1405774800,"[dp, math, number theory]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Children,500.0,A,1405774800,[implementation],PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Sequences,1000.0,B,1405774800,"[implementation, math]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Chocolate,1500.0,C,1405774800,"[greedy, implementation]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Cities,2000.0,D,1405774800,"[graphs, shortest paths]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Apples,2500.0,E,1405774800,"[constructive algorithms, number theory]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Rewards,500.0,A,1405605600,[implementation],PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Suffix Structures,1000.0,B,1405605600,"[implementation, strings]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Painting Fence,2500.0,C,1405605600,"[divide and conquer, dp, greedy]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Multiplication Table,2000.0,D,1405605600,"[binary search, brute force]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Divisors,3000.0,E,1405605600,"[brute force, dfs and similar, implementation, number theory]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Sequences,500.0,A,1405256400,"[dp, implementation, two pointers]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Modification,1500.0,B,1405256400,"[brute force, greedy]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Fibonacci Numbers,1500.0,C,1405256400,"[data structures, number theory]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Games,2000.0,D,1405256400,"[math, matrices, probabilities]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Bridges,2500.0,E,1405256400,"[math, matrices]",PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Hash,500.0,A,1405256400,[implementation],PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Strings,1000.0,B,1405256400,"[greedy, implementation]",PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Sequences,1500.0,C,1405256400,[dp],PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Modification,2500.0,D,1405256400,"[data structures, greedy]",PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Fibonacci Numbers,2500.0,E,1405256400,[data structures],PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Physics,500.0,A,1404651900,"[greedy, math]",PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves FFT,1000.0,B,1404651900,[probabilities],PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Colors,2000.0,C,1404651900,[data structures],PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Strings,2000.0,D,1404651900,"[binary search, hashing, strings, two pointers]",PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Planting,2500.0,E,1404651900,"[binary search, dsu, trees]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Chessboard,500.0,A,1404651900,"[dfs and similar, implementation]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Chemistry,1000.0,B,1404651900,"[dfs and similar, dsu, greedy]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Physics,1500.0,C,1404651900,"[graphs, greedy]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves FFT,2000.0,D,1404651900,[probabilities],PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Colors,3000.0,E,1404651900,[data structures],PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Borya and Hanabi,500.0,A,1403191800,"[bitmasks, brute force, implementation]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Andrey and Problem,1500.0,B,1403191800,"[greedy, math, probabilities]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Artem and Array ,1500.0,C,1403191800,"[data structures, greedy]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Adam and Tree,2000.0,D,1403191800,"[data structures, trees]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Gena and Second Distance,2500.0,E,1403191800,[geometry],PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Anton and Letters,500.0,A,1403191800,"[constructive algorithms, implementation]",PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Kolya and Tandem Repeat,1000.0,B,1403191800,"[brute force, implementation, strings]",PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Borya and Hanabi,1500.0,C,1403191800,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Andrey and Problem,2500.0,D,1403191800,"[dp, greedy, math, probabilities, sortings]",PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Artem and Array ,2500.0,E,1403191800,[],PROGRAMMING
+436,Zepto Code Rush 2014,12,Feed with Candy,1000.0,A,1402673400,[greedy],PROGRAMMING
+436,Zepto Code Rush 2014,12,Om Nom and Spiders,1000.0,B,1402673400,"[implementation, math]",PROGRAMMING
+436,Zepto Code Rush 2014,12,Dungeons and Candies,1500.0,C,1402673400,"[dsu, graphs, greedy, trees]",PROGRAMMING
+436,Zepto Code Rush 2014,12,Pudding Monsters,2500.0,D,1402673400,[dp],PROGRAMMING
+436,Zepto Code Rush 2014,12,Cardboard Box,2500.0,E,1402673400,"[data structures, greedy]",PROGRAMMING
+436,Zepto Code Rush 2014,12,Banners,3000.0,F,1402673400,"[brute force, data structures, dp]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Antique Items,500.0,A,1402241400,[implementation],PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Fruits,1000.0,B,1402241400,"[greedy, implementation]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Tubes ,1500.0,C,1402241400,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Swaps,2000.0,D,1402241400,"[constructive algorithms, dsu, graphs, implementation, string suffix structures]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Number,2500.0,E,1402241400,"[bitmasks, dp]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,"Devu, the Singer and Churu, the Joker",500.0,A,1401895800,"[greedy, implementation]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,"Devu, the Dumb Guy",1000.0,B,1401895800,"[implementation, sortings]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,Devu and Partitioning of the Array,1500.0,C,1401895800,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,Devu and his Brother,2000.0,D,1401895800,"[binary search, sortings, ternary search, two pointers]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,Devu and Birthday Celebration,2500.0,E,1401895800,"[combinatorics, dp, math]",PROGRAMMING
+440,Testing Round #10,12,Forgotten Episode,500.0,A,1401809400,[implementation],PROGRAMMING
+440,Testing Round #10,12,Balancer,1000.0,B,1401809400,[implementation],PROGRAMMING
+440,Testing Round #10,12,One-Based Arithmetic,1500.0,C,1401809400,"[dfs and similar, divide and conquer]",PROGRAMMING
+440,Testing Round #10,12,Berland Federalization,2000.0,D,1401809400,"[dp, trees]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Homework,500.0,A,1401627600,[implementation],PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Set,1500.0,B,1401627600,"[bitmasks, greedy, implementation, sortings]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Toy,1500.0,C,1401627600,"[graphs, greedy, sortings]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Zoo,2000.0,D,1401627600,"[dsu, sortings]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Polygon,2500.0,E,1401627600,[],PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Toy,500.0,A,1401627600,[greedy],PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Zoo,1000.0,B,1401627600,"[dp, dsu, sortings]",PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Polygon,1500.0,C,1401627600,"[dp, geometry]",PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Sequence,2000.0,D,1401627600,[data structures],PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Binary Tree,3000.0,E,1401627600,"[combinatorics, divide and conquer, fft, number theory]",PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Queue on Bus Stop,500.0,A,1401463800,[implementation],PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Pasha Maximizes,1000.0,B,1401463800,[greedy],PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Cardiogram,1500.0,C,1401463800,[implementation],PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Special Grid,2000.0,D,1401463800,"[brute force, dp, greedy]",PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Special Graph,2500.0,E,1401463800,[],PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Kitahara Haruki's Gift,500.0,A,1400914800,"[brute force, implementation]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Kuriyama Mirai's Stones,1500.0,B,1400914800,"[dp, implementation, sortings]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Ryouko's Memory Note,1500.0,C,1400914800,"[implementation, math, sortings]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Nanami's Digital Board,2000.0,D,1400914800,"[dsu, implementation]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Tachibana Kanade's Tofu,2500.0,E,1400914800,[dp],PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Ryouko's Memory Note,500.0,A,1400914800,"[math, sortings]",PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Nanami's Digital Board,1000.0,B,1400914800,"[divide and conquer, dp, dsu, implementation, two pointers]",PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Tachibana Kanade's Tofu,1500.0,C,1400914800,[dp],PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Nanami's Power Plant,2000.0,D,1400914800,[flows],PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Furukawa Nagisa's Tree,3000.0,E,1400914800,"[binary search, divide and conquer, sortings, trees]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Black Square,500.0,A,1400686200,[implementation],PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Shower Line,1500.0,B,1400686200,"[brute force, implementation]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,k-Tree,1500.0,C,1400686200,"[dp, implementation, trees]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Random Task,2000.0,D,1400686200,"[binary search, bitmasks, combinatorics, dp, math]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Chemistry Experiment,2500.0,E,1400686200,"[binary search, data structures, ternary search]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Choosing Teams,500.0,A,1400167800,"[greedy, implementation, sortings]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Football Kit,1000.0,B,1400167800,"[brute force, greedy, implementation]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Prime Swaps,1500.0,C,1400167800,"[greedy, sortings]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Prefixes and Suffixes,2000.0,D,1400167800,"[dp, string suffix structures, strings, two pointers]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Square Tiling,2500.0,E,1400167800,"[constructive algorithms, greedy]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Xor-tree,500.0,A,1399822800,"[dfs and similar, trees]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Working out,1000.0,B,1399822800,[dp],PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Guess the Tree,1500.0,C,1399822800,"[bitmasks, constructive algorithms, dp, greedy, trees]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Tricky Function,2000.0,D,1399822800,"[data structures, divide and conquer, geometry]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Points and Segments,2000.0,E,1399822800,[graphs],PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Points and Segments (easy),500.0,A,1399822800,"[constructive algorithms, sortings]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Balls Game,1000.0,B,1399822800,"[brute force, two pointers]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Xor-tree,1500.0,C,1399822800,"[brute force, data structures, dfs and similar, trees]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Working out,2000.0,D,1399822800,"[brute force, dp]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Guess the Tree,2500.0,E,1399822800,"[constructive algorithms, data structures, dfs and similar]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Police Recruits,500.0,A,1399044600,[implementation],PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Prison Transfer,1000.0,B,1399044600,"[data structures, implementation]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Checkposts,1500.0,C,1399044600,"[dfs and similar, graphs, two pointers]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Match & Catch,2000.0,D,1399044600,"[dp, string suffix structures, strings]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Police Patrol,2500.0,E,1399044600,"[greedy, implementation, math, ternary search]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Swaps,500.0,A,1398612600,"[brute force, sortings]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Table ,1000.0,B,1398612600,"[bitmasks, greedy]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Two Sequences,1500.0,C,1398612600,"[data structures, dp]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Squares,2000.0,D,1398612600,"[binary search, data structures, hashing]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Sets,2000.0,E,1398612600,[dp],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Mugs,500.0,A,1398612600,[implementation],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Mirroring,1000.0,B,1398612600,[implementation],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Swaps,1500.0,C,1398612600,"[brute force, sortings, two pointers]",PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Table ,2000.0,D,1398612600,[],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Two Sequences,2500.0,E,1398612600,[],PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Squats,500.0,A,1398409200,[implementation],PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Megacity,1000.0,B,1398409200,"[binary search, greedy, implementation, sortings]",PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Magic Formulas,1500.0,C,1398409200,[math],PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Biathlon Track,2500.0,D,1398409200,"[binary search, brute force, constructive algorithms, data structures, dp]",PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Colored Jenga,3000.0,E,1398409200,"[dfs and similar, dp, probabilities]",PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Start Up,500.0,A,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Online Meeting,1500.0,B,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Bug in Code,1500.0,C,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Cup Trick,1500.0,D,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Playing the ball,2000.0,E,1398169200,[],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Start Up,500.0,A,1398169140,[implementation],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Online Meeting,1500.0,B,1398169140,[implementation],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Bug in Code,1500.0,C,1398169140,"[data structures, graphs, implementation, two pointers]",PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Cup Trick,1500.0,D,1398169140,[data structures],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Playing the ball,2000.0,E,1398169140,[geometry],PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Pasha and Hamsters,500.0,A,1398168900,"[constructive algorithms, implementation]",PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Start Up,1000.0,B,1398168900,[implementation],PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Online Meeting,2000.0,C,1398168900,[implementation],PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Bug in Code,2000.0,D,1398168900,"[binary search, data structures, sortings]",PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Cup Trick,2000.0,E,1398168900,[data structures],PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Data Recovery,500.0,A,1397977200,[implementation],PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Spyke Chatting,1000.0,B,1397977200,[implementation],PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Jeopardy!,1500.0,C,1397977200,"[greedy, math]",PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,2048,2000.0,D,1397977200,"[bitmasks, dp]",PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Maze 2D,2500.0,E,1397977200,"[data structures, divide and conquer]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Poster,500.0,A,1397837400,"[greedy, implementation]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Network Configuration,1000.0,B,1397837400,"[greedy, sortings]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Pattern,1500.0,C,1397837400,"[implementation, strings]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Giving Awards,2000.0,D,1397837400,[dfs and similar],PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,E-mail Addresses,2500.0,E,1397837400,[implementation],PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Elimination,500.0,A,1397749200,"[dp, implementation, math]",PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Crash,1000.0,B,1397749200,[implementation],PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Football,1500.0,C,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Cunning Gena,2000.0,D,1397749200,"[bitmasks, dp, greedy, sortings]",PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Square Table,2500.0,E,1397749200,"[constructive algorithms, math, probabilities]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Football,500.0,A,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Cunning Gena,1000.0,B,1397749200,"[bitmasks, dp, sortings]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Square Table,1500.0,C,1397749200,"[constructive algorithms, dp, math]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Big Problems for Organizers,2500.0,D,1397749200,"[data structures, graphs, trees]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Tricky Password,2500.0,E,1397749200,[data structures],PROGRAMMING
+411,Coder-Strike 2014 - Qualification Round,12,Password Check,,A,1397505600,[implementation],PROGRAMMING
+411,Coder-Strike 2014 - Qualification Round,12,Multi-core Processor,,B,1397505600,[implementation],PROGRAMMING
+411,Coder-Strike 2014 - Qualification Round,12,Kicker,,C,1397505600,[implementation],PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Guess a number!,500.0,A,1397376000,"[greedy, implementation, two pointers]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Art Union,1000.0,B,1397376000,"[brute force, dp, implementation]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Booking System,1500.0,C,1397376000,"[binary search, dp, greedy, implementation]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Population Size,2000.0,D,1397376000,"[greedy, implementation]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,President's Path,2500.0,E,1397376000,"[dp, graphs, shortest paths]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and Numbers,500.0,A,1396798800,"[constructive algorithms, number theory]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and ACM,1000.0,B,1396798800,"[combinatorics, dp]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and Reverse Operation,1500.0,C,1396798800,"[combinatorics, divide and conquer]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and Water Tanks,1500.0,D,1396798800,"[binary search, data structures, greedy, two pointers]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh's Designed Problem,2500.0,E,1396798800,[data structures],PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Lights,500.0,A,1396798800,[implementation],PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Tokens,1000.0,B,1396798800,"[binary search, greedy, math]",PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Numbers,1500.0,C,1396798800,"[constructive algorithms, greedy, number theory]",PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and ACM,2000.0,D,1396798800,"[combinatorics, dp, number theory]",PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Reverse Operation,2500.0,E,1396798800,"[divide and conquer, sortings]",PROGRAMMING
+409,April Fools Day Contest 2014,12,The Great Game,,A,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Mysterious Language,,B,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Magnum Opus,,C,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Big Data,,D,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Dome,,E,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,000001,,F,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,On a plane,,G,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,A + B Strikes Back,,H,1396366200,"[*special, brute force, constructive algorithms, dsu, implementation]",PROGRAMMING
+409,April Fools Day Contest 2014,12,Feed the Golorp,,I,1396366200,[*special],PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Triangle,500.0,A,1396162800,"[brute force, implementation, math]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Long Path,1000.0,B,1396162800,"[dp, implementation]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Curious Array,2000.0,C,1396162800,"[brute force, implementation, math]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Largest Submatrix 3,2000.0,D,1396162800,"[dp, hashing]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,k-d-sequence,2500.0,E,1396162800,[data structures],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Line to Cashier,500.0,A,1396162800,[implementation],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Garland,1000.0,B,1396162800,[implementation],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Triangle,1500.0,C,1396162800,"[geometry, math]",PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Long Path,2000.0,D,1396162800,[dp],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Curious Array,3000.0,E,1396162800,[],PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Gravity Flip,500.0,A,1395502200,"[greedy, implementation, sortings]",PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Domino Effect,1000.0,B,1395502200,[],PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Unusual Product,1500.0,C,1395502200,"[implementation, math]",PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Toy Sum,2000.0,D,1395502200,"[greedy, implementation, math]",PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Graph Cutting,3000.0,E,1395502200,[dfs and similar],PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Unusual Product,500.0,A,1395502200,"[implementation, math]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Toy Sum,1000.0,B,1395502200,"[constructive algorithms, greedy]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Graph Cutting,2000.0,C,1395502200,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Hill Climbing,2000.0,D,1395502200,"[dfs and similar, geometry, trees]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Hamming Triples,2500.0,E,1395502200,"[implementation, math]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Valera and X,500.0,A,1395243000,[implementation],PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Marathon,1000.0,B,1395243000,"[implementation, math]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Restore Graph,1500.0,C,1395243000,"[dfs and similar, graphs, sortings]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Minesweeper 1D,2000.0,D,1395243000,"[dp, implementation]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Maze 1D,2500.0,E,1395243000,"[binary search, greedy, implementation]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Nuts,500.0,A,1394983800,"[greedy, math]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Trees in a Row,1000.0,B,1394983800,[brute force],PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Searching for Graph,1500.0,C,1394983800,"[brute force, constructive algorithms]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Upgrading Array,2000.0,D,1394983800,"[dp, greedy, math]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Strictly Positive Matrix,2500.0,E,1394983800,[graphs],PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Searching for Graph,500.0,A,1394983800,"[constructive algorithms, graphs]",PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Upgrading Array,1000.0,B,1394983800,"[dp, greedy, number theory]",PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Strictly Positive Matrix,1500.0,C,1394983800,[graphs],PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Beautiful Pairs of Numbers,1500.0,D,1394983800,"[combinatorics, dp]",PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Two Rooted Trees,2000.0,E,1394983800,"[data structures, implementation]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Vanya and Cards,500.0,A,1394465400,"[implementation, math]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Sereja and Contests,1000.0,B,1394465400,"[greedy, implementation, math]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Team,1500.0,C,1394465400,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Roman and Numbers,2000.0,D,1394465400,"[bitmasks, brute force, combinatorics, dp, number theory]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Olympic Games,2500.0,E,1394465400,[math],PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and Choose Options,500.0,A,1394033400,"[dp, implementation]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and New Matrix of Candies,1000.0,B,1394033400,"[brute force, implementation, schedules]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and Huge Candy Matrix,1500.0,C,1394033400,"[implementation, math]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Dima and Bacteria,2000.0,D,1394033400,"[dsu, graphs, shortest paths]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and Binary Logic,2500.0,E,1394033400,"[binary search, bitmasks, data structures]",PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Cards,500.0,A,1393687800,[implementation],PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Painting The Wall,1000.0,B,1393687800,"[dp, probabilities]",PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Tree and Array,1500.0,C,1393687800,[constructive algorithms],PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Instant Messanger,2000.0,D,1393687800,[data structures],PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Sorting Permutations,2500.0,E,1393687800,[],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Pages,500.0,A,1393687800,[implementation],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Red and Blue Balls,1000.0,B,1393687800,[],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Cards,1500.0,C,1393687800,[number theory],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Painting The Wall,2000.0,D,1393687800,[],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Tree and Array,2500.0,E,1393687800,[],PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Number of Decompositions into Multipliers,500.0,A,1393428600,"[combinatorics, number theory]",PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Sum of Fractions,1000.0,B,1393428600,"[math, number theory]",PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Changing Tree,1500.0,C,1393428600,"[data structures, trees]",PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Sum of Number of Inversions in Permutations,2000.0,D,1393428600,[combinatorics],PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Iteration of One Well-Known Function,2500.0,E,1393428600,[],PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Segment's Own Points,500.0,A,1393428600,[],PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Corruption and Numbers,1000.0,B,1393428600,"[implementation, math]",PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Number of Decompositions into Multipliers,1500.0,C,1393428600,"[combinatorics, number theory]",PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Sum of Fractions,2000.0,D,1393428600,[math],PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Changing Tree,2500.0,E,1393428600,"[data structures, trees]",PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Counting Sticks,500.0,A,1392910200,[implementation],PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Very Beautiful Number,1000.0,B,1392910200,[],PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Dominoes,1500.0,C,1392910200,"[constructive algorithms, greedy]",PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Physical Education and Buns,2000.0,D,1392910200,"[brute force, implementation, math]",PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Lightbulb for Minister,2500.0,E,1392910200,[geometry],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Blocked Points,500.0,A,1392728400,[math],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Tower of Hanoi,1000.0,B,1392728400,[dp],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Yet Another Number Sequence,1500.0,C,1392728400,"[combinatorics, math, matrices]",PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Three Arrays,2000.0,D,1392728400,[data structures],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Deleting Substrings,2500.0,E,1392728400,[],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Nineteen,500.0,A,1392728400,[],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Three matrices,1000.0,B,1392728400,[],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Blocked Points,1500.0,C,1392728400,[geometry],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Tower of Hanoi,2000.0,D,1392728400,[dp],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Yet Another Number Sequence,2500.0,E,1392728400,[],PROGRAMMING
+391,Rockethon 2014,12,Genetic Engineering,3.0,A,1392573600,"[implementation, two pointers]",PROGRAMMING
+391,Rockethon 2014,12,Word Folding,5.0,B,1392573600,[brute force],PROGRAMMING
+391,Rockethon 2014,12,The Tournament,4.0,C1,1392573600,[brute force],PROGRAMMING
+391,Rockethon 2014,12,The Tournament,4.0,C2,1392573600,[greedy],PROGRAMMING
+391,Rockethon 2014,12,The Tournament,8.0,C3,1392573600,[],PROGRAMMING
+391,Rockethon 2014,12,Supercollider,3.0,D1,1392573600,[brute force],PROGRAMMING
+391,Rockethon 2014,12,Supercollider,16.0,D2,1392573600,[data structures],PROGRAMMING
+391,Rockethon 2014,12,Three Trees,11.0,E1,1392573600,[],PROGRAMMING
+391,Rockethon 2014,12,Three Trees,13.0,E2,1392573600,[],PROGRAMMING
+391,Rockethon 2014,12,Stock Trading,8.0,F1,1392573600,[dp],PROGRAMMING
+391,Rockethon 2014,12,Stock Trading,15.0,F2,1392573600,[greedy],PROGRAMMING
+391,Rockethon 2014,12,Stock Trading,10.0,F3,1392573600,[],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Alarm Clock,500.0,A,1392132600,[implementation],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,"Inna, Dima and Song",1000.0,B,1392132600,[implementation],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Candy Boxes,1500.0,C,1392132600,[data structures],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Sweet Matrix,2000.0,D,1392132600,[constructive algorithms],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Large Sweet Matrix,2500.0,E,1392132600,[],PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Box Accumulation,500.0,A,1391442000,"[greedy, sortings]",PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Minimal path,1000.0,B,1391442000,"[bitmasks, constructive algorithms, graphs, implementation, math]",PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Card Game,1500.0,C,1391442000,"[games, greedy, sortings]",PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Perfect Sets,2000.0,D,1391442000,[math],PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Meteor Shower,2500.0,E,1391442000,[geometry],PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Number Game,500.0,A,1391442000,"[greedy, math]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Cross,1000.0,B,1391442000,"[greedy, implementation]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Box Accumulation,1500.0,C,1391442000,"[binary search, dp, greedy]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Minimal path,2000.0,D,1391442000,"[constructive algorithms, graphs, implementation, shortest paths]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Card Game,2500.0,E,1391442000,"[greedy, implementation]",PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Sleep,500.0,A,1391095800,[implementation],PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Round,1000.0,B,1391095800,"[brute force, greedy, two pointers]",PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Number,1500.0,C,1391095800,"[greedy, implementation]",PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Interesting Graph,2000.0,D,1391095800,[graph matchings],PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Cards,2500.0,E,1391095800,"[binary search, data structures]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Raspberry,500.0,A,1390577700,"[brute force, greedy, implementation]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Strings,1000.0,B,1390577700,"[brute force, greedy, implementation, math, strings]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Prime Numbers,1500.0,C,1390577700,"[binary search, brute force, data structures, dp, implementation, math, number theory]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Floodlight,2000.0,D,1390577700,"[bitmasks, dp, geometry]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear in the Field,2500.0,E,1390577700,"[math, matrices]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Milking cows,500.0,A,1390231800,"[data structures, greedy]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Volcanoes,1500.0,B,1390231800,"[binary search, implementation, sortings, two pointers]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Propagating tree,1500.0,C,1390231800,"[data structures, dfs and similar, trees]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Antimatter,2000.0,D,1390231800,[dp],PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Vowels,2500.0,E,1390231800,"[combinatorics, divide and conquer, dp]",PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Coder,500.0,A,1390231800,[implementation],PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Multitasking,1000.0,B,1390231800,"[greedy, implementation, sortings, two pointers]",PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Milking cows,1500.0,C,1390231800,[greedy],PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Volcanoes,2500.0,D,1390231800,[implementation],PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Propagating tree,2500.0,E,1390231800,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Ksenia and Pan Scales,500.0,A,1389972600,"[greedy, implementation]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Number Busters,2500.0,B,1389972600,"[binary search, math]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Arithmetic Progression,1500.0,C,1389972600,"[implementation, sortings]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Ksenia and Pawns,3000.0,D,1389972600,"[dfs and similar, graphs, implementation, trees]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Ksenia and Combinatorics,3000.0,E,1389972600,"[combinatorics, dp]",PROGRAMMING
+386,Testing Round #9,12,Second-Price Auction,500.0,A,1389906900,[implementation],PROGRAMMING
+386,Testing Round #9,12,"Fly, freebies, fly!",1000.0,B,1389906900,"[binary search, brute force, implementation]",PROGRAMMING
+386,Testing Round #9,12,Diverse Substrings,1500.0,C,1389906900,"[dp, two pointers]",PROGRAMMING
+386,Testing Round #9,12,Game with Points,2000.0,D,1389906900,"[dp, graphs, implementation, shortest paths]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Prefixes,500.0,A,1389540600,"[binary search, brute force]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Tree,1000.0,B,1389540600,"[graphs, implementation]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Brackets,1500.0,C,1389540600,"[data structures, schedules]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Cinema,2000.0,D,1389540600,"[combinatorics, math]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Dividing,2500.0,E,1389540600,[data structures],PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Dima,500.0,A,1389540600,"[greedy, implementation, two pointers]",PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Stairs,1000.0,B,1389540600,"[greedy, implementation, sortings]",PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Prefixes,1500.0,C,1389540600,"[binary search, implementation, two pointers]",PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Tree,2000.0,D,1389540600,[brute force],PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Brackets,2500.0,E,1389540600,[data structures],PROGRAMMING
+379,Good Bye 2013,12,New Year Candles,500.0,A,1388417400,[implementation],PROGRAMMING
+379,Good Bye 2013,12,New Year Present,1000.0,B,1388417400,"[constructive algorithms, implementation]",PROGRAMMING
+379,Good Bye 2013,12,New Year Ratings Change,1500.0,C,1388417400,"[greedy, sortings]",PROGRAMMING
+379,Good Bye 2013,12,New Year Letter,2000.0,D,1388417400,"[bitmasks, brute force, dp]",PROGRAMMING
+379,Good Bye 2013,12,New Year Tree Decorations,2500.0,E,1388417400,"[geometry, schedules, sortings]",PROGRAMMING
+379,Good Bye 2013,12,New Year Tree,3000.0,F,1388417400,"[data structures, divide and conquer, trees]",PROGRAMMING
+379,Good Bye 2013,12,New Year Cactus,3500.0,G,1388417400,[dp],PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Maze,500.0,A,1388331000,[dfs and similar],PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Preparing for the Contest,1000.0,B,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Captains Mode,1000.0,C,1388331000,"[bitmasks, dp, games]",PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Developing Game,2000.0,D,1388331000,[data structures],PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Cookie Clicker,2500.0,E,1388331000,"[dp, geometry]",PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Playing with Dice,500.0,A,1388331000,[brute force],PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Semifinals,1000.0,B,1388331000,"[implementation, sortings]",PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Maze,1500.0,C,1388331000,[dfs and similar],PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Preparing for the Contest,2000.0,D,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Captains Mode,2000.0,E,1388331000,"[bitmasks, brute force, dp, greedy]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Divisible by Seven,500.0,A,1387893600,"[math, number theory]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Maximum Submatrix 2,1000.0,B,1387893600,"[data structures, dp, implementation, sortings]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Circling Round Treasures,1500.0,C,1387893600,"[bitmasks, shortest paths]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Tree and Queries,2000.0,D,1387893600,"[data structures, dfs and similar, trees]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Red and Black Tree,2500.0,E,1387893600,"[dp, implementation, math]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Lever,500.0,A,1387893600,"[implementation, math]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,I.O.U.,1000.0,B,1387893600,[implementation],PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Divisible by Seven,1500.0,C,1387893600,"[math, number theory]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Maximum Submatrix 2,2000.0,D,1387893600,"[dp, implementation, sortings]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Circling Round Treasures,2500.0,E,1387893600,"[bitmasks, shortest paths]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Pink Pony,500.0,A,1387380600,"[greedy, implementation]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Nine,1000.0,B,1387380600,"[combinatorics, greedy]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Dima,1500.0,C,1387380600,"[dfs and similar, dp, graphs, implementation]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Sequence ,2000.0,D,1387380600,"[binary search, data structures, dp, trees]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Babies,2500.0,E,1387380600,"[binary search, data structures, dsu, geometry, implementation]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Counting Kangaroos is Fun,500.0,A,1386943200,"[binary search, greedy, sortings, two pointers]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Counting Rectangles is Fun,1000.0,B,1386943200,"[brute force, divide and conquer, dp]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Watching Fireworks is Fun,1500.0,C,1386943200,"[data structures, dp, math]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Choosing Subtree is Fun,2000.0,D,1386943200,"[binary search, data structures, dfs and similar, trees, two pointers]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Drawing Circles is Fun,2500.0,E,1386943200,"[combinatorics, geometry]",PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Collecting Beats is Fun,500.0,A,1386943200,[implementation],PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Making Sequences is Fun,1000.0,B,1386943200,"[binary search, implementation, math]",PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Counting Kangaroos is Fun,1500.0,C,1386943200,"[greedy, sortings, two pointers]",PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Counting Rectangles is Fun,2000.0,D,1386943200,[],PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Watching Fireworks is Fun,2500.0,E,1386943200,[dp],PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,K-Periodic Array,500.0,A,1386493200,"[implementation, math]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Fox Dividing Cheese,1000.0,B,1386493200,"[math, number theory]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Hamburgers,1500.0,C,1386493200,"[binary search, brute force]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Vessels,2000.0,D,1386493200,"[data structures, dsu, implementation, trees]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Subway Innovation,2500.0,E,1386493200,"[math, two pointers]",PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,"Rook, Bishop and King",500.0,A,1386399600,[math],PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Berland Bingo,500.0,B,1386399600,[implementation],PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Mittens,1500.0,C,1386399600,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Broken Monitor,3000.0,D,1386399600,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Summer Reading,3000.0,E,1386399600,"[dp, greedy]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Plates,500.0,A,1385739000,[implementation],PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Contest,1000.0,B,1385739000,"[constructive algorithms, implementation, math]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Elections,1500.0,C,1385739000,"[dfs and similar, graphs, trees]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Fools,2000.0,D,1385739000,"[dfs and similar, dp, shortest paths]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Queries,2500.0,E,1385739000,"[binary search, data structures]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and Algorithm ,500.0,A,1385479800,"[data structures, implementation]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja ans Anagrams,1000.0,B,1385479800,"[binary search, data structures]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and the Arrangement of Numbers,1500.0,C,1385479800,"[graphs, greedy, sortings]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and Sets,2000.0,D,1385479800,"[bitmasks, dfs and similar]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and Intervals,2000.0,E,1385479800,"[combinatorics, dp]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and Coat Rack,500.0,A,1385479800,[implementation],PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and Suffixes,1000.0,B,1385479800,"[data structures, dp]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and Algorithm ,1500.0,C,1385479800,"[brute force, implementation]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja ans Anagrams,2000.0,D,1385479800,"[data structures, two pointers]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and the Arrangement of Numbers,2500.0,E,1385479800,"[combinatorics, graphs, implementation]",PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Guards,500.0,A,1385307000,[implementation],PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and To-do List,1000.0,B,1385307000,"[brute force, implementation]",PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Salad,1500.0,C,1385307000,[dp],PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Trap Graph,2000.0,D,1385307000,"[binary search, data structures, dfs and similar, dsu, shortest paths, two pointers]",PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Magic Guitar,2500.0,E,1385307000,"[brute force, implementation, math]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Matrix,500.0,A,1384875000,"[combinatorics, data structures, implementation]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Free Market,1000.0,B,1384875000,"[dp, greedy]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Beautiful Set,1500.0,C,1384875000,"[brute force, number theory]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Ghd,2000.0,D,1384875000,"[brute force, math, probabilities]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Empty Rectangles,2500.0,E,1384875000,"[divide and conquer, two pointers]",PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Good Number,500.0,A,1384875000,[implementation],PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,The Fibonacci Segment,1000.0,B,1384875000,[implementation],PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Matrix,1500.0,C,1384875000,"[brute force, combinatorics, math, matrices]",PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Free Market,2000.0,D,1384875000,"[dp, greedy]",PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Beautiful Set,2500.0,E,1384875000,"[brute force, number theory]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Two Semiknights Meet,1000.0,A,1384443000,"[greedy, math]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Petya and Staircases,500.0,B,1384443000,"[implementation, sortings]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Insertion Sort,2500.0,C,1384443000,"[data structures, dp, implementation, math]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Fools and Foolproof Roads,3000.0,D,1384443000,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Petya and Pipes,3000.0,E,1384443000,"[flows, graphs, shortest paths]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Soroban,500.0,A,1384156800,[implementation],PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Fence,1000.0,B,1384156800,"[brute force, dp]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Fixing Typos,1500.0,C,1384156800,"[greedy, implementation]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Renting Bikes,2000.0,D,1384156800,"[binary search, greedy]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Two Circles,2500.0,E,1384156800,"[brute force, data structures, implementation]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Array Recovery,500.0,A,1384102800,"[greedy, implementation]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Array,1000.0,B,1384102800,"[binary search, dp]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Strings,1500.0,C,1384102800,"[combinatorics, dp]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Sets,1500.0,D,1384102800,[number theory],PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Game,2000.0,E,1384102800,"[graphs, greedy, shortest paths]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Table,500.0,A,1384102800,"[constructive algorithms, implementation]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Permutation,1000.0,B,1384102800,"[constructive algorithms, math, number theory]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Array Recovery,1500.0,C,1384102800,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Array,2000.0,D,1384102800,"[binary search, dp]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Strings,2500.0,E,1384102800,[],PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Table,500.0,A,1383379200,"[greedy, implementation]",PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Permutation,1000.0,B,1383379200,"[constructive algorithms, dp, math]",PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Prime Number,1500.0,C,1383379200,[math],PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Pair of Numbers,2500.0,D,1383379200,"[binary search, brute force, data structures, math, two pointers]",PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Neatness,2500.0,E,1383379200,[dfs and similar],PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Continuous Line,500.0,A,1382715000,"[brute force, implementation]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Text Messages,1000.0,B,1382715000,"[brute force, strings]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Containers,1500.0,C,1382715000,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Hares,2000.0,D,1382715000,"[dp, greedy]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Kicks,3000.0,E,1382715000,"[brute force, dsu, graphs, implementation]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Knight Tournament,500.0,A,1381838400,"[data structures, dsu]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Xenia and Hamming,1000.0,B,1381838400,"[implementation, math]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Compartments,1500.0,C,1381838400,"[combinatorics, constructive algorithms, greedy, implementation]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Bags and Coins,2000.0,D,1381838400,"[bitmasks, constructive algorithms, dp, greedy]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Xenia and String Problem,2500.0,E,1381838400,"[dp, hashing, implementation, string suffix structures, strings]",PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Group of Students,500.0,A,1381838400,"[brute force, greedy, implementation]",PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Flag Day,1000.0,B,1381838400,"[constructive algorithms, implementation]",PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Knight Tournament,1500.0,C,1381838400,[data structures],PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Xenia and Hamming,2000.0,D,1381838400,[number theory],PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Compartments,2500.0,E,1381838400,[],PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Vasya and Robot,500.0,A,1381678200,"[brute force, greedy, math]",PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Game with Strings,1000.0,B,1381678200,"[bitmasks, dp, games]",PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Vasya and Beautiful Arrays,1500.0,C,1381678200,"[brute force, dp, number theory]",PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Transferring Pyramid,2000.0,D,1381678200,[dp],PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Lucky Number Representation,2500.0,E,1381678200,"[constructive algorithms, dfs and similar, dp]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Digital Root,500.0,A,1381678200,"[constructive algorithms, implementation]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Public Transport,1000.0,B,1381678200,"[greedy, implementation]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Robot,1500.0,C,1381678200,"[brute force, dp]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Game with Strings,2000.0,D,1381678200,[],PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Beautiful Arrays,2500.0,E,1381678200,"[binary search, brute force, data structures]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Domino,500.0,A,1381419000,"[implementation, math]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Two Heaps,1500.0,B,1381419000,"[combinatorics, constructive algorithms, greedy, implementation, math, sortings]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Find Maximum,1000.0,C,1381419000,"[implementation, math, number theory]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Queue,2500.0,D,1381419000,[constructive algorithms],PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Antichain,3000.0,E,1381419000,"[dp, graph matchings, greedy]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Rounding,1000.0,A,1380900600,"[dp, greedy, implementation, math]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Furik,1000.0,B,1380900600,"[combinatorics, dp, probabilities]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Brackets,1500.0,C,1380900600,"[dp, matrices]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Removing Periods,2000.0,D,1380900600,[data structures],PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Permutation,2000.0,E,1380900600,[greedy],PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Digits,500.0,A,1380900600,"[brute force, implementation, math]",PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Periods,1000.0,B,1380900600,"[implementation, sortings]",PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Rounding,1500.0,C,1380900600,"[dp, greedy, implementation]",PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Furik,2000.0,D,1380900600,[math],PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Brackets,2500.0,E,1380900600,[],PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,TL,500.0,A,1380641400,"[brute force, greedy, implementation]",PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Resort,1000.0,B,1380641400,[graphs],PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Bombs,1000.0,C,1380641400,"[greedy, implementation, sortings]",PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Looking for Owls,3000.0,D,1380641400,"[binary search, geometry, hashing, sortings]",PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Wrong Floyd,3000.0,E,1380641400,"[brute force, constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Mafia,500.0,A,1380295800,"[binary search, math, sortings]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Apple Tree,1000.0,B,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Subset Sums,1500.0,C,1380295800,"[brute force, data structures]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Turtles,2000.0,D,1380295800,"[dp, matrices]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Pilgrims,2500.0,E,1380295800,"[dfs and similar, dp, trees]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Cinema Line,500.0,A,1380295800,"[greedy, implementation]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Color the Fence,1000.0,B,1380295800,"[data structures, dp, greedy]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Mafia,1500.0,C,1380295800,[implementation],PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Apple Tree,2000.0,D,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Subset Sums,2500.0,E,1380295800,[],PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Alice and Bob,500.0,A,1379691000,"[games, math, number theory]",PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Lucky Common Subsequence,1000.0,B,1379691000,"[dp, strings]",PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Number Transformation II,1500.0,C,1379691000,"[greedy, math]",PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Robot Control,2000.0,D,1379691000,[shortest paths],PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Doodle Jump,2500.0,E,1379691000,[math],PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Difference Row,500.0,A,1379691000,"[implementation, sortings]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Fixed Points,1000.0,B,1379691000,"[implementation, math]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Alice and Bob,1500.0,C,1379691000,"[games, math, number theory]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Lucky Common Subsequence,2000.0,D,1379691000,"[dp, strings]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Number Transformation II,2500.0,E,1379691000,"[dp, greedy, number theory]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Rational Resistance,500.0,A,1379172600,"[math, number theory]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Alternating Current,1000.0,B,1379172600,"[data structures, greedy, implementation]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Read Time,1500.0,C,1379172600,"[binary search, greedy, two pointers]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Water Tree,2000.0,D,1379172600,"[data structures, dfs and similar, trees]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Pumping Stations,2500.0,E,1379172600,"[brute force, dfs and similar, divide and conquer, flows, greedy]",PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Magnets,500.0,A,1379172600,[implementation],PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Simple Molecules,1000.0,B,1379172600,"[brute force, math]",PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Rational Resistance,1500.0,C,1379172600,[math],PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Alternating Current,2000.0,D,1379172600,"[data structures, greedy, implementation]",PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Read Time,2500.0,E,1379172600,"[binary search, two pointers]",PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Expecting Trouble,,A,1379086800,"[*special, probabilities]",PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Triskaidekaphobia,,B,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Counting Fridays,,C,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Chain Letter,,D,1379086800,"[*special, dfs and similar, graphs]",PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Black Cat Rush,,E,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Superstitions Inspection,,F,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Suffix Subgroup,,G,1379086800,"[*special, strings]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Divisors,500.0,A,1378540800,"[greedy, implementation]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Spies,1000.0,B,1378540800,"[brute force, greedy, implementation]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Cupboard and Balloons,1500.0,C,1378540800,[geometry],PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Dominoes,2000.0,D,1378540800,"[bitmasks, dfs and similar, dp]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Tree,2500.0,E,1378540800,"[data structures, divide and conquer, trees]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,The Wall,500.0,A,1377876600,[math],PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Maximal Area Quadrilateral,3000.0,B,1377876600,"[brute force, geometry]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Tourist Problem,2000.0,C,1377876600,"[combinatorics, implementation, math]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Bubble Sort Graph,2000.0,D,1377876600,"[binary search, data structures, dp]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Iahub and Permutations,3000.0,E,1377876600,"[combinatorics, math]",PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Tourist Problem,500.0,A,1377876600,[math],PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Bubble Sort Graph,500.0,B,1377876600,"[binary search, data structures, dp]",PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Iahub and Permutations,1000.0,C,1377876600,"[combinatorics, dp, math]",PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Iahub and Xors,2500.0,D,1377876600,[data structures],PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Candies Game,3000.0,E,1377876600,"[constructive algorithms, greedy]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Helpful Maths,500.0,A,1377531000,"[greedy, implementation, sortings, strings]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Xenia and Ringroad,1000.0,B,1377531000,[implementation],PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Xenia and Weights,1500.0,C,1377531000,"[constructive algorithms, dfs and similar, dp, greedy]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Xenia and Bit Operations,2000.0,D,1377531000,"[data structures, trees]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Three Swaps,3000.0,E,1377531000,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Puzzles,500.0,A,1376668800,"[dp, graph matchings, greedy]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Routine Problem,1000.0,B,1376668800,"[greedy, math, number theory]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Quiz,1500.0,C,1376668800,"[binary search, greedy, math, matrices, number theory]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Book of Evil,2000.0,D,1376668800,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Divisor Tree,2500.0,E,1376668800,"[brute force, number theory, trees]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Quiz,500.0,A,1376668800,"[greedy, math, number theory]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Book of Evil,1000.0,B,1376668800,"[dfs and similar, dp, trees]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Divisor Tree,1500.0,C,1376668800,"[brute force, dp, number theory]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,GCD Table,2000.0,D,1376668800,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Optimize!,2500.0,E,1376668800,[data structures],PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Triangle,500.0,A,1376062200,"[implementation, math]",PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Fly,1000.0,B,1376062200,[math],PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Sequence,1500.0,C,1376062200,"[brute force, greedy, implementation, number theory]",PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Beautiful Strings,2000.0,D,1376062200,"[combinatorics, math]",PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Painting Square,2500.0,E,1376062200,"[bitmasks, combinatorics, dp, implementation]",PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Banana,500.0,A,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Palindrome,1000.0,B,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,More Reclamation,1000.0,C,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Rectangles and Square,2000.0,D,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Counting Skyscrapers,2500.0,E,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,"Buy One, Get One Free",3000.0,F,1375549200,[],PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Banana,500.0,A,1375549200,"[binary search, constructive algorithms, greedy]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Palindrome,1000.0,B,1375549200,"[constructive algorithms, dp]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,More Reclamation,1000.0,C,1375549200,[games],PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Rectangles and Square,2000.0,D,1375549200,"[brute force, dp]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Counting Skyscrapers,2500.0,E,1375549200,"[dp, math, probabilities]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,"Buy One, Get One Free",3000.0,F,1375549200,"[dp, greedy]",PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Secrets,500.0,A,1374913800,[greedy],PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Chips,1000.0,B,1374913800,[greedy],PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Lucky Tickets,1500.0,C,1374913800,"[brute force, constructive algorithms]",PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Characteristics of Rectangles,2000.0,D,1374913800,"[binary search, bitmasks, brute force, implementation, sortings]",PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Summer Earnings,2500.0,E,1374913800,"[binary search, bitmasks, brute force, geometry, sortings]",PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Candy Bags,500.0,A,1374913800,[implementation],PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Eight Point Sets,1000.0,B,1374913800,[sortings],PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Secrets,1500.0,C,1374913800,[math],PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Chips,2000.0,D,1374913800,"[greedy, implementation, two pointers]",PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Lucky Tickets,2500.0,E,1374913800,[],PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Down the Hatch!,500.0,A,1374679800,[implementation],PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Maximum Absurdity,1000.0,B,1374679800,"[data structures, dp, implementation]",PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Students' Revenge,3000.0,C,1374679800,"[data structures, greedy, sortings]",PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Theft of Blueprints,3000.0,D,1374679800,"[graphs, math]",PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Binary Key,3000.0,E,1374679800,"[dp, greedy, implementation]",PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Purification,500.0,A,1374327000,"[constructive algorithms, greedy]",PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Biridian Forest,1000.0,B,1374327000,"[dfs and similar, shortest paths]",PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Graph Reconstruction,1500.0,C,1374327000,[constructive algorithms],PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,The Evil Temple and the Moving Rocks,1500.0,D,1374327000,[constructive algorithms],PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Evil,2500.0,E,1374327000,[math],PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Cakeminator,500.0,A,1374327000,"[brute force, implementation]",PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Road Construction,1000.0,B,1374327000,"[constructive algorithms, graphs]",PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Purification,1500.0,C,1374327000,[matrices],PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Biridian Forest,2000.0,D,1374327000,"[dfs and similar, implementation, shortest paths]",PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Graph Reconstruction,2500.0,E,1374327000,[],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,30.0,A1,1374075000,"[brute force, implementation]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,70.0,A2,1374075000,"[data structures, sortings]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,30.0,B1,1374075000,[implementation],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,70.0,B2,1374075000,[data structures],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C1,1374075000,[dp],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C2,1374075000,[dp],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,60.0,C3,1374075000,[dp],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D1,1374075000,"[dfs and similar, implementation]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D2,1374075000,[graphs],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,40.0,D3,1374075000,"[data structures, implementation, trees]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E1,1374075000,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E2,1374075000,"[constructive algorithms, dp]",PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,30.0,A1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,70.0,A2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,30.0,B1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,70.0,B2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,60.0,C3,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,40.0,D3,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E2,1374043200,[],PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Square and Rectangles,500.0,A,1373734800,[implementation],PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Stadium and Games,1000.0,B,1373734800,"[binary search, math]",PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Monsters and Diamonds,2000.0,C,1373734800,"[dfs and similar, shortest paths]",PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Reclamation,2000.0,D,1373734800,[dsu],PROGRAMMING
+325,MemSQL start[c]up Round 1,12,The Red Button,2500.0,E,1373734800,"[combinatorics, dfs and similar, dsu, greedy]",PROGRAMMING
+328,Testing Round #8,12,IQ Test,500.0,A,1373662800,[implementation],PROGRAMMING
+328,Testing Round #8,12,Sheldon and Ice Pieces,500.0,B,1373662800,[greedy],PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Flipping Game,500.0,A,1372941000,"[brute force, dp, implementation]",PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Hungry Sequence,500.0,B,1372941000,[math],PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Magic Five,1500.0,C,1372941000,"[combinatorics, math]",PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Block Tower,2000.0,D,1372941000,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Axis Walking,3000.0,E,1372941000,"[bitmasks, combinatorics, constructive algorithms, dp, meet-in-the-middle]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Robot,500.0,A,1372433400,"[binary search, implementation, math]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Duel,1000.0,B,1372433400,"[dp, flows, greedy]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel the Commander,1500.0,C,1372433400,"[constructive algorithms, dfs and similar, divide and conquer, greedy, trees]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Flipboard,2000.0,D,1372433400,"[dp, greedy, math]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Gondolas,2500.0,E,1372433400,"[data structures, divide and conquer, dp]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Dancing,500.0,A,1372433400,[greedy],PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Flowers,1000.0,B,1372433400,"[combinatorics, math]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Robot,1500.0,C,1372433400,"[implementation, math, number theory]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Duel,2000.0,D,1372433400,"[dp, flows, greedy, two pointers]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel the Commander,2500.0,E,1372433400,[divide and conquer],PROGRAMMING
+323,Testing Round #7,12,Black-and-White Cube,500.0,A,1372363200,"[combinatorics, constructive algorithms]",PROGRAMMING
+323,Testing Round #7,12,Tournament-graph,1000.0,B,1372363200,[constructive algorithms],PROGRAMMING
+323,Testing Round #7,12,Two permutations,1500.0,C,1372363200,[data structures],PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Malek Dance Club,500.0,A,1371992400,"[combinatorics, math]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Psychos in a Line,1000.0,B,1371992400,"[data structures, implementation]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Kalila and Dimna in the Logging Industry,1500.0,C,1371992400,"[dp, geometry]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Have You Ever Heard About the Word?,2500.0,D,1371992400,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Ping-Pong,2500.0,E,1371992400,[data structures],PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Magic Numbers,500.0,A,1371992400,"[brute force, greedy]",PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Ping-Pong (Easy Version),1000.0,B,1371992400,"[dfs and similar, graphs]",PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Malek Dance Club,1500.0,C,1371992400,[math],PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Psychos in a Line,2000.0,D,1371992400,[data structures],PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Kalila and Dimna in the Logging Industry,2500.0,E,1371992400,[dp],PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Perfect Pair,500.0,A,1371223800,[brute force],PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Ants,1000.0,B,1371223800,"[brute force, implementation]",PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Balance,2500.0,C,1371223800,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Game with Powers,1500.0,D,1371223800,"[dp, games]",PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Princess and Her Shadow,3000.0,E,1371223800,"[constructive algorithms, shortest paths]",PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Even Odds,500.0,A,1371223800,[math],PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Strings of Power,500.0,B,1371223800,"[implementation, strings, two pointers]",PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Perfect Pair,1000.0,C,1371223800,"[greedy, math]",PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Ants,2500.0,D,1371223800,[dfs and similar],PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Balance,3000.0,E,1371223800,"[constructive algorithms, dfs and similar]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Special Task,30.0,A1,1371042000,[greedy],PROGRAMMING
+316,ABBYY Cup 3.0,12,Special Task,70.0,A2,1371042000,[math],PROGRAMMING
+316,ABBYY Cup 3.0,12,EKG,30.0,B1,1371042000,"[brute force, dfs and similar]",PROGRAMMING
+316,ABBYY Cup 3.0,12,EKG,70.0,B2,1371042000,"[dfs and similar, dp]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Tidying Up,30.0,C1,1371042000,[flows],PROGRAMMING
+316,ABBYY Cup 3.0,12,Tidying Up,70.0,C2,1371042000,"[flows, graph matchings]",PROGRAMMING
+316,ABBYY Cup 3.0,12,PE Lesson,30.0,D1,1371042000,"[brute force, dp]",PROGRAMMING
+316,ABBYY Cup 3.0,12,PE Lesson,40.0,D2,1371042000,[dp],PROGRAMMING
+316,ABBYY Cup 3.0,12,PE Lesson,30.0,D3,1371042000,"[dp, math]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Summer Homework,30.0,E1,1371042000,"[brute force, data structures]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Summer Homework,40.0,E2,1371042000,"[data structures, math]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Summer Homework,30.0,E3,1371042000,"[data structures, math]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F1,1371042000,"[dfs and similar, implementation]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Suns and Rays,40.0,F2,1371042000,[],PROGRAMMING
+316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F3,1371042000,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Good Substrings,30.0,G1,1371042000,"[hashing, strings]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Good Substrings,40.0,G2,1371042000,[string suffix structures],PROGRAMMING
+316,ABBYY Cup 3.0,12,Good Substrings,30.0,G3,1371042000,[string suffix structures],PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Contest,500.0,A,1370619000,[implementation],PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Periods,1000.0,B,1370619000,"[binary search, dfs and similar, strings]",PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Subsequences,1500.0,C,1370619000,"[data structures, dp]",PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Straight Lines,2000.0,D,1370619000,"[binary search, data structures, geometry, sortings, two pointers]",PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Squares,2500.0,E,1370619000,[dp],PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Bottles,500.0,A,1370619000,[brute force],PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Array,1000.0,B,1370619000,[implementation],PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Contest,1500.0,C,1370619000,"[dp, greedy, implementation]",PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Periods,2000.0,D,1370619000,"[dfs and similar, strings]",PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Subsequences,2500.0,E,1370619000,"[combinatorics, data structures]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Bank Account,500.0,A,1369927800,"[implementation, number theory]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Queries,1000.0,B,1369927800,"[dp, implementation]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Matrix,1500.0,C,1369927800,"[constructive algorithms, greedy, implementation, sortings]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Roads,2500.0,D,1369927800,[dp],PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Two Numbers,2500.0,E,1369927800,"[constructive algorithms, data structures, dsu, greedy]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,The Closest Pair,500.0,A,1369582200,"[constructive algorithms, implementation]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Cats Transport,1000.0,B,1369582200,"[data structures, dp]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Fetch the Treasure,1500.0,C,1369582200,"[brute force, data structures, shortest paths]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Interval Cubing,2000.0,D,1369582200,"[data structures, math]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Biologist,2500.0,E,1369582200,[flows],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Whose sentence is it?,500.0,A,1369582200,[implementation],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Archer,1000.0,B,1369582200,"[math, probabilities]",PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,The Closest Pair,1500.0,C,1369582200,[constructive algorithms],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Cats Transport,2000.0,D,1369582200,[],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Fetch the Treasure,2500.0,E,1369582200,[],PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Strange Addition,500.0,A,1368968400,"[brute force, constructive algorithms]",PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Continued Fractions,1000.0,B,1368968400,"[brute force, math]",PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Ivan and Powers of Two,1500.0,C,1368968400,[],PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Olya and Graph,2000.0,D,1368968400,"[combinatorics, math]",PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Playing with String,2500.0,E,1368968400,[games],PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Morning run,500.0,A,1368803400,"[binary search, math, two pointers]",PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Context Advertising,500.0,B,1368803400,[two pointers],PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Memory for Arrays,1000.0,C,1368803400,"[binary search, bitmasks, greedy]",PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Tennis Rackets,2000.0,D,1368803400,"[brute force, geometry]",PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Sheep,2500.0,E,1368803400,"[binary search, greedy]",PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Morning run,500.0,A,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Context Advertising,500.0,B,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Memory for Arrays,1000.0,C,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Tennis Rackets,2000.0,D,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Sheep,2500.0,E,1368784800,[],PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Lucky Permutation Triple,500.0,A,1368363600,"[constructive algorithms, implementation, math]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Rectangle Puzzle II,500.0,B,1368363600,"[implementation, math]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Minimum Modular,2000.0,C,1368363600,"[brute force, math]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Rotatable Number,2500.0,D,1368363600,"[math, number theory]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Random Ranking,3000.0,E,1368363600,[dp],PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Pythagorean Theorem II,500.0,A,1368363600,"[brute force, math]",PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Calendar,1000.0,B,1368363600,"[brute force, implementation]",PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Lucky Permutation Triple,1000.0,C,1368363600,[constructive algorithms],PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Rectangle Puzzle II,2000.0,D,1368363600,"[math, ternary search]",PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Minimum Modular,3000.0,E,1368363600,[math],PROGRAMMING
+306,Testing Round #6,12,Candies,500.0,A,1368302400,[implementation],PROGRAMMING
+306,Testing Round #6,12,Optimizer,1000.0,B,1368302400,"[data structures, greedy, sortings]",PROGRAMMING
+306,Testing Round #6,12,"White, Black and White Again",1500.0,C,1368302400,"[combinatorics, number theory]",PROGRAMMING
+306,Testing Round #6,12,Polygon,2000.0,D,1368302400,"[constructive algorithms, geometry]",PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Sequence,500.0,A,1367769900,[constructive algorithms],PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Time,1000.0,B,1367769900,"[binary search, graphs, shortest paths]",PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Algorithm,1500.0,C,1367769900,[constructive algorithms],PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Divisors,2000.0,D,1367769900,[data structures],PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Arrangements,2500.0,E,1367769900,[dp],PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Eugeny and Array,500.0,A,1367769900,[implementation],PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Eugeny and Play List,1000.0,B,1367769900,"[binary search, implementation, two pointers]",PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Yaroslav and Sequence,1500.0,C,1367769900,[constructive algorithms],PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Yaroslav and Time,2000.0,D,1367769900,"[binary search, dfs and similar, dp, shortest paths]",PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Yaroslav and Algorithm,2500.0,E,1367769900,[],PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Array,500.0,A,1366903800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Coach,1000.0,B,1366903800,"[brute force, dfs and similar]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Beautiful Numbers,2000.0,C,1366903800,"[brute force, combinatorics]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Painting Square,3000.0,D,1366903800,"[dp, fft]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Empire Strikes Back,3000.0,E,1366903800,"[binary search, math]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Weird Game,500.0,A,1366644900,"[games, greedy]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Distinct Paths,1500.0,B,1366644900,"[brute force, combinatorics]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Cube Problem,1500.0,C,1366644900,"[brute force, math, number theory]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Ksusha and Square,2000.0,D,1366644900,"[geometry, math, probabilities, two pointers]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Close Vertices,2500.0,E,1366644900,"[data structures, divide and conquer, trees]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha and Array,500.0,A,1366644600,"[brute force, number theory, sortings]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha the Squirrel,1000.0,B,1366644600,"[brute force, implementation]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Weird Game,1500.0,C,1366644600,"[games, greedy]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Distinct Paths,2500.0,D,1366644600,[],PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Cube Problem,2500.0,E,1366644600,[],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Parity Game,500.0,A,1366385400,[constructive algorithms],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Fish Weight,500.0,B,1366385400,"[constructive algorithms, greedy]",PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Splitting the Uniqueness,2000.0,C,1366385400,[constructive algorithms],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Color the Carpet,2500.0,D,1366385400,[constructive algorithms],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Mystic Carvings,3000.0,E,1366385400,[data structures],PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Snow Footprints,500.0,A,1366385400,"[greedy, implementation]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Sail,500.0,B,1366385400,"[brute force, greedy, implementation]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Parity Game,1500.0,C,1366385400,"[combinatorics, constructive algorithms, math, number theory]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Fish Weight,1500.0,D,1366385400,"[greedy, math, sortings]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Splitting the Uniqueness,3000.0,E,1366385400,"[constructive algorithms, sortings]",PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,SMSC,1000.0,A,1366040100,[implementation],PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Network Topology,1000.0,B,1366040100,"[graphs, implementation]",PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Beautiful IP Addresses,1500.0,C,1366040100,[brute force],PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Connected Components,2000.0,D,1366040100,"[data structures, dfs and similar, dp, dsu]",PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Copying Data,2500.0,E,1366040100,[data structures],PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Spyke Talks,500.0,A,1365796800,"[implementation, sortings]",PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Command Line Arguments,1000.0,B,1365796800,"[implementation, strings]",PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Network Mask,1500.0,C,1365796800,"[brute force, implementation]",PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Parallel Programming,2000.0,D,1365796800,[greedy],PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Tree-String Problem,2500.0,E,1365796800,"[dfs and similar, hashing, strings]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Array,500.0,A,1365694200,"[data structures, implementation]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Graph,1000.0,B,1365694200,"[dp, graphs, shortest paths]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Friends,1500.0,C,1365694200,"[combinatorics, dp, graphs, shortest paths]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Caves,2000.0,D,1365694200,"[combinatorics, dp]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Yaroslav and Points,2500.0,E,1365694200,[data structures],PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Yaroslav and Permutations,500.0,A,1365694200,"[greedy, math]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Yaroslav and Two Strings,1500.0,B,1365694200,"[combinatorics, dp]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Greg and Array,1500.0,C,1365694200,"[data structures, dp, implementation]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Greg and Graph,2000.0,D,1365694200,"[dp, graphs]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Greg and Friends,2500.0,E,1365694200,"[combinatorics, dfs and similar, dp]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Oskols,500.0,A,1365348600,"[implementation, math]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Bookshelf,1000.0,B,1365348600,"[dp, greedy]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Lights,1500.0,C,1365348600,"[combinatorics, number theory]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Painter Robot,2000.0,D,1365348600,"[brute force, implementation, number theory]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass the Great,2500.0,E,1365348600,"[dp, trees]",PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Strings,500.0,A,1364916600,[greedy],PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Houses ,1000.0,B,1364916600,[combinatorics],PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and XOR operation,1500.0,C,1364916600,"[implementation, math]",PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Trees ,2000.0,D,1364916600,"[combinatorics, dfs and similar, trees]",PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Lucky Numbers,2500.0,E,1364916600,"[dp, implementation, math]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Segments ,500.0,A,1364916600,"[brute force, implementation]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Matrix,1000.0,B,1364916600,"[brute force, dp, implementation, sortings, ternary search]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Strings,1500.0,C,1364916600,"[constructive algorithms, implementation]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Houses ,2000.0,D,1364916600,"[brute force, combinatorics, dfs and similar, math]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and XOR operation,2500.0,E,1364916600,"[data structures, greedy, implementation, math]",PROGRAMMING
+290,April Fools Day Contest 2013,12,Mysterious strings,,A,1364830200,"[*special, implementation]",PROGRAMMING
+290,April Fools Day Contest 2013,12,QR code,,B,1364830200,"[*special, implementation]",PROGRAMMING
+290,April Fools Day Contest 2013,12,WTF?,,C,1364830200,"[*special, graph matchings, implementation, trees]",PROGRAMMING
+290,April Fools Day Contest 2013,12,Orange,,D,1364830200,"[*special, implementation]",PROGRAMMING
+290,April Fools Day Contest 2013,12,HQ,,E,1364830200,"[*special, constructive algorithms]",PROGRAMMING
+290,April Fools Day Contest 2013,12,Greedy Petya,,F,1364830200,"[*special, dfs and similar, graphs, greedy]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Lucky Permutation,500.0,A,1364025600,"[constructive algorithms, math]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Shifting,1500.0,B,1364025600,[implementation],PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Main Sequence,1500.0,C,1364025600,"[greedy, implementation]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Tourists,2000.0,D,1364025600,"[data structures, sortings]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Ladies' Shop,2500.0,E,1364025600,"[constructive algorithms, fft, math]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,IQ Test,500.0,A,1364025600,"[brute force, implementation]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Pipeline,1500.0,B,1364025600,"[binary search, math]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Lucky Permutation,1500.0,C,1364025600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Shifting,2500.0,D,1364025600,[],PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Main Sequence,2500.0,E,1364025600,"[data structures, greedy]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Slightly Decreasing Permutations,500.0,A,1363879800,"[greedy, implementation]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Find Marble,1000.0,B,1363879800,[implementation],PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Building Permutation,1500.0,C,1363879800,"[greedy, implementation, sortings]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Permutation Sum,2000.0,D,1363879800,"[bitmasks, combinatorics, dp, implementation, meet-in-the-middle]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Positions in Permutations,2500.0,E,1363879800,"[combinatorics, dp, math]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cows and Sequence,1000.0,A,1363534200,"[constructive algorithms, implementation]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cow Program,1000.0,B,1363534200,"[dfs and similar, dp, graphs]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Coin Troubles,1500.0,C,1363534200,[dp],PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cows and Cool Sequences,2000.0,D,1363534200,"[dp, math, number theory]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cow Tennis Tournament,2500.0,E,1363534200,"[combinatorics, data structures, math]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cows and Primitive Roots,500.0,A,1363534200,"[implementation, math, number theory]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cows and Poker Game,1000.0,B,1363534200,"[brute force, implementation]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cows and Sequence,2000.0,C,1363534200,"[constructive algorithms, data structures, dp]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cow Program,2000.0,D,1363534200,"[dfs and similar, dp]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Coin Troubles,2500.0,E,1363534200,"[dfs and similar, dp]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Bit++,500.0,A,1363188600,[implementation],PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Painting Eggs,1000.0,B,1363188600,"[greedy, math]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,XOR and OR,1500.0,C,1363188600,"[constructive algorithms, implementation, math]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Yet Another Number Game,2000.0,D,1363188600,"[dp, games]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Sausage Maximization,2500.0,E,1363188600,"[bitmasks, data structures, trees]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Rectangle Puzzle,500.0,A,1362929400,[geometry],PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Maximum Xor Secondary,1000.0,B,1362929400,"[data structures, implementation, two pointers]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Game on Tree,1500.0,C,1362929400,"[implementation, math, probabilities, trees]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,k-Maximum Subsequence Sum,2000.0,D,1362929400,"[data structures, flows]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Sequence Transformation,2500.0,E,1362929400,"[data structures, dp, implementation, math]",PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Word Capitalization,500.0,A,1362929400,[strings],PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Nearest Fraction,1000.0,B,1362929400,"[brute force, implementation, two pointers]",PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Rectangle Puzzle,1500.0,C,1362929400,"[geometry, implementation]",PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Maximum Xor Secondary,2000.0,D,1362929400,[two pointers],PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Game on Tree,2500.0,E,1362929400,[math],PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Point on Spiral,500.0,A,1362411000,"[brute force, geometry, implementation]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Books,1000.0,B,1362411000,"[binary search, brute force, implementation, two pointers]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Ladder,1500.0,C,1362411000,"[dp, implementation, two pointers]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,The Minimum Number of Variables,2000.0,D,1362411000,"[bitmasks, dp]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Beautiful Decomposition,2000.0,E,1362411000,"[games, greedy]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Learning Languages,500.0,A,1362065400,"[dfs and similar, dsu]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Set of Points,1500.0,B,1362065400,"[constructive algorithms, geometry]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Game,2000.0,C,1362065400,"[games, implementation]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Google Code Jam,3000.0,D,1362065400,"[dp, probabilities]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Binary Tree on Plane,2000.0,E,1362065400,[flows],PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Circle Line,500.0,A,1362065400,[implementation],PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,New Problem,1000.0,B,1362065400,"[brute force, strings]",PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Learning Languages,1000.0,C,1362065400,[dsu],PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Set of Points,3000.0,D,1362065400,"[constructive algorithms, geometry]",PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Game,3000.0,E,1362065400,[games],PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Lunch Rush,500.0,A,1361719800,[implementation],PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Game,1000.0,B,1361719800,"[games, greedy]",PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum Sum,1500.0,C,1361719800,"[data structures, implementation, sortings]",PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum XOR,2000.0,D,1361719800,"[bitmasks, dp, greedy, implementation, math]",PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Problem on Trees,2500.0,E,1361719800,"[data structures, trees]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,k-Multiple Free Set,500.0,A,1361374200,"[binary search, greedy, sortings]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,Zero Tree,1000.0,B,1361374200,"[dfs and similar, dp, greedy, trees]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,The Last Hole!,1500.0,C,1361374200,"[brute force, geometry]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,Lovely Matrix,2000.0,D,1361374200,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,Mirror Room,2000.0,E,1361374200,"[data structures, implementation]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,Lights Out,500.0,A,1361374200,[implementation],PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,Convex Shape,1000.0,B,1361374200,"[constructive algorithms, implementation]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,k-Multiple Free Set,1500.0,C,1361374200,"[binary search, greedy, sortings]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,Zero Tree,2000.0,D,1361374200,"[dfs and similar, dp, trees]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,The Last Hole!,2500.0,E,1361374200,[],PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Friends,500.0,A,1360769400,"[implementation, math]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Sequence,1000.0,B,1360769400,"[implementation, math]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Staircase,1500.0,C,1360769400,"[data structures, implementation]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Two Sequences,2000.0,D,1360769400,"[combinatorics, math, sortings]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Horses,2500.0,E,1360769400,"[combinatorics, constructive algorithms, graphs]",PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Staircase,500.0,A,1360769400,[],PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Two Sequences,1000.0,B,1360769400,[combinatorics],PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Horses,1500.0,C,1360769400,"[graphs, greedy]",PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Figure,2000.0,D,1360769400,[dp],PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Game,2500.0,E,1360769400,"[dp, games]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Beautiful Year,500.0,A,1360596600,[brute force],PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Prime Matrix,1000.0,B,1360596600,"[binary search, brute force, math, number theory]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Secret,1500.0,C,1360596600,"[constructive algorithms, implementation]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Good Substrings,2000.0,D,1360596600,"[data structures, strings]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Three Horses,3000.0,E,1360596600,"[constructive algorithms, math, number theory]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Magical Boxes,500.0,A,1359732600,"[greedy, math]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Greenhouse Effect,1000.0,B,1359732600,[dp],PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Flawed Flow,1500.0,C,1359732600,"[constructive algorithms, flows, graphs]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Maximum Waterfall,2000.0,D,1359732600,"[data structures, dp]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,String Theory,2500.0,E,1359732600,[],PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Fancy Fence,500.0,A,1359732600,"[geometry, implementation, math]",PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Multithreading,1500.0,B,1359732600,"[data structures, greedy, implementation]",PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Magical Boxes,1500.0,C,1359732600,"[binary search, greedy, implementation, math, sortings]",PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Greenhouse Effect,2000.0,D,1359732600,[dp],PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Flawed Flow,2500.0,E,1359732600,"[dfs and similar, sortings]",PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Games,500.0,A,1359387000,[brute force],PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Buttons,1000.0,B,1359387000,"[implementation, math]",PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Beautiful Sets of Points,1500.0,C,1359387000,"[constructive algorithms, implementation]",PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Wall Bars,2500.0,D,1359387000,[dp],PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Playlist,2500.0,E,1359387000,"[math, probabilities, sortings]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,Stones on the Table,500.0,A,1358868600,[implementation],PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,Queue at the School,500.0,B,1358868600,"[constructive algorithms, graph matchings, implementation, shortest paths]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,Below the Diagonal,2500.0,C,1358868600,"[constructive algorithms, greedy, math]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,BerDonalds,3000.0,D,1358868600,"[graphs, math, shortest paths]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,More Queries to Array...,3000.0,E,1358868600,"[data structures, math]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Escape from Stones,500.0,A,1358686800,"[constructive algorithms, data structures, implementation, two pointers]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Good Sequences,1000.0,B,1358686800,"[dp, number theory]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Choosing Balls,1500.0,C,1358686800,[dp],PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Colorful Stones,2000.0,D,1358686800,"[dp, two pointers]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Roadside Trees,2500.0,E,1358686800,"[data structures, dp]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Colorful Stones (Simplified Edition),500.0,A,1358686800,[implementation],PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Roadside Trees (Simplified Edition),1000.0,B,1358686800,"[greedy, implementation]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Escape from Stones,1500.0,C,1358686800,"[greedy, implementation]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Good Sequences,2000.0,D,1358686800,"[dp, number theory]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Choosing Balls,2500.0,E,1358686800,"[schedules, sortings]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Beautiful Matrix,500.0,A,1358350200,[implementation],PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Squares,500.0,B,1358350200,"[greedy, implementation, sortings]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Circle of Numbers,2500.0,C,1358350200,"[dfs and similar, implementation]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Cycle in Graph,2000.0,D,1358350200,"[dfs and similar, graphs]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Rhombus,3000.0,E,1358350200,"[brute force, data structures, dp]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Discounts,500.0,A,1358091000,"[greedy, sortings]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Restaurant,1000.0,B,1358091000,"[dp, math, probabilities]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Matrix,1500.0,C,1358091000,"[constructive algorithms, dp, math]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Increasing Subsequence,2000.0,D,1358091000,[dp],PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Calculator,2500.0,E,1358091000,"[brute force, dp, two pointers]",PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Roma and Lucky Numbers,500.0,A,1358091000,[implementation],PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Roma and Changing Signs,1000.0,B,1358091000,[greedy],PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Maxim and Discounts,1500.0,C,1358091000,"[greedy, sortings]",PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Maxim and Restaurant,2000.0,D,1358091000,"[combinatorics, dp]",PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Maxim and Matrix,2500.0,E,1358091000,[dp],PROGRAMMING
+267,Codeforces Testing Round #5,12,Subtractions,500.0,A,1358002800,"[math, number theory]",PROGRAMMING
+267,Codeforces Testing Round #5,12,Dominoes,1000.0,B,1358002800,"[dfs and similar, graphs]",PROGRAMMING
+267,Codeforces Testing Round #5,12,Berland Traffic,1500.0,C,1358002800,"[math, matrices]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Sockets,500.0,A,1357659000,"[greedy, implementation, sortings]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Playing Cubes,500.0,B,1357659000,"[games, greedy, implementation]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,View Angle,1500.0,C,1357659000,"[brute force, geometry, math]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Sum,2000.0,D,1357659000,"[greedy, math]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Greedy Elevator,3000.0,E,1357659000,"[data structures, implementation]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Adding Digits,500.0,A,1356622500,"[implementation, math]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Ancient Prophesy,1000.0,B,1356622500,"[brute force, implementation, strings]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Balls and Boxes,1500.0,C,1356622500,"[greedy, implementation]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Black and White Tree,2000.0,D,1356622500,"[constructive algorithms, dsu, graphs, greedy, trees]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Dividing Kingdom,2500.0,E,1356622500,"[binary search, brute force, data structures]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Bits,500.0,A,1356190200,"[greedy, math]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Elections,1000.0,B,1356190200,"[brute force, combinatorics, dp]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and LCM,1500.0,C,1356190200,"[binary search, combinatorics, dp, math]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Broken Sorting,2000.0,D,1356190200,"[dp, math, probabilities]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Tree,2500.0,E,1356190200,"[data structures, dfs and similar, trees]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Chess,500.0,A,1356190200,"[brute force, strings]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Magic Square,1000.0,B,1356190200,"[brute force, implementation]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Bits,1500.0,C,1356190200,"[greedy, strings]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Elections,2000.0,D,1356190200,"[brute force, combinatorics, dp, math]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and LCM,2500.0,E,1356190200,"[binary search, combinatorics, math]",PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Almost Arithmetical Progression,500.0,A,1355671800,"[binary search, dp, two pointers]",PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Mr. Bender and Square,1000.0,B,1355671800,"[binary search, brute force, math]",PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Furlo and Rublo and Game,1500.0,C,1355671800,[games],PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Liars and Serge,2000.0,D,1355671800,[dp],PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Lucky Arrays,2500.0,E,1355671800,[data structures],PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Greg's Workout,500.0,A,1355671800,[implementation],PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Code Parsing,1000.0,B,1355671800,[implementation],PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Almost Arithmetical Progression,1500.0,C,1355671800,"[brute force, dp]",PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Mr. Bender and Square,2000.0,D,1355671800,"[binary search, implementation, math]",PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Furlo and Rublo and Game,2500.0,E,1355671800,"[games, implementation, math]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Cards with Numbers,500.0,A,1355047200,"[constructive algorithms, sortings]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Jury Size,1000.0,B,1355047200,"[brute force, implementation]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Anagram,1500.0,C,1355047200,[greedy],PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Rats,2000.0,D,1355047200,"[brute force, dfs and similar, implementation]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Dormitory,2500.0,E,1355047200,"[dp, implementation]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Boys and Girls,500.0,A,1354960800,[greedy],PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Physics Practical,1000.0,B,1354960800,"[binary search, dp, two pointers]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Text Editor,1500.0,C,1354960800,"[data structures, dfs and similar, greedy, shortest paths]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Table with Letters - 2,2000.0,D,1354960800,"[brute force, two pointers]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Printer,2500.0,E,1354960800,"[binary search, data structures, implementation, sortings]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Points on Line,500.0,A,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Playing with Permutations,1000.0,B,1354807800,"[implementation, math]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Number Transformation,1500.0,C,1354807800,"[dp, greedy, number theory]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Two Sets,2000.0,D,1354807800,"[bitmasks, math]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Tree and Table,2500.0,E,1354807800,"[dfs and similar, dp, implementation, trees]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Little Xor,500.0,A,1354807800,"[brute force, implementation]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Unsorting Array,1000.0,B,1354807800,"[brute force, sortings]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Points on Line,1500.0,C,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Playing with Permutations,2000.0,D,1354807800,"[brute force, combinatorics, implementation]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Number Transformation,2500.0,E,1354807800,"[dp, number theory]",PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Paper Work,500.0,A,1353938400,[greedy],PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Restoring IPv6,1000.0,B,1353938400,"[implementation, strings]",PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Movie Critics,1500.0,C,1353938400,[greedy],PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Building Bridge,1500.0,D,1353938400,"[geometry, ternary search, two pointers]",PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Mad Joe,2000.0,E,1353938400,[brute force],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Paper Work,500.0,A,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Restoring IPv6,1000.0,B,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Movie Critics,1500.0,C,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Building Bridge,1500.0,D,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Mad Joe,2000.0,E,1353927300,[],PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Cupboards,500.0,A,1353857400,[implementation],PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Chilly Willy,1000.0,B,1353857400,"[math, number theory]",PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Robo-Footballer,2000.0,C,1353857400,"[binary search, geometry]",PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Sweets for Everyone!,2000.0,D,1353857400,"[binary search, greedy, implementation]",PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Piglet's Birthday,2500.0,E,1353857400,"[dp, probabilities]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Robo-Footballer,1000.0,A,1353857400,[geometry],PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Sweets for Everyone!,1000.0,B,1353857400,"[binary search, greedy]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Piglet's Birthday,1500.0,C,1353857400,"[dp, probabilities]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Donkey and Stars,1500.0,D,1353857400,"[data structures, dp, math, sortings]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Endless Matrix,2500.0,E,1353857400,[math],PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Buggy Sorting,500.0,A,1353511800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Increase and Decrease,1000.0,B,1353511800,"[greedy, math]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Beauty Pageant,1500.0,C,1353511800,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Colorful Graph,2000.0,D,1353511800,"[brute force, dfs and similar, graphs]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Blood Cousins Return,2500.0,E,1353511800,"[binary search, data structures, dfs and similar, dp, sortings]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,System Administrator,,A,1353339000,[implementation],PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Internet Address,,B,1353339000,"[implementation, strings]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Game with Coins,,C,1353339000,[greedy],PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Restoring Table,,D,1353339000,"[constructive algorithms, greedy]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Mishap in Club,,E,1353339000,[implementation],PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Log Stream Analysis,,F,1353339000,"[binary search, brute force, implementation, strings]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Suggested Friends,,G,1353339000,"[brute force, graphs]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Queries for Number of Palindromes,,H,1353339000,"[dp, hashing, strings]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,The Brand New Function,500.0,A,1353079800,[bitmasks],PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Hydra,1000.0,B,1353079800,"[graphs, sortings]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Colorado Potato Beetle,1500.0,C,1353079800,"[dfs and similar, implementation]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Cubes,2000.0,D,1353079800,"[data structures, dp, geometry, two pointers]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Matrix,2500.0,E,1353079800,[data structures],PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Dividing Orange,500.0,A,1353079800,[implementation],PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Undoubtedly Lucky Numbers,1000.0,B,1353079800,"[bitmasks, brute force, dfs and similar]",PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,The Brand New Function,1500.0,C,1353079800,"[bitmasks, divide and conquer, math]",PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Hydra,2000.0,D,1353079800,[],PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Colorado Potato Beetle,2500.0,E,1353079800,[],PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,Heads or Tails,500.0,A,1352647800,"[brute force, implementation]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,Big Segment,1000.0,B,1352647800,"[implementation, sortings]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,King's Path,1500.0,C,1352647800,"[dfs and similar, hashing, shortest paths]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,Dispute,2000.0,D,1352647800,"[dfs and similar, greedy]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,XOR on Segment,2500.0,E,1352647800,"[bitmasks, data structures]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Not Wool Sequences,500.0,A,1352044800,"[constructive algorithms, math]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Boring Partition,1000.0,B,1352044800,[constructive algorithms],PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,World Eater Brothers,1500.0,C,1352044800,"[dfs and similar, dp, greedy, trees]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Tape Programming,2000.0,D,1352044800,"[data structures, implementation]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Meeting Her,2500.0,E,1352044800,"[dp, graphs, shortest paths]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Two Bags of Potatoes,500.0,A,1352044800,"[greedy, implementation, math]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Easy Tape Programming,1000.0,B,1352044800,"[brute force, implementation]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Not Wool Sequences,1500.0,C,1352044800,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Boring Partition,2000.0,D,1352044800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,World Eater Brothers,2500.0,E,1352044800,[],PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Old Peykan,,A,1351783800,[greedy],PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Friends,,B,1351783800,"[binary search, bitmasks, data structures, math]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Mirror Box,,C,1351783800,"[geometry, implementation]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Numbers,,D,1351783800,[],PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Flights,,E,1351783800,"[graphs, shortest paths]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Race,,F,1351783800,"[brute force, implementation]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Challenging Balloons,,G,1351783800,[constructive algorithms],PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Free Cash,500.0,A,1351179000,[implementation],PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Young Table,1000.0,B,1351179000,"[implementation, sortings]",PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Primes on Interval,1500.0,C,1351179000,"[binary search, number theory, two pointers]",PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,T-decomposition,2000.0,D,1351179000,"[dfs and similar, graphs, greedy]",PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Build String,2500.0,E,1351179000,"[flows, graphs]",PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,LCM Challenge,500.0,A,1350803400,[number theory],PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Let's Play Osu!,1000.0,B,1350803400,"[dp, math, probabilities]",PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Cyclical Quest,1500.0,C,1350803400,"[string suffix structures, strings]",PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Graph Game,2000.0,D,1350803400,[graphs],PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Number Challenge,2500.0,E,1350803400,"[combinatorics, dp, implementation, number theory]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Boy or Girl,500.0,A,1350803400,[implementation],PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Easy Number Challenge,1000.0,B,1350803400,"[implementation, number theory]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,LCM Challenge,1500.0,C,1350803400,"[greedy, number theory]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Let's Play Osu!,2000.0,D,1350803400,"[dp, probabilities]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Cyclical Quest,2500.0,E,1350803400,[],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Lefthanders and Righthanders ,,A,1350370800,[implementation],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Reading,,B,1350370800,[sortings],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Weather,,C,1350370800,"[dp, implementation]",PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Cinema,,D,1350370800,[implementation],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Champions' League,,E,1350370800,[implementation],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Fence,,F,1350370800,[dp],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Practice,,G,1350370800,"[constructive algorithms, divide and conquer, implementation]",PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Merging Two Decks,,H,1350370800,"[constructive algorithms, greedy]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Cinema,,A,1350370800,[implementation],PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Fence,,B,1350370800,[dp],PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Practice,,C,1350370800,"[constructive algorithms, implementation]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Merging Two Decks,,D,1350370800,"[constructive algorithms, greedy]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Road Repairs,,E,1350370800,"[dfs and similar, graphs, greedy]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,TorCoder,,F,1350370800,[data structures],PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Cycles,500.0,A,1349969400,"[binary search, constructive algorithms, graphs, greedy]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Table,1000.0,B,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Doe Graphs,1500.0,C,1349969400,"[constructive algorithms, divide and conquer, dp, graphs, shortest paths]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Fence,2000.0,D,1349969400,"[binary search, data structures, string suffix structures]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Quick Tortoise,2500.0,E,1349969400,"[bitmasks, divide and conquer, dp]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Perfect Permutation,500.0,A,1349969400,"[implementation, math]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Non-square Equation,1000.0,B,1349969400,"[binary search, brute force, math]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Cycles,1500.0,C,1349969400,"[combinatorics, graphs, matrices]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Table,2000.0,D,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Doe Graphs,2500.0,E,1349969400,[],PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,Team,500.0,A,1349623800,"[brute force, greedy]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,"Magic, Wizardry and Wonders",1000.0,B,1349623800,"[constructive algorithms, greedy]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,To Add or Not to Add,1500.0,C,1349623800,"[binary search, sortings, two pointers]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,Magic Box,2000.0,D,1349623800,"[brute force, geometry]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,Cactus,2500.0,E,1349623800,"[data structures, dfs and similar, dp, graphs, trees]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Shifts,500.0,A,1349105400,"[brute force, two pointers]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Planets,500.0,B,1349105400,"[binary search, data structures, shortest paths]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Triangles,1000.0,C,1349105400,"[combinatorics, graphs, math]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Towers,1000.0,D,1349105400,"[dp, greedy, two pointers]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Gifts,3000.0,E,1349105400,"[combinatorics, dp, probabilities]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Dragons,500.0,A,1349105400,"[greedy, sortings]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,T-primes,500.0,B,1349105400,"[implementation, math, number theory]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Shifts,1500.0,C,1349105400,"[binary search, data structures, dp, implementation]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Planets,2500.0,D,1349105400,"[binary search, graphs, shortest paths]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Triangles,3000.0,E,1349105400,"[combinatorics, graphs, math]",PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Is your horseshoe on the other hoof?,500.0,A,1348759800,[implementation],PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Two Tables,1000.0,B,1348759800,"[brute force, implementation]",PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Fractal Detector,1500.0,C,1348759800,"[dp, hashing]",PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Zigzag,2000.0,D,1348759800,[data structures],PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,The Road to Berland is Paved With Good Intentions,2500.0,E,1348759800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Flying Saucer Segments,500.0,A,1348500600,[math],PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Naughty Stone Piles,1000.0,B,1348500600,[greedy],PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Anniversary,1500.0,C,1348500600,"[data structures, implementation, math, matrices, number theory]",PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,The table,2000.0,D,1348500600,"[constructive algorithms, greedy]",PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Noble Knight's Path,2500.0,E,1348500600,"[data structures, trees]",PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Where do I Turn?,500.0,A,1348500600,[geometry],PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Effective Approach,1000.0,B,1348500600,[implementation],PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Flying Saucer Segments,1500.0,C,1348500600,[math],PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Naughty Stone Piles,2000.0,D,1348500600,"[math, sortings]",PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Anniversary,2500.0,E,1348500600,"[matrices, number theory]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Dice Tower,500.0,A,1348069500,"[constructive algorithms, greedy]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Well-known Numbers,1000.0,B,1348069500,"[binary search, greedy, number theory]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Barcode,1500.0,C,1348069500,"[dp, matrices]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Snake,3000.0,D,1348069500,"[bitmasks, dfs and similar, graphs, implementation]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Unsolvable,3000.0,E,1348069500,"[math, number theory]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Bracket Sequence,500.0,A,1347809400,"[data structures, expression parsing, implementation]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Two Strings,1000.0,B,1347809400,"[data structures, dp, strings]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Partial Sums,1500.0,C,1347809400,"[combinatorics, math]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Spider,2000.0,D,1347809400,"[geometry, graphs]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Planar Graph,2500.0,E,1347809400,"[flows, geometry, graphs]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Parallelepiped,500.0,A,1347809400,"[brute force, math]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Array,1000.0,B,1347809400,"[bitmasks, implementation, two pointers]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Bracket Sequence,1500.0,C,1347809400,[data structures],PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Two Strings,2000.0,D,1347809400,"[data structures, strings]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Partial Sums,2500.0,E,1347809400,"[combinatorics, math]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Shooshuns and Sequence ,500.0,A,1347291900,"[brute force, implementation]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Cosmic Tables,1000.0,B,1347291900,[implementation],PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Reducing Fractions,1500.0,C,1347291900,"[implementation, number theory, sortings]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Olympiad,2000.0,D,1347291900,"[binary search, greedy, sortings, two pointers]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Decoding Genome,2500.0,E,1347291900,[matrices],PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Problem,500.0,A,1346427000,"[implementation, sortings]",PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Array,1000.0,B,1346427000,"[constructive algorithms, data structures]",PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Shifts,1500.0,C,1346427000,[data structures],PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Triangle,2000.0,D,1346427000,"[chinese remainder theorem, geometry, math]",PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Inversions,2500.0,E,1346427000,"[data structures, two pointers]",PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Function,500.0,A,1346427000,"[implementation, math]",PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Numbers,1000.0,B,1346427000,[implementation],PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Problem,1500.0,C,1346427000,[sortings],PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Array,2000.0,D,1346427000,[data structures],PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Shifts,2500.0,E,1346427000,[],PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,k-String,500.0,A,1346081400,"[implementation, strings]",PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Special Offer! Super Price 999 Bourles!,1000.0,B,1346081400,[implementation],PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Color Stripe,1500.0,C,1346081400,"[brute force, dp, greedy]",PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Choosing Capital for Treeland,2000.0,D,1346081400,"[dfs and similar, dp, trees]",PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Parking Lot,3000.0,E,1346081400,[data structures],PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Ice Skating,500.0,A,1345273500,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Blackboard Fibonacci,1000.0,B,1345273500,"[brute force, math]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Formurosa,2500.0,C,1345273500,"[divide and conquer, dp, expression parsing]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Bitonix' Patrol,3000.0,D,1345273500,"[bitmasks, brute force, combinatorics, dfs and similar, math]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Alien DNA,3000.0,E,1345273500,"[data structures, dsu, trees]",PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Mountain Scenery,500.0,A,1345273500,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Airport,500.0,B,1345273500,[implementation],PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Ice Skating,1000.0,C,1345273500,"[dfs and similar, dsu, graphs]",PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Blackboard Fibonacci,3000.0,D,1345273500,[implementation],PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Formurosa,3000.0,E,1345273500,[],PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Tiling with Hexagons,500.0,A,1344958200,"[implementation, math]",PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Forming Teams,1500.0,B,1344958200,"[dfs and similar, implementation]",PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Hiring Staff,2000.0,C,1344958200,[greedy],PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Spider's Web,2000.0,D,1344958200,"[binary search, sortings, two pointers]",PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Martian Luck,3000.0,E,1344958200,"[math, number theory]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Bicycle Chain,500.0,A,1344267000,"[brute force, implementation]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Olympic Medal,500.0,B,1344267000,"[greedy, math]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Crosses,3000.0,C,1344267000,"[brute force, implementation]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Hot Days,2000.0,D,1344267000,[greedy],PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Periodical Numbers,3000.0,E,1344267000,"[combinatorics, dp, number theory]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Game,1000.0,A,1343662200,"[dfs and similar, greedy]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Numbers,1000.0,B,1343662200,"[combinatorics, dp]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Relay Race,1500.0,C,1343662200,[dp],PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Stars,2000.0,D,1343662200,"[constructive algorithms, geometry]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Two Permutations,2500.0,E,1343662200,"[data structures, hashing, strings]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,System of Equations,500.0,A,1343662200,[brute force],PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Hometask,1000.0,B,1343662200,"[brute force, constructive algorithms, greedy, math]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Game,2000.0,C,1343662200,"[brute force, greedy]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Numbers,2000.0,D,1343662200,"[combinatorics, dp, math]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Relay Race,2500.0,E,1343662200,[dp],PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Dubstep,500.0,A,1343057400,[strings],PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Solitaire,2000.0,B,1343057400,"[dfs and similar, dp]",PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Police Station,2500.0,C,1343057400,"[dp, graphs, shortest paths]",PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,"Prizes, Prizes, more Prizes",500.0,D,1343057400,[implementation],PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Blood Cousins,3000.0,E,1343057400,"[binary search, data structures, dfs and similar, trees]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Privatization,3000.0,A,1342450800,"[flows, graphs]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Polycarpus is Looking for Good Substrings,2000.0,B,1342450800,"[bitmasks, hashing, implementation]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Cowboys,1500.0,C,1342450800,"[dp, math]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Cutting a Fence,2500.0,D,1342450800,"[binary search, data structures, dsu]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,IT Restaurants,500.0,E,1342450800,"[dfs and similar, dp, trees]",PROGRAMMING
+211,VK Cup 2012 Finals,12,Privatization,3000.0,A,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,Polycarpus is Looking for Good Substrings,1000.0,B,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,Cowboys,500.0,C,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,Cutting a Fence,1000.0,D,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,IT Restaurants,500.0,E,1342335600,[],PROGRAMMING
+209,"VK Cup 2012 Finals, Practice Session",12,Multicolored Marbles,500.0,A,1342252500,"[dp, math]",PROGRAMMING
+209,"VK Cup 2012 Finals, Practice Session",12,Pixels,500.0,B,1342252500,"[constructive algorithms, math]",PROGRAMMING
+209,"VK Cup 2012 Finals, Practice Session",12,Trails and Glades,1000.0,C,1342252500,"[constructive algorithms, dsu, graphs, greedy]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Interval,500.0,A,1342020600,"[binary search, combinatorics, dp]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Cards,500.0,B,1342020600,"[binary search, data structures]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Furik and Rubik,1500.0,C,1342020600,"[math, probabilities]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Retro Strings,2000.0,D,1342020600,[dp],PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Strings,2500.0,E,1342020600,"[data structures, implementation, string suffix structures, two pointers]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Rozdil,500.0,A,1342020600,"[brute force, implementation]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Sorting,1000.0,B,1342020600,"[brute force, greedy]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Interval,1500.0,C,1342020600,"[binary search, brute force, combinatorics, dp, math]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Cards,1500.0,D,1342020600,"[binary search, brute force, sortings]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Furik and Rubik,2500.0,E,1342020600,"[brute force, combinatorics, probabilities]",PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,20.0,A1,1341730800,[greedy],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,30.0,A2,1341730800,[greedy],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,50.0,A3,1341730800,[greedy],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,20.0,B1,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,30.0,B2,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,50.0,B3,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,20.0,C1,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,30.0,C2,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,50.0,C3,1341730800,[data structures],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D1,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D10,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D2,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D3,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D4,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D5,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D6,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D7,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D8,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D9,1341730800,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,20.0,A1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,30.0,A2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,50.0,A3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Military Trainings,20.0,B1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Military Trainings,30.0,B2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Military Trainings,50.0,B3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,20.0,C1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,30.0,C2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,50.0,C3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D10,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D4,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D5,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D6,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D7,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D8,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D9,1341576900,[],PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Two Problems,500.0,A,1341329400,"[brute force, implementation]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Game on Paper,1000.0,B,1341329400,"[brute force, implementation]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Photographer,1500.0,C,1341329400,"[greedy, sortings]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Hit Ball,2000.0,D,1341329400,"[geometry, implementation, math]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Transportation,2500.0,E,1341329400,"[greedy, sortings, two pointers]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Clear Symmetry,1000.0,A,1340983800,"[constructive algorithms, dp, math]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Guess That Car!,1000.0,B,1340983800,"[math, ternary search]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Fragile Bridges,1500.0,C,1340983800,[dp],PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Brand New Problem,2000.0,D,1340983800,"[bitmasks, brute force, dp]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Thoroughly Bureaucratic Organization,2500.0,E,1340983800,"[binary search, combinatorics]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,LLPS,500.0,A,1340983800,"[binary search, bitmasks, brute force, greedy, implementation, strings]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Brand New Easy Problem,1000.0,B,1340983800,[brute force],PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Clear Symmetry,2000.0,C,1340983800,"[binary search, math]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Guess That Car!,2000.0,D,1340983800,"[dp, math]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Fragile Bridges,2500.0,E,1340983800,"[data structures, dp]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Cinema,3000.0,A,1340551800,"[brute force, data structures]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Drinks,500.0,B,1340551800,"[implementation, math]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Football Championship,2000.0,C,1340551800,"[brute force, implementation]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Programming Language,1500.0,D,1340551800,"[binary search, brute force, expression parsing, implementation]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Tractor College,3000.0,E,1340551800,"[implementation, math, number theory, ternary search]",PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,About Bacteria,500.0,A,1340379000,"[implementation, math]",PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Jumping on Walls,1000.0,B,1340379000,[shortest paths],PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Delivering Carcinogen,1500.0,C,1340379000,"[binary search, geometry]",PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Cube Snake,2000.0,D,1340379000,[constructive algorithms],PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Gripping Story,2500.0,E,1340379000,"[binary search, data structures, sortings]",PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Hexadecimal's theorem,500.0,A,1340379000,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Special Olympics,1000.0,B,1340379000,[geometry],PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,About Bacteria,1500.0,C,1340379000,[math],PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Jumping on Walls,2000.0,D,1340379000,"[dfs and similar, shortest paths]",PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Delivering Carcinogen,2500.0,E,1340379000,"[binary search, geometry]",PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Lexicographically Maximum Subsequence,500.0,A,1339506000,[greedy],PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Infinite Maze,1000.0,B,1339506000,[dfs and similar],PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Paint Tree,1500.0,C,1339506000,"[divide and conquer, geometry, sortings, trees]",PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,The Next Good String,3000.0,D,1339506000,"[data structures, greedy, hashing, strings]",PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Opening Portals,2500.0,E,1339506000,"[dsu, graphs, shortest paths]",PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Plate Game,1000.0,A,1339506000,"[constructive algorithms, games, math]",PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Limit,500.0,B,1339506000,[math],PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Lexicographically Maximum Subsequence,500.0,C,1339506000,"[greedy, implementation, sortings]",PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Infinite Maze,3000.0,D,1339506000,[hashing],PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Paint Tree,3000.0,E,1339506000,"[constructive algorithms, dfs and similar, geometry]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Let's Watch Football,500.0,A,1339342200,"[binary search, brute force, math]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,After Training,1000.0,B,1339342200,"[data structures, implementation, math]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Try and Catch,1500.0,C,1339342200,"[expression parsing, implementation]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Analyzing Polyline,2000.0,D,1339342200,"[math, sortings]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Building Forest,2500.0,E,1339342200,"[data structures, dsu]",PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Cutting Figure,500.0,A,1338737400,"[2-sat, chinese remainder theorem, trees]",PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Xor,1000.0,B,1338737400,[brute force],PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Hamming Distance,2000.0,C,1338737400,"[constructive algorithms, greedy, math, matrices]",PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Two Segments,2000.0,D,1338737400,[data structures],PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Fibonacci Number,2500.0,E,1338737400,"[brute force, math, matrices]",PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Exams,500.0,A,1338737400,"[implementation, math]",PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Square,1000.0,B,1338737400,[math],PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Cutting Figure,1500.0,C,1338737400,"[dfs and similar, graphs, implementation, matrices, strings]",PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Xor,2000.0,D,1338737400,[],PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Hamming Distance,3000.0,E,1338737400,[math],PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Dynasty Puzzles,500.0,A,1338132600,[dp],PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Demonstration,1000.0,B,1338132600,[greedy],PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Fools and Roads,1500.0,C,1338132600,"[data structures, dfs and similar, trees]",PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Metro Scheme,2000.0,D,1338132600,"[graphs, greedy]",PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Thwarting Demonstrations,2500.0,E,1338132600,"[binary search, data structures, trees]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Funky Numbers,500.0,A,1338132600,"[binary search, brute force, implementation]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Walking in the Rain,1000.0,B,1338132600,"[brute force, implementation]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Dynasty Puzzles,1500.0,C,1338132600,[dp],PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Demonstration,2000.0,D,1338132600,"[brute force, constructive algorithms]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Fools and Roads,2500.0,E,1338132600,"[data structures, trees]",PROGRAMMING
+188,Surprise Language Round #6,12,Hexagonal Numbers,,A,1337959800,[*special],PROGRAMMING
+188,Surprise Language Round #6,12,A + Reverse B,,B,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,LCM,,C,1337959800,"[*special, implementation, math]",PROGRAMMING
+188,Surprise Language Round #6,12,Asterisks,,D,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,HQ9+,,E,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,Binary Notation,,F,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,Array Sorting,,G,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,Stack,,H,1337959800,"[*special, expression parsing, implementation]",PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Vasya and the Bus,500.0,A,1337182200,"[greedy, math]",PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Surrounded,1000.0,B,1337182200,[geometry],PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,STL,1500.0,C,1337182200,[dfs and similar],PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Non-Secret Cypher,2000.0,D,1337182200,[two pointers],PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Counter Attack,2500.0,E,1337182200,"[data structures, dsu, graphs, hashing, sortings]",PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,Permutations,500.0,A,1336663800,[greedy],PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,AlgoRace,1000.0,B,1336663800,"[dp, shortest paths]",PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,Weak Memory,1500.0,C,1336663800,"[dfs and similar, dsu]",PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,BRT Contract ,2000.0,D,1336663800,[data structures],PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,Heaven Tour,2500.0,E,1336663800,"[data structures, greedy]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Cut Ribbon,500.0,A,1336663800,"[brute force, dp]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Counting Rhombi,1000.0,B,1336663800,"[brute force, math]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Permutations,1500.0,C,1336663800,"[greedy, implementation]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,AlgoRace,2000.0,D,1336663800,"[dp, shortest paths]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Weak Memory,2500.0,E,1336663800,"[binary search, shortest paths]",PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Plant,500.0,A,1336145400,[math],PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Mushroom Scientists,1000.0,B,1336145400,"[math, ternary search]",PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Clever Fat Rat,1500.0,C,1336145400,[dp],PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Visit of the Great,2000.0,D,1336145400,"[math, number theory]",PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Soap Time! - 2,2500.0,E,1336145400,"[binary search, data structures]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Comparing Strings,500.0,A,1336145400,"[implementation, strings]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Growing Mushrooms,1000.0,B,1336145400,"[greedy, sortings]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Plant,1500.0,C,1336145400,"[dp, math, matrices, number theory]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Mushroom Scientists,2000.0,D,1336145400,"[math, number theory, probabilities]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Clever Fat Rat,2500.0,E,1336145400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Educational Game,20.0,A1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Educational Game,30.0,A2,1335614400,[greedy],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Educational Game,50.0,A3,1335614400,[greedy],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,20.0,B1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,30.0,B2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,50.0,B3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,20.0,C1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,30.0,C2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,50.0,C3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Magic Squares,20.0,D1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Magic Squares,30.0,D2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Magic Squares,50.0,D3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,20.0,E1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,30.0,E2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,50.0,E3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,20.0,F1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,30.0,F2,1335614400,"[dp, sortings, strings]",PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,50.0,F3,1335614400,[],PROGRAMMING
+183,Croc Champ 2012 - Final,12,Headquarters,500.0,A,1335532800,"[constructive algorithms, math]",PROGRAMMING
+183,Croc Champ 2012 - Final,12,Zoo,1000.0,B,1335532800,"[brute force, geometry]",PROGRAMMING
+183,Croc Champ 2012 - Final,12,Cyclic Coloring,1500.0,C,1335532800,[dfs and similar],PROGRAMMING
+183,Croc Champ 2012 - Final,12,T-shirt,2000.0,D,1335532800,"[dp, greedy, probabilities]",PROGRAMMING
+183,Croc Champ 2012 - Final,12,Candy Shop,2500.0,E,1335532800,[greedy],PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Battlefield,3000.0,A,1335280200,"[geometry, graphs, implementation, shortest paths]",PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Vasya's Calendar,500.0,B,1335280200,[implementation],PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Optimal Sum,3000.0,C,1335280200,"[data structures, greedy]",PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Common Divisors,1000.0,D,1335280200,"[brute force, hashing, implementation, math, strings]",PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Wooden Fence,1500.0,E,1335280200,[dp],PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Defragmentation,,A,1335078000,[implementation],PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Divisibility Rules,,B,1335078000,"[math, number theory]",PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Letter,,C,1335078000,[dp],PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Name,,D,1335078000,"[greedy, strings]",PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Cubes,,E,1335078000,"[binary search, dp, two pointers]",PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Mathematical Analysis Rocks!,,F,1335078000,"[constructive algorithms, implementation, math]",PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,30.0,A1,1335016800,[implementation],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,70.0,A2,1335016800,[implementation],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,30.0,B1,1335016800,[number theory],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,70.0,B2,1335016800,[number theory],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Party,30.0,C1,1335016800,"[dfs and similar, dsu, graphs]",PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Party,70.0,C2,1335016800,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,30.0,D1,1335016800,[brute force],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,70.0,D2,1335016800,[data structures],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Space Voyage,30.0,E1,1335016800,[binary search],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Space Voyage,70.0,E2,1335016800,[binary search],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Script Generation,30.0,F1,1335016800,[],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Script Generation,70.0,F2,1335016800,[],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,30.0,G1,1335016800,[strings],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,70.0,G2,1335016800,"[matrices, strings]",PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Trading Business,500.0,A,1334934300,"[greedy, sortings]",PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Word Cut,1000.0,B,1334934300,[dp],PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Playing with Superglue,1500.0,C,1334934300,"[combinatorics, constructive algorithms]",PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Hyper String,2000.0,D,1334934300,[dp],PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Archaeology,2500.0,E,1334934300,"[data structures, dfs and similar, trees]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Series of Crimes,500.0,A,1334934300,"[brute force, geometry, implementation]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Number of Triplets,1000.0,B,1334934300,"[binary search, brute force]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Trading Business,1500.0,C,1334934300,"[games, graph matchings, greedy]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Word Cut,2000.0,D,1334934300,[dp],PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Playing with Superglue,2500.0,E,1334934300,[games],PROGRAMMING
+175,Codeforces Round #115,12,Robot Bicorn Attack,500.0,A,1334390400,"[brute force, implementation]",PROGRAMMING
+175,Codeforces Round #115,12,Plane of Tanks: Pro,500.0,B,1334390400,[implementation],PROGRAMMING
+175,Codeforces Round #115,12,Geometry Horse,1000.0,C,1334390400,"[greedy, implementation, sortings]",PROGRAMMING
+175,Codeforces Round #115,12,Plane of Tanks: Duel,2500.0,D,1334390400,"[brute force, dp, math, probabilities]",PROGRAMMING
+175,Codeforces Round #115,12,Power Defence,3000.0,E,1334390400,"[brute force, dp, geometry, greedy]",PROGRAMMING
+175,Codeforces Round #115,12,Gnomes of Might and Magic,3000.0,F,1334390400,"[data structures, graphs, implementation, shortest paths]",PROGRAMMING
+164,VK Cup 2012 Round 3,12,"Variable, or There and Back Again",500.0,A,1333897500,"[dfs and similar, graphs]",PROGRAMMING
+164,VK Cup 2012 Round 3,12,Ancient Berland Hieroglyphs,1000.0,B,1333897500,[two pointers],PROGRAMMING
+164,VK Cup 2012 Round 3,12,Machine Programming,1500.0,C,1333897500,[flows],PROGRAMMING
+164,VK Cup 2012 Round 3,12,Minimum Diameter,2500.0,D,1333897500,"[binary search, brute force]",PROGRAMMING
+164,VK Cup 2012 Round 3,12,Polycarpus and Tasks,2500.0,E,1333897500,[],PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Problem About Equation,500.0,A,1333897500,[math],PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,File List,1000.0,B,1333897500,"[dp, greedy, implementation]",PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Range Increments,1500.0,C,1333897500,"[data structures, greedy]",PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,"Variable, or There and Back Again",2500.0,D,1333897500,[graphs],PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Ancient Berland Hieroglyphs,3000.0,E,1333897500,[],PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Rock-Paper-Scissors,500.0,A,1333724400,"[implementation, math]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Chamber of Secrets,1000.0,B,1333724400,"[dfs and similar, shortest paths]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Spiral Maximum,1500.0,C,1333724400,"[brute force, dp]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Deputies,2000.0,D,1333724400,"[constructive algorithms, graphs, greedy, implementation]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Camping Groups,2500.0,E,1333724400,"[data structures, sortings]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Phone Code,1000.0,A,1333440000,"[brute force, implementation]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Pseudorandom Sequence Period,1000.0,B,1333440000,"[implementation, number theory]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Bus,1500.0,C,1333440000,"[implementation, sortings]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Calendar Reform,1500.0,D,1333440000,[number theory],PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,BHTML+BCSS,2000.0,E,1333440000,"[dfs and similar, expression parsing]",PROGRAMMING
+171,April Fools Day Contest,12,Mysterious numbers - 1,,A,1333292400,"[*special, constructive algorithms]",PROGRAMMING
+171,April Fools Day Contest,12,Star,,B,1333292400,"[*special, combinatorics]",PROGRAMMING
+171,April Fools Day Contest,12,A Piece of Cake,,C,1333292400,"[*special, implementation]",PROGRAMMING
+171,April Fools Day Contest,12,Broken checker,,D,1333292400,"[*special, brute force]",PROGRAMMING
+171,April Fools Day Contest,12,MYSTERIOUS LANGUAGE,,E,1333292400,[*special],PROGRAMMING
+171,April Fools Day Contest,12,ucyhf,,F,1333292400,"[*special, brute force, implementation, number theory]",PROGRAMMING
+171,April Fools Day Contest,12,Mysterious numbers - 2,,G,1333292400,[*special],PROGRAMMING
+171,April Fools Day Contest,12,A polyline,,H,1333292400,"[*special, implementation]",PROGRAMMING
+170,VK Cup 2012 Wild-card Round 2,12,Placing Rectangles,,A,1332954000,[*special],PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Trolleybuses,500.0,A,1332860400,[implementation],PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Huge Prize,1000.0,B,1332860400,"[dp, probabilities]",PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Numbers,1500.0,C,1332860400,"[games, math]",PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Roads,2000.0,D,1332860400,"[data structures, divide and conquer, graph matchings]",PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Bets,2500.0,E,1332860400,"[math, matrices]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Demonstration,500.0,A,1332860400,"[implementation, math]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Minimal Spell,1000.0,B,1332860400,"[implementation, strings]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Trolleybuses,1500.0,C,1332860400,"[implementation, math]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Huge Prize,2000.0,D,1332860400,"[dp, probabilities]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Numbers,2500.0,E,1332860400,[],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Substring and Subsequence,1000.0,A,1332687900,[dp],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Lemmings,1000.0,B,1332687900,[binary search],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Conveyor,1500.0,C,1332687900,[sortings],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Large Refrigerator,2000.0,D,1332687900,[brute force],PROGRAMMING
+163,VK Cup 2012 Round 2,12,e-Government,2500.0,E,1332687900,"[data structures, dfs and similar, dp, strings, trees]",PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Chores,500.0,A,1332687900,[sortings],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Replacing Digits,1000.0,B,1332687900,[greedy],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Substring and Subsequence,1500.0,C,1332687900,[dp],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Lemmings,2000.0,D,1332687900,[],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Conveyor,2500.0,E,1332687900,[],PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Rank List,500.0,A,1332516600,"[binary search, implementation, sortings]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Polygons,3000.0,B,1332516600,"[geometry, sortings]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Median,1000.0,C,1332516600,"[greedy, math, sortings]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Shoe Store,3000.0,D,1332516600,"[dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Tetrahedron,1000.0,E,1332516600,"[dp, math, matrices]",PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Pentagonal numbers,,A,1332083400,"[*special, implementation]",PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Binary notation,,B,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Prime factorization,,C,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Remove digits,,D,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,HQ9+,,E,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Factorial zeros,,F,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Non-decimal sum,,G,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Alternating case,,H,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Truncatable primes,,I,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Brackets,,J,1332083400,[*special],PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Supercentral Point,500.0,A,1331911800,[implementation],PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Burning Midnight Oil,1000.0,B,1331911800,"[binary search, implementation]",PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Another Problem on Strings,1500.0,C,1331911800,"[binary search, brute force, dp, math, strings, two pointers]",PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Beard Graph,2000.0,D,1331911800,"[data structures, dsu, trees]",PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Compatible Numbers,2500.0,E,1331911800,"[bitmasks, brute force, dfs and similar, dp]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Dress'em in Vests!,1000.0,A,1331478300,"[binary search, brute force, greedy, two pointers]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Discounts,1000.0,B,1331478300,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Abracadabra,2000.0,C,1331478300,[divide and conquer],PROGRAMMING
+161,VK Cup 2012 Round 1,12,Distance in Tree,2000.0,D,1331478300,"[dfs and similar, dp, trees]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Polycarpus the Safecracker,2500.0,E,1331478300,"[brute force, dp]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Friends or Not,500.0,A,1331280000,"[*special, greedy, implementation]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Matchmaker,1000.0,B,1331280000,"[greedy, sortings]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,String Manipulation 1.0,1500.0,C,1331280000,"[binary search, brute force, data structures, strings]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Palindrome pairs,2000.0,D,1331280000,"[*special, brute force, dp, strings]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Zebra Tower,2500.0,E,1331280000,"[data structures, greedy, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Twins,500.0,A,1331046000,"[greedy, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Unlucky Ticket,1000.0,B,1331046000,"[greedy, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Find Pair,1500.0,C,1331046000,"[implementation, math, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Edges in MST,2000.0,D,1331046000,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Buses and People,2500.0,E,1331046000,"[binary search, data structures, sortings]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Next Round,500.0,A,1330804800,[implementation],PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Taxi,1000.0,B,1330804800,"[greedy, implementation]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Cd and pwd commands,1000.0,C,1330804800,"[data structures, implementation]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Ice Sculptures,1500.0,D,1330804800,"[brute force, number theory]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Phone Talks,2000.0,E,1330804800,"[dp, sortings]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Message,500.0,A,1330536600,[brute force],PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Suspects,1000.0,B,1330536600,"[constructive algorithms, data structures, implementation]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Cipher,1500.0,C,1330536600,"[combinatorics, dp]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Clues,2500.0,D,1330536600,"[combinatorics, graphs]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Mrs. Hudson's Pancakes,2500.0,E,1330536600,"[brute force, dp]",PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Game Outcome,500.0,A,1330536600,[brute force],PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Trace,1000.0,B,1330536600,"[geometry, sortings]",PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Message,1500.0,C,1330536600,"[brute force, dp, strings]",PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Suspects,2000.0,D,1330536600,[implementation],PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Cipher,2500.0,E,1330536600,"[dp, math]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Hometask,500.0,A,1330095600,[greedy],PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Colliders,1000.0,B,1330095600,"[math, number theory]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Double Profiles,1500.0,C,1330095600,"[graphs, hashing, sortings]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Flatland Fencing,2000.0,D,1330095600,"[games, math]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Martian Colony,2500.0,E,1330095600,[geometry],PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,I_love_\%username\%,500.0,A,1330095600,[brute force],PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Combination,1000.0,B,1330095600,"[greedy, sortings]",PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Hometask,1500.0,C,1330095600,"[dp, greedy]",PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Colliders,2000.0,D,1330095600,"[math, number theory]",PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Double Profiles,2500.0,E,1330095600,"[hashing, sortings]",PROGRAMMING
+153,Surprise Language Round #5,12,A + B,,A,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Binary notation,,B,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Caesar Cipher,,C,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Date Change,,D,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Euclidean Distance,,E,1329922800,[*special],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Marks,500.0,A,1329750000,[implementation],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Steps,1000.0,B,1329750000,"[binary search, implementation]",PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Pocket Book,1500.0,C,1329750000,[combinatorics],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Frames,2500.0,D,1329750000,[brute force],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Garden,2500.0,E,1329750000,"[bitmasks, dp, graphs, trees]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Win or Freeze,500.0,A,1329490800,"[games, number theory]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Quantity of Strings,500.0,B,1329490800,"[combinatorics, dfs and similar, math]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Smart Cheater,1000.0,C,1329490800,"[data structures, math, probabilities]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Mission Impassable,1500.0,D,1329490800,[dp],PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Freezing with Style,3000.0,E,1329490800,"[binary search, data structures, divide and conquer, trees]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Soft Drinking,500.0,A,1329490800,"[implementation, math]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Phone Numbers,1000.0,B,1329490800,"[implementation, strings]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Win or Freeze,1500.0,C,1329490800,"[games, greedy, number theory]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Quantity of Strings,1500.0,D,1329490800,"[combinatorics, dsu]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Smart Cheater,3000.0,E,1329490800,[],PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Business trip,500.0,A,1328886000,"[greedy, implementation, sortings]",PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Martian Clock,1000.0,B,1328886000,[implementation],PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Division into Teams,1500.0,C,1328886000,"[greedy, math, sortings]",PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Coloring Brackets,2500.0,D,1328886000,[dp],PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Martian Strings,2500.0,E,1328886000,"[string suffix structures, strings]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Insomnia cure,1000.0,A,1328198400,"[constructive algorithms, implementation, math]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Escape,1000.0,B,1328198400,"[implementation, math]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Terse princess,1000.0,C,1328198400,"[constructive algorithms, greedy]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Bag of mice,1000.0,D,1328198400,"[dp, games, math, probabilities]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Porcelain,1000.0,E,1328198400,[dp],PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Conversion,500.0,A,1327215600,"[greedy, implementation]",PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Number 2,1000.0,B,1327215600,[constructive algorithms],PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Subsequence,1500.0,C,1327215600,"[combinatorics, dp, math]",PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Pair,2500.0,D,1327215600,"[combinatorics, data structures, implementation]",PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Queries,2500.0,E,1327215600,[data structures],PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Ticket,500.0,A,1327215600,[implementation],PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Mask,1000.0,B,1327215600,"[brute force, implementation]",PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Conversion,1500.0,C,1327215600,[greedy],PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Number 2,2000.0,D,1327215600,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Subsequence,2500.0,E,1327215600,"[combinatorics, dp]",PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Arrival of the General,500.0,A,1326899100,[implementation],PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Meeting,1000.0,B,1326899100,[implementation],PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Anagram Search,1500.0,C,1326899100,"[implementation, strings]",PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Missile Silos,2000.0,D,1326899100,"[data structures, dfs and similar, graphs, shortest paths]",PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Competition,2500.0,E,1326899100,"[data structures, greedy]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Farmer,500.0,A,1326380700,"[brute force, math]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help General,1000.0,B,1326380700,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Caretaker,1500.0,C,1326380700,"[brute force, dp]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Shrek and Donkey 2,2000.0,D,1326380700,[games],PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Greg the Dwarf 2,2500.0,E,1326380700,[geometry],PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Vasilisa the Wise 2,500.0,A,1326380700,"[brute force, math]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Kingdom of Far Far Away 2,1000.0,B,1326380700,"[implementation, strings]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Farmer,1500.0,C,1326380700,"[implementation, math]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help General,2000.0,D,1326380700,"[graph matchings, greedy, math]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Caretaker,2500.0,E,1326380700,[],PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Amusing Joke,500.0,A,1326034800,"[implementation, sortings, strings]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Hopscotch,1000.0,B,1326034800,"[geometry, math]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Queue,2000.0,C,1326034800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Take-off Ramps,2000.0,D,1326034800,"[graphs, shortest paths]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Clearing Up,2500.0,E,1326034800,"[constructive algorithms, dp, dsu, graphs]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Table,500.0,A,1325689200,"[geometry, math]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Cards,1000.0,B,1325689200,"[brute force, greedy, implementation]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Snowmen,1500.0,C,1325689200,"[binary search, data structures, greedy]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Contest,2000.0,D,1325689200,"[greedy, sortings]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Garland,2500.0,E,1325689200,"[combinatorics, dp]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Snowflake,3000.0,F,1325689200,"[geometry, sortings]",PROGRAMMING
+147,Codeforces Testing Round #4,12,Punctuation,500.0,A,1325602800,"[implementation, strings]",PROGRAMMING
+147,Codeforces Testing Round #4,12,Smile House,1000.0,B,1325602800,"[binary search, graphs, matrices]",PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Literature Lesson,500.0,A,1324728000,[implementation],PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Digits Permutations,1000.0,B,1324728000,[greedy],PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Mushroom Gnomes - 2,2000.0,C,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,World of Darkraft,2000.0,D,1324728000,"[dp, games]",PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Hellish Constraints,2500.0,E,1324728000,"[brute force, dp, two pointers]",PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Petr and Book,500.0,A,1324728000,[implementation],PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Wallpaper,1000.0,B,1324728000,"[implementation, math]",PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Literature Lesson,1500.0,C,1324728000,"[implementation, strings]",PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Digits Permutations,2000.0,D,1324728000,[implementation],PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Mushroom Gnomes - 2,3000.0,E,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Postcards and photos,500.0,A,1324015200,[implementation],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Permutation,1000.0,B,1324015200,[greedy],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,History,1500.0,C,1324015200,[sortings],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Palindromes,2000.0,D,1324015200,[dp],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Last Chance,2500.0,E,1324015200,"[data structures, implementation]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Replacement,500.0,A,1323443100,"[implementation, sortings]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Rectangle and Square,1000.0,B,1323443100,"[brute force, geometry, math]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Zero-One,1500.0,C,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Cycle,2000.0,D,1323443100,"[brute force, dfs and similar, implementation]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Weak Subsequence,2500.0,E,1323443100,[combinatorics],PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Presents,500.0,A,1323443100,[implementation],PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Ternary Logic,1000.0,B,1323443100,"[implementation, math]",PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Replacement,1500.0,C,1323443100,"[implementation, sortings]",PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Rectangle and Square,2000.0,D,1323443100,"[geometry, implementation]",PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Zero-One,2500.0,E,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Turing Tape,500.0,A,1322924400,[implementation],PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Piet,1500.0,B,1322924400,[implementation],PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Logo Turtle,1500.0,C,1322924400,[dp],PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Constants in the language of Shakespeare,2000.0,D,1322924400,"[constructive algorithms, dp, greedy]",PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Bits of merry old England,2500.0,E,1322924400,[flows],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,HQ9+,500.0,A,1322924400,[implementation],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Unary,1000.0,B,1322924400,[implementation],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Turing Tape,1500.0,C,1322924400,"[implementation, math]",PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Piet,2500.0,D,1322924400,[implementation],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Logo Turtle,2500.0,E,1322924400,"[dp, implementation]",PROGRAMMING
+134,Codeforces Testing Round #3,12,Average Numbers,500.0,A,1322838000,"[brute force, implementation]",PROGRAMMING
+134,Codeforces Testing Round #3,12,Pairs of Numbers,1000.0,B,1322838000,"[brute force, dfs and similar, math, number theory]",PROGRAMMING
+134,Codeforces Testing Round #3,12,Swaps,1500.0,C,1322838000,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,cAPS lOCK,500.0,A,1322233200,"[implementation, strings]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Opposites Attract,1000.0,B,1322233200,"[implementation, math]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,The World is a Theatre,1500.0,C,1322233200,"[combinatorics, math]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Subway,2000.0,D,1322233200,"[dfs and similar, graphs]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Yet Another Task with Queens,2500.0,E,1322233200,[sortings],PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Present to Mom,2500.0,F,1322233200,"[binary search, two pointers]",PROGRAMMING
+130,Unknown Language Round #4,12,Hexagonal numbers,,A,1321801200,"[*special, implementation]",PROGRAMMING
+130,Unknown Language Round #4,12,Gnikool Ssalg,,B,1321801200,"[*special, implementation, strings]",PROGRAMMING
+130,Unknown Language Round #4,12,Decimal sum,,C,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Exponentiation,,D,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Tribonacci numbers,,E,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Prime factorization,,F,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,CAPS LOCK ON,,G,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Balanced brackets,,H,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Array sorting,,I,1321801200,"[*special, sortings]",PROGRAMMING
+130,Unknown Language Round #4,12,Date calculation,,J,1321801200,[*special],PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Statues,1000.0,A,1321337400,[dfs and similar],PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,String,1500.0,B,1321337400,"[brute force, constructive algorithms, hashing, string suffix structures, strings]",PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Games with Rectangle,1500.0,C,1321337400,"[combinatorics, dp]",PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Numbers,2000.0,D,1321337400,[constructive algorithms],PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Birthday,2500.0,E,1321337400,"[geometry, math]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Cookies,500.0,A,1321337400,[implementation],PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Students and Shoelaces,1000.0,B,1321337400,"[brute force, dfs and similar, graphs]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Statues,2000.0,C,1321337400,"[dfs and similar, graphs, implementation]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,String,2500.0,D,1321337400,"[implementation, string suffix structures, strings]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Games with Rectangle,2500.0,E,1321337400,"[combinatorics, dp]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Hot Bath,500.0,A,1320858000,"[binary search, brute force, math]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Password,1000.0,B,1320858000,"[binary search, dp, hashing, string suffix structures, strings]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,E-reader Display,1500.0,C,1320858000,"[constructive algorithms, greedy]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Fibonacci Sums,2000.0,D,1320858000,"[dp, math]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Pills,2500.0,E,1320858000,"[brute force, flows]",PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Wasted Time,500.0,A,1320858000,[geometry],PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Canvas Frames,1000.0,B,1320858000,[implementation],PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Hot Bath,1500.0,C,1320858000,"[binary search, math]",PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Password,2000.0,D,1320858000,"[hashing, strings]",PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,E-reader Display,2500.0,E,1320858000,[implementation],PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Prime Permutation,1000.0,A,1320333000,"[implementation, number theory, strings]",PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Squares,1000.0,B,1320333000,[math],PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Brackets,1500.0,C,1320333000,"[combinatorics, dp, greedy]",PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,String,2000.0,D,1320333000,[string suffix structures],PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Maze,2500.0,E,1320333000,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,The number of positions,500.0,A,1320333000,[math],PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Permutations,1000.0,B,1320333000,"[brute force, combinatorics, implementation]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Prime Permutation,2000.0,C,1320333000,"[constructive algorithms, dfs and similar, dsu, greedy, number theory, sortings, strings]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Squares,2000.0,D,1320333000,"[brute force, constructive algorithms, number theory]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Brackets,2500.0,E,1320333000,[],PROGRAMMING
+125,Codeforces Testing Round #2,12,Measuring Lengths in Baden,1000.0,A,1319893200,[math],PROGRAMMING
+125,Codeforces Testing Round #2,12,Simple XML,1500.0,B,1319893200,[implementation],PROGRAMMING
+125,Codeforces Testing Round #2,12,Hobbits' Party,2000.0,C,1319893200,"[constructive algorithms, greedy]",PROGRAMMING
+125,Codeforces Testing Round #2,12,Two progressions,3000.0,D,1319893200,"[constructive algorithms, greedy]",PROGRAMMING
+125,Codeforces Testing Round #2,12,MST Company,5000.0,E,1319893200,"[binary search, graphs]",PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Sum,500.0,A,1319727600,[implementation],PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Transformation,1000.0,B,1319727600,[strings],PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Permutation,1500.0,C,1319727600,"[brute force, combinatorics, number theory]",PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Segments,2000.0,D,1319727600,"[binary search, implementation, two pointers]",PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Array,2500.0,E,1319727600,[data structures],PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Division,500.0,A,1319727600,"[brute force, number theory]",PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Substring,1000.0,B,1319727600,"[brute force, implementation]",PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Sum,1500.0,C,1319727600,"[brute force, math]",PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Transformation,2000.0,D,1319727600,[brute force],PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Permutation,2500.0,E,1319727600,[],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Elevator,,A,1318919400,"[brute force, implementation, math]",PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Quiz League,,B,1318919400,[implementation],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Winnie-the-Pooh and honey,,C,1318919400,"[implementation, math]",PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Three Sons,,D,1318919400,[brute force],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Put Knight!,,E,1318919400,[games],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Spiders,,F,1318919400,"[dp, greedy, trees]",PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Boom,,G,1318919400,[implementation],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Brevity is Soul of Wit,,H,1318919400,[graph matchings],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Luck is in Numbers,,I,1318919400,[greedy],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Minimum Sum,,J,1318919400,"[divide and conquer, geometry, sortings]",PROGRAMMING
+119,Codeforces Beta Round #90,12,Epic Game,500.0,A,1318604400,[implementation],PROGRAMMING
+119,Codeforces Beta Round #90,12,Before Exam,1000.0,B,1318604400,"[constructive algorithms, implementation, sortings]",PROGRAMMING
+119,Codeforces Beta Round #90,12,Education Reform,1500.0,C,1318604400,[dp],PROGRAMMING
+119,Codeforces Beta Round #90,12,String Transformation,2000.0,D,1318604400,"[hashing, strings]",PROGRAMMING
+119,Codeforces Beta Round #90,12,Alternative Reality,2500.0,E,1318604400,[geometry],PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,String Task,500.0,A,1317999600,"[implementation, strings]",PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Present from Lena,1000.0,B,1317999600,"[constructive algorithms, implementation]",PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Fancy Number,1500.0,C,1317999600,"[brute force, greedy, sortings, strings]",PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Caesar's Legions,2000.0,D,1317999600,[dp],PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Bertown roads,2500.0,E,1317999600,"[dfs and similar, graphs]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Elevator,500.0,A,1316790000,"[implementation, math]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Very Interesting Game,1000.0,B,1316790000,"[brute force, number theory]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Cycle,1500.0,C,1316790000,"[dfs and similar, graphs]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Not Quick Transformation,2000.0,D,1316790000,"[divide and conquer, math]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Tree or not Tree,2500.0,E,1316790000,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Party,500.0,A,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Lawnmower,1000.0,B,1316098800,"[greedy, sortings]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Plumber,1500.0,C,1316098800,[math],PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Unambiguous Arithmetic Expression,2000.0,D,1316098800,"[dp, expression parsing]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Linear Kingdom Races,2500.0,E,1316098800,"[data structures, dp]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Tram,500.0,A,1316098800,[implementation],PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Little Pigs and Wolves,1000.0,B,1316098800,"[greedy, implementation]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Party,1500.0,C,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Lawnmower,2000.0,D,1316098800,"[dp, greedy]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Plumber,2500.0,E,1316098800,[],PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Grammar Lessons,500.0,A,1315494000,"[implementation, strings]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Petr#,1000.0,B,1315494000,"[brute force, data structures, hashing, strings]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Double Happiness,1500.0,C,1315494000,"[brute force, number theory]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Museum,2000.0,D,1315494000,"[matrices, probabilities]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Sleeping,2500.0,E,1315494000,"[combinatorics, implementation, math]",PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Cifera,500.0,A,1315494000,[math],PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,PFAST Inc.,1000.0,B,1315494000,"[bitmasks, brute force]",PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Grammar Lessons,1500.0,C,1315494000,[implementation],PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Petr#,2000.0,D,1315494000,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Double Happiness,2500.0,E,1315494000,[number theory],PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Inequiations,500.0,A,1315051200,[greedy],PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Divisors,1000.0,B,1315051200,"[binary search, data structures, number theory]",PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Spiders,1500.0,C,1315051200,"[bitmasks, dp, dsu]",PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Coloring,2000.0,D,1315051200,"[combinatorics, dp]",PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Rectangle,2500.0,E,1315051200,[],PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Strings,500.0,A,1315051200,"[implementation, strings]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Square,1000.0,B,1315051200,"[implementation, math]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Inequiations,1500.0,C,1315051200,"[greedy, math]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Divisors,2000.0,D,1315051200,"[implementation, number theory]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Spiders,2500.0,E,1315051200,"[bitmasks, dp]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sum of Digits,500.0,A,1314633600,"[brute force, implementation]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Probability,1000.0,B,1314633600,"[brute force, probabilities]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Tree,1500.0,C,1314633600,"[dp, dsu, trees]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sorting,2000.0,D,1314633600,"[constructive algorithms, sortings]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Interval,2500.0,E,1314633600,"[brute force, math]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Nearly Lucky Number,500.0,A,1314633600,[implementation],PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky String,1000.0,B,1314633600,"[constructive algorithms, strings]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Sum of Digits,1500.0,C,1314633600,"[implementation, math]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Probability,2000.0,D,1314633600,"[brute force, combinatorics, dfs and similar, probabilities]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Tree,2500.0,E,1314633600,"[combinatorics, dfs and similar, trees]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Dorm Water Supply,500.0,A,1314111600,"[dfs and similar, graphs]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Basketball Team,1000.0,B,1314111600,"[combinatorics, dp, probabilities]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Arrangement,1500.0,C,1314111600,"[bitmasks, dp]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Crime Management,2000.0,D,1314111600,"[dp, matrices]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Darts,2500.0,E,1314111600,"[geometry, probabilities]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Palindromic Times,500.0,A,1314111600,"[implementation, strings]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Datatypes,1000.0,B,1314111600,"[math, sortings]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Dorm Water Supply,1500.0,C,1314111600,"[dfs and similar, implementation]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Basketball Team,2000.0,D,1314111600,"[combinatorics, math, probabilities]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Arrangement,2500.0,E,1314111600,[],PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Card Game,500.0,A,1313766000,[implementation],PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Choosing Laptop,1000.0,B,1313766000,"[brute force, implementation]",PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Buns,1500.0,C,1313766000,"[chinese remainder theorem, geometry]",PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Treasure Island,2000.0,D,1313766000,"[brute force, implementation]",PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Space Rescuers,2500.0,E,1313766000,"[geometry, ternary search]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Transmigration,500.0,A,1313247600,[implementation],PROGRAMMING
+105,Codeforces Beta Round #81,12,Dark Assembly,1000.0,B,1313247600,"[brute force, probabilities]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Item World,1500.0,C,1313247600,"[brute force, implementation, sortings]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Entertaining Geodetics,2000.0,D,1313247600,"[brute force, dsu, implementation]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Lift and Throw,2500.0,E,1313247600,[brute force],PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Testing Pants for Sadness,500.0,A,1312714800,"[greedy, implementation, math]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Cthulhu,1000.0,B,1312714800,"[dfs and similar, dsu, graphs]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Russian Roulette,1500.0,C,1312714800,"[constructive algorithms, greedy]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Time to Raid Cowavans,2000.0,D,1312714800,"[brute force, data structures, sortings]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Buying Sets,2500.0,E,1312714800,"[flows, graph matchings]",PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Blackjack,500.0,A,1312714800,[implementation],PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Testing Pants for Sadness,1000.0,B,1312714800,[math],PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Cthulhu,1500.0,C,1312714800,"[dsu, trees]",PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Russian Roulette,2000.0,D,1312714800,[math],PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Time to Raid Cowavans,2500.0,E,1312714800,[],PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Homework,500.0,A,1312390800,[greedy],PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Buses,1000.0,B,1312390800,"[binary search, data structures, dp]",PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Vectors,1500.0,C,1312390800,"[implementation, math]",PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Castle,2000.0,D,1312390800,"[dp, greedy, probabilities, sortings, trees]",PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Candies and Stones,2500.0,E,1312390800,"[divide and conquer, dp]",PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Clothes,500.0,A,1312390800,[brute force],PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Sum of Digits,1000.0,B,1312390800,[implementation],PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Homework,1500.0,C,1312390800,[greedy],PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Buses,2000.0,D,1312390800,"[binary search, data structures, dp]",PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Vectors,2500.0,E,1312390800,[],PROGRAMMING
+100,Unknown Language Round #3,12,Carpeting the Room,,A,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Friendly Numbers,,B,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,A+B,,C,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,World of Mouth,,D,1312005600,"[*special, strings]",PROGRAMMING
+100,Unknown Language Round #3,12,Lamps in a Line,,E,1312005600,"[*special, math]",PROGRAMMING
+100,Unknown Language Round #3,12,Polynom,,F,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Name the album,,G,1312005600,"[*special, data structures, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Battleship,,H,1312005600,"[*special, dfs and similar, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Rotation,,I,1312005600,"[*special, geometry, math]",PROGRAMMING
+100,Unknown Language Round #3,12,Interval Coloring,,J,1312005600,"[*special, greedy, math]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Victoria the Wise,500.0,A,1311346800,"[brute force, implementation]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help King,1000.0,B,1311346800,"[implementation, probabilities, trees]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Greg the Dwarf,1500.0,C,1311346800,"[geometry, ternary search]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Monks,2000.0,D,1311346800,[constructive algorithms],PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Shrek and Donkey,2500.0,E,1311346800,"[dp, games, math, probabilities]",PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Far Away Kingdom,500.0,A,1311346800,[strings],PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Chef Gerasim,1000.0,B,1311346800,"[implementation, sortings]",PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Victoria the Wise,1500.0,C,1311346800,[brute force],PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help King,2000.0,D,1311346800,[],PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Greg the Dwarf,2500.0,E,1311346800,"[binary search, geometry, ternary search]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Domino,500.0,A,1310731200,"[brute force, implementation]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Superset,1500.0,B,1310731200,"[constructive algorithms, divide and conquer]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Winning Strategy,2000.0,C,1310731200,"[binary search, graphs, math, shortest paths]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Robot in Basement,2000.0,D,1310731200,"[bitmasks, brute force, implementation]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Leaders,2500.0,E,1310731200,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Hockey,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Numbers,1000.0,B,1310137200,"[dp, greedy]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Volleyball,1500.0,C,1310137200,[shortest paths],PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Horse Races,2000.0,D,1310137200,"[dp, math]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Country,2500.0,E,1310137200,"[dp, dsu, graphs]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Football,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Lucky Numbers (easy),1000.0,B,1310137200,"[binary search, bitmasks, brute force]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Hockey,1500.0,C,1310137200,"[implementation, strings]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Volleyball,2000.0,D,1310137200,"[graphs, shortest paths]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Horse Races,2500.0,E,1310137200,[],PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Frames,500.0,A,1309446000,[implementation],PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,End of Exams,1000.0,B,1309446000,[greedy],PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Azembler,1500.0,C,1309446000,"[brute force, implementation]",PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Flags,2000.0,D,1309446000,"[dp, math, matrices]",PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Lostborn,2500.0,E,1309446000,"[dp, math]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Restoring Password,500.0,A,1309446000,"[implementation, strings]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Friends,1000.0,B,1309446000,"[implementation, math]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Frames,1500.0,C,1309446000,[math],PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,End of Exams,2000.0,D,1309446000,"[greedy, math]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Azembler,2500.0,E,1309446000,[brute force],PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Newspaper Headline,500.0,A,1308582000,"[greedy, strings]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Queue,1000.0,B,1308582000,"[binary search, data structures]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Ski Base,1500.0,C,1308582000,"[combinatorics, dsu, graphs]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Grocer's Problem,2500.0,D,1308582000,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Igloo Skyscraper,2500.0,E,1308582000,"[data structures, geometry]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Chips,500.0,A,1308582000,"[implementation, math]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Binary Number,1000.0,B,1308582000,[greedy],PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Newspaper Headline,1500.0,C,1308582000,"[binary search, data structures, dp, greedy]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Queue,2000.0,D,1308582000,"[binary search, data structures, dp]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Ski Base,2500.0,E,1308582000,"[data structures, dsu, graphs]",PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Robbery,500.0,A,1308236400,[greedy],PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Widget Library,1000.0,B,1308236400,"[dp, expression parsing, graphs, implementation]",PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Chip Play,1000.0,C,1308236400,"[brute force, data structures, implementation]",PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Space mines,1500.0,D,1308236400,[geometry],PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Fire and Ice,2500.0,E,1308236400,[greedy],PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Cableway,500.0,A,1308236400,"[greedy, math]",PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,African Crossword,1000.0,B,1308236400,"[implementation, strings]",PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Robbery,1500.0,C,1308236400,"[greedy, math]",PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Widget Library,2000.0,D,1308236400,[],PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Chip Play,2000.0,E,1308236400,[],PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Trains,500.0,A,1307458800,[math],PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Vasya and Types,1000.0,B,1307458800,"[implementation, strings]",PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Interesting Game,1500.0,C,1307458800,"[dp, games]",PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Beautiful Road,2000.0,D,1307458800,"[dfs and similar, dp, dsu, implementation, sortings, trees]",PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Mogohu-Rea Idol,2500.0,E,1307458800,[geometry],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Chord,500.0,A,1307458800,"[brute force, implementation]",PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Keyboard,1000.0,B,1307458800,[implementation],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Trains,1500.0,C,1307458800,[number theory],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Vasya and Types,2000.0,D,1307458800,[implementation],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Interesting Game,2500.0,E,1307458800,[],PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Reflection,500.0,A,1306077000,[math],PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Tetris revisited,1000.0,B,1306077000,"[constructive algorithms, graph matchings, greedy, math]",PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Genetic engineering,2000.0,C,1306077000,"[dp, string suffix structures, trees]",PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Powerful array,2500.0,D,1306077000,"[data structures, implementation, math, two pointers]",PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Long sequence,2500.0,E,1306077000,"[brute force, math, matrices]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Domino,500.0,A,1305903600,"[constructive algorithms, implementation]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Embassy Queue,1000.0,B,1305903600,[data structures],PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Petya and Tree,1500.0,C,1305903600,"[binary search, dfs and similar, probabilities, sortings, trees]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Sum of Medians,2000.0,D,1305903600,"[binary search, brute force, data structures, implementation]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Guard Towers,2500.0,E,1305903600,"[binary search, dsu, geometry, graphs, sortings]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Magical Array,500.0,A,1305299400,[math],PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Doctor,1000.0,B,1305299400,"[binary search, math, sortings]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Track,1500.0,C,1305299400,"[graphs, greedy, shortest paths]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Numbers,2000.0,D,1305299400,"[dp, math, number theory]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Two Subsequences,2500.0,E,1305299400,"[bitmasks, dp]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Toy Army,500.0,A,1305299400,"[math, number theory]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Magical Array,1000.0,B,1305299400,"[combinatorics, implementation]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Biathlon,1500.0,C,1305299400,"[binary search, implementation]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Doctor,2000.0,D,1305299400,"[binary search, implementation]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Track,2500.0,E,1305299400,"[brute force, shortest paths]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Double Cola,500.0,A,1304694000,"[implementation, math]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Sets,1000.0,B,1304694000,"[constructive algorithms, hashing, implementation]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,General Mobilization,1500.0,C,1304694000,"[data structures, dfs and similar, sortings]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Two out of Three,2000.0,D,1304694000,[dp],PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Corridor,2500.0,E,1304694000,[geometry],PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Plug-in,500.0,A,1304485200,[implementation],PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Sequence Formatting,1000.0,B,1304485200,"[implementation, strings]",PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Average Score,1500.0,C,1304485200,"[math, sortings]",PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Polycarp's Picture Gallery,2000.0,D,1304485200,"[constructive algorithms, greedy]",PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Pairs,2500.0,E,1304485200,"[dfs and similar, dp, dsu, graphs, implementation, trees]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Bus Game,500.0,A,1304175600,[greedy],PROGRAMMING
+79,Codeforces Beta Round #71,12,Colorful Field,1000.0,B,1304175600,"[implementation, sortings]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Beaver,1500.0,C,1304175600,"[data structures, dp, greedy, hashing, strings, two pointers]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Password,2000.0,D,1304175600,"[bitmasks, dp, shortest paths]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Security System,2500.0,E,1304175600,[math],PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Haiku,500.0,A,1303916400,"[implementation, strings]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Easter Eggs,1000.0,B,1303916400,"[constructive algorithms, implementation]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Beaver Game,1500.0,C,1303916400,"[dp, games, number theory]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Archer's Shot,2000.0,D,1303916400,"[binary search, geometry, math, two pointers]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Evacuation,2500.0,E,1303916400,"[flows, graphs, shortest paths]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Heroes,500.0,A,1303226100,"[brute force, implementation]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Falling Anvils,1000.0,B,1303226100,"[math, probabilities]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Beavermuncher-0xFF,1500.0,C,1303226100,"[dfs and similar, dp, dsu, greedy, trees]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Domino Carpet,2000.0,D,1303226100,"[dp, implementation]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Martian Food,2000.0,E,1303226100,[geometry],PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Panoramix's Prediction,500.0,A,1303226100,[brute force],PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Depression,1000.0,B,1303226100,"[geometry, math]",PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Heroes,1500.0,C,1303226100,"[brute force, implementation]",PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Falling Anvils,2000.0,D,1303226100,"[geometry, probabilities]",PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Beavermuncher-0xFF,2500.0,E,1303226100,[],PROGRAMMING
+74,Codeforces Beta Round #68,12,Room Leader,500.0,A,1302879600,[implementation],PROGRAMMING
+74,Codeforces Beta Round #68,12,Train,1000.0,B,1302879600,"[dp, games, greedy]",PROGRAMMING
+74,Codeforces Beta Round #68,12,Chessboard Billiard,1500.0,C,1302879600,"[dfs and similar, dsu, graphs, number theory]",PROGRAMMING
+74,Codeforces Beta Round #68,12,Hanger,2000.0,D,1302879600,[data structures],PROGRAMMING
+74,Codeforces Beta Round #68,12,Shift It!,2500.0,E,1302879600,[constructive algorithms],PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Life Without Zeros,500.0,A,1302706800,[implementation],PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Facetook Priority Wall,1000.0,B,1302706800,"[expression parsing, implementation, strings]",PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Modified GCD,1500.0,C,1302706800,"[binary search, number theory]",PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Big Maximum Sum,2000.0,D,1302706800,"[data structures, dp, greedy, implementation, math, trees]",PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Ship's Shortest Path,2500.0,E,1302706800,"[geometry, shortest paths]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Gift,,A,1302609600,"[dsu, graphs, sortings, trees]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Mice,,B,1302609600,"[greedy, two pointers]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Mutation,,C,1302609600,"[bitmasks, dp, math]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Plus and xor,,D,1302609600,"[dp, greedy, math]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Points,,E,1302609600,"[implementation, math]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Tourist,,F,1302609600,"[binary search, data structures, dp]",PROGRAMMING
+73,Codeforces Beta Round #66,12,The Elder Trolls IV: Oblivon,500.0,A,1302422400,"[greedy, math]",PROGRAMMING
+73,Codeforces Beta Round #66,12,Need For Brake,1000.0,B,1302422400,"[binary search, greedy, sortings]",PROGRAMMING
+73,Codeforces Beta Round #66,12,LionAge II,1000.0,C,1302422400,[dp],PROGRAMMING
+73,Codeforces Beta Round #66,12,FreeDiv,1500.0,D,1302422400,"[dfs and similar, graphs, greedy]",PROGRAMMING
+73,Codeforces Beta Round #66,12,Morrowindows,1500.0,E,1302422400,"[math, number theory]",PROGRAMMING
+73,Codeforces Beta Round #66,12,Plane of Tanks,2000.0,F,1302422400,"[brute force, geometry]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Way Too Long Words,500.0,A,1301410800,[strings],PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Progress Bar,1000.0,B,1301410800,"[implementation, math]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Round Table Knights,1500.0,C,1301410800,"[dp, math, number theory]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Solitaire,2000.0,D,1301410800,"[brute force, implementation]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Nuclear Fusion,2500.0,E,1301410800,"[bitmasks, dp]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Cookies,500.0,A,1301155200,[math],PROGRAMMING
+70,Codeforces Beta Round #64,12,Text Messaging,1000.0,B,1301155200,"[expression parsing, greedy, strings]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Lucky Tickets,1500.0,C,1301155200,"[binary search, data structures, sortings, two pointers]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Professor's task,2000.0,D,1301155200,"[data structures, geometry]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Information Reform,2500.0,E,1301155200,"[dp, implementation, trees]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Young Physicist,500.0,A,1300809600,"[implementation, math]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Bets,1000.0,B,1300809600,"[greedy, implementation]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Game,1500.0,C,1300809600,[implementation],PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Dot,2000.0,D,1300809600,"[dp, games]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Subsegments,2500.0,E,1300809600,"[data structures, implementation]",PROGRAMMING
+72,Unknown Language Round #2,12,"Goshtasp, Vishtasp and Eidi",,A,1300637400,"[*special, greedy, math]",PROGRAMMING
+72,Unknown Language Round #2,12,INI-file,,B,1300637400,"[*special, implementation]",PROGRAMMING
+72,Unknown Language Round #2,12,Extraordinarily Nice Numbers,,C,1300637400,"[*special, math]",PROGRAMMING
+72,Unknown Language Round #2,12,Perse-script,,D,1300637400,"[*special, expression parsing]",PROGRAMMING
+72,Unknown Language Round #2,12,Ali goes shopping,,E,1300637400,"[*special, brute force, strings]",PROGRAMMING
+72,Unknown Language Round #2,12,Oil,,F,1300637400,"[*special, greedy, math]",PROGRAMMING
+72,Unknown Language Round #2,12,Fibonacci army,,G,1300637400,"[*special, dp]",PROGRAMMING
+72,Unknown Language Round #2,12,Reverse It!,,H,1300637400,"[*special, implementation]",PROGRAMMING
+72,Unknown Language Round #2,12,Goofy Numbers,,I,1300637400,"[*special, implementation]",PROGRAMMING
+68,Codeforces Beta Round #62,12,Irrational problem,500.0,A,1300464000,"[implementation, number theory]",PROGRAMMING
+68,Codeforces Beta Round #62,12,Energy exchange,1000.0,B,1300464000,[binary search],PROGRAMMING
+68,Codeforces Beta Round #62,12,Synchrophasotron,1500.0,C,1300464000,[brute force],PROGRAMMING
+68,Codeforces Beta Round #62,12,Half-decay tree,2000.0,D,1300464000,"[data structures, divide and conquer, dp, probabilities]",PROGRAMMING
+68,Codeforces Beta Round #62,12,Contact,2500.0,E,1300464000,[geometry],PROGRAMMING
+67,Manthan 2011,12,Partial Teacher,500.0,A,1300033800,"[dp, graphs, greedy, implementation]",PROGRAMMING
+67,Manthan 2011,12,Restoration of the Permutation,1000.0,B,1300033800,[greedy],PROGRAMMING
+67,Manthan 2011,12,Sequence of Balls,1500.0,C,1300033800,[dp],PROGRAMMING
+67,Manthan 2011,12,Optical Experiment,2000.0,D,1300033800,"[binary search, data structures, dp]",PROGRAMMING
+67,Manthan 2011,12,Save the City!,2500.0,E,1300033800,[geometry],PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and Java,500.0,A,1299513600,"[implementation, strings]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and Countryside,1000.0,B,1299513600,"[brute force, implementation]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and File System,1500.0,C,1299513600,"[data structures, implementation]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and His Friends,2000.0,D,1299513600,"[constructive algorithms, math, number theory]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and Post,2500.0,E,1299513600,"[data structures, dp]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and Three Spells,500.0,A,1299340800,"[implementation, math]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and the History of Magic,1000.0,B,1299340800,"[brute force, greedy, implementation]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and the Golden Snitch,1500.0,C,1299340800,"[binary search, geometry]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and the Sorting Hat,2000.0,D,1299340800,"[brute force, dfs and similar, hashing]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and Moving Staircases,2500.0,E,1299340800,"[dfs and similar, implementation]",PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Sinking Ship,500.0,A,1298908800,"[implementation, sortings, strings]",PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Settlers' Training,1000.0,B,1298908800,[implementation],PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Bulls and Cows,1500.0,C,1298908800,"[brute force, implementation]",PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Dividing Island,2000.0,D,1298908800,[constructive algorithms],PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Sweets Game,2500.0,E,1298908800,"[bitmasks, dfs and similar, dp, games, implementation]",PROGRAMMING
+62,Codeforces Beta Round #58,12,A Student's Dream,500.0,A,1298649600,"[greedy, math]",PROGRAMMING
+62,Codeforces Beta Round #58,12,Tyndex.Brome,1000.0,B,1298649600,"[binary search, implementation]",PROGRAMMING
+62,Codeforces Beta Round #58,12,Inquisition,1500.0,C,1298649600,"[geometry, implementation, sortings]",PROGRAMMING
+62,Codeforces Beta Round #58,12,Wormhouse,2000.0,D,1298649600,"[dfs and similar, graphs]",PROGRAMMING
+62,Codeforces Beta Round #58,12,World Evil,2500.0,E,1298649600,"[dp, flows]",PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Ultra-Fast Mathematician,500.0,A,1298390400,[implementation],PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Hard Work,1000.0,B,1298390400,[strings],PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Capture Valerian,1500.0,C,1298390400,[math],PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Eternal Victory,2000.0,D,1298390400,"[dfs and similar, graphs, greedy, shortest paths, trees]",PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Enemy is weak,2500.0,E,1298390400,"[data structures, trees]",PROGRAMMING
+64,Unknown Language Round #1,12,Factorial,,A,1298304000,"[*special, implementation]",PROGRAMMING
+64,Unknown Language Round #1,12,Expression,,B,1298304000,"[*special, expression parsing]",PROGRAMMING
+64,Unknown Language Round #1,12,Table,,C,1298304000,"[*special, greedy, implementation, math]",PROGRAMMING
+64,Unknown Language Round #1,12,Presents,,D,1298304000,"[*special, greedy]",PROGRAMMING
+64,Unknown Language Round #1,12,Prime Segment,,E,1298304000,"[*special, brute force]",PROGRAMMING
+64,Unknown Language Round #1,12,Domain,,F,1298304000,"[*special, expression parsing]",PROGRAMMING
+64,Unknown Language Round #1,12,Path Canonization,,G,1298304000,[*special],PROGRAMMING
+64,Unknown Language Round #1,12,Table Bowling,,H,1298304000,"[*special, sortings]",PROGRAMMING
+64,Unknown Language Round #1,12,Sort the Table,,I,1298304000,"[*special, sortings]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Where Are My Flakes?,500.0,A,1298131200,"[implementation, two pointers]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Serial Time!,1000.0,B,1298131200,"[dfs and similar, dsu]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Mushroom Strife,1500.0,C,1298131200,"[brute force, dfs and similar]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Savior,2000.0,D,1298131200,"[brute force, dsu, math]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Mushroom Gnomes,2500.0,E,1298131200,"[math, matrices]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Word,500.0,A,1297440000,"[implementation, strings]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Fortune Telling,1000.0,B,1297440000,"[implementation, number theory]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Title,1500.0,C,1297440000,[expression parsing],PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Team Arrangement,2000.0,D,1297440000,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Shortest Path,2500.0,E,1297440000,"[graphs, shortest paths]",PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Chat room,500.0,A,1296489600,"[greedy, strings]",PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Coins,1000.0,B,1296489600,[greedy],PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Trees,1500.0,C,1296489600,[brute force],PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Calendar,2000.0,D,1296489600,"[greedy, strings]",PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Expression,2500.0,E,1296489600,[dp],PROGRAMMING
+57,Codeforces Beta Round #53,12,Square Earth?,500.0,A,1295971200,"[dfs and similar, greedy, implementation]",PROGRAMMING
+57,Codeforces Beta Round #53,12,Martian Architecture,1000.0,B,1295971200,[implementation],PROGRAMMING
+57,Codeforces Beta Round #53,12,Array,1500.0,C,1295971200,"[combinatorics, math]",PROGRAMMING
+57,Codeforces Beta Round #53,12,Journey,2000.0,D,1295971200,"[dp, math]",PROGRAMMING
+57,Codeforces Beta Round #53,12,Chess,2500.0,E,1295971200,"[math, shortest paths]",PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Bar,500.0,A,1295626200,[implementation],PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Spoilt Permutation,1000.0,B,1295626200,[implementation],PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Corporation Mail,1500.0,C,1295626200,"[data structures, expression parsing, implementation]",PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Changing a String,2000.0,D,1295626200,[dp],PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Domino Principle,2500.0,E,1295626200,"[binary search, data structures, sortings]",PROGRAMMING
+55,Codeforces Beta Round #51,12,Flea travel,500.0,A,1294992000,"[implementation, math]",PROGRAMMING
+55,Codeforces Beta Round #51,12,Smallest number,1000.0,B,1294992000,[brute force],PROGRAMMING
+55,Codeforces Beta Round #51,12,Pie or die,1500.0,C,1294992000,[games],PROGRAMMING
+55,Codeforces Beta Round #51,12,Beautiful numbers,2000.0,D,1294992000,"[dp, number theory]",PROGRAMMING
+55,Codeforces Beta Round #51,12,Very simple problem,2500.0,E,1294992000,"[geometry, two pointers]",PROGRAMMING
+54,Codeforces Beta Round #50,12,Presents,500.0,A,1294733700,[implementation],PROGRAMMING
+54,Codeforces Beta Round #50,12,Cutting Jigsaw Puzzle,1000.0,B,1294733700,"[hashing, implementation]",PROGRAMMING
+54,Codeforces Beta Round #50,12,First Digit Law,1500.0,C,1294733700,"[dp, math, probabilities]",PROGRAMMING
+54,Codeforces Beta Round #50,12,Writing a Song,2000.0,D,1294733700,"[brute force, dp]",PROGRAMMING
+54,Codeforces Beta Round #50,12,Vacuum Сleaner,2500.0,E,1294733700,[geometry],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Autocomplete,500.0,A,1294329600,[implementation],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Blog Photo,1000.0,B,1294329600,"[binary search, implementation]",PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Little Frog,1500.0,C,1294329600,[constructive algorithms],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Physical Education,2000.0,D,1294329600,[sortings],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Dead Ends,2500.0,E,1294329600,"[bitmasks, dp]",PROGRAMMING
+52,Codeforces Testing Round #1,12,123-sequence,500.0,A,1294160400,[implementation],PROGRAMMING
+52,Codeforces Testing Round #1,12,Right Triangles,1000.0,B,1294160400,[combinatorics],PROGRAMMING
+52,Codeforces Testing Round #1,12,Circular RMQ,1500.0,C,1294160400,[data structures],PROGRAMMING
+51,Codeforces Beta Round #48,12,Cheaterius's Problem,500.0,A,1293552000,[implementation],PROGRAMMING
+51,Codeforces Beta Round #48,12,bHTML Tables Analisys,1000.0,B,1293552000,[expression parsing],PROGRAMMING
+51,Codeforces Beta Round #48,12,Three Base Stations,1500.0,C,1293552000,"[binary search, greedy]",PROGRAMMING
+51,Codeforces Beta Round #48,12,Geometrical problem,2000.0,D,1293552000,[implementation],PROGRAMMING
+51,Codeforces Beta Round #48,12,Pentagon,2500.0,E,1293552000,"[combinatorics, graphs, matrices]",PROGRAMMING
+51,Codeforces Beta Round #48,12,Caterpillar,3000.0,F,1293552000,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+50,Codeforces Beta Round #47,12,Domino piling,500.0,A,1292862000,"[greedy, math]",PROGRAMMING
+50,Codeforces Beta Round #47,12,Choosing Symbol Pairs,1000.0,B,1292862000,[strings],PROGRAMMING
+50,Codeforces Beta Round #47,12,Happy Farm 5,1500.0,C,1292862000,[geometry],PROGRAMMING
+50,Codeforces Beta Round #47,12,Bombing,2000.0,D,1292862000,"[binary search, dp, probabilities]",PROGRAMMING
+50,Codeforces Beta Round #47,12,Square Equation Roots,2500.0,E,1292862000,[math],PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Sleuth,500.0,A,1292601600,[implementation],PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Sum,1000.0,B,1292601600,[math],PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Disposition,1500.0,C,1292601600,"[constructive algorithms, math]",PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Game,2000.0,D,1292601600,"[brute force, dp, implementation]",PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Common ancestor,2500.0,E,1292601600,[dp],PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Rock-paper-scissors,,A,1292140800,"[implementation, schedules]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Land Lot,,B,1292140800,"[brute force, implementation]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,The Race,,C,1292140800,[math],PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Permutations,,D,1292140800,[greedy],PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Ivan the Fool VS Gorynych the Dragon,,E,1292140800,"[dp, games, graphs]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Snow sellers,,F,1292140800,"[greedy, sortings]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Galaxy Union,,G,1292140800,"[dp, trees, two pointers]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Black and White,,H,1292140800,[constructive algorithms],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Triangular numbers,500.0,A,1291737600,"[brute force, math]",PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Coins,1000.0,B,1291737600,[implementation],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Crossword,1500.0,C,1291737600,[implementation],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Safe,2000.0,D,1291737600,[brute force],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Cannon,2500.0,E,1291737600,"[data structures, geometry, sortings]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Ball Game,,A,1291536000,"[brute force, implementation]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,T-shirts from Sponsor,,B,1291536000,[implementation],PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hamsters and Tigers,,C,1291536000,[two pointers],PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Parking Lot,,D,1291536000,"[data structures, implementation]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Comb,,E,1291536000,"[data structures, dp]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hercule Poirot Problem,,F,1291536000,"[dsu, graphs]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Emperor's Problem,,G,1291536000,[geometry],PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Football,500.0,A,1291046400,[strings],PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Letter,1000.0,B,1291046400,"[implementation, strings]",PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Lucky Tickets,1500.0,C,1291046400,[greedy],PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Journey,2000.0,D,1291046400,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Race,2500.0,E,1291046400,"[brute force, implementation, two pointers]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Guilty --- to the kitchen!,500.0,A,1290096000,"[greedy, implementation]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Game of chess unfinished,1000.0,B,1290096000,[implementation],PROGRAMMING
+42,Codeforces Beta Round #41,12,Safe cracking,1500.0,C,1290096000,"[brute force, constructive algorithms]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Strange town,2000.0,D,1290096000,"[constructive algorithms, math]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Baldman and the military,2500.0,E,1290096000,"[dfs and similar, graphs]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Codecraft III,,A,1289646000,[implementation],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,School,,B,1289646000,"[dp, dsu]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Dancing Lessons,,C,1289646000,[data structures],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Event Dates,,D,1289646000,"[greedy, meet-in-the-middle, sortings]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Director,,E,1289646000,"[constructive algorithms, greedy]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Goats and Wolves,,F,1289646000,[greedy],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Prime Problem,,G,1289646000,[number theory],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Road Problem,,H,1289646000,[graphs],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,TCMCF+++,,I,1289646000,[greedy],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Planting Trees,,J,1289646000,[constructive algorithms],PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Translation,500.0,A,1289232000,"[implementation, strings]",PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Martian Dollar,1000.0,B,1289232000,[brute force],PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Email address,1500.0,C,1289232000,"[expression parsing, implementation]",PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Pawn,2000.0,D,1289232000,[dp],PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,3-cycles,2500.0,E,1289232000,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Indian Summer,,A,1289041200,[implementation],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Cola,,B,1289041200,[implementation],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Holidays,,C,1289041200,[implementation],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Hyperdrive,,D,1289041200,[math],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Anfisa the Monkey,,E,1289041200,[dp],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,BerPaint,,F,1289041200,"[geometry, graphs]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Shooting Gallery,,G,1289041200,"[data structures, implementation]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Phone Number,,H,1289041200,[dp],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Toys,,I,1289041200,"[brute force, combinatorics]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Triminoes,,J,1289041200,"[constructive algorithms, greedy]",PROGRAMMING
+40,Codeforces Beta Round #39,12,Find Color,500.0,A,1288972800,"[constructive algorithms, implementation, math]",PROGRAMMING
+40,Codeforces Beta Round #39,12,Repaintings,1000.0,B,1288972800,[math],PROGRAMMING
+40,Codeforces Beta Round #39,12,Berland Square,1500.0,C,1288972800,[math],PROGRAMMING
+40,Codeforces Beta Round #39,12,Interesting Sequence,2000.0,D,1288972800,[math],PROGRAMMING
+40,Codeforces Beta Round #39,12,Number Table,2500.0,E,1288972800,[combinatorics],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Army,,A,1288440000,[implementation],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Chess,,B,1288440000,"[brute force, implementation, math]",PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Blinds,,C,1288440000,[brute force],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Vasya the Architect,,D,1288440000,[implementation],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Let's Go Rolling!,,E,1288440000,"[dp, sortings]",PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Smart Boy,,F,1288440000,"[dp, games, strings]",PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Queue,,G,1288440000,[data structures],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,The Great Marathon,,H,1288440000,[dp],PROGRAMMING
+37,Codeforces Beta Round #37,12,Towers,500.0,A,1288018800,[sortings],PROGRAMMING
+37,Codeforces Beta Round #37,12,Computer Game,1000.0,B,1288018800,"[greedy, implementation]",PROGRAMMING
+37,Codeforces Beta Round #37,12,Old Berland Language,1500.0,C,1288018800,"[data structures, greedy, trees]",PROGRAMMING
+37,Codeforces Beta Round #37,12,Lesson Timetable,2000.0,D,1288018800,"[combinatorics, dp, math]",PROGRAMMING
+37,Codeforces Beta Round #37,12,Trial for Chief,2500.0,E,1288018800,"[graphs, greedy, shortest paths]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,C*++ Calculations,,A,1287904200,"[expression parsing, greedy]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Company Income Growth,,B,1287904200,[greedy],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Moon Craters,,C,1287904200,"[dp, sortings]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Cubical Planet,,D,1287904200,[math],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,What Has Dirichlet Got to Do with That?,,E,1287904200,"[dp, games]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Pacifist frogs,,F,1287904200,[implementation],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Inverse Function,,G,1287904200,[implementation],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Multiplication Table,,H,1287904200,[implementation],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Tram,,I,1287904200,[],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Spelling Check,,J,1287904200,"[hashing, implementation, strings]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Testing,,K,1287904200,[],PROGRAMMING
+36,Codeforces Beta Round #36,12,Extra-terrestrial Intelligence,500.0,A,1287482400,[implementation],PROGRAMMING
+36,Codeforces Beta Round #36,12,Fractal,1000.0,B,1287482400,[implementation],PROGRAMMING
+36,Codeforces Beta Round #36,12,Bowls,1500.0,C,1287482400,"[geometry, implementation]",PROGRAMMING
+36,Codeforces Beta Round #36,12,New Game with a Chess Piece,2000.0,D,1287482400,[games],PROGRAMMING
+36,Codeforces Beta Round #36,12,Two Paths,2500.0,E,1287482400,"[constructive algorithms, dsu, graphs, implementation]",PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Shell Game,500.0,A,1287471600,[implementation],PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Warehouse,1000.0,B,1287471600,[implementation],PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Fire Again,1500.0,C,1287471600,"[brute force, dfs and similar, shortest paths]",PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Animals,2000.0,D,1287471600,"[dp, greedy]",PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Parade,2500.0,E,1287471600,"[data structures, sortings]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Reconnaissance 2,500.0,A,1286802000,[implementation],PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Sale,1000.0,B,1286802000,"[greedy, sortings]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Page Numbers,1500.0,C,1286802000,"[expression parsing, implementation, sortings, strings]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Road Map,2000.0,D,1286802000,"[dfs and similar, graphs]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Collisions,2500.0,E,1286802000,"[brute force, implementation, math]",PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,What is for dinner?,500.0,A,1286463600,"[greedy, implementation]",PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,String Problem,1000.0,B,1286463600,[shortest paths],PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,Wonderful Randomized Sum,1500.0,C,1286463600,[greedy],PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,Knights,2000.0,D,1286463600,"[geometry, graphs, shortest paths, sortings]",PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,Helper,2500.0,E,1286463600,[],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Reconnaissance,500.0,A,1286002800,[brute force],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Borze,1000.0,B,1286002800,"[expression parsing, implementation]",PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Flea,1500.0,C,1286002800,[math],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Constellation,2000.0,D,1286002800,[implementation],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Hide-and-Seek,2500.0,E,1286002800,"[geometry, implementation]",PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Worms Evolution,500.0,A,1285599600,[implementation],PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Sysadmin Bob,1000.0,B,1285599600,[strings],PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Schedule,1500.0,C,1285599600,[implementation],PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Chocolate,2000.0,D,1285599600,"[dfs and similar, implementation]",PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,TV Game,2500.0,E,1285599600,[dp],PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Accounting,500.0,A,1285340400,"[brute force, math]",PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Codeforces World Finals,1000.0,B,1285340400,[implementation],PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Shooting Gallery,1500.0,C,1285340400,"[dp, probabilities]",PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,King's Problem?,2000.0,D,1285340400,"[geometry, greedy]",PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Tricky and Clever Password,2500.0,E,1285340400,"[binary search, constructive algorithms, data structures, greedy, hashing, strings]",PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Spit Problem,500.0,A,1284994800,[brute force],PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Traffic Lights,1000.0,B,1284994800,[implementation],PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Mail Stamps,1500.0,C,1284994800,"[data structures, dfs and similar, graphs, implementation]",PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Ant on the Tree,2000.0,D,1284994800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Quarrel,2500.0,E,1284994800,"[graphs, shortest paths]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,Bender Problem,500.0,A,1284735600,[implementation],PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,pSort,1000.0,B,1284735600,"[dfs and similar, dsu, graphs]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,Bath Queue,1500.0,C,1284735600,"[combinatorics, dp, probabilities]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,"Don't fear, DravDe is kind",2000.0,D,1284735600,"[binary search, data structures, dp, hashing]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,DravDe saves the world,2500.0,E,1284735600,"[geometry, math]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Next Test,500.0,A,1284130800,"[implementation, sortings]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Tournament,1000.0,B,1284130800,"[bitmasks, brute force, dfs and similar, greedy]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Unordered Subsequence,1500.0,C,1284130800,"[constructive algorithms, greedy]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Ring Road 2,2000.0,D,1284130800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Number With The Given Amount Of Divisors,2500.0,E,1284130800,"[brute force, dp, number theory]",PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Almost Prime,500.0,A,1281970800,[number theory],PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Regular Bracket Sequence,1000.0,B,1281970800,[greedy],PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Parquet,1500.0,C,1281970800,"[combinatorics, constructive algorithms]",PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Tickets,2000.0,D,1281970800,"[combinatorics, probabilities]",PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Multithreading,2500.0,E,1281970800,[constructive algorithms],PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,IQ test,,A,1280761200,[brute force],PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,Phone numbers,,B,1280761200,[implementation],PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,Roads in Berland,,C,1280761200,"[graphs, shortest paths]",PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,Roads not only in Berland,,D,1280761200,"[dsu, graphs, trees]",PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,Test,,E,1280761200,"[hashing, strings]",PROGRAMMING
+24,Codeforces Beta Round #24,12,Ring road,,A,1280149200,[graphs],PROGRAMMING
+24,Codeforces Beta Round #24,12,F1 Champions,,B,1280149200,[implementation],PROGRAMMING
+24,Codeforces Beta Round #24,12,Sequence of points,,C,1280149200,"[geometry, implementation, math]",PROGRAMMING
+24,Codeforces Beta Round #24,12,Broken robot,,D,1280149200,"[dp, probabilities]",PROGRAMMING
+24,Codeforces Beta Round #24,12,Berland collider,,E,1280149200,[binary search],PROGRAMMING
+23,Codeforces Beta Round #23,12,You're Given a String...,,A,1278687600,"[brute force, greedy]",PROGRAMMING
+23,Codeforces Beta Round #23,12,Party,,B,1278687600,"[constructive algorithms, graphs, math]",PROGRAMMING
+23,Codeforces Beta Round #23,12,Oranges and Apples,,C,1278687600,"[constructive algorithms, sortings]",PROGRAMMING
+23,Codeforces Beta Round #23,12,Tetragon,,D,1278687600,"[geometry, math]",PROGRAMMING
+23,Codeforces Beta Round #23,12,Tree,,E,1278687600,[dp],PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,Second Order Statistics,,A,1277823600,[brute force],PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,Bargaining Table,,B,1277823600,"[brute force, dp]",PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,System Administrator,,C,1277823600,[graphs],PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,Segments,,D,1277823600,"[greedy, sortings]",PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,Scheme,,E,1277823600,"[dfs and similar, graphs, trees]",PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Jabber ID,500.0,A,1277730300,[implementation],PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Intersection,1000.0,B,1277730300,"[implementation, math]",PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Stripe 2,1500.0,C,1277730300,"[binary search, dp, sortings]",PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Traveling Graph,2000.0,D,1277730300,"[bitmasks, graph matchings, graphs]",PROGRAMMING
+19,Codeforces Beta Round #19,12,World Football Cup,,A,1277391600,[implementation],PROGRAMMING
+19,Codeforces Beta Round #19,12,Checkout Assistant,,B,1277391600,[dp],PROGRAMMING
+19,Codeforces Beta Round #19,12,Deletion of Repeats,,C,1277391600,"[greedy, hashing, string suffix structures]",PROGRAMMING
+19,Codeforces Beta Round #19,12,Points,,D,1277391600,[data structures],PROGRAMMING
+19,Codeforces Beta Round #19,12,Fairy,,E,1277391600,"[dfs and similar, divide and conquer, dsu]",PROGRAMMING
+20,Codeforces Alpha Round #20 (Codeforces format),12,BerOS file system,500.0,A,1276875000,[implementation],PROGRAMMING
+20,Codeforces Alpha Round #20 (Codeforces format),12,Equation,1000.0,B,1276875000,[math],PROGRAMMING
+20,Codeforces Alpha Round #20 (Codeforces format),12,Dijkstra?,1500.0,C,1276875000,"[graphs, shortest paths]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Triangle,,A,1276700400,"[brute force, geometry]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Platforms,,B,1276700400,"[brute force, math]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Stripe,,C,1276700400,"[data structures, implementation]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Seller Bob,,D,1276700400,"[brute force, dp, greedy]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Flag 2,,E,1276700400,[dp],PROGRAMMING
+17,Codeforces Beta Round #17,12,Noldbach problem,,A,1276182000,"[brute force, math, number theory]",PROGRAMMING
+17,Codeforces Beta Round #17,12,Hierarchy,,B,1276182000,"[dfs and similar, dsu, greedy, shortest paths]",PROGRAMMING
+17,Codeforces Beta Round #17,12,Balance,,C,1276182000,[dp],PROGRAMMING
+17,Codeforces Beta Round #17,12,Notepad,,D,1276182000,[number theory],PROGRAMMING
+17,Codeforces Beta Round #17,12,Palisection,,E,1276182000,[strings],PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Flag,,A,1275570000,[implementation],PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Burglar and Matches,,B,1275570000,"[greedy, implementation, sortings]",PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Monitor,,C,1275570000,"[binary search, number theory]",PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Logging,,D,1275570000,"[implementation, strings]",PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Fish,,E,1275570000,"[bitmasks, dp, probabilities]",PROGRAMMING
+15,Codeforces Beta Round #15,12,Cottage Village,,A,1275145200,"[implementation, sortings]",PROGRAMMING
+15,Codeforces Beta Round #15,12,Laser,,B,1275145200,[math],PROGRAMMING
+15,Codeforces Beta Round #15,12,Industrial Nim,,C,1275145200,[games],PROGRAMMING
+15,Codeforces Beta Round #15,12,Map,,D,1275145200,"[data structures, implementation, sortings]",PROGRAMMING
+15,Codeforces Beta Round #15,12,Triangles,,E,1275145200,"[combinatorics, dp]",PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Letter,,A,1274283000,[implementation],PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Young Photographer,,B,1274283000,[implementation],PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Four Segments,,C,1274283000,"[brute force, constructive algorithms, geometry, implementation, math]",PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Two Paths,,D,1274283000,"[dfs and similar, dp, graphs, shortest paths, trees, two pointers]",PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Camels,,E,1274283000,[dp],PROGRAMMING
+13,Codeforces Beta Round #13,12,Numbers,,A,1273154400,"[implementation, math]",PROGRAMMING
+13,Codeforces Beta Round #13,12,Letter A,,B,1273154400,"[geometry, implementation]",PROGRAMMING
+13,Codeforces Beta Round #13,12,Sequence,,C,1273154400,"[dp, sortings]",PROGRAMMING
+13,Codeforces Beta Round #13,12,Triangles,,D,1273154400,"[dp, geometry]",PROGRAMMING
+13,Codeforces Beta Round #13,12,Holes,,E,1273154400,"[data structures, dsu]",PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Super Agent,,A,1272538800,[implementation],PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Correct Solution?,,B,1272538800,"[implementation, sortings]",PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Fruits,,C,1272538800,"[implementation, sortings]",PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Ball,,D,1272538800,"[data structures, sortings]",PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Start of the session,,E,1272538800,[constructive algorithms],PROGRAMMING
+11,Codeforces Beta Round #11,12,Increasing Sequence,,A,1272294000,"[constructive algorithms, implementation, math]",PROGRAMMING
+11,Codeforces Beta Round #11,12,Jumping Jack,,B,1272294000,[math],PROGRAMMING
+11,Codeforces Beta Round #11,12,How Many Squares?,,C,1272294000,[implementation],PROGRAMMING
+11,Codeforces Beta Round #11,12,A Simple Task,,D,1272294000,"[bitmasks, dp, graphs]",PROGRAMMING
+11,Codeforces Beta Round #11,12,"Forward, march!",,E,1272294000,"[binary search, dp, greedy]",PROGRAMMING
+10,Codeforces Beta Round #10,12,Power Consumption Calculation,,A,1271346300,[implementation],PROGRAMMING
+10,Codeforces Beta Round #10,12,Cinema Cashier,,B,1271346300,"[dp, implementation]",PROGRAMMING
+10,Codeforces Beta Round #10,12,Digital Root,,C,1271346300,[number theory],PROGRAMMING
+10,Codeforces Beta Round #10,12,LCIS,,D,1271346300,[dp],PROGRAMMING
+10,Codeforces Beta Round #10,12,Greedy Change,,E,1271346300,[constructive algorithms],PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,Die Roll,,A,1270983600,"[math, probabilities]",PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,Running Student,,B,1270983600,"[brute force, geometry, implementation]",PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,Hexadecimal's Numbers,,C,1270983600,"[brute force, implementation, math]",PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,How many trees?,,D,1270983600,"[combinatorics, divide and conquer, dp]",PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,Interestring graph and Apples,,E,1270983600,"[dfs and similar, dsu, graphs]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Train and Peter,,A,1270741500,[strings],PROGRAMMING
+8,Codeforces Beta Round #8,12,Obsession with Robots,,B,1270741500,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Looking for Order,,C,1270741500,"[bitmasks, dp]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Two Friends,,D,1270741500,"[binary search, geometry]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Beads,,E,1270741500,"[dp, graphs]",PROGRAMMING
+7,Codeforces Beta Round #7,12,Kalevitch and Chess,,A,1270136700,"[brute force, constructive algorithms]",PROGRAMMING
+7,Codeforces Beta Round #7,12,Memory Manager,,B,1270136700,[implementation],PROGRAMMING
+7,Codeforces Beta Round #7,12,Line,,C,1270136700,"[math, number theory]",PROGRAMMING
+7,Codeforces Beta Round #7,12,Palindrome Degree,,D,1270136700,"[hashing, strings]",PROGRAMMING
+7,Codeforces Beta Round #7,12,Defining Macros,,E,1270136700,"[dp, expression parsing, implementation]",PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,Triangle,,A,1269673200,"[brute force, geometry]",PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,President's Office,,B,1269673200,[implementation],PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,"Alice, Bob and Chocolate",,C,1269673200,"[greedy, two pointers]",PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,Lizards and Basements 2,,D,1269673200,"[brute force, dp]",PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,Exposition,,E,1269673200,"[binary search, data structures, dsu, trees, two pointers]",PROGRAMMING
+5,Codeforces Beta Round #5,12,Chat Servers Outgoing Traffic,,A,1269100800,[implementation],PROGRAMMING
+5,Codeforces Beta Round #5,12,Center Alignment,,B,1269100800,"[implementation, strings]",PROGRAMMING
+5,Codeforces Beta Round #5,12,Longest Regular Bracket Sequence,,C,1269100800,"[constructive algorithms, data structures, dp, greedy, sortings, strings]",PROGRAMMING
+5,Codeforces Beta Round #5,12,Follow Traffic Rules,,D,1269100800,"[implementation, math]",PROGRAMMING
+5,Codeforces Beta Round #5,12,Bindian Signalizing,,E,1269100800,[data structures],PROGRAMMING
+4,Codeforces Beta Round #4 (Div. 2 Only),2,Watermelon,,A,1268395200,"[brute force, math]",PROGRAMMING
+4,Codeforces Beta Round #4 (Div. 2 Only),2,Before an Exam,,B,1268395200,"[constructive algorithms, greedy]",PROGRAMMING
+4,Codeforces Beta Round #4 (Div. 2 Only),2,Registration System,,C,1268395200,"[data structures, hashing, implementation]",PROGRAMMING
+4,Codeforces Beta Round #4 (Div. 2 Only),2,Mysterious Present,,D,1268395200,"[dp, sortings]",PROGRAMMING
+3,Codeforces Beta Round #3,12,Shortest path of the king,,A,1267963200,"[greedy, shortest paths]",PROGRAMMING
+3,Codeforces Beta Round #3,12,Lorry,,B,1267963200,"[greedy, sortings]",PROGRAMMING
+3,Codeforces Beta Round #3,12,Tic-tac-toe,,C,1267963200,"[brute force, games, implementation]",PROGRAMMING
+3,Codeforces Beta Round #3,12,Least Cost Bracket Sequence,,D,1267963200,[greedy],PROGRAMMING
+2,Codeforces Beta Round #2,12,Winner,,A,1267117200,"[hashing, implementation]",PROGRAMMING
+2,Codeforces Beta Round #2,12,The least round way,,B,1267117200,"[dp, math]",PROGRAMMING
+2,Codeforces Beta Round #2,12,Commentator problem,,C,1267117200,[geometry],PROGRAMMING
+1,Codeforces Beta Round #1,12,Theatre Square,,A,1266580800,[math],PROGRAMMING
+1,Codeforces Beta Round #1,12,Spreadsheet,,B,1266580800,"[implementation, math]",PROGRAMMING
+1,Codeforces Beta Round #1,12,Ancient Berland Circus,,C,1266580800,"[geometry, math]",PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,Links and Pearls,500.0,A,1525791900,"[implementation, math]",PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,Marlin,1000.0,B,1525791900,[constructive algorithms],PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,Posterized,1500.0,C,1525791900,[greedy],PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,Perfect Groups,2000.0,D,1525791900,"[dp, math, number theory]",PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,The Number Games,2500.0,E,1525791900,"[data structures, greedy, trees]",PROGRAMMING
+980,Codeforces Round #480 (Div. 2),2,Cactus to Tree,3000.0,F,1525791900,"[dp, graphs, trees]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Wrong Subtraction,,A,1525615500,[implementation],PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Two-gram,,B,1525615500,"[implementation, strings]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Less or Equal,,C,1525615500,[sortings],PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,"Divide by three, multiply by two",,D,1525615500,"[dfs and similar, math, sortings]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Cyclic Components,,E,1525615500,"[dfs and similar, dsu, graphs]",PROGRAMMING
+977,Codeforces Round #479 (Div. 3),12,Consecutive Subsequence,,F,1525615500,[dp],PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Aramic script,500.0,A,1525183500,"[implementation, strings]",PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Mancala,1000.0,B,1525183500,"[brute force, implementation]",PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Valhalla Siege,1500.0,C,1525183500,[binary search],PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Ghosts,2000.0,D,1525183500,"[geometry, math]",PROGRAMMING
+975,Codeforces Round #478 (Div. 2),2,Hag's Khashba,2500.0,E,1525183500,[geometry],PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimum Binary Number,,A,1525099200,[implementation],PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Lara Croft and the New Game,,B,1525099200,"[implementation, math]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Nested Segments,,C,1525099200,"[greedy, implementation, sortings]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Degree Set,,D,1525099200,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Well played!,,E,1525099200,"[greedy, sortings]",PROGRAMMING
+976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimal k-covering,,F,1525099200,[flows],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Stairs and Elevators,500.0,A,1525007700,[binary search],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Resource Distribution,1000.0,B,1525007700,"[binary search, implementation, sortings]",PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Big Secret,1500.0,C,1525007700,[],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Aztec Catacombs,2000.0,D,1525007700,[constructive algorithms],PROGRAMMING
+925,VK Cup 2018 - Round 3,12,May Holidays,2750.0,E,1525007700,"[data structures, trees]",PROGRAMMING
+925,VK Cup 2018 - Round 3,12,Parametric Circulation,3250.0,F,1525007700,[],PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Stairs and Elevators,500.0,A,1525007700,"[binary search, data structures, greedy]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Resource Distribution,1000.0,B,1525007700,"[binary search, data structures, greedy, two pointers]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Big Secret,1500.0,C,1525007700,"[constructive algorithms, data structures, greedy]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Aztec Catacombs,2000.0,D,1525007700,"[constructive algorithms, graphs]",PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,May Holidays,2750.0,E,1525007700,[],PROGRAMMING
+966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Parametric Circulation,3250.0,F,1525007700,[flows],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Mind the Gap,500.0,A,1525007700,[implementation],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Watering System,1000.0,B,1525007700,[sortings],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Stairs and Elevators,1500.0,C,1525007700,[binary search],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Resource Distribution,2000.0,D,1525007700,"[binary search, sortings]",PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Big Secret,2750.0,E,1525007700,[],PROGRAMMING
+967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Aztec Catacombs,3250.0,F,1525007700,[],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Paper Airplanes,500.0,A,1524677700,[math],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Battleship,1000.0,B,1524677700,[implementation],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Greedy Arkady,1500.0,C,1524677700,[math],PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Single-use Stones,2000.0,D,1524677700,"[binary search, flows, greedy, two pointers]",PROGRAMMING
+965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Short Code,2500.0,E,1524677700,"[data structures, dp, greedy, strings, trees]",PROGRAMMING
+927,VK Cup 2018 - Wild-card Round 2,12,BuberPool Taxi Optimization,,A,1524152100,[],PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Alternating Sum,500.0,A,1523973900,"[math, number theory]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Destruction of a Tree,1000.0,B,1523973900,"[constructive algorithms, dfs and similar, dp, greedy, trees]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Cutting Rectangle,1500.0,C,1523973900,"[brute force, math, number theory]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Frequency of String,2000.0,D,1523973900,"[hashing, string suffix structures, strings]",PROGRAMMING
+963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Circles of Waiting,2500.0,E,1523973900,[math],PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Splits,500.0,A,1523973900,[math],PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Messages,1000.0,B,1523973900,[math],PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Alternating Sum,1500.0,C,1523973900,"[math, matrices, number theory]",PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Destruction of a Tree,2000.0,D,1523973900,"[dfs and similar, dp, trees]",PROGRAMMING
+964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Cutting Rectangle,2500.0,E,1523973900,[math],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (easy),,A1,1523689500,[implementation],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (medium),,A2,1523689500,"[hashing, strings]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (hard),,A3,1523689500,[],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (easy),,B1,1523689500,[implementation],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (medium),,B2,1523689500,"[data structures, greedy, trees]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (easy),,C1,1523689500,[brute force],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (medium),,C2,1523689500,[dp],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (hard),,C3,1523689500,"[data structures, dp]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (easy),,D1,1523689500,"[expression parsing, math]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (hard),,D2,1523689500,[],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (easy),,E1,1523689500,"[brute force, geometry, greedy, math]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (medium),,E2,1523689500,"[binary search, dp, greedy, sortings]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (hard),,E3,1523689500,[geometry],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (easy),,F1,1523689500,[implementation],PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (medium),,F2,1523689500,"[binary search, two pointers]",PROGRAMMING
+958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (hard),,F3,1523689500,[fft],PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Equator,,A,1523370900,[implementation],PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Students in Railway Carriage,,B,1523370900,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Make a Square,,C,1523370900,"[brute force, implementation, math]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Merge Equals,,D,1523370900,"[data structures, implementation]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,"Byteland, Berland and Disputed Cities",,E,1523370900,"[constructive algorithms, greedy]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Simple Cycles Edges,,F,1523370900,"[dfs and similar, graphs, trees]",PROGRAMMING
+962,Educational Codeforces Round 42 (Rated for Div. 2),2,Visible Black Areas,,G,1523370900,"[data structures, dsu, geometry, trees]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Check the string,500.0,A,1523117100,[implementation],PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Minimize the error,1000.0,B,1523117100,"[data structures, greedy, sortings]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Subsequence Counting,1500.0,C,1523117100,"[bitmasks, constructive algorithms, greedy, implementation]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Full Binary Tree Queries,2000.0,D,1523117100,"[brute force, implementation, trees]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Alternating Tree,2250.0,E,1523117100,"[combinatorics, dfs and similar, divide and conquer, dp, probabilities, trees]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Pathwalks,2500.0,F,1523117100,"[data structures, dp, graphs]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Bandit Blues,3000.0,G,1523117100,"[combinatorics, dp, fft, math]",PROGRAMMING
+960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Santa's Gift,3500.0,H,1523117100,"[data structures, trees]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tetris,,A,1522850700,[implementation],PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Lecture Sleep,,B,1522850700,"[data structures, dp, implementation, two pointers]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Chessboard,,C,1522850700,"[bitmasks, brute force, implementation]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Pair Of Lines,,D,1522850700,[geometry],PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tufurama,,E,1522850700,[data structures],PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,k-substrings,,F,1522850700,"[binary search, hashing, string suffix structures]",PROGRAMMING
+961,Educational Codeforces Round 41 (Rated for Div. 2),2,Partitions,,G,1522850700,"[combinatorics, math, number theory]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the even-odd game,500.0,A,1522771500,"[games, math]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the message,1000.0,B,1522771500,"[dsu, implementation]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the wrong algorithm,1250.0,C,1522771500,"[constructive algorithms, trees]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and another array construction task,1750.0,D,1522771500,"[constructive algorithms, greedy, number theory]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the xor-MST,2000.0,E,1522771500,"[bitmasks, dp, graphs, implementation, math]",PROGRAMMING
+959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and yet another xor task,2500.0,F,1522771500,"[bitmasks, dp, math, matrices]",PROGRAMMING
+952,April Fools Contest 2018,12,Quirky Quantifiers,,A,1522596900,[math],PROGRAMMING
+952,April Fools Contest 2018,12,A Map of the Cat,,B,1522596900,[brute force],PROGRAMMING
+952,April Fools Contest 2018,12,Ravioli Sort,,C,1522596900,[implementation],PROGRAMMING
+952,April Fools Contest 2018,12,I'm Feeling Lucky!,,D,1522596900,[probabilities],PROGRAMMING
+952,April Fools Contest 2018,12,Cheese Board,,E,1522596900,[],PROGRAMMING
+952,April Fools Contest 2018,12,2 + 2 != 4,,F,1522596900,[],PROGRAMMING
+952,April Fools Contest 2018,12,Puzzling Language,,G,1522596900,[constructive algorithms],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Mystical Mosaic,500.0,A,1521905700,[implementation],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Three-level Laser,1000.0,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Riverside Curio,1250.0,C,1521905700,"[data structures, greedy]",PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Contact ATC,2000.0,D,1521905700,[],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Wardrobe,2250.0,E,1521905700,[],PROGRAMMING
+924,VK Cup 2018 - Round 2,12,Minimal Subset Difference,3000.0,F,1521905700,[],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Mystical Mosaic,500.0,A,1521905700,[implementation],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Three-level Laser,1000.0,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Riverside Curio,1250.0,C,1521905700,"[data structures, greedy, implementation]",PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Contact ATC,2000.0,D,1521905700,[],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Wardrobe,2250.0,E,1521905700,[dp],PROGRAMMING
+956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Minimal Subset Difference,3000.0,F,1521905700,"[bitmasks, dp]",PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Tritonic Iridescence,500.0,A,1521905700,[implementation],PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Mystical Mosaic,1000.0,B,1521905700,[brute force],PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Three-level Laser,1500.0,C,1521905700,"[binary search, math]",PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Riverside Curio,1750.0,D,1521905700,[greedy],PROGRAMMING
+957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Contact ATC,2500.0,E,1521905700,[],PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Feed the cat,500.0,A,1521822900,"[greedy, math]",PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Not simply beatiful strings,1000.0,B,1521822900,[implementation],PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Sad powers,1500.0,C,1521822900,"[binary search, math, number theory]",PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Scissors,2000.0,D,1521822900,"[brute force, strings]",PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Icicles,2500.0,E,1521822900,[],PROGRAMMING
+955,Codeforces Round #471 (Div. 2),2,Heaps,3000.0,F,1521822900,"[dp, trees]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Diagonal Walking,,A,1521698700,[implementation],PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,String Typing,,B,1521698700,[strings],PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Matrix Walk,,C,1521698700,[implementation],PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Fight Against Traffic,,D,1521698700,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Water Taps,,E,1521698700,"[binary search, greedy, sortings]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Runner's Problem,,F,1521698700,"[dp, matrices, sortings]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Castle Defense,,G,1521698700,"[binary search, two pointers]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Path Counting,,H,1521698700,"[combinatorics, dp]",PROGRAMMING
+954,Educational Codeforces Round 40 (Rated for Div. 2),2,Yet Another String Matching Problem,,I,1521698700,[fft],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,2-3-numbers,,A,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Add Points,,B,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Choose Place,,D,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Mobile Communications,,F,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Large Bouquets,,G,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,A Vital Problem,,I,1521300900,[],PROGRAMMING
+926,VK Cup 2018 - Wild-card Round 1,12,Segments,,J,1521300900,[data structures],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,2-3-numbers,,A,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Add Points,,B,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Choose Place,,D,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Mobile Communications,,F,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Large Bouquets,,G,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,A Vital Problem,,I,1521300900,[],PROGRAMMING
+953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Segments,,J,1521300900,[],PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Primal Sport,500.0,A,1520696100,"[math, number theory]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Producing Snow,1000.0,B,1520696100,"[binary search, data structures]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Perfect Security,1500.0,C,1520696100,"[data structures, greedy]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Picking Strings,1750.0,D,1520696100,"[constructive algorithms, implementation, strings]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Perpetual Subtraction,2250.0,E,1520696100,"[fft, math, matrices]",PROGRAMMING
+923,VK Cup 2018 - Round 1,12,Public Service,3000.0,F,1520696100,[],PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Primal Sport,500.0,A,1520696100,"[brute force, math, number theory]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Producing Snow,1000.0,B,1520696100,"[binary search, data structures, implementation]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perfect Security,1500.0,C,1520696100,"[data structures, strings]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Picking Strings,1750.0,D,1520696100,"[constructive algorithms, implementation]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perpetual Subtraction,2250.0,E,1520696100,"[fft, math, matrices]",PROGRAMMING
+947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Public Service,3000.0,F,1520696100,[],PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Protect Sheep,500.0,A,1520696100,[brute force],PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Primal Sport,1000.0,B,1520696100,"[brute force, math, number theory]",PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Producing Snow,1500.0,C,1520696100,"[binary search, data structures]",PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Perfect Security,2000.0,D,1520696100,[data structures],PROGRAMMING
+948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Picking Strings,2250.0,E,1520696100,"[constructive algorithms, implementation]",PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Zebras,500.0,A,1520583000,[greedy],PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,A Leapfrog in the Array,1000.0,B,1520583000,[math],PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Data Center Maintenance,1250.0,C,1520583000,"[dfs and similar, graphs]",PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Curfew,1750.0,D,1520583000,"[binary search, brute force]",PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Binary Cards,2250.0,E,1520583000,[brute force],PROGRAMMING
+949,Codeforces Round #469 (Div. 1),1,Astronomy,2500.0,F,1520583000,"[geometry, probabilities]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,"Left-handers, Right-handers and Ambidexters",500.0,A,1520583000,[implementation],PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Intercepted Message,1000.0,B,1520583000,[greedy],PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Zebras,1500.0,C,1520583000,"[constructive algorithms, greedy]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,A Leapfrog in the Array,2000.0,D,1520583000,"[constructive algorithms, math]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Data Center Maintenance,2250.0,E,1520583000,"[2-sat, graphs]",PROGRAMMING
+950,Codeforces Round #469 (Div. 2),2,Curfew,2750.0,F,1520583000,[greedy],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Partition,,A,1520348700,[greedy],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Weird Subtraction Process,,B,1520348700,[number theory],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,String Transformation,,C,1520348700,[greedy],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Timetable,,D,1520348700,[dp],PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Largest Beautiful Number,,E,1520348700,"[greedy, implementation]",PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Fibonacci String Subsequences,,F,1520348700,"[combinatorics, dp, matrices]",PROGRAMMING
+946,Educational Codeforces Round 39 (Rated for Div. 2),2,Almost Increasing Array,,G,1520348700,"[data structures, dp]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Peculiar apple-tree,500.0,A,1520177700,[dfs and similar],PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with String,1000.0,B,1520177700,"[implementation, probabilities, strings]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Teodor is not a liar!,1500.0,C,1520177700,"[data structures, dp]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with Tokens,2000.0,D,1520177700,"[data structures, games, implementation]",PROGRAMMING
+930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Coins Exhibition,2500.0,E,1520177700,"[data structures, dp]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Friends Meeting,500.0,A,1520177700,"[brute force, implementation, math]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,World Cup,1000.0,B,1520177700,[implementation],PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Laboratory Work,1750.0,C,1520177700,"[implementation, math]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Peculiar apple-tree,1750.0,D,1520177700,[dfs and similar],PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Game with String,2500.0,E,1520177700,"[implementation, math, probabilities]",PROGRAMMING
+931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Teodor is not a liar!,3000.0,F,1520177700,"[data structures, dp]",PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,World Cup,500.0,A,1520152800,[implementation],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Laboratory Work,1250.0,B,1520152800,[],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Peculiar apple-tree,1250.0,C,1520152800,[dfs and similar],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with String,2000.0,D,1520152800,[],PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Teodor is not a liar!,2500.0,E,1520152800,"[binary search, data structures, dp]",PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with Tokens,3000.0,F,1520152800,"[data structures, games]",PROGRAMMING
+944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Coins Exhibition,3500.0,G,1520152800,[],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Прокат велосипедов,500.0,A,1520004900,[],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Места в самолёте,1000.0,B,1520004900,[],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Красивая команда,1750.0,C,1520004900,[combinatorics],PROGRAMMING
+929,VK Cup 2018 - Квалификация 2,12,Пограничные врата,2500.0,D,1520004900,[],PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Save Energy!,500.0,A,1519574700,"[binary search, implementation, math]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Sleepy Game,1000.0,B,1519574700,"[dfs and similar, dp, graphs]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Lock Puzzle,1500.0,C,1519574700,"[constructive algorithms, implementation]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,World of Tank,2000.0,D,1519574700,"[dp, greedy]",PROGRAMMING
+936,Codeforces Round #467 (Div. 1),1,Iqea,2500.0,E,1519574700,"[data structures, dfs and similar, divide and conquer, dsu, shortest paths, trees]",PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Olympiad,500.0,A,1519574700,[implementation],PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Vile Grasshoppers,1000.0,B,1519574700,[math],PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Save Energy!,1500.0,C,1519574700,[math],PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Sleepy Game,2000.0,D,1519574700,"[dfs and similar, graphs]",PROGRAMMING
+937,Codeforces Round #467 (Div. 2),2,Lock Puzzle,2500.0,E,1519574700,[constructive algorithms],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Login Verification,500.0,A,1519486500,[],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Chat,1250.0,B,1519486500,[],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Dependency management,2000.0,C,1519486500,[],PROGRAMMING
+928,VK Cup 2018 - Квалификация 1,12,Autocompletion,2250.0,D,1519486500,[],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Points on the line,500.0,A,1519464900,[brute force],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Our Tanya is Crying Out Loud,1250.0,B,1519464900,[greedy],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Phone Numbers,1250.0,C,1519464900,[constructive algorithms],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Alena And The Heater,1500.0,D,1519464900,[implementation],PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Cashback,2000.0,E,1519464900,"[data structures, dp, greedy, math]",PROGRAMMING
+940,Codeforces Round #466 (Div. 2),2,Machine Learning,2750.0,F,1519464900,"[brute force, data structures]",PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and his Company,500.0,A,1519058100,[brute force],PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and the Gates,750.0,B,1519058100,[implementation],PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fifa and Fafa,1250.0,C,1519058100,[geometry],PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Alphabet,1750.0,D,1519058100,"[math, probabilities]",PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Mathematics,2250.0,E,1519058100,"[dp, trees]",PROGRAMMING
+935,Codeforces Round #465 (Div. 2),2,Fafa and Array,2750.0,F,1519058100,[data structures],PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Love Triangle,500.0,A,1518861900,[],PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Hamster Farm,1000.0,B,1518861900,[implementation],PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Convenient For Everybody,1500.0,C,1518861900,"[binary search, two pointers]",PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Love Rescue,2000.0,D,1518861900,"[dsu, greedy]",PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Maximize!,2500.0,E,1518861900,"[binary search, greedy, ternary search, two pointers]",PROGRAMMING
+939,Codeforces Round #464 (Div. 2),2,Cutlet,2750.0,F,1518861900,"[data structures, dp]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Word Correction,,A,1518793500,[implementation],PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Run For Your Prize,,B,1518793500,"[brute force, greedy]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Constructing Tests,,C,1518793500,"[binary search, brute force]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Buy a Ticket,,D,1518793500,"[data structures, graphs, shortest paths]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Max History,,E,1518793500,"[combinatorics, math]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Erasing Substrings,,F,1518793500,"[bitmasks, dp, greedy]",PROGRAMMING
+938,Educational Codeforces Round 38 (Rated for Div. 2),2,Shortest Path Queries,,G,1518793500,"[bitmasks, data structures, dsu, graphs]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindromic Supersequence,500.0,A,1518705300,[constructive algorithms],PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Recursive Queries,1000.0,B,1518705300,"[data structures, dfs and similar]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Permutation Cycle,1500.0,C,1518705300,"[brute force, constructive algorithms]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Tree,2000.0,D,1518705300,"[binary search, dp, trees]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Team Work,2500.0,E,1518705300,"[combinatorics, dp]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Escape Through Leaf,2500.0,F,1518705300,"[data structures, dp, geometry]",PROGRAMMING
+932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindrome Partition,3000.0,G,1518705300,"[dp, string suffix structures, strings]",PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Twisty Movement,500.0,A,1518609900,[dp],PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Determined Cleanup,750.0,B,1518609900,[math],PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Colourful Prospect,1500.0,C,1518609900,[geometry],PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Creative Cutout,2250.0,D,1518609900,"[brute force, combinatorics, math]",PROGRAMMING
+933,Codeforces Round #462 (Div. 1),1,A Preponderant Reunion,2500.0,E,1518609900,"[constructive algorithms, dp]",PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Compatible Pair,500.0,A,1518609900,"[brute force, games]",PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Prosperous Lot,1000.0,B,1518609900,[implementation],PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Twisty Movement,1500.0,C,1518609900,"[brute force, dp, implementation]",PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Determined Cleanup,2000.0,D,1518609900,[math],PROGRAMMING
+934,Codeforces Round #462 (Div. 2),2,A Colourful Prospect,2500.0,E,1518609900,[],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Cloning Toys,500.0,A,1518023700,[implementation],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Magic Forest,1000.0,B,1518023700,[brute force],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Cave Painting,1250.0,C,1518023700,"[brute force, number theory]",PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Robot Vacuum Cleaner,1500.0,D,1518023700,"[greedy, sortings]",PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Birds,2000.0,E,1518023700,[dp],PROGRAMMING
+922,Codeforces Round #461 (Div. 2),2,Divisibility,2750.0,F,1518023700,"[constructive algorithms, dp, greedy, number theory]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Water The Garden,,A,1517582100,[implementation],PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tea Queue,,B,1517582100,[implementation],PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Swap Adjacent Elements,,C,1517582100,"[dfs and similar, greedy, sortings, two pointers]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tanks,,D,1517582100,"[dp, greedy, implementation]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,Connected Components?,,E,1517582100,"[data structures, dfs and similar, dsu, graphs]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,SUM and REPLACE,,F,1517582100,"[brute force, data structures, number theory]",PROGRAMMING
+920,Educational Codeforces Round 37 (Rated for Div. 2),2,List Of Integers,,G,1517582100,"[binary search, bitmasks, brute force, combinatorics, math, number theory]",PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-1,,01,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-2,,02,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-3,,03,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-4,,04,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-5,,05,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-6,,06,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-7,,07,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-8,,08,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-9,,09,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-10,,10,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-11,,11,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-12,,12,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-13,,13,1517500800,[],PROGRAMMING
+921,AIM Tech Mini Marathon 1,12,Labyrinth-14,,14,1517500800,[],PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Supermarket,500.0,A,1517403900,[greedy],PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Perfect Number,750.0,B,1517403900,"[binary search, brute force, dp, implementation, number theory]",PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Seat Arrangements,1000.0,C,1517403900,[implementation],PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Substring,1500.0,D,1517403900,"[dfs and similar, dp, graphs]",PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,Congruence Equation,2000.0,E,1517403900,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+919,Codeforces Round #460 (Div. 2),2,A Game With Numbers,2500.0,F,1517403900,"[games, graphs, shortest paths]",PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,The Monster,500.0,A,1517236500,[greedy],PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,MADMAX,750.0,B,1517236500,"[dp, games, graphs]",PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,Pollywog,1500.0,C,1517236500,[dp],PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,Stranger Trees,2000.0,D,1517236500,"[dp, math, matrices, trees]",PROGRAMMING
+917,Codeforces Round #459 (Div. 1),1,Upside Down,2750.0,E,1517236500,"[data structures, string suffix structures, strings, trees]",PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,Eleven,500.0,A,1517236500,[implementation],PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,Radio Station,1000.0,B,1517236500,[implementation],PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,The Monster,1500.0,C,1517236500,"[data structures, greedy]",PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,MADMAX,1750.0,D,1517236500,"[dfs and similar, dp, games]",PROGRAMMING
+918,Codeforces Round #459 (Div. 2),2,Pollywog,2500.0,E,1517236500,[],PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Perfect Squares,500.0,A,1516462500,"[implementation, math]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Conan and Agasa play a Card Game,1000.0,B,1516462500,"[games, greedy]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Travelling Salesman and Special Numbers,1500.0,C,1516462500,"[brute force, combinatorics, dp]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Bash and a Tough Math Puzzle,2000.0,D,1516462500,"[data structures, number theory]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Palindromes in a Tree,2500.0,E,1516462500,"[bitmasks, divide and conquer, trees]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Substrings in a String,3000.0,F,1516462500,"[bitmasks, brute force, string suffix structures, strings]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Sum the Fibonacci,3500.0,G,1516462500,"[bitmasks, divide and conquer]",PROGRAMMING
+914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Ember and Storm's Tree Game,3750.0,H,1516462500,"[combinatorics, dp, games, trees]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Alarm Snooze,500.0,A,1516372500,"[brute force, implementation]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Binary Sequence (changed after round),1000.0,B,1516372500,"[bitmasks, greedy]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Interesting Graph,1500.0,C,1516372500,"[constructive algorithms, graphs, shortest paths]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and To-do List,2250.0,D,1516372500,"[data structures, trees]",PROGRAMMING
+916,Codeforces Round #457 (Div. 2),2,Jamie and Tree,2500.0,E,1516372500,"[data structures, trees]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Garden,,A,1515848700,[implementation],PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Browser,,B,1515848700,[implementation],PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Permute Digits,,C,1515848700,"[dp, greedy]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Almost Acyclic Graph,,D,1515848700,"[dfs and similar, graphs]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Physical Education Lessons,,E,1515848700,"[data structures, implementation, sortings]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Imbalance Value of a Tree,,F,1515848700,"[data structures, dsu, graphs, trees]",PROGRAMMING
+915,Educational Codeforces Round 36 (Rated for Div. 2),2,Coprime Arrays,,G,1515848700,"[math, number theory]",PROGRAMMING
+913,Hello 2018,12,Modular Exponentiation,500.0,A,1515422700,"[implementation, math]",PROGRAMMING
+913,Hello 2018,12,Christmas Spruce,750.0,B,1515422700,"[implementation, trees]",PROGRAMMING
+913,Hello 2018,12,Party Lemonade,1000.0,C,1515422700,"[bitmasks, dp, greedy]",PROGRAMMING
+913,Hello 2018,12,Too Easy Problems,1250.0,D,1515422700,"[binary search, brute force, data structures, greedy, sortings]",PROGRAMMING
+913,Hello 2018,12,Logical Expression,1750.0,E,1515422700,"[bitmasks, dp, shortest paths]",PROGRAMMING
+913,Hello 2018,12,Strongly Connected Tournament,2250.0,F,1515422700,"[dp, graphs, probabilities]",PROGRAMMING
+913,Hello 2018,12,Power Substring,3000.0,G,1515422700,"[math, number theory]",PROGRAMMING
+913,Hello 2018,12,Don't Exceed,3500.0,H,1515422700,"[math, probabilities]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,Tricky Alchemy,500.0,A,1515162900,[implementation],PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,New Year's Eve,1000.0,B,1515162900,"[bitmasks, constructive algorithms]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,"Perun, Ult!",1750.0,C,1515162900,"[brute force, greedy, sortings]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,Fishes,2000.0,D,1515162900,"[data structures, probabilities]",PROGRAMMING
+912,Codeforces Round #456 (Div. 2),2,Prime Gift,2500.0,E,1515162900,"[binary search, dfs and similar, math, meet-in-the-middle, number theory, two pointers]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Counting Cards,500.0,A,1514562000,[implementation],PROGRAMMING
+908,Good Bye 2017,12,New Year and Buggy Bot,750.0,B,1514562000,"[brute force, implementation]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Curling,1000.0,C,1514562000,"[brute force, geometry, implementation, math]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Arbitrary Arrangement,1750.0,D,1514562000,"[dp, math, probabilities]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Entity Enumeration,1750.0,E,1514562000,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Rainbow Roads,2000.0,F,1514562000,"[graphs, greedy, implementation]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Original Order,2750.0,G,1514562000,"[dp, math]",PROGRAMMING
+908,Good Bye 2017,12,New Year and Boolean Bridges,3500.0,H,1514562000,[],PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Nearest Minimums,,A,1514469900,[implementation],PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Two Cakes,,B,1514469900,"[binary search, brute force, implementation]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Three Garlands,,C,1514469900,"[brute force, constructive algorithms]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Inversion Counting,,D,1514469900,"[brute force, math]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Stack Sorting,,E,1514469900,"[data structures, implementation]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Tree Destruction,,F,1514469900,"[constructive algorithms, dfs and similar, graphs, greedy, trees]",PROGRAMMING
+911,Educational Codeforces Round 35 (Rated for Div. 2),2,Mass Change Queries,,G,1514469900,[data structures],PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Generate Login,500.0,A,1514392500,"[brute force, greedy, sortings]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Segments,1000.0,B,1514392500,"[constructive algorithms, math]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Python Indentation,1500.0,C,1514392500,[dp],PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Colorful Points,1750.0,D,1514392500,"[data structures, greedy, implementation]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,Coprocessor,2000.0,E,1514392500,"[dfs and similar, dp, graphs, greedy]",PROGRAMMING
+909,Codeforces Round #455 (Div. 2),2,AND-permutations,2500.0,F,1514392500,[constructive algorithms],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Masha and Bears,500.0,A,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Tic-Tac-Toe,1000.0,B,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Shockers,1500.0,C,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Seating of Students,2250.0,D,1514037900,[constructive algorithms],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Party,2250.0,E,1514037900,[],PROGRAMMING
+904,Технокубок 2018 - Отборочный Раунд 4,12,Power Tower,3000.0,F,1514037900,[],PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Shockers,500.0,A,1514037900,[implementation],PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Seating of Students,1250.0,B,1514037900,"[brute force, constructive algorithms, math]",PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Party,1250.0,C,1514037900,"[bitmasks, brute force, dp, graphs]",PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Power Tower,2000.0,D,1514037900,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Reverses,2500.0,E,1514037900,"[dp, string suffix structures, strings]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Masha and Bears,500.0,A,1514037900,"[brute force, implementation]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Tic-Tac-Toe,1000.0,B,1514037900,[implementation],PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Shockers,1500.0,C,1514037900,"[bitmasks, implementation]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Seating of Students,2250.0,D,1514037900,[],PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Party,2250.0,E,1514037900,"[bitmasks, dp]",PROGRAMMING
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Power Tower,3000.0,F,1514037900,[],PROGRAMMING
+910,Testing Round #14 (Unrated),12,The Way to Home,500.0,A,1513940700,"[dfs and similar, dp, greedy]",PROGRAMMING
+910,Testing Round #14 (Unrated),12,Door Frames,1000.0,B,1513940700,"[greedy, implementation]",PROGRAMMING
+910,Testing Round #14 (Unrated),12,Minimum Sum,1500.0,C,1513940700,[greedy],PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Hashing Trees,500.0,A,1513697700,"[constructive algorithms, trees]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,GCD of Polynomials,1000.0,B,1513697700,"[constructive algorithms, math]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Bipartite Segments,1750.0,C,1513697700,"[binary search, data structures, dfs and similar, dsu, graphs, two pointers]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Weighting a Tree,2000.0,D,1513697700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+901,Codeforces Round #453 (Div. 1),1,Cyclic Cipher,2500.0,E,1513697700,[fft],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Visiting a Friend,500.0,A,1513697700,[implementation],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Coloring a Tree,1000.0,B,1513697700,"[dfs and similar, dsu]",PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Hashing Trees,1500.0,C,1513697700,[],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,GCD of Polynomials,2000.0,D,1513697700,[math],PROGRAMMING
+902,Codeforces Round #453 (Div. 2),2,Bipartite Segments,2750.0,E,1513697700,"[data structures, dfs and similar]",PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Splitting in Teams,500.0,A,1513492500,[greedy],PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Months and Years,1000.0,B,1513492500,[implementation],PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Dividing the numbers,1500.0,C,1513492500,"[constructive algorithms, graphs]",PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Shovel Sale,1750.0,D,1513492500,[math],PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Segments Removal,2250.0,E,1513492500,"[data structures, dsu, flows, two pointers]",PROGRAMMING
+899,Codeforces Round #452 (Div. 2),2,Letters Removing,2500.0,F,1513492500,[data structures],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Rounding,500.0,A,1513424100,[implementation],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Proper Nutrition,750.0,B,1513424100,"[brute force, implementation, number theory]",PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Phone Numbers,1500.0,C,1513424100,"[implementation, strings]",PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Alarm Clock,1750.0,D,1513424100,[greedy],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Squares and not squares,2000.0,E,1513424100,[greedy],PROGRAMMING
+898,Codeforces Round #451 (Div. 2),2,Restoring the Expression,2500.0,F,1513424100,"[brute force, hashing, math]",PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Hungry Student Problem,,A,1513091100,[greedy],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,The Modcrab,,B,1513091100,[greedy],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Boxes Packing,,C,1513091100,[greedy],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Almost Difference,,D,1513091100,[math],PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Swapping Characters,,E,1513091100,"[hashing, implementation, strings]",PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Clear The Matrix,,F,1513091100,"[bitmasks, dp]",PROGRAMMING
+903,Educational Codeforces Round 34 (Rated for Div. 2),2,Yet Another Maxflow Problem,,G,1513091100,"[data structures, flows]",PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Find Extra One,500.0,A,1513008300,[implementation],PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Position in Fraction,1000.0,B,1513008300,[math],PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Remove Extra One,1500.0,C,1513008300,"[brute force, data structures]",PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Unusual Sequences,2000.0,D,1513008300,"[bitmasks, combinatorics, dp, math, number theory]",PROGRAMMING
+900,Codeforces Round #450 (Div. 2),2,Maximum Questions,2500.0,E,1513008300,"[data structures, dp, strings]",PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,Nephren gives a riddle,500.0,A,1512223500,[dfs and similar],PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,Ithea Plays With Chtholly,1000.0,B,1512223500,"[games, greedy]",PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,"Willem, Chtholly and Seniorious",1500.0,C,1512223500,[probabilities],PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,Nephren Runs a Cinema,2000.0,D,1512223500,"[chinese remainder theorem, combinatorics, math, number theory]",PROGRAMMING
+896,Codeforces Round #449 (Div. 1),1,"Welcome home, Chtholly",2500.0,E,1512223500,"[data structures, dsu]",PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Scarborough Fair,500.0,A,1512223500,[implementation],PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Chtholly's request,1000.0,B,1512223500,[brute force],PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Nephren gives a riddle,1500.0,C,1512223500,"[combinatorics, math]",PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,Ithea Plays With Chtholly,2000.0,D,1512223500,[implementation],PROGRAMMING
+897,Codeforces Round #449 (Div. 2),2,"Willem, Chtholly and Seniorious",2500.0,E,1512223500,[],PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,Pizza Separation,500.0,A,1511712300,[brute force],PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,XK Segments,1000.0,B,1511712300,"[binary search, sortings, two pointers]",PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,Square Subsets,1750.0,C,1511712300,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,String Mark,2000.0,D,1511712300,"[combinatorics, math, strings]",PROGRAMMING
+895,Codeforces Round #448 (Div. 2),2,Eyes Closed,2250.0,E,1511712300,"[data structures, probabilities]",PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Chess For Three,,A,1511449500,[implementation],PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Beautiful Divisors,,B,1511449500,[brute force],PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Rumor,,C,1511449500,[dfs and similar],PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Credit Card,,D,1511449500,"[data structures, dp, greedy, implementation]",PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Counting Arrays,,E,1511449500,"[combinatorics, dp, number theory]",PROGRAMMING
+893,Educational Codeforces Round 33 (Rated for Div. 2),2,Subtree Minimum Query,,F,1511449500,"[data structures, trees]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,QAQ,500.0,A,1511099700,"[brute force, dp]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Ralph And His Magic Field,1000.0,B,1511099700,"[combinatorics, math, number theory]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Marco and GCD Sequence,1500.0,C,1511099700,"[constructive algorithms, math]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Ralph And His Tour in Binary Country,2000.0,D,1511099700,"[data structures, trees]",PROGRAMMING
+894,Codeforces Round #447 (Div. 2),2,Ralph and Mushrooms,2500.0,E,1511099700,"[dp, graphs]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Pride,500.0,A,1510929300,"[brute force, dp, greedy, math, number theory]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Gluttony,1000.0,B,1510929300,"[constructive algorithms, greedy]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Envy,1500.0,C,1510929300,"[data structures, dsu, graphs]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Sloth,2000.0,D,1510929300,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING
+891,Codeforces Round #446 (Div. 1),1,Lust,2500.0,E,1510929300,"[combinatorics, math, matrices]",PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Greed,500.0,A,1510929300,[implementation],PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Wrath,1000.0,B,1510929300,"[implementation, two pointers]",PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Pride,1500.0,C,1510929300,[greedy],PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Gluttony,2000.0,D,1510929300,"[constructive algorithms, greedy]",PROGRAMMING
+892,Codeforces Round #446 (Div. 2),2,Envy,2500.0,E,1510929300,[],PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,ACM ICPC,500.0,A,1510502700,[brute force],PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Vlad and Cafes,1000.0,B,1510502700,[],PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Petya and Catacombs,1500.0,C,1510502700,"[dsu, greedy]",PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Restoration of string,2000.0,D,1510502700,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Maximum Element,2500.0,E,1510502700,"[combinatorics, dp]",PROGRAMMING
+886,Технокубок 2018 - Отборочный Раунд 3,12,Symmetric Projections,3000.0,F,1510502700,[geometry],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Petya and Catacombs,500.0,A,1510502700,[greedy],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Restoration of string,1000.0,B,1510502700,"[dsu, graphs, strings]",PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Maximum Element,1500.0,C,1510502700,[dp],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Symmetric Projections,2000.0,D,1510502700,[geometry],PROGRAMMING
+889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Mod Mod Mod,2250.0,E,1510502700,"[binary search, dp, math]",PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,ACM ICPC,500.0,A,1510502700,[],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Vlad and Cafes,1000.0,B,1510502700,[],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Petya and Catacombs,1500.0,C,1510502700,[greedy],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Restoration of string,2000.0,D,1510502700,"[graphs, greedy, strings]",PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Maximum Element,2500.0,E,1510502700,[dp],PROGRAMMING
+890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Symmetric Projections,3000.0,F,1510502700,[],PROGRAMMING
+888,Educational Codeforces Round 32,12,Local Extrema,,A,1510239900,"[brute force, implementation]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Buggy Robot,,B,1510239900,"[dp, greedy]",PROGRAMMING
+888,Educational Codeforces Round 32,12,K-Dominant Character,,C,1510239900,"[binary search, implementation, two pointers]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Almost Identity Permutations,,D,1510239900,"[combinatorics, dp, math]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Maximum Subsequence,,E,1510239900,"[bitmasks, divide and conquer, meet-in-the-middle]",PROGRAMMING
+888,Educational Codeforces Round 32,12,Connecting Vertices,,F,1510239900,[dp],PROGRAMMING
+888,Educational Codeforces Round 32,12,Xor-MST,,G,1510239900,"[bitmasks, constructive algorithms, data structures]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Div. 64,500.0,A,1509725100,[implementation],PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Cubes for Masha,1000.0,B,1509725100,[brute force],PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Solution for Cube,1500.0,C,1509725100,"[brute force, implementation]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Ratings and Reality Shows,2000.0,D,1509725100,"[data structures, two pointers]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Little Brother,2500.0,E,1509725100,"[binary search, geometry]",PROGRAMMING
+887,Codeforces Round #444 (Div. 2),2,Row of Models,3000.0,F,1509725100,"[greedy, sortings]",PROGRAMMING
+884,Educational Codeforces Round 31,12,Book Reading,,A,1509113100,[implementation],PROGRAMMING
+884,Educational Codeforces Round 31,12,Japanese Crosswords Strike Back,,B,1509113100,[implementation],PROGRAMMING
+884,Educational Codeforces Round 31,12,Bertown Subway,,C,1509113100,"[dfs and similar, greedy, math]",PROGRAMMING
+884,Educational Codeforces Round 31,12,Boxes And Balls,,D,1509113100,"[data structures, greedy]",PROGRAMMING
+884,Educational Codeforces Round 31,12,Binary Matrix,,E,1509113100,[dsu],PROGRAMMING
+884,Educational Codeforces Round 31,12,Anti-Palindromize,,F,1509113100,"[flows, graphs, greedy]",PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Short Program,500.0,A,1509029100,"[bitmasks, constructive algorithms]",PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Teams Formation,1250.0,B,1509029100,[implementation],PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Tournament,1250.0,C,1509029100,"[data structures, graphs]",PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Magic Breeding,2000.0,D,1509029100,[],PROGRAMMING
+878,Codeforces Round #443 (Div. 1),1,Numbers on the blackboard,2500.0,E,1509029100,"[combinatorics, dp]",PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Borya's Diagnosis,500.0,A,1509029100,[implementation],PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Table Tennis,1000.0,B,1509029100,[implementation],PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Short Program,1500.0,C,1509029100,"[bitmasks, constructive algorithms, graph matchings]",PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Teams Formation,2250.0,D,1509029100,[],PROGRAMMING
+879,Codeforces Round #443 (Div. 2),2,Tournament,2250.0,E,1509029100,[],PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Alex and broken contest,500.0,A,1508773500,"[implementation, strings]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Nikita and string,1000.0,B,1508773500,"[brute force, dp]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Slava and tanks,1500.0,C,1508773500,[constructive algorithms],PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Olya and Energy Drinks,2000.0,D,1508773500,"[data structures, dfs and similar, shortest paths]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Danil and a Part-time Job,2250.0,E,1508773500,"[bitmasks, data structures, trees]",PROGRAMMING
+877,Codeforces Round #442 (Div. 2),2,Ann and Books,2750.0,F,1508773500,"[data structures, flows, hashing]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Automatic Door,,A,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Army,,B,1508573100,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Downloading B++,,C,1508573100,[binary search],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen Strike Back,,D,1508573100,"[binary search, dp]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Field of Wonders,,E,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lost in Transliteration,,F,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Orientation of Edges,,G,1508573100,[graphs],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Palindromic Cut,,H,1508573100,"[brute force, implementation]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Photo Processing,,I,1508573100,"[binary search, dp]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Renovation,,J,1508573100,"[greedy, sortings]",PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Road Widening,,K,1508573100,[implementation],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland.Taxi,,L,1508573100,[data structures],PROGRAMMING
+883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Quadcopter Competition,,M,1508573100,[greedy],PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Classroom Watch,500.0,A,1508151900,[brute force],PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Sorting the Coins,1000.0,B,1508151900,"[dsu, sortings, two pointers]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,National Property,1500.0,C,1508151900,"[2-sat, dfs and similar, graphs, implementation]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,High Cry,1750.0,D,1508151900,"[binary search, bitmasks, data structures, divide and conquer]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Delivery Club,2000.0,E,1508151900,"[binary search, data structures, dp]",PROGRAMMING
+875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Royal Questions,2500.0,F,1508151900,"[dsu, greedy]",PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Trip For Meal,500.0,A,1508151900,[math],PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Divisiblity of Differences,1000.0,B,1508151900,[math],PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Classroom Watch,1500.0,C,1508151900,[brute force],PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Sorting the Coins,2000.0,D,1508151900,"[dsu, sortings, trees, two pointers]",PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,National Property,2500.0,E,1508151900,"[2-sat, dfs and similar, graphs]",PROGRAMMING
+876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,High Cry,2750.0,F,1508151900,[data structures],PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Search for Pretty Integers,500.0,A,1508054700,"[brute force, implementation]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Maximum of Maximums of Minimums,1000.0,B,1508054700,[greedy],PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Maximum splitting,1500.0,C,1508054700,"[dp, greedy, number theory]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Something with XOR Queries,2250.0,D,1508054700,"[brute force, probabilities]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,"Points, Lines and Ready-made Titles",2500.0,E,1508054700,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+870,Technocup 2018 - Elimination Round 2,12,Paths,3250.0,F,1508054700,"[data structures, number theory]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Maximum splitting,500.0,A,1508054700,"[dp, greedy, math, number theory]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Something with XOR Queries,1250.0,B,1508054700,"[brute force, implementation]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,"Points, Lines and Ready-made Titles",1500.0,C,1508054700,"[dfs and similar, graphs]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Paths,2250.0,D,1508054700,"[number theory, sortings]",PROGRAMMING
+871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Restore the Tree,2250.0,E,1508054700,"[graphs, greedy, trees]",PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Search for Pretty Integers,500.0,A,1508054700,[implementation],PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum of Maximums of Minimums,1000.0,B,1508054700,[implementation],PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum splitting,1500.0,C,1508054700,"[greedy, math, number theory]",PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Something with XOR Queries,2250.0,D,1508054700,"[brute force, implementation]",PROGRAMMING
+872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,"Points, Lines and Ready-made Titles",2500.0,E,1508054700,[],PROGRAMMING
+873,Educational Codeforces Round 30,12,Chores,,A,1507817100,[implementation],PROGRAMMING
+873,Educational Codeforces Round 30,12,Balanced Substring,,B,1507817100,"[dp, implementation]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Strange Game On Matrix,,C,1507817100,"[greedy, two pointers]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Merge Sort,,D,1507817100,"[constructive algorithms, divide and conquer]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Awards For Contestants,,E,1507817100,"[brute force, data structures, dp]",PROGRAMMING
+873,Educational Codeforces Round 30,12,Forbidden Indices,,F,1507817100,"[dsu, string suffix structures, strings]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Artful Expedient,500.0,A,1507296900,"[brute force, implementation]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Eternal Immortality,1000.0,B,1507296900,[math],PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Intriguing Obsession,1500.0,C,1507296900,"[combinatorics, dp, math]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Overdosing Ubiquity,2250.0,D,1507296900,"[brute force, dfs and similar, graphs]",PROGRAMMING
+869,Codeforces Round #439 (Div. 2),2,The Untended Antiquity,2500.0,E,1507296900,"[data structures, hashing]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Bark to Unlock,250.0,A,1507187100,"[brute force, strings]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Race Against Time,500.0,B,1507187100,[implementation],PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Qualification Rounds,1000.0,C,1507187100,"[bitmasks, brute force, constructive algorithms, dp]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Huge Strings,1500.0,D,1507187100,"[bitmasks, brute force, dp, strings]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Policeman and a Tree,2250.0,E,1507187100,"[dp, graphs, trees]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Yet Another Minimization Problem,2500.0,F,1507187100,"[divide and conquer, dp]",PROGRAMMING
+868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,El Toll Caves,3500.0,G,1507187100,[math],PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Save the problem!,500.0,A,1506791100,[constructive algorithms],PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Ordering Pizza,1000.0,B,1506791100,"[binary search, sortings, ternary search]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Gotta Go Fast,1500.0,C,1506791100,"[binary search, dp]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Buy Low Sell High,2000.0,D,1506791100,"[constructive algorithms, data structures, greedy]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Hex Dyslexia,2500.0,E,1506791100,"[bitmasks, brute force, dp, graphs]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Egg Roulette,3000.0,F,1506791100,"[bitmasks, brute force, divide and conquer, math, meet-in-the-middle]",PROGRAMMING
+865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Flowers and Chocolate,3500.0,G,1506791100,"[combinatorics, math, matrices]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Save the problem!,500.0,A,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Ordering Pizza,1000.0,B,1506791100,"[greedy, implementation, sortings]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Gotta Go Fast,1500.0,C,1506791100,"[binary search, dp, probabilities]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Buy Low Sell High,2000.0,D,1506791100,"[data structures, greedy, two pointers]",PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Hex Dyslexia,2500.0,E,1506791100,[],PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Egg Roulette,3000.0,F,1506791100,[],PROGRAMMING
+866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Flowers and Chocolate,3500.0,G,1506791100,[math],PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Between the Offices,500.0,A,1506791100,[implementation],PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Save the problem!,1000.0,B,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Ordering Pizza,1500.0,C,1506791100,"[greedy, implementation, sortings, ternary search]",PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Gotta Go Fast,2000.0,D,1506791100,[],PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Buy Low Sell High,2500.0,E,1506791100,"[data structures, greedy]",PROGRAMMING
+867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Hex Dyslexia,3000.0,F,1506791100,[],PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Fair Game,500.0,A,1506335700,"[implementation, sortings]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Polycarp and Letters,1000.0,B,1506335700,"[brute force, implementation]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Bus,1500.0,C,1506335700,"[greedy, implementation]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Make a Permutation!,2000.0,D,1506335700,"[greedy, implementation]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Fire,2500.0,E,1506335700,"[dp, sortings]",PROGRAMMING
+864,Codeforces Round #436 (Div. 2),2,Cities Excursions,3000.0,F,1506335700,[dfs and similar],PROGRAMMING
+855,"Manthan, Codefest 17",12,Tom Riddle's Diary,500.0,A,1506263700,[implementation],PROGRAMMING
+855,"Manthan, Codefest 17",12,Marvolo Gaunt's Ring,1000.0,B,1506263700,"[data structures, dp]",PROGRAMMING
+855,"Manthan, Codefest 17",12,Helga Hufflepuff's Cup,1500.0,C,1506263700,"[dp, trees]",PROGRAMMING
+855,"Manthan, Codefest 17",12,Rowena Ravenclaw's Diadem,2000.0,D,1506263700,[trees],PROGRAMMING
+855,"Manthan, Codefest 17",12,Salazar Slytherin's Locket,2500.0,E,1506263700,"[bitmasks, dp]",PROGRAMMING
+855,"Manthan, Codefest 17",12,Nagini,3000.0,F,1506263700,[data structures],PROGRAMMING
+855,"Manthan, Codefest 17",12,Harry Vs Voldemort,3500.0,G,1506263700,"[dp, graphs, trees]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Quasi-palindrome,,A,1506006300,"[brute force, implementation]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Kayaking,,B,1506006300,"[brute force, greedy, sortings]",PROGRAMMING
+863,Educational Codeforces Round 29,12,1-2-3,,C,1506006300,"[graphs, implementation]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Yet Another Array Queries Problem,,D,1506006300,"[data structures, implementation]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Turn Off The TV,,E,1506006300,"[data structures, sortings]",PROGRAMMING
+863,Educational Codeforces Round 29,12,Almost Permutation,,F,1506006300,[flows],PROGRAMMING
+863,Educational Codeforces Round 29,12,Graphic Settings,,G,1506006300,[],PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the MEX,500.0,A,1505833500,[implementation],PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the bipartiteness,1000.0,B,1505833500,"[dfs and similar, graphs]",PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the xor,1500.0,C,1505833500,[constructive algorithms],PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the binary string,1750.0,D,1505833500,"[binary search, divide and conquer]",PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the function,2000.0,E,1505833500,"[binary search, data structures]",PROGRAMMING
+862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the final stage,2750.0,F,1505833500,"[data structures, strings]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Union of Doubly Linked Lists,,A,1505739900,[implementation],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Preparing for Merge Sort,,B,1505739900,[binary search],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Sum of Nestings,,C,1505739900,[],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Dog Show,,D,1505739900,"[data structures, greedy]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen,,E,1505739900,[binary search],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Elections,,F,1505739900,[greedy],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,University Classes,,G,1505739900,[implementation],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Load Testing,,H,1505739900,[],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Noise Level,,I,1505739900,[dfs and similar],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Students Initiation,,J,1505739900,"[binary search, flows]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Travel Cards,,K,1505739900,[sortings],PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland SU Computer Network,,L,1505739900,"[dfs and similar, hashing, trees]",PROGRAMMING
+847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Weather Tomorrow,,M,1505739900,[implementation],PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,k-rounding,750.0,A,1505653500,"[brute force, number theory]",PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Which floor?,750.0,B,1505653500,[brute force],PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Did you mean...,1500.0,C,1505653500,"[dp, greedy, implementation]",PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Polycarp's phone book,2000.0,D,1505653500,"[data structures, sortings]",PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Tests Renumeration,2500.0,E,1505653500,[implementation],PROGRAMMING
+858,Технокубок 2018 - Отборочный Раунд 1,12,Wizard's Tour,3000.0,F,1505653500,"[constructive algorithms, dfs and similar]",PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Did you mean...,500.0,A,1505653500,[greedy],PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Polycarp's phone book,1000.0,B,1505653500,"[brute force, data structures, hashing, strings]",PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Tests Renumeration,1500.0,C,1505653500,[greedy],PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Wizard's Tour,2000.0,D,1505653500,"[dfs and similar, graphs, greedy]",PROGRAMMING
+860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Arkady and a Nobody-men,2250.0,E,1505653500,"[data structures, dfs and similar, trees]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,k-rounding,750.0,A,1505653500,"[math, number theory]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Which floor?,750.0,B,1505653500,[brute force],PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Did you mean...,1500.0,C,1505653500,"[brute force, strings]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Polycarp's phone book,2000.0,D,1505653500,"[brute force, data structures, strings]",PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Tests Renumeration,2500.0,E,1505653500,[],PROGRAMMING
+861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Wizard's Tour,3000.0,F,1505653500,[dfs and similar],PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Declined Finalists,500.0,A,1505583300,[greedy],PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Lazy Security Guard,750.0,B,1505583300,"[brute force, math]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Pie Rules,1000.0,C,1505583300,"[dp, games]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Third Month Insanity,1500.0,D,1505583300,"[dp, probabilities]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Desk Disorder,2000.0,E,1505583300,"[combinatorics, dfs and similar, dsu, graphs, trees]",PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Ordering T-Shirts,2750.0,F,1505583300,[greedy],PROGRAMMING
+859,MemSQL Start[c]UP 3.0 - Round 1,12,Circle of Numbers,3000.0,G,1505583300,[math],PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Set Theory,,A,1505050500,"[brute force, constructive algorithms]",PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Similar Words,,B,1505050500,"[dp, strings]",PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Eleventh Birthday,,C,1505050500,"[combinatorics, dp, math]",PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Masha and Cactus,,D,1505050500,[],PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Satellites,,E,1505050500,[],PROGRAMMING
+856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,To Play or not to Play,,F,1505050500,[],PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Planning,750.0,A,1504702500,[greedy],PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Jury Meeting,750.0,B,1504702500,"[greedy, sortings, two pointers]",PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Boredom,1750.0,C,1504702500,[data structures],PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Michael and Charging Stations,1750.0,D,1504702500,"[binary search, dp]",PROGRAMMING
+853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Lada Malina,2500.0,E,1504702500,"[data structures, geometry]",PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Fraction,500.0,A,1504702500,"[brute force, constructive algorithms, math]",PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Maxim Buys an Apartment,1000.0,B,1504702500,[constructive algorithms],PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Planning,1750.0,C,1504702500,[],PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Jury Meeting,1750.0,D,1504702500,[greedy],PROGRAMMING
+854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Boredom,2500.0,E,1504702500,[data structures],PROGRAMMING
+846,Educational Codeforces Round 28,12,Curriculum Vitae,,A,1504623900,[brute force],PROGRAMMING
+846,Educational Codeforces Round 28,12,Math Show,,B,1504623900,"[brute force, greedy]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Four Segments,,C,1504623900,"[brute force, dp]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Monitor,,D,1504623900,"[binary search, data structures]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Chemistry in Berland,,E,1504623900,"[dfs and similar, greedy, trees]",PROGRAMMING
+846,Educational Codeforces Round 28,12,Random Query,,F,1504623900,"[math, two pointers]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Five Dimensional Points,500.0,A,1504535700,"[brute force, geometry, math]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a list of numbers,1000.0,B,1504535700,[number theory],PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a game with Mojtaba,1250.0,C,1504535700,"[bitmasks, dp, games]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Tournament Construction,1750.0,D,1504535700,"[dp, graphs, greedy, math]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Random Elections,2000.0,E,1504535700,"[bitmasks, brute force, fft, math]",PROGRAMMING
+850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Rainbow Balls,2500.0,F,1504535700,[math],PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a research in Mexican wave,500.0,A,1504535700,[implementation],PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and an exam about geometry,1000.0,B,1504535700,"[geometry, math]",PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Five Dimensional Points,1500.0,C,1504535700,"[brute force, math]",PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a list of numbers,2000.0,D,1504535700,[],PROGRAMMING
+851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a game with Mojtaba,2500.0,E,1504535700,"[bitmasks, games]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Digits,,A,1504432800,"[brute force, implementation, math]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Neural Network country,,B,1504432800,"[dp, matrices]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Property,,C,1504432800,"[greedy, sortings]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Exploration plan,,D,1504432800,"[binary search, flows, graph matchings, shortest paths]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Casinos and travel,,E,1504432800,[dp],PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Product transformation,,F,1504432800,"[combinatorics, math, number theory]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Bathroom terminal,,G,1504432800,[implementation],PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Bob and stages,,H,1504432800,"[dp, geometry]",PROGRAMMING
+852,Bubble Cup X - Finals [Online Mirror],12,Dating,,I,1504432800,"[brute force, dfs and similar, graphs, trees]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,From Y to Y,500.0,A,1504272900,[constructive algorithms],PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Rooter's Song,1000.0,B,1504272900,"[constructive algorithms, data structures, geometry, implementation, sortings, two pointers]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Goodbye Souvenir,1750.0,C,1504272900,"[data structures, divide and conquer]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Shake It!,1750.0,D,1504272900,"[combinatorics, dp, flows, graphs]",PROGRAMMING
+848,Codeforces Round #431 (Div. 1),1,Days of Floral Colours,2500.0,E,1504272900,"[combinatorics, dp, fft, math]",PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Odds and Ends,500.0,A,1504272900,[implementation],PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Tell Your World,1000.0,B,1504272900,"[brute force, geometry]",PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,From Y to Y,1500.0,C,1504272900,[constructive algorithms],PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Rooter's Song,2000.0,D,1504272900,[],PROGRAMMING
+849,Codeforces Round #431 (Div. 2),2,Goodbye Souvenir,2500.0,E,1504272900,[data structures],PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Kirill And The Game,500.0,A,1504019100,"[brute force, two pointers]",PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Gleb And Pizza,1000.0,B,1504019100,[geometry],PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Ilya And The Tree,1500.0,C,1504019100,"[dfs and similar, math, trees]",PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Vitya and Strange Lesson,2000.0,D,1504019100,"[binary search, data structures]",PROGRAMMING
+842,Codeforces Round #430 (Div. 2),2,Nikita and game,2500.0,E,1504019100,"[binary search, dfs and similar, divide and conquer, trees]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Sorting by Subsequences,500.0,A,1503592500,"[dfs and similar, dsu, implementation, sortings]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Interactive LowerBound,1000.0,B,1503592500,"[brute force, probabilities]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Upgrading Tree,1750.0,C,1503592500,"[constructive algorithms, dfs and similar, math]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Dynamic Shortest Path,2250.0,D,1503592500,"[graphs, shortest paths]",PROGRAMMING
+843,AIM Tech Round 4 (Div. 1),1,Maximum Flow,2250.0,E,1503592500,[flows],PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Diversity,500.0,A,1503592500,[implementation],PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Rectangles,1000.0,B,1503592500,"[combinatorics, math]",PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Sorting by Subsequences,1500.0,C,1503592500,[dfs and similar],PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Interactive LowerBound,2000.0,D,1503592500,"[brute force, probabilities]",PROGRAMMING
+844,AIM Tech Round 4 (Div. 2),2,Upgrading Tree,3000.0,E,1503592500,[],PROGRAMMING
+845,Educational Codeforces Round 27,12,Chess Tourney,,A,1503327900,[sortings],PROGRAMMING
+845,Educational Codeforces Round 27,12,Luba And The Ticket,,B,1503327900,"[brute force, greedy]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Two TVs,,C,1503327900,"[data structures, greedy, sortings]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Driving Test,,D,1503327900,"[data structures, dp, greedy]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Fire in the City,,E,1503327900,"[binary search, data structures]",PROGRAMMING
+845,Educational Codeforces Round 27,12,Guards In The Storehouse,,F,1503327900,[dp],PROGRAMMING
+845,Educational Codeforces Round 27,12,Shortest Path Problem?,,G,1503327900,"[dfs and similar, math]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,Leha and Function,500.0,A,1503068700,"[combinatorics, greedy, math, number theory, sortings]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,Leha and another game about graph,1000.0,B,1503068700,"[constructive algorithms, data structures, dfs and similar, dp, graphs]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,On the Bench,1500.0,C,1503068700,"[combinatorics, dp]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,Destiny,2000.0,D,1503068700,"[data structures, probabilities]",PROGRAMMING
+840,Codeforces Round #429 (Div. 1),1,In a Trap,2500.0,E,1503068700,[trees],PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Generous Kefa,500.0,A,1503068700,"[brute force, implementation]",PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Godsend,1000.0,B,1503068700,"[games, math]",PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Leha and Function,1500.0,C,1503068700,[greedy],PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,Leha and another game about graph,2000.0,D,1503068700,"[dfs and similar, graphs]",PROGRAMMING
+841,Codeforces Round #429 (Div. 2),2,On the Bench,2500.0,E,1503068700,[],PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Arya and Bran,500.0,A,1502548500,[implementation],PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Game of the Rows,1000.0,B,1502548500,"[brute force, greedy, implementation]",PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Journey,1500.0,C,1502548500,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Winter is here,2000.0,D,1502548500,"[combinatorics, dp, math, number theory]",PROGRAMMING
+839,Codeforces Round #428 (Div. 2),2,Mother of Dragons,2500.0,E,1502548500,"[brute force, graphs, math, meet-in-the-middle]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Binary Blocks,,A,1502085900,[brute force],PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Diverging Directions,,B,1502085900,"[data structures, dfs and similar, trees]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Future Failure,,C,1502085900,"[dp, games]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Airplane Arrangements,,D,1502085900,"[math, number theory]",PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Convex Countour,,E,1502085900,[dp],PROGRAMMING
+838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Expected Earnings,,F,1502085900,[],PROGRAMMING
+837,Educational Codeforces Round 26,12,Text Volume,,A,1501773300,[implementation],PROGRAMMING
+837,Educational Codeforces Round 26,12,Flag of Berland,,B,1501773300,"[brute force, implementation]",PROGRAMMING
+837,Educational Codeforces Round 26,12,Two Seals,,C,1501773300,[brute force],PROGRAMMING
+837,Educational Codeforces Round 26,12,Round Subset,,D,1501773300,[dp],PROGRAMMING
+837,Educational Codeforces Round 26,12,Vasya's Function,,E,1501773300,"[binary search, implementation, math]",PROGRAMMING
+837,Educational Codeforces Round 26,12,Prefix Sums,,F,1501773300,"[binary search, brute force, combinatorics, math, matrices]",PROGRAMMING
+837,Educational Codeforces Round 26,12,Functions On The Segments,,G,1501773300,[data structures],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Key races,500.0,A,1501511700,[math],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,The number on the board,750.0,B,1501511700,[greedy],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Star sky,1250.0,C,1501511700,"[dp, implementation]",PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Palindromic characteristics,1500.0,D,1501511700,"[brute force, dp, hashing, strings]",PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,The penguin's game,2250.0,E,1501511700,[constructive algorithms],PROGRAMMING
+835,Codeforces Round #427 (Div. 2),2,Roads in the Kingdom,2250.0,F,1501511700,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,The Meaningless Game,500.0,A,1501425300,"[math, number theory]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,The Bakery,1250.0,B,1501425300,"[binary search, data structures, dp, two pointers]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,Ever-Hungry Krakozyabra,1500.0,C,1501425300,"[brute force, greedy]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,Red-Black Cobweb,2250.0,D,1501425300,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING
+833,Codeforces Round #426 (Div. 1),1,Caramel Clouds,2500.0,E,1501425300,"[data structures, dp, sortings]",PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Useless Toy,500.0,A,1501425300,[implementation],PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Festive Evening,1000.0,B,1501425300,"[data structures, implementation]",PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Meaningless Game,1500.0,C,1501425300,[math],PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,The Bakery,2250.0,D,1501425300,"[data structures, divide and conquer, dp]",PROGRAMMING
+834,Codeforces Round #426 (Div. 2),2,Ever-Hungry Krakozyabra,2500.0,E,1501425300,[],PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Sasha and Sticks,500.0,A,1500906900,"[games, math]",PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Petya and Exam,1000.0,B,1500906900,[implementation],PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Strange Radiation,1750.0,C,1500906900,"[binary search, implementation, math]",PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,"Misha, Grisha and Underground",2000.0,D,1500906900,"[dfs and similar, trees]",PROGRAMMING
+832,Codeforces Round #425 (Div. 2),2,Vasya and Shifts,2500.0,E,1500906900,[matrices],PROGRAMMING
+825,Educational Codeforces Round 25,12,Binary Protocol,,A,1500217500,[implementation],PROGRAMMING
+825,Educational Codeforces Round 25,12,Five-In-a-Row,,B,1500217500,"[brute force, implementation]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Multi-judge Solving,,C,1500217500,"[greedy, implementation]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Suitable Replacement,,D,1500217500,"[greedy, implementation]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Minimal Labels,,E,1500217500,"[data structures, graphs, greedy]",PROGRAMMING
+825,Educational Codeforces Round 25,12,String Compression,,F,1500217500,"[dp, hashing, string suffix structures, strings]",PROGRAMMING
+825,Educational Codeforces Round 25,12,Tree Queries,,G,1500217500,"[dfs and similar, graphs, trees]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Office Keys,500.0,A,1499958300,"[binary search, brute force, dp, greedy, sortings]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Cards Sorting,1000.0,B,1499958300,"[data structures, implementation, sortings]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Bamboo Partition,1500.0,C,1499958300,"[brute force, math, number theory, sortings, two pointers]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Singer House,2250.0,D,1499958300,"[combinatorics, dp, trees]",PROGRAMMING
+830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Perpetual Motion Machine,2250.0,E,1499958300,"[constructive algorithms, implementation, math, trees]",PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Unimodal Array,500.0,A,1499958300,[implementation],PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Keyboard Layouts,750.0,B,1499958300,"[implementation, strings]",PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Jury Marks,1000.0,C,1499958300,[brute force],PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Office Keys,1500.0,D,1499958300,"[binary search, brute force, dp, greedy]",PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Cards Sorting,2000.0,E,1499958300,[data structures],PROGRAMMING
+831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Bamboo Partition,2500.0,F,1499958300,[],PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,String Reconstruction,500.0,A,1499791500,"[data structures, greedy]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,High Load,750.0,B,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,DNA Evolution,1500.0,C,1499791500,[data structures],PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Best Edge Weight,1750.0,D,1499791500,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Rusty String,1750.0,E,1499791500,"[fft, math]",PROGRAMMING
+827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Dirty Arkady's Kitchen,2500.0,F,1499791500,"[dp, shortest paths]",PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Restaurant Tables,500.0,A,1499791500,[implementation],PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Black Square,750.0,B,1499791500,[implementation],PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,String Reconstruction,1250.0,C,1499791500,"[data structures, sortings]",PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,High Load,1750.0,D,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,DNA Evolution,2000.0,E,1499791500,[data structures],PROGRAMMING
+828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Best Edge Weight,2750.0,F,1499791500,[data structures],PROGRAMMING
+823,VK Cup 2017 - Finals,12,High Load,500.0,A,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,DNA Evolution,1000.0,B,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Bamboo Partition,1500.0,C,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Rusty String,2000.0,D,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Singer House,2750.0,E,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Perpetual Motion Machine,2750.0,F,1499587500,[],PROGRAMMING
+823,VK Cup 2017 - Finals,12,Dirty Arkady's Kitchen,3500.0,G,1499587500,[],PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,I'm bored with life,500.0,A,1499011500,"[implementation, math, number theory]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,Crossword solving,750.0,B,1499011500,"[brute force, implementation, strings]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,"Hacker, pack your bags!",1250.0,C,1499011500,"[binary search, greedy, sortings]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,My pretty girl Noora,1750.0,D,1499011500,"[brute force, dp, greedy, math, number theory]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,Liar,2250.0,E,1499011500,"[binary search, dp, hashing, string suffix structures]",PROGRAMMING
+822,Codeforces Round #422 (Div. 2),2,Madness,2500.0,F,1499011500,"[dfs and similar, trees]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Diplomas and Certificates,,A,1498748700,"[implementation, math]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Permutation Game,,B,1498748700,[implementation],PROGRAMMING
+818,Educational Codeforces Round 24,12,Sofa Thief,,C,1498748700,"[brute force, implementation]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Multicolored Cars,,D,1498748700,"[data structures, implementation]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Card Game Again,,E,1498748700,"[binary search, data structures, number theory, two pointers]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Level Generation,,F,1498748700,"[binary search, math, ternary search]",PROGRAMMING
+818,Educational Codeforces Round 24,12,Four Melodies,,G,1498748700,[flows],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Boring Game,500.0,A,1498574100,[],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and PR Shifts,1000.0,B,1498574100,"[data structures, implementation]",PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Beacons on Field,1500.0,C,1498574100,[number theory],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Astronomers,2000.0,D,1498574100,[number theory],PROGRAMMING
+819,Codeforces Round #421 (Div. 1),1,Mister B and Flight to the Moon,2500.0,E,1498574100,"[constructive algorithms, graphs]",PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Book Reading,500.0,A,1498574100,[implementation],PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Angle in Polygon,1000.0,B,1498574100,"[constructive algorithms, geometry]",PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Boring Game,1500.0,C,1498574100,[],PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and PR Shifts,2000.0,D,1498574100,[],PROGRAMMING
+820,Codeforces Round #421 (Div. 2),2,Mister B and Beacons on Field,2500.0,E,1498574100,[],PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and Future Gadget Laboratory,500.0,A,1498401300,[implementation],PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and Banana Trees,1000.0,B,1498401300,"[brute force, math]",PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and Boxes,1500.0,C,1498401300,"[data structures, trees]",PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and City,2000.0,D,1498401300,"[graphs, shortest paths]",PROGRAMMING
+821,Codeforces Round #420 (Div. 2),2,Okabe and El Psy Kongroo,2500.0,E,1498401300,"[dp, matrices]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Game,500.0,A,1497710100,"[brute force, greedy, implementation]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Test,1250.0,B,1497710100,"[brute force, constructive algorithms, math]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Supermarket,1500.0,C,1497710100,"[brute force, dp, trees]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Cards,2250.0,D,1497710100,"[binary search, combinatorics, data structures, geometry]",PROGRAMMING
+815,Codeforces Round #419 (Div. 1),1,Karen and Neighborhood,2250.0,E,1497710100,"[binary search, constructive algorithms]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Morning,500.0,A,1497710100,"[brute force, implementation]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Coffee,1000.0,B,1497710100,"[binary search, data structures]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Game,1500.0,C,1497710100,"[brute force, greedy]",PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Test,2000.0,D,1497710100,[combinatorics],PROGRAMMING
+816,Codeforces Round #419 (Div. 2),2,Karen and Supermarket,2750.0,E,1497710100,"[dp, trees]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Treasure Hunt,,A,1497539100,"[implementation, number theory]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Makes And The Product,,B,1497539100,"[combinatorics, sortings]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Really Big Numbers,,C,1497539100,"[binary search, brute force, dp, math]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Imbalanced Array,,D,1497539100,"[data structures, divide and conquer, dsu, sortings]",PROGRAMMING
+817,Educational Codeforces Round 23,12,Choosing The Commander,,E,1497539100,"[bitmasks, data structures, trees]",PROGRAMMING
+817,Educational Codeforces Round 23,12,MEX Queries,,F,1497539100,"[binary search, data structures, trees]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An abandoned sentiment from past,500.0,A,1496837700,"[implementation, sortings]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An express train to reveries,1000.0,B,1496837700,[constructive algorithms],PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An impassioned circulation of affection,1750.0,C,1496837700,"[brute force, dp, strings, two pointers]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An overnight dance in discotheque,1750.0,D,1496837700,"[dfs and similar, dp, geometry, greedy, trees]",PROGRAMMING
+814,Codeforces Round #418 (Div. 2),2,An unavoidable detour for home,2500.0,E,1496837700,"[combinatorics, dp]",PROGRAMMING
+813,Educational Codeforces Round 22,12,The Contest,,A,1496675100,[implementation],PROGRAMMING
+813,Educational Codeforces Round 22,12,The Golden Age,,B,1496675100,"[brute force, math]",PROGRAMMING
+813,Educational Codeforces Round 22,12,The Tag Game,,C,1496675100,[dfs and similar],PROGRAMMING
+813,Educational Codeforces Round 22,12,Two Melodies,,D,1496675100,"[dp, flows]",PROGRAMMING
+813,Educational Codeforces Round 22,12,Army Creation,,E,1496675100,"[binary search, data structures]",PROGRAMMING
+813,Educational Codeforces Round 22,12,Bipartite Checking,,F,1496675100,"[data structures, dsu, graphs]",PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Crossroads,500.0,A,1496326500,[implementation],PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,"Sagheer, the Hausmeister",1000.0,B,1496326500,"[bitmasks, brute force, dp]",PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Nubian Market,1500.0,C,1496326500,[binary search],PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Kindergarten,2000.0,D,1496326500,"[dfs and similar, graphs, implementation]",PROGRAMMING
+812,Codeforces Round #417 (Div. 2),2,Sagheer and Apple Tree,2500.0,E,1496326500,[games],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (easy),,A,1495958700,[greedy],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (medium),,B,1495958700,"[data structures, greedy]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (hard),,C,1495958700,[flows],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (easy),,D,1495958700,[math],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (medium),,E,1495958700,[math],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (hard),,F,1495958700,[math],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (easy),,G,1495958700,[implementation],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (medium),,H,1495958700,[constructive algorithms],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (hard),,I,1495958700,[string suffix structures],PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (easy),,J,1495958700,"[dfs and similar, trees]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (medium),,K,1495958700,"[dp, trees]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (hard),,L,1495958700,"[dfs and similar, dp, math, trees]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (easy),,M,1495958700,"[greedy, sortings]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (medium),,N,1495958700,"[binary search, flows]",PROGRAMMING
+802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (hard),,O,1495958700,"[binary search, flows]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Courtesy,500.0,A,1495877700,"[brute force, implementation]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Complicated Book,1000.0,B,1495877700,"[implementation, sortings]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Memorable Trip,1500.0,C,1495877700,"[dp, implementation]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Favorite Game,2000.0,D,1495877700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+811,Codeforces Round #416 (Div. 2),2,Vladik and Entertaining Flags,2500.0,E,1495877700,"[data structures, dsu, graphs]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Do you want a date?,500.0,A,1495303500,"[math, sortings]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Glad to see you!,1000.0,B,1495303500,[binary search],PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Find a car,1500.0,C,1495303500,"[combinatorics, divide and conquer, dp]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Hitchhiking in the Baltic States,2000.0,D,1495303500,"[data structures, dp]",PROGRAMMING
+809,Codeforces Round #415 (Div. 1),1,Surprise me!,2500.0,E,1495303500,"[divide and conquer, math, trees]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Straight <>,500.0,A,1495303500,"[implementation, math]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Summer sell-off,1000.0,B,1495303500,"[greedy, sortings]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Do you want a date?,1500.0,C,1495303500,"[math, sortings]",PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Glad to see you!,2000.0,D,1495303500,[binary search],PROGRAMMING
+810,Codeforces Round #415 (Div. 2),2,Find a car,2500.0,E,1495303500,"[divide and conquer, dp]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Lucky Year,,A,1494860700,[implementation],PROGRAMMING
+808,Educational Codeforces Round 21,12,Average Sleep Time,,B,1494860700,"[data structures, math]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Tea Party,,C,1494860700,"[constructive algorithms, greedy]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Array Division,,D,1494860700,"[binary search, data structures, implementation]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Selling Souvenirs,,E,1494860700,"[dp, greedy, ternary search]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Card Game,,F,1494860700,"[binary search, flows, graphs]",PROGRAMMING
+808,Educational Codeforces Round 21,12,Anthem of Berland,,G,1494860700,"[dp, strings]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Bank Robbery,500.0,A,1494668100,[implementation],PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Cutting Carrot,1000.0,B,1494668100,"[geometry, math]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Naming Company,1750.0,C,1494668100,"[games, greedy, sortings]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Labelling Cities,2000.0,D,1494668100,"[dfs and similar, graphs, hashing]",PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Choosing Carrot,2500.0,E,1494668100,[games],PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Leha and security system,2750.0,F,1494668100,[data structures],PROGRAMMING
+794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Replace All,3500.0,G,1494668100,"[combinatorics, dp, math]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Carrot Cakes,500.0,A,1494516900,"[brute force, implementation]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,T-shirt buying,1000.0,B,1494516900,"[data structures, implementation]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Fountains,1500.0,C,1494516900,"[binary search, data structures]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Field expansion,2000.0,D,1494516900,"[brute force, dp, meet-in-the-middle]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Aquarium decoration,2500.0,E,1494516900,"[data structures, greedy, two pointers]",PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Beautiful fountains rows,3250.0,F,1494516900,[data structures],PROGRAMMING
+799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Cut the pie,3500.0,G,1494516900,"[binary search, data structures, geometry]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Success Rate,500.0,A,1494171900,"[binary search, math]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Dynamic Problem Scoring,1000.0,B,1494171900,"[brute force, greedy]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Prairie Partition,1750.0,C,1494171900,"[binary search, constructive algorithms, greedy, math]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Perishable Roads,2500.0,D,1494171900,"[dp, graphs, shortest paths]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Blog Post Rating,2750.0,E,1494171900,"[data structures, sortings]",PROGRAMMING
+773,VK Cup 2017 - Round 3,12,Test Data Generation,3500.0,F,1494171900,"[combinatorics, divide and conquer, dp, fft, math, number theory]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Success Rate,500.0,A,1494171900,"[binary search, math]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Dynamic Problem Scoring,1000.0,B,1494171900,"[brute force, greedy]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Prairie Partition,1750.0,C,1494171900,"[binary search, greedy]",PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Perishable Roads,2500.0,D,1494171900,[graphs],PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Blog Post Rating,2750.0,E,1494171900,[data structures],PROGRAMMING
+806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Test Data Generation,3500.0,F,1494171900,[],PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Is it rated?,500.0,A,1494171900,"[implementation, sortings]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,T-Shirt Hunt,1000.0,B,1494171900,"[brute force, implementation]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Success Rate,1500.0,C,1494171900,"[binary search, math]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Dynamic Problem Scoring,2000.0,D,1494171900,"[brute force, greedy]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Prairie Partition,2750.0,E,1494171900,"[binary search, greedy]",PROGRAMMING
+807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Perishable Roads,3500.0,F,1494171900,[],PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Find Amir,500.0,A,1493909400,"[greedy, math]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Minimum number of steps,1000.0,B,1493909400,"[greedy, implementation, math]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Ice cream coloring,1500.0,C,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Expected diameter of a tree,2000.0,D,1493909400,"[binary search, brute force, dfs and similar, dp, sortings, trees]",PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,The same permutation ,2500.0,E,1493909400,[constructive algorithms],PROGRAMMING
+804,Codeforces Round #411 (Div. 1),1,Fake bullions,3000.0,F,1493909400,"[dfs and similar, dp, graphs]",PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Fake NP,500.0,A,1493909400,[math],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,3-palindrome,1000.0,B,1493909400,[constructive algorithms],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Find Amir,1500.0,C,1493909400,[constructive algorithms],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Minimum number of steps,2000.0,D,1493909400,[],PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Ice cream coloring,2500.0,E,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING
+805,Codeforces Round #411 (Div. 2),2,Expected diameter of a tree,3000.0,F,1493909400,"[graphs, probabilities]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Maximal Binary Matrix,,A,1493391900,[constructive algorithms],PROGRAMMING
+803,Educational Codeforces Round 20,12,Distances to Zero,,B,1493391900,[constructive algorithms],PROGRAMMING
+803,Educational Codeforces Round 20,12,Maximal GCD,,C,1493391900,"[greedy, math]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Magazine Ad,,D,1493391900,"[binary search, greedy]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Roma and Poker,,E,1493391900,[dp],PROGRAMMING
+803,Educational Codeforces Round 20,12,Coprime Subsequences,,F,1493391900,"[bitmasks, combinatorics, number theory]",PROGRAMMING
+803,Educational Codeforces Round 20,12,Periodic RMQ Problem,,G,1493391900,[data structures],PROGRAMMING
+775,VK Cup 2017 - Wild Card Round 2,12,University Schedule,,A,1493220900,[*special],PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Oleg and shares,500.0,A,1492965900,"[implementation, math]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Igor and his way to work,1000.0,B,1492965900,"[dfs and similar, shortest paths]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Mice problem,1500.0,C,1492965900,"[geometry, implementation, sortings]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Presents in Bankopolis,2000.0,D,1492965900,"[dp, graphs, shortest paths]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Problem of offices,2500.0,E,1492965900,"[constructive algorithms, dfs and similar, dp, trees]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Julia the snail,3000.0,F,1492965900,"[data structures, divide and conquer]",PROGRAMMING
+793,Tinkoff Challenge - Elimination Round,12,Oleg and chess,3500.0,G,1492965900,"[flows, graph matchings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and palindrome,500.0,A,1492785300,"[brute force, constructive algorithms, strings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and strings,1000.0,B,1492785300,"[brute force, dp, strings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and gcd problem,1500.0,C,1492785300,"[dp, greedy, number theory]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and distribution,2000.0,D,1492785300,"[constructive algorithms, sortings]",PROGRAMMING
+798,Codeforces Round #410 (Div. 2),2,Mike and code of a permutation,2500.0,E,1492785300,"[constructive algorithms, data structures, graphs, sortings]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Voltage Keepsake,500.0,A,1492356900,"[binary search, math]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Volatile Kite,1000.0,B,1492356900,[geometry],PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Vulnerable Kerbals,1750.0,C,1492356900,"[dp, graphs, number theory]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Varying Kibibits,2250.0,D,1492356900,"[bitmasks, dp]",PROGRAMMING
+772,VK Cup 2017 - Round 2,12,Verifying Kingdom,2250.0,E,1492356900,"[binary search, trees]",PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Voltage Keepsake,500.0,A,1492356900,"[binary search, greedy]",PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Volatile Kite,1000.0,B,1492356900,[geometry],PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Vulnerable Kerbals,1750.0,C,1492356900,[number theory],PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Varying Kibibits,2250.0,D,1492356900,"[combinatorics, dp]",PROGRAMMING
+800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Verifying Kingdom,2250.0,E,1492356900,[],PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vicious Keyboard,500.0,A,1492356900,[brute force],PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Valued Keys,1000.0,B,1492356900,"[constructive algorithms, greedy, strings]",PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Voltage Keepsake,1500.0,C,1492356900,"[binary search, math]",PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Volatile Kite,2000.0,D,1492356900,"[brute force, geometry, greedy]",PROGRAMMING
+801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vulnerable Kerbals,2750.0,E,1492356900,[],PROGRAMMING
+797,Educational Codeforces Round 19,12,k-Factorization,,A,1492266900,"[implementation, math, number theory]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Odd sum,,B,1492266900,"[dp, greedy]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Minimal string,,C,1492266900,"[greedy, strings]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Broken BST,,D,1492266900,"[data structures, dfs and similar]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Array Queries,,E,1492266900,"[brute force, data structures, dp]",PROGRAMMING
+797,Educational Codeforces Round 19,12,Mice and Holes,,F,1492266900,"[data structures, dp, greedy, sortings]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Buying A House,500.0,A,1491842100,"[brute force, implementation]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Find The Bone,750.0,B,1491842100,[implementation],PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Bank Hacking,1000.0,C,1491842100,"[constructive algorithms, data structures, dp, trees]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Police Stations,1500.0,D,1491842100,"[constructive algorithms, shortest paths, trees]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Exam Cheating,2000.0,E,1491842100,"[binary search, dp]",PROGRAMMING
+796,Codeforces Round #408 (Div. 2),2,Sequence Recovery,2500.0,F,1491842100,"[bitmasks, data structures, greedy]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Amusement Park,,A,1491406500,"[*special, ternary search]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Significant Cups,,B,1491406500,"[*special, binary search, data structures, two pointers]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Lie or Truth,,D,1491406500,"[*special, constructive algorithms, sortings]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Big Number and Remainder,,E,1491406500,"[*special, math, number theory]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Pens And Days Of Week,,F,1491406500,"[*special, binary search, number theory]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING
+774,VK Cup 2017 - Wild Card Round 1,12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Amusement Park,,A,1491406500,"[*special, brute force, ternary search]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Significant Cups,,B,1491406500,"[*special, binary search, sortings, two pointers]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Lie or Truth,,D,1491406500,"[*special, implementation, sortings]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Big Number and Remainder,,E,1491406500,"[*special, brute force, number theory]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Pens And Days Of Week,,F,1491406500,"[*special, brute force, number theory]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING
+795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING
+784,April Fools Contest 2017,12,Numbers Joke,,A,1490972400,[*special],PROGRAMMING
+784,April Fools Contest 2017,12,Kids' Riddle,,B,1490972400,[*special],PROGRAMMING
+784,April Fools Contest 2017,12,INTERCALC,,C,1490972400,"[*special, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,Touchy-Feely Palindromes,,D,1490972400,"[*special, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,Twisted Circuit,,E,1490972400,"[*special, brute force, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,Crunching Numbers Just for You,,F,1490972400,"[*special, implementation]",PROGRAMMING
+784,April Fools Contest 2017,12,BF Calculator,,G,1490972400,[*special],PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,Functions again,500.0,A,1490803500,"[dp, two pointers]",PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,Weird journey,1250.0,B,1490803500,"[combinatorics, dfs and similar, dsu, graphs]",PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,The Great Mixing,1500.0,C,1490803500,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
788,Codeforces Round #407 (Div. 1),1,Finding lines,2000.0,D,1490803500,"[constructive algorithms, divide and conquer]",PROGRAMMING
-788,Codeforces Round #407 (Div. 1),1,New task,2250.0,E,1490803500,[],PROGRAMMING
-789,Codeforces Round #407 (Div. 2),2,Anastasia and pebbles,500.0,A,1490803500,"[greedy, implementation, math]",PROGRAMMING
+788,Codeforces Round #407 (Div. 1),1,New task,2250.0,E,1490803500,[data structures],PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,Anastasia and pebbles,500.0,A,1490803500,"[implementation, math]",PROGRAMMING
789,Codeforces Round #407 (Div. 2),2,Masha and geometric depression,1000.0,B,1490803500,"[brute force, implementation, math]",PROGRAMMING
-789,Codeforces Round #407 (Div. 2),2,Functions again,1500.0,C,1490803500,"[data structures, dp, greedy]",PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,Functions again,1500.0,C,1490803500,"[data structures, dp]",PROGRAMMING
789,Codeforces Round #407 (Div. 2),2,Weird journey,2250.0,D,1490803500,[graphs],PROGRAMMING
-789,Codeforces Round #407 (Div. 2),2,The Great Mixing,2500.0,E,1490803500,"[brute force, dfs and similar, dp, math]",PROGRAMMING
+789,Codeforces Round #407 (Div. 2),2,The Great Mixing,2500.0,E,1490803500,"[brute force, dfs and similar, dp, graph matchings, math]",PROGRAMMING
792,Educational Codeforces Round 18,12,New Bus Route,,A,1490625300,"[implementation, sortings]",PROGRAMMING
792,Educational Codeforces Round 18,12,Counting-out Rhyme,,B,1490625300,[implementation],PROGRAMMING
792,Educational Codeforces Round 18,12,Divide by Three,,C,1490625300,"[dp, greedy, math, number theory]",PROGRAMMING
@@ -3019,7 +16478,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
787,Codeforces Round #406 (Div. 2),2,Not Afraid,1000.0,B,1490281500,"[greedy, implementation]",PROGRAMMING
787,Codeforces Round #406 (Div. 2),2,Berzerk,1750.0,C,1490281500,"[dp, games]",PROGRAMMING
787,Codeforces Round #406 (Div. 2),2,Legacy,2000.0,D,1490281500,"[data structures, shortest paths]",PROGRAMMING
-787,Codeforces Round #406 (Div. 2),2,Till I Collapse,2500.0,E,1490281500,[],PROGRAMMING
+787,Codeforces Round #406 (Div. 2),2,Till I Collapse,2500.0,E,1490281500,"[data structures, trees]",PROGRAMMING
771,VK Cup 2017 - Round 1,12,Bear and Friendship Condition,250.0,A,1489851300,"[dfs and similar, dsu, graphs]",PROGRAMMING
771,VK Cup 2017 - Round 1,12,Bear and Different Names,500.0,B,1489851300,"[constructive algorithms, greedy]",PROGRAMMING
771,VK Cup 2017 - Round 1,12,Bear and Tree Jumps,1000.0,C,1489851300,"[dfs and similar, dp, trees]",PROGRAMMING
@@ -3349,12 +16808,12 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
723,Codeforces Round #375 (Div. 2),2,Lakes in Berland,2000.0,D,1475494500,"[dfs and similar, dsu, greedy]",PROGRAMMING
723,Codeforces Round #375 (Div. 2),2,One-Way Reform,2500.0,E,1475494500,"[constructive algorithms, dfs and similar, flows, graphs, greedy]",PROGRAMMING
723,Codeforces Round #375 (Div. 2),2,st-Spanning Tree,3000.0,F,1475494500,"[dsu, graphs, greedy, implementation]",PROGRAMMING
-722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Broken Clock,500.0,A,1475330700,"[brute force, implementation]",PROGRAMMING
-722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Verse Pattern,500.0,B,1475330700,"[implementation, strings]",PROGRAMMING
-722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Destroying Array,1000.0,C,1475330700,"[data structures, dsu]",PROGRAMMING
-722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Generating Sets,1500.0,D,1475330700,"[binary search, data structures, dfs and similar, greedy]",PROGRAMMING
-722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Research Rover,2000.0,E,1475330700,"[combinatorics, dp]",PROGRAMMING
-722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Cyclic Cipher,2500.0,F,1475330700,"[chinese remainder theorem, implementation, number theory, two pointers]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Broken Clock,500.0,A,1475330700,"[brute force, implementation]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Verse Pattern,500.0,B,1475330700,"[implementation, strings]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Destroying Array,1000.0,C,1475330700,"[data structures, dsu]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Generating Sets,1500.0,D,1475330700,"[binary search, data structures, dfs and similar, greedy]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Research Rover,2000.0,E,1475330700,"[combinatorics, dp]",PROGRAMMING
+722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Cyclic Cipher,2500.0,F,1475330700,"[chinese remainder theorem, implementation, number theory, two pointers]",PROGRAMMING
721,Codeforces Round #374 (Div. 2),2,One-dimensional Japanese Crossword,500.0,A,1475244300,[implementation],PROGRAMMING
721,Codeforces Round #374 (Div. 2),2,Passwords,1000.0,B,1475244300,"[sortings, strings]",PROGRAMMING
721,Codeforces Round #374 (Div. 2),2,Journey,1500.0,C,1475244300,"[dp, graphs]",PROGRAMMING
@@ -3408,3 +16867,3707 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type
712,Codeforces Round #370 (Div. 2),2,Memory and De-Evolution,1500.0,C,1473525900,"[greedy, math]",PROGRAMMING
712,Codeforces Round #370 (Div. 2),2,Memory and Scores,2250.0,D,1473525900,"[combinatorics, dp]",PROGRAMMING
712,Codeforces Round #370 (Div. 2),2,Memory and Casinos,2500.0,E,1473525900,"[data structures, math, probabilities]",PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Bus to Udayland,500.0,A,1472472300,"[brute force, implementation]",PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Chris and Magic Square,1000.0,B,1472472300,[constructive algorithms],PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Coloring Trees,1500.0,C,1472472300,[dp],PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,Directed Roads,2000.0,D,1472472300,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING
+711,Codeforces Round #369 (Div. 2),2,ZS and The Birthday Paradox,2500.0,E,1472472300,"[math, number theory, probabilities]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Letters Cyclic Shift,500.0,A,1472056500,"[constructive algorithms, implementation]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Recover the String,1000.0,B,1472056500,"[constructive algorithms, implementation, math]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Centroids,1500.0,C,1472056500,"[data structures, dfs and similar, dp, greedy, trees]",PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Incorrect Flow,2000.0,D,1472056500,[flows],PROGRAMMING
+708,AIM Tech Round 3 (Div. 1),1,Student's Camp,2500.0,E,1472056500,"[dp, math]",PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Juicer,500.0,A,1472056500,[implementation],PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Checkpoints,1000.0,B,1472056500,"[implementation, sortings]",PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Letters Cyclic Shift,1500.0,C,1472056500,[greedy],PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Recover the String,2000.0,D,1472056500,"[greedy, math]",PROGRAMMING
+709,AIM Tech Round 3 (Div. 2),2,Centroids,2500.0,E,1472056500,"[dp, trees]",PROGRAMMING
+710,Educational Codeforces Round 16,12,King Moves,,A,1471875000,[implementation],PROGRAMMING
+710,Educational Codeforces Round 16,12,Optimal Point on a Line,,B,1471875000,"[brute force, sortings]",PROGRAMMING
+710,Educational Codeforces Round 16,12,Magic Odd Square,,C,1471875000,[constructive algorithms],PROGRAMMING
+710,Educational Codeforces Round 16,12,Two Arithmetic Progressions,,D,1471875000,[math],PROGRAMMING
+710,Educational Codeforces Round 16,12,Generate a String,,E,1471875000,"[dfs and similar, dp]",PROGRAMMING
+710,Educational Codeforces Round 16,12,String Set Queries,,F,1471875000,"[brute force, data structures, hashing, string suffix structures, strings]",PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Brain's Photos,500.0,A,1471698300,[implementation],PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Bakery,1000.0,B,1471698300,[graphs],PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Pythagorean Triples,1500.0,C,1471698300,"[math, number theory]",PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Persistent Bookcase ,2000.0,D,1471698300,"[data structures, dfs and similar, implementation]",PROGRAMMING
+707,Codeforces Round #368 (Div. 2),2,Garlands,2500.0,E,1471698300,[data structures],PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Beru-taxi,500.0,A,1470933300,"[brute force, geometry, implementation]",PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Interesting drink,1000.0,B,1470933300,"[binary search, implementation]",PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Hard problem,1500.0,C,1470933300,[dp],PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Vasiliy's Multiset,2000.0,D,1470933300,"[binary search, data structures, trees]",PROGRAMMING
+706,Codeforces Round #367 (Div. 2),2,Working routine,2500.0,E,1470933300,"[data structures, implementation]",PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Thor,500.0,A,1470578700,"[brute force, data structures, implementation]",PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Ant Man,1250.0,B,1470578700,"[dp, graphs, greedy]",PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Black Widow,1250.0,C,1470578700,"[dp, implementation]",PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Captain America,2000.0,D,1470578700,[flows],PROGRAMMING
+704,Codeforces Round #366 (Div. 1),1,Iron Man,2500.0,E,1470578700,"[geometry, trees]",PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Hulk,500.0,A,1470578700,[implementation],PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Spider Man,1000.0,B,1470578700,[games],PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Thor,1500.0,C,1470578700,"[data structures, implementation]",PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Ant Man,2250.0,D,1470578700,"[dp, graphs]",PROGRAMMING
+705,Codeforces Round #366 (Div. 2),2,Black Widow,2250.0,E,1470578700,[],PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Mishka and Game,500.0,A,1470323700,[implementation],PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Mishka and trip,1000.0,B,1470323700,"[implementation, math]",PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Chris and Road,1750.0,C,1470323700,"[geometry, implementation]",PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Mishka and Interesting sum,2000.0,D,1470323700,[data structures],PROGRAMMING
+703,Codeforces Round #365 (Div. 2),2,Mishka and Divisors,2250.0,E,1470323700,"[dp, number theory]",PROGRAMMING
+702,Educational Codeforces Round 15,12,Maximum Increase,,A,1469804400,"[dp, greedy, implementation]",PROGRAMMING
+702,Educational Codeforces Round 15,12,Powers of Two,,B,1469804400,"[brute force, data structures, implementation, math]",PROGRAMMING
+702,Educational Codeforces Round 15,12,Cellular Network,,C,1469804400,"[binary search, two pointers]",PROGRAMMING
+702,Educational Codeforces Round 15,12,Road to Post Office,,D,1469804400,[math],PROGRAMMING
+702,Educational Codeforces Round 15,12,Analysis of Pathes in Functional Graph,,E,1469804400,"[data structures, graphs]",PROGRAMMING
+702,Educational Codeforces Round 15,12,T-Shirts,,F,1469804400,[data structures],PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,As Fast As Possible,500.0,A,1469205300,"[binary search, math]",PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,Connecting Universities,1000.0,B,1469205300,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,Break Up,1500.0,C,1469205300,[dfs and similar],PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,Huffman Coding on Segment,2250.0,D,1469205300,"[data structures, greedy]",PROGRAMMING
+700,Codeforces Round #364 (Div. 1),1,Cool Slogans,3000.0,E,1469205300,"[string suffix structures, strings]",PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,Cards,500.0,A,1469205300,"[greedy, implementation]",PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,Cells Not Under Attack,750.0,B,1469205300,[math],PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,They Are Everywhere,1000.0,C,1469205300,"[binary search, two pointers]",PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,As Fast As Possible,1500.0,D,1469205300,"[binary search, math]",PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,Connecting Universities,2000.0,E,1469205300,"[dfs and similar, graphs]",PROGRAMMING
+701,Codeforces Round #364 (Div. 2),2,Break Up,2500.0,F,1469205300,[graphs],PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Vacations,500.0,A,1468933500,[dp],PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Fix a Tree,1000.0,B,1468933500,"[constructive algorithms, dfs and similar, dsu, trees]",PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,LRU,1500.0,C,1468933500,"[bitmasks, dp, probabilities]",PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Limak and Shooting Points,2000.0,D,1468933500,"[brute force, geometry]",PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Cron,2500.0,E,1468933500,[],PROGRAMMING
+698,Codeforces Round #363 (Div. 1),1,Coprime Permutation,3000.0,F,1468933500,"[combinatorics, number theory]",PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,Launch of Collider,500.0,A,1468933500,[implementation],PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,One Bomb,1000.0,B,1468933500,[implementation],PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,Vacations,1500.0,C,1468933500,"[brute force, dp]",PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,Fix a Tree,2000.0,D,1468933500,"[constructive algorithms, dfs and similar, dsu]",PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,LRU,2500.0,E,1468933500,"[bitmasks, dp, probabilities]",PROGRAMMING
+699,Codeforces Round #363 (Div. 2),2,Limak and Shooting Points,3000.0,F,1468933500,[],PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,Lorenzo Von Matterhorn,500.0,A,1468514100,"[data structures, implementation, trees]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,Puzzles,1000.0,B,1468514100,"[dfs and similar, math, probabilities, trees]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,PLEASE,1500.0,C,1468514100,"[combinatorics, dp, implementation, math, matrices]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,Legen...,2000.0,D,1468514100,"[data structures, dp, matrices, strings]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,...Wait for it...,2500.0,E,1468514100,"[data structures, dsu, trees]",PROGRAMMING
+696,Codeforces Round #362 (Div. 1),1,...Dary!,3000.0,F,1468514100,"[binary search, geometry, two pointers]",PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Pineapple Incident,500.0,A,1468514100,[math],PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Barnicle,1000.0,B,1468514100,[implementation],PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Lorenzo Von Matterhorn,1500.0,C,1468514100,"[data structures, implementation, trees]",PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Puzzles,2000.0,D,1468514100,[],PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,PLEASE,2500.0,E,1468514100,"[math, number theory]",PROGRAMMING
+697,Codeforces Round #362 (Div. 2),2,Legen...,3000.0,F,1468514100,[],PROGRAMMING
+691,Educational Codeforces Round 14,12,Fashion in Berland,,A,1468425600,[implementation],PROGRAMMING
+691,Educational Codeforces Round 14,12,s-palindrome,,B,1468425600,[implementation],PROGRAMMING
+691,Educational Codeforces Round 14,12,Exponential notation,,C,1468425600,[implementation],PROGRAMMING
+691,Educational Codeforces Round 14,12,Swaps in Permutation,,D,1468425600,"[dfs and similar, dsu]",PROGRAMMING
+691,Educational Codeforces Round 14,12,Xor-sequences,,E,1468425600,[matrices],PROGRAMMING
+691,Educational Codeforces Round 14,12,Couple Cover,,F,1468425600,"[brute force, dp, number theory]",PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (easy),,A1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (medium),,A2,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (hard),,A3,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (easy),,B1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (medium),,B2,1468137600,[geometry],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (hard),,B3,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (easy),,C1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (medium),,C2,1468137600,"[dfs and similar, graphs, trees]",PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (hard),,C3,1468137600,[trees],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (easy),,D1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (medium),,D2,1468137600,[combinatorics],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (hard),,D3,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Photographs (I),,E1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Photographs (II),,E2,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (easy),,F1,1468137600,[],PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (medium),,F2,1468137600,"[constructive algorithms, hashing, trees]",PROGRAMMING
+690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (hard),,F3,1468137600,[trees],PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Mike and Cellphone,500.0,A,1467822900,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Mike and Shortcuts,1000.0,B,1467822900,[dfs and similar],PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Mike and Chocolate Thieves,1500.0,C,1467822900,"[binary search, math]",PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Friends and Subsequences,2000.0,D,1467822900,"[binary search, data structures]",PROGRAMMING
+689,Codeforces Round #361 (Div. 2),2,Mike and Geometry Problem,2500.0,E,1467822900,"[combinatorics, data structures, implementation]",PROGRAMMING
+695,VK Cup 2016 - Finals,12,LRU,1250.0,A,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Break Up,1250.0,B,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Limak and Shooting Points,1250.0,C,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Cron,1750.0,D,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Huffman Coding on Segment,2500.0,E,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Coprime Permutation,2500.0,F,1467534000,[],PROGRAMMING
+695,VK Cup 2016 - Finals,12,Cool Slogans,3000.0,G,1467534000,[],PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,NP-Hard Problem,500.0,A,1467219900,"[dfs and similar, graphs]",PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,Remainders Game,1000.0,B,1467219900,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,The Values You Can Make,1500.0,C,1467219900,[dp],PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,Dividing Kingdom II,2000.0,D,1467219900,"[brute force, data structures, dsu, sortings]",PROGRAMMING
+687,Codeforces Round #360 (Div. 1),1,TOF,2500.0,E,1467219900,[],PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,Opponents,500.0,A,1467219900,[implementation],PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,Lovely Palindromes,1000.0,B,1467219900,"[constructive algorithms, math]",PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,NP-Hard Problem,1500.0,C,1467219900,"[dfs and similar, graphs]",PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,Remainders Game,2000.0,D,1467219900,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+688,Codeforces Round #360 (Div. 2),2,The Values You Can Make,2500.0,E,1467219900,[dp],PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Robbers' watch,500.0,A,1466699700,"[brute force, dp, math]",PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Kay and Snowflake,1250.0,B,1466699700,"[data structures, dfs and similar, trees]",PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Optimal Point,1250.0,C,1466699700,"[binary search, math]",PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Kay and Eternity,2000.0,D,1466699700,[brute force],PROGRAMMING
+685,Codeforces Round #359 (Div. 1),1,Travelling Through the Snow Queen's Kingdom,2500.0,E,1466699700,"[brute force, graphs]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Free Ice Cream,500.0,A,1466699700,"[constructive algorithms, implementation]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Little Robber Girl's Zoo,1000.0,B,1466699700,"[constructive algorithms, implementation, sortings]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Robbers' watch,1500.0,C,1466699700,"[brute force, math]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Kay and Snowflake,2250.0,D,1466699700,"[data structures, dfs and similar, trees]",PROGRAMMING
+686,Codeforces Round #359 (Div. 2),2,Optimal Point,2250.0,E,1466699700,[],PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and Numbers,500.0,A,1466181300,"[constructive algorithms, number theory]",PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and Mex,1000.0,B,1466181300,[sortings],PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and the Tree,1500.0,C,1466181300,"[dfs and similar, dp, trees]",PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and Strings,2000.0,D,1466181300,"[dp, strings]",PROGRAMMING
+682,Codeforces Round #358 (Div. 2),2,Alyona and Triangles,3000.0,E,1466181300,"[geometry, two pointers]",PROGRAMMING
+683,Surprise Language Round #8,12,The Check of the Point,,A,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,The Teacher of Physical Education,,B,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Symmetric Difference,,C,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Chocolate Bar,,D,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Hammer throwing,,E,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Reformat the String,,F,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,The Fraction,,G,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Exchange of Books,,H,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,Loader,,I,1466092800,[*special],PROGRAMMING
+683,Surprise Language Round #8,12,The Hero with Bombs,,J,1466092800,[*special],PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,A Good Contest,500.0,A,1465922100,[implementation],PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,Economy Game,1000.0,B,1465922100,[brute force],PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,Heap Operations,1500.0,C,1465922100,"[data structures, greedy]",PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,Gifts by the List,2000.0,D,1465922100,"[dfs and similar, trees]",PROGRAMMING
+681,Codeforces Round #357 (Div. 2),2,Runaway to a Shadow,2500.0,E,1465922100,[geometry],PROGRAMMING
+678,Educational Codeforces Round 13,12,Johny Likes Numbers,,A,1465834200,[implementation],PROGRAMMING
+678,Educational Codeforces Round 13,12,The Same Calendar,,B,1465834200,[implementation],PROGRAMMING
+678,Educational Codeforces Round 13,12,Joty and Chocolate,,C,1465834200,"[implementation, math, number theory]",PROGRAMMING
+678,Educational Codeforces Round 13,12,Iterated Linear Function,,D,1465834200,"[math, number theory]",PROGRAMMING
+678,Educational Codeforces Round 13,12,Another Sith Tournament,,E,1465834200,"[bitmasks, dp]",PROGRAMMING
+678,Educational Codeforces Round 13,12,Lena and Queries,,F,1465834200,"[data structures, divide and conquer, geometry]",PROGRAMMING
+684,Codeforces Marathon Round 1,12,Online Exam,,A2,1465722000,[*special],PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Prime 100,750.0,A,1465403700,[constructive algorithms],PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Tower of Cubes,1250.0,B,1465403700,"[dp, greedy]",PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Square Grid,1500.0,C,1465403700,"[dfs and similar, dsu, implementation]",PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Chase,2000.0,D,1465403700,"[brute force, dfs and similar, implementation]",PROGRAMMING
+679,Codeforces Round #356 (Div. 1),1,Bear and Bad Powers of 42,2500.0,E,1465403700,[data structures],PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Five Cards,500.0,A,1465403700,"[constructive algorithms, implementation]",PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Finding Criminals,1000.0,B,1465403700,"[constructive algorithms, implementation]",PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Prime 100,1750.0,C,1465403700,"[constructive algorithms, number theory]",PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Tower of Cubes,2250.0,D,1465403700,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+680,Codeforces Round #356 (Div. 2),2,Bear and Square Grid,2750.0,E,1465403700,[],PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Fence,500.0,A,1464798900,[implementation],PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Food Processor,1000.0,B,1464798900,"[implementation, math]",PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Label,1500.0,C,1464798900,[implementation],PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Treasure,2250.0,D,1464798900,"[data structures, graphs]",PROGRAMMING
+677,Codeforces Round #355 (Div. 2),2,Vanya and Balloons,2250.0,E,1464798900,"[binary search, brute force, dp, implementation]",PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,Nicholas and Permutation,500.0,A,1464188700,[implementation],PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,Pyramid of Glasses,1000.0,B,1464188700,[implementation],PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,Vasya and String,1500.0,C,1464188700,"[binary search, dp, two pointers]",PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,Theseus and labyrinth,2250.0,D,1464188700,"[implementation, shortest paths]",PROGRAMMING
+676,Codeforces Round #354 (Div. 2),2,The Last Fight Between Human and AI,2250.0,E,1464188700,[math],PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Infinite Sequence,500.0,A,1463416500,[math],PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Restoring Painting,1000.0,B,1463416500,"[brute force, constructive algorithms, math]",PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Money Transfers,1500.0,C,1463416500,"[data structures, greedy, sortings]",PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Tree Construction,2000.0,D,1463416500,"[data structures, trees]",PROGRAMMING
+675,Codeforces Round #353 (Div. 2),2,Trains and Statistic,2500.0,E,1463416500,"[data structures, dp, greedy]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Recycling Bottles,500.0,A,1462984500,"[dp, greedy]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Robin Hood,1000.0,B,1462984500,"[binary search, greedy]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Ultimate Weirdness of an Array,1500.0,C,1462984500,"[data structures, number theory]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Roads in Yusland,2000.0,D,1462984500,"[data structures, dp, greedy]",PROGRAMMING
+671,Codeforces Round #352 (Div. 1),1,Organizing a Race,3000.0,E,1462984500,"[data structures, greedy]",PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Summer Camp,500.0,A,1462984500,[implementation],PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Different is Good,1000.0,B,1462984500,"[constructive algorithms, implementation, strings]",PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Recycling Bottles,1500.0,C,1462984500,"[brute force, geometry, greedy]",PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Robin Hood,2000.0,D,1462984500,"[binary search, greedy]",PROGRAMMING
+672,Codeforces Round #352 (Div. 2),2,Ultimate Weirdness of an Array,2500.0,E,1462984500,[],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bear and Colors,500.0,A,1462633500,[implementation],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bear and Two Paths,1000.0,B,1462633500,[constructive algorithms],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Levels and Regions,1750.0,C,1462633500,[dp],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bearish Fanpages,2250.0,D,1462633500,[],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bear and Destroying Subtrees,2250.0,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Bears and Juice,3000.0,F,1462633500,[math],PROGRAMMING
+643,VK Cup 2016 - Round 3,12,Choosing Ads,3000.0,G,1462633500,[],PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Game,500.0,A,1462633500,[implementation],PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Problems for Round,750.0,B,1462633500,"[greedy, implementation]",PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Colors,1000.0,C,1462633500,[],PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Two Paths,1500.0,D,1462633500,[],PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Levels and Regions,2250.0,E,1462633500,"[divide and conquer, dp]",PROGRAMMING
+673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bearish Fanpages,3000.0,F,1462633500,[],PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Colors,500.0,A,1462633500,"[brute force, data structures, implementation]",PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Two Paths,1000.0,B,1462633500,"[constructive algorithms, graphs]",PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Levels and Regions,1750.0,C,1462633500,"[divide and conquer, dp]",PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bearish Fanpages,2250.0,D,1462633500,[],PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Destroying Subtrees,2250.0,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bears and Juice,3000.0,F,1462633500,[combinatorics],PROGRAMMING
+674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Choosing Ads,3000.0,G,1462633500,[],PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Holidays,500.0,A,1462464300,"[brute force, constructive algorithms]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Game of Robots,750.0,B,1462464300,[implementation],PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Cinema,1000.0,C,1462464300,"[implementation, sortings]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Magic Powder - 1,1000.0,D1,1462464300,"[binary search, brute force]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Magic Powder - 2,500.0,D2,1462464300,[binary search],PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Correct Bracket Sequence Editor,2000.0,E,1462464300,"[data structures, dsu]",PROGRAMMING
+670,Codeforces Round #350 (Div. 2),2,Restore a Number,2500.0,F,1462464300,"[constructive algorithms, strings]",PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Reberland Linguistics,500.0,A,1461947700,"[dp, implementation, strings]",PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,World Tour,1000.0,B,1461947700,"[graphs, shortest paths]",PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Codeword,2000.0,C,1461947700,[combinatorics],PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Chain Reaction,2000.0,D,1461947700,[brute force],PROGRAMMING
+666,Codeforces Round #349 (Div. 1),1,Forensic Examination,3000.0,E,1461947700,"[data structures, string suffix structures]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Pouring Rain,500.0,A,1461947700,"[geometry, math]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Coat of Anticubism,1000.0,B,1461947700,"[constructive algorithms, geometry]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Reberland Linguistics,1500.0,C,1461947700,"[dp, strings]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,World Tour,2000.0,D,1461947700,"[brute force, graphs, shortest paths]",PROGRAMMING
+667,Codeforces Round #349 (Div. 2),2,Chain Reaction,3000.0,E,1461947700,[],PROGRAMMING
+642,VK Cup 2016 - Wild Card Round 2,12,Scheduler for Invokers,,A,1461596400,[*special],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Grasshopper,500.0,A,1461515700,[implementation],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Matrix,750.0,B,1461515700,[implementation],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Dance,1000.0,C,1461515700,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Random Variable,1500.0,D,1461515700,"[dp, implementation, math, probabilities]",PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Time Machine,2000.0,E,1461515700,[data structures],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and 2-SAT,3000.0,F,1461515700,[],PROGRAMMING
+641,VK Cup 2016 - Round 2,12,Little Artem and Graph,3000.0,G,1461515700,[],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Matrix,500.0,A,1461515700,[],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Dance,1000.0,B,1461515700,[],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Random Variable,1500.0,C,1461515700,[math],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Time Machine,2000.0,D,1461515700,[data structures],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and 2-SAT,3000.0,E,1461515700,[graphs],PROGRAMMING
+668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Graph,3000.0,F,1461515700,[dp],PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Presents,500.0,A,1461515700,[math],PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Grasshopper,1000.0,B,1461515700,[],PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Matrix,1500.0,C,1461515700,"[constructive algorithms, implementation]",PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Dance,2000.0,D,1461515700,"[data structures, implementation, math]",PROGRAMMING
+669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Time Machine,2500.0,E,1461515700,[data structures],PROGRAMMING
+665,Educational Codeforces Round 12,12,Buses Between Cities,,A,1461164400,[implementation],PROGRAMMING
+665,Educational Codeforces Round 12,12,Shopping,,B,1461164400,[brute force],PROGRAMMING
+665,Educational Codeforces Round 12,12,Simple Strings,,C,1461164400,"[dp, greedy, strings]",PROGRAMMING
+665,Educational Codeforces Round 12,12,Simple Subset,,D,1461164400,"[constructive algorithms, greedy]",PROGRAMMING
+665,Educational Codeforces Round 12,12,Beautiful Subarrays,,E,1461164400,"[data structures, divide and conquer]",PROGRAMMING
+665,Educational Codeforces Round 12,12,Four Divisors,,F,1461164400,"[dp, math, number theory]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,Rebus,500.0,A,1460824500,"[constructive algorithms, expression parsing, greedy, math]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,International Olympiad,1000.0,B,1460824500,"[brute force, constructive algorithms, greedy, strings]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,Graph Coloring,1500.0,C,1460824500,[dfs and similar],PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,To Hack or not to Hack,2500.0,D,1460824500,"[brute force, dp, greedy]",PROGRAMMING
+663,Codeforces Round #347 (Div. 1),1,Binary Table,2500.0,E,1460824500,"[bitmasks, divide and conquer, dp]",PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,Complicated GCD,500.0,A,1460824500,[math],PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,Rebus,1000.0,B,1460824500,[greedy],PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,International Olympiad,1500.0,C,1460824500,[greedy],PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,Graph Coloring,2000.0,D,1460824500,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+664,Codeforces Round #347 (Div. 2),2,To Hack or not to Hack,3000.0,E,1460824500,[],PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Gambling Nim,500.0,A,1460729700,"[bitmasks, math, matrices, probabilities]",PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Graph Coloring,250.0,B,1460729700,[dfs and similar],PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Binary Table,2250.0,C,1460729700,"[bitmasks, brute force, divide and conquer, dp, fft, math]",PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,International Olympiad,250.0,D,1460729700,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
+662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,To Hack or not to Hack,2250.0,E,1460729700,"[brute force, dp, greedy]",PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Seasons,,B,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Array Sum,,C,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING
+640,VK Cup 2016 - Wild Card Round 1,12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Seasons,,B,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Array Sum,,C,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING
+661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING
+660,Educational Codeforces Round 11,12,Co-prime Array,,A,1460127600,"[greedy, implementation]",PROGRAMMING
+660,Educational Codeforces Round 11,12,Seating On Bus,,B,1460127600,[implementation],PROGRAMMING
+660,Educational Codeforces Round 11,12,Hard Process,,C,1460127600,"[binary search, dp, two pointers]",PROGRAMMING
+660,Educational Codeforces Round 11,12,Number of Parallelograms,,D,1460127600,[geometry],PROGRAMMING
+660,Educational Codeforces Round 11,12,Different Subsets For All Tuples,,E,1460127600,[combinatorics],PROGRAMMING
+660,Educational Codeforces Round 11,12,Bear and Bowling 4,,F,1460127600,"[binary search, data structures, geometry, ternary search]",PROGRAMMING
+656,April Fools Day Contest 2016,12,Da Vinci Powers,,A,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Scrambled,,B,1459526400,"[*special, implementation]",PROGRAMMING
+656,April Fools Day Contest 2016,12,Without Text,,C,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Rosetta Problem,,D,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Out of Controls,,E,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,Ace It!,,F,1459526400,[*special],PROGRAMMING
+656,April Fools Day Contest 2016,12,You're a Professional,,G,1459526400,[*special],PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Round House,500.0,A,1459353900,"[implementation, math]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Qualifying Contest,1000.0,B,1459353900,[sortings],PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Tanya and Toys,1000.0,C,1459353900,"[greedy, implementation]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Bicycle Race,1250.0,D,1459353900,"[geometry, implementation, math]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,New Reform,1500.0,E,1459353900,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Polycarp and Hay,2000.0,F,1459353900,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING
+659,Codeforces Round #346 (Div. 2),2,Fence Divercity,2500.0,G,1459353900,"[combinatorics, dp]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Displayed Friends,500.0,A,1459182900,[implementation],PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Forgotten Tree 3,750.0,B,1459182900,"[constructive algorithms, graphs, trees]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Polynomials,1000.0,C,1459182900,"[hashing, implementation, math]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Contribution,1500.0,D,1459182900,"[data structures, greedy, sortings]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Paradox,2000.0,E,1459182900,"[greedy, math, sortings]",PROGRAMMING
+639,VK Cup 2016 - Round 1,12,Bear and Chemistry,3000.0,F,1459182900,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Forgotten Tree 3,500.0,A,1459182900,[graphs],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Polynomials,1000.0,B,1459182900,[math],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Contribution,1500.0,C,1459182900,[sortings],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Paradox,2000.0,D,1459182900,[sortings],PROGRAMMING
+657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Chemistry,3000.0,E,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Reverse Radewoosh,500.0,A,1459182900,[implementation],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Displayed Friends,1000.0,B,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Forgotten Tree 3,1500.0,C,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Polynomials,2000.0,D,1459182900,[],PROGRAMMING
+658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Contribution,2500.0,E,1459182900,[],PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Любимые числа Поликарпа,500.0,A,1458975600,[constructive algorithms],PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Этажи,1000.0,B,1458975600,[constructive algorithms],PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Печать условий,1500.0,C,1458975600,"[greedy, sortings]",PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Дефрагментация памяти,2000.0,D,1458975600,"[greedy, implementation]",PROGRAMMING
+649,Технокубок 2016 - Отборочный Раунд 2,12,Автобус,2500.0,E,1458975600,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+652,Educational Codeforces Round 10,12,Gabriel and Caterpillar,,A,1458910800,[implementation],PROGRAMMING
+652,Educational Codeforces Round 10,12,z-sort,,B,1458910800,[sortings],PROGRAMMING
+652,Educational Codeforces Round 10,12,Foe Pairs,,C,1458910800,[two pointers],PROGRAMMING
+652,Educational Codeforces Round 10,12,Nested Segments,,D,1458910800,"[data structures, sortings]",PROGRAMMING
+652,Educational Codeforces Round 10,12,Pursuit For Artifacts,,E,1458910800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+652,Educational Codeforces Round 10,12,Ants on a Circle,,F,1458910800,"[constructive algorithms, math]",PROGRAMMING
+647,Технокубок 2016 - Ознакомительный Раунд 2,12,Оценки Васи,500.0,A,1458799200,[],PROGRAMMING
+647,Технокубок 2016 - Ознакомительный Раунд 2,12,Звёздное небо,1000.0,B,1458799200,[],PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Наибольший подъем,500.0,A,1458745200,[constructive algorithms],PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Собери стол,1000.0,B,1458745200,"[constructive algorithms, sortings]",PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Путь Робота,1500.0,C,1458745200,"[dfs and similar, graphs]",PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Собачки и миски,2000.0,D,1458745200,"[greedy, sortings]",PROGRAMMING
+648,Технокубок 2016 - Отборочный Раунд 1,12,Собери число,2500.0,E,1458745200,[],PROGRAMMING
+646,Технокубок 2016 - Ознакомительный Раунд 1,12,Три брата,500.0,A,1458568800,[],PROGRAMMING
+646,Технокубок 2016 - Ознакомительный Раунд 1,12,Ошибка передачи сообщения,1000.0,B,1458568800,[strings],PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Home Numbers,500.0,A,1458475200,[constructive algorithms],PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Making Genome in Berland,1000.0,B,1458475200,"[*special, dfs and similar, strings]",PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Road Improvement,1500.0,C,1458475200,"[dfs and similar, greedy, trees]",PROGRAMMING
+638,VK Cup 2016 - Qualification Round 2,12,Three-dimensional Turtle Super Computer ,2000.0,D,1458475200,"[brute force, dfs and similar, graphs]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Three Balls,500.0,A,1458376500,"[brute force, implementation, sortings]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Compressing,1000.0,B,1458376500,"[brute force, dfs and similar, dp, strings]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Up-Down,1500.0,C,1458376500,"[brute force, implementation]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Delivery Bears,2000.0,D,1458376500,"[binary search, flows]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Forgotten Tree 2,2500.0,E,1458376500,"[dfs and similar, dsu, graphs]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Paper task,3500.0,F,1458376500,"[data structures, string suffix structures]",PROGRAMMING
+653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Move by Prime,3500.0,G,1458376500,[combinatorics],PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Amity Assessment,500.0,A,1458318900,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Mischievous Mess Makers,1000.0,B,1458318900,"[greedy, math]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, dp, graphs]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, math, number theory]",PROGRAMMING
+645,CROC 2016 - Elimination Round,12,Armistice Area Apportionment,3500.0,G,1458318900,"[binary search, geometry]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Amity Assessment,500.0,A,1458318900,[],PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Mischievous Mess Makers,1000.0,B,1458318900,[],PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, graphs]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, number theory]",PROGRAMMING
+655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Armistice Area Apportionment,3500.0,G,1458318900,[geometry],PROGRAMMING
+644,CROC 2016 - Qualification,12,Parliament of Berland,500.0,A,1458118800,[constructive algorithms],PROGRAMMING
+644,CROC 2016 - Qualification,12,Processing Queries,1000.0,B,1458118800,"[data structures, two pointers]",PROGRAMMING
+644,CROC 2016 - Qualification,12,Hostname Aliases,1500.0,C,1458118800,"[binary search, data structures, sortings, strings]",PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Voting for Photos,500.0,A,1457870400,[implementation],PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Chat Order,1000.0,B,1457870400,"[binary search, data structures, sortings]",PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Promocodes with Mistakes,1500.0,C,1457870400,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+637,VK Cup 2016 - Qualification Round 1,12,Running with Obstacles,2000.0,D,1457870400,"[data structures, dp, greedy]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Watchmen,500.0,A,1457342700,"[data structures, math]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Image Preview,1000.0,B,1457342700,"[binary search, dp, two pointers]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Table Compression,1500.0,C,1457342700,"[dfs and similar, dp, dsu, graphs, greedy]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Zip-line,2000.0,D,1457342700,"[binary search, data structures, dp]",PROGRAMMING
+650,Codeforces Round #345 (Div. 1),1,Clockwork Bomb,2500.0,E,1457342700,"[data structures, dfs and similar, dsu, trees]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Joysticks,500.0,A,1457342700,"[dp, greedy]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Beautiful Paintings,1000.0,B,1457342700,"[greedy, sortings]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Watchmen,1500.0,C,1457342700,"[data structures, geometry, implementation, sortings]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Image Preview,2000.0,D,1457342700,"[binary search, dp, two pointers]",PROGRAMMING
+651,Codeforces Round #345 (Div. 2),2,Table Compression,2500.0,E,1457342700,"[dsu, graphs, greedy]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Interview,500.0,A,1457022900,"[brute force, implementation]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Print Check,1000.0,B,1457022900,"[constructive algorithms, implementation]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Report,1500.0,C,1457022900,"[data structures, sortings]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Messenger,2000.0,D,1457022900,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+631,Codeforces Round #344 (Div. 2),2,Product Sum,2500.0,E,1457022900,"[data structures, dp, geometry]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Grandma Laura and Apples,,A,1456844400,[],PROGRAMMING
+632,Educational Codeforces Round 9,12,"Alice, Bob, Two Teams",,B,1456844400,"[brute force, constructive algorithms]",PROGRAMMING
+632,Educational Codeforces Round 9,12,The Smallest String Concatenation,,C,1456844400,"[sortings, strings]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Longest Subsequence,,D,1456844400,"[brute force, math, number theory]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Thief in a Shop,,E,1456844400,"[divide and conquer, dp, fft]",PROGRAMMING
+632,Educational Codeforces Round 9,12,Magic Matrix,,F,1456844400,"[brute force, divide and conquer, graphs, trees]",PROGRAMMING
+636,VeeRoute Marathon,12,Transfer,,A,1456765200,[*special],PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,XOR Equation,500.0,A,1456683000,"[dp, math]",PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Factory Repairs,1000.0,B,1456683000,[data structures],PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Package Delivery,1500.0,C,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Preorder Test,2000.0,D,1456683000,"[binary search, dp, trees]",PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Orchestra,2500.0,E,1456683000,[two pointers],PROGRAMMING
+627,8VC Venture Cup 2016 - Final Round,12,Island Puzzle,3000.0,F,1456683000,"[dfs and similar, graphs, trees]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Island Puzzle,500.0,A,1456683000,"[constructive algorithms, implementation]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,XOR Equation,1000.0,B,1456683000,"[constructive algorithms, dp, implementation]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Factory Repairs,1500.0,C,1456683000,[data structures],PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Package Delivery,2000.0,D,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Preorder Test,2500.0,E,1456683000,[],PROGRAMMING
+634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Orchestra,3000.0,F,1456683000,[two pointers],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Orchestra,500.0,A,1456683000,"[brute force, implementation]",PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Island Puzzle,1000.0,B,1456683000,[],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,XOR Equation,1500.0,C,1456683000,[dp],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Factory Repairs,2000.0,D,1456683000,[],PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Package Delivery,2500.0,E,1456683000,"[data structures, greedy]",PROGRAMMING
+635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Preorder Test,3000.0,F,1456683000,[],PROGRAMMING
+633,"Manthan, Codefest 16",12,Ebony and Ivory,250.0,A,1456506900,"[brute force, math, number theory]",PROGRAMMING
+633,"Manthan, Codefest 16",12,A Trivial Problem,500.0,B,1456506900,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Spy Syndrome 2,1500.0,C,1456506900,"[data structures, dp, hashing, implementation, sortings, string suffix structures, strings]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Fibonacci-ish,1750.0,D,1456506900,"[brute force, hashing, implementation, math]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Startup Funding,2500.0,E,1456506900,"[binary search, data structures, probabilities, two pointers]",PROGRAMMING
+633,"Manthan, Codefest 16",12,The Chocolate Spree,2750.0,F,1456506900,"[dfs and similar, dp, trees]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Yash And Trees,3000.0,G,1456506900,"[bitmasks, data structures, dfs and similar]",PROGRAMMING
+633,"Manthan, Codefest 16",12,Fibonacci-ish II,3000.0,H,1456506900,"[data structures, implementation]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Far Relative’s Birthday Cake,500.0,A,1455986100,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Far Relative’s Problem,1000.0,B,1455986100,[brute force],PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Famil Door and Brackets,1750.0,C,1455986100,"[dp, strings]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Babaei and Birthday Cake,2000.0,D,1455986100,"[data structures, dp]",PROGRAMMING
+629,Codeforces Round #343 (Div. 2),2,Famil Door and Roads,2500.0,E,1455986100,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING
+628,Educational Codeforces Round 8,12,Tennis Tournament,,A,1455894000,[implementation],PROGRAMMING
+628,Educational Codeforces Round 8,12,New Skateboard,,B,1455894000,[dp],PROGRAMMING
+628,Educational Codeforces Round 8,12,Bear and String Distance,,C,1455894000,[greedy],PROGRAMMING
+628,Educational Codeforces Round 8,12,Magic Numbers,,D,1455894000,[dp],PROGRAMMING
+628,Educational Codeforces Round 8,12,Zbazi in Zeydabad,,E,1455894000,"[data structures, implementation]",PROGRAMMING
+628,Educational Codeforces Round 8,12,Bear and Fair Set,,F,1455894000,[flows],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Again Twenty Five!,,A,1455807600,[number theory],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Moore's Law,,B,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Lucky Numbers,,C,1455807600,"[combinatorics, math]",PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Hexagons!,,D,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,A rectangle,,E,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Selection of Personnel,,F,1455807600,"[combinatorics, math]",PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Challenge Pennants,,G,1455807600,[combinatorics],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Benches,,H,1455807600,[combinatorics],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Parking Lot,,I,1455807600,[combinatorics],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Divisibility,,J,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Indivisibility,,K,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Cracking the Code,,L,1455807600,[implementation],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Turn,,M,1455807600,"[geometry, math]",PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Forecast,,N,1455807600,[math],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Arrow,,O,1455807600,[geometry],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Area of a Star,,P,1455807600,[geometry],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Pyramids,,Q,1455807600,[geometry],PROGRAMMING
+630,Experimental Educational Round: VolBIT Formulas Blitz,12,Game,,R,1455807600,[games],PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Robot Sequence,500.0,A,1455384900,"[brute force, implementation]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Cards,750.0,B,1455384900,"[constructive algorithms, dp]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Block Towers,1000.0,C,1455384900,"[brute force, greedy]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Jerry's Protest,1500.0,D,1455384900,"[brute force, combinatorics, probabilities]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Simple Skewness,2000.0,E,1455384900,"[binary search, math, ternary search]",PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Group Projects,2500.0,F,1455384900,[dp],PROGRAMMING
+626,8VC Venture Cup 2016 - Elimination Round,12,Raffles,3000.0,G,1455384900,"[data structures, greedy]",PROGRAMMING
+622,Educational Codeforces Round 7,12,Infinite Sequence,,A,1455116400,"[implementation, math]",PROGRAMMING
+622,Educational Codeforces Round 7,12,The Time,,B,1455116400,[implementation],PROGRAMMING
+622,Educational Codeforces Round 7,12,Not Equal on a Segment,,C,1455116400,"[data structures, implementation]",PROGRAMMING
+622,Educational Codeforces Round 7,12,Optimal Number Permutation,,D,1455116400,[constructive algorithms],PROGRAMMING
+622,Educational Codeforces Round 7,12,Ants in Leaves,,E,1455116400,"[dfs and similar, greedy, trees]",PROGRAMMING
+622,Educational Codeforces Round 7,12,The Sum of the k-th Powers,,F,1455116400,[math],PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,Guest From the Past,750.0,A,1454835900,"[implementation, math]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,War of the Corporations,750.0,B,1454835900,"[constructive algorithms, strings]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,K-special Tables,1000.0,C,1454835900,"[constructive algorithms, implementation]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,Finals in arithmetic,2000.0,D,1454835900,"[constructive algorithms, implementation]",PROGRAMMING
+625,Codeforces Round #342 (Div. 2),2,Frog Fights,3000.0,E,1454835900,"[data structures, greedy]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Graph and String,500.0,A,1454605500,"[constructive algorithms, graphs]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Array GCD,1000.0,B,1454605500,"[dp, greedy, number theory]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Electric Charges,1750.0,C,1454605500,[binary search],PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Birthday,2000.0,D,1454605500,"[greedy, probabilities]",PROGRAMMING
+623,AIM Tech Round (Div. 1),1,Transforming Sequence,2250.0,E,1454605500,"[combinatorics, dp, fft]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Save Luke,500.0,A,1454605500,[math],PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Making a String,1000.0,B,1454605500,"[greedy, sortings]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Graph and String,1500.0,C,1454605500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Array GCD,2000.0,D,1454605500,"[dp, greedy, number theory]",PROGRAMMING
+624,AIM Tech Round (Div. 2),2,Electric Charges,3000.0,E,1454605500,[],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Odd and Even,500.0,A,1454249100,[implementation],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Bishops,1000.0,B,1454249100,[combinatorics],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Flowers,1500.0,C,1454249100,[probabilities],PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Rat Kwesh and Cheese,2000.0,D,1454249100,"[brute force, math]",PROGRAMMING
+621,Codeforces Round #341 (Div. 2),2,Wet Shark and Blocks,2500.0,E,1454249100,"[dp, matrices]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Slime Combining,500.0,A,1454087400,[implementation],PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Guess the Permutation,1000.0,B,1454087400,[constructive algorithms],PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Constellation,1500.0,C,1454087400,"[geometry, implementation]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Hamiltonian Spanning Tree,1750.0,D,1454087400,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Robot Arm,2500.0,E,1454087400,[data structures],PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Double Knapsack,2750.0,F,1454087400,"[constructive algorithms, two pointers]",PROGRAMMING
+618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Combining Slimes,3500.0,G,1454087400,"[dp, matrices, probabilities]",PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Elephant,500.0,A,1453563300,[math],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Chocolate,1000.0,B,1453563300,[combinatorics],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Watering Flowers,1250.0,C,1453563300,[implementation],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,Polyline,1750.0,D,1453563300,[constructive algorithms],PROGRAMMING
+617,Codeforces Round #340 (Div. 2),2,XOR and Favorite Number,2750.0,E,1453563300,[data structures],PROGRAMMING
+620,Educational Codeforces Round 6,12,Professor GukiZ's Robot,,A,1453388400,"[implementation, math]",PROGRAMMING
+620,Educational Codeforces Round 6,12,Grandfather Dovlet’s calculator,,B,1453388400,[implementation],PROGRAMMING
+620,Educational Codeforces Round 6,12,Pearls in a Row,,C,1453388400,[greedy],PROGRAMMING
+620,Educational Codeforces Round 6,12,Professor GukiZ and Two Arrays,,D,1453388400,"[binary search, two pointers]",PROGRAMMING
+620,Educational Codeforces Round 6,12,New Year Tree,,E,1453388400,"[bitmasks, data structures]",PROGRAMMING
+620,Educational Codeforces Round 6,12,Xors on Segments,,F,1453388400,[data structures],PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Peter and Snow Blower,750.0,A,1452789300,"[binary search, geometry, ternary search]",PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Skills,1250.0,B,1452789300,"[binary search, brute force, two pointers]",PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Necklace,1250.0,C,1452789300,[constructive algorithms],PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Kingdom and its Cities,2000.0,D,1452789300,"[dfs and similar, divide and conquer, graphs, sortings, trees]",PROGRAMMING
+613,Codeforces Round #339 (Div. 1),1,Puzzle Lover,2500.0,E,1452789300,"[dp, hashing, strings]",PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Link/Cut Tree,500.0,A,1452789300,[brute force],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Gena's Code,1000.0,B,1452789300,[implementation],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Peter and Snow Blower,1750.0,C,1452789300,[],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Skills,2250.0,D,1452789300,[],PROGRAMMING
+614,Codeforces Round #339 (Div. 2),2,Necklace,2250.0,E,1452789300,[],PROGRAMMING
+616,Educational Codeforces Round 5,12,Comparing Two Long Integers,,A,1452524400,"[implementation, strings]",PROGRAMMING
+616,Educational Codeforces Round 5,12,Dinner with Emma,,B,1452524400,"[games, greedy]",PROGRAMMING
+616,Educational Codeforces Round 5,12,The Labyrinth,,C,1452524400,[dfs and similar],PROGRAMMING
+616,Educational Codeforces Round 5,12,Longest k-Good Segment,,D,1452524400,"[binary search, data structures, two pointers]",PROGRAMMING
+616,Educational Codeforces Round 5,12,Sum of Remainders,,E,1452524400,"[implementation, math, number theory]",PROGRAMMING
+616,Educational Codeforces Round 5,12,Expensive Strings,,F,1452524400,"[string suffix structures, strings]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Bulbs,500.0,A,1452261900,[implementation],PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Longtail Hedgehog,1250.0,B,1452261900,"[dp, graphs]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Running Track,1750.0,C,1452261900,"[dp, greedy, strings, trees]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Multipliers,2000.0,D,1452261900,"[math, number theory]",PROGRAMMING
+615,Codeforces Round #338 (Div. 2),2,Hexagons,2500.0,E,1452261900,"[binary search, implementation, math]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Days,500.0,A,1451487900,[implementation],PROGRAMMING
+611,Good Bye 2015,12,New Year and Old Property,750.0,B,1451487900,"[brute force, implementation]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Domino,1250.0,C,1451487900,"[dp, implementation]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Ancient Prophecy,1750.0,D,1451487900,"[hashing, strings]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Three Musketeers,2500.0,E,1451487900,"[data structures, greedy]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Cleaning,2500.0,F,1451487900,"[binary search, implementation]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Cake,3000.0,G,1451487900,"[geometry, two pointers]",PROGRAMMING
+611,Good Bye 2015,12,New Year and Forgotten Tree,3500.0,H,1451487900,"[constructive algorithms, flows]",PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Pasha and Stick,500.0,A,1451215200,"[combinatorics, math]",PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Vika and Squares,1000.0,B,1451215200,[implementation],PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Harmony Analysis,1500.0,C,1451215200,[constructive algorithms],PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Vika and Segments,2500.0,D,1451215200,"[data structures, geometry, two pointers]",PROGRAMMING
+610,Codeforces Round #337 (Div. 2),2,Alphabet Permutations,2500.0,E,1451215200,"[data structures, strings]",PROGRAMMING
+612,Educational Codeforces Round 4,12,The Text Splitting,,A,1451055600,"[brute force, implementation, strings]",PROGRAMMING
+612,Educational Codeforces Round 4,12,HDD is Outdated Technology,,B,1451055600,[implementation],PROGRAMMING
+612,Educational Codeforces Round 4,12,Replace To Make Regular Bracket Sequence,,C,1451055600,"[data structures, expression parsing, math]",PROGRAMMING
+612,Educational Codeforces Round 4,12,The Union of k-Segments,,D,1451055600,[sortings],PROGRAMMING
+612,Educational Codeforces Round 4,12,Square Root of Permutation,,E,1451055600,"[combinatorics, constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+612,Educational Codeforces Round 4,12,Simba on the Circle,,F,1451055600,[dp],PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Chain Reaction,500.0,A,1450888500,"[binary search, dp]",PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Zuma,1250.0,B,1450888500,[dp],PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Marbles,1500.0,C,1450888500,"[hashing, strings]",PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Power Tree,2000.0,D,1450888500,[data structures],PROGRAMMING
+607,Codeforces Round #336 (Div. 1),1,Cross Sum,3000.0,E,1450888500,"[binary search, geometry]",PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Saitama Destroys Hotel,500.0,A,1450888500,"[implementation, math]",PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Hamming Distance Sum,1000.0,B,1450888500,[combinatorics],PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Chain Reaction,1500.0,C,1450888500,[dp],PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Zuma,2250.0,D,1450888500,[],PROGRAMMING
+608,Codeforces Round #336 (Div. 2),2,Marbles,2500.0,E,1450888500,[],PROGRAMMING
+609,Educational Codeforces Round 3,12,USB Flash Drives,,A,1450537200,"[greedy, implementation, sortings]",PROGRAMMING
+609,Educational Codeforces Round 3,12,The Best Gift,,B,1450537200,[implementation],PROGRAMMING
+609,Educational Codeforces Round 3,12,Load Balancing,,C,1450537200,[implementation],PROGRAMMING
+609,Educational Codeforces Round 3,12,Gadgets for dollars and pounds,,D,1450537200,"[binary search, two pointers]",PROGRAMMING
+609,Educational Codeforces Round 3,12,Minimum spanning tree for each edge,,E,1450537200,"[data structures, dfs and similar, dsu, graphs, trees]",PROGRAMMING
+609,Educational Codeforces Round 3,12,Frogs and mosquitoes,,F,1450537200,[data structures],PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Sorting Railway Cars,500.0,A,1449677100,"[constructive algorithms, greedy]",PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Lazy Student,1000.0,B,1449677100,"[constructive algorithms, data structures, graphs]",PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Freelancer's Dreams,1500.0,C,1449677100,[geometry],PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Board Game,2000.0,D,1449677100,"[data structures, dfs and similar]",PROGRAMMING
+605,Codeforces Round #335 (Div. 1),1,Intergalaxy Trips,2500.0,E,1449677100,"[probabilities, shortest paths]",PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Magic Spheres,500.0,A,1449677100,[implementation],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Testing Robots,1000.0,B,1449677100,[implementation],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Sorting Railway Cars,1500.0,C,1449677100,[],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Lazy Student,2000.0,D,1449677100,[graphs],PROGRAMMING
+606,Codeforces Round #335 (Div. 2),2,Freelancer's Dreams,2500.0,E,1449677100,[],PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Alternative Thinking,500.0,A,1448984100,"[dp, greedy]",PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Moodular Arithmetic,1000.0,B,1448984100,"[dfs and similar, dsu, math, number theory]",PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Lieges of Legendre,1500.0,C,1448984100,[games],PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Ruminations on Ruminants,2000.0,D,1448984100,"[geometry, math]",PROGRAMMING
+603,Codeforces Round #334 (Div. 1),1,Pastoral Oddities,3000.0,E,1448984100,"[data structures, divide and conquer, dsu, trees]",PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Uncowed Forces,500.0,A,1448984100,[implementation],PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,More Cowbell,1000.0,B,1448984100,"[binary search, greedy]",PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Alternative Thinking,1500.0,C,1448984100,"[constructive algorithms, dp, math]",PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Moodular Arithmetic,2000.0,D,1448984100,[dsu],PROGRAMMING
+604,Codeforces Round #334 (Div. 2),2,Lieges of Legendre,2500.0,E,1448984100,[],PROGRAMMING
+600,Educational Codeforces Round 2,12,Extract Numbers,,A,1448636400,[implementation],PROGRAMMING
+600,Educational Codeforces Round 2,12,Queries about less or equal elements,,B,1448636400,"[binary search, sortings, two pointers]",PROGRAMMING
+600,Educational Codeforces Round 2,12,Make Palindrome,,C,1448636400,[greedy],PROGRAMMING
+600,Educational Codeforces Round 2,12,Area of Two Circles' Intersection,,D,1448636400,[geometry],PROGRAMMING
+600,Educational Codeforces Round 2,12,Lomsat gelral,,E,1448636400,"[dfs and similar, dsu, trees]",PROGRAMMING
+600,Educational Codeforces Round 2,12,Edge coloring of bipartite graph,,F,1448636400,[graphs],PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,The Two Routes,500.0,A,1448382900,"[graphs, shortest paths]",PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,Lipshitz Sequence,1250.0,B,1448382900,[data structures],PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,Kleofáš and the n-thlon,1250.0,C,1448382900,"[dp, probabilities]",PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,Acyclic Organic Compounds,2000.0,D,1448382900,"[data structures, dfs and similar, dsu, hashing, trees]",PROGRAMMING
+601,Codeforces Round #333 (Div. 1),1,A Museum Robbery,2500.0,E,1448382900,"[data structures, dp]",PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Two Bases,500.0,A,1448382900,[implementation],PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Approximating a Constant Range,1000.0,B,1448382900,"[dp, two pointers]",PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,The Two Routes,1500.0,C,1448382900,[],PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Lipshitz Sequence,2250.0,D,1448382900,[],PROGRAMMING
+602,Codeforces Round #333 (Div. 2),2,Kleofáš and the n-thlon,2250.0,E,1448382900,[probabilities],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Patrick and Shopping,500.0,A,1448037300,[implementation],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Spongebob and Joke,1000.0,B,1448037300,[implementation],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Day at the Beach,1500.0,C,1448037300,[sortings],PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Spongebob and Squares,2000.0,D,1448037300,"[brute force, math]",PROGRAMMING
+599,Codeforces Round #332 (Div. 2),2,Sandy and Nuts,3000.0,E,1448037300,"[bitmasks, dp]",PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Swimming Pool,500.0,A,1447605300,[implementation],PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Array,1000.0,B,1447605300,[greedy],PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Points,1500.0,C,1447605300,"[greedy, sortings]",PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Trees,2250.0,D,1447605300,"[dp, probabilities, sortings]",PROGRAMMING
+596,Codeforces Round #331 (Div. 2),2,Wilbur and Strings,2500.0,E,1447605300,"[dfs and similar, dp, graphs]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Tricky Sum,,A,1447426800,[math],PROGRAMMING
+598,Educational Codeforces Round 1,12,Queries on a String,,B,1447426800,"[implementation, strings]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Nearest vectors,,C,1447426800,"[geometry, sortings]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Igor In the Museum,,D,1447426800,[dfs and similar],PROGRAMMING
+598,Educational Codeforces Round 1,12,Chocolate Bar,,E,1447426800,"[brute force, dp]",PROGRAMMING
+598,Educational Codeforces Round 1,12,Cut Length,,F,1447426800,[geometry],PROGRAMMING
+597,Testing Round #12,12,Divisibility,500.0,A,1447264800,[math],PROGRAMMING
+597,Testing Round #12,12,Restaurant,1000.0,B,1447264800,"[dp, greedy, sortings]",PROGRAMMING
+597,Testing Round #12,12,Subsequences,1500.0,C,1447264800,"[data structures, dp]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Warrior and Archer,500.0,A,1447000200,[games],PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Max and Bike,1000.0,B,1447000200,"[binary search, geometry]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Edo and Magnets,1500.0,C,1447000200,"[brute force, two pointers]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,REQ,2000.0,D,1447000200,"[data structures, number theory]",PROGRAMMING
+594,Codeforces Round #330 (Div. 1),1,Cutting the Line,3000.0,E,1447000200,"[string suffix structures, strings]",PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Vitaly and Night,500.0,A,1447000200,[implementation],PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Pasha and Phone,1000.0,B,1447000200,"[binary search, math]",PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Warrior and Archer,1500.0,C,1447000200,[games],PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Max and Bike,2000.0,D,1447000200,[],PROGRAMMING
+595,Codeforces Round #330 (Div. 2),2,Edo and Magnets,2500.0,E,1447000200,[],PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,2Char,250.0,A,1446655500,[brute force],PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Anton and Lines,1000.0,B,1446655500,"[geometry, sortings]",PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Beautiful Function,3000.0,C,1446655500,"[constructive algorithms, math]",PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Happy Tree Party,3000.0,D,1446655500,"[data structures, trees]",PROGRAMMING
+593,Codeforces Round #329 (Div. 2),2,Strange Calculation and Cats,3000.0,E,1446655500,"[dp, matrices]",PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,PawnChess,500.0,A,1446309000,[implementation],PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,The Monster and the Squirrel,1000.0,B,1446309000,[math],PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,The Big Race,1500.0,C,1446309000,[math],PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,Super M,2000.0,D,1446309000,"[dfs and similar, dp, trees]",PROGRAMMING
+592,Codeforces Round #328 (Div. 2),2,BCPC,3000.0,E,1446309000,"[binary search, geometry, two pointers]",PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Median Smoothing,750.0,A,1445763600,[],PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Chip 'n Dale Rescue Rangers,1000.0,B,1445763600,"[binary search, geometry, math]",PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Three States,1250.0,C,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Top Secret Task,1750.0,D,1445763600,[dp],PROGRAMMING
+590,Codeforces Round #327 (Div. 1),1,Birthday,2500.0,E,1445763600,"[graph matchings, strings]",PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Wizards' Duel,500.0,A,1445763600,[math],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Rebranding,1000.0,B,1445763600,[implementation],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Median Smoothing,1750.0,C,1445763600,[constructive algorithms],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Chip 'n Dale Rescue Rangers,2000.0,D,1445763600,[],PROGRAMMING
+591,Codeforces Round #327 (Div. 2),2,Three States,2250.0,E,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Email Aliases,,A,1445068800,[implementation],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Layer Cake,,B,1445068800,[sortings],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Polycarp's Masterpiece,,C,1445068800,"[data structures, divide and conquer, dp]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Boulevard,,D,1445068800,"[brute force, implementation]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Training with Doors,,E,1445068800,[],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Gourmet and Banquet,,F,1445068800,"[binary search, flows, greedy]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Hiring,,G,1445068800,"[binary search, data structures]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Tourist Guide,,H,1445068800,[dfs and similar],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lottery,,I,1445068800,[implementation],PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Cleaner Robot,,J,1445068800,"[dfs and similar, implementation]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Task processing,,K,1445068800,"[brute force, math]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Agricultural Archaeology,,L,1445068800,"[greedy, math]",PROGRAMMING
+589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Taxi in Berland,,M,1445068800,[shortest paths],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff and Weight Lifting,500.0,A,1444926600,[greedy],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff in Beach,1000.0,B,1444926600,[dp],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff in the Army,1500.0,C,1444926600,"[data structures, trees]",PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff in Mafia,2000.0,D,1444926600,"[2-sat, binary search]",PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff as a Queen,2750.0,E,1444926600,[data structures],PROGRAMMING
+587,Codeforces Round #326 (Div. 1),1,Duff is Mad,2750.0,F,1444926600,"[data structures, strings]",PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff and Meat,750.0,A,1444926600,[greedy],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in Love,1000.0,B,1444926600,[math],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff and Weight Lifting,1500.0,C,1444926600,[],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in Beach,2000.0,D,1444926600,[],PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in the Army,2500.0,E,1444926600,"[data structures, dfs and similar, trees]",PROGRAMMING
+588,Codeforces Round #326 (Div. 2),2,Duff in Mafia,3000.0,F,1444926600,[],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Gennady the Dentist,500.0,A,1444641000,"[brute force, implementation]",PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Phillip and Trains,750.0,B,1444641000,[dfs and similar],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,"Alice, Bob, Oranges and Apples",1250.0,C,1444641000,[number theory],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Lizard Era: Beginning,1750.0,D,1444641000,[meet-in-the-middle],PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Present for Vitalik the Philatelist ,2250.0,E,1444641000,"[combinatorics, math, number theory]",PROGRAMMING
+585,Codeforces Round #325 (Div. 1),1,Digits of Number Pi,3000.0,F,1444641000,"[dp, implementation, strings]",PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Alena's Schedule,500.0,A,1444641000,[implementation],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Laurenty and Shop,1000.0,B,1444641000,[implementation],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Gennady the Dentist,1500.0,C,1444641000,[implementation],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Phillip and Trains,1750.0,D,1444641000,[dp],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,"Alice, Bob, Oranges and Apples",2250.0,E,1444641000,[number theory],PROGRAMMING
+586,Codeforces Round #325 (Div. 2),2,Lizard Era: Beginning,2750.0,F,1444641000,[meet-in-the-middle],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Olesya and Rodion,500.0,A,1444149000,[math],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Kolya and Tanya ,1000.0,B,1444149000,[combinatorics],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Marina and Vasya,1500.0,C,1444149000,"[constructive algorithms, greedy]",PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Dima and Lisa,2000.0,D,1444149000,[number theory],PROGRAMMING
+584,Codeforces Round #324 (Div. 2),2,Anton and Ira,2500.0,E,1444149000,"[constructive algorithms, greedy]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,GCD Table,750.0,A,1443890700,"[constructive algorithms, greedy]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Once Again...,1250.0,B,1443890700,"[dp, matrices]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Superior Periodic Subarrays,1500.0,C,1443890700,[number theory],PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Number of Binominal Coefficients,2250.0,D,1443890700,"[dp, number theory]",PROGRAMMING
+582,Codeforces Round #323 (Div. 1),1,Boolean Function,2500.0,E,1443890700,"[bitmasks, dp, expression parsing]",PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Asphalting Roads,500.0,A,1443890700,[implementation],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Robot's Task,1000.0,B,1443890700,[implementation],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,GCD Table,1750.0,C,1443890700,[],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Once Again...,2250.0,D,1443890700,[],PROGRAMMING
+583,Codeforces Round #323 (Div. 2),2,Superior Periodic Subarrays,2500.0,E,1443890700,[number theory],PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Vasya the Hipster,500.0,A,1443430800,[implementation],PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Luxurious Houses,1000.0,B,1443430800,[implementation],PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Developing Skills,1500.0,C,1443430800,"[implementation, sortings]",PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Three Logos,2000.0,D,1443430800,"[bitmasks, brute force, constructive algorithms, implementation, math]",PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Kojiro and Furrari,3000.0,E,1443430800,"[dp, greedy]",PROGRAMMING
+581,Codeforces Round #322 (Div. 2),2,Zublicanes and Mumocrates,3000.0,F,1443430800,"[dp, trees, two pointers]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and First Steps,750.0,A,1442939400,"[brute force, dp, implementation]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Company,1250.0,B,1442939400,"[binary search, sortings, two pointers]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Park,1500.0,C,1442939400,"[dfs and similar, trees]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Dishes,2000.0,D,1442939400,"[bitmasks, dp]",PROGRAMMING
+580,Codeforces Round #321 (Div. 2),2,Kefa and Watch,2500.0,E,1442939400,"[data structures, hashing, strings]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,A Problem about Polyline,250.0,A,1442416500,"[geometry, math]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,"""Or"" Game",500.0,B,1442416500,"[brute force, greedy]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Weakness and Poorness,750.0,C,1442416500,[ternary search],PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,LCS Again,2500.0,D,1442416500,"[dp, greedy]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Walking!,2750.0,E,1442416500,"[constructive algorithms, greedy]",PROGRAMMING
+578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Mirror Box,3000.0,F,1442416500,"[matrices, trees]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Raising Bacteria,250.0,A,1442416500,[bitmasks],PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Finding Team Member,500.0,B,1442416500,"[brute force, implementation, sortings]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,A Problem about Polyline,1250.0,C,1442416500,"[binary search, math]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,"""Or"" Game",2000.0,D,1442416500,"[brute force, greedy, math]",PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Weakness and Poorness,3000.0,E,1442416500,[ternary search],PROGRAMMING
+579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,LCS Again,3000.0,F,1442416500,[],PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Vasya and Petya's Game,500.0,A,1441902600,"[math, number theory]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Invariance of Tree,1250.0,B,1441902600,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Points on Plane,1250.0,C,1441902600,"[constructive algorithms, divide and conquer, geometry, greedy, sortings]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Flights for Regular Customers,2000.0,D,1441902600,"[dp, matrices]",PROGRAMMING
+576,Codeforces Round #319 (Div. 1),1,Painting Edges,2750.0,E,1441902600,"[binary search, data structures]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Multiplication Table,500.0,A,1441902600,"[implementation, number theory]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Modulo Sum,1250.0,B,1441902600,"[combinatorics, data structures, dp, two pointers]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Vasya and Petya's Game,1500.0,C,1441902600,"[implementation, number theory]",PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Invariance of Tree,2250.0,D,1441902600,[],PROGRAMMING
+577,Codeforces Round #319 (Div. 2),2,Points on Plane,2250.0,E,1441902600,[constructive algorithms],PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Fibonotci,,A,1441526400,"[math, matrices]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Bribes,,B,1441526400,"[dfs and similar, trees]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Party,,C,1441526400,"[bitmasks, brute force, graph matchings]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Tablecity,,D,1441526400,[constructive algorithms],PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Spectator Riots,,E,1441526400,[geometry],PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Bulbo,,F,1441526400,"[dp, greedy]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Run for beer,,G,1441526400,"[dfs and similar, shortest paths]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Bots,,H,1441526400,"[combinatorics, number theory]",PROGRAMMING
+575,Bubble Cup 8 - Finals [Online Mirror],12,Robots protection,,I,1441526400,[data structures],PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Poker,500.0,A,1440865800,"[implementation, number theory]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Blocks,1000.0,B,1440865800,"[binary search, data structures, dp]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Drawing,1750.0,C,1440865800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Cavalry,2000.0,D,1440865800,"[data structures, divide and conquer, dp]",PROGRAMMING
+573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Bowling,2500.0,E,1440865800,[greedy],PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Elections,500.0,A,1440865800,[implementation],PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Three Musketeers,1000.0,B,1440865800,"[brute force, dfs and similar, graphs, hashing]",PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Poker,1500.0,C,1440865800,[number theory],PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Blocks,2000.0,D,1440865800,"[data structures, dp, shortest paths]",PROGRAMMING
+574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Drawing,2750.0,E,1440865800,[],PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Lengthening Sticks,750.0,A,1440261000,"[combinatorics, implementation, math]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Minimization,1250.0,B,1440261000,"[dp, greedy, sortings]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,CNF 2,1500.0,C,1440261000,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Campus,2000.0,D,1440261000,"[binary search, data structures, dsu, trees]",PROGRAMMING
+571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Geometric Progressions,2750.0,E,1440261000,[math],PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Arrays,500.0,A,1440261000,[sortings],PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Order Book,1000.0,B,1440261000,"[data structures, greedy, implementation, sortings]",PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Lengthening Sticks,1750.0,C,1440261000,"[brute force, combinatorics, dp, math]",PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Minimization,2250.0,D,1440261000,"[dp, sortings]",PROGRAMMING
+572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,CNF 2,2500.0,E,1440261000,[],PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Elections,500.0,A,1439483400,[implementation],PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Simple Game,1000.0,B,1439483400,"[constructive algorithms, games, greedy, implementation, math]",PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Replacement,1500.0,C,1439483400,"[constructive algorithms, data structures, implementation]",PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Tree Requests,2000.0,D,1439483400,"[binary search, constructive algorithms, dfs and similar, trees]",PROGRAMMING
+570,Codeforces Round #316 (Div. 2),2,Pig and Palindromes,2500.0,E,1439483400,"[combinatorics, dp]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Primes or Palindromes?,500.0,A,1439224200,"[brute force, implementation, math, number theory]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Symmetric and Transitive,1000.0,B,1439224200,"[combinatorics, dp, math]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,New Language,1500.0,C,1439224200,"[2-sat, greedy]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Sign Posts,2250.0,D,1439224200,"[brute force, math]",PROGRAMMING
+568,Codeforces Round #315 (Div. 1),1,Longest Increasing Subsequence,2500.0,E,1439224200,"[data structures, dp]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Music,500.0,A,1439224200,"[implementation, math]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Inventory,1000.0,B,1439224200,[greedy],PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Primes or Palindromes?,1500.0,C,1439224200,"[binary search, brute force, number theory]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,Symmetric and Transitive,2250.0,D,1439224200,"[brute force, dp, math]",PROGRAMMING
+569,Codeforces Round #315 (Div. 2),2,New Language,2750.0,E,1439224200,[],PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Lineland Mail,500.0,A,1438790400,[implementation],PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Berland National Library,1000.0,B,1438790400,[implementation],PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Geometric Progression,1500.0,C,1438790400,"[binary search, data structures, dp]",PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,One-Dimensional Battle Ships,2000.0,D,1438790400,"[binary search, data structures, sortings]",PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,President and Roads,2500.0,E,1438790400,"[dfs and similar, graphs, hashing, shortest paths]",PROGRAMMING
+567,Codeforces Round #Pi (Div. 2),2,Mausoleum,2500.0,F,1438790400,[dp],PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Matching Names,1750.0,A,1438273200,"[dfs and similar, strings, trees]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Replicating Processes,2500.0,B,1438273200,"[constructive algorithms, greedy]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Logistical Questions,3000.0,C,1438273200,"[dfs and similar, divide and conquer, trees]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Restructuring Company,1000.0,D,1438273200,"[data structures, dsu]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Restoring Map,3000.0,E,1438273200,"[bitmasks, constructive algorithms, trees]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Clique in the Divisibility Graph,500.0,F,1438273200,"[dp, math, number theory]",PROGRAMMING
+566,"VK Cup 2015 - Finals, online mirror",12,Max and Min,2500.0,G,1438273200,[geometry],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Logistical Questions,1500.0,A,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Clique in the Divisibility Graph,250.0,B,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Restoring Map,2250.0,C,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Restructuring Company,250.0,D,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Max and Min,500.0,E,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Matching Names,250.0,F,1437898500,[],PROGRAMMING
+562,VK Cup 2015 - Finals,12,Replicating Processes,500.0,G,1437898500,[],PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Gerald's Hexagon,500.0,A,1437573600,"[brute force, geometry, math]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Equivalent Strings,1000.0,B,1437573600,"[divide and conquer, hashing, sortings, strings]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Gerald and Giant Chess,1500.0,C,1437573600,"[combinatorics, dp, math, number theory]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Randomizer,2250.0,D,1437573600,"[combinatorics, geometry, probabilities]",PROGRAMMING
+559,Codeforces Round #313 (Div. 1),1,Gerald and Path,2250.0,E,1437573600,"[dp, sortings]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Currency System in Geraldion,500.0,A,1437573600,"[geometry, implementation, sortings]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Gerald is into Art,1000.0,B,1437573600,"[constructive algorithms, implementation]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Gerald's Hexagon,1500.0,C,1437573600,[geometry],PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Equivalent Strings,2000.0,D,1437573600,"[hashing, implementation, strings]",PROGRAMMING
+560,Codeforces Round #313 (Div. 2),2,Gerald and Giant Chess,2500.0,E,1437573600,"[combinatorics, dp]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Lala Land and Apple Trees,500.0,A,1436886600,"[brute force, implementation, sortings]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Amr and The Large Array,1000.0,B,1436886600,[implementation],PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Amr and Chemistry,1500.0,C,1436886600,"[brute force, greedy]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,Guess Your Way Out! II,2250.0,D,1436886600,"[data structures, implementation, sortings]",PROGRAMMING
+558,Codeforces Round #312 (Div. 2),2,A Simple Task,2500.0,E,1436886600,"[data structures, sortings, strings]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Ilya and Diplomas,500.0,A,1435676400,"[greedy, implementation]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Pasha and Tea,1000.0,B,1435676400,"[implementation, sortings]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Arthur and Table,1500.0,C,1435676400,"[brute force, data structures, dp, greedy]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Vitaly and Cycle,2000.0,D,1435676400,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING
+557,Codeforces Round #311 (Div. 2),2,Ann and Half-Palindrome,2500.0,E,1435676400,"[data structures, dp, string suffix structures, strings, trees]",PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Matryoshkas,250.0,A,1435414200,[implementation],PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Fugitive,750.0,B,1435414200,"[data structures, greedy, sortings]",PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Chocolate,1250.0,C,1435414200,[data structures],PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of a Top Secret,2000.0,D,1435414200,"[binary search, implementation, math]",PROGRAMMING
+555,Codeforces Round #310 (Div. 1),1,Case of Computer Network,3000.0,E,1435414200,"[dfs and similar, graphs, trees]",PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of the Zeros and Ones,250.0,A,1435414200,[greedy],PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Fake Numbers,250.0,B,1435414200,"[brute force, implementation]",PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Matryoshkas,1000.0,C,1435414200,[implementation],PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Fugitive,3000.0,D,1435414200,"[binary search, data structures, greedy]",PROGRAMMING
+556,Codeforces Round #310 (Div. 2),2,Case of Chocolate,3000.0,E,1435414200,"[binary search, data structures]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Kyoya and Colored Balls,250.0,A,1435163400,"[combinatorics, dp, math]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Kyoya and Permutation,500.0,B,1435163400,"[binary search, combinatorics, constructive algorithms, implementation, math]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Love Triangles,1000.0,C,1435163400,"[dfs and similar, dsu, graphs]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Nudist Beach,1500.0,D,1435163400,"[binary search, graphs, greedy]",PROGRAMMING
+553,Codeforces Round #309 (Div. 1),1,Kyoya and Train,3000.0,E,1435163400,"[dp, fft, probabilities]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Kyoya and Photobooks,250.0,A,1435163400,"[brute force, math]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Ohana Cleans Up,500.0,B,1435163400,"[brute force, strings]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Kyoya and Colored Balls,1500.0,C,1435163400,"[combinatorics, dp, math]",PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Kyoya and Permutation,3000.0,D,1435163400,[math],PROGRAMMING
+554,Codeforces Round #309 (Div. 2),2,Love Triangles,3000.0,E,1435163400,"[dfs and similar, dsu]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Table,500.0,A,1434645000,"[implementation, math]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Books,1000.0,B,1434645000,"[implementation, math]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Scales,1500.0,C,1434645000,"[brute force, dp, greedy, math, meet-in-the-middle]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Triangles,2000.0,D,1434645000,"[brute force, combinatorics, data structures, geometry, math, sortings]",PROGRAMMING
+552,Codeforces Round #308 (Div. 2),2,Vanya and Brackets,2500.0,E,1434645000,"[brute force, dp, expression parsing, greedy, implementation]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ and Contest,500.0,A,1434127500,"[implementation, sortings]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,ZgukistringZ,1250.0,B,1434127500,"[brute force, constructive algorithms, implementation, strings]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ hates Boxes,1750.0,C,1434127500,"[binary search, greedy]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ and Binary Operations,2000.0,D,1434127500,"[combinatorics, math, matrices, number theory]",PROGRAMMING
+551,Codeforces Round #307 (Div. 2),2,GukiZ and GukiZiana,2500.0,E,1434127500,"[binary search, data structures]",PROGRAMMING
+549,Looksery Cup 2015,12,Face Detection,250.0,A,1433595600,[implementation],PROGRAMMING
+549,Looksery Cup 2015,12,Looksery Party,1750.0,B,1433595600,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING
+549,Looksery Cup 2015,12,The Game Of Parity,2000.0,C,1433595600,[games],PROGRAMMING
+549,Looksery Cup 2015,12,Haar Features,1000.0,D,1433595600,"[greedy, implementation]",PROGRAMMING
+549,Looksery Cup 2015,12,Sasha Circle,3000.0,E,1433595600,[math],PROGRAMMING
+549,Looksery Cup 2015,12,Yura and Developers,3000.0,F,1433595600,"[data structures, divide and conquer]",PROGRAMMING
+549,Looksery Cup 2015,12,Happy Line,1500.0,G,1433595600,"[greedy, sortings]",PROGRAMMING
+549,Looksery Cup 2015,12,Degenerate Matrix,1500.0,H,1433595600,"[binary search, math]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Two Substrings,1000.0,A,1433435400,"[brute force, dp, implementation, strings]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Preparing Olympiad,750.0,B,1433435400,"[bitmasks, brute force]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Divisibility by Eight,1000.0,C,1433435400,"[brute force, dp, math]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Regular Bridge,2000.0,D,1433435400,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+550,Codeforces Round #306 (Div. 2),2,Brackets in Implications,3000.0,E,1433435400,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Frog,750.0,A,1432658100,"[brute force, implementation, math]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Feet,1000.0,B,1432658100,"[binary search, data structures, dp, dsu]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Foam,1750.0,C,1432658100,"[bitmasks, number theory]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Fish,1750.0,D,1432658100,"[dfs and similar, graphs]",PROGRAMMING
+547,Codeforces Round #305 (Div. 1),1,Mike and Friends,2500.0,E,1432658100,"[data structures, string suffix structures, strings]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Fax,500.0,A,1432658100,"[brute force, implementation]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Fun,1000.0,B,1432658100,"[brute force, greedy, implementation]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Frog,1750.0,C,1432658100,[number theory],PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Feet,2000.0,D,1432658100,"[binary search, data structures]",PROGRAMMING
+548,Codeforces Round #305 (Div. 2),2,Mike and Foam,2750.0,E,1432658100,[number theory],PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Bananas,500.0,A,1432312200,"[implementation, math]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Badges,1000.0,B,1432312200,"[brute force, greedy, implementation, sortings]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Cards,1250.0,C,1432312200,"[brute force, dfs and similar]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Number Game,1500.0,D,1432312200,"[constructive algorithms, dp, math, number theory]",PROGRAMMING
+546,Codeforces Round #304 (Div. 2),2,Soldier and Traveling,2250.0,E,1432312200,"[flows, math]",PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Toy Cars,500.0,A,1432053000,[implementation],PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Equidistant String,1000.0,B,1432053000,[greedy],PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Woodcutters,1750.0,C,1432053000,"[dp, greedy]",PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Queue,1750.0,D,1432053000,"[greedy, implementation, sortings]",PROGRAMMING
+545,Codeforces Round #303 (Div. 2),2,Paths and Trees,2500.0,E,1432053000,"[graphs, greedy, shortest paths]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Writing Code,500.0,A,1431016200,[dp],PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Destroying Roads,1000.0,B,1431016200,"[graphs, shortest paths]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Remembering Strings,1750.0,C,1431016200,"[bitmasks, dp]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Road Improvement,1750.0,D,1431016200,"[dp, trees]",PROGRAMMING
+543,Codeforces Round #302 (Div. 1),1,Listening to Music,2500.0,E,1431016200,"[constructive algorithms, data structures]",PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Set of Strings,500.0,A,1431016200,[implementation],PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Sea and Islands,1000.0,B,1431016200,"[constructive algorithms, implementation]",PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Writing Code,1500.0,C,1431016200,[dp],PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Destroying Roads,2000.0,D,1431016200,"[brute force, graphs, shortest paths]",PROGRAMMING
+544,Codeforces Round #302 (Div. 2),2,Remembering Strings,2750.0,E,1431016200,"[bitmasks, dp]",PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Place Your Ad Here,750.0,A,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Duck Hunt,3000.0,B,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Idempotent functions,250.0,C,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Superhero's Job,1250.0,D,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Playing on Graph,750.0,E,1430668800,[],PROGRAMMING
+541,VK Cup 2015 - Раунд 3,12,Quest,500.0,F,1430668800,[],PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Place Your Ad Here,2000.0,A,1430668800,"[data structures, sortings]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Duck Hunt,3000.0,B,1430668800,[data structures],PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Idempotent functions,750.0,C,1430668800,"[constructive algorithms, graphs, math]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Superhero's Job,2250.0,D,1430668800,"[dfs and similar, dp, hashing, math, number theory]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Playing on Graph,2250.0,E,1430668800,"[graphs, shortest paths]",PROGRAMMING
+542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Quest,1000.0,F,1430668800,"[dp, greedy]",PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Combination Lock,500.0,A,1430411400,[implementation],PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,School Marks,1000.0,B,1430411400,"[greedy, implementation]",PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Ice Cave,1500.0,C,1430411400,[dfs and similar],PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Bad Luck Island,2000.0,D,1430411400,"[dp, probabilities]",PROGRAMMING
+540,Codeforces Round #301 (Div. 2),2,Infinite Inversions,2500.0,E,1430411400,"[binary search, data structures, implementation, sortings, trees]",PROGRAMMING
+538,Codeforces Round #300,12,Cutting Banner,500.0,A,1430064000,"[brute force, implementation]",PROGRAMMING
+538,Codeforces Round #300,12,Quasi Binary,1000.0,B,1430064000,"[constructive algorithms, dp, greedy, implementation]",PROGRAMMING
+538,Codeforces Round #300,12,Tourist's Notes,1500.0,C,1430064000,"[binary search, brute force, greedy, implementation, math]",PROGRAMMING
+538,Codeforces Round #300,12,Weird Chess,1500.0,D,1430064000,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+538,Codeforces Round #300,12,Demiurges Play Again,2000.0,E,1430064000,"[dfs and similar, dp, math, trees]",PROGRAMMING
+538,Codeforces Round #300,12,A Heap of Heaps,2500.0,F,1430064000,"[brute force, data structures, math, sortings]",PROGRAMMING
+538,Codeforces Round #300,12,Berserk Robot ,3000.0,G,1430064000,"[constructive algorithms, math, sortings]",PROGRAMMING
+538,Codeforces Round #300,12,Summer Dichotomy,3000.0,H,1430064000,"[2-sat, data structures, dfs and similar, greedy]",PROGRAMMING
+537,VK Cup 2015 - Wild Card Round 2,12,Antiplagiarism,,A,1429381800,[*special],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Berland Miners,3000.0,A,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Work Group,500.0,B,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Board Game,250.0,C,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Landmarks,3000.0,D,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Correcting Mistakes,500.0,E,1429286400,[],PROGRAMMING
+532,VK Cup 2015 - Round 2,12,Encoding,1250.0,F,1429286400,[],PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Berland Miners,3000.0,A,1429286400,"[binary search, data structures, dfs and similar, greedy, trees]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Work Group,750.0,B,1429286400,"[dfs and similar, dp, graphs, strings, trees]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Board Game,250.0,C,1429286400,"[games, greedy, implementation, math]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Landmarks,3000.0,D,1429286400,[data structures],PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Correcting Mistakes,500.0,E,1429286400,"[constructive algorithms, dp, greedy, hashing, strings, two pointers]",PROGRAMMING
+533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Encoding,1500.0,F,1429286400,"[hashing, string suffix structures, strings]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Nafas,500.0,A,1429029300,[implementation],PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and SaDDas,1000.0,B,1429029300,"[bitmasks, brute force, implementation]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Karafs,1500.0,C,1429029300,"[binary search, math]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Malekas,2000.0,D,1429029300,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING
+535,Codeforces Round #299 (Div. 2),2,Tavas and Pashmaks,2500.0,E,1429029300,[geometry],PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas and Karafs,500.0,A,1429029300,"[binary search, math]",PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas and Malekas,1000.0,B,1429029300,"[hashing, string suffix structures, strings]",PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas and Pashmaks,1500.0,C,1429029300,[geometry],PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas in Kansas,2000.0,D,1429029300,"[dp, games]",PROGRAMMING
+536,Codeforces Round #299 (Div. 1),1,Tavas on the Path,2500.0,E,1429029300,"[data structures, divide and conquer, trees]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Exam,500.0,A,1428854400,"[constructive algorithms, implementation]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Covered Path,1000.0,B,1428854400,"[dp, greedy, math]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Polycarpus' Dice,1500.0,C,1428854400,[math],PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Handshakes,2000.0,D,1428854400,"[binary search, constructive algorithms, data structures, greedy]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Berland Local Positioning System,2500.0,E,1428854400,"[constructive algorithms, greedy, hashing, implementation]",PROGRAMMING
+534,Codeforces Round #298 (Div. 2),2,Simplified Nonogram,3000.0,F,1428854400,"[bitmasks, dp, hashing, meet-in-the-middle]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,King of Thieves,500.0,A,1428165300,"[brute force, implementation]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Om Nom and Dark Park,500.0,B,1428165300,"[dfs and similar, greedy, implementation]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Om Nom and Candies,1250.0,C,1428165300,"[brute force, greedy, math]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Om Nom and Necklace,1750.0,D,1428165300,"[hashing, string suffix structures, strings]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Transmitting Levels,2250.0,E,1428165300,"[dp, implementation]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Pudding Monsters,3000.0,F,1428165300,"[data structures, divide and conquer]",PROGRAMMING
+526,ZeptoLab Code Rush 2015,12,Spiders Evil Plan,3000.0,G,1428165300,"[greedy, trees]",PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,String inside out,,B,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Set subtraction,,D,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Sum and product,,E,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Points in triangle,,H,1427562000,"[*special, geometry]",PROGRAMMING
+530,VK Cup 2015 - Wild Card Round 1,12,Different variables,,I,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,String inside out,,B,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Set subtraction,,D,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Sum and product,,E,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Points in triangle,,H,1427562000,[*special],PROGRAMMING
+531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Different variables,,I,1427562000,[*special],PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Vitaliy and Pie,250.0,A,1427387400,"[greedy, hashing]",PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Pasha and String,750.0,B,1427387400,[greedy],PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Ilya and Sticks,1000.0,C,1427387400,"[greedy, sortings]",PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Arthur and Walls,3000.0,D,1427387400,"[data structures, greedy]",PROGRAMMING
+525,Codeforces Round #297 (Div. 2),2,Anya and Cubes,3000.0,E,1427387400,"[binary search, bitmasks, brute force, dp, meet-in-the-middle]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,And Yet Another Bracket Sequence,2500.0,A,1426956300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Group Photo 2 (online mirror version),500.0,B,1426956300,"[brute force, greedy, sortings]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Rooks and Rectangles,1500.0,C,1426956300,[data structures],PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Social Network,1250.0,D,1426956300,"[data structures, greedy]",PROGRAMMING
+529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,The Art of Dealing with ATM,500.0,E,1426956300,[brute force],PROGRAMMING
+524,VK Cup 2015 - Round 1,12,"Возможно, вы знаете этих людей?",500.0,A,1426946400,[implementation],PROGRAMMING
+524,VK Cup 2015 - Round 1,12,Фото на память - 2 (round version),500.0,B,1426946400,"[dp, greedy]",PROGRAMMING
+524,VK Cup 2015 - Round 1,12,The Art of Dealing with ATM,1000.0,C,1426946400,"[binary search, sortings]",PROGRAMMING
+524,VK Cup 2015 - Round 1,12,Social Network,1250.0,D,1426946400,"[greedy, two pointers]",PROGRAMMING
+524,VK Cup 2015 - Round 1,12,Rooks and Rectangles,1750.0,E,1426946400,[data structures],PROGRAMMING
+524,VK Cup 2015 - Round 1,12,And Yet Another Bracket Sequence,3000.0,F,1426946400,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Playing with Paper,500.0,A,1426610700,"[implementation, math]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Error Correct System,1000.0,B,1426610700,[greedy],PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Glass Carving,1500.0,C,1426610700,"[binary search, data structures, implementation]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Clique Problem,2000.0,D,1426610700,"[data structures, dp, greedy, implementation, sortings]",PROGRAMMING
+527,Codeforces Round #296 (Div. 2),2,Data Center Drama,2500.0,E,1426610700,"[dfs and similar, graphs]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Glass Carving,500.0,A,1426610700,"[data structures, implementation]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Clique Problem,1000.0,B,1426610700,"[dp, greedy]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Data Center Drama,1500.0,C,1426610700,"[constructive algorithms, graphs]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Fuzzy Search,2000.0,D,1426610700,"[bitmasks, brute force, fft]",PROGRAMMING
+528,Codeforces Round #296 (Div. 1),1,Triangles 3000,2500.0,E,1426610700,"[geometry, sortings]",PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,"Rotate, Flip and Zoom",500.0,A,1426345200,[implementation],PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,Mean Requests,1000.0,B,1426345200,[implementation],PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,Name Quest,1500.0,C,1426345200,[greedy],PROGRAMMING
+523,VK Cup 2015 - Qualification Round 2,12,Statistics of Recompressing Videos,2000.0,D,1426345200,"[data structures, implementation]",PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Reposts,500.0,A,1425740400,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Photo to Remember,1000.0,B,1425740400,"[data structures, dp, implementation]",PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Chicken or Fish?,1500.0,C,1425740400,[greedy],PROGRAMMING
+522,VK Cup 2015 - Qualification Round 1,12,Closest Equals,2000.0,D,1425740400,[data structures],PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Pangram,500.0,A,1425279600,"[implementation, strings]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Two Buttons,1000.0,B,1425279600,"[dfs and similar, graphs, greedy, implementation, math, shortest paths]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,DNA Alignment,1500.0,C,1425279600,"[math, strings]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Cubes,2000.0,D,1425279600,"[games, greedy, implementation]",PROGRAMMING
+520,Codeforces Round #295 (Div. 2),2,Pluses everywhere,2500.0,E,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,DNA Alignment,500.0,A,1425279600,"[greedy, math]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Cubes,1000.0,B,1425279600,"[data structures, greedy, implementation]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Pluses everywhere,1500.0,C,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Shop,2000.0,D,1425279600,[greedy],PROGRAMMING
+521,Codeforces Round #295 (Div. 1),1,Cycling City,2500.0,E,1425279600,"[dfs and similar, graphs]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Chess,500.0,A,1425128400,[implementation],PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Compilation Errors,1000.0,B,1425128400,"[data structures, implementation]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Team Training,1500.0,C,1425128400,"[greedy, implementation, math, number theory]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Interesting Substrings,2000.0,D,1425128400,"[data structures, dp, two pointers]",PROGRAMMING
+519,Codeforces Round #294 (Div. 2),2,A and B and Lecture Rooms,2500.0,E,1425128400,"[binary search, data structures, dfs and similar, dp, trees]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Vitaly and Strings,500.0,A,1424795400,[strings],PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Tanya and Postcard,1000.0,B,1424795400,"[implementation, strings]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Anya and Smartphone,1500.0,C,1424795400,"[data structures, implementation]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Ilya and Escalator,2000.0,D,1424795400,"[combinatorics, dp, probabilities]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Arthur and Questions,2500.0,E,1424795400,"[greedy, implementation, ternary search]",PROGRAMMING
+518,Codeforces Round #293 (Div. 2),2,Pasha and Pipe,2500.0,F,1424795400,"[binary search, brute force, combinatorics, dp, implementation]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Date,500.0,A,1424190900,[math],PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and His Happy Friends,1000.0,B,1424190900,"[brute force, dsu, meet-in-the-middle, number theory]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Factorial,1000.0,C,1424190900,"[greedy, math, sortings]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Tiles,3000.0,D,1424190900,"[constructive algorithms, greedy]",PROGRAMMING
+515,Codeforces Round #292 (Div. 2),2,Drazil and Park,3000.0,E,1424190900,[data structures],PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Factorial,500.0,A,1424190900,"[dp, greedy, implementation, math]",PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Tiles,1000.0,B,1424190900,"[data structures, graph matchings, greedy, implementation]",PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Park,1500.0,C,1424190900,[data structures],PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and Morning Exercise,3000.0,D,1424190900,"[dfs and similar, dp, dsu, trees, two pointers]",PROGRAMMING
+516,Codeforces Round #292 (Div. 1),1,Drazil and His Happy Friends,3000.0,E,1424190900,"[math, number theory]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Chewbaсca and Number,500.0,A,1423931400,"[greedy, implementation]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Han Solo and Lazer Gun,1000.0,B,1423931400,"[brute force, data structures, geometry, math]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Watto and Mechanism,2000.0,C,1423931400,"[binary search, hashing, string suffix structures, strings]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,R2D2 and Droid Army,2000.0,D,1423931400,"[binary search, data structures, two pointers]",PROGRAMMING
+514,Codeforces Round #291 (Div. 2),2,Darth Vader and Tree,2500.0,E,1423931400,"[dp, matrices]",PROGRAMMING
+513,Rockethon 2015,12,Game,3.0,A,1423328400,"[constructive algorithms, math]",PROGRAMMING
+513,Rockethon 2015,12,Permutations,3.0,B1,1423328400,[brute force],PROGRAMMING
+513,Rockethon 2015,12,Permutations,4.0,B2,1423328400,"[bitmasks, divide and conquer, math]",PROGRAMMING
+513,Rockethon 2015,12,Second price auction,8.0,C,1423328400,"[bitmasks, probabilities]",PROGRAMMING
+513,Rockethon 2015,12,Constrained Tree,9.0,D1,1423328400,[dfs and similar],PROGRAMMING
+513,Rockethon 2015,12,Constrained Tree,8.0,D2,1423328400,"[constructive algorithms, data structures]",PROGRAMMING
+513,Rockethon 2015,12,Subarray Cuts,9.0,E1,1423328400,[dp],PROGRAMMING
+513,Rockethon 2015,12,Subarray Cuts,12.0,E2,1423328400,[dp],PROGRAMMING
+513,Rockethon 2015,12,Scaygerboss,14.0,F1,1423328400,[flows],PROGRAMMING
+513,Rockethon 2015,12,Scaygerboss,6.0,F2,1423328400,[flows],PROGRAMMING
+513,Rockethon 2015,12,Inversions problem,3.0,G1,1423328400,"[brute force, dfs and similar, dp, meet-in-the-middle]",PROGRAMMING
+513,Rockethon 2015,12,Inversions problem,5.0,G2,1423328400,"[dp, probabilities]",PROGRAMMING
+513,Rockethon 2015,12,Inversions problem,16.0,G3,1423328400,[dp],PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Names,500.0,A,1422894600,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Jumping,1000.0,B,1422894600,"[data structures, dp, math, number theory, shortest paths]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Dinner,1500.0,C,1422894600,"[flows, graph matchings]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Travelling,2250.0,D,1422894600,"[dp, trees]",PROGRAMMING
+512,Codeforces Round #290 (Div. 1),1,Fox And Polygon,2250.0,E,1422894600,"[constructive algorithms, divide and conquer]",PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Snake,500.0,A,1422894600,[implementation],PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Two Dots,1000.0,B,1422894600,[dfs and similar],PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Names,1500.0,C,1422894600,"[dfs and similar, graphs, sortings]",PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Jumping,2000.0,D,1422894600,"[bitmasks, brute force, dp, math]",PROGRAMMING
+510,Codeforces Round #290 (Div. 2),2,Fox And Dinner,2500.0,E,1422894600,[flows],PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Maximum in Table,,A,1422705600,"[brute force, implementation]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Painting Pebbles,,B,1422705600,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Sums of Digits,,C,1422705600,"[dp, greedy, implementation]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Restoring Numbers,,D,1422705600,"[constructive algorithms, math]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Pretty Song,,E,1422705600,"[math, strings]",PROGRAMMING
+509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Progress Monitoring,,F,1422705600,[dp],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Pasha and Pixels,500.0,A,1422376200,[brute force],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Anton and currency you all know,1000.0,B,1422376200,[greedy],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Anya and Ghosts,1500.0,C,1422376200,[greedy],PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Tanya and Password,2000.0,D,1422376200,"[dfs and similar, graphs]",PROGRAMMING
+508,Codeforces Round #288 (Div. 2),2,Arthur and Brackets,2500.0,E,1422376200,"[dp, greedy]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Amr and Music,500.0,A,1422028800,"[greedy, implementation, sortings]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Amr and Pins,1000.0,B,1422028800,"[geometry, math]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Guess Your Way Out!,1500.0,C,1422028800,"[implementation, math]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,The Maths Lecture,2000.0,D,1422028800,"[dp, implementation]",PROGRAMMING
+507,Codeforces Round #287 (Div. 2),2,Breaking Good,2500.0,E,1422028800,"[dfs and similar, dp, graphs, shortest paths]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Gift,500.0,A,1421586000,"[brute force, implementation, strings]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Colorful Graph,1000.0,B,1421586000,"[dfs and similar, dp, dsu, graphs]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,"Mr. Kitayuta, the Treasure Hunter",1500.0,C,1421586000,"[dfs and similar, dp, two pointers]",PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Technology,2000.0,D,1421586000,[dfs and similar],PROGRAMMING
+505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta vs. Bamboos,2750.0,E,1421586000,"[binary search, greedy]",PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,"Mr. Kitayuta, the Treasure Hunter",500.0,A,1421586000,[dp],PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Technology,1000.0,B,1421586000,"[dfs and similar, graphs]",PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta vs. Bamboos,1750.0,C,1421586000,[binary search],PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Colorful Graph,1750.0,D,1421586000,"[brute force, dfs and similar, dsu]",PROGRAMMING
+506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Gift,2500.0,E,1421586000,"[combinatorics, dp, matrices, strings]",PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Contest,500.0,A,1421053200,[implementation],PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Changing Handles,500.0,B,1421053200,"[data structures, dsu, strings]",PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Forest,1500.0,C,1421053200,"[constructive algorithms, data structures, greedy, sortings, trees]",PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Permutations Summation,3000.0,D,1421053200,[data structures],PROGRAMMING
+501,Codeforces Round #285 (Div. 2),2,Misha and Palindrome Degree,3000.0,E,1421053200,"[binary search, combinatorics, implementation]",PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and Forest,500.0,A,1421053200,"[constructive algorithms, data structures, graphs, greedy]",PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and Permutations Summation,500.0,B,1421053200,"[binary search, data structures, math]",PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and Palindrome Degree,2500.0,C,1421053200,[math],PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and XOR,2500.0,D,1421053200,[bitmasks],PROGRAMMING
+504,Codeforces Round #285 (Div. 1),1,Misha and LCP on Tree,3000.0,E,1421053200,"[binary search, dfs and similar, hashing, string suffix structures, trees]",PROGRAMMING
+500,Good Bye 2014,12,New Year Transportation,500.0,A,1419951600,"[dfs and similar, graphs, implementation]",PROGRAMMING
+500,Good Bye 2014,12,New Year Permutation,1000.0,B,1419951600,"[dfs and similar, dsu, graphs, greedy, math, sortings]",PROGRAMMING
+500,Good Bye 2014,12,New Year Book Reading,1000.0,C,1419951600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
+500,Good Bye 2014,12,New Year Santa Network,1500.0,D,1419951600,"[combinatorics, dfs and similar, graphs, trees]",PROGRAMMING
+500,Good Bye 2014,12,New Year Domino,2750.0,E,1419951600,"[data structures, dp, dsu]",PROGRAMMING
+500,Good Bye 2014,12,New Year Shopping,2750.0,F,1419951600,"[divide and conquer, dp]",PROGRAMMING
+500,Good Bye 2014,12,New Year Running,3500.0,G,1419951600,"[number theory, trees]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Crazy Town,500.0,A,1419438600,[geometry],PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Name That Tune,2000.0,B,1419438600,"[dp, probabilities, two pointers]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Array and Operations,1000.0,C,1419438600,"[flows, graph matchings, number theory]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Traffic Jams in the Land,2000.0,D,1419438600,"[data structures, dp, number theory]",PROGRAMMING
+498,Codeforces Round #284 (Div. 1),1,Stairs and Lines,2500.0,E,1419438600,"[dp, matrices]",PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Watching a movie,500.0,A,1419438600,[implementation],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Lecture,500.0,B,1419438600,[strings],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Crazy Town,1500.0,C,1419438600,[math],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Name That Tune,3000.0,D,1419438600,[],PROGRAMMING
+499,Codeforces Round #284 (Div. 2),2,Array and Operations,3000.0,E,1419438600,[],PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Minimum Difficulty,500.0,A,1418833800,"[brute force, implementation, math]",PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Secret Combination,1000.0,B,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Removing Columns,1750.0,C,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Tennis Game,2250.0,D,1418833800,[binary search],PROGRAMMING
+496,Codeforces Round #283 (Div. 2),2,Distributing Parts ,2250.0,E,1418833800,"[greedy, sortings]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Removing Columns,750.0,A,1418833800,[greedy],PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Tennis Game,1250.0,B,1418833800,"[binary search, brute force, implementation]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Distributing Parts ,1250.0,C,1418833800,"[data structures, greedy, implementation, sortings, two pointers]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Gears,2000.0,D,1418833800,"[brute force, geometry, math]",PROGRAMMING
+497,Codeforces Round #283 (Div. 1),1,Subsequences Return,2500.0,E,1418833800,"[dp, matrices]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Treasure,500.0,A,1418488200,[greedy],PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Obsessive String,1000.0,B,1418488200,"[dp, strings]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Helping People,1750.0,C,1418488200,"[dp, probabilities]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Birthday,1750.0,D,1418488200,"[data structures, dfs and similar, dp, trees]",PROGRAMMING
+494,Codeforces Round #282 (Div. 1),1,Sharti,2500.0,E,1418488200,[games],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Digital Counter,500.0,A,1418488200,[implementation],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Modular Equations,1000.0,B,1418488200,[math],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Treasure,1500.0,C,1418488200,[implementation],PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Obsessive String,2000.0,D,1418488200,"[binary search, dp, strings]",PROGRAMMING
+495,Codeforces Round #282 (Div. 2),2,Helping People,2750.0,E,1418488200,[],PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Football,500.0,A,1417618800,[implementation],PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Wrestling,1000.0,B,1417618800,[implementation],PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Basketball,2000.0,C,1417618800,"[binary search, brute force, data structures, implementation, sortings, two pointers]",PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Chess,1500.0,D,1417618800,"[constructive algorithms, games]",PROGRAMMING
+493,Codeforces Round #281 (Div. 2),2,Vasya and Polynomial,3000.0,E,1417618800,[math],PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Cubes,500.0,A,1417451400,[implementation],PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Lanterns,1000.0,B,1417451400,"[binary search, math, sortings]",PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Exams,1500.0,C,1417451400,"[greedy, sortings]",PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Computer Game,2000.0,D,1417451400,"[binary search, implementation, math, sortings]",PROGRAMMING
+492,Codeforces Round #280 (Div. 2),2,Vanya and Field,2500.0,E,1417451400,[math],PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Team Olympiad,500.0,A,1416733800,"[greedy, implementation, sortings]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Queue,1000.0,B,1416733800,"[dsu, implementation]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Hacking Cypher,1500.0,C,1416733800,"[brute force, math, strings]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Chocolate,2000.0,D,1416733800,"[brute force, dfs and similar, math, meet-in-the-middle, number theory]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Restoring Increasing Sequence,2000.0,E,1416733800,"[binary search, brute force, greedy, implementation]",PROGRAMMING
+490,Codeforces Round #279 (Div. 2),2,Treeland Tour,2500.0,F,1416733800,"[data structures, dfs and similar, dp, trees]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Fight the Monster,500.0,A,1416590400,"[binary search, brute force]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Strip,1500.0,B,1416590400,"[binary search, data structures, dp, two pointers]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Prefix Product Sequence,1500.0,C,1416590400,"[constructive algorithms, number theory]",PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Conveyor Belts,2000.0,D,1416590400,[data structures],PROGRAMMING
+487,Codeforces Round #278 (Div. 1),1,Tourists,2500.0,E,1416590400,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Giga Tower,500.0,A,1416590400,[brute force],PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Candy Boxes,1500.0,B,1416590400,"[brute force, constructive algorithms]",PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Fight the Monster,1500.0,C,1416590400,[brute force],PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Strip,2500.0,D,1416590400,"[data structures, dp, two pointers]",PROGRAMMING
+488,Codeforces Round #278 (Div. 2),2,Prefix Product Sequence,2500.0,E,1416590400,"[constructive algorithms, math]",PROGRAMMING
+491,Testing Round #11,12,Up the hill,500.0,A,1416519000,[implementation],PROGRAMMING
+491,Testing Round #11,12,New York Hotel,1000.0,B,1416519000,"[greedy, math]",PROGRAMMING
+491,Testing Round #11,12,Deciphering,1500.0,C,1416519000,"[flows, graph matchings]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,SwapSort,500.0,A,1416238500,"[implementation, sortings]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,BerSU Ball,1000.0,B,1416238500,"[dfs and similar, dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Given Length and Sum of Digits...,1500.0,C,1416238500,"[dp, greedy, implementation]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Unbearable Controversy of Being,2000.0,D,1416238500,"[brute force, combinatorics, dfs and similar, graphs]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Hiking,2500.0,E,1416238500,"[binary search, dp]",PROGRAMMING
+489,Codeforces Round #277.5 (Div. 2),2,Special Matrices,2500.0,F,1416238500,"[combinatorics, dp]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,Calculating Function,500.0,A,1415718000,"[implementation, math]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,OR in Matrix,1000.0,B,1415718000,"[greedy, hashing, implementation]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,Palindrome Transformation,1500.0,C,1415718000,"[greedy, implementation]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,Valid Sets,2000.0,D,1415718000,"[dfs and similar, dp, math, trees]",PROGRAMMING
+486,Codeforces Round #277 (Div. 2),2,LIS of Sequence,2500.0,E,1415718000,"[data structures, dp, greedy, hashing, math]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Bits,500.0,A,1415205000,"[bitmasks, constructive algorithms]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Maximum Value,1000.0,B,1415205000,"[binary search, math, sortings, two pointers]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Strange Sorting,3000.0,C,1415205000,"[implementation, math]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Kindergarten,2000.0,D,1415205000,"[data structures, dp, greedy]",PROGRAMMING
+484,Codeforces Round #276 (Div. 1),1,Sign on Fence,3000.0,E,1415205000,"[binary search, constructive algorithms, data structures]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Factory,1000.0,A,1415205000,"[implementation, math, matrices]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Valuable Resources,500.0,B,1415205000,"[brute force, greedy]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Bits,1500.0,C,1415205000,"[implementation, math]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Maximum Value,3000.0,D,1415205000,"[binary search, sortings]",PROGRAMMING
+485,Codeforces Round #276 (Div. 2),2,Strange Sorting,3000.0,E,1415205000,[],PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Diverse Permutation,500.0,A,1414170000,"[constructive algorithms, greedy]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Interesting Array,1500.0,B,1414170000,"[constructive algorithms, data structures, trees]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Game with Strings,1500.0,C,1414170000,"[bitmasks, dp, probabilities]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,Random Function and Tree,2000.0,D,1414170000,"[combinatorics, dp, trees]",PROGRAMMING
+482,Codeforces Round #275 (Div. 1),1,ELCA,2500.0,E,1414170000,"[data structures, trees]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Counterexample ,500.0,A,1414170000,"[brute force, implementation]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Friends and Presents,1000.0,B,1414170000,"[binary search, math]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Diverse Permutation,1500.0,C,1414170000,"[constructive algorithms, implementation]",PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Interesting Array,2500.0,D,1414170000,[data structures],PROGRAMMING
+483,Codeforces Round #275 (Div. 2),2,Game with Strings,2500.0,E,1414170000,[],PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Expression,500.0,A,1413709200,"[brute force, math]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Towers,1000.0,B,1413709200,"[brute force, greedy, implementation, sortings]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Exams,1500.0,C,1413709200,"[greedy, sortings]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Long Jumps,2000.0,D,1413709200,"[binary search, greedy, implementation]",PROGRAMMING
+479,Codeforces Round #274 (Div. 2),2,Riding in a Lift,2500.0,E,1413709200,[dp],PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Exams,500.0,A,1413709200,"[greedy, sortings]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Long Jumps,1000.0,B,1413709200,"[binary search, greedy, hashing, implementation, sortings]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Riding in a Lift,1500.0,C,1413709200,"[dp, implementation]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Parcels,2000.0,D,1413709200,"[dp, graphs]",PROGRAMMING
+480,Codeforces Round #274 (Div. 1),1,Parking Lot,2500.0,E,1413709200,"[data structures, divide and conquer]",PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Initial Bet,500.0,A,1413474000,[implementation],PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Random Teams,1000.0,B,1413474000,"[combinatorics, constructive algorithms, greedy, math]",PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Table Decorations,1500.0,C,1413474000,[greedy],PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Red-Green Towers,2000.0,D,1413474000,[dp],PROGRAMMING
+478,Codeforces Round #273 (Div. 2),2,Wavy numbers,2500.0,E,1413474000,"[brute force, dfs and similar, meet-in-the-middle, sortings]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Stairs,500.0,A,1413122400,"[implementation, math]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and WiFi,1500.0,B,1413122400,"[bitmasks, brute force, combinatorics, dp, math, probabilities]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sums,1500.0,C,1413122400,[math],PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sets,2000.0,D,1413122400,"[constructive algorithms, greedy, math]",PROGRAMMING
+476,Codeforces Round #272 (Div. 2),2,Dreamoon and Strings,2500.0,E,1413122400,"[dp, strings]",PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sums,500.0,A,1413122400,[math],PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sets,1000.0,B,1413122400,[math],PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Strings,1500.0,C,1413122400,[dp],PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Binary,2000.0,D,1413122400,"[dp, strings]",PROGRAMMING
+477,Codeforces Round #272 (Div. 1),1,Dreamoon and Notepad,3000.0,E,1413122400,[data structures],PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Keyboard,500.0,A,1412609400,[implementation],PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Worms,1000.0,B,1412609400,"[binary search, implementation]",PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Captain Marmot,1500.0,C,1412609400,"[brute force, geometry]",PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Flowers,2000.0,D,1412609400,[dp],PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Pillars,3000.0,E,1412609400,"[binary search, data structures, dp, sortings, trees]",PROGRAMMING
+474,Codeforces Round #271 (Div. 2),2,Ant colony,3000.0,F,1412609400,"[data structures, number theory]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Bayan Bus,500.0,A,1412514000,[implementation],PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Strongly Connected City,1000.0,B,1412514000,"[brute force, dfs and similar, graphs, implementation]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Kamal-ol-molk's Painting,1500.0,C,1412514000,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,CGCDSSQ,2000.0,D,1412514000,"[brute force, data structures, math]",PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Strongly Connected City 2,2500.0,E,1412514000,[dfs and similar],PROGRAMMING
+475,Bayan 2015 Contest Warm Up,12,Meta-universe,2500.0,F,1412514000,[data structures],PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Learn from Math,500.0,A,1411918500,"[math, number theory]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Learn from Life,1000.0,B,1411918500,[],PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Make It Nondeterministic,1500.0,C,1411918500,[greedy],PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Inverse the Problem,2000.0,D,1411918500,"[dfs and similar, dsu, shortest paths, trees]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Learn from a Game,3000.0,E,1411918500,"[constructive algorithms, implementation]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Change the Goal,3000.0,F,1411918500,"[constructive algorithms, math, matrices]",PROGRAMMING
+472,Codeforces Round #270,12,Design Tutorial: Increase the Constraints,3500.0,G,1411918500,"[bitmasks, data structures, fft]",PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Sticks,500.0,A,1411745400,[implementation],PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Important Things,1000.0,B,1411745400,[sortings],PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and House of Cards,2000.0,C,1411745400,"[binary search, brute force, greedy, math]",PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Cube Walls,2000.0,D,1411745400,"[string suffix structures, strings]",PROGRAMMING
+471,Codeforces Round #269 (Div. 2),2,MUH and Lots and Lots of Segments,2500.0,E,1411745400,"[data structures, dsu]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,24 Game,500.0,A,1411218000,"[constructive algorithms, greedy, math]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Two Sets,1000.0,B,1411218000,"[2-sat, dfs and similar, dsu, graph matchings, greedy]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Hack it!,1500.0,C,1411218000,"[binary search, constructive algorithms, math]",PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Tree,2000.0,D,1411218000,[graph matchings],PROGRAMMING
+468,Codeforces Round #268 (Div. 1),1,Permanent,2500.0,E,1411218000,"[dp, graph matchings, math, meet-in-the-middle]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,I Wanna Be the Guy,500.0,A,1411218000,"[greedy, implementation]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,Chat Online,1000.0,B,1411218000,[implementation],PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,24 Game,1500.0,C,1411218000,"[constructive algorithms, implementation]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,Two Sets,2000.0,D,1411218000,"[2-sat, data structures, graph matchings, greedy]",PROGRAMMING
+469,Codeforces Round #268 (Div. 2),2,Hack it!,2500.0,E,1411218000,[constructive algorithms],PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,George and Accommodation,500.0,A,1411054200,[implementation],PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,Fedor and New Game,1000.0,B,1411054200,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,George and Job,1500.0,C,1411054200,"[dp, implementation]",PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,Fedor and Essay,2000.0,D,1411054200,"[dfs and similar, dp, graphs, hashing, strings]",PROGRAMMING
+467,Codeforces Round #267 (Div. 2),2,Alex and Complicated Task,2500.0,E,1411054200,"[data structures, dp, greedy]",PROGRAMMING
+470,Surprise Language Round #7,12,Crystal Ball Sequence,,A,1410622200,"[*special, implementation]",PROGRAMMING
+470,Surprise Language Round #7,12,Hexakosioihexekontahexaphobia,,B,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Eval,,C,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Caesar Cipher,,D,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Chessboard,,E,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Pairwise Sums,,F,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Hamming Distance,,G,1410622200,[*special],PROGRAMMING
+470,Surprise Language Round #7,12,Array Sorting,,H,1410622200,[*special],PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Cheap Travel,500.0,A,1410535800,[implementation],PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Wonder Room,1000.0,B,1410535800,"[brute force, math]",PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Number of Ways,1500.0,C,1410535800,"[binary search, brute force, data structures, dp, two pointers]",PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Increase Sequence,2000.0,D,1410535800,"[combinatorics, dp]",PROGRAMMING
+466,Codeforces Round #266 (Div. 2),2,Information Graph,2500.0,E,1410535800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,No to Palindromes!,500.0,A,1410103800,"[greedy, strings]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,Restore Cube ,1500.0,B,1410103800,"[brute force, geometry]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,Substitutes in Number,1500.0,C,1410103800,[dp],PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,World of Darkraft - 2,2000.0,D,1410103800,"[dp, probabilities]",PROGRAMMING
+464,Codeforces Round #265 (Div. 1),1,The Classic Problem,2500.0,E,1410103800,"[data structures, graphs, shortest paths]",PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,inc ARG,500.0,A,1410103800,[implementation],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,Inbox (100500),1000.0,B,1410103800,[implementation],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,No to Palindromes!,1500.0,C,1410103800,[brute force],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,Restore Cube ,2500.0,D,1410103800,[brute force],PROGRAMMING
+465,Codeforces Round #265 (Div. 2),2,Substitutes in Number,2500.0,E,1410103800,"[constructive algorithms, dp]",PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Caisa and Sugar,500.0,A,1409383800,[implementation],PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Caisa and Pylons,1000.0,B,1409383800,[math],PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Gargari and Bishops,1500.0,C,1409383800,"[greedy, hashing, implementation]",PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Gargari and Permutations,2000.0,D,1409383800,"[dfs and similar, dp, graphs]",PROGRAMMING
+463,Codeforces Round #264 (Div. 2),2,Caisa and Tree,2500.0,E,1409383800,"[brute force, dfs and similar, trees]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and Toastman,500.0,A,1409061600,"[greedy, sortings]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and Tree,1000.0,B,1409061600,"[dfs and similar, dp, trees]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and a Sheet of Paper,1500.0,C,1409061600,"[data structures, implementation]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and Complicated Task,2000.0,D,1409061600,"[dsu, math]",PROGRAMMING
+461,Codeforces Round #263 (Div. 1),1,Appleman and a Game,2500.0,E,1409061600,[shortest paths],PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Easy Task,500.0,A,1409061600,"[brute force, implementation]",PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Card Game,1000.0,B,1409061600,[greedy],PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Toastman,1500.0,C,1409061600,"[implementation, sortings]",PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and Tree,2000.0,D,1409061600,"[dp, graphs]",PROGRAMMING
+462,Codeforces Round #263 (Div. 2),2,Appleman and a Sheet of Paper,2500.0,E,1409061600,[],PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Vasya and Socks,500.0,A,1408548600,"[brute force, implementation, math]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Little Dima and Equation,1000.0,B,1408548600,"[brute force, implementation, math]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Present,1500.0,C,1408548600,"[binary search, data structures, greedy]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Little Victor and Set,2000.0,D,1408548600,"[brute force, constructive algorithms]",PROGRAMMING
+460,Codeforces Round #262 (Div. 2),2,Roland and Rose,2500.0,E,1408548600,"[brute force, geometry, math, sortings]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Garden,500.0,A,1408116600,[implementation],PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Flowers,500.0,B,1408116600,"[combinatorics, implementation, sortings]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Buses,2000.0,C,1408116600,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Parmida's problem,2000.0,D,1408116600,"[data structures, divide and conquer, sortings]",PROGRAMMING
+459,Codeforces Round #261 (Div. 2),2,Pashmak and Graph,3000.0,E,1408116600,"[dp, sortings]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Golden System,1000.0,A,1407690000,"[math, meet-in-the-middle]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Distributed Join,1000.0,B,1407690000,[greedy],PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Elections,1500.0,C,1407690000,[brute force],PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Bingo!,2000.0,D,1407690000,"[combinatorics, math, probabilities]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,Flow Optimality,2500.0,E,1407690000,"[constructive algorithms, flows, math]",PROGRAMMING
+457,MemSQL Start[c]UP 2.0 - Round 2,12,An easy problem about trees,3000.0,F,1407690000,"[dp, games, greedy, trees]",PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Golden System,1000.0,A,1407690000,[math],PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Distributed Join,1000.0,B,1407690000,[greedy],PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Elections,1500.0,C,1407690000,"[data structures, ternary search]",PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Bingo!,2000.0,D,1407690000,"[combinatorics, probabilities]",PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Flow Optimality,2500.0,E,1407690000,[],PROGRAMMING
+458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,An easy problem about trees,3000.0,F,1407690000,[],PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Boredom,500.0,A,1407511800,[dp],PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,A Lot of Games,1000.0,B,1407511800,"[dfs and similar, dp, games, implementation, strings, trees]",PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Civilization,1500.0,C,1407511800,"[dfs and similar, dp, dsu, ternary search, trees]",PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Serega and Fun,2000.0,D,1407511800,[data structures],PROGRAMMING
+455,Codeforces Round #260 (Div. 1),1,Function,2500.0,E,1407511800,[data structures],PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Laptops,500.0,A,1407511800,[sortings],PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Fedya and Maths,1000.0,B,1407511800,"[math, number theory]",PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Boredom,1500.0,C,1407511800,[dp],PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,A Lot of Games,2000.0,D,1407511800,"[dp, games, strings]",PROGRAMMING
+456,Codeforces Round #260 (Div. 2),2,Civilization,2500.0,E,1407511800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Expected Maximum,500.0,A,1406907000,[probabilities],PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Harmony Chest,1000.0,B,1406907000,"[bitmasks, brute force, dp]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Summer Sun Celebration,1500.0,C,1406907000,"[constructive algorithms, dfs and similar]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Elements of Harmony,2500.0,D,1406907000,"[dp, matrices]",PROGRAMMING
+453,Codeforces Round #259 (Div. 1),1,Little Pony and Lord Tirek,2500.0,E,1406907000,[data structures],PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Crystal Mine,500.0,A,1406907000,[implementation],PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Sort by Shift,1000.0,B,1406907000,[implementation],PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Expected Maximum,1500.0,C,1406907000,"[combinatorics, math, probabilities]",PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Harmony Chest,2000.0,D,1406907000,"[bitmasks, dp]",PROGRAMMING
+454,Codeforces Round #259 (Div. 2),2,Little Pony and Summer Sun Celebration,2500.0,E,1406907000,[dfs and similar],PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Eevee,500.0,A,1406480400,"[brute force, implementation, strings]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,4-point polyline,1000.0,B,1406480400,"[brute force, constructive algorithms, geometry, trees]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Magic Trick,1000.0,C,1406480400,"[combinatorics, math, probabilities]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,"Washer, Dryer, Folder",1500.0,D,1406480400,"[greedy, implementation]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Three strings,2500.0,E,1406480400,"[data structures, dsu, string suffix structures, strings]",PROGRAMMING
+452,MemSQL Start[c]UP 2.0 - Round 1,12,Permutation,2500.0,F,1406480400,"[data structures, divide and conquer, hashing]",PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Game With Sticks,500.0,A,1406215800,[implementation],PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Sort the Array,1000.0,B,1406215800,"[implementation, sortings]",PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Predict Outcome of the Game,1500.0,C,1406215800,"[brute force, implementation, math]",PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Count Good Substrings,2500.0,D,1406215800,[math],PROGRAMMING
+451,Codeforces Round #258 (Div. 2),2,Devu and Flowers,3000.0,E,1406215800,"[bitmasks, combinatorics, number theory]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Chocolate,500.0,A,1405774800,[math],PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Cities,1000.0,B,1405774800,"[graphs, shortest paths]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Apples,1500.0,C,1405774800,"[constructive algorithms, number theory]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Numbers,2000.0,D,1405774800,"[bitmasks, combinatorics, dp]",PROGRAMMING
+449,Codeforces Round #257 (Div. 1),1,Jzzhu and Squares,2500.0,E,1405774800,"[dp, math, number theory]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Children,500.0,A,1405774800,[implementation],PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Sequences,1000.0,B,1405774800,"[implementation, math]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Chocolate,1500.0,C,1405774800,"[greedy, implementation]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Cities,2000.0,D,1405774800,"[graphs, shortest paths]",PROGRAMMING
+450,Codeforces Round #257 (Div. 2),2,Jzzhu and Apples,2500.0,E,1405774800,"[constructive algorithms, number theory]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Rewards,500.0,A,1405605600,[implementation],PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Suffix Structures,1000.0,B,1405605600,"[implementation, strings]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Painting Fence,2500.0,C,1405605600,"[divide and conquer, dp, greedy]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Multiplication Table,2000.0,D,1405605600,"[binary search, brute force]",PROGRAMMING
+448,Codeforces Round #256 (Div. 2),2,Divisors,3000.0,E,1405605600,"[brute force, dfs and similar, implementation, number theory]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Sequences,500.0,A,1405256400,"[dp, implementation, two pointers]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Modification,1500.0,B,1405256400,"[brute force, greedy]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Fibonacci Numbers,1500.0,C,1405256400,"[data structures, number theory]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Games,2000.0,D,1405256400,"[math, matrices, probabilities]",PROGRAMMING
+446,Codeforces Round #FF (Div. 1),1,DZY Loves Bridges,2500.0,E,1405256400,"[math, matrices]",PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Hash,500.0,A,1405256400,[implementation],PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Strings,1000.0,B,1405256400,"[greedy, implementation]",PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Sequences,1500.0,C,1405256400,[dp],PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Modification,2500.0,D,1405256400,"[data structures, greedy]",PROGRAMMING
+447,Codeforces Round #FF (Div. 2),2,DZY Loves Fibonacci Numbers,2500.0,E,1405256400,[data structures],PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Physics,500.0,A,1404651900,"[greedy, math]",PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves FFT,1000.0,B,1404651900,[probabilities],PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Colors,2000.0,C,1404651900,[data structures],PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Strings,2000.0,D,1404651900,"[binary search, hashing, strings, two pointers]",PROGRAMMING
+444,Codeforces Round #254 (Div. 1),1,DZY Loves Planting,2500.0,E,1404651900,"[binary search, dsu, trees]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Chessboard,500.0,A,1404651900,"[dfs and similar, implementation]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Chemistry,1000.0,B,1404651900,"[dfs and similar, dsu, greedy]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Physics,1500.0,C,1404651900,"[graphs, greedy]",PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves FFT,2000.0,D,1404651900,[probabilities],PROGRAMMING
+445,Codeforces Round #254 (Div. 2),2,DZY Loves Colors,3000.0,E,1404651900,[data structures],PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Borya and Hanabi,500.0,A,1403191800,"[bitmasks, brute force, implementation]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Andrey and Problem,1500.0,B,1403191800,"[greedy, math, probabilities]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Artem and Array ,1500.0,C,1403191800,"[data structures, greedy]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Adam and Tree,2000.0,D,1403191800,"[data structures, trees]",PROGRAMMING
+442,Codeforces Round #253 (Div. 1),1,Gena and Second Distance,2500.0,E,1403191800,[geometry],PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Anton and Letters,500.0,A,1403191800,"[constructive algorithms, implementation]",PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Kolya and Tandem Repeat,1000.0,B,1403191800,"[brute force, implementation, strings]",PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Borya and Hanabi,1500.0,C,1403191800,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Andrey and Problem,2500.0,D,1403191800,"[dp, greedy, math, probabilities, sortings]",PROGRAMMING
+443,Codeforces Round #253 (Div. 2),2,Artem and Array ,2500.0,E,1403191800,[],PROGRAMMING
+436,Zepto Code Rush 2014,12,Feed with Candy,1000.0,A,1402673400,[greedy],PROGRAMMING
+436,Zepto Code Rush 2014,12,Om Nom and Spiders,1000.0,B,1402673400,"[implementation, math]",PROGRAMMING
+436,Zepto Code Rush 2014,12,Dungeons and Candies,1500.0,C,1402673400,"[dsu, graphs, greedy, trees]",PROGRAMMING
+436,Zepto Code Rush 2014,12,Pudding Monsters,2500.0,D,1402673400,[dp],PROGRAMMING
+436,Zepto Code Rush 2014,12,Cardboard Box,2500.0,E,1402673400,"[data structures, greedy]",PROGRAMMING
+436,Zepto Code Rush 2014,12,Banners,3000.0,F,1402673400,"[brute force, data structures, dp]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Antique Items,500.0,A,1402241400,[implementation],PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Fruits,1000.0,B,1402241400,"[greedy, implementation]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Tubes ,1500.0,C,1402241400,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Swaps,2000.0,D,1402241400,"[constructive algorithms, dsu, graphs, implementation, string suffix structures]",PROGRAMMING
+441,Codeforces Round #252 (Div. 2),2,Valera and Number,2500.0,E,1402241400,"[bitmasks, dp]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,"Devu, the Singer and Churu, the Joker",500.0,A,1401895800,"[greedy, implementation]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,"Devu, the Dumb Guy",1000.0,B,1401895800,"[implementation, sortings]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,Devu and Partitioning of the Array,1500.0,C,1401895800,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,Devu and his Brother,2000.0,D,1401895800,"[binary search, sortings, ternary search, two pointers]",PROGRAMMING
+439,Codeforces Round #251 (Div. 2),2,Devu and Birthday Celebration,2500.0,E,1401895800,"[combinatorics, dp, math]",PROGRAMMING
+440,Testing Round #10,12,Forgotten Episode,500.0,A,1401809400,[implementation],PROGRAMMING
+440,Testing Round #10,12,Balancer,1000.0,B,1401809400,[implementation],PROGRAMMING
+440,Testing Round #10,12,One-Based Arithmetic,1500.0,C,1401809400,"[dfs and similar, divide and conquer]",PROGRAMMING
+440,Testing Round #10,12,Berland Federalization,2000.0,D,1401809400,"[dp, trees]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Homework,500.0,A,1401627600,[implementation],PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Set,1500.0,B,1401627600,"[bitmasks, greedy, implementation, sortings]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Toy,1500.0,C,1401627600,"[graphs, greedy, sortings]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Zoo,2000.0,D,1401627600,"[dsu, sortings]",PROGRAMMING
+437,Codeforces Round #250 (Div. 2),2,The Child and Polygon,2500.0,E,1401627600,[],PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Toy,500.0,A,1401627600,[greedy],PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Zoo,1000.0,B,1401627600,"[dp, dsu, sortings]",PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Polygon,1500.0,C,1401627600,"[dp, geometry]",PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Sequence,2000.0,D,1401627600,[data structures],PROGRAMMING
+438,Codeforces Round #250 (Div. 1),1,The Child and Binary Tree,3000.0,E,1401627600,"[combinatorics, divide and conquer, fft, number theory]",PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Queue on Bus Stop,500.0,A,1401463800,[implementation],PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Pasha Maximizes,1000.0,B,1401463800,[greedy],PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Cardiogram,1500.0,C,1401463800,[implementation],PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Special Grid,2000.0,D,1401463800,"[brute force, dp, greedy]",PROGRAMMING
+435,Codeforces Round #249 (Div. 2),2,Special Graph,2500.0,E,1401463800,[],PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Kitahara Haruki's Gift,500.0,A,1400914800,"[brute force, implementation]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Kuriyama Mirai's Stones,1500.0,B,1400914800,"[dp, implementation, sortings]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Ryouko's Memory Note,1500.0,C,1400914800,"[implementation, math, sortings]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Nanami's Digital Board,2000.0,D,1400914800,"[dsu, implementation]",PROGRAMMING
+433,Codeforces Round #248 (Div. 2),2,Tachibana Kanade's Tofu,2500.0,E,1400914800,[dp],PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Ryouko's Memory Note,500.0,A,1400914800,"[math, sortings]",PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Nanami's Digital Board,1000.0,B,1400914800,"[divide and conquer, dp, dsu, implementation, two pointers]",PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Tachibana Kanade's Tofu,1500.0,C,1400914800,[dp],PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Nanami's Power Plant,2000.0,D,1400914800,[flows],PROGRAMMING
+434,Codeforces Round #248 (Div. 1),1,Furukawa Nagisa's Tree,3000.0,E,1400914800,"[binary search, divide and conquer, sortings, trees]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Black Square,500.0,A,1400686200,[implementation],PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Shower Line,1500.0,B,1400686200,"[brute force, implementation]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,k-Tree,1500.0,C,1400686200,"[dp, implementation, trees]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Random Task,2000.0,D,1400686200,"[binary search, bitmasks, combinatorics, dp, math]",PROGRAMMING
+431,Codeforces Round #247 (Div. 2),2,Chemistry Experiment,2500.0,E,1400686200,"[binary search, data structures, ternary search]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Choosing Teams,500.0,A,1400167800,"[greedy, implementation, sortings]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Football Kit,1000.0,B,1400167800,"[brute force, greedy, implementation]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Prime Swaps,1500.0,C,1400167800,"[greedy, sortings]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Prefixes and Suffixes,2000.0,D,1400167800,"[dp, string suffix structures, strings, two pointers]",PROGRAMMING
+432,Codeforces Round #246 (Div. 2),2,Square Tiling,2500.0,E,1400167800,"[constructive algorithms, greedy]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Xor-tree,500.0,A,1399822800,"[dfs and similar, trees]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Working out,1000.0,B,1399822800,[dp],PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Guess the Tree,1500.0,C,1399822800,"[bitmasks, constructive algorithms, dp, greedy, trees]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Tricky Function,2000.0,D,1399822800,"[data structures, divide and conquer, geometry]",PROGRAMMING
+429,Codeforces Round #245 (Div. 1),1,Points and Segments,2000.0,E,1399822800,[graphs],PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Points and Segments (easy),500.0,A,1399822800,"[constructive algorithms, sortings]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Balls Game,1000.0,B,1399822800,"[brute force, two pointers]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Xor-tree,1500.0,C,1399822800,"[brute force, data structures, dfs and similar, trees]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Working out,2000.0,D,1399822800,"[brute force, dp]",PROGRAMMING
+430,Codeforces Round #245 (Div. 2),2,Guess the Tree,2500.0,E,1399822800,"[constructive algorithms, data structures, dfs and similar]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Police Recruits,500.0,A,1399044600,[implementation],PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Prison Transfer,1000.0,B,1399044600,"[data structures, implementation]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Checkposts,1500.0,C,1399044600,"[dfs and similar, graphs, two pointers]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Match & Catch,2000.0,D,1399044600,"[dp, string suffix structures, strings]",PROGRAMMING
+427,Codeforces Round #244 (Div. 2),2,Police Patrol,2500.0,E,1399044600,"[greedy, implementation, math, ternary search]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Swaps,500.0,A,1398612600,"[brute force, sortings]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Table ,1000.0,B,1398612600,"[bitmasks, greedy]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Two Sequences,1500.0,C,1398612600,"[data structures, dp]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Squares,2000.0,D,1398612600,"[binary search, data structures, hashing]",PROGRAMMING
+425,Codeforces Round #243 (Div. 1),1,Sereja and Sets,2000.0,E,1398612600,[dp],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Mugs,500.0,A,1398612600,[implementation],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Mirroring,1000.0,B,1398612600,[implementation],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Swaps,1500.0,C,1398612600,"[brute force, sortings, two pointers]",PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Table ,2000.0,D,1398612600,[],PROGRAMMING
+426,Codeforces Round #243 (Div. 2),2,Sereja and Two Sequences,2500.0,E,1398612600,[],PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Squats,500.0,A,1398409200,[implementation],PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Megacity,1000.0,B,1398409200,"[binary search, greedy, implementation, sortings]",PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Magic Formulas,1500.0,C,1398409200,[math],PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Biathlon Track,2500.0,D,1398409200,"[binary search, brute force, constructive algorithms, data structures, dp]",PROGRAMMING
+424,Codeforces Round #242 (Div. 2),2,Colored Jenga,3000.0,E,1398409200,"[dfs and similar, dp, probabilities]",PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Start Up,500.0,A,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Online Meeting,1500.0,B,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Bug in Code,1500.0,C,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Cup Trick,1500.0,D,1398169200,[],PROGRAMMING
+419,Coder-Strike 2014 - Finals,12,Playing the ball,2000.0,E,1398169200,[],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Start Up,500.0,A,1398169140,[implementation],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Online Meeting,1500.0,B,1398169140,[implementation],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Bug in Code,1500.0,C,1398169140,"[data structures, graphs, implementation, two pointers]",PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Cup Trick,1500.0,D,1398169140,[data structures],PROGRAMMING
+420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Playing the ball,2000.0,E,1398169140,[geometry],PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Pasha and Hamsters,500.0,A,1398168900,"[constructive algorithms, implementation]",PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Start Up,1000.0,B,1398168900,[implementation],PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Online Meeting,2000.0,C,1398168900,[implementation],PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Bug in Code,2000.0,D,1398168900,"[binary search, data structures, sortings]",PROGRAMMING
+421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Cup Trick,2000.0,E,1398168900,[data structures],PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Data Recovery,500.0,A,1397977200,[implementation],PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Spyke Chatting,1000.0,B,1397977200,[implementation],PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Jeopardy!,1500.0,C,1397977200,"[greedy, math]",PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,2048,2000.0,D,1397977200,"[bitmasks, dp]",PROGRAMMING
+413,Coder-Strike 2014 - Round 2,12,Maze 2D,2500.0,E,1397977200,"[data structures, divide and conquer]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Poster,500.0,A,1397837400,"[greedy, implementation]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Network Configuration,1000.0,B,1397837400,"[greedy, sortings]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Pattern,1500.0,C,1397837400,"[implementation, strings]",PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,Giving Awards,2000.0,D,1397837400,[dfs and similar],PROGRAMMING
+412,Coder-Strike 2014 - Round 1,12,E-mail Addresses,2500.0,E,1397837400,[implementation],PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Elimination,500.0,A,1397749200,"[dp, implementation, math]",PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Crash,1000.0,B,1397749200,[implementation],PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Football,1500.0,C,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Cunning Gena,2000.0,D,1397749200,"[bitmasks, dp, greedy, sortings]",PROGRAMMING
+417,RCC 2014 Warmup (Div. 2),2,Square Table,2500.0,E,1397749200,"[constructive algorithms, math, probabilities]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Football,500.0,A,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Cunning Gena,1000.0,B,1397749200,"[bitmasks, dp, sortings]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Square Table,1500.0,C,1397749200,"[constructive algorithms, dp, math]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Big Problems for Organizers,2500.0,D,1397749200,"[data structures, graphs, trees]",PROGRAMMING
+418,RCC 2014 Warmup (Div. 1),1,Tricky Password,2500.0,E,1397749200,[data structures],PROGRAMMING
+411,Coder-Strike 2014 - Qualification Round,12,Password Check,,A,1397505600,[implementation],PROGRAMMING
+411,Coder-Strike 2014 - Qualification Round,12,Multi-core Processor,,B,1397505600,[implementation],PROGRAMMING
+411,Coder-Strike 2014 - Qualification Round,12,Kicker,,C,1397505600,[implementation],PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Guess a number!,500.0,A,1397376000,"[greedy, implementation, two pointers]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Art Union,1000.0,B,1397376000,"[brute force, dp, implementation]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Booking System,1500.0,C,1397376000,"[binary search, dp, greedy, implementation]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,Population Size,2000.0,D,1397376000,"[greedy, implementation]",PROGRAMMING
+416,Codeforces Round #241 (Div. 2),2,President's Path,2500.0,E,1397376000,"[dp, graphs, shortest paths]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and Numbers,500.0,A,1396798800,"[constructive algorithms, number theory]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and ACM,1000.0,B,1396798800,"[combinatorics, dp]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and Reverse Operation,1500.0,C,1396798800,"[combinatorics, divide and conquer]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh and Water Tanks,1500.0,D,1396798800,"[binary search, data structures, greedy, two pointers]",PROGRAMMING
+414,Codeforces Round #240 (Div. 1),1,Mashmokh's Designed Problem,2500.0,E,1396798800,[data structures],PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Lights,500.0,A,1396798800,[implementation],PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Tokens,1000.0,B,1396798800,"[binary search, greedy, math]",PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Numbers,1500.0,C,1396798800,"[constructive algorithms, greedy, number theory]",PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and ACM,2000.0,D,1396798800,"[combinatorics, dp, number theory]",PROGRAMMING
+415,Codeforces Round #240 (Div. 2),2,Mashmokh and Reverse Operation,2500.0,E,1396798800,"[divide and conquer, sortings]",PROGRAMMING
+409,April Fools Day Contest 2014,12,The Great Game,,A,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Mysterious Language,,B,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Magnum Opus,,C,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Big Data,,D,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,Dome,,E,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,000001,,F,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,On a plane,,G,1396366200,[*special],PROGRAMMING
+409,April Fools Day Contest 2014,12,A + B Strikes Back,,H,1396366200,"[*special, brute force, constructive algorithms, dsu, implementation]",PROGRAMMING
+409,April Fools Day Contest 2014,12,Feed the Golorp,,I,1396366200,[*special],PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Triangle,500.0,A,1396162800,"[brute force, implementation, math]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Long Path,1000.0,B,1396162800,"[dp, implementation]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Curious Array,2000.0,C,1396162800,"[brute force, implementation, math]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,Largest Submatrix 3,2000.0,D,1396162800,"[dp, hashing]",PROGRAMMING
+407,Codeforces Round #239 (Div. 1),1,k-d-sequence,2500.0,E,1396162800,[data structures],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Line to Cashier,500.0,A,1396162800,[implementation],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Garland,1000.0,B,1396162800,[implementation],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Triangle,1500.0,C,1396162800,"[geometry, math]",PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Long Path,2000.0,D,1396162800,[dp],PROGRAMMING
+408,Codeforces Round #239 (Div. 2),2,Curious Array,3000.0,E,1396162800,[],PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Gravity Flip,500.0,A,1395502200,"[greedy, implementation, sortings]",PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Domino Effect,1000.0,B,1395502200,[],PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Unusual Product,1500.0,C,1395502200,"[implementation, math]",PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Toy Sum,2000.0,D,1395502200,"[greedy, implementation, math]",PROGRAMMING
+405,Codeforces Round #238 (Div. 2),2,Graph Cutting,3000.0,E,1395502200,[dfs and similar],PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Unusual Product,500.0,A,1395502200,"[implementation, math]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Toy Sum,1000.0,B,1395502200,"[constructive algorithms, greedy]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Graph Cutting,2000.0,C,1395502200,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Hill Climbing,2000.0,D,1395502200,"[dfs and similar, geometry, trees]",PROGRAMMING
+406,Codeforces Round #238 (Div. 1),1,Hamming Triples,2500.0,E,1395502200,"[implementation, math]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Valera and X,500.0,A,1395243000,[implementation],PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Marathon,1000.0,B,1395243000,"[implementation, math]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Restore Graph,1500.0,C,1395243000,"[dfs and similar, graphs, sortings]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Minesweeper 1D,2000.0,D,1395243000,"[dp, implementation]",PROGRAMMING
+404,Codeforces Round #237 (Div. 2),2,Maze 1D,2500.0,E,1395243000,"[binary search, greedy, implementation]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Nuts,500.0,A,1394983800,"[greedy, math]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Trees in a Row,1000.0,B,1394983800,[brute force],PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Searching for Graph,1500.0,C,1394983800,"[brute force, constructive algorithms]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Upgrading Array,2000.0,D,1394983800,"[dp, greedy, math]",PROGRAMMING
+402,Codeforces Round #236 (Div. 2),2,Strictly Positive Matrix,2500.0,E,1394983800,[graphs],PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Searching for Graph,500.0,A,1394983800,"[constructive algorithms, graphs]",PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Upgrading Array,1000.0,B,1394983800,"[dp, greedy, number theory]",PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Strictly Positive Matrix,1500.0,C,1394983800,[graphs],PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Beautiful Pairs of Numbers,1500.0,D,1394983800,"[combinatorics, dp]",PROGRAMMING
+403,Codeforces Round #236 (Div. 1),1,Two Rooted Trees,2000.0,E,1394983800,"[data structures, implementation]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Vanya and Cards,500.0,A,1394465400,"[implementation, math]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Sereja and Contests,1000.0,B,1394465400,"[greedy, implementation, math]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Team,1500.0,C,1394465400,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Roman and Numbers,2000.0,D,1394465400,"[bitmasks, brute force, combinatorics, dp, number theory]",PROGRAMMING
+401,Codeforces Round #235 (Div. 2),2,Olympic Games,2500.0,E,1394465400,[math],PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and Choose Options,500.0,A,1394033400,"[dp, implementation]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and New Matrix of Candies,1000.0,B,1394033400,"[brute force, implementation, schedules]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and Huge Candy Matrix,1500.0,C,1394033400,"[implementation, math]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Dima and Bacteria,2000.0,D,1394033400,"[dsu, graphs, shortest paths]",PROGRAMMING
+400,Codeforces Round #234 (Div. 2),2,Inna and Binary Logic,2500.0,E,1394033400,"[binary search, bitmasks, data structures]",PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Cards,500.0,A,1393687800,[implementation],PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Painting The Wall,1000.0,B,1393687800,"[dp, probabilities]",PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Tree and Array,1500.0,C,1393687800,[constructive algorithms],PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Instant Messanger,2000.0,D,1393687800,[data structures],PROGRAMMING
+398,Codeforces Round #233 (Div. 1),1,Sorting Permutations,2500.0,E,1393687800,[],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Pages,500.0,A,1393687800,[implementation],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Red and Blue Balls,1000.0,B,1393687800,[],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Cards,1500.0,C,1393687800,[number theory],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Painting The Wall,2000.0,D,1393687800,[],PROGRAMMING
+399,Codeforces Round #233 (Div. 2),2,Tree and Array,2500.0,E,1393687800,[],PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Number of Decompositions into Multipliers,500.0,A,1393428600,"[combinatorics, number theory]",PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Sum of Fractions,1000.0,B,1393428600,"[math, number theory]",PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Changing Tree,1500.0,C,1393428600,"[data structures, trees]",PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Sum of Number of Inversions in Permutations,2000.0,D,1393428600,[combinatorics],PROGRAMMING
+396,Codeforces Round #232 (Div. 1),1,On Iteration of One Well-Known Function,2500.0,E,1393428600,[],PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Segment's Own Points,500.0,A,1393428600,[],PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Corruption and Numbers,1000.0,B,1393428600,"[implementation, math]",PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Number of Decompositions into Multipliers,1500.0,C,1393428600,"[combinatorics, number theory]",PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Sum of Fractions,2000.0,D,1393428600,[math],PROGRAMMING
+397,Codeforces Round #232 (Div. 2),2,On Changing Tree,2500.0,E,1393428600,"[data structures, trees]",PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Counting Sticks,500.0,A,1392910200,[implementation],PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Very Beautiful Number,1000.0,B,1392910200,[],PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Dominoes,1500.0,C,1392910200,"[constructive algorithms, greedy]",PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Physical Education and Buns,2000.0,D,1392910200,"[brute force, implementation, math]",PROGRAMMING
+394,Codeforces Round #231 (Div. 2),2,Lightbulb for Minister,2500.0,E,1392910200,[geometry],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Blocked Points,500.0,A,1392728400,[math],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Tower of Hanoi,1000.0,B,1392728400,[dp],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Yet Another Number Sequence,1500.0,C,1392728400,"[combinatorics, math, matrices]",PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Three Arrays,2000.0,D,1392728400,[data structures],PROGRAMMING
+392,Codeforces Round #230 (Div. 1),1,Deleting Substrings,2500.0,E,1392728400,[],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Nineteen,500.0,A,1392728400,[],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Three matrices,1000.0,B,1392728400,[],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Blocked Points,1500.0,C,1392728400,[geometry],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Tower of Hanoi,2000.0,D,1392728400,[dp],PROGRAMMING
+393,Codeforces Round #230 (Div. 2),2,Yet Another Number Sequence,2500.0,E,1392728400,[],PROGRAMMING
+391,Rockethon 2014,12,Genetic Engineering,3.0,A,1392573600,"[implementation, two pointers]",PROGRAMMING
+391,Rockethon 2014,12,Word Folding,5.0,B,1392573600,[brute force],PROGRAMMING
+391,Rockethon 2014,12,The Tournament,4.0,C1,1392573600,[brute force],PROGRAMMING
+391,Rockethon 2014,12,The Tournament,4.0,C2,1392573600,[greedy],PROGRAMMING
+391,Rockethon 2014,12,The Tournament,8.0,C3,1392573600,[],PROGRAMMING
+391,Rockethon 2014,12,Supercollider,3.0,D1,1392573600,[brute force],PROGRAMMING
+391,Rockethon 2014,12,Supercollider,16.0,D2,1392573600,[data structures],PROGRAMMING
+391,Rockethon 2014,12,Three Trees,11.0,E1,1392573600,[],PROGRAMMING
+391,Rockethon 2014,12,Three Trees,13.0,E2,1392573600,[],PROGRAMMING
+391,Rockethon 2014,12,Stock Trading,8.0,F1,1392573600,[dp],PROGRAMMING
+391,Rockethon 2014,12,Stock Trading,15.0,F2,1392573600,[greedy],PROGRAMMING
+391,Rockethon 2014,12,Stock Trading,10.0,F3,1392573600,[],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Alarm Clock,500.0,A,1392132600,[implementation],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,"Inna, Dima and Song",1000.0,B,1392132600,[implementation],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Candy Boxes,1500.0,C,1392132600,[data structures],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Sweet Matrix,2000.0,D,1392132600,[constructive algorithms],PROGRAMMING
+390,Codeforces Round #229 (Div. 2),2,Inna and Large Sweet Matrix,2500.0,E,1392132600,[],PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Box Accumulation,500.0,A,1391442000,"[greedy, sortings]",PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Minimal path,1000.0,B,1391442000,"[bitmasks, constructive algorithms, graphs, implementation, math]",PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Card Game,1500.0,C,1391442000,"[games, greedy, sortings]",PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Perfect Sets,2000.0,D,1391442000,[math],PROGRAMMING
+388,Codeforces Round #228 (Div. 1),1,Fox and Meteor Shower,2500.0,E,1391442000,[geometry],PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Number Game,500.0,A,1391442000,"[greedy, math]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Cross,1000.0,B,1391442000,"[greedy, implementation]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Box Accumulation,1500.0,C,1391442000,"[binary search, dp, greedy]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Minimal path,2000.0,D,1391442000,"[constructive algorithms, graphs, implementation, shortest paths]",PROGRAMMING
+389,Codeforces Round #228 (Div. 2),2,Fox and Card Game,2500.0,E,1391442000,"[greedy, implementation]",PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Sleep,500.0,A,1391095800,[implementation],PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Round,1000.0,B,1391095800,"[brute force, greedy, two pointers]",PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Number,1500.0,C,1391095800,"[greedy, implementation]",PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Interesting Graph,2000.0,D,1391095800,[graph matchings],PROGRAMMING
+387,Codeforces Round #227 (Div. 2),2,George and Cards,2500.0,E,1391095800,"[binary search, data structures]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Raspberry,500.0,A,1390577700,"[brute force, greedy, implementation]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Strings,1000.0,B,1390577700,"[brute force, greedy, implementation, math, strings]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Prime Numbers,1500.0,C,1390577700,"[binary search, brute force, data structures, dp, implementation, math, number theory]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear and Floodlight,2000.0,D,1390577700,"[bitmasks, dp, geometry]",PROGRAMMING
+385,Codeforces Round #226 (Div. 2),2,Bear in the Field,2500.0,E,1390577700,"[math, matrices]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Milking cows,500.0,A,1390231800,"[data structures, greedy]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Volcanoes,1500.0,B,1390231800,"[binary search, implementation, sortings, two pointers]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Propagating tree,1500.0,C,1390231800,"[data structures, dfs and similar, trees]",PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Antimatter,2000.0,D,1390231800,[dp],PROGRAMMING
+383,Codeforces Round #225 (Div. 1),1,Vowels,2500.0,E,1390231800,"[combinatorics, divide and conquer, dp]",PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Coder,500.0,A,1390231800,[implementation],PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Multitasking,1000.0,B,1390231800,"[greedy, implementation, sortings, two pointers]",PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Milking cows,1500.0,C,1390231800,[greedy],PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Volcanoes,2500.0,D,1390231800,[implementation],PROGRAMMING
+384,Codeforces Round #225 (Div. 2),2,Propagating tree,2500.0,E,1390231800,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Ksenia and Pan Scales,500.0,A,1389972600,"[greedy, implementation]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Number Busters,2500.0,B,1389972600,"[binary search, math]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Arithmetic Progression,1500.0,C,1389972600,"[implementation, sortings]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Ksenia and Pawns,3000.0,D,1389972600,"[dfs and similar, graphs, implementation, trees]",PROGRAMMING
+382,Codeforces Round #224 (Div. 2),2,Ksenia and Combinatorics,3000.0,E,1389972600,"[combinatorics, dp]",PROGRAMMING
+386,Testing Round #9,12,Second-Price Auction,500.0,A,1389906900,[implementation],PROGRAMMING
+386,Testing Round #9,12,"Fly, freebies, fly!",1000.0,B,1389906900,"[binary search, brute force, implementation]",PROGRAMMING
+386,Testing Round #9,12,Diverse Substrings,1500.0,C,1389906900,"[dp, two pointers]",PROGRAMMING
+386,Testing Round #9,12,Game with Points,2000.0,D,1389906900,"[dp, graphs, implementation, shortest paths]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Prefixes,500.0,A,1389540600,"[binary search, brute force]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Tree,1000.0,B,1389540600,"[graphs, implementation]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Brackets,1500.0,C,1389540600,"[data structures, schedules]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Cinema,2000.0,D,1389540600,"[combinatorics, math]",PROGRAMMING
+380,Codeforces Round #223 (Div. 1),1,Sereja and Dividing,2500.0,E,1389540600,[data structures],PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Dima,500.0,A,1389540600,"[greedy, implementation, two pointers]",PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Stairs,1000.0,B,1389540600,"[greedy, implementation, sortings]",PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Prefixes,1500.0,C,1389540600,"[binary search, implementation, two pointers]",PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Tree,2000.0,D,1389540600,[brute force],PROGRAMMING
+381,Codeforces Round #223 (Div. 2),2,Sereja and Brackets,2500.0,E,1389540600,[data structures],PROGRAMMING
+379,Good Bye 2013,12,New Year Candles,500.0,A,1388417400,[implementation],PROGRAMMING
+379,Good Bye 2013,12,New Year Present,1000.0,B,1388417400,"[constructive algorithms, implementation]",PROGRAMMING
+379,Good Bye 2013,12,New Year Ratings Change,1500.0,C,1388417400,"[greedy, sortings]",PROGRAMMING
+379,Good Bye 2013,12,New Year Letter,2000.0,D,1388417400,"[bitmasks, brute force, dp]",PROGRAMMING
+379,Good Bye 2013,12,New Year Tree Decorations,2500.0,E,1388417400,"[geometry, schedules, sortings]",PROGRAMMING
+379,Good Bye 2013,12,New Year Tree,3000.0,F,1388417400,"[data structures, divide and conquer, trees]",PROGRAMMING
+379,Good Bye 2013,12,New Year Cactus,3500.0,G,1388417400,[dp],PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Maze,500.0,A,1388331000,[dfs and similar],PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Preparing for the Contest,1000.0,B,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Captains Mode,1000.0,C,1388331000,"[bitmasks, dp, games]",PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Developing Game,2000.0,D,1388331000,[data structures],PROGRAMMING
+377,Codeforces Round #222 (Div. 1),1,Cookie Clicker,2500.0,E,1388331000,"[dp, geometry]",PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Playing with Dice,500.0,A,1388331000,[brute force],PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Semifinals,1000.0,B,1388331000,"[implementation, sortings]",PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Maze,1500.0,C,1388331000,[dfs and similar],PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Preparing for the Contest,2000.0,D,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING
+378,Codeforces Round #222 (Div. 2),2,Captains Mode,2000.0,E,1388331000,"[bitmasks, brute force, dp, greedy]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Divisible by Seven,500.0,A,1387893600,"[math, number theory]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Maximum Submatrix 2,1000.0,B,1387893600,"[data structures, dp, implementation, sortings]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Circling Round Treasures,1500.0,C,1387893600,"[bitmasks, shortest paths]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Tree and Queries,2000.0,D,1387893600,"[data structures, dfs and similar, trees]",PROGRAMMING
+375,Codeforces Round #221 (Div. 1),1,Red and Black Tree,2500.0,E,1387893600,"[dp, implementation, math]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Lever,500.0,A,1387893600,"[implementation, math]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,I.O.U.,1000.0,B,1387893600,[implementation],PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Divisible by Seven,1500.0,C,1387893600,"[math, number theory]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Maximum Submatrix 2,2000.0,D,1387893600,"[dp, implementation, sortings]",PROGRAMMING
+376,Codeforces Round #221 (Div. 2),2,Circling Round Treasures,2500.0,E,1387893600,"[bitmasks, shortest paths]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Pink Pony,500.0,A,1387380600,"[greedy, implementation]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Nine,1000.0,B,1387380600,"[combinatorics, greedy]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Dima,1500.0,C,1387380600,"[dfs and similar, dp, graphs, implementation]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Sequence ,2000.0,D,1387380600,"[binary search, data structures, dp, trees]",PROGRAMMING
+374,Codeforces Round #220 (Div. 2),2,Inna and Babies,2500.0,E,1387380600,"[binary search, data structures, dsu, geometry, implementation]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Counting Kangaroos is Fun,500.0,A,1386943200,"[binary search, greedy, sortings, two pointers]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Counting Rectangles is Fun,1000.0,B,1386943200,"[brute force, divide and conquer, dp]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Watching Fireworks is Fun,1500.0,C,1386943200,"[data structures, dp, math]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Choosing Subtree is Fun,2000.0,D,1386943200,"[binary search, data structures, dfs and similar, trees, two pointers]",PROGRAMMING
+372,Codeforces Round #219 (Div. 1),1,Drawing Circles is Fun,2500.0,E,1386943200,"[combinatorics, geometry]",PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Collecting Beats is Fun,500.0,A,1386943200,[implementation],PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Making Sequences is Fun,1000.0,B,1386943200,"[binary search, implementation, math]",PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Counting Kangaroos is Fun,1500.0,C,1386943200,"[greedy, sortings, two pointers]",PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Counting Rectangles is Fun,2000.0,D,1386943200,[],PROGRAMMING
+373,Codeforces Round #219 (Div. 2),2,Watching Fireworks is Fun,2500.0,E,1386943200,[dp],PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,K-Periodic Array,500.0,A,1386493200,"[implementation, math]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Fox Dividing Cheese,1000.0,B,1386493200,"[math, number theory]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Hamburgers,1500.0,C,1386493200,"[binary search, brute force]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Vessels,2000.0,D,1386493200,"[data structures, dsu, implementation, trees]",PROGRAMMING
+371,Codeforces Round #218 (Div. 2),2,Subway Innovation,2500.0,E,1386493200,"[math, two pointers]",PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,"Rook, Bishop and King",500.0,A,1386399600,[math],PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Berland Bingo,500.0,B,1386399600,[implementation],PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Mittens,1500.0,C,1386399600,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Broken Monitor,3000.0,D,1386399600,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+370,Codeforces Round #217 (Div. 2),2,Summer Reading,3000.0,E,1386399600,"[dp, greedy]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Plates,500.0,A,1385739000,[implementation],PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Contest,1000.0,B,1385739000,"[constructive algorithms, implementation, math]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Elections,1500.0,C,1385739000,"[dfs and similar, graphs, trees]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Fools,2000.0,D,1385739000,"[dfs and similar, dp, shortest paths]",PROGRAMMING
+369,Codeforces Round #216 (Div. 2),2,Valera and Queries,2500.0,E,1385739000,"[binary search, data structures]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and Algorithm ,500.0,A,1385479800,"[data structures, implementation]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja ans Anagrams,1000.0,B,1385479800,"[binary search, data structures]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and the Arrangement of Numbers,1500.0,C,1385479800,"[graphs, greedy, sortings]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and Sets,2000.0,D,1385479800,"[bitmasks, dfs and similar]",PROGRAMMING
+367,Codeforces Round #215 (Div. 1),1,Sereja and Intervals,2000.0,E,1385479800,"[combinatorics, dp]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and Coat Rack,500.0,A,1385479800,[implementation],PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and Suffixes,1000.0,B,1385479800,"[data structures, dp]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and Algorithm ,1500.0,C,1385479800,"[brute force, implementation]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja ans Anagrams,2000.0,D,1385479800,"[data structures, two pointers]",PROGRAMMING
+368,Codeforces Round #215 (Div. 2),2,Sereja and the Arrangement of Numbers,2500.0,E,1385479800,"[combinatorics, graphs, implementation]",PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Guards,500.0,A,1385307000,[implementation],PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and To-do List,1000.0,B,1385307000,"[brute force, implementation]",PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Salad,1500.0,C,1385307000,[dp],PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Trap Graph,2000.0,D,1385307000,"[binary search, data structures, dfs and similar, dsu, shortest paths, two pointers]",PROGRAMMING
+366,Codeforces Round #214 (Div. 2),2,Dima and Magic Guitar,2500.0,E,1385307000,"[brute force, implementation, math]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Matrix,500.0,A,1384875000,"[combinatorics, data structures, implementation]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Free Market,1000.0,B,1384875000,"[dp, greedy]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Beautiful Set,1500.0,C,1384875000,"[brute force, number theory]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Ghd,2000.0,D,1384875000,"[brute force, math, probabilities]",PROGRAMMING
+364,Codeforces Round #213 (Div. 1),1,Empty Rectangles,2500.0,E,1384875000,"[divide and conquer, two pointers]",PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Good Number,500.0,A,1384875000,[implementation],PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,The Fibonacci Segment,1000.0,B,1384875000,[implementation],PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Matrix,1500.0,C,1384875000,"[brute force, combinatorics, math, matrices]",PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Free Market,2000.0,D,1384875000,"[dp, greedy]",PROGRAMMING
+365,Codeforces Round #213 (Div. 2),2,Beautiful Set,2500.0,E,1384875000,"[brute force, number theory]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Two Semiknights Meet,1000.0,A,1384443000,"[greedy, math]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Petya and Staircases,500.0,B,1384443000,"[implementation, sortings]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Insertion Sort,2500.0,C,1384443000,"[data structures, dp, implementation, math]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Fools and Foolproof Roads,3000.0,D,1384443000,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING
+362,Codeforces Round #212 (Div. 2),2,Petya and Pipes,3000.0,E,1384443000,"[flows, graphs, shortest paths]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Soroban,500.0,A,1384156800,[implementation],PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Fence,1000.0,B,1384156800,"[brute force, dp]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Fixing Typos,1500.0,C,1384156800,"[greedy, implementation]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Renting Bikes,2000.0,D,1384156800,"[binary search, greedy]",PROGRAMMING
+363,Codeforces Round #211 (Div. 2),2,Two Circles,2500.0,E,1384156800,"[brute force, data structures, implementation]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Array Recovery,500.0,A,1384102800,"[greedy, implementation]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Array,1000.0,B,1384102800,"[binary search, dp]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Strings,1500.0,C,1384102800,"[combinatorics, dp]",PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Sets,1500.0,D,1384102800,[number theory],PROGRAMMING
+360,Codeforces Round #210 (Div. 1),1,Levko and Game,2000.0,E,1384102800,"[graphs, greedy, shortest paths]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Table,500.0,A,1384102800,"[constructive algorithms, implementation]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Permutation,1000.0,B,1384102800,"[constructive algorithms, math, number theory]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Array Recovery,1500.0,C,1384102800,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Array,2000.0,D,1384102800,"[binary search, dp]",PROGRAMMING
+361,Codeforces Round #210 (Div. 2),2,Levko and Strings,2500.0,E,1384102800,[],PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Table,500.0,A,1383379200,"[greedy, implementation]",PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Permutation,1000.0,B,1383379200,"[constructive algorithms, dp, math]",PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Prime Number,1500.0,C,1383379200,[math],PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Pair of Numbers,2500.0,D,1383379200,"[binary search, brute force, data structures, math, two pointers]",PROGRAMMING
+359,Codeforces Round #209 (Div. 2),2,Neatness,2500.0,E,1383379200,[dfs and similar],PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Continuous Line,500.0,A,1382715000,"[brute force, implementation]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Text Messages,1000.0,B,1382715000,"[brute force, strings]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Containers,1500.0,C,1382715000,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Hares,2000.0,D,1382715000,"[dp, greedy]",PROGRAMMING
+358,Codeforces Round #208 (Div. 2),2,Dima and Kicks,3000.0,E,1382715000,"[brute force, dsu, graphs, implementation]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Knight Tournament,500.0,A,1381838400,"[data structures, dsu]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Xenia and Hamming,1000.0,B,1381838400,"[implementation, math]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Compartments,1500.0,C,1381838400,"[combinatorics, constructive algorithms, greedy, implementation]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Bags and Coins,2000.0,D,1381838400,"[bitmasks, constructive algorithms, dp, greedy]",PROGRAMMING
+356,Codeforces Round #207 (Div. 1),1,Xenia and String Problem,2500.0,E,1381838400,"[dp, hashing, implementation, string suffix structures, strings]",PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Group of Students,500.0,A,1381838400,"[brute force, greedy, implementation]",PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Flag Day,1000.0,B,1381838400,"[constructive algorithms, implementation]",PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Knight Tournament,1500.0,C,1381838400,[data structures],PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Xenia and Hamming,2000.0,D,1381838400,[number theory],PROGRAMMING
+357,Codeforces Round #207 (Div. 2),2,Compartments,2500.0,E,1381838400,[],PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Vasya and Robot,500.0,A,1381678200,"[brute force, greedy, math]",PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Game with Strings,1000.0,B,1381678200,"[bitmasks, dp, games]",PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Vasya and Beautiful Arrays,1500.0,C,1381678200,"[brute force, dp, number theory]",PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Transferring Pyramid,2000.0,D,1381678200,[dp],PROGRAMMING
+354,Codeforces Round #206 (Div. 1),1,Lucky Number Representation,2500.0,E,1381678200,"[constructive algorithms, dfs and similar, dp]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Digital Root,500.0,A,1381678200,"[constructive algorithms, implementation]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Public Transport,1000.0,B,1381678200,"[greedy, implementation]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Robot,1500.0,C,1381678200,"[brute force, dp]",PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Game with Strings,2000.0,D,1381678200,[],PROGRAMMING
+355,Codeforces Round #206 (Div. 2),2,Vasya and Beautiful Arrays,2500.0,E,1381678200,"[binary search, brute force, data structures]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Domino,500.0,A,1381419000,"[implementation, math]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Two Heaps,1500.0,B,1381419000,"[combinatorics, constructive algorithms, greedy, implementation, math, sortings]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Find Maximum,1000.0,C,1381419000,"[implementation, math, number theory]",PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Queue,2500.0,D,1381419000,[constructive algorithms],PROGRAMMING
+353,Codeforces Round #205 (Div. 2),2,Antichain,3000.0,E,1381419000,"[dp, graph matchings, greedy]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Rounding,1000.0,A,1380900600,"[dp, greedy, implementation, math]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Furik,1000.0,B,1380900600,"[combinatorics, dp, probabilities]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Brackets,1500.0,C,1380900600,"[dp, matrices]",PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Removing Periods,2000.0,D,1380900600,[data structures],PROGRAMMING
+351,Codeforces Round #204 (Div. 1),1,Jeff and Permutation,2000.0,E,1380900600,[greedy],PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Digits,500.0,A,1380900600,"[brute force, implementation, math]",PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Periods,1000.0,B,1380900600,"[implementation, sortings]",PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Rounding,1500.0,C,1380900600,"[dp, greedy, implementation]",PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Furik,2000.0,D,1380900600,[math],PROGRAMMING
+352,Codeforces Round #204 (Div. 2),2,Jeff and Brackets,2500.0,E,1380900600,[],PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,TL,500.0,A,1380641400,"[brute force, greedy, implementation]",PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Resort,1000.0,B,1380641400,[graphs],PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Bombs,1000.0,C,1380641400,"[greedy, implementation, sortings]",PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Looking for Owls,3000.0,D,1380641400,"[binary search, geometry, hashing, sortings]",PROGRAMMING
+350,Codeforces Round #203 (Div. 2),2,Wrong Floyd,3000.0,E,1380641400,"[brute force, constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Mafia,500.0,A,1380295800,"[binary search, math, sortings]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Apple Tree,1000.0,B,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Subset Sums,1500.0,C,1380295800,"[brute force, data structures]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Turtles,2000.0,D,1380295800,"[dp, matrices]",PROGRAMMING
+348,Codeforces Round #202 (Div. 1),1,Pilgrims,2500.0,E,1380295800,"[dfs and similar, dp, trees]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Cinema Line,500.0,A,1380295800,"[greedy, implementation]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Color the Fence,1000.0,B,1380295800,"[data structures, dp, greedy]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Mafia,1500.0,C,1380295800,[implementation],PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Apple Tree,2000.0,D,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING
+349,Codeforces Round #202 (Div. 2),2,Subset Sums,2500.0,E,1380295800,[],PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Alice and Bob,500.0,A,1379691000,"[games, math, number theory]",PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Lucky Common Subsequence,1000.0,B,1379691000,"[dp, strings]",PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Number Transformation II,1500.0,C,1379691000,"[greedy, math]",PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Robot Control,2000.0,D,1379691000,[shortest paths],PROGRAMMING
+346,Codeforces Round #201 (Div. 1),1,Doodle Jump,2500.0,E,1379691000,[math],PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Difference Row,500.0,A,1379691000,"[implementation, sortings]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Fixed Points,1000.0,B,1379691000,"[implementation, math]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Alice and Bob,1500.0,C,1379691000,"[games, math, number theory]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Lucky Common Subsequence,2000.0,D,1379691000,"[dp, strings]",PROGRAMMING
+347,Codeforces Round #201 (Div. 2),2,Number Transformation II,2500.0,E,1379691000,"[dp, greedy, number theory]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Rational Resistance,500.0,A,1379172600,"[math, number theory]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Alternating Current,1000.0,B,1379172600,"[data structures, greedy, implementation]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Read Time,1500.0,C,1379172600,"[binary search, greedy, two pointers]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Water Tree,2000.0,D,1379172600,"[data structures, dfs and similar, trees]",PROGRAMMING
+343,Codeforces Round #200 (Div. 1),1,Pumping Stations,2500.0,E,1379172600,"[brute force, dfs and similar, divide and conquer, flows, greedy]",PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Magnets,500.0,A,1379172600,[implementation],PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Simple Molecules,1000.0,B,1379172600,"[brute force, math]",PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Rational Resistance,1500.0,C,1379172600,[math],PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Alternating Current,2000.0,D,1379172600,"[data structures, greedy, implementation]",PROGRAMMING
+344,Codeforces Round #200 (Div. 2),2,Read Time,2500.0,E,1379172600,"[binary search, two pointers]",PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Expecting Trouble,,A,1379086800,"[*special, probabilities]",PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Triskaidekaphobia,,B,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Counting Fridays,,C,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Chain Letter,,D,1379086800,"[*special, dfs and similar, graphs]",PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Black Cat Rush,,E,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Superstitions Inspection,,F,1379086800,[*special],PROGRAMMING
+345,"Friday the 13th, Programmers Day",12,Suffix Subgroup,,G,1379086800,"[*special, strings]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Divisors,500.0,A,1378540800,"[greedy, implementation]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Spies,1000.0,B,1378540800,"[brute force, greedy, implementation]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Cupboard and Balloons,1500.0,C,1378540800,[geometry],PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Dominoes,2000.0,D,1378540800,"[bitmasks, dfs and similar, dp]",PROGRAMMING
+342,Codeforces Round #199 (Div. 2),2,Xenia and Tree,2500.0,E,1378540800,"[data structures, divide and conquer, trees]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,The Wall,500.0,A,1377876600,[math],PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Maximal Area Quadrilateral,3000.0,B,1377876600,"[brute force, geometry]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Tourist Problem,2000.0,C,1377876600,"[combinatorics, implementation, math]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Bubble Sort Graph,2000.0,D,1377876600,"[binary search, data structures, dp]",PROGRAMMING
+340,Codeforces Round #198 (Div. 2),2,Iahub and Permutations,3000.0,E,1377876600,"[combinatorics, math]",PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Tourist Problem,500.0,A,1377876600,[math],PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Bubble Sort Graph,500.0,B,1377876600,"[binary search, data structures, dp]",PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Iahub and Permutations,1000.0,C,1377876600,"[combinatorics, dp, math]",PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Iahub and Xors,2500.0,D,1377876600,[data structures],PROGRAMMING
+341,Codeforces Round #198 (Div. 1),1,Candies Game,3000.0,E,1377876600,"[constructive algorithms, greedy]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Helpful Maths,500.0,A,1377531000,"[greedy, implementation, sortings, strings]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Xenia and Ringroad,1000.0,B,1377531000,[implementation],PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Xenia and Weights,1500.0,C,1377531000,"[constructive algorithms, dfs and similar, dp, greedy]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Xenia and Bit Operations,2000.0,D,1377531000,"[data structures, trees]",PROGRAMMING
+339,Codeforces Round #197 (Div. 2),2,Three Swaps,3000.0,E,1377531000,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Puzzles,500.0,A,1376668800,"[dp, graph matchings, greedy]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Routine Problem,1000.0,B,1376668800,"[greedy, math, number theory]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Quiz,1500.0,C,1376668800,"[binary search, greedy, math, matrices, number theory]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Book of Evil,2000.0,D,1376668800,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING
+337,Codeforces Round #196 (Div. 2),2,Divisor Tree,2500.0,E,1376668800,"[brute force, number theory, trees]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Quiz,500.0,A,1376668800,"[greedy, math, number theory]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Book of Evil,1000.0,B,1376668800,"[dfs and similar, dp, trees]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Divisor Tree,1500.0,C,1376668800,"[brute force, dp, number theory]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,GCD Table,2000.0,D,1376668800,"[chinese remainder theorem, math, number theory]",PROGRAMMING
+338,Codeforces Round #196 (Div. 1),1,Optimize!,2500.0,E,1376668800,[data structures],PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Triangle,500.0,A,1376062200,"[implementation, math]",PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Fly,1000.0,B,1376062200,[math],PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Sequence,1500.0,C,1376062200,"[brute force, greedy, implementation, number theory]",PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Beautiful Strings,2000.0,D,1376062200,"[combinatorics, math]",PROGRAMMING
+336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Painting Square,2500.0,E,1376062200,"[bitmasks, combinatorics, dp, implementation]",PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Banana,500.0,A,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Palindrome,1000.0,B,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,More Reclamation,1000.0,C,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Rectangles and Square,2000.0,D,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,Counting Skyscrapers,2500.0,E,1375549200,[],PROGRAMMING
+326,MemSQL start[c]up Round 2,12,"Buy One, Get One Free",3000.0,F,1375549200,[],PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Banana,500.0,A,1375549200,"[binary search, constructive algorithms, greedy]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Palindrome,1000.0,B,1375549200,"[constructive algorithms, dp]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,More Reclamation,1000.0,C,1375549200,[games],PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Rectangles and Square,2000.0,D,1375549200,"[brute force, dp]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,Counting Skyscrapers,2500.0,E,1375549200,"[dp, math, probabilities]",PROGRAMMING
+335,MemSQL start[c]up Round 2 - online version,12,"Buy One, Get One Free",3000.0,F,1375549200,"[dp, greedy]",PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Secrets,500.0,A,1374913800,[greedy],PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Chips,1000.0,B,1374913800,[greedy],PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Lucky Tickets,1500.0,C,1374913800,"[brute force, constructive algorithms]",PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Characteristics of Rectangles,2000.0,D,1374913800,"[binary search, bitmasks, brute force, implementation, sortings]",PROGRAMMING
+333,Codeforces Round #194 (Div. 1),1,Summer Earnings,2500.0,E,1374913800,"[binary search, bitmasks, brute force, geometry, sortings]",PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Candy Bags,500.0,A,1374913800,[implementation],PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Eight Point Sets,1000.0,B,1374913800,[sortings],PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Secrets,1500.0,C,1374913800,[math],PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Chips,2000.0,D,1374913800,"[greedy, implementation, two pointers]",PROGRAMMING
+334,Codeforces Round #194 (Div. 2),2,Lucky Tickets,2500.0,E,1374913800,[],PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Down the Hatch!,500.0,A,1374679800,[implementation],PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Maximum Absurdity,1000.0,B,1374679800,"[data structures, dp, implementation]",PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Students' Revenge,3000.0,C,1374679800,"[data structures, greedy, sortings]",PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Theft of Blueprints,3000.0,D,1374679800,"[graphs, math]",PROGRAMMING
+332,Codeforces Round #193 (Div. 2),2,Binary Key,3000.0,E,1374679800,"[dp, greedy, implementation]",PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Purification,500.0,A,1374327000,"[constructive algorithms, greedy]",PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Biridian Forest,1000.0,B,1374327000,"[dfs and similar, shortest paths]",PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Graph Reconstruction,1500.0,C,1374327000,[constructive algorithms],PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,The Evil Temple and the Moving Rocks,1500.0,D,1374327000,[constructive algorithms],PROGRAMMING
+329,Codeforces Round #192 (Div. 1),1,Evil,2500.0,E,1374327000,[math],PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Cakeminator,500.0,A,1374327000,"[brute force, implementation]",PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Road Construction,1000.0,B,1374327000,"[constructive algorithms, graphs]",PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Purification,1500.0,C,1374327000,[matrices],PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Biridian Forest,2000.0,D,1374327000,"[dfs and similar, implementation, shortest paths]",PROGRAMMING
+330,Codeforces Round #192 (Div. 2),2,Graph Reconstruction,2500.0,E,1374327000,[],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,30.0,A1,1374075000,"[brute force, implementation]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,70.0,A2,1374075000,"[data structures, sortings]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,30.0,B1,1374075000,[implementation],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,70.0,B2,1374075000,[data structures],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C1,1374075000,[dp],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C2,1374075000,[dp],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,60.0,C3,1374075000,[dp],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D1,1374075000,"[dfs and similar, implementation]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D2,1374075000,[graphs],PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,40.0,D3,1374075000,"[data structures, implementation, trees]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E1,1374075000,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E2,1374075000,"[constructive algorithms, dp]",PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,30.0,A1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,70.0,A2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,30.0,B1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,70.0,B2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,60.0,C3,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D2,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,40.0,D3,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E1,1374043200,[],PROGRAMMING
+324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E2,1374043200,[],PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Square and Rectangles,500.0,A,1373734800,[implementation],PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Stadium and Games,1000.0,B,1373734800,"[binary search, math]",PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Monsters and Diamonds,2000.0,C,1373734800,"[dfs and similar, shortest paths]",PROGRAMMING
+325,MemSQL start[c]up Round 1,12,Reclamation,2000.0,D,1373734800,[dsu],PROGRAMMING
+325,MemSQL start[c]up Round 1,12,The Red Button,2500.0,E,1373734800,"[combinatorics, dfs and similar, dsu, greedy]",PROGRAMMING
+328,Testing Round #8,12,IQ Test,500.0,A,1373662800,[implementation],PROGRAMMING
+328,Testing Round #8,12,Sheldon and Ice Pieces,500.0,B,1373662800,[greedy],PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Flipping Game,500.0,A,1372941000,"[brute force, dp, implementation]",PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Hungry Sequence,500.0,B,1372941000,[math],PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Magic Five,1500.0,C,1372941000,"[combinatorics, math]",PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Block Tower,2000.0,D,1372941000,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING
+327,Codeforces Round #191 (Div. 2),2,Axis Walking,3000.0,E,1372941000,"[bitmasks, combinatorics, constructive algorithms, dp, meet-in-the-middle]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Robot,500.0,A,1372433400,"[binary search, implementation, math]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Duel,1000.0,B,1372433400,"[dp, flows, greedy]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel the Commander,1500.0,C,1372433400,"[constructive algorithms, dfs and similar, divide and conquer, greedy, trees]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Flipboard,2000.0,D,1372433400,"[dp, greedy, math]",PROGRAMMING
+321,Codeforces Round #190 (Div. 1),1,Ciel and Gondolas,2500.0,E,1372433400,"[data structures, divide and conquer, dp]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Dancing,500.0,A,1372433400,[greedy],PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Flowers,1000.0,B,1372433400,"[combinatorics, math]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Robot,1500.0,C,1372433400,"[implementation, math, number theory]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel and Duel,2000.0,D,1372433400,"[dp, flows, greedy, two pointers]",PROGRAMMING
+322,Codeforces Round #190 (Div. 2),2,Ciel the Commander,2500.0,E,1372433400,[divide and conquer],PROGRAMMING
+323,Testing Round #7,12,Black-and-White Cube,500.0,A,1372363200,"[combinatorics, constructive algorithms]",PROGRAMMING
+323,Testing Round #7,12,Tournament-graph,1000.0,B,1372363200,[constructive algorithms],PROGRAMMING
+323,Testing Round #7,12,Two permutations,1500.0,C,1372363200,[data structures],PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Malek Dance Club,500.0,A,1371992400,"[combinatorics, math]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Psychos in a Line,1000.0,B,1371992400,"[data structures, implementation]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Kalila and Dimna in the Logging Industry,1500.0,C,1371992400,"[dp, geometry]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Have You Ever Heard About the Word?,2500.0,D,1371992400,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING
+319,Codeforces Round #189 (Div. 1),1,Ping-Pong,2500.0,E,1371992400,[data structures],PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Magic Numbers,500.0,A,1371992400,"[brute force, greedy]",PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Ping-Pong (Easy Version),1000.0,B,1371992400,"[dfs and similar, graphs]",PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Malek Dance Club,1500.0,C,1371992400,[math],PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Psychos in a Line,2000.0,D,1371992400,[data structures],PROGRAMMING
+320,Codeforces Round #189 (Div. 2),2,Kalila and Dimna in the Logging Industry,2500.0,E,1371992400,[dp],PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Perfect Pair,500.0,A,1371223800,[brute force],PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Ants,1000.0,B,1371223800,"[brute force, implementation]",PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Balance,2500.0,C,1371223800,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Game with Powers,1500.0,D,1371223800,"[dp, games]",PROGRAMMING
+317,Codeforces Round #188 (Div. 1),1,Princess and Her Shadow,3000.0,E,1371223800,"[constructive algorithms, shortest paths]",PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Even Odds,500.0,A,1371223800,[math],PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Strings of Power,500.0,B,1371223800,"[implementation, strings, two pointers]",PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Perfect Pair,1000.0,C,1371223800,"[greedy, math]",PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Ants,2500.0,D,1371223800,[dfs and similar],PROGRAMMING
+318,Codeforces Round #188 (Div. 2),2,Balance,3000.0,E,1371223800,"[constructive algorithms, dfs and similar]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Special Task,30.0,A1,1371042000,[greedy],PROGRAMMING
+316,ABBYY Cup 3.0,12,Special Task,70.0,A2,1371042000,[math],PROGRAMMING
+316,ABBYY Cup 3.0,12,EKG,30.0,B1,1371042000,"[brute force, dfs and similar]",PROGRAMMING
+316,ABBYY Cup 3.0,12,EKG,70.0,B2,1371042000,"[dfs and similar, dp]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Tidying Up,30.0,C1,1371042000,[flows],PROGRAMMING
+316,ABBYY Cup 3.0,12,Tidying Up,70.0,C2,1371042000,"[flows, graph matchings]",PROGRAMMING
+316,ABBYY Cup 3.0,12,PE Lesson,30.0,D1,1371042000,"[brute force, dp]",PROGRAMMING
+316,ABBYY Cup 3.0,12,PE Lesson,40.0,D2,1371042000,[dp],PROGRAMMING
+316,ABBYY Cup 3.0,12,PE Lesson,30.0,D3,1371042000,"[dp, math]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Summer Homework,30.0,E1,1371042000,"[brute force, data structures]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Summer Homework,40.0,E2,1371042000,"[data structures, math]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Summer Homework,30.0,E3,1371042000,"[data structures, math]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F1,1371042000,"[dfs and similar, implementation]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Suns and Rays,40.0,F2,1371042000,[],PROGRAMMING
+316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F3,1371042000,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Good Substrings,30.0,G1,1371042000,"[hashing, strings]",PROGRAMMING
+316,ABBYY Cup 3.0,12,Good Substrings,40.0,G2,1371042000,[string suffix structures],PROGRAMMING
+316,ABBYY Cup 3.0,12,Good Substrings,30.0,G3,1371042000,[string suffix structures],PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Contest,500.0,A,1370619000,[implementation],PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Periods,1000.0,B,1370619000,"[binary search, dfs and similar, strings]",PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Subsequences,1500.0,C,1370619000,"[data structures, dp]",PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Straight Lines,2000.0,D,1370619000,"[binary search, data structures, geometry, sortings, two pointers]",PROGRAMMING
+314,Codeforces Round #187 (Div. 1),1,Sereja and Squares,2500.0,E,1370619000,[dp],PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Bottles,500.0,A,1370619000,[brute force],PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Array,1000.0,B,1370619000,[implementation],PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Contest,1500.0,C,1370619000,"[dp, greedy, implementation]",PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Periods,2000.0,D,1370619000,"[dfs and similar, strings]",PROGRAMMING
+315,Codeforces Round #187 (Div. 2),2,Sereja and Subsequences,2500.0,E,1370619000,"[combinatorics, data structures]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Bank Account,500.0,A,1369927800,"[implementation, number theory]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Queries,1000.0,B,1369927800,"[dp, implementation]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Matrix,1500.0,C,1369927800,"[constructive algorithms, greedy, implementation, sortings]",PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Roads,2500.0,D,1369927800,[dp],PROGRAMMING
+313,Codeforces Round #186 (Div. 2),2,Ilya and Two Numbers,2500.0,E,1369927800,"[constructive algorithms, data structures, dsu, greedy]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,The Closest Pair,500.0,A,1369582200,"[constructive algorithms, implementation]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Cats Transport,1000.0,B,1369582200,"[data structures, dp]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Fetch the Treasure,1500.0,C,1369582200,"[brute force, data structures, shortest paths]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Interval Cubing,2000.0,D,1369582200,"[data structures, math]",PROGRAMMING
+311,Codeforces Round #185 (Div. 1),1,Biologist,2500.0,E,1369582200,[flows],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Whose sentence is it?,500.0,A,1369582200,[implementation],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Archer,1000.0,B,1369582200,"[math, probabilities]",PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,The Closest Pair,1500.0,C,1369582200,[constructive algorithms],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Cats Transport,2000.0,D,1369582200,[],PROGRAMMING
+312,Codeforces Round #185 (Div. 2),2,Fetch the Treasure,2500.0,E,1369582200,[],PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Strange Addition,500.0,A,1368968400,"[brute force, constructive algorithms]",PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Continued Fractions,1000.0,B,1368968400,"[brute force, math]",PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Ivan and Powers of Two,1500.0,C,1368968400,[],PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Olya and Graph,2000.0,D,1368968400,"[combinatorics, math]",PROGRAMMING
+305,Codeforces Round #184 (Div. 2),2,Playing with String,2500.0,E,1368968400,[games],PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Morning run,500.0,A,1368803400,"[binary search, math, two pointers]",PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Context Advertising,500.0,B,1368803400,[two pointers],PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Memory for Arrays,1000.0,C,1368803400,"[binary search, bitmasks, greedy]",PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Tennis Rackets,2000.0,D,1368803400,"[brute force, geometry]",PROGRAMMING
+309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Sheep,2500.0,E,1368803400,"[binary search, greedy]",PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Morning run,500.0,A,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Context Advertising,500.0,B,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Memory for Arrays,1000.0,C,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Tennis Rackets,2000.0,D,1368784800,[],PROGRAMMING
+308,Croc Champ 2013 - Finals,12,Sheep,2500.0,E,1368784800,[],PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Lucky Permutation Triple,500.0,A,1368363600,"[constructive algorithms, implementation, math]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Rectangle Puzzle II,500.0,B,1368363600,"[implementation, math]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Minimum Modular,2000.0,C,1368363600,"[brute force, math]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Rotatable Number,2500.0,D,1368363600,"[math, number theory]",PROGRAMMING
+303,Codeforces Round #183 (Div. 1),1,Random Ranking,3000.0,E,1368363600,[dp],PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Pythagorean Theorem II,500.0,A,1368363600,"[brute force, math]",PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Calendar,1000.0,B,1368363600,"[brute force, implementation]",PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Lucky Permutation Triple,1000.0,C,1368363600,[constructive algorithms],PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Rectangle Puzzle II,2000.0,D,1368363600,"[math, ternary search]",PROGRAMMING
+304,Codeforces Round #183 (Div. 2),2,Minimum Modular,3000.0,E,1368363600,[math],PROGRAMMING
+306,Testing Round #6,12,Candies,500.0,A,1368302400,[implementation],PROGRAMMING
+306,Testing Round #6,12,Optimizer,1000.0,B,1368302400,"[data structures, greedy, sortings]",PROGRAMMING
+306,Testing Round #6,12,"White, Black and White Again",1500.0,C,1368302400,"[combinatorics, number theory]",PROGRAMMING
+306,Testing Round #6,12,Polygon,2000.0,D,1368302400,"[constructive algorithms, geometry]",PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Sequence,500.0,A,1367769900,[constructive algorithms],PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Time,1000.0,B,1367769900,"[binary search, graphs, shortest paths]",PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Algorithm,1500.0,C,1367769900,[constructive algorithms],PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Divisors,2000.0,D,1367769900,[data structures],PROGRAMMING
+301,Codeforces Round #182 (Div. 1),1,Yaroslav and Arrangements,2500.0,E,1367769900,[dp],PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Eugeny and Array,500.0,A,1367769900,[implementation],PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Eugeny and Play List,1000.0,B,1367769900,"[binary search, implementation, two pointers]",PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Yaroslav and Sequence,1500.0,C,1367769900,[constructive algorithms],PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Yaroslav and Time,2000.0,D,1367769900,"[binary search, dfs and similar, dp, shortest paths]",PROGRAMMING
+302,Codeforces Round #182 (Div. 2),2,Yaroslav and Algorithm,2500.0,E,1367769900,[],PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Array,500.0,A,1366903800,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Coach,1000.0,B,1366903800,"[brute force, dfs and similar]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Beautiful Numbers,2000.0,C,1366903800,"[brute force, combinatorics]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Painting Square,3000.0,D,1366903800,"[dp, fft]",PROGRAMMING
+300,Codeforces Round #181 (Div. 2),2,Empire Strikes Back,3000.0,E,1366903800,"[binary search, math]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Weird Game,500.0,A,1366644900,"[games, greedy]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Distinct Paths,1500.0,B,1366644900,"[brute force, combinatorics]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Cube Problem,1500.0,C,1366644900,"[brute force, math, number theory]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Ksusha and Square,2000.0,D,1366644900,"[geometry, math, probabilities, two pointers]",PROGRAMMING
+293,Croc Champ 2013 - Round 2,12,Close Vertices,2500.0,E,1366644900,"[data structures, divide and conquer, trees]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha and Array,500.0,A,1366644600,"[brute force, number theory, sortings]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha the Squirrel,1000.0,B,1366644600,"[brute force, implementation]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Weird Game,1500.0,C,1366644600,"[games, greedy]",PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Distinct Paths,2500.0,D,1366644600,[],PROGRAMMING
+299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Cube Problem,2500.0,E,1366644600,[],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Parity Game,500.0,A,1366385400,[constructive algorithms],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Fish Weight,500.0,B,1366385400,"[constructive algorithms, greedy]",PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Splitting the Uniqueness,2000.0,C,1366385400,[constructive algorithms],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Color the Carpet,2500.0,D,1366385400,[constructive algorithms],PROGRAMMING
+297,Codeforces Round #180 (Div. 1),1,Mystic Carvings,3000.0,E,1366385400,[data structures],PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Snow Footprints,500.0,A,1366385400,"[greedy, implementation]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Sail,500.0,B,1366385400,"[brute force, greedy, implementation]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Parity Game,1500.0,C,1366385400,"[combinatorics, constructive algorithms, math, number theory]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Fish Weight,1500.0,D,1366385400,"[greedy, math, sortings]",PROGRAMMING
+298,Codeforces Round #180 (Div. 2),2,Splitting the Uniqueness,3000.0,E,1366385400,"[constructive algorithms, sortings]",PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,SMSC,1000.0,A,1366040100,[implementation],PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Network Topology,1000.0,B,1366040100,"[graphs, implementation]",PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Beautiful IP Addresses,1500.0,C,1366040100,[brute force],PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Connected Components,2000.0,D,1366040100,"[data structures, dfs and similar, dp, dsu]",PROGRAMMING
+292,Croc Champ 2013 - Round 1,12,Copying Data,2500.0,E,1366040100,[data structures],PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Spyke Talks,500.0,A,1365796800,"[implementation, sortings]",PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Command Line Arguments,1000.0,B,1365796800,"[implementation, strings]",PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Network Mask,1500.0,C,1365796800,"[brute force, implementation]",PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Parallel Programming,2000.0,D,1365796800,[greedy],PROGRAMMING
+291,Croc Champ 2013 - Qualification Round,12,Tree-String Problem,2500.0,E,1365796800,"[dfs and similar, hashing, strings]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Array,500.0,A,1365694200,"[data structures, implementation]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Graph,1000.0,B,1365694200,"[dp, graphs, shortest paths]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Friends,1500.0,C,1365694200,"[combinatorics, dp, graphs, shortest paths]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Greg and Caves,2000.0,D,1365694200,"[combinatorics, dp]",PROGRAMMING
+295,Codeforces Round #179 (Div. 1),1,Yaroslav and Points,2500.0,E,1365694200,[data structures],PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Yaroslav and Permutations,500.0,A,1365694200,"[greedy, math]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Yaroslav and Two Strings,1500.0,B,1365694200,"[combinatorics, dp]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Greg and Array,1500.0,C,1365694200,"[data structures, dp, implementation]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Greg and Graph,2000.0,D,1365694200,"[dp, graphs]",PROGRAMMING
+296,Codeforces Round #179 (Div. 2),2,Greg and Friends,2500.0,E,1365694200,"[combinatorics, dfs and similar, dp]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Oskols,500.0,A,1365348600,"[implementation, math]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Bookshelf,1000.0,B,1365348600,"[dp, greedy]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Lights,1500.0,C,1365348600,"[combinatorics, number theory]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass and Painter Robot,2000.0,D,1365348600,"[brute force, implementation, number theory]",PROGRAMMING
+294,Codeforces Round #178 (Div. 2),2,Shaass the Great,2500.0,E,1365348600,"[dp, trees]",PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Strings,500.0,A,1364916600,[greedy],PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Houses ,1000.0,B,1364916600,[combinatorics],PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and XOR operation,1500.0,C,1364916600,"[implementation, math]",PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Trees ,2000.0,D,1364916600,"[combinatorics, dfs and similar, trees]",PROGRAMMING
+288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Lucky Numbers,2500.0,E,1364916600,"[dp, implementation, math]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Segments ,500.0,A,1364916600,"[brute force, implementation]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Matrix,1000.0,B,1364916600,"[brute force, dp, implementation, sortings, ternary search]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Strings,1500.0,C,1364916600,"[constructive algorithms, implementation]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Houses ,2000.0,D,1364916600,"[brute force, combinatorics, dfs and similar, math]",PROGRAMMING
+289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and XOR operation,2500.0,E,1364916600,"[data structures, greedy, implementation, math]",PROGRAMMING
+290,April Fools Day Contest 2013,12,Mysterious strings,,A,1364830200,"[*special, implementation]",PROGRAMMING
+290,April Fools Day Contest 2013,12,QR code,,B,1364830200,"[*special, implementation]",PROGRAMMING
+290,April Fools Day Contest 2013,12,WTF?,,C,1364830200,"[*special, graph matchings, implementation, trees]",PROGRAMMING
+290,April Fools Day Contest 2013,12,Orange,,D,1364830200,"[*special, implementation]",PROGRAMMING
+290,April Fools Day Contest 2013,12,HQ,,E,1364830200,"[*special, constructive algorithms]",PROGRAMMING
+290,April Fools Day Contest 2013,12,Greedy Petya,,F,1364830200,"[*special, dfs and similar, graphs, greedy]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Lucky Permutation,500.0,A,1364025600,"[constructive algorithms, math]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Shifting,1500.0,B,1364025600,[implementation],PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Main Sequence,1500.0,C,1364025600,"[greedy, implementation]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Tourists,2000.0,D,1364025600,"[data structures, sortings]",PROGRAMMING
+286,Codeforces Round #176 (Div. 1),1,Ladies' Shop,2500.0,E,1364025600,"[constructive algorithms, fft, math]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,IQ Test,500.0,A,1364025600,"[brute force, implementation]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Pipeline,1500.0,B,1364025600,"[binary search, math]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Lucky Permutation,1500.0,C,1364025600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Shifting,2500.0,D,1364025600,[],PROGRAMMING
+287,Codeforces Round #176 (Div. 2),2,Main Sequence,2500.0,E,1364025600,"[data structures, greedy]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Slightly Decreasing Permutations,500.0,A,1363879800,"[greedy, implementation]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Find Marble,1000.0,B,1363879800,[implementation],PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Building Permutation,1500.0,C,1363879800,"[greedy, implementation, sortings]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Permutation Sum,2000.0,D,1363879800,"[bitmasks, combinatorics, dp, implementation, meet-in-the-middle]",PROGRAMMING
+285,Codeforces Round #175 (Div. 2),2,Positions in Permutations,2500.0,E,1363879800,"[combinatorics, dp, math]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cows and Sequence,1000.0,A,1363534200,"[constructive algorithms, implementation]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cow Program,1000.0,B,1363534200,"[dfs and similar, dp, graphs]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Coin Troubles,1500.0,C,1363534200,[dp],PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cows and Cool Sequences,2000.0,D,1363534200,"[dp, math, number theory]",PROGRAMMING
+283,Codeforces Round #174 (Div. 1),1,Cow Tennis Tournament,2500.0,E,1363534200,"[combinatorics, data structures, math]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cows and Primitive Roots,500.0,A,1363534200,"[implementation, math, number theory]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cows and Poker Game,1000.0,B,1363534200,"[brute force, implementation]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cows and Sequence,2000.0,C,1363534200,"[constructive algorithms, data structures, dp]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Cow Program,2000.0,D,1363534200,"[dfs and similar, dp]",PROGRAMMING
+284,Codeforces Round #174 (Div. 2),2,Coin Troubles,2500.0,E,1363534200,"[dfs and similar, dp]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Bit++,500.0,A,1363188600,[implementation],PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Painting Eggs,1000.0,B,1363188600,"[greedy, math]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,XOR and OR,1500.0,C,1363188600,"[constructive algorithms, implementation, math]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Yet Another Number Game,2000.0,D,1363188600,"[dp, games]",PROGRAMMING
+282,Codeforces Round #173 (Div. 2),2,Sausage Maximization,2500.0,E,1363188600,"[bitmasks, data structures, trees]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Rectangle Puzzle,500.0,A,1362929400,[geometry],PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Maximum Xor Secondary,1000.0,B,1362929400,"[data structures, implementation, two pointers]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Game on Tree,1500.0,C,1362929400,"[implementation, math, probabilities, trees]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,k-Maximum Subsequence Sum,2000.0,D,1362929400,"[data structures, flows]",PROGRAMMING
+280,Codeforces Round #172 (Div. 1),1,Sequence Transformation,2500.0,E,1362929400,"[data structures, dp, implementation, math]",PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Word Capitalization,500.0,A,1362929400,[strings],PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Nearest Fraction,1000.0,B,1362929400,"[brute force, implementation, two pointers]",PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Rectangle Puzzle,1500.0,C,1362929400,"[geometry, implementation]",PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Maximum Xor Secondary,2000.0,D,1362929400,[two pointers],PROGRAMMING
+281,Codeforces Round #172 (Div. 2),2,Game on Tree,2500.0,E,1362929400,[math],PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Point on Spiral,500.0,A,1362411000,"[brute force, geometry, implementation]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Books,1000.0,B,1362411000,"[binary search, brute force, implementation, two pointers]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Ladder,1500.0,C,1362411000,"[dp, implementation, two pointers]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,The Minimum Number of Variables,2000.0,D,1362411000,"[bitmasks, dp]",PROGRAMMING
+279,Codeforces Round #171 (Div. 2),2,Beautiful Decomposition,2000.0,E,1362411000,"[games, greedy]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Learning Languages,500.0,A,1362065400,"[dfs and similar, dsu]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Set of Points,1500.0,B,1362065400,"[constructive algorithms, geometry]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Game,2000.0,C,1362065400,"[games, implementation]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Google Code Jam,3000.0,D,1362065400,"[dp, probabilities]",PROGRAMMING
+277,Codeforces Round #170 (Div. 1),1,Binary Tree on Plane,2000.0,E,1362065400,[flows],PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Circle Line,500.0,A,1362065400,[implementation],PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,New Problem,1000.0,B,1362065400,"[brute force, strings]",PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Learning Languages,1000.0,C,1362065400,[dsu],PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Set of Points,3000.0,D,1362065400,"[constructive algorithms, geometry]",PROGRAMMING
+278,Codeforces Round #170 (Div. 2),2,Game,3000.0,E,1362065400,[games],PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Lunch Rush,500.0,A,1361719800,[implementation],PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Game,1000.0,B,1361719800,"[games, greedy]",PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum Sum,1500.0,C,1361719800,"[data structures, implementation, sortings]",PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum XOR,2000.0,D,1361719800,"[bitmasks, dp, greedy, implementation, math]",PROGRAMMING
+276,Codeforces Round #169 (Div. 2),2,Little Girl and Problem on Trees,2500.0,E,1361719800,"[data structures, trees]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,k-Multiple Free Set,500.0,A,1361374200,"[binary search, greedy, sortings]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,Zero Tree,1000.0,B,1361374200,"[dfs and similar, dp, greedy, trees]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,The Last Hole!,1500.0,C,1361374200,"[brute force, geometry]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,Lovely Matrix,2000.0,D,1361374200,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING
+274,Codeforces Round #168 (Div. 1),1,Mirror Room,2000.0,E,1361374200,"[data structures, implementation]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,Lights Out,500.0,A,1361374200,[implementation],PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,Convex Shape,1000.0,B,1361374200,"[constructive algorithms, implementation]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,k-Multiple Free Set,1500.0,C,1361374200,"[binary search, greedy, sortings]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,Zero Tree,2000.0,D,1361374200,"[dfs and similar, dp, trees]",PROGRAMMING
+275,Codeforces Round #168 (Div. 2),2,The Last Hole!,2500.0,E,1361374200,[],PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Friends,500.0,A,1360769400,"[implementation, math]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Sequence,1000.0,B,1360769400,"[implementation, math]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Staircase,1500.0,C,1360769400,"[data structures, implementation]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Two Sequences,2000.0,D,1360769400,"[combinatorics, math, sortings]",PROGRAMMING
+272,Codeforces Round #167 (Div. 2),2,Dima and Horses,2500.0,E,1360769400,"[combinatorics, constructive algorithms, graphs]",PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Staircase,500.0,A,1360769400,[],PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Two Sequences,1000.0,B,1360769400,[combinatorics],PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Horses,1500.0,C,1360769400,"[graphs, greedy]",PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Figure,2000.0,D,1360769400,[dp],PROGRAMMING
+273,Codeforces Round #167 (Div. 1),1,Dima and Game,2500.0,E,1360769400,"[dp, games]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Beautiful Year,500.0,A,1360596600,[brute force],PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Prime Matrix,1000.0,B,1360596600,"[binary search, brute force, math, number theory]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Secret,1500.0,C,1360596600,"[constructive algorithms, implementation]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Good Substrings,2000.0,D,1360596600,"[data structures, strings]",PROGRAMMING
+271,Codeforces Round #166 (Div. 2),2,Three Horses,3000.0,E,1360596600,"[constructive algorithms, math, number theory]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Magical Boxes,500.0,A,1359732600,"[greedy, math]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Greenhouse Effect,1000.0,B,1359732600,[dp],PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Flawed Flow,1500.0,C,1359732600,"[constructive algorithms, flows, graphs]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,Maximum Waterfall,2000.0,D,1359732600,"[data structures, dp]",PROGRAMMING
+269,Codeforces Round #165 (Div. 1),1,String Theory,2500.0,E,1359732600,[],PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Fancy Fence,500.0,A,1359732600,"[geometry, implementation, math]",PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Multithreading,1500.0,B,1359732600,"[data structures, greedy, implementation]",PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Magical Boxes,1500.0,C,1359732600,"[binary search, greedy, implementation, math, sortings]",PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Greenhouse Effect,2000.0,D,1359732600,[dp],PROGRAMMING
+270,Codeforces Round #165 (Div. 2),2,Flawed Flow,2500.0,E,1359732600,"[dfs and similar, sortings]",PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Games,500.0,A,1359387000,[brute force],PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Buttons,1000.0,B,1359387000,"[implementation, math]",PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Beautiful Sets of Points,1500.0,C,1359387000,"[constructive algorithms, implementation]",PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Wall Bars,2500.0,D,1359387000,[dp],PROGRAMMING
+268,Codeforces Round #164 (Div. 2),2,Playlist,2500.0,E,1359387000,"[math, probabilities, sortings]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,Stones on the Table,500.0,A,1358868600,[implementation],PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,Queue at the School,500.0,B,1358868600,"[constructive algorithms, graph matchings, implementation, shortest paths]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,Below the Diagonal,2500.0,C,1358868600,"[constructive algorithms, greedy, math]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,BerDonalds,3000.0,D,1358868600,"[graphs, math, shortest paths]",PROGRAMMING
+266,Codeforces Round #163 (Div. 2),2,More Queries to Array...,3000.0,E,1358868600,"[data structures, math]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Escape from Stones,500.0,A,1358686800,"[constructive algorithms, data structures, implementation, two pointers]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Good Sequences,1000.0,B,1358686800,"[dp, number theory]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Choosing Balls,1500.0,C,1358686800,[dp],PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Colorful Stones,2000.0,D,1358686800,"[dp, two pointers]",PROGRAMMING
+264,Codeforces Round #162 (Div. 1),1,Roadside Trees,2500.0,E,1358686800,"[data structures, dp]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Colorful Stones (Simplified Edition),500.0,A,1358686800,[implementation],PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Roadside Trees (Simplified Edition),1000.0,B,1358686800,"[greedy, implementation]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Escape from Stones,1500.0,C,1358686800,"[greedy, implementation]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Good Sequences,2000.0,D,1358686800,"[dp, number theory]",PROGRAMMING
+265,Codeforces Round #162 (Div. 2),2,Choosing Balls,2500.0,E,1358686800,"[schedules, sortings]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Beautiful Matrix,500.0,A,1358350200,[implementation],PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Squares,500.0,B,1358350200,"[greedy, implementation, sortings]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Circle of Numbers,2500.0,C,1358350200,"[dfs and similar, implementation]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Cycle in Graph,2000.0,D,1358350200,"[dfs and similar, graphs]",PROGRAMMING
+263,Codeforces Round #161 (Div. 2),2,Rhombus,3000.0,E,1358350200,"[brute force, data structures, dp]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Discounts,500.0,A,1358091000,"[greedy, sortings]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Restaurant,1000.0,B,1358091000,"[dp, math, probabilities]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Matrix,1500.0,C,1358091000,"[constructive algorithms, dp, math]",PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Increasing Subsequence,2000.0,D,1358091000,[dp],PROGRAMMING
+261,Codeforces Round #160 (Div. 1),1,Maxim and Calculator,2500.0,E,1358091000,"[brute force, dp, two pointers]",PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Roma and Lucky Numbers,500.0,A,1358091000,[implementation],PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Roma and Changing Signs,1000.0,B,1358091000,[greedy],PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Maxim and Discounts,1500.0,C,1358091000,"[greedy, sortings]",PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Maxim and Restaurant,2000.0,D,1358091000,"[combinatorics, dp]",PROGRAMMING
+262,Codeforces Round #160 (Div. 2),2,Maxim and Matrix,2500.0,E,1358091000,[dp],PROGRAMMING
+267,Codeforces Testing Round #5,12,Subtractions,500.0,A,1358002800,"[math, number theory]",PROGRAMMING
+267,Codeforces Testing Round #5,12,Dominoes,1000.0,B,1358002800,"[dfs and similar, graphs]",PROGRAMMING
+267,Codeforces Testing Round #5,12,Berland Traffic,1500.0,C,1358002800,"[math, matrices]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Sockets,500.0,A,1357659000,"[greedy, implementation, sortings]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Playing Cubes,500.0,B,1357659000,"[games, greedy, implementation]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,View Angle,1500.0,C,1357659000,"[brute force, geometry, math]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Sum,2000.0,D,1357659000,"[greedy, math]",PROGRAMMING
+257,Codeforces Round #159 (Div. 2),2,Greedy Elevator,3000.0,E,1357659000,"[data structures, implementation]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Adding Digits,500.0,A,1356622500,"[implementation, math]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Ancient Prophesy,1000.0,B,1356622500,"[brute force, implementation, strings]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Balls and Boxes,1500.0,C,1356622500,"[greedy, implementation]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Black and White Tree,2000.0,D,1356622500,"[constructive algorithms, dsu, graphs, greedy, trees]",PROGRAMMING
+260,Codeforces Round #158 (Div. 2),2,Dividing Kingdom,2500.0,E,1356622500,"[binary search, brute force, data structures]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Bits,500.0,A,1356190200,"[greedy, math]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Elections,1000.0,B,1356190200,"[brute force, combinatorics, dp]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and LCM,1500.0,C,1356190200,"[binary search, combinatorics, dp, math]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Broken Sorting,2000.0,D,1356190200,"[dp, math, probabilities]",PROGRAMMING
+258,Codeforces Round #157 (Div. 1),1,Little Elephant and Tree,2500.0,E,1356190200,"[data structures, dfs and similar, trees]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Chess,500.0,A,1356190200,"[brute force, strings]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Magic Square,1000.0,B,1356190200,"[brute force, implementation]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Bits,1500.0,C,1356190200,"[greedy, strings]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and Elections,2000.0,D,1356190200,"[brute force, combinatorics, dp, math]",PROGRAMMING
+259,Codeforces Round #157 (Div. 2),2,Little Elephant and LCM,2500.0,E,1356190200,"[binary search, combinatorics, math]",PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Almost Arithmetical Progression,500.0,A,1355671800,"[binary search, dp, two pointers]",PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Mr. Bender and Square,1000.0,B,1355671800,"[binary search, brute force, math]",PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Furlo and Rublo and Game,1500.0,C,1355671800,[games],PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Liars and Serge,2000.0,D,1355671800,[dp],PROGRAMMING
+256,Codeforces Round #156 (Div. 1),1,Lucky Arrays,2500.0,E,1355671800,[data structures],PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Greg's Workout,500.0,A,1355671800,[implementation],PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Code Parsing,1000.0,B,1355671800,[implementation],PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Almost Arithmetical Progression,1500.0,C,1355671800,"[brute force, dp]",PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Mr. Bender and Square,2000.0,D,1355671800,"[binary search, implementation, math]",PROGRAMMING
+255,Codeforces Round #156 (Div. 2),2,Furlo and Rublo and Game,2500.0,E,1355671800,"[games, implementation, math]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Cards with Numbers,500.0,A,1355047200,"[constructive algorithms, sortings]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Jury Size,1000.0,B,1355047200,"[brute force, implementation]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Anagram,1500.0,C,1355047200,[greedy],PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Rats,2000.0,D,1355047200,"[brute force, dfs and similar, implementation]",PROGRAMMING
+254,Codeforces Round #155 (Div. 2),2,Dormitory,2500.0,E,1355047200,"[dp, implementation]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Boys and Girls,500.0,A,1354960800,[greedy],PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Physics Practical,1000.0,B,1354960800,"[binary search, dp, two pointers]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Text Editor,1500.0,C,1354960800,"[data structures, dfs and similar, greedy, shortest paths]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Table with Letters - 2,2000.0,D,1354960800,"[brute force, two pointers]",PROGRAMMING
+253,Codeforces Round #154 (Div. 2),2,Printer,2500.0,E,1354960800,"[binary search, data structures, implementation, sortings]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Points on Line,500.0,A,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Playing with Permutations,1000.0,B,1354807800,"[implementation, math]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Number Transformation,1500.0,C,1354807800,"[dp, greedy, number theory]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Two Sets,2000.0,D,1354807800,"[bitmasks, math]",PROGRAMMING
+251,Codeforces Round #153 (Div. 1),1,Tree and Table,2500.0,E,1354807800,"[dfs and similar, dp, implementation, trees]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Little Xor,500.0,A,1354807800,"[brute force, implementation]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Unsorting Array,1000.0,B,1354807800,"[brute force, sortings]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Points on Line,1500.0,C,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Playing with Permutations,2000.0,D,1354807800,"[brute force, combinatorics, implementation]",PROGRAMMING
+252,Codeforces Round #153 (Div. 2),2,Number Transformation,2500.0,E,1354807800,"[dp, number theory]",PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Paper Work,500.0,A,1353938400,[greedy],PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Restoring IPv6,1000.0,B,1353938400,"[implementation, strings]",PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Movie Critics,1500.0,C,1353938400,[greedy],PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Building Bridge,1500.0,D,1353938400,"[geometry, ternary search, two pointers]",PROGRAMMING
+250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Mad Joe,2000.0,E,1353938400,[brute force],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Paper Work,500.0,A,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Restoring IPv6,1000.0,B,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Movie Critics,1500.0,C,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Building Bridge,1500.0,D,1353927300,[],PROGRAMMING
+247,"CROC-MBTU 2012, Final Round",12,Mad Joe,2000.0,E,1353927300,[],PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Cupboards,500.0,A,1353857400,[implementation],PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Chilly Willy,1000.0,B,1353857400,"[math, number theory]",PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Robo-Footballer,2000.0,C,1353857400,"[binary search, geometry]",PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Sweets for Everyone!,2000.0,D,1353857400,"[binary search, greedy, implementation]",PROGRAMMING
+248,Codeforces Round #152 (Div. 2),2,Piglet's Birthday,2500.0,E,1353857400,"[dp, probabilities]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Robo-Footballer,1000.0,A,1353857400,[geometry],PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Sweets for Everyone!,1000.0,B,1353857400,"[binary search, greedy]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Piglet's Birthday,1500.0,C,1353857400,"[dp, probabilities]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Donkey and Stars,1500.0,D,1353857400,"[data structures, dp, math, sortings]",PROGRAMMING
+249,Codeforces Round #152 (Div. 1),1,Endless Matrix,2500.0,E,1353857400,[math],PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Buggy Sorting,500.0,A,1353511800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Increase and Decrease,1000.0,B,1353511800,"[greedy, math]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Beauty Pageant,1500.0,C,1353511800,"[brute force, constructive algorithms, greedy]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Colorful Graph,2000.0,D,1353511800,"[brute force, dfs and similar, graphs]",PROGRAMMING
+246,Codeforces Round #151 (Div. 2),2,Blood Cousins Return,2500.0,E,1353511800,"[binary search, data structures, dfs and similar, dp, sortings]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,System Administrator,,A,1353339000,[implementation],PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Internet Address,,B,1353339000,"[implementation, strings]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Game with Coins,,C,1353339000,[greedy],PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Restoring Table,,D,1353339000,"[constructive algorithms, greedy]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Mishap in Club,,E,1353339000,[implementation],PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Log Stream Analysis,,F,1353339000,"[binary search, brute force, implementation, strings]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Suggested Friends,,G,1353339000,"[brute force, graphs]",PROGRAMMING
+245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Queries for Number of Palindromes,,H,1353339000,"[dp, hashing, strings]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,The Brand New Function,500.0,A,1353079800,[bitmasks],PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Hydra,1000.0,B,1353079800,"[graphs, sortings]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Colorado Potato Beetle,1500.0,C,1353079800,"[dfs and similar, implementation]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Cubes,2000.0,D,1353079800,"[data structures, dp, geometry, two pointers]",PROGRAMMING
+243,Codeforces Round #150 (Div. 1),1,Matrix,2500.0,E,1353079800,[data structures],PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Dividing Orange,500.0,A,1353079800,[implementation],PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Undoubtedly Lucky Numbers,1000.0,B,1353079800,"[bitmasks, brute force, dfs and similar]",PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,The Brand New Function,1500.0,C,1353079800,"[bitmasks, divide and conquer, math]",PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Hydra,2000.0,D,1353079800,[],PROGRAMMING
+244,Codeforces Round #150 (Div. 2),2,Colorado Potato Beetle,2500.0,E,1353079800,[],PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,Heads or Tails,500.0,A,1352647800,"[brute force, implementation]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,Big Segment,1000.0,B,1352647800,"[implementation, sortings]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,King's Path,1500.0,C,1352647800,"[dfs and similar, hashing, shortest paths]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,Dispute,2000.0,D,1352647800,"[dfs and similar, greedy]",PROGRAMMING
+242,Codeforces Round #149 (Div. 2),2,XOR on Segment,2500.0,E,1352647800,"[bitmasks, data structures]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Not Wool Sequences,500.0,A,1352044800,"[constructive algorithms, math]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Boring Partition,1000.0,B,1352044800,[constructive algorithms],PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,World Eater Brothers,1500.0,C,1352044800,"[dfs and similar, dp, greedy, trees]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Tape Programming,2000.0,D,1352044800,"[data structures, implementation]",PROGRAMMING
+238,Codeforces Round #148 (Div. 1),1,Meeting Her,2500.0,E,1352044800,"[dp, graphs, shortest paths]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Two Bags of Potatoes,500.0,A,1352044800,"[greedy, implementation, math]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Easy Tape Programming,1000.0,B,1352044800,"[brute force, implementation]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Not Wool Sequences,1500.0,C,1352044800,"[combinatorics, constructive algorithms, math]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,Boring Partition,2000.0,D,1352044800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+239,Codeforces Round #148 (Div. 2),2,World Eater Brothers,2500.0,E,1352044800,[],PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Old Peykan,,A,1351783800,[greedy],PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Friends,,B,1351783800,"[binary search, bitmasks, data structures, math]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Mirror Box,,C,1351783800,"[geometry, implementation]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Numbers,,D,1351783800,[],PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Flights,,E,1351783800,"[graphs, shortest paths]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Race,,F,1351783800,"[brute force, implementation]",PROGRAMMING
+241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Challenging Balloons,,G,1351783800,[constructive algorithms],PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Free Cash,500.0,A,1351179000,[implementation],PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Young Table,1000.0,B,1351179000,"[implementation, sortings]",PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Primes on Interval,1500.0,C,1351179000,"[binary search, number theory, two pointers]",PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,T-decomposition,2000.0,D,1351179000,"[dfs and similar, graphs, greedy]",PROGRAMMING
+237,Codeforces Round #147 (Div. 2),2,Build String,2500.0,E,1351179000,"[flows, graphs]",PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,LCM Challenge,500.0,A,1350803400,[number theory],PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Let's Play Osu!,1000.0,B,1350803400,"[dp, math, probabilities]",PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Cyclical Quest,1500.0,C,1350803400,"[string suffix structures, strings]",PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Graph Game,2000.0,D,1350803400,[graphs],PROGRAMMING
+235,Codeforces Round #146 (Div. 1),1,Number Challenge,2500.0,E,1350803400,"[combinatorics, dp, implementation, number theory]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Boy or Girl,500.0,A,1350803400,[implementation],PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Easy Number Challenge,1000.0,B,1350803400,"[implementation, number theory]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,LCM Challenge,1500.0,C,1350803400,"[greedy, number theory]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Let's Play Osu!,2000.0,D,1350803400,"[dp, probabilities]",PROGRAMMING
+236,Codeforces Round #146 (Div. 2),2,Cyclical Quest,2500.0,E,1350803400,[],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Lefthanders and Righthanders ,,A,1350370800,[implementation],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Reading,,B,1350370800,[sortings],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Weather,,C,1350370800,"[dp, implementation]",PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Cinema,,D,1350370800,[implementation],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Champions' League,,E,1350370800,[implementation],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Fence,,F,1350370800,[dp],PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Practice,,G,1350370800,"[constructive algorithms, divide and conquer, implementation]",PROGRAMMING
+234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Merging Two Decks,,H,1350370800,"[constructive algorithms, greedy]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Cinema,,A,1350370800,[implementation],PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Fence,,B,1350370800,[dp],PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Practice,,C,1350370800,"[constructive algorithms, implementation]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Merging Two Decks,,D,1350370800,"[constructive algorithms, greedy]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Road Repairs,,E,1350370800,"[dfs and similar, graphs, greedy]",PROGRAMMING
+240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,TorCoder,,F,1350370800,[data structures],PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Cycles,500.0,A,1349969400,"[binary search, constructive algorithms, graphs, greedy]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Table,1000.0,B,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Doe Graphs,1500.0,C,1349969400,"[constructive algorithms, divide and conquer, dp, graphs, shortest paths]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Fence,2000.0,D,1349969400,"[binary search, data structures, string suffix structures]",PROGRAMMING
+232,Codeforces Round #144 (Div. 1),1,Quick Tortoise,2500.0,E,1349969400,"[bitmasks, divide and conquer, dp]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Perfect Permutation,500.0,A,1349969400,"[implementation, math]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Non-square Equation,1000.0,B,1349969400,"[binary search, brute force, math]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Cycles,1500.0,C,1349969400,"[combinatorics, graphs, matrices]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Table,2000.0,D,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING
+233,Codeforces Round #144 (Div. 2),2,Doe Graphs,2500.0,E,1349969400,[],PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,Team,500.0,A,1349623800,"[brute force, greedy]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,"Magic, Wizardry and Wonders",1000.0,B,1349623800,"[constructive algorithms, greedy]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,To Add or Not to Add,1500.0,C,1349623800,"[binary search, sortings, two pointers]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,Magic Box,2000.0,D,1349623800,"[brute force, geometry]",PROGRAMMING
+231,Codeforces Round #143 (Div. 2),2,Cactus,2500.0,E,1349623800,"[data structures, dfs and similar, dp, graphs, trees]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Shifts,500.0,A,1349105400,"[brute force, two pointers]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Planets,500.0,B,1349105400,"[binary search, data structures, shortest paths]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Triangles,1000.0,C,1349105400,"[combinatorics, graphs, math]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Towers,1000.0,D,1349105400,"[dp, greedy, two pointers]",PROGRAMMING
+229,Codeforces Round #142 (Div. 1),1,Gifts,3000.0,E,1349105400,"[combinatorics, dp, probabilities]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Dragons,500.0,A,1349105400,"[greedy, sortings]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,T-primes,500.0,B,1349105400,"[implementation, math, number theory]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Shifts,1500.0,C,1349105400,"[binary search, data structures, dp, implementation]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Planets,2500.0,D,1349105400,"[binary search, graphs, shortest paths]",PROGRAMMING
+230,Codeforces Round #142 (Div. 2),2,Triangles,3000.0,E,1349105400,"[combinatorics, graphs, math]",PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Is your horseshoe on the other hoof?,500.0,A,1348759800,[implementation],PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Two Tables,1000.0,B,1348759800,"[brute force, implementation]",PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Fractal Detector,1500.0,C,1348759800,"[dp, hashing]",PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,Zigzag,2000.0,D,1348759800,[data structures],PROGRAMMING
+228,Codeforces Round #141 (Div. 2),2,The Road to Berland is Paved With Good Intentions,2500.0,E,1348759800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Flying Saucer Segments,500.0,A,1348500600,[math],PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Naughty Stone Piles,1000.0,B,1348500600,[greedy],PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Anniversary,1500.0,C,1348500600,"[data structures, implementation, math, matrices, number theory]",PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,The table,2000.0,D,1348500600,"[constructive algorithms, greedy]",PROGRAMMING
+226,Codeforces Round #140 (Div. 1),1,Noble Knight's Path,2500.0,E,1348500600,"[data structures, trees]",PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Where do I Turn?,500.0,A,1348500600,[geometry],PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Effective Approach,1000.0,B,1348500600,[implementation],PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Flying Saucer Segments,1500.0,C,1348500600,[math],PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Naughty Stone Piles,2000.0,D,1348500600,"[math, sortings]",PROGRAMMING
+227,Codeforces Round #140 (Div. 2),2,Anniversary,2500.0,E,1348500600,"[matrices, number theory]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Dice Tower,500.0,A,1348069500,"[constructive algorithms, greedy]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Well-known Numbers,1000.0,B,1348069500,"[binary search, greedy, number theory]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Barcode,1500.0,C,1348069500,"[dp, matrices]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Snake,3000.0,D,1348069500,"[bitmasks, dfs and similar, graphs, implementation]",PROGRAMMING
+225,Codeforces Round #139 (Div. 2),2,Unsolvable,3000.0,E,1348069500,"[math, number theory]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Bracket Sequence,500.0,A,1347809400,"[data structures, expression parsing, implementation]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Two Strings,1000.0,B,1347809400,"[data structures, dp, strings]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Partial Sums,1500.0,C,1347809400,"[combinatorics, math]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Spider,2000.0,D,1347809400,"[geometry, graphs]",PROGRAMMING
+223,Codeforces Round #138 (Div. 1),1,Planar Graph,2500.0,E,1347809400,"[flows, geometry, graphs]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Parallelepiped,500.0,A,1347809400,"[brute force, math]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Array,1000.0,B,1347809400,"[bitmasks, implementation, two pointers]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Bracket Sequence,1500.0,C,1347809400,[data structures],PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Two Strings,2000.0,D,1347809400,"[data structures, strings]",PROGRAMMING
+224,Codeforces Round #138 (Div. 2),2,Partial Sums,2500.0,E,1347809400,"[combinatorics, math]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Shooshuns and Sequence ,500.0,A,1347291900,"[brute force, implementation]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Cosmic Tables,1000.0,B,1347291900,[implementation],PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Reducing Fractions,1500.0,C,1347291900,"[implementation, number theory, sortings]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Olympiad,2000.0,D,1347291900,"[binary search, greedy, sortings, two pointers]",PROGRAMMING
+222,Codeforces Round #137 (Div. 2),2,Decoding Genome,2500.0,E,1347291900,[matrices],PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Problem,500.0,A,1346427000,"[implementation, sortings]",PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Array,1000.0,B,1346427000,"[constructive algorithms, data structures]",PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Shifts,1500.0,C,1346427000,[data structures],PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Triangle,2000.0,D,1346427000,"[chinese remainder theorem, geometry, math]",PROGRAMMING
+220,Codeforces Round #136 (Div. 1),1,Little Elephant and Inversions,2500.0,E,1346427000,"[data structures, two pointers]",PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Function,500.0,A,1346427000,"[implementation, math]",PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Numbers,1000.0,B,1346427000,[implementation],PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Problem,1500.0,C,1346427000,[sortings],PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Array,2000.0,D,1346427000,[data structures],PROGRAMMING
+221,Codeforces Round #136 (Div. 2),2,Little Elephant and Shifts,2500.0,E,1346427000,[],PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,k-String,500.0,A,1346081400,"[implementation, strings]",PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Special Offer! Super Price 999 Bourles!,1000.0,B,1346081400,[implementation],PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Color Stripe,1500.0,C,1346081400,"[brute force, dp, greedy]",PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Choosing Capital for Treeland,2000.0,D,1346081400,"[dfs and similar, dp, trees]",PROGRAMMING
+219,Codeforces Round #135 (Div. 2),2,Parking Lot,3000.0,E,1346081400,[data structures],PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Ice Skating,500.0,A,1345273500,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Blackboard Fibonacci,1000.0,B,1345273500,"[brute force, math]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Formurosa,2500.0,C,1345273500,"[divide and conquer, dp, expression parsing]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Bitonix' Patrol,3000.0,D,1345273500,"[bitmasks, brute force, combinatorics, dfs and similar, math]",PROGRAMMING
+217,Codeforces Round #134 (Div. 1),1,Alien DNA,3000.0,E,1345273500,"[data structures, dsu, trees]",PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Mountain Scenery,500.0,A,1345273500,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Airport,500.0,B,1345273500,[implementation],PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Ice Skating,1000.0,C,1345273500,"[dfs and similar, dsu, graphs]",PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Blackboard Fibonacci,3000.0,D,1345273500,[implementation],PROGRAMMING
+218,Codeforces Round #134 (Div. 2),2,Formurosa,3000.0,E,1345273500,[],PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Tiling with Hexagons,500.0,A,1344958200,"[implementation, math]",PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Forming Teams,1500.0,B,1344958200,"[dfs and similar, implementation]",PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Hiring Staff,2000.0,C,1344958200,[greedy],PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Spider's Web,2000.0,D,1344958200,"[binary search, sortings, two pointers]",PROGRAMMING
+216,Codeforces Round #133 (Div. 2),2,Martian Luck,3000.0,E,1344958200,"[math, number theory]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Bicycle Chain,500.0,A,1344267000,"[brute force, implementation]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Olympic Medal,500.0,B,1344267000,"[greedy, math]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Crosses,3000.0,C,1344267000,"[brute force, implementation]",PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Hot Days,2000.0,D,1344267000,[greedy],PROGRAMMING
+215,Codeforces Round #132 (Div. 2),2,Periodical Numbers,3000.0,E,1344267000,"[combinatorics, dp, number theory]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Game,1000.0,A,1343662200,"[dfs and similar, greedy]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Numbers,1000.0,B,1343662200,"[combinatorics, dp]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Relay Race,1500.0,C,1343662200,[dp],PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Stars,2000.0,D,1343662200,"[constructive algorithms, geometry]",PROGRAMMING
+213,Codeforces Round #131 (Div. 1),1,Two Permutations,2500.0,E,1343662200,"[data structures, hashing, strings]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,System of Equations,500.0,A,1343662200,[brute force],PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Hometask,1000.0,B,1343662200,"[brute force, constructive algorithms, greedy, math]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Game,2000.0,C,1343662200,"[brute force, greedy]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Numbers,2000.0,D,1343662200,"[combinatorics, dp, math]",PROGRAMMING
+214,Codeforces Round #131 (Div. 2),2,Relay Race,2500.0,E,1343662200,[dp],PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Dubstep,500.0,A,1343057400,[strings],PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Solitaire,2000.0,B,1343057400,"[dfs and similar, dp]",PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Police Station,2500.0,C,1343057400,"[dp, graphs, shortest paths]",PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,"Prizes, Prizes, more Prizes",500.0,D,1343057400,[implementation],PROGRAMMING
+208,Codeforces Round #130 (Div. 2),2,Blood Cousins,3000.0,E,1343057400,"[binary search, data structures, dfs and similar, trees]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Privatization,3000.0,A,1342450800,"[flows, graphs]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Polycarpus is Looking for Good Substrings,2000.0,B,1342450800,"[bitmasks, hashing, implementation]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Cowboys,1500.0,C,1342450800,"[dp, math]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,Cutting a Fence,2500.0,D,1342450800,"[binary search, data structures, dsu]",PROGRAMMING
+212,VK Cup 2012 Finals (unofficial online-version),12,IT Restaurants,500.0,E,1342450800,"[dfs and similar, dp, trees]",PROGRAMMING
+211,VK Cup 2012 Finals,12,Privatization,3000.0,A,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,Polycarpus is Looking for Good Substrings,1000.0,B,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,Cowboys,500.0,C,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,Cutting a Fence,1000.0,D,1342335600,[],PROGRAMMING
+211,VK Cup 2012 Finals,12,IT Restaurants,500.0,E,1342335600,[],PROGRAMMING
+209,"VK Cup 2012 Finals, Practice Session",12,Multicolored Marbles,500.0,A,1342252500,"[dp, math]",PROGRAMMING
+209,"VK Cup 2012 Finals, Practice Session",12,Pixels,500.0,B,1342252500,"[constructive algorithms, math]",PROGRAMMING
+209,"VK Cup 2012 Finals, Practice Session",12,Trails and Glades,1000.0,C,1342252500,"[constructive algorithms, dsu, graphs, greedy]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Interval,500.0,A,1342020600,"[binary search, combinatorics, dp]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Cards,500.0,B,1342020600,"[binary search, data structures]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Furik and Rubik,1500.0,C,1342020600,"[math, probabilities]",PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Retro Strings,2000.0,D,1342020600,[dp],PROGRAMMING
+204,Codeforces Round #129 (Div. 1),1,Little Elephant and Strings,2500.0,E,1342020600,"[data structures, implementation, string suffix structures, two pointers]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Rozdil,500.0,A,1342020600,"[brute force, implementation]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Sorting,1000.0,B,1342020600,"[brute force, greedy]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Interval,1500.0,C,1342020600,"[binary search, brute force, combinatorics, dp, math]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Cards,1500.0,D,1342020600,"[binary search, brute force, sortings]",PROGRAMMING
+205,Codeforces Round #129 (Div. 2),2,Little Elephant and Furik and Rubik,2500.0,E,1342020600,"[brute force, combinatorics, probabilities]",PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,20.0,A1,1341730800,[greedy],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,30.0,A2,1341730800,[greedy],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,50.0,A3,1341730800,[greedy],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,20.0,B1,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,30.0,B2,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,50.0,B3,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,20.0,C1,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,30.0,C2,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,50.0,C3,1341730800,[data structures],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D1,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D10,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D2,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D3,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D4,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D5,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D6,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D7,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D8,1341730800,[],PROGRAMMING
+207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D9,1341730800,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,20.0,A1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,30.0,A2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,50.0,A3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Military Trainings,20.0,B1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Military Trainings,30.0,B2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Military Trainings,50.0,B3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,20.0,C1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,30.0,C2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,50.0,C3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D1,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D10,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D2,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D3,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D4,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D5,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D6,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D7,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D8,1341576900,[],PROGRAMMING
+206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D9,1341576900,[],PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Two Problems,500.0,A,1341329400,"[brute force, implementation]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Game on Paper,1000.0,B,1341329400,"[brute force, implementation]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Photographer,1500.0,C,1341329400,"[greedy, sortings]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Hit Ball,2000.0,D,1341329400,"[geometry, implementation, math]",PROGRAMMING
+203,Codeforces Round #128 (Div. 2),2,Transportation,2500.0,E,1341329400,"[greedy, sortings, two pointers]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Clear Symmetry,1000.0,A,1340983800,"[constructive algorithms, dp, math]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Guess That Car!,1000.0,B,1340983800,"[math, ternary search]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Fragile Bridges,1500.0,C,1340983800,[dp],PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Brand New Problem,2000.0,D,1340983800,"[bitmasks, brute force, dp]",PROGRAMMING
+201,Codeforces Round #127 (Div. 1),1,Thoroughly Bureaucratic Organization,2500.0,E,1340983800,"[binary search, combinatorics]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,LLPS,500.0,A,1340983800,"[binary search, bitmasks, brute force, greedy, implementation, strings]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Brand New Easy Problem,1000.0,B,1340983800,[brute force],PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Clear Symmetry,2000.0,C,1340983800,"[binary search, math]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Guess That Car!,2000.0,D,1340983800,"[dp, math]",PROGRAMMING
+202,Codeforces Round #127 (Div. 2),2,Fragile Bridges,2500.0,E,1340983800,"[data structures, dp]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Cinema,3000.0,A,1340551800,"[brute force, data structures]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Drinks,500.0,B,1340551800,"[implementation, math]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Football Championship,2000.0,C,1340551800,"[brute force, implementation]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Programming Language,1500.0,D,1340551800,"[binary search, brute force, expression parsing, implementation]",PROGRAMMING
+200,Codeforces Round #126 (Div. 2),2,Tractor College,3000.0,E,1340551800,"[implementation, math, number theory, ternary search]",PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,About Bacteria,500.0,A,1340379000,"[implementation, math]",PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Jumping on Walls,1000.0,B,1340379000,[shortest paths],PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Delivering Carcinogen,1500.0,C,1340379000,"[binary search, geometry]",PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Cube Snake,2000.0,D,1340379000,[constructive algorithms],PROGRAMMING
+198,Codeforces Round #125 (Div. 1),1,Gripping Story,2500.0,E,1340379000,"[binary search, data structures, sortings]",PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Hexadecimal's theorem,500.0,A,1340379000,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Special Olympics,1000.0,B,1340379000,[geometry],PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,About Bacteria,1500.0,C,1340379000,[math],PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Jumping on Walls,2000.0,D,1340379000,"[dfs and similar, shortest paths]",PROGRAMMING
+199,Codeforces Round #125 (Div. 2),2,Delivering Carcinogen,2500.0,E,1340379000,"[binary search, geometry]",PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Lexicographically Maximum Subsequence,500.0,A,1339506000,[greedy],PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Infinite Maze,1000.0,B,1339506000,[dfs and similar],PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Paint Tree,1500.0,C,1339506000,"[divide and conquer, geometry, sortings, trees]",PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,The Next Good String,3000.0,D,1339506000,"[data structures, greedy, hashing, strings]",PROGRAMMING
+196,Codeforces Round #124 (Div. 1),1,Opening Portals,2500.0,E,1339506000,"[dsu, graphs, shortest paths]",PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Plate Game,1000.0,A,1339506000,"[constructive algorithms, games, math]",PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Limit,500.0,B,1339506000,[math],PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Lexicographically Maximum Subsequence,500.0,C,1339506000,"[greedy, implementation, sortings]",PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Infinite Maze,3000.0,D,1339506000,[hashing],PROGRAMMING
+197,Codeforces Round #124 (Div. 2),2,Paint Tree,3000.0,E,1339506000,"[constructive algorithms, dfs and similar, geometry]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Let's Watch Football,500.0,A,1339342200,"[binary search, brute force, math]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,After Training,1000.0,B,1339342200,"[data structures, implementation, math]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Try and Catch,1500.0,C,1339342200,"[expression parsing, implementation]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Analyzing Polyline,2000.0,D,1339342200,"[math, sortings]",PROGRAMMING
+195,Codeforces Round #123 (Div. 2),2,Building Forest,2500.0,E,1339342200,"[data structures, dsu]",PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Cutting Figure,500.0,A,1338737400,"[2-sat, chinese remainder theorem, trees]",PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Xor,1000.0,B,1338737400,[brute force],PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Hamming Distance,2000.0,C,1338737400,"[constructive algorithms, greedy, math, matrices]",PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Two Segments,2000.0,D,1338737400,[data structures],PROGRAMMING
+193,Codeforces Round #122 (Div. 1),1,Fibonacci Number,2500.0,E,1338737400,"[brute force, math, matrices]",PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Exams,500.0,A,1338737400,"[implementation, math]",PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Square,1000.0,B,1338737400,[math],PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Cutting Figure,1500.0,C,1338737400,"[dfs and similar, graphs, implementation, matrices, strings]",PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Xor,2000.0,D,1338737400,[],PROGRAMMING
+194,Codeforces Round #122 (Div. 2),2,Hamming Distance,3000.0,E,1338737400,[math],PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Dynasty Puzzles,500.0,A,1338132600,[dp],PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Demonstration,1000.0,B,1338132600,[greedy],PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Fools and Roads,1500.0,C,1338132600,"[data structures, dfs and similar, trees]",PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Metro Scheme,2000.0,D,1338132600,"[graphs, greedy]",PROGRAMMING
+191,Codeforces Round #121 (Div. 1),1,Thwarting Demonstrations,2500.0,E,1338132600,"[binary search, data structures, trees]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Funky Numbers,500.0,A,1338132600,"[binary search, brute force, implementation]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Walking in the Rain,1000.0,B,1338132600,"[brute force, implementation]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Dynasty Puzzles,1500.0,C,1338132600,[dp],PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Demonstration,2000.0,D,1338132600,"[brute force, constructive algorithms]",PROGRAMMING
+192,Codeforces Round #121 (Div. 2),2,Fools and Roads,2500.0,E,1338132600,"[data structures, trees]",PROGRAMMING
+188,Surprise Language Round #6,12,Hexagonal Numbers,,A,1337959800,[*special],PROGRAMMING
+188,Surprise Language Round #6,12,A + Reverse B,,B,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,LCM,,C,1337959800,"[*special, implementation, math]",PROGRAMMING
+188,Surprise Language Round #6,12,Asterisks,,D,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,HQ9+,,E,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,Binary Notation,,F,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,Array Sorting,,G,1337959800,"[*special, implementation]",PROGRAMMING
+188,Surprise Language Round #6,12,Stack,,H,1337959800,"[*special, expression parsing, implementation]",PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Vasya and the Bus,500.0,A,1337182200,"[greedy, math]",PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Surrounded,1000.0,B,1337182200,[geometry],PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,STL,1500.0,C,1337182200,[dfs and similar],PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Non-Secret Cypher,2000.0,D,1337182200,[two pointers],PROGRAMMING
+190,Codeforces Round #120 (Div. 2),2,Counter Attack,2500.0,E,1337182200,"[data structures, dsu, graphs, hashing, sortings]",PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,Permutations,500.0,A,1336663800,[greedy],PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,AlgoRace,1000.0,B,1336663800,"[dp, shortest paths]",PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,Weak Memory,1500.0,C,1336663800,"[dfs and similar, dsu]",PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,BRT Contract ,2000.0,D,1336663800,[data structures],PROGRAMMING
+187,Codeforces Round #119 (Div. 1),1,Heaven Tour,2500.0,E,1336663800,"[data structures, greedy]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Cut Ribbon,500.0,A,1336663800,"[brute force, dp]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Counting Rhombi,1000.0,B,1336663800,"[brute force, math]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Permutations,1500.0,C,1336663800,"[greedy, implementation]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,AlgoRace,2000.0,D,1336663800,"[dp, shortest paths]",PROGRAMMING
+189,Codeforces Round #119 (Div. 2),2,Weak Memory,2500.0,E,1336663800,"[binary search, shortest paths]",PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Plant,500.0,A,1336145400,[math],PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Mushroom Scientists,1000.0,B,1336145400,"[math, ternary search]",PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Clever Fat Rat,1500.0,C,1336145400,[dp],PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Visit of the Great,2000.0,D,1336145400,"[math, number theory]",PROGRAMMING
+185,Codeforces Round #118 (Div. 1),1,Soap Time! - 2,2500.0,E,1336145400,"[binary search, data structures]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Comparing Strings,500.0,A,1336145400,"[implementation, strings]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Growing Mushrooms,1000.0,B,1336145400,"[greedy, sortings]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Plant,1500.0,C,1336145400,"[dp, math, matrices, number theory]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Mushroom Scientists,2000.0,D,1336145400,"[math, number theory, probabilities]",PROGRAMMING
+186,Codeforces Round #118 (Div. 2),2,Clever Fat Rat,2500.0,E,1336145400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Educational Game,20.0,A1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Educational Game,30.0,A2,1335614400,[greedy],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Educational Game,50.0,A3,1335614400,[greedy],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,20.0,B1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,30.0,B2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,50.0,B3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,20.0,C1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,30.0,C2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,50.0,C3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Magic Squares,20.0,D1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Magic Squares,30.0,D2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Magic Squares,50.0,D3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,20.0,E1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,30.0,E2,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,50.0,E3,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,20.0,F1,1335614400,[],PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,30.0,F2,1335614400,"[dp, sortings, strings]",PROGRAMMING
+178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,50.0,F3,1335614400,[],PROGRAMMING
+183,Croc Champ 2012 - Final,12,Headquarters,500.0,A,1335532800,"[constructive algorithms, math]",PROGRAMMING
+183,Croc Champ 2012 - Final,12,Zoo,1000.0,B,1335532800,"[brute force, geometry]",PROGRAMMING
+183,Croc Champ 2012 - Final,12,Cyclic Coloring,1500.0,C,1335532800,[dfs and similar],PROGRAMMING
+183,Croc Champ 2012 - Final,12,T-shirt,2000.0,D,1335532800,"[dp, greedy, probabilities]",PROGRAMMING
+183,Croc Champ 2012 - Final,12,Candy Shop,2500.0,E,1335532800,[greedy],PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Battlefield,3000.0,A,1335280200,"[geometry, graphs, implementation, shortest paths]",PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Vasya's Calendar,500.0,B,1335280200,[implementation],PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Optimal Sum,3000.0,C,1335280200,"[data structures, greedy]",PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Common Divisors,1000.0,D,1335280200,"[brute force, hashing, implementation, math, strings]",PROGRAMMING
+182,Codeforces Round #117 (Div. 2),2,Wooden Fence,1500.0,E,1335280200,[dp],PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Defragmentation,,A,1335078000,[implementation],PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Divisibility Rules,,B,1335078000,"[math, number theory]",PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Letter,,C,1335078000,[dp],PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Name,,D,1335078000,"[greedy, strings]",PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Cubes,,E,1335078000,"[binary search, dp, two pointers]",PROGRAMMING
+180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Mathematical Analysis Rocks!,,F,1335078000,"[constructive algorithms, implementation, math]",PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,30.0,A1,1335016800,[implementation],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,70.0,A2,1335016800,[implementation],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,30.0,B1,1335016800,[number theory],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,70.0,B2,1335016800,[number theory],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Party,30.0,C1,1335016800,"[dfs and similar, dsu, graphs]",PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Party,70.0,C2,1335016800,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,30.0,D1,1335016800,[brute force],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,70.0,D2,1335016800,[data structures],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Space Voyage,30.0,E1,1335016800,[binary search],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Space Voyage,70.0,E2,1335016800,[binary search],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Script Generation,30.0,F1,1335016800,[],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Script Generation,70.0,F2,1335016800,[],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,30.0,G1,1335016800,[strings],PROGRAMMING
+177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,70.0,G2,1335016800,"[matrices, strings]",PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Trading Business,500.0,A,1334934300,"[greedy, sortings]",PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Word Cut,1000.0,B,1334934300,[dp],PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Playing with Superglue,1500.0,C,1334934300,"[combinatorics, constructive algorithms]",PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Hyper String,2000.0,D,1334934300,[dp],PROGRAMMING
+176,Croc Champ 2012 - Round 2,12,Archaeology,2500.0,E,1334934300,"[data structures, dfs and similar, trees]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Series of Crimes,500.0,A,1334934300,"[brute force, geometry, implementation]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Number of Triplets,1000.0,B,1334934300,"[binary search, brute force]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Trading Business,1500.0,C,1334934300,"[games, graph matchings, greedy]",PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Word Cut,2000.0,D,1334934300,[dp],PROGRAMMING
+181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Playing with Superglue,2500.0,E,1334934300,[games],PROGRAMMING
+175,Codeforces Round #115,12,Robot Bicorn Attack,500.0,A,1334390400,"[brute force, implementation]",PROGRAMMING
+175,Codeforces Round #115,12,Plane of Tanks: Pro,500.0,B,1334390400,[implementation],PROGRAMMING
+175,Codeforces Round #115,12,Geometry Horse,1000.0,C,1334390400,"[greedy, implementation, sortings]",PROGRAMMING
+175,Codeforces Round #115,12,Plane of Tanks: Duel,2500.0,D,1334390400,"[brute force, dp, math, probabilities]",PROGRAMMING
+175,Codeforces Round #115,12,Power Defence,3000.0,E,1334390400,"[brute force, dp, geometry, greedy]",PROGRAMMING
+175,Codeforces Round #115,12,Gnomes of Might and Magic,3000.0,F,1334390400,"[data structures, graphs, implementation, shortest paths]",PROGRAMMING
+164,VK Cup 2012 Round 3,12,"Variable, or There and Back Again",500.0,A,1333897500,"[dfs and similar, graphs]",PROGRAMMING
+164,VK Cup 2012 Round 3,12,Ancient Berland Hieroglyphs,1000.0,B,1333897500,[two pointers],PROGRAMMING
+164,VK Cup 2012 Round 3,12,Machine Programming,1500.0,C,1333897500,[flows],PROGRAMMING
+164,VK Cup 2012 Round 3,12,Minimum Diameter,2500.0,D,1333897500,"[binary search, brute force]",PROGRAMMING
+164,VK Cup 2012 Round 3,12,Polycarpus and Tasks,2500.0,E,1333897500,[],PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Problem About Equation,500.0,A,1333897500,[math],PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,File List,1000.0,B,1333897500,"[dp, greedy, implementation]",PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Range Increments,1500.0,C,1333897500,"[data structures, greedy]",PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,"Variable, or There and Back Again",2500.0,D,1333897500,[graphs],PROGRAMMING
+174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Ancient Berland Hieroglyphs,3000.0,E,1333897500,[],PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Rock-Paper-Scissors,500.0,A,1333724400,"[implementation, math]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Chamber of Secrets,1000.0,B,1333724400,"[dfs and similar, shortest paths]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Spiral Maximum,1500.0,C,1333724400,"[brute force, dp]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Deputies,2000.0,D,1333724400,"[constructive algorithms, graphs, greedy, implementation]",PROGRAMMING
+173,Croc Champ 2012 - Round 1,12,Camping Groups,2500.0,E,1333724400,"[data structures, sortings]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Phone Code,1000.0,A,1333440000,"[brute force, implementation]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Pseudorandom Sequence Period,1000.0,B,1333440000,"[implementation, number theory]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Bus,1500.0,C,1333440000,"[implementation, sortings]",PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,Calendar Reform,1500.0,D,1333440000,[number theory],PROGRAMMING
+172,Croc Champ 2012 - Qualification Round,12,BHTML+BCSS,2000.0,E,1333440000,"[dfs and similar, expression parsing]",PROGRAMMING
+171,April Fools Day Contest,12,Mysterious numbers - 1,,A,1333292400,"[*special, constructive algorithms]",PROGRAMMING
+171,April Fools Day Contest,12,Star,,B,1333292400,"[*special, combinatorics]",PROGRAMMING
+171,April Fools Day Contest,12,A Piece of Cake,,C,1333292400,"[*special, implementation]",PROGRAMMING
+171,April Fools Day Contest,12,Broken checker,,D,1333292400,"[*special, brute force]",PROGRAMMING
+171,April Fools Day Contest,12,MYSTERIOUS LANGUAGE,,E,1333292400,[*special],PROGRAMMING
+171,April Fools Day Contest,12,ucyhf,,F,1333292400,"[*special, brute force, implementation, number theory]",PROGRAMMING
+171,April Fools Day Contest,12,Mysterious numbers - 2,,G,1333292400,[*special],PROGRAMMING
+171,April Fools Day Contest,12,A polyline,,H,1333292400,"[*special, implementation]",PROGRAMMING
+170,VK Cup 2012 Wild-card Round 2,12,Placing Rectangles,,A,1332954000,[*special],PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Trolleybuses,500.0,A,1332860400,[implementation],PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Huge Prize,1000.0,B,1332860400,"[dp, probabilities]",PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Numbers,1500.0,C,1332860400,"[games, math]",PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Roads,2000.0,D,1332860400,"[data structures, divide and conquer, graph matchings]",PROGRAMMING
+167,Codeforces Round #114 (Div. 1),1,Wizards and Bets,2500.0,E,1332860400,"[math, matrices]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Demonstration,500.0,A,1332860400,"[implementation, math]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Minimal Spell,1000.0,B,1332860400,"[implementation, strings]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Trolleybuses,1500.0,C,1332860400,"[implementation, math]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Huge Prize,2000.0,D,1332860400,"[dp, probabilities]",PROGRAMMING
+168,Codeforces Round #114 (Div. 2),2,Wizards and Numbers,2500.0,E,1332860400,[],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Substring and Subsequence,1000.0,A,1332687900,[dp],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Lemmings,1000.0,B,1332687900,[binary search],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Conveyor,1500.0,C,1332687900,[sortings],PROGRAMMING
+163,VK Cup 2012 Round 2,12,Large Refrigerator,2000.0,D,1332687900,[brute force],PROGRAMMING
+163,VK Cup 2012 Round 2,12,e-Government,2500.0,E,1332687900,"[data structures, dfs and similar, dp, strings, trees]",PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Chores,500.0,A,1332687900,[sortings],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Replacing Digits,1000.0,B,1332687900,[greedy],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Substring and Subsequence,1500.0,C,1332687900,[dp],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Lemmings,2000.0,D,1332687900,[],PROGRAMMING
+169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Conveyor,2500.0,E,1332687900,[],PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Rank List,500.0,A,1332516600,"[binary search, implementation, sortings]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Polygons,3000.0,B,1332516600,"[geometry, sortings]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Median,1000.0,C,1332516600,"[greedy, math, sortings]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Shoe Store,3000.0,D,1332516600,"[dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING
+166,Codeforces Round #113 (Div. 2),2,Tetrahedron,1000.0,E,1332516600,"[dp, math, matrices]",PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Pentagonal numbers,,A,1332083400,"[*special, implementation]",PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Binary notation,,B,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Prime factorization,,C,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Remove digits,,D,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,HQ9+,,E,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Factorial zeros,,F,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Non-decimal sum,,G,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Alternating case,,H,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Truncatable primes,,I,1332083400,[*special],PROGRAMMING
+162,VK Cup 2012 Wild-card Round 1,12,Brackets,,J,1332083400,[*special],PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Supercentral Point,500.0,A,1331911800,[implementation],PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Burning Midnight Oil,1000.0,B,1331911800,"[binary search, implementation]",PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Another Problem on Strings,1500.0,C,1331911800,"[binary search, brute force, dp, math, strings, two pointers]",PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Beard Graph,2000.0,D,1331911800,"[data structures, dsu, trees]",PROGRAMMING
+165,Codeforces Round #112 (Div. 2),2,Compatible Numbers,2500.0,E,1331911800,"[bitmasks, brute force, dfs and similar, dp]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Dress'em in Vests!,1000.0,A,1331478300,"[binary search, brute force, greedy, two pointers]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Discounts,1000.0,B,1331478300,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Abracadabra,2000.0,C,1331478300,[divide and conquer],PROGRAMMING
+161,VK Cup 2012 Round 1,12,Distance in Tree,2000.0,D,1331478300,"[dfs and similar, dp, trees]",PROGRAMMING
+161,VK Cup 2012 Round 1,12,Polycarpus the Safecracker,2500.0,E,1331478300,"[brute force, dp]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Friends or Not,500.0,A,1331280000,"[*special, greedy, implementation]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Matchmaker,1000.0,B,1331280000,"[greedy, sortings]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,String Manipulation 1.0,1500.0,C,1331280000,"[binary search, brute force, data structures, strings]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Palindrome pairs,2000.0,D,1331280000,"[*special, brute force, dp, strings]",PROGRAMMING
+159,VK Cup 2012 Qualification Round 2,12,Zebra Tower,2500.0,E,1331280000,"[data structures, greedy, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Twins,500.0,A,1331046000,"[greedy, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Unlucky Ticket,1000.0,B,1331046000,"[greedy, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Find Pair,1500.0,C,1331046000,"[implementation, math, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Edges in MST,2000.0,D,1331046000,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING
+160,Codeforces Round #111 (Div. 2),2,Buses and People,2500.0,E,1331046000,"[binary search, data structures, sortings]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Next Round,500.0,A,1330804800,[implementation],PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Taxi,1000.0,B,1330804800,"[greedy, implementation]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Cd and pwd commands,1000.0,C,1330804800,"[data structures, implementation]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Ice Sculptures,1500.0,D,1330804800,"[brute force, number theory]",PROGRAMMING
+158,VK Cup 2012 Qualification Round 1,12,Phone Talks,2000.0,E,1330804800,"[dp, sortings]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Message,500.0,A,1330536600,[brute force],PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Suspects,1000.0,B,1330536600,"[constructive algorithms, data structures, implementation]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Cipher,1500.0,C,1330536600,"[combinatorics, dp]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Clues,2500.0,D,1330536600,"[combinatorics, graphs]",PROGRAMMING
+156,Codeforces Round #110 (Div. 1),1,Mrs. Hudson's Pancakes,2500.0,E,1330536600,"[brute force, dp]",PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Game Outcome,500.0,A,1330536600,[brute force],PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Trace,1000.0,B,1330536600,"[geometry, sortings]",PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Message,1500.0,C,1330536600,"[brute force, dp, strings]",PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Suspects,2000.0,D,1330536600,[implementation],PROGRAMMING
+157,Codeforces Round #110 (Div. 2),2,Cipher,2500.0,E,1330536600,"[dp, math]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Hometask,500.0,A,1330095600,[greedy],PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Colliders,1000.0,B,1330095600,"[math, number theory]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Double Profiles,1500.0,C,1330095600,"[graphs, hashing, sortings]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Flatland Fencing,2000.0,D,1330095600,"[games, math]",PROGRAMMING
+154,Codeforces Round #109 (Div. 1),1,Martian Colony,2500.0,E,1330095600,[geometry],PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,I_love_\%username\%,500.0,A,1330095600,[brute force],PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Combination,1000.0,B,1330095600,"[greedy, sortings]",PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Hometask,1500.0,C,1330095600,"[dp, greedy]",PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Colliders,2000.0,D,1330095600,"[math, number theory]",PROGRAMMING
+155,Codeforces Round #109 (Div. 2),2,Double Profiles,2500.0,E,1330095600,"[hashing, sortings]",PROGRAMMING
+153,Surprise Language Round #5,12,A + B,,A,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Binary notation,,B,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Caesar Cipher,,C,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Date Change,,D,1329922800,[*special],PROGRAMMING
+153,Surprise Language Round #5,12,Euclidean Distance,,E,1329922800,[*special],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Marks,500.0,A,1329750000,[implementation],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Steps,1000.0,B,1329750000,"[binary search, implementation]",PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Pocket Book,1500.0,C,1329750000,[combinatorics],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Frames,2500.0,D,1329750000,[brute force],PROGRAMMING
+152,Codeforces Round #108 (Div. 2),2,Garden,2500.0,E,1329750000,"[bitmasks, dp, graphs, trees]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Win or Freeze,500.0,A,1329490800,"[games, number theory]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Quantity of Strings,500.0,B,1329490800,"[combinatorics, dfs and similar, math]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Smart Cheater,1000.0,C,1329490800,"[data structures, math, probabilities]",PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Mission Impassable,1500.0,D,1329490800,[dp],PROGRAMMING
+150,Codeforces Round #107 (Div. 1),1,Freezing with Style,3000.0,E,1329490800,"[binary search, data structures, divide and conquer, trees]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Soft Drinking,500.0,A,1329490800,"[implementation, math]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Phone Numbers,1000.0,B,1329490800,"[implementation, strings]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Win or Freeze,1500.0,C,1329490800,"[games, greedy, number theory]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Quantity of Strings,1500.0,D,1329490800,"[combinatorics, dsu]",PROGRAMMING
+151,Codeforces Round #107 (Div. 2),2,Smart Cheater,3000.0,E,1329490800,[],PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Business trip,500.0,A,1328886000,"[greedy, implementation, sortings]",PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Martian Clock,1000.0,B,1328886000,[implementation],PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Division into Teams,1500.0,C,1328886000,"[greedy, math, sortings]",PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Coloring Brackets,2500.0,D,1328886000,[dp],PROGRAMMING
+149,Codeforces Round #106 (Div. 2),2,Martian Strings,2500.0,E,1328886000,"[string suffix structures, strings]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Insomnia cure,1000.0,A,1328198400,"[constructive algorithms, implementation, math]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Escape,1000.0,B,1328198400,"[implementation, math]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Terse princess,1000.0,C,1328198400,"[constructive algorithms, greedy]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Bag of mice,1000.0,D,1328198400,"[dp, games, math, probabilities]",PROGRAMMING
+148,Codeforces Round #105 (Div. 2),2,Porcelain,1000.0,E,1328198400,[dp],PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Conversion,500.0,A,1327215600,"[greedy, implementation]",PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Number 2,1000.0,B,1327215600,[constructive algorithms],PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Subsequence,1500.0,C,1327215600,"[combinatorics, dp, math]",PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Pair,2500.0,D,1327215600,"[combinatorics, data structures, implementation]",PROGRAMMING
+145,Codeforces Round #104 (Div. 1),1,Lucky Queries,2500.0,E,1327215600,[data structures],PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Ticket,500.0,A,1327215600,[implementation],PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Mask,1000.0,B,1327215600,"[brute force, implementation]",PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Conversion,1500.0,C,1327215600,[greedy],PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Number 2,2000.0,D,1327215600,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+146,Codeforces Round #104 (Div. 2),2,Lucky Subsequence,2500.0,E,1327215600,"[combinatorics, dp]",PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Arrival of the General,500.0,A,1326899100,[implementation],PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Meeting,1000.0,B,1326899100,[implementation],PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Anagram Search,1500.0,C,1326899100,"[implementation, strings]",PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Missile Silos,2000.0,D,1326899100,"[data structures, dfs and similar, graphs, shortest paths]",PROGRAMMING
+144,Codeforces Round #103 (Div. 2),2,Competition,2500.0,E,1326899100,"[data structures, greedy]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Farmer,500.0,A,1326380700,"[brute force, math]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help General,1000.0,B,1326380700,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Caretaker,1500.0,C,1326380700,"[brute force, dp]",PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Shrek and Donkey 2,2000.0,D,1326380700,[games],PROGRAMMING
+142,Codeforces Round #102 (Div. 1),1,Help Greg the Dwarf 2,2500.0,E,1326380700,[geometry],PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Vasilisa the Wise 2,500.0,A,1326380700,"[brute force, math]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Kingdom of Far Far Away 2,1000.0,B,1326380700,"[implementation, strings]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Farmer,1500.0,C,1326380700,"[implementation, math]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help General,2000.0,D,1326380700,"[graph matchings, greedy, math]",PROGRAMMING
+143,Codeforces Round #102 (Div. 2),2,Help Caretaker,2500.0,E,1326380700,[],PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Amusing Joke,500.0,A,1326034800,"[implementation, sortings, strings]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Hopscotch,1000.0,B,1326034800,"[geometry, math]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Queue,2000.0,C,1326034800,"[constructive algorithms, greedy, sortings]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Take-off Ramps,2000.0,D,1326034800,"[graphs, shortest paths]",PROGRAMMING
+141,Codeforces Round #101 (Div. 2),2,Clearing Up,2500.0,E,1326034800,"[constructive algorithms, dp, dsu, graphs]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Table,500.0,A,1325689200,"[geometry, math]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Cards,1000.0,B,1325689200,"[brute force, greedy, implementation]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Snowmen,1500.0,C,1325689200,"[binary search, data structures, greedy]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Contest,2000.0,D,1325689200,"[greedy, sortings]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Garland,2500.0,E,1325689200,"[combinatorics, dp]",PROGRAMMING
+140,Codeforces Round #100,12,New Year Snowflake,3000.0,F,1325689200,"[geometry, sortings]",PROGRAMMING
+147,Codeforces Testing Round #4,12,Punctuation,500.0,A,1325602800,"[implementation, strings]",PROGRAMMING
+147,Codeforces Testing Round #4,12,Smile House,1000.0,B,1325602800,"[binary search, graphs, matrices]",PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Literature Lesson,500.0,A,1324728000,[implementation],PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Digits Permutations,1000.0,B,1324728000,[greedy],PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Mushroom Gnomes - 2,2000.0,C,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,World of Darkraft,2000.0,D,1324728000,"[dp, games]",PROGRAMMING
+138,Codeforces Beta Round #99 (Div. 1),1,Hellish Constraints,2500.0,E,1324728000,"[brute force, dp, two pointers]",PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Petr and Book,500.0,A,1324728000,[implementation],PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Wallpaper,1000.0,B,1324728000,"[implementation, math]",PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Literature Lesson,1500.0,C,1324728000,"[implementation, strings]",PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Digits Permutations,2000.0,D,1324728000,[implementation],PROGRAMMING
+139,Codeforces Beta Round #99 (Div. 2),2,Mushroom Gnomes - 2,3000.0,E,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Postcards and photos,500.0,A,1324015200,[implementation],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Permutation,1000.0,B,1324015200,[greedy],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,History,1500.0,C,1324015200,[sortings],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Palindromes,2000.0,D,1324015200,[dp],PROGRAMMING
+137,Codeforces Beta Round #98 (Div. 2),2,Last Chance,2500.0,E,1324015200,"[data structures, implementation]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Replacement,500.0,A,1323443100,"[implementation, sortings]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Rectangle and Square,1000.0,B,1323443100,"[brute force, geometry, math]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Zero-One,1500.0,C,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Cycle,2000.0,D,1323443100,"[brute force, dfs and similar, implementation]",PROGRAMMING
+135,Codeforces Beta Round #97 (Div. 1),1,Weak Subsequence,2500.0,E,1323443100,[combinatorics],PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Presents,500.0,A,1323443100,[implementation],PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Ternary Logic,1000.0,B,1323443100,"[implementation, math]",PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Replacement,1500.0,C,1323443100,"[implementation, sortings]",PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Rectangle and Square,2000.0,D,1323443100,"[geometry, implementation]",PROGRAMMING
+136,Codeforces Beta Round #97 (Div. 2),2,Zero-One,2500.0,E,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Turing Tape,500.0,A,1322924400,[implementation],PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Piet,1500.0,B,1322924400,[implementation],PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Logo Turtle,1500.0,C,1322924400,[dp],PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Constants in the language of Shakespeare,2000.0,D,1322924400,"[constructive algorithms, dp, greedy]",PROGRAMMING
+132,Codeforces Beta Round #96 (Div. 1),1,Bits of merry old England,2500.0,E,1322924400,[flows],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,HQ9+,500.0,A,1322924400,[implementation],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Unary,1000.0,B,1322924400,[implementation],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Turing Tape,1500.0,C,1322924400,"[implementation, math]",PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Piet,2500.0,D,1322924400,[implementation],PROGRAMMING
+133,Codeforces Beta Round #96 (Div. 2),2,Logo Turtle,2500.0,E,1322924400,"[dp, implementation]",PROGRAMMING
+134,Codeforces Testing Round #3,12,Average Numbers,500.0,A,1322838000,"[brute force, implementation]",PROGRAMMING
+134,Codeforces Testing Round #3,12,Pairs of Numbers,1000.0,B,1322838000,"[brute force, dfs and similar, math, number theory]",PROGRAMMING
+134,Codeforces Testing Round #3,12,Swaps,1500.0,C,1322838000,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,cAPS lOCK,500.0,A,1322233200,"[implementation, strings]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Opposites Attract,1000.0,B,1322233200,"[implementation, math]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,The World is a Theatre,1500.0,C,1322233200,"[combinatorics, math]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Subway,2000.0,D,1322233200,"[dfs and similar, graphs]",PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Yet Another Task with Queens,2500.0,E,1322233200,[sortings],PROGRAMMING
+131,Codeforces Beta Round #95 (Div. 2),2,Present to Mom,2500.0,F,1322233200,"[binary search, two pointers]",PROGRAMMING
+130,Unknown Language Round #4,12,Hexagonal numbers,,A,1321801200,"[*special, implementation]",PROGRAMMING
+130,Unknown Language Round #4,12,Gnikool Ssalg,,B,1321801200,"[*special, implementation, strings]",PROGRAMMING
+130,Unknown Language Round #4,12,Decimal sum,,C,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Exponentiation,,D,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Tribonacci numbers,,E,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Prime factorization,,F,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,CAPS LOCK ON,,G,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Balanced brackets,,H,1321801200,[*special],PROGRAMMING
+130,Unknown Language Round #4,12,Array sorting,,I,1321801200,"[*special, sortings]",PROGRAMMING
+130,Unknown Language Round #4,12,Date calculation,,J,1321801200,[*special],PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Statues,1000.0,A,1321337400,[dfs and similar],PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,String,1500.0,B,1321337400,"[brute force, constructive algorithms, hashing, string suffix structures, strings]",PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Games with Rectangle,1500.0,C,1321337400,"[combinatorics, dp]",PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Numbers,2000.0,D,1321337400,[constructive algorithms],PROGRAMMING
+128,Codeforces Beta Round #94 (Div. 1 Only),1,Birthday,2500.0,E,1321337400,"[geometry, math]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Cookies,500.0,A,1321337400,[implementation],PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Students and Shoelaces,1000.0,B,1321337400,"[brute force, dfs and similar, graphs]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Statues,2000.0,C,1321337400,"[dfs and similar, graphs, implementation]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,String,2500.0,D,1321337400,"[implementation, string suffix structures, strings]",PROGRAMMING
+129,Codeforces Beta Round #94 (Div. 2 Only),2,Games with Rectangle,2500.0,E,1321337400,"[combinatorics, dp]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Hot Bath,500.0,A,1320858000,"[binary search, brute force, math]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Password,1000.0,B,1320858000,"[binary search, dp, hashing, string suffix structures, strings]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,E-reader Display,1500.0,C,1320858000,"[constructive algorithms, greedy]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Fibonacci Sums,2000.0,D,1320858000,"[dp, math]",PROGRAMMING
+126,Codeforces Beta Round #93 (Div. 1 Only),1,Pills,2500.0,E,1320858000,"[brute force, flows]",PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Wasted Time,500.0,A,1320858000,[geometry],PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Canvas Frames,1000.0,B,1320858000,[implementation],PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Hot Bath,1500.0,C,1320858000,"[binary search, math]",PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,Password,2000.0,D,1320858000,"[hashing, strings]",PROGRAMMING
+127,Codeforces Beta Round #93 (Div. 2 Only),2,E-reader Display,2500.0,E,1320858000,[implementation],PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Prime Permutation,1000.0,A,1320333000,"[implementation, number theory, strings]",PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Squares,1000.0,B,1320333000,[math],PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Brackets,1500.0,C,1320333000,"[combinatorics, dp, greedy]",PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,String,2000.0,D,1320333000,[string suffix structures],PROGRAMMING
+123,Codeforces Beta Round #92 (Div. 1 Only),1,Maze,2500.0,E,1320333000,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,The number of positions,500.0,A,1320333000,[math],PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Permutations,1000.0,B,1320333000,"[brute force, combinatorics, implementation]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Prime Permutation,2000.0,C,1320333000,"[constructive algorithms, dfs and similar, dsu, greedy, number theory, sortings, strings]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Squares,2000.0,D,1320333000,"[brute force, constructive algorithms, number theory]",PROGRAMMING
+124,Codeforces Beta Round #92 (Div. 2 Only),2,Brackets,2500.0,E,1320333000,[],PROGRAMMING
+125,Codeforces Testing Round #2,12,Measuring Lengths in Baden,1000.0,A,1319893200,[math],PROGRAMMING
+125,Codeforces Testing Round #2,12,Simple XML,1500.0,B,1319893200,[implementation],PROGRAMMING
+125,Codeforces Testing Round #2,12,Hobbits' Party,2000.0,C,1319893200,"[constructive algorithms, greedy]",PROGRAMMING
+125,Codeforces Testing Round #2,12,Two progressions,3000.0,D,1319893200,"[constructive algorithms, greedy]",PROGRAMMING
+125,Codeforces Testing Round #2,12,MST Company,5000.0,E,1319893200,"[binary search, graphs]",PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Sum,500.0,A,1319727600,[implementation],PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Transformation,1000.0,B,1319727600,[strings],PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Permutation,1500.0,C,1319727600,"[brute force, combinatorics, number theory]",PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Segments,2000.0,D,1319727600,"[binary search, implementation, two pointers]",PROGRAMMING
+121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Array,2500.0,E,1319727600,[data structures],PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Division,500.0,A,1319727600,"[brute force, number theory]",PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Substring,1000.0,B,1319727600,"[brute force, implementation]",PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Sum,1500.0,C,1319727600,"[brute force, math]",PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Transformation,2000.0,D,1319727600,[brute force],PROGRAMMING
+122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Permutation,2500.0,E,1319727600,[],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Elevator,,A,1318919400,"[brute force, implementation, math]",PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Quiz League,,B,1318919400,[implementation],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Winnie-the-Pooh and honey,,C,1318919400,"[implementation, math]",PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Three Sons,,D,1318919400,[brute force],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Put Knight!,,E,1318919400,[games],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Spiders,,F,1318919400,"[dp, greedy, trees]",PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Boom,,G,1318919400,[implementation],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Brevity is Soul of Wit,,H,1318919400,[graph matchings],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Luck is in Numbers,,I,1318919400,[greedy],PROGRAMMING
+120,"School Regional Team Contest, Saratov, 2011",12,Minimum Sum,,J,1318919400,"[divide and conquer, geometry, sortings]",PROGRAMMING
+119,Codeforces Beta Round #90,12,Epic Game,500.0,A,1318604400,[implementation],PROGRAMMING
+119,Codeforces Beta Round #90,12,Before Exam,1000.0,B,1318604400,"[constructive algorithms, implementation, sortings]",PROGRAMMING
+119,Codeforces Beta Round #90,12,Education Reform,1500.0,C,1318604400,[dp],PROGRAMMING
+119,Codeforces Beta Round #90,12,String Transformation,2000.0,D,1318604400,"[hashing, strings]",PROGRAMMING
+119,Codeforces Beta Round #90,12,Alternative Reality,2500.0,E,1318604400,[geometry],PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,String Task,500.0,A,1317999600,"[implementation, strings]",PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Present from Lena,1000.0,B,1317999600,"[constructive algorithms, implementation]",PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Fancy Number,1500.0,C,1317999600,"[brute force, greedy, sortings, strings]",PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Caesar's Legions,2000.0,D,1317999600,[dp],PROGRAMMING
+118,Codeforces Beta Round #89 (Div. 2),2,Bertown roads,2500.0,E,1317999600,"[dfs and similar, graphs]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Elevator,500.0,A,1316790000,"[implementation, math]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Very Interesting Game,1000.0,B,1316790000,"[brute force, number theory]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Cycle,1500.0,C,1316790000,"[dfs and similar, graphs]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Not Quick Transformation,2000.0,D,1316790000,"[divide and conquer, math]",PROGRAMMING
+117,Codeforces Beta Round #88,12,Tree or not Tree,2500.0,E,1316790000,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Party,500.0,A,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Lawnmower,1000.0,B,1316098800,"[greedy, sortings]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Plumber,1500.0,C,1316098800,[math],PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Unambiguous Arithmetic Expression,2000.0,D,1316098800,"[dp, expression parsing]",PROGRAMMING
+115,Codeforces Beta Round #87 (Div. 1 Only),1,Linear Kingdom Races,2500.0,E,1316098800,"[data structures, dp]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Tram,500.0,A,1316098800,[implementation],PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Little Pigs and Wolves,1000.0,B,1316098800,"[greedy, implementation]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Party,1500.0,C,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Lawnmower,2000.0,D,1316098800,"[dp, greedy]",PROGRAMMING
+116,Codeforces Beta Round #87 (Div. 2 Only),2,Plumber,2500.0,E,1316098800,[],PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Grammar Lessons,500.0,A,1315494000,"[implementation, strings]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Petr#,1000.0,B,1315494000,"[brute force, data structures, hashing, strings]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Double Happiness,1500.0,C,1315494000,"[brute force, number theory]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Museum,2000.0,D,1315494000,"[matrices, probabilities]",PROGRAMMING
+113,Codeforces Beta Round #86 (Div. 1 Only),1,Sleeping,2500.0,E,1315494000,"[combinatorics, implementation, math]",PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Cifera,500.0,A,1315494000,[math],PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,PFAST Inc.,1000.0,B,1315494000,"[bitmasks, brute force]",PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Grammar Lessons,1500.0,C,1315494000,[implementation],PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Petr#,2000.0,D,1315494000,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING
+114,Codeforces Beta Round #86 (Div. 2 Only),2,Double Happiness,2500.0,E,1315494000,[number theory],PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Inequiations,500.0,A,1315051200,[greedy],PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Divisors,1000.0,B,1315051200,"[binary search, data structures, number theory]",PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Spiders,1500.0,C,1315051200,"[bitmasks, dp, dsu]",PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Coloring,2000.0,D,1315051200,"[combinatorics, dp]",PROGRAMMING
+111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Rectangle,2500.0,E,1315051200,[],PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Strings,500.0,A,1315051200,"[implementation, strings]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Square,1000.0,B,1315051200,"[implementation, math]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Inequiations,1500.0,C,1315051200,"[greedy, math]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Divisors,2000.0,D,1315051200,"[implementation, number theory]",PROGRAMMING
+112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Spiders,2500.0,E,1315051200,"[bitmasks, dp]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sum of Digits,500.0,A,1314633600,"[brute force, implementation]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Probability,1000.0,B,1314633600,"[brute force, probabilities]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Tree,1500.0,C,1314633600,"[dp, dsu, trees]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sorting,2000.0,D,1314633600,"[constructive algorithms, sortings]",PROGRAMMING
+109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Interval,2500.0,E,1314633600,"[brute force, math]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Nearly Lucky Number,500.0,A,1314633600,[implementation],PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky String,1000.0,B,1314633600,"[constructive algorithms, strings]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Sum of Digits,1500.0,C,1314633600,"[implementation, math]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Probability,2000.0,D,1314633600,"[brute force, combinatorics, dfs and similar, probabilities]",PROGRAMMING
+110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Tree,2500.0,E,1314633600,"[combinatorics, dfs and similar, trees]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Dorm Water Supply,500.0,A,1314111600,"[dfs and similar, graphs]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Basketball Team,1000.0,B,1314111600,"[combinatorics, dp, probabilities]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Arrangement,1500.0,C,1314111600,"[bitmasks, dp]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Crime Management,2000.0,D,1314111600,"[dp, matrices]",PROGRAMMING
+107,Codeforces Beta Round #83 (Div. 1 Only),1,Darts,2500.0,E,1314111600,"[geometry, probabilities]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Palindromic Times,500.0,A,1314111600,"[implementation, strings]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Datatypes,1000.0,B,1314111600,"[math, sortings]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Dorm Water Supply,1500.0,C,1314111600,"[dfs and similar, implementation]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Basketball Team,2000.0,D,1314111600,"[combinatorics, math, probabilities]",PROGRAMMING
+108,Codeforces Beta Round #83 (Div. 2 Only),2,Arrangement,2500.0,E,1314111600,[],PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Card Game,500.0,A,1313766000,[implementation],PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Choosing Laptop,1000.0,B,1313766000,"[brute force, implementation]",PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Buns,1500.0,C,1313766000,"[chinese remainder theorem, geometry]",PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Treasure Island,2000.0,D,1313766000,"[brute force, implementation]",PROGRAMMING
+106,Codeforces Beta Round #82 (Div. 2),2,Space Rescuers,2500.0,E,1313766000,"[geometry, ternary search]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Transmigration,500.0,A,1313247600,[implementation],PROGRAMMING
+105,Codeforces Beta Round #81,12,Dark Assembly,1000.0,B,1313247600,"[brute force, probabilities]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Item World,1500.0,C,1313247600,"[brute force, implementation, sortings]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Entertaining Geodetics,2000.0,D,1313247600,"[brute force, dsu, implementation]",PROGRAMMING
+105,Codeforces Beta Round #81,12,Lift and Throw,2500.0,E,1313247600,[brute force],PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Testing Pants for Sadness,500.0,A,1312714800,"[greedy, implementation, math]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Cthulhu,1000.0,B,1312714800,"[dfs and similar, dsu, graphs]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Russian Roulette,1500.0,C,1312714800,"[constructive algorithms, greedy]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Time to Raid Cowavans,2000.0,D,1312714800,"[brute force, data structures, sortings]",PROGRAMMING
+103,Codeforces Beta Round #80 (Div. 1 Only),1,Buying Sets,2500.0,E,1312714800,"[flows, graph matchings]",PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Blackjack,500.0,A,1312714800,[implementation],PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Testing Pants for Sadness,1000.0,B,1312714800,[math],PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Cthulhu,1500.0,C,1312714800,"[dsu, trees]",PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Russian Roulette,2000.0,D,1312714800,[math],PROGRAMMING
+104,Codeforces Beta Round #80 (Div. 2 Only),2,Time to Raid Cowavans,2500.0,E,1312714800,[],PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Homework,500.0,A,1312390800,[greedy],PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Buses,1000.0,B,1312390800,"[binary search, data structures, dp]",PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Vectors,1500.0,C,1312390800,"[implementation, math]",PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Castle,2000.0,D,1312390800,"[dp, greedy, probabilities, sortings, trees]",PROGRAMMING
+101,Codeforces Beta Round #79 (Div. 1 Only),1,Candies and Stones,2500.0,E,1312390800,"[divide and conquer, dp]",PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Clothes,500.0,A,1312390800,[brute force],PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Sum of Digits,1000.0,B,1312390800,[implementation],PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Homework,1500.0,C,1312390800,[greedy],PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Buses,2000.0,D,1312390800,"[binary search, data structures, dp]",PROGRAMMING
+102,Codeforces Beta Round #79 (Div. 2 Only),2,Vectors,2500.0,E,1312390800,[],PROGRAMMING
+100,Unknown Language Round #3,12,Carpeting the Room,,A,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Friendly Numbers,,B,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,A+B,,C,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,World of Mouth,,D,1312005600,"[*special, strings]",PROGRAMMING
+100,Unknown Language Round #3,12,Lamps in a Line,,E,1312005600,"[*special, math]",PROGRAMMING
+100,Unknown Language Round #3,12,Polynom,,F,1312005600,"[*special, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Name the album,,G,1312005600,"[*special, data structures, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Battleship,,H,1312005600,"[*special, dfs and similar, implementation]",PROGRAMMING
+100,Unknown Language Round #3,12,Rotation,,I,1312005600,"[*special, geometry, math]",PROGRAMMING
+100,Unknown Language Round #3,12,Interval Coloring,,J,1312005600,"[*special, greedy, math]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Victoria the Wise,500.0,A,1311346800,"[brute force, implementation]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help King,1000.0,B,1311346800,"[implementation, probabilities, trees]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Greg the Dwarf,1500.0,C,1311346800,"[geometry, ternary search]",PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Monks,2000.0,D,1311346800,[constructive algorithms],PROGRAMMING
+98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Shrek and Donkey,2500.0,E,1311346800,"[dp, games, math, probabilities]",PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Far Away Kingdom,500.0,A,1311346800,[strings],PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Chef Gerasim,1000.0,B,1311346800,"[implementation, sortings]",PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Victoria the Wise,1500.0,C,1311346800,[brute force],PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help King,2000.0,D,1311346800,[],PROGRAMMING
+99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Greg the Dwarf,2500.0,E,1311346800,"[binary search, geometry, ternary search]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Domino,500.0,A,1310731200,"[brute force, implementation]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Superset,1500.0,B,1310731200,"[constructive algorithms, divide and conquer]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Winning Strategy,2000.0,C,1310731200,"[binary search, graphs, math, shortest paths]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Robot in Basement,2000.0,D,1310731200,"[bitmasks, brute force, implementation]",PROGRAMMING
+97,Yandex.Algorithm 2011
Finals,12,Leaders,2500.0,E,1310731200,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Hockey,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Numbers,1000.0,B,1310137200,"[dp, greedy]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Volleyball,1500.0,C,1310137200,[shortest paths],PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Horse Races,2000.0,D,1310137200,"[dp, math]",PROGRAMMING
+95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Country,2500.0,E,1310137200,"[dp, dsu, graphs]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Football,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Lucky Numbers (easy),1000.0,B,1310137200,"[binary search, bitmasks, brute force]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Hockey,1500.0,C,1310137200,"[implementation, strings]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Volleyball,2000.0,D,1310137200,"[graphs, shortest paths]",PROGRAMMING
+96,Codeforces Beta Round #77 (Div. 2 Only),2,Horse Races,2500.0,E,1310137200,[],PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Frames,500.0,A,1309446000,[implementation],PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,End of Exams,1000.0,B,1309446000,[greedy],PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Azembler,1500.0,C,1309446000,"[brute force, implementation]",PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Flags,2000.0,D,1309446000,"[dp, math, matrices]",PROGRAMMING
+93,Codeforces Beta Round #76 (Div. 1 Only),1,Lostborn,2500.0,E,1309446000,"[dp, math]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Restoring Password,500.0,A,1309446000,"[implementation, strings]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Friends,1000.0,B,1309446000,"[implementation, math]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Frames,1500.0,C,1309446000,[math],PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,End of Exams,2000.0,D,1309446000,"[greedy, math]",PROGRAMMING
+94,Codeforces Beta Round #76 (Div. 2 Only),2,Azembler,2500.0,E,1309446000,[brute force],PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Newspaper Headline,500.0,A,1308582000,"[greedy, strings]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Queue,1000.0,B,1308582000,"[binary search, data structures]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Ski Base,1500.0,C,1308582000,"[combinatorics, dsu, graphs]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Grocer's Problem,2500.0,D,1308582000,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+91,Codeforces Beta Round #75 (Div. 1 Only),1,Igloo Skyscraper,2500.0,E,1308582000,"[data structures, geometry]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Chips,500.0,A,1308582000,"[implementation, math]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Binary Number,1000.0,B,1308582000,[greedy],PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Newspaper Headline,1500.0,C,1308582000,"[binary search, data structures, dp, greedy]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Queue,2000.0,D,1308582000,"[binary search, data structures, dp]",PROGRAMMING
+92,Codeforces Beta Round #75 (Div. 2 Only),2,Ski Base,2500.0,E,1308582000,"[data structures, dsu, graphs]",PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Robbery,500.0,A,1308236400,[greedy],PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Widget Library,1000.0,B,1308236400,"[dp, expression parsing, graphs, implementation]",PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Chip Play,1000.0,C,1308236400,"[brute force, data structures, implementation]",PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Space mines,1500.0,D,1308236400,[geometry],PROGRAMMING
+89,Codeforces Beta Round #74 (Div. 1 Only),1,Fire and Ice,2500.0,E,1308236400,[greedy],PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Cableway,500.0,A,1308236400,"[greedy, math]",PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,African Crossword,1000.0,B,1308236400,"[implementation, strings]",PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Robbery,1500.0,C,1308236400,"[greedy, math]",PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Widget Library,2000.0,D,1308236400,[],PROGRAMMING
+90,Codeforces Beta Round #74 (Div. 2 Only),2,Chip Play,2000.0,E,1308236400,[],PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Trains,500.0,A,1307458800,[math],PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Vasya and Types,1000.0,B,1307458800,"[implementation, strings]",PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Interesting Game,1500.0,C,1307458800,"[dp, games]",PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Beautiful Road,2000.0,D,1307458800,"[dfs and similar, dp, dsu, implementation, sortings, trees]",PROGRAMMING
+87,Codeforces Beta Round #73 (Div. 1 Only),1,Mogohu-Rea Idol,2500.0,E,1307458800,[geometry],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Chord,500.0,A,1307458800,"[brute force, implementation]",PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Keyboard,1000.0,B,1307458800,[implementation],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Trains,1500.0,C,1307458800,[number theory],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Vasya and Types,2000.0,D,1307458800,[implementation],PROGRAMMING
+88,Codeforces Beta Round #73 (Div. 2 Only),2,Interesting Game,2500.0,E,1307458800,[],PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Reflection,500.0,A,1306077000,[math],PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Tetris revisited,1000.0,B,1306077000,"[constructive algorithms, graph matchings, greedy, math]",PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Genetic engineering,2000.0,C,1306077000,"[dp, string suffix structures, trees]",PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Powerful array,2500.0,D,1306077000,"[data structures, implementation, math, two pointers]",PROGRAMMING
+86,Yandex.Algorithm 2011
Round 2,12,Long sequence,2500.0,E,1306077000,"[brute force, math, matrices]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Domino,500.0,A,1305903600,"[constructive algorithms, implementation]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Embassy Queue,1000.0,B,1305903600,[data structures],PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Petya and Tree,1500.0,C,1305903600,"[binary search, dfs and similar, probabilities, sortings, trees]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Sum of Medians,2000.0,D,1305903600,"[binary search, brute force, data structures, implementation]",PROGRAMMING
+85,Yandex.Algorithm 2011
Round 1,12,Guard Towers,2500.0,E,1305903600,"[binary search, dsu, geometry, graphs, sortings]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Magical Array,500.0,A,1305299400,[math],PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Doctor,1000.0,B,1305299400,"[binary search, math, sortings]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Track,1500.0,C,1305299400,"[graphs, greedy, shortest paths]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Numbers,2000.0,D,1305299400,"[dp, math, number theory]",PROGRAMMING
+83,Codeforces Beta Round #72 (Div. 1 Only),1,Two Subsequences,2500.0,E,1305299400,"[bitmasks, dp]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Toy Army,500.0,A,1305299400,"[math, number theory]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Magical Array,1000.0,B,1305299400,"[combinatorics, implementation]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Biathlon,1500.0,C,1305299400,"[binary search, implementation]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Doctor,2000.0,D,1305299400,"[binary search, implementation]",PROGRAMMING
+84,Codeforces Beta Round #72 (Div. 2 Only),2,Track,2500.0,E,1305299400,"[brute force, shortest paths]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Double Cola,500.0,A,1304694000,"[implementation, math]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Sets,1000.0,B,1304694000,"[constructive algorithms, hashing, implementation]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,General Mobilization,1500.0,C,1304694000,"[data structures, dfs and similar, sortings]",PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Two out of Three,2000.0,D,1304694000,[dp],PROGRAMMING
+82,Yandex.Algorithm 2011
Qualification 2,12,Corridor,2500.0,E,1304694000,[geometry],PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Plug-in,500.0,A,1304485200,[implementation],PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Sequence Formatting,1000.0,B,1304485200,"[implementation, strings]",PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Average Score,1500.0,C,1304485200,"[math, sortings]",PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Polycarp's Picture Gallery,2000.0,D,1304485200,"[constructive algorithms, greedy]",PROGRAMMING
+81,Yandex.Algorithm Open 2011
Qualification 1,12,Pairs,2500.0,E,1304485200,"[dfs and similar, dp, dsu, graphs, implementation, trees]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Bus Game,500.0,A,1304175600,[greedy],PROGRAMMING
+79,Codeforces Beta Round #71,12,Colorful Field,1000.0,B,1304175600,"[implementation, sortings]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Beaver,1500.0,C,1304175600,"[data structures, dp, greedy, hashing, strings, two pointers]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Password,2000.0,D,1304175600,"[bitmasks, dp, shortest paths]",PROGRAMMING
+79,Codeforces Beta Round #71,12,Security System,2500.0,E,1304175600,[math],PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Haiku,500.0,A,1303916400,"[implementation, strings]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Easter Eggs,1000.0,B,1303916400,"[constructive algorithms, implementation]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Beaver Game,1500.0,C,1303916400,"[dp, games, number theory]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Archer's Shot,2000.0,D,1303916400,"[binary search, geometry, math, two pointers]",PROGRAMMING
+78,Codeforces Beta Round #70 (Div. 2),2,Evacuation,2500.0,E,1303916400,"[flows, graphs, shortest paths]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Heroes,500.0,A,1303226100,"[brute force, implementation]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Falling Anvils,1000.0,B,1303226100,"[math, probabilities]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Beavermuncher-0xFF,1500.0,C,1303226100,"[dfs and similar, dp, dsu, greedy, trees]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Domino Carpet,2000.0,D,1303226100,"[dp, implementation]",PROGRAMMING
+77,Codeforces Beta Round #69 (Div. 1 Only),1,Martian Food,2000.0,E,1303226100,[geometry],PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Panoramix's Prediction,500.0,A,1303226100,[brute force],PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Depression,1000.0,B,1303226100,"[geometry, math]",PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Heroes,1500.0,C,1303226100,"[brute force, implementation]",PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Falling Anvils,2000.0,D,1303226100,"[geometry, probabilities]",PROGRAMMING
+80,Codeforces Beta Round #69 (Div. 2 Only),2,Beavermuncher-0xFF,2500.0,E,1303226100,[],PROGRAMMING
+74,Codeforces Beta Round #68,12,Room Leader,500.0,A,1302879600,[implementation],PROGRAMMING
+74,Codeforces Beta Round #68,12,Train,1000.0,B,1302879600,"[dp, games, greedy]",PROGRAMMING
+74,Codeforces Beta Round #68,12,Chessboard Billiard,1500.0,C,1302879600,"[dfs and similar, dsu, graphs, number theory]",PROGRAMMING
+74,Codeforces Beta Round #68,12,Hanger,2000.0,D,1302879600,[data structures],PROGRAMMING
+74,Codeforces Beta Round #68,12,Shift It!,2500.0,E,1302879600,[constructive algorithms],PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Life Without Zeros,500.0,A,1302706800,[implementation],PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Facetook Priority Wall,1000.0,B,1302706800,"[expression parsing, implementation, strings]",PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Modified GCD,1500.0,C,1302706800,"[binary search, number theory]",PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Big Maximum Sum,2000.0,D,1302706800,"[data structures, dp, greedy, implementation, math, trees]",PROGRAMMING
+75,Codeforces Beta Round #67 (Div. 2),2,Ship's Shortest Path,2500.0,E,1302706800,"[geometry, shortest paths]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Gift,,A,1302609600,"[dsu, graphs, sortings, trees]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Mice,,B,1302609600,"[greedy, two pointers]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Mutation,,C,1302609600,"[bitmasks, dp, math]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Plus and xor,,D,1302609600,"[dp, greedy, math]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Points,,E,1302609600,"[implementation, math]",PROGRAMMING
+76,All-Ukrainian School Olympiad in Informatics,12,Tourist,,F,1302609600,"[binary search, data structures, dp]",PROGRAMMING
+73,Codeforces Beta Round #66,12,The Elder Trolls IV: Oblivon,500.0,A,1302422400,"[greedy, math]",PROGRAMMING
+73,Codeforces Beta Round #66,12,Need For Brake,1000.0,B,1302422400,"[binary search, greedy, sortings]",PROGRAMMING
+73,Codeforces Beta Round #66,12,LionAge II,1000.0,C,1302422400,[dp],PROGRAMMING
+73,Codeforces Beta Round #66,12,FreeDiv,1500.0,D,1302422400,"[dfs and similar, graphs, greedy]",PROGRAMMING
+73,Codeforces Beta Round #66,12,Morrowindows,1500.0,E,1302422400,"[math, number theory]",PROGRAMMING
+73,Codeforces Beta Round #66,12,Plane of Tanks,2000.0,F,1302422400,"[brute force, geometry]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Way Too Long Words,500.0,A,1301410800,[strings],PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Progress Bar,1000.0,B,1301410800,"[implementation, math]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Round Table Knights,1500.0,C,1301410800,"[dp, math, number theory]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Solitaire,2000.0,D,1301410800,"[brute force, implementation]",PROGRAMMING
+71,Codeforces Beta Round #65 (Div. 2),2,Nuclear Fusion,2500.0,E,1301410800,"[bitmasks, dp]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Cookies,500.0,A,1301155200,[math],PROGRAMMING
+70,Codeforces Beta Round #64,12,Text Messaging,1000.0,B,1301155200,"[expression parsing, greedy, strings]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Lucky Tickets,1500.0,C,1301155200,"[binary search, data structures, sortings, two pointers]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Professor's task,2000.0,D,1301155200,"[data structures, geometry]",PROGRAMMING
+70,Codeforces Beta Round #64,12,Information Reform,2500.0,E,1301155200,"[dp, implementation, trees]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Young Physicist,500.0,A,1300809600,"[implementation, math]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Bets,1000.0,B,1300809600,"[greedy, implementation]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Game,1500.0,C,1300809600,[implementation],PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Dot,2000.0,D,1300809600,"[dp, games]",PROGRAMMING
+69,Codeforces Beta Round #63 (Div. 2),2,Subsegments,2500.0,E,1300809600,"[data structures, implementation]",PROGRAMMING
+72,Unknown Language Round #2,12,"Goshtasp, Vishtasp and Eidi",,A,1300637400,"[*special, greedy, math]",PROGRAMMING
+72,Unknown Language Round #2,12,INI-file,,B,1300637400,"[*special, implementation]",PROGRAMMING
+72,Unknown Language Round #2,12,Extraordinarily Nice Numbers,,C,1300637400,"[*special, math]",PROGRAMMING
+72,Unknown Language Round #2,12,Perse-script,,D,1300637400,"[*special, expression parsing]",PROGRAMMING
+72,Unknown Language Round #2,12,Ali goes shopping,,E,1300637400,"[*special, brute force, strings]",PROGRAMMING
+72,Unknown Language Round #2,12,Oil,,F,1300637400,"[*special, greedy, math]",PROGRAMMING
+72,Unknown Language Round #2,12,Fibonacci army,,G,1300637400,"[*special, dp]",PROGRAMMING
+72,Unknown Language Round #2,12,Reverse It!,,H,1300637400,"[*special, implementation]",PROGRAMMING
+72,Unknown Language Round #2,12,Goofy Numbers,,I,1300637400,"[*special, implementation]",PROGRAMMING
+68,Codeforces Beta Round #62,12,Irrational problem,500.0,A,1300464000,"[implementation, number theory]",PROGRAMMING
+68,Codeforces Beta Round #62,12,Energy exchange,1000.0,B,1300464000,[binary search],PROGRAMMING
+68,Codeforces Beta Round #62,12,Synchrophasotron,1500.0,C,1300464000,[brute force],PROGRAMMING
+68,Codeforces Beta Round #62,12,Half-decay tree,2000.0,D,1300464000,"[data structures, divide and conquer, dp, probabilities]",PROGRAMMING
+68,Codeforces Beta Round #62,12,Contact,2500.0,E,1300464000,[geometry],PROGRAMMING
+67,Manthan 2011,12,Partial Teacher,500.0,A,1300033800,"[dp, graphs, greedy, implementation]",PROGRAMMING
+67,Manthan 2011,12,Restoration of the Permutation,1000.0,B,1300033800,[greedy],PROGRAMMING
+67,Manthan 2011,12,Sequence of Balls,1500.0,C,1300033800,[dp],PROGRAMMING
+67,Manthan 2011,12,Optical Experiment,2000.0,D,1300033800,"[binary search, data structures, dp]",PROGRAMMING
+67,Manthan 2011,12,Save the City!,2500.0,E,1300033800,[geometry],PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and Java,500.0,A,1299513600,"[implementation, strings]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and Countryside,1000.0,B,1299513600,"[brute force, implementation]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and File System,1500.0,C,1299513600,"[data structures, implementation]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and His Friends,2000.0,D,1299513600,"[constructive algorithms, math, number theory]",PROGRAMMING
+66,Codeforces Beta Round #61 (Div. 2),2,Petya and Post,2500.0,E,1299513600,"[data structures, dp]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and Three Spells,500.0,A,1299340800,"[implementation, math]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and the History of Magic,1000.0,B,1299340800,"[brute force, greedy, implementation]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and the Golden Snitch,1500.0,C,1299340800,"[binary search, geometry]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and the Sorting Hat,2000.0,D,1299340800,"[brute force, dfs and similar, hashing]",PROGRAMMING
+65,Codeforces Beta Round #60,12,Harry Potter and Moving Staircases,2500.0,E,1299340800,"[dfs and similar, implementation]",PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Sinking Ship,500.0,A,1298908800,"[implementation, sortings, strings]",PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Settlers' Training,1000.0,B,1298908800,[implementation],PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Bulls and Cows,1500.0,C,1298908800,"[brute force, implementation]",PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Dividing Island,2000.0,D,1298908800,[constructive algorithms],PROGRAMMING
+63,Codeforces Beta Round #59 (Div. 2),2,Sweets Game,2500.0,E,1298908800,"[bitmasks, dfs and similar, dp, games, implementation]",PROGRAMMING
+62,Codeforces Beta Round #58,12,A Student's Dream,500.0,A,1298649600,"[greedy, math]",PROGRAMMING
+62,Codeforces Beta Round #58,12,Tyndex.Brome,1000.0,B,1298649600,"[binary search, implementation]",PROGRAMMING
+62,Codeforces Beta Round #58,12,Inquisition,1500.0,C,1298649600,"[geometry, implementation, sortings]",PROGRAMMING
+62,Codeforces Beta Round #58,12,Wormhouse,2000.0,D,1298649600,"[dfs and similar, graphs]",PROGRAMMING
+62,Codeforces Beta Round #58,12,World Evil,2500.0,E,1298649600,"[dp, flows]",PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Ultra-Fast Mathematician,500.0,A,1298390400,[implementation],PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Hard Work,1000.0,B,1298390400,[strings],PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Capture Valerian,1500.0,C,1298390400,[math],PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Eternal Victory,2000.0,D,1298390400,"[dfs and similar, graphs, greedy, shortest paths, trees]",PROGRAMMING
+61,Codeforces Beta Round #57 (Div. 2),2,Enemy is weak,2500.0,E,1298390400,"[data structures, trees]",PROGRAMMING
+64,Unknown Language Round #1,12,Factorial,,A,1298304000,"[*special, implementation]",PROGRAMMING
+64,Unknown Language Round #1,12,Expression,,B,1298304000,"[*special, expression parsing]",PROGRAMMING
+64,Unknown Language Round #1,12,Table,,C,1298304000,"[*special, greedy, implementation, math]",PROGRAMMING
+64,Unknown Language Round #1,12,Presents,,D,1298304000,"[*special, greedy]",PROGRAMMING
+64,Unknown Language Round #1,12,Prime Segment,,E,1298304000,"[*special, brute force]",PROGRAMMING
+64,Unknown Language Round #1,12,Domain,,F,1298304000,"[*special, expression parsing]",PROGRAMMING
+64,Unknown Language Round #1,12,Path Canonization,,G,1298304000,[*special],PROGRAMMING
+64,Unknown Language Round #1,12,Table Bowling,,H,1298304000,"[*special, sortings]",PROGRAMMING
+64,Unknown Language Round #1,12,Sort the Table,,I,1298304000,"[*special, sortings]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Where Are My Flakes?,500.0,A,1298131200,"[implementation, two pointers]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Serial Time!,1000.0,B,1298131200,"[dfs and similar, dsu]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Mushroom Strife,1500.0,C,1298131200,"[brute force, dfs and similar]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Savior,2000.0,D,1298131200,"[brute force, dsu, math]",PROGRAMMING
+60,Codeforces Beta Round #56,12,Mushroom Gnomes,2500.0,E,1298131200,"[math, matrices]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Word,500.0,A,1297440000,"[implementation, strings]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Fortune Telling,1000.0,B,1297440000,"[implementation, number theory]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Title,1500.0,C,1297440000,[expression parsing],PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Team Arrangement,2000.0,D,1297440000,"[constructive algorithms, greedy, implementation]",PROGRAMMING
+59,Codeforces Beta Round #55 (Div. 2),2,Shortest Path,2500.0,E,1297440000,"[graphs, shortest paths]",PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Chat room,500.0,A,1296489600,"[greedy, strings]",PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Coins,1000.0,B,1296489600,[greedy],PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Trees,1500.0,C,1296489600,[brute force],PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Calendar,2000.0,D,1296489600,"[greedy, strings]",PROGRAMMING
+58,Codeforces Beta Round #54 (Div. 2),2,Expression,2500.0,E,1296489600,[dp],PROGRAMMING
+57,Codeforces Beta Round #53,12,Square Earth?,500.0,A,1295971200,"[dfs and similar, greedy, implementation]",PROGRAMMING
+57,Codeforces Beta Round #53,12,Martian Architecture,1000.0,B,1295971200,[implementation],PROGRAMMING
+57,Codeforces Beta Round #53,12,Array,1500.0,C,1295971200,"[combinatorics, math]",PROGRAMMING
+57,Codeforces Beta Round #53,12,Journey,2000.0,D,1295971200,"[dp, math]",PROGRAMMING
+57,Codeforces Beta Round #53,12,Chess,2500.0,E,1295971200,"[math, shortest paths]",PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Bar,500.0,A,1295626200,[implementation],PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Spoilt Permutation,1000.0,B,1295626200,[implementation],PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Corporation Mail,1500.0,C,1295626200,"[data structures, expression parsing, implementation]",PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Changing a String,2000.0,D,1295626200,[dp],PROGRAMMING
+56,Codeforces Beta Round #52 (Div. 2),2,Domino Principle,2500.0,E,1295626200,"[binary search, data structures, sortings]",PROGRAMMING
+55,Codeforces Beta Round #51,12,Flea travel,500.0,A,1294992000,"[implementation, math]",PROGRAMMING
+55,Codeforces Beta Round #51,12,Smallest number,1000.0,B,1294992000,[brute force],PROGRAMMING
+55,Codeforces Beta Round #51,12,Pie or die,1500.0,C,1294992000,[games],PROGRAMMING
+55,Codeforces Beta Round #51,12,Beautiful numbers,2000.0,D,1294992000,"[dp, number theory]",PROGRAMMING
+55,Codeforces Beta Round #51,12,Very simple problem,2500.0,E,1294992000,"[geometry, two pointers]",PROGRAMMING
+54,Codeforces Beta Round #50,12,Presents,500.0,A,1294733700,[implementation],PROGRAMMING
+54,Codeforces Beta Round #50,12,Cutting Jigsaw Puzzle,1000.0,B,1294733700,"[hashing, implementation]",PROGRAMMING
+54,Codeforces Beta Round #50,12,First Digit Law,1500.0,C,1294733700,"[dp, math, probabilities]",PROGRAMMING
+54,Codeforces Beta Round #50,12,Writing a Song,2000.0,D,1294733700,"[brute force, dp]",PROGRAMMING
+54,Codeforces Beta Round #50,12,Vacuum Сleaner,2500.0,E,1294733700,[geometry],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Autocomplete,500.0,A,1294329600,[implementation],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Blog Photo,1000.0,B,1294329600,"[binary search, implementation]",PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Little Frog,1500.0,C,1294329600,[constructive algorithms],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Physical Education,2000.0,D,1294329600,[sortings],PROGRAMMING
+53,Codeforces Beta Round #49 (Div. 2),2,Dead Ends,2500.0,E,1294329600,"[bitmasks, dp]",PROGRAMMING
+52,Codeforces Testing Round #1,12,123-sequence,500.0,A,1294160400,[implementation],PROGRAMMING
+52,Codeforces Testing Round #1,12,Right Triangles,1000.0,B,1294160400,[combinatorics],PROGRAMMING
+52,Codeforces Testing Round #1,12,Circular RMQ,1500.0,C,1294160400,[data structures],PROGRAMMING
+51,Codeforces Beta Round #48,12,Cheaterius's Problem,500.0,A,1293552000,[implementation],PROGRAMMING
+51,Codeforces Beta Round #48,12,bHTML Tables Analisys,1000.0,B,1293552000,[expression parsing],PROGRAMMING
+51,Codeforces Beta Round #48,12,Three Base Stations,1500.0,C,1293552000,"[binary search, greedy]",PROGRAMMING
+51,Codeforces Beta Round #48,12,Geometrical problem,2000.0,D,1293552000,[implementation],PROGRAMMING
+51,Codeforces Beta Round #48,12,Pentagon,2500.0,E,1293552000,"[combinatorics, graphs, matrices]",PROGRAMMING
+51,Codeforces Beta Round #48,12,Caterpillar,3000.0,F,1293552000,"[dfs and similar, dp, graphs, trees]",PROGRAMMING
+50,Codeforces Beta Round #47,12,Domino piling,500.0,A,1292862000,"[greedy, math]",PROGRAMMING
+50,Codeforces Beta Round #47,12,Choosing Symbol Pairs,1000.0,B,1292862000,[strings],PROGRAMMING
+50,Codeforces Beta Round #47,12,Happy Farm 5,1500.0,C,1292862000,[geometry],PROGRAMMING
+50,Codeforces Beta Round #47,12,Bombing,2000.0,D,1292862000,"[binary search, dp, probabilities]",PROGRAMMING
+50,Codeforces Beta Round #47,12,Square Equation Roots,2500.0,E,1292862000,[math],PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Sleuth,500.0,A,1292601600,[implementation],PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Sum,1000.0,B,1292601600,[math],PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Disposition,1500.0,C,1292601600,"[constructive algorithms, math]",PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Game,2000.0,D,1292601600,"[brute force, dp, implementation]",PROGRAMMING
+49,Codeforces Beta Round #46 (Div. 2),2,Common ancestor,2500.0,E,1292601600,[dp],PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Rock-paper-scissors,,A,1292140800,"[implementation, schedules]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Land Lot,,B,1292140800,"[brute force, implementation]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,The Race,,C,1292140800,[math],PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Permutations,,D,1292140800,[greedy],PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Ivan the Fool VS Gorynych the Dragon,,E,1292140800,"[dp, games, graphs]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Snow sellers,,F,1292140800,"[greedy, sortings]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Galaxy Union,,G,1292140800,"[dp, trees, two pointers]",PROGRAMMING
+48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Black and White,,H,1292140800,[constructive algorithms],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Triangular numbers,500.0,A,1291737600,"[brute force, math]",PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Coins,1000.0,B,1291737600,[implementation],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Crossword,1500.0,C,1291737600,[implementation],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Safe,2000.0,D,1291737600,[brute force],PROGRAMMING
+47,Codeforces Beta Round #44 (Div. 2),2,Cannon,2500.0,E,1291737600,"[data structures, geometry, sortings]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Ball Game,,A,1291536000,"[brute force, implementation]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,T-shirts from Sponsor,,B,1291536000,[implementation],PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hamsters and Tigers,,C,1291536000,[two pointers],PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Parking Lot,,D,1291536000,"[data structures, implementation]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Comb,,E,1291536000,"[data structures, dp]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hercule Poirot Problem,,F,1291536000,"[dsu, graphs]",PROGRAMMING
+46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Emperor's Problem,,G,1291536000,[geometry],PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Football,500.0,A,1291046400,[strings],PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Letter,1000.0,B,1291046400,"[implementation, strings]",PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Lucky Tickets,1500.0,C,1291046400,[greedy],PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Journey,2000.0,D,1291046400,"[brute force, constructive algorithms, implementation]",PROGRAMMING
+43,Codeforces Beta Round #42 (Div. 2),2,Race,2500.0,E,1291046400,"[brute force, implementation, two pointers]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Guilty --- to the kitchen!,500.0,A,1290096000,"[greedy, implementation]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Game of chess unfinished,1000.0,B,1290096000,[implementation],PROGRAMMING
+42,Codeforces Beta Round #41,12,Safe cracking,1500.0,C,1290096000,"[brute force, constructive algorithms]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Strange town,2000.0,D,1290096000,"[constructive algorithms, math]",PROGRAMMING
+42,Codeforces Beta Round #41,12,Baldman and the military,2500.0,E,1290096000,"[dfs and similar, graphs]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Codecraft III,,A,1289646000,[implementation],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,School,,B,1289646000,"[dp, dsu]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Dancing Lessons,,C,1289646000,[data structures],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Event Dates,,D,1289646000,"[greedy, meet-in-the-middle, sortings]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Director,,E,1289646000,"[constructive algorithms, greedy]",PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Goats and Wolves,,F,1289646000,[greedy],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Prime Problem,,G,1289646000,[number theory],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Road Problem,,H,1289646000,[graphs],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,TCMCF+++,,I,1289646000,[greedy],PROGRAMMING
+45,School Team Contest #3 (Winter Computer School 2010/11),12,Planting Trees,,J,1289646000,[constructive algorithms],PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Translation,500.0,A,1289232000,"[implementation, strings]",PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Martian Dollar,1000.0,B,1289232000,[brute force],PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Email address,1500.0,C,1289232000,"[expression parsing, implementation]",PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,Pawn,2000.0,D,1289232000,[dp],PROGRAMMING
+41,Codeforces Beta Round #40 (Div. 2),2,3-cycles,2500.0,E,1289232000,"[constructive algorithms, graphs, greedy]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Indian Summer,,A,1289041200,[implementation],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Cola,,B,1289041200,[implementation],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Holidays,,C,1289041200,[implementation],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Hyperdrive,,D,1289041200,[math],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Anfisa the Monkey,,E,1289041200,[dp],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,BerPaint,,F,1289041200,"[geometry, graphs]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Shooting Gallery,,G,1289041200,"[data structures, implementation]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Phone Number,,H,1289041200,[dp],PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Toys,,I,1289041200,"[brute force, combinatorics]",PROGRAMMING
+44,School Team Contest #2 (Winter Computer School 2010/11),12,Triminoes,,J,1289041200,"[constructive algorithms, greedy]",PROGRAMMING
+40,Codeforces Beta Round #39,12,Find Color,500.0,A,1288972800,"[constructive algorithms, implementation, math]",PROGRAMMING
+40,Codeforces Beta Round #39,12,Repaintings,1000.0,B,1288972800,[math],PROGRAMMING
+40,Codeforces Beta Round #39,12,Berland Square,1500.0,C,1288972800,[math],PROGRAMMING
+40,Codeforces Beta Round #39,12,Interesting Sequence,2000.0,D,1288972800,[math],PROGRAMMING
+40,Codeforces Beta Round #39,12,Number Table,2500.0,E,1288972800,[combinatorics],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Army,,A,1288440000,[implementation],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Chess,,B,1288440000,"[brute force, implementation, math]",PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Blinds,,C,1288440000,[brute force],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Vasya the Architect,,D,1288440000,[implementation],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Let's Go Rolling!,,E,1288440000,"[dp, sortings]",PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Smart Boy,,F,1288440000,"[dp, games, strings]",PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Queue,,G,1288440000,[data structures],PROGRAMMING
+38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,The Great Marathon,,H,1288440000,[dp],PROGRAMMING
+37,Codeforces Beta Round #37,12,Towers,500.0,A,1288018800,[sortings],PROGRAMMING
+37,Codeforces Beta Round #37,12,Computer Game,1000.0,B,1288018800,"[greedy, implementation]",PROGRAMMING
+37,Codeforces Beta Round #37,12,Old Berland Language,1500.0,C,1288018800,"[data structures, greedy, trees]",PROGRAMMING
+37,Codeforces Beta Round #37,12,Lesson Timetable,2000.0,D,1288018800,"[combinatorics, dp, math]",PROGRAMMING
+37,Codeforces Beta Round #37,12,Trial for Chief,2500.0,E,1288018800,"[graphs, greedy, shortest paths]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,C*++ Calculations,,A,1287904200,"[expression parsing, greedy]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Company Income Growth,,B,1287904200,[greedy],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Moon Craters,,C,1287904200,"[dp, sortings]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Cubical Planet,,D,1287904200,[math],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,What Has Dirichlet Got to Do with That?,,E,1287904200,"[dp, games]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Pacifist frogs,,F,1287904200,[implementation],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Inverse Function,,G,1287904200,[implementation],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Multiplication Table,,H,1287904200,[implementation],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Tram,,I,1287904200,[],PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Spelling Check,,J,1287904200,"[hashing, implementation, strings]",PROGRAMMING
+39,School Team Contest #1 (Winter Computer School 2010/11),12,Testing,,K,1287904200,[],PROGRAMMING
+36,Codeforces Beta Round #36,12,Extra-terrestrial Intelligence,500.0,A,1287482400,[implementation],PROGRAMMING
+36,Codeforces Beta Round #36,12,Fractal,1000.0,B,1287482400,[implementation],PROGRAMMING
+36,Codeforces Beta Round #36,12,Bowls,1500.0,C,1287482400,"[geometry, implementation]",PROGRAMMING
+36,Codeforces Beta Round #36,12,New Game with a Chess Piece,2000.0,D,1287482400,[games],PROGRAMMING
+36,Codeforces Beta Round #36,12,Two Paths,2500.0,E,1287482400,"[constructive algorithms, dsu, graphs, implementation]",PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Shell Game,500.0,A,1287471600,[implementation],PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Warehouse,1000.0,B,1287471600,[implementation],PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Fire Again,1500.0,C,1287471600,"[brute force, dfs and similar, shortest paths]",PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Animals,2000.0,D,1287471600,"[dp, greedy]",PROGRAMMING
+35,Codeforces Beta Round #35 (Div. 2),2,Parade,2500.0,E,1287471600,"[data structures, sortings]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Reconnaissance 2,500.0,A,1286802000,[implementation],PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Sale,1000.0,B,1286802000,"[greedy, sortings]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Page Numbers,1500.0,C,1286802000,"[expression parsing, implementation, sortings, strings]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Road Map,2000.0,D,1286802000,"[dfs and similar, graphs]",PROGRAMMING
+34,Codeforces Beta Round #34 (Div. 2),2,Collisions,2500.0,E,1286802000,"[brute force, implementation, math]",PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,What is for dinner?,500.0,A,1286463600,"[greedy, implementation]",PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,String Problem,1000.0,B,1286463600,[shortest paths],PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,Wonderful Randomized Sum,1500.0,C,1286463600,[greedy],PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,Knights,2000.0,D,1286463600,"[geometry, graphs, shortest paths, sortings]",PROGRAMMING
+33,Codeforces Beta Round #33 (Codeforces format),12,Helper,2500.0,E,1286463600,[],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Reconnaissance,500.0,A,1286002800,[brute force],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Borze,1000.0,B,1286002800,"[expression parsing, implementation]",PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Flea,1500.0,C,1286002800,[math],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Constellation,2000.0,D,1286002800,[implementation],PROGRAMMING
+32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Hide-and-Seek,2500.0,E,1286002800,"[geometry, implementation]",PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Worms Evolution,500.0,A,1285599600,[implementation],PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Sysadmin Bob,1000.0,B,1285599600,[strings],PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Schedule,1500.0,C,1285599600,[implementation],PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Chocolate,2000.0,D,1285599600,"[dfs and similar, implementation]",PROGRAMMING
+31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,TV Game,2500.0,E,1285599600,[dp],PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Accounting,500.0,A,1285340400,"[brute force, math]",PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Codeforces World Finals,1000.0,B,1285340400,[implementation],PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Shooting Gallery,1500.0,C,1285340400,"[dp, probabilities]",PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,King's Problem?,2000.0,D,1285340400,"[geometry, greedy]",PROGRAMMING
+30,Codeforces Beta Round #30 (Codeforces format),12,Tricky and Clever Password,2500.0,E,1285340400,"[binary search, constructive algorithms, data structures, greedy, hashing, strings]",PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Spit Problem,500.0,A,1284994800,[brute force],PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Traffic Lights,1000.0,B,1284994800,[implementation],PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Mail Stamps,1500.0,C,1284994800,"[data structures, dfs and similar, graphs, implementation]",PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Ant on the Tree,2000.0,D,1284994800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING
+29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Quarrel,2500.0,E,1284994800,"[graphs, shortest paths]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,Bender Problem,500.0,A,1284735600,[implementation],PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,pSort,1000.0,B,1284735600,"[dfs and similar, dsu, graphs]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,Bath Queue,1500.0,C,1284735600,"[combinatorics, dp, probabilities]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,"Don't fear, DravDe is kind",2000.0,D,1284735600,"[binary search, data structures, dp, hashing]",PROGRAMMING
+28,Codeforces Beta Round #28 (Codeforces format),12,DravDe saves the world,2500.0,E,1284735600,"[geometry, math]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Next Test,500.0,A,1284130800,"[implementation, sortings]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Tournament,1000.0,B,1284130800,"[bitmasks, brute force, dfs and similar, greedy]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Unordered Subsequence,1500.0,C,1284130800,"[constructive algorithms, greedy]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Ring Road 2,2000.0,D,1284130800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING
+27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Number With The Given Amount Of Divisors,2500.0,E,1284130800,"[brute force, dp, number theory]",PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Almost Prime,500.0,A,1281970800,[number theory],PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Regular Bracket Sequence,1000.0,B,1281970800,[greedy],PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Parquet,1500.0,C,1281970800,"[combinatorics, constructive algorithms]",PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Tickets,2000.0,D,1281970800,"[combinatorics, probabilities]",PROGRAMMING
+26,Codeforces Beta Round #26 (Codeforces format),12,Multithreading,2500.0,E,1281970800,[constructive algorithms],PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,IQ test,,A,1280761200,[brute force],PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,Phone numbers,,B,1280761200,[implementation],PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,Roads in Berland,,C,1280761200,"[graphs, shortest paths]",PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,Roads not only in Berland,,D,1280761200,"[dsu, graphs, trees]",PROGRAMMING
+25,Codeforces Beta Round #25 (Div. 2 Only),2,Test,,E,1280761200,"[hashing, strings]",PROGRAMMING
+24,Codeforces Beta Round #24,12,Ring road,,A,1280149200,[graphs],PROGRAMMING
+24,Codeforces Beta Round #24,12,F1 Champions,,B,1280149200,[implementation],PROGRAMMING
+24,Codeforces Beta Round #24,12,Sequence of points,,C,1280149200,"[geometry, implementation, math]",PROGRAMMING
+24,Codeforces Beta Round #24,12,Broken robot,,D,1280149200,"[dp, probabilities]",PROGRAMMING
+24,Codeforces Beta Round #24,12,Berland collider,,E,1280149200,[binary search],PROGRAMMING
+23,Codeforces Beta Round #23,12,You're Given a String...,,A,1278687600,"[brute force, greedy]",PROGRAMMING
+23,Codeforces Beta Round #23,12,Party,,B,1278687600,"[constructive algorithms, graphs, math]",PROGRAMMING
+23,Codeforces Beta Round #23,12,Oranges and Apples,,C,1278687600,"[constructive algorithms, sortings]",PROGRAMMING
+23,Codeforces Beta Round #23,12,Tetragon,,D,1278687600,"[geometry, math]",PROGRAMMING
+23,Codeforces Beta Round #23,12,Tree,,E,1278687600,[dp],PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,Second Order Statistics,,A,1277823600,[brute force],PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,Bargaining Table,,B,1277823600,"[brute force, dp]",PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,System Administrator,,C,1277823600,[graphs],PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,Segments,,D,1277823600,"[greedy, sortings]",PROGRAMMING
+22,Codeforces Beta Round #22 (Div. 2 Only),2,Scheme,,E,1277823600,"[dfs and similar, graphs, trees]",PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Jabber ID,500.0,A,1277730300,[implementation],PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Intersection,1000.0,B,1277730300,"[implementation, math]",PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Stripe 2,1500.0,C,1277730300,"[binary search, dp, sortings]",PROGRAMMING
+21,Codeforces Alpha Round #21 (Codeforces format),12,Traveling Graph,2000.0,D,1277730300,"[bitmasks, graph matchings, graphs]",PROGRAMMING
+19,Codeforces Beta Round #19,12,World Football Cup,,A,1277391600,[implementation],PROGRAMMING
+19,Codeforces Beta Round #19,12,Checkout Assistant,,B,1277391600,[dp],PROGRAMMING
+19,Codeforces Beta Round #19,12,Deletion of Repeats,,C,1277391600,"[greedy, hashing, string suffix structures]",PROGRAMMING
+19,Codeforces Beta Round #19,12,Points,,D,1277391600,[data structures],PROGRAMMING
+19,Codeforces Beta Round #19,12,Fairy,,E,1277391600,"[dfs and similar, divide and conquer, dsu]",PROGRAMMING
+20,Codeforces Alpha Round #20 (Codeforces format),12,BerOS file system,500.0,A,1276875000,[implementation],PROGRAMMING
+20,Codeforces Alpha Round #20 (Codeforces format),12,Equation,1000.0,B,1276875000,[math],PROGRAMMING
+20,Codeforces Alpha Round #20 (Codeforces format),12,Dijkstra?,1500.0,C,1276875000,"[graphs, shortest paths]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Triangle,,A,1276700400,"[brute force, geometry]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Platforms,,B,1276700400,"[brute force, math]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Stripe,,C,1276700400,"[data structures, implementation]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Seller Bob,,D,1276700400,"[brute force, dp, greedy]",PROGRAMMING
+18,Codeforces Beta Round #18 (Div. 2 Only),2,Flag 2,,E,1276700400,[dp],PROGRAMMING
+17,Codeforces Beta Round #17,12,Noldbach problem,,A,1276182000,"[brute force, math, number theory]",PROGRAMMING
+17,Codeforces Beta Round #17,12,Hierarchy,,B,1276182000,"[dfs and similar, dsu, greedy, shortest paths]",PROGRAMMING
+17,Codeforces Beta Round #17,12,Balance,,C,1276182000,[dp],PROGRAMMING
+17,Codeforces Beta Round #17,12,Notepad,,D,1276182000,[number theory],PROGRAMMING
+17,Codeforces Beta Round #17,12,Palisection,,E,1276182000,[strings],PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Flag,,A,1275570000,[implementation],PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Burglar and Matches,,B,1275570000,"[greedy, implementation, sortings]",PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Monitor,,C,1275570000,"[binary search, number theory]",PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Logging,,D,1275570000,"[implementation, strings]",PROGRAMMING
+16,Codeforces Beta Round #16 (Div. 2 Only),2,Fish,,E,1275570000,"[bitmasks, dp, probabilities]",PROGRAMMING
+15,Codeforces Beta Round #15,12,Cottage Village,,A,1275145200,"[implementation, sortings]",PROGRAMMING
+15,Codeforces Beta Round #15,12,Laser,,B,1275145200,[math],PROGRAMMING
+15,Codeforces Beta Round #15,12,Industrial Nim,,C,1275145200,[games],PROGRAMMING
+15,Codeforces Beta Round #15,12,Map,,D,1275145200,"[data structures, implementation, sortings]",PROGRAMMING
+15,Codeforces Beta Round #15,12,Triangles,,E,1275145200,"[combinatorics, dp]",PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Letter,,A,1274283000,[implementation],PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Young Photographer,,B,1274283000,[implementation],PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Four Segments,,C,1274283000,"[brute force, constructive algorithms, geometry, implementation, math]",PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Two Paths,,D,1274283000,"[dfs and similar, dp, graphs, shortest paths, trees, two pointers]",PROGRAMMING
+14,Codeforces Beta Round #14 (Div. 2),2,Camels,,E,1274283000,[dp],PROGRAMMING
+13,Codeforces Beta Round #13,12,Numbers,,A,1273154400,"[implementation, math]",PROGRAMMING
+13,Codeforces Beta Round #13,12,Letter A,,B,1273154400,"[geometry, implementation]",PROGRAMMING
+13,Codeforces Beta Round #13,12,Sequence,,C,1273154400,"[dp, sortings]",PROGRAMMING
+13,Codeforces Beta Round #13,12,Triangles,,D,1273154400,"[dp, geometry]",PROGRAMMING
+13,Codeforces Beta Round #13,12,Holes,,E,1273154400,"[data structures, dsu]",PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Super Agent,,A,1272538800,[implementation],PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Correct Solution?,,B,1272538800,"[implementation, sortings]",PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Fruits,,C,1272538800,"[implementation, sortings]",PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Ball,,D,1272538800,"[data structures, sortings]",PROGRAMMING
+12,Codeforces Beta Round #12 (Div 2 Only),12,Start of the session,,E,1272538800,[constructive algorithms],PROGRAMMING
+11,Codeforces Beta Round #11,12,Increasing Sequence,,A,1272294000,"[constructive algorithms, implementation, math]",PROGRAMMING
+11,Codeforces Beta Round #11,12,Jumping Jack,,B,1272294000,[math],PROGRAMMING
+11,Codeforces Beta Round #11,12,How Many Squares?,,C,1272294000,[implementation],PROGRAMMING
+11,Codeforces Beta Round #11,12,A Simple Task,,D,1272294000,"[bitmasks, dp, graphs]",PROGRAMMING
+11,Codeforces Beta Round #11,12,"Forward, march!",,E,1272294000,"[binary search, dp, greedy]",PROGRAMMING
+10,Codeforces Beta Round #10,12,Power Consumption Calculation,,A,1271346300,[implementation],PROGRAMMING
+10,Codeforces Beta Round #10,12,Cinema Cashier,,B,1271346300,"[dp, implementation]",PROGRAMMING
+10,Codeforces Beta Round #10,12,Digital Root,,C,1271346300,[number theory],PROGRAMMING
+10,Codeforces Beta Round #10,12,LCIS,,D,1271346300,[dp],PROGRAMMING
+10,Codeforces Beta Round #10,12,Greedy Change,,E,1271346300,[constructive algorithms],PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,Die Roll,,A,1270983600,"[math, probabilities]",PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,Running Student,,B,1270983600,"[brute force, geometry, implementation]",PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,Hexadecimal's Numbers,,C,1270983600,"[brute force, implementation, math]",PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,How many trees?,,D,1270983600,"[combinatorics, divide and conquer, dp]",PROGRAMMING
+9,Codeforces Beta Round #9 (Div. 2 Only),2,Interestring graph and Apples,,E,1270983600,"[dfs and similar, dsu, graphs]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Train and Peter,,A,1270741500,[strings],PROGRAMMING
+8,Codeforces Beta Round #8,12,Obsession with Robots,,B,1270741500,"[constructive algorithms, graphs, implementation]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Looking for Order,,C,1270741500,"[bitmasks, dp]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Two Friends,,D,1270741500,"[binary search, geometry]",PROGRAMMING
+8,Codeforces Beta Round #8,12,Beads,,E,1270741500,"[dp, graphs]",PROGRAMMING
+7,Codeforces Beta Round #7,12,Kalevitch and Chess,,A,1270136700,"[brute force, constructive algorithms]",PROGRAMMING
+7,Codeforces Beta Round #7,12,Memory Manager,,B,1270136700,[implementation],PROGRAMMING
+7,Codeforces Beta Round #7,12,Line,,C,1270136700,"[math, number theory]",PROGRAMMING
+7,Codeforces Beta Round #7,12,Palindrome Degree,,D,1270136700,"[hashing, strings]",PROGRAMMING
+7,Codeforces Beta Round #7,12,Defining Macros,,E,1270136700,"[dp, expression parsing, implementation]",PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,Triangle,,A,1269673200,"[brute force, geometry]",PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,President's Office,,B,1269673200,[implementation],PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,"Alice, Bob and Chocolate",,C,1269673200,"[greedy, two pointers]",PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,Lizards and Basements 2,,D,1269673200,"[brute force, dp]",PROGRAMMING
+6,Codeforces Beta Round #6 (Div. 2 Only),2,Exposition,,E,1269673200,"[binary search, data structures, dsu, trees, two pointers]",PROGRAMMING
+5,Codeforces Beta Round #5,12,Chat Servers Outgoing Traffic,,A,1269100800,[implementation],PROGRAMMING
+5,Codeforces Beta Round #5,12,Center Alignment,,B,1269100800,"[implementation, strings]",PROGRAMMING
+5,Codeforces Beta Round #5,12,Longest Regular Bracket Sequence,,C,1269100800,"[constructive algorithms, data structures, dp, greedy, sortings, strings]",PROGRAMMING
+5,Codeforces Beta Round #5,12,Follow Traffic Rules,,D,1269100800,"[implementation, math]",PROGRAMMING
+5,Codeforces Beta Round #5,12,Bindian Signalizing,,E,1269100800,[data structures],PROGRAMMING
+4,Codeforces Beta Round #4 (Div. 2 Only),2,Watermelon,,A,1268395200,"[brute force, math]",PROGRAMMING
+4,Codeforces Beta Round #4 (Div. 2 Only),2,Before an Exam,,B,1268395200,"[constructive algorithms, greedy]",PROGRAMMING
+4,Codeforces Beta Round #4 (Div. 2 Only),2,Registration System,,C,1268395200,"[data structures, hashing, implementation]",PROGRAMMING
+4,Codeforces Beta Round #4 (Div. 2 Only),2,Mysterious Present,,D,1268395200,"[dp, sortings]",PROGRAMMING
+3,Codeforces Beta Round #3,12,Shortest path of the king,,A,1267963200,"[greedy, shortest paths]",PROGRAMMING
+3,Codeforces Beta Round #3,12,Lorry,,B,1267963200,"[greedy, sortings]",PROGRAMMING
+3,Codeforces Beta Round #3,12,Tic-tac-toe,,C,1267963200,"[brute force, games, implementation]",PROGRAMMING
+3,Codeforces Beta Round #3,12,Least Cost Bracket Sequence,,D,1267963200,[greedy],PROGRAMMING
+2,Codeforces Beta Round #2,12,Winner,,A,1267117200,"[hashing, implementation]",PROGRAMMING
+2,Codeforces Beta Round #2,12,The least round way,,B,1267117200,"[dp, math]",PROGRAMMING
+2,Codeforces Beta Round #2,12,Commentator problem,,C,1267117200,[geometry],PROGRAMMING
+1,Codeforces Beta Round #1,12,Theatre Square,,A,1266580800,[math],PROGRAMMING
+1,Codeforces Beta Round #1,12,Spreadsheet,,B,1266580800,"[implementation, math]",PROGRAMMING
+1,Codeforces Beta Round #1,12,Ancient Berland Circus,,C,1266580800,"[geometry, math]",PROGRAMMING
+979,Codeforces Round #482 (Div. 2),2,"Pizza, Pizza, Pizza!!!",500.0,A,1526308500,[math],PROGRAMMING
+979,Codeforces Round #482 (Div. 2),2,Treasure Hunt,1000.0,B,1526308500,[greedy],PROGRAMMING
+979,Codeforces Round #482 (Div. 2),2,Kuro and Walking Route,1250.0,C,1526308500,[dfs and similar],PROGRAMMING
+979,Codeforces Round #482 (Div. 2),2,Kuro and GCD and XOR and SUM,1750.0,D,1526308500,"[bitmasks, brute force, data structures, strings, trees]",PROGRAMMING
+979,Codeforces Round #482 (Div. 2),2,Kuro and Topological Parity,2250.0,E,1526308500,[dp],PROGRAMMING
+978,Codeforces Round #481 (Div. 3),12,Remove Duplicates,,A,1526202300,[implementation],PROGRAMMING
+978,Codeforces Round #481 (Div. 3),12,File Name,,B,1526202300,"[greedy, strings]",PROGRAMMING
+978,Codeforces Round #481 (Div. 3),12,Letters,,C,1526202300,"[binary search, implementation, two pointers]",PROGRAMMING
+978,Codeforces Round #481 (Div. 3),12,Almost Arithmetic Progression,,D,1526202300,"[brute force, implementation, math]",PROGRAMMING
+978,Codeforces Round #481 (Div. 3),12,Bus Video System,,E,1526202300,[math],PROGRAMMING
+978,Codeforces Round #481 (Div. 3),12,Mentors,,F,1526202300,"[binary search, data structures, implementation]",PROGRAMMING
+978,Codeforces Round #481 (Div. 3),12,Petya's Exams,,G,1526202300,"[greedy, implementation, sortings]",PROGRAMMING
diff --git a/ui/problem_ratings.csv b/ui/problem_ratings.csv
index 1852c10..1ccf0fc 100644
--- a/ui/problem_ratings.csv
+++ b/ui/problem_ratings.csv
@@ -3271,3 +3271,755 @@ contestID,problemID,problemRating
707,C,1591
707,D,2188
707,E,2489
+935,A,590
+935,B,964
+935,C,1669
+935,D,1921
+935,E,2410
+935,F,5000
+939,A,859
+939,B,1181
+939,C,1595
+939,D,1591
+939,E,1903
+939,F,2570
+932,A,824
+932,B,1295
+932,C,1566
+932,D,2188
+932,E,2337
+932,F,2706
+932,G,3085
+933,A,1800
+933,B,1937
+933,C,2717
+933,D,2917
+933,E,3237
+934,A,1504
+934,B,1239
+934,C,1860
+934,D,2070
+934,E,2599
+922,A,1454
+922,B,1308
+922,C,1636
+922,D,1836
+922,E,2290
+922,F,2841
+919,A,901
+919,B,1155
+919,C,1411
+919,D,1772
+919,E,2153
+919,F,2707
+917,A,1824
+917,B,1653
+917,C,2907
+917,D,2629
+917,E,5000
+918,A,946
+918,B,1038
+918,C,1950
+918,D,1934
+918,E,5000
+914,A,1144
+914,B,1359
+914,C,1996
+914,D,1954
+914,E,2492
+914,F,2987
+914,G,2583
+914,H,3577
+913,A,1021
+913,B,1350
+913,C,1693
+913,D,1829
+913,E,2451
+913,F,2849
+913,G,3119
+913,H,5000
+912,A,940
+912,B,1448
+912,C,2554
+912,D,2092
+912,E,2554
+908,A,754
+908,B,1359
+908,C,1598
+908,D,2219
+908,E,2485
+908,F,2382
+908,G,2807
+908,H,3159
+909,A,1118
+909,B,1329
+909,C,1847
+909,D,2115
+909,E,2137
+909,F,2649
+904,A,1480
+904,B,1474
+904,C,1651
+904,D,2516
+904,E,2587
+904,F,5000
+906,A,1527
+906,B,2192
+906,C,2387
+906,D,2707
+906,E,3402
+907,A,1439
+907,B,1418
+907,C,1640
+907,D,2473
+907,E,2463
+907,F,2697
+901,A,1620
+901,B,2186
+901,C,2283
+901,D,2749
+901,E,5000
+902,A,1236
+902,B,1317
+902,C,1574
+902,D,2172
+902,E,2633
+899,A,955
+899,B,1453
+899,C,1322
+899,D,1816
+899,E,2104
+899,F,2234
+898,A,845
+898,B,1379
+898,C,1482
+898,D,1729
+898,E,1695
+898,F,2542
+900,A,968
+900,B,1424
+900,C,1772
+900,D,2109
+900,E,2298
+896,A,1670
+896,B,1992
+896,C,2680
+896,D,2909
+896,E,3301
+897,A,707
+897,B,1350
+897,C,1797
+897,D,2141
+897,E,5000
+895,A,1361
+895,B,1761
+895,C,2068
+895,D,2353
+895,E,2591
+894,A,907
+894,B,1842
+894,C,1923
+894,D,2306
+894,E,2440
+891,A,1774
+891,B,2034
+891,C,2328
+891,D,3149
+891,E,2924
+892,A,1029
+892,B,1357
+892,C,1682
+892,D,2045
+892,E,2552
+878,A,1461
+878,B,2322
+878,C,2700
+878,D,2916
+878,E,3456
+879,A,1118
+879,B,1455
+879,C,1703
+879,D,2537
+879,E,2997
+877,A,1314
+877,B,1579
+877,C,1631
+877,D,2159
+877,E,1998
+877,F,2558
+875,A,1100
+875,B,1501
+875,C,2174
+875,D,2133
+875,E,2610
+875,F,2452
+876,A,1088
+876,B,1336
+876,C,1263
+876,D,1521
+876,E,2204
+876,F,2213
+870,A,1322
+870,B,1593
+870,C,1627
+870,D,2356
+870,E,5000
+870,F,5000
+871,A,1004
+871,B,2074
+871,C,2233
+871,D,2679
+871,E,3078
+872,A,1060
+872,B,1349
+872,C,1391
+872,D,2192
+872,E,2427
+869,A,1360
+869,B,1266
+869,C,1781
+869,D,2984
+869,E,2339
+868,A,1106
+868,B,1590
+868,C,1646
+868,D,2211
+868,E,2718
+868,F,2554
+868,G,5000
+865,A,1799
+865,B,1966
+865,C,2209
+865,D,2270
+865,E,5000
+865,F,5000
+865,G,5000
+866,A,1381
+866,B,2039
+866,C,2427
+866,D,2354
+866,E,3454
+866,F,3454
+866,G,3596
+867,A,600
+867,B,1406
+867,C,1916
+867,D,2647
+867,E,2280
+867,F,5000
+864,A,1154
+864,B,1142
+864,C,1522
+864,D,1559
+864,E,2010
+864,F,2765
+855,A,781
+855,B,1591
+855,C,2055
+855,D,2504
+855,E,2270
+855,F,3048
+855,G,3310
+862,A,1125
+862,B,1406
+862,C,1953
+862,D,2057
+862,E,2200
+862,F,2980
+859,A,809
+859,B,1085
+859,C,1533
+859,D,2130
+859,E,2086
+859,F,2886
+859,G,3041
+853,A,1389
+853,B,1948
+853,C,2068
+853,D,2516
+853,E,5000
+940,A,1301
+940,B,1445
+940,C,1509
+940,D,1645
+940,E,1999
+940,F,2825
+936,A,1676
+936,B,2197
+936,C,2249
+936,D,2991
+936,E,3579
+937,A,770
+937,B,1473
+937,C,1715
+937,D,2253
+937,E,2576
+854,A,919
+854,B,1249
+854,C,1533
+854,D,1993
+854,E,2429
+850,A,1759
+850,B,2224
+850,C,2224
+850,D,2801
+850,E,2789
+850,F,2937
+851,A,913
+851,B,1516
+851,C,1704
+851,D,2219
+851,E,2502
+848,A,1455
+848,B,1943
+848,C,2571
+848,D,3000
+848,E,5000
+849,A,1197
+849,B,1683
+849,C,1579
+849,D,2248
+849,E,2798
+842,A,1401
+842,B,1169
+842,C,1992
+842,D,2086
+842,E,2829
+843,A,1290
+843,B,2127
+843,C,2684
+843,D,3521
+843,E,3124
+844,A,1067
+844,B,1411
+844,C,1457
+844,D,2146
+844,E,2837
+841,A,1007
+841,B,1310
+841,C,1356
+841,D,2144
+841,E,2767
+839,A,1096
+839,B,2040
+839,C,1531
+839,D,2163
+839,E,2612
+835,A,652
+835,B,1189
+835,C,1590
+835,D,1956
+835,E,2460
+835,F,2484
+833,A,1900
+833,B,2192
+833,C,2770
+833,D,2927
+833,E,5000
+834,A,1132
+834,B,1241
+834,C,1801
+834,D,2327
+834,E,5000
+832,A,894
+832,B,1785
+832,C,2673
+832,D,1960
+832,E,2650
+830,A,1908
+830,B,1597
+830,C,2423
+830,D,2805
+830,E,3458
+831,A,1269
+831,B,898
+831,C,1735
+831,D,1978
+831,E,2038
+831,F,2977
+827,A,1878
+827,B,1795
+827,C,2064
+827,D,2742
+827,E,2677
+827,F,3402
+828,A,1417
+828,B,1478
+828,C,1851
+828,D,1843
+828,E,2305
+828,F,2951
+822,A,857
+822,B,1278
+822,C,1809
+822,D,1885
+822,E,2718
+822,F,2679
+815,A,1913
+815,B,2203
+815,C,2386
+815,D,2788
+815,E,2965
+816,A,1246
+816,B,1437
+816,C,1767
+816,D,2329
+816,E,2552
+814,A,1121
+814,B,1559
+814,C,1655
+814,D,1989
+814,E,2783
+812,A,1363
+812,B,1653
+812,C,1538
+812,D,2653
+812,E,2269
+811,A,952
+811,B,1440
+811,C,1899
+811,D,2039
+811,E,2482
+809,A,1452
+809,B,2323
+809,C,2598
+809,D,2854
+809,E,3537
+810,A,1107
+810,B,1421
+810,C,1576
+810,D,2338
+810,E,2915
+794,A,851
+794,B,1271
+794,C,1799
+794,D,2477
+794,E,2741
+794,F,2770
+794,G,5000
+799,A,1230
+799,B,1409
+799,C,1786
+799,D,2126
+799,E,2579
+799,F,3347
+799,G,3642
+806,A,1710
+806,B,2062
+806,C,2206
+806,D,2665
+806,E,3009
+806,F,5000
+807,A,992
+807,B,1374
+807,C,1721
+807,D,2175
+807,E,2379
+807,F,5000
+804,A,1223
+804,B,1430
+804,C,2190
+804,D,2457
+804,E,2922
+804,F,5000
+805,A,1136
+805,B,1036
+805,C,1097
+805,D,1454
+805,E,2466
+805,F,2748
+793,A,1051
+793,B,1654
+793,C,2434
+793,D,2096
+793,E,2939
+793,F,3046
+793,G,5000
+798,A,1131
+798,B,1460
+798,C,1720
+798,D,2342
+798,E,2871
+800,A,2076
+800,B,1858
+800,C,2246
+800,D,2718
+800,E,3493
+801,A,1158
+801,B,1002
+801,C,1871
+801,D,1863
+801,E,2635
+796,A,958
+796,B,1392
+796,C,1979
+796,D,2067
+796,E,2781
+796,F,5000
+975,A,978
+975,B,1191
+975,C,1394
+975,D,1994
+975,E,2834
+966,A,1715
+966,B,1750
+966,C,2111
+966,D,2619
+966,E,3037
+966,F,5000
+967,A,1350
+967,B,1130
+967,C,1717
+967,D,1877
+967,E,2316
+967,F,2803
+965,A,912
+965,B,1434
+965,C,2065
+965,D,1913
+965,E,2527
+963,A,1815
+963,B,1966
+963,C,2574
+963,D,2510
+963,E,3233
+959,A,573
+959,B,1266
+959,C,1519
+959,D,1964
+959,E,1828
+959,F,2552
+956,A,1412
+956,B,1694
+956,C,1764
+956,D,2419
+956,E,2679
+956,F,5000
+957,A,1384
+957,B,1421
+957,C,1597
+957,D,1864
+957,E,2615
+955,A,1154
+955,B,1423
+955,C,2093
+955,D,2925
+955,E,2925
+955,F,2804
+947,A,1589
+947,B,1471
+947,C,1699
+947,D,2587
+947,E,3474
+947,F,5000
+948,A,1159
+948,B,1750
+948,C,1625
+948,D,1953
+948,E,2709
+949,A,1550
+949,B,1693
+949,C,2002
+949,D,2321
+949,E,2728
+949,F,5000
+930,A,1263
+930,B,1605
+930,C,1899
+930,D,2528
+930,E,2926
+944,A,1306
+944,B,1557
+944,C,1306
+944,D,1684
+944,E,1965
+944,F,2789
+944,G,2789
+960,A,1312
+960,B,1443
+960,C,1725
+960,D,2083
+960,E,2308
+960,F,2033
+960,G,2922
+960,H,3123
+950,A,957
+950,B,1176
+950,C,1634
+950,D,1782
+950,E,2171
+950,F,2488
+980,A,972
+980,B,1567
+980,C,1696
+980,D,2341
+980,E,2361
+980,F,5000
+931,A,695
+931,B,1317
+931,C,1717
+931,D,1555
+931,E,2038
+931,F,2304
+977,A,534
+977,B,1014
+977,C,1279
+977,D,1445
+977,E,1601
+977,F,1793
+964,A,881
+964,B,1350
+964,C,1902
+964,D,2123
+964,E,2690
+976,A,832
+976,B,1349
+976,C,1551
+976,D,2437
+976,E,2067
+976,F,5000
+962,A,1330
+962,B,1352
+962,C,1410
+962,D,1638
+962,E,2125
+962,F,2724
+962,G,5000
+961,A,926
+961,B,1244
+961,C,1419
+961,D,1899
+961,E,1884
+961,F,2840
+961,G,2840
+954,A,820
+954,B,1456
+954,C,1639
+954,D,1584
+954,E,1897
+954,F,2174
+954,G,2004
+954,H,2526
+954,I,2526
+946,A,788
+946,B,1232
+946,C,1357
+946,D,1863
+946,E,2256
+946,F,2670
+946,G,2759
+938,A,878
+938,B,1127
+938,C,1732
+938,D,1960
+938,E,2309
+938,F,2793
+938,G,5000
+920,A,1090
+920,B,1301
+920,C,1453
+920,D,2587
+920,E,2024
+920,F,2026
+920,G,2281
+915,A,941
+915,B,1380
+915,C,1712
+915,D,2220
+915,E,2225
+915,F,2445
+915,G,2512
+911,A,1094
+911,B,1260
+911,C,1442
+911,D,1748
+911,E,1975
+911,F,2485
+911,G,2536
+903,A,1027
+903,B,1309
+903,C,1268
+903,D,2161
+903,E,2244
+903,F,2683
+903,G,5000
+893,A,1015
+893,B,1151
+893,C,1369
+893,D,1888
+893,E,2055
+893,F,2416
+840,A,1371
+840,B,2038
+840,C,2491
+840,D,2554
+840,E,3212
+615,A,656
+615,B,1727
+615,C,1957
+615,D,2028
+615,E,2203
+458,A,1853
+458,B,1963
+458,C,2069
+458,D,2815
+458,E,5000
+458,F,5000
+339,A,863
+339,B,1137
+339,C,1780
+339,D,1665
+339,E,2696
+335,A,1582
+335,B,1957
+335,C,2097
+335,D,2617
+335,E,5000
+335,F,5000
+245,A,1217
+245,B,1500
+245,C,2094
+245,D,1735
+245,E,1719
+245,F,5000
+245,G,5000
+245,H,5000
+241,A,1302
+241,B,2649
+241,C,1938
+241,D,3072
+241,E,2541
+241,F,2292
+241,G,1837
+183,A,1819
+183,B,1866
+183,C,2284
+183,D,2784
+183,E,2784
+108,A,1155
+108,B,1543
+108,C,1601
+108,D,1782
+108,E,2662
+11,A,972
+11,B,1451
+11,C,1840
+11,D,1885
+11,E,2469
+8,A,1267
+8,B,1329
+8,C,1759
+8,D,2342
+8,E,2258
+979,A,1153
+979,B,1892
+979,C,1657
+979,D,2251
+979,E,2781
+978,A,845
+978,B,852
+978,C,1159
+978,D,1568
+978,E,1476
+978,F,1561
+978,G,1803
diff --git a/ui/ui_functions.py b/ui/ui_functions.py
index 1ea76ff..fce1b43 100644
--- a/ui/ui_functions.py
+++ b/ui/ui_functions.py
@@ -32,26 +32,48 @@ def updateProblemData(prevFile, newFile, force):
df_prev = pd.read_csv(prevFile, index_col=None, engine='c')
cur_contests = api.getContestList()
- max_prev_contests = max(df_prev.contestID)
- new_contests = [c for c in cur_contests if c > max_prev_contests]
+ tmp_list = dict(df_prev.contestID)
+ tmp_list = set([tmp_list[key] for key in tmp_list])
+
+ good = []
+ for key in tmp_list:
+ try:
+ int(key)
+ good.append(int(key))
+ except:
+ continue
+
+ tmp_list = set(good)
+
+ bad_contests = {}
+ with open('bad_contests.txt', 'r') as f:
+ l = [int(x) for x in f.read().split()]
+ for x in l:
+ bad_contests[x] = 1
+
+ new_contests = []
+ for c in cur_contests:
+ if c not in tmp_list and c not in bad_contests:
+ new_contests.append(c)
dflist = []
cnt = 0
for contestID in new_contests:
- print " contest", contestID
- try:
- contestProblems = api.getProblemDataFromContest(contestID)
- contestProblems = contestProblems.rename(index=str, columns={'index': 'problemID'})
- contestProblems = contestProblems.drop('contestId', 1)
- dflist.append(contestProblems)
- cnt += 1
- except api.ContestNotFound:
- sys.stderr.write(str(contestID) + ', api returned contest not found error.')
-
+ print " contest", contestID
+ try:
+ contestProblems = api.getProblemDataFromContest(contestID)
+ contestProblems = contestProblems.rename(index=str, columns={'index': 'problemID'})
+ contestProblems = contestProblems.drop('contestId', 1)
+ dflist.append(contestProblems)
+ cnt += 1
+ except api.ContestNotFound:
+ sys.stderr.write(str(contestID) + ', api returned contest not found error.')
+
if not dflist:
- print " Problem ratings file up to date."
- return
+ print " Problem ratings file up to date."
+ return
+
problemData = pd.concat(dflist)
writeFile(problemData, newFile, force)
sys.stderr.write("Successfully wrote problem data from " + str(cnt) + " contests.")
@@ -65,21 +87,32 @@ def updateProblemRating(prevFile, newFile, force):
df_prev = pd.read_csv(prevFile, index_col=None, engine='c')
cur_contests = api.getContestList()
- max_prev_contests = max(df_prev.contestID)
- new_contests = [c for c in cur_contests if c > max_prev_contests]
+ tmp_list = dict(df_prev.contestID)
+ tmp_list = set([tmp_list[key] for key in tmp_list])
+
+ bad_contests = {}
+ with open('bad_contests.txt', 'r') as f:
+ l = [int(x) for x in f.read().split()]
+ for x in l:
+ bad_contests[x] = 1
+
+ new_contests = []
+ for c in cur_contests:
+ if c not in tmp_list and c not in bad_contests:
+ new_contests.append(c)
dflist = []
cnt = 0
for contestID in new_contests:
- print " contest", contestID
- df = elo.get_contest_elo(contestID)
- dflist.append(df)
- cnt += 1
+ print " contest", contestID
+ df = elo.get_contest_elo(contestID)
+ dflist.append(df)
+ cnt += 1
if not dflist:
- print " Problem ratings file up to date."
- return
+ print " Problem ratings file up to date."
+ return
try:
problemRatings = pd.concat(dflist)
writeFile(problemRatings, newFile, force)
@@ -91,18 +124,18 @@ def writeFile(data, outFile, force):
# note: we can't just return a file handle here, although that would be more efficient. This is because whether we write the header or not is dependent on whether we are appending.
# file handling: figure out if user wants to append or not
if isfile(outFile):
- if force:
- sys.stderr.write(outFile + " found, -f flag set, overwriting...\n")
- fh = open(outFile, 'w')
- data.to_csv(fh, encoding='utf-8', index=None, header=True)
- else:
- sys.stderr.write(outFile + " found, opening in append mode...\n")
- fh = open(outFile, 'a')
- data.to_csv(fh, encoding='utf-8', index=None, header=False)
+ if force:
+ sys.stderr.write(outFile + " found, -f flag set, overwriting...\n")
+ fh = open(outFile, 'w')
+ data.to_csv(fh, encoding='utf-8', index=None, header=True)
+ else:
+ sys.stderr.write(outFile + " found, opening in append mode...\n")
+ fh = open(outFile, 'a')
+ data.to_csv(fh, encoding='utf-8', index=None, header=False)
else:
- sys.stderr.write(outFile + " not found, creating new file...\n")
- fh = open(outFile, 'w')
- data.to_csv(fh, encoding='utf-8', index=None, header=True)
+ sys.stderr.write(outFile + " not found, creating new file...\n")
+ fh = open(outFile, 'w')
+ data.to_csv(fh, encoding='utf-8', index=None, header=True)
if __name__ == '__main__':
@@ -120,20 +153,20 @@ def writeFile(data, outFile, force):
print " Getting all user problem submission information for:", args.handle
# always overwrite
try:
- df_user = api.getUserActivity(args.handle)
- df_user.to_csv(args.outputUserActivityFile, header=True, index=None, encoding='utf-8')
+ df_user = api.getUserActivity(args.handle)
+ df_user.to_csv(args.outputUserActivityFile, header=True, index=None, encoding='utf-8')
except api.UserNotFound:
- print " **********************************************"
- print " ERROR: FAILED TO UPDATE USER ACTIVITY LIST."
- print " User with handle", args.handle, "was not found at codeforces. Please double check to make sure the handle was entered correctly."
+ print " **********************************************"
+ print " ERROR: FAILED TO UPDATE USER ACTIVITY LIST."
+ print " User with handle", args.handle, "was not found at codeforces. Please double check to make sure the handle was entered correctly."
print ' ------------------------------------'
print " Getting user rating history for:", args.handle
# always overwrite
try:
- df_ratinghistory = api.getUserRatingHistory(args.handle)
- df_ratinghistory.to_csv(args.outputUserRatingFile, header=True, index=None, encoding='utf-8')
+ df_ratinghistory = api.getUserRatingHistory(args.handle)
+ df_ratinghistory.to_csv(args.outputUserRatingFile, header=True, index=None, encoding='utf-8')
except api.UserNotFound:
- print " **********************************************"
- print " ERROR: FAILED TO UPDATE USER ACTIVITY LIST."
- print " User with handle", args.handle, "was not found at codeforces. Please double check to make sure the handle was entered correctly."
+ print " **********************************************"
+ print " ERROR: FAILED TO UPDATE USER ACTIVITY LIST."
+ print " User with handle", args.handle, "was not found at codeforces. Please double check to make sure the handle was entered correctly."
diff --git a/ui/user_activity.csv b/ui/user_activity.csv
index d07c8ac..f70c3a0 100644
--- a/ui/user_activity.csv
+++ b/ui/user_activity.csv
@@ -1,507 +1,548 @@
author,contestID,id,language,memoryBytes,participantType,passedTestCount,points,problem_index,problem_name,problem_tags,relativeTimeSeconds,startTimeSeconds,testset,timeMilliseconds,verdict
-yj12,789,25940071,GNU C++11,3686400,PRACTICE,52,1500.0,C,Functions again,"[data structures, dp, greedy]",2147483647,1490846468,TESTS,46,OK
-yj12,789,25940064,GNU C++11,0,PRACTICE,0,1500.0,C,Functions again,"[data structures, dp, greedy]",2147483647,1490846445,TESTS,0,COMPILATION_ERROR
-yj12,789,25940056,GNU C++11,0,PRACTICE,0,1500.0,C,Functions again,"[data structures, dp, greedy]",2147483647,1490846397,TESTS,0,COMPILATION_ERROR
-yj12,789,25930993,GNU C++11,5324800,PRACTICE,32,1000.0,B,Masha and geometric depression,"[brute force, implementation, math]",2147483647,1490815402,TESTS,62,WRONG_ANSWER
-yj12,789,25930163,GNU C++11,5324800,PRACTICE,42,1000.0,B,Masha and geometric depression,"[brute force, implementation, math]",2147483647,1490814643,TESTS,62,WRONG_ANSWER
-yj12,789,25926838,GNU C++11,2048000,CONTESTANT,1,1000.0,B,Masha and geometric depression,"[brute force, implementation, math]",6765,1490810265,PRETESTS,15,RUNTIME_ERROR
-yj12,789,25922867,GNU C++11,3072000,CONTESTANT,0,2250.0,D,Weird journey,[graphs],5694,1490809194,PRETESTS,0,WRONG_ANSWER
-yj12,789,25919398,GNU C++11,5324800,CONTESTANT,7,1000.0,B,Masha and geometric depression,"[brute force, implementation, math]",4763,1490808263,PRETESTS,46,WRONG_ANSWER
-yj12,789,25916463,GNU C++11,2867200,CONTESTANT,12,1500.0,C,Functions again,"[data structures, dp, greedy]",4022,1490807522,TESTS,31,WRONG_ANSWER
-yj12,789,25912326,GNU C++11,5324800,CONTESTANT,7,1000.0,B,Masha and geometric depression,"[brute force, implementation, math]",3049,1490806549,PRETESTS,77,WRONG_ANSWER
-yj12,789,25909470,GNU C++11,5324800,CONTESTANT,7,1000.0,B,Masha and geometric depression,"[brute force, implementation, math]",2411,1490805912,PRETESTS,62,WRONG_ANSWER
-yj12,789,25907193,GNU C++11,5324800,CONTESTANT,7,1000.0,B,Masha and geometric depression,"[brute force, implementation, math]",1917,1490805417,PRETESTS,62,WRONG_ANSWER
-yj12,789,25900212,GNU C++11,2048000,CONTESTANT,31,500.0,A,Anastasia and pebbles,"[greedy, implementation, math]",278,1490803778,TESTS,31,OK
-yj12,787,25776930,GNU C++11,2252800,PRACTICE,65,1000.0,B,Not Afraid,"[greedy, implementation]",2147483647,1490368739,TESTS,15,OK
-yj12,787,25776575,GNU C++11,2048000,PRACTICE,58,500.0,A,The Monster,"[brute force, math]",2147483647,1490367712,TESTS,15,OK
-yj12,787,25776091,GNU C++11,2048000,PRACTICE,34,500.0,A,The Monster,"[brute force, math]",2147483647,1490366457,TESTS,15,WRONG_ANSWER
-yj12,787,25754882,GNU C++11,2048000,PRACTICE,2,500.0,A,The Monster,"[brute force, math]",2147483647,1490293039,TESTS,15,WRONG_ANSWER
-yj12,337,25680427,GNU C++11,10240000,PRACTICE,25,2000.0,D,Book of Evil,"[dfs and similar, divide and conquer, dp, trees]",2147483647,1490073423,TESTS,156,OK
-yj12,337,25680330,GNU C++11,4403200,PRACTICE,4,2000.0,D,Book of Evil,"[dfs and similar, divide and conquer, dp, trees]",2147483647,1490072812,TESTS,30,RUNTIME_ERROR
-yj12,337,25674780,GNU C++11,3072000,PRACTICE,2,2000.0,D,Book of Evil,"[dfs and similar, divide and conquer, dp, trees]",2147483647,1490036213,TESTS,30,WRONG_ANSWER
-yj12,505,25140854,GNU C++11,62361600,PRACTICE,53,1500.0,C,"Mr. Kitayuta, the Treasure Hunter","[dfs and similar, dp, two pointers]",2147483647,1488434612,TESTS,78,OK
-yj12,678,25139901,GNU C++11,39936000,PRACTICE,41,0.0,E,Another Sith Tournament,"[bitmasks, dp]",2147483647,1488429196,TESTS,156,OK
-yj12,678,25139882,GNU C++11,39936000,PRACTICE,0,0.0,E,Another Sith Tournament,"[bitmasks, dp]",2147483647,1488429097,TESTS,15,WRONG_ANSWER
-yj12,678,25137564,GNU C++11,39936000,PRACTICE,3,0.0,E,Another Sith Tournament,"[bitmasks, dp]",2147483647,1488411006,TESTS,31,WRONG_ANSWER
-yj12,453,25135806,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488401197,TESTS,795,OK
-yj12,453,25135731,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488400898,TESTS,982,OK
-yj12,453,25135713,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488400821,TESTS,2199,OK
-yj12,453,25135698,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488400751,TESTS,2230,OK
-yj12,453,25135665,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488400625,TESTS,2402,OK
-yj12,453,25135583,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488400240,TESTS,2589,OK
-yj12,453,25135482,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488399842,TESTS,2293,OK
-yj12,453,25135363,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488399414,TESTS,3166,OK
-yj12,453,25135252,GNU C++11,222720000,PRACTICE,6,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488399049,TESTS,4000,TIME_LIMIT_EXCEEDED
-yj12,758,23967347,GNU C++11,2048000,CONTESTANT,9,1500.0,C,Unfair Poll,"[binary search, implementation, math]",7106,1484845406,PRETESTS,15,WRONG_ANSWER
-yj12,758,23963712,GNU C++11,2048000,CONTESTANT,4,1500.0,C,Unfair Poll,"[binary search, implementation, math]",5740,1484844040,PRETESTS,15,WRONG_ANSWER
-yj12,758,23955903,Python 2,4608000,CONTESTANT,16,1000.0,B,Blown Garland,[implementation],2092,1484840392,TESTS,46,RUNTIME_ERROR
-yj12,758,23947741,Python 2,4608000,CONTESTANT,41,500.0,A,Holiday Of Equality,"[implementation, math]",162,1484838462,TESTS,61,OK
-yj12,755,23866760,GNU C++11,3276800,PRACTICE,33,1000.0,B,PolandBall and Game,"[binary search, data structures, games, greedy, sortings]",2147483647,1484509692,TESTS,156,OK
-yj12,755,23866549,GNU C++11,3276800,PRACTICE,13,1000.0,B,PolandBall and Game,"[binary search, data structures, games, greedy, sortings]",2147483647,1484509524,TESTS,155,WRONG_ANSWER
-yj12,755,23860959,GNU C++11,2662400,CONTESTANT,29,1500.0,C,PolandBall and Forest,"[dfs and similar, dsu, graphs]",4616,1484504516,TESTS,78,OK
-yj12,755,23854805,GNU C++11,3276800,CONTESTANT,9,1000.0,B,PolandBall and Game,"[binary search, data structures, games, greedy, sortings]",1958,1484501858,TESTS,186,WRONG_ANSWER
-yj12,755,23849844,GNU C++11,6144000,CONTESTANT,63,500.0,A,PolandBall and Hypothesis,"[brute force, graphs, math]",729,1484500629,TESTS,31,OK
-yj12,733,23846484,GNU C++11,2048000,PRACTICE,4,1000.0,B,Parade,[math],2147483647,1484499479,TESTS,31,WRONG_ANSWER
-yj12,686,18785316,GNU C++11,102400,PRACTICE,37,1000.0,B,Little Robber Girl's Zoo,"[constructive algorithms, implementation, sortings]",2147483647,1467213620,TESTS,15,OK
-yj12,686,18785282,GNU C++11,0,PRACTICE,34,500.0,A,Free Ice Cream,"[constructive algorithms, implementation]",2147483647,1467213505,TESTS,15,OK
-yj12,513,18649066,GNU C++11,0,PRACTICE,32,4.0,B2,Permutations,"[bitmasks, divide and conquer, math]",2147483647,1466610102,TESTS2,15,OK
-yj12,513,18648703,GNU C++11,0,PRACTICE,19,4.0,B2,Permutations,"[bitmasks, divide and conquer, math]",2147483647,1466608743,TESTS2,15,WRONG_ANSWER
-yj12,513,18648677,GNU C++11,0,PRACTICE,5,4.0,B2,Permutations,"[bitmasks, divide and conquer, math]",2147483647,1466608648,TESTS2,15,WRONG_ANSWER
-yj12,513,18648575,GNU C++11,0,PRACTICE,2,4.0,B2,Permutations,"[bitmasks, divide and conquer, math]",2147483647,1466608218,TESTS2,2000,TIME_LIMIT_EXCEEDED
-yj12,466,18632065,GNU C++11,3993600,PRACTICE,30,1500.0,C,Number of Ways,"[binary search, brute force, data structures, dp, two pointers]",2147483647,1466520474,TESTS,124,OK
-yj12,466,18631988,GNU C++11,3993600,PRACTICE,30,1500.0,C,Number of Ways,"[binary search, brute force, data structures, dp, two pointers]",2147483647,1466520139,TESTS,140,OK
-yj12,466,18631970,GNU C++11,3993600,PRACTICE,26,1500.0,C,Number of Ways,"[binary search, brute force, data structures, dp, two pointers]",2147483647,1466520076,TESTS,124,WRONG_ANSWER
-yj12,494,18616014,GNU C++11,716800,PRACTICE,56,500.0,A,Treasure,[greedy],2147483647,1466434331,TESTS,31,OK
-yj12,494,18615618,GNU C++11,409600,PRACTICE,13,500.0,A,Treasure,[greedy],2147483647,1466433061,TESTS,31,WRONG_ANSWER
-yj12,494,18615584,GNU C++11,0,PRACTICE,0,500.0,A,Treasure,[greedy],2147483647,1466432940,TESTS,0,WRONG_ANSWER
-yj12,494,18615554,GNU C++11,409600,PRACTICE,13,500.0,A,Treasure,[greedy],2147483647,1466432851,TESTS,31,WRONG_ANSWER
-yj12,494,18615529,GNU C++11,0,PRACTICE,0,500.0,A,Treasure,[greedy],2147483647,1466432753,TESTS,0,WRONG_ANSWER
-yj12,494,18615423,GNU C++11,716800,PRACTICE,56,500.0,A,Treasure,[greedy],2147483647,1466432384,TESTS,31,OK
-yj12,494,18615376,GNU C++11,716800,PRACTICE,43,500.0,A,Treasure,[greedy],2147483647,1466432226,TESTS,31,WRONG_ANSWER
-yj12,494,18615367,GNU C++11,0,PRACTICE,0,500.0,A,Treasure,[greedy],2147483647,1466432202,TESTS,15,WRONG_ANSWER
-yj12,320,18607872,GNU C++11,0,PRACTICE,29,1500.0,C,Malek Dance Club,[math],2147483647,1466389932,TESTS,30,OK
-yj12,464,18578468,GNU C++11,0,PRACTICE,73,500.0,A,No to Palindromes!,"[greedy, strings]",2147483647,1466251056,TESTS,15,OK
-yj12,464,18578438,GNU C++11,0,PRACTICE,73,500.0,A,No to Palindromes!,"[greedy, strings]",2147483647,1466250955,TESTS,15,OK
-yj12,464,18578403,GNU C++11,0,PRACTICE,1,500.0,A,No to Palindromes!,"[greedy, strings]",2147483647,1466250832,TESTS,0,WRONG_ANSWER
-yj12,681,18484423,GNU C++11,26316800,PRACTICE,39,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465950728,TESTS,171,OK
-yj12,681,18484360,GNU C++11,2048000,PRACTICE,0,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465950381,TESTS,15,WRONG_ANSWER
-yj12,681,18484227,GNU C++11,26316800,PRACTICE,26,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465949601,TESTS,187,WRONG_ANSWER
-yj12,681,18480847,GNU C++11,27750400,PRACTICE,10,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465936959,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,681,18479728,GNU C++11,27648000,PRACTICE,10,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465934595,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,681,18479658,GNU C++11,27648000,PRACTICE,10,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465934472,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,681,18479495,GNU C++11,268390400,PRACTICE,0,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465934229,TESTS,249,MEMORY_LIMIT_EXCEEDED
-yj12,681,18479415,GNU C++11,26931200,PRACTICE,9,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465934128,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,681,18476871,GNU C++11,5529600,CONTESTANT,5,2000.0,D,Gifts by the List,"[dfs and similar, trees]",7154,1465929254,PRETESTS,234,WRONG_ANSWER
-yj12,681,18475005,GNU C++11,5529600,CONTESTANT,5,2000.0,D,Gifts by the List,"[dfs and similar, trees]",6394,1465928494,PRETESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,681,18466725,GNU C++11,2252800,CONTESTANT,63,1000.0,B,Economy Game,[brute force],2944,1465925044,TESTS,15,OK
-yj12,681,18466674,GNU C++11,2048000,CONTESTANT,0,2000.0,D,Gifts by the List,"[dfs and similar, trees]",2929,1465925029,PRETESTS,15,WRONG_ANSWER
-yj12,681,18459506,GNU C++11,2048000,CONTESTANT,7,1000.0,B,Economy Game,[brute force],737,1465922837,CHALLENGES,15,CHALLENGED
-yj12,681,18456570,GNU C++11,2252800,CONTESTANT,60,500.0,A,A Good Contest,[implementation],271,1465922371,TESTS,15,OK
-yj12,625,18351219,GNU C++11,2252800,PRACTICE,83,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1465527370,TESTS,15,OK
-yj12,625,18351194,GNU C++11,2252800,PRACTICE,58,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1465527160,TESTS,15,WRONG_ANSWER
-yj12,625,18351189,GNU C++11,0,PRACTICE,0,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1465527142,TESTS,0,COMPILATION_ERROR
-yj12,625,18351185,GNU C++11,2252800,PRACTICE,52,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1465527106,TESTS,15,WRONG_ANSWER
-yj12,338,18345097,GNU C++11,2252800,PRACTICE,73,500.0,A,Quiz,"[greedy, math, number theory]",2147483647,1465490971,TESTS,30,OK
-yj12,338,18345052,GNU C++11,2252800,PRACTICE,43,500.0,A,Quiz,"[greedy, math, number theory]",2147483647,1465490780,TESTS,30,WRONG_ANSWER
-yj12,338,18345013,GNU C++11,2252800,PRACTICE,36,500.0,A,Quiz,"[greedy, math, number theory]",2147483647,1465490614,TESTS,30,WRONG_ANSWER
-yj12,338,18344255,GNU C++11,2048000,PRACTICE,2,500.0,A,Quiz,"[greedy, math, number theory]",2147483647,1465487120,TESTS,0,WRONG_ANSWER
-yj12,680,18331203,GNU C++11,2252800,PRACTICE,59,1750.0,C,Bear and Prime 100,"[constructive algorithms, number theory]",2147483647,1465421212,TESTS,30,OK
-yj12,680,18331039,GNU C++11,2252800,PRACTICE,5,1750.0,C,Bear and Prime 100,"[constructive algorithms, number theory]",2147483647,1465420463,TESTS,0,WRONG_ANSWER
-yj12,680,18330997,GNU C++11,2048000,PRACTICE,5,1750.0,C,Bear and Prime 100,"[constructive algorithms, number theory]",2147483647,1465420325,TESTS,15,WRONG_ANSWER
-yj12,680,18330969,GNU C++11,2048000,PRACTICE,2,1750.0,C,Bear and Prime 100,"[constructive algorithms, number theory]",2147483647,1465420209,TESTS,0,IDLENESS_LIMIT_EXCEEDED
-yj12,680,18330718,GNU C++11,2048000,PRACTICE,5,1750.0,C,Bear and Prime 100,"[constructive algorithms, number theory]",2147483647,1465418979,TESTS,0,WRONG_ANSWER
-yj12,680,18322297,GNU C++11,2252800,CONTESTANT,59,1750.0,C,Bear and Prime 100,"[constructive algorithms, number theory]",5185,1465408885,TESTS,15,OK
-yj12,680,18312889,GNU C++11,2252800,CONTESTANT,24,1000.0,B,Bear and Finding Criminals,"[constructive algorithms, implementation]",2247,1465405947,TESTS,15,OK
-yj12,680,18311642,GNU C++11,2252800,CONTESTANT,6,1000.0,B,Bear and Finding Criminals,"[constructive algorithms, implementation]",1948,1465405648,PRETESTS,15,WRONG_ANSWER
-yj12,680,18310914,GNU C++11,2048000,CONTESTANT,2,1000.0,B,Bear and Finding Criminals,"[constructive algorithms, implementation]",1773,1465405473,PRETESTS,15,WRONG_ANSWER
-yj12,680,18310650,GNU C++11,2048000,CONTESTANT,6,1000.0,B,Bear and Finding Criminals,"[constructive algorithms, implementation]",1705,1465405405,PRETESTS,15,WRONG_ANSWER
-yj12,680,18308998,GNU C++11,2252800,CONTESTANT,6,1000.0,B,Bear and Finding Criminals,"[constructive algorithms, implementation]",1359,1465405059,PRETESTS,15,WRONG_ANSWER
-yj12,680,18303129,Python 2,4812800,CONTESTANT,48,500.0,A,Bear and Five Cards,"[constructive algorithms, implementation]",307,1465404007,TESTS,62,OK
-yj12,677,18301769,GNU C++11,2252800,PRACTICE,29,500.0,A,Vanya and Fence,[implementation],2147483647,1465402237,TESTS,31,OK
-yj12,101021,18300457,GNU C++11,2150400,GYM,38,0.0,A,Guess the Number,[],2147483647,1465399228,TESTS,15,OK
-yj12,101021,18300364,GNU C++11,2048000,GYM,1,0.0,A,Guess the Number,[],2147483647,1465398970,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,101021,18300345,GNU C++11,2048000,GYM,0,0.0,A,Guess the Number,[],2147483647,1465398932,TESTS,15,WRONG_ANSWER
-yj12,101021,18300319,GNU C++11,2048000,GYM,0,0.0,A,Guess the Number,[],2147483647,1465398761,TESTS,15,WRONG_ANSWER
-yj12,101021,18300302,GNU C++11,2048000,GYM,0,0.0,A,Guess the Number,[],2147483647,1465398708,TESTS,0,WRONG_ANSWER
-yj12,101021,18300210,GNU C++11,2048000,GYM,0,0.0,A,Guess the Number,[],2147483647,1465398479,TESTS,15,WRONG_ANSWER
-yj12,101021,18300120,GNU C++11,2048000,GYM,0,0.0,A,Guess the Number,[],2147483647,1465398241,TESTS,0,WRONG_ANSWER
-yj12,426,18133485,GNU C++,2252800,PRACTICE,43,1500.0,C,Sereja and Swaps,"[brute force, sortings, two pointers]",2147483647,1464448597,TESTS,171,OK
-yj12,426,18133232,GNU C++,2048000,PRACTICE,2,1500.0,C,Sereja and Swaps,"[brute force, sortings, two pointers]",2147483647,1464447580,TESTS,15,WRONG_ANSWER
-yj12,426,18133162,GNU C++,0,PRACTICE,0,1500.0,C,Sereja and Swaps,"[brute force, sortings, two pointers]",2147483647,1464447330,TESTS,0,COMPILATION_ERROR
-yj12,426,18107650,GNU C++,2048000,PRACTICE,2,1500.0,C,Sereja and Swaps,"[brute force, sortings, two pointers]",2147483647,1464281841,TESTS,15,WRONG_ANSWER
-yj12,676,18107186,Python 2,4710400,PRACTICE,121,1000.0,B,Pyramid of Glasses,[implementation],2147483647,1464279654,TESTS,62,OK
-yj12,676,18107164,Python 2,4710400,PRACTICE,3,1000.0,B,Pyramid of Glasses,[implementation],2147483647,1464279530,TESTS,46,RUNTIME_ERROR
-yj12,676,18106372,GNU C++,2457600,PRACTICE,117,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464276404,TESTS,31,OK
-yj12,676,18105398,GNU C++,3276800,PRACTICE,37,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464271845,TESTS,15,WRONG_ANSWER
-yj12,676,18097074,GNU C++,3276800,PRACTICE,117,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464234782,TESTS,31,OK
-yj12,676,18097063,GNU C++,3481600,PRACTICE,37,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464234753,TESTS,31,WRONG_ANSWER
-yj12,676,18097056,GNU C++,3481600,PRACTICE,90,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464234716,TESTS,31,WRONG_ANSWER
-yj12,676,18096970,GNU C++,3276800,PRACTICE,37,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464234302,TESTS,30,WRONG_ANSWER
-yj12,676,18096949,GNU C++,3276800,PRACTICE,22,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464234183,TESTS,31,WRONG_ANSWER
-yj12,676,18096723,GNU C++,3276800,PRACTICE,16,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464232891,TESTS,31,WRONG_ANSWER
-yj12,669,18008041,GNU C++,2252800,PRACTICE,36,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463762375,TESTS,1029,OK
-yj12,669,18007832,GNU C++,2252800,PRACTICE,36,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463761461,TESTS,1434,OK
-yj12,669,18007815,GNU C++,2048000,PRACTICE,10,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463761410,TESTS,1091,WRONG_ANSWER
-yj12,669,18007794,GNU C++,2048000,PRACTICE,10,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463761320,TESTS,951,WRONG_ANSWER
-yj12,669,18007788,GNU C++,2252800,PRACTICE,10,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463761283,TESTS,967,WRONG_ANSWER
-yj12,669,18007761,GNU C++,2048000,PRACTICE,10,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463761161,TESTS,936,WRONG_ANSWER
-yj12,669,18007746,GNU C++,2048000,PRACTICE,10,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463761110,TESTS,982,WRONG_ANSWER
-yj12,669,18007697,GNU C++,2252800,PRACTICE,10,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463760918,TESTS,935,WRONG_ANSWER
-yj12,669,18007208,GNU C++,2252800,PRACTICE,7,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463758865,TESTS,15,WRONG_ANSWER
-yj12,669,18007157,GNU C++,2048000,PRACTICE,6,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463758656,TESTS,15,WRONG_ANSWER
-yj12,669,18006901,GNU C++,2048000,PRACTICE,3,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463757533,TESTS,15,WRONG_ANSWER
-yj12,536,17995079,GNU C++,2252800,PRACTICE,58,500.0,A,Tavas and Karafs,"[binary search, math]",2147483647,1463678133,TESTS,139,OK
-yj12,536,17994927,GNU C++,2252800,PRACTICE,58,500.0,A,Tavas and Karafs,"[binary search, math]",2147483647,1463677483,TESTS,451,OK
-yj12,536,17994919,GNU C++,2048000,PRACTICE,0,500.0,A,Tavas and Karafs,"[binary search, math]",2147483647,1463677458,TESTS,0,WRONG_ANSWER
-yj12,536,17994818,GNU C++,2048000,PRACTICE,2,500.0,A,Tavas and Karafs,"[binary search, math]",2147483647,1463677036,TESTS,311,WRONG_ANSWER
-yj12,536,17994377,GNU C++,2048000,PRACTICE,0,500.0,A,Tavas and Karafs,"[binary search, math]",2147483647,1463675446,TESTS,0,WRONG_ANSWER
-yj12,675,17956864,GNU C++,2252800,PRACTICE,58,1000.0,B,Restoring Painting,"[brute force, constructive algorithms, math]",2147483647,1463431367,TESTS,31,OK
-yj12,675,17956857,GNU C++,2252800,PRACTICE,5,1000.0,B,Restoring Painting,"[brute force, constructive algorithms, math]",2147483647,1463431320,TESTS,15,WRONG_ANSWER
-yj12,675,17956039,GNU C++,2252800,PRACTICE,178,500.0,A,Infinite Sequence,[math],2147483647,1463427732,TESTS,15,OK
-yj12,675,17956023,GNU C++,2048000,PRACTICE,2,500.0,A,Infinite Sequence,[math],2147483647,1463427688,TESTS,15,WRONG_ANSWER
-yj12,675,17956019,Python 2,0,PRACTICE,0,500.0,A,Infinite Sequence,[math],2147483647,1463427677,TESTS,0,COMPILATION_ERROR
-yj12,675,17955961,Python 2,4710400,PRACTICE,178,500.0,A,Infinite Sequence,[math],2147483647,1463427528,TESTS,77,OK
-yj12,675,17955931,Python 2,4710400,PRACTICE,178,500.0,A,Infinite Sequence,[math],2147483647,1463427451,TESTS,62,OK
-yj12,675,17955839,Python 2,4710400,PRACTICE,4,500.0,A,Infinite Sequence,[math],2147483647,1463427137,TESTS,62,WRONG_ANSWER
-yj12,585,17952986,GNU C++,2252800,PRACTICE,40,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463423000,TESTS,15,OK
-yj12,585,17952918,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463422963,TESTS,15,WRONG_ANSWER
-yj12,585,17952126,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463422530,TESTS,15,WRONG_ANSWER
-yj12,585,17951195,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463422022,TESTS,15,WRONG_ANSWER
-yj12,585,17951054,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421952,TESTS,15,WRONG_ANSWER
-yj12,585,17950885,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421856,TESTS,31,WRONG_ANSWER
-yj12,585,17950700,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421748,TESTS,15,WRONG_ANSWER
-yj12,585,17950444,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421617,TESTS,0,WRONG_ANSWER
-yj12,585,17950160,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421471,TESTS,0,WRONG_ANSWER
-yj12,585,17950038,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421410,TESTS,0,WRONG_ANSWER
-yj12,585,17949959,GNU C++,0,PRACTICE,0,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421370,TESTS,0,COMPILATION_ERROR
-yj12,585,17949770,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421268,TESTS,15,WRONG_ANSWER
-yj12,585,17949697,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421232,TESTS,15,WRONG_ANSWER
-yj12,585,17949490,GNU C++,2252800,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421133,TESTS,15,WRONG_ANSWER
-yj12,672,17895187,GNU C++,6246400,PRACTICE,60,2000.0,D,Robin Hood,"[binary search, greedy]",2147483647,1463172064,TESTS,187,OK
-yj12,672,17895170,GNU C++,6246400,PRACTICE,60,2000.0,D,Robin Hood,"[binary search, greedy]",2147483647,1463171976,TESTS,233,OK
-yj12,672,17895161,GNU C++,6246400,PRACTICE,60,2000.0,D,Robin Hood,"[binary search, greedy]",2147483647,1463171921,TESTS,187,OK
-yj12,672,17895150,GNU C++,6246400,PRACTICE,60,2000.0,D,Robin Hood,"[binary search, greedy]",2147483647,1463171824,TESTS,265,OK
-yj12,672,17895142,GNU C++,6246400,PRACTICE,60,2000.0,D,Robin Hood,"[binary search, greedy]",2147483647,1463171730,TESTS,187,OK
-yj12,671,17895083,GNU C++,2048000,PRACTICE,2,1000.0,B,Robin Hood,"[binary search, greedy]",2147483647,1463171288,TESTS,15,WRONG_ANSWER
-yj12,671,17895070,GNU C++,2048000,PRACTICE,1,1000.0,B,Robin Hood,"[binary search, greedy]",2147483647,1463171147,TESTS,15,WRONG_ANSWER
-yj12,671,17895063,GNU C++,0,PRACTICE,0,1000.0,B,Robin Hood,"[binary search, greedy]",2147483647,1463171103,TESTS,0,COMPILATION_ERROR
-yj12,671,17895056,GNU C++,2048000,PRACTICE,1,1000.0,B,Robin Hood,"[binary search, greedy]",2147483647,1463171048,TESTS,0,WRONG_ANSWER
-yj12,671,17895040,GNU C++,2252800,PRACTICE,1,1000.0,B,Robin Hood,"[binary search, greedy]",2147483647,1463170978,TESTS,15,WRONG_ANSWER
-yj12,671,17895022,GNU C++,2048000,PRACTICE,1,1000.0,B,Robin Hood,"[binary search, greedy]",2147483647,1463170837,TESTS,15,WRONG_ANSWER
-yj12,671,17895016,GNU C++,2252800,PRACTICE,1,1000.0,B,Robin Hood,"[binary search, greedy]",2147483647,1463170781,TESTS,0,WRONG_ANSWER
-yj12,672,17894751,GNU C++,4608000,PRACTICE,148,1500.0,C,Recycling Bottles,"[brute force, geometry, greedy]",2147483647,1463169315,TESTS,61,OK
-yj12,672,17894719,GNU C++,4505600,PRACTICE,7,1500.0,C,Recycling Bottles,"[brute force, geometry, greedy]",2147483647,1463169095,TESTS,46,WRONG_ANSWER
-yj12,672,17894707,GNU C++,2150400,PRACTICE,0,1500.0,C,Recycling Bottles,"[brute force, geometry, greedy]",2147483647,1463169054,TESTS,0,WRONG_ANSWER
-yj12,672,17858246,Python 2,23961600,CONTESTANT,24,1500.0,C,Recycling Bottles,"[brute force, geometry, greedy]",4815,1462989315,TESTS,1201,WRONG_ANSWER
-yj12,672,17848446,Python 2,4812800,CONTESTANT,47,1000.0,B,Different is Good,"[constructive algorithms, implementation, strings]",632,1462985132,TESTS,61,OK
-yj12,672,17846315,Python 2,4710400,CONTESTANT,37,500.0,A,Summer Camp,[implementation],176,1462984676,TESTS,46,OK
-yj12,670,17800937,GNU C++,12595200,PRACTICE,96,2000.0,E,Correct Bracket Sequence Editor,"[data structures, dsu]",2147483647,1462671526,TESTS,171,OK
-yj12,670,17800571,GNU C++,3788800,PRACTICE,150,500.0,D2,Magic Powder - 2,[binary search],2147483647,1462666415,TESTS,78,OK
-yj12,670,17800564,GNU C++,3686400,PRACTICE,1,500.0,D2,Magic Powder - 2,[binary search],2147483647,1462666374,TESTS,0,WRONG_ANSWER
-yj12,670,17800556,GNU C++,3686400,PRACTICE,4,500.0,D2,Magic Powder - 2,[binary search],2147483647,1462666292,TESTS,15,WRONG_ANSWER
-yj12,673,17800431,Python 2,4710400,PRACTICE,48,1500.0,D,Bear and Two Paths,[],2147483647,1462664739,TESTS,77,OK
-yj12,673,17800423,Python 2,4608000,PRACTICE,3,1500.0,D,Bear and Two Paths,[],2147483647,1462664670,TESTS,46,WRONG_ANSWER
-yj12,673,17799700,GNU C++,2252800,PRACTICE,35,1000.0,C,Bear and Colors,[],2147483647,1462655148,TESTS,62,OK
-yj12,673,17799698,Python 2,0,PRACTICE,0,1000.0,C,Bear and Colors,[],2147483647,1462655136,TESTS,0,COMPILATION_ERROR
-yj12,673,17799463,Python 2,4812800,PRACTICE,5,1000.0,C,Bear and Colors,[],2147483647,1462653699,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,673,17797201,Python 2,4608000,CONTESTANT,3,1500.0,D,Bear and Two Paths,[],10725,1462644225,PRETESTS,46,WRONG_ANSWER
-yj12,673,17796322,Python 2,4608000,CONTESTANT,3,1500.0,D,Bear and Two Paths,[],9864,1462643364,PRETESTS,61,WRONG_ANSWER
-yj12,673,17795986,Python 2,4608000,CONTESTANT,3,1500.0,D,Bear and Two Paths,[],9478,1462642978,PRETESTS,46,WRONG_ANSWER
-yj12,673,17789276,Python 2,10752000,CONTESTANT,51,750.0,B,Problems for Round,"[greedy, implementation]",3449,1462636949,TESTS,389,OK
-yj12,673,17789113,Python 2,4608000,CONTESTANT,3,750.0,B,Problems for Round,"[greedy, implementation]",3359,1462636859,PRETESTS,46,RUNTIME_ERROR
-yj12,673,17781098,Python 2,4710400,CONTESTANT,34,500.0,A,Bear and Game,[implementation],387,1462633887,TESTS,46,OK
-yj12,670,17779878,GNU C++,3686400,PRACTICE,4,500.0,D2,Magic Powder - 2,[binary search],2147483647,1462632742,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,670,17744527,Python 2,15360000,CONTESTANT,125,500.0,D2,Magic Powder - 2,[binary search],7162,1462471462,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,670,17743599,Python 2,4608000,CONTESTANT,5,500.0,D2,Magic Powder - 2,[binary search],6719,1462471019,PRETESTS,61,WRONG_ANSWER
-yj12,670,17740070,Python 2,4812800,CONTESTANT,119,1000.0,D1,Magic Powder - 1,"[binary search, brute force]",5178,1462469478,TESTS,998,OK
-yj12,670,17737070,Python 2,79974400,CONTESTANT,138,1000.0,C,Cinema,"[implementation, sortings]",4063,1462468363,TESTS,1574,OK
-yj12,670,17735579,Python 2,4710400,CONTESTANT,7,1000.0,C,Cinema,"[implementation, sortings]",3570,1462467870,PRETESTS,61,WRONG_ANSWER
-yj12,670,17734017,Python 2,10342400,CONTESTANT,143,750.0,B,Game of Robots,[implementation],3100,1462467400,TESTS,124,OK
-yj12,670,17729839,Python 2,4608000,CONTESTANT,7,1000.0,C,Cinema,"[implementation, sortings]",2036,1462466336,PRETESTS,46,WRONG_ANSWER
-yj12,670,17729008,GNU C++,2252800,CONTESTANT,198,500.0,A,Holidays,"[brute force, constructive algorithms]",1851,1462466151,TESTS,31,OK
-yj12,670,17727442,Python 2,20992000,CONTESTANT,14,500.0,A,Holidays,"[brute force, constructive algorithms]",1524,1462465824,PRETESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,670,17725997,Python 2,4812800,CONTESTANT,4,1000.0,C,Cinema,"[implementation, sortings]",1214,1462465514,PRETESTS,62,RUNTIME_ERROR
-yj12,420,17720254,Python 2,5222400,PRACTICE,80,500.0,A,Start Up,[implementation],2147483647,1462463220,TESTS,77,OK
-yj12,420,17720235,Python 2,4608000,PRACTICE,0,500.0,A,Start Up,[implementation],2147483647,1462463095,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,332,17719988,Python 2,4710400,PRACTICE,41,500.0,A,Down the Hatch!,[implementation],2147483647,1462461404,TESTS,154,OK
-yj12,664,17390642,GNU C++,2252800,PRACTICE,31,1000.0,B,Rebus,[greedy],2147483647,1461087811,TESTS,15,OK
-yj12,664,17390534,GNU C++,2048000,PRACTICE,1,1000.0,B,Rebus,[greedy],2147483647,1461086832,TESTS,15,WRONG_ANSWER
-yj12,664,17389312,GNU C++,2048000,VIRTUAL,5,1000.0,B,Rebus,[greedy],3383,1461080483,TESTS,15,WRONG_ANSWER
-yj12,664,17389290,GNU C++,2252800,VIRTUAL,45,1500.0,C,International Olympiad,[greedy],3215,1461080315,TESTS,31,OK
-yj12,664,17388840,GNU C++,2252800,VIRTUAL,28,500.0,A,Complicated GCD,[math],768,1461077868,TESTS,15,OK
-yj12,652,17198593,GNU C++,40550400,VIRTUAL,52,0.0,D,Nested Segments,"[data structures, sortings]",3617,1460001317,TESTS,639,OK
-yj12,652,17198447,GNU C++,16691200,VIRTUAL,24,0.0,C,Foe Pairs,[two pointers],1879,1459999579,TESTS,405,OK
-yj12,652,17198424,Python 2,4608000,VIRTUAL,16,0.0,B,z-sort,[sortings],1612,1459999312,TESTS,46,OK
-yj12,652,17198393,Python 2,4710400,VIRTUAL,76,0.0,A,Gabriel and Caterpillar,[implementation],1090,1459998790,TESTS,62,OK
-yj12,652,17198353,Python 2,4710400,VIRTUAL,15,0.0,A,Gabriel and Caterpillar,[implementation],743,1459998443,TESTS,46,WRONG_ANSWER
-yj12,652,17198345,Python 2,4608000,VIRTUAL,9,0.0,A,Gabriel and Caterpillar,[implementation],633,1459998333,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,653,16866068,GNU C++,2252800,VIRTUAL,12,2000.0,D,Delivery Bears,"[binary search, flows]",7069,1458621770,TESTS,15,WRONG_ANSWER
-yj12,653,16866012,GNU C++,2252800,VIRTUAL,14,2000.0,D,Delivery Bears,"[binary search, flows]",6599,1458621299,TESTS,30,WRONG_ANSWER
-yj12,653,16865926,GNU C++,2150400,VIRTUAL,6,2000.0,D,Delivery Bears,"[binary search, flows]",5578,1458620278,TESTS,15,WRONG_ANSWER
-yj12,653,16865836,Python 2,7884800,VIRTUAL,32,1000.0,B,Bear and Compressing,"[brute force, dfs and similar, dp, strings]",4371,1458619071,TESTS,78,OK
-yj12,653,16865831,GNU C++,2150400,VIRTUAL,5,2000.0,D,Delivery Bears,"[binary search, flows]",4258,1458618958,TESTS,15,RUNTIME_ERROR
-yj12,653,16865777,GNU C++,2048000,VIRTUAL,0,2000.0,D,Delivery Bears,"[binary search, flows]",3169,1458617869,TESTS,0,WRONG_ANSWER
-yj12,653,16865745,Python 2,4915200,VIRTUAL,6,1000.0,B,Bear and Compressing,"[brute force, dfs and similar, dp, strings]",2638,1458617338,TESTS,61,WRONG_ANSWER
-yj12,653,16865622,Python 2,4710400,VIRTUAL,84,500.0,A,Bear and Three Balls,"[brute force, implementation, sortings]",631,1458615331,TESTS,62,OK
-yj12,653,16865611,GNU C++,2048000,VIRTUAL,84,500.0,A,Bear and Three Balls,"[brute force, implementation, sortings]",533,1458615233,TESTS,15,OK
-yj12,653,16865607,Python 2,4608000,VIRTUAL,4,500.0,A,Bear and Three Balls,"[brute force, implementation, sortings]",473,1458615173,TESTS,46,WRONG_ANSWER
-yj12,653,16865588,GNU C++,2048000,VIRTUAL,4,500.0,A,Bear and Three Balls,"[brute force, implementation, sortings]",202,1458614902,TESTS,15,WRONG_ANSWER
-yj12,622,16754202,GNU C++,65331200,PRACTICE,33,0.0,E,Ants in Leaves,"[dfs and similar, greedy, trees]",2147483647,1458161512,TESTS,499,OK
-yj12,622,16754184,GNU C++,0,PRACTICE,0,0.0,E,Ants in Leaves,"[dfs and similar, greedy, trees]",2147483647,1458161426,TESTS,0,WRONG_ANSWER
-yj12,622,16754126,GNU C++,26931200,PRACTICE,18,0.0,E,Ants in Leaves,"[dfs and similar, greedy, trees]",2147483647,1458161196,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,622,16754119,GNU C++11,0,PRACTICE,0,0.0,E,Ants in Leaves,"[dfs and similar, greedy, trees]",2147483647,1458161184,TESTS,0,COMPILATION_ERROR
-yj12,625,16685085,GNU C++11,0,PRACTICE,83,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1457845051,TESTS,31,OK
-yj12,625,16685060,GNU C++11,0,PRACTICE,55,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1457844936,TESTS,15,WRONG_ANSWER
-yj12,625,16653186,GNU C++11,0,PRACTICE,11,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1457713714,TESTS,15,WRONG_ANSWER
-yj12,625,16651380,GNU C++11,0,PRACTICE,34,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1457709338,TESTS,15,WRONG_ANSWER
-yj12,625,16651207,GNU C++11,0,PRACTICE,47,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1457708787,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,625,16651181,GNU C++11,0,PRACTICE,10,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1457708699,TESTS,30,WRONG_ANSWER
-yj12,625,16641991,GNU C++11,0,PRACTICE,10,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1457663558,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,651,16635702,GNU C++11,33177600,PRACTICE,71,1500.0,C,Watchmen,"[data structures, geometry, implementation, sortings]",2147483647,1457625426,TESTS,763,OK
-yj12,651,16635696,GNU C++11,0,PRACTICE,0,2000.0,D,Image Preview,"[binary search, dp, two pointers]",2147483647,1457625400,TESTS,0,WRONG_ANSWER
-yj12,651,16635453,GNU C++11,0,PRACTICE,0,2000.0,D,Image Preview,"[binary search, dp, two pointers]",2147483647,1457624544,TESTS,15,WRONG_ANSWER
-yj12,651,16635355,GNU C++11,33177600,PRACTICE,71,1500.0,C,Watchmen,"[data structures, geometry, implementation, sortings]",2147483647,1457624190,TESTS,1621,OK
-yj12,651,16627368,GNU C++11,0,PRACTICE,2,1500.0,C,Watchmen,"[data structures, geometry, implementation, sortings]",2147483647,1457586368,TESTS,15,WRONG_ANSWER
-yj12,651,16627059,GNU C++11,0,PRACTICE,31,1000.0,B,Beautiful Paintings,"[greedy, sortings]",2147483647,1457583672,TESTS,15,OK
-yj12,651,16626727,GNU C++11,0,PRACTICE,39,500.0,A,Joysticks,"[dp, greedy]",2147483647,1457580856,TESTS,15,OK
-yj12,582,16605697,GNU C++11,102400,PRACTICE,54,750.0,A,GCD Table,"[constructive algorithms, greedy]",2147483647,1457458309,TESTS,639,OK
-yj12,635,16595985,GNU C++,3174400,PRACTICE,61,1000.0,B,Island Puzzle,[],2147483647,1457416409,TESTS,93,OK
-yj12,635,16595966,GNU C++,3174400,PRACTICE,61,1000.0,B,Island Puzzle,[],2147483647,1457416253,TESTS,748,OK
-yj12,635,16595772,GNU C++,0,PRACTICE,71,1500.0,C,XOR Equation,[dp],2147483647,1457414719,TESTS,15,OK
-yj12,635,16595733,GNU C++,0,PRACTICE,8,1500.0,C,XOR Equation,[dp],2147483647,1457414386,TESTS,15,WRONG_ANSWER
-yj12,635,16595491,GNU C++,0,PRACTICE,4,1500.0,C,XOR Equation,[dp],2147483647,1457412722,TESTS,15,WRONG_ANSWER
-yj12,635,16594484,GNU C++,0,PRACTICE,3,1500.0,C,XOR Equation,[dp],2147483647,1457402415,TESTS,15,WRONG_ANSWER
-yj12,631,16561510,Python 2,22732800,PRACTICE,27,500.0,A,Interview,"[brute force, implementation]",2147483647,1457336365,TESTS,655,OK
-yj12,631,16561483,Python 2,22937600,PRACTICE,17,500.0,A,Interview,"[brute force, implementation]",2147483647,1457336197,TESTS,685,WRONG_ANSWER
-yj12,631,16561374,Python 2,204800,PRACTICE,3,500.0,A,Interview,"[brute force, implementation]",2147483647,1457335203,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,629,16561198,GNU C++,204800,PRACTICE,76,1000.0,B,Far Relative’s Problem,[brute force],2147483647,1457333986,TESTS,46,OK
-yj12,629,16560977,GNU C++,64819200,PRACTICE,60,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457331884,TESTS,140,OK
-yj12,629,16560954,GNU C++,64819200,PRACTICE,50,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457331664,TESTS,124,RUNTIME_ERROR
-yj12,629,16560754,Python 2,123494400,PRACTICE,8,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457329840,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,629,16560741,Python 2,0,PRACTICE,0,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457329776,TESTS,30,RUNTIME_ERROR
-yj12,629,16560713,Python 2,122675200,PRACTICE,8,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457329525,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,629,16560710,Python 2,120832000,PRACTICE,8,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457329473,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,629,16560663,Python 2,122675200,PRACTICE,8,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457329076,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,629,16560658,Python 2,0,PRACTICE,0,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457328990,TESTS,62,WRONG_ANSWER
-yj12,629,16560656,Python 2,0,PRACTICE,0,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457328951,TESTS,46,WRONG_ANSWER
-yj12,629,16560615,Python 2,122675200,PRACTICE,8,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457328562,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,629,16560570,Python 2,122675200,PRACTICE,8,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457328228,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,629,16560553,Python 2,4300800,PRACTICE,4,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457327977,TESTS,311,WRONG_ANSWER
-yj12,629,16560543,Python 2,4300800,PRACTICE,3,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457327875,TESTS,311,WRONG_ANSWER
-yj12,629,16560541,Python 2,0,PRACTICE,0,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457327848,TESTS,31,WRONG_ANSWER
-yj12,629,16560528,Python 2,4300800,PRACTICE,3,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457327763,TESTS,327,WRONG_ANSWER
-yj12,629,16560290,Python 2,307200,PRACTICE,3,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457325005,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,629,16560277,Python 2,307200,PRACTICE,3,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457324761,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,629,16560264,Python 2,307200,PRACTICE,3,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457324543,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,402,16302808,Python 2,0,PRACTICE,21,1500.0,C,Searching for Graph,"[brute force, constructive algorithms]",2147483647,1456287348,TESTS,62,OK
-yj12,402,16302789,Python 2,0,PRACTICE,2,1500.0,C,Searching for Graph,"[brute force, constructive algorithms]",2147483647,1456287185,TESTS,46,WRONG_ANSWER
-yj12,235,16299484,Python 2,0,PRACTICE,87,500.0,A,LCM Challenge,[number theory],2147483647,1456258752,TESTS,92,OK
-yj12,235,16299419,Python 2,0,PRACTICE,31,500.0,A,LCM Challenge,[number theory],2147483647,1456258478,TESTS,122,WRONG_ANSWER
-yj12,235,16299383,Python 2,0,PRACTICE,4,500.0,A,LCM Challenge,[number theory],2147483647,1456258347,TESTS,122,WRONG_ANSWER
-yj12,235,16299189,Python 2,0,PRACTICE,32,500.0,A,LCM Challenge,[number theory],2147483647,1456257410,TESTS,122,WRONG_ANSWER
-yj12,235,16299065,Python 2,0,PRACTICE,31,500.0,A,LCM Challenge,[number theory],2147483647,1456256902,TESTS,122,WRONG_ANSWER
-yj12,624,15814070,GNU C++,1024000,PRACTICE,106,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454620324,TESTS,468,OK
-yj12,624,15813690,Python 2,3686400,PRACTICE,14,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454619102,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,624,15813612,Python 2,3686400,PRACTICE,13,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454618894,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,624,15813231,Python 2,5632000,PRACTICE,14,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454617806,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,624,15813043,Python 2,0,PRACTICE,2,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454617325,TESTS,46,WRONG_ANSWER
-yj12,624,15812672,Python 2,5529600,PRACTICE,25,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454616506,TESTS,389,WRONG_ANSWER
-yj12,624,15812412,Python 2,5632000,PRACTICE,13,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454616031,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,624,15812079,Python 2,0,PRACTICE,2,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454615529,TESTS,46,WRONG_ANSWER
-yj12,624,15811628,Python 2,5529600,PRACTICE,14,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454614896,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,624,15811557,Python 2,0,PRACTICE,0,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454614846,TESTS,0,COMPILATION_ERROR
-yj12,624,15811483,Python 2,0,PRACTICE,57,1000.0,B,Making a String,"[greedy, sortings]",2147483647,1454614800,TESTS,46,OK
-yj12,624,15811260,Python 2,0,PRACTICE,0,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454614601,TESTS,0,COMPILATION_ERROR
-yj12,624,15811240,Python 2,0,PRACTICE,50,1000.0,B,Making a String,"[greedy, sortings]",2147483647,1454614558,TESTS,62,WRONG_ANSWER
-yj12,624,15811023,Python 2,0,PRACTICE,30,500.0,A,Save Luke,[math],2147483647,1454614310,TESTS,62,OK
-yj12,618,15723397,Python 2,0,PRACTICE,23,1000.0,B,Guess the Permutation,[constructive algorithms],2147483647,1454296035,TESTS,46,OK
-yj12,618,15723392,Python 2,0,PRACTICE,0,1000.0,B,Guess the Permutation,[constructive algorithms],2147483647,1454295997,TESTS,31,WRONG_ANSWER
-yj12,618,15723383,PyPy 2,0,PRACTICE,0,1000.0,B,Guess the Permutation,[constructive algorithms],2147483647,1454295941,TESTS,61,WRONG_ANSWER
-yj12,568,12796586,GNU C++,25600000,PRACTICE,27,500.0,A,Primes or Palindromes?,"[brute force, implementation, math, number theory]",2147483647,1441077747,TESTS,218,OK
-yj12,568,12796561,GNU C++,25600000,PRACTICE,0,500.0,A,Primes or Palindromes?,"[brute force, implementation, math, number theory]",2147483647,1441077454,TESTS,202,WRONG_ANSWER
-yj12,568,12796553,GNU C++,25600000,PRACTICE,0,500.0,A,Primes or Palindromes?,"[brute force, implementation, math, number theory]",2147483647,1441077361,TESTS,187,WRONG_ANSWER
-yj12,574,12767079,GNU C++,204800,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440881433,TESTS,46,OK
-yj12,574,12766974,Python 2,1126400,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440880888,TESTS,1809,OK
-yj12,574,12766949,Python 2,1024000,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440880720,TESTS,1715,OK
-yj12,574,12766617,Python 2,1024000,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440878702,TESTS,1715,OK
-yj12,574,12766597,Python 2,1024000,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440878648,TESTS,1731,OK
-yj12,574,12766590,Python 2,1024000,PRACTICE,39,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440878627,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,574,12766573,Python 2,1024000,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440878574,TESTS,1700,OK
-yj12,574,12766565,Python 2,1024000,PRACTICE,39,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440878534,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,574,12766326,Python 2,921600,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440877642,TESTS,1731,OK
-yj12,574,12766313,Python 2,716800,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440877609,TESTS,1731,OK
-yj12,574,12766288,Python 2,819200,PRACTICE,39,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440877555,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,574,12765918,Python 2,921600,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440876673,TESTS,1731,OK
-yj12,574,12765468,Python 2,614400,PRACTICE,4,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440875907,TESTS,61,WRONG_ANSWER
-yj12,574,12765387,Python 2,614400,PRACTICE,6,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440875795,TESTS,77,WRONG_ANSWER
-yj12,574,12765204,GNU C++,1638400,PRACTICE,70,1500.0,C,Bear and Poker,[number theory],2147483647,1440875582,TESTS,249,OK
-yj12,574,12765175,GNU C++,0,PRACTICE,5,1500.0,C,Bear and Poker,[number theory],2147483647,1440875559,TESTS,15,WRONG_ANSWER
-yj12,574,12765139,GNU C++,0,PRACTICE,5,1500.0,C,Bear and Poker,[number theory],2147483647,1440875508,TESTS,15,WRONG_ANSWER
-yj12,574,12765014,GNU C++,0,PRACTICE,5,1500.0,C,Bear and Poker,[number theory],2147483647,1440875367,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,574,12764976,GNU C++,0,PRACTICE,0,1500.0,C,Bear and Poker,[number theory],2147483647,1440875327,TESTS,0,COMPILATION_ERROR
-yj12,574,12764948,GNU C++,0,PRACTICE,5,1500.0,C,Bear and Poker,[number theory],2147483647,1440875288,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,574,12764903,GNU C++,0,PRACTICE,3,1500.0,C,Bear and Poker,[number theory],2147483647,1440875258,TESTS,15,WRONG_ANSWER
-yj12,574,12764806,GNU C++,0,PRACTICE,5,1500.0,C,Bear and Poker,[number theory],2147483647,1440875177,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,574,12762933,Python 2,512000,CONTESTANT,14,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",7223,1440873023,TESTS,61,WRONG_ANSWER
-yj12,574,12762815,Python 2,614400,CONTESTANT,6,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",7170,1440872970,PRETESTS,61,WRONG_ANSWER
-yj12,574,12762749,Python 2,614400,CONTESTANT,6,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",7139,1440872939,PRETESTS,61,WRONG_ANSWER
-yj12,574,12752225,Python 2,512000,CONTESTANT,7,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2278,1440868078,PRETESTS,46,SKIPPED
-yj12,574,12748539,Python 2,0,CONTESTANT,35,500.0,A,Bear and Elections,[implementation],969,1440866769,TESTS,62,OK
-yj12,302,12745595,GNU C++,2150400,PRACTICE,54,1000.0,B,Eugeny and Play List,"[binary search, implementation, two pointers]",2147483647,1440862822,TESTS,1528,OK
-yj12,302,12745594,GNU C,0,PRACTICE,0,1000.0,B,Eugeny and Play List,"[binary search, implementation, two pointers]",2147483647,1440862804,TESTS,0,COMPILATION_ERROR
-yj12,572,12651094,Python 2,614400,CONTESTANT,34,1000.0,B,Order Book,"[data structures, greedy, implementation, sortings]",1932,1440262932,TESTS,62,OK
-yj12,572,12650199,Python 2,614400,CONTESTANT,8,1000.0,B,Order Book,"[data structures, greedy, implementation, sortings]",1651,1440262651,PRETESTS,62,WRONG_ANSWER
-yj12,572,12645654,Python 2,7475200,CONTESTANT,52,500.0,A,Arrays,[sortings],337,1440261337,TESTS,140,OK
-yj12,261,12637403,GNU C++,409600,PRACTICE,45,500.0,A,Maxim and Discounts,"[greedy, sortings]",2147483647,1440224017,TESTS,92,OK
-yj12,463,12637277,GNU C++,128409600,PRACTICE,23,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440223136,TESTS,1075,OK
-yj12,463,12637261,GNU C++,128409600,PRACTICE,0,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440223051,TESTS,0,WRONG_ANSWER
-yj12,463,12637181,GNU C++,128409600,PRACTICE,0,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440222460,TESTS,15,WRONG_ANSWER
-yj12,463,12637172,GNU C++,128409600,PRACTICE,0,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440222391,TESTS,0,WRONG_ANSWER
-yj12,463,12637143,GNU C++,128409600,PRACTICE,7,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440222220,TESTS,686,WRONG_ANSWER
-yj12,463,12637094,GNU C++,32153600,PRACTICE,6,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440221889,TESTS,670,WRONG_ANSWER
-yj12,463,12636997,GNU C++,32153600,PRACTICE,6,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440221212,TESTS,670,WRONG_ANSWER
-yj12,463,12636917,GNU C++,32153600,PRACTICE,6,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440220643,TESTS,655,RUNTIME_ERROR
-yj12,463,12636910,GNU C++,32153600,PRACTICE,6,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440220572,TESTS,654,RUNTIME_ERROR
-yj12,463,12636899,GNU C++,32153600,PRACTICE,6,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440220504,TESTS,639,RUNTIME_ERROR
-yj12,463,12636801,GNU C++,32153600,PRACTICE,6,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440219840,TESTS,655,RUNTIME_ERROR
-yj12,463,12636768,GNU C++,32460800,PRACTICE,6,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440219568,TESTS,654,RUNTIME_ERROR
-yj12,463,12611092,GNU C++,32460800,PRACTICE,0,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440039448,TESTS,15,WRONG_ANSWER
-yj12,463,12611066,GNU C++,32460800,PRACTICE,0,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440039256,TESTS,15,WRONG_ANSWER
-yj12,493,12580267,GNU C++,0,PRACTICE,26,1500.0,D,Vasya and Chess,"[constructive algorithms, games]",2147483647,1439840937,TESTS,15,OK
-yj12,339,12580191,GNU C++,5836800,PRACTICE,55,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439840412,TESTS,310,OK
-yj12,339,12580188,GNU C++,5836800,PRACTICE,0,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439840385,TESTS,30,WRONG_ANSWER
-yj12,339,12580097,GNU C++,5836800,PRACTICE,6,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439839801,TESTS,218,WRONG_ANSWER
-yj12,339,12580090,GNU C++,3686400,PRACTICE,6,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439839761,TESTS,248,WRONG_ANSWER
-yj12,339,12580068,GNU C++,3686400,PRACTICE,6,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439839637,TESTS,218,WRONG_ANSWER
-yj12,339,12580035,GNU C++,3686400,PRACTICE,6,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439839443,TESTS,218,WRONG_ANSWER
-yj12,339,12579743,GNU C++,3686400,PRACTICE,6,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439837880,TESTS,248,WRONG_ANSWER
-yj12,339,12579726,Python 2,0,PRACTICE,0,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439837807,TESTS,0,COMPILATION_ERROR
-yj12,570,12516689,Python 2,0,PRACTICE,60,1000.0,B,Simple Game,"[constructive algorithms, greedy, implementation, math]",2147483647,1439492884,TESTS,62,OK
-yj12,570,12516631,Python 2,0,PRACTICE,16,1000.0,B,Simple Game,"[constructive algorithms, greedy, implementation, math]",2147483647,1439492815,TESTS,46,WRONG_ANSWER
-yj12,570,12516612,Python 2,204800,PRACTICE,62,500.0,A,Elections,[implementation],2147483647,1439492793,TESTS,62,OK
-yj12,443,12494414,GNU C++,307200,PRACTICE,34,1000.0,B,Kolya and Tandem Repeat,[brute force],2147483647,1439482041,TESTS,1903,OK
-yj12,443,12494384,GNU C++,204800,PRACTICE,9,1000.0,B,Kolya and Tandem Repeat,[brute force],2147483647,1439481933,TESTS,2000,TIME_LIMIT_EXCEEDED
-yj12,443,12494091,GNU C++,307200,PRACTICE,11,1000.0,B,Kolya and Tandem Repeat,[brute force],2147483647,1439480266,TESTS,1887,WRONG_ANSWER
-yj12,443,12494026,GNU C++,0,PRACTICE,4,1000.0,B,Kolya and Tandem Repeat,[brute force],2147483647,1439479784,TESTS,15,WRONG_ANSWER
-yj12,569,12457253,Python 2,0,PRACTICE,33,500.0,A,Music,"[implementation, math]",2147483647,1439235531,TESTS,62,OK
-yj12,569,12457245,Python 2,0,PRACTICE,0,500.0,A,Music,"[implementation, math]",2147483647,1439235509,TESTS,30,WRONG_ANSWER
-yj12,569,12457219,Python 2,0,PRACTICE,19,500.0,A,Music,"[implementation, math]",2147483647,1439235433,TESTS,61,WRONG_ANSWER
-yj12,569,12455689,Python 2,0,PRACTICE,14,500.0,A,Music,"[implementation, math]",2147483647,1439233118,TESTS,46,WRONG_ANSWER
-yj12,569,12447371,Python 2,0,CONTESTANT,14,500.0,A,Music,"[implementation, math]",3052,1439227252,TESTS,46,WRONG_ANSWER
-yj12,569,12441727,Python 2,10854400,CONTESTANT,29,1000.0,B,Inventory,[greedy],746,1439224946,TESTS,171,OK
-yj12,567,12396700,GNU C++,6451200,PRACTICE,51,2000.0,D,One-Dimensional Battle Ships,"[binary search, data structures, sortings]",2147483647,1438921721,TESTS,483,OK
-yj12,567,12396054,GNU C++,0,PRACTICE,4,2000.0,D,One-Dimensional Battle Ships,"[binary search, data structures, sortings]",2147483647,1438915371,TESTS,0,WRONG_ANSWER
-yj12,567,12395732,GNU C++,0,PRACTICE,3,2000.0,D,One-Dimensional Battle Ships,"[binary search, data structures, sortings]",2147483647,1438911724,TESTS,15,WRONG_ANSWER
-yj12,567,12394193,GNU C++,34611200,PRACTICE,81,1500.0,C,Geometric Progression,"[binary search, data structures, dp]",2147483647,1438893676,TESTS,670,OK
-yj12,567,12374147,GNU C++,3174400,CONTESTANT,0,1500.0,C,Geometric Progression,"[binary search, data structures, dp]",8738,1438799138,CHALLENGES,46,WRONG_ANSWER
-yj12,567,12369372,GNU C++,3174400,CONTESTANT,12,1500.0,C,Geometric Progression,"[binary search, data structures, dp]",5858,1438796258,CHALLENGES,31,CHALLENGED
-yj12,567,12359067,Python 2,5734400,CONTESTANT,54,500.0,A,Lineland Mail,[implementation],1558,1438791958,TESTS,280,OK
-yj12,567,12358749,GNU C++,0,CONTESTANT,0,500.0,A,Lineland Mail,[implementation],1466,1438791866,PRETESTS,0,COMPILATION_ERROR
-yj12,567,12358232,Python 2,0,CONTESTANT,6,500.0,A,Lineland Mail,[implementation],1317,1438791717,PRETESTS,46,WRONG_ANSWER
-yj12,567,12356561,Python 2,0,CONTESTANT,34,1000.0,B,Berland National Library,[implementation],915,1438791315,TESTS,61,OK
-yj12,361,12353323,Python 2,6656000,PRACTICE,47,1000.0,B,Levko and Permutation,"[constructive algorithms, math, number theory]",2147483647,1438789786,TESTS,62,OK
-yj12,361,12353311,Python 2,614400,PRACTICE,7,1000.0,B,Levko and Permutation,"[constructive algorithms, math, number theory]",2147483647,1438789741,TESTS,46,WRONG_ANSWER
-yj12,361,12353292,Python 2,512000,PRACTICE,6,1000.0,B,Levko and Permutation,"[constructive algorithms, math, number theory]",2147483647,1438789630,TESTS,46,WRONG_ANSWER
-yj12,361,12353274,Python 2,0,PRACTICE,3,1000.0,B,Levko and Permutation,"[constructive algorithms, math, number theory]",2147483647,1438789516,TESTS,46,WRONG_ANSWER
-yj12,361,12353132,Python 2,0,PRACTICE,2,1000.0,B,Levko and Permutation,"[constructive algorithms, math, number theory]",2147483647,1438788905,TESTS,46,WRONG_ANSWER
-yj12,429,12339869,GNU C++,5324800,PRACTICE,35,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1438699536,TESTS,124,OK
-yj12,507,12339798,GNU C++,0,PRACTICE,62,1500.0,C,Guess Your Way Out!,"[implementation, math]",2147483647,1438699240,TESTS,31,OK
-yj12,292,12329050,GNU C++,409600,PRACTICE,45,1000.0,B,Network Topology,"[graphs, implementation]",2147483647,1438622352,TESTS,92,OK
-yj12,292,12328888,GNU C++,409600,PRACTICE,45,1000.0,B,Network Topology,"[graphs, implementation]",2147483647,1438621173,TESTS,716,OK
-yj12,534,12327623,GNU C++,7987200,PRACTICE,99,1500.0,C,Polycarpus' Dice,[math],2147483647,1438615385,TESTS,530,OK
-yj12,534,12327553,GNU C++,9625600,PRACTICE,49,1500.0,C,Polycarpus' Dice,[math],2147483647,1438615030,TESTS,483,WRONG_ANSWER
-yj12,501,12320550,GNU C++,1740800,PRACTICE,49,1500.0,C,Misha and Forest,"[constructive algorithms, data structures, greedy, sortings, trees]",2147483647,1438573465,TESTS,265,OK
-yj12,490,12319937,GNU C++,10649600,PRACTICE,71,1500.0,C,Hacking Cypher,"[brute force, math, strings]",2147483647,1438567951,TESTS,187,OK
-yj12,490,12319934,GNU C++,0,PRACTICE,0,1500.0,C,Hacking Cypher,"[brute force, math, strings]",2147483647,1438567902,TESTS,0,WRONG_ANSWER
-yj12,479,12297666,GNU C++,3276800,PRACTICE,111,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438391951,TESTS,296,OK
-yj12,479,12297608,GNU C++,3276800,PRACTICE,62,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438391478,TESTS,280,WRONG_ANSWER
-yj12,479,12296998,GNU C++,3276800,PRACTICE,11,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438383777,TESTS,265,WRONG_ANSWER
-yj12,479,12296979,GNU C++,3276800,PRACTICE,10,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438383416,TESTS,280,WRONG_ANSWER
-yj12,479,12296964,GNU C++,3174400,PRACTICE,7,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438383189,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,479,12296926,GNU C++,409600,PRACTICE,7,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438382654,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,479,12296917,GNU C++,0,PRACTICE,2,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438382446,TESTS,15,WRONG_ANSWER
-yj12,479,12296911,GNU C++,0,PRACTICE,4,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438382339,TESTS,15,WRONG_ANSWER
-yj12,479,12296887,GNU C++,0,PRACTICE,3,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438381843,TESTS,15,WRONG_ANSWER
-yj12,106,12294200,GNU C++,0,PRACTICE,55,1000.0,B,Choosing Laptop,"[brute force, implementation]",2147483647,1438360246,TESTS,60,OK
-yj12,337,12284453,GNU C++,0,PRACTICE,34,1000.0,B,Routine Problem,"[greedy, math, number theory]",2147483647,1438303647,TESTS,30,OK
-yj12,337,12284446,GNU C++,0,PRACTICE,7,1000.0,B,Routine Problem,"[greedy, math, number theory]",2147483647,1438303585,TESTS,30,WRONG_ANSWER
-yj12,337,12284438,GNU C++,0,PRACTICE,7,1000.0,B,Routine Problem,"[greedy, math, number theory]",2147483647,1438303511,TESTS,30,WRONG_ANSWER
-yj12,337,12284150,GNU C++,0,PRACTICE,7,1000.0,B,Routine Problem,"[greedy, math, number theory]",2147483647,1438298627,TESTS,30,WRONG_ANSWER
-yj12,493,12241956,GNU C++,4096000,PRACTICE,35,2000.0,C,Vasya and Basketball,"[binary search, brute force, implementation, sortings, two pointers]",2147483647,1438007960,TESTS,951,OK
-yj12,429,12154940,GNU C++,5324800,PRACTICE,35,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1437520962,TESTS,592,OK
-yj12,429,11100786,Python 2,25088000,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431623482,TESTS,592,RUNTIME_ERROR
-yj12,429,11100774,Python 2,24780800,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431623414,TESTS,592,RUNTIME_ERROR
-yj12,429,11100757,Python 2,24678400,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431623317,TESTS,592,RUNTIME_ERROR
-yj12,429,11100263,Python 2,1126400,PRACTICE,7,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431619528,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,429,11100174,Python 2,0,PRACTICE,1,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431619033,TESTS,46,WRONG_ANSWER
-yj12,429,11100078,Python 2,22220800,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431618328,TESTS,623,RUNTIME_ERROR
-yj12,429,11099960,Python 2,22118400,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431617272,TESTS,608,RUNTIME_ERROR
-yj12,429,11099949,Python 2,22118400,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431617160,TESTS,608,RUNTIME_ERROR
-yj12,429,11099902,Python 2,23244800,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431616718,TESTS,592,WRONG_ANSWER
-yj12,429,11099821,Python 2,22220800,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431616135,TESTS,639,WRONG_ANSWER
-yj12,429,11099812,Python 2,22323200,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431616080,TESTS,607,WRONG_ANSWER
-yj12,429,11099778,Python 2,22118400,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431615825,TESTS,638,WRONG_ANSWER
-yj12,429,11099663,Python 2,22220800,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431614990,TESTS,592,RUNTIME_ERROR
-yj12,429,11099658,Python 2,26828800,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431614924,TESTS,639,RUNTIME_ERROR
-yj12,429,11099616,Python 2,28364800,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431614624,TESTS,639,RUNTIME_ERROR
-yj12,429,11099454,Python 2,0,PRACTICE,1,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431613611,TESTS,46,WRONG_ANSWER
-yj12,429,11099385,Python 2,0,PRACTICE,1,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431613128,TESTS,31,WRONG_ANSWER
-yj12,429,11099058,Python 2,0,PRACTICE,2,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431611046,TESTS,31,WRONG_ANSWER
-yj12,429,11095661,Python 2,0,PRACTICE,1,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431586543,TESTS,31,WRONG_ANSWER
-yj12,429,11095653,Python 2,0,PRACTICE,0,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431586508,TESTS,46,WRONG_ANSWER
-yj12,343,11058950,Python 2,0,PRACTICE,53,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1431222996,TESTS,92,OK
-yj12,343,11058898,Python 2,614400,PRACTICE,29,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1431222300,TESTS,248,RUNTIME_ERROR
-yj12,343,11058874,Python 2,0,PRACTICE,5,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1431222021,TESTS,92,WRONG_ANSWER
-yj12,343,11058869,Python 2,0,PRACTICE,0,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1431221986,TESTS,92,WRONG_ANSWER
-yj12,343,11058724,Python 2,614400,PRACTICE,5,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1431220296,TESTS,248,RUNTIME_ERROR
-yj12,343,11058721,Python 2,614400,PRACTICE,5,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1431220223,TESTS,218,RUNTIME_ERROR
-yj12,343,11058712,Python 2,0,PRACTICE,3,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1431220105,TESTS,62,WRONG_ANSWER
-yj12,389,11058571,Python 2,102400,PRACTICE,42,1000.0,B,Fox and Cross,"[greedy, implementation]",2147483647,1431217325,TESTS,358,OK
-yj12,284,11058497,Python 2,307200,PRACTICE,66,1000.0,B,Cows and Poker Game,"[brute force, implementation]",2147483647,1431215596,TESTS,124,OK
-yj12,337,10706225,Python 2,0,PRACTICE,18,500.0,A,Puzzles,"[dp, graph matchings, greedy]",2147483647,1429029140,TESTS,124,OK
-yj12,337,10706220,Python 2,0,PRACTICE,1,500.0,A,Puzzles,"[dp, graph matchings, greedy]",2147483647,1429029066,TESTS,62,WRONG_ANSWER
-yj12,441,9064116,Python 2,102400,PRACTICE,51,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418166968,TESTS,62,OK
-yj12,441,9064109,Python 2,102400,PRACTICE,9,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418166806,TESTS,77,WRONG_ANSWER
-yj12,441,9064107,Python 2,102400,PRACTICE,4,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418166729,TESTS,46,WRONG_ANSWER
-yj12,441,9064094,Python 2,102400,PRACTICE,4,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418166524,TESTS,46,WRONG_ANSWER
-yj12,441,9064027,Python 2,512000,PRACTICE,3,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418165539,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,441,9063933,Python 2,512000,PRACTICE,3,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418164166,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,441,9063872,Python 2,512000,PRACTICE,3,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418163484,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,441,9063862,Python 2,512000,PRACTICE,3,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418163380,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,441,9063855,Python 2,512000,PRACTICE,3,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418163321,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,441,9063846,Python 2,819200,PRACTICE,3,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418163199,TESTS,1000,TIME_LIMIT_EXCEEDED
-yj12,441,9063818,Python 2,0,PRACTICE,0,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418162955,TESTS,31,WRONG_ANSWER
-yj12,441,9062577,Python 2,512000,PRACTICE,4,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418151899,TESTS,62,WRONG_ANSWER
-yj12,441,9062550,Python 2,512000,PRACTICE,4,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418151595,TESTS,62,WRONG_ANSWER
-yj12,441,9062497,Python 2,0,PRACTICE,2,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418151191,TESTS,61,WRONG_ANSWER
-yj12,441,9062486,Python 2,0,PRACTICE,2,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418151109,TESTS,46,WRONG_ANSWER
-yj12,441,9062470,Python 2,0,PRACTICE,2,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418150991,TESTS,46,WRONG_ANSWER
-yj12,441,9062368,Python 2,512000,PRACTICE,4,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418150150,TESTS,46,WRONG_ANSWER
-yj12,441,9062231,Python 2,0,PRACTICE,2,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418149213,TESTS,46,WRONG_ANSWER
-yj12,441,9062224,Python 2,0,PRACTICE,0,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418149148,TESTS,30,RUNTIME_ERROR
-yj12,441,9062162,Python 2,0,PRACTICE,2,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418148653,TESTS,31,WRONG_ANSWER
-yj12,441,9062140,Python 2,0,PRACTICE,2,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418148478,TESTS,31,WRONG_ANSWER
-yj12,424,9061023,Python 2,0,PRACTICE,32,500.0,A,Squats,[implementation],2147483647,1418141563,TESTS,77,OK
-yj12,486,8664857,Python 2,2662400,PRACTICE,40,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415737263,TESTS,109,OK
-yj12,486,8664842,Python 2,0,PRACTICE,3,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415737084,TESTS,31,WRONG_ANSWER
-yj12,486,8664840,Python 2,0,PRACTICE,0,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415737043,TESTS,30,WRONG_ANSWER
-yj12,486,8664822,Python 2,0,PRACTICE,4,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415736894,TESTS,46,WRONG_ANSWER
-yj12,486,8664280,Python 2,2355200,PRACTICE,7,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415733458,TESTS,93,WRONG_ANSWER
-yj12,486,8663941,Python 2,2457600,PRACTICE,7,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415731894,TESTS,124,RUNTIME_ERROR
-yj12,486,8663905,Python 2,0,PRACTICE,1,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415731743,TESTS,31,RUNTIME_ERROR
-yj12,486,8663443,Python 2,0,PRACTICE,2,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415730011,TESTS,46,WRONG_ANSWER
-yj12,486,8663273,Python 2,0,PRACTICE,0,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415729502,TESTS,46,WRONG_ANSWER
-yj12,486,8661999,Python 2,0,PRACTICE,1,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415727312,TESTS,46,WRONG_ANSWER
-yj12,486,8661960,Python 2,0,PRACTICE,0,1000.0,B,OR in Matrix,"[greedy, hashing, implementation]",2147483647,1415727271,TESTS,30,WRONG_ANSWER
-yj12,486,8661700,Python 2,0,CONTESTANT,1,1500.0,C,Palindrome Transformation,"[greedy, implementation]",7164,1415725164,PRETESTS,46,WRONG_ANSWER
-yj12,486,8660784,Python 2,0,CONTESTANT,1,1500.0,C,Palindrome Transformation,"[greedy, implementation]",6437,1415724437,PRETESTS,46,WRONG_ANSWER
-yj12,486,8660715,Python 2,0,CONTESTANT,0,1500.0,C,Palindrome Transformation,"[greedy, implementation]",6375,1415724375,PRETESTS,30,WRONG_ANSWER
-yj12,486,8657280,Python 2,204800,CONTESTANT,47,1000.0,B,OR in Matrix,"[greedy, hashing, implementation]",3748,1415721748,TESTS,639,OK
-yj12,486,8650467,Python 2,0,CONTESTANT,39,500.0,A,Calculating Function,"[implementation, math]",267,1415718267,TESTS,61,OK
-yj12,388,8527022,Python 2,0,PRACTICE,36,500.0,A,Fox and Box Accumulation,"[greedy, sortings]",2147483647,1414954522,TESTS,62,OK
-yj12,433,8526743,Python 2,0,PRACTICE,50,500.0,A,Kitahara Haruki's Gift,"[brute force, implementation]",2147483647,1414952968,TESTS,62,OK
-yj12,433,8526694,Python 2,0,PRACTICE,0,500.0,A,Kitahara Haruki's Gift,"[brute force, implementation]",2147483647,1414952706,TESTS,30,WRONG_ANSWER
-yj12,433,8526676,Python 2,0,PRACTICE,3,500.0,A,Kitahara Haruki's Gift,"[brute force, implementation]",2147483647,1414952585,TESTS,46,WRONG_ANSWER
-yj12,433,8526542,Python 2,0,PRACTICE,34,500.0,A,Kitahara Haruki's Gift,"[brute force, implementation]",2147483647,1414951762,TESTS,61,WRONG_ANSWER
-yj12,433,8526530,Python 2,0,PRACTICE,0,500.0,A,Kitahara Haruki's Gift,"[brute force, implementation]",2147483647,1414951718,TESTS,31,WRONG_ANSWER
-yj12,433,8526499,Python 2,0,PRACTICE,8,500.0,A,Kitahara Haruki's Gift,"[brute force, implementation]",2147483647,1414951603,TESTS,46,WRONG_ANSWER
-yj12,427,6588186,Python 2,12390400,VIRTUAL,80,1000.0,B,Prison Transfer,"[data structures, implementation]",984,1399823184,TESTS,218,OK
-yj12,427,6588063,Python 2,4710400,VIRTUAL,63,500.0,A,Police Recruits,[implementation],376,1399822577,TESTS,109,OK
-yj12,417,6389704,Python 2,36454400,CONTESTANT,48,1500.0,C,Football,"[constructive algorithms, graphs, implementation]",2782,1397751982,TESTS,857,OK
-yj12,417,6387325,Python 2,0,CONTESTANT,24,500.0,A,Elimination,"[dp, implementation, math]",1218,1397750418,TESTS,61,WRONG_ANSWER
-yj12,417,6387056,Python 2,0,CONTESTANT,0,500.0,A,Elimination,"[dp, implementation, math]",1084,1397750284,PRETESTS,15,WRONG_ANSWER
-yj12,417,6386181,Python 2,0,CONTESTANT,0,500.0,A,Elimination,"[dp, implementation, math]",613,1397749813,PRETESTS,15,WRONG_ANSWER
-yj12,404,6385550,Python 2,512000,PRACTICE,47,500.0,A,Valera and X,[implementation],2147483647,1397748797,TESTS,46,OK
-yj12,415,6288739,Python 2,9420800,PRACTICE,84,1500.0,C,Mashmokh and Numbers,"[constructive algorithms, greedy, number theory]",2147483647,1396811143,TESTS,93,OK
-yj12,415,6288710,Python 2,0,PRACTICE,3,1500.0,C,Mashmokh and Numbers,"[constructive algorithms, greedy, number theory]",2147483647,1396811034,TESTS,61,WRONG_ANSWER
-yj12,415,6288680,Python 2,0,PRACTICE,1,1500.0,C,Mashmokh and Numbers,"[constructive algorithms, greedy, number theory]",2147483647,1396810916,TESTS,46,WRONG_ANSWER
-yj12,415,6284193,Python 2,0,CONTESTANT,3,1500.0,C,Mashmokh and Numbers,"[constructive algorithms, greedy, number theory]",5291,1396804092,PRETESTS,61,RUNTIME_ERROR
-yj12,415,6280007,Python 2,8704000,CONTESTANT,47,1000.0,B,Mashmokh and Tokens,"[binary search, greedy, math]",3057,1396801857,TESTS,218,OK
-yj12,415,6275397,Python 2,5427200,CONTESTANT,3,1000.0,B,Mashmokh and Tokens,"[binary search, greedy, math]",1285,1396800085,PRETESTS,140,WRONG_ANSWER
-yj12,415,6275205,Python 2,0,CONTESTANT,1,1000.0,B,Mashmokh and Tokens,"[binary search, greedy, math]",1229,1396800029,PRETESTS,31,WRONG_ANSWER
-yj12,415,6274564,Python 2,5836800,CONTESTANT,3,1000.0,B,Mashmokh and Tokens,"[binary search, greedy, math]",1036,1396799836,PRETESTS,140,WRONG_ANSWER
-yj12,415,6272976,Python 2,0,CONTESTANT,31,500.0,A,Mashmokh and Lights,[implementation],624,1396799424,TESTS,77,OK
-yj12,408,6271621,Python 2,102400,PRACTICE,20,500.0,A,Line to Cashier,[implementation],2147483647,1396798674,TESTS,62,OK
-yj12,408,6271619,Python 2,0,PRACTICE,0,500.0,A,Line to Cashier,[implementation],2147483647,1396798659,TESTS,46,WRONG_ANSWER
-yj12,405,6177805,Python 2,204800,PRACTICE,32,500.0,A,Gravity Flip,"[greedy, implementation, sortings]",2147483647,1396159638,TESTS,46,OK
-yj12,405,6177800,Python 2,0,PRACTICE,0,500.0,A,Gravity Flip,"[greedy, implementation, sortings]",2147483647,1396159585,TESTS,46,WRONG_ANSWER
+nimishagarg_ng,978,38212280,GNU C++14,3379200,PRACTICE,42,0.0,E,Bus Video System,[math],2147483647,1526296911,TESTS,15,OK
+nimishagarg_ng,978,38209976,GNU C++14,4198400,PRACTICE,39,0.0,D,Almost Arithmetic Progression,"[brute force, implementation, math]",2147483647,1526289150,TESTS,46,OK
+nimishagarg_ng,978,38181227,GNU C++14,4812800,OUT_OF_COMPETITION,6,0.0,D,Almost Arithmetic Progression,"[brute force, implementation, math]",6465,1526208765,TESTS,46,WRONG_ANSWER
+nimishagarg_ng,978,38172881,GNU C++14,4915200,OUT_OF_COMPETITION,16,0.0,C,Letters,"[binary search, implementation, two pointers]",3559,1526205859,TESTS,638,OK
+nimishagarg_ng,978,38170046,GNU C++14,3686400,OUT_OF_COMPETITION,13,0.0,B,File Name,"[greedy, strings]",2680,1526204980,TESTS,31,OK
+nimishagarg_ng,978,38168915,GNU C++14,3686400,OUT_OF_COMPETITION,28,0.0,A,Remove Duplicates,[implementation],2360,1526204660,TESTS,30,OK
+nimishagarg_ng,490,38151129,GNU C++14,3379200,PRACTICE,2,1000.0,B,Queue,"[dsu, implementation]",2147483647,1526180044,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,30,38150770,GNU C++14,3584000,PRACTICE,50,1500.0,C,Shooting Gallery,"[dp, probabilities]",2147483647,1526177812,TESTS,62,OK
+nimishagarg_ng,30,38150560,GNU C++14,3481600,PRACTICE,3,1500.0,C,Shooting Gallery,"[dp, probabilities]",2147483647,1526176363,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,384,38150284,GNU C++14,4096000,PRACTICE,42,1500.0,C,Milking cows,[greedy],2147483647,1526174257,TESTS,62,OK
+nimishagarg_ng,287,38130204,GNU C++14,7168000,PRACTICE,30,1500.0,C,Lucky Permutation,"[constructive algorithms, greedy, implementation, math]",2147483647,1526107688,TESTS,92,OK
+nimishagarg_ng,237,38126819,GNU C++14,15667200,PRACTICE,55,1500.0,C,Primes on Interval,"[binary search, number theory, two pointers]",2147483647,1526096612,TESTS,78,OK
+nimishagarg_ng,314,38119938,GNU C++14,3379200,PRACTICE,3,500.0,A,Sereja and Contest,[implementation],2147483647,1526058389,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,314,38119811,GNU C++14,3686400,PRACTICE,3,500.0,A,Sereja and Contest,[implementation],2147483647,1526058035,TESTS,60,WRONG_ANSWER
+nimishagarg_ng,314,38119681,GNU C++14,3686400,PRACTICE,3,500.0,A,Sereja and Contest,[implementation],2147483647,1526057601,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,788,38118654,GNU C++14,4915200,PRACTICE,52,500.0,A,Functions again,"[dp, two pointers]",2147483647,1526054411,TESTS,46,OK
+nimishagarg_ng,704,38074813,GNU C++14,187801600,PRACTICE,99,500.0,A,Thor,"[brute force, data structures, implementation]",2147483647,1525876974,TESTS,904,OK
+nimishagarg_ng,272,38070588,GNU C++14,4096000,PRACTICE,48,1500.0,C,Dima and Staircase,"[data structures, implementation]",2147483647,1525868079,TESTS,716,OK
+nimishagarg_ng,578,38067046,GNU C++14,3379200,PRACTICE,31,250.0,A,A Problem about Polyline,"[geometry, math]",2147483647,1525859627,TESTS,15,OK
+nimishagarg_ng,980,38045496,GNU C++14,3891200,CONTESTANT,82,1500.0,C,Posterized,"[games, greedy]",5899,1525797799,TESTS,77,OK
+nimishagarg_ng,980,38044308,GNU C++14,3481600,CONTESTANT,8,1500.0,C,Posterized,"[games, greedy]",5471,1525797371,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,980,38037469,GNU C++14,3379200,CONTESTANT,88,1000.0,B,Marlin,[constructive algorithms],3152,1525795052,TESTS,31,OK
+nimishagarg_ng,980,38031806,GNU C++14,3379200,CONTESTANT,4,1000.0,B,Marlin,[constructive algorithms],1518,1525793418,PRETESTS,30,WRONG_ANSWER
+nimishagarg_ng,980,38026130,GNU C++14,3379200,CONTESTANT,69,500.0,A,Links and Pearls,"[implementation, math]",353,1525792253,TESTS,31,OK
+nimishagarg_ng,922,38021274,GNU C++14,3686400,PRACTICE,90,1250.0,C,Cave Painting,"[brute force, number theory]",2147483647,1525784850,TESTS,46,OK
+nimishagarg_ng,745,38019929,GNU C++14,4915200,PRACTICE,61,1500.0,C,Hongcow Builds A Nation,"[constructive algorithms, dfs and similar, graphs]",2147483647,1525781584,TESTS,61,OK
+nimishagarg_ng,599,38018249,GNU C++14,7577600,PRACTICE,61,1000.0,B,Spongebob and Joke,[implementation],2147483647,1525777141,TESTS,124,OK
+nimishagarg_ng,599,38018202,GNU C++14,7577600,PRACTICE,19,1000.0,B,Spongebob and Joke,[implementation],2147483647,1525777005,TESTS,108,WRONG_ANSWER
+nimishagarg_ng,731,38017757,GNU C++14,27648000,PRACTICE,70,1500.0,C,Socks,"[dsu, graphs, greedy]",2147483647,1525775732,TESTS,483,OK
+nimishagarg_ng,782,38016934,GNU C++14,4608000,PRACTICE,46,1000.0,B,The Meeting Place Cannot Be Changed,"[binary search, ternary search]",2147483647,1525773002,TESTS,77,OK
+nimishagarg_ng,782,38016844,GNU C++14,3379200,PRACTICE,2,1000.0,B,The Meeting Place Cannot Be Changed,"[binary search, ternary search]",2147483647,1525772663,TESTS,5000,TIME_LIMIT_EXCEEDED
+nimishagarg_ng,505,38004257,GNU C++14,3481600,PRACTICE,29,1000.0,B,Mr. Kitayuta's Colorful Graph,"[dfs and similar, dp, dsu, graphs]",2147483647,1525716678,TESTS,31,OK
+nimishagarg_ng,322,38003054,GNU C++14,3379200,PRACTICE,40,1000.0,B,Ciel and Flowers,"[combinatorics, math]",2147483647,1525713412,TESTS,62,OK
+nimishagarg_ng,322,38002940,GNU C++14,3379200,PRACTICE,9,1000.0,B,Ciel and Flowers,"[combinatorics, math]",2147483647,1525713147,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,527,37998596,GNU C++14,6963200,PRACTICE,57,1000.0,B,Error Correct System,[greedy],2147483647,1525703492,TESTS,31,OK
+nimishagarg_ng,697,37986349,GNU C++14,3686400,PRACTICE,42,1000.0,B,Barnicle,[implementation],2147483647,1525673595,TESTS,31,OK
+nimishagarg_ng,697,37986255,GNU C++14,3686400,PRACTICE,29,1000.0,B,Barnicle,[implementation],2147483647,1525673263,TESTS,31,WRONG_ANSWER
+nimishagarg_ng,697,37986151,GNU C++14,3686400,PRACTICE,8,1000.0,B,Barnicle,[implementation],2147483647,1525672910,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,498,37985609,GNU C++14,3686400,PRACTICE,51,500.0,A,Crazy Town,[geometry],2147483647,1525670718,TESTS,31,OK
+nimishagarg_ng,498,37985562,GNU C++14,3379200,PRACTICE,2,500.0,A,Crazy Town,[geometry],2147483647,1525670476,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,793,37918236,GNU C++14,5939200,PRACTICE,66,1000.0,B,Igor and his way to work,"[dfs and similar, shortest paths]",2147483647,1525580227,TESTS,46,OK
+nimishagarg_ng,271,37887659,GNU C++14,10035200,PRACTICE,42,1000.0,B,Prime Matrix,"[binary search, brute force, math, number theory]",2147483647,1525451240,TESTS,218,OK
+nimishagarg_ng,689,37887315,GNU C++14,5017600,PRACTICE,54,1000.0,B,Mike and Shortcuts,[dfs and similar],2147483647,1525450086,TESTS,93,OK
+nimishagarg_ng,689,37886808,GNU C++14,3379200,PRACTICE,5,1000.0,B,Mike and Shortcuts,[dfs and similar],2147483647,1525448402,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,689,37886615,GNU C++14,3379200,PRACTICE,3,1000.0,B,Mike and Shortcuts,[dfs and similar],2147483647,1525447679,TESTS,31,WRONG_ANSWER
+nimishagarg_ng,958,37367425,GNU C++14,7372800,PRACTICE,59,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",2147483647,1523867251,TESTS,124,OK
+toxic_hack,958,37324952,GNU C++14,3481600,CONTESTANT,1,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",16274,1523705774,TESTS,15,WRONG_ANSWER
+toxic_hack,958,37324814,GNU C++14,3584000,CONTESTANT,36,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",16069,1523705569,TESTS,46,WRONG_ANSWER
+toxic_hack,958,37324745,GNU C++14,3481600,CONTESTANT,1,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",15942,1523705442,TESTS,15,WRONG_ANSWER
+toxic_hack,958,37324717,GNU C++14,0,CONTESTANT,0,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",15884,1523705384,TESTS,0,COMPILATION_ERROR
+toxic_hack,958,37324231,GNU C++14,3481600,CONTESTANT,1,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",14397,1523703897,TESTS,15,WRONG_ANSWER
+toxic_hack,958,37323263,GNU C++14,3481600,CONTESTANT,1,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",12515,1523702015,TESTS,15,WRONG_ANSWER
+toxic_hack,958,37322951,GNU C++14,3584000,CONTESTANT,36,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",12104,1523701604,TESTS,46,WRONG_ANSWER
+toxic_hack,958,37322397,GNU C++14,3379200,CONTESTANT,6,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",11392,1523700892,TESTS,15,WRONG_ANSWER
+toxic_hack,958,37316187,Python 2,6041600,CONTESTANT,51,0.0,E1,Guard Duty (easy),"[brute force, geometry, greedy, math]",4621,1523694121,TESTS,124,OK
+toxic_hack,958,37314807,GNU C++14,3481600,CONTESTANT,36,0.0,A1,Death Stars (easy),[implementation],3484,1523692984,TESTS,31,OK
+toxic_hack,958,37314638,GNU C++14,8806400,CONTESTANT,16,0.0,D1,Hyperspace Jump (easy),"[expression parsing, math]",3360,1523692860,TESTS,498,OK
+toxic_hack,958,37313762,GNU C++14,3379200,CONTESTANT,69,0.0,F1,Lightsabers (easy),[implementation],2682,1523692182,TESTS,31,OK
+toxic_hack,958,37312899,GNU C++14,3379200,CONTESTANT,1,0.0,F1,Lightsabers (easy),[implementation],2005,1523691505,TESTS,15,WRONG_ANSWER
+toxic_hack,958,37311424,GNU C++14,4915200,CONTESTANT,27,0.0,C1,Encryption (easy),[brute force],886,1523690386,TESTS,46,OK
+toxic_hack,958,37311258,GNU C++14,3379200,CONTESTANT,9,0.0,B1,Maximum Control (easy),[implementation],748,1523690248,TESTS,15,OK
+nimishagarg_ng,962,37171045,GNU C++14,24985600,CONTESTANT,26,0.0,D,Merge Equals,"[data structures, implementation]",6136,1523377036,TESTS,389,OK
+nimishagarg_ng,962,37169046,GNU C++14,3481600,CONTESTANT,5,0.0,D,Merge Equals,"[data structures, implementation]",5435,1523376335,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,962,37162729,GNU C++14,4710400,CONTESTANT,70,0.0,C,Make a Square,"[brute force, implementation, math]",3380,1523374280,TESTS,31,OK
+nimishagarg_ng,962,37161843,GNU C++14,4403200,CONTESTANT,9,0.0,C,Make a Square,"[brute force, implementation, math]",3135,1523374035,TESTS,31,WRONG_ANSWER
+nimishagarg_ng,962,37155503,GNU C++14,4300800,CONTESTANT,93,0.0,B,Students in Railway Carriage,"[constructive algorithms, greedy, implementation]",1561,1523372461,TESTS,31,OK
+nimishagarg_ng,962,37148679,GNU C++14,5222400,CONTESTANT,106,0.0,A,Equator,[implementation],247,1523371147,TESTS,77,OK
+nimishagarg_ng,688,36887958,GNU C++14,9216000,PRACTICE,56,1500.0,C,NP-Hard Problem,"[dfs and similar, graphs]",2147483647,1522698292,TESTS,93,OK
+nimishagarg_ng,495,36704625,GNU C++14,3686400,PRACTICE,37,1000.0,B,Modular Equations,[math],2147483647,1522272027,TESTS,31,OK
+nimishagarg_ng,496,36703295,GNU C++14,3788800,PRACTICE,49,1750.0,C,Removing Columns,"[brute force, constructive algorithms, implementation]",2147483647,1522267306,TESTS,30,OK
+nimishagarg_ng,92,36701030,GNU C++14,5939200,PRACTICE,51,1500.0,C,Newspaper Headline,"[binary search, data structures, dp, greedy]",2147483647,1522260096,TESTS,124,OK
+nimishagarg_ng,92,36700593,GNU C++14,3379200,PRACTICE,3,1500.0,C,Newspaper Headline,"[binary search, data structures, dp, greedy]",2147483647,1522258846,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,104,36698248,GNU C++14,3686400,PRACTICE,47,1500.0,C,Cthulhu,"[dsu, trees]",2147483647,1522252926,TESTS,62,OK
+nimishagarg_ng,104,36698012,GNU C++14,3379200,PRACTICE,2,1500.0,C,Cthulhu,"[dsu, trees]",2147483647,1522252297,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,204,36696001,GNU C++14,3686400,PRACTICE,62,500.0,A,Little Elephant and Interval,"[binary search, combinatorics, dp]",2147483647,1522247140,TESTS,60,OK
+nimishagarg_ng,948,36694195,GNU C++14,99328000,PRACTICE,50,2000.0,D,Perfect Security,[data structures],2147483647,1522243995,TESTS,654,OK
+nimishagarg_ng,955,36651568,GNU C++14,24678400,PRACTICE,20,1500.0,C,Sad powers,"[binary search, math, number theory]",2147483647,1522090909,TESTS,811,OK
+nimishagarg_ng,955,36651461,GNU C++14,24371200,PRACTICE,2,1500.0,C,Sad powers,"[binary search, math, number theory]",2147483647,1522090575,TESTS,1123,WRONG_ANSWER
+nimishagarg_ng,955,36542374,GNU C++14,3379200,CONTESTANT,34,500.0,A,Feed the cat,"[greedy, math]",2327,1521825227,TESTS,30,OK
+nimishagarg_ng,955,36541836,GNU C++14,3379200,CONTESTANT,2,500.0,A,Feed the cat,"[greedy, math]",2124,1521825024,PRETESTS,31,WRONG_ANSWER
+nimishagarg_ng,955,36540733,GNU C++14,3686400,CONTESTANT,56,1000.0,B,Not simply beatiful strings,[implementation],1750,1521824650,TESTS,31,OK
+nimishagarg_ng,955,36538676,GNU C++14,3379200,CONTESTANT,2,500.0,A,Feed the cat,"[greedy, math]",1118,1521824018,PRETESTS,30,WRONG_ANSWER
+nimishagarg_ng,955,36538297,GNU C++14,3379200,CONTESTANT,0,500.0,A,Feed the cat,"[greedy, math]",999,1521823899,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,954,36533532,GNU C++14,7987200,PRACTICE,35,0.0,D,Fight Against Traffic,"[dfs and similar, graphs, shortest paths]",2147483647,1521815423,TESTS,31,OK
+nimishagarg_ng,765,36506190,GNU C++14,10444800,PRACTICE,43,2000.0,D,Artsem and Saunders,"[constructive algorithms, dsu, math]",2147483647,1521728933,TESTS,93,OK
+nimishagarg_ng,626,36441944,GNU C++14,3379200,PRACTICE,78,1000.0,C,Block Towers,"[brute force, greedy]",2147483647,1521577488,TESTS,31,OK
+nimishagarg_ng,626,36441838,GNU C++14,3379200,PRACTICE,6,1000.0,C,Block Towers,"[brute force, greedy]",2147483647,1521576992,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,146,36381262,GNU C++14,9318400,PRACTICE,99,2000.0,D,Lucky Number 2,"[brute force, constructive algorithms, implementation]",2147483647,1521360101,TESTS,92,OK
+nimishagarg_ng,146,36381087,GNU C++14,9318400,PRACTICE,19,2000.0,D,Lucky Number 2,"[brute force, constructive algorithms, implementation]",2147483647,1521359720,TESTS,60,WRONG_ANSWER
+nimishagarg_ng,685,36370183,GNU C++14,41984000,PRACTICE,49,1250.0,B,Kay and Snowflake,"[data structures, dfs and similar, trees]",2147483647,1521315170,TESTS,935,OK
+nimishagarg_ng,949,36207411,GNU C++14,1945600,PRACTICE,36,1000.0,B,A Leapfrog in the Array,[math],2147483647,1520790987,TESTS,607,OK
+nimishagarg_ng,949,36197463,GNU C++14,1843200,PRACTICE,6,1000.0,B,A Leapfrog in the Array,[math],2147483647,1520768142,TESTS,748,WRONG_ANSWER
+nimishagarg_ng,949,36175350,GNU C++14,11059200,PRACTICE,71,500.0,A,Zebras,[greedy],2147483647,1520703780,TESTS,93,OK
+nimishagarg_ng,949,36154343,GNU C++14,8908800,PRACTICE,8,500.0,A,Zebras,[greedy],2147483647,1520694349,TESTS,62,WRONG_ANSWER
+nimishagarg_ng,949,36153929,GNU C++14,9216000,PRACTICE,7,500.0,A,Zebras,[greedy],2147483647,1520693414,TESTS,77,WRONG_ANSWER
+nimishagarg_ng,949,36153878,GNU C++14,9830400,PRACTICE,7,500.0,A,Zebras,[greedy],2147483647,1520693312,TESTS,77,WRONG_ANSWER
+nimishagarg_ng,949,36153838,GNU C++14,1843200,PRACTICE,0,500.0,A,Zebras,[greedy],2147483647,1520693188,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,949,36152950,GNU C++14,4915200,PRACTICE,7,500.0,A,Zebras,[greedy],2147483647,1520690802,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,931,36077952,GNU C++14,10444800,VIRTUAL,90,1750.0,D,Peculiar apple-tree,[dfs and similar],6545,1520529245,TESTS,46,OK
+nimishagarg_ng,931,36076060,GNU C++14,1945600,VIRTUAL,64,1000.0,B,World Cup,[implementation],1525,1520524225,TESTS,30,OK
+nimishagarg_ng,931,36075679,GNU C++14,1945600,VIRTUAL,40,500.0,A,Friends Meeting,"[brute force, implementation, math]",458,1520523158,TESTS,15,OK
+nimishagarg_ng,657,35977849,GNU C++14,2048000,PRACTICE,72,500.0,A,Bear and Forgotten Tree 3,[graphs],2147483647,1520287837,TESTS,46,OK
+nimishagarg_ng,657,35977843,GNU C++14,1843200,PRACTICE,0,500.0,A,Bear and Forgotten Tree 3,[graphs],2147483647,1520287801,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,657,35977798,GNU C++14,1945600,PRACTICE,4,500.0,A,Bear and Forgotten Tree 3,[graphs],2147483647,1520287522,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,657,35977693,GNU C++14,1843200,PRACTICE,9,500.0,A,Bear and Forgotten Tree 3,[graphs],2147483647,1520286931,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,657,35977585,GNU C++14,1843200,PRACTICE,4,500.0,A,Bear and Forgotten Tree 3,[graphs],2147483647,1520286374,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,768,35931476,GNU C++14,2252800,PRACTICE,87,1250.0,C,Jon Snow and his Favourite Number,"[brute force, dp, implementation, sortings]",2147483647,1520178790,TESTS,2090,OK
+nimishagarg_ng,768,35928607,GNU C++14,2252800,PRACTICE,87,1250.0,C,Jon Snow and his Favourite Number,"[brute force, dp, implementation, sortings]",2147483647,1520178128,TESTS,2105,OK
+nimishagarg_ng,938,35358518,GNU C++14,1945600,CONTESTANT,24,0.0,C,Constructing Tests,"[binary search, brute force]",3879,1518797379,TESTS,15,OK
+nimishagarg_ng,938,35351949,GNU C++14,2252800,CONTESTANT,48,0.0,B,Run For Your Prize,"[brute force, greedy]",1917,1518795417,TESTS,31,OK
+nimishagarg_ng,938,35346604,GNU C++14,1945600,CONTESTANT,49,0.0,A,Word Correction,[implementation],815,1518794315,TESTS,15,OK
+toxic_hack,934,35336657,GNU C++14,2048000,VIRTUAL,45,1000.0,B,A Prosperous Lot,[implementation],760,1518783760,TESTS,15,OK
+toxic_hack,934,35336651,GNU C++14,2048000,VIRTUAL,87,500.0,A,A Compatible Pair,"[brute force, games]",750,1518783750,TESTS,15,OK
+toxic_hack,934,35336569,Python 2,4608000,VIRTUAL,84,500.0,A,A Compatible Pair,"[brute force, games]",558,1518783558,TESTS,62,RUNTIME_ERROR
+toxic_hack,934,35336502,Python 2,4608000,VIRTUAL,5,500.0,A,A Compatible Pair,"[brute force, games]",426,1518783426,TESTS,62,RUNTIME_ERROR
+nimishagarg_ng,407,35166409,GNU C++14,47820800,PRACTICE,51,500.0,A,Triangle,"[brute force, implementation, math]",2147483647,1518399243,TESTS,187,OK
+nimishagarg_ng,407,35166348,GNU C++14,47820800,PRACTICE,10,500.0,A,Triangle,"[brute force, implementation, math]",2147483647,1518398837,TESTS,217,WRONG_ANSWER
+nimishagarg_ng,407,35166320,GNU C++14,47820800,PRACTICE,8,500.0,A,Triangle,"[brute force, implementation, math]",2147483647,1518398686,TESTS,187,WRONG_ANSWER
+nimishagarg_ng,407,35165796,GNU C++14,1945600,PRACTICE,1,500.0,A,Triangle,"[brute force, implementation, math]",2147483647,1518395113,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,121,35165662,GNU C++14,1945600,PRACTICE,42,500.0,A,Lucky Sum,[implementation],2147483647,1518393939,TESTS,15,OK
+nimishagarg_ng,121,35165652,GNU C++14,1945600,PRACTICE,29,500.0,A,Lucky Sum,[implementation],2147483647,1518393834,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,53,35165320,GNU C++14,1945600,PRACTICE,22,1500.0,C,Little Frog,[constructive algorithms],2147483647,1518391438,TESTS,30,OK
+lazycoder1412,922,35071989,Python 2,4608000,VIRTUAL,4,1250.0,C,Cave Painting,"[brute force, number theory]",5103,1518122463,TESTS,62,WRONG_ANSWER
+lazycoder1412,922,35071971,Python 2,4505600,VIRTUAL,4,1250.0,C,Cave Painting,"[brute force, number theory]",5055,1518122415,TESTS,46,WRONG_ANSWER
+lazycoder1412,922,35071532,Python 2,4608000,VIRTUAL,52,500.0,A,Cloning Toys,[implementation],3581,1518120941,TESTS,62,OK
+lazycoder1412,922,35070906,Python 2,4608000,VIRTUAL,21,500.0,A,Cloning Toys,[implementation],1710,1518119070,TESTS,62,WRONG_ANSWER
+lazycoder1412,922,35070596,Python 2,4608000,VIRTUAL,4,500.0,A,Cloning Toys,[implementation],926,1518118286,TESTS,46,WRONG_ANSWER
+lazycoder1412,922,35070592,GNU C++14,1945600,VIRTUAL,44,1000.0,B,Magic Forest,[brute force],918,1518118278,TESTS,31,OK
+lazycoder1412,922,35070455,Python 2,4505600,VIRTUAL,4,500.0,A,Cloning Toys,[implementation],538,1518117898,TESTS,61,WRONG_ANSWER
+nimishagarg_ng,375,35037603,GNU C++14,3993600,PRACTICE,58,500.0,A,Divisible by Seven,"[math, number theory]",2147483647,1518041896,TESTS,93,OK
+nimishagarg_ng,375,35037514,GNU C++14,3993600,PRACTICE,36,500.0,A,Divisible by Seven,"[math, number theory]",2147483647,1518041623,TESTS,93,WRONG_ANSWER
+nimishagarg_ng,375,35037367,GNU C++14,1843200,PRACTICE,2,500.0,A,Divisible by Seven,"[math, number theory]",2147483647,1518041152,TESTS,0,WRONG_ANSWER
+toxic_hack,822,35004892,GNU C++14,9216000,VIRTUAL,2,1250.0,C,"Hacker, pack your bags!","[binary search, greedy, sortings]",6411,1518020631,TESTS,0,RUNTIME_ERROR
+toxic_hack,822,35004808,GNU C++14,9216000,VIRTUAL,2,1250.0,C,"Hacker, pack your bags!","[binary search, greedy, sortings]",6243,1518020463,TESTS,0,RUNTIME_ERROR
+toxic_hack,822,35002428,GNU C++14,2048000,VIRTUAL,113,750.0,B,Crossword solving,"[brute force, implementation, strings]",968,1518015188,TESTS,15,OK
+toxic_hack,822,35002325,GNU C++14,1945600,VIRTUAL,5,750.0,B,Crossword solving,"[brute force, implementation, strings]",754,1518014974,TESTS,0,WRONG_ANSWER
+toxic_hack,822,35001996,Python 2,4608000,VIRTUAL,59,500.0,A,I'm bored with life,"[implementation, math, number theory]",149,1518014369,TESTS,62,OK
+nimishagarg_ng,364,34990327,GNU C++14,2867200,PRACTICE,39,500.0,A,Matrix,"[combinatorics, data structures, implementation]",2147483647,1517985618,TESTS,468,WRONG_ANSWER
+nimishagarg_ng,364,34990148,GNU C++14,2867200,PRACTICE,39,500.0,A,Matrix,"[combinatorics, data structures, implementation]",2147483647,1517985211,TESTS,468,WRONG_ANSWER
+nimishagarg_ng,364,34989810,GNU C++14,2867200,PRACTICE,39,500.0,A,Matrix,"[combinatorics, data structures, implementation]",2147483647,1517984274,TESTS,499,WRONG_ANSWER
+nimishagarg_ng,364,34988562,GNU C++14,2867200,PRACTICE,11,500.0,A,Matrix,"[combinatorics, data structures, implementation]",2147483647,1517980644,TESTS,499,WRONG_ANSWER
+nimishagarg_ng,364,34977910,GNU C++14,3584000,PRACTICE,11,500.0,A,Matrix,"[combinatorics, data structures, implementation]",2147483647,1517937374,TESTS,483,WRONG_ANSWER
+nimishagarg_ng,364,34977691,GNU C++14,3584000,PRACTICE,4,500.0,A,Matrix,"[combinatorics, data structures, implementation]",2147483647,1517936836,TESTS,514,WRONG_ANSWER
+nimishagarg_ng,364,34977551,GNU C++14,2252800,PRACTICE,3,500.0,A,Matrix,"[combinatorics, data structures, implementation]",2147483647,1517936494,TESTS,15,RUNTIME_ERROR
+nimishagarg_ng,487,34976648,GNU C++14,1945600,PRACTICE,46,500.0,A,Fight the Monster,"[binary search, brute force]",2147483647,1517934287,TESTS,15,OK
+nimishagarg_ng,487,34974628,GNU C++14,1843200,PRACTICE,12,500.0,A,Fight the Monster,"[binary search, brute force]",2147483647,1517929440,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,150,34958277,GNU C++14,103526400,PRACTICE,53,500.0,A,Win or Freeze,"[games, number theory]",2147483647,1517880170,TESTS,405,OK
+nimishagarg_ng,150,34958212,GNU C++14,103526400,PRACTICE,27,500.0,A,Win or Freeze,"[games, number theory]",2147483647,1517879878,TESTS,514,WRONG_ANSWER
+nimishagarg_ng,150,34958133,GNU C++14,1945600,PRACTICE,53,500.0,A,Win or Freeze,"[games, number theory]",2147483647,1517879496,TESTS,46,OK
+nimishagarg_ng,150,34957886,GNU C++14,103526400,PRACTICE,9,500.0,A,Win or Freeze,"[games, number theory]",2147483647,1517878148,TESTS,2000,TIME_LIMIT_EXCEEDED
+nimishagarg_ng,150,34957855,GNU C++14,94720000,PRACTICE,3,500.0,A,Win or Freeze,"[games, number theory]",2147483647,1517877971,TESTS,2000,TIME_LIMIT_EXCEEDED
+nimishagarg_ng,150,34957721,GNU C++14,103526400,PRACTICE,14,500.0,A,Win or Freeze,"[games, number theory]",2147483647,1517877176,TESTS,1715,WRONG_ANSWER
+toxic_hack,485,34876030,Python 2,4812800,VIRTUAL,27,1500.0,C,Bits,"[implementation, math]",5723,1517604263,TESTS,717,OK
+toxic_hack,485,34875605,Python 2,4608000,VIRTUAL,1,1500.0,C,Bits,"[implementation, math]",4237,1517602777,TESTS,46,WRONG_ANSWER
+toxic_hack,485,34875461,Python 2,4710400,VIRTUAL,3,1500.0,C,Bits,"[implementation, math]",3815,1517602355,TESTS,124,WRONG_ANSWER
+toxic_hack,485,34875326,Python 2,4608000,VIRTUAL,1,1500.0,C,Bits,"[implementation, math]",3385,1517601925,TESTS,61,WRONG_ANSWER
+toxic_hack,485,34875273,Python 2,4608000,VIRTUAL,1,1500.0,C,Bits,"[implementation, math]",3237,1517601778,TESTS,46,WRONG_ANSWER
+toxic_hack,485,34875204,Python 2,4608000,VIRTUAL,1,1500.0,C,Bits,"[implementation, math]",3062,1517601602,TESTS,46,WRONG_ANSWER
+toxic_hack,485,34874655,GNU C++14,1945600,VIRTUAL,23,1000.0,A,Factory,"[implementation, math, matrices]",1539,1517600079,TESTS,15,OK
+toxic_hack,485,34874507,GNU C++14,1945600,VIRTUAL,20,1000.0,A,Factory,"[implementation, math, matrices]",1119,1517599659,TESTS,15,WRONG_ANSWER
+toxic_hack,485,34874339,GNU C++14,1945600,VIRTUAL,45,500.0,B,Valuable Resources,"[brute force, greedy]",736,1517599276,TESTS,15,OK
+toxic_hack,485,34874291,GNU C++14,1843200,VIRTUAL,6,500.0,B,Valuable Resources,"[brute force, greedy]",591,1517599131,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,920,34856908,GNU C++14,3993600,CONTESTANT,139,0.0,C,Swap Adjacent Elements,"[dfs and similar, greedy, sortings, two pointers]",3633,1517585733,TESTS,62,OK
+nimishagarg_ng,920,34851129,GNU C++14,1945600,CONTESTANT,8,0.0,B,Tea Queue,[implementation],2169,1517584269,TESTS,15,OK
+nimishagarg_ng,920,34848400,GNU C++14,1945600,CONTESTANT,21,0.0,A,Water The Garden,[implementation],1569,1517583669,TESTS,15,OK
+nimishagarg_ng,920,34845346,GNU C++14,1843200,CONTESTANT,1,0.0,A,Water The Garden,[implementation],944,1517583044,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,242,34828601,GNU C++14,7884800,PRACTICE,43,1500.0,C,King's Path,"[dfs and similar, hashing, shortest paths]",2147483647,1517552547,TESTS,248,OK
+nimishagarg_ng,242,34822398,GNU C++14,17817600,PRACTICE,10,1500.0,C,King's Path,"[dfs and similar, hashing, shortest paths]",2147483647,1517530202,TESTS,2000,TIME_LIMIT_EXCEEDED
+nimishagarg_ng,242,34822333,GNU C++14,11264000,PRACTICE,10,1500.0,C,King's Path,"[dfs and similar, hashing, shortest paths]",2147483647,1517529842,TESTS,2000,TIME_LIMIT_EXCEEDED
+nimishagarg_ng,242,34820543,GNU C++14,14028800,PRACTICE,10,1500.0,C,King's Path,"[dfs and similar, hashing, shortest paths]",2147483647,1517520613,TESTS,2000,TIME_LIMIT_EXCEEDED
+lazycoder1412,205,34779564,GNU C++14,18124800,VIRTUAL,90,1500.0,D,Little Elephant and Cards,"[binary search, brute force, sortings]",5372,1517427272,TESTS,530,OK
+lazycoder1412,205,34779213,GNU C++14,2048000,VIRTUAL,13,1500.0,D,Little Elephant and Cards,"[binary search, brute force, sortings]",4590,1517426490,TESTS,30,WRONG_ANSWER
+lazycoder1412,205,34778523,GNU C++14,2662400,VIRTUAL,45,1000.0,B,Little Elephant and Sorting,"[brute force, greedy]",2855,1517424755,TESTS,46,OK
+lazycoder1412,205,34777526,GNU C++14,1843200,VIRTUAL,4,1000.0,B,Little Elephant and Sorting,"[brute force, greedy]",727,1517422627,TESTS,15,WRONG_ANSWER
+lazycoder1412,205,34777281,Python 2,14848000,VIRTUAL,45,500.0,A,Little Elephant and Rozdil,"[brute force, implementation]",239,1517422139,TESTS,560,OK
+nimishagarg_ng,919,34760468,GNU C++14,1843200,CONTESTANT,3,750.0,B,Perfect Number,"[binary search, brute force, dp, implementation, number theory]",3859,1517407759,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,919,34759588,GNU C++14,1843200,CONTESTANT,3,750.0,B,Perfect Number,"[binary search, brute force, dp, implementation, number theory]",3643,1517407543,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,919,34756007,GNU C++14,5836800,CONTESTANT,51,1000.0,C,Seat Arrangements,[implementation],2843,1517406743,TESTS,124,OK
+nimishagarg_ng,919,34754644,GNU C++14,5836800,CONTESTANT,12,1000.0,C,Seat Arrangements,[implementation],2573,1517406473,CHALLENGES,93,CHALLENGED
+nimishagarg_ng,919,34753072,GNU C++14,2867200,CONTESTANT,6,1000.0,C,Seat Arrangements,[implementation],2279,1517406179,PRETESTS,31,WRONG_ANSWER
+nimishagarg_ng,919,34739818,GNU C++14,1945600,CONTESTANT,43,500.0,A,Supermarket,[greedy],326,1517404226,TESTS,15,OK
+nimishagarg_ng,246,34584426,GNU C++14,25497600,VIRTUAL,37,2000.0,D,Colorful Graph,"[brute force, dfs and similar, graphs]",5792,1516989992,TESTS,560,OK
+nimishagarg_ng,246,34584147,GNU C++14,1843200,VIRTUAL,2,2000.0,D,Colorful Graph,"[brute force, dfs and similar, graphs]",5139,1516989339,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,246,34583616,GNU C++14,1945600,VIRTUAL,34,1500.0,C,Beauty Pageant,"[brute force, constructive algorithms, greedy]",3652,1516987852,TESTS,30,OK
+nimishagarg_ng,246,34582725,Python 2,7372800,VIRTUAL,30,1000.0,B,Increase and Decrease,"[greedy, math]",1743,1516985943,TESTS,154,OK
+nimishagarg_ng,246,34582027,Python 2,4608000,VIRTUAL,21,500.0,A,Buggy Sorting,"[constructive algorithms, greedy, sortings]",315,1516984515,TESTS,62,OK
+nimishagarg_ng,214,34578091,GNU C++14,3584000,PRACTICE,101,1000.0,B,Hometask,"[brute force, constructive algorithms, greedy, math]",2147483647,1516976104,TESTS,92,OK
+nimishagarg_ng,214,34578051,GNU C++14,3584000,PRACTICE,11,1000.0,B,Hometask,"[brute force, constructive algorithms, greedy, math]",2147483647,1516976013,TESTS,92,WRONG_ANSWER
+nimishagarg_ng,214,34577998,GNU C++14,3584000,PRACTICE,12,1000.0,B,Hometask,"[brute force, constructive algorithms, greedy, math]",2147483647,1516975898,TESTS,62,WRONG_ANSWER
+nimishagarg_ng,448,34558229,GNU C++14,1945600,PRACTICE,127,2000.0,D,Multiplication Table,"[binary search, brute force]",2147483647,1516914686,TESTS,187,OK
+nimishagarg_ng,448,34558086,GNU C++14,1945600,PRACTICE,5,2000.0,D,Multiplication Table,"[binary search, brute force]",2147483647,1516914111,TESTS,15,WRONG_ANSWER
+lazycoder1412,448,34557483,GNU C++14,2355200,VIRTUAL,12,2500.0,C,Painting Fence,"[divide and conquer, dp, greedy]",6853,1516911853,TESTS,46,WRONG_ANSWER
+lazycoder1412,448,34557391,GNU C++14,1945600,VIRTUAL,3,2500.0,C,Painting Fence,"[divide and conquer, dp, greedy]",6561,1516911561,TESTS,15,WRONG_ANSWER
+lazycoder1412,448,34557343,GNU C++14,1945600,VIRTUAL,3,2500.0,C,Painting Fence,"[divide and conquer, dp, greedy]",6432,1516911432,TESTS,0,WRONG_ANSWER
+lazycoder1412,448,34555637,Python 2,4608000,VIRTUAL,36,1000.0,B,Suffix Structures,"[implementation, strings]",1458,1516906458,TESTS,62,OK
+lazycoder1412,448,34555242,Python 2,4608000,VIRTUAL,25,500.0,A,Rewards,[implementation],291,1516905291,TESTS,62,OK
+nimishagarg_ng,354,34501747,GNU C++14,3072000,PRACTICE,23,500.0,A,Vasya and Robot,"[brute force, greedy, math]",2147483647,1516761971,TESTS,31,OK
+nimishagarg_ng,135,34499464,GNU C++14,2252800,PRACTICE,97,500.0,A,Replacement,"[implementation, sortings]",2147483647,1516754512,TESTS,124,OK
+nimishagarg_ng,135,34499430,GNU C++14,1843200,PRACTICE,4,500.0,A,Replacement,"[implementation, sortings]",2147483647,1516754362,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,337,34499224,GNU C++14,1945600,PRACTICE,73,1500.0,C,Quiz,"[binary search, greedy, math, matrices, number theory]",2147483647,1516753445,TESTS,30,OK
+nimishagarg_ng,337,34499108,GNU C++14,1945600,PRACTICE,15,1500.0,C,Quiz,"[binary search, greedy, math, matrices, number theory]",2147483647,1516752902,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,337,34499075,GNU C++14,1945600,PRACTICE,6,1500.0,C,Quiz,"[binary search, greedy, math, matrices, number theory]",2147483647,1516752769,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,300,34483463,GNU C++14,17920000,PRACTICE,32,2000.0,C,Beautiful Numbers,"[brute force, combinatorics]",2147483647,1516713759,TESTS,996,OK
+toxic_hack,914,34460307,GNU C++14,10137600,VIRTUAL,141,1500.0,C,Travelling Salesman and Special Numbers,"[brute force, combinatorics, dp]",9459,1516654359,TESTS,109,OK
+toxic_hack,914,34460239,GNU C++14,10035200,VIRTUAL,13,1500.0,C,Travelling Salesman and Special Numbers,"[brute force, combinatorics, dp]",9127,1516654027,TESTS,15,WRONG_ANSWER
+toxic_hack,914,34458484,Python 2,4608000,VIRTUAL,66,500.0,A,Perfect Squares,"[implementation, math]",2735,1516647635,TESTS,62,OK
+toxic_hack,914,34457857,Python 2,14540800,VIRTUAL,91,1000.0,B,Conan and Agasa play a Card Game,"[games, greedy]",824,1516645724,TESTS,171,OK
+toxic_hack,914,34457638,Python 2,4608000,VIRTUAL,2,500.0,A,Perfect Squares,"[implementation, math]",193,1516645093,TESTS,62,RUNTIME_ERROR
+nimishagarg_ng,424,34408765,GNU C++14,5939200,PRACTICE,50,1500.0,C,Magic Formulas,[math],2147483647,1516528878,TESTS,280,OK
+nimishagarg_ng,464,34290219,GNU C++14,1945600,PRACTICE,73,500.0,A,No to Palindromes!,"[greedy, strings]",2147483647,1516331093,TESTS,15,OK
+nimishagarg_ng,464,34290161,GNU C++14,1945600,PRACTICE,5,500.0,A,No to Palindromes!,"[greedy, strings]",2147483647,1516330915,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,343,34278438,GNU C++14,1945600,PRACTICE,53,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1516285798,TESTS,30,OK
+nimishagarg_ng,343,34278284,GNU C++14,1945600,PRACTICE,53,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1516285409,TESTS,30,OK
+nimishagarg_ng,235,34276735,GNU C++14,1945600,PRACTICE,87,500.0,A,LCM Challenge,[number theory],2147483647,1516281663,TESTS,30,OK
+nimishagarg_ng,235,34276575,GNU C++14,1945600,PRACTICE,32,500.0,A,LCM Challenge,[number theory],2147483647,1516281310,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,235,34276451,GNU C++14,1945600,PRACTICE,31,500.0,A,LCM Challenge,[number theory],2147483647,1516280961,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,429,34276248,GNU C++14,7065600,PRACTICE,35,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1516280410,TESTS,93,OK
+nimishagarg_ng,429,34264710,GNU C++14,2048000,PRACTICE,1,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1516242666,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,231,34257589,GNU C++14,7168000,PRACTICE,55,1500.0,C,To Add or Not to Add,"[binary search, sortings, two pointers]",2147483647,1516208009,TESTS,122,OK
+nimishagarg_ng,283,34224692,GNU C++14,5120000,PRACTICE,46,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516113483,TESTS,342,OK
+nimishagarg_ng,283,34224575,Python 2,10547200,PRACTICE,42,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516113139,TESTS,1029,RUNTIME_ERROR
+nimishagarg_ng,283,34224391,Python 2,10547200,PRACTICE,42,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516112655,TESTS,982,RUNTIME_ERROR
+nimishagarg_ng,283,34223927,GNU C++14,5120000,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516111441,TESTS,327,WRONG_ANSWER
+nimishagarg_ng,283,34223656,GNU C++14,5120000,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516110858,TESTS,405,WRONG_ANSWER
+nimishagarg_ng,283,34223513,GNU C++14,5120000,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516110546,TESTS,390,WRONG_ANSWER
+nimishagarg_ng,283,34223383,GNU C++14,5120000,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516110209,TESTS,373,WRONG_ANSWER
+nimishagarg_ng,283,34223274,GNU C++14,5120000,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516109926,TESTS,311,WRONG_ANSWER
+nimishagarg_ng,283,34222843,GNU C++14,5017600,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516108872,TESTS,1500,TIME_LIMIT_EXCEEDED
+nimishagarg_ng,283,34222490,GNU C++14,3481600,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516108010,TESTS,1153,WRONG_ANSWER
+nimishagarg_ng,283,34222393,GNU C++14,3481600,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516107791,TESTS,1216,WRONG_ANSWER
+nimishagarg_ng,348,34197749,GNU C++14,1945600,PRACTICE,34,500.0,A,Mafia,"[binary search, math, sortings]",2147483647,1516022377,TESTS,92,OK
+nimishagarg_ng,348,34197600,GNU C++14,1945600,PRACTICE,7,500.0,A,Mafia,"[binary search, math, sortings]",2147483647,1516022059,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,348,34197223,GNU C++14,1945600,PRACTICE,5,500.0,A,Mafia,"[binary search, math, sortings]",2147483647,1516021149,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,18,34195715,GNU C++14,2662400,PRACTICE,45,0.0,C,Stripe,"[data structures, implementation]",2147483647,1516017323,TESTS,62,OK
+nimishagarg_ng,18,34195561,GNU C++14,1945600,PRACTICE,14,0.0,C,Stripe,"[data structures, implementation]",2147483647,1516016883,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,18,34195162,GNU C++14,1945600,PRACTICE,14,0.0,C,Stripe,"[data structures, implementation]",2147483647,1516015659,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,149,34194857,GNU C++14,2662400,PRACTICE,47,1500.0,C,Division into Teams,"[greedy, math, sortings]",2147483647,1516014625,TESTS,92,OK
+nimishagarg_ng,149,34194827,GNU C++14,1843200,PRACTICE,0,1500.0,C,Division into Teams,"[greedy, math, sortings]",2147483647,1516014513,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,264,34193307,GNU C++14,7475200,PRACTICE,57,500.0,A,Escape from Stones,"[constructive algorithms, data structures, implementation, two pointers]",2147483647,1516009235,TESTS,171,OK
+nimishagarg_ng,414,34185805,GNU C++14,1945600,PRACTICE,84,500.0,A,Mashmokh and Numbers,"[constructive algorithms, number theory]",2147483647,1515970757,TESTS,31,OK
+nimishagarg_ng,427,34185521,GNU C++14,15257600,PRACTICE,137,1500.0,C,Checkposts,"[dfs and similar, graphs, two pointers]",2147483647,1515968636,TESTS,249,OK
+lazycoder1412,913,34036369,GNU C++14,4300800,VIRTUAL,0,1250.0,D,Too Easy Problems,"[binary search, brute force, data structures, greedy, sortings]",8466,1515447966,TESTS,15,WRONG_ANSWER
+lazycoder1412,913,34035906,GNU C++14,2048000,VIRTUAL,86,1000.0,C,Party Lemonade,"[bitmasks, dp, greedy]",5802,1515445302,TESTS,15,OK
+lazycoder1412,913,34035810,GNU C++14,2048000,VIRTUAL,3,1000.0,C,Party Lemonade,"[bitmasks, dp, greedy]",5401,1515444901,TESTS,15,WRONG_ANSWER
+lazycoder1412,913,34035748,GNU C++14,2048000,VIRTUAL,3,1000.0,C,Party Lemonade,"[bitmasks, dp, greedy]",5165,1515444665,TESTS,15,WRONG_ANSWER
+lazycoder1412,913,34034471,GNU C++14,2048000,VIRTUAL,31,750.0,B,Christmas Spruce,"[implementation, trees]",964,1515440464,TESTS,15,OK
+lazycoder1412,913,34034265,Python 2,4608000,VIRTUAL,49,500.0,A,Modular Exponentiation,"[implementation, math]",463,1515439963,TESTS,62,OK
+nimishagarg_ng,912,33941552,GNU C++14,1945600,CONTESTANT,58,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",5048,1515167948,TESTS,15,OK
+nimishagarg_ng,912,33940636,GNU C++14,1843200,CONTESTANT,8,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",4565,1515167465,PRETESTS,15,SKIPPED
+nimishagarg_ng,912,33928500,GNU C++14,1945600,CONTESTANT,8,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",758,1515163658,CHALLENGES,15,CHALLENGED
+nimishagarg_ng,912,33924664,GNU C++14,1945600,CONTESTANT,38,500.0,A,Tricky Alchemy,[implementation],284,1515163184,TESTS,15,OK
+nimishagarg_ng,908,33808538,GNU C++14,1945600,VIRTUAL,15,1000.0,C,New Year and Curling,"[brute force, geometry, implementation, math]",5505,1514635665,TESTS,15,OK
+nimishagarg_ng,908,33807664,GNU C++14,2048000,VIRTUAL,46,750.0,B,New Year and Buggy Bot,"[brute force, implementation]",2777,1514632937,TESTS,15,OK
+nimishagarg_ng,908,33807613,GNU C++14,0,VIRTUAL,0,750.0,B,New Year and Buggy Bot,"[brute force, implementation]",2639,1514632799,TESTS,0,COMPILATION_ERROR
+nimishagarg_ng,908,33806866,GNU C++14,1945600,VIRTUAL,38,500.0,A,New Year and Counting Cards,[implementation],295,1514630455,TESTS,15,OK
+nimishagarg_ng,911,33733284,GNU C++14,1945600,CONTESTANT,67,0.0,C,Three Garlands,"[brute force, constructive algorithms]",4902,1514474802,TESTS,15,OK
+nimishagarg_ng,911,33724084,GNU C++14,1843200,CONTESTANT,5,0.0,C,Three Garlands,"[brute force, constructive algorithms]",2016,1514471916,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,911,33719032,GNU C++14,1945600,CONTESTANT,135,0.0,B,Two Cakes,"[binary search, brute force, implementation]",1003,1514470903,TESTS,15,OK
+nimishagarg_ng,911,33715803,GNU C++14,8499200,CONTESTANT,140,0.0,A,Nearest Minimums,[implementation],463,1514470363,TESTS,124,OK
+nimishagarg_ng,909,33691685,GNU C++14,1843200,CONTESTANT,2,1500.0,C,Python Indentation,[dp],6500,1514399000,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,909,33684090,GNU C++14,1945600,CONTESTANT,102,1000.0,B,Segments,"[constructive algorithms, math]",3066,1514395566,TESTS,15,OK
+nimishagarg_ng,909,33674615,GNU C++14,1945600,CONTESTANT,64,500.0,A,Generate Login,"[brute force, greedy, sortings]",269,1514392769,TESTS,15,OK
+nimishagarg_ng,907,33570092,GNU C++14,1945600,CONTESTANT,20,1000.0,B,Tic-Tac-Toe,[implementation],7041,1514044941,TESTS,15,OK
+nimishagarg_ng,907,33568297,GNU C++14,1945600,CONTESTANT,3,1000.0,B,Tic-Tac-Toe,[implementation],6620,1514044520,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,907,33561630,GNU C++14,1945600,CONTESTANT,32,500.0,A,Masha and Bears,"[brute force, implementation]",4644,1514042544,TESTS,15,OK
+nimishagarg_ng,907,33549812,GNU C++14,1945600,CONTESTANT,6,500.0,A,Masha and Bears,"[brute force, implementation]",1839,1514039739,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,907,33546677,GNU C++14,1945600,CONTESTANT,3,500.0,A,Masha and Bears,"[brute force, implementation]",1331,1514039231,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,902,33425984,GNU C++14,2252800,CONTESTANT,45,1500.0,C,Hashing Trees,[],3146,1513700846,TESTS,93,OK
+nimishagarg_ng,902,33421431,GNU C++14,2560000,CONTESTANT,50,1000.0,B,Coloring a Tree,"[dfs and similar, dsu]",1850,1513699550,TESTS,15,OK
+nimishagarg_ng,902,33414364,GNU C++14,1945600,CONTESTANT,55,500.0,A,Visiting a Friend,[implementation],544,1513698244,TESTS,30,OK
+nimishagarg_ng,385,33391755,GNU C++14,206233600,PRACTICE,27,1500.0,C,Bear and Prime Numbers,"[binary search, brute force, data structures, dp, implementation, math, number theory]",2147483647,1513628606,TESTS,919,OK
+nimishagarg_ng,371,33390497,GNU C++14,1945600,PRACTICE,31,1500.0,C,Hamburgers,"[binary search, brute force]",2147483647,1513624650,TESTS,15,OK
+nimishagarg_ng,217,33385868,GNU C++14,1945600,PRACTICE,76,500.0,A,Ice Skating,"[brute force, dfs and similar, dsu, graphs]",2147483647,1513614871,TESTS,30,OK
+nimishagarg_ng,350,33384612,GNU C++14,2662400,PRACTICE,35,1000.0,C,Bombs,"[greedy, implementation, sortings]",2147483647,1513612173,TESTS,934,OK
+nimishagarg_ng,898,33307952,GNU C++14,6144000,CONTESTANT,51,2000.0,E,Squares and not squares,[greedy],6383,1513430483,TESTS,93,OK
+nimishagarg_ng,898,33306330,GNU C++14,3481600,CONTESTANT,8,2000.0,E,Squares and not squares,[greedy],5745,1513429845,PRETESTS,62,WRONG_ANSWER
+nimishagarg_ng,898,33303505,GNU C++14,5836800,CONTESTANT,7,1750.0,D,Alarm Clock,[greedy],4589,1513428689,PRETESTS,46,WRONG_ANSWER
+nimishagarg_ng,898,33302259,GNU C++14,5939200,CONTESTANT,7,1750.0,D,Alarm Clock,[greedy],4107,1513428207,PRETESTS,62,WRONG_ANSWER
+nimishagarg_ng,898,33298717,GNU C++14,2150400,CONTESTANT,59,1500.0,C,Phone Numbers,"[implementation, strings]",2760,1513426860,TESTS,15,OK
+nimishagarg_ng,898,33298473,GNU C++14,1843200,CONTESTANT,0,1500.0,C,Phone Numbers,"[implementation, strings]",2674,1513426774,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,898,33291512,GNU C++14,1945600,CONTESTANT,100,750.0,B,Proper Nutrition,"[brute force, implementation, number theory]",591,1513424691,TESTS,31,OK
+nimishagarg_ng,898,33288902,GNU C++14,1945600,CONTESTANT,64,500.0,A,Rounding,[implementation],228,1513424328,TESTS,15,OK
+nimishagarg_ng,350,33244837,GNU C++14,2662400,PRACTICE,4,1000.0,C,Bombs,"[greedy, implementation, sortings]",2147483647,1513266729,TESTS,966,WRONG_ANSWER
+nimishagarg_ng,350,33244748,GNU C++14,2662400,PRACTICE,4,1000.0,C,Bombs,"[greedy, implementation, sortings]",2147483647,1513266538,TESTS,904,WRONG_ANSWER
+nimishagarg_ng,339,33243653,GNU C++14,1945600,PRACTICE,40,1500.0,C,Xenia and Weights,"[constructive algorithms, dfs and similar, dp, greedy]",2147483647,1513264164,TESTS,15,OK
+nimishagarg_ng,339,33241845,GNU C++14,268390400,PRACTICE,3,1500.0,C,Xenia and Weights,"[constructive algorithms, dfs and similar, dp, greedy]",2147483647,1513260181,TESTS,264,MEMORY_LIMIT_EXCEEDED
+nimishagarg_ng,388,33212714,GNU C++14,1945600,PRACTICE,36,500.0,A,Fox and Box Accumulation,"[greedy, sortings]",2147483647,1513167666,TESTS,15,OK
+nimishagarg_ng,388,33212000,GNU C++14,1945600,PRACTICE,20,500.0,A,Fox and Box Accumulation,"[greedy, sortings]",2147483647,1513166233,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,903,33188040,GNU C++14,18124800,CONTESTANT,28,0.0,D,Almost Difference,[math],6906,1513098006,CHALLENGES,296,CHALLENGED
+nimishagarg_ng,903,33187067,GNU C++14,8499200,CONTESTANT,9,0.0,D,Almost Difference,[math],6611,1513097711,TESTS,2000,TIME_LIMIT_EXCEEDED
+nimishagarg_ng,903,33185924,GNU C++14,8396800,CONTESTANT,9,0.0,D,Almost Difference,[math],6233,1513097333,TESTS,2000,TIME_LIMIT_EXCEEDED
+nimishagarg_ng,903,33185183,GNU C++14,8499200,CONTESTANT,9,0.0,D,Almost Difference,[math],6001,1513097101,TESTS,2000,TIME_LIMIT_EXCEEDED
+nimishagarg_ng,903,33170939,GNU C++14,1945600,CONTESTANT,24,0.0,C,Boxes Packing,[greedy],2112,1513093212,TESTS,31,OK
+nimishagarg_ng,903,33165723,GNU C++14,2048000,CONTESTANT,17,0.0,B,The Modcrab,[greedy],1191,1513092291,TESTS,15,OK
+nimishagarg_ng,903,33160976,GNU C++14,1945600,CONTESTANT,8,0.0,A,Hungry Student Problem,[greedy],435,1513091535,TESTS,15,OK
+nimishagarg_ng,900,33133252,GNU C++14,2048000,CONTESTANT,33,1000.0,B,Position in Fraction,[math],6449,1513014749,TESTS,15,OK
+nimishagarg_ng,900,33130162,GNU C++14,6553600,CONTESTANT,51,1500.0,C,Remove Extra One,"[brute force, data structures]",5267,1513013567,TESTS,62,OK
+nimishagarg_ng,900,33123149,GNU C++14,1843200,CONTESTANT,2,1500.0,C,Remove Extra One,"[brute force, data structures]",2867,1513011167,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,900,33120811,GNU C++14,1843200,CONTESTANT,2,1500.0,C,Remove Extra One,"[brute force, data structures]",2244,1513010544,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,900,33112076,GNU C++14,1945600,CONTESTANT,71,500.0,A,Find Extra One,[implementation],254,1513008554,TESTS,77,OK
+nimishagarg_ng,463,33104109,GNU C++14,33996800,PRACTICE,23,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1513002427,TESTS,1279,OK
+nimishagarg_ng,463,33103984,GNU C++14,17920000,PRACTICE,8,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1513002008,TESTS,780,WRONG_ANSWER
+nimishagarg_ng,463,33103937,GNU C++14,17920000,PRACTICE,7,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1513001842,TESTS,779,WRONG_ANSWER
+nimishagarg_ng,463,33103780,GNU C++14,1945600,PRACTICE,3,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1513001335,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,463,33103643,GNU C++14,1843200,PRACTICE,0,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1513000829,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,801,33068127,GNU C++14,1843200,PRACTICE,7,1500.0,C,Voltage Keepsake,"[binary search, math]",2147483647,1512849462,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,801,33068087,GNU C++14,1843200,PRACTICE,4,1500.0,C,Voltage Keepsake,"[binary search, math]",2147483647,1512849338,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,801,33068020,GNU C++14,1843200,PRACTICE,3,1500.0,C,Voltage Keepsake,"[binary search, math]",2147483647,1512849129,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,801,33057557,GNU C++14,1945600,VIRTUAL,35,1000.0,B,Valued Keys,"[constructive algorithms, greedy, strings]",2216,1512841076,TESTS,15,OK
+nimishagarg_ng,801,33057284,GNU C++14,1945600,VIRTUAL,1,1000.0,B,Valued Keys,"[constructive algorithms, greedy, strings]",1465,1512840325,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,801,33056946,GNU C++14,1843200,VIRTUAL,63,500.0,A,Vicious Keyboard,[brute force],571,1512839431,TESTS,30,OK
+nimishagarg_ng,895,32692158,GNU C++14,1843200,CONTESTANT,0,1000.0,B,XK Segments,"[binary search, sortings, two pointers]",7178,1511719478,PRETESTS,0,WRONG_ANSWER
+nimishagarg_ng,895,32689413,GNU C++14,1945600,CONTESTANT,93,500.0,A,Pizza Separation,[brute force],5842,1511718142,TESTS,15,OK
+nimishagarg_ng,895,32686227,GNU C++14,1843200,CONTESTANT,7,500.0,A,Pizza Separation,[brute force],4103,1511716403,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,895,32685458,GNU C++14,1843200,CONTESTANT,7,500.0,A,Pizza Separation,[brute force],3707,1511716007,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,895,32683571,GNU C++14,1945600,CONTESTANT,7,500.0,A,Pizza Separation,[brute force],3353,1511715653,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,895,32680959,GNU C++14,1945600,CONTESTANT,7,500.0,A,Pizza Separation,[brute force],2126,1511714426,PRETESTS,15,WRONG_ANSWER
+nimishagarg_ng,895,32679028,GNU C++14,1843200,CONTESTANT,0,500.0,A,Pizza Separation,[brute force],1435,1511713735,PRETESTS,0,RUNTIME_ERROR
+nimishagarg_ng,894,32568943,GNU C++14,8089600,VIRTUAL,56,1500.0,C,Marco and GCD Sequence,"[constructive algorithms, math]",7109,1511423429,TESTS,15,OK
+nimishagarg_ng,894,32568796,GNU C++14,7987200,VIRTUAL,14,1500.0,C,Marco and GCD Sequence,"[constructive algorithms, math]",6647,1511422967,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,894,32567340,GNU C++14,0,VIRTUAL,43,500.0,A,QAQ,"[brute force, dp]",908,1511417228,TESTS,15,OK
+nimishagarg_ng,888,32183018,GNU C++14,0,PRACTICE,25,0.0,D,Almost Identity Permutations,"[combinatorics, dp, math]",2147483647,1510269593,TESTS,15,OK
+nimishagarg_ng,888,32182222,GNU C++14,307200,VIRTUAL,51,0.0,C,K-Dominant Character,"[binary search, implementation, two pointers]",6066,1510264686,TESTS,30,OK
+nimishagarg_ng,888,32181672,GNU C++14,307200,VIRTUAL,18,0.0,C,K-Dominant Character,"[binary search, implementation, two pointers]",3232,1510261852,TESTS,31,WRONG_ANSWER
+nimishagarg_ng,888,32181036,GNU C++14,0,VIRTUAL,25,0.0,B,Buggy Robot,"[dp, greedy]",652,1510259272,TESTS,15,OK
+nimishagarg_ng,888,32180908,GNU C++14,0,VIRTUAL,14,0.0,A,Local Extrema,"[brute force, implementation]",225,1510258845,TESTS,15,OK
+nimishagarg_ng,887,32025298,GNU C++14,0,CONTESTANT,48,1500.0,C,Solution for Cube,"[brute force, implementation]",3646,1509728746,TESTS,15,OK
+nimishagarg_ng,887,32021587,GNU C++14,204800,CONTESTANT,96,1000.0,B,Cubes for Masha,[brute force],2158,1509727258,TESTS,15,OK
+nimishagarg_ng,887,32015171,GNU C++14,0,CONTESTANT,98,500.0,A,Div. 64,[implementation],451,1509725551,TESTS,15,OK
+toxic_hack,757,31986284,GNU C++14,819200,VIRTUAL,134,1000.0,B,Bash's Big Day,"[greedy, math, number theory]",1071,1509640371,TESTS,46,OK
+toxic_hack,757,31986101,GNU C++14,819200,VIRTUAL,11,1000.0,B,Bash's Big Day,"[greedy, math, number theory]",696,1509639996,TESTS,31,WRONG_ANSWER
+toxic_hack,757,31986038,GNU C++14,307200,VIRTUAL,107,500.0,A,Gotta Catch Em' All!,[implementation],551,1509639851,TESTS,15,OK
+toxic_hack,673,31961009,GNU C++14,0,VIRTUAL,48,1500.0,D,Bear and Two Paths,[],8526,1509563646,TESTS,15,OK
+toxic_hack,673,31959460,GNU C++14,102400,VIRTUAL,35,1000.0,C,Bear and Colors,[],4257,1509559378,TESTS,156,OK
+toxic_hack,673,31959148,GNU C++14,1843200,VIRTUAL,51,750.0,B,Problems for Round,"[greedy, implementation]",3429,1509558549,TESTS,77,OK
+toxic_hack,673,31959145,Python 2,204800,VIRTUAL,5,1000.0,C,Bear and Colors,[],3423,1509558543,TESTS,2000,TIME_LIMIT_EXCEEDED
+toxic_hack,673,31958818,GNU C++14,1843200,VIRTUAL,45,750.0,B,Problems for Round,"[greedy, implementation]",2589,1509557709,TESTS,77,WRONG_ANSWER
+toxic_hack,673,31958620,Python 2,0,VIRTUAL,2,1000.0,C,Bear and Colors,[],2121,1509557241,TESTS,46,WRONG_ANSWER
+toxic_hack,673,31958403,GNU C++14,1843200,VIRTUAL,45,750.0,B,Problems for Round,"[greedy, implementation]",1580,1509556700,TESTS,78,WRONG_ANSWER
+toxic_hack,673,31958029,GNU C++11,0,VIRTUAL,34,500.0,A,Bear and Game,[implementation],671,1509555791,TESTS,15,OK
+toxic_hack,868,31902107,GNU C++14,2764800,VIRTUAL,143,1000.0,C,Qualification Rounds,"[bitmasks, brute force, constructive algorithms, dp]",9278,1509386679,TESTS,78,OK
+toxic_hack,868,31901269,Python 2,0,VIRTUAL,133,500.0,B,Race Against Time,[implementation],7263,1509384663,TESTS,62,OK
+toxic_hack,868,31900496,Python 2,0,VIRTUAL,4,500.0,B,Race Against Time,[implementation],5450,1509382850,TESTS,46,WRONG_ANSWER
+toxic_hack,868,31900329,Python 2,0,VIRTUAL,4,500.0,B,Race Against Time,[implementation],5075,1509382475,TESTS,46,WRONG_ANSWER
+toxic_hack,868,31899829,GNU C++14,0,VIRTUAL,4,500.0,B,Race Against Time,[implementation],3952,1509381352,TESTS,15,WRONG_ANSWER
+toxic_hack,868,31899813,Python 2,0,VIRTUAL,4,500.0,B,Race Against Time,[implementation],3905,1509381305,TESTS,46,WRONG_ANSWER
+toxic_hack,868,31898359,GNU C++14,0,VIRTUAL,90,250.0,A,Bark to Unlock,"[brute force, strings]",499,1509377899,TESTS,15,OK
+nimishagarg_ng,884,31808534,GNU C++14,0,CONTESTANT,16,0.0,A,Book Reading,[implementation],5176,1509118276,TESTS,15,OK
+nimishagarg_ng,884,31808091,GNU C++14,11776000,CONTESTANT,27,0.0,C,Bertown Subway,"[dfs and similar, greedy, math]",4832,1509117932,TESTS,61,OK
+nimishagarg_ng,884,31807539,GNU C++14,102400,CONTESTANT,5,0.0,C,Bertown Subway,"[dfs and similar, greedy, math]",4432,1509117532,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,884,31801379,GNU C++14,819200,CONTESTANT,66,0.0,B,Japanese Crosswords Strike Back,[implementation],975,1509114075,TESTS,46,OK
+nimishagarg_ng,579,31773743,GNU C++14,0,VIRTUAL,31,1250.0,C,A Problem about Polyline,"[binary search, math]",6675,1509054375,TESTS,15,OK
+nimishagarg_ng,579,31773685,GNU C++14,0,VIRTUAL,3,1250.0,C,A Problem about Polyline,"[binary search, math]",6430,1509054131,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,579,31772751,GNU C++14,0,VIRTUAL,3,1250.0,C,A Problem about Polyline,"[binary search, math]",3270,1509050971,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,579,31772207,GNU C++14,3891200,VIRTUAL,15,500.0,B,Finding Team Member,"[brute force, implementation, sortings]",1565,1509049265,TESTS,140,OK
+nimishagarg_ng,579,31771869,GNU C++14,0,VIRTUAL,36,250.0,A,Raising Bacteria,[bitmasks],659,1509048359,TESTS,15,OK
+nimishagarg_ng,879,31767979,GNU C++14,26009600,PRACTICE,30,1500.0,C,Short Program,"[bitmasks, constructive algorithms, graph matchings]",2147483647,1509040377,TESTS,140,OK
+nimishagarg_ng,161,31061150,GNU C++14,424345600,PRACTICE,30,2000.0,D,Distance in Tree,"[dfs and similar, dp, trees]",2147483647,1507281588,TESTS,1152,OK
+nimishagarg_ng,859,30972766,GNU C++14,0,PRACTICE,70,1000.0,C,Pie Rules,"[dp, games]",2147483647,1507047357,TESTS,15,OK
+nimishagarg_ng,486,30758594,GNU C++14,307200,PRACTICE,40,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1506446870,TESTS,15,OK
+nimishagarg_ng,441,30744794,GNU C++14,102400,PRACTICE,44,1500.0,C,Valera and Tubes ,"[constructive algorithms, dfs and similar, implementation]",2147483647,1506415585,TESTS,31,OK
+nimishagarg_ng,478,30734203,GNU C++14,0,PRACTICE,42,1500.0,C,Table Decorations,[greedy],2147483647,1506359153,TESTS,15,OK
+nimishagarg_ng,478,30734133,GNU C++14,0,PRACTICE,6,1500.0,C,Table Decorations,[greedy],2147483647,1506359051,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,845,29663716,GNU C++14,1638400,PRACTICE,58,0.0,C,Two TVs,"[data structures, greedy, sortings]",2147483647,1503335612,TESTS,140,OK
+nimishagarg_ng,114,29533920,GNU C++14,0,PRACTICE,61,1000.0,B,PFAST Inc.,"[bitmasks, brute force]",2147483647,1502999148,TESTS,62,OK
+nimishagarg_ng,114,29533588,GNU C++14,0,PRACTICE,5,1000.0,B,PFAST Inc.,"[bitmasks, brute force]",2147483647,1502997829,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,56,29444448,GNU C++14,1945600,PRACTICE,33,1000.0,B,Spoilt Permutation,[implementation],2147483647,1502663291,TESTS,60,OK
+nimishagarg_ng,279,28402282,GNU C++14,3379200,PRACTICE,35,1500.0,C,Ladder,"[dp, implementation, two pointers]",2147483647,1499674988,TESTS,186,OK
+nimishagarg_ng,137,28401329,GNU C++14,2764800,PRACTICE,75,1500.0,C,History,[sortings],2147483647,1499672379,TESTS,156,OK
+nimishagarg_ng,279,28401264,GNU C++14,3379200,PRACTICE,20,1500.0,C,Ladder,"[dp, implementation, two pointers]",2147483647,1499672178,TESTS,156,WRONG_ANSWER
+nimishagarg_ng,279,28401145,GNU C++14,1945600,PRACTICE,5,1500.0,C,Ladder,"[dp, implementation, two pointers]",2147483647,1499671834,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,363,28390178,GNU C++14,2662400,PRACTICE,62,1500.0,C,Fixing Typos,"[greedy, implementation]",2147483647,1499614725,TESTS,46,OK
+nimishagarg_ng,382,28373839,GNU C++14,2355200,PRACTICE,59,1500.0,C,Arithmetic Progression,"[implementation, sortings]",2147483647,1499533814,TESTS,46,OK
+nimishagarg_ng,382,28373742,GNU C++14,2355200,PRACTICE,56,1500.0,C,Arithmetic Progression,"[implementation, sortings]",2147483647,1499533423,TESTS,46,WRONG_ANSWER
+nimishagarg_ng,382,28373654,GNU C++14,2355200,PRACTICE,52,1500.0,C,Arithmetic Progression,"[implementation, sortings]",2147483647,1499533110,TESTS,46,WRONG_ANSWER
+nimishagarg_ng,459,28344031,GNU C++14,5939200,PRACTICE,41,2000.0,C,Pashmak and Buses,"[combinatorics, constructive algorithms, math]",2147483647,1499413047,TESTS,155,OK
+nimishagarg_ng,220,28333731,GNU C++14,2764800,PRACTICE,96,500.0,A,Little Elephant and Problem,"[implementation, sortings]",2147483647,1499363622,TESTS,46,OK
+nimishagarg_ng,220,28333407,GNU C++14,2867200,PRACTICE,35,500.0,A,Little Elephant and Problem,"[implementation, sortings]",2147483647,1499362615,TESTS,31,WRONG_ANSWER
+nimishagarg_ng,220,28332789,GNU C++14,2867200,PRACTICE,35,500.0,A,Little Elephant and Problem,"[implementation, sortings]",2147483647,1499360798,TESTS,31,WRONG_ANSWER
+nimishagarg_ng,220,28332007,GNU C++14,2867200,PRACTICE,33,500.0,A,Little Elephant and Problem,"[implementation, sortings]",2147483647,1499358873,TESTS,46,WRONG_ANSWER
+nimishagarg_ng,220,28331675,GNU C++14,1945600,PRACTICE,7,500.0,A,Little Elephant and Problem,"[implementation, sortings]",2147483647,1499357897,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,225,28327317,GNU C++14,2048000,PRACTICE,36,1500.0,C,Barcode,"[dp, matrices]",2147483647,1499345470,TESTS,60,OK
+nimishagarg_ng,225,28326129,GNU C++14,1945600,PRACTICE,3,1500.0,C,Barcode,"[dp, matrices]",2147483647,1499342658,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,225,28325847,GNU C++14,1945600,PRACTICE,2,1500.0,C,Barcode,"[dp, matrices]",2147483647,1499342004,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,254,28307994,GNU C++14,2252800,PRACTICE,36,1000.0,B,Jury Size,"[brute force, implementation]",2147483647,1499270887,TESTS,30,OK
+nimishagarg_ng,254,28307969,GNU C++14,1945600,PRACTICE,0,1000.0,B,Jury Size,"[brute force, implementation]",2147483647,1499270784,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,254,28307942,GNU C++14,0,PRACTICE,0,1000.0,B,Jury Size,"[brute force, implementation]",2147483647,1499270643,TESTS,0,COMPILATION_ERROR
+nimishagarg_ng,254,28307872,GNU C++14,1945600,PRACTICE,0,1000.0,B,Jury Size,"[brute force, implementation]",2147483647,1499270363,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,99,28282694,GNU C++14,2355200,PRACTICE,200,1000.0,B,Help Chef Gerasim,"[implementation, sortings]",2147483647,1499177892,TESTS,15,OK
+nimishagarg_ng,99,28281798,GNU C++14,1945600,PRACTICE,17,1000.0,B,Help Chef Gerasim,"[implementation, sortings]",2147483647,1499175429,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,99,28281775,GNU C++14,0,PRACTICE,0,1000.0,B,Help Chef Gerasim,"[implementation, sortings]",2147483647,1499175369,TESTS,0,COMPILATION_ERROR
+nimishagarg_ng,99,28281611,GNU C++14,1945600,PRACTICE,8,1000.0,B,Help Chef Gerasim,"[implementation, sortings]",2147483647,1499174980,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,83,28280574,GNU C++14,2355200,PRACTICE,50,500.0,A,Magical Array,[math],2147483647,1499172136,TESTS,434,OK
+nimishagarg_ng,83,28280389,GNU C++14,2355200,PRACTICE,31,500.0,A,Magical Array,[math],2147483647,1499171655,TESTS,374,WRONG_ANSWER
+nimishagarg_ng,83,28280245,GNU C++14,2355200,PRACTICE,31,500.0,A,Magical Array,[math],2147483647,1499171340,TESTS,372,WRONG_ANSWER
+nimishagarg_ng,83,28280137,GNU C++14,1945600,PRACTICE,4,500.0,A,Magical Array,[math],2147483647,1499171070,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,225,28278750,GNU C++14,1945600,PRACTICE,70,1000.0,B,Well-known Numbers,"[binary search, greedy, number theory]",2147483647,1499167563,TESTS,30,OK
+nimishagarg_ng,197,28276837,GNU C++14,1945600,PRACTICE,80,500.0,B,Limit,[math],2147483647,1499161402,TESTS,30,OK
+nimishagarg_ng,320,28260779,GNU C++14,1945600,PRACTICE,24,1000.0,B,Ping-Pong (Easy Version),"[dfs and similar, graphs]",2147483647,1499100031,TESTS,30,OK
+nimishagarg_ng,197,28258778,GNU C++14,1945600,PRACTICE,80,500.0,B,Limit,[math],2147483647,1499093780,TESTS,30,OK
+nimishagarg_ng,268,28258093,GNU C++14,1945600,PRACTICE,47,1500.0,C,Beautiful Sets of Points,"[constructive algorithms, implementation]",2147483647,1499092022,TESTS,30,OK
+nimishagarg_ng,9,28249752,GNU C++14,1945600,PRACTICE,36,0.0,C,Hexadecimal's Numbers,"[brute force, implementation, math]",2147483647,1499071720,TESTS,30,OK
+nimishagarg_ng,490,28237183,GNU C++14,15462400,PRACTICE,71,1500.0,C,Hacking Cypher,"[brute force, math, strings]",2147483647,1499028858,TESTS,78,OK
+nimishagarg_ng,490,28236719,GNU C++14,1945600,PRACTICE,6,1500.0,C,Hacking Cypher,"[brute force, math, strings]",2147483647,1499027309,TESTS,31,WRONG_ANSWER
+nimishagarg_ng,152,28235767,GNU C++14,1945600,PRACTICE,60,1500.0,C,Pocket Book,[combinatorics],2147483647,1499024679,TESTS,62,OK
+nimishagarg_ng,109,28205580,GNU C++14,1945600,PRACTICE,51,500.0,A,Lucky Sum of Digits,"[brute force, implementation]",2147483647,1498981415,TESTS,62,OK
+nimishagarg_ng,109,28195202,GNU C++14,1945600,PRACTICE,2,500.0,A,Lucky Sum of Digits,"[brute force, implementation]",2147483647,1498926841,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,550,28194525,GNU C++14,2048000,PRACTICE,73,1000.0,C,Divisibility by Eight,"[brute force, dp, math]",2147483647,1498924205,TESTS,15,OK
+nimishagarg_ng,14,28171037,GNU C++14,1945600,PRACTICE,52,0.0,B,Young Photographer,[implementation],2147483647,1498823942,TESTS,30,OK
+nimishagarg_ng,14,28168700,GNU C++14,1945600,PRACTICE,3,0.0,B,Young Photographer,[implementation],2147483647,1498814997,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,61,28168387,GNU C++14,2150400,PRACTICE,43,1000.0,B,Hard Work,[strings],2147483647,1498813909,TESTS,46,OK
+nimishagarg_ng,186,28075837,GNU C++14,1945600,PRACTICE,36,1000.0,B,Growing Mushrooms,"[greedy, sortings]",2147483647,1498564836,TESTS,62,OK
+nimishagarg_ng,152,28073768,GNU C++14,1945600,PRACTICE,34,1000.0,B,Steps,"[binary search, implementation]",2147483647,1498556832,TESTS,92,OK
+nimishagarg_ng,400,28070961,GNU C++14,4198400,PRACTICE,34,1000.0,B,Inna and New Matrix of Candies,"[brute force, implementation, schedules]",2147483647,1498548973,TESTS,171,OK
+nimishagarg_ng,215,28055204,GNU C++14,1945600,PRACTICE,31,500.0,B,Olympic Medal,"[greedy, math]",2147483647,1498472600,TESTS,60,OK
+nimishagarg_ng,469,28023523,GNU C++14,1945600,PRACTICE,31,1000.0,B,Chat Online,[implementation],2147483647,1498400471,TESTS,15,OK
+nimishagarg_ng,621,28020974,GNU C++14,1945600,PRACTICE,68,1000.0,B,Wet Shark and Bishops,[combinatorics],2147483647,1498389297,TESTS,93,OK
+nimishagarg_ng,621,28020918,GNU C++14,1945600,PRACTICE,68,1000.0,B,Wet Shark and Bishops,[combinatorics],2147483647,1498389103,TESTS,93,OK
+nimishagarg_ng,581,28018545,GNU C++14,2764800,PRACTICE,53,1000.0,B,Luxurious Houses,[implementation],2147483647,1498380174,TESTS,46,OK
+nimishagarg_ng,78,27989090,GNU C++14,1945600,PRACTICE,34,1000.0,B,Easter Eggs,"[constructive algorithms, implementation]",2147483647,1498235789,TESTS,30,OK
+nimishagarg_ng,227,27982309,GNU C++14,2355200,PRACTICE,34,1000.0,B,Effective Approach,[implementation],2147483647,1498212898,TESTS,124,OK
+nimishagarg_ng,47,27966259,GNU C++14,1945600,PRACTICE,50,1000.0,B,Coins,[implementation],2147483647,1498137827,TESTS,30,OK
+nimishagarg_ng,102,27963135,GNU C++14,2252800,PRACTICE,51,1000.0,B,Sum of Digits,[implementation],2147483647,1498129180,TESTS,30,OK
+nimishagarg_ng,102,27963121,GNU C++14,2150400,PRACTICE,9,1000.0,B,Sum of Digits,[implementation],2147483647,1498129112,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,463,27961075,GNU C++14,2355200,PRACTICE,49,1000.0,B,Caisa and Pylons,[math],2147483647,1498122125,TESTS,31,OK
+nimishagarg_ng,16,27960264,GNU C++14,1945600,PRACTICE,49,0.0,B,Burglar and Matches,"[greedy, implementation, sortings]",2147483647,1498119595,TESTS,30,OK
+nimishagarg_ng,680,27959536,GNU C++14,1945600,PRACTICE,24,1000.0,B,Bear and Finding Criminals,"[constructive algorithms, implementation]",2147483647,1498117097,TESTS,15,OK
+nimishagarg_ng,476,27956522,GNU C++14,1945600,PRACTICE,31,1500.0,B,Dreamoon and WiFi,"[bitmasks, brute force, combinatorics, dp, math, probabilities]",2147483647,1498103607,TESTS,31,OK
+nimishagarg_ng,50,27955792,GNU C++14,1945600,PRACTICE,35,500.0,A,Domino piling,"[greedy, math]",2147483647,1498099755,TESTS,62,OK
+nimishagarg_ng,50,27955772,GNU C++14,1945600,PRACTICE,2,500.0,A,Domino piling,"[greedy, math]",2147483647,1498099600,TESTS,62,WRONG_ANSWER
+nimishagarg_ng,38,27949260,GNU C++14,1945600,PRACTICE,50,0.0,A,Army,[implementation],2147483647,1498060579,TESTS,30,OK
+nimishagarg_ng,284,27949039,GNU C++14,2457600,PRACTICE,66,1000.0,B,Cows and Poker Game,"[brute force, implementation]",2147483647,1498059654,TESTS,92,OK
+nimishagarg_ng,90,27948864,GNU C++14,2048000,PRACTICE,43,1000.0,B,African Crossword,"[implementation, strings]",2147483647,1498058935,TESTS,30,OK
+nimishagarg_ng,312,27904572,GNU C++14,0,PRACTICE,31,1000.0,B,Archer,"[math, probabilities]",2147483647,1497875435,TESTS,15,OK
+nimishagarg_ng,408,27879734,GNU C++14,0,PRACTICE,21,1000.0,B,Garland,[implementation],2147483647,1497773409,TESTS,15,OK
+nimishagarg_ng,357,27879483,GNU C++14,409600,PRACTICE,63,1000.0,B,Flag Day,"[constructive algorithms, implementation]",2147483647,1497772514,TESTS,46,OK
+nimishagarg_ng,416,27875840,GNU C++14,1228800,PRACTICE,26,1000.0,B,Art Union,"[brute force, dp, implementation]",2147483647,1497757664,TESTS,187,OK
+nimishagarg_ng,251,27863781,GNU C++14,819200,PRACTICE,39,500.0,A,Points on Line,"[binary search, combinatorics, two pointers]",2147483647,1497716622,TESTS,404,OK
+nimishagarg_ng,110,27860095,GNU C++14,307200,PRACTICE,32,1000.0,B,Lucky String,"[constructive algorithms, strings]",2147483647,1497714731,TESTS,30,OK
+nimishagarg_ng,66,27857687,GNU C++14,0,PRACTICE,80,1000.0,B,Petya and Countryside,"[brute force, implementation]",2147483647,1497713639,TESTS,30,OK
+nimishagarg_ng,366,27841731,GNU C++14,409600,PRACTICE,36,1000.0,B,Dima and To-do List,"[brute force, implementation]",2147483647,1497689191,TESTS,46,OK
+nimishagarg_ng,366,27841697,GNU C++14,409600,PRACTICE,36,1000.0,B,Dima and To-do List,"[brute force, implementation]",2147483647,1497689054,TESTS,124,OK
+nimishagarg_ng,58,27841385,GNU C++14,0,PRACTICE,50,1000.0,B,Coins,[greedy],2147483647,1497688059,TESTS,30,OK
+nimishagarg_ng,289,27838291,GNU C++14,0,PRACTICE,31,1000.0,B,Polo the Penguin and Matrix,"[brute force, dp, implementation, sortings, ternary search]",2147483647,1497677404,TESTS,62,OK
+nimishagarg_ng,155,27817339,GNU C++14,0,PRACTICE,39,1000.0,B,Combination,"[greedy, sortings]",2147483647,1497589849,TESTS,30,OK
+nimishagarg_ng,155,27817279,GNU C++14,0,PRACTICE,30,1000.0,B,Combination,"[greedy, sortings]",2147483647,1497589604,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,155,27817229,GNU C++14,0,PRACTICE,6,1000.0,B,Combination,"[greedy, sortings]",2147483647,1497589415,TESTS,30,RUNTIME_ERROR
+nimishagarg_ng,133,27792610,GNU C++14,0,PRACTICE,67,1000.0,B,Unary,[implementation],2147483647,1497527321,TESTS,30,OK
+nimishagarg_ng,122,27791912,GNU C++14,0,PRACTICE,42,1000.0,B,Lucky Substring,"[brute force, implementation]",2147483647,1497524802,TESTS,30,OK
+nimishagarg_ng,352,27791593,GNU C++14,4505600,PRACTICE,36,1000.0,B,Jeff and Periods,"[implementation, sortings]",2147483647,1497523488,TESTS,654,OK
+nimishagarg_ng,282,27760707,GNU C++14,2969600,PRACTICE,54,1000.0,B,Painting Eggs,"[greedy, math]",2147483647,1497377062,TESTS,4086,OK
+nimishagarg_ng,4,27760216,GNU C++14,0,PRACTICE,15,0.0,B,Before an Exam,"[constructive algorithms, greedy]",2147483647,1497375120,TESTS,15,OK
+nimishagarg_ng,4,27760102,GNU C++14,0,PRACTICE,6,0.0,B,Before an Exam,"[constructive algorithms, greedy]",2147483647,1497374642,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,377,27743175,GNU C++14,10752000,PRACTICE,89,500.0,A,Maze,[dfs and similar],2147483647,1497291753,TESTS,140,OK
+nimishagarg_ng,489,27738067,GNU C++14,0,PRACTICE,81,1000.0,B,BerSU Ball,"[dfs and similar, dp, graph matchings, greedy, sortings, two pointers]",2147483647,1497271743,TESTS,30,OK
+nimishagarg_ng,489,27737958,GNU C++14,0,PRACTICE,21,1000.0,B,BerSU Ball,"[dfs and similar, dp, graph matchings, greedy, sortings, two pointers]",2147483647,1497271320,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,522,27736457,GNU C++14,204800,PRACTICE,36,500.0,A,Reposts,"[dfs and similar, dp, graphs, trees]",2147483647,1497265439,TESTS,15,OK
+nimishagarg_ng,500,27735942,GNU C++14,102400,PRACTICE,34,500.0,A,New Year Transportation,"[dfs and similar, graphs, implementation]",2147483647,1497263555,TESTS,46,OK
+nimishagarg_ng,437,27735224,GNU C++14,0,PRACTICE,29,1500.0,C,The Child and Toy,"[graphs, greedy, sortings]",2147483647,1497260645,TESTS,15,OK
+nimishagarg_ng,432,27722504,GNU C++14,0,PRACTICE,35,500.0,A,Choosing Teams,"[greedy, implementation, sortings]",2147483647,1497191443,TESTS,15,OK
+nimishagarg_ng,797,27716463,GNU C++14,0,PRACTICE,126,0.0,B,Odd sum,"[dp, greedy]",2147483647,1497164968,TESTS,124,OK
+nimishagarg_ng,797,27703256,GNU C++14,0,PRACTICE,26,0.0,B,Odd sum,"[dp, greedy]",2147483647,1497086357,TESTS,140,WRONG_ANSWER
+nimishagarg_ng,797,27703248,GNU C,0,PRACTICE,0,0.0,B,Odd sum,"[dp, greedy]",2147483647,1497086327,TESTS,0,COMPILATION_ERROR
+nimishagarg_ng,115,27688995,GNU C,204800,PRACTICE,106,500.0,A,Party,"[dfs and similar, graphs, trees]",2147483647,1497011561,TESTS,60,OK
+nimishagarg_ng,115,27688730,GNU C,0,PRACTICE,0,500.0,A,Party,"[dfs and similar, graphs, trees]",2147483647,1497010570,TESTS,30,RUNTIME_ERROR
+nimishagarg_ng,115,27688664,GNU C,0,PRACTICE,0,500.0,A,Party,"[dfs and similar, graphs, trees]",2147483647,1497010323,TESTS,30,RUNTIME_ERROR
+nimishagarg_ng,580,27683909,GNU C,8704000,PRACTICE,40,1500.0,C,Kefa and Park,"[dfs and similar, trees]",2147483647,1496991631,TESTS,77,OK
+nimishagarg_ng,580,27675515,GNU C,614400,PRACTICE,11,1500.0,C,Kefa and Park,"[dfs and similar, trees]",2147483647,1496939615,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,160,27671533,GNU C++11,0,PRACTICE,29,500.0,A,Twins,"[greedy, sortings]",2147483647,1496926065,TESTS,30,OK
+nimishagarg_ng,265,27670367,GNU C++11,409600,PRACTICE,15,1000.0,B,Roadside Trees (Simplified Edition),"[greedy, implementation]",2147483647,1496922443,TESTS,342,OK
+nimishagarg_ng,431,27631777,GNU C++11,0,PRACTICE,54,1500.0,C,k-Tree,"[dp, implementation, trees]",2147483647,1496836043,TESTS,15,OK
+nimishagarg_ng,431,27631698,GNU C++11,0,PRACTICE,6,1500.0,C,k-Tree,"[dp, implementation, trees]",2147483647,1496835750,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,35,27629877,GNU C++11,204800,PRACTICE,20,500.0,A,Shell Game,[implementation],2147483647,1496829487,TESTS,30,OK
+nimishagarg_ng,35,27629214,GNU C++11,0,PRACTICE,0,500.0,A,Shell Game,[implementation],2147483647,1496826949,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,49,27629032,GNU C++11,0,PRACTICE,35,500.0,A,Sleuth,[implementation],2147483647,1496826159,TESTS,30,OK
+nimishagarg_ng,189,27583180,GNU C++11,0,PRACTICE,58,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1496667392,TESTS,15,OK
+nimishagarg_ng,189,27583149,GNU C++11,0,PRACTICE,7,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1496667283,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,479,27540399,GNU C++11,102400,PRACTICE,53,1500.0,C,Exams,"[greedy, sortings]",2147483647,1496482738,TESTS,46,OK
+nimishagarg_ng,479,27540263,GNU C++11,102400,PRACTICE,11,1500.0,C,Exams,"[greedy, sortings]",2147483647,1496482282,TESTS,31,WRONG_ANSWER
+nimishagarg_ng,466,27528747,GNU C++11,3993600,PRACTICE,30,1500.0,C,Number of Ways,"[binary search, brute force, data structures, dp, two pointers]",2147483647,1496423422,TESTS,1169,OK
+nimishagarg_ng,466,27528719,GNU C++11,819200,PRACTICE,5,1500.0,C,Number of Ways,"[binary search, brute force, data structures, dp, two pointers]",2147483647,1496423274,TESTS,109,WRONG_ANSWER
+nimishagarg_ng,455,27527413,GNU C++11,1228800,PRACTICE,47,500.0,A,Boredom,[dp],2147483647,1496418871,TESTS,187,OK
+nimishagarg_ng,455,27527331,GNU C++11,1228800,PRACTICE,41,500.0,A,Boredom,[dp],2147483647,1496418617,TESTS,187,WRONG_ANSWER
+nimishagarg_ng,455,27354499,GNU C++11,409600,PRACTICE,10,500.0,A,Boredom,[dp],2147483647,1495797597,TESTS,156,WRONG_ANSWER
+nimishagarg_ng,489,27344017,GNU C++11,0,PRACTICE,65,1500.0,C,Given Length and Sum of Digits...,"[dp, greedy, implementation]",2147483647,1495740816,TESTS,15,OK
+nimishagarg_ng,489,27342794,GNU C++11,0,PRACTICE,2,1500.0,C,Given Length and Sum of Digits...,"[dp, greedy, implementation]",2147483647,1495736174,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,489,27342781,GNU C++11,0,PRACTICE,1,1500.0,C,Given Length and Sum of Digits...,"[dp, greedy, implementation]",2147483647,1495736118,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,192,27342098,GNU C++11,0,PRACTICE,85,1000.0,B,Walking in the Rain,"[brute force, implementation]",2147483647,1495733652,TESTS,30,OK
+nimishagarg_ng,219,27340834,GNU C++11,0,PRACTICE,102,1000.0,B,Special Offer! Super Price 999 Bourles!,[implementation],2147483647,1495729319,TESTS,62,OK
+nimishagarg_ng,219,27339552,GNU C++11,0,PRACTICE,92,1000.0,B,Special Offer! Super Price 999 Bourles!,[implementation],2147483647,1495725324,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,219,27339532,GNU C++11,0,PRACTICE,0,1000.0,B,Special Offer! Super Price 999 Bourles!,[implementation],2147483647,1495725265,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,233,27332286,GNU C++11,0,PRACTICE,48,1000.0,B,Non-square Equation,"[binary search, brute force, math]",2147483647,1495701876,TESTS,30,OK
+nimishagarg_ng,233,27332248,GNU C++11,0,PRACTICE,3,1000.0,B,Non-square Equation,"[binary search, brute force, math]",2147483647,1495701691,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,437,27317629,GNU C++11,102400,PRACTICE,33,1500.0,B,The Child and Set,"[bitmasks, greedy, implementation, sortings]",2147483647,1495618852,TESTS,30,OK
+nimishagarg_ng,437,27316700,GNU C++11,102400,PRACTICE,17,1500.0,B,The Child and Set,"[bitmasks, greedy, implementation, sortings]",2147483647,1495614558,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,129,27304197,GNU C++11,102400,PRACTICE,70,1000.0,B,Students and Shoelaces,"[brute force, dfs and similar, graphs]",2147483647,1495552969,TESTS,62,OK
+nimishagarg_ng,401,27232863,GNU C++11,0,PRACTICE,81,1500.0,C,Team,"[constructive algorithms, greedy, implementation]",2147483647,1495273480,TESTS,592,OK
+nimishagarg_ng,401,27232694,GNU C++11,0,PRACTICE,12,1500.0,C,Team,"[constructive algorithms, greedy, implementation]",2147483647,1495272980,TESTS,592,WRONG_ANSWER
+nimishagarg_ng,401,27232015,GNU C++11,0,PRACTICE,6,1500.0,C,Team,"[constructive algorithms, greedy, implementation]",2147483647,1495270865,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,401,27231847,GNU C++11,0,PRACTICE,4,1500.0,C,Team,"[constructive algorithms, greedy, implementation]",2147483647,1495270283,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,359,27230836,GNU C++11,0,PRACTICE,30,1000.0,B,Permutation,"[constructive algorithms, dp, math]",2147483647,1495267273,TESTS,62,OK
+nimishagarg_ng,151,27230219,GNU C++11,102400,PRACTICE,38,1000.0,B,Phone Numbers,"[implementation, strings]",2147483647,1495265280,TESTS,15,OK
+nimishagarg_ng,234,27220084,GNU C++11,204800,PRACTICE,8,0.0,B,Reading,[sortings],2147483647,1495217449,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,234,27219891,GNU C++11,0,PRACTICE,0,0.0,B,Reading,[sortings],2147483647,1495216772,TESTS,0,RUNTIME_ERROR
+nimishagarg_ng,234,27219843,GNU C++14,0,PRACTICE,0,0.0,B,Reading,[sortings],2147483647,1495216620,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,234,27219800,GNU C++14,0,PRACTICE,0,0.0,B,Reading,[sortings],2147483647,1495216497,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,182,27219371,GNU C++14,0,PRACTICE,40,500.0,B,Vasya's Calendar,[implementation],2147483647,1495214728,TESTS,30,OK
+nimishagarg_ng,143,27217381,GNU C++14,0,PRACTICE,100,1000.0,B,Help Kingdom of Far Far Away 2,"[implementation, strings]",2147483647,1495207265,TESTS,30,OK
+nimishagarg_ng,69,27215830,GNU C++14,0,PRACTICE,81,500.0,A,Young Physicist,"[implementation, math]",2147483647,1495201947,TESTS,30,OK
+nimishagarg_ng,443,27215737,GNU C++14,0,PRACTICE,27,500.0,A,Anton and Letters,"[constructive algorithms, implementation]",2147483647,1495201599,TESTS,15,OK
+nimishagarg_ng,466,27215140,GNU C++14,0,PRACTICE,19,500.0,A,Cheap Travel,[implementation],2147483647,1495199645,TESTS,15,OK
+nimishagarg_ng,466,27215051,GNU C++14,0,PRACTICE,2,500.0,A,Cheap Travel,[implementation],2147483647,1495199319,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,313,27214767,GNU C++14,0,PRACTICE,47,500.0,A,Ilya and Bank Account,"[implementation, number theory]",2147483647,1495198458,TESTS,30,OK
+nimishagarg_ng,116,27214376,GNU C++14,0,PRACTICE,76,1000.0,B,Little Pigs and Wolves,"[greedy, implementation]",2147483647,1495197361,TESTS,30,OK
+nimishagarg_ng,116,27214116,GNU C++14,0,PRACTICE,10,1000.0,B,Little Pigs and Wolves,"[greedy, implementation]",2147483647,1495196592,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,157,27203204,GNU C++14,0,PRACTICE,44,1000.0,B,Trace,"[geometry, sortings]",2147483647,1495134150,TESTS,30,OK
+nimishagarg_ng,157,27203155,GNU C++14,0,PRACTICE,0,1000.0,B,Trace,"[geometry, sortings]",2147483647,1495133946,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,493,27202813,GNU C++14,3174400,PRACTICE,57,1000.0,B,Vasya and Wrestling,[implementation],2147483647,1495132511,TESTS,421,OK
+nimishagarg_ng,493,27202593,GNU C++14,1843200,PRACTICE,19,1000.0,B,Vasya and Wrestling,[implementation],2147483647,1495131753,TESTS,374,WRONG_ANSWER
+nimishagarg_ng,486,27202079,GNU C++14,0,PRACTICE,47,1000.0,B,OR in Matrix,"[greedy, hashing, implementation]",2147483647,1495129515,TESTS,15,OK
+nimishagarg_ng,486,27201453,GNU C++14,0,PRACTICE,30,1000.0,B,OR in Matrix,"[greedy, hashing, implementation]",2147483647,1495127361,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,432,27199833,GNU C++14,1228800,PRACTICE,38,1000.0,B,Football Kit,"[brute force, greedy, implementation]",2147483647,1495121678,TESTS,467,OK
+nimishagarg_ng,432,27199565,GNU C++14,1638400,PRACTICE,9,1000.0,B,Football Kit,"[brute force, greedy, implementation]",2147483647,1495120791,TESTS,1000,TIME_LIMIT_EXCEEDED
+nimishagarg_ng,514,27199199,GNU C++14,102400,PRACTICE,7,1000.0,B,Han Solo and Lazer Gun,"[brute force, data structures, geometry, implementation, math]",2147483647,1495119486,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,514,27195569,GNU C++14,102400,PRACTICE,7,1000.0,B,Han Solo and Lazer Gun,"[brute force, data structures, geometry, implementation, math]",2147483647,1495108300,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,514,27194996,GNU C++11,0,PRACTICE,7,1000.0,B,Han Solo and Lazer Gun,"[brute force, data structures, geometry, implementation, math]",2147483647,1495106556,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,514,27194330,GNU C++11,0,PRACTICE,7,1000.0,B,Han Solo and Lazer Gun,"[brute force, data structures, geometry, implementation, math]",2147483647,1495104141,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,514,27194248,GNU C++11,0,PRACTICE,23,1000.0,B,Han Solo and Lazer Gun,"[brute force, data structures, geometry, implementation, math]",2147483647,1495103884,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,514,27194065,GNU C++14,0,PRACTICE,5,1000.0,B,Han Solo and Lazer Gun,"[brute force, data structures, geometry, implementation, math]",2147483647,1495102158,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,451,27183406,GNU C++14,819200,PRACTICE,76,1000.0,B,Sort the Array,"[implementation, sortings]",2147483647,1495037883,TESTS,202,OK
+nimishagarg_ng,451,27183376,GNU C++14,819200,PRACTICE,73,1000.0,B,Sort the Array,"[implementation, sortings]",2147483647,1495037716,TESTS,202,WRONG_ANSWER
+nimishagarg_ng,451,27183346,GNU C++14,0,PRACTICE,0,1000.0,B,Sort the Array,"[implementation, sortings]",2147483647,1495037599,TESTS,0,WRONG_ANSWER
+nimishagarg_ng,136,27182281,GNU C++14,0,PRACTICE,101,500.0,A,Presents,[implementation],2147483647,1495033131,TESTS,30,OK
+nimishagarg_ng,285,27181971,GNU C++14,409600,PRACTICE,33,1000.0,B,Find Marble,[implementation],2147483647,1495032023,TESTS,280,OK
+nimishagarg_ng,507,27181599,GNU C++14,0,PRACTICE,37,1000.0,B,Amr and Pins,"[geometry, math]",2147483647,1495030851,TESTS,15,OK
+nimishagarg_ng,507,27181378,GNU C++14,0,PRACTICE,7,1000.0,B,Amr and Pins,"[geometry, math]",2147483647,1495030226,TESTS,15,WRONG_ANSWER
+nimishagarg_ng,230,27178727,GNU C++14,102400,PRACTICE,54,500.0,A,Dragons,"[greedy, sortings]",2147483647,1495022602,TESTS,30,OK
+nimishagarg_ng,230,27169001,GNU C++11,0,PRACTICE,9,500.0,A,Dragons,"[greedy, sortings]",2147483647,1494970391,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,230,27168784,GNU C++11,0,PRACTICE,8,500.0,A,Dragons,"[greedy, sortings]",2147483647,1494968696,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,230,27168636,GNU C++14,204800,PRACTICE,8,500.0,A,Dragons,"[greedy, sortings]",2147483647,1494967828,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,58,27166933,GNU C++14,0,PRACTICE,40,500.0,A,Chat room,"[greedy, strings]",2147483647,1494959521,TESTS,15,OK
+nimishagarg_ng,339,27166629,GNU C++14,0,PRACTICE,21,500.0,A,Helpful Maths,"[greedy, implementation, sortings, strings]",2147483647,1494958260,TESTS,30,OK
+nimishagarg_ng,266,27166290,GNU C++14,0,PRACTICE,44,500.0,B,Queue at the School,"[constructive algorithms, graph matchings, implementation, shortest paths]",2147483647,1494956969,TESTS,30,OK
+nimishagarg_ng,118,27164453,GNU C++14,0,PRACTICE,42,500.0,A,String Task,"[implementation, strings]",2147483647,1494950181,TESTS,30,OK
+nimishagarg_ng,118,27164412,GNU C++14,0,PRACTICE,2,500.0,A,String Task,"[implementation, strings]",2147483647,1494950026,TESTS,30,WRONG_ANSWER
+nimishagarg_ng,4,27163237,GNU C++14,0,PRACTICE,20,0.0,A,Watermelon,"[brute force, math]",2147483647,1494946490,TESTS,30,OK
+nimishagarg_ng,4,27163141,GNU C++14,0,PRACTICE,0,0.0,A,Watermelon,"[brute force, math]",2147483647,1494946208,TESTS,0,COMPILATION_ERROR
diff --git a/ui/user_rating.csv b/ui/user_rating.csv
index 7f27954..df86b29 100644
--- a/ui/user_rating.csv
+++ b/ui/user_rating.csv
@@ -1,16 +1,16 @@
contestId,contestName,handle,newRating,oldRating,rank,ratingUpdateTimeSeconds
-415,Codeforces Round #240 (Div. 2),yj12,1482,1500,794,1396806000
-417,RCC 2014 Warmup (Div. 2),yj12,1503,1482,401,1397756400
-486,Codeforces Round #277 (Div. 2),yj12,1463,1503,893,1415725200
-567,Codeforces Round #Pi (Div. 2),yj12,1512,1463,944,1438799400
-569,Codeforces Round #315 (Div. 2),yj12,1481,1512,921,1439231400
-572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),yj12,1612,1481,335,1440268200
-574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),yj12,1523,1612,1712,1440873600
-670,Codeforces Round #350 (Div. 2),yj12,1516,1523,1133,1462473300
-673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",yj12,1481,1516,1112,1462644300
-672,Codeforces Round #352 (Div. 2),yj12,1536,1481,575,1462991700
-680,Codeforces Round #356 (Div. 2),yj12,1520,1536,1427,1465410900
-681,Codeforces Round #357 (Div. 2),yj12,1496,1520,1484,1465929300
-755,8VC Venture Cup 2017 - Elimination Round,yj12,1461,1496,2185,1484507100
-758,Codeforces Round #392 (Div. 2),yj12,1389,1461,3319,1484845500
-789,Codeforces Round #407 (Div. 2),yj12,1415,1389,1466,1490810700
+895,Codeforces Round #448 (Div. 2),nimishagarg_ng,1459,1500,1762,1511719500
+900,Codeforces Round #450 (Div. 2),nimishagarg_ng,1537,1459,522,1513015500
+903,Educational Codeforces Round 34 (Rated for Div. 2),nimishagarg_ng,1595,1537,483,1513098300
+898,Codeforces Round #451 (Div. 2),nimishagarg_ng,1616,1595,638,1513431300
+902,Codeforces Round #453 (Div. 2),nimishagarg_ng,1671,1616,415,1513704900
+907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",nimishagarg_ng,1616,1671,1674,1514045100
+909,Codeforces Round #455 (Div. 2),nimishagarg_ng,1587,1616,1300,1514399700
+911,Educational Codeforces Round 35 (Rated for Div. 2),nimishagarg_ng,1576,1587,1078,1514477100
+912,Codeforces Round #456 (Div. 2),nimishagarg_ng,1542,1576,1745,1515170100
+919,Codeforces Round #460 (Div. 2),nimishagarg_ng,1486,1542,2823,1517411100
+920,Educational Codeforces Round 37 (Rated for Div. 2),nimishagarg_ng,1516,1486,951,1517589300
+938,Educational Codeforces Round 38 (Rated for Div. 2),nimishagarg_ng,1598,1516,401,1518800700
+955,Codeforces Round #471 (Div. 2),nimishagarg_ng,1594,1598,776,1521831900
+962,Educational Codeforces Round 42 (Rated for Div. 2),nimishagarg_ng,1640,1594,499,1523378100
+980,Codeforces Round #480 (Div. 2),nimishagarg_ng,1684,1640,627,1525799100