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 ...
Search found 53 matches
- Tue Oct 24, 2006 7:38 am
- Forum: Volume 111 (11100-11199)
- Topic: 11132 - Dice from pennies
- Replies: 10
- Views: 5173
- Mon Oct 23, 2006 1:28 pm
- Forum: Volume 111 (11100-11199)
- Topic: 11132 - Dice from pennies
- Replies: 10
- Views: 5173
- Fri Feb 10, 2006 6:10 am
- Forum: Volume 109 (10900-10999)
- Topic: 10946 - You want what filled?
- Replies: 38
- Views: 24774
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 ...
#include <iostream>
using namespace std;
#include <cstring>
typedef struct
{
char cc;
int ...
- Tue Aug 30, 2005 5:15 am
- Forum: Volume 108 (10800-10899)
- Topic: 10898 - Combo Deal
- Replies: 9
- Views: 8418
- Tue Aug 30, 2005 5:10 am
- Forum: Volume 108 (10800-10899)
- Topic: 10897 - Travelling Distance
- Replies: 17
- Views: 7518
- Sun Aug 28, 2005 1:44 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10897 - Travelling Distance
- Replies: 17
- Views: 7518
- Fri Aug 26, 2005 2:28 pm
- Forum: Volume 6 (600-699)
- Topic: 648 - Stamps (II)
- Replies: 13
- Views: 7237
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 ...
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 ...
- Fri Aug 19, 2005 2:04 pm
- Forum: Volume 1 (100-199)
- Topic: 166 - Making Change
- Replies: 31
- Views: 12277
- Thu Aug 18, 2005 5:46 pm
- Forum: Volume 1 (100-199)
- Topic: 166 - Making Change
- Replies: 31
- Views: 12277
- Thu Aug 18, 2005 10:52 am
- Forum: Volume 1 (100-199)
- Topic: 166 - Making Change
- Replies: 31
- Views: 12277
- Tue Aug 09, 2005 3:09 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10891 - Game of Sum
- Replies: 33
- Views: 18565
- Mon Aug 08, 2005 2:57 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10891 - Game of Sum
- Replies: 33
- Views: 18565
- Sat Mar 19, 2005 9:02 am
- Forum: Volume 7 (700-799)
- Topic: 782 - Contour Painting
- Replies: 53
- Views: 30760
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 ...
#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 ...
- Sat Mar 05, 2005 11:01 am
- Forum: Volume 3 (300-399)
- Topic: 306 - Cipher
- Replies: 74
- Views: 31193
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 ...
#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 ...
- Fri Feb 25, 2005 7:36 am
- Forum: Volume 3 (300-399)
- Topic: 301 - Transportation
- Replies: 13
- Views: 7836