usaco_zerosum

Zero Sum

Consider the sequence of digits from 1 through N (where N=9) in increasing order: 1 2 3 ... N.

Now insert either a `+' for addition or a `-' for subtraction or a ` ' [blank] to run the digits together between each pair of digits (not in front of the first digit). Calculate the result that of the expression and see if you get zero.

Write a program that will find all sequences of length N that produce a zero sum.

PROGRAM NAME: zerosum

INPUT FORMAT

A single line with the integer N (3 <= N <= 9).

SAMPLE INPUT (file zerosum.in)

7

OUTPUT FORMAT

In ASCII order, show each sequence that can create 0 sum with a `+', `-', or ` ' between each pair of numbers.

SAMPLE OUTPUT (file zerosum.out)

1+2-3+4-5-6+7
1+2-3-4+5+6-7
1-2 3+4+5+6+7
1-2 3-4 5+6 7
1-2+3+4-5+6-7
1-2-3-4-5+6+7
/*  
ID: guangxue1  
PROG: zerosum 
LANG: C++  
*/

#include <fstream>
using namespace std;

int N=7;
char op[8];
char O[]={' ','+','-'};
int sequence[]={1,2,3,4,5,6,7,8,9};
int sequenceC[]={1,2,3,4,5,6,7,8,9};
char opC[8];

ifstream fin("zerosum.in");
ofstream fout("zerosum.out");
void coculate()
{
  int t,temp;
    for(int i=0; i<N; ++i)
       if(op[i]==' ')
         {
          sequence[i+1]=sequence[i]*10+sequence[i+1];
          sequence[i]=0;
          if(i>0) op[i]=op[i-1];
         }
    int ii;
    for(int i=0; i<N+1; ++i)
        if(sequence[i]!=0) {t=sequence[i];ii=i; break;}
    for(int i=ii; i<N; ++i)
       if(op[i]=='+')
      {
           t+=sequence[i+1];
      }
        else
      {     
           t-=sequence[i+1];
      }
     if(t==0)
     {  for(int i=0; i<N; ++i)
           fout<<sequenceC[i]<<opC[i];
           fout<<sequenceC[N]<<endl;}
     for(int i=0; i<9; ++i)
       sequence[i]=i+1;
     for(int i=0; i<8; ++i)
       op[i]=opC[i];
     
}

void solve(int sign)
{
  if(sign==N)  coculate();
  else
  for(int i=0; i<3; ++i)
     { op[sign]=O[i];
       opC[sign]=op[sign];
       solve(sign+1);
     }
  return;
}

int main()
{
  fin>>N;
  N-=1;
  solve(0);
  return 0;
}

 

官方的：

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

FILE *fout;
int n;

/* evaluate the string s as arithmetic and return the sum */
int
eval(char *s)
{
    int term, sign, sum;
    char *p;

    sign = 1;
    term = 0;
    sum = 0;
    for(p=s; *p; p++) {
        switch(*p){
        case '+':
        case '-':
            sum += sign*term;
            term = 0;
            sign = *p == '+' ? 1 : -1;
            break;
        case ' ':
            break;
        default:    /* digit */
            term = term*10 + *p-'0';
        }
    }
    sum += sign*term;
    return sum;
}

/* 
 * Insert + - or space after each number, and then  
 * test to see if we get zero.  The first k numbers have
 * already been taken care of.
 */
void
search(char *s, int k)
{
    char *p;

    if(k == n-1) {
        if(eval(s) == 0)
            fprintf(fout, "%s/n", s);
        return;
    }

    for(p=" +-"; *p; p++) {
        s[2*k+1] = *p;
        search(s, k+1);
    }
}


void
main(void)
{
    FILE *fin;
    int i;
    char str[30];

    fin = fopen("zerosum.in", "r");
    fout = fopen("zerosum.out", "w");
    assert(fin != NULL && fout != NULL);

    fscanf(fin, "%d", &n);

    strcpy(str, "1 2 3 4 5 6 7 8 9");
    str[2*n-1] = '/0';    /* chop string to only have first n numbers */

    search(str, 0);

    exit(0);
}