OJ Board

if i solve any problem by BIGint class then i have to send it with the class to the judge.
will any one tell me that in a real time contest, how i can afford to solve a problem using BIGint class of mr. sumon ( i appritiate him as i like the class) .
so, if i hv to write in the contest time the how ...

hi,
i am getting WA in that problem.
my program generates good ans for all the inputs in the board.
will any one help me.
here is my code:

#include<stdio.h>
#define sz 502

int main()
{
long arr[sz][sz],w,h,sub,s,i,j,x1,y1,x2,y2,flag=0,temp,count;
while(scanf("%ld %ld %ld",&w,&h,&sub)==3 && (w ...

as soyoja wrote:

The only trick of this problem is distinguish between clockwise and
counter-clocwise.
Counting angle for clockwise is (start point) - ( end point )
Counting angle for counter clockwise is (end point) - (start point )



i know, in above way the problem will be accecpted but i ...

as kmhasan written,

You can add "mediants" [(numerator of leftnum+numerator of right num)/(denominator of leftnum+denominator of rightnum)] in between the numbers as long as the denominator is <= N. :wink:

0/1,1/1
0/1,1/2,1/1
0/1,1/3,1/2,1/1
0/1,1/3,1/2,2/3,1/1
and so on....

i understood ...

thak u dp,
i got the problem,and got ac.
bye
altaf

removed after got acc

hi, i am getting wa in 574. plz help me :::
here my code:
:

#include<stdio.h>
#include<math.h>
#define max_sz 100

int in[max_sz],pre_sol[max_sz],none,pre_k;

void construct_candidates(int a[],int k,int n,int c[],int *ncandidates){
int i;
*ncandidates=0;
for(i=a[k-1]+1;i<=n;i++)
c ...

i am still getting WA. Please help!!!

here my code:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>

#define sz 30010


void main(){
int array [sz],n,num[40],sum,Max,i,j,cas=0,flag,pre_num;

while ( scanf ( "%d" , &n ) == 1 ) {
pre_num = Max=0;

memset( array, 0 , sizeof (array ...

another WA.now without sort.
thanks for yr (respected Thowid) reply.

my modified code:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>

#define sz 30010


void main(){
int array [sz],n,num[40],sum,i,j,cas=0,flag,pre_num;

while ( scanf ( "%d" , &n ) == 1 ) {
pre_num = 0;

memset ...

i am getting wa in 10930. i saw all the post in the board but getting the same result. hope u will help me to get it AC.



here is my code:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>

#define sz 30010

int comp_fun(const void *a, const void *b){
int *x=(int*) a;
int *y =( int* ) b ...