Submission #70011223
Source Code Expand
#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)-1;i>=(a);i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head
int n;
vector<PII> eg;
int main() {
scanf("%d",&n);
if (n<=5) {
puts("-1");
return 0;
}
if (n%2==0) {
rep(i,1,n/2+1) {
rep(j,n/2+1,n+1) {
if (i+j!=n+1) {
eg.pb(mp(i,j));
}
}
}
} else {
rep(i,1,n/2+1) {
rep(j,n/2+1,n+1) {
if (i+j!=n) {
eg.pb(mp(i,j));
}
}
}
}
printf("%d\n",SZ(eg));
for (auto [x,y]:eg) printf("%d %d\n",x,y);
}
Submission Info
Submission Time
2025-10-11 10:54:56+0900
Task
B - Balanced Neighbors 2
User
apiad
Language
C++ 20 (gcc 12.2)
Score
800
Code Size
1132 Byte
Status
AC
Exec Time
2 ms
Memory
3944 KiB
Compile Error
Main.cpp: In function ‘int main()’:
Main.cpp:27:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
27 | scanf("%d",&n);
| ~~~~~^~~~~~~~~
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
800 / 800
Status
Set Name
Test Cases
Sample
sample_01.txt, sample_02.txt
All
case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt, case_16.txt, case_17.txt, case_18.txt, case_19.txt, case_20.txt, case_21.txt, case_22.txt, case_23.txt, case_24.txt, case_25.txt, sample_01.txt, sample_02.txt
Case Name
Status
Exec Time
Memory
case_01.txt
AC
1 ms
3696 KiB
case_02.txt
AC
1 ms
3756 KiB
case_03.txt
AC
1 ms
3752 KiB
case_04.txt
AC
1 ms
3768 KiB
case_05.txt
AC
1 ms
3656 KiB
case_06.txt
AC
1 ms
3888 KiB
case_07.txt
AC
1 ms
3656 KiB
case_08.txt
AC
1 ms
3676 KiB
case_09.txt
AC
1 ms
3660 KiB
case_10.txt
AC
1 ms
3680 KiB
case_11.txt
AC
2 ms
3776 KiB
case_12.txt
AC
2 ms
3780 KiB
case_13.txt
AC
2 ms
3776 KiB
case_14.txt
AC
2 ms
3944 KiB
case_15.txt
AC
2 ms
3940 KiB
case_16.txt
AC
2 ms
3812 KiB
case_17.txt
AC
2 ms
3944 KiB
case_18.txt
AC
2 ms
3936 KiB
case_19.txt
AC
1 ms
3872 KiB
case_20.txt
AC
1 ms
3624 KiB
case_21.txt
AC
1 ms
3828 KiB
case_22.txt
AC
1 ms
3888 KiB
case_23.txt
AC
1 ms
3564 KiB
case_24.txt
AC
1 ms
3688 KiB
case_25.txt
AC
1 ms
3720 KiB
sample_01.txt
AC
1 ms
3684 KiB
sample_02.txt
AC
1 ms
3692 KiB