OJ Board

@Amin
I think your code is almost right. Just change data type for some variable or use type casting, like use "double usum,sum[]". In your last output section within loop i think no need to use else{},becoz sum[] already hold 0.00.

I think this is the Key line of this problem " The percent of whole income that i-th friend will get is equal to the part of his unique stamp's type. "
I got several times WA but finally got the thing & get ACC.
Try this I/O:
Input:
3
3
3 1 1 2
2 4 5
3 4 2 6
3
3 2 2 2
2 4 4
3 5 5 5
3
3 0 1 0
2 4 ...

I think this is the Key line of this problem " The percent of whole income that i-th friend will get is equal to the part of his unique stamp's type. "
I got several times WA but finally got the thing & get ACC.
Try this I/O:
Input:
3
3
3 1 1 2
2 4 5
3 4 2 6
3
3 2 2 2
2 4 4
3 5 5 5
3
3 0 1 0
2 4 ...

try this I/O. generating output by my Acc code.
Input : Output : Hope this will help you.

@tahmiid
I did not get ur procedure.I did not understand why u use n^4 when it can be solved only by counting?
Hope u will get it.

Any one has any critical test cases?
I did not find why my code goes for WA.I think my floodfill is ok Thanks in advance

WA

My code passed all input given in this thread.But still WA.Can anyone plz help me.It also works for disconnected graph

please help me......
Why I have got TLE, can't understand

#include<iostream>
#include<vector>
#define inf 1000000000
#define SIZE1 20000
#define SIZE2 50000
using namespace std;

typedef vector<int>graph;
long Q[SIZE1+9],d[SIZE1+9];

graph G[SIZE2*2+9],W[SIZE2*2+9];

//min_heapify with respect ...

I simply do mst then if reachable from the given station sum up it. if anyone not reachable then impossible.If am wrong can anybody help me. Here is my code:

What's wrong in my code.I check all input test given in the board. But still WA.Can anyone plz help me. // Union finding-793
#include<stdio.h>
#include <string.h>
#include <stdlib.h>

long p[1000000];
long parent(long x)
{
if(p[x]==-1)
return x;
else{
p[x]=parent(p[x]);
return p[x];
}
}

int ...

Thanks Igor9669 really ugly output format.Finally AC after 4 TLE & 1 WA

I Got WA again & again.Can anyone help me.What's problem in my code.
Thanks in advance. #include<iostream>
#include<string.h>
using namespace std;
int main()
{
long i,j,k,l,m,n,x,max;
char s[105][105],party[105][105],s1[10001];

scanf("%ld",&n);
x=0;
while(n--)
{
long a[1001]={0};
x ...

What's problem in my Code .PLZ help. #include <iostream>
#include<string.h>
#include <algorithm>
using namespace std;

int main ()
{

long i,j,k,l,n;
char myints[1000],s[1001];
scanf("%ld",&n);
while(n--)
{
long a[130]={0};

scanf("%s",&myints);

k=strlen(myints);
for(i=0;i<k;i++)
{
a ...

Can Any one PLZ Help me.My Code is here.Can Any one give me any critical input output. #include<iostream>
#include<cstring>

using namespace std;
char P[1001][1001],Q[1001][1001];
long c[3001][3001],b[3001][3001],p;

// ******************
void LCS(long x1,long y1)
{
long i,j,m,n,last;
m=x1;
n=y1 ...