Help to stick-CodePudding

 # include & lt; Bits/stdc++. H> 

using namespace std; 

Int main () 
{
Long long int x, y, z, n, m, result, num; 
Int t, I, j, len; 
Char a, [30]. 
The scanf (" % d ", & amp; t); 
for(j=1; J<=t; J++) 
{
Result=0; 
x=0; 
The scanf (" % s ", a); 
Len=strlen (a); 
for(i=0; iX=x * 10 + a, [I] - '0'. 
Y=a [len - 4] - '0'. 
Z=a [len - 3] - '0'. 
N=a/len - 2 - '0'. 
M=a [] len - 1 - '0'. 
Num=x + y z * n/m; 
Result=Max (result, num); 
Y=0; 
for(i=1; iY=y * 10 + a, [I] - '0'. 
X=a, [0] - '0'. 
Z=a [len - 3] - '0'. 
N=a/len - 2 - '0'. 
M=a [] len - 1 - '0'. 
Num=x + y z * n/m; 
Result=Max (result, num); 
If (len> 5) 
{
x=0; 
for(i=0; iX=x * 10 + a, [I] - '0'. 
Y=a [len - 5] - '0'. 
Z=a [len - 4] - '0'. 
N=a [len - 3] - '0'. 
M=(a/len - 2 - '0') * 10 + a] [len - 1 - '0'; 
Num=x + y z * n/m; 
Result=Max (result, num); 
Y=0; 
for(i=1; iY=y * 10 + a, [I] - '0'. 
X=a, [0] - '0'. 
Z=a [len - 4] - '0'. 
N=a [len - 3] - '0'. 
M=(a/len - 2 - '0') * 10 + a] [len - 1 - '0'; 
Num=x + y z * n/m; 
Result=Max (result, num); 
} 
Printf (" Case # % d: % LLD \ n ", j, result); 
} 
return 0; 
}

For why I always WA code
Control the AC code no difference feeling why can WA checked several times did not find error hope to have a big help to see
AC code:

//
//by coolxxx 
//# include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
//# include 
#include 
# pragma comment (would, "/STACK: 1024000000102000 000)" 
# define min (a, b) ((a) & lt; (b)? (a) : (b)) 
# define Max (a, b) ((a) & gt; (b)? (a) : (b)) 
# define abs (a) ((a) & gt; 0? (a) : (1) - (a))) 
# define lowbit (a) (a& (a)) 
# define SQR (a) ((a) * (a)) 
# define swap (a, b) ((a) ^=(b), (b) ^=(a), (a) ^=(b)) 
# define mem memset (a, b) (a, b, sizeof (a)) 
# define eps (1 e - 8) 
# define J 10000 
# define mod 1000000007 
# define MAX 0 x7f7f7f7f 
# define PI 3.14159265358979323 
# define N 24 
using namespace std; 
Typedef long long LL; 
Typedef unsigned long long ULL; 
Double anss; 
LL aans; 
Int the cas, cass; 
Int n, m, the name 'LLL, ans; 
LL sum, tot, s1, s2; 
Char s [N]. 
Int main () 
{
# # ifndef ONLINE_JUDGEW 
//freopen (" 1. TXT ", "r", stdin); 
//freopen (" 2. TXT ", "w", stdout); 
# endif 
int i,j,k; 
Int x, y, z; 
//init (); 
//for (the scanf (" % d ", & amp; Cass); Cass; Cass --) 
For (the scanf (" % d ", & amp; Cas), cass=1; Cass<=cas; Cass++) 
//while (~ the scanf (" % s ", s)) 
//while (~ the scanf (" % d % d ", & amp; N, & amp; M)) 
{
Tot=0; sum=0; S1=0; S2=0; 
Printf (" Case # % d:, "cass); 
The scanf (" % s ", s); 
N=strlen (s); 
Tot=- (s/n - 3 - '0') * (s/n - 2 - '0')/(s/n - 1 - '0'); 
S1=s [0] - '0'. S2=0; 
for(i=1; iS2=s2 * 10 + s [I] - '0'; 
Sum=tot + s1 + s2; 
S1=s/n - 4 - '0'. S2=0; 
for(i=0; iS2=s2 * 10 + s [I] - '0'; 
Tot +=s1 + s2; 
Sum=Max (sum, tot); 
If (n> 5) 
{
Tot=- (s/n - 4 - '0') * (s/n - 3 - '0')/((s/n - 2 - '0') * 10 + s] [n - 1 - '0'); 
S1=s [0] - '0'. S2=0; 
for(i=1; iS2=s2 * 10 + s [I] - '0'; 
Tot +=s1 + s2; 
Sum=Max (sum, tot); 
Tot=- (s/n - 4 - '0') * (s/n - 3 - '0')/((s/n - 2 - '0') * 10 + s] [n - 1 - '0'); 
S1=s/n - 5 - '0'. S2=0; 
for(i=0; iS2=s2 * 10 + s [I] - '0'; 
Tot +=s1 + s2; 
Sum=Max (sum, tot); 
} 
Printf (" % LLD \ n ", sum); 
} 
return 0; 
} 
/* 
//

//
*/

CodePudding user response:

Title link: https://vjudge.net/contest/405628#problem/F