ok for all test case in this place but get WA.
Help.
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#define MAXNODES 8
using namespace std;
class Node
{
public:
double x,y;
Node(){}
Node(double i,double j){x = i ; y = j;}
double getDist(Node a){return sqrt((x-a.x ...
Search found 4 matches
- Fri Nov 10, 2006 12:50 am
- Forum: Volume 2 (200-299)
- Topic: 216 - Getting in Line
- Replies: 57
- Views: 31093
- Fri Sep 15, 2006 2:55 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10616 - Divisible Group Sums
- Replies: 39
- Views: 25876
10616
my result for all test cases in this thread is true.
but i get wrong answer.
Can anyone explain me ,why?
#include <iostream>
#include <algorithm>
#define maxElement 202
#define maxSelect 12
#define maxDiv 21
using namespace std;
long long treasure[maxSelect][maxDiv][maxDiv];
int in[maxDiv];
void ...
but i get wrong answer.
Can anyone explain me ,why?
#include <iostream>
#include <algorithm>
#define maxElement 202
#define maxSelect 12
#define maxDiv 21
using namespace std;
long long treasure[maxSelect][maxDiv][maxDiv];
int in[maxDiv];
void ...
- Tue Aug 15, 2006 4:42 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10908 - Largest Square
- Replies: 37
- Views: 25729
Thanks.
so thanks, i make a very ... mistake.i get AC.[/i]
- Tue Aug 15, 2006 2:45 am
- Forum: Volume 109 (10900-10999)
- Topic: 10908 - Largest Square
- Replies: 37
- Views: 25729
10908
i dont know what i get wa.
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector <int > out;
char treasure[101][101];
int solve(int M,int N,int R,int C)
{
int left,right,top,down;
int TR,TC;
int maxV,maxH;
int diffV,diffH,diff;
int Bound;
int Result = 1 ...
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector <int > out;
char treasure[101][101];
int solve(int M,int N,int R,int C)
{
int left,right,top,down;
int TR,TC;
int maxV,maxH;
int diffV,diffH,diff;
int Bound;
int Result = 1 ...