zoukankan      html  css  js  c++  java
  • CodeForces

    You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me lift the veil of secrecy.

    Lara is going to explore yet another dangerous dungeon. Game designers decided to use good old 2D environment. The dungeon can be represented as a rectangle matrix of n rows and m columns. Cell (x, y) is the cell in the x-th row in the y-th column. Lara can move between the neighbouring by side cells in all four directions.

    Moreover, she has even chosen the path for herself to avoid all the traps. She enters the dungeon in cell (1, 1), that is top left corner of the matrix. Then she goes down all the way to cell (n, 1) — the bottom left corner. Then she starts moving in the snake fashion — all the way to the right, one cell up, then to the left to the cell in 2-nd column, one cell up. She moves until she runs out of non-visited cells. n and m given are such that she always end up in cell (1, 2).

    Lara has already moved to a neighbouring cell k times. Can you determine her current position?

    Input

    The only line contains three integers nm and k (2 ≤ n, m ≤ 109n is always even, 0 ≤ k < n·m). Note that k doesn't fit into 32-bit integer type!

    Output

    Print the cell (the row and the column where the cell is situated) where Lara ends up after she moves k times.

    Examples

    Input
    4 3 0
    Output
    1 1
    Input
    4 3 11
    Output
    1 2
    Input
    4 3 7
    Output
    3 2

    Note

    Here is her path on matrix 4 by 3:

    #include<stdio.h>
    #include<string.h>
    #include<iostream>
    #include<cstring>
    #include<cmath>
    using namespace std;
    #define LL long long int
    const int N = 1e5 + 7;
    const int MOD = 1e9+7;
    int main()
    {
           long long n, m, k, mod, h, l;
        scanf("%lld%lld%lld", &n, &m, &k);
        if (k < n) printf("%lld 1
    ", k + 1);
        else {
            k -= n - 1, mod = m - 1, h = k / mod + (k % mod > 0), l = (k % mod ? k % mod : mod);
            l = ((h & 1) ? l + 1 : mod - l + 2);
            printf("%lld %lld
    ", n - h + 1, l);
        LL n,m,k;
        return 0;
    }
    }
  • 相关阅读:
    pip2 pip3
    linux 下加载移动硬盘
    linux 下使用 Synergy
    openSUSE 下安装 OpenCV
    PCA and ZAC Whitening
    openSUSE 安装 Torch
    [转] Python xrange与range的区别
    Linux下安装 mxnet
    Caffe hdf5 layer data 大于2G 的导入
    [CVPR2017] Visual Translation Embedding Network for Visual Relation Detection 论文笔记
  • 原文地址:https://www.cnblogs.com/upstart/p/8982258.html
Copyright © 2011-2022 走看看