-
-
0http://www.juanlaile.monster/300juan/
-
3为什么试遍浏览器和邮箱都收不到邮件啊,好绝望🙁
-
11RT,我前几天注册了一个账号,可是uva没发激活邮件来,垃圾邮件什么的也看了就是没有,一开始用的是gmail,后来怀疑是邮箱的问题,就换了sina,也没有用。。。在网上搜索了半天也没解决,在这里我想问问大家当初是怎么注册上的?
-
4请问《算法竞赛入门经典》(紫书)上的习题有参考代码吗? 新手刚开始看这本书
-
0
-
4
-
1
-
2#include<cstdio> #include<algorithm> #include<cmath> using namespace std; const double eps = 10e-9; struct Sprinkler { double start, end; bool operator< (const Sprinkler &a) const { return start < a.start; } } s[10010]; int main() { int n, l, w, i, suc; while (scanf("%d%d%d", &n, &l, &w) == 3) { suc = 0; int k = 0; //initialize for (i = 0; i < n; i++) { int p,r; double x,y,d; scanf("%d%d", &p,&r); if(2 * r <= w) x = y = l + 1.0; else { d = sqrt(r*r - (double)w * w / 4.0);//神坑 x = p - d; y = p + d; } s[i] = (Sprinkler
-
0RT,用的FireFox浏览器。
-
5我换了N种注册方式,还是提示Bad captcha! 看了之前的帖子,发现还有注册了之后不发送邮件的问题 我想知道是不是只有我一个人有这种问题,还是 uvaoj 有问题
-
0rt #include <iostream> #include <algorithm> #include <cstring> using namespace std; char a[5010]; char b[5010]; int sab[30]; int sae[30]; int sbb[30]; int sbe[30]; int d[5010][5010]; int main() { int T; cin >> T; while (T--) { cin >> (a + 1) >> (b + 1); int lena = strlen(a + 1); int lenb = strlen(b + 1); memset(sab, -1, sizeof sab); memset(sae, -1, sizeof sae); memset(sbb, -1, sizeof sbb); memset(sbe, -1, sizeof sbe); memset(d, 0x7f, sizeof d); for (int i = 1; i <= lena; i++) { if (sab[a[i] - 'A'] == -1) sab[a[i] - 'A'] = i; sae[a[i] - 
-
0#include<map> #include<iostream> #include<string> #include<iterator> using namespace std; int main() { int n = 0; cin >> n; while (n--) { map<string, string>first; map<string, string>last; string fkey[100], fval[100], lkey[100], lval[100]; string a, b; int flag1 = 1, flag2 = 1; int tempf, templ; int flag3 = 1; cin >> a; cin >> b; fkey[0] = a[1]; for (int i = 2,k=0; i < a.size()-1; i++) { if ((a[i] !=':')&&flag1) { fkey[k] += a[i]; } else if (flag2) { flag1 = 0; i++; flag2 = 0; } if ((a[i] != ',') && !flag
-
1编译失败。‘gets’未声明
-
2样例输入 TRGSJ XDOKI M VLN WPABE UQHCF ARRBBL0 ABCDE FGHIJ KLMNO PQRS TUVWX AAA LLLL0 ABCDE FGHIJ KLMNO PQRS TUVWX AAAAABBRRRLL0 样例输出 Puzzle #1: T R G S J X O K L I M D V B N W P A E U Q H C F Puzzle #2: A B C D F G H I E K L M N J P Q R S O T U V W X Puzzle #3: This puzzle has no final configuration. 这是我的代码:求大神帮忙看看,为什么会wa #include<stdio.h> void fac(char ); char a[10][10],b[100],c,count=0; int x=1,m,n; int main(){ char d; int i,j; while(scanf("%c",&d)&&d!='Z'){ a[0][0]=d; for(i=1;i<=4;i++) scanf("%c&
-
0评论或私信我都可以
-
5/* 自己没找出来,示例能过,请高手挑错,谢谢! 代码(C++): */ #include <iostream> using namespace std; int main() { int N=0; cin>>N; for(int i=0;i<N;i++) { string str="",period=""; // do { cin>>str; } while(str==""); for(int j=0;j<str.size();j++) { if(str[j]==' ') { string temp=""; for(int k=0;k<j;k++) temp+=str[k]; str=temp; } } //int count=0; period=str[0]; for(int j=1;j<str.size();j++) { if(str[j]!=period[j%period.size()]) { for(int k=period.size();k<=j;k++) period+=str[k]; } } if(str
-
0我还以为是美国UVA数控机床的吧。
-
2一楼祭度娘
-
10换了好几个浏览器都不行,你们都是怎么进入uva oj的啊
-
0如题,是直接read,write,还是要关联输入输出文件?求高手解答
-
0可降30刀,需要请私信
-
0ค้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้ค้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้้ค้้้้้้้้้
-
1如题,uva 1295 house divided ,显示好像只有4次AC的题目,希望有高手可以帮忙解答。
-
1忧郁
-
1Problem A : Goldbach's Conjecture From: UVA, 543Submit Time Limit: 3000 MS In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every number greater than 2 can be written as the sum of three prime numbers. Goldbach cwas considering 1 as a primer number, a convention that is no longer followed. Later on, Euler re-expressed the conjecture as: Every even number greater than or equal to 4 can be expressed as the sum of two prime numbers. For example: 8 = 3 + 5. Both 3 and 5 are odd prime numbers. 20 = 3 + 17 = 7
-
0代码如下: #include <stdio.h> #include <stdlib.h> #include <string.h> char in[100][10]; int main() { int i,j,x,y,p=0,g=0,h,q,m=1,judge[100]={0},e=1; char puzzle[5][5],b,puzzle2[100][5][5]; while(m==1){ for(i=0;i<5;i++){ for(j=0;j<5;j++){ scanf("%c",&puzzle[i][j]); if(puzzle[0][0]=='Z') i=5,j=5,e=0,m=0,g--; } getchar(); } for(i=0;i<5;i++) for(j=0;j<5;j++) if(puzzle[i][j]==' ') x=i,y=j; if(e==1) for(p=0;p<100;p++){ scanf("%s",in[p]); h=strlen(in[p])-1; // printf("%c\n",in[0]); getchar(); i=0; while(i<=h){
-
0
-
0#include <string> #include <cstring> #include<ctype.h> using namespace std; const int maxn=1024; int a1[maxn],a2[maxn]; int n,number; int count[maxn]; int count_i; int score; int i,j; int s_i; string s; void build(string s,int a[maxn]) { i=0; s_i=0; number=maxn; while(s_i<s.size()) { if (s[s_i]=='p'){count_i++;number=number/4;} else if(s[s_i]=='e'){i+=number;count[count_i]++;} else { j=number; while(j--) { a[i++]=1; } count[count_i]++; } if (count[count_i]==4) { count[count_i]=0; count_i--; number=number*4; } s_i++; } } int main() { cin>>n; while(n--)
-
8我最害怕RE。。。 貌似都喜欢pe吧?嘿嘿。