A. Strange Table

A. Strange Table

题目：

Polycarp found a rectangular table consisting of n rows and m columns. He noticed that each cell of the table has its number, obtained by the following algorithm “by columns”:
cells are numbered starting from one;
cells are numbered from left to right by columns, and inside each column from top to bottom;
number of each cell is an integer one greater than in the previous cell.
For example, if n=3 and m=5, the table will be numbered as follows:
123456789101112131415
However, Polycarp considers such numbering inconvenient. He likes the numbering “by rows”:
cells are numbered starting from one;
cells are numbered from top to bottom by rows, and inside each row from left to right;
number of each cell is an integer one greater than the number of the previous cell.
For example, if n=3 and m=5, then Polycarp likes the following table numbering:
161127123813491451015
Polycarp doesn’t have much time, so he asks you to find out what would be the cell number in the numbering “by rows”, if in the numbering “by columns” the cell has the number x?
Input
The first line contains a single integer t (1≤t≤104). Then t test cases follow.
Each test case consists of a single line containing three integers n, m, x (1≤n,m≤106, 1≤x≤n⋅m), where n and m are the number of rows and columns in the table, and x is the cell number.
Note that the numbers in some test cases do not fit into the 32-bit integer type, so you must use at least the 64-bit integer type of your programming language.
Output
For each test case, output the cell number in the numbering “by rows”.

输入

5
1 1 1
2 2 3
3 5 11
100 100 7312
1000000 1000000 1000000000000

输出

1
2
9
1174
1000000000000

代码：
上网比较其他大佬的代码之后，觉得还是我的代码香

#include<stdio.h>
int main()
{
    long long int a,b,c,d,x=1,i,j,s[1010];
    scanf("%lld",&a);
    while(a--)
    {
        scanf("%lld%lld%lld",&b,&c,&d);
        i=d/b+1;
        j=d%b;
        if(j==0)
            i--,j=b;
        //printf("%lld %lld \n",j,i);
        printf("%lld\n",(j-1)*c+i);
    }
}