SHARE
    TWEET
    AlexAvram

    temă 13.09

    Sep 12th, 2023
    117
    0
    Never
    Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
    C++ 2.45 KB | Source Code | 0 0
    1. ///#621 NumarLipsa
    2. #include <iostream>
    3. using namespace std;
    4. int v[101];
    5. int main()
    6. {
    7. int n;
    8. cin>>n;
    9. int i, j, p;
    10. for (i=1; i<=n; ++i)
    11. cin>>v[i];
    12. for (i=1; i<n; ++i)
    13. {
    14. p=i;
    15. for (j=i+1; j<=n; ++j)
    16. if (v[j]<v[p])
    17. p=j;
    18. if (i!=p)
    19. swap (v[i],v[p]);
    20. }
    21. for (i=1; i<=n; ++i)
    22. if (v[i]-v[i-1]>1)
    23. {
    24. cout<<v[i-1]+1;
    25. return 0;
    26. }
    27. cout<<v[n]+1;
    28. return 0;
    29. }
    30. ///#1400 e_palindrom
    31. #include <iostream>
    32. using namespace std;
    33. int fr[10001];
    34. int main()
    35. {
    36. int n, x;
    37. cin>>n;
    38. int i;
    39. for (i=1; i<=n; ++i)
    40. cin>>x, ++fr[x];
    41. int nrimp=0;
    42. for (i=0; i<=10000; ++i)
    43. if (fr[i]%2==1)
    44. ++nrimp;
    45. if (nrimp>1)
    46. cout<<"NU";
    47. else
    48. cout<<"DA";
    49. return 0;
    50. }
    51. ///#528 Multimi
    52. #include <iostream>
    53. using namespace std;
    54. int a[1001], b[1001], ab[2001];
    55. int re[2001], in[1001];
    56. int main()
    57. {
    58. int n, m, nm;
    59. int i, j, p;
    60. cin>>n;
    61. for (i=1; i<=n; ++i)
    62. cin>>a[i], ab[i]=a[i];
    63. cin>>m;
    64. for (j=1; j<=m; ++j)
    65. cin>>b[j], ab[j+n]=b[j];
    66. nm=n+m;
    67. //
    68. for (i=1; i<nm; ++i)
    69. {
    70. p=i;
    71. for (j=i+1; j<=nm; ++j)
    72. if(ab[j]<ab[p])
    73. p=j;
    74. if (i!=p)
    75. swap(ab[i], ab[p]);
    76. }
    77. ab[0]=-1, j=0;
    78. for (i=1; i<=nm; ++i)
    79. if (ab[i]!=ab[i-1])
    80. re[++j]=ab[i];
    81. for (i=1; i<=j; ++i)
    82. cout<<re[i]<<" ";
    83. cout<<'\n';
    84. //
    85. int x=0;
    86. for (i=1; i<=n; ++i)
    87. for (j=1; j<=m; ++j)
    88. if(a[i]==b[j])
    89. in[++x]=a[i];
    90. for (i=1; i<=x; ++i)
    91. cout<<in[i]<<" ";
    92. //
    93. return 0;
    94. }
    95. ///#535 Fabrica
    96. #include <iostream>
    97. using namespace std;
    98. int main()
    99. {
    100. int n, t, x, s=0;
    101. cin>>n>>t;
    102. int i;
    103. for (i=1; i<=n; ++i)
    104. cin>>x, s+=(t/x);
    105. cout<<s;
    106. return 0;
    107. }
    108. ///#567 Pereche
    109. #include <iostream>
    110. #include <math.h>
    111. using namespace std;
    112. int v[1001];
    113. int main()
    114. {
    115. int n;
    116. cin>>n;
    117. int i, j;
    118. for (i=1; i<=n; ++i)
    119. cin>>v[i];
    120. int dif, st, dr, minn;
    121. minn=abs(v[1]-v[n]);
    122. st=1, dr=n;
    123. for (i=2; i<=n; ++i)
    124. {
    125. dif=abs(v[i]-v[i-1]);
    126. if (dif<minn)
    127. minn=dif, st=i-1, dr=i;
    128. }
    129. cout<<st<<" "<<dr;
    130. return 0;
    131. }
    Advertisement
    Add Comment
    Please, Sign In to add comment
    Public Pastes
    We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
    Not a member of Pastebin yet?
    Sign Up, it unlocks many cool features!

    AltStyle によって変換されたページ (->オリジナル) /