一只小熊做蹲起-CSDN博客

原创 F - Wooden Sticks

#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>using namespace std;struct haha{ int l,w; int m;}a[222222];bool cmp(haha a,haha b){ if(a.l!=b.l) return a.l<b.l; else return a.w<b.w; }..

2021-04-09 20:20:00 157

原创 I - 今年暑假不AC HDU - 2037

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>#include<stdlib.h>#include <functional>using namespace std;struct ti{ int s,e; }a[2222]; bool cmp(ti a,ti b) { ..

2021-04-09 20:18:56 133

原创 J - Saving HDU HDU - 2111

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>#include<stdlib.h>#include <functional>using namespace std;struct ti{ int m,v; }a[22222]; bool cmp(ti a,ti b) {..

2021-04-09 20:17:37 135

原创 2021-04-09

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>#include<stdlib.h>#include <functional>using namespace std;int a[601]; bool cmp(int a,int b) { return a > b;..

2021-04-09 20:15:13 119

原创 L - 迷瘴 HDU - 2570

#include<cstdio>#include<string>#include<cstring>#include<algorithm>#include<cmath>#include<iostream>using namespace std;int main(){ int c,n,v,w,a[222]; scanf("%d",&c); while(c--) { scanf("%d%d%d..

2021-04-09 20:13:55 81

原创 H - Strange fuction

#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<cmath>using namespace std;double x,y;double fx(double x,double y){ return 6*pow(x,7)+8*pow(x,6)+7*pow(x,3)+5*pow(x,2)-y*x;}double ffx(d.

2021-04-09 20:11:01 63

原创 2021-04-09

#include<cstdio>#include<algorithm>#include<cmath>#include<iostream> using namespace std;int cmp(int a,int b){ return a>b;}int main(){ int n,a[22222],i,j; while(cin>>n) { for(i=0;i<n;i++) { cin&g..

2021-04-09 20:09:52 46

原创 E - Can you solve this equation?

#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;double haha(double x){ return 8*x*x*x*x+7*x*x*x+2*x*x+3*x+6;}int main(){ int t; scanf("%d",&t); double l,r,mid,m; while(t-..

2021-04-09 20:08:44 69

原创 B - Rightmost Digit

#include<cstdio>#include<algorithm>#include<cmath>#include<iostream> using namespace std;int main(){ int n; int t,k=0,i; cin>>t; while(t--) { cin>>n; n=n%20; k=n; for(i=1;i<n;i++) { ..

2021-04-09 20:06:50 59

原创 A - Count on Canton

A - Count on Canton#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;int main(){ int n,i,s,t,x; while(~scanf("%d",&n)) { s=0,t=1,x=0; for(i=1;;i++) { s+=i; if(s>

2021-04-09 20:04:24 88

原创 P1094 [NOIP2007 普及组] 纪念品分组

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>#include<stdlib.h>#include <functional>using namespace std;int main(){ int w,n,i,ans,l,r,a[2200022]; while(cin&gt..

2021-03-18 19:16:42 67

原创 P1208 [USACO1.3]混合牛奶 Mixing Milk

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>#include<stdlib.h>#include <functional>using namespace std;struct haha { int money; int milk;}a[2222222];boo..

2021-03-18 19:15:28 84

原创 P5019 [NOIP2018 提高组] 铺设道路

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>#include<stdlib.h>#include <functional>using namespace std;int a[2222222],n,ans;int main(){ cin>>n; for(in..

2021-03-18 19:14:27 76

原创 P1478 陶陶摘苹果（升级版）

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>#include<stdlib.h>#include <functional>using namespace std;struct haha{ int height; int strength;}tao[22222];..

2021-03-18 19:13:10 81

原创 P3817 小A的糖果

![`#include#include#include#include#include<math.h>#include<stdlib.h>#include using namespace std;int main(){ long long int n,x,i;int a[222222];cin>>n>>x;long long int sum=0;for(i=0;i<n;i++)cin>>a[i];if(a[.

2021-03-18 19:10:35 62

原创 P1223 排队接水

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>#include<stdlib.h>#include <functional>using namespace std;struct haha{ int t; int num;}a[22222];bool cmp(haha .

2021-03-18 19:08:50 57

原创 K - Building designing

K - Building designingAn architect wants to design a very high building. The building will consist of some floors, and eachfloor has a certain size. The size of a floor must be greater than the size of the floor immediatelyabove it. In addition, the des

2021-03-15 19:09:54 104

原创 L - Helpful Maths

L - Helpful MathsXenia the beginner mathematician is a third year student at elementary school. She is now learning the addition operation.The teacher has written down the sum of multiple numbers. Pupils should calculate the sum. To make the calculation

2021-03-15 19:09:43 144

原创 M - The Rank

M - The RankJohn Smith knows that his son, Thomas Smith, is among the best students in his class and even in his school. After the students of the school took the exams in English, German, Math, and History, a table of results was formed.There are n stud

2021-03-15 19:09:24 80

原创 J - Where is the Marble?

J - Where is the Marble?Raju and Meena love to play with Marbles. They have got a lot ofmarbles with numbers written on them. At the beginning, Raju wouldplace the marbles one after another in ascending order of the numberswritten on them. Then Meena w

2021-03-14 09:11:03 115

原创 I-Solving Order

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>using namespace std;struct haha { string color; int num;}a[2222];bool cmp(haha a, haha b) { return a.num > b.num;}..

2021-03-14 09:09:57 75

原创 H-绝对值排序

#include <stdio.h>#include <math.h>int main(){ int n,i,j,t; int a[100]; while(~scanf("%d",&n)) { if(n==0) break; for(i=0;i<n;i++) { scanf("%d",&a[i]); } for(i=0;i&l.

2021-03-14 09:06:40 87

原创 G-EXCEL排序

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>using namespace std;struct haha{ char num[100]; char name[100]; int score;}a[100002];bool cmp1 (haha x1,haha x2){ ...

2021-03-14 09:05:35 75

原创 F-sort

#include<iostream>#include<algorithm>#include<functional>using namespace std;const int N=10000002;int a[N];int main(){ ios::sync_with_stdio(false); int n,m,i; while(cin>>n>>m) { for(i=0;i<n;i+.

2021-03-14 09:03:59 119

原创 2021-03-14

#include<bits/stdc++.h>using namespace std;int a[3002],b[300000002];int n,m,i,j;int main(){ ios::sync_with_stdio(false); while(cin>>n>>m) { for(i=0;i<n;i++) { cin>>a[i]; } int k=..

2021-03-14 09:03:11 41

原创 D-排名

D-排名#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>using namespace std;struct haha{char name[1005]; int grade;}a[1005];bool cmp(haha a,haha b){ int s; if(a.grade==

2021-03-14 09:01:14 76

原创 C - 开门人和关门人

C - 开门人和关门人#include<bits/stdc++.h>using namespace std;struct student{ string id; string st; string en;}a[2222];int main(){ int n,m,minn,maxx,i; cin>>n; while(n--) { minn=maxx=0; cin>>m; for(i=

2021-03-14 08:59:26 770

原创 A - DNA Sorting

A - DNA Sorting#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<math.h>#include<stdlib.h>#include <functional>using namespace std;struct DNA{ string dna; int l;}a[1

2021-03-14 08:57:55 61

原创 Q - Uncowed Forces

Q - Uncowed ForcesKevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and featured five problems with maximum point values of 500, 1000, 1500, 2000, and 2500, respectively. Despite the challenging tasks, Kevin wa

2021-03-14 08:54:10 93

原创 P - Random Teams

P - Random Teamsn participants of the competition were split into m teams in some manner so that each team has at least one participant. After the competition each pair of participants from the same team became friends.Your task is to write a program tha

2021-03-01 21:02:23 78

原创 O - Football

O - FootballOne day Vasya decided to have a look at the results of Berland 1910 Football Championship’s finals. Unfortunately he didn’t find the overall score of the match; however, he got hold of a profound description of the match’s process. On the whol

2021-03-01 20:50:40 134

原创 N - Multiply by 2, divide by 6

N - Multiply by 2, divide by 6You are given an integer n. In one move, you can either multiply n by two or divide n by 6 (if it is divisible by 6 without the remainder).Your task is to find the minimum number of moves needed to obtain 1 from n or determi

2021-02-28 19:47:26 266

原创 M - Fancy Fence

M - Fancy FenceEmuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence c

2021-02-28 19:47:12 108

原创 L - Arena

L - Arenan heroes fight against each other in the Arena. Initially, the i-th hero has level ai.Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it’s even possible that it is the same two heroes that were

2021-02-27 19:38:44 209

原创 K - Three swimmers

K - Three swimmersThree swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool.It takes the first swimmer exactly a minutes to swim across the entire pool and come back, exactly b minutes f

2021-02-27 19:16:42 168

原创 J - Cows and Poker Game

J - Cows and Poker GameThere are n cows playing poker at a table. For the current betting phase, each player’s status is either “ALLIN”, “IN”, or “FOLDED”, and does not change throughout the phase. To increase the suspense, a player whose current status i

2021-02-24 21:33:52 88

原创 I - Vitya in the Countryside

I - Vitya in the CountrysideEvery summer Vitya comes to visit his grandmother in the countryside. This summer, he got a huge wart. Every grandma knows that one should treat warts when the moon goes down. Thus, Vitya has to catch the moment when the moon i

2021-02-24 21:26:57 67

原创 H - Pashmak and Flowers

H - Pashmak and Flowers*Pashmak decided to give Parmida a pair of flowers from the garden. There are n flowers in the garden and the i-th of them has a beauty number bi. Parmida is a very strange girl so she doesn’t want to have the two most beautiful flo

2021-02-24 21:25:24 86

原创 G - Police Recruits

G - Police RecruitsThe police department of your city has just started its journey. Initially, they don’t have any manpower. So, they started hiring new recruits in groups.Meanwhile, crimes keeps occurring within the city. One member of the police force

2021-02-24 21:23:50 87

原创 F - Sereja and Suffixes

F - Sereja and SuffixesSereja has an array a, consisting of n integers a1, a2, …, an. The boy cannot sit and do nothing, he decided to study an array. Sereja took a piece of paper and wrote out m integers l1, l2, …, lm (1 ≤ li ≤ n). For each number li he

2021-02-24 21:21:22 136

空空如也

空空如也