2019-04-14 16:51发布 生成海报
// 介于[-mod, 0)的最大模mod同余整数 template T toNegative(T x, T mod) { x = ((x % mod) - mod) % mod; return x ? x : -mod; }
{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1515056452',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://www.xiaopingtou.cn//data/attach/topic/topicKPo7gB.jpg', '推荐 rudyangels 的文章《【ICPC模板】得到[-mod, 0)之间最大同余整数》','https://www.xiaopingtou.net/article-56833.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}