A. Comparing Two Long Integers
题意:比较两个数的大小;
注意点:数字最多有1e6位,而不是最大是1e6;
#include<bits/stdc++.h>
const int maxn = 1e6+5;
char a[maxn], b[maxn];
int main()
{
while(scanf("%s%s", a, b)!=EOF)
{
int len1 = strlen(a);
int len2 = strlen(b);
int cnt1 = 0, cnt2 = 0;
for(int i = 0;i<len1;i++)
{
if(a[i] != '0') break;
if(a[i] == '0')
cnt1++;
}
for(int i = 0;i<len2;i++)
{
if(b[i] != '0') break;
if(b[i] == '0')
cnt2++;
}
if((len1-cnt1) != (len2-cnt2))
{
if((len1-cnt1) > (len2-cnt2))
printf(">\n");
else
printf("<\n");
}
else
{
bool flag = true;
for(int i = cnt1, j = cnt2;i<len1,j<len2;i++,j++)
{
if(a[i] != b[j])
{
if(a[i] - '0' > b[j] - '0')
printf(">\n");
else
printf("<\n");
flag = false;
break;
}
}
if(flag) printf("=\n");
}
}
return 0;
}
B. Dinner with Emma
题意:求每行的最小数中最大的数字;
#include<bits/stdc++.h>
using namespace std;
int n, m;
int main()
{
while(scanf("%d%d", &n, &m)!=EOF)
{
int minn = 1e9, maxx = -1;
for(int i = 1;i<=n;i++)
{
minn = 1e9;
for(int j = 1;j<=m;j++)
{
int x;
scanf("%d", &x);
minn = min(minn, x);
}
maxx = max(maxx, minn);
}
printf("%d\n", maxx);
}
return 0;
}
C. The Labyrinth
题意:当 “ * ” 变成 “ . ” 时,与其相连通的 “ . ” 有多少个,输出每个“ * ”位置上的相应数字;
思路:预先给相连通的“ . ”进行计数和标号,按块进行分类,之后就判断与“ * ”相连的点块,加上每个点块的点数(注意去重);
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1100;
char s[maxn][maxn];
bool vis[maxn][maxn];
int cur[maxn][maxn];
int num[maxn*maxn];
int f[4][2] = {-1, 0, 0, -1, 0, 1, 1, 0};
int n, m, cnt = 0;
void dfs(int x, int y)
{
vis[x][y] = true;
num[cnt]++;
cur[x][y] = cnt;
for(int i = 0;i<4;i++)
{
int nx = x+f[i][0];
int ny = y+f[i][1];
if(nx < 0 || nx >= n || ny < 0 || ny >= m || s[nx][ny] == '*' || vis[nx][ny])
continue;
dfs(nx, ny);
}
}
int main()
{
scanf("%d%d", &n, &m);
for(int i = 0;i<n;i++)
scanf("%s", s[i]);
memset(vis, false, sizeof vis);
memset(num, 0, sizeof num);
for(int i = 0;i<n;i++)
{
for(int j = 0;j<m;j++)
{
if(s[i][j] == '.' && !vis[i][j])
{
cnt++;
dfs(i, j);
}
}
}
for(int i = 0;i<n;i++)
{
for(int j = 0;j<m;j++)
{
if(s[i][j] == '.') printf(".");
else
{
int k = 0;
vector<int>vec;
for(int t = 0;t<4;t++)
{
int nx = i+f[t][0];
int ny = j+f[t][1];
if(nx < 0 || nx >= n || ny < 0 || ny >= m || s[nx][ny] == '*')
continue;
vec.push_back(cur[nx][ny]);
}
sort(vec.begin(), vec.end());
vec.erase(unique(vec.begin(), vec.end()), vec.end());
for(int t = 0;t<vec.size();t++)
k += num[vec[t]];
printf("%d", (k+1)%10);
}
}
printf("\n");
}
return 0;
}
D. Longest k-Good Segment
题意:求n个数中,不同数字的个数不超过k的最长子序列,输出从第几到第几;
思路:记录每个数出现的次数以及不同数字的个数cnt,当cnt > k时,从左边依次缩小子序列范围,直到cnt <= k,保持右边不变;
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6+5;
int n, k;
int arr[maxn], num[maxn];
int main()
{
scanf("%d%d", &n, &k);
for(int i = 1;i<=n;i++)
scanf("%d", &arr[i]);
int len = -1e9, cnt = 0, r;
for(int i = 1, j = 0;i<=n;i++)
{
if(++num[arr[i]] == 1)
cnt++;
while(cnt > k)
{
j++;
if(--num[arr[j]] == 0)
cnt--;
}
if((i - j) > len)
{
len = i-j;
r = i;
}
}
printf("%d %d\n", r-len+1, r);
return 0;
}
E. Sum of Remainders
m
题意:
∑
n % i ;
i=1
m m m
思路:
∑
n % i = ∑ n - (n / i) * i = n * m -∑ (n / i) * i
i=1 i=1 i=1
当 m > n 时,m比n大的部分就不用计算了,因为此时 n / i = 0;
我们假设n = 20,可得:
令 t = n / i,我们可以按照 t 进行循环,另一边就是一个等差数列,该等差数列的边界便是 l = n / (t + 1) + 1 ,r = n / t ;
分成两部分计算,一个是 1 ≤ t ≤ sqrt (n) 另一部分是根据 i 循环,直接用算式 (n / i) * i ;
另外,注意取余;
#include<bits/stdc++.h>
#define ll __int64
const ll mod = 1e9+7;
using namespace std;
ll n, m;
int main()
{
cin>>n>>m;
ll k = min(n, m);
ll ans = 0;
ll l, r, v = m+1;
for(int t = 1;t<=(int)sqrt(n*1.0);t++)
{
l = n/(t+1)+1;
r = n/t;
r = min(r, k);
if(l > r) continue;
v = min(v, l);
ll a = l+r;
ll b = r-l+1;
if(a % 2 == 0) a /= 2;
else b /= 2;
ll p = ((a%mod)*(b%mod))%mod;
ans += (p*t)%mod;
ans %= mod;
}
for(int t = v-1;t>=1;t--)
{
ll p = (n/t)%mod*t%mod;
ans += (p%mod);
ans %= mod;
}
ans = (((n%mod)*(m%mod))%mod-ans+mod)%mod;
cout<<ans<<endl;
return 0;
}