Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <cmath>
- using namespace std;
- int main(){
- double h, ang, vel, g = 9.80665, pi = 3.14159;
- vector<double> dist;
- int p1, p2, n;
- while(cin >> h){
- cin >> p1 >> p2;
- cin >> n;
- dist.clear();
- for(int i = 0; i < n; i++){
- cin >> ang >> vel;
- ang = (pi*ang)/180;
- dist.push_back( ( (vel*sin(ang) + sqrt( pow(vel*sin(ang), 2) + (2*g*h)) ) / g ) * vel * cos(ang) );
- }
- cout.precision(5);
- for(int i = 0; i < n; i++){
- cout << fixed << dist.at(i) << " -> " << ((dist.at(i) >= p1 && dist.at(i) <= p2) ? "DUCK" : "NUCK") << endl;
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement