OJ Board

In this problem, the reason why I get WA is "output format".
For example, When we output

123456789

It's may be transformed.

1.2E8

( The answer may be not correct. Just for example )
Unluckily, the output should be 123456789, so, do you get what I mean ?

Best Regards

When you start to test your code, it's better to think the bound condition.
For example, In this problem . Do you ever think "13" ? In this problem
The input is 13 <= n < 100. After 13, it's better to think 99.

sample input
13

sample output
1

Best Regards ! :wink:

Input :
6 8
9 1 9 9 1 1 1 1
1 9 9 1 9 9 9 9
9 9 1 9 9 1 1 1
1 1 9 9 1 9 9 9
9 9 9 1 9 9 9 9
9 9 1 9 9 9 9 9

Output
2 1 6 5 4 3 3 3
8

Try Try ..^_^..I wish this can help you..

Fresh wrote:Try this, it may help:

[cpp]
#include <stdio.h>
....
....
printf("%s%1.0f\n",c,min);
[/cpp]

-novice

Thanks. I corrected the ouput format then I get "Accepted"
Thank a lots.

minskcity wrote:I guess you did not try "1000000000 1000000000 1 1 1 1 1 1 1".......

The answer of my program is

BCG 1000000005

Is any bug in it ?

The following my source code for P.102
[cpp]
#include <iostream>
using namespace std ;
void main()
{
unsigned long k1=0, data[9]={0} ;
char *c ;
while ( cin >> data[0] ) {
double min=2147483648 , sum=0 ;
sum += data[0] ;
for( k1=1 ; k1<9 ; k1++ ) {
cin >> data[k1] ;
sum += data[k1] ;
}
if ...

Try this
input : 13
output : 1[/b][/code][/quote]