Submission #1673655
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define REP(i,n) for(int i=0;i<n;i++) #define REPR(i,n) for(int i=n;i>=0;i--) #define FOR(i,m,n) for(int i=m;i<n;i++) #define EPS (1e-7) #define MAX_N 100 typedef long long ll; typedef pair<int,int>P; int dx[4]={1,0,-1,0}; int dy[4]={0,1,0,-1}; int fact(int n){ int ret=n; if(n==1)return 1; while(n>1)return ret*fact(n-1); } int main(){ int n; cin>>n; vector<int> c(n); REP(i,n){ cin>>c[i]; } int ans=0; sort(c.begin(),c.end()); do{ REP(i,n){ int count=0; REP(j,i){ if(c[i]>=c[j] && c[i]%c[j]==0)count++; } } }while(next_permutation(c.begin(),c.end())); cout<<ans<<endl; cout<<(double)ans/fact(n)<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | kwkm0429 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 746 Byte |
Status | WA |
Exec Time | 2103 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 99 | 0 / 1 | ||||||||
Status |
|
|
|
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 | WA | 1 ms | 256 KB |
sample_02.txt | WA | 1 ms | 256 KB |
sample_03.txt | WA | 1 ms | 256 KB |
subtask1_01.txt | WA | 1 ms | 256 KB |
subtask1_02.txt | WA | 1 ms | 256 KB |
subtask1_03.txt | WA | 1 ms | 256 KB |
subtask1_04.txt | WA | 1 ms | 256 KB |
subtask1_05.txt | WA | 1 ms | 256 KB |
subtask1_06.txt | WA | 1 ms | 256 KB |
subtask1_07.txt | WA | 1 ms | 256 KB |
subtask1_08.txt | WA | 1 ms | 256 KB |
subtask1_09.txt | WA | 1 ms | 256 KB |
subtask1_10.txt | WA | 1 ms | 256 KB |
subtask1_11.txt | WA | 1 ms | 256 KB |
subtask1_12.txt | WA | 1 ms | 256 KB |
subtask1_13.txt | WA | 1 ms | 256 KB |
subtask1_14.txt | WA | 1 ms | 256 KB |
subtask1_15.txt | WA | 1 ms | 256 KB |
subtask1_16.txt | WA | 1 ms | 256 KB |
subtask1_17.txt | WA | 1 ms | 256 KB |
subtask1_18.txt | WA | 1 ms | 256 KB |
subtask1_19.txt | WA | 1 ms | 256 KB |
subtask1_20.txt | WA | 1 ms | 256 KB |
subtask2_01.txt | WA | 13 ms | 256 KB |
subtask2_02.txt | WA | 1 ms | 256 KB |
subtask2_03.txt | TLE | 2103 ms | 256 KB |
subtask2_04.txt | TLE | 2103 ms | 256 KB |
subtask2_05.txt | TLE | 2103 ms | 256 KB |
subtask2_06.txt | TLE | 2103 ms | 256 KB |
subtask2_07.txt | TLE | 2103 ms | 256 KB |
subtask2_08.txt | TLE | 2103 ms | 256 KB |
subtask2_09.txt | TLE | 2103 ms | 256 KB |
subtask2_10.txt | TLE | 2103 ms | 256 KB |
subtask2_11.txt | TLE | 2103 ms | 256 KB |
subtask2_12.txt | TLE | 2103 ms | 256 KB |
subtask2_13.txt | TLE | 2103 ms | 256 KB |
subtask2_14.txt | TLE | 2103 ms | 256 KB |
subtask2_15.txt | TLE | 2103 ms | 256 KB |
subtask2_16.txt | TLE | 2103 ms | 256 KB |
subtask2_17.txt | TLE | 2103 ms | 256 KB |
subtask2_18.txt | TLE | 2103 ms | 256 KB |
subtask2_19.txt | TLE | 2103 ms | 256 KB |
subtask2_20.txt | TLE | 2103 ms | 256 KB |