Submission #2037993


Source Code Expand

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define inf 1072114514
#define llinf 1145141919810364364
#define mod 1000000007

int max(int a,int b){if(a>b){return a;}return b;}
int min(int a,int b){if(a<b){return a;}return b;}
int zt(int a,int b){return max(a,b)-min(a,b);}
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}
int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
long long llmax(long long a,long long b){if(a>b){return a;}return b;}
long long llmin(long long a,long long b){if(a<b){return a;}return b;}
long long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}
long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}
long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}
long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}
long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
double dbmax(double a,double b){if(a>b){return a;}return b;}
double dbmin(double a,double b){if(a<b){return a;}return b;}
double dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}
int sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}

int main(void){
    int a,b,mxma,mimb;
    scanf("%d%d",&a,&b);
    if(a/100 != 9){mxma=900+a%100;}
    else if(a/10 != 99){mxma=990+a%10;}
    else{mxma=999;}
    if(b/100 != 1){mimb=100+b%100;}
    else if(b/10 != 10){mimb=100+b%10;}
    else{mimb=100;}
    printf("%d\n",max(mxma-b,a-mimb));
    return 0;
}

Submission Info

Submission Time
Task A - A - B problem
User physics0523
Language C (GCC 5.4.1)
Score 100
Code Size 2936 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.c:11:5: warning: conflicting types for built-in function ‘round’
 int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
     ^
./Main.c:12:5: warning: conflicting types for built-in function ‘ceil’
 int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
     ^
./Main.c:17:5: warning: conflicting types for built-in function ‘pow’
 int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
     ^
./Main.c:21:11: warning: conflicting types for built-in function ‘llround’
 long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
           ^
./Main.c: In function ‘main’:
./Main.c:40:5: 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
AC × 3
AC × 45
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 1 ms 128 KB
ansneg_1.txt AC 1 ms 128 KB
ansneg_2.txt AC 1 ms 128 KB
ansneg_3.txt AC 1 ms 128 KB
ansneg_4.txt AC 1 ms 128 KB
ansneg_5.txt AC 1 ms 128 KB
ansneg_6.txt AC 1 ms 128 KB
ansneg_7.txt AC 1 ms 128 KB
ansneg_8.txt AC 1 ms 128 KB
ansneg_9.txt AC 1 ms 128 KB
handmade_0.txt AC 1 ms 128 KB
handmade_1.txt AC 1 ms 128 KB
random_0.txt AC 1 ms 128 KB
random_1.txt AC 1 ms 128 KB
random_2.txt AC 1 ms 128 KB
random_3.txt AC 1 ms 128 KB
random_4.txt AC 1 ms 128 KB
random_5.txt AC 1 ms 128 KB
random_6.txt AC 1 ms 128 KB
random_7.txt AC 1 ms 128 KB
random_8.txt AC 1 ms 128 KB
random_9.txt AC 1 ms 128 KB
sample_0.txt AC 1 ms 128 KB
sample_1.txt AC 1 ms 128 KB
sample_2.txt AC 1 ms 128 KB
top2fixed_0.txt AC 1 ms 128 KB
top2fixed_1.txt AC 1 ms 128 KB
top2fixed_2.txt AC 1 ms 128 KB
top2fixed_3.txt AC 1 ms 128 KB
top2fixed_4.txt AC 1 ms 128 KB
top2fixed_5.txt AC 1 ms 128 KB
top2fixed_6.txt AC 0 ms 128 KB
top2fixed_7.txt AC 1 ms 128 KB
top2fixed_8.txt AC 1 ms 128 KB
top2fixed_9.txt AC 1 ms 128 KB
topfixed_0.txt AC 1 ms 128 KB
topfixed_1.txt AC 1 ms 128 KB
topfixed_2.txt AC 1 ms 128 KB
topfixed_3.txt AC 1 ms 128 KB
topfixed_4.txt AC 1 ms 128 KB
topfixed_5.txt AC 1 ms 128 KB
topfixed_6.txt AC 1 ms 128 KB
topfixed_7.txt AC 1 ms 128 KB
topfixed_8.txt AC 1 ms 128 KB
topfixed_9.txt AC 1 ms 128 KB