2015 Multi-University Training Contest 5
#include <iostream> //1002
#include<set>
#include<stdio.h>
using namespace std;
const int maxn=500000+10;
typedef long long ll;
int a[maxn];
int main()
{
int n,z,l;
ll m;
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d%lld%d%d",&n,&m,&z,&l);
a[1]=0;
for(int i=2;i<=n;i++)
a[i]=(a[i-1]*m+z)%l;
// for(int i=1;i<=n;i++)
// cout<<a[i]<<" ";
ll ans=0;
for(int i=1;i<=n;i++)
ans^=2*a[i];
printf("%lld\n",ans);
}
return 0;
}
#include <iostream>//1005
#include <stdio.h>
using namespace std; int main()
{
int T,a,b;
int s[90]={0,1312,2372,520,932,800,1086,1402,1313,1681,2080,495,737,577,786,1011,999,1251,1520};
s[35]=1139;
s[36]=1350;
s[53]=1008;
s[54]=1170;
s[85]=920;
s[86]=1037;
while(scanf("%d%d",&a,&b)!=EOF)
{ printf(s[a]>s[b]?"FIRST BIGGER\n":"SECOND BIGGER\n");
}
return 0;
}
#include <iostream> //1007
#include<set>
#include<stdio.h>
using namespace std;
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
multiset<int>que;
multiset<int>::iterator it;
for(int i=1;i<=n;i++)
{
int a;
scanf("%d",&a);
if(a==1)
{
int b;
scanf("%d",&b);
que.insert(b);
}
if(a==2)
{
//int b;
// scanf("%d",&b);
if(!que.empty())
it=que.begin(),que.erase(*it);
}
if(a==3)
{
if(que.empty())
printf("0\n");
else
{
it=que.end();
it--;
printf("%d\n",(*it));
// cout<<*it<<endl;
}
}
}
}
return 0;
}
趁卡题来一发水题题解1002,1007队友写的,三道题都是水题
2015 Multi-University Training Contest 5的更多相关文章
- 2015 Multi-University Training Contest 8 hdu 5390 tree
tree Time Limit: 8000ms Memory Limit: 262144KB This problem will be judged on HDU. Original ID: 5390 ...
- 2015 UESTC Winter Training #8【The 2011 Rocky Mountain Regional Contest】
2015 UESTC Winter Training #8 The 2011 Rocky Mountain Regional Contest Regionals 2011 >> North ...
- 2015 UESTC Winter Training #7【2010-2011 Petrozavodsk Winter Training Camp, Saratov State U Contest】
2015 UESTC Winter Training #7 2010-2011 Petrozavodsk Winter Training Camp, Saratov State U Contest 据 ...
- Root(hdu5777+扩展欧几里得+原根)2015 Multi-University Training Contest 7
Root Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Su ...
- 2015 Multi-University Training Contest 6 solutions BY ZJU(部分解题报告)
官方解题报告:http://bestcoder.hdu.edu.cn/blog/2015-multi-university-training-contest-6-solutions-by-zju/ 表 ...
- HDU 5360 Hiking(优先队列)2015 Multi-University Training Contest 6
Hiking Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total S ...
- hdu 5288 OO’s Sequence(2015 Multi-University Training Contest 1)
OO's Sequence Time Limit: 4000/2000 MS (Jav ...
- HDU5294 Tricks Device(最大流+SPFA) 2015 Multi-University Training Contest 1
Tricks Device Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) To ...
- hdu 5416 CRB and Tree(2015 Multi-University Training Contest 10)
CRB and Tree Time Limit: 8000/4000 MS (J ...
- 2015多校联合训练赛 hdu 5308 I Wanna Become A 24-Point Master 2015 Multi-University Training Contest 2 构造题
I Wanna Become A 24-Point Master Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 ...
随机推荐
- elasticsearch 性能优化
#系统默认的最大打开文件数的限制 vi /etc/security/limits.conf * - nproc 50240 * - ...
- wildcard 处理全部文件
Makefile如果想取得文件夹下全部文件 $(wildcard $(PATH)/*.c) 即可
- 整整68页学习C++的文章
有空看看,有不少好东西: http://dev.21tx.com/language/c/index.shtml
- Perl ping
<pre name="code" class="html">use Net::Ping; $p = Net::Ping->new(" ...
- Primary key and Unique index
SQL> create table t1(id1 char(2),id2 char(2),id3 char(2)); Table created. SQL> desc t1 Name Nu ...
- C++ Primer 随笔 Chapter 9 顺序容器
参考:http://www.cnblogs.com/kurtwang/archive/2010/08/19/1802912.html 1..顺序容器:vector(快速随机访问):list(快速插入 ...
- The fundamental knowledge of Node JS.
D3 JSJava scirpt is an awesome language for Internface Design.All Obejcts in JavaScirpt could be use ...
- ♫【JS模式】偏函数
<深入浅出Node.js> var toString = Object.prototype.toString var isType = function(type) { return fu ...
- HDU 5501 背包问题
需要按照B/C的值从大到小排序. #include<cstdio> #include<cstring> #include<iostream> #include< ...
- (转载)mysql 用drop和delete方法删除用户的区别
(转载)http://hi.baidu.com/yymagento/item/56c3f6184bce8347e75e06db 在学习drop方法删除用户时,按照书上讲的一直没操作成功,后来到网上查了 ...