Submission #1332433
Source Code Expand
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <limits.h>
#define inf INT_MAX
#define INF 9223372036854775807
#define rep(i,n) for(i=0;i<n;i++)
int in(void){
int i;scanf("%d",&i);
return i;
}
long long llin(void){
long long i;scanf("%lld",&i);
return i;
}
double din(void){
double i;scanf("%lf",&i);
return i;
}
void chin(char s[]){
scanf("%s",s);
}
void print(int a){
printf("%d\n",a);
}
void llprint(long long a){
printf("%lld\n",a);
}
void dprint(double a){
printf("%.10f\n",a);
}
void print2(int a,int b){
printf("%d %d\n",a,b);
}
long long max(long long a,long long b){
return a>b?a:b;
}
long long min(long long a,long long b){
return a<b?a:b;
}
double dmax(double a,double b){
return a>b?a:b;
}
int main(void){
int n=in(),k=in();
puts(k*2<n?"YES":"NO");
return 0;
}
Submission Info
Submission Time
2017-06-05 11:59:54+0900
Task
A - 閉路グラフ
User
f_t_ikt
Language
C (GCC 5.4.1)
Score
0
Code Size
880 Byte
Status
WA
Exec Time
1 ms
Memory
128 KB
Compile Error
./Main.c: In function ‘in’:
./Main.c:11:8: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
int i;scanf("%d",&i);
^
./Main.c: In function ‘llin’:
./Main.c:15:14: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
long long i;scanf("%lld",&i);
^
./Main.c: In function ‘din’:
./Main.c:19:11: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
double i;scanf("%lf",&i);
^
./Main.c: In function ‘chin’:
./Main.c:23:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s",s);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 100
Status
Set Name
Test Cases
Sample
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt
All
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt
Case Name
Status
Exec Time
Memory
subtask0_sample_01.txt
AC
1 ms
128 KB
subtask0_sample_02.txt
AC
0 ms
128 KB
subtask0_sample_03.txt
AC
1 ms
128 KB
subtask0_sample_04.txt
AC
1 ms
128 KB
subtask1_01.txt
AC
0 ms
128 KB
subtask1_02.txt
AC
1 ms
128 KB
subtask1_03.txt
AC
1 ms
128 KB
subtask1_04.txt
AC
0 ms
128 KB
subtask1_05.txt
WA
1 ms
128 KB
subtask1_06.txt
AC
1 ms
128 KB
subtask1_07.txt
AC
1 ms
128 KB
subtask1_08.txt
AC
1 ms
128 KB
subtask1_09.txt
AC
1 ms
128 KB
subtask1_10.txt
AC
1 ms
128 KB
subtask1_11.txt
AC
1 ms
128 KB
subtask1_12.txt
AC
1 ms
128 KB
subtask1_13.txt
WA
1 ms
128 KB
subtask1_14.txt
AC
1 ms
128 KB
subtask1_15.txt
AC
1 ms
128 KB
subtask1_16.txt
AC
1 ms
128 KB
subtask1_17.txt
AC
0 ms
128 KB
subtask1_18.txt
AC
1 ms
128 KB
subtask1_19.txt
AC
1 ms
128 KB
subtask1_20.txt
AC
1 ms
128 KB
subtask1_21.txt
AC
1 ms
128 KB
subtask1_22.txt
AC
1 ms
128 KB
subtask1_23.txt
AC
1 ms
128 KB
subtask1_24.txt
AC
0 ms
128 KB
subtask1_25.txt
AC
1 ms
128 KB
subtask1_26.txt
AC
1 ms
128 KB