随笔分类 - OJ-AtCoder
摘要:A - Garden Problem Statement There is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a ho
阅读全文
摘要:今天打得真的很爽,15分钟就AK了,第一次在13名。。。在过生日时打真的是我的幸运日,哈哈哈。 A - Sandglass2 Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement We have a
阅读全文
摘要:A - Meal Delivery Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement Snuke lives at position x on a number line. On this li
阅读全文
摘要:A - Palindromic Number Problem Statement You are given a three-digit positive integer N. Determine whether N is a palindromic number. Here, a palindro
阅读全文
摘要:Problem Statement We have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence unt
阅读全文
摘要:A - ABCxxx 水题。 1 #include <iostream> 2 using namespace std; 3 int main(){ 4 int n; 5 cin>>n; 6 cout << "ABC" << n << endl; 7 return 0; 8 } B - Break N
阅读全文
摘要:A - Sharing Cookies 有A个饼干和B个饼干,可以给羊A、B或A+B个饼干,要求三个羊可以平分。 一开始没有读懂题,以为给A+B就行了,错了一次。 B - Snake Toy 有N个棒,求其中K个棒的最大和。排下序就行了。 C - Splitting Pile N个扑克, 都有一个值
阅读全文
摘要:C - Reconciled? 设AA(x)为x的阶乘(对Mod求模),n与m相差为2则输出0,相差为1则输出AA(n)*AA(n)*2%Mod,相同则输出AA(n)*AA(m)%Mod,这题好粗心,把ans变量写成int,改成ll就对了,可是比赛时硬是检查不出来5555555555555555
阅读全文
摘要:B - Trained? 大意是从第一个按钮开始,按的是几下次就从几开始按,求按的2时最小的按数是多少,没有则是0;
阅读全文
摘要:C - +/- Rectangle 题意:给定H,W,h,w四个数,求是否满足 全部数之和和正数,h行w列之和为负数。
阅读全文
摘要:B - Colorful Hats 题意:有n个颜色,第i个数字表示第i个颜色不同的数量,求输入的数据是否有矛盾。 一个数学题目,可惜推不出来。只能看大佬的了。
阅读全文
摘要:A - Shrinking 题意:每次字符串长度减一,每个字符可以变成后一个字符或者保存不变,求最少操作多少次使得字符串都是一个相同的字符组成。 数字很小就直接枚举了。
阅读全文
摘要:花样式过DFS题 Problem Statement Nuske has a grid with N rows and M columns of squares. The rows are numbered 1 through N from top to bottom, and the column
阅读全文
摘要:Problem Statement Skenu constructed a building that has N floors. The building has an elevator that stops at every floor. There are buttons to control
阅读全文
摘要:Problem Statement Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How man
阅读全文