code1
stringlengths 17
427k
| code2
stringlengths 17
427k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.7M
180,677B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
if int(input()) >= 30:
print('Yes')
else:
print('No') | N,K=map(int,input().split())
result=0
for i in range(10**9):
if (N<K**i):
result+=i
break
print(result) | 0 | null | 34,853,678,873,100 | 95 | 212 |
N = int(input())
S = list(input())
ans = 'No'
n = int(N / 2)
if S[:n] == S[n:]:
ans = 'Yes'
print(ans) | N = int(input())
q = input()
a = list(q)
if N % 2 == 1:
print('No')
elif N % 2 == 0:
b = [a] * int(N/2)
c = [a] * int(N/2)
for i in range(int(N/2)):
b[i] = a[i]
for j in range(int(N/2)):
c[j] = a[int(j)+int(N/2)]
if b == c:
print('Yes')
else:
print('No') | 1 | 146,826,000,737,440 | null | 279 | 279 |
n = int(input())
if 30 <= n:
print("Yes")
else:
print("No") | import base64
import subprocess
import gzip
exe_bin = b'\x1f\x8b\x08\x00<0J_\x02\xff\xddZi\x93\xb2<\xb3\xfe-\x96K\xa9SV!\xe2V\xb8\x81\xa0(\n\x82\xb2\xc8\x07\x15\xdcw\x1d\xdcQ\x7f\xfb\xcb2\xf7\xc4\x9b\x919\xcfSu\xde\xf3\xe1\xe4\xc3L\x9b\x8bt:I\xa7\xbb\xd3\xc9\xb8XD`H\xf7\xf3\x08\x04\x8a\xf1\x98\x05!\x9e\xcf\xc6\x8f\x9bt\xabbW\xd1\xebn(`S:<\xbc\xb5\xc0\xb7\xf4Z\r*p\xa1X\xcbe\xf9f\xf2\x14\xef\x95\xf4T\x9ceT\x04\xb4xG\xf5\xafU\xa1\xef\xa2\xe0\xf5\x12\xcd|I`\xf0\t\x9bK\rJ\xa5\xcev\xd5;*\xf3\xec\xdd\xdb.\xca\x16\x1cP\xf1\xddv\x91\x84~-\x97\xb2!p.\n\x82\xe2\xb8\xf4\xc2\xc5\x1a\x96\xac-\x07N\x9d\xac\xadS\x01\x17\xf5\xf9\x0c\x19N\x83\xf4\xadR\xec\xb8\xb9\xe8z\r\xb6\xb9L\x08jr\xb4\xab&D\xed3\xe1\xa2\xcc\xd1\x95a\x17\x05\xe6\xc5\x9e\x12\xfb\x0f\x0fA\x883\xcawT\x03=S\x11\x17e7\xb3\xa9\xd6\xf3\x19\xa9\xd8?Y\xad\x1bs\xfaxG\xfd\xce\x85\xe3\xb9R\xd5\x1e\x11\xf4\xafK\xb2\x9c\xb9T\x1d.\xba\x1e\xa7l\xa6\xbf\xcf\xee\x1a=7\xa2.\n\xact\x85^\t5J\t\xa7SR\xd5\xf7YS\xa6\xfb\xea~\xa87w\xb4Y\x87\x94\x15\x1f\x1f\xd6\xec>\x9c~\xadf\xcd\x1e\x84\x04\x80\xae\xd9\xcb\x03\x06\x98R%\x8c\xb6\x01\xfb;\xa2M\x0b\xbec1\xb8\xb8\x97\x12r\xa4w R\xc5\xb6\xd4ah\x9f\xdd\x0c\x99\x8e&$\xd0\x12K\xc4\x9a\xf9\xb3\x91t\x00\xab\xa4\xf6\xbb\x96\xa1\x95\xcfH\xfd\xf7y\x99\x8c\xf0\xd3<\x19\xf2\x95j\xef\xd0F\x8dH\x86\xb1^l\xd7}\x87\x92\xa1\xe0`\xe5\xd9\xd6\x9e*O\x94J@g\xdd\x13\xcd\xf2BY\xf0D\xf7\xd2\x83\xe9y\xa2\xa5!\xba\x8cys6\n\xac\x88\xb1\x94,\xbdC9\xb8\x7f\xb8{\xb6\xb5\xd7\xd2\xb3m\xcd\x886.\x9e\xa8\xec\x9f\xe0\xb4\'g\xb8\xf0\x80\xb1\xe4H=L\xe8-n\xed4\xbb7*H\xd9\x94\x80\xee+\xb8\x8d\nymvuv\xfc5\xb0\xff\xb2\x89\xf8Z<j\xd9\xb4\x91$\xf2<]2U\xaf?\x11\x0e\xe3\xa1O\x89\x92\xfd\x94\xd6\x95k5\xe1\xa0F\x04f\xcd(y\xa9y\r\x17e:\xa3\x91\xd2\xae\x1bP\x1b\xc7\xfe\xf9(\xadk\x99q7V\xdbm\xecO\xd4 Yx\x98\xfc\x9e\r>\x03\xfb\x0c%Z\xc1CbK3u\x17#{\x19.rcJM&\x1c\x8b\x0bz_\x9eWg\xf9r\xcb\x01\xa2y\x88V\xa2W\xa6/\xf2\r\xa8\xc5\xec\x92\x8d@\xa34\xc07o\xd0&U\xa9#\x17\xb1\x1f\xd0z\x9a\x82\'\x92Z\xf7\x9aM7[\xa3f\xba\x03\xef\xe6\x0fj,\x7fT\xb4lf\xd8\x10\xb9\x9d\x18R\xa6\xb2\\\xd1\xc4\xe8C\xd4:\xf4\xec,/W\xfd\x0fM\xadF\xd3\x9a\xda\x82\xfd\xcdf7\xbb6\x81\xcd\xc5\xe4\\.\n\xa7j\xbcl\x0e\xe1d0k\x161*\xcbqsl\xf2c7\x9co\x10\xba{K\xba\xfd\x84\xd7\x16Jh\x9d\xcdt\xa8\xf9\xcf\x9fq9\xf7\xd8d\xb4\xcc\xe2\x14\x83\xb0Jf\xabu\xa5S_8\x14\x83A\xe1X\xf3]\xba\xd7\xc9\xe2\xa9\x06{|\xc6B\xbb\xc3\xf3\xc1\x88j\xdd\xe8\x95\xd2X\xf8\xb4\x13\xef\x8a\x1a\x93J\xa1r\xbe\x1b\xbb\xd4p\xeb\x93\x99\xc5\xefdN,Ji]\xb2P\x92\x0b\xb5\x9e\xc8\xce\x915/l\x0ft\x0eJ\xefn\xdbF\x8b\xce2$\n#\xad\xaf\x9f\xf5\x9c.l\x03\\\x9eD\xfd=\xc4\xfe\xb8-Oza\x12\xad\xad\x08k\x97\xc3\xa6\xc9PS\xa6Q\xe0\x93\xa6\x19\xd9e\x1d\xabb\xdb\x17\x1b\xd5u\x16\xf9\xb3\x1d+\x89T\x96L\xd3\xb6\x16WT.\xbdN\xad>\x9b9\x13*#b\xf4\xb4\xae\xd8\x80\xa6cw\xcb,e\x13\n\x9c\xfbl\x81\xb6\xf6~\x06Vt^m\x18{\xcb\x0e&\x87\x85sQs\xda\xb6U\xf1h\xf7;\x93\ti\xe7\xb2\xa7\xc0\xa7\x1c7U\xd1\xe1\xa2\xc6\xb3=\xd4\x85N\xca!joS\xc3\xcd18p\xa1*\x14\xdahN\xdd\x96\xc9\x1e](\xa8\x0b\xe5\x06\x8d/\x7fh\x9b\xc8okk\x97\xa86\xcdd\x00\n\x17rF\x16\xa0h<1\xa8\x024Q\xab&1\x80\xe67\xdb0\xfb\x82.f$\xfeb}\x88\xb2.\xbd\xa0\xe8\x07S\x06h\xffv\x99\x8c\x01\x8aT\xca\x12\xf1\x12\xd8|\xef};\x84\x00\xc6\xdc\xb1\x02\xdf{\xdfA\xa3\xa1m\x05\xa0\xeb|\x9as"\x00\xb8Q\xf7\xa7_B\x12\xab\xec4\x9d\xd0^\xd0/\x05\xf9*z\xbc\n-\x00\n\x1c\xee\xd7j\xf9\xd0\xcf\x17\xf4\xef\xe8\xe6B\xb0\x97\xdb\x0b\xfa\xb7w\xbe\xddb\xcb(@\x9d\xce\xbfK\xa0%\xcb\xa5\x17\x14\x04cVa\xb8D\xb3\xc9p\xe1c\x10f\x0fqn\xfa\x18\x84k\xf7\xda\x92\x8b\xf9!\xadq\x01\xdf\x99\xea\x8aM0\x96S\xa3\x8d\x9c\x16k"9\x0ci\xdd!\xf6\xd9\xc2\xd8F\xcaRB\xd8\x8fr~T7\xeb\xae\x94U\xb7\xb7\xeb\xc2\xe4\x81\x18\x9auj\xd6\xaa\xfb\xb4\xeb|\xf0r\xd44\xeb\xcaq\xabN\xb7\xeb\x8e\x05-\x98\xbaC\x0c\xda\xb3\xea\x0ev\xdd\xce\xdfI\x16\xcc\xba\xf5\x87Uw\xb4\xeb\x96;Z\xbc\x98u\xac\xcf\xaa;\xd9u\x96s\x9d\x99u\x90n\xd6\xc1\xcc\x8b\x9f\xf1E\xb8\xeeB\xc8\xe48K{\xe5B\x1e\xba<\xe7\xa7`{k\xab\xdf<k\xec\xfa\x95g\r:\xde\x19=\x8b.F\x82:ex8$\xc2\xbb;\xc6\xfb\xef\xf1\x03\xfd\xe5g2\xf5\xbc\xf9\t\xb6\x1c\x15\xa5\x18c~2\xd9[\x8a\x9eGz\xd5\xc7j\xcem\xe6\xba\xc3@\x1e\x17O\x18[7b>m\xb7\x14\xf2\x97\xd4`pG\x92x\x1e_\x7fl\xef\xf5\x1e\xadaP\x1d\xad\x9a\xce&\r\xe3\xf8:\xa2p\xac\x7fE\x14\x19\xee\x83\x88\xc0\x97\xc6\xf8\x96(\x869S#\x90\xf2\x98\xe1\xe2\xb1B\xe5I\xc0T~\'\xe72\xc6\xbdO\x99Z\x97\xd8\xfb\x91\\y\xe4,\x9e)F$eK:\x95\x8db\x19\xdb\xcd\xa7\x12\xc3E\xf5N\xfc\xce\x97Z\x8bN\xa3Z\xb7d)P\xadyq\x0b\xa5}\x81\x0b\x9c\x9bFZwf})V\x13\x83U,\xcc^%\x18\xbdEn\xbe\x12\x9dM\x1f\x16\xfc\x12yX\xd34C&\xa9u\x1cJ\xfb3u\x83[\xfb\r\xe3\xb1\xf2\xc9\xe6\xc2\'T\x0c)gH\xb3\xdf\xe0\xd5\xeac\xc8\xf0P\xc8\xb0{\xab}\x9e\x08$\xe7W$j~\x1aDy\xab\xdf\xf0\r\xdd\xc3\xf9;\xdd\x9cJ@f\x01\x1fW\xfa\xf4z\xd8\x9d\xfe5\x8e\xb09\xd5P\x84]H\xd7+\x84\xb1\xb4R\'\xa6T\xbe\x9f;\x87\xe9H\x1c\xb9\xb4xF:\xcc\xb6L\xb9\xecK\x84\'\x11:c)\xabf\xb7\xb0\x94\xb5-PF\xac\xff{\x1f\x93\x1a\xdfk\x9bk\xd9\rT\xaa\xb7\xdb\xb1%\xfbr"\x94\xcdlF9\x7f\xb7\x87\xcc\xfd\x05\x11\xc5\xd8\xd6^7\xf7+|cF\x8c\x0f\xf5\xeb\xc1\x04l\xb6\xd0&\xbes\x18uv|\xaf\xd3!\x17\xf6\x1c\xf0\xdd\xd8\x93\x10*\xabg\xc2\x9c\xce\xb3d\xd75\xa0\x84\xb0f>\x9fH\x90\xef\xa6\xb6\x87\x85p\xcf\x17\xec\xc1,\xc4\x0f_\xca\xa4:\xd8\xbcs\x83\x93}b\xdd\xbf;\x9bN:6\xf0\xfcg\xa6\xd7\xbc#H\x9e\xd2x\x95/\x02\x99\xd9\xad\xb1\xef\xcc\xdb\xf7N\xafXl\xdc\xa3\x1f\xe1b\x9a\x81\x14\xb8\x81kEn>\xf7C\xf2f\xdd\x80\xd6\xd7k\x03\n\xa1\x01\x1f\xba\x1d\xfb@\xdb^\xa7\xb5"\xbe6v<\x16\xf6\x9d*\xa7\x96\xed]Z\xd4\rg\xa4\xdd8\xb6\x84\x04\nO\xda\xa76\xdb(\xf4|\x91@l\xfe\xd4c\x07m\x97ivNh7\x8dM\xfdUc\x11\\#\x9f]\n\x0e/w%|\xa1}H\xa3\x8cNv\xd6\xed@Z\xdbq]1\x81\xf6;Dn\x073g\xeeYx@Ntm\x97\xb1\xa8+\xd0\x18\'>3\xe7\x82\xa1/Yx\xf3\xb0Q\xe78\xc7\xd7\xe0\'\x11\xbd\xaef`\xaf\xfe\xd6\xb6}\xc5\xd7\xe3\xa8j\xb7\x15\xc9}*3\xc1\xa3\xeb\x19\x14\x9f\xae+\xc8\x02\x89L\x13g\xaa\x80C)\x9f\xe4\'Vh\xbb\x07\xf8\xd9\xc7\x9b\xcb\xf0\xd4\xc5]V\xcf\xde\xd8\xf68\x8e\x05l\x95\xb0,M\x11J\r2\xd84\x1b\x0f\x98fd\xac\x96\x91y\xf5\xc9\xc1\x87\xc9\xc73}=,Y\xbb\xcb\xfa\x8e\xe6\xcfd\xe8\x98_B\x19(B\x0b\xf51-\x82s\xd4\x16\xf7/b"\xf9Q\xc3\xa4\x11u\xadBi\x84\xc4\x17FL?\xa4\x0b\x91K\x04Y\xf4\xfd\x8dF}\xa5&\xe3\x17\x16\xd3g\xa9n\xe5X#b\xa3*\xb2\xe9 j-\x15I\x10t\x89\xe6\xcc\x11\x95\xd2\x93t\xf8rU\x1a\xf5%\x93\xb0]~\x8e\xb9\x92\xe79\xbc\x19n]\x1e\xf6\xffs\x01\xf1\x0b\x88U@\\\xe2\xca\x06\xb8(;\x04\xb3)\x10\x1a`-\xc4p\xa2\x02\x10\x10To\x01\xd6\xef\xe4\x19\xe0\xfb\xa1\xe5\x8a\xa52\xa7]\x8ew\x9dk3\x02\x1b\xe0\\q\x13\xc8Q\x005\xeb\'\xdb\xcf\x8a\xeb\\\x0b\x9c:\xbd\x8e%#/q\x93\xed\xc5\xaf\xda\xd4\x89x@(\xb4\xa2\x1f\x07G>\x10\x00\xd9\xea\xe8\x8c\xd2\x7f\xa97\xdc\xd3\xf6\x1dtL\x085\x98\x049\x8a\xaf\\\xc6:\xf2p\xed7\x10.\xa4\xe5\xb6\xc6|\x8d-^\x9b\xba\xd06{\td]\xa34\xfd\xc2H\xfe:[\xfd\t\xee\x80|Y}]\x11\\-\x06O\xe1\xd2\xfc^\xad\xec\x1f\x91\xe3\xad\xaf\x9c\xd1^w\xe4\xb3\x1c.\xe7\x92\xde<s.\x9c9\x88\x94\xf1\x8f\x95\xc3\xafs\x9b\xd0\xae\x0c\xc6\xffEy\xcd\xec\xbc9\x95\x1f\x98\xb336),I\xce\xd8\xb4\xfe$5\xb1\xa9Yj\x13<9\xbaQ;\x8fr\xce\xca\x08a\xd2\x91\xfe<-\xe4\xe8\xffEIA\xb4\xde,F\x0f\x19\xac=k@\x9a?\xc3)\x98\x90\xeeU\xc9X$Ok\xb7\xe8\x94\xd2\xd4)\x1f\xa9D\xf7\xe1N5p_a$\xdai2\xff\xae\'\xc3\x10^\xf2z?Q9\t2Y?Q5\xa5\x99\x0eW\xf6@G\xe9\x97\xfc\xd0\x0ft\x9a\x01\xbb\xe7\'\xba\xc8\x82\xfd\xf6\x13]c@\x9b~\xa2;\x1c\xe8\xe4OT/\x83]\xf1\x13=\x11`\x1f\xfdD\xaf$\xb0H?Q\x7f\x85\xde4;\xa8\x07\x1a2\xe3\x98TO\xf0@\xa3T(W\xd9/=P\xb4\x06\xac\xdeO\xb4P\xa77\x9bU\xc1\x03\xed\xd1 \x8b\xf8\x135\x1a\xcbV&\xf1\xe1\x81>\x9b\xc0\xb2\xfe@\xef0\x03\xec\xe9O4\xc9z\xef7\xe3\x9ei\xbd\xd8\xba\x1f(\xceA\xf1[s\xed\x81\x92<8\x0f\xfeD\xa96\xe4\x95t\x8b\xb3\xe2\xb3\xf0>\xcbdYB]\xbfV\x81\xdfrb\x06\'\xe7\xd6HuL\x06FkX\x9a\xd3n\xbfE\x96\xe1\xe3\xdc\x933uZ|\x1cl\xce($K\xee\x15\xac\x99\x01\xde\xc9F\xb1\x16\x93qk\x1d\xab\xd2H\xd1F_|\xe8w\x11\xa7\r\x99p\xa4\xdaR8\xe4\x92J\xe5\xe1\x87\x19\xb4\xf1\xd1\xc6\xbb5Z\xa3\xe3l\xd8\xe6\x0c<\xf6K\x16\xf1\xda\x92\xfaf\xdb\x10\xfdn\xf5\x7f\x1f\xef\x9f\xc0\xd5_?\xe5N\xfd\xe6\xbbO<\xdbZ\x07\xcf\x91u&\xa7\xdei\xac\x1dP\x99\x9c\xd1\xe6;\xbd*\x92\x1b,l\xfe?\xd5\xdf\x8d\xd7\xf8|\xf6\x9e6\xfanD\xc9\xd1<oe\x89\x0b\xcc;\x9d,/\x96\xd48Y\xce\xceFI"j\xb8\xdb\x0e\x0b\xe1\xfb\x10ck\xd4\xe1\x9d\xc6:y\xe0\x91*\xca`\x87\x02\x9fW\xdf\xad\x16>\xcf\xccg\xf7\xba\x9c\xb3\x9e\x19\xe6\xd9u<\xd9{\xb6\xb5\xfdy2\xe4\xefJ\xc0\xaa8\x01\xb3U\xb68\xbaC\x93#=0\x05~\xe6%\xe7\xc1=\x9f\xde\xd9\xe9\xc2\x82@\xc2&gM~g\x91|\xf0a\xc1z\xb6\x1dWR\xf2\xd4\x96\n\xdce\x81#\xc5\x874`\xb7\x9emo2&3f\xdbV\xe7\x9d\x05\xeeK\xf9F\xcf\x1e\xd1\xbb5\x82\xee\xe4(\xe9\xc9Y@?x\xc23\xc3<l\x10\x01\xd5^\xfdw\xeb;\x80\xbbr\xdfD\x97\xe3\t\xe1\x7fd\\\xe8T\xe5\xf0\x8d\x8d\xbe\x93j\xc9\xe2\xdd\x9b\xa7Tg\xb2\xdf&\xec\xb9\xba\xddZI\'o\xe6\x1cQ\xac\xe2\xe7\x13p\xc73\xa3\x8er\xc6\xf3d\xb7\xadh\xe3\xdc\xc5\x1d\x91\x8d\x92\xe7\x9cg\xce\x1cn,\r\xccS\xaarM\xa3\'\x9e\xfdR\x89\xda\xc7\xd1\x13m\xc9\xb3\x8d\xf7\r\x02\x84\x9f\x88\xa3\xa2\xc0\x1a\ta$\x8d\xb6\xc6MA\x14\x0e\xe3\xfc]\xdc+\xd7\x86B\x10e\xc3IBK\xd8)!\x1c\x97ZQ\x99\xb4\xabE\xd1\x08\x9d\xeb\x9a:\xa7\xcad\xa9^(H;E\xe8\xcb\x85\x88\\V\x03\x8b~V8\x14K9e\\\xcc\xc7LV\x9d\x9bplWK\xe2\xfe\x90>K,\x17\xa8j)Tx\x0e\xd7\x1c]P\xc8\x00\x9f\xd4\xba\x91\'C\xf9\xf9\xd3\xde\xcaI+JxS.)\xe1b9/\x1c\xe3\xcd\xbb\x1a:n\r-@0Y\xb9\xd0\xd4\x0b"_\x96\xef#(X\x865\x95:\xe0R\xcf\xc7\xdf\xa5\x8d\xf4\xc8)\xa4\xb6|\x9a\xbd)!\x91\xdbm|\x12\xab\x040\xf3;6%\x17\x8a\xd7\x9c\x1aZ\xed\x1a\xc2\x11\xc3\xeej\xb8y(\x08\xfbp\xff\xc4~\x18\xca\xa1E\x90C\xc3\xea7\xd5"\x1f\x07\x94ib\xb1\x00\xfd\xb8\x87wL\xbd\xd1\xd9\x0b\xfbm\xa2`\xfe\xec\xf3\xd6\'cs\xe4\xb58\x90@\xc2{\x0f\xc5\x94\xea\x80\x0b\x87\xf3c \xf2\x85z\xc2\xbe\xdcx\x99\xc9\xcf@\xf9\xc2\x05r\xc7"\x9f\xf2\xa3j\xb3UF\x10i\xd3\xab\xe7E\xf2~\xc4Z3\xa9\x12\x94\x18\xbc\xff\xa1\xf9?\xf1\xcc?\xbf\x96\x98\xcc\xc7\xcdRh*6\xf4\xf0\xf0Q\x1dV\xa7\x01s\xe4\\Tle?/\xcax,\x0cF\xed\xab\x80;\x9f\x1c\xe6\xbbD\x15\xcb\xab\x01\xeb\xfa\xa2-m\xef\x81\xa7\x0b\xb0\xd6(hN{%\xac\x8c\xc3\xeb\xfe\xdf\x97*A\xfa\x18\x9fu@\xda\xdf}\xb5 \xa0\x99\xeb\xf7\x95A\x8cDy\x9d\x15N{\xfe!\x1a\xb0v\x95W\xfb{D\xe4*\xcb\xee\x17\x17\xfb.\xa1\xb6f\x04\x9d\xf5G\x84\xfd\xf9v\xb0/\x82\xfe\xcbw,\xf4\xa1\x19\xa3\x99e\'<jwk\xb9V58\x0b}8wE\xb1\xeah\x04\x86\xf0\xe7"\xc3\x94\xef\x08m#b\x0bK?\xcc\xe5\x1e\xa2\xe6\x0c1~-\x95\x83\xaa\xceO\xbd_Ki\x02\xf4\\\x9b\xaa,\x07\xb5\xf4\xb8\x1a7u\x83:Wb\x89\xe6\xe2\xcd\x849\x17-\xa2Q\x08\xc7m}1\xa7\x98\xbb\xb39\x9f&\xffr\xb5\xf5W3\xeb\xe2\xe6\xfeu\x1b4VEE\xed\x8f\xf4\x1f2\xe7\xb4\x90\xa9*\x1cd\n9\xba\xdb[\xf7{\xe4Ks\xa5\xdbM\n\xee?s2=\xdfd\xec5RC\xc1\xe3\xe0\x8f,\xfd\x95\xe7%\\\x07N\xc6\xf9\x1a\x9e\xe5V\xc2!<\x0cJ\xf3\xd0\xc3\x90\x0b\x05\xff\xa3\xc9\xef\xfbW\x97&B\x88\xd1\xe1\x95J\x85\x1aXT\xd3\xec\xc3tV&\x85YK\xab\x8a-\xb9\x16\x93\x0bL"\xad\x86\xb88\xa5L\xee:A\xe6>\xa3\x03r\x17T\x1b\xe6wdY\xeb\x86\xd3\x9c2\xddlD\xcd\xb7:%\xc9\xed\xd67 K\xd7\x94J\x96"\xe7\xa6\xacV\x8e\x83\x11,^\xa6\n\x1c\xa2 \x8b\xd2T]\xf4e\xac\x16;\xd3\x0e\xe50%\x8a\xaf\xca2\xfd\x89\xaaCdxe\xe4\x82X0\xacO\xea\xd26\x18.K,\x8a\x14\xc9^~\xd1\x11\xeb\x859\xa3\xb1\xd0\xa0l\x9b4\xb2w\xd4\xa7fGY\xd5\x14C\xca\x0c\xafz\x9fw\xa6\x1d1\xb8\xaa\xd4d7\x1f\x102\x88\x19\xc2\xb1\xde\x8e(\xc4&\x15\x95X\xe4\x94\x94\xb6\x1d\xcd\xa7\x06\xfcQ\xc3D\x9f/\xe6\xc6\xfc\x99\x7f(\x13~\x14\xfe\xf33Z67\xa7l\x88\xd1-n\x1a\xb2N\xef@\x96\xc8b\xd7\x04Bq\x85Ts\x88\xc6<[\xe2\x7f\xe5\x04\xeedg\xec \xf5\xdb\x1f\xfd\xfe\x96\xc4}m\xeer\x1a\r\xe2\xaa8\xe9\x8eo~\xef\xde`\xbcsJ\xefr\x0f\x15\xffgu\xe3\xe2\x07N\xb8\x80\xb2s\x9b\xff\x80\x9f\x9dc\xecKA\x92\x02\xfc\xde\xbd\x9e(\xa3\x01z\xec\xca7\xb9\xd2\x9f\x8e\x0fM\xe6\x9b=\'\xad\xf4\xcd\x0f\x9c\xa2\x015\xc1{\xfa\xfc%WeM\x1d\xe0\x07\xb2=\xbc\xaebq\xd7\xa3\x0bp\xee\x06\x14\xc8i\xfd\xbe\x1e\x02u\xbfg\x9d4\xd07?pR\x07\x14X\x8f\x97K3\x90&\xfd\xa6\xba2\xd6i:\xa9\xa6\xef:p\xb6\x07\x94\xfd\x0e\xc0u\xa7\xf9n\xfeFT\xb1\xef\xbc>\x01\xfc@6\x00P G\xf6n=\xc0\xfcM\xd5\xf4se\xf3k\xd4\x12\xcf\x90+\x0f\x07(\x90\xc3\xb3\xf9\xa5S\xf1v\xf3\x1d\xbf\x85nn\xe5\xbf\x9e\xaf\xbc\xe6@\x01\x05\xb2~\xbf\xeb\xdf\x1c>\xcf\xf7.~ G\x01(\'9\xef\xf5.\x08P\xabu\xf5\xecw\xf1\x03Y\r@\xbd\x9b\xfb\x97\xbb\xe8oj;J\xea\xa8\x8b\x1f8\xb1\x00J\x9c\x8e\x16\x15O\xf9\\\xef_\\\xfc\xc09\x05P\xaekm\xcf\xf9\xd3\xb9B\xe9\xe9\xb2W\xe0$\x07(\xd7U\xb7\'?\xeb\xca4\xed\xe2\xf7\xfbk\xaf\xdf\xf9\xdd\xa4R\xa3\xe1\xe2\x07\xf29\x80*\xa39n\xe2\xb9\x1e/\xf7\xce\xbb\x0c\':\xb7\xeb\xdf9\xe9\xd7\x17`\x7f^\x85\xbd\x9b\xfbw\xeb\x1b\x19\xf663\xe7>\xfe\x9b\x1f8\x9f\x0f7\x07}\xfd\xaf\xf4\xc5\xba\xae>8K\xfb\x923\x07/\xf7\xfe\xbc\xe6\x03\xef\xf5\x80\x1e\x00.@z\'\x0fb\xcf\xdf\x9b\x1c\xfc\x84P>\xcf\x9e\xfb\xe3\x9d|\x05j\x1f\t\xb8\xf8\xbd\x9c\x1b\xe3W\xbc\xfa\x0f\xe6\xef\xe5\xcd\x84u\x81\xe7\x00\xdf\xfc^N\xa9D\xe4C\xfa\xb2\xd4\xfb^\xc8\xd5\x16\xbc\xef\x04\xa5\xe7\xc7\xee\x05[>\xfb\x99\x8b{G}\xf3#*\xa9\xce\xc4\xdb\xde\xbb(\xaf\xfb-z\x9b-9+]*\x93\xb9"\x88\x00\xc8Q\'\xb8xg\xff\x9c}\xf9\xf7\x1b\x8c\x17\xef<\x0c\\c_\x9e\x98\x9bu\xff\x81?J\x8e\x94\x08\xe5\xc9o\xefO\xd5\xe9\xbf\xf2C\xff\x13\xbf\xff\x00\xd1\x89Y\xb8\xa2+\x00\x00'
exe_bin = base64.b85decode(gzip.decompress(exe_bin))
with open("./kyomu", 'wb') as f:
f.write(exe_bin)
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True) | 1 | 5,748,405,418,912 | null | 95 | 95 |
n = int(input())
a = list(map(int,input().split()))
b = sorted(a)
memo = 0
for i in range(n-1):
if(b[i]==b[i+1]):
memo +=1
if(memo==0):
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int, input().split()))
b = set(a)
a.sort()
if len(a) != len(b):
print("NO")
else:
print("YES") | 1 | 73,719,138,288,640 | null | 222 | 222 |
#!usr/bin/env python3
import sys
def generate_default_spreadsheet():
r, c = [int(row_col) for row_col in sys.stdin.readline().split()]
sheet = [
[int(row_num) for row_num in sys.stdin.readline().split()]
for row in range(r)
]
return c, sheet
def generate_spreadsheet_with_sums():
orig_total_col, sheet_with_sums = generate_default_spreadsheet()
sheet_with_sums.append([0 for col in range(orig_total_col)])
for row in range(len(sheet_with_sums)-1):
for col in range(len(sheet_with_sums[0])):
sheet_with_sums[-1][col] += sheet_with_sums[row][col]
for row in sheet_with_sums:
row.append(sum(row))
return sheet_with_sums
def print_summed_spreadsheet():
sheet_with_sums = generate_spreadsheet_with_sums()
[print(*row) for row in sheet_with_sums]
def main():
print_summed_spreadsheet()
if __name__ == '__main__':
main() | i = input()
a = int(i)//2
b = int(i)%2
print(a+b) | 0 | null | 30,021,504,627,838 | 59 | 206 |
A,B,C,D=map(int,input().split())
nT = 0
nA = 0
while C-B>0:
C -= B
nT += 1
while A-D>0:
A -= D
nA += 1
if nT <= nA:
print('Yes')
else:
print('No')
| # 高橋くんのモンスターは体力Aで攻撃力B
# 青木くんのモンスターは体力Cで攻撃力D
# 高橋くんが勝つならYes、負けるならNoを出力する
A, B, C, D = map(int, input().split())
while A > 0 and C > 0:
C -= B
A -= D
if C <= 0:
print('Yes')
elif A <= 0:
print('No')
| 1 | 29,468,109,542,560 | null | 164 | 164 |
S = list(input())
for i in range(len(S)):
S[i] = "x"
print(''.join(S)) | n,m = [int(x) for x in input().split()]
a=[]
b=[]
for i in range(n): a.append([int(x) for x in input().split()])
for j in range(m): b.append(int(input()))
for a_row in a:
print(sum([x*y for x,y in zip(a_row,b)]))
| 0 | null | 36,870,332,295,566 | 221 | 56 |
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10 ** 9)
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
N=INT()
memo=[0]*50
memo[0]=memo[1]=1
def rec(n):
if memo[n]:
return memo[n]
memo[n]=rec(n-1)+rec(n-2)
return memo[n]
print(rec(N))
| import sys
from bisect import bisect_left
input = sys.stdin.readline
def main():
N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for a in range(N - 2):
for b in range(a + 1, N - 1):
x = bisect_left(L, L[a] + L[b])
ans += (x - 1 - b)
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 85,568,728,618,172 | 7 | 294 |
print('Yes' if input() in ['hi'*i for i in range(1,6)] else 'No') | def DFS(word,N):
if len(word)==n:print(word)
else:
for i in range(N+1):
DFS(word+chr(97+i),N+1 if i==N else N)
n=int(input())
DFS("",0) | 0 | null | 52,810,128,090,048 | 199 | 198 |
S = int(input())
print("%d:%d:%d"%(S/3600,(S%3600)/60,S%60))
| import sys
N = int(input())
S = input()
if N % 2 == 1:
print('No')
sys.exit()
if S[:N//2] == S[N//2:]:
print('Yes')
sys.exit()
print('No') | 0 | null | 73,919,776,564,480 | 37 | 279 |
#!/usr/bin/env python3
import sys
MOD = 1000000007 # type: int
def solve(N: int, A: "List[int]"):
from functools import reduce
xyz_list = [[0]*3]
for a in A:
xyz_list.append(xyz_list[-1][:])
for i, v in enumerate(xyz_list[-1]):
if v == a:
xyz_list[-1][i] += 1
break
T = [xyz.count(a) for xyz, a in zip(xyz_list, A)]
return reduce(lambda a,b: a*b%MOD, T)
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
A = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
print(solve(N, A))
def test():
import doctest
doctest.testmod()
if __name__ == '__main__':
#test()
main()
| import sys
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(10 ** 9)
MOD = 10 ** 9 + 7
def main():
N = int(input())
A = list(map(int, input().split()))
RGB = [1, 0, 0]
ans = 1
if A[0] !=0:
print(0)
return
for i in range(1, N):
a = A[i]
if a == 0:
if 0 in RGB:
j = RGB.index(a)
RGB[j] += 1
else:
print(0)
return
elif a not in RGB:
print(0)
return
else:
k = RGB.count(a)
ans *= k
ans %= MOD
j = RGB.index(a)
RGB[j] += 1
z = RGB.count(0)
if z == 0:
ans *= 6
ans %= MOD
elif z == 1:
ans *= 6
ans %= MOD
else:
ans *= 3
ans %= MOD
print(ans)
if __name__ == "__main__":
main()
| 1 | 129,929,982,945,600 | null | 268 | 268 |
N,M,X = map(int,input().split())
A = [list(map(int,input().split())) for n in range(N)]
a = 10**9
for i in range(2**N):
S = (M+1)*[0]
for j in range(N):
if (i>>j)&1:
S = [S[k]+A[j][k] for k in range(M+1)]
if all([X<=s for s in S[1:]]):
a = min(a,S[0])
if a==10**9:
print(-1)
else:
print(a) | n, m, x = map(int, input().split())
ca = []
for _ in range(n):
ca.append(list(map(int, input().split())))
cost_max = 12 * (10 ** 5)
book_list = []
flag = 0
for i in range(2**n):
book_num = 0
book_list = []
if i == 0:
continue
for j in range(n):
if (i >> j) & 1:
book_list.append(ca[j])
book_num += 1
for j in range(m):
skill_revel = 0
for k in range(book_num):
skill_revel += book_list[k][j+1]
if skill_revel >= x:
if j == (m-1) and k == (book_num-1):
cost = 0
for l in range(book_num):
cost += book_list[l][0]
if cost <= cost_max:
flag = 1
cost_max = cost
continue
else:
break
if flag == 0:
print(-1)
else:
print(cost_max) | 1 | 22,278,326,940,028 | null | 149 | 149 |
from collections import deque
N = int(input())
A = list(map(int,input().split()))
Query = deque()
A.sort(reverse=True)
Query.append([A[0],A[1]])
Query.append([A[0],A[1]])
Answer = A[0]
for i in range(2,N):
query = Query.popleft()
Answer += min(query)
Query.append([max(query),A[i]])
Query.append([min(query),A[i]])
print(Answer) | n = int(input())
s = list(input())
a = []
for i in s:
num = ord(i)+n
if num > 90:
num -= 26
a.append(chr(num))
print(''.join(a)) | 0 | null | 71,944,578,256,370 | 111 | 271 |
N, K = map(int,input().split())
P = list(map(int,input().split()))
P.sort()
price = sum(P[:K])
print(price) | N = input()
K = int(input())
if len(N) < K:
print(0)
exit()
ans = [1, int(N[-1]), 0, 0];
def combination(N,K):
if N < K:
return 0
else:
p = 1
for k in range(K):
p *= N
N -= 1
for k in range(1, K+1):
p //= k
return p
for k in range(1, len(N)):
if int(N[-k-1]) > 0:
a = [1, 0, 0, 0]
for j in range(1, K+1):
a[j] += (9**(j))*combination(k, j)
a[j] += (int(N[-k-1])-1)*combination(k, j-1)*(9**(j-1)) + ans[j-1]
ans = a
print(ans[K]) | 0 | null | 43,687,938,406,800 | 120 | 224 |
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
import fileinput
import math
for line in fileinput.input():
a, b = map(int, line.split())
g = gcd(a, b)
lcm = a * b // g
print(g, lcm) | #coding: utf-8
import sys
def gojo(a,b):
if b % a == 0:
return a
else:
return gojo(b % a, a)
for line in sys.stdin:
l = map(int,line.split())
l.sort()
a = l[0]
b = l[1]
print gojo(a,b),a*b/gojo(a,b) | 1 | 628,316,160 | null | 5 | 5 |
A = []
for _ in range(12):
A.append([0]*10)
n = int(input())
for _ in range(n):
b, f, r, v = map(int, input().split())
A[3*b-(3-f)-1][r-1] += v
for i in range(12):
print(' ', end='')
print(' '.join(map(str, A[i])))
if i in [2, 5, 8]:
print('#'*20)
| N=int(input())
n500=N//500
n5=(N%500)//5
print(1000*n500+5*n5) | 0 | null | 21,835,825,415,000 | 55 | 185 |
import sys
import copy
def print_data(data):
last_index = len(data) - 1
for idx, item in enumerate(data):
print(item, end='')
if idx != last_index:
print(' ', end='')
print('')
def bubbleSort(data, N):
for i in range(N):
j = N -1
while j >= i+1:
if data[j][1] < data[j-1][1]:
hoge = data[j]
data[j] = data[j-1]
data[j-1] = hoge
j -= 1
return data
def selectSort(data, N):
for i in range(N):
mini = i
for j in range(i, N):
if data[j][1] < data[mini][1]:
mini = j
if i == mini:
pass
else:
hoge = data[mini]
data[mini] = data[i]
data[i] = hoge
return data
def isStable(inData, outData, N):
for i in range(N):
for j in range(i+1, N):
if inData[i][1] == inData[j][1]:
a = outData.index(inData[i])
b = outData.index(inData[j])
if a > b :
return False
return True
def main():
N = int(input())
data0 = list(input().split())
data1 = copy.deepcopy(data0)
data2 = copy.deepcopy(data0)
bubbleData = bubbleSort(data1, N)
selectData = selectSort(data2, N)
print_data(bubbleData)
if isStable(data0, bubbleData, N):
print('Stable')
else:
print('Not stable')
print_data(selectData)
if isStable(data0, selectData, N):
print('Stable')
else:
print('Not stable')
if __name__ == '__main__':
main()
| n = int(input())
deck = input().split()
bd = list(deck)
for i in range(n):
for j in reversed(range(i + 1, n)):
if bd[j][1] < bd[j - 1][1]:
bd[j], bd[j - 1] = bd[j - 1], bd[j]
print(' '.join(bd))
print('Stable')
sd = list(deck)
for i in range(n):
mi = i
for j in range(i, n):
if sd[j][1] < sd[mi][1]:
mi = j
sd[i], sd[mi] = sd[mi], sd[i]
print(' '.join(sd))
if (bd == sd):
print('Stable')
else:
print('Not stable')
| 1 | 26,899,783,808 | null | 16 | 16 |
s=list(input())
a=int(input())
w = ""
c = 0
cnt = 0
for i in s:
if w != i:
#print(w)
cnt += c//2
c = 1
w = i
else:
c +=1
cnt += c//2
#print(cnt)
start = 0
start_w = s[0]
for i in s:
if start_w != i:
break
else:
start +=1
s.reverse()
end = 0
end_w = s[0]
for i in s:
if end_w != i:
break
else:
end +=1
same = len(list(set(s)))
#print(same)
if s[0] != s[-1]:
print(cnt*a)
elif same ==1:
print(len(s)*a//2)
else:
print(cnt*a-(a-1)*(start//2+end//2-(start+end)//2)) | a = input().split()
x = []
y = []
z = []
a[0] = int(a[0])
a[1] = int(a[1])
a[2] = int(a[2])
for i in range(a[0]):
b = input().split()
x.append(b)
z.append([])
for i in range(a[1]):
b = input().split()
y.append(b)
for i in range(a[0]):
for j in range(a[2]):
z[i].append(0)
for i in range(a[0]):
for j in range(a[2]):
for k in range(a[1]):
z[i][j] += int(x[i][k])*int(y[k][j])
for i in range(len(z)):
for j in range(a[2]):
z[i][j] = str(z[i][j])
for i in z:
gam = " ".join(i)
print(gam)
| 0 | null | 88,721,925,857,840 | 296 | 60 |
import bisect
from itertools import accumulate
N, M = map(int, input().split())
A = sorted(map(int, input().split()))
S = [0] + list(accumulate(A))
def calc(x):
_total = 0
_num = 0
for i in range(N):
j = bisect.bisect_left(A, x - A[i])
_num += N - j
_total += S[N] - S[j]
_total += A[i] * (N - j)
return _total, _num
left = 0
right = 200005
while right - left > 1:
center = (left + right) // 2
if calc(center)[1] >= M:
left = center
else:
right = center
total, num = calc(left)
ans = total
ans -= (num - M) * left
print(ans)
| import sys
readline = sys.stdin.readline
N,M = map(int,readline().split())
A = list(map(int,readline().split()))
MAX_VAL = 10 ** 5 + 1
hand = [0] * MAX_VAL
for a in A:
hand[a] += 1
import numpy as np
def convolve(f, g):
fft_len = 1
while 2 * fft_len < len(f) + len(g) - 1:
fft_len *= 2
fft_len *= 2
Ff = np.fft.rfft(f, fft_len)
Fg = np.fft.rfft(g, fft_len)
Fh = Ff * Fg
h = np.fft.irfft(Fh, fft_len)
h = np.rint(h).astype(np.int64)
return h[:len(f) + len(g) - 1]
right_hand = np.array(hand, dtype = int)
left_hand = np.array(hand, dtype = int)
H = convolve(left_hand, right_hand)
# Hを大きいほうから見ていくと、
# 幸福度iの握手をH[i]種類できることが分かる
# 上から順に足していって、最後H[i]種類の握手を足せないときは、残りの握手回数だけ足す
ans = 0
for i in range(len(H) - 1, -1, -1):
if H[i] == 0:
continue
if H[i] <= M: # H[i]回の握手ができる
ans += i * H[i]
M -= H[i]
else: # H[i]回の握手ができないので、残った回数だけ握手する
ans += M * i
break
print(ans) | 1 | 107,746,318,848,832 | null | 252 | 252 |
import copy
def main():
h, o = map(int, input().split(' '))
if h <= o:
print('unsafe')
else:
print('safe')
main() | '''
Online Python Compiler.
Code, Compile, Run and Debug python program online.
Write your code in this editor and press "Run" button to execute it.
'''
ip=list(input())
sum=0
for i in ip:
sum+=int(i)
if sum%9==0:
print('Yes')
else:
print('No') | 0 | null | 16,853,542,390,312 | 163 | 87 |
S = str(input())
a = len(S)
print('x' * a) | n = input()
x = map(int, input().split())
y = map(int, input().split())
x_y = [abs(xi - yi) for xi, yi in zip(x, y)]
for p in range(1, 4):
print(sum(i ** p for i in x_y) ** (1 / p))
print(max(x_y)) | 0 | null | 36,733,717,881,532 | 221 | 32 |
# coding: utf-8
# Here your code !
import sys
n = [int(input()) for i in range (1,11)]
#t = [int(input()) for i in range(n)]
n.sort()
n.reverse()
for j in range (0,3):
print(n[j]) | S = int(input())
a = S//(60*60)
b = (S-(a*60*60))//60
c = S-(a*60*60 + b*60)
print(a, ':', b, ':', c, sep='')
| 0 | null | 171,068,730,752 | 2 | 37 |
import sys
if sys.platform =='ios':
sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def MAP(): return [int(s) for s in input().split()]
n,m=MAP()
a=MAP()
#dp[price]=num of coins?
dp=[float('inf') for _ in range(n+1)]
dp[0]=0
for i in range(n+1):
for j in a:
if i+j <= n:
dp[i+j]=min(dp[i]+1,dp[i+j])
print(dp[-1])
| X,Y = map(int, input().split())
ans = "No"
for turtle in range(X+1):
crain = X - turtle
if 2 * crain + 4 * turtle == Y:
ans = "Yes"
print(ans) | 0 | null | 6,882,165,770,108 | 28 | 127 |
X = int(input())
A = 100
for i in range(10**5):
A = A*101//100
if X <= A:
break
print(i+1) | N,K,S=map(int,input().split())
ans=[S]*K
if S==10**9:
ans.extend([S-1]*(N-K))
else:
ans.extend([S+1]*(N-K))
print(*ans) | 0 | null | 59,125,370,079,360 | 159 | 238 |
n = int(input())
A = list(map(int, input().split()))
A.sort()
l = [False]*(A[n-1] + 1)
fix = []
for i in A:
if l[i]:
fix.append(i)
l[i] = True
for i in range(A[n-1]+1):
if l[i]:
for j in range(i*2, A[n-1]+1, i):
l[j] = False
for i in fix:
l[i] = False
ans = [i for i in range(A[n-1] + 1) if l[i]]
print(len(ans))
| N = int(input())
A = list(map(int, input().split()))
A.sort()
MAX = 10**6+1
cnt = [0]*MAX
for x in A:
if cnt[x] != 0:
cnt[x] = 2
else:
for i in range(x, MAX, x):
cnt[i] += 1
ans = 0
for x in A:
# 2回以上通った数字 (cnt[x]>1) は，その数字より小さい約数が存在する (割り切れる他の数が存在する)。
if cnt[x] == 1:
ans += 1
print(ans) | 1 | 14,375,945,911,740 | null | 129 | 129 |
"""
keyword: ラジアン, 度
最大限傾けたとき、水と接している面は横から見ると台形ないし三角形となる
水と接している面の面積 x/a が a*b/2 より大きい場合は台形となり、それ以下の場合は三角形となる
・台形の場合
最大限傾けたとき、水と接している台形の上辺の長さをhとすると
(h+b)*a/2 = x/a
h = 2*x/(a**2) - b
求める角度をthetaとすると
tan(theta) = (b-h)/a
theta = arctan((b-h)/a)
・三角形の場合
最大限傾けたとき、水と接している三角形の底辺の長さをhとすると
h*b/2 = x/a
h = 2*x/(a*b)
求める角度をthetaとすると
tan(theta) = b/h
theta = arctan(b/h)
"""
import sys
sys.setrecursionlimit(10**6)
a,b,x = map(int, input().split())
import numpy as np
if x/a > a*b/2:
h = 2*x/(a**2) - b
theta = np.arctan2(b-h, a) # radian表記なので戻り値の範囲は[-pi/2, pi/2]
theta = np.rad2deg(theta)
else:
h = 2*x/(a*b)
theta = np.arctan2(b, h)
theta = np.rad2deg(theta)
print(theta) | x = input()
window = int(x.split()[0])
b = int(x.split()[1])
curtain = b * 2
if window > curtain:
print(window - curtain)
else:
print('0') | 0 | null | 165,213,278,340,678 | 289 | 291 |
def answer(n: int, k: int) -> int:
digits = 0
while 0 < n:
n //= k
digits += 1
return digits
def main():
n, k = map(int, input().split())
print(answer(n, k))
if __name__ == '__main__':
main() | N,K = map(int,input().split())
ans=1
p=K
while p <= N:
p *= K
ans+=1
print(ans) | 1 | 64,105,908,537,060 | null | 212 | 212 |
A, B = map(int, input().split())
if A>=10 or B>=10:
print('-1')
exit()
else:
print(A*B) | N, M = map(int, input().split())
if M == 0:
print(1)
exit()
group_list = []
group_index = [0] * N
for _ in range(M):
a, b = map(int, input().split())
if group_index[a-1] == 0 and group_index[b-1] == 0:
group_index[a-1] = len(group_list) + 1
group_index[b-1] = len(group_list) + 1
group_list.append(set([a, b]))
elif group_index[a-1] == 0:
group_index[a-1] = group_index[b-1]
group_list[group_index[b-1] - 1].add(a)
elif group_index[b-1] == 0:
group_index[b-1] = group_index[a-1]
group_list[group_index[a-1] - 1].add(b)
elif group_index[a-1] != group_index[b-1]:
if len(group_list[group_index[a-1] - 1]) > len(group_list[group_index[b-1] - 1]):
group_id_b = group_index[b-1] - 1
for p in group_list[group_id_b]:
group_index[p-1] = group_index[a-1]
group_list[group_index[a-1] - 1].add(p)
group_list[group_id_b] = set()
else:
group_id_a = group_index[a-1] - 1
for p in group_list[group_id_a]:
group_index[p-1] = group_index[b-1]
group_list[group_index[b-1] - 1].add(p)
group_list[group_id_a] = set()
print(max([len(g) for g in group_list])) | 0 | null | 81,181,223,030,382 | 286 | 84 |
N = input()
check = False
for i in range(3):
if N[i] == "7":
check = True
print("Yes" if check else "No") | print('Yes' if '7' in input() else 'No')
| 1 | 34,153,830,443,632 | null | 172 | 172 |
length = int(input())
targ = [int(n) for n in input().split(' ')]
swap = 0
for l in range(length):
for m in range(l):
if targ[l - m] < targ[l - m - 1]:
disp = targ[l-m -1]
targ[l-m-1] = targ[l-m]
targ[l-m] = disp
swap += 1
print(" ".join([str(n) for n in targ]))
print(swap) | MAX_ARRAY_SIZE = 100000
class Queue:
array = [None] * MAX_ARRAY_SIZE
start = end = 0
def enqueue(self, a):
assert not self.isFull(), "オーバーフローが発生しました。"
self.array[self.end] = a
if self.end + 1 == MAX_ARRAY_SIZE:
self.end = 0
else:
self.end += 1
def dequeue(self):
assert not self.isEmpty(), "アンダーフローが発生しました。"
if (self.start + 1) == MAX_ARRAY_SIZE:
self.start = 0
return self.array[MAX_ARRAY_SIZE - 1]
else:
self.start += 1
return self.array[self.start - 1]
def isEmpty(self):
return self.start == self.end
def isFull(self):
return self.start == (self.end + 1) % MAX_ARRAY_SIZE
n, q = list(map(lambda x: int(x), input().strip().split()))
queue = Queue()
for i in range(n):
queue.enqueue(input().strip().split())
sum_time = 0
while not queue.isEmpty():
name, time = queue.dequeue()
if int(time) <= q:
sum_time += int(time)
print(name + ' ' + str(sum_time))
else:
queue.enqueue([name, str(int(time) - q)])
sum_time += q
| 0 | null | 29,911,612,850 | 14 | 19 |
n, m = map(int,input().split())
A = list(map(int,input().split()))
sum = 0
count = 0
for a in A:
sum += a
for a in A:
if a >= sum/(4*m):
count += 1
if count >= m:
print('Yes')
else:
print('No') | # 158 A
S = input()
print('No') if S == 'AAA' or S == 'BBB' else print('Yes') | 0 | null | 46,731,106,775,638 | 179 | 201 |
n = int(input())
t_point = h_point = 0
for i in range(n):
t_card,h_card = [x for x in input().split( )]
if t_card > h_card:
t_point += 3
elif t_card < h_card:
h_point += 3
else:
t_point += 1
h_point += 1
print(t_point,h_point)
| import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect
#from operator import itemgetter
#from heapq import heappush, heappop
#import numpy as np
#from scipy.sparse.csgraph import breadth_first_order, depth_first_order, shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
#from scipy.sparse import csr_matrix
#from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
import sys
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
stdin = sys.stdin
ni = lambda: int(ns())
nf = lambda: float(ns())
na = lambda: list(map(int, stdin.readline().split()))
nb = lambda: list(map(float, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
X, N = na()
p = na()
kouho = []
for i in range(-100, 200):
if i in p:
continue
kouho.append((abs(X - i), i))
print(min(kouho)[1]) | 0 | null | 7,993,643,063,210 | 67 | 128 |
import sys
from collections import defaultdict
def solve():
input = sys.stdin.readline
N = int(input())
sDict = defaultdict(int)
maxCount = 0
for i in range(N):
s = input().strip("\n")
sDict[s] += 1
maxCount = max(maxCount, sDict[s])
maxS = []
for key in sDict:
if sDict[key] == maxCount:
maxS.append(key)
maxS.sort()
print(*maxS, sep="\n")
return 0
if __name__ == "__main__":
solve() | n = int(input())
dic = {}
ma = 1
for i in range(n):
wo = input()
if(wo in dic):
dic[wo] += 1
if(dic[wo] > ma):
ma = dic[wo]
else:
dic.update({wo:1})
ans = []
for i in dic.keys():
if(dic[i] == ma):
ans.append(i)
ans.sort()
for j in ans:
print(j)
| 1 | 69,845,088,613,146 | null | 218 | 218 |
S = str(input())
if S == 'hi' or S == 'hihi' or S == 'hihihi' or S == 'hihihihi' or S == 'hihihihihi':
print ('Yes')
else:
print ('No')
| # -*- coding:utf-8 -*-
def solve():
from collections import deque
N = int(input())
Us = [[] for _ in range(N)]
for i in range(N):
_in = list(map(int, input().split()))
if len(_in) == 2:
continue
u, k, Vs = _in[0], _in[1], _in[2:]
Vs.sort()
for v in Vs:
Us[u-1].append(v-1)
Us[u-1] = deque(Us[u-1])
find = [0 for _ in range(N)] # 発見時刻
terminated = [0 for _ in range(N)] # 終了時刻
tim = [0] # 経過時間
def dfs(now):
while Us[now]:
nxt = Us[now].popleft()
if find[nxt] != 0:
continue
tim[0] += 1
find[nxt] = tim[0]
dfs(nxt)
if terminated[now] == 0:
tim[0] += 1
terminated[now] = tim[0]
for i in range(N):
if find[i] == 0:
tim[0] += 1
find[i] = tim[0]
dfs(i)
for i in range(N):
print(i+1, find[i], terminated[i])
if __name__ == "__main__":
solve()
| 0 | null | 26,603,904,949,478 | 199 | 8 |
# coding: utf-8
import sys
from collections import deque
n, q = map(int, input().split())
total_time = 0
tasks = deque(map(lambda x: x.split(), sys.stdin.readlines()))
try:
while True:
t = tasks.popleft()
if int(t[1]) - q <= 0:
total_time += int(t[1])
print(t[0], total_time)
else:
t[1] = str(int(t[1]) - q)
total_time += q
tasks.append(t)
except Exception:
pass | n,q = map(int,input().split())
queue = []
for i in range(n):
p,t = map(str,(input().split()))
t = int(t)
queue.append([p,t])
total_time = 0
while len(queue) > 0:
x = queue.pop(0)
if x[1] > q :
total_time += q
x[1] -= q
queue.append(x)
else:
total_time += x[1]
print(x[0],total_time) | 1 | 40,385,341,262 | null | 19 | 19 |
from math import gcd
def main():
ans = 0
k = int(input())
for i in range(1,1+k):
for j in range(1,1+k):
for l in range(1,1+k):
ans += gcd(i,gcd(j,l))
print(ans)
if __name__ == "__main__":
main() | '''
自宅用PCでの解答
'''
import math
#import numpy as np
import itertools
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
mod = 10**9+7
# mod = 998244353
dir = [(-1,0),(0,-1),(1,0),(0,1)]
alp = "abcdefghijklmnopqrstuvwxyz"
INF = 1<<32-1
# INF = 10**18
def main():
ans = 0
n = input()
dp = [0,1] #0,1多く入れる
for i in n:
ni = int(i)
pdp = dp*1
dp[0] = min(pdp[0]+ni,pdp[1]+(10-ni))
dp[1] = min(pdp[0]+ni+1,pdp[1]+(10-ni-1))
print(dp[0])
return None
if __name__ == '__main__':
main()
| 0 | null | 53,109,141,129,480 | 174 | 219 |
from collections import deque
H, W = map(int, input().split())
L = [str(input()) for _ in range(H)]
ans = 0
for h in range(H):
for w in range(W):
if L[h][w] == '#':
continue
else:
flag = [[-1] * W for _ in range(H)]
depth = [[0] * W for _ in range(H)]
flag[h][w] = 0
q = deque([(h, w)])
while q:
i, j = q.popleft()
d = depth[i][j]
if i != H - 1:
if L[i+1][j] == '.' and flag[i+1][j] < 0:
flag[i+1][j] = 0
depth[i+1][j] = d + 1
q.append((i+1, j))
if i != 0:
if L[i-1][j] == '.' and flag[i-1][j] < 0:
flag[i-1][j] = 0
depth[i-1][j] = d + 1
q.append((i-1, j))
if j != W - 1:
if L[i][j+1] == '.' and flag[i][j+1] < 0:
flag[i][j+1] = 0
depth[i][j+1] = d + 1
q.append((i, j+1))
if j != 0:
if L[i][j-1] == '.' and flag[i][j-1] < 0:
flag[i][j-1] = 0
depth[i][j-1] = d + 1
q.append((i, j-1))
ans = max(ans, d)
print(ans)
| from collections import deque
def input_bordered_grid(h, w, wall):
grid = [wall * (w + 2)]
for _ in range(1, h+1):
grid.append(wall + input() + wall)
grid.append(wall * (w + 2))
return grid
h, w = map(int, input().split())
grid = input_bordered_grid(h, w, '#')
move = [(-1, 0), (1, 0), (0, -1), (0, 1)]
longest = 0
for sy in range(1, h+1):
for sx in range(1, w+1):
if grid[sy][sx] == '#':
continue
dist = [[-1] * (w+2) for _ in range(h+2)]
dist[sy][sx] = 0
q = deque()
q.append((sy, sx))
while q:
y, x = q.popleft()
longest = max(longest, dist[y][x])
for dy, dx in move:
yy = y + dy
xx = x + dx
if dist[yy][xx] == -1 and grid[yy][xx] == '.':
q.append((yy, xx))
dist[yy][xx] = dist[y][x] + 1
print(longest)
| 1 | 94,275,907,473,398 | null | 241 | 241 |
import math, itertools
n = int(input())
X = list(list(map(int,input().split())) for _ in range(n))
L = list(itertools.permutations(range(n),n))
ans = 0
for l in L:
dist = 0
for i in range(n-1):
s,t = l[i],l[i+1]
vx = X[s][0] - X[t][0]
vy = X[s][1] - X[t][1]
dist += math.sqrt(vx**2 + vy**2)
ans += dist
print(ans/len(L)) | import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
n = I()
lst = [None, ]
for _ in range(n):
x, y = LI()
lst.append((x,y))
per = itertools.permutations(range(1,n+1))
sm = 0
oc = math.factorial(n)
for p in per:
dist = 0
before = p[0]
for place in p[1:]:
dist += math.sqrt((lst[place][0]-lst[before][0])**2 + (lst[place][1]-lst[before][1])**2)
before = place
sm += dist
ans = sm/oc
print(ans)
main()
| 1 | 148,488,586,703,152 | null | 280 | 280 |
s=input()
l=len(s)
x=0
for i in range(l):
x=x+int(s[i])
if x%9==0:
print("Yes")
else:
print("No") | print('No' if sum(map(int, input())) % 9 else 'Yes') | 1 | 4,379,909,379,380 | null | 87 | 87 |
x = int(input())
balance = 100
years = 0
while True:
years += 1
balance += balance // 100
if balance >= x:
print(years)
exit(0) | k, x = map(int, input().split())
if x <= k * 500: print('Yes')
else: print('No') | 0 | null | 62,386,258,959,982 | 159 | 244 |
N=int(input())
A=list(map(int,input().split()))
A1=set(A)
ans="NO"
if len(A)==len(A1):
ans="YES"
print(ans) | a,b = input().split()
ans = sorted( [a*int(b),b*int(a)] )[0]
print(ans) | 0 | null | 79,033,579,302,844 | 222 | 232 |
n = int(input())
print(-(-n//2)) | N = int(input())
A = N / 2
A = int(A)
B = (N + 1) / 2
B = int(B)
if N % 2 == 0:
print(A)
else:
print(B)
| 1 | 59,193,705,429,160 | null | 206 | 206 |
from math import floor, ceil
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse=True)
l = 0
r = max(a)
while r - l > 1:
c = (l+r)//2
cnt = 0
for i in a:
cnt += max(ceil(i/c) - 1, 0)
if cnt <= k:
r = c
else:
l = c
print(r) | n, k = map(int, input().split())
a = list(map(int, input().split()))
l = 0
r = max(a)
while r - l > 1:
cnt = 0
mid = (r + l) // 2
for i in range(n):
d = (a[i] // mid) + (a[i] % mid != 0) - 1
cnt += d
if cnt <= k: r = mid
else: l = mid
print(r) | 1 | 6,512,620,348,940 | null | 99 | 99 |
S = int(input())
h = int(S/3600)
m = int((S- h*3600)/60)
sec = S- h*3600-m*60;
print(str(h)+":"+str(m)+":"+str(sec))
| T1, T2 = [int(i) for i in input().split()]
A1, A2 = [int(i) for i in input().split()]
B1, B2 = [int(i) for i in input().split()]
d1 = T1*(A1-B1)
d2 = T2*(B2-A2)
if d1 == d2:
print('infinity')
if d1 * (d2 - d1) < 0:
print(0)
if d1 * (d2 - d1) > 0:
if d1 % (d2 - d1) != 0:
print(d1 // (d2 - d1) * 2+ 1)
else:
print(d1 // (d2 - d1) * 2) | 0 | null | 66,196,991,582,622 | 37 | 269 |
N = int(input())
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
ans = 0
s = sum(A)
for a in A:
s -= a
ans += s * a
ans %= MOD
print(ans) | n = int(input())
s = input()
[print(chr((ord(s[i])+n-65)%26+65),end="") for i in range(len(s))]
| 0 | null | 69,191,680,354,290 | 83 | 271 |
def main():
import math
n,k = map(int,input().split())
a = list(map(int,input().split()))
def f(a,l):
ans = 0
for i in range(len(a)):
ans += math.ceil(a[i]/l)-1
return ans
l,r = 1,max(a)
while r-l>1:
mid = (l+r)//2
g = f(a,mid)
if g>k:
l = mid+1
else:
r = mid
if f(a,l)<=k:
print(l)
else:
print(r)
if __name__ == "__main__":
main()
| import heapq
import math
def solve():
N, K = map(int, input().split())
A = sorted(map(int, input().split()), reverse=True)
l = 0
r = A[0]
# (l, r]
#print(A)
#print("K=",K)
while r - l> 1:
m = (r + l) // 2
cuts = 0
for a in A:
cuts += (a-1) // m
#print(l, m,r, cuts)
if cuts <= K:
r = m
else:
l = m
print(r)
solve() | 1 | 6,539,119,231,360 | null | 99 | 99 |
kx=input().rstrip().split(" ")
k=int(kx[0])
x=int(kx[1])
if 500*k>=x:
print("Yes")
else:
print("No") | import sys
sys.setrecursionlimit(1000000)
input = lambda: sys.stdin.readline().rstrip()
K, X = map(int, input().split())
if K * 500 >= X:
print("Yes")
else:
print("No") | 1 | 98,313,698,049,728 | null | 244 | 244 |
n = int(input())
a = [int(x) for x in input().split()]
result = 0
for i in range(n):
for j in range(i + 1, n):
for k in range(j +1 , n):
if a[i] != a[j] and a[i] != a[k] and a[j] != a[k]:
if a[i] + a[j] > a[k] and a[i] + a[k] > a[j] and a[j] + a[k] > a[i]:
result += 1
print(result) | def solve(n,m,c):
INF=50001
dp=[INF]*(n+1)
dp[0]=0
for i in range(m):
v=c[i]
for j in range(v,n+1):
if dp[j-v]!=INF:
dp[j]=min(dp[j-v]+1,dp[j])
return dp[n]
n,m=map(int,input().split())
c=tuple(map(int,input().split()))
print(solve(n,m,c))
| 0 | null | 2,598,276,276,960 | 91 | 28 |
from itertools import combinations
N = int(input())
P = [tuple(map(int,input().split())) for _ in range(N)]
total = sum(((x0-x1)**2+(y0-y1)**2)**(1/2) for (x0,y0),(x1,y1) in combinations(P,2))
print(2*total/N)
| import math
x = int(input())
money = 100
count = 0
while money <= x:
if x == money:
break
money = money + money // 100
count += 1
print(count) | 0 | null | 87,498,798,108,988 | 280 | 159 |
n=input()
c=[]
A=[]
for i in ['S ','H ','C ','D ']:
for j in map(str,range(1,14)):
A.append(i+j)
for i in range(n):
A.remove(raw_input())
for i in range(len(A)):
print A[i] | r = float(input())
x = float(r*r*3.141592653589)
y = float(2*r*3.141592653589)
print(x,y)
| 0 | null | 829,652,601,700 | 54 | 46 |
i=1
while i<=9:
j=1
while j<=9:
print '%d%s%d%s%d'%(i,"x",j,"=",i*j)
j=j+1
i=i+1 | import sys
N, K = map(int, sys.stdin.readline().rstrip().split())
P = [int(x) for x in sys.stdin.readline().rstrip().split()]
# 目が 1 ... p のときの期待値
def kitaichi(p):
return (p + 1) / 2
goukei = 0
for i in range(K):
goukei += kitaichi(P[i])
gmax = goukei
for i in range(N - K):
goukei = goukei + kitaichi(P[K + i]) - kitaichi(P[i]) # 次の区間の合計
gmax = max(goukei, gmax)
print(gmax)
| 0 | null | 37,279,787,721,342 | 1 | 223 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random,resource
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)
def main():
n = I()
s = S()
m = {}
m[0] = 0
def f(i):
if i in m:
return m[i]
c = 0
ii = i
while ii > 0:
c += ii % 2
ii //= 2
t = i % c
m[i] = f(t) + 1
return m[i]
c = len([_ for _ in s if _ == '1'])
t = int(s, 2)
cm = (c+1) * c * (c-1)
if c > 1:
t %= cm
r = []
k = 1
for i in range(n-1,-1,-1):
if t == k:
r.append(0)
elif s[i] == '1':
r.append(f((t - k) % (c-1)) + 1)
else:
r.append(f((t + k) % (c+1)) + 1)
k *= 2
if c > 1:
k %= cm
return JA(r[::-1], "\n")
print(main())
| def f(n):
ans=1
while n!=0:
ans+=1
n%=bin(n).count("1")
return ans
n=int(input())
x=input()
o=x.count("1")
if o==0:exit(print(*[1]*n))
if o==1:
if x[-1]=="1":
ans=[2]*n
ans[-1]=0
else:
ans=[1]*n
ans[-1]=2
ans[x.index("1")]=0
exit(print(*ans))
mo=0
mz=0
for i in range(n):
if x[n-i-1]=="1":
mo=(pow(2,i,o+1)+mo)%(o+1)
mz=(pow(2,i,o-1)+mz)%(o-1)
for i in range(n):
if x[i]=="1":
m=(mz-pow(2,n-i-1,o-1))%(o-1)
else:
m=(mo+pow(2,n-i-1,o+1))%(o+1)
print(f(m)) | 1 | 8,133,808,854,980 | null | 107 | 107 |
import math
x=int(input())
ans=0
for i in range (1,x+1):
for j in range(1,x+1):
chk=math.gcd(i,j)
for k in range (1,x+1):
ans=ans+math.gcd(chk,k)
print(ans) | import sys
from itertools import accumulate
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
import bisect
n,m=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
def hand(x):
cnt=0
for i in range(n):
k=n-bisect.bisect_left(A,x-A[-i-1])
if k==0:
break
cnt+=k
if cnt>=m:
break
return cnt
def main():
l=0
h=2*10**5+1
mid=(l+h)//2
while l+1<h:
mid=(l+h)//2
if hand(mid)<m:
h=mid
else:
l=mid
B = list(accumulate(A[::-1]))[::-1]
ans=0
cnt=0
for i in range(n):
index=bisect.bisect_left(A,l-A[-i-1]+1)
if n==index:
break
else:
ans+=(n-index)*A[-i-1]+B[index]
cnt+=(n-index)
ans+=(m-cnt)*l
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 71,468,081,761,160 | 174 | 252 |
f = raw_input().split(" ")
stack = []
for i in f:
if i.isdigit():
stack.append(int(i))
else:
y = stack.pop()
x = stack.pop()
if i == "+":
stack.append(x+y)
if i == "-":
stack.append(x-y)
if i == "*":
stack.append(x*y)
print stack.pop() | [N, K] = list(map(int, input().split()))
P = list(map(int, input().split()))
P.sort(reverse=True)
total = 0
for i in range(K):
total += P.pop()
print (total)
| 0 | null | 5,763,313,160,604 | 18 | 120 |
n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
asum=[0]
bsum=[0]
for i in range(n):
asum.append(asum[-1]+a[i])
for i in range(m):
bsum.append(bsum[-1]+b[i])
ans=0
for i in range(n+1):
if asum[i]>k:
break
while asum[i]+bsum[m]>k and m>0:
m-=1
ans=max(ans,i+m)
print(ans) | def divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n%i == 0:
divisors.append(i)
if i != n//i:
divisors.append(n//i)
return sorted(divisors)
N = int(input())
ans = len(divisors(N-1)) -1
for k in divisors(N)[1:]:
N_ = N
while N_ % k == 0:
N_ = N_//k
if N_ % k == 1:
ans += 1
print(ans)
| 0 | null | 26,049,110,681,328 | 117 | 183 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n, *a = map(int, read().split())
a.sort()
a = tuple(a)
TorF = [0] * (a[-1] + 1)
for ae in a:
TorF[ae] = 1
for i1 in range(n - 1):
a1 = a[i1]
if TorF[a1]:
m = a[-1] // a1 + 1
for i2 in range(2, m):
TorF[a1 * i2] = 0
if a[i1 + 1] == a[i1]:
TorF[a[i1]] = 0
r = sum(TorF)
print(r)
if __name__ == '__main__':
main() | from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))
from collections import Counter
n=int(input())
l=lnii()
def eratosthenes(lim):
num=[1 for i in range(lim)]
for i in set(l):
if num[i]:
for j in range(i+i,lim,i):
num[j]=0
return num
lim=10**6+5
num=eratosthenes(lim)
count=Counter(l)
ans=0
for i in l:
if num[i]==1 and count[i]==1:
ans+=1
print(ans) | 1 | 14,361,473,359,390 | null | 129 | 129 |
S=input()
if S[-1]=='s':
Ans=S+'es'
else:
Ans=S+'s'
print(Ans) | S = input()
ss = S[::-1]
if ss[0]=='s':
S += 'es'
else:
S += 's'
print(S)
| 1 | 2,350,822,814,578 | null | 71 | 71 |
import collections
N = int(input())
A = []
for i in range(N):
A.append(input())
dic = collections.Counter(A)
print(len(dic.keys())) | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from fractions import Fraction
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations, accumulate
from operator import add, mul, sub, itemgetter, attrgetter
import sys
sys.setrecursionlimit(10**6)
# readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
INF = 1 << 60
def read_int():
return int(readline())
def read_int_n():
return list(map(int, readline().split()))
def read_float():
return float(readline())
def read_float_n():
return list(map(float, readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def ep(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.perf_counter()
ret = f(*args, **kwargs)
e = time.perf_counter()
ep(e - s, 'sec')
return ret
return wrap
MOD = 998244353
class ModInt:
def __init__(self, x=0):
self.x = x % MOD
def __str__(self):
return str(self.x)
__repr__ = __str__
def __add__(self, other):
return (
ModInt(self.x + other.x) if isinstance(other, ModInt) else
ModInt(self.x + other)
)
def __sub__(self, other):
return (
ModInt(self.x - other.x) if isinstance(other, ModInt) else
ModInt(self.x - other)
)
def __mul__(self, other):
return (
ModInt(self.x * other.x) if isinstance(other, ModInt) else
ModInt(self.x * other)
)
def __truediv__(self, other):
return (
ModInt(self.x * pow(other.x, MOD - 2)) if isinstance(other, ModInt) else
ModInt(self.x * pow(other, MOD - 2))
)
def __pow__(self, other):
return (
ModInt(pow(self.x, other.x)) if isinstance(other, ModInt) else
ModInt(pow(self.x, other))
)
__radd__ = __add__
def __rsub__(self, other):
return (
ModInt(other.x - self.x) if isinstance(other, ModInt) else
ModInt(other - self.x)
)
__rmul__ = __mul__
def __rtruediv__(self, other):
return (
ModInt(other.x * pow(self.x, MOD - 2)) if isinstance(other, ModInt) else
ModInt(other * pow(self.x, MOD - 2))
)
def __rpow__(self, other):
return (
ModInt(pow(other.x, self.x)) if isinstance(other, ModInt) else
ModInt(pow(other, self.x))
)
@mt
def slv(N, K, LR):
memo = [ModInt(0)] * (N+2)
memo[1] = 1
memo[1+1] = -1
for i in range(1, N+1):
memo[i] += memo[i-1]
for l, r in LR:
ll = min(N+1, i+l)
rr = min(N+1, i+r+1)
memo[ll] += memo[i]
memo[rr] -= memo[i]
return memo[N]
def main():
N, K = read_int_n()
LR = [read_int_n() for _ in range(K)]
print(slv(N, K, LR))
if __name__ == '__main__':
main()
| 0 | null | 16,542,875,309,818 | 165 | 74 |
while True:
x, y = map(int, input().split())
if x == 0 and y == 0:
break
if x > y:
z = x
x = y
y = z
print(x, y)
| def insertionSort(A, N):
for i in range(N):
v = A[i]
j = i - 1
while j >= 0 and A[j] > v:
A[j + 1] = A[j]
j -= 1
A[j + 1] = v
B = A.copy()
for t in range(N):
B[t] = str(B[t])
print(" ".join(B))
n = int(input())
a = list(map(int, input().split()))
insertionSort(a, n)
| 0 | null | 255,698,923,792 | 43 | 10 |
import math
K = int(input())
ans = 0
for i in range(K):
for t in range(K):
for j in range(K):
gcd1 = math.gcd(i+1,t+1)
gcd2 = math.gcd(gcd1,j+1)
ans += gcd2
print(ans) | #!/usr/bin/env python3
from functools import reduce
from itertools import combinations
from math import gcd
K = int(input())
sum = K * (K + 1) // 2
for i in combinations(range(1, K + 1), 2):
sum += 6 * reduce(gcd, i)
for i in combinations(range(1, K + 1), 3):
sum += 6 * reduce(gcd, i)
print(sum)
| 1 | 35,484,049,236,490 | null | 174 | 174 |
import sys
def solve(h):
if h == 1:
return 1
else:
return 1 + 2 * solve(h // 2)
def main():
input = sys.stdin.buffer.readline
h = int(input())
print(solve(h))
if __name__ == "__main__":
main()
| N = int(input())
A_list = [0]*N
B_list = [0]*N
for i in range(N):
A_list[i],B_list[i] = map(int,input().split())
A_list.sort()
B_list.sort()
if N%2 == 1:
print(B_list[(N-1)//2] - A_list[(N-1)//2] + 1)
else:
big = (B_list[N//2] + B_list[N//2-1])/2
small = (A_list[N//2] + A_list[N//2-1])/2
print(int((big-small)*2 + 1)) | 0 | null | 48,509,278,981,100 | 228 | 137 |
N = int(input())
A = [int(a) for a in input().split()]
xor = 0
for x in A:
xor ^= x
for v in A:
print(xor^v, end=' ') | h,w,k=map(int,input().split())
def split(word):
return [char for char in word]
m=[]
for i in range(h):
m.append(input())
t=[0]*(h-1)
ans=w-1+h-1
for i in range(2**(h-1)):
failflag=0
s=split("{0:b}".format(i))
s.reverse()
for j in range(h-1-len(s)):
s.append('0')
s.reverse()
a=[]
a.append([])
for j in range(w):
a[0].append(int(m[0][j]))
for j in range(1,h):
if s[j-1]=='0':
for l in range(w):
a[-1][l]+=int(m[j][l])
else:
a.append([])
for l in range(w):
a[-1].append(int(m[j][l]))
n=len(a)
tmp=0
p=[0]*n
flag=0
for j in range(w):
for l in range(n):
if a[l][j]>k:
failflag=1
if p[l]+a[l][j]>k:
flag=1
break
if flag==1:
tmp+=1
flag=0
for t in range(n):
p[t]=0
for l in range(n):
p[l]+=a[l][j]
if failflag==0 and n-1+tmp<ans:
ans=n-1+tmp
print(ans) | 0 | null | 30,400,451,521,604 | 123 | 193 |
N, S = map(int, input().split())
A = list(map(int, input().split()))
mod = 998244353
L = [[0 for i in range(S+1)] for j in range(N+1)]
L[0][0] = 1
for j, a in enumerate(A):
for i in range(S+1):
if i < a:
L[j+1][i] = (2 * L[j][i]) % mod
else:
L[j+1][i] = (2 * L[j][i] + L[j][i-a]) % mod
print(L[N][S]) | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()
n,s = na()
a = na()
mod = 998244353
dp = [0]*(s+1)
dp[0] = 1
for i in range(n):
pd = [0]*(s+1)
for j in range(s+1):
if j+a[i] <= s:
pd[j+a[i]] += dp[j]
pd[j] += dp[j]*2%mod
dp = pd
print(dp[s]%mod) | 1 | 17,819,336,440,060 | null | 138 | 138 |
import sys
def input(): return sys.stdin.readline().rstrip()
N = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(N):
s = input()
if s == "AC":
ac += 1
elif s == "WA":
wa += 1
elif s == "TLE":
tle += 1
else:
re += 1
print("AC x " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE x " + str(re))
| import math
n = int(input())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
d=0
for i in range(n):
d += max(x[i],y[i])-min(x[i],y[i])
print(float(d))
d=0
for i in range(n):
d+=(x[i]-y[i])**2
print(math.sqrt(d))
d=0
for i in range(n):
d+=(max(x[i],y[i])-min(x[i],y[i]))**3
print(math.pow(d,1/3))
d=[]
for i in range(n):
d.append(max(x[i],y[i])-min(x[i],y[i]))
print(float(max(d)))
| 0 | null | 4,498,567,730,198 | 109 | 32 |
N = int(input())
i = input().split()
S = i[0]
T = i[1]
ans=S
for i in range(N):
print(S[i], end='')
print(T[i], end='') | x = input().split()
i = list(map(int,x))
a = i[0]
b = i[1]
if a > b:
print('a > b')
elif a == b:
print('a == b')
else:
print('a < b') | 0 | null | 56,084,984,333,060 | 255 | 38 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def s(): return input()
def cuts(H):
for i in range(1<<H):
yield bin(i)[2:].zfill(H)
def main():
H, W, K = LI()
S = []
for _ in range(H):
S.append(s())
ans = inf
for cut in cuts(H-1):
p = sum([1 for x in cut if x == '1'])
cnt = p
lines = [[0 for _ in range(W)] for __ in range(p+1)]
cumr = 0
for c in range(W):
n_line = 0
for r in range(H):
if S[r][c] == '1':
cumr += 1
if r >= H-1:
continue
if cut[r] == '1':
lines[n_line][c] += cumr
n_line += 1
cumr = 0
lines[-1][c] = cumr
cumr = 0
ng = False
cumsum = [[0 for _ in range(W+1)] for __ in range(p+1)]
for i in range(p+1):
line = lines[i]
for j in range(W):
cumsum[i][j+1] = line[j] + cumsum[i][j]
before = 0
for j in range(1, W+1):
# import pdb
# pdb.set_trace()
for i in range(p+1):
if ng:
break
if cumsum[i][j] - cumsum[i][before] > K:
if j - before == 1:
ng = True
cnt += 1
before = j - 1
break
if ng:
continue
ans = min(ans, cnt)
print(ans)
main()
| # coding: utf-8
import sys
import math
import collections
import itertools
import bisect
INF = 10 ** 13
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def lcm(x, y) : return (x * y) // math.gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def LS() : return input().split()
def RS(N) : return [input() for _ in range(N)]
def LRS(N) : return [input().split() for _ in range(N)]
def PL(L) : print(*L, sep="\n")
def YesNo(B) : print("Yes" if B else "No")
def YESNO(B) : print("YES" if B else "NO")
def check(j):
global cur
for i in range(g):
cur[i] += c[i][j]
flag = True
for curr in cur:
if curr > K:
flag = False
return flag
H, W, K = LI()
S = RS(H)
ans = INF
N = H-1
for bit in range(1 << N):
g = 0
id = [0] * H
for i in range(H):
id[i] = g
if (bit >> i) & 1:
g += 1
g += 1
c = [[0] * W for _ in range(g)]
for i in range(H):
for j in range(W):
c[id[i]][j] += int(S[i][j])
num = g-1
cur = [0] * g
for i in range(W):
if not check(i):
num += 1
cur = [0] * g
if not check(i):
num = INF
break
ans = min(ans, num)
print(ans)
| 1 | 48,664,560,468,470 | null | 193 | 193 |
from collections import Counter
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N = int(input())
edge = [[] for _ in range(N + 1)]
for i in range(N - 1):
x, y = map(int, input().split())
edge[x].append((y, i))
edge[y].append((x, i))
color = [-1] * (N - 1)
def dfs(s, p=-1, pc=-1):
c = 0
for t, x in edge[s]:
if color[x] != -1:
continue
if t == p:
continue
c += 1
if c == pc:
c += 1
color[x] = c
dfs(t, s, c)
dfs(1)
print(len(Counter(color)))
print(*color, sep="\n") | S,W = list(map(int,input().split()))
if W >= S:print('unsafe')
else: print('safe') | 0 | null | 82,896,060,867,410 | 272 | 163 |
while 1:
tmp = map(int, raw_input().split())
if tmp[0] == tmp[1] == 0:
break
else:
print " ".join(map(str, sorted(tmp)))
| N = int(input())
A = list(map(int,input().split()))
number_list = [0]*1000010
for a in A:
number_list[a] += 1
flag1 = True
flag2 = True
for i in range(2,1000001):
count = 0
for j in range(1,1000001):
if i*j > 1000000:
break
tmp = i*j
count += number_list[tmp]
if count > 1:
flag1 = False
if count == N:
flag2 = False
if flag2 == False and flag1 == False:
print("not coprime")
elif flag2 == True and flag1 == False:
print("setwise coprime")
else:
print("pairwise coprime") | 0 | null | 2,308,135,823,520 | 43 | 85 |
S = input()
a = ['x']*len(S)
print(''.join(a)) | #!/usr/bin/env python3
import sys
def solve(S: str):
print(S[0:3])
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
S = next(tokens) # type: str
solve(S)
if __name__ == '__main__':
main()
| 0 | null | 43,814,720,248,882 | 221 | 130 |
N = str(input())
n,mods = 0,[1]+[0]*2018
d = 1
for i in reversed(N):
n = (n+int(i)*d)%2019
mods[n] += 1
d = (d*10)%2019
print(sum([i*(i-1)//2 for i in mods])) | import sys
for jk in sys.stdin:
L=jk.split(" ")
sum = int(L[0])+int(L[1])
digit = 1
while sum>=10:
sum = sum/10
digit = digit + 1
print digit | 0 | null | 15,535,215,958,262 | 166 | 3 |
mountain = []
for _ in range(10):
mountain.append(int(input()))
mountain.sort()
mountain.reverse()
print(mountain[0])
print(mountain[1])
print(mountain[2]) | from fractions import gcd # for python 3.5~, use math.gcd
def main():
N, M = list(map(int, input().split(' ')))
half_A = list(map(lambda x: int(x) // 2, input().split(' ')))
lcm = 1
for half_a in half_A:
lcm *= half_a // gcd(lcm, half_a)
if lcm > M:
print(0)
exit(0)
for half_a in half_A:
if (lcm // half_a) % 2 == 0:
print(0)
exit(0)
num_multiples = M // lcm
print((num_multiples + 1) // 2) # count only cases that ratios are odd numbers.
if __name__ == '__main__':
main() | 0 | null | 51,114,383,954,710 | 2 | 247 |
from math import pi
r=input()
print"%.8f %.8f"%(pi*r*r,2*pi*r) | A,B,C,K = map(int,input().split())
Current_Sum = 0
if K <= A :
ans = K
elif K <= (A + B):
ans = A
else:
K -= (A + B)
ans = A - K
print(ans)
| 0 | null | 11,246,222,836,572 | 46 | 148 |
import math
a, b, C = map(float, input().split())
theta = math.radians(C)
S = 0.5 * a * b * math.sin(theta)
c = math.sqrt(a**2 + b**2 - 2*a*b*math.cos(theta))
h = b * math.sin(theta)
print("{:.9f}\n{:.9f}\n{:.9f}".format(S, a+b+c, h))
| n = int(input())
a = list(map(int, input().split()))
def nim(x):
bx = [format(i,'030b') for i in x]
bz = ''.join([str( sum([int(bx[xi][i]) for xi in range(len(x))]) % 2) for i in range(30)])
return int(bz, 2)
nima = nim(a)
ans = [ str(nim([nima,aa])) for aa in a ]
print(' '.join(ans) ) | 0 | null | 6,367,345,399,140 | 30 | 123 |
r,_=map(int,input().split())
m=[list(map(int,input().split()))for _ in[0]*r]
for s in m:s.append(sum(s))or print(*s)
print(*[sum(c)for c in zip(*m)])
| rc=list(map(int,input().split()))
a=[[0 for x in range(rc[1]+1)]for x in range(rc[0]+1)]
for x in range(rc[0]):
code=list(map(int,input().split()))
result=0
for y in range(rc[1]):
a[x][y]=code[y]
result+=code[y]
a[x][rc[1]]=result
for y in range(rc[1]+1):
result=0
for x in range(rc[0]):
result+=a[x][y]
a[rc[0]][y]=result
for x in range(rc[0]+1):
string=""
for y in range(rc[1]+1):
string+=str(a[x][y])
if (y!=rc[1]):
string+=" "
print(string) | 1 | 1,366,271,426,198 | null | 59 | 59 |
X=int(input())
MAX=2*int(X**(1/5))+1
MIN=-2*int(X**(1/5))-1
for A in range(MIN,MAX):
for B in range(MIN,MAX):
if A**5-B**5==X:
print(A,B)
exit() | X=int(input())
def check():
for a in range(-200,200):
for b in range(-200,200):
if a**5-b**5==X:
print(a,b)
return 0
check() | 1 | 25,635,847,372,188 | null | 156 | 156 |
t = input()
le = len(t)
tt = []
for i in range(le):
c = t[i]
if t[i] == '?':
c = 'D'
if i > 0 and tt[i - 1] == 'P':
c = 'D'
elif i == 0 and le > 1 and t[i + 1] == 'D' or i == 0 and le > 1 and t[i + 1] == '?':
c = 'P'
elif i < le - 1 and t[i + 1] == 'D' or i < le - 1 and t[i + 1] == '?':
c = 'P'
tt.append(c)
print(''.join(tt)) | from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
INF = float("inf")
import bisect
def count(s):
a = 0
aa = 0
b = 0
bb = 0
for i in range(len(s)):
if s[i] == ")":
if aa == 0:
a = a + 1
else:
aa = aa - 1
if s[i] == "(":
aa = aa + 1
if s[len(s)-1-i] == "(":
if bb == 0:
b = b + 1
else:
bb = bb - 1
if s[len(s)-1-i] == ")":
bb = bb + 1
return [a, b]
N = int(input())
c = []
d = []
for i in range(N):
s = input()
e = count(s)
if e[1] - e[0] >= 0: c.append(e)
if e[0] - e[1] > 0: d.append(e)
c.sort(key=lambda x: x[0])
d.sort(key=lambda x: x[1], reverse=True)
c = c + d
# print(c)
f = 0
for cc in c:
f = f - cc[0]
if f < 0:
print("No")
sys.exit()
f = f + cc[1]
if f == 0:
print("Yes")
else:
print("No")
| 0 | null | 21,059,627,043,588 | 140 | 152 |
#E - Logs
import math
# 入力
N,K = map(int,input().split())
A = list(map(int,input().split()))
Amax = int(max(A))
high = Amax
Cancut = Amax
low = 0
while ( (high - low) > 0.01 ) :
Cut = 0
X = (high + low) / 2.0
for i in range(N):
Cut = Cut + math.ceil(A[i]/X) - 1
if Cut <= K:
high = X
Cancut = X
else:
low = X
# 出力
if (math.floor(high) != math.floor(low)):
Cancut = math.floor( 100 * Cancut) /100.0
print(math.ceil(Cancut)) | num = int(input())
print(num**2) | 0 | null | 75,484,322,269,548 | 99 | 278 |
N,K=map(int,input().split())
H=[int(h) for h in input().split()]
H=sorted(H)
cnt=0
for i in range(1,len(H)+1):
if H[-i]>=K:
cnt+=1
else:
print(cnt)
exit()
print(cnt)
| n,k=map(int,input().split())
lis=list(map(int,input().split()))
lis.sort()
ans=0
for i in lis:
if i<k:
ans+=1
else:
break
print(n-ans) | 1 | 178,233,918,679,278 | null | 298 | 298 |
def solve():
N = input()
K = int(input())
dp = [[[0]*(K+2) for i in range(2)] for j in range(len(N)+1)]
dp[0][False][0] = 1
for i in range(len(N)):
for k in range(K+1):
dp[i+1][True][k+1] += dp[i][True][k] * 9
dp[i+1][True][k] += dp[i][True][k]
if int(N[i]) > 0:
dp[i+1][True][k+1] += dp[i][False][k] * (int(N[i]) - 1)
dp[i+1][True][k] += dp[i][False][k]
if int(N[i]) > 0:
dp[i+1][False][k+1] = dp[i][0][k]
else:
dp[i+1][False][k] = dp[i][0][k]
print(dp[-1][False][K] + dp[-1][True][K])
if __name__ == '__main__':
solve() | n = int(input())
a = list(map(int,input().split()))
count = 0
for i in range(n):
minij =i
for j in range(i,n):
if a[j] < a[minij]:
minij = j
if a[i] > a[minij]:
count+=1
a[i],a[minij] = a[minij],a[i]
print(' '.join(map(str,a)))
print(count)
| 0 | null | 37,756,651,024,160 | 224 | 15 |
H, W = map(int, input().split())
S = [0]*(H+2)
S[0] = ''.join(['#']*(W+2))
S[-1] = ''.join(['#']*(W+2))
for i in range(1,H+1):
S[i] = '#'+input()+'#'
maxd = 0
import queue
dy = [1,0,-1,0]
dx = [0,1,0,-1]
for h in range(1,H+1):
for w in range(1,W+1):
if S[h][w]=='.':
visited = [[False]*(W+2) for _ in range(H+2)]
q = queue.Queue()
visited[h][w] = True
q.put([h,w,0])
while not q.empty():
a,b,c = q.get()
#print(a,b,c)
for i in range(4):
y,x = a+dy[i], b+dx[i]
if S[y][x]=='.' and visited[y][x]==False:
q.put([y,x,c+1])
visited[y][x]=True
maxd = max(maxd,c)
print(maxd)
| import sys
import itertools
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
H,W = map(int,readline().split())
grid = ''
grid += '#'* (W+2)
for _ in range(H):
grid += '#' + readline().decode().rstrip() + '#'
grid += '#'*(W+2)
L = len(grid)
INF = float('inf')
def bfs(start):
dist = [-INF] * L
q = [start]
dist[start] = 0
while q:
qq = []
for x,dx in itertools.product(q,[1,-1,W+2,-W-2]):
y = x+dx
if dist[y] != -INF or grid[y] == '#':
continue
dist[y] = dist[x] + 1
qq.append(y)
q = qq
return max(dist)
ans = 0
for i in range(L):
if grid[i] == '.':
start = i
max_dist = bfs(start)
ans = max(ans,max_dist)
print(ans) | 1 | 94,550,551,410,070 | null | 241 | 241 |
n, m = map(int, input().split())
alst = list(map(int, input().split()))
alst.sort(reverse = True)
stand = sum(alst) / m / 4
if alst[m - 1] >= stand:
print("Yes")
else:
print("No") | from sys import stdin, stderr
from functools import lru_cache
@lru_cache(maxsize=None)
def rec(i, m):
if i == 0:
return m == 0 or A[i] == m
return rec(i - 1, m) or rec(i - 1, m - A[i])
n = int(input())
A = [int(i) for i in input().split()]
q = int(input())
M = [int(i) for i in input().split()]
for m in M:
if rec(n - 1, m):
print('yes')
else:
print('no') | 0 | null | 19,311,003,502,880 | 179 | 25 |
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()
def resolve():
N, K = LI()
A = LI()
# 最大の長さがxになるような切断回数
def cut_num(x):
ret = sum([math.ceil(i / x) - 1 for i in A])
return ret
ng = 0
ok = max(A)
while abs(ok-ng)>10**(-6):
m = (ng+ok)/2
if cut_num(m) <= K:
ok = m
else:
ng = m
print(math.ceil(ok))
if __name__ == '__main__':
resolve()
| #!/usr/bin python3
# -*- coding: utf-8 -*-
import bisect
n,k = map(int, input().split())
a = sorted(list(map(int, input().split())))
def cnt(x):
ret = 0
for ai in a:
ret += (ai+(x-1))//x - 1
return ret
ok, ng = a[-1], 0
while ok - ng > 1:
nw = (ok + ng) // 2
if cnt(nw)<=k:
ok = nw
else:
ng = nw
print(ok)
| 1 | 6,450,144,774,502 | null | 99 | 99 |
# coding: utf-8
# Here your code !
def func():
try:
word=input().rstrip().lower()
words=[]
while(True):
line=input().rstrip()
if(line == "END_OF_TEXT"):
break
else:
words.extend(line.lower().split(" "))
except:
return inputError()
print(words.count(word))
def inputError():
print("input Error")
return -1
func() |
N=int(input())
A_list=sorted(list(map(int, input().split())), reverse=True)
ans=1
if 0 in A_list:
print(0)
exit()
else:
for a in A_list:
ans*=a
if ans>1e+18:
print(-1)
exit()
print(ans)
| 0 | null | 8,945,802,870,460 | 65 | 134 |
x, y = input().split()
x = int(x)
y = int(y)
if y % 2 == 0 and 2 * x <= y <= 4 * x:
print('Yes')
else:
print('No') | X, Y = map(int, input().split())
if Y % 2 == 1:
print("No")
exit(0)
if 0 <= 2 * X - Y / 2 <= X:
print("Yes")
else:
print("No") | 1 | 13,688,783,255,602 | null | 127 | 127 |
S = input()
T = input()
count = []
for k in range(0,len(S)-len(T)+1):
sum = 0
for i in range(k,k+len(T)):
if (S[i] != T[i-k]):
sum += 1
count.append(sum)
print(min(count)) | S =input()
T = input()
n = len(S)-len(T)+1
count = []
for i in range(n):
c =0
for p in range(len(T)):
if S[i+p] != T[p]:
c += 1
count.append(c)
print(min(count))
| 1 | 3,696,424,895,072 | null | 82 | 82 |
def main():
N = input()
a = map(int, raw_input().split())
print ' '.join(map(str,a))
for i in xrange(1,len(a)):
v = a[i]
j = i - 1
while (j >= 0) & (a[j] > v):
a[j+1] = a[j]
j -= 1
a[j+1] = v
print ' '.join(map(str,a))
return 0
main() | def insersionSort(A, N):
for i in range(1, N):
print " ".join([str(k) for k in A])
v = A[i]
j = i - 1
while j >= 0 and A[j] > v:
A[j+1] = A[j]
j -= 1
A[j+1] = v
return A
if __name__ == "__main__":
N = int(raw_input())
A = map(int, raw_input().split())
A = insersionSort(A, N)
print " ".join([str(k) for k in A]) | 1 | 5,834,371,124 | null | 10 | 10 |
n = int(input())
lst = list(map(int,input().split()))
x = len(lst)
lst = list(set(lst))
y = len(lst)
if (x == y):
print("YES")
else:
print("NO")
| # coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
#from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10**7)
#import math
#from itertools import product, accumulate, combinations, product
#import bisect
#import numpy as np
#from copy import deepcopy
#from collections import deque
#from decimal import Decimal
#from numba import jit
INF = 1 << 50
EPS = 1e-8
mod = 10 ** 9 + 7
def mapline(t = int):
return map(t, sysread().split())
def mapread(t = int):
return map(t, read().split())
def generate_inv(n,mod):
"""
逆元行列
n >= 2
Note: mod must bwe a prime number
"""
ret = [0, 1]
for i in range(2,n+1):
next = -ret[mod%i] * (mod // i)
next %= mod
ret.append(next)
return ret
def run():
N, *A = mapread()
maxA = max(A)
L = maxA.bit_length()
subs = [0] * L
for k in range(L):
sum = 0
for a in A:
if (a >> k) & 1:
sum += 1 << k
sum %= mod
subs[k] = sum
sumA = 0
for a in A:
sumA += a
sumA %= mod
ret = 0
ret += (sumA * N) % mod
ret += (sumA * N) % mod
sub_sum = 0
for a in A:
sums = 0
for k in range(L):
if (a >> k) & 1:
sums += subs[k] * 2
sums %= mod
sub_sum += sums
sub_sum %= mod
ret -= sub_sum
ret %= mod
inv = generate_inv(2, mod)
ret *= inv[2]
ret %= mod
print(ret)
if __name__ == "__main__":
run()
| 0 | null | 98,370,202,410,002 | 222 | 263 |
# #
# author : samars_diary #
# 16-09-2020 │ 18:28:11 #
# #
import sys, os.path, math
#if(os.path.exists('input.txt')):
#sys.stdin = open('input.txt',"r")
#sys.stdout = open('output.txt',"w")
sys.setrecursionlimit(10 ** 5)
def mod(): return 10**9+7
def i(): return sys.stdin.readline().strip()
def ii(): return int(sys.stdin.readline())
def li(): return list(sys.stdin.readline().strip())
def mii(): return map(int, sys.stdin.readline().split())
def lii(): return list(map(int, sys.stdin.readline().strip().split()))
#print=sys.stdout.write
def solve():
a=ii();print((pow(10,a,mod())+pow(8,a,mod())-2*pow(9,a,mod()))%mod())
for _ in range(1):
solve() | #dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys;input = sys.stdin.readline
inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]
print('ACL'*inp()) | 0 | null | 2,670,871,125,570 | 78 | 69 |
_ = input()
N = sorted([int(v) for v in input().split()])
s = 1
for n in N:
s *= n
if s == 0 or s > 10**18:
break
print(s if s <= 10**18 else -1) | n = input()
num = map(int, raw_input().split())
for i in range(n):
if i == n-1:
print num[n-i-1]
break
print num[n-i-1], | 0 | null | 8,573,881,667,538 | 134 | 53 |
# coding: utf-8
n = int(input())
x = [float(i) for i in input().split()]
y = [float(i) for i in input().split()]
dl = [abs(i - j) for (i,j) in zip(x,y)]
for p in range(1,4):
d = sum([i ** p for i in dl]) ** (1/p)
print("{:.8f}".format(d))
print("{:.8f}".format(max(dl))) | s = input()
res = ""
for i in range(len(s)):
if s[i]!="?":
res += s[i]
else:
res+="D"
print(res) | 0 | null | 9,331,682,449,102 | 32 | 140 |
x,y,z =map(int,input().split())
t=0
t=x;x=y;y=t;
t=x;x=z;z=t;
print(x,y,z) | a,b,c=input().split();print(c,a,b) | 1 | 37,904,174,749,646 | null | 178 | 178 |
from math import ceil
t1,t2 = map(int,input().split())
a1,a2 = map(int,input().split())
b1,b2 = map(int,input().split())
a1 -= b1
a2 -= b2
a1 *= t1
a2 *= t2
if a1 + a2 == 0:
print("infinity")
exit()
if a1*(a1+a2) > 0:
print(0)
exit()
x = -a1/(a1+a2)
n = ceil(x)
if n == x:
print(2*n)
else:
print(2*n-1) | import sys
read = sys.stdin.read
T1, T2, A1, A2, B1, B2 = map(int, read().split())
answer = 0
v1 = A1 - B1
v2 = A2 - B2
d = v1 * T1 + v2 * T2
if d == 0:
print('infinity')
exit()
elif v1 * d > 0:
print(0)
exit()
if v1 * T1 % -d == 0:
print(v1 * T1 // -d * 2)
else:
print(v1 * T1 // -d * 2 + 1) | 1 | 131,399,289,671,068 | null | 269 | 269 |
from collections import defaultdict as dd
N, K = map(int, input().split())
A = list(map(int, input().split()))
S = [0]*(N+1)
# 累積和
for i in range(1, N + 1):
S[i] = S[i - 1] + A[i - 1] - 1
S[i] %= K
B = dd(int) # ここで範囲内のS[i]-iの個数を数えていく。
cnt = 0
for j in range(1, N + 1):
B[S[j - 1]] += 1
if j - K >= 0:
B[S[j - K]] -= 1
cnt += B[S[j]]
print(cnt) | N=int(input())
A = list(map(int,input().split()))
h = 0
for i in range(N-1):
if max(A[i], A[i+1]) == A[i]:
h += A[i] - A[i+1]
A[i+1] = A[i]
print(h) | 0 | null | 71,044,121,634,944 | 273 | 88 |
from collections import defaultdict
N = int(input())
A = list(map(int, input().split()))
Ones = A.count(1)
R = max(A)
nums = [0]*(R+1)
# 素因数テーブルの作成
D = [0]*(R+1)
for i in range(2, R+1):
if D[i]:
continue
n = i
while n < R+1:
if D[n] == 0:
D[n] = i
n += i
# 素因子をカウント
for a in A:
tmp = a
while tmp > 1:
prime_factor = D[tmp]
nums[prime_factor] += 1
while tmp%prime_factor == 0:
tmp //= prime_factor
y = max(nums)
if y < 2:
print('pairwise coprime')
elif y-Ones < N:
print('setwise coprime')
else:
print('not coprime') | from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import product, combinations,permutations
from copy import deepcopy
import sys
from math import sqrt
sys.setrecursionlimit(4100000)
if __name__ == '__main__':
N = int(input())
max_N = int(sqrt(N))+2
ans = 10e13
for a in range(1, max_N):
if N%a==0:
b = N//a
ans = min(ans, a+b-2)
print(ans) | 0 | null | 82,641,429,957,020 | 85 | 288 |
# dp[i][j]:=(総和がiで長さがjの数列の個数)とする
# このままだとO(s^3)だが、全てのｊに対してΣ(k=0→i-3)dp[k][j]をあらかじめ持っておけばO(s^2)となる
# dpの遷移式立てたときはちゃんと紙に書いて眺めなきゃ（使命感）
s=int(input())
mod=10**9+7
dp=[[0]*(s+1) for _ in range(s+1)]
accum=[0]*(s+1)
dp[0][0]=1
for i in range(3,s+1):
for j in range(s):
accum[j]+=dp[i-3][j]
dp[i][j+1]+=accum[j]
dp[i][j+1]%=mod
print(sum(dp[s])%mod) | A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(M)]
buy = [min(a)+min(b)]
for i in range(M):
C = a[c[i][0]-1]+b[c[i][1]-1]-c[i][2]
buy.append(C)
print(min(buy))
| 0 | null | 28,726,400,852,320 | 79 | 200 |
X = int(input())
ans = 0
money = 100
for i in range(1, 10**18):
money = (money * 101) // 100
if money >= X:
ans = i
break
print(ans) | X = int(input())
ans = 0
Y = 100
while Y < X:
Y += Y // 100
ans += 1
print(ans)
| 1 | 27,122,610,088,740 | null | 159 | 159 |
import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
def argsort(s, return_sorted=False):
inds=sorted(range(len(s)), key=lambda k: s[k])
if return_sorted: return inds, [s[i] for i in inds]
return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
K,N,M=len(B),len(A),len(B[0])
return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
N=len(v)
size=len(M)
return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def main():
mod = 10**9+7
#w.sort(key=itemgetter(1),reversed=True) #二個目の要素で降順並び替え
#N = int(input())
N, K, S = map(int, input().split())
#A = tuple(map(int, input().split())) #1行ベクトル
#L = tuple(int(input()) for i in range(N)) #改行ベクトル
#S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
m=10**9
if S!=10**9:
ans=[S]*K+[m]*(N-K)
else:
ans=[m]*K+[1]*(N-K)
print(*ans)
if __name__ == "__main__":
main() | n, k, s =map(int, input().split())
if s == 10 ** 9:
for i in range(k):
print(s, end=" ")
for i in range(n-k):
print(1, end=" ")
else:
for i in range(k):
print(s, end=" ")
for i in range(n-k):
print(s+1, end=" ") | 1 | 90,891,684,156,448 | null | 238 | 238 |
n, k, c = map(int, input().split())
s = input()
work = [1]*n
rest = 0
for i in range(n):
if rest:
rest -= 1
work[i] = 0
continue
if s[i] == 'x':
work[i] = 0
elif s[i] == 'o':
rest = c
rest = 0
for i in reversed(range(n)):
if rest:
rest -= 1
work[i] = 0
continue
if s[i] == 'o':
rest = c
if k < sum(work):
print()
else:
for idx, bl in enumerate(work):
if bl:
print(idx+1)
| n,k,c = map(int,input().split())
s = list(input())
L = []
R = []
i = -1
j = n
for ki in range(k):
while i < n:
i += 1
if s[i] == 'o':
L += [i]
i += c
break
for ki in range(k):
while 0 <= j:
j -= 1
if s[j] == 'o':
R += [j]
j -= c
break
for i in range(k):
if L[i] == R[-i-1] :
print(L[i]+1) | 1 | 40,500,875,491,748 | null | 182 | 182 |
def run():
s=input()
command_num=int(input())
for i in range(command_num):
command = input().split()
command = list(map(lambda x: int(x) if x.isdigit() else x,command))
# print(s)
if command[0] == "print":
a=command[1]
b=command[2]
print(s[a:b+1])
elif command[0] == "reverse":
a=command[1]
b=command[2]
rev=s[a:b+1]
rev=rev[::-1]
#境界処理がめんどくさい
pre= "" if a==0 else s[0:a]
post="" if b==len(s)-1 else s[b+1:]
s=pre+rev+post
elif command[0] == "replace":
a=command[1]
b=command[2]
p=command[3]
#境界処理がめんどくさい
pre= "" if a==0 else s[0:a]
post="" if b==len(s)-1 else s[b+1:]
s=pre+p+post
else:
assert False
run()
| house1 = [[0 for x in range(10)], [0 for x in range(10)], [0 for x in range(10)]]
house2 = [[0 for x in range(10)], [0 for x in range(10)], [0 for x in range(10)]]
house3 = [[0 for x in range(10)], [0 for x in range(10)], [0 for x in range(10)]]
house4 = [[0 for x in range(10)], [0 for x in range(10)], [0 for x in range(10)]]
houses = [house1, house2, house3, house4]
n = int(input())
for i in range(n):
b, f, r, v = [int(x) for x in input().split()]
houses[b - 1][f - 1][r - 1] += v
cnt = 0
for house in houses:
for floor in house:
floor = [str(x) for x in floor]
print(' ' + ' '.join(floor))
if cnt != 3:
print('#' * 20)
cnt += 1 | 0 | null | 1,618,002,090,990 | 68 | 55 |
n = int(input())
l = [int(x) for x in input().split()]
c = 0
for i in range(n):
for j in range(i+1,n):
if l[i] == l[j]:
continue
for k in range(j+1,n):
if l[i] == l[k] or l[j] == l[k]:
continue
if l[i]+l[j] > l[k] and l[i]+l[k] > l[j] and l[j]+l[k] > l[i]:
c += 1
print(c) | from itertools import*
n=input()
l = map(int,input().split())
ans = 0
for a, b, c in combinations(l, 3):
if a != b != c != a and a + b > c and b + c > a and c + a > b:
ans += 1
print(ans) | 1 | 5,084,378,643,328 | null | 91 | 91 |
Subsets and Splits