OJ Board

mhayter1

Hi, I've past all test cases on the forum, and I use a 64 bit data type without success. Could anyone help?

#include<iostream>
#include<algorithm>
using namespace std;

const unsigned long long SIZE=500;
unsigned long long memo[SIZE][SIZE];
bool found[SIZE][SIZE];
unsigned long long n;

inline ...

mhayter1

Hi! I've modified my code and I pass all the test cases given on the forums. I submit my code but it gets WA. Could someone please help me? Here's my code:

#include<iostream>
using namespace std;

struct item
{
int cost;
int findex;
};

const int NITEMS=110;
const int MAXSUM=10210;
item items ...

mhayter1

Can someone please help me. This problem is supposed to be easy, but I'm having a very tough time with it. My output seem right. Can someone point out the error in my code or give my inputs to break it. Thank you!

#include<iostream>
#include<string>
#include<sstream>
#include<algorithm>
#include ...

mhayter1

Could someone please give me test cases or something. Please

mhayter1

Can someone explain to me how the code in the Programming challenges book is used? The code seems to reference other code that it does not include. Is anyone familiar with this book? I'm trying to study algorithms and I was hoping to learn.

Thanks.

mhayter1

Could someone give me some test cases for this problem. Apparently I don't understand the problem. I'm also a newbie when it comes to algos.
I out which algo to use, which is a big success, but I not getting AC.

Here's my code:

/*
ID:mhayter1
PROG:ride
LANG:C++
*/
#include <iostream>
#include ...

mhayter1

Thank you for your reply. It is very strange. I just recompiled my code and submitted it and it was accepted. Why did it get WA in the first place?
Thanks anyway!!

mhayter1

On the problem cutting pizza. This works:

Code: Select all

cout<<((n*(n+1))/2)+1<<endl;

but this doesn't

Code: Select all

cout<<n*n*.5+n*.5+1<<endl;

you must change it to this:

Code: Select all

cout<<(long long)n*n*.5+n*.5+1<<endl;

does anyone know why this is?

mhayter1

Input:

100 200

999999999999999 1

00010 9

1 9

1 9

5 5

456 654

0 0

Output:

3

1

9001

1

1

1

111

0

mhayter1

I would but I don't know how. Could someone tell me?

mhayter1

Please remove your code from the forum.

mhayter1

Gee!!Thanks for your reply!

I got AC!!

mhayter1

You need to change this portion of code.

Code: Select all

if(lookup[str1[i]]=='\0') 
       { 
           mirror[i]=str1[i]; 
           return 0;
       }

mhayter1

I too have have problems with this problem(WA). There are no test cases posted other than the ones on the problem, which my program outputs correctly. Can anyone give me test cases or find a problem in my code?

#include<iostream>
#include<string>
using namespace std;

bool isprime(int n)
{
if(n ...

mhayter1

Given the test cases available on the forum, I think I only got one wrong.
This is my output:

NOTAPALINDROME -- is not a palindrome.

ISAPALINILAPASI -- is a regular palindrome.

2A3MEAS -- is a mirrored string.

ATOYOTA -- is a mirrored palindrome.

MAIAM -- is a mirrored palindrome.

123ESI ...

OJ Board

Search found 15 matches

What's the Longest nap?

programming challenges source code

Test cases

Unusual

Palindromes problems (401)