I used BFS and still getting WA.
Can anyone help me with this pls
#include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
class Node
{
public:
Node(){}
char color;
int d;
};
class Queue
{
public:
Queue(int n)
{
Q = new int[n];
len = 0;
}
int len;
int* Q;
void ...
Search found 4 matches
- Fri Aug 08, 2014 2:38 pm
- Forum: Volume 3 (300-399)
- Topic: 383 - Shipping Routes
- Replies: 27
- Views: 10760
- Wed Aug 06, 2014 4:22 pm
- Forum: Volume 1 (100-199)
- Topic: 125 - Numbering Paths
- Replies: 56
- Views: 11388
Re: 125 why PE ?
got AC!!
ty so much :X
ty so much :X
- Wed Aug 06, 2014 3:47 pm
- Forum: Volume 1 (100-199)
- Topic: 125 - Numbering Paths
- Replies: 56
- Views: 11388
125 why PE ?
my code for output is:
cout<<"matrix for city "<<city<<endl;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
cout<<r[j]<<" ";
cout<<endl;
}
what is the problem?
cout<<"matrix for city "<<city<<endl;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
cout<<r[j]<<" ";
cout<<endl;
}
what is the problem?
- Sat May 31, 2014 3:28 pm
- Forum: Volume 1 (100-199)
- Topic: 102 - Ecological Bin Packing
- Replies: 485
- Views: 116656
Why WA in Problem 102
#include <iostream>
#include <cstdio>
using namespace std;
void check(int b,int g,int c);
long long int boxes[3][3];
char bin[3];
long long int Min,sum;
int main()
{
bool flag = false;
while(!flag)
{
Min = 999999999999999999;
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
if(scanf("%lld ...