249302026-02-16 22:02:10999Főzet készítéscpp17Accepted 50/50398ms2432 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
signed main() {
    vector<array<int,2>> aranyok;
    for(int i = 1;i<=67;i++){
        for(int j = i;j<=67;j++){
            if(__gcd(i,j)==1){
                aranyok.push_back({i,j});
                if(i!=j)aranyok.push_back({j,i});
            }
        }
    }
    vector<vector<int>> dp(501,vector<int>(501));
    for(auto [a,b]:aranyok){
        for(int i = 500;i>=a;i--){
            for(int j = 500;j>=b;j--){
                dp[i][j]=max(dp[i][j],dp[i-a][j-b]+1);
            }
        }
    }
    /*for(int i = 0;i<10;i++){
        for(int j = 0;j<10;j++){
            cout<<dp[i][j]<<' ';
        }cout<<endl;
    }*/
    int t;cin>>t;
    while(t--){
        int a,b;cin>>a>>b;
        cout<<dp[a][b]<<endl;
    }
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/0386ms2424 KiB
2Accepted0/0395ms2356 KiB
3Accepted3/3391ms2356 KiB
4Accepted2/2382ms2428 KiB
5Accepted3/3388ms2356 KiB
6Accepted2/2381ms2372 KiB
7Accepted3/3388ms2428 KiB
8Accepted2/2388ms2432 KiB
9Accepted3/3393ms2356 KiB
10Accepted2/2397ms2428 KiB
11Accepted2/2389ms2428 KiB
12Accepted2/2388ms2356 KiB
13Accepted2/2393ms2356 KiB
14Accepted2/2386ms2356 KiB
15Accepted2/2386ms2424 KiB
16Accepted2/2398ms2428 KiB
17Accepted2/2397ms2428 KiB
18Accepted2/2386ms2356 KiB
19Accepted2/2389ms2356 KiB
20Accepted3/3395ms2428 KiB
21Accepted3/3395ms2356 KiB
22Accepted3/3388ms2356 KiB
23Accepted3/3395ms2356 KiB