Submission #4426008
Source Code Expand
#include<iostream> #include<cstring> #include<cstdio> using namespace std; int a[1000000],b[10000000],c[100000000]; void input(int a[]) { string s; cin>>s; a[0]=s.size(); for(int i=1;i<=a[0];i++) a[i]=s[a[0]-i]-'0'; } void jian(int a[],int b[],int c[]) { c[0]=max(a[0],b[0]); for(int i=1;i<=c[0];i++) c[i]=a[i]-b[i]; for(int i=1;i<=c[0];i++) { if(c[i]<0) { c[i+1]-=1; c[i]+=10; } } } void print(int c[]) { if(c[0]==0&&c[1]==0) { cout<<"0"; return; } while(c[c[0]]==0) c[0]--; for(int i=c[0];i>=1;i--) cout<<c[i]; } void panduan() { if(a[0]>b[0]) jian(a,b,c); if(a[0]<b[0]) { jian(b,a,c); cout<<"-"; } if(a[0]==b[0]) { for(int i=1;i<=max(a[0],b[0]);i++) { if(a[i]>b[i]) { jian(a,b,c); } if(b[i]>a[i]) { cout<<"-"; jian(b,a,c); } } } } int main() { //freopen("d:\\put.txt","r",stdin); input(a); input(b); panduan(); print(c); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - A - B problem |
User | luogu_bot4 |
Language | C++ (GCC 5.4.1) |
Score | 0 |
Code Size | 1008 Byte |
Status | WA |
Exec Time | 3 ms |
Memory | 4352 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_0.txt, sample_1.txt, sample_2.txt |
All | ansneg_0.txt, ansneg_1.txt, ansneg_2.txt, ansneg_3.txt, ansneg_4.txt, ansneg_5.txt, ansneg_6.txt, ansneg_7.txt, ansneg_8.txt, ansneg_9.txt, handmade_0.txt, handmade_1.txt, random_0.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, sample_0.txt, sample_1.txt, sample_2.txt, top2fixed_0.txt, top2fixed_1.txt, top2fixed_2.txt, top2fixed_3.txt, top2fixed_4.txt, top2fixed_5.txt, top2fixed_6.txt, top2fixed_7.txt, top2fixed_8.txt, top2fixed_9.txt, topfixed_0.txt, topfixed_1.txt, topfixed_2.txt, topfixed_3.txt, topfixed_4.txt, topfixed_5.txt, topfixed_6.txt, topfixed_7.txt, topfixed_8.txt, topfixed_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
ansneg_0.txt | WA | 2 ms | 4352 KB |
ansneg_1.txt | WA | 2 ms | 4352 KB |
ansneg_2.txt | WA | 2 ms | 4352 KB |
ansneg_3.txt | WA | 2 ms | 4352 KB |
ansneg_4.txt | WA | 2 ms | 4352 KB |
ansneg_5.txt | WA | 2 ms | 4352 KB |
ansneg_6.txt | WA | 2 ms | 4352 KB |
ansneg_7.txt | WA | 2 ms | 4352 KB |
ansneg_8.txt | WA | 2 ms | 4352 KB |
ansneg_9.txt | WA | 2 ms | 4352 KB |
handmade_0.txt | WA | 2 ms | 4352 KB |
handmade_1.txt | WA | 2 ms | 4352 KB |
random_0.txt | WA | 2 ms | 4352 KB |
random_1.txt | WA | 2 ms | 4352 KB |
random_2.txt | WA | 2 ms | 4352 KB |
random_3.txt | WA | 2 ms | 4352 KB |
random_4.txt | WA | 2 ms | 4352 KB |
random_5.txt | WA | 2 ms | 4352 KB |
random_6.txt | WA | 2 ms | 4352 KB |
random_7.txt | WA | 2 ms | 4352 KB |
random_8.txt | WA | 2 ms | 4352 KB |
random_9.txt | WA | 2 ms | 4352 KB |
sample_0.txt | WA | 2 ms | 4352 KB |
sample_1.txt | WA | 2 ms | 4352 KB |
sample_2.txt | WA | 2 ms | 4352 KB |
top2fixed_0.txt | WA | 2 ms | 4352 KB |
top2fixed_1.txt | WA | 2 ms | 4352 KB |
top2fixed_2.txt | WA | 2 ms | 4352 KB |
top2fixed_3.txt | WA | 2 ms | 4352 KB |
top2fixed_4.txt | WA | 3 ms | 4352 KB |
top2fixed_5.txt | WA | 2 ms | 4352 KB |
top2fixed_6.txt | WA | 2 ms | 4352 KB |
top2fixed_7.txt | WA | 2 ms | 4352 KB |
top2fixed_8.txt | WA | 2 ms | 4352 KB |
top2fixed_9.txt | WA | 2 ms | 4352 KB |
topfixed_0.txt | WA | 2 ms | 4352 KB |
topfixed_1.txt | WA | 2 ms | 4352 KB |
topfixed_2.txt | WA | 2 ms | 4352 KB |
topfixed_3.txt | WA | 2 ms | 4352 KB |
topfixed_4.txt | WA | 2 ms | 4352 KB |
topfixed_5.txt | WA | 2 ms | 4352 KB |
topfixed_6.txt | WA | 2 ms | 4352 KB |
topfixed_7.txt | WA | 2 ms | 4352 KB |
topfixed_8.txt | WA | 2 ms | 4352 KB |
topfixed_9.txt | WA | 2 ms | 4352 KB |