Submission #71057433


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
using namespace std;
int n;
char buf[1<<21],*p1,*p2;
inline int rd()
{
    char c;int f = 1;
    while(!isdigit(c = getchar()))if(c=='-')f = -1;
    int x = c-'0';
    while(isdigit(c = getchar()))x = x*10+(c^48);
    return x*f;
}
int main()
{
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);
    n = rd();
    for(int i = 1;i <= n;i++)
        printf("%d %d\n",(i*2-1)%n+1,i*2%n+1);
    return 0;
}

Submission Info

Submission Time
Task A - AtCoder Jumper
User max0810nb
Language C++ 20 (gcc 12.2)
Score 500
Code Size 627 Byte
Status AC
Exec Time 1 ms
Memory 3772 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 2
AC × 12
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 1 ms 3760 KiB
001.txt AC 1 ms 3700 KiB
002.txt AC 1 ms 3588 KiB
003.txt AC 1 ms 3756 KiB
004.txt AC 1 ms 3592 KiB
005.txt AC 1 ms 3752 KiB
006.txt AC 1 ms 3772 KiB
007.txt AC 1 ms 3624 KiB
008.txt AC 1 ms 3596 KiB
009.txt AC 1 ms 3616 KiB
example0.txt AC 1 ms 3756 KiB
example1.txt AC 1 ms 3596 KiB