代码搜索结果
找到约 33,766 项符合
Algorithm 的代码
2722854_tle.cpp
#include
#include
using namespace std;
int main()
{
int i, n, d, t;
int ca, cb;
int wa, wb;
int w[11], c[11], ans;
int a[] = {0,1,2,3,4,5,6,7,8,9,10};
scanf
2722861_ac_1061ms_172k.cc
#include
#include
using namespace std;
int main()
{
int i, n, d, t;
int ca, cb;
int wa, wb;
int w[11], c[11], ans;
int a[] = {0,1,2,3,4,5,6,7,8,9,10};
scanf
3597657_ac_250ms_284k.cpp
#include
#include
using namespace std;
struct node
{
int w, d;
}charm[3410];
int best[12881];
int n, w;
int main()
{
int i, j;
scanf("%d%d", &n, &w);
f
3615782_ac_0ms_180k.cpp
#include
#include
using namespace std;
int main()
{
int t, n;
int i, a[21];
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i = 0; i < n; i++)
scan
2386728_ac_109ms_416k.cc
#include
using namespace std;
struct node
{
int x, y;
}pot[50001];
int n;
bool cmp(struct node a, struct node b)
{
if(a.x==b.x)
return a.y
2847159_wa.cpp
#include
#include
int main()
{
int n, mark[21];
int map[21][21];
int i, j, t, ans, tmp;
scanf("%d",&n);
ans = -1;
for(i = 1; i
2847157_tle.cpp
#include
#include
int main()
{
int n, mark[21];
int map[21][21];
int i, j, t, ans, tmp;
scanf("%d",&n);
ans = -1;
for(i = 1; i
2847156_tle.cpp
#include
#include
int main()
{
int n, mark[21];
int map[21][21];
int i, j, t, ans, tmp;
scanf("%d",&n);
ans = -1;
for(i = 1; i
2847172_ac_1229ms_148k.cpp
#include
#include
int main()
{
int n, mark[21];
int map[21][21];
int i, j, t, ans, tmp;
scanf("%d",&n);
ans = -1;
for(i = 1; i
2847176_ac_604ms_148k.cpp
#include
#include
int main()
{
int n, mark[21];
int map[21][21];
int i, j, t, ans, tmp;
scanf("%d",&n);
ans = -1;
for(i = 1; i