Submission #1073321

#TimeUsernameProblemLanguageResultExecution timeMemory
1073321beaconmcPictionary (COCI18_pictionary)C++17
0 / 140
740 ms2132 KiB
#include <bits/stdc++.h> typedef long long ll; #define FOR(i,x,y) for(ll i=x; i<y; i++) #define FORNEG(i,x,y) for(ll i=x; i>y; i++) using namespace std; int main(){ ll n,m,q; cin >> n >> m >> q; FOR(i,0,q){ ll ans = m; ll a,b; cin >> a >> b; vector<ll> as, bs; FOR(i,1,sqrt(a)+2){ if (a%i==0){ as.push_back(i); as.push_back(a/i); } } FOR(i,1,sqrt(b)+2){ if (b%i==0){ bs.push_back(i); bs.push_back(b/i); } } for (auto&A : as){ for (auto&B : bs){ if (lcm(A,B) <= n && 0<=m-min(A,B)){ ans = min(ans, m-min(A,B)); } } } cout << ans+1 << "\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...