Submission #2746811
Source Code Expand
/*
AtCoder Regular Contest 024 A - くつがくっつく
結果:
*/
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#define max(x,y)(x<y?y:x)
#define int long long
int compare(const void *a, const void *b) {
return *(int*)b - *(int*)a;
}
//尺取法
//scanf("%d", &N);
//for (i; i < N; ++i) {
// scanf("%d", &A[i]);
// if (b[A[i]] == 1) {
// ans = max(ans, i - j);
// while (b[A[i]] == 1) {
// b[A[j++]] = 0;
// }
// }
// b[A[i]] = 1;
//}
//ans = max(ans, i - j);
//printf("%d\n", ans);
//文字列の最大出現
//static int N, i, j, ans;
//static int A, B;
//static char A[50][51];
//static int cnt, max;
//char *max_name;
//
//scanf("%d", &N);
//for (i = 0; i < N; i++) {
// scanf("%s", A[i]);
//}
//max_name = A[0];
//for (i = 0; i < N; i++) {
// cnt = 0;
// for (j = 0; j < N; j++) {
// if (strcmp(A[i], A[j]) == 0) {
// cnt++;
// }
// if (cnt > max) {
// max = cnt;
// max_name = A[i];
// }
// }
//}
//printf("%s\n", max_name);
//#define DEBUG1
//#define DEBUG2
//#define DEBUGF
int main() {
//static int N, i, j, ans;
static int A[7] = { 0 }, B[7] = { 0 }, i, j, cnt = 0;
//static int A, B;
//static int A, B, C;
//static int a[31] = {}, b[31] = {}, cnt = 0;
//static char A[50][51];
//static int cnt, max;
//char *max_name;
static int ans;
for (i = 0; i < 7; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < 7; i++) {
scanf("%d", &B[i]);
}
for (i = 0; i < 7; i++) {
cnt = cnt + max(A[i], B[i]);
}
ans = cnt;
//qsort(A, N, sizeof(int), compare);
//ans = ;
printf("%d\n", ans);
//printf("%s\n", max_name);
#ifdef DEBUGF
getch();
#endif
return 0;
}
Submission Info
Submission Time
2018-06-26 21:23:46+0900
Task
A - ゴールドラッシュ
User
chonerie
Language
C (GCC 5.4.1)
Score
100
Code Size
1724 Byte
Status
AC
Exec Time
1 ms
Memory
128 KB
Compile Error
./Main.c: In function ‘main’:
./Main.c:75:9: warning: format ‘%d’ expects argument of type ‘int *’, but argument 2 has type ‘long long int *’ [-Wformat=]
scanf("%d", &A[i]);
^
./Main.c:78:9: warning: format ‘%d’ expects argument of type ‘int *’, but argument 2 has type ‘long long int *’ [-Wformat=]
scanf("%d", &B[i]);
^
./Main.c:87:9: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
printf("%d\n", ans);
^
./Main.c:75:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &A[i]);
^
./Main.c:78:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &B[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
100 / 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
Case Name
Status
Exec Time
Memory
subtask0_sample-01.txt
AC
1 ms
128 KB
subtask0_sample-02.txt
AC
1 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
1 ms
128 KB
subtask1_02.txt
AC
1 ms
128 KB
subtask1_03.txt
AC
1 ms
128 KB
subtask1_04.txt
AC
1 ms
128 KB
subtask1_05.txt
AC
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
0 ms
128 KB
subtask1_13.txt
AC
1 ms
128 KB
subtask1_14.txt
AC
1 ms
128 KB
subtask1_15.txt
AC
1 ms
128 KB