Cod sursa(job #1133048)

Utilizator Sirius2001Happy Birthday Sirius2001 Data 4 martie 2014 12:45:36
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.09 kb
// Ciurel Anca randul 1
#include <iostream>
using namespace std;

void citire(int t[100], int &nt)
  {
      int i;
      cout<<"nt=";cin>>nt;
      for(i=0;i<nt;i++)
         cout<<"t["<<i<<"]=";
         cin>>t[i];
  }
void scriere(int t[100], int nt)
{
    int i;
     for(i=0;i<nt;i++)
         cout<<t[i]<<' ';
         cout<<'\n';
}
void sortare(int t[100], int nt)
{
  int i,q,a[i],b,r,aux,poz=0,max,n;
  for(i=0;i<nt;i++)
       {if(a[i+1]-a[i]==q)
           cout<<"formeaza o progresie aritmetica";
        else
           cout<<"nu formeaza o progresie aritmetica";
       }
  if(a==0)
       cout<<"nu e numar prim";
  else
   {
    a=b;
    b=aux;
    r=a%b;
   }
    if(r==0)
      cout<<"numarul este prim";
  for(i=0;i<n;i++)
     if(a[i]>max)
        {
          max=a[i+1];
          poz=1;
        }
    cout<<max<<' '<<poz;
  for(i=0;i<n;i++)
     if(a[i]==r)//daca este numar prim
        a[i]=a[i+1];
     else
        i++;


}
int main()
{
     int a[100],b[100],c[100],na,nb,nc;
   citire(a,na);
   scriere(b,nb);
   sortare(c,nc);
}