西瓜0

摘要： B - Saving the City cf--1443B Bertown is a city with nn buildings in a straight line. The city's security service discovered that some buildings were 阅读全文

摘要： 题目 C - C CodeForces - 1166C The legend of the foundation of Vectorland talks of two integers xx and yy. Centuries ago, the array king placed two marke 阅读全文

摘要： B - B CodeForces - 699B 题目： You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be emp 阅读全文

摘要： C - C CodeForces - 991C 题目内容： After passing a test, Vasya got himself a box of n candies. He decided to eat an equal amount of candies each morning un 阅读全文

摘要： B - B CodeForces - 994B 题内容： Unlike Knights of a Round Table, Knights of a Polygonal Table deprived of nobility and happy to kill each other. But each 阅读全文

摘要： B - B CodeForces - 879B n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser 阅读全文

摘要： B - Escape The princess is going to escape the dragon's cave, and she needs to plan it carefully. The princess runs at vp miles per hour, and the drag 阅读全文

摘要： C - Lucky Conversion CodeForces - 146C Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal rec 阅读全文

摘要： H 变换 链接：https://ac.nowcoder.com/acm/contest/9680/H来源：牛客网 从前有一个数字 1，它每天要么 +1，要么 *2 现在它变成了 n，请问它最少用了几天变成 n 输入描述: 题目包含多组测试数据，请处理到文件结束。每组输入一行表示一个 N(1≤N≤10 阅读全文

摘要： 1. 嫑废话上代码 #include<bits/stdc++.h> using namespace std; int main() { int a,b,c; cin>>a>>b>>c; cout<<a*b*c<<endl; } View Code 洛希极限 #include<bits/stdc++. 阅读全文