RECIPE - Editorial

admin · November 27, 2012, 4:36pm

PROBLEM LINKS

DIFFICULTY

EASY

EXPLANATION

The problem here is divide all numbers by some constant so that the divisions have no remainder. We produce the smallest result by dividing by a number that is as large as possible, that is the greatest common divisor. The greatest common divisor can be computed efficiently by Euclid’s algorithm, but in this case it was fast enough to simply check all numbers from 1 to 1000 for divisibility.

SETTER’S SOLUTION

Can be found here.

TESTER’S SOLUTION

Can be found here.

gc_nit · December 28, 2012, 12:12pm

wats wrong wid this??
http://www.codechef.com/viewsolution/1653380

garakchy · December 22, 2013, 9:19am

note on my code: the gcd block is taken from wiki url i have shown above. and main block is my c++ code. i initialised arr of 50 ingredients and saved ingredients in it. and then i have taken cmmn - the greatest common divisor for ingredients in the array. if cmmn==1 then the array has no gcd, so i just printed out the arr itself. if cmmn is equal to ingredients of arr then yes==1, which means that all ingredients in the arr are same numbers, for ex 4 as given in the codechef sample output, if so i printed out 1 for every ingredient of arr. and if there exist gcd(here cmmn) other than 1 and ingredints itself, then print out arr[i]/cmmn. that is it.

NOTE: i still have difficulty in understanding the binary gcd algo. can anyone pls post the easier way to learn binary gcd algo. tnx

tech_boy · July 29, 2014, 9:23am

Can anyone tell me what is wrong with this code?
ideone

grayhathacker · July 29, 2014, 11:17am

it’s not necessary that the no. with minimum value will always be gcd of all…

try this : 8 16 20

ur output: 8 16 20

correct answer : 2 4 5

tech_boy · July 29, 2014, 3:30pm

thank you!

kislaya123 · June 20, 2015, 6:01pm

Can anyone please tell me :-
I have run my code several times in my laptop with several cases and does not encountered any problem.But after submitting it I got wrong answer… Please Check my code and please inform me about my mistake and the particular case … Waiting for your reply… http://www.codechef.com/viewsolution/7242074

shivam9753 · June 20, 2015, 7:43pm

@kislaya
Why did u write so lengthy code.

U can exploit the fact that GCD cannot be greater than the minimum element of array.

deeksha_garg · July 27, 2015, 10:53pm

showing runtime error SIGFPE in this problem … please can someone tell my mistake in this code…

https://www.codechef.com/viewsolution/7563648

dravit · January 23, 2016, 1:56am

If someone can help me figuring out what the problem is https://www.codechef.com/viewsolution/9210591

shreya_0296 · August 14, 2016, 8:42pm

what is wrong with my code??
my ans is correct but still it is showing wrong answer
#include <stdio.h>

int main(void) {

int n,i=0,j,min=0,count=0,m,k,gcd;

scanf("%d",&n);

int a[n][49],b[50];

while(i<n)
{
	gcd=0;
	scanf("%d",&m);
	j=0;
	a[i][j]=m;

	scanf("%d",&b[j]);
	min=b[j];
	j++;

		
	while(j<m)
	{
		scanf("%d",&b[j]);
		if(min>b[j])
		min=b[j];
		j++;
	}
	
	while(min>1)
	{
		count=0;
		j=0;
		while(j<m)
		{
			if((b[j]%min)==0)
			count++;
			j++;
		}

		if(count==m)
		{
			gcd=min;
			break;
		}
		min--;
		
	}
	
	j=1;
	k=0;
	if(gcd!=0)
	{
		while(j<=m)
		{
			a[i][j]=b[k]/gcd;
			j++;
			k++;
		}
	}
	else
	{
		while(j<=m)
		{
			a[i][j]=b[k];
			j++;
			k++;
		}
	}
	i++;
	
	count=0;
}

for(i=0;i<n;i++)
{
	for(j=1;j<=a[i][0];j++)
	{
	    if(j==a[i][0])
	    printf("%d",a[i][j]);
	    else
	    printf("%d ",a[i][j]);
	}
	if(i!=(n-1))
	printf("\n");
}


return(0);

}

saurabh2104 · October 4, 2016, 8:52am

my code is giving correct answers but in uploadinong your compiler is saying wrong plasee check it or tell me the example which is giving wrong answer
#include <stdio.h>
#include <stdlib.h>
void input(void);
int main()
{
int n,i;
printf(“enter the number the test case\n”);
scanf("%d",&n);
for (i=0;i<n;i++)
{
input();
}

return 0;

}

void input(void)
{
int i,n,b,a[50];
int j=0,count=0 ;
printf(“enter the number of items between 2 to 50 :”);
scanf("%d",&n);
printf(“enter the numbers “);
for(i=0;i<n;i++)
{
scanf(”%d”,&a[i]);
if(i==0)
{
b=a[0];
}
if(i>0)
{
if(b>a[i])
b=a[i];
}
}
for(i=0;i<n;i++)
{
while(1)
{
j++;
if(bj<=a[i])
{
if(bj==a[i])
break;
}
if(b*j>a[i])
{
for(i=0;i<n;i++)
printf("%d ",a[i]);
count ++;
break;
}
}
if (count==1)
break;

}
         if(count==0)
        {
            for(i=0;i<n;i++)
            printf("%d   ",a[i]/b);
        }

}

ab1494 · November 15, 2016, 11:43am

my code is giving correct answers but when i am uploading in your compiler its saying wrong answer please check it or tell me the example which is giving wrong answer

https://www.codechef.com/viewsolution/12103516

alphazeta0 · March 19, 2017, 10:41am

what wrong with my code???

#include <stdio.h>
#include <stdlib.h>

int minimum(int [],int);

int minimum(int arr[],int N){

    int i=0,min_val=arr[0];
    for(i=1;i<N-1;i++){
        if(min_val > arr[i])
            min_val=arr[i];
    }
        return min_val;

}

int main()
{
int T;

scanf("%d",&T);

while(T){
    int N,flag;
    scanf("%d",&N);
    if(N>=2 && N<=50){
    int arr[N],min,tem=N;
    int i=0;
    while(tem){
        scanf("%d",&arr[i]);
        tem--;  i++;
    }

    min=minimum(arr,N);
           tem=N;
    while(tem){
        if(((arr[tem-1])%min)==0) flag=1;
        else {flag=0; break;}
    tem--;
    }
    i=0;
    if(flag==1){
        while(N){
            printf("%d ",arr[i]/min);
         i++;N--;}
    }
    else{
            while(N){
                printf("%d ",arr[i]);
                i++; N--; }
    } }

T–;

printf("\n");

}
return 0;
}

vijju123 · March 19, 2017, 11:48am

@alphazeta0

Your code fails for this test case-

Input-
    1
    3 15 35 55

Output-

15 35 55 

Expected Output-

3 7 11

Add a check that if minimum element isn’t gcd, check if any factor of it is GCD of all. (Eg, here 15 isn’t GCD, but its factor 5 is GCD of all elements).

japper · May 13, 2017, 12:45pm

what’s wrong with my code?it’s running correctly on my compiler but giving prompt of wrong answer here.plz check .
https://www.codechef.com/viewsolution/13565846

akwa_blue · September 19, 2017, 9:06am

Hi, can someone please help me find the test case where my code fails for this problem?
Here is my answer :
https://www.codechef.com/viewsolution/15469463

ujjwalmishra21 · October 17, 2017, 11:00pm

My code is running correctly but don’t know why it’s showing wrong answer. Anyone please help?
https://www.codechef.com/viewsolution/15887411

vikalp91 · October 20, 2017, 11:53pm

Can someone tell me whats wrong in my code…!!!


code here

import java.util.Scanner;

public class RECIPE_2 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		while(T>0){
			int ingredients = sc.nextInt();
			if(ingredients == 0) return;
			if(ingredients == 1){
				System.out.println(sc.next());
				return;
			}
			int[]arr = new int[ingredients];
			for(int i=0;i<ingredients;i++){
				arr[i] = sc.nextInt();
			}
			//answer
			int result = gcd(arr[0], arr[1]);
			for(int i=2;i<ingredients;i++){
				result = gcd(arr[i], result);
			}
			printArray(arr, result);
			
			T--;
		}

	}
	
	public static int gcd(int a, int b){
		if(a==0){
			return b;
		}else{
			return gcd(b%a, a);
		}
	}
	
	public static void printArray(int[] arr, int divNo){
		for(int i=0;i<arr.length; i++){
			System.out.print(arr[i]/divNo);
			if(i!=arr.length-1)
			System.out.print(" ");
		}
	}

}

I solved this code in another way but still it is failing. anyone what is the case when it got failed.?

premang1 · December 30, 2017, 1:34pm

Why i am getting WA(wrong answer) ??

I am getting right answers for all the TEST cases, incuding (8,16,20) ans=(2,4,5).Given in comment.
Can anyone help me.

My solution link
https://www.codechef.com/viewsolution/16701304

@grayhathacker