- 博客(6)
- 资源 (22)
- 问答 (2)
- 收藏
- 关注
原创 zcmu1654
#include#include#include#define Max 1005int a[]={6,9,0,5,8,1,9,4,6,3,2,34,67,67,78967,345,454,434,345,12,978,563,34,34,5885,45};char str[Max];int num[Max];int main(){ while(~scanf
2015-10-28 16:22:24 267
原创 1657
#include #include#include#include#define Max 20using namespace std;struct student{ int grade; char name[Max];}s[105];bool compare(const student s1, const student s2){if
2015-10-28 16:17:42 286
原创 zcmu1653
#include #include#includeusing namespace std;int main(){ int a[105],count[105],n,k; while(scanf("%d%d",&n,&k)!=EOF&&n&&k) { memset(count,0,sizeof(count));
2015-10-28 16:14:25 340
原创 zcmu1657
#include #include#include#include#define Max 20using namespace std;struct student{ int grade; char name[Max];}s[105];bool compare(const student s1, const student s2){if
2015-10-28 16:11:03 287
原创 zcmu-1657
#include #include#include#include#define Max 20using namespace std;struct student{ int grade; char name[Max];}s[105];bool compare(const student s1, const student s2){if
2015-10-28 16:08:28 272
原创 线段树hdu1166
#include #includeusing namespace std;int sum[50000*3+10];void build(int L,int R,int rt)//构建线段树{ if(L==R) { scanf("%d",&sum[rt]); return; } else {
2015-10-20 20:19:05 233
Depends.rar
2020-03-14
Dbgview.exe
2020-03-14
Procmon.exe
2020-03-14
procexp.exe
2020-03-14
Office UI设置RibbonX
2019-01-15
plsql 32+64位破解版
2018-03-09
SpringMVC所需要的jar包
2017-07-21
为什么这个程序会Time Limit Exceeded——题目是hdu1754
2015-10-21
TA创建的收藏夹 TA关注的收藏夹
TA关注的人