DEVLION

package kr.priv.logManagement; import android.app.Activity; import android.content.Intent; import android.os.Bundle; import android.view.Menu; import android.view.MenuItem; public class AT_main extends Activity { @Override public void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); setContentView(R.layout.layout_main); } @Override public boolean onCreateOptionsMenu(Menu..

private void getPreferences() { SharedPreferences pref = getSharedPreferences("pref", MODE_PRIVATE); String a = pref.getString("key1", ""); Toast.makeText(this, a, 0).show(); } // 값 저장하기 private void savePreferences() { SharedPreferences pref = getSharedPreferences("pref", MODE_PRIVATE); SharedPreferences.Editor editor = pref.edit(); editor.putString("key1", "data"); editor.commit(); } // 값(Key ..

do{ coutinPutNum; itoa(inPutNum,charNum,10); if(MY_IsNumber(charNum)) continue; // num이 숫자이면 1을 리턴 }while(inPutNum en);

#include using namespace std; int MY_IsNumber(char* str){ int dotCnt = 0; for(;*str;str++){ if(*str =='.'){ if(dotCnt++) return 0; str++; } if(*str '9') return 0; } return 1; } int main(){ char c[100]; cin>>c; cout

void deleteNode(NODE* hd, int delCnt){ int i; NODE* delPt; for(i=1;inext; } delPt = hd->next; hd->next = hd->next->next; free(delPt); } ////////////////////////////////////////////////////////////////////////// void deleteNode(NODE* hd, int delCnt){ int i; NODE* delPt; for(i=1;inext; } hd->next = hd->next->next; free(hd->next); } //////////////////////////////////////////////////////////////////..

#include #include void main(){ clock_t time; time=clock(); // Time Check Start int a = 0,b =0,c=0,d=0,i = 0; /* 시간을 측정할 함수나 실행문 */ time=clock()-time; // Time Check End printf("%f초입니다.",(double)time/CLOCKS_PER_SEC); }

// strcpy(copy본 첫주소, 원본 첫주소). // memset(buf, 0, sizeof(buf)), memset(배열이름, 초기화할 문자, sizeof(배열이름)) #include #include void main(void){ void* a; int i=0,cnt = 0; char charList[100], copyLsit[100]; scanf("%s",charList); strcpy(copyLsit, charList); printf("\n\n\np: %s",copyLsit); memset(copyLsit, NULL, sizeof(copyLsit)); printf("\n\n\np: %s",copyLsit); }

#include #include #include #define QUESIZ 90000 // QUESIZ typedef struct _NODE{ int key; struct _NODE *left; struct _NODE *right; } NODE; //주요기능 NODE* makeRendTree(NODE*,int,int*); //입력받은 수만큼의 노드를 가진 랜덤 트리를 만들어준다. NODE* findNode(NODE*,int); //값은 key값을 찾아 주소를 return NODE* findPrntNode(NODE*,int); //찾는 노드의 부모노드의 주소를 return NODE* selectChild(NODE*,int); //부모주소의 주소를 입력받아 자식 노드주소 return NODE* insertN..