OJ Board

I see.

So I will have to change my approach.

Thanks guys. I'll tell if I can figure ou a solution for this.

My goal in this construct is metaprogramming. For instance, I could define integral types as those whose members are either machine types or integral types and do not have default constructors or destructors implemented.

Then, instead of trait, I could name the template pointed_value_is_integral ...

Oh, I got it. You mean X<int>::Y is the same as X<float>::Y.

But what if I put something like typedef T type; inside Y? Then I should be able to solve this.

The problem is that I can not get this working even then.

I think, one of the template specializations is not correct:

template<typename T> struct trait< typename X<T>::Y > {
typedef true_type value;
};



This is the one I am not sure about. Nevertheless, it compiles with no warnings in my gcc 4. Microsoft's compiler is known for getting nothing ...

I have been programming in C++ for a long time, but recently I stepped in a difficult problem with the language.

I have defined a type trait for to be used with a type defined as an inner class, but could not specialise the template of the trait.

The code below is my problem in its simplest form ...

Sorry to delay so much to answer, I was lacking internet connection.

I see, it happens that we assumed many things to get to our result. We will give up this, we wasted four ours in this problem in the day we used it in our contest. I only wish I could know what is wrong with our theroy.

Thank you. I will check our proof once more after examining the input more carefully.

Could you tell me how why is it I can not win if I am given 64 26 with k = 1?

I have written a program which produces correct outputs to the inputs I have tried so far. While solving the problem a friend and I formulated a complicated theory and proved its correctness. Of course, we must have made a mistake in the proof, otherwise we would have received accepted. According to ...

Hello,

I found this problem very interesting at first, but when I tried to solve it, it became a nightmare.

The judge always either return WA or RE. The code below is WA.

Could anyone PLEASE a (the) bug in the code below. It is clear to understand.

Thanks in advance.


/* -------------
ACM UVA ...

Ah, the decoding function. Must it be injective?

I wrote the problem, ok. It works for every test I have tried but not for the one in the site. Can anybody check what is wrong with my code?


/*
------------
ACM UVA 843
Schultz

Crypt Kicker
------------
*/

/* imports */
#include<stdio.h>
#include<string.h>

#include<vector>
#include ...

Yes, there is one, but it requires a bit more thought.

Consider


/* calculates a^b mod m */
integer modpow(integer a, integer b, integer m) {
integer p = 1; // such that a0^b0 is always p*a^b
while (b != 0) {
if (b%2 == 0) b/= 2;
else {
b = (b-1)/2;
p = (p*a)%m;
}
a = (a*a)%m;
}
return ...

I have solved the 3n+1 problem by use of the memorisation method. In my computer, it solves the input "1 999999" 60 times faster than brute force. But when I submit it, besides getting AC, it takes over a second to get it correct, considering that the brute force took 3 seconds. Furthermore, I ...