Submission #471345


Source Code Expand

#include<stdio.h>
#define N 100000

int main() {
	int n, i, min, max;
	double a, b, s[N], sum, p, q;

	scanf("%d %lf %lf", &n, &a, &b);
	for(i = 0; i < n; i++) {
		scanf("%lf", &s[i]);
	}
	sum = s[0];

	max = 0;
	min = 0;
	for(i = 1; i < n; i++) {
		if(s[max] < s[i]) {
			max = i;
		}

		if(s[min] > s[i]) {
			min = i;
		}

		sum += s[i];
	}


	p = b / (s[max] - s[min]);

	q = a - p / n * sum;
	if(s[max] == s[min]) {
		printf("-1\n");
	}
	else {
		printf("%f %f\n", p, q);
	}

	return(0);
}

Submission Info

Submission Time
Task A - 点数変換
User yuu4415
Language C (GCC 4.9.2)
Score 100
Code Size 533 Byte
Status AC
Exec Time 55 ms
Memory 1452 KiB

Compile Error

./Main.c: In function ‘main’:
./Main.c:8:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %lf %lf", &n, &a, &b);
  ^
./Main.c:10:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lf", &s[i]);
   ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 42
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.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, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt
Case Name Status Exec Time Memory
sample_01.txt AC 25 ms 680 KiB
sample_02.txt AC 23 ms 796 KiB
sample_03.txt AC 23 ms 792 KiB
subtask1_01.txt AC 35 ms 924 KiB
subtask1_02.txt AC 46 ms 1188 KiB
subtask1_03.txt AC 43 ms 1188 KiB
subtask1_04.txt AC 29 ms 796 KiB
subtask1_05.txt AC 52 ms 1448 KiB
subtask1_06.txt AC 46 ms 1192 KiB
subtask1_07.txt AC 54 ms 1436 KiB
subtask1_08.txt AC 43 ms 1180 KiB
subtask1_09.txt AC 30 ms 916 KiB
subtask1_10.txt AC 32 ms 1044 KiB
subtask1_11.txt AC 38 ms 1056 KiB
subtask1_12.txt AC 53 ms 1436 KiB
subtask1_13.txt AC 32 ms 924 KiB
subtask1_14.txt AC 24 ms 796 KiB
subtask1_15.txt AC 40 ms 1188 KiB
subtask1_16.txt AC 42 ms 1192 KiB
subtask1_17.txt AC 34 ms 988 KiB
subtask1_18.txt AC 44 ms 1184 KiB
subtask1_19.txt AC 53 ms 1444 KiB
subtask1_20.txt AC 55 ms 1444 KiB
subtask1_21.txt AC 55 ms 1440 KiB
subtask1_22.txt AC 52 ms 1432 KiB
subtask1_23.txt AC 54 ms 1432 KiB
subtask1_24.txt AC 54 ms 1444 KiB
subtask1_25.txt AC 54 ms 1436 KiB
subtask1_26.txt AC 53 ms 1432 KiB
subtask1_27.txt AC 55 ms 1452 KiB
subtask1_28.txt AC 54 ms 1436 KiB
subtask1_29.txt AC 53 ms 1376 KiB
subtask1_30.txt AC 54 ms 1444 KiB
subtask1_31.txt AC 53 ms 1448 KiB
subtask1_32.txt AC 54 ms 1440 KiB
subtask1_33.txt AC 54 ms 1448 KiB
subtask1_34.txt AC 53 ms 1452 KiB
subtask1_35.txt AC 54 ms 1440 KiB
subtask1_36.txt AC 54 ms 1440 KiB
subtask1_37.txt AC 54 ms 1444 KiB
subtask1_38.txt AC 53 ms 1448 KiB
subtask1_39.txt AC 54 ms 1444 KiB