QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#64767 | #2488. Diophantine Equation | As3b_team_f_masr | Compile Error | / | / | C++ | 2.0kb | 2022-11-25 15:34:44 | 2022-11-25 15:34:46 |
Judging History
This is the latest submission verdict.
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2022-11-25 15:34:46]
- Judged
- Verdict: Compile Error
- Time: 0ms
- Memory: 0kb
- [2022-11-25 15:34:44]
- Submitted
answer
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define sc second
#define EPS 1e-9
const int N=1e7;
ll sqr(ll x)
{
ll y=sqrtl(x);
for(int i=0;i<2;i++)
{
if(y-i>0&&(y-i)*(y-i)==x)return y-i;
if(y+i>0&&(y+i)*(y+i)==x)return y+i;
}
return 0;
}
int a[1000000],id;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t;
cin>>t;
while(t--)
{
ll n;
cin>>n;
vector<int> v;
for(int i=1;i*i<=n;i++)
{
if(n%i==0)
{
v.push_back(i);
v.push_back(n/i);
}
}
unordered_map<int,int> mp;
id=0;
sort(v.begin(),v.end())
for(int i=0;i<v.size();i++)
{
for(int j=0;j<v.size();j++)
{
if(1ll*v[i]*v[j]<=n&&!mp[v[i]*v[j]])
{
a[id]=(1ll*v[i]*v[j]);
mp[v[i]*v[j]]++;
id++;
}
else break;
}
}
bool ok=0;
ll ax,ay;
for(int i=0;i<id;i++)
{
ll d=a[i];
ll a=3,b=-3*d,c=d*d-n*n/d;
ll sq=sqr(b*b-4*a*c);
if(sq*sq==b*b-4*a*c)
{
ll x=-b+(ll)sq;
if(x%6==0&&x>0)
{
x/=6;
if(d-x>0)
{
if(x*x*x+(d-x)*(d-x)*(d-x)==n*n)
{
ok=1;
ax=x;
ay=d-x;
break;
}
}
}
}
}
if(ok)cout<<ax<<" "<<ay<<'\n';
else cout<<"impossible\n";
}
return 0;
}
Details
answer.code: In function ‘int main()’: answer.code:45:24: error: expected ‘;’ before ‘for’ 45 | sort(v.begin(),v.end()) | ^ | ; 46 | for(int i=0;i<v.size();i++) | ~~~ answer.code:46:21: error: ‘i’ was not declared in this scope 46 | for(int i=0;i<v.size();i++) | ^