Tasks Details
medium
1.
Multivitamin
There are N glasses of different capacities, each of them containing a different amount of a unique kind of juice. Calculate the maximum number of kinds of juice that can be mixed in a single glass.
Task Score
47%
Correctness
100%
Performance
0%
Rick is really fond of fruit juices, but he is bored of their traditional flavours. Therefore, he has decided to mix as many of them as possible to obtain something entirely new as a result.
He has N glasses, numbered from 0 to N-1, each containing a different kind of juice. The J-th glass has capacity[J] units of capacity and contains juice[J] units of juice. In each glass there is at least one unit of juice.
Rick want to create a multivitamin mix in one of the glasses. He is going to do it by pouring juice from several other glasses into the chosen one. Each of the used glasses must be empty at the end (all of the juice from each glass has to be poured out).
What is the maximum number of flavours that Rick can mix?
Write a function:
int solution(int juice[], int capacity[], int N);
that, given arrays juice and capacity, both of size N, returns the maximum number of flavours that Rick can mix in a single glass.
Examples:
1. Given juice = [10, 2, 1, 1] and capacity = [10, 3, 2, 2], your function should return 2. Rick can pour juice from the 3rd glass into the 2nd one.
2. Given juice = [1, 2, 3, 4] and capacity = [3, 6, 4, 4], your function should return 3. Rick can pour juice from the 0th and 2nd glasses into the 1st one.
3. Given juice = [2, 3] and capacity = [3, 4], your function should return 1. No matter which glass he chooses, Rick cannot pour juice from the other one into it. The maximum number of flavours in the chosen glass is 1.
4. Given juice = [1, 1, 5] and capacity = [6, 5, 8], your function should return 3. Rick can mix all juices in the 2nd glass.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [2..100,000];
- each element of arrays juice and capacity is an integer within the range [1..1,000,000,000];
- arrays juice and capacity have the same length, equal to N;
- for each J juice[J] ≤ capacity[J].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used C
Time spent on task 73 minutes
Notes
not defined yet
Code: 06:03:39 UTC,
java,
autosave
Code: 06:04:36 UTC,
cpp,
autosave
Code: 06:25:29 UTC,
c,
autosave
Code: 06:25:42 UTC,
c,
autosave
Code: 06:25:56 UTC,
c,
autosave
Code: 06:26:27 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int s(int juice[], int capacity[], int N)
{
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N) ;
if(max < value )
max= value;
}
}
Code: 06:26:36 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N)
{
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N) ;
if(max < value )
max= value;
}
}
Code: 06:27:18 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N)
{
if
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N) ;
if(max < value )
max= value;
}
}
Code: 06:27:29 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N)
{
if(j)
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N) ;
if(max < value )
max= value;
}
}
Code: 06:27:59 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i)
{
if()
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i) ;
if(max < value )
max= value;
}
}
Code: 06:28:13 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i)
{
if()
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i) ;
if(max < value )
max= value;
}
}
Code: 06:28:24 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i)
{
if()
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,) ;
if(max < value )
max= value;
}
}
Code: 06:28:40 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i)
{
if()
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,) ;
if(max < value )
max= value;
}
}
Code: 06:28:58 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int quant)
{
if(quant == )
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0) ;
if(max < value )
max= value;
}
}
Code: 06:29:28 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int quant)
{
if(quant == )
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,juice[],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:29:41 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int quant,int cap)
{
if(quant == )
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:29:51 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int quant,int cap)
{
if(quant == cap)
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:30:10 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:30:22 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:30:52 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if()
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:31:06 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant < cap)
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:31:16 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+ < cap)
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:31:27 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+ < cap)
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:31:37 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+ < cap)
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:31:49 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+juice[i+1] < cap)
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:32:01 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:32:36 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
re
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:32:47 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:33:08 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max();
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:33:24 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(),findMax());
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:33:48 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i,juice[i],capacity[i]),findMax(juice,capacity,N,i,juice[i],capacity[i]));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:34:03 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,juice[i],capacity[i]),findMax(juice,capacity,N,i,juice[i],capacity[i]));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:34:14 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,juice[i],capacity[i]),findMax(juice,capacity,N,i+1,juice[i],capacity[i]));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:34:38 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],capacity[i]),findMax(juice,capacity,N,i+1,juice[i],capacity[i]));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:34:55 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1]),findMax(juice,capacity,N,i+1,juice[i],capacity[i]));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:35:06 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1]),findMax(juice,capacity,N,i+1,quant,capacity[i]));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:35:16 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1]),findMax(juice,capacity,N,i+1,quant,cap));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:36:09 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap )
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1]),findMax(juice,capacity,N,i+1,quant,cap));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:36:18 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap || N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1]),findMax(juice,capacity,N,i+1,quant,cap));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,i,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:36:42 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap || N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1]),findMax(juice,capacity,N,i+1,quant,cap));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:37:07 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap || i==N-1)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1]),findMax(juice,capacity,N,i+1,quant,cap));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:37:21 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap)
{
int num=1;
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1]),findMax(juice,capacity,N,i+1,quant,cap));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:37:57 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap,)
{
int num=1;
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1]),findMax(juice,capacity,N,i+1,quant,cap));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:38:10 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1]),findMax(juice,capacity,N,i+1,quant,cap));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i]) ;
if(max < value )
max= value;
}
}
Code: 06:38:24 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,capacity,N,i+1,quant,cap));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
}
Code: 06:38:34 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,capacity,N,i+1,quant,cap,num));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
}
Code: 06:40:56 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,capacity,N,i+1,quant,cap,num));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
}
Code: 06:41:14 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
}
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,capacity,N,i+1,quant,cap,num));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
}
Code: 06:41:38 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,capacity,N,i+1,quant,cap,num));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
}
Code: 06:42:07 UTC,
c,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,capacity,N,i+1,quant,cap,num));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 1 expected 2
1.
0.001 s
WRONG ANSWER,
got 1 expected 3
1.
0.001 s
OK
1.
0.001 s
WRONG ANSWER,
got 1 expected 3
Code: 06:42:39 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,capacity,N,i+1,quant,cap,num));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
}
Code: 06:42:46 UTC,
c,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,capacity,N,i+1,quant,cap,num));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
return max;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 1 expected 2
1.
0.001 s
OK
1.
0.001 s
OK
1.
0.001 s
WRONG ANSWER,
got 2 expected 3
Code: 06:45:32 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,capacity,N,i+1,quant,cap,num));
}
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:45:42 UTC,
c,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,capacity,N,i+1,quant,cap,num));
}
return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
return max;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 1 expected 2
1.
0.001 s
WRONG ANSWER,
got 2 expected 3
1.
0.001 s
OK
1.
0.001 s
WRONG ANSWER,
got 2 expected 3
Code: 06:45:53 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,capacity,N,i+1,quant,cap,num));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:48:11 UTC,
c,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int capacity[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,capacity,N,i+1,quant,cap,num));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
return max;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 1 expected 2
1.
0.001 s
OK
1.
0.001 s
OK
1.
0.001 s
WRONG ANSWER,
got 2 expected 3
Code: 06:50:16 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int capacity[, int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,capacity,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,capacity,N,i+1,quant,cap,num));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:50:28 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,capacity,N,i+1,quant,cap,num));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:50:38 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,N,i+1,quant,cap,num));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,capacity,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:50:44 UTC,
c,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,N,i+1,quant,cap,num));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1) ;
if(max < value )
max= value;
}
return max;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 1 expected 2
1.
0.001 s
OK
1.
0.001 s
OK
1.
0.001 s
WRONG ANSWER,
got 2 expected 3
Code: 06:53:44 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,N,i+1,quant,cap,num));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:54:03 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1),findMax(juice,N,i+1,quant,cap,num));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:54:13 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:54:24 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:54:34 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:54:55 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(j==i)
{
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:55:18 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:55:48 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return fin
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:55:58 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:56:08 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 06:56:24 UTC,
c,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j));
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Analysis
Compile error
func.c: In function 'findMax':
func.c:19:52: error: expected ';' before ')' token
return findMax(juice,N,i+1,quant,cap,num,j));
^
func.c:19:52: error: expected statement before ')' token
Code: 06:56:34 UTC,
c,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i+1] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Analysis
expand all
Example tests
1.
0.001 s
OK
1.
0.001 s
WRONG ANSWER,
got 2 expected 3
1.
0.001 s
WRONG ANSWER,
got 2 expected 1
1.
0.001 s
OK
Code: 07:01:13 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 07:01:23 UTC,
c,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Analysis
expand all
Example tests
1.
0.001 s
OK
1.
0.001 s
WRONG ANSWER,
got 2 expected 3
1.
0.001 s
OK
1.
0.001 s
OK
Code: 07:10:14 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i]-,1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 07:10:24 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i]-juice[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 07:10:24 UTC,
c,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i]-juice[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 1 expected 2
1.
0.001 s
WRONG ANSWER,
got 2 expected 3
1.
0.001 s
OK
1.
0.001 s
WRONG ANSWER,
got 2 expected 3
Code: 07:11:30 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i]-ju,1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 07:11:39 UTC,
c,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap+juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 3 expected 2
1.
0.001 s
WRONG ANSWER,
got 4 expected 3
1.
0.001 s
OK
1.
0.001 s
OK
Code: 07:12:34 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(quant == cap || i==N)
{
return num;
}
else if(quant+juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],capjuice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 07:12:44 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(0 == cap || i==N)
{
return num;
}
else if(quant+juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 07:12:57 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(0 == cap || i==N)
{
return num;
}
else if(quant+juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i]-juice[],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 07:13:00 UTC,
c,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(0 == cap || i==N)
{
return num;
}
else if(quant+juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i]-juice[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Analysis
expand all
Example tests
1.
0.001 s
WRONG ANSWER,
got 1 expected 2
1.
0.001 s
WRONG ANSWER,
got 2 expected 3
1.
0.001 s
OK
1.
0.001 s
WRONG ANSWER,
got 2 expected 3
Code: 07:13:27 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(0 == cap || i==N)
{
return num;
}
else if(quant-juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i]-juice[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 07:13:49 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(0 == cap || i==N)
{
return num;
}
else if(juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i]-juice[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 07:13:57 UTC,
c,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(0 == cap || i==N)
{
return num;
}
else if(juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+1],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i]-juice[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Analysis
expand all
Example tests
1.
0.001 s
OK
1.
0.001 s
WRONG ANSWER,
got 2 expected 3
1.
0.001 s
OK
1.
0.001 s
OK
Code: 07:15:23 UTC,
c,
autosave
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(0 == cap || i==N)
{
return num;
}
else if(juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i+1],cap-juice[i+],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i]-juice[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Code: 07:15:32 UTC,
c,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(0 == cap || i==N)
{
return num;
}
else if(juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i],cap-juice[i],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i]-juice[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Analysis
Code: 07:15:54 UTC,
c,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(0 == cap || i==N)
{
return num;
}
else if(juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i],cap-juice[i],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i]-juice[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Analysis
Code: 07:15:58 UTC,
c,
final,
score:
47
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n");
int max(int n1, int n2)
{
return n1>n2?n1:n2;
}
int findMax(int juice[], int N,int i,int quant,int cap,int num,int j)
{
if(0 == cap || i==N)
{
return num;
}
else if(juice[i] <= cap && i!=j)
{
return max(findMax(juice,N,i+1,quant+juice[i],cap-juice[i],num+1,j),findMax(juice,N,i+1,quant,cap,num,j));
}
else
{
return findMax(juice,N,i+1,quant,cap,num,j);
}
// return num;
}
int solution(int juice[], int capacity[], int N) {
int i,max=1,value;
for(i=0;i<N;i++)
{
value = findMax(juice,N,0,juice[i],capacity[i]-juice[i],1,i) ;
if(max < value )
max= value;
}
return max;
}
Analysis summary
The following issues have been detected: timeout errors.
Analysis
Detected time complexity:
O(N**2 * log(N))
expand all
Correctness tests
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
5.
0.001 s
OK
6.
0.001 s
OK
7.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
5.
0.001 s
OK
6.
0.001 s
OK
not_biggest_capacity
Tests in which the glass with the biggest capacity is not the one that should be picked as the base.
Tests in which the glass with the biggest capacity is not the one that should be picked as the base.
✔
OK
1.
0.001 s
OK
2.
0.001 s
OK
not_biggest_capacity_left
Tests in which the glass with the largest empty space is not the picked as the base.
Tests in which the glass with the largest empty space is not the picked as the base.
✔
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.728 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
expand all
Performance tests
medium_mix
All kind of tests, N <= 10,000.
All kind of tests, N <= 10,000.
✘
TIMEOUT ERROR
running time: 0.100 sec., time limit: 0.100 sec.
running time: 0.100 sec., time limit: 0.100 sec.
1.
0.001 s
OK
2.
0.100 s
TIMEOUT ERROR,
running time: 0.100 sec., time limit: 0.100 sec.
3.
0.001 s
OK
big_mix
All kind of tests, N <= 100,000. Points x 2.
All kind of tests, N <= 100,000. Points x 2.
✘
TIMEOUT ERROR
Killed. Hard limit reached: 6.000 sec.
Killed. Hard limit reached: 6.000 sec.
1.
0.001 s
OK
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
3.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
4.
0.012 s
OK
5.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
big_corner_cases
Big tests with extreme values. Points x 2.
Big tests with extreme values. Points x 2.
✘
TIMEOUT ERROR
running time: 2.452 sec., time limit: 0.100 sec.
running time: 2.452 sec., time limit: 0.100 sec.
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
2.452 s
TIMEOUT ERROR,
running time: 2.452 sec., time limit: 0.100 sec.
5.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
big_capacity
Tests in which glasses have big capacity. Points x 2.
Tests in which glasses have big capacity. Points x 2.
✘
TIMEOUT ERROR
Killed. Hard limit reached: 6.000 sec.
Killed. Hard limit reached: 6.000 sec.
1.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
1.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
3.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
4.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
5.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.