codeforces gym101243 A C D E F G H J
A
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<bitset>
#include<set>
#define ll __int64
#define mod 100000000
#define N 5e6+10
#define M 1e
using namespace std;
int n,k;
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
scanf("%d %d",&n,&k);
printf("%d\n",max((n*+k-)/k,)); return ;
}
C
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<bitset>
#include<set>
#define ll __int64
#define mod 100000000
#define N 5e6+10
#define M 1e
using namespace std;
int h,w;
int x[],y[];
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
int exm=;
scanf("%d %d",&h,&w);
if(h<=||w<=)
{
printf("0\n");
return ;
}
if(h%==){
for(int i=h-;i>=;i-=){
for(int j=;j<w;j++){
x[exm]=i;
y[exm]=j;
exm++;
}
if(i!=){
x[exm]=i-;
y[exm]=w-;
exm++;
}
}
}
else{
for(int i=h-;i>=;i-=){
for(int j=;j<w;j++){
x[exm]=i;
y[exm]=j;
exm++;
}
x[exm]=i-;
y[exm]=w-;
exm++;
}
for(int j=;j<w;j+=){
if(j!=w-){
x[exm]=;
y[exm]=j;
exm++;
x[exm]=;
y[exm]=j;
exm++;
x[exm]=;
y[exm]=j+;
exm++;
}
else{
x[exm]=;
y[exm]=j;
exm++;
x[exm]=;
y[exm]=j;
exm++;
}
}
}
printf("%d\n",exm);
for(int i=;i<exm;i++)
printf("%d %d\n",x[i],y[i]);
return ;
}
D
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<set>
using namespace std;
#define PI acos(-1.0)
typedef long long ll;
typedef pair<int,int> P;
const int maxn=1e4+,maxm=1e5+,inf=0x3f3f3f3f,mod=1e9+;
const ll INF=1e13+;
struct edge
{
int from,to;
int cost;
};
edge es[maxm];
priority_queue<P,vector<P>,greater<P> >que;
char s[];
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
cin>>s;
int n=strlen(s);
int ans=;
for(int i=;i<n;i++)
{
if(s[i]=='E'&&(s[i-]=='N'||s[i-]=='S')) ans=(ans*)%mod;
else if(s[i]=='W'&&(s[i-]=='N'||s[i-]=='S')) ans=(ans*)%mod;
}
cout<<ans<<endl;
return ;
}
E
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<bitset>
#include<set>
#define ll __int64
#define mod 100000000
#define N 5e6+10
#define M 1e
using namespace std;
ll n,k,a[];
ll sum[];
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
scanf("%I64d %I64d",&n,&k);
sum[]=;
ll maxn=;
int pos;
for(ll i=; i<=n; i++)
{
scanf("%I64d",&a[i]);
sum[i]=sum[i-]+a[i];
if(maxn<a[i])
{
pos=i;
maxn=a[i];
}
}
ll l,r;
ll ans1,ans2;
l=n-+maxn;
r=sum[n];
ans1=max(0ll,k-pos+)/l;
ans2=max(0ll,k-sum[pos-])/r;
for(ll i=; i<=ans1; i++)
if(k>=(pos-+l*i)&&k<=(sum[pos-]+r*i))
{
printf("YES\n");
return ;
}
printf("KEK\n");
return ;
}
F
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#include<vector>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
const int maxn=1e3+,maxm=1e6+,inf=0x3f3f3f3f,mod=1e9+;
const ll INF=1e13+;
struct edge
{
int from,to;
char ch;
};
edge es[maxm];
int pa[maxn];
int findset(int x)
{
return pa[x]==x?x:pa[x]=findset(pa[x]);
}
void unit(int x,int y)
{
int fx=findset(x),fy=findset(y);
if(fx<=fy) pa[fx]=fy;
else pa[fy]=fx;
}
int in[maxn],out[maxn];
int ans[maxn];
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
int n,k;
scanf("%d%d",&n,&k);
for(int i=; i<=n; i++) pa[i]=i;
memset(out,,sizeof(out));
memset(in,,sizeof(in));
for(int i=; i<=k; i++)
{
scanf("%d%c%d",&es[i].from,&es[i].ch,&es[i].to);
if(es[i].ch=='=') unit(es[i].from,es[i].to);
else
{
if(es[i].ch=='>') swap(es[i].from,es[i].to);
es[i].ch='<';
}
}
for(int i=; i<=k; i++)
{
if(es[i].ch=='=') continue;
out[findset(es[i].from)]++,in[findset(es[i].to)]++;
}
for(int i=; i<=n; i++)
if(in[i]&&out[i]) ans[i]=;
for(int i=; i<=k; i++)
{
if(es[i].ch=='=') continue;
if(ans[findset(es[i].from)]==) ans[findset(es[i].to)]=;
else if(ans[findset(es[i].to)]==) ans[findset(es[i].from)]=;
}
for(int i=; i<=n; i++)
{
if(ans[findset(i)]==) cout<<"B";
else if(ans[findset(i)]==) cout<<"R";
else if(ans[findset(i)]==) cout<<"W";
else cout<<"?";
}
cout<<endl;
return ;
}
G
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<bitset>
#include<set>
#define ll __int64
#define mod 100000000
#define N 5e6+10
#define M 1e
using namespace std;
int n;
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
scanf("%d",&n);
int que[];
int jishu=;
for(int i=;i*i<=n;i++)
{
if(n%i==)
{
int flag=;
que[jishu++]=i;
while(n%i==)
{
flag++;
n/=i;
if(flag>)
{
printf("NO\n");
return ;
}
}
}
}
if(n>)
que[jishu++]=n;
if(jishu==)
printf("YES\n");
else
printf("NO\n");
return ;
}
H
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<bitset>
#include<set>
#define ll __int64
#define mod 100000000
#define N 5e6+10
#define M 1e
using namespace std;
int n;
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
scanf("%d",&n);
if(n<)
{
ll ans=;
for(int i=;i<=n;i++)
ans*=;
printf("%I64d\n",ans);
}
else
{
ll ans=;
for(int i=;i<=;i++)
ans*=;
printf("%I64d",ans);
for(int i=;i<=n;i++)
printf("");
printf("\n");
}
return ;
}
J
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#include<vector>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
const int maxn=1e3+,maxm=1e6+,inf=0x3f3f3f3f,mod=1e9+;
const ll INF=1e13+;
struct edge
{
int from,to;
char ch;
};
edge es[maxm];
char num[maxn][];
vector<int>G[maxn];
int cy[maxn],vis[maxn];
bool dfs(int u)
{
for(int i=; i<G[u].size(); i++)
{
int v=G[u][i];
if(vis[v]) continue;
vis[v]=true;
if(cy[v]==-||dfs(cy[v]))
{
cy[v]=u;
return true;
}
}
return false;
}
int solve(int n)
{
int ret=;
memset(cy,-,sizeof(cy));
for(int i=; i<=n; i++)
{
memset(vis,,sizeof(vis));
if(dfs(i)) ret++;
}
return ret;
}
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
int n,m;
scanf("%d%d",&n,&m);
for(int i=; i<=n; i++) scanf("%s",num[i]);
for(int i=; i<=m; i++) scanf("%s",num[i+n]);
for(int i=; i<=n; i++)
{
for(int j=; j<=m; j++)
{
if(num[i][]+num[i][]+num[i][]==num[j+n][]+num[j+n][]+num[j+n][])
G[i].push_back(j+n);
if(num[i][]+num[i][]+num[i][]==num[j+n][]+num[j+n][]+num[j+n][])
G[i].push_back(j+n);
}
}
cout<<solve(n)<<endl;
for(int i=n+; i<=n+m; i++)
{
if(cy[i]==-)continue;
if(num[cy[i]][]+num[cy[i]][]+num[cy[i]][]==num[i][]+num[i][]+num[i][])
cout<<"AT"<<" "<<num[cy[i]]<<" "<<num[i]<<endl;
else if(num[i][]+num[i][]+num[i][]==num[cy[i]][]+num[cy[i]][]+num[cy[i]][])
cout<<"TA"<<" "<<num[i]<<" "<<num[cy[i]]<<endl;
}
return ;
}
codeforces gym101243 A C D E F G H J的更多相关文章
- 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest A E F G H I K M
// 深夜补水题,清早(雾)写水文 A. Automatic Door 题意 \(n(n\leq 1e9)\)个\(employee\)和\(m(m\leq 1e5)\)个\(client\)要进门, ...
- codeforces gym 100952 A B C D E F G H I J
gym 100952 A #include <iostream> #include<cstdio> #include<cmath> #include<cstr ...
- Codeforces 1214 F G H 补题记录
翻开以前打的 #583,水平不够场上只过了五题.最近来补一下题,来记录我sb的调试过程. 估计我这个水平现场也过不了,因为前面的题已经zz调了好久-- F:就是给你环上一些点,两两配对求距离最小值. ...
- Gym 101606 - A/B/C/D/E/F/G/H/I/J/K/L - (Undone)
链接:https://codeforces.com/gym/101606 A - Alien Sunset 暴力枚举小时即可. #include<bits/stdc++.h> using ...
- The 16th Zhejiang Provincial Collegiate Programming Contest Sponsored(E F G H I)
http://acm.zju.edu.cn/onlinejudge/showContestProblems.do?contestId=392 E:Sequence in the Pocket 思路:从 ...
- Codeforces Round #541 (Div. 2) (A~F)
目录 Codeforces 1131 A.Sea Battle B.Draw! C.Birthday D.Gourmet choice(拓扑排序) E.String Multiplication(思路 ...
- Educational Codeforces Round 39 (Rated for Div. 2) G
Educational Codeforces Round 39 (Rated for Div. 2) G 题意: 给一个序列\(a_i(1 <= a_i <= 10^{9}),2 < ...
- AtCoder Beginner Contest 220部分题(G,H)题解
刚开始的时候被E题卡住了,不过发现是个数学题后就开始使劲推式子,幸运的是推出来了,之后的F题更是树形DP换根的模板吧,就草草的过了,看了一眼G,随便口胡了一下,赶紧打代码,毕竟时间不多了,最后也没打完 ...
- //给定N个整数序列｛A1,A2,A3...An｝,求函数f（i,j）=（k=i~j）Ak的求和
//给定N个整数序列{A1,A2,A3...An},求函数f(i,j)=(k=i~j)Ak的求和 # include<stdio.h> void main() { ,sum1; ]={,- ...
随机推荐
- 基于腾讯云CLB实现K8S v1.10.1集群高可用+负载均衡
概述: 最近对K8S非常感兴趣,同时对容器的管理等方面非常出色,是一款非常开源,强大的容器管理方案,最后经过1个月的本地实验,最终决定在腾讯云平台搭建属于我们的K8S集群管理平台~ 采购之后已经在本地 ...
- 面向对象编程（OOP）思想小结
Concepts 类(class):对我们要解决问题的抽象,比如建造房子的蓝图:但实现机制上来讲,类是根据蓝图构建而成的,存储在内存中的,用来表示对象的数据. 对象(object):根据类构建的实体, ...
- Paper Reading - Mind’s Eye: A Recurrent Visual Representation for Image Caption Generation ( CVPR 2015 )
Link of the Paper: https://ieeexplore.ieee.org/document/7298856/ A Correlative Paper: Learning a Rec ...
- tcp三次握手 四次挥手 （转）
转自: http://blog.csdn.net/whuslei/article/details/6667471 建立TCP需要三次握手才能建立,而断开连接则需要四次握手.整个过程如下图所示: 先来看 ...
- Bracket Sequences Concatenation Problem括号序列拼接问题（栈+map+思维）
A bracket(括号) sequence is a string containing only characters "(" and ")".A regu ...
- 王者荣耀交流协会--第3次Scrum会议
Scrum master:王玉玲 要求1:工作照片 要求2:时间跨度:2017年10月15号 6:00--6:24 共计24min要求3:地点:传媒西楼204,会议室要求4:立会内容:1.从昨日会 ...
- 第三周pspo过程文档
团队协作: 日期/任务 听课 编写程序 阅读相关书籍 日总计 周一 110 60 ...
- OOP 1.1 引用
1.1 引用 1.语法:类型名&引用名=某变量名 e.g. int &b=a; 定义:引用则等价这个变量 引用名的类型是:类型 & 注意事项: ①定义引用时,一定要将其初始化成 ...
- 线段树---poj3468 A Simple Problem with Integers:成段增减:区间求和
poj3468 A Simple Problem with Integers 题意:O(-1) 思路:O(-1) 线段树功能:update:成段增减 query:区间求和 Sample Input 1 ...
- Codeforces Round #335 (Div. 2) D. Lazy Student 贪心+构造
题目链接: http://codeforces.com/contest/606/problem/D D. Lazy Student time limit per test2 secondsmemory ...