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 4.39 KB | None | 0 0
  1. /*#include <iostream>
  2. #include <fstream>
  3. #include <cmath>
  4.  
  5. using namespace std;
  6.  
  7. struct mokinys{
  8. string vardas;
  9. string klase;
  10. int taskai;
  11. bool status = false;
  12. };
  13.  
  14. void atrink(int n, mokinys krepsininkai[], int & primeVidurkis){
  15. primeVidurkis = 0;
  16. int primeCount = 0;
  17. for(int i = 0; i < n; i++){
  18. if(krepsininkai[i].taskai > 14){
  19. primeCount++;
  20. primeVidurkis += krepsininkai[i].taskai;
  21. krepsininkai[i].status = true;
  22. }
  23. }
  24. primeVidurkis /= primeCount;
  25. }
  26.  
  27. int totalScore(int n, mokinys krepsininkai[]){
  28. int score = 0;
  29. for(int i = 0; i < n; i++){
  30. score += krepsininkai[i].taskai;
  31. }
  32. return score;
  33. }
  34.  
  35. int main()
  36. {
  37. mokinys krepsininkai[100];
  38. int n, vidurkis, total, primeVidurkis;
  39. ifstream read("duom.txt");
  40. read >> n;
  41. for(int i = 0; i < n; i++){
  42. read >> krepsininkai[i].vardas >> krepsininkai[i].klase >> krepsininkai[i].taskai;
  43. }
  44. read.close();
  45. atrink(n, krepsininkai, primeVidurkis);
  46. total = totalScore(n, krepsininkai);
  47. vidurkis = total / n;
  48.  
  49. ofstream write("rez.txt");
  50. for(int i = 0; i < n; i++){
  51. if(krepsininkai[i].status){
  52. write << krepsininkai[i].vardas << " " << krepsininkai[i].klase << " " << krepsininkai[i].taskai << endl;
  53. }
  54. }
  55. write << "Vidutiniskai krepsininkai surinko tasku:" << vidurkis << endl << "atrinkti mokiniai vidutiniskai surinko tasku: " << primeVidurkis << endl << "Is viso surinko: " << total << " tasku";
  56. write.close();
  57.  
  58. return 0;
  59. }*/
  60.  
  61.  
  62. /*#include <iostream>
  63. #include <cmath>
  64. #include <fstream>
  65.  
  66. using namespace std;
  67.  
  68. struct produktas{;
  69. string pav;
  70. float kg;
  71. float kaina;
  72. };
  73.  
  74. void suskaiciuok(int n, produktas produktai[], float & isViso){
  75. float kaina = 0;
  76. isViso = 0;
  77.  
  78. for(int i = 0; i < n; i++){
  79. kaina = produktai[i].kaina * produktai[i].kg;
  80. produktai[i].kaina = kaina;
  81. isViso += kaina;
  82. }
  83.  
  84. }
  85.  
  86. int main(){
  87. int n = 3;
  88. float isViso;
  89. produktas produktai[100];
  90. ifstream read("duom.txt");
  91. for(int i = 0; i < n; i++){
  92. read >> produktai[i].pav >> produktai[i].kg >> produktai[i].kaina;
  93. }
  94. read.close();
  95.  
  96. suskaiciuok(n, produktai, isViso);
  97.  
  98. ofstream write("rez.txt");
  99.  
  100. for(int i = 0; i < n; i++){
  101. write << produktai[i].pav << " " << produktai[i].kaina << endl;
  102. }
  103. write << endl << "Is viso: " << isViso;
  104. }*/
  105.  
  106. #include <iostream>
  107. #include <cmath>
  108. #include <fstream>
  109. #include <time.h>
  110.  
  111. using namespace std;
  112.  
  113. struct marsas{
  114. int k[30];
  115. int ilgis;
  116. bool reason;
  117. };
  118.  
  119. void vaziuok(int startPos[], int endPos[], int n, marsas eigis[]){
  120. int x = startPos[0], y = startPos[1];
  121. int z = 0;
  122. while(z < 1){
  123. int x = startPos[0], y = startPos[1];
  124. for(int i = 0; i < eigis[i].ilgis; i++){
  125. switch(eigis[z].k[i]){
  126. case 1:
  127. y++;
  128. cout << y << " ";
  129. break;
  130. case 2:
  131. x++;
  132. cout << x << " ";
  133. break;
  134. case 3:
  135. y--;
  136. cout << y << " ";
  137. break;
  138. case 4:
  139. x--;
  140. cout << x << " ";
  141. break;
  142. default:
  143. break;
  144. }
  145.  
  146. }
  147. if(x == endPos[0] && y == endPos[1]){
  148. eigis[z].reason = true;
  149. }
  150. cout << x << " " << y << endl;
  151. z++;
  152. }
  153. }
  154.  
  155.  
  156. int main(){
  157. marsas eigis[100];
  158. int startPos[2], endPos[2], n;
  159.  
  160. ifstream read("duom.txt");
  161. read >> startPos[0] >> startPos[1];
  162. read >> endPos[0] >> endPos[1];
  163. read >> n;
  164. for(int i = 0; i < n; i++){
  165. read >> eigis[i].ilgis;
  166. eigis[i].reason = false;
  167. for(int j = 0; j < eigis[i].ilgis; j++){
  168. read >> eigis[i].k[j];
  169. }
  170. }
  171. read.close();
  172.  
  173. vaziuok(startPos, endPos, n, eigis);
  174.  
  175. ofstream write("rez.txt");
  176. for(int i = 0; i < n; i++){
  177. if(eigis[i].reason){
  178. write << "pasiektas tikslas";
  179. } else {
  180. write << "sekos pabaiga";
  181. }
  182. for(int j = 0; j < eigis[i].ilgis; j++){
  183. write << " " << eigis[i].k[j];
  184. }
  185. write << " " << eigis[i].ilgis << endl;
  186. }
  187. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement