BNU OJ 50997 BQG's Programming Contest

【BNU OJ 50997 BQG's Programming Contest】的更多相关文章

BNU OJ 50997 BQG's Programming Contest

#include<cstdio> #include<cstring> #include<cmath> #include<algorithm> using namespace std; int ans; int T; int a,b; int main() { scanf("%d",&T); while(T--) { scanf("%d%d",&a,&b); ans=max(a,b)*; ) an…

BNU OJ 51005 BQG's Quadrilateral Bricks

#include<cstdio> #include<cstring> #include<cmath> #include<vector> #include<algorithm> using namespace std; int main() { int T; scanf("%d",&T); while(T--) { int x; ;i<=;i++) scanf("%d",&x); pri…

BNU OJ 51000 BQG's Random String

#include<cstdio> #include<cstring> #include<algorithm> using namespace std; +; char s[maxn]; int main() { int T; scanf("%d",&T); while(T--) { scanf("%s",s); int len=strlen(s); ; ;s[i];i++) { <len&&i+<…

BNU OJ 51003 BQG's Confusing Sequence

二进制++高精度取模 #include<cstdio> #include<cstring> #include<algorithm> using namespace std; ; long long a[maxn]; long long sumA[maxn]; int aa,bb; int len; long long n; int Base[maxn]; int tot; int ans[maxn]; void init1() { memset(sumA,,sizeof…

BNU OJ 50999 BQG's Approaching Deadline

#include<cstdio> #include<algorithm> using namespace std; +; struct Homework { long long st; long long len; }h[maxn]; int n; bool cmp(const Homework&a,const Homework&b) { return a.st<b.st; } int main() { int T; scanf("%d",…

BNU OJ 50998 BQG's Messy Code

#include <cstdio> #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",&T); while(T--){ _(O); scanf("%d",&O); if(O&_)___(-,-~…

Programming Contest Ranking（题解）

Programming Contest Ranking . 题目描述 Heilongjiang Programming Contest will end successfully! And your task is programming contest ranking. The following rules rankings: 1. A problem is solved when it is accepted by the judges. 2. Teams are ranked accor…