Dosth_Magic

n a^o7 ! Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^ 题目描述 All brave and intelligent fighters, next you will step into a distinctive battleground which is full of sweet and happine

#include int a[100][100]; int main() { int n; scanf("%d",&n); for(int i=1;i<=n;i++) for(int j=1;j<=i;j++) scanf("%d",&a[i][j]); int maxx =0; for(int i=2;i<=n;i

#include #include using namespace std; int a[1000]; int dp[1000]; int main() { int n; scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i]); int maxx=0; for(int i=1;i<=n;

题目连接：http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=2159&cid=1172 示例输入 4 add 2 3 find 1 2 remove 2 3 find 1 2 0 示例输出 Case 1: 2 3 -1 题意：跟hello world题意差不多，第一行N个操作，“add”是加入容器一个

Mine Number Time 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

Pixel density Time 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

The Best Seat in ACM Contest Time 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

Pick apples Time 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

Fruit Ninja II Time 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

#include int a[100][100]; int main() { int n; while(scanf("%d",&n)!=EOF) { for(int i=1;i<=n;i++) for(int j=1;j<=i;j++) scanf("%d",&a[i][j]); for(in