杨氏矩阵#include <stdio.h>#include <stdlib.h>#define LOW 3#define LINE 3search(char a[][LOW], int num){ int i = 0; int j = 0; for (i = 0; i < LINE; i++) { for (j = 0; j < LOW; j++
#include <stdio.h> #include <stdlib.h> int main() { printf("file:%s\nline:%d\ndate:%s\ntime:%s\n", __FILE__, __LINE__, __DATE__, __TIME__); \
#include <stdio.h>#include <stdlib.h>#include <stdlib.h>my_find(char *s){ int len = 0; len = strlen(s); int i = 0; int j = 0; int count = 0; assert(*str != 0); for (i = 0; i < len
#include <stdio.h>#include <stdlib.h>void replace_blank(char *p){ int len = 0; int newlen = 0； int blank_count = 0; char *pstr = p; while (*pstr) { if (*pstr == ' ')
int main(){ int i=0; int j=0; int k=0; int sum=0; int n=0; for(i=1;i<5;i++) { for(j=1;j<5;j++) { for(k=1;k<5;k++) { if(i!=j&&j!=k&&k
#include <stdio.h> int main() { int m=0,n=0; static int a[10][10]={0,0}; a[0][1]=1; for(m=1;m<10;m++) { for(n=1;n<2*m-(n-1);n++) {
#include <stdio.h>int main(){ int ch=0; int flag=1; int line=1; while(EOF!=(ch=getchar())) { if(flag) { printf("%d",line); flag=0; }
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号
