代码搜索：Problem
找到约 10,000 项符合「Problem」的源代码
代码结果 10,000
www.eeworm.com/read/481966/6633739
cpp 1032.cpp
/* This Code is Submitted by wywcgs for Problem 1032 on 2005-12-26 at 10:44:14 */
#include
const int MAX = 102400;
int main()
{
double x[MAX], y[MAX];
double A, Cx, Cy;
int t,
www.eeworm.com/read/481966/6633764
cpp 1224.cpp
/* This Code is Submitted by wywcgs for Problem 1224 on 2005-03-25 at 20:15:14 */
#include
int main()
{
int test;
long n, step;
int i;
scanf("%d", &test);
www.eeworm.com/read/481966/6633765
cpp 2253.cpp
/* This Code is Submitted by wywcgs for Problem 2253 on 2006-05-29 at 10:23:20 */
#include
#include
using namespace std;
int main()
{
int t, T;
scanf("%d", &T);
www.eeworm.com/read/481966/6633775
cpp 2335.cpp
/* This Code is Submitted by wywcgs for Problem 2335 on 2006-08-26 at 02:08:04 */
#include
const int L = 128;
int main()
{
int T;
scanf("%d", &T);
for(int t = 1; t
www.eeworm.com/read/481966/6633814
cpp 1039.cpp
/* This Code is Submitted by wywcgs for Problem 1039 on 2005-03-23 at 20:41:14 */
#include
int main()
{
long five[13], N, T, Z;
long i, j;
five[0] = 1;
for(i
www.eeworm.com/read/481966/6633848
cpp 2071.cpp
/* This Code is Submitted by wywcgs for Problem 2071 on 2005-09-23 at 00:16:03 */
#include
int main()
{
int a[3], i;
while(scanf("%d %d %d", &a[0], &a[1], &a[2]) == 3)
www.eeworm.com/read/481966/6633852
cpp 2171.cpp
/* This Code is Submitted by wywcgs for Problem 2171 on 2006-03-13 at 12:24:07 */
#include
#include
const int MAX = 102400;
int main()
{
char word[MAX];
int i, t, T,
www.eeworm.com/read/481966/6633866
cpp 1796.cpp
/* This Code is Submitted by wywcgs for Problem 1796 on 2005-03-26 at 18:56:59 */
#include
int main()
{
int card[50], stack[50];
int n, r, p, c;
int i, j, top;
www.eeworm.com/read/481966/6633870
cpp 1669.cpp
/* This Code is Submitted by wywcgs for Problem 1669 on 2005-10-29 at 04:07:09 */
#include
const int MAX = 48;
int main()
{
long long f[MAX] = {1};
int i, z, n, p;
for(i =
www.eeworm.com/read/481966/6633872
cpp 1209.cpp
/* This Code is Submitted by wywcgs for Problem 1209 on 2005-03-14 at 15:30:09 */
#include
int main()
{
int N, K, i;
int shdBuy;
scanf("%d", &N);
for(i = 0;