代码搜索:while
找到约 10,000 项符合「while」的源代码
代码结果 10,000
www.eeworm.com/read/452050/7449040
c 2023140_ac_0ms_48k.c
# include
int main()
{
long a, b, c;
while(scanf("%ld%ld%ld",&a,&b,&c)==3&&(a||b||c))
{
a = a-c;
if(a
www.eeworm.com/read/452050/7449086
c 1868439_ac_0ms_24k.c
# include
int main()
{
int i;
char str[22];
while(scanf("%s",str)==1)
{
for(i = 0; str[i]!='\0';)
{
if(str[i]=='B'||str[i]=='F'||str[i]=='P'||str[i]=='V')
www.eeworm.com/read/452050/7449092
c 3094860_ac_1499ms_152k.c
#include
#include
typedef __int64 ll;
ll Fac[64], time = 12983;
const int MAX_COUNT = 32;
ll PowerMod(ll a, ll b, ll n)
{
ll back = 0, temp = a % n;
b %= n;
www.eeworm.com/read/452050/7449093
c 3094858_wa.c
#include
#include
typedef __int64 ll;
ll Fac[64], time = 12983;
const int MAX_COUNT = 32;
ll PowerMod(ll a, ll b, ll n)
{
ll back = 0, temp = a % n;
b %= n;
www.eeworm.com/read/452050/7449108
cpp 2279154_pe.cpp
#include
#include
int f(char ch)
{
return ch-'A';
}
int g(char ch)
{
if(ch=='A'||ch=='E'||ch=='I'||ch=='O'||ch=='U')
return 0;
return 1;
}
int main()
{
i
www.eeworm.com/read/452050/7449109
c 2279177_ac_15ms_56k.c
#include
#include
int g(char ch)
{
if(ch=='A'||ch=='E'||ch=='I'||ch=='O'||ch=='U')
return 1;
return 0;
}
int main()
{
int i, j, l = 0;
char str[100];
char o
www.eeworm.com/read/452050/7449110
c 2279175_pe.c
#include
#include
int g(char ch)
{
if(ch=='A'||ch=='E'||ch=='I'||ch=='O'||ch=='U')
return 1;
return 0;
}
int main()
{
int i, j, l = 0;
char str[100];
char o
www.eeworm.com/read/452050/7449111
cpp 2279162_pe.cpp
#include
#include
int g(char ch)
{
if(ch=='A'||ch=='E'||ch=='I'||ch=='O'||ch=='U')
return 1;
return 0;
}
int main()
{
int i, l = 0;
char str[100];
char out[
www.eeworm.com/read/452050/7449135
c 1871559_ac_0ms_24k.c
# include
int main()
{
int k, i, j, m, n, p, q, a[14];
while(scanf("%d",&k)==1&&k)
{
for(i = 0; i < k; i++)
scanf("%d",&a[i]);
for(i = 0; i
www.eeworm.com/read/452050/7449189
cpp 2368805_tle.cpp
#include
using namespace std;
int n;
struct node
{
int a, b;
int h;
}ret[40001];
bool cmp(struct node a,struct node b)
{
if(a.h==b.h)
{
if(a.a==b.a)
return a.b