#include<stdio.h>
#include<string.h>
int main() {
void record(int a[],int b[],int n);
int seekMax(int a[],int n);
int number = 0;
scanf("%d",&number);
int original[1200];
int flag[11000];
memset(original,0,sizeof(int)*1200);
memset(flag,0,sizeof(int)*11000);
int i = 0;
for(i = 0; i < number; i++) {
scanf("%d",&original[i]);
}
record(original,flag,1200);
int result = 0;
result = seekMax(flag,11000);
printf("%d",result);
return 0;
}
void record(int a[],int b[],int n) {
int i,j = 0;
for(i=0; i < n; i++) {
int current = a[i];
int count = 1;
for(j = i+1; j<n; j++) {
if(current == a[j]) {
count++;
}
}
if(b[a[i]]==0&&a[i]!=0) {
b[a[i]]=count;
}
}
}
int seekMax(int a[],int n) {
int max,i = 0;
int position = 0;
for(i=0; i<n; i++) {
if(max < a[i]) {
max = a[i];
position = i;
}
}
return position;
}
#include<stdio.h>
int main()
{
int judge(int a[],int n);
char ISBN[13];
int number[13];
int i = 0;
int j = 0;
scanf("%s",&ISBN);
//把字符转成数字存储下来
for(i = 0;i<12;i++)
{
if(ISBN[i]!='-')
{
number[j]=ISBN[i]-'0';
j++;
}
}
//把识别码以两种形式存储下来
//第一种应对识别码是 'X'的情况
char flag = ISBN[12];
//第二种应对识别码是字符'0'~'9'的情况
int flagn = ISBN[12] - '0';
//如果正确输出 "Right"
if(flagn == judge(number,9)||flag=='X'&&judge(number,9)==10)
{
printf("Right");
}
else
{
if(judge(number,9)==10)
{
ISBN[12] = 'X';
}
else
{
ISBN[12] = '0'+judge(number,9);
}
printf("%s",ISBN);
}
return 0;
}
//判断正误
int judge(int a[],int n)
{
int i =0;
int sum =0;
for(i= 0;i<n;i++)
{
sum = sum + a[i]*(i+1);
}
return sum%11;
}
#include<stdio.h>
#include<string.h>
int main()
{
int getArea(int a[],int n);
int number[1100];
memset(number,0,sizeof(int)*1100);
int i =0;
int n =0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&number[i]);
}
printf("%d",getArea(number,1100));
return 0;
}
int getArea(int a[],int n)
{
int getMax(int a[],int n);
int i,j =0;
int maxheight = 0;
maxheight = getMax(a,n);
int area = 0;
int maxarea = 0;
for(i=1;i<=maxheight;i++)
{
area = 0;
for(j=0;j<n;j++)
{
if(a[j]<i)
{
area = 0;
}
else
{
area +=i;
}
if(maxarea<area)
{
maxarea = area;
}
}
}
return maxarea;
}
int getMax(int a[],int n)
{
int i=0;
int max =0;
for(i=0;i<n;i++)
{
if(max<a[i])
{
max = a[i];
}
}
return max;
}
#include<stdio.h>
#include<string.h>
int main()
{
int n = 0;
scanf("%d",&n);
long d[n][6];
memset(d,0,sizeof(d));
//__int64 a = 1;
int i = 0;
d[0][0] = 1;
for(i = 1;i<n;i++)
{
d[i][0]=(d[i-1][0])%1000000007;
d[i][1]=(d[i-1][1]*2 + d[i-1][0])%1000000007;
d[i][2]=(d[i-1][2] + d[i-1][0])%1000000007;
d[i][3]=(d[i-1][3]*2+d[i-1][1])%1000000007;
d[i][4]=(d[i-1][4]*2+d[i-1][1]+d[i-1][2])%1000000007;
d[i][5]=(d[i-1][5]*2+d[i-1][3]+d[i-1][4])%1000000007;
}
printf("%ld",d[n-1][5]);
printf("%d",sizeof(int));
return 0;
}
457
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
