henrybear327

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int compare(const void *a, const void *b)
{
    return *(int *)a - *(int *)b; /*positive, don't swap*/
}

int main()

henrybear327

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int main()
{
    long long int a, b;
    while(scanf("%lld %lld", &a, &b) != EOF)
        printf("%lld\n", (a - b) > 0 ? a - b : b - a);   
       

henrybear327

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

/*
carry = add1%10 + add2%10 + carry;
      carry /= 10;
      add1 /= 10;
      add2 /= 10;
      if( carry )

henrybear327

#include <stdio.h>
#include <stdlib.h>
#include <string.h>


int main()
{
    int size;
    scanf("%d", &size);
    size++; //making the data stored and used in 1 ~ size format

henrybear327

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define SIZE 18

int power(int A,int p);

int main()
{
    int cases;

henrybear327

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int n;
    while(scanf("%d",&n)!=EOF) {
        long long int x,y,N,c;
        while(n--) {
            scanf("%lld %lld %lld",&x,&y,&N);

henrybear327

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

void quicksort(int, int, int []);

int main()
{
    int n;
    while(scanf("%d", &n) != EOF && n) {

henrybear327

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define RIGHT 1
#define LEFT -1

int main()
{
    int total_cells, total_instructions;

henrybear327

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

const int two_power[16] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768};

int main()
{
    int test_cases;
    while(scanf("%d", &test_cases) != EOF && test_cases) {

henrybear327

Hello Stonie!!

This is version 2. You can see the difference in revision.