tag:blogger.com,1999:blog-10264349191031971602024-02-08T07:28:58.152-08:00HackerRank AlgorithmAnonymoushttp://www.blogger.com/profile/06887816257311437019noreply@blogger.comBlogger7125tag:blogger.com,1999:blog-1026434919103197160.post-39665326820517620242015-06-28T09:57:00.000-07:002015-06-28T09:57:33.951-07:00Chocolate Feast<div dir="ltr" style="text-align: left;" trbidi="on">
import java.util.Arrays;<br />
import java.util.Scanner;<br />
<br />
class TestClass {<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>/**<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> * @param args<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> */<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>public static void main(String[] args) {<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>// TODO Auto-generated method stub<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>Scanner s = new Scanner(System.in);<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int i, t, j, k, l, cnt=0,t1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int n,c,w,p,m;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>t = s.nextInt();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for (i = 0; i < t; i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>n=s.nextInt();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>c=s.nextInt();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>m=s.nextInt();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>w=n/c;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>p=w;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>while(p/m!=0)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int x=p/m;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>p=(p%m)+x;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>w+=x;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>System.out.println(w);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
}<br />
<div>
<br /></div>
</div>
Anonymoushttp://www.blogger.com/profile/06887816257311437019noreply@blogger.com0tag:blogger.com,1999:blog-1026434919103197160.post-81698536735905044822015-06-28T09:55:00.000-07:002015-06-28T09:55:09.559-07:00Cut the sticks<div dir="ltr" style="text-align: left;" trbidi="on">
import java.util.*;<br />
<br />
// Xenny And Question<br />
class TestClass {<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>/**<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> * @param args<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> */<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>public static void main(String[] args) {<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>// TODO Auto-generated method stub<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>Scanner s = new Scanner(System.in);<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int q, i, j, k=0, cnt;<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>q = s.nextInt();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int a[] = new int[q];<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for (i = 0; i < q; i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[i]=s.nextInt();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>mergesort(a,0,q-1);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int max=Integer.MAX_VALUE;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for (i = 0; i < q; i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(a[i]<max)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>max=a[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cnt=a.length;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>while(cnt>0)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>System.out.println(cnt);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>k=0;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cnt=a.length;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for (i = 0; i < q; i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(a[i]!=0)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[i]-=max;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for (i = 0; i < q; i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(a[i]==0)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>k++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>else<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>max=a[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>i=q;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cnt-=k;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>private static void mergesort(int[] arr,int l, int r) {<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(l<r)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int m = l+(r-l)/2; //Same as (l+r)/2, but avoids overflow for large<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>mergesort(arr, l, m);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> mergesort(arr, m+1, r);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> merge(arr, l, m, r);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>private static void merge(int[] arr, int l, int m, int r) {<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>// TODO Auto-generated method stub<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int i, j, k;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> int n1 = m - l + 1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> int n2 = r - m;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> /* create temp arrays */<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> int L[] = new int[n1];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> int R[] = new int[n2];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> /* Copy data to temp arrays L[] and R[] */<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> for(i = 0; i < n1; i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> L[i] = arr[l + i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> for(j = 0; j < n2; j++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> R[j] = arr[m + 1+ j];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> /* Merge the temp arrays back into arr[l..r]*/<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> i = 0;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> j = 0;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> k = l;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> while (i < n1 && j < n2)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> {<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> if (L[i] <= R[j])<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> {<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> arr[k] = L[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> i++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> }<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> else<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> {<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> arr[k] = R[j];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> j++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> }<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> k++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> }<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> /* Copy the remaining elements of L[], if there are any */<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> while (i < n1)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> {<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> arr[k] = L[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> i++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> k++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> }<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> /* Copy the remaining elements of R[], if there are any */<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> while (j < n2)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> {<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> arr[k] = R[j];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> j++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> k++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> }<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<br />
}<br />
<div>
<br /></div>
</div>
Anonymoushttp://www.blogger.com/profile/06887816257311437019noreply@blogger.com0tag:blogger.com,1999:blog-1026434919103197160.post-29512290847557820682015-02-06T11:45:00.002-08:002015-02-06T11:45:36.656-08:00Utopian Tree<div dir="ltr" style="text-align: left;" trbidi="on">
import java.io.*;<br />
import java.util.*;<br />
import java.text.*;<br />
import java.math.*;<br />
import java.util.regex.*;<br />
<br />
public class Solution {<br />
<br />
public static void main(String[] args) {<br />
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>Scanner s = new Scanner(System.in);<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int i, t, j, k, x=1, y=1;<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>t = s.nextInt();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int m[] = new int[t];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for (i = 0; i < t; i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>m[i] = s.nextInt();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for (k = 0; k < t; k++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>y=1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(i=1;i<=m[k];i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(i%2==0)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>y+=1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>else<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>y*=2;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>System.out.println(y);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
}<br />
}</div>
Anonymoushttp://www.blogger.com/profile/06887816257311437019noreply@blogger.com0tag:blogger.com,1999:blog-1026434919103197160.post-26990282117213073632015-02-06T11:44:00.003-08:002015-02-06T11:44:54.857-08:00Flipping bits<div dir="ltr" style="text-align: left;" trbidi="on">
import java.math.BigInteger;<br />
import java.util.Arrays;<br />
import java.util.Scanner;<br />
<br />
class TestClass {<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>/**<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> * @param args<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> */<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>public static void main(String[] args) {<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>// TODO Auto-generated method stub<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>Scanner s = new Scanner(System.in);<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int i, j,t;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>BigInteger a,b,c,k,x,y;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>t = s.nextInt();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int p[] = new int[t];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>k=new BigInteger("4294967295");<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for (i = 0; i < t; i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a=new BigInteger(s.next());<br />
a=k.subtract(a);<br />
System.out.println(a);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
}<br />
<div>
<br /></div>
</div>
Anonymoushttp://www.blogger.com/profile/06887816257311437019noreply@blogger.com0tag:blogger.com,1999:blog-1026434919103197160.post-85131020981531534962015-02-06T11:44:00.000-08:002015-02-06T11:44:07.064-08:00Solve Me Second<div dir="ltr" style="text-align: left;" trbidi="on">
import java.io.*;<br />
import java.util.*;<br />
import java.text.*;<br />
import java.math.*;<br />
import java.util.regex.*;<br />
<br />
public class Solution {<br />
static int solveMeSecond(int a, int b) {<br />
return a+b;<br />
}<br />
<br />
<br />
public static void main(String[] args) {<br />
Scanner in = new Scanner(System.in);<br />
int t;<br />
int sum;<br />
int _a,_b;<br />
t = in.nextInt();<br />
for (int i=0;i<t;i++) {<br />
_a = in.nextInt();<br />
_b = in.nextInt();<br />
sum = solveMeSecond(_a, _b);<br />
System.out.println(sum);<br />
}<br />
}<br />
}<br />
<div>
<br /></div>
</div>
Anonymoushttp://www.blogger.com/profile/06887816257311437019noreply@blogger.com0tag:blogger.com,1999:blog-1026434919103197160.post-27251697234683891912015-02-06T11:41:00.001-08:002015-02-06T11:41:54.856-08:00Lonely Integer<div dir="ltr" style="text-align: left;" trbidi="on">
import java.io.*;<br />
import java.util.*;<br />
import java.text.*;<br />
import java.math.*;<br />
import java.util.regex.*;<br />
<br />
public class Solution {<br />
public static void main(String[] args) {<br />
Scanner s = new Scanner(System.in);<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int i, t, j, k, x=1, y=1;<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>t = s.nextInt();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int m[] = new int[t];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int n[] = new int[101];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for (i = 0; i < t; i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>m[i] = s.nextInt();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for (i = 0; i <= 100; i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>n[i] = 0;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for (k = 0; k < t; k++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>n[m[k]]++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for (k = 0; k < 101; k++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(n[k]==1)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>System.out.println(k);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>break;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
}<br />
}<br />
<div>
<br /></div>
</div>
Anonymoushttp://www.blogger.com/profile/06887816257311437019noreply@blogger.com0tag:blogger.com,1999:blog-1026434919103197160.post-32042974328365626942015-02-06T11:33:00.000-08:002015-02-06T11:33:06.737-08:00Solve Me First<div dir="ltr" style="text-align: left;" trbidi="on">
#include <cmath><br />
#include <cstdio><br />
#include <vector><br />
#include <iostream><br />
#include <algorithm><br />
using namespace std;<br />
<br />
<br />
int solveMeFirst(int a, int b) {<br />
return a+b;<br />
}<br />
<br />
int main() {<br />
int num1, num2;<br />
int sum;<br />
cin>>num1>>num2;<br />
sum = solveMeFirst(num1,num2);<br />
cout<<sum;<br />
return 0;<br />
}</div>
Anonymoushttp://www.blogger.com/profile/06887816257311437019noreply@blogger.com0