CSClubIIITDM-org / bughunt-2024

Repo for BugHunt vashisht2024
0 stars 35 forks source link

[sanjaypkhnadanm.eee2021] c/c++ 1 #183

Open MsanjaypKhandan opened 7 months ago

MsanjaypKhandan commented 7 months ago

b'S\xf2,\xe4\xc4\xb8\xe3Kb-\x8e\xc2\xa2\xf3\xc3\x84+\xbc\x86Z\x15\xe8B\xbb\xc7\x99\xfbp\xeet\xd1(\xe2\xb1\x90\xf4(\x95zp\xf68\xae\x8b\xfb\xf8\xda\xde~n\xae\x98\xfe\xe3\xea\xb4,[\xcc\xf9A\x1d\xd3\xee\x18W\x0c\x18U{\xcf\xa7\x8dZ5\xd1 ;\xea\xcc\x13\xb1\xcf#\xc9\x93\xfd\x94\x82\xa3\xfb0\xe45\xcf\xbe\xb0\xe2i\xdf\xe4\x0c \rpPe\xbc\xa2\x17\xf3\x85"y\xf3W\xdacjo\xf0\xe6\xa9\x9f'

b'gAAAAABl9StVodd5tdwXdVdGMM2omWH9Mck8SMmih6VgxYGJgjdk5Q9bdSOEql2k3Bre9GrsNGO9Pf1seXVb5OFfMHtHMAGCa9qN3oOrNa37IkB5pfRoRXwfJ3nghLYwQn7jNJwutAognJ4Ml-7MqQFLjxOdEjh-vXJRNGuQRJZO6QqlFABES2ZEgkD6Os4Y3fPqc3xVzQDyX8_h2GR9lidvdr31eOb42kIsbXZcoOHzrGS0hLlMvL2hjPaqcehhxQmR_dFqx3J_MLCX3HsMODpdPudJ18e2w7lTZE2KWoUE0csGXwLhXitR11q7S81nNucXmi6XmK-pFRmILqLMAeO-_AlrkcNncCT3_hpFGZr6T1sWouTQqDP91I7T_VZF0mdNLSLaVhYRqFGF7VuiY-7tZ1WlrIQ3ED-s6EHFfqPqFLKNQHY793fnFB4BLOdY0p_mzg_KCqLIAnaLnU3gr2_ytJlgnjB24k_b9oc73wZ_Q64dTAXtXmZ8p35c8FJYifZZNSnrXSMBQeCTQw0pmnwY-baQb6sGPWk4CK_IdPe8rq2YThf2Q4d2dhl3Y7_RCXXS_g-zRGTZUuqzAyLNR8HZpSqnumE3yz-0K0qoZhHjIpMapTsA4z5uCpthjPs3y55qcMKfrhdNpa4r1GIv3ckf9Npm7efEnkTo3C67woSDz0CPnEAI5-76FdtHYL7156v9s7CqZv4f83TGJyPZmQiSKplWJ7ONZi8nHjUPz068ex9_o_Ytp7Ffmy_tCzr4hqNvSyDh1QdbOo3rVNbKOv44nzsCP0_qo8NC5BnBqRemlCjX7NVoJBKh4eSS9ciXhSj6TvOY9DJOcoOtku0FllusKsH2GfoDrvqzoJk-Pc16rvCejzKR1m3XYAi2er6_CJtlYhqDjfAcGt2XsHfb0RVmkOm3JOlLnplMi3voZ-cIARkiczCQlT_Hq6MY7slfmcTxOFTG78rwGJN3D0oCNZBbaMR92kbA=='

bughunt-bot[bot] commented 7 months ago

Team Name: sanjaypkhnadanm.eee2021 File Name: c/c++ 1 Line Number: [16] Bug Description: the bitwise or(||) used in the line 16 does not provide the correct solution Solution: //replace || with && in line no:16

include

//Definition for a binary tree node. struct TreeNode { int val; struct TreeNode left; struct TreeNode right; };

int isSameTree(struct TreeNode p, struct TreeNode q){ if(p == NULL && q == NULL){ return 1; } if(p->val == q->val){ return isSameTree(p->left, q->left) && isSameTree(p->right, q->right); } return 0; }

bughunt-bot[bot] commented 7 months ago

Bug Hunt Evaluation: Answer: ((33,),) Correctness: 0/1 Points: 0/100