HHH_go_的博客

题目链接 题意：求1378^n的最后一位。 直接上快速幂模板 因为a^4=(a^2)*(a^2)。所以可得快速幂如果n是偶数先让底数相乘，奇数直接乘到结果上。加快运算速度#include<stdio.h>#include<string.h>int f(int m,int n){ int b=1; while(n>0) { if(n%2==1)

CodeForces - 805A Fake NP Tavak and Seyyed are good friends. Seyyed is very funny and he told Tavak to solve the following problem instead of longest-path. You are given l and r. For all integers from

A. Vladik and Courtesytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAt regular competition Vladik and Valera won a

B. Vladik and Complicated Booktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVladik had started reading a complicat

A. Straight «A»time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputNoora is a student of one famous high school. It's her

B. Summer sell-offtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSummer holidays! Someone is going on trips, someone

A. Sagheer and Crossroadstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSagheer is walking in the street when he com

C. Do you want a date?time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLeha decided to move to a quiet town Vičkopoli

A. Unimodal Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputArray of integers is unimodal, if:it

B. Keyboard Layoutstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are two popular keyboard layouts i

D. Office Keystime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n people and k keys on a straigh

C. Jury Markstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp watched TV-show where k jury members

D. Unusual Sequencestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputCount the number of distinct sequences 

B. GCD of Polynomialstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSuppose you have two polynomials  and

CodeForces - 805B 3-palindromeIn the beginning of the new year Keivan decided to reverse his name. He doesn’t like palindromes, so he changed Naviek to Navick. He is too selfish, so for a given n he

Find Amirtime limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output A few years ago Sajjad left his school and register to another one due to security

D. Minimum number of stepstime limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output We have a string of letters ‘a’ and ‘b’. We want to perform some o

题目链接 题目意思，有n个数求n个数取两个数有多少个这样的组合抑或值等于k 因为 a^b=k且 a^k=b; 所以我们可以先打出跟k抑或后的结果表，然后通过查表输出答案#include<stdio.h>#include<string.h>#include<map>using namespace std;long long a[200010];long long b[200010];

题目链接 题目大意：表示意思有点绕，什么owww的，通俗的来讲就是找环，问的是满足x走到y的步数可以让y走到x。 分析 那么如果x走到x是一个偶数n，说明可以用n/2走到y且y不等于x 然后再用n/2步数走到x。这个环的权值就是n/2； 如果n是一个奇数，那么这个环的权值就是n。 然后就是把所有环的权值都找到并且求他们的最小公倍数。就得到答案啦#include<stdio.h>#inc

题意问n块钱最少交多少税收。 交税收的规则是交小于自己的最大因数，可以将自己拆分 很容易想到拆分成尽量少的质数，突然想到有个数论猜想是关于这个的。 没错哥德巴赫猜想。任何大于2的偶数都可以被分为两个质数。大于7的奇数 可以分为3个质数。 哎~~比赛的时候没有特判2结果本来以为前200的第二天看到才3题。 直接上代码：

题意 有n个人进行两两对抗的比赛，问冠军最后最多可以打几场要求对战的人胜场差距不能大于1.我们可以得到战一场至少需要2个人，战两场至少需要3个人。 那么如果需要战三场，就需要一个战胜了两场的和一个战胜了一场的就需要5个人 所以得到了递推式 a[i]=a[i-1]+a[i-2]; 斐波那契；直接上代码

题意给你n个数在其中取n1个和n2个，求他们的平均数之和 贪心思想，取尽量大的数，取尽量少的数，这样平均数就小 所以排序后先取少量再取大量，求平均求和就可以了代码：

题意 一个字符串上有蚂蚱（G）和虫（T），每次G可以移动K格，问能否到达T 直接模拟#include<stdio.h>#include<string.h>int main(){ int n,m; scanf("%d%d",&n,&m); char a[105]; scanf("%s",a); int g,t; for(int i=0;i<n;i

A. Vladik and flights time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Vladik is a competitive programmer. This year he is going to win the

B. Chloe and the sequence time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Chloe, the same as Vladik, is a competitive programmer. She didn’

C. Vladik and fractions time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Vladik and Chloe decided to determine who of them is better at math

题意： 有n节象棋课和m节程序课，分别选一节，要求输出最大时间间隔。 分析： 一共有3种情况 1：象棋课比程序课早 那么取象棋课最早的结束时间，和程序课最晚的开始时间 2：程序课比象棋课早 那么取程序课最早的结束时间，象棋课最晚的开始时间 3：选两节课有冲突 输出0 AC代码#include<stdio.h>#include<string.h>#include<algorith

题意：一个谷仓有n个谷物，每天晚上运进来m个谷物，从第一天时每天早上都有相当于天数的鸟吃相当于天数的谷物（第i天就有i只，吃掉i个谷物）。问第几天谷仓会空。 分析： 1：首先如果直接暴力模拟肯定超时。 2：如果m>=n的话那必定是n天发现 3：因为鸟是一个递增数列而且d=1，当第m天后谷物就会减少 所以可以列出方程 m+（ans+1）*（ans）/2>=n；（因为最后一天可能等不到填充谷物

B. T-Shirt Hunttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNot so long ago the Codecraft-17 contest was held on Codeforces.

C. Success Ratetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are an experienced Codeforces user. Today you fou

E.Ice cream coloringIsart and Modsart were trying to solve an interesting problem when suddenly Kasra arrived. Breathless, he asked: “Can you solve a problem I’m stuck at all day?” We have a tree T wi

D. Welfare Statetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere is a country with n citizens. The i-th of them initially has ai money. ...