#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
1.
bool cmp(char a,char b){ 參數類型看情況寫
return a>b;
}
using namespace std;
int main(){
char c[] = {'T', 'W', 'A', 'K'};
sort(c, c + 4,cmp);
for(int i = 0; i < 4; i++){
printf("%c",c[i]);
}
system("pause");
return 0;
}
*/
struct Student{
char id[15];
int score;
int location_number;
int local_rank;
}stu[30010];
bool cmp(Student a, Student b){
if(a.score != b.score) return a.score > b.score;
else return a.id < b.id;
}
int main(){
int n,k,num=0;
scanf("%d",&n);
for(int i = 1; i <= n; i++){
scanf("%d",&k);
for(int j = 0; j < k; j++){
scanf("%s %d", stu[num].id, &stu[num].score);
stu[num].location_number = i;
num++;
}
sort(stu + num - k, stu + num, cmp);
stu[num - k].local_rank = 1;
for(int j = num - k + 1; j < num; j++){
if(stu[j].score == stu[j - 1].score){
stu[j].local_rank = stu[j - 1].local_rank;
}else{
stu[j].local_rank = j + 1 - (num - k);
}
}
}
printf("%d\n", num);
sort(stu, stu + num,cmp);
int r = 1;
for(int i = 0; i < num; i++){
if(i > 0 && stu[i].score != stu[i - 1].score){
r = r + 1;
}
printf("%s ",stu[i].id);
printf("%d %d %d\n", r, stu[i].location_number,stu[i].local_rank);
}
system("pause");
return 0;
}
2.
int cal(int n, int p){
int count = 0;
for(int i = 2; i <= n; i++){
int temp = i;
while(temp % p == 0){
count++;
temp = temp / p;
}
}
return count;
}
int main(){
int n, p;
scanf("%d%d", &n, &p);
int count = cal(n,p);
printf("%d",count);
system("pause");
return 0;
}
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
3.
int main(){
double n;
scanf("%lf",&n);
if(n <= 3){
printf("10.0");
}
if(n>3 && n<=10){
printf("%.1f",10 + (n-3)*2);
}
if(n>10){
printf("%.1f",10 + 7*2 + (n-10)*3);
}
system("pause");
return 0;
}
4.
int main(){
double x = 2.7;
double y = 7;
printf("%f\n",pow(x,y));
system("pause");
return 0;
}
5.
int main(){
int n;
scanf("%d",&n);
int num[n];
for(int i = 0; i < 10; i++){
num[i] = 0;
}
int x = 0;
for(int i = 0; i < n; i++){
scanf("%d",&x);
num[x]++;
}
for(int i = 0; i < 10; i++){
if(num[i] != 0){
printf("%d %d\n",i,num[i]);
}
}
system("pause");
return 0;
}
6.
int main()
{
char c;
int shu[10]={0},i;
while((c=getchar())!='\n')
{
if(c>='0'&&c<='9')
shu[c-'0']++;
}
for(i=0;i<=9;i++){
printf("%d有%d個\n",i,shu[i]);
}
system("pause");
return 0;
}
2020.5.2/週六
by 922