10489 - Boxes of Chocolates

[Chow Wai Chung]

This problem seems quite easy, but i got a WA

I had consider about the overflow problem, and use long long to store some variable.

world anyone can point out that where is my mistaker, please??

[c]
#include <stdio.h>

int main()
{
long long total,tmp;
int num,n,b,k,box;
scanf("%d",&num);
while(num-->0)
{
scanf("%d %d",&n,&b);
total=0;
while(b-->0)
{
tmp=1;
scanf("%d",&k);
while(k-->0)
{
scanf("%d",&box);
tmp*=box;
}
total+=tmp;
}
printf("%lld\n",total%n);
}
return 0;
}
[/c]

[Chow Wai Chung]

isn't it just simple sum all a1*a2*a3.... and mod the number of friend??

but why i got a WA??

[erfan]

It should not need long long.It also AC at long.
You can change your code by this way.

tmp*=box;
tm=tmp%n;
}
total+=tmp;
total=total%n;
}

I think now AC.

[Chow Wai Chung]

thank you very much to erfan!!!!

I got AC now

It looks like i have to improve my maths.

[babor]

Hai find modulas at each and every step tot avoid time limit & overflow

[p!ter]

Hi,

Could anyone tell me whats wrong with my code? I think output is ok.

Code: Select all

#include <stdio.h>

int main() {

    int l,N,T,B,r,K,box;
    long long w,d;
    
    scanf("%d",&T);
    while(T--) {
        scanf("%d%d",&N,&B);
        w=0;
        while(B--) {
            scanf("%d",&K);
            d=1;
            while(K--){ 
                scanf("%d",&box);
                d=d*box;
            }
            w=w+d;
        }
        r=w%N;
        printf("%d\n",r);
    }
    return 0;
}

THANKS!!!

[Larry]

It might still overflow. Look up on the Chinese remainder theorem.

[p!ter]

What does it mean overflow?
Could you explain me that and how can I check it?

[Jemerson]

Hi guys, im not a nice C++ programmer so i think the problem is that I couldnt code the problem correctly, any help?

Code: Select all

CUT AFTER ACC

[daveon]

Hi,

Just add

Code: Select all

total %= numFriends;

after

Code: Select all

 total += result;

and you should get AC.

[Jemerson]

Thanx a lot, I understood my mistake

[stalf]

Could you help me with 10489?
This is my code, and i'm getting wa...

Code: Select all

#include <iostream>

using namespace std;

int main(){
	int t,n,b,k,aux;
	long result;
	cin>>t;
	for(int i=0;i<t;i++){
		cin>>n;
		cin>>b;
		long total = 0;
		for(int j=0;j<b;j++){
			long partial = 1;
			cin>>k;
			for(int m=0;m<k;m++){
				cin>>aux;
				partial = partial*aux;
				partial = partial%n;
			}
			total += partial;
		}
		cout<<total%n<<endl;
	}
}

[stalf]

thanks
got ac [=

[uDebug]

Here's some input / output that I found useful while testing / debugging.

Input:

Code: Select all

3
7 3
6 8 9 3 4 100 98 
7 87 64 23 12 88 44 99
3 65 48 76
17 3
10 65 32 88 8 9 3 4 100 98 99 
10 100 78 66 87 64 23 12 88 44 99 
20 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 
23 3
10 65 32 88 8 9 3 4 100 98 99 
10 100 78 66 87 64 23 12 88 44 99 
24 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 

Output:

Code: Select all

4
11
6