One liner & Code Golf | Contest

#	User	Rating
1	tourist	4009
2	jiangly	3839
3	Radewoosh	3646
4	jqdai0815	3620
4	Benq	3620
6	orzdevinwang	3612
7	Geothermal	3569
8	ecnerwala	3494
9	Um_nik	3396
10	gamegame	3386

#	User	Contrib.
1	Um_nik	164
2	-is-this-fft-	162
2	maomao90	162
4	atcoder_official	158
4	cry	158
4	awoo	158
7	nor	155
7	adamant	155
9	TheScrasse	153
10	maroonrk	152

I invite everyone to the contest, which will take place on August 1, 2023 at 15:00UTC

Contest Rules:

In this contest, you need to write one-line solutions for problems.

The solution is scored by the length of the code (Code Golf). No penalties.

Only Python.

Contest info:

Number of problems: 8
Duration: 3 hours

Link to the platform: https://cpython.uz/competitions/contests/

P.S. Registration on the platform only via Gmail/Github. The submit button is in the right bottom corner.

UPD

Contest is finished

Best solutions:

A. One Line | Divisible

print('YNeos'[int(input())%int(input())>0::2])

B. One Line | List

print((lambda*a:a[1]+a[-1])(*map(int,open(0).read().split())))

C. One Line | Coordinate plane

print(['14','23']['.'>input()]['.'>input()])

D. One Line | Triple sort

print(*sorted(open(0).read().split()[1:],key=lambda x:(sum(map(int,x)),x[0],int(x))))

E. One Line | Next year

print([1+(i%4*5+i%100*4-i%400)%7for i in range(4000)].index(*[int(input())for i in'  '][::-1])+1)

F. One Line | Team Competition

print(max(__import__('collections').Counter(str(sorted(i.split()))for i in open(0)).values()))

G. One Line | Remaining at 7

print(sum(int(c)*int('132645'[i%6])for i,c in enumerate(input()[::-1]))%7)

H. One Line | Number of components

print((lambda a:len(set(__import__('functools').reduce(lambda x,y:(lambda l,a,b:[i if i!=l[a]else l[b]for i in l])(x,*map(int,input().split())),range(a[1]),range(a[0]+1))))-1)([*map(int,input().split())]))

Comments (21)

Write comment?

Solarion4

14 months ago, # |

Are you allowed to zip up your code with exec and bytes to reduce size?

→ Reply

NaZaR.IO

14 months ago, # ^ |

I forgot about additional conditions for each problem: The := and ; operators must not be present in the code and it is forbidden to use exec function.

Ritwin

eval and compile should be disabled as well.

They are practically useless in such contests.

Gassa

Fun!

Are the others' solutions viewable after the contest?

meNarzullayev

Of course, Paid only))

Joshc

← Rev. 2 →

Idk. Assuming you were rank #2 (I squeezed out rank #1 by clutching up on problem F), I'm very curious to see how to do G / H? Also the best solution to E must be amazing :eyes:

I fell asleep, so you won :xD

Oh lol, I guess you were #2, my bad. Apparently I don't know how to read usernames. How did you solve G/H?

If you have KEPCOIN, you can see other attempts. Admin can also provide shortest solutions

Welp, I'm a cheapskate, so I guess I'll hope the admin provides them in this blog :) (or you just post your codes for free :P )

Wait a while. I'll post the best solutions here.

No, I'm in place 4-5 (didn't solve H).

My main interest in others' solutions is the "common knowledge" regarding one-line code in Python by the given rules. For example, how do people use imports, assign variables, etc, and make it short. I'm sure missing some of that.

Pretty much just make sure you are comfortable with comprehensions, ternary expressions, unpacking, using open(0) for input, using __import__ for imports, using __setitem__ in lists, and a million nested lambdas

Thanks! Of these, I didn't know to use open(0), and __setitem__-ed only in dictionaries. My typical solution looked like
print((lambda _,a:...)(input(),input().split())) or some such.

It's amazing how you solved E without using the datetime module

← Rev. 3 →

It's just this formula: https://en.wikipedia.org/wiki/Determination_of_the_day_of_the_week, section "Gauss's algorithm" (the full link doesn't work).

By then, I did not learn to use imports :) .

ShaoNianTongXue5307

sir, your link not work.

Wow, I didn't find / wasn't aware of that formula. I spammed the datetime module:

print([__import__('datetime').date(i,1,1).weekday()+1for i in range(1,4000)].index(*[int(input())for i in'  '][::-1])+1)

BTW your solution has an obvious improvement: [i+1 for can be shortened to [i+1for

Yeah, and maybe open(0) can save a few bytes too.

Following the format of my code,

works in 97 characters, a 12 character improvement over the original. Essentially, I use the trick that .index() takes in an additional argument where you can specify a certain suffix to search in. The arguments' order have to be reversed though, so I read in the input into a list, reverse it, and use the unpacking operator.

NaZaR.IO's blog

One liner & Code Golf | Contest