代码搜索：Problem
找到约 10,000 项符合「Problem」的源代码
代码结果 10,000
www.eeworm.com/read/486654/6524789
cpp 2322.cpp
/* This Code is Submitted by wywcgs for Problem 2322 on 2006-08-13 at 20:22:08 */
#include
int main()
{
int T;
scanf("%d", &T);
for(int t = 1; t
www.eeworm.com/read/486654/6524809
cpp 1277.cpp
/* This Code is Submitted by wywcgs for Problem 1277 on 2005-11-10 at 23:43:49 */
#include
const int MAX = 64;
int main()
{
double e[MAX][MAX] = {0}, c[MAX] = {0};
int i, j, n;
www.eeworm.com/read/486654/6524815
cpp 2277.cpp
/* This Code is Submitted by wywcgs for Problem 2277 on 2006-06-11 at 19:16:40 */
#include
int main()
{
int n, i, t, T;
scanf("%d", &T);
for(t = 0; t < T; t++) {
scanf("%d"
www.eeworm.com/read/486654/6524830
cpp 2332.cpp
/* This Code is Submitted by wywcgs for Problem 2332 on 2006-08-25 at 17:07:34 */
#include
#include
using namespace std;
const int N = 1024;
int main()
{
int led[N];
www.eeworm.com/read/486654/6524845
cpp 2386.cpp
/* This Code is Submitted by wywcgs for Problem 2386 on 2006-09-28 at 15:52:05 */
#include
#include
using namespace std;
const int N = 10240;
int main()
{
int num[N]
www.eeworm.com/read/486654/6524895
cpp 2117.cpp
/* This Code is Submitted by wywcgs for Problem 2117 on 2005-10-13 at 21:00:49 */
#include
#define LENGTH 35
int main()
{
long num, den;
int i;
while(scanf("%ld %ld", &num
www.eeworm.com/read/486654/6524921
cpp 1058.cpp
/* This Code is Submitted by wywcgs for Problem 1058 on 2006-01-19 at 04:17:01 */
#include
#include
using namespace std;
const int MAX = 1024;
int main()
{
int n,
www.eeworm.com/read/486654/6524948
cpp 1148.cpp
/* This Code is Submitted by wywcgs for Problem 1148 on 2005-12-27 at 13:10:37 */
#include
int main()
{
int t, T, n, m;
scanf("%d", &T);
for(t = 1; t
www.eeworm.com/read/486654/6524972
cpp 2364.cpp
/* This Code is Submitted by wywcgs for Problem 2364 on 2006-09-22 at 21:08:17 */
#include
#include
#include
using namespace std;
const int N = 1024;
int ma
www.eeworm.com/read/486654/6524979
cpp 1090.cpp
/* This Code is Submitted by wywcgs for Problem 1090 on 2005-10-27 at 21:54:26 */
#include
const int MAX = 512;
int main()
{
long long c[MAX] = {0};
int i, j, n;
for(i = MAX