Submission #6002403
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define ld long double #define ll long long #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define spa << " " << #define MP make_pair const ll MOD = 1e9+7; //const ll MOD = 998244353; ll INF = 1e18; void chmin(ll &a,ll b){if(a>b)a=b;} void chmax(ll &a,ll b){if(a<b)a=b;} void pmod(ll &a,ll b){a=(a+b)%MOD;} void qmod(ll &a,ll b){a=(a*b)%MOD;} void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;} void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;} void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;} void ans(bool x,ll y,ll z){if(x)cout<<y<<endl;else cout<<z<<endl;} void ans(bool x,string y,string z){if(x)cout<<y<<endl;else cout<<z<<endl;} ll gcd(ll x,ll y){ll r;while((r=x%y)!=0){x=y;y=r;}return y;} int main(){ ll i,j,o; ll res=0,res1=INF,res2=-INF,buf=0,buf1=0,buf2=0,buf3=0,buf4=0,sum=0; ll l,r; bool judge = true; string a;cin>>a; res=1; ll n=a.size(); vector<ll> b(26); for(i=0;i<n;i++){ b[a[i]-'a']++; } for(i=0;i<25;i++){ //cout<<res<<endl; for(j=i+1;j<26;j++){ res+=b[i]*b[j]; } } cout<<res<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Reverse and Compare |
User | tute7627 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1239 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 8 ms | 640 KB |
subtask_1_03.txt | AC | 1 ms | 256 KB |
subtask_1_04.txt | AC | 1 ms | 256 KB |
subtask_1_05.txt | AC | 1 ms | 256 KB |
subtask_1_06.txt | AC | 1 ms | 256 KB |
subtask_1_07.txt | AC | 2 ms | 256 KB |
subtask_1_08.txt | AC | 8 ms | 640 KB |
subtask_1_09.txt | AC | 8 ms | 640 KB |
subtask_1_10.txt | AC | 8 ms | 640 KB |
subtask_1_11.txt | AC | 9 ms | 640 KB |
subtask_1_12.txt | AC | 8 ms | 640 KB |
subtask_1_13.txt | AC | 8 ms | 640 KB |
subtask_1_14.txt | AC | 8 ms | 640 KB |
subtask_1_15.txt | AC | 8 ms | 640 KB |
subtask_1_16.txt | AC | 8 ms | 640 KB |
subtask_1_17.txt | AC | 8 ms | 640 KB |