OJ Board

Why I m getting WA.


#include<stdio.h>

int main()
{
/*
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
*/
char cyper[26]={'z','y','x','w','v','u','t','s','r',
'q','p','o','n','m','l','k','j','i','h','g','f','e','d','c',
'b','a'};
char ch;
int test,T=1;
scanf("%d",&test ...

Why i got WA everytime...I think its a very simple BFS.


#include<cstdio>
#include<stack>
#include<queue>
#include<set>
using namespace std;

class Net{

private:

long I,J,path[305],m,n,sou,des,test;
queue<long> Q;
stack<long> P;
set<long> s[305];
set<long>::iterator it;
bool flag[305 ...

I dnt know why i getting WA...I passed all I/O in boards...Help me pls..Here is my code.. :cry:



#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
long t=0;
class Die{

private:
char cast[60][60],ch;
vector<long> v,x,s,sorting;
long I,J;

public:
bool Input ...

vul sobi vul

On this problem Read this line Carefully to avoid WA.
"Factorial numbers are expressible as the multiplication of zero or more prime numbers."

Faiem Rahman
MBSTU,Bangladesh.

In this problem must use "unsigned char"...Or u will get WA...again and again just like me.

#include<stdio.h>

int main()
{
char ch;long I,sum=0,n=0;
while((ch=getchar())!=EOF)
{


if(ch>=48&&ch<=57)
{sum=sum+ch-48;n=1;
}

else
{
if(ch=='b')
{for(I=1;I<=sum;I++)
printf(" ");
}
else if(ch=='!')
{ printf("\n");

}

else if(ch!='\n')
{
for(I=1;I<=sum;I++)
printf("%c",ch ...

whats the problem of the formula (n*(n+1)/2)^2 ???
i got AC.but using another formula to solve it.
anyone can explain me whats happen with this formula???

"Output a blank line after each set."
Read this Carefully...its a problem about input/Output...

ur Output should look like.......

6
5 2 4 1 7 5
Set #1
The minimum number of moves is 5.

4
5 10 3 2
Set #2
The minimum number of moves is 5.

0


Wish ur best luck....

why u r sorting???
it is possible without sorting...and very fast...

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

double a[101][2],b,i,j,k,m,p,c=0, l,r;

main()
{

while(scanf("%lf",&b)==1)
{
if(b==0)
break;

c=0;
for(i=1;i<=b;i++)
for(j=0;j<2;j++)
scanf("%lf",&a [j]);
scanf("%lf",&r);
r=r*2;

p=b-1;
m=2;
for(i=1;i<b;i++)
{
k=m;
for(j=p;j>=1;j--)
{
l=((a [0]-a[k][0])*(a ...

Now I got AC...

I found my problem.
The Output should....
10 2
10 2: 2 3 5

1 1
1 1: 1

my mistake is blank space between output....

Remember,
The Output should....
1 1
1 1: 1
(blank space is here)
21 2
21 2: 5 7 11

Now try......