代码搜索:while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/452050/7450013
cpp 3094941_ole.cpp
#include
#include
#include
using namespace std;
typedef __int64 ll;
ll Fac[640], Time = 12983;
const int MAX_COUNT = 32;
ll PowerMod(ll a, ll b, ll n)
{
www.eeworm.com/read/452050/7450015
cpp 3094927_ole.cpp
#include
#include
#include
using namespace std;
typedef __int64 ll;
ll Fac[640], Time = 12983;
const int MAX_COUNT = 32;
ll PowerMod(ll a, ll b, ll n)
{
www.eeworm.com/read/452050/7450016
cpp 3094902_re.cpp
#include
#include
#include
using namespace std;
typedef __int64 ll;
ll Fac[640], Time = 12983;
const int MAX_COUNT = 32;
ll PowerMod(ll a, ll b, ll n)
{
www.eeworm.com/read/452050/7450017
cpp 3094909_re.cpp
#include
#include
#include
using namespace std;
typedef __int64 ll;
ll Fac[640], Time = 12983;
const int MAX_COUNT = 32;
ll PowerMod(ll a, ll b, ll n)
{
www.eeworm.com/read/452050/7450018
cpp 3094928_re.cpp
#include
#include
#include
using namespace std;
typedef __int64 ll;
ll Fac[640], Time = 12983;
const int MAX_COUNT = 32;
ll PowerMod(ll a, ll b, ll n)
{
www.eeworm.com/read/452050/7450020
cpp 3094898_re.cpp
#include
#include
#include
using namespace std;
typedef __int64 ll;
ll Fac[64], Time = 12983;
const int MAX_COUNT = 32;
ll PowerMod(ll a, ll b, ll n)
{
www.eeworm.com/read/452050/7450022
cpp 3094938_tle.cpp
#include
#include
#include
using namespace std;
typedef __int64 ll;
ll Fac[640], Time = 12983;
const int MAX_COUNT = 32;
ll PowerMod(ll a, ll b, ll n)
{
www.eeworm.com/read/452050/7450128
cpp 2410648_ac_1343ms_40k.cpp
#include
#include
#include
#include
char exp[110];
char op[] = "+-*/";
int res, p;
int stack[11];
int cal()
{
char tmp[110], cat[110];
int i,
www.eeworm.com/read/452050/7450203
cpp 3129828_wa.cpp
#include
#include
double INF = 210000000000;
using namespace std;
double x[1001], y[1001];
int main()
{
int i, j, n, l;
int cas, max, ans;
double K[1001];
c
www.eeworm.com/read/452050/7450204
cc 3129859_ac_2188ms_260k.cc
#include
#include
double INF = 10000000;
using namespace std;
double x[1001], y[1001];
int main()
{
int i, j, n, l;
int cas, max, ans;
double K[1001];
char