One of the Testcases(6) has 100000 elements with 12 31 in it. All same values. How can the output be 4999950000. Please explain.

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))

The test case doesn't even get the joke right. Dates for the joke are 12/25 and 10/31

"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.

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

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?

For everyone coding in Java: use long to pass test case 6

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);
}

}

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)

what is wrong in this??

int solve(vector> dates) { vector>base(13,vector(32)); long int count = 0; vectorcounter; counter.assign(38,0); for(int i = 0; i1) { count+=1; } } } } return count; }