時間族函數測試

代碼

#define _CRT_SECURE_NO_WARNINGS#include <stdio.h> #include <stdlib.h> #include <time.h>void main() {time_t tt;//long __int64time(&tt);tm* time = localtime(&tt);char* ws[] = { "日","一","二","三","四","五","六" };printf("%d年%02d月%02d日（星期%s） %02d:%02d:%02d\n",time->tm_year + 1900, time->tm_mon + 1, time->tm_mday, ws[time->tm_wday],time->tm_hour, time->tm_min, time->tm_sec);tm time1 = { 35,11,9,31,3 - 1,2011 - 1900 }; //將日期合成一個數字tt = mktime(&time1);time = localtime(&tt);printf("%d年%02d月%02d日（星期%s） %02d:%02d:%02d\n",time->tm_year + 1900, time->tm_mon + 1, time->tm_mday, ws[time->tm_wday],time->tm_hour, time->tm_min, time->tm_sec);printf("%ld\n", tt); }

運行結果

目錄遍歷

代碼

#include <stdio.h> #include <stdlib.h> #include <io.h> #include <time.h>/* struct _finddata64i32_t {unsigned attrib;__time64_t time_create; // -1 for FAT file systems__time64_t time_access; // -1 for FAT file systems__time64_t time_write;_fsize_t size;char name[260]; }; */int main(void) {struct _finddata_t c_file;intptr_t hFile;// Find first .c file in current directory if ((hFile = _findfirst("C:\\*.*", &c_file)) == -1L)printf("No files in current directory!\n");else{printf("Listing of .c files\n\n");printf("RDO HID SYS ARC FILE DATE %25c SIZE\n", ' ');printf("--- --- --- --- ---- ---- %25c ----\n", ' ');do {char buffer[30];printf((c_file.attrib & _A_RDONLY) ? " Y " : " N ");printf((c_file.attrib & _A_HIDDEN) ? " Y " : " N ");printf((c_file.attrib & _A_SYSTEM) ? " Y " : " N ");printf((c_file.attrib & _A_ARCH) ? " Y " : " N ");ctime_s(buffer, _countof(buffer), &c_file.time_write);printf(" %-30s %.24s %9ld\n",c_file.name, buffer, c_file.size);} while (_findnext(hFile, &c_file) == 0);_findclose(hFile);} }

運行結果

總結

以上是生活随笔為你收集整理的C语言实用算法系列之时间族函数、目录遍历的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。