Advertisement
alexon5519

22-programare

Feb 26th, 2018
88
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.31 KB | None | 0 0
  1. #include<iostream>
  2. #include<fstream>
  3.  
  4. int divizori(int a){
  5. int i,div=0;
  6. for(i=2;i<=a/2;i++)
  7. if(a % i == 0)
  8. div++;
  9. return div;
  10.  
  11. }
  12.  
  13. using namespace std;
  14. int v[100];
  15. int main(){
  16. ifstream f1("atestat.in");
  17. ofstream f2("atestat.out");
  18. int n,k,x,paritate=0,ver=0,nr=0,y,i=0,j,a,aux;
  19. f1>>n>>k;
  20. while(f1>>x){
  21. y=x;
  22. if(ver == 0){
  23. while(y != 0){
  24. nr++;
  25. if(y % 2 == 0)
  26. paritate++;
  27. y=y/10;
  28. }
  29. if(paritate == 0 || paritate == nr)
  30. f2<<"DA";
  31. else
  32. f2<<"NU";
  33. ver=1;
  34. }
  35. if( divizori(x) >= k){
  36. if(i == 0 ){
  37. i++;
  38. v[i]=x;
  39. }
  40. else{
  41. i++;
  42. ver=i;
  43. for(j=1;j<i;j++)
  44. if(v[j] == x)
  45. i--;
  46. if(ver == i)
  47. v[i]=x;
  48. }
  49. }
  50. }
  51. f2<<endl;
  52. for(a=1;a<=i-1;a++)
  53. for(j=a+1;j<=i;j++)
  54. if(v[a]>v[j]){
  55. aux=v[a];
  56. v[a]=v[j];
  57. v[j]=aux;
  58. }
  59. for(j=1;j<=i;j++)
  60. f2<<v[j]<<" ";
  61. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement