Advertisement
Guest User

Untitled

a guest
May 27th, 2015
280
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 5.80 KB | None | 0 0
  1. #include<iostream>
  2. using namespace std;
  3.  
  4. int intArray[10][10];
  5.  
  6. void printArray(){
  7. cout<<"Content of array is: "<<endl;
  8. for(int i=0;i<10;i++){
  9. for(int j=0;j<10;j++){
  10. cout<<intArray[i][j]<<" ";
  11. }
  12. cout<<endl;
  13. }
  14. }
  15.  
  16. void printColumn(int column){
  17. cout<<"Content of column "<<column<<" is: "<<endl;
  18. for(int i=0;i<10;i++){
  19. cout<<intArray[i][column];
  20. cout<<endl;
  21. }
  22. }
  23.  
  24. void printRow(int row){
  25. cout<<"Content of row "<<row<<" is: "<<endl;
  26. for(int i=0;i<10;i++){
  27. cout<<intArray[row][i]<<" ";
  28. }
  29. cout<<endl;
  30. }
  31.  
  32. void printDiagonal(){
  33. cout<<"Content of diagonal is: "<<endl;
  34. for(int i=0;i<10;i++){
  35. cout<<intArray[i][i]<<" ";
  36. }
  37. cout<<endl;
  38. }
  39.  
  40. int main(){
  41.  
  42. for(int i=0;i<10;i++){
  43. for(int j=0;j<10;j++){
  44. if(i==j) intArray[i][j]=1;
  45. }
  46. }
  47.  
  48. printArray();
  49.  
  50. int column,row,data;
  51. while(true){
  52. cout<<endl;
  53. cout<<"Row Column Data: ";
  54. cin>>row>>column>>data;
  55. intArray[row][column]=data;
  56. printArray();
  57. cout<<endl;
  58. printRow(row);
  59. cout<<endl;
  60. printColumn(column);
  61. cout<<endl;
  62. printDiagonal();
  63. }
  64.  
  65. return 0;
  66. }
  67.  
  68. #include<iostream>
  69. using namespace std;
  70.  
  71. int factorial(int number){
  72. if(number>1) return number*factorial(number-1);
  73. return 1;
  74. }
  75.  
  76. int main(){
  77. int number;
  78. cout<<"Input number: ";
  79. cin>>number;
  80. cout<<factorial(number);
  81.  
  82. return 0;
  83. }
  84.  
  85. #include<iostream>
  86. using namespace std;
  87.  
  88. int fibonacchi(int current, int next, int number){
  89. if(number>0){
  90. cout<<current<<" ";
  91. return fibonacchi(next,next+current,--number);
  92. }
  93. }
  94.  
  95. void fibonacchi(int number){
  96. fibonacchi(1,1,number);
  97. }
  98.  
  99. int main(){
  100. int number;
  101. cout<<"Input number: ";
  102. cin>>number;
  103. fibonacchi(number);
  104.  
  105. return 0;
  106. }
  107.  
  108. #include<iostream>
  109. using namespace std;
  110.  
  111. const int size=10;
  112. int intArray[size]={3,6,4,6,4,23,324,657,57,6};
  113.  
  114. void bubbleSort(){
  115. int temp;
  116. for(int i=size;i>0;i--){
  117. for(int j=1;j<i;j++){
  118. if(intArray[j-1]>intArray[j]){
  119. temp=intArray[j-1];
  120. intArray[j-1]=intArray[j];
  121. intArray[j]=temp;
  122. }
  123. }
  124. }
  125. }
  126.  
  127. int main(){
  128.  
  129. bubbleSort();
  130.  
  131. for(int i=0;i<size;i++){
  132. cout<<intArray[i]<<" ";
  133. }
  134.  
  135. return 0;
  136. }
  137. #include<iostream>
  138. using namespace std;
  139.  
  140. const int size=15;
  141. int intArray[size]={1,5,8,16,28,35,39,47,59,63,74,81,96,102,127};
  142.  
  143. bool binarySearch(int min, int max, int number){
  144. int mid;
  145. while(max-min>1){
  146. mid=(max+min)/2;
  147. if(number>=intArray[mid]) min=mid;
  148. else max=mid;
  149. }
  150. if(intArray[min]==number) return true;
  151. else if(intArray[max]==number) return true;
  152. else return false;
  153. }
  154.  
  155. int main(){
  156. if(binarySearch(0,size-1,5)) cout<<"MATCHED";
  157. else cout<<"NOT MATCHED";
  158.  
  159. return 0;
  160. }
  161.  
  162. #include<iostream>
  163. using namespace std;
  164.  
  165. const int size=15;
  166. int intArray[size]={1,5,8,16,28,35,39,47,59,63,74,81,96,102,127};
  167.  
  168. bool binarySearch(int min, int max, int number){
  169. if(max-min<=1){
  170. if(intArray[min]==number) return true;
  171. else if(intArray[max]==number) return true;
  172. else return false;
  173. }
  174. int mid=(max+min)/2;
  175. if(number>=intArray[mid]) return binarySearch(mid, max, number);
  176. else return binarySearch(min, mid, number);
  177. }
  178. int main(){
  179. if(binarySearch(0,size-1,5)) cout<<"MATCHED";
  180. else cout<<"NOT MATCHED";
  181.  
  182. return 0;
  183. }
  184. #include<iostream>
  185. #include<string>
  186. using namespace std;
  187.  
  188. string reflex_vacuum_agent(string location, string status){
  189. if(status=="Dirty") return "Suck";
  190. else if(location=="A") return "Right";
  191. if(location=="B") return "Left";
  192. }
  193. int main(){
  194.  
  195. string location,status;
  196. while(true){
  197. cout<<"Location: ";
  198. cin>>location;
  199. cout<<"Status: ";
  200. cin>>status;
  201. cout<<"Action: "<<reflex_vacuum_agent(location,status);
  202. cout<<endl<<endl;
  203. }
  204.  
  205. return 0;
  206. }
  207. #include<iostream>
  208. #include<string>
  209. #include<vector>
  210. using namespace std;
  211.  
  212. class Percept{
  213. public:
  214. string location;
  215. string status;
  216. };
  217. class State{
  218. public:
  219. Percept percept;
  220. string action;
  221. };
  222.  
  223. std::vector< State > rules;
  224.  
  225. State interpret_input(Percept percept){
  226. for(int i=0;i<rules.size();i++){
  227. if(rules[i].percept.location==percept.location &&
  228. rules[i].percept.status==percept.status){
  229. return rules[i];
  230. }
  231. }
  232. }
  233.  
  234. string simple_reflex_agent(Percept percept){
  235. Percept state=percept;
  236. State rule=interpret_input(state);
  237. string action=rule.action;
  238. return action;
  239. }
  240. int main(){
  241.  
  242. int count=0;
  243. rules.push_back(*(new State));
  244. rules[count].percept.location="A";
  245. rules[count].percept.status="Clean";
  246. rules[count].action="Right";
  247. count++;
  248. rules.push_back(*(new State));
  249. rules[count].percept.location="A";
  250. rules[count].percept.status="Dirty";
  251. rules[count].action="Suck";
  252. count++;
  253. rules.push_back(*(new State));
  254. rules[count].percept.location="B";
  255. rules[count].percept.status="Clean";
  256. rules[count].action="Left";
  257. count++;
  258. rules.push_back(*(new State));
  259. rules[count].percept.location="B";
  260. rules[count].percept.status="Dirty";
  261. rules[count].action="Suck";
  262.  
  263. string location,status;
  264. while(true){
  265. cout<<"Location: ";
  266. cin>>location;
  267. cout<<"Status: ";
  268. cin>>status;
  269. Percept percept;
  270. percept.location=location;
  271. percept.status=status;
  272. cout<<"Action: "<<simple_reflex_agent(percept);
  273. cout<<endl<<endl;
  274. }
  275.  
  276. return 0;
  277. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement