OJ Board

hey my code shows WA for perfect square number:( can someone tell me how to handle this problem?

wot is the prime algorithm for this cardinality problem?

--regards

can someone tell why am i getting WA? :(
I have checked all the test cases provided by the Electronic board. I cannot uderstand also wot wud b the calculation for a=180;


#include<stdio.h>
#include<math.h>
#include<string.h>

#define MAX 5
//#define pi 3.14159265358979323846
#define R 6440



int ...

hey Daveon Thanx a lot. I get AC @last:D

can anyone tell me wot is the problem wid my code for b2-sequence? Im still getting WA:(

///removed

can someone tell me why my code shows the CE?

#include<stdio.h>
#include<conio.h>

int find_min(int p,int q)
{
if(p>q)
return q;
else
return p;


}

int main(void)
{
long cs;
int m, n;
char chpcs;

scanf("%ld", &cs);

while(cs)
{
chpcs=getch();
scanf("%d %d",&m,&n);

if(chpcs=='r ...

#include<stdio.h>
#include<conio.h>

int find_min(int p,int q)
{
if(p>q)
return q;
else
return p;


}

int main(void)
{
long cs;
int m, n;
char chpcs;

scanf("%ld", &cs);

while(cs)
{
chpcs=getch();
scanf("%d %d",&m,&n);

if(chpcs=='r'||chpcs=='Q')
printf("%d\n", find_min(m,n ...