这个文件只是为了阻止access_token
成为第一个文件。
View a-backuper-dropbox-python.md
View uva10137.c
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* Programming-challenges 110103 - The Trip . Abreto. */ | |
#include <stdio.h> | |
int main(void) | |
{ | |
int i = 0; | |
int n = 0; | |
while( scanf("%d", &n) != EOF ) | |
{ |
View uva706.c
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* Programming Challenges 110104 - LC-Display */ | |
#include <stdio.h> | |
#include <string.h> | |
const char cdigits[10][5][3] = { | |
{ | |
{' ','-',' '}, | |
{'|',' ','|'}, | |
{' ',' ',' '}, | |
{'|',' ','|'}, |
View astar2012j.c
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
int main(void) | |
{ | |
int n = 0, m = 0; | |
int u = 0, d = 0, t = 0; | |
int l = 0, low = -1; | |
scanf("%d %d", &n, &m); | |
while(m--) | |
{ |
View A.cpp
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
class Line | |
{ | |
public: | |
int xl, xr, y; | |
}; | |
int main(void) |
View A.cpp
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
int main(void) | |
{ | |
int n = 0, i = 0, j = 0; | |
unsigned int *A = NULL; | |
long long max = 0, cmax = 0; | |
cin>>n; |
View p1.c
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* RQNOJ Problem 1. 明明的随机数. */ | |
#include <stdio.h> | |
#include <stdlib.h> | |
int main(void) | |
{ | |
int i = 0, m = 0; | |
int N = 0, *data = NULL; | |
int *arr = NULL, max = 0, count = 0; | |
View p026.c
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* cxsjsx.openjudge.cn/practice1 Problem 026. */ | |
#include <stdio.h> | |
#include <string.h> | |
#include <stdlib.h> | |
typedef struct _set | |
{ | |
int *data; | |
int count; | |
int size; |
View numtostr.c
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* Program E6.1 - print nature language for a number. */ | |
#include <stdio.h> | |
#include <stdlib.h> | |
int main(void) | |
{ | |
char map[][4] = {"零","一","二","三","四","五","六","七","八","九"}; | |
int num = 0; | |
printf("Please enter a three-digit number: "); |
View e6-2.c
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* Program E6-2. */ | |
#include <stdio.h> | |
#include <string.h> | |
#include <ctype.h> | |
int main(void) | |
{ | |
int i = 0; | |
char str[100] = {0}; | |
OlderNewer