Dosth_Magic

DescriptionIn order to encourage Hiqivenfin to study math, his mother gave him a sweet candy when the day of the month was a prime number. Hiqivenfin was happy with that. But several days later, h

int main(){ int kase = 0; char s[50]; while( scanf("%s",s)!=EOF ){ printf("Case %d: ",++kase); if( !strcmp(s,"I") ) printf("1\n"); if( !strcmp(s,"II") ) print

#include#include#include#includeusing namespace std;int main(){ long long int a[5]; int c=0; while(scanf("%lld%lld%lld%lld",&a[0],&a[1],&a[2],&a[3])!=EOF) { sort(a,a+4);

H - 1008Time Limit:3000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4252DescriptionAfter Mr. B arrived in Warsaw, he was shocked by the

#include#includeint main(){ int kase = 0; char s[50],ss[50]; while(1 ){ if( scanf("%s",s) ==EOF ) break; scanf("%s",ss); printf("Case %d: ",++kase); if

2218: Thrall’s DreamTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 253  Solved: 72[Submit][Status][Web Board]DescriptionWe never paid any heed to the ancient prophecies, like fools we cl

2219: A^X mod PTime Limit: 5 Sec  Memory Limit: 128 MBSubmit: 443  Solved: 80[Submit][Status][Web Board]DescriptionIt's easy for ACMer to calculate A^X mod P. Now given seven integers n,

Mine NumberTime Limit: 1000MS Memory limit: 65536K题目描述Every one once played the game called Mine Sweeping, here I change the rule. You are given an n*m map, every element is a '*' repres

The Best Seat in ACM ContestTime Limit: 1000MS Memory limit: 65536K题目描述Cainiao is a university student who loves ACM contest very much. It is a festival for him once when he attends ACM

Pixel densityTime Limit: 1000MS Memory limit: 65536K题目描述 Pixels per inch (PPI) or pixel density is a measurement of the resolution of devices in various contexts; typically computer di

Fruit Ninja IITime Limit: 5000MS Memory limit: 65536K题目描述 Have you ever played a popular game named "Fruit Ninja"?Fruit Ninja (known as Fruit Ninja HD on the iPad and Fruit Nin

2217: Rescue The PrincessTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 433  Solved: 177[Submit][Status][Web Board]DescriptionSeveral days ago, a beast caught a beautiful princess and th

Pick applesTime Limit: 1000ms   Memory limit: 165536K  有疑问？点这里^_^题目描述Once ago, there is a mystery yard which only produces three kinds of apples. The number of each kind is infinite. A g

2226: Contest Print ServerTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 515  Solved: 119[Submit][Status][Web Board]DescriptionIn ACM/ICPC on-site contests ,3 students share 1 computer,s

2217: Rescue The PrincessTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 422  Solved: 173[Submit][Status][Web Board]DescriptionSeveral days ago, a beast caught a beautiful princess and th

#include#include#include#include#define N 40400#define MAX 210#define CNT 4400using namespace std;bool isprime[N];int prime[CNT],cnt;int map[MAX][MAX];bool visited[MAX][MAX];struct point {

DescriptionYou want to visit a strange country. There are n cities in the country. Cities are numbered from 1 to n. The unique way to travel in the country is taking planes. Strangely, in this str

#include #include using namespace std;const int MAXN = 100001;int N, K;int vis[MAXN];int ret[MAXN];queue q;int BFS(int s, int d){ if (s == d) return 0; q.push(s); int cur; while (

J - 1010Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4254DescriptionMr. B and Mr. M like to play with balls. They have m