代码搜索：Problem
找到约 10,000 项符合「Problem」的源代码
代码结果 10,000
www.eeworm.com/read/486654/6524238
cpp 2066.cpp
/* This Code is Submitted by wywcgs for Problem 2066 on 2005-09-19 at 19:19:18 */
#include
#include
int main()
{
long test, i, len, j;
char word[5001];
www.eeworm.com/read/486654/6524249
cpp 2491.cpp
/* This Code is Submitted by wywcgs for Problem 2491 on 2007-06-01 at 12:42:56 */
#include
#include
const int P = 10000;
void com(int);
void mul(int[][2], int[][2]);
int
www.eeworm.com/read/486654/6524257
cpp 2026.cpp
/* This Code is Submitted by wywcgs for Problem 2026 on 2005-09-16 at 22:25:03 */
#include
int root(int, int);
int main()
{
int i, sum;
for(i = 2992; i < 10000; i++
www.eeworm.com/read/486654/6524273
cpp 1480.cpp
/* This Code is Submitted by wywcgs for Problem 1480 on 2006-01-12 at 04:48:09 */
#include
int main()
{
double b[2], c[2], n[2];
int i, m;
while(scanf("%d", &m) != EOF) {
s
www.eeworm.com/read/486654/6524293
cpp 1599.cpp
/* This Code is Submitted by wywcgs for Problem 1599 on 2005-03-22 at 08:19:52 */
#include
int main()
{
int n, h[101], average, step, total;
int i, j;
for(j = 1;
www.eeworm.com/read/486654/6524325
cpp 2262.cpp
/* This Code is Submitted by wywcgs for Problem 2262 on 2006-06-03 at 17:18:05 */
#include
const int N = 10000;
int main()
{
int sn[10240], i, sum = 0;
sn[0] = 1; sn[1] = 1;
www.eeworm.com/read/486654/6524334
cpp 1945.cpp
/* This Code is Submitted by wywcgs for Problem 1945 on 2005-09-26 at 11:51:45 */
#include
int main()
{
int M, N;
while(scanf("%d %d", &M, &N) == 2) {
if(N == 1) {
print
www.eeworm.com/read/486654/6524359
cpp 2124.cpp
/* This Code is Submitted by wywcgs for Problem 2124 on 2005-10-21 at 12:51:06 */
#include
int main()
{
long long d[32] = {1, 0};
int n, i, j;
for(i = 2; i < 32; i++) {
d[i
www.eeworm.com/read/486654/6524363
cpp 2065.cpp
/* This Code is Submitted by wywcgs for Problem 2065 on 2005-09-19 at 19:29:07 */
#include
int main()
{
long fab[46], test, i;
int n;
fab[0] = 0;
fab[1] = 1;
www.eeworm.com/read/486654/6524366
cpp 1006.cpp
/* This Code is Submitted by wywcgs for Problem 1006 on 2005-03-05 at 15:30:14 */
#include
int main()
{
int s, p;
while(scanf("%d %d", &s, &p) == 2){
if((s ==