![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Codeforces
文章平均质量分 92
linjiayina
hello world!
展开
-
Codeforces Round #697 (Div. 3)
A. Odd Divisor题目链接题目大意给定一个整数 n,问是否存在大于 1 的质因子。分析只要判断是否为 2 的整数次幂就可以了,如果是就输出 YES,否则,输出 NO。#include<bits/stdc++.h>using namespace std;int main(){ int t; long long n; cin >> t; while(t--){ cin >> n; while(n % 2 == 0){ n /原创 2021-01-27 14:09:58 · 157 阅读 · 0 评论 -
Codeforces——B. Longest Palindrome
Codeforces——B. Longest PalindromeReturning back to problem solving, Gildong is now studying about palindromes. He learned that a palindrome is a string that is the same as its reverse. For example, s...原创 2020-02-16 19:23:48 · 457 阅读 · 0 评论 -
Codeforces——C. Air Conditioner
Codeforces——C. Air ConditionerGildong owns a bulgogi restaurant. The restaurant has a lot of customers, so many of them like to make a reservation before visiting it.Gildong tries so hard to satisfy...原创 2020-02-16 18:58:03 · 377 阅读 · 0 评论 -
Codeforces——C. Anu Has a Function
Codeforces——C. Anu Has a FunctionAnu has created her own function f: f(x,y)=(x|y)−y where | denotes the bitwise OR operation. For example, f(11,6)=(11|6)−6=15−6=9. It can be proved that for any nonne...原创 2020-02-11 20:20:00 · 260 阅读 · 0 评论 -
Codeforces——C. Yet Another Walking Robot
Codeforces——C. Yet Another Walking RobotThere is a robot on a coordinate plane. Initially, the robot is located at the point (0,0). Its path is described as a string s of length n consisting of chara...原创 2020-02-05 01:20:27 · 778 阅读 · 0 评论 -
Codeforces——Array Sharpening
Codeforces——Array SharpeningYou’re given an array a1,…,an of n non-negative integers.Let’s call it sharpened if and only if there exists an integer 1≤k≤n such that a1<a2<…ak+1>…>an. In p...原创 2020-02-03 16:10:03 · 243 阅读 · 0 评论 -
ConneR and the A.R.C. Markland-N
ConneR and the A.R.C. Markland-NA.R.C. Markland-N is a tall building with n floors numbered from 1 to n. Between each two adjacent floors in the building, there is a staircase connecting them.It’s l...原创 2020-01-20 13:23:35 · 451 阅读 · 0 评论