OJ Board

Hi My Code Gives write answer too all test cases that i have tested. but it gives run time error on some test cases. I tries to find the reason but i couldn't. please help me. i use 2 Floyd-Warshal s to solve it #include <algorithm> #include <iostream> #include <cstdio> #include <vector> using names...

i think the answer for n is round((n-3)^2/12)
if it's spoiler tell me to delete it?

@baodog: Your code prints an extra unprintable character at the end of each line on my machine. But it looks otherwise ok. @hamedv: I'm curious about the O(n^2) DP you mentioned. The simple brute force way of solving this problem is also O(n^2). Could you please post an outline of your idea? I mean...

I keep track of used numbers so far a the first dimension of an array. The other 2 dimensions are length and the last digit. For example 5 (101) means that I used numbers (0 and 2). When I find answers for each length I iterate through (111) values for each length and every digit to the left of the...

Try these:

input: correct output: replace this line by this:

if (LASTDIGIT = 0 ans DIGITS = 1) ----------- mydpfunction(BASE, DIGITS, LASTDIGIT) = 0; IMHO the problem may be here. Don't assume, that the number 0 can't be used in DIGITS > 1. Since the number 10 is produced by adding 1 to zero. Once you have found the answer of a particular length. You can ite...

yes you are right but can you tell me why i'm getting WA: mydpfunction(BASE, DIGITS, LASTDIGIT) = number of the beautiful numbers in base BASE which have DIGITS digits and their last digit is LASTDIGIT. if (LASTDIGIT = 0 and DIGITS = 1) ----------- mydpfunction(BASE, DIGITS, LASTDIGIT) = 0; if (DIGI...

Yes, i don't know too

There were problems like this an i solved them using DP, because the input size was less than 1000 but in this problem it's so huge.

i think it's a simple DP problem but i'm getting WA :( here is my code: #include <iostream> using namespace std; int main() { long long dp[11][101][10]; memset(dp, 0, sizeof dp); for (int i = 0; i < 11; i++) for (int j = 0; j < 10; j++) if (j) dp[i][1][j] = 1; else dp[i][1][j] = 0; for (int base = 2...

but i think the correct code is this:

Yeah i submited this code and got ac !!!
main(){}

Hi I'm getting WA but i don't know why does my code fail? I have checked it with many I/O from this site: http://uvatoolkit.com/ Please give me an input that my code gives wrong answer to it? #include <algorithm> #include <iostream> #include <cstring> #include <cstdlib> #include <sstream> #include <...

Hi
I don't know why my code produces 352 triples. It also produced 352 triples after I changed my code as you said in previous posts. Please tell me which triples am i missing?
Here is my code:

if a number is a multiple of 2 it's first digit must be 0 or 2 or 4 or 6 or 8.
and if a number is a multiple of 5 it's first digit must be 0 or 5.
due this a number which is like this "11..11" is not a multiple of 2 or 5.

problem 10127 is another version of this problem. you can code it in less than 15 lines. in this problem numbers can be multiple of 2 or 5 because you can add zeros to the end of your number.