#include <bits/stdc++.h>
#include "Alice.h"
using namespace std;
vector<pair<int,int>> Alice(){
vector<pair<int, int>> v;
int x = setN(5000);
for(int i = 1; i < 5000; i++){
v.push_back({i+1, (x%i)+1});
}return v;
}
#include "Bob.h"
#include <bits/stdc++.h>
using namespace std;
long long Bob(vector<pair<int,int>> V){
vector<pair<long long,long long>> v;
for(const auto &u: V){
long long i = u.first - 1;
long long r = u.second - 1;
if(i > 0) v.push_back({i, r});
}
sort(v.begin(), v.end(), [](const auto &a, const auto &b){
return a.first > b.first;
});
long long i1 = v[0].first;
long long r1 = v[0].second;
long long i2 = v[1].first;
long long r2 = v[1].second;
for(long long k = 0; k <= 1000000; k++){
long long X = r1 + k*i1;
if(X % i2 == r2){
return X;
}
}
return -1;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |