Search found 53 matches

by oulongbin
Tue Oct 24, 2006 7:38 am
Forum: Volume 111 (11100-11199)
Topic: 11132 - Dice from pennies
Replies: 10
Views: 3949

hi taha,thank you very much for your reply,i changed my code ,but still get WA,i'm so confused.This is my code, could you help me to check it,thank you!!!! #include <iostream> using namespace std; #include <cstring> #include <cmath> char str[1001]; int roll,side; int length(int t) { int l; l=0; t--;...
by oulongbin
Mon Oct 23, 2006 1:28 pm
Forum: Volume 111 (11100-11199)
Topic: 11132 - Dice from pennies
Replies: 10
Views: 3949

Hi sohel,i just obey your way to solve this problem,but always get WA.
Could you give me some samples or this problem have any tricks in it??
thanks :D
by oulongbin
Fri Feb 10, 2006 6:10 am
Forum: Volume 109 (10900-10999)
Topic: 10946 - You want what filled?
Replies: 38
Views: 18100

10946 - You want what filled?

i think this problem is very easy.i just use dfs to solve it. but i always got WA. i don't know why. could somebody give me some I/O please or tell me what's wrong with my code . Thank you very much :D #include <iostream> using namespace std; #include <cstring> typedef struct { char cc; int num; }ho...
by oulongbin
Tue Aug 30, 2005 5:15 am
Forum: Volume 108 (10800-10899)
Topic: 10898 - Combo Deal
Replies: 9
Views: 6145

hi ,i think this problem could easily to be solved by backtracking.
by oulongbin
Tue Aug 30, 2005 5:10 am
Forum: Volume 108 (10800-10899)
Topic: 10897 - Travelling Distance
Replies: 17
Views: 5823

hi wook,thank you very much!
now i get AC :D
by oulongbin
Sun Aug 28, 2005 1:44 pm
Forum: Volume 108 (10800-10899)
Topic: 10897 - Travelling Distance
Replies: 17
Views: 5823

Could someone tell me how to change the latitude and longitude in this problem?
by oulongbin
Fri Aug 26, 2005 2:28 pm
Forum: Volume 6 (600-699)
Topic: 648 - Stamps (II)
Replies: 13
Views: 4812

648 help me!

i don't why i always get WA,could someone give some inputs and outputs? thank! #include <iostream> using namespace std; #include <cstring> int stamp[100]; int numOfType; int customer; int numOfStamp[100]; int stampUsed[100]; bool tie; int stamp_list[5]; int now_stamp_list[5]; int now_type_sum; int n...
by oulongbin
Fri Aug 19, 2005 2:04 pm
Forum: Volume 1 (100-199)
Topic: 166 - Making Change
Replies: 31
Views: 5775

hi,jagadish.thank you very much.i finally get AC.
it is the problem of precision.
i run the program well in VC,but wrong in gcc. :D
by oulongbin
Thu Aug 18, 2005 5:46 pm
Forum: Volume 1 (100-199)
Topic: 166 - Making Change
Replies: 31
Views: 5775

hi , jagadish. my program output the same answer pasted above, which one is wrong ?? :D
by oulongbin
Thu Aug 18, 2005 10:52 am
Forum: Volume 1 (100-199)
Topic: 166 - Making Change
Replies: 31
Views: 5775

hi ,i am so confused.can someone tell why i always got WA?? #include <iostream> using namespace std; #include <cstring> #include <cstdio> #include <cmath> //#include <fstream> //ifstream fin("in.txt"); //#define cin fin int shop[501]; int min; int money; int numOfCoin[7]; int num; void init() { int ...
by oulongbin
Tue Aug 09, 2005 3:09 pm
Forum: Volume 108 (10800-10899)
Topic: 10891 - Game of Sum
Replies: 33
Views: 12629

shamim is correct. Abednego's method gives an answer of -7, not 7. oulongbin, both players play to get the maximum difference, so if A takes 7, B will take 4 and -10, leaving A with -20 so that B wins with -6 vs. -13. B wouldn't let A pick between -10 and -20 when B could have taken the -10 leaving...
by oulongbin
Mon Aug 08, 2005 2:57 pm
Forum: Volume 108 (10800-10899)
Topic: 10891 - Game of Sum
Replies: 33
Views: 12629

sorry,i don't very agree with you.
if you are right,i can do this:
A takes 7;
B takes 4;
A takes -10;
B takes -20;
then A is -3 and B is -16;
the answer is 13 greater than 7.

i don't know why the correct is 7.
by oulongbin
Sat Mar 19, 2005 9:02 am
Forum: Volume 7 (700-799)
Topic: 782 - Contour Painting
Replies: 53
Views: 22104

782 got Runtime Error (SIGSEGV),help me plz,thanx

always get RTE,i do not know why. #include <iostream> using namespace std; #include <cstring> char arr[50][100]; bool f[50][100]; int len,tlen; int k; void indraw(int i,int j) { if(i-1>=0 && f[i-1][j] && arr[i-1][j]!='X') { f[i-1][j]=false; indraw(i-1,j); } if(i+1<k && f[i+1][j] && arr[i+1][j]!='X')...
by oulongbin
Sat Mar 05, 2005 11:01 am
Forum: Volume 3 (300-399)
Topic: 306 - Cipher
Replies: 74
Views: 18509

306 RE help

i always get RE,if i enlarge the cycle[][],i get TLE,could someone tell me what's wrong with my code ?thanks. #include "stdafx.h" #include <iostream> using namespace std; #include <cstring> int main() { char cycle[205][205]; int ci; int sq[205]; int n; int sum; int ts; char f[205]; char tf[205]; int...
by oulongbin
Fri Feb 25, 2005 7:36 am
Forum: Volume 3 (300-399)
Topic: 301 - Transportation
Replies: 13
Views: 4880

thanx,i have solved this problem ,backtracking ,thank you! :D

Go to advanced search