#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
long long modex(long long a, long long b, long long n)//a的b次方%n
{
int ans = 1;
while (b--)
{
ans = a*ans%n;
}
return ans;
}
int main()
{
int dis;
while (cin >> dis&&dis != 0)
{
int point[100] = { 0 };
int oil[100] = { 0 };
point[1] = 500;//最后一个储油点到终点的距离
oil[1] = 500;//最后一个点的储油量
int k = 1;
for (int i = 2; point[i - 1] < dis; i++)
{
oil[i] = i * 500;
point[i] = point[i - 1] + 500 / (2 * i - 1);
k++;
}
int j = 1;
for (int i = k-1; i >= 1; i--,j++)
{
cout << j << " " << dis-point[i] << " " << oil[i] << endl;
}
}
return 0;
}
swustoj沙漠储油点
最新推荐文章于 2024-01-14 18:46:00 发布