Codeforces
JdiLfc
这个作者很懒,什么都没留下…
展开
-
C1. Errich-Tac-Toe (Easy Version)
The only difference between the easy and hard versions is that tokens of type O do not appear in the input of the easy version.Errichto gave Monogon the following challenge in order to intimidate him from taking his top contributor spot on Codeforces.In原创 2020-12-07 16:47:32 · 559 阅读 · 0 评论 -
2020-11-30 Educational Codeforces Round 99 (Rated for Div. 2) A-D题
文章目录A题:Strange FunctionsB题:JumpsC题:Ping-PongD题:Sequence and SwapsA题:Strange Functions这个题只有遇到10,100,1000这类的数的时候才会产生不同的值,所以就是求有多少位就行了,用一个string,就好了。#include <bits/stdc++.h> using namespace std; int main(){ int t; cin>>t; whil原创 2020-12-01 22:47:04 · 355 阅读 · 0 评论 -
2020-11-14 codeforces总结(A-C题)
文章目录总结:A. Special PermutationB. Unique Bid AuctionC. Sequence Transformation总结:一定要看题目给的数的范围A. Special PermutationYou are given one integer n (n>1).Recall that a permutation of length n is an array consisting of n distinct integers from 1 to n in ar原创 2020-11-25 15:57:25 · 1117 阅读 · 0 评论 -
A. Buy the String
#include<bits/stdc++.h>using namespace std;int main(){ int t; cin>>t; while(t--) { int n,c0,c1,h; cin>>n>>c0>>c1>>h; string s; cin>>s; int cnt0=0; .原创 2020-11-18 17:41:47 · 314 阅读 · 2 评论 -
Codeforces Round #682 (Div. 2)总结
A. Specific Tastes of Andre 这个挺简单的,就输出1就行了#include<bits/stdc++.h>using namespace std;int main(){ int t; cin>>t; int a[10001]; while(t--) { int n; cin>>n; for(int i=0;i<n;i++) {原创 2020-11-14 13:48:08 · 334 阅读 · 0 评论 -
C. Division--唯一分解定理
Oleg’s favorite subjects are History and Math, and his favorite branch of mathematics is division.To improve his division skills, Oleg came up with ????pairs of integers ???????? and ???????? and for each pair decided to find the greatest integer ???????原创 2020-11-03 21:31:43 · 665 阅读 · 1 评论 -
B. A New Technique
All techniques in the ninja world consist of hand seals. At the moment Naruto is learning a new technique, which consists of ????⋅???? different seals, denoted by distinct numbers. All of them were written in an ????×????table.The table is lost now. Naru原创 2020-10-26 19:15:56 · 532 阅读 · 0 评论 -
Codeforces-C - ABBB
Zookeeper is playing a game. In this game, Zookeeper must use bombs to bomb a string that consists of letters ‘A’ and ‘B’. He can use bombs to bomb a substring which is either “AB” or “BB”. When he bombs such a substring, the substring gets deleted from th原创 2020-10-26 19:00:38 · 947 阅读 · 0 评论