BNUOJ34973Liserious战队

最新推荐文章于 2025-08-09 15:58:26 发布

转载最新推荐文章于 2025-08-09 15:58:26 发布 · 92 阅读

文章标签：

#java

本文介绍如何计算Liserious战队在世界密室逃脱委员会等级系统中的等级，涉及经验累积规则、密室类型数量及经验值计算，提供算法实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Liserious战队

Time Limit: 1000ms

Memory Limit: 65536KB

64-bit integer IO format: %lld Java class name: Main

Prev Submit Status Statistics Discuss Next

Font Size: + -

Type: None Graph Theory 2-SAT Articulation/Bridge/Biconnected Component Cycles/Topological Sorting/Strongly Connected Component Shortest Path Bellman Ford Dijkstra/Floyd Warshall Euler Trail/Circuit Heavy-Light Decomposition Minimum Spanning Tree Stable Marriage Problem Trees Directed Minimum Spanning Tree Flow/Matching Graph Matching Bipartite Matching Hopcroft–Karp Bipartite Matching Weighted Bipartite Matching/Hungarian Algorithm Flow Max Flow/Min Cut Min Cost Max Flow DFS-like Backtracking with Pruning/Branch and Bound Basic Recursion IDA* Search Parsing/Grammar Breadth First Search/Depth First Search Advanced Search Techniques Binary Search/Bisection Ternary Search Geometry Basic Geometry Computational Geometry Convex Hull Pick's Theorem Game Theory Green Hackenbush/Colon Principle/Fusion Principle Nim Sprague-Grundy Number Matrix Gaussian Elimination Matrix Exponentiation Data Structures Basic Data Structures Binary Indexed Tree Binary Search Tree Hashing Orthogonal Range Search Range Minimum Query/Lowest Common Ancestor Segment Tree/Interval Tree Trie Tree Sorting Disjoint Set String Aho Corasick Knuth-Morris-Pratt Suffix Array/Suffix Tree Math Basic Math Big Integer Arithmetic Number Theory Chinese Remainder Theorem Extended Euclid Inclusion/Exclusion Modular Arithmetic Combinatorics Group Theory/Burnside's lemma Counting Probability/Expected Value Others Tricky Hardest Unusual Brute Force Implementation Constructive Algorithms Two Pointer Bitmask Beginner Discrete Logarithm/Shank's Baby-step Giant-step Algorithm Greedy Divide and Conquer Dynamic Programming Tag it!

Liserious战队是一支活跃在京沪地区的著名密室逃脱战队，在优秀的队长Liserious和芳姐的带领下，打遍天下大大小小的密室逃脱，攻无不克，战无不胜，上天入地无所不能。

世界密室逃脱委员会以ISO9000000000001标准制定了一套密室逃脱战队评级系统，一共分为1~99级，通过经验值的积累增长等级。初始经验为0，一级到二级升级所须要经验为4，二级到三级升级所须要的经验为9，三级到四级升级所需经验为16……以此类推，九十八到九十九级升级所须要的经验为9801。通关不同类型的密室所获得的经验值不一定同样。

世界密室逃脱委员会统计了Liserious战队通关的密室类型数量N，以及每种密室通关所获得的经验值K和通关的个数M。委员会想知道如今Liserious战队的等级是多少。

Input

第一行为一个整数N（0≤N≤100）。

之后N行每行有两个整数K和M（0≤K≤100，1≤M≤100）。

Output

一行“Team Liserious' rank is R”，不含双引號，R为Liserious战队如今的等级。

Sample Input

2
12 21
31 13

Sample Output

Team Liserious' rank is 12

Source

第十二届北京师范大学程序设计竞赛决赛

Author

zyy

#include<stdio.h>
int main()
{
    long long aa[105],sum,a,b;
    aa[1]=0;
    for(long long  i=2;i<=99;i++)
    aa[i]=aa[i-1]+i*i;
    int n;
    scanf("%d",&n);
    sum=0;
    while(n--)
    {
        scanf("%lld%lld",&a,&b);sum+=a*b;
    }
    int i;
    for(i=99;i>0;i--)
    if(sum>=aa[i])
    {
        printf("Team Liserious' rank is %d\n",i);break;
    }
}