1051. Pop Sequence (25) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Given a stack which can keep M numbers at most. Push N numbers in the order o
1050 String Subtraction (20 point(s)) Given two strings S1 and S2, S=S1−S2 is defined to be the remaining string after taking all the characters in S2 from S1. Your task is simpl
一、越学越慌 真是越学越慌,发现自己大一大二没搞事,愧为计算机人,下面说说本人今天的经历 1、怎样获得数组的长度 先看看一位老哥的代码: #include<iostream>using namespace std; int main(void){ int n; cin >> n; int *d; int c[100]; for (int i = 0; i < n; i++) cin