Submission #1332835


Source Code Expand

Copy
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <limits.h>	
#define inf INT_MAX
#define INF 9223372036854775807
#define sq(n) ((n)*(n))
#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(),i,j,x[100],y[100],m=0;
	rep(i,n){
		x[i]=in();
		y[i]=in();
	}
	rep(i,n-1){
		for(j=i+1;j<n;j++){
			m=max(m,sq(x[i]-x[j])+sq(y[i]-y[j]));
		}
	}
	dprint(sqrt(m));
	return 0;
}

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User f_t_ikt
Language C (GCC 5.4.1)
Score 100
Code Size 1045 Byte
Status
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.c: In function ‘in’:
./Main.c:12: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:16: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:20: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:24:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s);
  ^

Judge Result

Set Name Score / Max Score Test Cases
All 100 / 100 00_max.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt
Case Name Status Exec Time Memory
00_max.txt 1 ms 128 KB
00_sample_01.txt 1 ms 128 KB
00_sample_02.txt 1 ms 128 KB
00_sample_03.txt 1 ms 128 KB
00_sample_04.txt 1 ms 128 KB
00_sample_05.txt 1 ms 128 KB
01_rnd_00.txt 1 ms 128 KB
01_rnd_01.txt 1 ms 128 KB
01_rnd_02.txt 1 ms 128 KB
01_rnd_03.txt 1 ms 128 KB
01_rnd_04.txt 1 ms 128 KB
01_rnd_05.txt 1 ms 128 KB
01_rnd_06.txt 1 ms 128 KB
01_rnd_07.txt 1 ms 128 KB
01_rnd_08.txt 1 ms 128 KB
01_rnd_09.txt 1 ms 128 KB
01_rnd_10.txt 1 ms 128 KB
01_rnd_11.txt 1 ms 128 KB
01_rnd_12.txt 1 ms 128 KB
01_rnd_13.txt 1 ms 128 KB
01_rnd_14.txt 1 ms 128 KB
01_rnd_15.txt 1 ms 128 KB
01_rnd_16.txt 1 ms 128 KB
01_rnd_17.txt 1 ms 128 KB
01_rnd_18.txt 1 ms 128 KB
01_rnd_19.txt 1 ms 128 KB