代码搜索：Problem
找到约 10,000 项符合「Problem」的源代码
代码结果 10,000
www.eeworm.com/read/486654/6524579
cpp 1128.cpp
/* This Code is Submitted by wywcgs for Problem 1128 on 2005-09-30 at 17:30:25 */
#include
#define MAX 100
int main()
{
int cube[MAX+1];
int i, j, k, l;
int m, n, p;
for(i
www.eeworm.com/read/486654/6524711
cpp 1519.cpp
/* This Code is Submitted by wywcgs for Problem 1519 on 2005-09-30 at 12:27:30 */
#include
#define MAX 34000
int main()
{
int inQueue[MAX+1]= {0}, free[MAX] = {0};
int i, num,
www.eeworm.com/read/486654/6524787
cpp 1219.cpp
/* This Code is Submitted by wywcgs for Problem 1219 on 2006-01-09 at 22:47:43 */
#include
int main()
{
int x, y, dx, dy, n, s;
while(scanf("%d %d %d %d %d", &s, &x, &y, &dx, &dy
www.eeworm.com/read/486654/6524796
cpp 1442.cpp
/* This Code is Submitted by wywcgs for Problem 1442 on 2005-03-21 at 22:27:41 */
#include
int main()
{
int b, a[13], c = 0;
int i, j ,k, l, m, n;
while(scanf("%d
www.eeworm.com/read/486654/6524900
cpp 1697.cpp
/* This Code is Submitted by wywcgs for Problem 1697 on 2005-12-09 at 23:13:59 */
#include
#include
const int MAX = 10240;
int main()
{
char code[MAX];
int decode[MAX
www.eeworm.com/read/481966/6633402
cpp 1987.cpp
/* This Code is Submitted by wywcgs for Problem 1987 on 2005-09-22 at 14:16:28 */
#include
int main()
{
int n, m, i, f[10001];
while(scanf("%d %d", &n, &m) == 2) {
www.eeworm.com/read/481966/6633449
cpp 1302.cpp
/* This Code is Submitted by wywcgs for Problem 1302 on 2005-03-27 at 17:31:19 */
#include
int main()
{
long n, fact[10];
int i, flag;
fact[0] = 1;
for(i = 1
www.eeworm.com/read/481966/6633772
cpp 1441.cpp
/* This Code is Submitted by wywcgs for Problem 1441 on 2005-10-29 at 04:49:41 */
#include
const int MAX = 256;
int main()
{
int n, m, i, p;
bool can;
while(scanf("%d", &n)
www.eeworm.com/read/481966/6633874
cpp 1078.cpp
/* This Code is Submitted by wywcgs for Problem 1078 on 2005-03-04 at 21:32:28 */
#include
int main()
{
double b[10] = {0};
int i, a[10] = {1};
for(i = 1; i < 10;
www.eeworm.com/read/481966/6633878
cpp 1128.cpp
/* This Code is Submitted by wywcgs for Problem 1128 on 2005-09-30 at 17:30:25 */
#include
#define MAX 100
int main()
{
int cube[MAX+1];
int i, j, k, l;
int m, n, p;
for(i