CodeForces 5A - Chat Servers Outgoing Traffic
2015-08-11 16:26
706 查看
1、理解题意,向在线的人发消息,计算长度
2、使用cin.getline()读入数据
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <algorithm>
#include <cctype>
#include <stack>
#include <queue>
#include <string>
#include <cstring>
#include <iomanip>
#include <set>
#include <vector>
#include <cstdio>
#include <stack>
#include <sstream>
#include <cstring>
#include <map>
using namespace std;
#define TEST
int main()
{
/* #ifdef TEST
freopen("C:\\Users\\MrZis\\Desktop\\input.txt","r",stdin);
freopen("C:\\Users\\MrZis\\Desktop\\output.txt","w",stdout);
#endif*/
char str[10005];
int sum=0,num=0;
while(cin.getline(str,10005))
{
if(str[0]=='+')
num++;
else if(str[0]=='-')
num--;
else
{
int lenth=strlen(str);
for(int i=0;i<lenth;i++)
{
int tmp1=0,tmp2=0;
if(str[i]==':')
{
tmp1=i;
tmp2=num*(lenth-(tmp1+1));
sum+=tmp2;
}
}
}
}
cout<<sum;
return 0;
}
2、使用cin.getline()读入数据
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <algorithm>
#include <cctype>
#include <stack>
#include <queue>
#include <string>
#include <cstring>
#include <iomanip>
#include <set>
#include <vector>
#include <cstdio>
#include <stack>
#include <sstream>
#include <cstring>
#include <map>
using namespace std;
#define TEST
int main()
{
/* #ifdef TEST
freopen("C:\\Users\\MrZis\\Desktop\\input.txt","r",stdin);
freopen("C:\\Users\\MrZis\\Desktop\\output.txt","w",stdout);
#endif*/
char str[10005];
int sum=0,num=0;
while(cin.getline(str,10005))
{
if(str[0]=='+')
num++;
else if(str[0]=='-')
num--;
else
{
int lenth=strlen(str);
for(int i=0;i<lenth;i++)
{
int tmp1=0,tmp2=0;
if(str[i]==':')
{
tmp1=i;
tmp2=num*(lenth-(tmp1+1));
sum+=tmp2;
}
}
}
}
cout<<sum;
return 0;
}
相关文章推荐
- Codeforces Round #197 (Div. 2)
- Codeforces Round #198 (Div. 1)
- Codeforces 405E Codeforces Round #238 (Div. 2)E
- Codeforces 407C Codeforces Round #239 (Div. 1)C
- CodeForces 449A - Jzzhu and Chocolate
- CodeForces 449 B. Jzzhu and Cities
- Codeforces Round #265 (Div. 2)
- Codeforces #310 div2 C. Case of Matryoshkas
- 状态压缩DP codeforces 244 Problem C. The Brand New Function 和 codeforces 165 E. Compatible Numbers
- codeforces 16 Problem E fish
- Codeforces round #247 for Div. 2
- Codeforces Round #246 (Div. 2)
- Codeforces #264(div 2)D.Gargari and Permutations
- Codeforces Round #236 (Div. 2)------A,B
- codeforces 257 div2 B
- Codeforces Gym100571A Cursed Query
- Codeforces Gym100342E Minima
- Codeforces Gym100342J Triatrip
- Codeforces Gym100286B Blind Walk (dfs)
- Codeforces Gym100342J Triatrip