只对了#1

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b)
{
	if(a<b)
	{
		swap(a,b);
	}
	if(a%b==0)
	{
		return b;
	}
	return gcd(b,a%b);
}
int main()
{
	string n;
	cin>>n;
	ll m=0;
	for(int i=2;i<n.size();i++)
	{
		m*=10;
		m+=n[i]-'0';
	}
	if(m==0)
	{
		for(int i=1;i<=5;i++)
		{
			if(i==n[0]-'0')
			{
				cout<<"1 ";
			}
			else
			{
				cout<<"0 ";
			}
		}
		return 0;
	}
	ll p=pow(10,int(log10(m)+1))-m;
	ll q=gcd(p,m);
	p/=q;
	m/=q;
	for(int i=1;i<=5;i++)
	{
		if(i==n[0]-'0')
		{
			cout<<p<<" ";
		}
		else if(i==n[0]-'0'+1)
		{
			cout<<m<<" ";
		}
		else
		{
			cout<<"0 ";
		}
	}
	return 0;
}