Red Huang

Red Huang

uva 10683

誤差題,別用 Float 去算,用簡化後的 Int 去算就沒事了

//====================================================================||  
//                        名前  : The decadary watch.cpp                             ||  
//                     日付 : 2013/6/5 午前7:48:05                         ||  
//                         著者 : GCA                               ||  
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||  
//====================================================================||  
#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <algorithm>  
#include <cmath>  
#include <climits>  
#include <vector>  
#include <set>  
#include <map>  
#include <queue>  
#include <cctype>  
#include <utility>  
using namespace std;  
#ifdef ONLINE\_JUDGE  
#define ll "%lld"  
#else  
#define ll "%I64d"  
#endif  
typedef unsigned int uint;  
typedef long long int Int;  
#define Set(a,s) memset(a,s,sizeof(a))  
#define Write(w) freopen(w,"w",stdout)  
#define Read(r) freopen(r,"r",stdin)  
#define Pln() printf("\\n")  
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()  
#define De(x)printf(#x"%d\\n",x)  
#define For(i,x)for(int i=0;i<x;i++)  
#define CON(x,y) x##y  
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\  
    printf("%d ",dp\[htx\]\[hty\]);}Pln();}  
#define M 55  
#define PII pair<int,int\>  
#define PB push\_back  
#define oo INT\_MAX  
#define Set\_oo 0x3f  
#define Is\_debug true  
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)  
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)  
#define eps 1e-6  
bool xdy(double x,double y){return x>y+eps;}  
bool xddy(double x,double y){return x>y-eps;}  
bool xcy(double x,double y){return x<y-eps;}  
bool xcdy(double x,double y){return x<y+eps;}  
int min3(int x,int y,int z){  
    int tmp=min(x,y);  
    return min(tmp,z);  
}  
int max3(int x,int y,int z){  
    int tmp=max(x,y);  
    return max(tmp,z);  
}  
int all;  
int num=60\*60\*24\*100;  
int num2=10000000;  
int main() {  
    ios\_base::sync\_with\_stdio(0);  
    char str\[100\];  
    char c\[2\];  
    while(~scanf("%s",str)){  
        all=0;  
        int len=strlen(str);  
        int x;  
        for(int i=0;i<len;i+=2){  
            c\[0\]=str\[i\];  
            c\[1\]=str\[i+1\];  
            sscanf(c,"%d",&x);  
            if(i!=6)  
                all=all\*60+x;  
            else all=all\*100+x;  
        }  
//        debug("%d %d\\n",all,num);  
//        double tmp=(double)all/(double)num;  
//        debug("%f\\n",tmp);  
        int ans;  
        ans=(int)(all\*125/108);  
        printf("%07d\\n",ans);  
    }  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
}  

読み込み中...
文章は、創作者によって署名され、ブロックチェーンに安全に保存されています。