QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#227912 | #7585. TDL | Giga_Cronos# | AC ✓ | 216ms | 3632kb | C++14 | 774b | 2023-10-28 09:07:11 | 2023-10-28 09:07:11 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int> vi;
int n,k,m;
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int tc=1;
cin>>tc;
while(tc--){
cin>>k>>m;
int best=numeric_limits<int>::max();
for(int d=1;d<=1000;d++){
n=d^k;
int cont=m;
for(int j=n+1;j<=n+d;j++){
if(__gcd(n,j)==1){
cont--;
}
}
if(cont==0 && __gcd(d,n)==1){
best=min(best,n);
}
}
if(best!=numeric_limits<int>::max()){
cout<<best<<"\n";
}else{
cout<<-1<<"\n";
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 41ms
memory: 3548kb
input:
2 3 5 6 100
output:
5 -1
result:
ok 2 number(s): "5 -1"
Test #2:
score: 0
Accepted
time: 216ms
memory: 3632kb
input:
10 525775438567843653 99 682312746347646949 100 928247462368723598 89 389467864734767741 77 734712353456789580 91 928574865348354786 95 56042586089579521 93 614889782588491751 60 614889782588490923 90 614889782588491001 100
output:
-1 682312746347646754 928247462368723467 389467864734767645 734712353456789527 928574865348354669 56042586089579704 614889782588491410 614889782588490776 614889782588490814
result:
ok 10 numbers