Submission #1022213
Source Code Expand
#include <algorithm> #include <cassert> #include <cfloat> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <deque> #include <iomanip> #include <iostream> #include <limits> #include <map> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <vector> #define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i)) #define rep(i,n) FOR(i,0,n) #define pb push_back #define eb emplace_back #define mp make_pair #define fst first #define snd second #define all(v) begin(v), end(v) #define debug(x) cerr<< #x <<": "<<x<<endl #define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<vector<int> > vvi; typedef vector<ll> vll; typedef vector<vector<ll> > vvll; template<class T> using vv=vector<vector< T > >; int main() { int n; scanf("%d", &n); map<char, int> mp; mp['A'] = 4; mp['B'] = 3; mp['C'] = 2; mp['D'] = 1; mp['F'] = 0; int sum = 0; rep (i, n) { char c; scanf(" %c", &c); sum += mp[c]; } printf("%.12f\n", (double)sum / n); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - GPA計算 |
User | tspcx |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1260 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 928 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:43:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:53:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf(" %c", &c); ^
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
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 | 17 ms | 804 KB |
00_sample_02.txt | AC | 19 ms | 924 KB |
01_rnd_01.txt | AC | 18 ms | 800 KB |
01_rnd_02.txt | AC | 18 ms | 800 KB |
01_rnd_03.txt | AC | 18 ms | 804 KB |
01_rnd_04.txt | AC | 18 ms | 804 KB |
01_rnd_05.txt | AC | 19 ms | 676 KB |
01_rnd_06.txt | AC | 16 ms | 676 KB |
01_rnd_07.txt | AC | 18 ms | 804 KB |
01_rnd_08.txt | AC | 16 ms | 676 KB |
01_rnd_09.txt | AC | 18 ms | 800 KB |
01_rnd_10.txt | AC | 18 ms | 804 KB |
02_rndmax_01.txt | AC | 16 ms | 800 KB |
02_rndmax_02.txt | AC | 18 ms | 800 KB |
02_rndmax_03.txt | AC | 17 ms | 676 KB |
02_rndmax_04.txt | AC | 18 ms | 800 KB |
02_rndmax_05.txt | AC | 18 ms | 928 KB |
02_rndmax_06.txt | AC | 16 ms | 796 KB |
02_rndmax_07.txt | AC | 18 ms | 804 KB |
02_rndmax_08.txt | AC | 16 ms | 844 KB |
02_rndmax_09.txt | AC | 16 ms | 800 KB |
02_rndmax_10.txt | AC | 18 ms | 804 KB |
03_mini_01.txt | AC | 16 ms | 796 KB |
03_mini_02.txt | AC | 18 ms | 804 KB |
03_mini_03.txt | AC | 18 ms | 796 KB |
03_mini_04.txt | AC | 18 ms | 800 KB |
03_mini_05.txt | AC | 18 ms | 920 KB |
04_samemax_01.txt | AC | 16 ms | 804 KB |
04_samemax_02.txt | AC | 18 ms | 804 KB |
04_samemax_03.txt | AC | 16 ms | 800 KB |
04_samemax_04.txt | AC | 16 ms | 800 KB |
04_samemax_05.txt | AC | 18 ms | 920 KB |