OJ Board

in your code
in bigmode function
you have declared long
but return x*x;
this might be very big.
this is an error. you need long long here iguess


another mistake i believe is in your algorithm
what will be the output in this case:
1
A1B1
B1A1

i think there are two unique sequences A1B1 B1A1
but ...

can anyone show me why sorting and adding like this gives the minimum result? can anyone show the proof?

Please give me some critical test cases for this prob

please help.im getting wa. heres my code.

#include<iostream>
#include<string.h>
#include<math.h>
#define pi 2*acos(0.0)/180
using namespace std;

int main()
{
long cases,n;
double x,y,k;
double thita;
double f,g;
long F,G;

while(scanf("%ld",&cases)==1)
{
while(cases--)
{
x=0,y=0;
thita ...

ok ive got ac, there was a silly mistake.ive removed my code.howevr these input output are ok

can anyone help me how to solve this problem? i have thought of a solution like this:

S=ax+by

let the food portion size if u

for first person,

i1=amount he needs
x1= amount wasted
y1=how many times he goes to fetch food

x1=u*ceil(i1/u)-i1
y1=ceil(i1/u)

s1=ax1+by1=(au+b)*ceil(i1/u)-a*i1 ...

Here is my code

removed after ac

here are some input output i got from my program.

input:
5 4
3 1 2 0
3 1 2 0
3 1 3 0
4 4 4 0
5 5 0 4
1 1
1
5 4
21 21 54 87
56 89 23 21
654 987 321 0
12 56 57 59
10 20 30 60
6 4
0 0 0 0
1 1 1 1
0 0 0 0
2 5 6 4
0 2 6 1
0 0 0 0
0 0

Output:
0 / 1
0 / 1
0 / 1
0 / 1 ...