ravitejas3 One of the Testcases(6) has 100000 elements with 12 31 in it. All same values. How can the output be 4999950000. Please explain.
MissKat We can have two different events occur on the same date, which means all those events are considered separate events and not the same. Hope that helps. :)
HackerGit So for the following input 2 3 10 3 10 3 10 output should 3 right? or is it 6? If it is 3, shouldn't the output for the above mentioned test case be 4999850001?
MissKat Think of the first (3, 10) as A and second (3, 10) as B. We cannot make a joke with (A, A) because they are the same thing. (A, B) isn't though. :)
sticknanisha How do you explain the second test case then?
2
2 25
2 25
Expected Answer: 0
Shouldn't the expected answer be 1 following the logic of test case 6?
sticknanisha Nevermind, I misinterpreted this test case to mean that two events with the same day couldn't be used to make a joke (when it was actually trying to demonstrate a different constraint of the problem).
xshanz 25 is not defined in base 2.. coz base 2 only have digits 0 or 1
saurabhcse15 31 should be in invalid in base 12??
kumarlee8299 nope not at all.split 31.that implies 3,1 here both 3 and 1 are less than or equal to 12.so 31 is valid in base 12
Tsukuyomi1 Python to the rescue...
counts = [0]*100 for i in range(int(input())): m,d = map(int,input().split()) try:counts[int(str(d),m)]+=1 except:pass print(sum(c*(c-1)//2 for c in counts))
aakalpa - cool soln
- counts = [0]*38 is enough since max=int('31',12)=37
- also m,d=input().split() is enough
masterpradip "The given numbers are all represented with digits from 0-9, that's why for months like 11 or 12, we can't use additional characters to represent 10 or 11."
Can anyone explain this line to me with an example.
bennattj I don't know what purpose that comment serves other than to confuse you. For November (11) and December (12), you would need digits other than 0-9 to represent some values. E.g. 11_{10} = A_{11} ('A' would represent 11 just as in hexadecimal). But there will never be a date like 11/A (since they only use digits 0-9).
My advice: ignore this comment; it doesn't help you in any way unless there is some more clever way than how I solved the problem.
campkev The test case doesn't even get the joke right. Dates for the joke are 12/25 and 10/31
Steady_Bunny Spoiler Alert *Three things to do*
//here x=month and y=day 1.check for invalid case x<=9&&(y%10>=x||(y/10)>=x) 2.conversion to decimal for checking y%10+(y/10)*x //store result for every valid event 3.sum_of_all(C(C-1)/2) C=no. of event having same value
Most Welcome to Suggestions and Queries
vikasjha why do you have x<=9 as an invalid case, shouldn't it be x<=1
urosbojanic1 cin >> m >> d; x[i]=(d/10*m)+(d%10); if((d/10)>m || (d%10)>m){x[i]=0;} for(int j=0;j
I'm getting timeout on cases 6-11, but I can't find a faster alg. Can someone help me?
DLo930 For everyone coding in Java: use long to pass test case 6
madhuvani import java.io.; import java.util.; import java.text.; import java.math.; import java.util.regex.*;
public class Solution {
public static void main(String[] args) { Scanner sc=new Scanner(System.in); int n=sc.nextInt(); int m[]=new int[n]; int d[]=new int[n]; int count=0; for(int i=0;i<n;i++){ m[i]=sc.nextInt(); d[i]=sc.nextInt(); } for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ if(i!=j) { if((d[i]%m[j]==d[j]%m[i])) if((m[i]!=m[j])) count++; }} } System.out.println(count/2); }}
avantikapatel77 can you please explain logic behind this?
saikalyan2703 Please tell me what is wrong with my code. I got output for 6 testcases but failed failed for the last 5 testcases. I was not able to debug it.
# Enter your code here. Read input from STDIN. Print output to STDOUT m=[] d=[] n=int(raw_input()) if(n==1): print 0 exit() for _ in range(n): x,y=raw_input().split(" ") m.append(int(x)) d.append(y) o=[] for i in range(len(m)): try: o.append(int(d[i],m[i])) except: continue if(len(set(o))==1): x=len(o) print int((x*(x-1))/2) else: x=len(o)-len(set(o)) print int((x*(x-1))/2)
vinayb21 Why 25 is not valid in base 2?
Binary form of 25 - 11001
Sort 20 Discussions, By:
Please Login in order to post a comment