Bcoi

摘要： 目录 DescriptionInputOutputSolutionCode Description 给出一个字符串 s，每次可以交换两个相邻的字符，要构造一个合法的字符串 t，使得 t 变为 s 所需要的操作次数最多 Input 4 ANTON NAAN AAAAAA OAANTTON Output 阅读全文

摘要： 题目链接：点我点我 Score: 800" role="presentation" style="font-size: 114%; position: relative;">800800 points Problem Statement We have a pancake tower which i 阅读全文

摘要： 题目链接：点我点我 Score : 500" role="presentation" style="font-size: 114%; position: relative;">500500 points Problem StatementGiven are two sequences of leng 阅读全文

摘要： 题目链接：点我点我 Problem StatementSnuke has a blackboard and N" role="presentation" style="font-size: 114%; position: relative;">NN candies. The tastiness of 阅读全文

摘要： 题目描述 You are given 2 arrays a a a and b b b , both of size n n n . You can swap two elements in b b b at most once (or leave it as it is), and you are 阅读全文

摘要： Problem Statement There are N" role="presentation" style="font-size: 114%; position: relative;">NN buildings along the AtCoder Street, numbered 1" rol 阅读全文

摘要： 最后附上欧拉函数的求解过程 1 int Eualr(int n) 2 { 3 int ans=n; 4 for(i=2;i*i<=n;i++){ //枚举所有质因数 5 if(n%i==0){ 6 ans=ans/i*(i-1); 7 while(n%i==0) n/=i; 8 } 9 } 10 i 阅读全文