摘要：
模拟#include#include#include#include#includeusing namespace std;const int maxn=100+10;char t1[maxn],t2[maxn];int g1,g2,h1,h2;int main(){ int T; sc... 阅读全文
posted @ 2015-12-26 11:31
Fighting_Heart
阅读(182)
评论(0)
推荐(0)
摘要：
#include#include#include#include#includeusing namespace std;int main(){ int T; scanf("%d",&T); while(T--) { int x; for(int i... 阅读全文
posted @ 2015-12-26 11:31
Fighting_Heart
阅读(160)
评论(0)
推荐(0)
摘要：
二进制++高精度取模#include#include#includeusing namespace std;const int maxn=100;long long a[maxn];long long sumA[maxn];int aa,bb;int len;long long n;int Base... 阅读全文
posted @ 2015-12-26 11:29
Fighting_Heart
阅读(158)
评论(0)
推荐(0)
摘要：
#include#include#includeusing namespace std;const int maxn=10000+10;char s[maxn];int main(){ int T; scanf("%d",&T); while(T--) { sc... 阅读全文
posted @ 2015-12-26 11:29
Fighting_Heart
阅读(140)
评论(0)
推荐(0)
摘要：
#include#includeusing namespace std;const int maxn=1000+10;struct Homework{ long long st; long long len;}h[maxn];int n;bool cmp(const Homework&a... 阅读全文
posted @ 2015-12-26 11:28
Fighting_Heart
阅读(193)
评论(0)
推荐(0)
摘要：
#include #define _(l) int l#define ___(l,L) for (_(o)=0,x=l o*2;o<x;o++)O= L o;#define __ _ ( _ )const __=0x80000000;_(main)(){ int T; scanf("%d... 阅读全文
posted @ 2015-12-26 11:27
Fighting_Heart
阅读(135)
评论(0)
推荐(0)
摘要：
#include#include#include#includeusing namespace std;int ans;int T;int a,b;int main(){ scanf("%d",&T); while(T--) { scanf("%d%d",&a,&b)... 阅读全文
posted @ 2015-12-26 11:26
Fighting_Heart
阅读(115)
评论(0)
推荐(0)
浙公网安备 33010602011771号