2011 JOI yosen Problem 3

gistfile1.cpp

#include<cstdio>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<iostream>
#include<sstream>
using namespace std;
typedef long long ll;

int main(){
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i=0;i<k;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        if(a>(n+1)/2)a-=a*2-(n+1);
        if(b>(n+1)/2)b-=b*2-(n+1);
        int mi=min(a,b)%3;
        if(mi==0)mi=3;
        printf("%d\n",mi);
    }
}