Hi,
I am providing the solution of The Great Indian Programming League 2013 - March Edition - Level 1. You can find the question here . My best score in this level is 90.
I am providing the solution of The Great Indian Programming League 2013 - March Edition - Level 1. You can find the question here . My best score in this level is 90.
- public class CandidateCode {
- public static int slope_sum(int input1,int input2)
- {
- //Write code here
- int sum=0;
- long cal=0;
- if(input1>=0 && input2<=100)
- return 0;
- else if(input1>input2 || input12147483647)0>
- {
- return -1;
- }
- else
- {
- for(int i=input1;i<=input2;i++)
- {
- if(i>100)
- {
- //System.out.println("hiii"+getValue(i));
- sum = sum + getValue(i);
- System.out.println(sum);
- cal++;
- }
- }
- }
- return sum;
- }
- public static int getValue(int value)
- {
- int maxima=0;
- int lastDigit;
- int firstDigit;
- int middleDigit;
- int rem,flag=0;
- while(value!=0)
- {
- int temp=-1;
- rem = value%1000;
- temp=value/1000;
- if(temp==0)
- {
- //System.out.println("rem");
- rem=value;
- }
- lastDigit = rem%10;
- firstDigit = rem/100;
- middleDigit = (rem%100)/10;
- //System.out.println("Rem = "+rem+" last Digit "+lastDigit+" firstDigit "+firstDigit+" middle = "+middleDigit);
- // System.out.println("Rem = "+rem+" last Digit "+lastDigit+" firstDigit "+firstDigit+" middle = "+middleDigit+" maxima= "+maxima);
- if(middleDigit>firstDigit && middleDigit>lastDigit)
- {
- maxima++;
- }
- if (middleDigit
- maxima++;
- }
- if(temp==0)
- {
- //System.out.println("Here 3 digit code");
- flag=maxima;
- maxima=0;
- value=0;
- }
- else
- {
- value = value/10;
- }
- }
- return flag;
- }
- }

0 comments:
Post a Comment