# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
923091 | 8pete8 | Brunhilda’s Birthday (BOI13_brunhilda) | C++17 | 1069 ms | 2908 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<cassert>
#include<limits.h>
#include<cmath>
#include<set>
#include<numeric> //gcd(a,b)
#include<algorithm>
#include<bitset>
#include<stack>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define pppiiii pair<pii,pii>
#define ppii pair<int,pii>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#define int long long
const int mod=998244353,mxn=1e6+5,lg=30,inf=1e18,minf=-1e18,Mxn=100000,root=700;
void setIO(string name){
ios_base::sync_with_stdio(0); cin.tie(0);
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
int n,q;
vector<int>v;
void solve(){
int ans=0;
int cur;cin>>cur;
vector<int>op(n);
while(cur){
int lc=cur;
ans++;
for(int i=0;i<n;i++)op[i]=(cur/v[i])*v[i];
for(auto i:op)cur=min(cur,i);
if(lc==cur){
cout<<"oo\n";
return;
}
}
cout<<ans<<'\n';
}
int32_t main(){
fastio
cin>>n>>q;//brute force
v.resize(n);
for(int i=0;i<n;i++)cin>>v[i];
while(q--)solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |