QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#572626#9354. Justifying the ConjectureN_z_AC ✓5ms3832kbC++144.7kb2024-09-18 15:40:042024-09-18 15:40:09

Judging History

你现在查看的是最新测评结果

  • [2024-09-18 15:40:09]
  • 评测
  • 测评结果:AC
  • 用时:5ms
  • 内存:3832kb
  • [2024-09-18 15:40:04]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
struct time_helper
{
#ifdef LOCAL
	clock_t time_last;
#endif
	time_helper()
	{
#ifdef LOCAL
		time_last=clock();
#endif
	}
	void test()
	{
#ifdef LOCAL
		auto time_now=clock();
		std::cerr<<"time:"<<1.*(time_now-time_last)/CLOCKS_PER_SEC<<";all_time:"<<1.*time_now/CLOCKS_PER_SEC<<std::endl;
		time_last=time_now;
#endif
	}
	~time_helper()
	{
		test();
	}
}time_helper;
#ifdef LOCAL
#include"dbg.h"
#else
#define dbg(...) (__VA_ARGS__)
#endif
namespace Fread{const int SIZE=1<<16;char buf[SIZE],*S,*T;inline char getchar(){if(S==T){T=(S=buf)+fread(buf,1,SIZE,stdin);if(S==T)return'\n';}return *S++;}}namespace Fwrite{const int SIZE=1<<16;char buf[SIZE],*S=buf,*T=buf+SIZE;inline void flush(){fwrite(buf,1,S-buf,stdout);S=buf;}inline void putchar(char c){*S++=c;if(S==T)flush();}struct NTR{~NTR(){flush();}}ztr;}
#define getchar Fread::getchar
#define putchar Fwrite::putchar
#define Setprecision 10
#define between '\n'
template<typename T>struct is_char{static constexpr bool value=(std::is_same<T,char>::value||std::is_same<T,signed char>::value||std::is_same<T,unsigned char>::value);};template<typename T>struct is_integral_ex{static constexpr bool value=(std::is_integral<T>::value||std::is_same<T,__int128>::value)&&!is_char<T>::value;};template<typename T>struct is_floating_point_ex{static constexpr bool value=std::is_floating_point<T>::value||std::is_same<T,__float128>::value;};namespace Fastio{struct Reader{template<typename T>typename std::enable_if_t<std::is_class<T>::value,Reader&>operator>>(T&x){for(auto &y:x)*this>>y;return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1;while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}x=0;while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+(c^48);c=getchar();}x*=f;return *this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1,s=0;x=0;T t=0;while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else return x*=f,*this;while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Reader&>operator>>(T&c){c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();return *this;}Reader&operator>>(char*str){int len=0;char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str[len++]=c,c=getchar();str[len]='\0';return*this;}Reader&operator>>(std::string&str){str.clear();char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str.push_back(c),c=getchar();return*this;}Reader(){}}cin;const char endl='\n';struct Writer{typedef __int128 mxdouble;template<typename T>typename std::enable_if_t<std::is_class<T>::value,Writer&>operator<<(T x){for(auto &y:x)*this<<y<<between;*this<<'\n';return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Writer&>operator<<(T x){if(x==0)return putchar('0'),*this;if(x<0)putchar('-'),x=-x;static int sta[45];int top=0;while(x)sta[++top]=x%10,x/=10;while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Writer&>operator<<(T x){if(x<0)putchar('-'),x=-x;x+=pow(10,-Setprecision)/2;mxdouble _=x;x-=(T)_;static int sta[45];int top=0;while(_)sta[++top]=_%10,_/=10;if(!top)putchar('0');while(top)putchar(sta[top]+'0'),--top;putchar('.');for(int i=0;i<Setprecision;i++)x*=10;_=x;while(_)sta[++top]=_%10,_/=10;for(int i=0;i<Setprecision-top;i++)putchar('0');while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Writer&>operator<<(T c){putchar(c);return*this;}Writer&operator<<(char*str){int cur=0;while(str[cur])putchar(str[cur++]);return *this;}Writer&operator<<(const char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}Writer&operator<<(std::string str){int st=0,ed=str.size();while(st<ed)putchar(str[st++]);return*this;}Writer(){}}cout;}
#define cin Fastio::cin
#define cout Fastio::cout
#define endl Fastio::endl
template<class Fun>class y_combinator_result{Fun fun_;public:template<class T>explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}template<class ...Args>decltype(auto) operator()(Args &&...args){return fun_(std::ref(*this), std::forward<Args>(args)...);}};template<class Fun>decltype(auto) y_combinator(Fun &&fun){return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));}

void solve();
main()
{
	int t=1;
	cin>>t;
	while(t--)solve();
}
void solve()
{
	int n;
	cin>>n;
	if(n<=5)cout<<-1<<endl;
	else if(n%2)cout<<3<<' '<<n-3<<endl;
	else cout<<2<<' '<<n-2<<endl;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3648kb

input:

3
4
6
7

output:

-1
2 4
3 4

result:

ok ok

Test #2:

score: 0
Accepted
time: 5ms
memory: 3832kb

input:

100000
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
8...

output:

-1
-1
-1
-1
-1
2 4
3 4
2 6
3 6
2 8
3 8
2 10
3 10
2 12
3 12
2 14
3 14
2 16
3 16
2 18
3 18
2 20
3 20
2 22
3 22
2 24
3 24
2 26
3 26
2 28
3 28
2 30
3 30
2 32
3 32
2 34
3 34
2 36
3 36
2 38
3 38
2 40
3 40
2 42
3 42
2 44
3 44
2 46
3 46
2 48
3 48
2 50
3 50
2 52
3 52
2 54
3 54
2 56
3 56
2 58
3 58
2 60
3 60
2...

result:

ok ok

Test #3:

score: 0
Accepted
time: 2ms
memory: 3752kb

input:

100000
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
4...

output:

-1
-1
-1
-1
-1
2 4
3 4
2 6
3 6
2 8
3 8
2 10
3 10
2 12
3 12
2 14
3 14
2 16
3 16
2 18
3 18
2 20
3 20
2 22
3 22
2 24
3 24
2 26
3 26
2 28
3 28
2 30
3 30
2 32
3 32
2 34
3 34
2 36
3 36
2 38
3 38
2 40
3 40
2 42
3 42
2 44
3 44
2 46
3 46
2 48
3 48
2 50
3 50
2 52
3 52
2 54
3 54
2 56
3 56
2 58
3 58
2 60
3 60
2...

result:

ok ok

Test #4:

score: 0
Accepted
time: 4ms
memory: 3736kb

input:

100000
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
6...

output:

-1
-1
-1
-1
-1
2 4
3 4
2 6
3 6
2 8
3 8
2 10
3 10
2 12
3 12
2 14
3 14
2 16
3 16
2 18
3 18
2 20
3 20
2 22
3 22
2 24
3 24
2 26
3 26
2 28
3 28
2 30
3 30
2 32
3 32
2 34
3 34
2 36
3 36
2 38
3 38
2 40
3 40
2 42
3 42
2 44
3 44
2 46
3 46
2 48
3 48
2 50
3 50
2 52
3 52
2 54
3 54
2 56
3 56
2 58
3 58
2 60
3 60
2...

result:

ok ok

Test #5:

score: 0
Accepted
time: 0ms
memory: 3708kb

input:

100000
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
1...

output:

-1
-1
-1
-1
-1
2 4
3 4
2 6
3 6
2 8
3 8
2 10
3 10
2 12
3 12
2 14
3 14
2 16
3 16
2 18
3 18
2 20
3 20
2 22
3 22
2 24
3 24
2 26
3 26
2 28
3 28
2 30
3 30
2 32
3 32
2 34
3 34
2 36
3 36
2 38
3 38
2 40
3 40
2 42
3 42
2 44
3 44
2 46
3 46
2 48
3 48
2 50
3 50
2 52
3 52
2 54
3 54
2 56
3 56
2 58
3 58
2 60
3 60
2...

result:

ok ok

Test #6:

score: 0
Accepted
time: 0ms
memory: 3704kb

input:

40
1
2
3
4
5
6
7
8
9
10
70001
6455
86825
26169
72400
42488
40355
53919
16396
54363
90208
32113
58385
69368
40752
88337
37427
45794
30882
68127
24500
17571
259
6475
19479
87423
4169
99595
19687
29672

output:

-1
-1
-1
-1
-1
2 4
3 4
2 6
3 6
2 8
3 69998
3 6452
3 86822
3 26166
2 72398
2 42486
3 40352
3 53916
2 16394
3 54360
2 90206
3 32110
3 58382
2 69366
2 40750
3 88334
3 37424
2 45792
2 30880
3 68124
2 24498
3 17568
3 256
3 6472
3 19476
3 87420
3 4166
3 99592
3 19684
2 29670

result:

ok ok

Extra Test:

score: 0
Extra Test Passed