Submission #1246969
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ll n,m; cin >> n >> m; ll a[n]; for(int i=0;i<m;i++) cin >> a[i]; set<ll> s; for(int t=0; t<(1<<m); t++) { ll x=1; for(int i=0; i<m; i++) { if(t&(1<<i)) x*=a[i]; if(x>n) break; } if(x>n) continue; ll y=x; for(int i=0; i<m; i++) { if(t&(1<<i)) y/=a[i]; else if(y>1&&y%a[i]==0) y=0; } if(y) s.insert(x); } cout << s.size() << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Division 2 |
User | kzyKT |
Language | C++14 (GCC 5.4.1) |
Score | 25 |
Code Size | 525 Byte |
Status | RE |
Exec Time | 97 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 25 / 25 | 0 / 75 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt |
Subtask1 | sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, sub1_1.txt, sub1_2.txt, sub1_3.txt, sub1_4.txt, sub1_5.txt, sub1_6.txt |
Subtask2 | sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, sub1_1.txt, sub1_2.txt, sub1_3.txt, sub1_4.txt, sub1_5.txt, sub1_6.txt, sub2_1.txt, sub2_2.txt, sub2_3.txt, sub2_4.txt, sub2_5.txt, sub2_6.txt, sub2_7.txt, sub2_8.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_1.txt | AC | 1 ms | 256 KB |
sample_2.txt | AC | 1 ms | 256 KB |
sample_3.txt | AC | 1 ms | 256 KB |
sample_4.txt | AC | 1 ms | 256 KB |
sub1_1.txt | AC | 1 ms | 256 KB |
sub1_2.txt | AC | 1 ms | 256 KB |
sub1_3.txt | AC | 1 ms | 256 KB |
sub1_4.txt | AC | 1 ms | 256 KB |
sub1_5.txt | AC | 2 ms | 256 KB |
sub1_6.txt | AC | 2 ms | 256 KB |
sub2_1.txt | RE | 97 ms | 256 KB |
sub2_2.txt | RE | 97 ms | 256 KB |
sub2_3.txt | RE | 97 ms | 256 KB |
sub2_4.txt | RE | 97 ms | 256 KB |
sub2_5.txt | RE | 96 ms | 256 KB |
sub2_6.txt | RE | 96 ms | 256 KB |
sub2_7.txt | RE | 97 ms | 256 KB |
sub2_8.txt | RE | 97 ms | 256 KB |