Submission #810831


Source Code Expand

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<ctype.h>
#include<math.h>

#define FOR(i,a,b) for(i=(a);i<(b);i++)
#define RFOR(i,a,b) for(i=(b);i>=(a);i--)
#define REP(i,n) for(i=0;i<(n);i++)
#define RREP(i,n) for(i=(n)-1;i>=0;i--)
#define MREP(i,n,x) for(i=0;i<(n);i=x)
#define IL() while(1)
#define mLOOP(a,b) while((a)<(b)) 
#define MLOOP(a,b) while((a)>(b))
#define ELOOP(a,b) while((a)==(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)>(b)?(b):(a))
#define ABS(x) ((x)<0?-1*(x):(x))
#define in scanf
#define out printf
#define ll long long
#define ull unsigned long long
#define int(x) scanf("%d",&x);
#define sint(x,y) scanf("%d %d",&x,&y);
#define lint(x,y) scanf("%d\n%d",&x,&y);
#define char(x) scanf("%c",&x);
#define double(x) scanf("%lf",&x);
#define string(x,n) scanf("%s",x);

ull gcd(ull a,ull b){
    if(b==0)return a;
    return gcd(b,a%b);
}

int main(){
    ull n,x,i,res;
    in("%lld %lld",&n,&x);
    res = 3*(n-gcd(n,x));
    out("%lld\n",res);
    return 0;
}

Submission Info

Submission Time
Task B - Mysterious Light
User rabbitfoot141
Language C (GCC 5.4.1)
Score 500
Code Size 1054 Byte
Status AC
Exec Time 2 ms
Memory 128 KiB

Compile Error

./Main.c: In function ‘main’:
./Main.c:19:12: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
 #define in scanf
            ^
./Main.c:37:5: note: in expansion of macro ‘in’
     in("%lld %lld",&n,&x);
     ^

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 300 / 300 200 / 200
Status
AC × 1
AC × 10
AC × 19
Set Name Test Cases
Sample sample-01.txt
Subtask sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt
All sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt
Case Name Status Exec Time Memory
01-01.txt AC 2 ms 128 KiB
01-02.txt AC 2 ms 128 KiB
01-03.txt AC 2 ms 128 KiB
01-04.txt AC 2 ms 128 KiB
01-05.txt AC 2 ms 128 KiB
01-06.txt AC 2 ms 128 KiB
01-07.txt AC 2 ms 128 KiB
01-08.txt AC 2 ms 128 KiB
01-09.txt AC 2 ms 128 KiB
02-01.txt AC 2 ms 128 KiB
02-02.txt AC 2 ms 128 KiB
02-03.txt AC 2 ms 128 KiB
02-04.txt AC 2 ms 128 KiB
02-05.txt AC 2 ms 128 KiB
02-06.txt AC 2 ms 128 KiB
02-07.txt AC 2 ms 128 KiB
02-08.txt AC 2 ms 128 KiB
02-09.txt AC 2 ms 128 KiB
sample-01.txt AC 2 ms 128 KiB