## Search found 4 matches

Thu Nov 13, 2014 6:37 pm
Forum: Volume 127 (12700-12799)
Topic: 12790 - The "Win-stay and Lose-shift" Strategy
Replies: 3
Views: 1031

### Re: 12790 - The "Win-stay and Lose-shift" Strategy

What is the DP
Wed Oct 29, 2014 5:13 am
Forum: Volume 127 (12700-12799)
Topic: 12761 - Blue Chips
Replies: 9
Views: 1273

### Re: 12761 - Blue Chips

I can't understand these lines can you explain mor about them?
I then use exponentiation by squaring and matrix multiplication to compute the powers of two for that graph.
Then you can transform the X array K times in O(log K * N * N * N) for each test
Sat Oct 25, 2014 9:39 pm
Forum: Volume 127 (12700-12799)
Topic: 12761 - Blue Chips
Replies: 9
Views: 1273

### Re: 12761 - Blue Chips

#include "iostream" using namespace std; void process(unsigned long int n,unsigned long int k ,unsigned long int d) { unsigned long int h; unsigned long int x[50]; unsigned long int y[50]; for( unsigned long int i=0;i<n;i++) { cin>>h; x[i]=h; y[i]=h; } for( unsigned long int j=0;j<k;j++) { for (uns...
Fri Oct 24, 2014 9:43 am
Forum: Volume 127 (12700-12799)
Topic: 12761 - Blue Chips
Replies: 9
Views: 1273

### Re: 12761 - Blue Chips

I have time limit exceeded in my solution how I can solve this problem?