행복한 프로그래밍 (37) 썸네일형 리스트형 java 피보나치 public class Fibonacci { public static void main(String[] args) { int inputNumber = Interger.parseInt(args[0]); StringBuffer stringBuffer = new StringBuffer(); for(int i = 1; i <= inputNumber; i++) { stringBuffer.delete(0, stringBuffer.length()); stringBuffer.append("F("); stringBuffer.append(i); stringBuffer.append(") = "); stringBuffer.append(fibonacci(i)); System.out.pri.. I don't know but I am happy #define MAXLINE 1000 int getline(char *line, int max); /*find:print lines that match pattern from 1st arg*/ main(int argc, char *argv[]) { char line[MAXLINE]; long lineno = 0; int c, except = 0, number = 0, found = 0; while (--argc > 0 && (*++argv) [0] == '-') while (c = *++argc[0]) switch (c) { case 'x': except = 1; break; case 'n': number = 1; break; default: printf("find.. 왜 실행이 안 될까?? #include <stdio.h> #define MAXLINE 1000 /*maximum input line length */ int getline(char line[], int max); int strindex(char source[], char searchfor[]); char pattern[] = "ould"; /*pattern to search for */ /*find all line matching pattern */ main() { char line[MAXLINE]; int found = 0; while (getline(line, MAXLINE)>0) if (strindex(line, pattern) >= 0){ printf("%s", l.. new start #include <stdio.h> main(){ int n=200; int p=300000; int r=n+p; int k=300; int q=250; int o=k+q; return r+o; } 피보나치 수열 int Fibonacci (int n=100;) { if(n<=2) { return 1; } else { return Fibonacci(n-1)+Fibonacci(n-2); } } 이전 1 2 3 4 5 다음