Advertisement
Guest User

Untitled

a guest
Nov 12th, 2019
99
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.96 KB | None | 0 0
  1. #include "stdafx.h"
  2. #include "stdio.h"
  3. #include "stdlib.h"
  4. #include"math.h"
  5.  
  6. int count (int a){
  7. int j=0;
  8. while (a>0){
  9. j++;
  10. a=a/10;}
  11. return j;
  12. }
  13. int conunct(int b,int c){
  14. int *f;
  15. int *f1;
  16. int *f2;
  17. int g=0, g1=0,l=0,k=0;;
  18. int d=count(b);
  19. if (count(b)>count(c))
  20. d=count(c)+(count(b)-count(c));
  21. if (count(c)>count(b))
  22. d=count(b)+(count(c)-count(b));
  23. f=(int*)calloc(d,sizeof(int));
  24. f1=(int*)calloc(d,sizeof(int));
  25. f2=(int*)calloc(d,sizeof(int));
  26. while (b!=0){
  27. f[g]=b % 10;
  28. b=b/10;
  29. g++;}
  30. while(c!=0){
  31. f1[g1]=c % 10;
  32. c=c/10;
  33. g1++;}
  34. for(int i=0;i<d;i++)
  35. f2[i]=f[i]*f1[i];
  36. for (int i=0;i<d;i++){
  37. l=l+f2[i]*pow((double)10,k);
  38. k++;}
  39. return l;}
  40. int main()
  41. {
  42. int n;
  43. scanf("%d", &n);
  44. int *a;
  45. a=(int*)malloc(n*sizeof(int));
  46. for (int i=0;i<n;i++){
  47. scanf("%d", &a[i]);
  48. }
  49. int c;
  50. c=conunct(a[0],a[1]);
  51. for (int i=2;i<n;i++)
  52. c=conunct(c,a[i]);
  53. printf("%d", c);
  54. scanf("%d", &n);
  55. return 0;
  56. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement