代码搜索:Sign
找到约 10,000 项符合「Sign」的源代码
代码结果 10,000
www.eeworm.com/read/348596/10882456
txt 3087.txt
Source
Problem Id:3087 User Id:fzk
Memory:1588K Time:187MS
Language:Java Result:Accepted
Source
import java.util.*;
import java.io.*;
import java.lang.reflect.Array;
public class
www.eeworm.com/read/348596/10882625
txt 2588.txt
Problem Id:2588 User Id:fzk
Memory:64K Time:45MS
Language:C++ Result:Accepted
Source
#include"stdio.h"
#include"math.h"
const double eps=1e-7;
struct cir
{
double x,y,r;
}c[100
www.eeworm.com/read/348596/10882659
txt 1595.txt
#include
int p[1010];
int sign[1010];
int main()
{
int i,j,k,a,b,m,c,d;
k = 0;
for( i=0; i
www.eeworm.com/read/348596/10882662
txt 2356.txt
#include
#include
short a[10000];
int s[10000];
short sign[10000];
int main()
{
int i, n, t, j;
scanf( "%d", &n );
memset( sign, -1, sizeof(sign) );
for( i=0
www.eeworm.com/read/348596/10883126
txt 2344.txt
#include"stdio.h"
#include"algorithm"
#include"math.h"
using namespace std;
int n,m;
const double eps=1e-8;
const int size=2000;
double a[size][size];
bool sign[size];
void swap_c
www.eeworm.com/read/348596/10883159
txt 2773.txt
Problem Id:2773 User Id:fzk
Memory:4160K Time:125MS
Language:G++ Result:Accepted
Source
#include "stdio.h"
#include "memory.h"
int s[1000010];
bool sign[1000010];
int gcd( int a, in
www.eeworm.com/read/348596/10883221
txt 2864.txt
Source
Problem Id:2864 User Id:fzk
Memory:24K Time:15MS
Language:C++ Result:Accepted
Source
#include
#include
int main( ) {
int n, d, i, t, sign[101];
whil
www.eeworm.com/read/348596/10883285
txt 1674.txt
#include "stdio.h"
int a[10000], ans;
bool sign[10000];
int main()
{
int cas, n, i, j;
scanf( "%d\n", &cas );
while( cas-- )
{
scanf( "%d", &n );
for( i=0; i
www.eeworm.com/read/348596/10883288
txt 2262.txt
#include"iostream.h"
#include"math.h"
#include"algorithm"
using namespace std;
bool sign[1000001];
int prime[1000001],size;
int main()
{
int n,j,i;
int const *p;
for(i=2;i
www.eeworm.com/read/348596/10883334
txt 2415.txt
#include"iostream.h"
#include"queue"
#include"algorithm"
using namespace std;
char edge[51][51];
int sign[51][51][51],n,p1,p2,p3;
struct node
{
int p[3];
int steps;
};
queue q