Submission #64503101
Source Code Expand
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ull unsigned long long
#define ld long double
#define int long long
#define nl "\n"
#define oo 1e9 + 1
#define OO 1e18 + 1
#define sp ' '
#define sz(x) (int)(x.size())
#define MOD 1000000007
#define fixed(n) fixed << setprecision(n)
#define sub_mod(a, b, m) ((((a) % m) - ((b) % m) + m) % m)
#define add_mod(a, b, m) ((((a) % m) + ((b) % m)) % m)
#define mult_mod(a, b, m) ((((a) % m) * ((b) % m)) % m)
#define EPS 1e-9
#define PI acos(-1)
using namespace __gnu_pbds;
using namespace std;
ll powr(ll b,ll n)
{
ll pow=1;
while(n>0){
if(n%2)pow=pow*b;
b=b*b;
n/=2;
}
return pow;
}
ll powrmod(ll b,ll n,ll m){
ll pow=1;
while(n>0){
if(n%2)pow=mult_mod(pow,b,m);
b=mult_mod(b,b,m);
n/=2;
}
return pow;
}
void solve(int tc)
{
int n, m;
cin >> n >> m;
int sum = 0;
for (int i = 0; i <= m; i++){
sum += powr(n, i);
if(sum > 1e9){
cout << "inf" << nl;
return;
}
}
cout << sum << nl;
}
signed main(void)
{
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
int tc = 1;
//cin >> tc;
int i = 1;
while (tc--)
{
// cout<<"Case #"<<i<<": ";
solve(i++);
}
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - Sum of Geometric Series |
| User | Mazen_Ghanayem |
| Language | C++ 23 (gcc 12.2) |
| Score | 200 |
| Code Size | 1470 Byte |
| Status | AC |
| Exec Time | 1 ms |
| Memory | 3640 KiB |
Compile Error
Main.cpp: In function ‘void solve(long long int)’:
Main.cpp:41:16: warning: unused parameter ‘tc’ [-Wunused-parameter]
41 | void solve(int tc)
| ^
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 200 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample00.txt, sample01.txt, sample02.txt, sample03.txt |
| All | sample00.txt, sample01.txt, sample02.txt, sample03.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt, testcase30.txt, testcase31.txt, testcase32.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample00.txt | AC | 1 ms | 3560 KiB |
| sample01.txt | AC | 1 ms | 3432 KiB |
| sample02.txt | AC | 1 ms | 3432 KiB |
| sample03.txt | AC | 1 ms | 3480 KiB |
| testcase00.txt | AC | 1 ms | 3484 KiB |
| testcase01.txt | AC | 1 ms | 3640 KiB |
| testcase02.txt | AC | 1 ms | 3428 KiB |
| testcase03.txt | AC | 1 ms | 3480 KiB |
| testcase04.txt | AC | 1 ms | 3460 KiB |
| testcase05.txt | AC | 1 ms | 3372 KiB |
| testcase06.txt | AC | 1 ms | 3636 KiB |
| testcase07.txt | AC | 1 ms | 3508 KiB |
| testcase08.txt | AC | 1 ms | 3496 KiB |
| testcase09.txt | AC | 1 ms | 3440 KiB |
| testcase10.txt | AC | 1 ms | 3568 KiB |
| testcase11.txt | AC | 1 ms | 3412 KiB |
| testcase12.txt | AC | 1 ms | 3556 KiB |
| testcase13.txt | AC | 1 ms | 3484 KiB |
| testcase14.txt | AC | 1 ms | 3480 KiB |
| testcase15.txt | AC | 1 ms | 3640 KiB |
| testcase16.txt | AC | 1 ms | 3468 KiB |
| testcase17.txt | AC | 1 ms | 3496 KiB |
| testcase18.txt | AC | 1 ms | 3484 KiB |
| testcase19.txt | AC | 1 ms | 3428 KiB |
| testcase20.txt | AC | 1 ms | 3436 KiB |
| testcase21.txt | AC | 1 ms | 3428 KiB |
| testcase22.txt | AC | 1 ms | 3512 KiB |
| testcase23.txt | AC | 1 ms | 3552 KiB |
| testcase24.txt | AC | 1 ms | 3328 KiB |
| testcase25.txt | AC | 1 ms | 3500 KiB |
| testcase26.txt | AC | 1 ms | 3436 KiB |
| testcase27.txt | AC | 1 ms | 3404 KiB |
| testcase28.txt | AC | 1 ms | 3452 KiB |
| testcase29.txt | AC | 1 ms | 3568 KiB |
| testcase30.txt | AC | 1 ms | 3484 KiB |
| testcase31.txt | AC | 1 ms | 3508 KiB |
| testcase32.txt | AC | 1 ms | 3472 KiB |