摘要:
A 模拟+dfs暴搜 #include <iostream> #include <cstdio> #include <algorithm> using namespace std; const int MAXN = 4; int vis[MAXN][MAXN][MAXN]; int xi[] = { 阅读全文
摘要:
B. Masha and geometric depression time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Masha r 阅读全文
摘要:
A. Anastasia and pebbles time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Anastasia loves 阅读全文
摘要:
B. Strip time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Alexandra has a paper strip with 阅读全文
摘要:
C. Berzerk time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output C. Berzerk time limit per tes 阅读全文
摘要:
Problem: List likes playing card Time limit: 2s Mem limit: 64 MB Problem Description List's father morejarphone likes playing poker with List very muc 阅读全文