Which of these components correctly identify the unique value of the NAME column in the DBA_RESUMABLE view?A. Username, instance number, session IDB.
转载
2017-11-14 15:03:00
44阅读
2评论
基本全是水题 第一题水，不过有hack点，先增后不变再减 #include<map> #include<set> #include<cmath> #include<queue> #include<stack> #include<vector> #include<cstdio> #include<ca
转载
2017-07-14 16:11:00
90阅读
Integer InquiryOne of the first users of BIT's new supercomputer was Chip Diller. Heextended his explorationof powers of 3 to go from 0 to 333 and he explored taking various sumsof those numbers.``This supercomputer is great,'' remarked Chip. ``I only wish Timothy werehere to see thesere
转载
2013-08-02 22:45:00
55阅读
2评论
之前杭电上也做过a + b的高精度的题，不过这道题的区别是有多组数据。之前做的时候开了3个字符数组a,b,c，在计算的时候还要比较a，b长度，短的那个还要加'0'，还设置了一个add来存放进位。现在看来这种算法确实很繁琐。而这次只用了两个字符数组，一个放加数，一个放和。相比之前程序更短小了，而且可读...
转载
2014-07-01 08:44:00
54阅读
2评论
比赛链接：http://codeforces.com/contest/831A. Unimodal Array水题，关键要看清楚题意。#include <bits/stdc++.h>using namespace std;int n, a[110];int main(){ while(~scanf("%d",&n)){ for(int i=1; i&
原创
2022-04-19 11:26:47
76阅读
Integer InquiryDescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of
原创
2022-11-10 00:00:14
24阅读
题目：One of the first users of BIT’s new supercomputer was Chip Diller. He extended his explorati supercom...
原创
2023-02-08 10:18:38
72阅读
笛卡尔树DP+组合意义+路径统计之翻折法
转载
2020-03-22 11:01:00
73阅读
2评论
uva 424 Integer Inquiry题目大
原创
2023-07-26 17:18:26
102阅读
题目大意就是高精度A+B,多个高精度相加，以0作为结束字符，自然的要用到数组。解题思
原创
2021-12-01 16:31:31
218阅读
题目大意：求给出的整数的和
解题思路：不用爱上
原创
2023-04-07 10:43:15
44阅读
There are n people and k keys on a straight line. Every person wants to get to the office which is located on the line as well. To do that, he needs t
转载
2017-08-18 11:19:00
174阅读
2评论
9.23内含剧透，请vp后再来。不是题解！！！！！！！赛前下午下大雨没去图书馆，浪费了一下午，晚上准备 vp 一下 abc 和 cf，虽然但是最后只打了一把 abc。赛时A 题给了一个三角形的三条边，问是不是等腰三角形，直接判断有没有某两边相等即可。2min 通过。
B 题给了 n 个人和一个数 m，接下来给 k 行每行有一个人，如果一个人出现第 m 次就输出，
题目链接：UVA424大数相加问题，模拟手算即可，具体看代码：#include#include#includeusing namespace std;char number[255]={'0'};int answer[260]={0};void reverse(char* pointer);int main(){ int maxIndex=0; while(scanf("%s",number)&&strcmp(number, "0")) { int length=strlen(number); reverse(number
转载
2013-08-16 19:35:00
88阅读
2评论
Integer InquiryOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.``This supercomputer is great,'' remarked Chip. ``I only wish Timothy were here to see the
转载
2013-08-15 19:08:00
67阅读
2评论
424 - Integer InquiryTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&f BIT's ne
原创
2023-04-12 06:11:25
52阅读
题目Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k times. Find the length of a longest substring containing all re
是 WebDAV 协议（RFC 4918）定义的一个错误响应，表示当前请求依赖于另一个请求，但该依赖请求失败，导致当前请求无法成。??
Given an array A of 0s and 1s, we may change up to K values from 0 to 1. Return the length of the longest (contiguous) subarray that contains only 1s.
转载
2020-08-11 10:30:00
87阅读
2评论
xor是满足交换律的,展开后发现仅仅要能高速求出 [1mod1....1modn],....,[nmod1...nmodn]的矩阵的xor即可了....然后找个规律 C. Magic Formulas time limit per test 2 seconds memory limit per te
原创
2021-08-06 14:28:23
191阅读
