Submission #3545260
Source Code Expand
#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9,MOD = 1e9+7,ohara = 1e6;
const ll LINF = 1e18;
using namespace std;
#define rep(i,n) for(ll (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(ll i=(a);i<(b);i++)
#define rrrep(i,a,b) for(ll i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl
ll n,cnt=0,ans=0,a[ohara],b,c,d,cmp,cmpp,m,h,w,x,y,sum=0,pos,q;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl;
struct edge{int to,cost;};
//-------------------------↓↓↓↓↓↓------------------------
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n>>q;
rep(i,q)cin>>a[i];
map<ll,ll> out;
//reverse(a,a+q);
rep(i,q){
if(a[i]==1)fl=true;
}
if(fl){
Cout(n);
return 0;
}
rep(i,q){
for(int bit=0;bit<(1<<(i+1));bit++){
cnt=1;
map<ll,ll> nouse;
rep(j,i+1){
if(bit&(1<<j)){
cnt*=a[j];
nouse[j]=1;
if(cnt>n)break;
}
}
fl=true;
if(cnt>n)continue;
rep(j,q){
if(nouse[j]==1)continue;
if(cnt%a[j]==0){
fl=false;
break;
}
}
if(!fl)continue;
//Cout(cnt);
if(out[cnt]==0){
out[cnt]=1;
ans++;
}
}
}
Cout(ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Division 2 |
User |
asdf1 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1768 Byte |
Status |
WA |
Exec Time |
5255 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
0 / 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 |
WA |
1 ms |
256 KB |
sample_3.txt |
AC |
1 ms |
256 KB |
sample_4.txt |
WA |
1 ms |
256 KB |
sub1_1.txt |
WA |
1 ms |
256 KB |
sub1_2.txt |
WA |
1 ms |
256 KB |
sub1_3.txt |
WA |
2 ms |
256 KB |
sub1_4.txt |
WA |
2 ms |
256 KB |
sub1_5.txt |
WA |
17 ms |
256 KB |
sub1_6.txt |
WA |
14 ms |
256 KB |
sub2_1.txt |
WA |
29 ms |
256 KB |
sub2_2.txt |
WA |
29 ms |
256 KB |
sub2_3.txt |
WA |
37 ms |
256 KB |
sub2_4.txt |
WA |
33 ms |
256 KB |
sub2_5.txt |
WA |
1145 ms |
256 KB |
sub2_6.txt |
WA |
1222 ms |
256 KB |
sub2_7.txt |
TLE |
5255 ms |
256 KB |
sub2_8.txt |
TLE |
5255 ms |
256 KB |