Hi,
Is there anything wrong with codeforces Compilers/Interpreters around 9.30 — 11.00 IST. All my submissons are stucked in 'In queue' status.
I can see submissions from other participants also stucked.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 152 |
10 | maroonrk | 151 |
Hi,
Is there anything wrong with codeforces Compilers/Interpreters around 9.30 — 11.00 IST. All my submissons are stucked in 'In queue' status.
I can see submissions from other participants also stucked.
n = int(input())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
xy = set(x)
xy.update(y)
flag = False
while n > 0:
if n in xy:
n -= 1
continue
else:
flag = True
break
if flag:
print('Oh, my keyboard!')
else:
print('I become the guy.')
As per my understanding of the problem desc, I am not missing anything here. I am new here so correct me if I am wrong.
Test case description. Input 3
1 2
2 2 3
Participant's output I become the guy.
Jury's answer Oh, my keyboard!
Checker comment wrong answer 1st lines differ — expected: 'Oh, my keyboard!', found: 'I become the guy.'
Getting a time limit exceeds error on test #7. Help and understanding of efficient solution would be well appreciated.
n = int(input())
string = ''
group_count = 0
for i in range(n):
num = input()
if i == 0 or num[0] == string[-1]:
string += num
group_count += 1
else:
string += num
print(group_count)
Hi,
I am new to this platform and started solving problems by difficulty level starting from basic. This problem 116A-Tram, which gives task to find the trams min capacity. Submission Id: 90279549
It showing error on test #3, however when I runs the same code in my local machine its showing perfect answer which is 11. Screenshot is attached for output verification.
n = int(input())
stops = []
total = 0
for i in range(n):
stop = list(map(int,input().split()))
stops.append(stop)
max_total = stops[0][0]
for i in range(4):
total = stops[i][1] + (total - stops[i][0])
if total >= max_total:
max_total = total
print(max_total)
Name |
---|