hdu3589

maksyuki 发表于 oj 分类,标签:
0
hdu3589

Jacobi symbol

Problem Description

Consider a prime number p and an integer a !≡ 0 (mod p). Then a is called a quadratic residue mod p if there is an integer x such that >>继续阅读

hdu3579

maksyuki 发表于 oj 分类,标签:
0
hdu3579

Hello Kiki

Problem Description

One day I was shopping in the supermarket. There was >>继续阅读

hdu3549

maksyuki 发表于 oj 分类,标签:
0
hdu3549

Flow Problem

Problem Description

Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph.

Input >>继续阅读

hdu3501

maksyuki 发表于 oj 分类,标签:
0
hdu3501

Calculation 2

Problem Description

Given a positive integer N, your task is to calculate the sum >>继续阅读

hdu3292

maksyuki 发表于 oj 分类,标签:
0
hdu3292

No more tricks, Mr Nanguo

Problem Description

Now Sailormoon girls want to tell you a ancient idiom story >>继续阅读

hdu3065

maksyuki 发表于 oj 分类,标签:
0
hdu3065

病毒侵袭持续中

Problem Description

小t非常感谢大家帮忙解决了他的上一个问题。然而病毒侵袭持续中。 >>继续阅读

hdu2973

maksyuki 发表于 oj 分类,标签:
0
hdu2973

YAPTCHA

Problem Description

The math department has been having problems lately. >>继续阅读

hdu2955

maksyuki 发表于 oj 分类,标签:
0
hdu2955

Robberies

Problem Description

The aspiring Roy the Robber has seen a lot of >>继续阅读

hdu2896

maksyuki 发表于 oj 分类,标签:
0
hdu2896

病毒侵袭

Problem Description

当太阳的光辉逐渐被月亮遮蔽,世界失去了光明,大地迎来最黑暗的时刻。。。。在这样的时刻,人们却异常兴奋——我们能在有生之年看到500年一遇的世界奇观,那是多么幸福的事儿啊~~ >>继续阅读

hdu2888

maksyuki 发表于 oj 分类,标签:
0
hdu2888

Check Corners

Problem Description

Paul draw a big m*n matrix A last month, whose entries Ai,j are all integer numbers ( 1 <= i <= m, 1 <= j <= n ). Now he selects some sub-matrices, hoping to find the maximum number. Then he finds tha >>继续阅读

hdu2815

maksyuki 发表于 oj 分类,标签:
0
hdu2815

Mod Tree

Problem Description

The picture indicates a tree, every node has 2 children. >>继续阅读

hdu2686

maksyuki 发表于 oj 分类,标签:
0
hdu2686

Matrix

Problem Description

Yifenfei very like play a number game in the n*n Matrix. A positive integer number is put in each area of the Matrix. >>继续阅读

hdu2669

maksyuki 发表于 oj 分类,标签:
0
hdu2669

Romantic

Problem Description

The Sky is Sprite.

The Birds is Fly in the Sky.

The Wind is Wonderful.

Blew Throw the Trees >>继续阅读

hdu2602

maksyuki 发表于 oj 分类,标签:
0
hdu2602

Bone Collector

Problem Description

Many years ago , in Teddy’s hometown there was >>继续阅读

hdu2594

maksyuki 发表于 oj 分类,标签:
0
hdu2594

Simpsons’ Hidden Talents

Problem Description

Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.

Marge: Yeah, what is it?

Homer: Take me for example. I want to find out if I have >>继续阅读

hdu2521

maksyuki 发表于 oj 分类,标签:
0
hdu2521

反素数

Problem Description

反素数就是满足对于任意i(0<i<x),都有g(i)<g(x),(g(x)是x的因子个数),则x为一个反素数。现在给你一个整数区间[a,b],请你求出该区间的x使g(x)最大。

Input

第一行输入n,接下来n行测试数据 >>继续阅读