1 条题解

  • 0
    @ 2025-4-12 21:43:14

    C :

    #include<stdio.h>
    #include<string.h>
    int main()
    {
        int n,s,f,m;
        scanf("%d",&n);
        s=n/3600;
        f=(n%3600)/60;
        m=((n%3600)%60);
        printf("%d:%d:%d",s,f,m);
        return 0;
    }
    
    

    C++ :

    #include<iostream>
    using namespace std;
    int main(void)
    {
        unsigned long long n,a,m,s,w;
        cin>>n;
        a=n/3600;
        w=n%3600;
        m=w/60;
        w=w%60;
        s=w;
        cout<<a<<":"<<m<<":"<<s<<'\n';
        return 0;
    }
    
    

    Pascal :

    var
      n,s,f,m,s1,f1,m1:longint;
    begin
      readln(n);
      s:=n div 3600;
      s1:=n mod 3600;
      f:=s1 div 60;
      f1:=s1 mod 60;
      write(s,':',f,':',f1);
    end.
    

    Java :

    import java.util.*;
    public class Main {
    	public static void main(String[] args) {
    		Scanner in = new Scanner(System.in);
    		while (in.hasNext()){
    			int m = in.nextInt();
    			print(m);
    		}
    			
    	}
    	//写一个方法把秒转为时:分:秒输出
    	private static void print(int time){
    		int shi = time/3600 ;
    		int fen = (time - shi * 3600 ) / 60 ;
    		int miao = (time - shi * 3600 - fen * 60 ) ; 
    		System.out.println(shi+":"+fen+":"+miao);
    	}
    }
    
    
    • 1

    信息

    ID
    1303
    时间
    1000ms
    内存
    128MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者