脂环

摘要： You are given two arrays aa and bb both consisting of nn positive (greater than zero) integers. You are also given an integer kk . In one move, you ca 阅读全文

摘要： You are given two integers nn and mm . You have to construct the array aa of length nn consisting of non-negative integers (i.e. integers greater than 阅读全文

摘要： 实验目的： （1）掌握运算符函数重载为成员函数的方法 （2）掌握运算符函数重载为友元函数的方法 （3）掌握不同类型数据间的转换方法 实验内容： 假设square_matrix是n阶整型方阵，请实现下列运算： （1）cin>> square_matrix （2）cout<< square_matrix 阅读全文

摘要： There are nn models in the shop numbered from 11 to nn , with sizes s1,s2,…,sns1,s2,…,sn . Orac will buy some of the models and will arrange them in t 阅读全文

摘要： Orac is studying number theory, and he is interested in the properties of divisors. For two positive integers aa and bb , aa is a divisor of bb if and 阅读全文

摘要： Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero an 阅读全文

摘要： A card pyramid of height 11 is constructed by resting two cards against each other. For h>1h>1, a card pyramid of height hh is constructed by placing 阅读全文

摘要： You are given a special jigsaw puzzle consisting of n⋅mn⋅m identical pieces. Every piece has three tabs and one blank, as pictured below. The jigsaw p 阅读全文

摘要： A. Sum of Round Numbers 把一个数拆成几个整十/百/千...的数的和。 #include <bits/stdc++.h> using namespace std; int main() { int t; cin>>t; while(t--) { int i,num,ans=0; 阅读全文

摘要： In order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are for 阅读全文