代码搜索:Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/443457/7632725
cpp 1861.cpp
#include
#include
#include
struct travel{
int ttsm,ttem;
}tr[101];
int main()
{
int id,hh,mm;
char option;
int num=0,times=0;
memset(tr,-1,s
www.eeworm.com/read/443457/7632726
cpp 1034.cpp
#include
#include
#include
using namespace std;
int main()
{
int n,num,i,s;
int candy[1001],add[1001];
while(cin>>n,n){
memset(candy,0,sizeof(can
www.eeworm.com/read/443457/7632756
cpp 1342.cpp
#include
int main()
{
int num[13],n,i,t=0;
while(cin>>n,n){
if(t++)
cout
www.eeworm.com/read/443457/7632763
cpp 1854.cpp
#include
#include
using namespace std;
void main()
{
int i,len,f,num,t;
string s;
cin>>t;
while(t--){
cin>>s;
len=s.size();
num=f=0
www.eeworm.com/read/443457/7632776
cpp 1796.cpp
#include
#include
using namespace std;
int m;
__int64 n, sum;
vector num;
__int64 gcd(__int64 a, __int64 b)
{
__int64 t;
if (a > b)
{
t = a, a = b, b
www.eeworm.com/read/443457/7632777
cpp 1455.cpp
#include
#include
#include
#define MAX 66
using namespace std;
int stick[MAX];
int num, slen, snum, total, len;
bool use[MAX], f;
bool cmp(int a, int b)
{
www.eeworm.com/read/443457/7632821
cpp 1787.cpp
#include
#include
using namespace std;
int n, num, mm;
bool prime;
int main()
{
int i;
while (cin >> n, n)
{
double t = sqrt(double(n));
prime = true;
if (n ==
www.eeworm.com/read/443457/7632828
cpp 1528.cpp
#include
#include
#include
using namespace std;
struct card
{
char a;
char b;
int value;
int node;
};
card ha[52], he[52];
bool cmp(card x, ca
www.eeworm.com/read/443457/7632834
cpp 1250.cpp
#include
#include
using namespace std;
char num[7100][2010];
int len[7100];
void plusnum(int x,int y)
{
int inc,i,mlen;
inc=0;
mlen=len[x] > len[y] ? len[x] :
www.eeworm.com/read/443457/7632902
cpp 1073.cpp
#include
#include
using namespace std;
string input,output;
char key[5005];
int main()
{
int test;
scanf("%d", &test);
getchar();
while (test--)
{
int num = 0;