Pagini recente » Cod sursa (job #2885061) | Cod sursa (job #1441846) | Cod sursa (job #221784) | Cod sursa (job #328348) | Cod sursa (job #34564)
Cod sursa(job #34564)
#include<fstream>
using namespace std;
unsigned long int a[1000];
int n,b[100];
int main()
{
ifstream fin("secv.in");
ofstream fout("secv.out");
int i,j,k;
fin>>n;
for(i = 1; i <= n; i++)
fin>>a[i];
for(i = 1; i <= n; i++)
{
for(j = i+1; j <= n; j++)
if(a[i] == a[j])
{
for(k = j; k <= n; k++)
a[k] = a[k+1];
n--;
}
}
for(i = 1; i <= n-1; i++)
if(a[i] > a[i+1])
{
for(k = i; k <= n; k++)
a[k] = a[k+1];
n--;
}
fout<<n;
fin.close();
fout.close();
return 0;
}