Advertisement
Guest User

Untitled

a guest
May 27th, 2017
55
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.08 KB | None | 0 0
  1. PARE2:
  2.  
  3. #include <iostream>
  4. #include <vector>
  5. #include <cmath>
  6. using namespace std;
  7.  
  8. int main(){
  9. int n;
  10. bool trobat, parell, senar;
  11. while(cin >> n){
  12. trobat = parell = senar = false;
  13. vector <int> v(n);
  14. for(int i = 0; i < n; ++i) cin >> v[i];
  15. for(int i = 0; i < n and not trobat; ++i){
  16. if(v [i] % 2 == 0) parell = true;
  17. else senar = true;
  18. if(parell and senar) trobat = true;
  19. }
  20. if(trobat) cout << "si" << endl;
  21. else cout << "no" << endl;
  22. }
  23. }
  24.  
  25. ISBN
  26.  
  27. #include <iostream>
  28. #include <vector>
  29. using namespace std;
  30.  
  31. int main(){
  32. int suma, mul;
  33. char num;
  34. vector <char> v(10);
  35. while(cin >> v[0]){
  36. suma = 0;
  37. for(int i = 1; i < 10; ++i) cin >> v[i];
  38. for(int i = 0; i < 10; ++i){
  39. if(v [i] == '?') mul = 10 - i;
  40. else if (v [i] == 'X') suma += 10;
  41. else suma += (v[i] - '0') * (10 - i);
  42. }
  43. bool trobat = false;
  44. for(int i = 0; i < 10 and not trobat; ++i){
  45. if((suma + (i * mul)) % 11 == 0){
  46. num = i + '0';
  47. trobat = true;
  48. }
  49. }
  50. if(not trobat) cout << "X" << endl;
  51. else cout << num << endl;
  52. }
  53. }
  54.  
  55. PATXI:
  56.  
  57. #include <iostream>
  58. #include <vector>
  59. using namespace std;
  60. typedef vector<int> Fila;
  61. typedef vector<Fila> Quadrat;
  62.  
  63. int avalua(const vector <int> &p, int x){
  64. int n = p.size();
  65. int res = 0;
  66. int factor = 1;
  67. for(int i = 0; i < n; ++i){
  68. res += p[i] * factor;
  69. factor *= x;
  70. }
  71. return res;
  72. }
  73.  
  74. MAPAR:
  75.  
  76. #include <iostream>
  77. #include <vector>
  78. #include <string>
  79. using namespace std;
  80. typedef vector<string> Fila;
  81. typedef vector<Fila> Matriu;
  82.  
  83. int nombre_de_paraules(const Matriu& m, char c, int k){
  84. int total = 0;
  85. int f = m.size();
  86. for(int i = 0; i < f; ++i){
  87. int cc = m[i].size();
  88. for(int j = 0; j < cc; ++j){
  89. if(k < m[i][j].size() and m[i][j][k] == c) ++total;
  90. }
  91. }
  92. return total;
  93. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement