代码搜索：Problem
找到约 10,000 项符合「Problem」的源代码
代码结果 10,000
www.eeworm.com/read/481966/6633592
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/481966/6633624
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/481966/6633633
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/481966/6633658
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/481966/6633662
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/481966/6633665
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 ==
www.eeworm.com/read/481966/6633703
cpp 1696.cpp
/* This Code is Submitted by wywcgs for Problem 1696 on 2005-03-11 at 18:07:25 */
#include
int main()
{
int a, b, line, i;
scanf("%d", &line);
for(i = 0; i < line
www.eeworm.com/read/481966/6633706
cpp 2191.cpp
/* This Code is Submitted by wywcgs for Problem 2191 on 2006-04-02 at 22:43:43 */
#include
int main()
{
int t, T, i;
scanf("%d", &T);
for(t = 1; t
www.eeworm.com/read/481966/6633720
cpp 2111.cpp
/* This Code is Submitted by wywcgs for Problem 2111 on 2005-10-07 at 19:20:16 */
#include
int main()
{
int n, sum;
int i, j, test, t;
scanf("%d", &test);
for(i = 0; i < te
www.eeworm.com/read/481966/6633723
cpp 1331.cpp
/* This Code is Submitted by wywcgs for Problem 1331 on 2005-10-03 at 09:46:30 */
#include
#define MAX 100000
int main()
{
double hang[MAX], sum = 0;
long i, n;
for (i = 1;