cf1066a Vova and Train (analog)

Source: Internet
Author: User

Flood problem ...

The topic asks you to ask to see the number of lanterns, we can divide into 3 parts

  • Total number of Lanterns —————— 1

  • In lll

  • Number of lanterns on the left of R (including RRR) —————— 3

We know that by the top 2-3 is the number of lanterns blocked by another train

So 1-2+3 is the answer;

Code:
#include <iostream>#include<cstdio>#include<cstring>#include<algorithm>#defineRii Register int i#defineRij Register Int Jusing namespacestd;intt,len,l,r,v;voidsolve () {scanf ("%d%d%d%d",&len,&v,&l,&R); intsl1=len/v; intSl2= (l1)/v; intsl3=r/v; SL1-=SL3; SL1+=SL2; printf ("%d\n", SL1);}intMain () {intT; scanf ("%d",&t);  for(rii=1; i<=t;i++) {solve (); } }

cf1066a Vova and Train (analog)

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.