QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#625335 | #9354. Justifying the Conjecture | Godwang# | WA | 1ms | 3644kb | C++14 | 564b | 2024-10-09 18:45:27 | 2024-10-09 18:45:27 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define ll long long
#define pb push_back
#define endl '\n'
const int N=1e5+10;
////////////////
int tt;
int n;
//////////////////
////////////////
///////////////
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>tt;
while(tt--)
{
cin>>n;
if(n<=5)
{
cout<<-1;
}
else
{
cout<<2<<" "<<n-2;
}
cout<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3644kb
input:
3 4 6 7
output:
-1 2 4 2 5
result:
wrong answer y is not a composite number 5