Danbooru
Login Posts Comments Notes Artists Tags Pools Wiki Forum More »
Listing Upload Hot Changes Help

Search

  • Help
guro
scat
furry -rating:g

Artist

  • ? yamamoto arifred 409

Copyrights

  • ? original 1.3M
  • ? rikei ga koi ni ochita no de shoumeishitemita 82

Characters

  • ? himuro ayame 71
  • ? kanade kotonoha 33
  • ? yukimura shinya 57

General

  • ? 1boy 1.6M
  • ? 2girls 1.1M
  • ? amusement park 1.0k
  • ? blouse 47k
  • ? breasts 3.9M
  • ? camisole 51k
  • ? chart 2.2k
  • ? closed eyes 814k
  • ? comic 593k
  • ? crossed arms 96k
  • ? glasses 408k
  • ? greyscale 552k
  • ? hair between eyes 1.3M
  • ? lab coat 30k
  • ? long hair 4.9M
  • ? map 5.3k
  • ? medium breasts 983k
  • ? monochrome 693k
  • ? multiple girls 1.7M
  • ? open collar 9.4k
  • ? open mouth 2.7M
  • ? page number 24k
  • ? pantyhose 604k
  • ? parted bangs 232k
  • ? pencil skirt 44k
  • ? ponytail 781k
  • ? shirt 2.2M
  • ? skirt 1.7M
  • ? smile 3.3M
  • ? sweater 233k
  • ? t-shirt 77k

Meta

  • ? bad id 1.3M
  • ? ↳ bad pixiv id 993k
  • ? highres 6.1M
  • ? translation request 623k
  • ? ↳ check translation 38k
  • ? ↳ partially translated 20k

Information

  • ID: 2564084
  • Uploader: Jarlath »
  • Date: over 8 years ago
  • Size: 394 KB .jpg (844x1200) »
  • Source: pixiv.net/artworks/60288900 »
  • Rating: Sensitive
  • Score: 0
  • Favorites: 0
  • Status: Active

Options

  • Resize to window
  • Find similar
  • Download

History

  • Tags
  • Pools
  • Notes
  • Moderation
  • Commentary
himuro ayame, yukimura shinya, and kanade kotonoha (original and 1 more) drawn by yamamoto_arifred
  • ‹ prev Search: yukimura_shinya next ›
  • « ‹ prev Pool: Original - Science Tried to Prove We'd Fallen in Love (Yamamoto Arifred) next › »
  • Comments
  • There are no comments.

    And it becomes like this.
    The absolute solution to this problem
    is to find the absolutely shortest and fastest way to loop around this date route...
    Examine them all.
    (The Earth weighs about 6 sextillion tons)
    If you head for the closest attraction to the entrance first.
    As a result, you'll have one date route plan.
    Date course 1
    Date course 2
    When considering the 22 locations that we have to reach, and the number of orders we can take to see them all,
    Do you know a way to solve this, Kanade-chan?
    The next is here.
    It's absolutely impossible to be able to experiment them all.
    About 1.1 sextillion (1.124 x e^21) routes
    Which is why this is one of those problems that doesn't have an absolute answer.
    Let's see... for example.
    This is closest
    Then from there go to the nearest attraction... and repeat that over and over.
    Terms / Privacy / Upgrade / Contact /