#include<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
using namespace std;
vector<int>s[2160001];
int main()
{
int t;
for(int i=0;i<=11;i++)
for(int j=0;j<=59;j++)
for(int z=0;z<=50;z+=10)
{
int temp=abs(66000*j+1100*z-360000*i);
if(temp>2160000)temp=4320000-temp;
s[temp].push_back(i);
s[temp].push_back(j);
s[temp].push_back(z);
}
while(scanf("%d",&t)!=EOF)
{
for(int i=0;i<s[t].size();)
{
if(s[t][i]<10)cout<<0;
cout<<s[t][i]<<":";
if(s[t][i+1]<10)cout<<0;
cout<<s[t][i+1]<<":";
if(s[t][i+2]<10)cout<<0;
cout<<s[t][i+2]<<endl;
i+=3;
}
}
return 0;
}

  

hdu_5276的更多相关文章

随机推荐

  1. canvas——画板

    注意部分: canvas的height和width不能再css中设定,应该在html中设定,否则会影响页面的分辨率. 效果图: 图1: 代码 css: #canvas{ cursor: crossha ...

  2. codeforce ---A. Milking cows

    A. Milking cows time limit per test 1 second memory limit per test 256 megabytes input standard inpu ...

  3. netcat运行出错

    今天项目上利用运行netca创建监听时报错,(运行netmgr可以弹出窗口,未测试是否可以建立监听) 报错信息: [oracle@BSS-WG2 ~]$netca Oracle Net Service ...

  4. lightoj 1243 - Guardian Knights 最小费用流

    #include <cstdio> #include <cstring> #include <iostream> #include <cmath> #i ...

  5. lightoj 1031 区间dp

    题目链接: http://lightoj.com/volume_showproblem.php?problem=1031 #include<cstdio> #include<cstr ...

  6. 402. Remove K Digits

    (English version is after the code part) 这个题做起来比看起来容易,然后我也没仔细想,先速度刷完,以后再看有没有改进. 用这个来说: 1 2 4 3 2 2 1 ...

  7. php类获取静态变量值以及调用

    <?php class Test{ public static $static_var = 20; } echo Test::$static_var;exit;

  8. [React] React Fundamentals: Integrating Components with D3 and AngularJS

    Since React is only interested in the V (view) of MVC, it plays well with other toolkits and framewo ...

  9. android 29 ArrarAdapter数组适配器

    package com.sxt.day05_03; import android.os.Bundle; import android.app.Activity; import android.view ...

  10. heap堆内存不足

    配置jvm内存,加个启动参数 -Xms512m -Xmx512m -XX:PermSize=128m  -XX:MaxPermSize=256m   start 下面是这个: -Dcatalina.h ...