Advertisement
Guest User

Untitled

a guest
Mar 18th, 2018
75
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.56 KB | None | 0 0
  1. d#include<stdio.h>
  2. #include<math.h>
  3. #include<color.h>
  4. #include <conio.h>
  5.  
  6. int i,p,u,rez,nr,l,alo,n,o,k[10],e,a1;
  7. char den;
  8.  
  9. int lol (int main1);
  10. int kek (int main1);
  11. int aga (int main1);
  12.  
  13. main()
  14.  
  15. {
  16. main1:{
  17. printf("dati litera noua pentru tabel\n");
  18. for (l = 0; l < 2; l++) {
  19. scanf("%c",&den); }
  20. printf("Dati nr de elemente ale tabloului \n");
  21. scanf("%i",&n);
  22.  
  23. for(i=0;i<n;i++)
  24. {
  25.  
  26. printf("intr %c[%i]= ",den,i);
  27. scanf("%i",&k[i]);
  28. }
  29. }
  30. printf("\n Alege: \n");
  31. printf("1.nr impare\n");
  32. printf("2.nr divizibile cu 3 si nu cu 5\n");
  33. printf("3.satisfac conditia i<a<a^2\n");
  34. scanf("%d",&e);
  35. switch(e)
  36. { case 1:
  37.  
  38. printf("%d",lol(k[i]));
  39.  
  40. break;
  41.  
  42.  
  43. case 2:
  44.  
  45. printf("%d",kek(k[i]));
  46. break;
  47.  
  48. break;
  49.  
  50. case 3:
  51.  
  52. printf("%d",aga(k[i]));
  53. break;
  54. default:printf("punctul %d nu exista",e);
  55. }
  56. printf("\nDoriti sa repetati programul? 0 - nu \n");
  57. scanf("%d",&p);
  58. if (p > 0) goto main1;
  59. if (p == 0) printf("Progr. sa finisat");
  60. }
  61. int lol (main1)
  62. { for(i=0;i<n;i++) {
  63. if(k[i]%2==1) SetColor(4) ; printf(" nr impare sunt=%d ",k[i]); SetColor(15) ;
  64.  
  65. } }
  66.  
  67. int kek (main1)
  68. {
  69. for(i=0; i<n; i++) {
  70. if(k[i]%5==1) goto b; }
  71. b: for(i=0; i<n; i++) {
  72. if(k[i]%3==0) SetColor(9) ; printf("\nnr divizibile cu 3 si nu cu 5 sunt=%d",k[i]); SetColor(15) ;
  73.  
  74. }
  75. }
  76. int aga (main1)
  77. {
  78. for(i=0; i<n; i++) {
  79. if(i<k[i]<pow(k[i],2 ) ) SetColor(6) ; printf(" \n satisfac conditia i<a<a^2= %d",k[i]) ; SetColor(15) ;
  80. }
  81.  
  82. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement