Search found 3 matches
- Wed Jun 01, 2005 10:16 pm
- Forum: Volume 2 (200-299)
- Topic: 294 - Divisors
- Replies: 91
- Views: 39528
- Mon May 23, 2005 1:15 am
- Forum: Volume 2 (200-299)
- Topic: 294 - Divisors
- Replies: 91
- Views: 39528
294 - Divisors WA!!!
Here is my code. I don't know what is wrong with it. Please help.
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int N, L, H, P = 0, D = 0;
double nesto;
int divisors = 0;
cin >> N;
for(int i = 0; i < N; i++)
{
cin >> L >> H;
for(int j = L; j <= H; j ...
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int N, L, H, P = 0, D = 0;
double nesto;
int divisors = 0;
cin >> N;
for(int i = 0; i < N; i++)
{
cin >> L >> H;
for(int j = L; j <= H; j ...
- Wed Apr 13, 2005 7:38 pm
- Forum: Volume 4 (400-499)
- Topic: 499 - What's The Frequency, Kenneth?
- Replies: 93
- Views: 20770
499 WA
please help
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main()
{
string s;
char hej;
int i=0, k=0;
char maj[1000];
map<char, int> counter;
while(getline(cin,s))
{
for(int l=0; l<s.length();l++)
{
if(s[l]!=' ')
{
hej=s[l];
counter[hej]++;
}
}
for ...
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main()
{
string s;
char hej;
int i=0, k=0;
char maj[1000];
map<char, int> counter;
while(getline(cin,s))
{
for(int l=0; l<s.length();l++)
{
if(s[l]!=' ')
{
hej=s[l];
counter[hej]++;
}
}
for ...