OJ Board

Can someone please point out why I'm getting WA for this code? It's just a straightforward implementation of Floyd-Warshall...


#include <iostream>
#include <algorithm>
#include <iomanip>

using namespace std;

int main()
{
int Case = 0;
while (true)
{
const int MAX = 20;
const int INF ...

I'm getting WA for my code. Can someone please spot the error...


#include <iostream>

using namespace std;

const int MAX = 10000;

int MallA[MAX][2] = { 0 };
int APoints = 0;
int MallB[MAX][2] = { 0 };
int BPoints = 0;

int GetDist(int X1, int Y1, int X2, int Y2)
{
int Horizontal = Y1 - Y2;
if ...

My program gives Runtime Error - Invalid Memory Reference. I understand this could be because my arrays are going out of bounds some place but I can't spot anything. Someone help please...


#include <iostream>
#include <cstring>
#include <cctype>

using namespace std;

const int MAX = 6000;
char ...

could someone please help me with this code...

#include <stdio.h>
#include <stdlib.h>

#define MAX 1000

float round(float a)
{
char b[128] = { 0 };

sprintf(b, "%.2f", a);
a = atof(b);

return a;
}

int main()
{
int Students = 0;
float Spent[MAX] = { 0.0 };
float Total = 0.0;
float ...

Why is this code WA? It works for all the sample input on this board.


#include <stdio.h>
#include <stdlib.h>

#define MAX 1000

float round(float a)
{
char b[128] = { 0 };

sprintf(b, "%.2f", a);
a = atof(b);

return a;
}

int main()
{
int Students = 0;
float Spent[MAX] = { 0.0 };
float ...

strange! the first time i tried it gave compile error! thnx for your time nyways!

Can anyone find any error in this code? It compiles fine in gcc but the oj flags compile error: parse error b4 character 0222

AC

can someone please tell me what is wrong with this C code...


#include <stdio.h>

int main()
{
int n = 0;
int r = 0;
unsigned int Result = 1;
double Temp = 1.0;
int i = 0;

while (1)
{
scanf("%d %d", &n, &r);

if (n == 0 && r == 0)
break;

r = n - r < r ? n - r : r;

for (i = r ...

I don't get it! Now i'm getting WA!!!


#include <iostream>

using namespace std;

int main()
{
short a = 0;
short f = 0;
short n = 0;

cin >> n;

while(n)
{
cin >> a;
cin >> f;

for(char i = 1; i <= f; i++)
{
for(char j = 1; j <= a; j++)
{
for(char k = 1; k <= j; k++)
cout << (int ...

I don't know what but something about your sieve code is just SOO right, asif_rahman! thanks a lot! i don't know how but your code got my program accepted!

Input:
1

3
2

Output:
1\n
22\n
333\n
22\n
1\n
\n
1\n
22\n
333\n
22\n
1\n


Should I remove the last '\n' ?

That's a really cool method! Thanks! But I still don't get why the oj flags runtime error for my original program!

this program seems t conform to all the rules but still gets PE! help!


#include <iostream>

using namespace std;

int main()
{
short a = 0;
short f = 0;
short n = 0;

cin >> n;

while(n)
{
cin >> a;
cin >> f;

for(char i = 1; i <= f; i++)
{
for(char j = 1; j <= a; j++)
{
for(char ...

this code works for all test cases on my pc, but with oj it give runtime error floating point exception! somebody please help!

info:
i use sieve of eratosthenes to compute all prime nos >=2 <= 100.