Limbaje formale, asamblare si tehnici de compilare 1 Programe C Language

#include "string.h"
#include #include "stdio.h"
#include "conio.h"
#include "ctype.h"
#include "STDLIB.H"
#include "values.h"

void majuscule()
{ clrscr();
  char sir[30];
  int i,nr=0;
  gets(sir);
  cout<<"\n Sirul e:";
  puts(sir);

  for (i=0; i < strlen(sir); i++) // prelucrare sir
    if (isupper(sir[i])!=0)
      {
      cout<<"\n Caracterul: "<      nr++;
      }
  cout< <"\n Numarul de Majuscule este: "< < nr;
  getch();
}

int sumacifre()
{
  clrscr();
  char sir[30],y[10];
  int i,s=0,x;
  gets(sir);
  cout<<"\n Sirul e:";
  puts(sir);
  for (i=0;i  < strlen(sir);i++)
    if (isdigit(sir[i])!=0)
      {
      s+=sir[i]-48;
      }
return s;
}

void sumanr()
{
  FILE *f=fopen("lfatc.txt","r");
  char s[100];
  int i,suma=0,t=0;
  fgets(s,100,f);
  fclose(f);
  for(i=0;i < strlen(s);i++)
    { t=0;
      while(isdigit(s[i]))
    {
      t=t*10+s[i]-48;
      i++;
    }
      suma=suma+t;
      }
      cout< < "Suma" < < suma;
}

void delspace()
{
  FILE *f=fopen("lfatc.txt","r");
  char s[100];
  int i;
  fgets(s,100,f);
  fclose(f);
  for(i=0;i <  strlen(s);i++)
    {
    if(isspace(s[i]))
      i++;
    printf("%c",s[i]);
    }
}

void maxlength()
{ int max=-MAXINT;
  FILE *f=fopen("lfatc.txt","r");
  char s[100],v[100][20],*pch;
  int p,i=0,j,k;
  while(!feof(f))
  {
    fgets(s,50,f);
      printf("Sirul este: ");
  puts(s);
    pch=strtok(s," :;,.\n");
  while(pch!=NULL)
    {
    strcpy(v[i],pch);
    i++;
    pch=strtok(NULL," :;,.\n");
    }
  }
  strset(v[i],'\0');
  printf("Cuvintele sunt: \n");
  for(j=0;j    puts(v[j]);
  for(j=0;j    {
    p=strlen(v[j]);
    if(p>max)
      {
      max=p;
      k=j;
      }
    }
  printf("The longest word in this file is: %s ",v[k]);
}

void operatii()
{
  FILE *f1=fopen("lfatc1.txt","r");
  FILE *f2=fopen("lfatc2.txt","r");
  char s1[100],s2[100],r[200];
  int i,j;
  fgets(s1,100,f1);
  fgets(s2,100,f2);
  fclose(f1);
  fclose(f2);
  for(i=0;i < strlen(s1);i++)
    for(j=0;j < strlen(s2);j++)
      if(s1[i]!=s2[j]) ;
    //r[i]==

  }

void main()
{ clrscr();
//  sumanr();
//  delspace();
//  maxlength();
  maxlength();
  getch();
}