51CTO博客开发
#include<iostream>#include<algorithm> using namespace std; int data[10001]; int main(){ int cyle,i=0; cin>>cyle; while(cyle--
#include<stdio.h> int main() { int a,b; int n,m; int sum,count; int i; while(scanf("%d%d",&m,&n)!=EOF) { if(m>n) { a=n; b=m; } else {a=m;
#include<stdio.h> #include<math.h> int main() { int i,k ; int n ,m; int sum=0; int a[102]={0}; scanf("%d",&k); while(k--) { scanf("%d",&n); for(m=1;m<=n;m
#include<stdio.h> #include<math.h> #include<string.h> int main() { int i ; int n ,m; int sum=0; int a[20]={0}; while(1) { for(i=0;i<=16;i++) { if(a[0]==-
0MS #include<stdio.h> #include<math.h> int main() { int i,k,n; while(scanf("%d",&n)!=EOF) { i=(int)sqrt(double(2*n)); if(i*i+i<n*2)i++; k=i*(i+1)/2;
#include<iostream>using namespace std;int main(){ int p,e,i,d,a,t=0; while(1) { cin>>p>>e>>i>>d; if(p==-1 && e==-1 &&
C++ #include <string>#include <iostream>using namespace std;#define MAX 200unsigned int num[MAX+10];unsigned int num1[MAX+10];int
#include <iostream>#include <math.h>#define maxn 100001const double e = 2.7182818284590452354, pi = 3.141592653589793239;double biao[maxn];using namespace std;main(){ int i; biao
Copyright © 2005-2025 51CTO.COM 版权所有 京ICP证060544号
