套题记录
辞树 LingTree
这个作者很懒,什么都没留下…
展开
-
华为研发工程师编程题
import math while 1: n = int(input()) if n == 0: break cnt = 0 num = n left = 0 while (num > 0): if num == 1: print(cnt) break if num == 2: print(cnt + 1) ...原创 2022-03-31 22:48:06 · 243 阅读 · 0 评论 -
腾讯2017暑期实习生编程题
1/3[编程题]构造回文(LCS)时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 32M,其他语言64M给定一个字符串s,你可以从中删除一些字符,使得剩下的串是一个回文串。如何删除才能使得回文串最长呢?输出需要删除的字符个数。输入描述:输入数据有多组,每组包含一个字符串s,且保证:1<=s.length<=1000.输出描述:对于每组数据,输出一个整数,代表最少需要删除的字符个数。输入例子1:abcdagoogl.原创 2022-03-23 17:17:22 · 880 阅读 · 0 评论 -
码力恢复——51NOD基础篇
1000 A + B#include<bits/stdc++.h>using namespace std;#define clr(a) memset(a, 0, sizeof(a))#define line cout << "--------" << endltypedef long long ll;const int maxn = 1e5 + 10;int main(){ ll a, b; cin >> a >原创 2021-02-28 21:02:50 · 402 阅读 · 0 评论 -
哔哩哔哩 2019秋招编程题合集
1/14 [编程题]扭蛋机#include<bits/stdc++.h>using namespace std;#define line cout << "-----------" << endl; typedef long long ll;const int maxn = 2e5 + 10;const int MAXN = 1e6 + 10;...原创 2020-01-01 20:10:09 · 459 阅读 · 0 评论 -
华为2016校园招聘上机笔试题
1/3 [编程题]最高分是多少[编程题]最高分是多少时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 64M,其他语言128M老师想知道从某某同学当中,分数最高的是多少,现在请你编程模拟老师的询问。当然,老师有时候需要更新某位同学的成绩.输入描述:输入包括多组测试数据。每组输入第一行是两个正整数N和M(0 < N <= 30000,0 &l...原创 2019-12-26 11:59:47 · 314 阅读 · 0 评论 -
牛客国庆集训派对Day1(A、C、E、L)
A Tobaku Mokushiroku Kaiji#pragma GCC optimize(2)#include <bits/stdc++.h>using namespace std;#define clr(a) memset(a,0,sizeof(a))#define line cout<<"-----------------"<<endl;...原创 2018-10-01 21:14:50 · 348 阅读 · 0 评论 -
2019 蓝桥杯省赛 B 组模拟赛(一)(Java)
结果填空:钟表手动算一下class Main { public static void main(String[] args) { System.out.println("07:55:41"); }}结果填空:青蛙爬井简单的模拟class Main { public static void main(String[] args) {...原创 2019-03-14 18:18:51 · 478 阅读 · 0 评论 -
第九届河南理工大学算法程序设计大赛
一边监考一边写了几个题。一队出的题目挺好的。总的来说,题目不难,但是坑点比较多,细心点才能做好。A. Asia区域赛签到题:#include<bits/stdc++.h>using namespace std;#define clr(a) memset(a, 0, sizeof(a))#define line cout<<"--------------"...原创 2019-03-31 21:09:52 · 428 阅读 · 0 评论 -
ACM 2019浙江省赛(BCEFGHIJK)
B - Element Swapping#include<bits/stdc++.h>#define ll long long#define inf 0x3f3f3f3f3f3f3f3fLL#define rep(i,a,b) for(register int i=(a);i<=(b);i++)#define dep(i,a,b) for(register int ...原创 2019-04-28 11:20:56 · 565 阅读 · 0 评论 -
2017CCPC秦皇岛(C、E、L、M)
C - Crusaders Quest#include<bits/stdc++.h>using namespace std;#define clr(a) memset(a, 0, sizeof(a))#define line cout<<"-------------"<<endltypedef long long ll;const int ma...原创 2018-09-25 10:10:24 · 571 阅读 · 0 评论 -
ACM-ICPC 2018 焦作赛区网络预赛(A、J、I、L)
A#include<bits/stdc++.h>using namespace std;const int maxn = 1e5 + 10;char s[maxn];char str[10] = "jessie";int main(){ int t; scanf("%d", &t); while(t--){ scan...原创 2018-09-17 08:26:58 · 229 阅读 · 0 评论 -
The 2018 ACM-ICPC Asia Qingdao Regional Contest, Online(ACHJK)
A#include<bits/stdc++.h>using namespace std;#define clr(a) memset(a,0,sizeof(a))#define line cout << "-------------"<<endltypedef long long ll;const int maxn = 1e5 + 10;cons...原创 2018-09-16 17:11:52 · 713 阅读 · 0 评论 -
ACM-ICPC 2018 徐州赛区网络预赛(F、G、H、I)
F. Features Track(哈希算法)#include<bits/stdc++.h>using namespace std;#define clr(a) memset(a,0,sizeof(a))#define line cout<<"-------------"<<endltypedef long long ll;const int...原创 2018-09-10 10:07:51 · 194 阅读 · 0 评论 -
ACM-ICPC 2018 南京赛区网络预赛(A.B.E.G.J.L)
A. An Olympian Math Problem遇事不决先打表,然后发现规律,#pragma GCC optimize(2)#include <bits/stdc++.h>using namespace std;#define clr(a) memset(a,0,sizeof(a))#define line cout<<"--------------...原创 2018-09-01 18:35:45 · 933 阅读 · 0 评论 -
Codeforces Round #556 (Div. 2)(A.B.C)
A. Stock Arbitraging买入时找最小,卖出时找最大。如果买入的价格 > 卖出的价格,则根本就不买#include<bits/stdc++.h>using namespace std;#define line cout<<"--------"<<endltypedef long long ll;const int ma...原创 2019-05-01 00:03:46 · 100 阅读 · 0 评论 -
Gym - 102152
B - Memory Management System#include<bits/stdc++.h>using namespace std;struct nomd{ int x,y,c;}a[100006],b[100006],c[100006];int cmp(nomd a,nomd b){ return a.x<b.x;}int main()...原创 2019-05-01 20:15:48 · 667 阅读 · 0 评论 -
“卓见杯”第五届CCPC中国大学生程序设计竞赛河南省赛-网络模拟赛 郑州轻工业大学校赛
Problem A Mex Query签到题#include <bits/stdc++.h>using namespace std;#define clr(a) memset(a, 0, sizeof(a))#define line cout<<"------------"<<endl typedef long long ll;const ...原创 2019-04-11 22:47:55 · 669 阅读 · 0 评论 -
Codeforces 补题 round 3 contest 990
A. Commentary Boxes#include<bits/stdc++.h>using namespace std;#define clr(a) memset(a,0,sizeof(a))#define ll long longconst int maxn = 1e6+10;const int mod = 2008;const int N = 3010;...原创 2018-08-13 21:33:17 · 166 阅读 · 0 评论 -
Codeforces 补题 round 2 contest 915
A. Garden思路:模拟#include<bits/stdc++.h>using namespace std;#define LL long long#define clr(a) memset(a,0,sizeof(a))const int MAXN = 1e5+10;const int INF = 0x3f3f3f3f;const int N = 101;...原创 2018-08-11 08:50:26 · 116 阅读 · 0 评论 -
Codeforces 补题 round 1 contest 797
A. k-Factorization质因子分解,统计一下即可。#include<bits/stdc++.h>using namespace std;#define LL long long#define clr(a) memset(a,0,sizeof(a))const LL MAXN = 1e5+10;const LL INF = 0x3f3f3f3f;LL...原创 2018-08-07 22:02:50 · 197 阅读 · 0 评论 -
Codeforces 1025 - B. Weakened Common Divisor(质因数分解)
B. Weakened Common Divisortime limit per test1.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDuring the research on properties of the greatest co...原创 2018-08-20 01:55:28 · 667 阅读 · 0 评论 -
Codeforces 补题 round 5 contest - 766
A - Mahmoud and Longest Uncommon Subsequence#include<bits/stdc++.h>using namespace std;#define clr(a) memset(a,0,sizeof(a))#define line cout<<"-----------"<<endltypedef long ...原创 2018-08-17 11:36:43 · 168 阅读 · 0 评论 -
Codeforces Round #504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final)
A. Single Wildcard Pattern Matching(思维)#include <bits/stdc++.h>using namespace std;#define clr(a) memset(a,0,sizeof(a))#define line cout<<"-----------------"<<endl;typedef lo...原创 2018-08-27 21:01:47 · 133 阅读 · 0 评论 -
Codeforces 1023 D - Array Restoration(线段树/思维)
D. Array Restorationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputInitially there was an array aa consisting of nn integers. Po...原创 2018-08-28 00:03:44 · 231 阅读 · 0 评论 -
Manthan, Codefest 18 (rated, Div. 1 + Div. 2) A、B、C、D
A. Packets(二进制长度)和以前写过的一个找零钱的题一样。求n的二进制长度即可。 #pragma GCC optimize(2)#include<bits/stdc++.h>using namespace std;#define clr(a) memset(a,0,sizeof(a))#define rep(i,x,y) for(int i = x; i &...原创 2018-09-03 00:28:59 · 3831 阅读 · 0 评论 -
Educational Codeforces Round 50 (Rated for Div. 2) (A,B,C,D)
A. Function Height#pragma GCC optimize(2)#include<bits/stdc++.h>using namespace std;#define clr(a) memset(a,0,sizeof(a))#define rep(i,x,y) for(int i = x; i < y; i++)#define Rep(i,x,y)...原创 2018-09-08 15:20:57 · 186 阅读 · 0 评论 -
Codeforces Round #509 (Div. 2) (A.B.C)
A. Heist#pragma GCC optimize(2)#include <bits/stdc++.h>using namespace std;#define clr(a) memset(a, 0, sizeof(a))#define line cout<<"-----------------"<<endl;typedef long lo...原创 2018-09-17 10:52:04 · 143 阅读 · 0 评论 -
Educational Codeforces Round 51 (Rated for Div. 2)(A、B、C、D)
A#include<bits/stdc++.h>using namespace std;#define clr(a) memset(a,0,sizeof(a))#define line cout<<"-----------"<<endltypedef long long ll;const int maxn = 1e5+10;const int...原创 2018-09-21 00:08:54 · 148 阅读 · 0 评论 -
Codeforces Round #515 (Div. 3) (A、B、C、D、E)
A#include<bits/stdc++.h>using namespace std;#define clr(a) memset(a,0,sizeof(a))#define line cout<<"-------------"<<endltypedef long long ll;const int maxn = 1e5 + 10;const...原创 2018-10-13 15:59:07 · 141 阅读 · 0 评论 -
Codeforces Round #516 (Div. 2, by Moscow Team Olympiad)(A、B、C、D)
A#include<bits/stdc++.h>using namespace std;int main(){ int a[3]; cin >> a[0] >> a[1] >> a[2]; sort(a, a+3); int b = a[0] + a[1]; int ans = 0; if(...原创 2018-10-17 11:33:38 · 157 阅读 · 0 评论 -
2017 浙江省省赛 (A、B、C、D)
A.Cooking Competition签到题#pragma GCC optimize(2)#include <bits/stdc++.h>using namespace std;#define clr(a) memset(a,0,sizeof(a))#define line cout<<"-----------------"<<endl;...原创 2018-10-22 21:50:55 · 641 阅读 · 0 评论 -
Codeforces 补题 round 4 contest - 978
A - Remove Duplicates #include <bits/stdc++.h>using namespace std;#define ll long long#define clr(a) memset(a,0,sizeof(a))const int N = 1010;int a[N];int vis[N];int b[N];int num;int ...原创 2018-08-15 09:25:54 · 114 阅读 · 0 评论