【AIM Tech Round 5 (rated, Div. 1 + Div. 2) B】Unnatural Conditions
2018-08-28 08:11
399 查看
【链接】 我是链接,点我呀:)
【题意】
在这里输入题意
【题解】
让a+b的和为100000000...0这样的形式就好了
这样s(a+b)=1<=m就肯定成立了(m>=1)
然后至于s(a)>=n和s(b)>=n
随便写个a=1111111...112然后b=8888888...888这样就好
【代码】
#include <bits/stdc++.h> #define LL long long #define rep1(i,a,b) for (int i = a;i <= b;i++) #define rep2(i,a,b) for (int i = a;i >= b;i--) #define all(x) x.begin(),x.end() #define pb push_back #define lson l,mid,rt<<1 #define ri(x) scanf("%d",&x) #define rl(x) scanf("%lld",&x) #define rs(x) scanf("%s",x) #define rson mid+1,r,rt<<1|1 using namespace std; const double pi = acos(-1); const int dx[4] = {0,0,1,-1}; const int dy[4] = {1,-1,0,0}; const int N = 200; char s[N+10][N+10]; int n,m; int main(){ #ifdef LOCAL_DEFINE freopen("rush_in.txt", "r", stdin); #endif rep1(i,1,2000) cout<<8;cout<<endl; rep1(i,1,1999) cout<<1;cout<<2<<endl; return 0; }
相关文章推荐
- 【AIM Tech Round 5 (rated, Div. 1 + Div. 2) A】 Find Square
- 【AIM Tech Round 5 (rated, Div. 1 + Div. 2) 总结】【题解往前或往后翻,不在这】
- AIM Tech Round 3 (Div. 2) A B C D
- 【Codeforces AIM Tech Round 4 (Div. 2) C】
- AIM Tech Round 3 (Div. 2) -- B. Checkpoints (枚举)
- 【AIM Tech Round 5 (Div. 1 + Div. 2) 】
- AIM Tech Round 3 (Div. 2)
- AIM Tech Round 3 (Div. 1)-C. Centroids
- Codeforces AIM Tech Round (Div. 1) A Graph and String 想法
- AIM Tech Round 3 (Div. 2) C(贪心)
- AIM Tech Round 4 (Div. 2) B. Rectangles
- AIM Tech Round 4 (Div. 2)
- 【AIM Tech Round 4 (Div. 1) B】Interactive LowerBound
- AIM Tech Round (Div. 1) B. Array GCD(数论+dp)
- CodeForces AIM Tech Round 3 (Div. 2) D
- AIM Tech Round 4 (Div. 2) C. Sorting by Subsequences
- AIM Tech Round 3 (Div. 2) E. Centroids (树形dp)
- AIM Tech Round 4 (Div. 2) D. Interactive LowerBound
- AIM Tech Round 3 (Div. 2) B. Checkpoints 排序、讨论
- AIM Tech Round 4 (Div. 2)