OJ Board

No.

I can't understand the DP solution.
may you explain more?

thanks.

Thanks for your help.

the first testcase give an error because of a simple wrong in dimensions of array.
but the second one was the Big one.
the bfs can't solve this problem.

I used DFS but got TLE. and this is the dfs code.

it's clear that why it got TLE but what's the solution?

may any one ...

Hi.

May any one help me in my wrong?
this code got WA.

I used bfs one board by cosidering 4 different ways to enter each block.

this is my code.
please help me.
thanks.


#include<iostream>
#include<fstream>
#include<algorithm>
#include<stdio.h>
#include<strstream>
using namespace std;

char ...

Hi
All of the previews bug + some other one had been considered in the contest but I got Run Time Error.

may any one help me to solve this problem.

thanks a lot.


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

#define MAXSIZE 40100

class BigInt {
public:
char *data ...

Hi.
please help me.
this problem storm my mind.
I can't find my mistake.
and can't even predict it.

I Use DP for solving the problem.
this is my code.

all the matters seems correct.
but!!!


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

string words1 ...

hamedv wrote:Try these:

input:

Code: Select all

1
5 100

correct output:

Code: Select all

778091614

replace this line

Code: Select all

tabl[i][j]+=fun(i,j,k)

by this:

Code: Select all

tabl[i][j]=(tabl[i][j]+fun(i,j,k))%1000000007;

Special Thanks Hamedv. what a silly bug.
you exactly found the bug and the code got ACC.

again thanks.

hi.

the introduced method was useful but I code a O(N^2 * M) method and this is my code.
but why I got WA.
may anybody send me some testcases in the wrong positions or tell me what is wrong here.

fun2(b,len,ld) : count of numbers in base b with length len and with the last digit ld that all of the ...

Hi.
Excelent alright.
I used this method in the contest. (backtracking & memorizing and this is my code.
but my answer for case:
33 12
is
3658729080464717380

but I got correct answer for case. 33 33 ?
the above case can be fetch in part of 33 33 solution.
this is my code please help me in my wrong ...

Hi

may anyone put some tricky cases for this problem.

thanks.

this is my code that got WA:

#include<iostream>
#include<stdio.h>
#include<map>
using namespace std;

long long MAX=1000000000;
long long devs[1002][25];
bool nums[1002];
int primes[1000];
int cnt;

map<int,int> facts[1001];
int ...

H_Hima,
you must have to initialize again before all test cases.


hi shakil.
thanks for your attention.
but why initializing.
take a look at code.
the value of l , r, c were not change in the progress.

still thanks for your attention my friend.

please delete the code.
in this way the problem ...

why wrong?

I'm surprised after see that in the contest.

I consider empty lines.

oh what is the meaning of this part in problem statement?
"Path is the string if maximum length of 90 characters consisting from characters L or R."

this is my code.


ohhhhhh what a bad.
two problems were not ...

what the trick in this Problem.

this is my code in the contest?
I'm aware of space char and the final value too.
and got the res in long long.

I'm completely confused...

help!!!!
I consider all of the above.

but my code got WA.

please tell me my wrong.


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

int data[2000];
vector<int> out;

int fun(int n) {
out.clear();
int i,dif,sum=0;;
bool sw=true;
if(n==1) {
out ...

Ivan wrote:
2. To reduce the complexity we use a common technique to reduce the inner loop.
Instead of iterating through every j in order to find the above mentioned
maximum we can do a range maximum query (RMQ) - which can be easily done in
logarithmic time leading to overall complexity of n * log ...

Hi to everybody
there is anybody there to help me??

I use graham's covex skin to finding the convexhull and finding the perimeter from that.
But why WA.
this is my code

Dear H_Hima:

You are trying to solve "Nails" (problem 11096).
I have received and stored your C++ program. It will be compiled ...