#include<stdio.h>
int check
(int time,int rank
[],int n
,int prata
) //for given time find max prata {
int max[8];
int sum=0;
for(int i=1;i<=8;i++)
{
int temp=0; //time total
int x=0; //total prata
for(int j=1;;j++)
{
temp+=(j*i);
break;
x++;
}
max[i-1]=x;
}
//for(int i=0;i<8;i++)
// printf("%d\t",max[i]);
//printf("\n");
for(int i=0;i<n;i++)
sum=sum+max[rank[i]-1];
//printf("Sum = %d\n",sum);
if(sum>=prata)
return 1;
return 0;
}
int main()
{
int test,p,l;
//int arr[]={1,1,1,1,1,1,1,1};
//check(1,arr,8,8);
while(test--)
{
int arr[l];
for(int i=0;i<l;i++)
int low=1,high=99999999;
while(low<high-1) //To check later
{
//printf("HI");
int mid=(low+high)/2;
if(check(mid,arr,l,p))
high=mid;
else
low=mid; //To check
}
}
return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4KaW50IGNoZWNrKGludCB0aW1lLGludCByYW5rW10saW50IG4saW50IHByYXRhKQkvL2ZvciBnaXZlbiB0aW1lIGZpbmQgbWF4IHByYXRhCnsKCWludCBtYXhbOF07CglpbnQgc3VtPTA7Cglmb3IoaW50IGk9MTtpPD04O2krKykKCXsKCQlpbnQgdGVtcD0wOwkvL3RpbWUgdG90YWwKCQlpbnQgeD0wOwkvL3RvdGFsIHByYXRhCgkJZm9yKGludCBqPTE7O2orKykKCQl7CgkJCQoJCQl0ZW1wKz0oaippKTsKCQkJaWYodGVtcD50aW1lKQoJCQkJYnJlYWs7CgkJCXgrKzsKCQl9CgkJbWF4W2ktMV09eDsKCX0KCQoJLy9mb3IoaW50IGk9MDtpPDg7aSsrKQoJLy8JcHJpbnRmKCIlZFx0IixtYXhbaV0pOwoJLy9wcmludGYoIlxuIik7CgkKCWZvcihpbnQgaT0wO2k8bjtpKyspCgkJc3VtPXN1bSttYXhbcmFua1tpXS0xXTsKCS8vcHJpbnRmKCJTdW0gPSAlZFxuIixzdW0pOwoJaWYoc3VtPj1wcmF0YSkKCQlyZXR1cm4gMTsKCXJldHVybiAwOwp9CmludCBtYWluKCkKewoJaW50IHRlc3QscCxsOwoJLy9pbnQgYXJyW109ezEsMSwxLDEsMSwxLDEsMX07CgkvL2NoZWNrKDEsYXJyLDgsOCk7CglzY2FuZigiJWQiLCZ0ZXN0KTsKCXdoaWxlKHRlc3QtLSkKCXsKCQlzY2FuZigiJWQlZCIsJnAsJmwpOwoJCWludCBhcnJbbF07CgkJZm9yKGludCBpPTA7aTxsO2krKykKCQkJc2NhbmYoIiVkIiwmYXJyW2ldKTsKCQlpbnQgbG93PTEsaGlnaD05OTk5OTk5OTsKCQl3aGlsZShsb3c8aGlnaC0xKQkJLy9UbyBjaGVjayBsYXRlcgoJCXsKCQkJLy9wcmludGYoIkhJIik7CgkJCWludCBtaWQ9KGxvdytoaWdoKS8yOwoJCQlpZihjaGVjayhtaWQsYXJyLGwscCkpCgkJCQloaWdoPW1pZDsKCQkJZWxzZQoJCQkJbG93PW1pZDsJLy9UbyBjaGVjawoJCX0KCQlwcmludGYoIiVkXG4iLGhpZ2gpOwoJfQoJcmV0dXJuIDA7Cn0=