1 #include <iostream> 2 using namespace std; 3 4 class race 5 { 6 public: 7 int get_v1() 8 { 9 cin >> v1; 10 return v1; 11 } 12 int get_v2() 13 { 14 cin >> v2; 15 return v2; 16 } 17 int get_t() 18 { 19 cin >> t; 20 return t; 21 } 22 int get_s() 23 { 24 cin >> s; 25 return s; 26 } 27 int get_l() 28 { 29 cin >> l; 30 return l; 31 } 32 void race_progress() 33 { 34 int i = 0; 35 int s1 = 0; 36 int s2 = 0; 37 while (s1 < l && s2 < l) 38 { 39 s1 = s1 + v1; 40 s2 = s2 + v2; 41 i++; 42 if (s1 >= l || s2 >= l) 43 { 44 break; 45 } 46 if (s1 - s2 >= t) 47 { 48 s1 = s1 - s * v1; 49 } 50 } 51 if (s1 > s2) 52 { 53 cout << "r" << endl; 54 cout << i; 55 } 56 else if (s2 > s1) 57 { 58 cout << "t" << endl; 59 cout << i; 60 } 61 else 62 { 63 cout << "d" << endl; 64 cout << i; 65 } 66 } 67 68 private: 69 int v1, v2, t, s, l; 70 }; 71 72 int main(void) 73 { 74 race x; 75 x.get_v1(); 76 x.get_v2(); 77 x.get_t(); 78 x.get_s(); 79 x.get_l(); 80 x.race_progress(); 81 return 0; 82 }
网上其他的模拟方法:
原文链接:https://blog.csdn.net/qi2456/article/details/88100552
1 #include<bits/stdc++.h> 2 3 using namespace std; 4 5 6 7 int main() 8 9 { 10 11 int v1,v2,t,s,l; 12 13 cin>>v1>>v2>>t>>s>>l; 14 15 int num=0,s1=0,s2=0; 16 17 while(1) 18 19 { 20 21 22 23 if(s1>=l&&s2>=l) 24 25 { 26 27 cout<<"d"<<endl; 28 29 cout<<num; 30 31 break; 32 33 } 34 35 else if(s1>=l) 36 37 { 38 39 cout<<"r"<<endl; 40 41 cout<<num; 42 43 break; 44 45 } 46 47 else if(s2>=l) 48 49 { 50 51 cout<<"t"<<endl; 52 53 cout<<num; 54 55 break; 56 57 } 58 59 if(s1-s2>=t) 60 61 { 62 63 for(int i=0;i<s;i++) 64 65 { 66 67 num++; 68 69 s2+=v2; 70 71 if(s2>=l) 72 73 { 74 75 cout<<"t"<<endl; 76 77 cout<<num; 78 79 exit(0); 80 81 } 82 83 } 84 85 86 87 } 88 89 else 90 91 { 92 93 num++; 94 95 s1+=v1; 96 97 s2+=v2; 98 99 } 100 101 } 102 103 return 0; 104 105 }
如对本文有疑问, 点击进行留言回复!!
Qt——BUG:构造函数中new了控件并隐藏了,后续显示时位置不对?
PAT甲级 1087. All Roads Lead to Rome (30) (dijkstra)
C++删除迭代器两种方法对比(list.erase(it++)和it=list.erase(it))
网友评论