2 seconds
256 megabytes
standard input
standard output
In a far away kingdom lived the King, the Prince, the Shoemaker, the Dressmaker and many other citizens. They lived happily until great trouble came into the Kingdom. The ACMers settled there.
Most damage those strange creatures inflicted upon the kingdom was that they loved high precision numbers. As a result, the Kingdom healers had already had three appointments with the merchants who were asked to sell, say, exactly 0.273549107 beer
barrels. To deal with the problem somehow, the King issued an order obliging rounding up all numbers to the closest integer to simplify calculations. Specifically, the order went like this:
then the rounded up number coincides with the number’s integer part.
the rounded up number is obtained if we add 1 to the last digit of the number’s integer part.
the tricky operation of carrying into the next position.
Merchants found the algorithm very sophisticated and they asked you (the ACMers) to help them. Can you write a program that would perform the rounding according to the King’s order?
The first line contains a single number to round up — the integer part (a non-empty set of decimal digits that do not start with 0 — with the exception of a case
when the set consists of a single digit — in this case 0 can go first), then follows character «.» (a dot), and then follows the fractional part (any non-empty
set of decimal digits). The number's length does not exceed 1000 characters, including the dot. There are no other characters in the input data.
If the last number of the integer part is not equal to 9, print the rounded-up number without leading zeroes. Otherwise, print the message "GOTO
Vasilisa." (without the quotes).
0.0
0
1.49
1
1.50
2
2.71828182845904523536
3
3.14159265358979323846
3
12345678901234567890.1
12345678901234567890
123456789123456789.999
GOTO Vasilisa.
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<map>
#include<string>
#include<cstring>
#include<iomanip>
#include<set>
const int MAX=1100;
char s[MAX];
int k[MAX];
using namespace std;
int main()
{
int n,m,i,j,a,b;
while(gets(s))
{
n=strlen(s);
memset(k,'\0',sizeof(k));
for(i=0,j=0;i<n;i++)
{
if(s[i]=='.')
break;
k[j++]=s[i]-'0';
}
if(k[j-1]!=9)
{
if(s[i+1]>='5')
{
k[j-1]+=1;
}
for(i=0;i<j;i++)
cout<<k[i];
cout<<endl;
}
else
cout<<"GOTO Vasilisa."<<endl;
}
return 0;
}