Код, который работал в VS 2008, не работает в VS 2012

#include "stdafx.h"
#include <stdio.h>
#include <string.h>
#include <assert.h>
 
struct Purchase
{
    char name[50];
    int price;
};
 
bool scan(Purchase p[], int i) {
 
  printf("%s", "Article name: ");
  if (scanf_s("%s", (p + i)->name) == EOF)
    return false;
 
  printf("%s", "Article price: ");
  if (scanf_s("%d", &(p + i)->price) == EOF)
    return false;
 
  assert(p[i].price > 0);
 
  return true;
}
 
Purchase * cheap( Purchase* p, int n )
{
    int cheap = p->price;
    int index=0;
 
    for( int i=1; i<n; i++) 
    {
        if( (p+i)->price < cheap )
        {
            cheap=(p+i)->price;
            index=i;
        }
    }
    return (p+index); 
}
 
Purchase * expensive( Purchase* p, int n )
{
    int expensive = p->price;
    int index=0;
 
    for( int i=1; i<n; i++ ) 
    {
        if( (p+i)->price > expensive )
        {
            expensive=(p+i)->price;
            index=i;
        }
    }
    return (p+index); 
}
 
 
 
int  sum( Purchase* p, int n )
{
    int s=0;
 
    for( int i=0; i<n; i++ )
    {
        s=s+(p+i)->price;
    }
 
    return s;
}
 
void sameGoods( Purchase* p, int n)
{
    Purchase ** repeats = new Purchase*[n];
    int rep_count = 0;
 
    for (int i = 0; i < n - 1; i++) 
    {
      for (int j = i + 1; j < n; j++) 
      {
        if (strcmp((p+i)->name, (p+j)->name) == 0)
        {
          bool appear = false;
 
          for (int k = 0; k < rep_count && !appear; k++)
          {
              if (strcmp(repeats[k]->name, (p+i)->name) == 0)
              appear = true;
          }
 
          if (!appear)
            repeats[rep_count++] = p+i;
        }
      }
    }
    
    if( rep_count>0)
    {
    printf("Repetitive purchases are\n");
 
    for (int i = 0; i < rep_count; i++)
        printf ("%s\n", repeats[i]->name);
    }
    else  printf("There is no repetitive items\n");
    delete[] repeats;
}
 
void samePrice( Purchase* p, int n)
{
    Purchase ** repeats = new Purchase*[n];
    int rep_count = 0;
 
    for (int i = 0; i < n ; i++) 
    {
      for (int j =  i+1; j < n; j++) 
      {
        if ((p+i)->price ==(p+j)->price) 
        {
          bool appear = false;
 
 
         if (!appear){
            repeats[rep_count++] = p+i;
            repeats[rep_count++] = p+j;
            }
        }
      }
    }
    if( rep_count>0)
    {
    printf("Goods that have the same price\n");
 
    for (int i = 0; i < rep_count; i++)
        printf ("%s\n", repeats[i]->name);
    }
    else  printf("No goods have the same price\n");
    delete[] repeats;
}
 
int main ( )
{
    int  size=100, count=0, s=0;
    Purchase * cheapProduct = NULL;
    Purchase * expenProduct = NULL;
    Purchase* shopingCart = new Purchase[size];
 
 
    while (scan(shopingCart, count))
            ++count;
 
    cheapProduct = (cheap( shopingCart, count ));
    expenProduct = (expensive( shopingCart, count ));
 
    s = sum( shopingCart, count );
 
    printf( "\nThe cheapest purchase is %s", cheapProduct->name );
    printf( "\nThe most expensive purchase %s", expenProduct->name );
    printf( "\nSum of spending is %d\n", s );
 
    sameGoods( shopingCart, count);
    samePrice( shopingCart, count );
 
    delete[] shopingCart;
 
    return 0;
}