Submission #1176937

#TimeUsernameProblemLanguageResultExecution timeMemory
1176937tamzidBank (IZhO14_bank)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> using ll = long long; #define pb push_back #define F first #define S second #define vii vector<int> #define vl vector<long long> #define cinv(v) for (auto &it : v) cin >> it; #define coutv(v) for (auto &it : v) cout << it << " "; cout << endl; using namespace std; //using namespace __gnu_pbds; //template<class T> using ordset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; void solve() { int n,m; cin>>n>>m; vii v(n); cinv(v); vii b(m); bool detect = false; for(int i=0;i<m;++i) { cin>>b[i]; if(v[i]%b[i]==0) { detect = true; } } if(detect) { cout<<"YES\n"; return; } else { cout<<"NO\n"; } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); //int t;cin>>t;while(t--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...