Submission #229005


Source Code Expand

#include <cstdio> 
#include <cstdlib> 
#include <cmath> 
#include <cstring> 
#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 <numeric>
#include <cassert>

#define FOR(i, min, max) for (int i = (min); i < (max); ++i) 
#define FORE(i, min, max) for (int i = (min); i <= (max); ++i) 
#define REP(i, n) for (int i = 0; i < (n); ++i) 
#define REPV(vec, i) for (int i = 0; i < (int)(vec.size()); ++i) 
#define FOR_EACH(vec, it) for (typeof((vec).begin()) it = (vec).begin(); it != (vec).end(); ++it)

using namespace std; 
static const double EPS = 1e-9; 
typedef long long ll; 

int main(void)
{
    int N;
    cin >> N;

    vector<int> w(N);

    REP(i, N)
        cin >> w[i];

    double ans = 0;
    REP(i, N) {
        int count = 1;
        REP(j, N) if (j != i && w[i]%w[j] == 0) {
            ++count;
        }
        ans += (double)((count+1)/2)/count;
    }

    printf("%.10f\n", ans);

    return 0;
}

Submission Info

Submission Time
Task C - コイン
User imazato
Language C++ (G++ 4.6.4)
Score 100
Code Size 1218 Byte
Status AC
Exec Time 26 ms
Memory 932 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 99 / 99 1 / 1
Status
AC × 3
AC × 20
AC × 40
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 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, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt
Subtask2 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, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt
Case Name Status Exec Time Memory
sample_01.txt AC 22 ms 800 KB
sample_02.txt AC 21 ms 800 KB
sample_03.txt AC 21 ms 812 KB
subtask1_01.txt AC 22 ms 928 KB
subtask1_02.txt AC 22 ms 816 KB
subtask1_03.txt AC 21 ms 804 KB
subtask1_04.txt AC 21 ms 800 KB
subtask1_05.txt AC 20 ms 920 KB
subtask1_06.txt AC 23 ms 788 KB
subtask1_07.txt AC 21 ms 924 KB
subtask1_08.txt AC 22 ms 804 KB
subtask1_09.txt AC 21 ms 800 KB
subtask1_10.txt AC 22 ms 924 KB
subtask1_11.txt AC 22 ms 804 KB
subtask1_12.txt AC 21 ms 804 KB
subtask1_13.txt AC 21 ms 804 KB
subtask1_14.txt AC 22 ms 932 KB
subtask1_15.txt AC 21 ms 800 KB
subtask1_16.txt AC 21 ms 932 KB
subtask1_17.txt AC 21 ms 928 KB
subtask1_18.txt AC 22 ms 928 KB
subtask1_19.txt AC 22 ms 804 KB
subtask1_20.txt AC 22 ms 736 KB
subtask2_01.txt AC 21 ms 804 KB
subtask2_02.txt AC 22 ms 808 KB
subtask2_03.txt AC 22 ms 800 KB
subtask2_04.txt AC 21 ms 928 KB
subtask2_05.txt AC 21 ms 732 KB
subtask2_06.txt AC 22 ms 928 KB
subtask2_07.txt AC 22 ms 928 KB
subtask2_08.txt AC 22 ms 932 KB
subtask2_09.txt AC 21 ms 924 KB
subtask2_10.txt AC 26 ms 760 KB
subtask2_11.txt AC 22 ms 928 KB
subtask2_12.txt AC 22 ms 732 KB
subtask2_13.txt AC 22 ms 800 KB
subtask2_14.txt AC 22 ms 928 KB
subtask2_15.txt AC 23 ms 788 KB
subtask2_16.txt AC 22 ms 796 KB
subtask2_17.txt AC 22 ms 800 KB
subtask2_18.txt AC 22 ms 796 KB
subtask2_19.txt AC 21 ms 796 KB
subtask2_20.txt AC 22 ms 924 KB