snowy_smile的博客

happy happy happyTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 143    Accepted Submission(s): 22Problem DescriptionToday, Bob

D. Fibonacci-ishtime limit per test3 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputYash has recently learnt about the Fibonacci sequenc

B. A Trivial Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMr. Santa asks all the great programmers

C. Watering Flowerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA flowerbed has many flowers and two foun

A. Bear and Reverse Radewooshtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak and Radewoosh are going

B. Scrambledtime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputBtoh yuo adn yuor roomatme lhoate wianshg diseh

Bear and Up-Downtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe life goes up and down, just like nice

Bear and Compressingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak is a little polar bear. Polar be

D. Skillstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLesha plays the recently published new version of

Link/Cut Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputProgrammer Rostislav got seriously interested

LCP ArrayTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1176    Accepted Submission(s): 328Problem DescriptionPeter has a string 

Beautiful Paintingstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n pictures delivered for the n

2016Time Limit: 2 Seconds      Memory Limit: 65536 KBIn mathematics, a polygonal number is a number represented as dots or pebbles arranged in the shape of a regular polygon. The dots are thou

Kpop Music PartyTime Limit: 2 Seconds      Memory Limit: 65536 KB Marjar University often hosts Kpop music festival. A Kpop music festival will last several days. During a Kpop festival, t

Counting SheepThis contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problems you solve. Read the Quick-Start Guide to ge

Friend-GraphTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 380    Accepted Submission(s): 196Problem DescriptionIt is well kno

Marjar ColaTime Limit: 1 Second      Memory Limit: 65536 KBMarjar Cola is on sale now! In order to attract more customers, Edward, the boss of Marjar Company, decides to launch a promotion: If

D. Generating Setstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a set Y of n distinct posi

A. Broken Clocktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a broken clock. You know, that

Kingdom of Black and WhiteTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 93    Accepted Submission(s): 41Problem DescriptionIn

La Vie en roseTime Limit: 7000/3500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1938    Accepted Submission(s): 655Problem DescriptionProfessor Zhang

Born SlippyTime Limit: 12000/6000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1049    Accepted Submission(s): 307Problem DescriptionProfessor Zhang

F. Break Uptime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAgain, there are hard times in Berland! Many to

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define MS(x,y) memset(x,y,sizeof(x))#define MC(x,y) memcpy(x

#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre() { freopen("c://test//input.in", "r", stdin

import java.util.*;import java.math.*;public class Main{ static Scanner cin = new Scanner(System.in); public static void main(String[] args) { //预处理素数 int prime[] = { 2,3,5,7,11,13,17,19,23,

C. Constant Ratiotime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiven an integer n, find out number of ways to represent it as the sum of two or more integers ai with the next property: ratio

Little Dima and Equationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Dima misbehaved during a mat

B. Grandfather Dovlet’s calculatortime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOnce Max found an electroni

C. MUH and House of Cardstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolar bears Menshykov and Uslada fro

BazingaTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 73    Accepted Submission(s): 28Problem DescriptionLadies and gentlemen, plea

#includeint a[10],b[10];bool check(){ for(int i=0;i<4;i++) { int j; for(j=0;j<4;j++)if(a[(i+j)%4]!=b[j])break; if(j==4)return 1; } return 0;}int main(){ int casenum,casei; scanf("%d"

【ASC45D】【构造】方法一之电阻网络法 WIKI Gambler's ruin#include #include#include#include#include#include#include#include#include#include #include#include#include#define MS(x,y) memset(x,y,sizeof(x))

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define MS(x,y) memset(x,y,sizeof(x))#define MC(x,y) memcpy(x

D. Once Again...time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array of positive integers a

B. Rebrandingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe name of one small but proud corporation con

数列乘k次x后求最大or值

B. Layer Caketime limit per test6 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputDasha decided to bake a big and tasty layer cake. In order to do that she went shopping and bought n rectangular cake layers. The length

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;void fre(){freopen("c://test//input.in","r",stdin);freopen("c:

#include #include#include#include#include#include#include#includeusing namespace std;typedef long long LL;const int N=1e3+10;int n,m;LL t[N],a[N],d[N],b[N];LL gcd(LL x,LL y){ return