Pagini recente » Cod sursa (job #786462) | Cod sursa (job #475173) | Cod sursa (job #2688824) | Cod sursa (job #980508) | Cod sursa (job #1022365)
#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
int nrcif(int n)
{
int i=0;
while(n!=0){i++;n=n/10;}
return i;}
/*
int complement(int n)
{int i=n,r=0,p=1;
while(i!=0)
{
r=r+((9-(i%10))*p);
i=i/10;
p=p*10;
}
return r;
} 18903=>1893
int main()
{
int n;
cin>>n;
cout<<complement(n);
}
*/
/*
int nounr(int n)
{
int i=n,r=0,p=1;
while(i!=0)
{if((i%10)!=0){r=r+(i%10)*p;p=p*10;}
i=i/10;
}
return r;
}
int main()
{
int n;
cin>>n;
cout<<nounr(n);
}
*/
/*
int maxi(int n)
{
int i,c,d=0,r=0,cc=n; // Trebe corectat
int a[9]={0};
c=nrcif(n);
for(i=1;i<=c;i++)
{a[cc%10]=1;
cc=cc/10;
}
for(i=1;i<=9;i++)
{
if(a[i]==1){r=r+i*pow(10,d);d++;}
}
return r;
}
int main()
{
int n;
cin>>n;
cout<<maxi(n);
}*/
/*
int ex4(int n)
{
int i=0,c=0,s=0;
s=n%10;
i=nrcif(n);
n=n/10;
c=n+(s*pow(10,i-1));
return c;
}
int main()
{
int n;
cin>>n;
cout<<ex4(n);
}*/