Search found 8 matches

by KRUNCH
Tue May 25, 2010 1:59 pm
Forum: Volume 102 (10200-10299)
Topic: 10275 - Guess the Number!
Replies: 4
Views: 3602

Re: 10275 - Guess the Number!

Could anyone explain this problem to me please? What is meant by an "error in at most one single digit"? The first few values of n^n are

1
4
27
256
3125
46656

So I understand the first sample input. If the input is 3, then we are unsure whether the correct number is 1 or 4; therefore, the ...
by KRUNCH
Fri Apr 02, 2010 9:35 am
Forum: Volume 6 (600-699)
Topic: 674 - Coin Change
Replies: 77
Views: 39099

Re: 674 - Coin Change

helloneo wrote:There is a simple test case your code doesn't pass..

input:
5

output should be
2

You can try to reason out..
OMG , Thanks dude , I made one of the stupidest mistakes ever -.-'
by KRUNCH
Thu Apr 01, 2010 10:43 am
Forum: Volume 6 (600-699)
Topic: 674 - Coin Change
Replies: 77
Views: 39099

Re: 674 - Coin Change

Can anybody help me with this one , I tested it on numerous testcases , it works but for no reason it fails on some.

Here's the code


#include <iostream>

using namespace std;

int main()
{
int coins[]={1,5,10,25,50};
int all[10000],n;
for(int i=0;i<10000;i++)all[i]=0;
all[0]=1;
all[1]=1 ...
by KRUNCH
Sun Mar 28, 2010 5:44 pm
Forum: Volume 4 (400-499)
Topic: 490 - Rotating Sentences
Replies: 212
Views: 48160

Re: 490 - Rotating Sentences

Hi , I'm getting PE on this task , I tried with and without a newline on the end of the output , I've got trailing spaces , I just don't get it :-?

#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

int main()
{
int fld[350][350];
for(int i=0;i<150;i++)
for(int j ...
by KRUNCH
Wed Nov 05, 2008 10:38 pm
Forum: Volume 3 (300-399)
Topic: 369 - Combinations
Replies: 101
Views: 33386

Re: 369 WA even if it works for every test case i found :S

As my algo seems too slow for 530 ill redo both problems , and previously you stated that i cannot take for sure that m != 0 but in the problem it states that 5<=m<=n therefore i didnt bother , eaven after i changed it it still gives wa , well wouldn't be fun to solve if it was easy , if I get any ...
by KRUNCH
Wed Nov 05, 2008 12:16 pm
Forum: Volume 5 (500-599)
Topic: 530 - Binomial Showdown
Replies: 137
Views: 49090

Re: 530 woes

On this problem i got RE

#include <iostream>
#include <vector>

using namespace std;

int gcd (int u, int v)
{
int t;
while (u>0)
{
if (u<v) {t=u;u=v;v=t;}
u=u-v;
}
return v;
}

int main ()
{
long long double n,m,r,h;
bool first=true;
vector <int> n1,m1;
while (cin>>n>>m)
{
if (n==0 ...
by KRUNCH
Wed Nov 05, 2008 11:53 am
Forum: Volume 3 (300-399)
Topic: 369 - Combinations
Replies: 101
Views: 33386

Re: 369 WA even if it works for every test case i found :S

This problem is the same as Problem 530.
You can find some test cases on thread 530.

I recommand you to use long long integer to record the result.

BTW. Don't create a new thread if there exist one already.

Yeah i found problem 530 , its pretty much the same , and i wouldnt create a new thread ...
by KRUNCH
Wed Nov 05, 2008 9:58 am
Forum: Volume 3 (300-399)
Topic: 369 - Combinations
Replies: 101
Views: 33386

369 WA even if it works for every test case i found :S

So im stuck at problem 369 - Combinations , first of i tought it was damn easy , but i've run in some problems later I cleared it all out.
The problem is i still get WA , so i searched the forum , and pretty much every test case i tried is correct , i dont think its a problem with the sollution ...

Go to advanced search