代码搜索：Problem
找到约 10,000 项符合「Problem」的源代码
代码结果 10,000
www.eeworm.com/read/481966/6633877
cpp 2312.cpp
/* This Code is Submitted by wywcgs for Problem 2312 on 2006-08-07 at 12:20:03 */
#include
typedef long long int64;
int main()
{
int t, T;
scanf("%d", &T);
for(t = 0; t < T
www.eeworm.com/read/481966/6633902
cpp 2203.cpp
/* This Code is Submitted by wywcgs for Problem 2203 on 2007-01-02 at 21:31:45 */
#include
int main()
{
int need[101] = { 0 }, area[5] = { 0, 78, 95, 99, 100 };
for(int i = 0; i <
www.eeworm.com/read/481966/6633903
cpp 1757.cpp
/* This Code is Submitted by wywcgs for Problem 1757 on 2005-12-11 at 19:12:10 */
#include
int main()
{
int s, d, r;
while(scanf("%d %d", &s, &d) != EOF) {
if(d > 4*s) {
www.eeworm.com/read/481966/6633929
cpp 1804.cpp
/* This Code is Submitted by wywcgs for Problem 1804 on 2006-02-25 at 19:17:15 */
#include
typedef unsigned int uint;
int main()
{
uint code[10];
int i, j, t, T;
scanf("%d"
www.eeworm.com/read/481966/6633934
cpp 2261.cpp
/* This Code is Submitted by wywcgs for Problem 2261 on 2006-06-03 at 17:17:36 */
#include
#include
#include
using namespace std;
const int L = 1024;
int mai
www.eeworm.com/read/481966/6633945
cpp 1716.cpp
/* This Code is Submitted by wywcgs for Problem 1716 on 2006-08-19 at 17:12:14 */
#include
#include
const int N = 10240;
const double S = 4.5;
int main()
{
int n, v[N],
www.eeworm.com/read/481966/6633957
cpp 2127.cpp
/* This Code is Submitted by wywcgs for Problem 2127 on 2005-10-21 at 13:11:00 */
#include
#include
int main()
{
double D, d, s;
double r, t, o;
int n, i;
scanf("%d
www.eeworm.com/read/481966/6633962
cpp 1688.cpp
/* This Code is Submitted by wywcgs for Problem 1688 on 2005-03-05 at 15:55:07 */
#include
int main()
{
int speed[10] = {0}, time[10] = {0}, distance = 0;
int n, i;
www.eeworm.com/read/481966/6633975
cpp 1881.cpp
/* This Code is Submitted by wywcgs for Problem 1881 on 2005-09-23 at 21:41:37 */
#include
int main()
{
int visited[10001], i;
long b, n;
while(scanf("%ld", &b) =
www.eeworm.com/read/481966/6633981
cpp 1680.cpp
/* This Code is Submitted by wywcgs for Problem 1680 on 2006-03-03 at 14:38:41 */
#include
const int MAX = 32;
int main()
{
int lmt[MAX][MAX], g, l;
int i, j, t;
for(i = 0;