Submission #18490


Source Code Expand

Copy
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;
static const double EPS = 1e-10;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(a) a.begin(),a.end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SS stringstream
#define DBG1(a) rep(_X,sz(a)){printf("%d ",a[_X]);}puts("");
#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf("%d ",a[_X][_Y]);puts("");}
#define bitcount(b) __builtin_popcount(b)
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)

#define delete(a,n) a.erase(remove(all(a),n),a.end())
template<typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; }
template<typename T> void operator>>(vector<T>& a, int b) {while(b--)if(!a.empty())a.pop_back();}
bool isprime(int n){ if(n<2)return false; for(int i=2;i*i<=n;i++)if(n%i==0)return false; return true;}
ll b_pow(ll x,ll n){return n ? b_pow(x*x,n/2)*(n%2?x:1) : 1ll;}
string itos(int n){stringstream ss;ss << n;return ss.str();}

string s = "FDCBA";

int main(){
	ios_base::sync_with_stdio(false);
	
	int N;
	string t;
	cin >> N >> t;
	
	int sum = 0;
	for(int i = 0 ; i < N ; i++) for(int j = 0 ; j < 5 ; j++) if( t[i] == s[j] ) sum += j;
	
	double ans = (double)sum / N;
	printf("%.12f\n",ans);
}

Submission Info

Submission Time
Task A - GPA計算
User kyulidenamida
Language C++ (G++ 4.6.4)
Score 100
Code Size 1728 Byte
Status AC
Exec Time 24 ms
Memory 808 KB

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 768 KB
00_sample_02.txt AC 21 ms 788 KB
01_rnd_01.txt AC 21 ms 756 KB
01_rnd_02.txt AC 21 ms 764 KB
01_rnd_03.txt AC 24 ms 780 KB
01_rnd_04.txt AC 22 ms 800 KB
01_rnd_05.txt AC 21 ms 808 KB
01_rnd_06.txt AC 21 ms 760 KB
01_rnd_07.txt AC 22 ms 796 KB
01_rnd_08.txt AC 22 ms 788 KB
01_rnd_09.txt AC 22 ms 784 KB
01_rnd_10.txt AC 22 ms 784 KB
02_rndmax_01.txt AC 21 ms 784 KB
02_rndmax_02.txt AC 22 ms 792 KB
02_rndmax_03.txt AC 21 ms 784 KB
02_rndmax_04.txt AC 22 ms 780 KB
02_rndmax_05.txt AC 20 ms 780 KB
02_rndmax_06.txt AC 20 ms 784 KB
02_rndmax_07.txt AC 21 ms 764 KB
02_rndmax_08.txt AC 21 ms 788 KB
02_rndmax_09.txt AC 21 ms 792 KB
02_rndmax_10.txt AC 20 ms 784 KB
03_mini_01.txt AC 21 ms 796 KB
03_mini_02.txt AC 22 ms 772 KB
03_mini_03.txt AC 21 ms 788 KB
03_mini_04.txt AC 21 ms 784 KB
03_mini_05.txt AC 21 ms 792 KB
04_samemax_01.txt AC 21 ms 796 KB
04_samemax_02.txt AC 21 ms 736 KB
04_samemax_03.txt AC 21 ms 796 KB
04_samemax_04.txt AC 21 ms 796 KB
04_samemax_05.txt AC 20 ms 788 KB