Submission #18576


Source Code Expand

Copy
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <complex>
using namespace std;
  
#ifdef DEBUG
FILE *fp = freopen("input.txt", "r", stdin);
#endif

#define FILL(c, v) memset(c, v, sizeof(c))
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, c) for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define SZ(c) (c).size()
#define RANGE(x, a, b) ((a <= x) && (x <= b))

const int INF = 1e9;
const double EPS = 1e-9;

typedef long long ll;
typedef pair<int, int> pi;

int main() {
	int n;
	char grade[1000];
	scanf("%d", &n);
	scanf("%s", &grade);

	double gpa = 0;
	REP(i, n) {
		if (grade[i] == 'F') gpa += 0;
		if (grade[i] == 'D') gpa += 1;
		if (grade[i] == 'C') gpa += 2;
		if (grade[i] == 'B') gpa += 3;
		if (grade[i] == 'A') gpa += 4;
	}
	gpa /= n;

	printf("%.10lf\n", gpa);

	return 0;
}

Submission Info

Submission Time
Task A - GPA計算
User naruhodo
Language C++ (G++ 4.6.4)
Score 100
Code Size 1020 Byte
Status AC
Exec Time 33 ms
Memory 844 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:33:20: warning: format ‘%s’ expects argument of type ‘char*’, but argument 2 has type ‘char (*)[1000]’ [-Wformat]
./Main.cpp:32:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:33:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 32
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.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, 02_rndmax_01.txt, 02_rndmax_02.txt, 02_rndmax_03.txt, 02_rndmax_04.txt, 02_rndmax_05.txt, 02_rndmax_06.txt, 02_rndmax_07.txt, 02_rndmax_08.txt, 02_rndmax_09.txt, 02_rndmax_10.txt, 03_mini_01.txt, 03_mini_02.txt, 03_mini_03.txt, 03_mini_04.txt, 03_mini_05.txt, 04_samemax_01.txt, 04_samemax_02.txt, 04_samemax_03.txt, 04_samemax_04.txt, 04_samemax_05.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 23 ms 780 KB
00_sample_02.txt AC 24 ms 780 KB
01_rnd_01.txt AC 24 ms 780 KB
01_rnd_02.txt AC 23 ms 772 KB
01_rnd_03.txt AC 23 ms 784 KB
01_rnd_04.txt AC 22 ms 764 KB
01_rnd_05.txt AC 33 ms 780 KB
01_rnd_06.txt AC 23 ms 732 KB
01_rnd_07.txt AC 33 ms 780 KB
01_rnd_08.txt AC 20 ms 780 KB
01_rnd_09.txt AC 24 ms 780 KB
01_rnd_10.txt AC 23 ms 776 KB
02_rndmax_01.txt AC 25 ms 780 KB
02_rndmax_02.txt AC 26 ms 844 KB
02_rndmax_03.txt AC 24 ms 784 KB
02_rndmax_04.txt AC 24 ms 784 KB
02_rndmax_05.txt AC 21 ms 784 KB
02_rndmax_06.txt AC 22 ms 784 KB
02_rndmax_07.txt AC 24 ms 780 KB
02_rndmax_08.txt AC 23 ms 720 KB
02_rndmax_09.txt AC 24 ms 784 KB
02_rndmax_10.txt AC 23 ms 776 KB
03_mini_01.txt AC 24 ms 776 KB
03_mini_02.txt AC 23 ms 780 KB
03_mini_03.txt AC 21 ms 728 KB
03_mini_04.txt AC 21 ms 736 KB
03_mini_05.txt AC 23 ms 784 KB
04_samemax_01.txt AC 25 ms 776 KB
04_samemax_02.txt AC 21 ms 776 KB
04_samemax_03.txt AC 22 ms 780 KB
04_samemax_04.txt AC 23 ms 776 KB
04_samemax_05.txt AC 24 ms 736 KB