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 | Benq | 3783 |
2 | jiangly | 3772 |
3 | tourist | 3706 |
4 | maroonrk | 3609 |
5 | Um_nik | 3591 |
6 | fantasy | 3526 |
7 | ko_osaga | 3500 |
8 | inaFSTream | 3477 |
9 | cnnfls_csy | 3427 |
10 | zh0ukangyang | 3423 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 185 |
2 | awoo | 182 |
3 | nor | 172 |
4 | -is-this-fft- | 170 |
5 | adamant | 169 |
6 | maroonrk | 165 |
7 | antontrygubO_o | 160 |
8 | SecondThread | 159 |
9 | dario2994 | 152 |
9 | kostka | 152 |
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.
What do you mean by that and you are not helping so you are this.
You had written one more condition. You were thinking l[0] as the next index of l[-1].