UVA-OJ
文章平均质量分 87
dazhangyu97
补充信息是一件很烦的事情,因为我必须要扯一些文字来说明自己,而实际上我这个人没什么好说的。
展开
-
[UVA - 340] Master-Mind Hints
MasterMind is a game for two players. One of them, Designer, selects a secret code. The other, Breaker, tries to break it. A code is no more than a row of colored dots. At the beginning of a game, the原创 2017-10-10 23:56:29 · 218 阅读 · 0 评论 -
[Score, ACM/ICPC Seoul 2005, UVA1585]
吐槽!!!我好心让最后一行不\n,结果直接wrong answer,全部换行结果AC…#include <stdio.h>char s[85];void showScore(char *s) { int sum = 0; //int tagOfx = 1; int numOfo = 0; for(int i=0; s[i]!='\0'; ++i) {原创 2017-10-13 00:32:54 · 245 阅读 · 0 评论 -
[Digit Generator, ACM/ICPC Seoul 2005, UVA1583]
大阻力是开10万数组的魄力…#include <stdio.h>#include <string.h>int a[100005];int main(){ memset(a, 0, sizeof(a)); for(int i=1; i<100005; ++i) { int tmp1 = i; int tmp2 = i; while原创 2017-10-13 00:28:40 · 242 阅读 · 0 评论 -
[Periodic Strings, UVA455 ]
[Periodic Strings, UVA455 ]#include <stdio.h>#include <string.h>char s[85];int main() { int T; //freopen("test.txt", "r", stdin); scanf("%d", &T); while(T--) { int per[80];原创 2017-10-14 13:00:49 · 188 阅读 · 0 评论 -
[Crossword Answers UVA - 232 ]
Crossword Answers UVA - 232#include #include //#define LOCALchar s[12][12];int num[12][12];int main(){ int cases = 0;#ifdef LOCAL freopen("test.txt", "r", stdin);#endif in原创 2017-10-14 13:09:46 · 261 阅读 · 0 评论 -
[Molar Mass, ACM/ICPC Seoul 2007, UVA1586]
Molar Mass, ACM/ICPC Seoul 2007, UVA1586原创 2017-10-13 00:39:02 · 380 阅读 · 0 评论