#include<stdio.h>
int grid[5][5]={0}; // BINGO card
bool mark[5][5];
int call[75];
void clear()
{
int i, j;
for(i=0; i<5; ++i)
for(j=0; j<5; ++j)
mark[i][j] = false;
mark[2][2] = true; // free space
}
void input()
{
int i, j;
for(i=0; i<2; ++i)
for(j=0; j<5; ++j)
scanf("%d",&grid[i][j ...
Search found 13 matches
- Wed Jul 20, 2005 5:29 am
- Forum: Volume 108 (10800-10899)
- Topic: 10813 - Traditional BINGO
- Replies: 28
- Views: 14244
- Sun Jul 17, 2005 4:03 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10815 - Andy's First Dictionary
- Replies: 116
- Views: 48446
10815 wrong
Who can help me solve this problem, thanks~
#include<iostream>
#include<string>
#include<set>
using namespace std;
main()
{
set<string> words;
string buffer="", word="";
while( cin >> buffer ) {
int len = buffer.length();
for(int i=0; i<=len; ++i) {
if( buffer[i] >= 'A' && buffer[i] <= 'Z ...
#include<iostream>
#include<string>
#include<set>
using namespace std;
main()
{
set<string> words;
string buffer="", word="";
while( cin >> buffer ) {
int len = buffer.length();
for(int i=0; i<=len; ++i) {
if( buffer[i] >= 'A' && buffer[i] <= 'Z ...
- Mon Jan 24, 2005 4:55 pm
- Forum: Volume 7 (700-799)
- Topic: 782 - Contour Painting
- Replies: 53
- Views: 30786
782 - Runtime Error
I need your help if you got AC.
#include<stdio.h>
#include<string.h>
char map[50][100];
int line,maxlen; // maxlen is the most long length
int ch_x,ch_y; // coordinate of asterisk
void input()
{
line = maxlen = 0;
while( gets(map[line]) ) {
if( !strcmp(map[line],"__________") ) break;
int len ...
#include<stdio.h>
#include<string.h>
char map[50][100];
int line,maxlen; // maxlen is the most long length
int ch_x,ch_y; // coordinate of asterisk
void input()
{
line = maxlen = 0;
while( gets(map[line]) ) {
if( !strcmp(map[line],"__________") ) break;
int len ...
- Mon Jan 24, 2005 4:55 pm
- Forum: Volume 7 (700-799)
- Topic: 782 - Contour Painting
- Replies: 53
- Views: 30786
782 - Runtime Error
I need your help if you got AC.
#include<stdio.h>
#include<string.h>
char map[50][100];
int line,maxlen; // maxlen is the most long length
int ch_x,ch_y; // coordinate of asterisk
void input()
{
line = maxlen = 0;
while( gets(map[line]) ) {
if( !strcmp(map[line],"__________") ) break;
int len ...
#include<stdio.h>
#include<string.h>
char map[50][100];
int line,maxlen; // maxlen is the most long length
int ch_x,ch_y; // coordinate of asterisk
void input()
{
line = maxlen = 0;
while( gets(map[line]) ) {
if( !strcmp(map[line],"__________") ) break;
int len ...
- Tue Aug 10, 2004 8:47 am
- Forum: Volume 5 (500-599)
- Topic: 574 - Sum It Up
- Replies: 46
- Views: 22477
Re: 574 Sum It Up. WA can you tell me some inputs?
maybe you can try in this test datatetuya wrote:Thank you for your reply![]()
![]()
I read this following passage.and , 999 1 999 is invalid input,isnt it?and X1,...,Xn will be positive integers less than 100.
- Mon Aug 09, 2004 5:57 pm
- Forum: Volume 5 (500-599)
- Topic: 574 - Sum It Up
- Replies: 46
- Views: 22477
Re: 574 Sum It Up. WA can you tell me some inputs?
Code: Select all
INPUT:
999 1 999
CORRECT OUTPUT:
NONE
YOUR OUTPUT:
-25
- Sun Aug 08, 2004 5:28 am
- Forum: Volume 1 (100-199)
- Topic: 123 - Searching Quickly
- Replies: 55
- Views: 12628
- Sat Aug 07, 2004 5:08 am
- Forum: Volume 7 (700-799)
- Topic: 755 - 487--3279
- Replies: 115
- Views: 47399
- Fri Aug 06, 2004 4:05 am
- Forum: Volume 7 (700-799)
- Topic: 755 - 487--3279
- Replies: 115
- Views: 47399
- Fri Aug 06, 2004 2:10 am
- Forum: Volume 2 (200-299)
- Topic: 216 - Getting in Line
- Replies: 57
- Views: 31060
thanks....I understandUFP2161 wrote:My program outtputed the first one, but it shouldn't matter since the description states that:No two computers are at identical locations and each computer will be listed once.
but I still got WA
who have more input data
sorry,my program is poor ^^"
[c] cut [/c]
- Thu Aug 05, 2004 5:08 pm
- Forum: Volume 2 (200-299)
- Topic: 216 - Getting in Line
- Replies: 57
- Views: 31060
Re: AC!
please tell me
if input is..
2
100 100
100 100
answer should ?
**********************************************************
Network #1
Cable requirement to connect (100,100) to (100,100) is 16.00 feet.
Number of feet of cable required is 16.00 ...
if input is..
2
100 100
100 100
answer should ?
**********************************************************
Network #1
Cable requirement to connect (100,100) to (100,100) is 16.00 feet.
Number of feet of cable required is 16.00 ...
- Thu Aug 05, 2004 9:54 am
- Forum: Volume 7 (700-799)
- Topic: 706 - LCD Display
- Replies: 221
- Views: 65152
Re: 706~Help me please
I got AC(P.E) in this problem.
I only change【printf】for【putchar】in C.
You can try it......
I only change【printf】for【putchar】in C.
You can try it......
- Thu Aug 05, 2004 9:34 am
- Forum: Volume 100 (10000-10099)
- Topic: 10099 - The Tourist Guide
- Replies: 91
- Views: 43075
10099 WRONG
This problem is Floyd algorithm.
Why did I get WA?
Thanks for your help....
[cpp]nothing[/cpp]
Why did I get WA?
Thanks for your help....
[cpp]nothing[/cpp]