Achiberx

#include#includeint main(){ int a, b, res; while(scanf("%d%d", &a, &b) != EOF && a+b){ res = 1; for(int i = 1; i <= b; i++){ res = res*(a%1000)%1000; }

#include #include #include #define MaxSize 50#define TRUE 1#define FALSE 0typedef int BOOL;typedef struct student { char num[9]; char name[9]; char sex[5]; float score;}student;type

#include #include #include using namespace std;void fun(char *w, int n) { char *s1 = w; char t; char *s2 = w + n - 1; printf("%c ", *s2); while( s1 < s2 ) { t = *s1+

Message DecowdingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10890 Accepted: 6021DescriptionThe cows are thrilled because they've just learned about e

Lecture Halls （会议安排）  时间限制(普通/Java):1000MS/10000MS     运行内存限制:65536KByte总提交: 38            测试通过: 20描述假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，

Wooden Sticks  时间限制(普通/Java):1500MS/15000MS     运行内存限制:65536KByte总提交: 31            测试通过: 12描述There is a pile of n wooden sticks. The length and weight of each stick are known in advan

/************************************************************************* > File Name: Hello.java > Author: achiber > Mail: 1530168830@qq.com > Created Time: Rab 18 Sep 2013 10:29:00

矩阵

#include #include #include #include using namespace std;const int INF = 0x7fffffff;const int maxn = 30100;int h[maxn];// the height.int d[maxn];int main(){ int n; int idx = 1;