404NotFound</p></article>
<div class="s_gray tc"><script>tips('南潇谢承宇');</script></div>
</section>
<div class="read_nav">
<a id="prev_url" href="/101/101920/201897890.html"><i class="fa fa-backward"></i> 上一章</a>
<a id="info_url" href="/101/101920/">书页/目录</a>
<a id="next_url" href="/101/101920/201897900.html">下一章 <i class="fa fa-forward"></i></a>
</div>
</main></div>
<script>
lastread.set('/101/101920/','/101/101920/201897895.html','南潇谢承宇','第2233章','温顺小娇妻，离婚后一身反骨','https://img.x545xs.com/20/20384/20384s.jpg');
document.onkeydown = () => {
if (event.keyCode == 37) window.location = document.querySelector('#prev_url').attributes.href.value;
if (event.keyCode == 39) window.location = document.querySelector('#next_url').attributes.href.value;
if (event.keyCode == 13) window.location = document.querySelector('#info_url').attributes.href.value;
}
function report() {
if($.cookie('report')){
alert('请不要过于频繁,30秒可操作一次');
return false;
} else {
let date = new Date();
date.setTime(date.getTime() + (parseInt(30) * 1000)); //n秒一次.
$.cookie('report', true, {expires: date, path: '/'})
$.ajax({
type: "post",
url: "/api/report.php?do=report",
data: {
content: '报错',
articleid: '101920',
chapterid: '201897895',
articlename: '南潇谢承宇',
chaptername: '第2233章',
repurl: window.location.href
},
success: function(state) {
state == '200' ? alert('成功！\n我们会尽快处理！\n感谢您对本站的支持') : alert('失败！\n请联系网站管理员');
}
});
}
}
</script>
<!-- footer -->
<div id="footer">
<footer class="container">
<p><i class="fa fa-flag"></i> <a href="/">新558小说网</a> 书友最值得收藏的网络小说阅读网</p>
<p><a href="javascript:zh_tran('s');" class="zh_click" id="zh_click_s">简体版</a> · <a href="javascript:zh_tran('t');" class="zh_click" id="zh_click_t">繁體版</a></p>
</footer>
</div>
<script>setEcho();</script>
<script>
!function(p){"use strict";!function(t){var s=window,e=document,i=p,c="".concat("https:"===e.location.protocol?"https://":"http://","sdk.51.la/js-sdk-pro.min.js"),n=e.createElement("script"),r=e.getElementsByTagName("script")[0];n.type="text/javascript",n.setAttribute("charset","UTF-8"),n.async=!0,n.src=c,n.id="LA_COLLECT",i.d=n;var o=function(){s.LA.ids.push(i)};s.LA?s.LA.ids&&o():(s.LA=p,s.LA.ids=[],o()),r.parentNode.insertBefore(n,r)}()}({id:"KbiIifvSX0cltloH",ck:"KbiIifvSX0cltloH"});
</script></body></html><script src="/static/shipsay/style.js"></script>