Submission #1500579
Source Code Expand
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <math.h> #include <limits.h> #define swap(type,a,b) do{type t=a;a=b;b=t;}while(0); #define MAX(a,b) (((a)>(b))?(a):(b)) #define MIN(a,b) (((a)<(b))?(a):(b)) #define ll long long #define INF 100000000 #define FOR(i,a,n) for(i=(a);i<(n);i++) int comp(const void* a,const void* b){ return *(int*)a-*(int*)b; } void fill(int a[],int b,int c){ int i; FOR(i,0,b) a[i]=c; return; } int main(void) { int a,b,res,k,p; scanf("%d%d",&a,&b); res=a-b; for(k=100;k>0;k/=10){ int s=a/k,t=b/k; if(k==100) p=MAX(9-s,t-1); else p=MAX(9-s,t); if(p>0){ res+=p*k; break; } a%=k,b%=k; } printf("%d\n",res); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - A - B problem |
User | trainstation |
Language | C (GCC 5.4.1) |
Score | 100 |
Code Size | 729 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:23:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&a,&b); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 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 | AC | 0 ms | 128 KB |
ansneg_1.txt | AC | 0 ms | 128 KB |
ansneg_2.txt | AC | 0 ms | 128 KB |
ansneg_3.txt | AC | 0 ms | 128 KB |
ansneg_4.txt | AC | 1 ms | 128 KB |
ansneg_5.txt | AC | 1 ms | 128 KB |
ansneg_6.txt | AC | 0 ms | 128 KB |
ansneg_7.txt | AC | 0 ms | 128 KB |
ansneg_8.txt | AC | 0 ms | 128 KB |
ansneg_9.txt | AC | 0 ms | 128 KB |
handmade_0.txt | AC | 0 ms | 128 KB |
handmade_1.txt | AC | 0 ms | 128 KB |
random_0.txt | AC | 0 ms | 128 KB |
random_1.txt | AC | 0 ms | 128 KB |
random_2.txt | AC | 0 ms | 128 KB |
random_3.txt | AC | 0 ms | 128 KB |
random_4.txt | AC | 0 ms | 128 KB |
random_5.txt | AC | 0 ms | 128 KB |
random_6.txt | AC | 0 ms | 128 KB |
random_7.txt | AC | 0 ms | 128 KB |
random_8.txt | AC | 0 ms | 128 KB |
random_9.txt | AC | 0 ms | 128 KB |
sample_0.txt | AC | 0 ms | 128 KB |
sample_1.txt | AC | 0 ms | 128 KB |
sample_2.txt | AC | 0 ms | 128 KB |
top2fixed_0.txt | AC | 0 ms | 128 KB |
top2fixed_1.txt | AC | 0 ms | 128 KB |
top2fixed_2.txt | AC | 0 ms | 128 KB |
top2fixed_3.txt | AC | 0 ms | 128 KB |
top2fixed_4.txt | AC | 0 ms | 128 KB |
top2fixed_5.txt | AC | 0 ms | 128 KB |
top2fixed_6.txt | AC | 0 ms | 128 KB |
top2fixed_7.txt | AC | 0 ms | 128 KB |
top2fixed_8.txt | AC | 0 ms | 128 KB |
top2fixed_9.txt | AC | 0 ms | 128 KB |
topfixed_0.txt | AC | 0 ms | 128 KB |
topfixed_1.txt | AC | 0 ms | 128 KB |
topfixed_2.txt | AC | 0 ms | 128 KB |
topfixed_3.txt | AC | 0 ms | 128 KB |
topfixed_4.txt | AC | 0 ms | 128 KB |
topfixed_5.txt | AC | 0 ms | 128 KB |
topfixed_6.txt | AC | 0 ms | 128 KB |
topfixed_7.txt | AC | 0 ms | 128 KB |
topfixed_8.txt | AC | 0 ms | 128 KB |
topfixed_9.txt | AC | 0 ms | 128 KB |