Abreto

#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--)
	{

Abreto

#include <iostream>
using namespace std;

class Line
{
public:
	int xl, xr, y;
};

int main(void)

Abreto

#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;

Abreto

/* 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;
	

Abreto

/* cxsjsx.openjudge.cn/practice1 Problem 026. */
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

typedef struct _set
{
	int *data;
	int count;
	int size;

Abreto

/* 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: ");

Abreto

/* Program E6-2. */
#include <stdio.h>
#include <string.h>
#include <ctype.h>

int main(void)
{
	int i = 0;
	char str[100] = {0};
	

Abreto

/* Program E6-4 */
#include <stdio.h>
#include <string.h>

int main(void)
{
	int i = 0, l = 0, r = 0;
	char str[100];
	
	gets(str);

Abreto

/**
 *  单链表之实现
 * 
 * 星枵<m@abreto.net
 * 20121005
 **/

/** 双链表结点结构 */
typedef struct _listnode
{

Abreto

/* E1.2.4 - 售货员. Ural State University Problem Archive 1012 Conductor. */
#include <stdio.h>

int main(void)
{
	int i = 0;
	double P = 0, Q = 0;
	
	scanf("%lf %lf", &P, &Q);