404B - Marathon - CodeForces Solution


implementation math *1500

Please click on ads to support us..

C++ Code:

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <fstream>

using namespace std;

long double a, d, n, x, y, s, l, j;

int main()
{
    cout << fixed << setprecision(7);

    cin >> a >> d >> n;

    l = a * 4;

    for (int i = 0; i < n; i++)
    {
        s = fmod((i + 1) * d, l);

        j = 0;

        while (s - a > 0)
        {
            s -= a, j++;
        }

        if (j == 0) x = s, y = 0;
        else if (j == 1) x = a, y = s;
        else if (j == 2) x = a - s, y = a;
        else x = 0, y = a - s;

        cout << x << " " << y << "\n";
    }

    return 0;
}


Comments

Submit
0 Comments
More Questions

1302. Deepest Leaves Sum
1209. Remove All Adjacent Duplicates in String II
994. Rotting Oranges
983. Minimum Cost For Tickets
973. K Closest Points to Origin
969. Pancake Sorting
967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST