Hello CODEFORCES.
I have a problem in my code A of last Div.2 contest.
Help!
Code
Those who don't Help.
By the way CP is Getting harder and harder by the minute.
I propose to have div 4 contests every week.
See this Blog.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Hello CODEFORCES.
I have a problem in my code A of last Div.2 contest.
Help!
for _ in range(int(input())):
n=int (input())
l=list(map(int,input().split()))
x=sum(l)
if (x)==n:
print(n-4)
else:
for i in range(n):
if i!=n-1:
if l[i]==-1 and l[i+1]==-1:
x+=4
break
else:
if l[-1]==-1 and l[0]==-1:
x+=4
break
print(x)
Are these.
By the way CP is Getting harder and harder by the minute.
I propose to have div 4 contests every week.
See this Blog.
Name |
---|
kid.
You had written one more condition. You were thinking l[0] as the next index of l[-1].