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 412

Copyright

  • ? rikei ga koi ni ochita no de shoumeishitemita 83

Characters

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

General

  • ? 1boy 2.0M
  • ? 2girls 1.3M
  • ? amusement park 1.3k
  • ? blouse 49k
  • ? breasts 4.6M
  • ? camisole 62k
  • ? chart 2.3k
  • ? closed eyes 985k
  • ? comic 690k
  • ? crossed arms 114k
  • ? glasses 475k
  • ? greyscale 651k
  • ? hair between eyes 1.7M
  • ? lab coat 38k
  • ? long hair 5.8M
  • ? map 6.0k
  • ? medium breasts 1.1M
  • ? monochrome 805k
  • ? multiple girls 2.0M
  • ? open collar 13k
  • ? open mouth 3.2M
  • ? page number 28k
  • ? pantyhose 699k
  • ? parted bangs 289k
  • ? pencil skirt 52k
  • ? ponytail 909k
  • ? shirt 2.7M
  • ? skirt 2.0M
  • ? smile 3.9M
  • ? sweater 285k
  • ? t-shirt 92k

Meta

  • ? bad id 1.4M
  • ? ↳ bad pixiv id 1.1M
  • ? highres 7.5M
  • ? translation request 781k
  • ? ↳ check translation 42k
  • ? ↳ partially translated 22k

Information

  • ID: 2564084
  • Uploader: Jarlath »
  • Date: over 9 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 (rikei ga koi ni ochita no de shoumeishitemita) drawn by yamamoto_arifred
  • ‹ prev Search: map next ›
  • « ‹ prev Pool: Original - Science Tried to Prove We'd Fallen in Love (Yamamoto Arifred) next › »
  • Comments
  • There are no comments.

    Leave a comment

    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 /