제출 #198430

#제출 시각아이디문제언어결과실행 시간메모리
198430model_codeW (RMI18_w)C11
20 / 100
59 ms504 KiB
/** * Method: Handles the case of exactly two distinct values. * * Author: Catalin Francu **/ #include <stdio.h> #define MOD 1000000007 int main() { int n, x; int v1, v2 = 0, c1 = 1, c2 = 0; scanf("%d %d", &n, &v1); while (--n) { scanf("%d", &x); if (x == v1) { c1++; } else { v2 = x; c2++; } } if (v1 > v2) { int tmp = c1; c1 = c2; c2 = tmp; } /** * Now we know that the smaller value occurs c1 times and the larger value * occurs c2 times. **/ int sol = (long long)(c1 - 1) * (c2 - 1) * (c2 - 2) / 2 % MOD; printf("%d\n", sol); }

컴파일 시 표준 에러 (stderr) 메시지

w.c: In function 'main':
w.c:13:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &n, &v1);
   ^~~~~~~~~~~~~~~~~~~~~~~
w.c:15:5: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &x);
     ^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...