题目描述:给出数字n,m代表n行m列的格子,n保证是奇数。按如图方式行走,每步走一格,求最后到达的位置。
题目链接:http://codeforces.com/contest/976/problem/B
题目思路:首先处理步数小于n和n+m-1的部分,对剩余的部分可总结出公式,或者可以用模拟法
c++代码(数学):
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int n,m;
long long k;
cin >> n >> m>>k;
if(k<=n-1)cout << k+1 <<" " <<1 << endl;
else if(k<=n+m-2) {
cout << n <<" ";
if(k%(n+m-2)==0)cout << m;
else cout << k-(n-1)+1;
}
else {
k-=n+m-2;
int x=n-k/(m-1)-(k%(m-1)?1:0);
int y;
if((k/(m-1)+(k%(m-1)?1:0))%2) {
y=(k%(m-1)==0?(m-1):(k%(m-1)))-1;
//cout << y << endl;
y=m-y;
}
else {
y=(k%(m-1)==0?(m-1):(k%(m-1)))+1;
}
//cout <<(k/(m-1)+(k%(m-1)?1:0)) << endl;
cout << x <<" " <<y << endl;
}
return 0;
}
c++代码(模拟):
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int n,m;
long long k;
cin >> n >> m>>k;
if(k<=n-1)cout << k+1 <<" " <<1 << endl;
else if(k<=n+m-2) {
cout << n <<" ";
if(k%(n+m-2)==0)cout << m;
else cout << k-(n-1)+1;
}
else {
k-=n+m-2;
int cnt=0;
while(k>m-1) {
k-=m-1;
cnt++;
}
cout << n-cnt-1<<" ";
//cout <<"k" <<k <<endl;
if(cnt%2==0) cout << m-k+1 << endl;
else cout<<k+1 <<endl;;
}
return 0;
}